lemire/fastrange
View on GitHub ↗ ★ 323 CMake
A fast alternative to the modulo reduction
5 mentions on Hacker News by 5 people: 2 stories, 3 comments · first 2016-12-12 · latest 2025-03-09
20082026
-
…at compile-time. Does fastrange[1] have fewer rejections due to any excess random bits[2]? [1] https://github.com/lemire/fastrange [2] https://github.com/swiftlang/swift/pull/39143
comment by aqrit · 2025-03-09 · in Constantly Divisionless Random Numbers -
▲ 1
A fast alternative to the modulo reductionstory by lldbg · 2021-01-14 · 0 comments
-
…but not a hash table. It’d be great for non-power-of-two tables while avoiding integer modulus. [0] https://github.com/lemire/fastrange
comment by stochastic_monk · 2018-06-16 · in Fibonacci Hashing: The Optimization That the World Forgot -
…fix that. (on modern compilers). Anyway, Lemire's fastrange modulo solved that problem better. https://github.com/lemire/fastrange There's no need for a slow modulo.
comment by rurban · 2017-02-27 · in I Wrote My Fastest Hashtable -
▲ 21
Fastrange: A fast alternative to the modulo reductionstory by henrikm85 · 2016-12-12 · 4 comments