Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
chowells
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
46 ms
·
601.
▲
by
chowells
5y ago
This article correctly notices at the very start that asking this question is of no value in resolving the current situation. Then the author seems to think they've uncovered a massive secret instead of continuing the thought. Who want
602.
▲
by
chowells
5y ago
Why is that hard to see? With a lot of simplification about "good" and "bad" candidates... It's the natural outcome of there being a very small group of bad candidates who apply for a lot of jobs, and a very large
603.
▲
by
chowells
5y ago
It's a misspelling of IOCCC - international obfuscated C coding competition.
604.
▲
by
chowells
5y ago
Many people lack the cold-bloodedness necessary to be that mercenary. Especially game devs, who are almost always in it for the love of the product, not for a paycheck. Corporate may not be their friend, but the product they're creatin
605.
▲
by
chowells
5y ago
Yeah, I was grumpy. I took a nap and came back 6 hours later and went "that wasn't fair, I should remove that last line"... But the option to edit was gone.
606.
▲
by
chowells
5y ago
Most performance wins from UB come from removing code that someone wrote intentionally. If that code wasn't meant to be run, it shouldn't be written. If it was written, it should be run. Now obviously there are lots of counter-exa
607.
▲
by
chowells
5y ago
The paper starts with "cats have been observed to do this thing, which we will take advantage of for an experiment on how cats perceive the world." The actual test is whether cats perceive a certain type of visual illusion. The te
608.
▲
by
chowells
5y ago
Ok, you're annoyed at rude people. That's fair. Rude people are maddening. But that's not what the XY problem is about. There is no case where "you should have bought a Toyota" is a valid response to "how do I
609.
▲
by
chowells
5y ago
This is not a good approach. For the typical person asking a question, you waste their time at best. At worst, they actually use your solution to Y and ignore why it's bad. Both of those are significantly worse than clarifying the prob
610.
▲
by
chowells
5y ago
There are a few people who frequently have this complaint, but I don't think it's a real problem. If you actually need to do Y in a situation where most people who think they need to do Y are wrong, it's not everyone else
611.
▲
by
chowells
5y ago
Is the culture war the thing where over 120 studies found it had no value over placebo? Weird name for it, but yeah. Hydroxy chloroquine was found to be totally ineffective in 95% of studies. That's exactly as you'd expect with a
612.
▲
by
chowells
6y ago
Well, you've demonstrated that memory addresses aren't that hard. But you've also demonstrated how easy it is to get undefined behavior in C programs. C's pointers aren't memory addresses. Ok, they tend to be repres
613.
▲
by
chowells
6y ago
If you already know the algorithms, sure. The thing about reversing a binary tree is that no one already knows the algorithm. It's not something you'll find in any textbook. It has no intrinsic meaning, so why would it be there? T
614.
▲
by
chowells
6y ago
Reversing a binary tree isn't some crazy algorithmic knowledge. I'm concerned that so many people here think it is. What's gone wrong that makes people think reversing a binary tree is up there with hand-coding machine learni
615.
▲
by
chowells
6y ago
I like the idea here, but it's a lot further from Haskell than the author implies. IO expressions in Haskell are values , and that's really important to understand what's going on. It's the reason why things like `time
616.
▲
by
chowells
6y ago
Yeah, that was the part that stood out to me as well. I thought it was pretty intuitively obvious that having your data races confined to small segments is better than allowing them to be spread over the entire codebase, but a lot of peopl
617.
▲
by
chowells
6y ago
People have realized you can't just put your head down and assume the rest of the world is going to do the right thing, because it won't. If that's all you do, you're going to get overrun by organized bad actors. And not
618.
▲
by
chowells
6y ago
I'm not sure how you arrived at that conclusion. Does having to pee in a bottle sound more like "having your humanity denied" or "having your money denied"? What about the actual example from the GP, having your sto
619.
▲
by
chowells
6y ago
One denies you money. The other denies you dignity and humanity. You're right that it's not even close, but I suspect you've got the analysis backwards.
620.
▲
by
chowells
6y ago
It's worth expanding on that observation a bit. What makes encryption "perfect"? This is not obvious, so I'll just skip ahead to the conclusion: encryption is perfect when it's impossible to distinguish which candid
621.
▲
by
chowells
6y ago
> There are very few people that take stuff like "The Elements of Style" seriously. That's because it's garbage. Learning to write is great. But that is best done by reading good writing and practicing. A list of rule
622.
▲
by
chowells
6y ago
https://en.wikipedia.org/wiki/Refinement_type That idea was neatly generalized 30 years ago. So expect it to start showing up as the hot new thing in another 20.
623.
▲
by
chowells
6y ago
uu-parsinglib and Earley are interesting points in the space. The former[1] is monadic rather than Applicative, but it has a lot of interesting properties related to error correction and producing online results. Sometimes it feels magical
624.
▲
by
chowells
6y ago
Very, very few parsers need to handle multiple gigabyte inputs. For those, sure, focus on performance first. Your tools should always be suited to your problem. None of that changes the fact that Parsec-like designs are especially obnoxious
625.
▲
by
chowells
6y ago
The original question was about "recursive descent". You keep talking about "functional recursion". These are not the same words, nor do they mean the same thing. I do not understand your underlying question, or what poi
626.
▲
by
chowells
6y ago
Yes, but that isn't saying much. It's basically the same as saying "they're all assembly instructions when they're sent to the CPU". Functional recursion is just looping. "Recursive Descent" is a ver
627.
▲
by
chowells
6y ago
Attoparsec and megaparsec don't backtrack. They hard commit to choices and never reconsider them after having done so. Let's say I want to match the strings "a" or "aa" followed by "ab". Let's ju
628.
▲
by
chowells
6y ago
No. The other answer is also correct, that it's Yes. In other words, the question is wrong. Applicative parser combinators are an interface. The backing implementation is pretty open. It might be recursive descent. It might be the Earl
629.
▲
by
chowells
6y ago
Every fighting game is designed for offline play, and has been for 25+ years. But that doesn't mean that's where the majority of players are, and that's the point the author is making.
630.
▲
by
chowells
6y ago
The median age doesn't contradict the above model at all. What it tells you is that of the developers employed in the game industry at any given time , half of them are under 31. But it doesn't say a thing about the churn below t
More ›