2 ms·
https://github.com/andrepd/posit-rust https://github.com/andrepd/posit-rust LLVM codegen has been almost always sufficient, but for a routine that essentially
by andrepd 11mo ago
https://github.com/andrepd/posit-rust https://github.com/andrepd/posit-rust
LLVM codegen has been almost always sufficient, but for a routine that essentially amounts to adding two fixed-size bigints (e.g. 1024-bit ints represented as `[u64; 16]`), codegen was very very bad.
Writing a jump table by hand literally made the code 3× faster :)