constantly divisionless random numbers

https://dotat.at/@/2025-03-05-lemire-inline.html Last year I wrote about inlining just the fast path of Lemire's algorithm for nearly-divisionless unbiased bounded random numbers . The idea was to reduce code bloat by eliminating lots of copies of the random number generator in the rarely-executed slow paths. However a simple split prevented the compiler from being able to optimize cases like…