Tony Finch d20ea4a703 Make isc_random_uniform() nearly divisionless ... It used to require two 32-bit integer divisions to get a random number less than some limit. Now we use Daniel Lemire's "nearly-divisionless" algorithm for unbiased bounded random numbers, which requires one 64-bit integer multiply in the usual case, and one 32-bit integer division in rare slow cases. Even the slow cases are faster than before; there are also fewer branches. I think this algorithm is exceptionally beautiful. It also has more clever tricks than lines of code, so I have done my best to explain how it works.		2022-04-22 16:40:37 +01:00
..
isc	Make isc_random_uniform() nearly divisionless	2022-04-22 16:40:37 +01:00
.clang-format	Add separate .clang-format files for headers	2020-02-14 09:31:05 +01:00