3 ms·
Switching from hash table to B-tree is another example of something Rust is good at and Go 1.10 wasn't, so I'd call it a fair part of the comparison. That versi
by scottlamb 5y ago
Switching from hash table to B-tree is another example of something Rust is good at and Go 1.10 wasn't, so I'd call it a fair part of the comparison. That version of Go doesn't have generics, so you're stuck with the builtin hash tables, reflection, or code duplication/generation. (Also, I'm reading the post correctly, this switch was included in the first set of graphs that he called "roughly comparable").
I've never seen a "we switched program $X from language $Y to language $Z" post that reproduced exactly the same program, and I don't think it's reasonable to expect that. This one doesn't seem to have done anything crazy like a completely different algorithm, SIMD intrinsics replacing naive code, etc. (The Game's programs actually are that different, so I don't like that study at all.)
- igouy 5y ago> SIMD intrinsics replacing naive code The programs that use SIMD intrinsics are split-out: https://benchmarksgame-team.pages.debian.net/benchmarksgame/performance/nbody.html#below https://benchmarksgame-team.pages.debian.net/benchmarksgame/...