rsc

17 ms·

151.
by rsc 7y ago
> Rot in hell forever, Josh. And take your Effective Java with you to throw on the pyre. Well that seems uncalled for.
152.
by rsc 7y ago
The crossword ran on election day. The clue for the big across line was something like "headline tomorrow" and the crossing clues worked equally well to match "CLINTON ELECTED" and "BOBDOLE ELECTED". For exampl
153.
by rsc 7y ago
FWIW, I wrote a short response here: https://twitter.com/_rsc/status/1146128393542492160 I want to flag especially that there is not, nor has there ever been, a plan to "push this through". People consis
154.
by rsc 7y ago
Turing machines and Turing incompleteness are utterly fundamental to computer science theory. He is rightly up there with Church and Godel for kicking off a proper analysis of what computers can and cannot do. (And then of course the Turing
155.
by rsc 8y ago
It's a terrible interview question, not least because I spent however long writing 4 pages about it and still don't know what it is. :-) But it's not made up: this comes up in a real system and I would like to know more about
156.
by rsc 8y ago
I agree, this is a great representation - I think of it as the heap ordering - but it assumes a fixed-height tree. For my use case, I want to overlay increasingly large trees (with leaves appended to the right side) to a linear array, so he
157.
by rsc 8y ago
You're right, I oversimplified that. But having a "ResultErrorType" is not really context, not by itself. The interesting context would be additional fields recorded in that type.
158.
by rsc 8y ago
If you are interested in learning why check-handle differs from traditional exception handling, you can read https://go.googlesource.com/proposal/+/master/design/go2draf... . If you just feel like snarkin
159.
by rsc 8y ago
Starting at the link above, click on the #21915 in the commit message, which takes you to https://golang.org/issue/21915 .
160.
by rsc 9y ago
I see you posted this at least three different places. I replied to one of the copies on my blog. :-)
161.
by rsc 9y ago
Sorry, maybe generics next.
162.
by rsc 9y ago
We do reject version pinning. There is no way to pin a particular version. The only constraint you can express is ">= this specific version". If nothing else pushes it forward, though, you'll keep getting that specific ver
163.
by rsc 9y ago
Hi. As I said in that page, I do know that cargo is working as designed, and that "0.4.1" is the same as "^0.4.1". My point is maybe a little more subtle, that cargo takes the newest allowed under the constraints, so giv
164.
by rsc 9y ago
Thanks for this. Will followup on email.
165.
by rsc 9y ago
Have you actually used Go 1's goto? There's not a lot it can actually do. It's there for generated code state machines, and that's almost all it's good for. But yes, goto will stay in the absence of a very compellin
166.
by rsc 9y ago
It absolutely does, and thank you. (I thought you might be here so I could thank you in person.)
167.
by rsc 9y ago
I think you're mostly right. Doesn't it make sense then to ask for help correcting that bias?
168.
by rsc 9y ago
The second half of the "Introduction" section of the blog post explains what "done" meant and why.
169.
by rsc 9y ago
And if you _do_ want to assign blame, it's fine to put it on us. I did as much in the talk: "Just as we at Google did not at first understand the significance of handling leap second time resets correctly, we did not effectively c
170.
by rsc 9y ago
FWIW I think this is a fair criticism. We've had so much help from the Go community, not just for those two issues but also for essentially all the work we've done since the release in 2009. Go simply wouldn't exist without t
171.
by rsc 9y ago
> It's generally the opinion of the Go community that map, reduce and filter are bad ideas due to how easily they are abused. There is a germ of truth here - sometimes list comprehensions make code harder to understand than if you j
172.
by rsc 9y ago
FWIW I have Liskov and Guttag (1986) on my desk. I haven't forgotten. I also explicitly address the "several since those days" in https://research.swtch.com/go2017#generics .
173.
by rsc 9y ago
Yes it does.
174.
by rsc 9y ago
More discussion at https://research.swtch.com/glob#comment-3272455315
175.
by rsc 9y ago
In addition to what JdeBP said about the semantics of question marks, there's always the option of using a proper automata translation (or translation to a regexp with a suitable underlying engine). Neither of those require backtrackin
176.
by rsc 9y ago
Reversing a regular expression and reversing a glob are about the same: you just flip everything around and you're done. In fact RE2 uses this fact to speed up regexp searches. See https://swtch.com/~rsc/regexp&#x2
177.
by rsc 9y ago
Scanning for fixed non-pattern strings would help this example. It wouldn't help the general case (which is to say, it wouldn't help always), whereas a better algorithm would.
178.
by rsc 9y ago
It would help this example. It wouldn't help the general case.
179.
by rsc 9y ago
You're welcome. I think basically all of RE2 is underdocumented and underpromoted. Why should RE2::Set be any different? Seriously, though, it was a bit of an afterthought. A team at Google was |ing together a ton of regexps and came t
180.
by rsc 9y ago
Empirically, Perl's glob does not call the system glob. On my Linux system Perl (5.18.2) is slow but the system glob is fast. Create a file named /tmp/glob/$(perl -e 'print "a"x100') in an otherwise e

More ›