sapiogram

7 ms·

331.
by sapiogram 3y ago
> You have to allocate a closure That's incorrect, a closure in Rust compiles down to a static function that takes its environment as an argument. None of that requires a heap allocation in the above code.
332.
by sapiogram 3y ago
+1. In terms of development speed, Node + Axios is lightyears ahead. It's like 5 lines of code to send a JSON payload via http, vs 15+ in Go. The Javascript version is much likely to be correct as well, since it doesn't let you fo
333.
by sapiogram 3y ago
Have they actually agreed on how to fix this now?
334.
by sapiogram 4y ago
That's USCF ratings, chess.com ratings are massively inflated in comparison.
335.
by sapiogram 4y ago
You realize that 99.999% uptime is 6 minutes of downtime a year? How is your internet even that stable? And do you never restart the machine?
336.
by sapiogram 4y ago
If false sharing is truly the bottleneck in your code, can't you just make sure the lock reserves the entire cache line? Each core still needs to fetch from L3 cache to grab the lock itself, but that's roughly the same cost as a c
337.
by sapiogram 4y ago
> Slower than short allocations in V8 or Go Slower than V8, definitely possible. Slower than Go, very unlikely, since it doesn't have a generational or compacting gc.
338.
by sapiogram 4y ago
Pseudoscience feels like the wrong label, because it's not trying to be science. To me, it's clearly just an opinion post based on his personal experience.
339.
by sapiogram 4y ago
Why is sizeof a terrible keyword? Just think of it as an operator rather than a function.
340.
by sapiogram 4y ago
Stockfish is the state of the art for its particular use case. General-purpose hash table are completely irrelevant, they'll never be able to compete on performance. Specific things Stockfish can assume: * The table doesn't need
341.
by sapiogram 12y ago
> immigrant, noun. > 1. A person who leaves one country to settle permanently in another. I think he knows exactly what "immigrants" means.
342.
by sapiogram 12y ago
> improved support for multi-gigabyte heaps I've heard this thrown around before, but what this actually mean? Is it just some optimizations to the garbage collector?