bugfix-66

25 ms·

1. 211.▲
   by bugfix-66 4y ago

   Agreed, but commenter said "Call it perfect and HN will destroy it".
2. 212.▲
   by bugfix-66 4y ago

   “Perfection is achieved, not when there is nothing more to add, but when there is nothing left to take away." Destroy it: https://BUGFIX-66.com Single CPU Linode cloud instance ($5 per month), single Go executable generat
3. 213.▲
   by bugfix-66 4y ago

   Portability? Are you saying Go has portability problems? Can you elaborate on that very surprising claim?
4. 214.▲
   by bugfix-66 4y ago

   I don't know if you've read the benchmark code from The Benchmark Game, but anyone who has looked at the code takes those results with a grain of salt, or discards them entirely. For example, the C/C++ implementations use are
5. 215.▲
   by bugfix-66 4y ago

   For example, I work at a company (a company you hear about daily here on Hacker News) that has a compiler generating linear algebra kernels. The compiler is a huge assemblage of C++ templates, stitched together with a little Python. The gen
6. 216.▲
   by bugfix-66 4y ago

   Sure, you can always find extremely constrained, embedded, or real-time safety-critical applications where only a carefully chosen subset of C is applicable. You shouldn't be using the sprawling C++20 there, either. But for pretty much
7. 217.▲
   by bugfix-66 4y ago

   See my comment elsewhere in this thread, where I argue that Go is a good replacement for C/C++ for almost all purposes.
8. 218.▲
   by bugfix-66 4y ago

   Go's garbage collector is faster than you imagine. Have you used it? Go is a good replacement for C and C++ for almost all purposes. Most purposes where Go is inapplicable should be using explicit SIMD (GCC intrinsics) or CUDA C anyway
9. 219.▲
   by bugfix-66 4y ago

   Replace at = root with at = next[root] and you're done. Once you understand the forward transform, you understand that root is the LAST byte and next[root] is the FIRST byte. All the fixes in BUGFIX-66 are trivial if you
10. 220.▲
    by bugfix-66 4y ago

    Thanks. I just recently started building it. Understanding small, elegant algorithms (enough to make tiny fixes) is something I consider fun. Hopefully it's fun for others. Imagine the book Hacker's Delight, but turned into a simp
11. 221.▲
    by bugfix-66 4y ago

    Explained here with Go code: https://bugfix-66.com/7f0f425d3eee8def16e1102d054fd45394d027... Wikipedia gives an impractical, inefficient account of the algorithm. It's almost comically bad. But the BWT has an efficient