Re:Floating-Point Printing and Parsing Can Be Simple and Fast
by andrepd on Friday January 23, 2026 @05:58PM
(#46739151)
I implemented Teju Jaguá in Rust, based of the original C impl https://github.com/andrepd/teju-jagua-rs. Comparing to Zmij, I do wonder how much speedup is there on the core part of the algorithm (f2^e -> f10^e) vs on the printing part of the problem (f*10^e -> decimal string)! Benchmarks on my crate show a comparable amount of time spent on each of those parts.
[ Parent
| on HN ]
Re:Floating-Point Printing and Parsing Can Be Simple and Fast
by vitaut on Friday January 23, 2026 @10:27PM
(#46740777)
I don't have exact numbers but from measuring perf changes per commit it seemed that most improvements came from "printing" (e.g. switching to BCD and SIMD, branchless exponent output) and microoptimizations rather than algorithmic improvements.