Files
nyc3/src
Martin Ankerl 9aac9f90d5 replace modulus with FastMod
Replaces the slow modulo operation with a much faster 32bit multiplication & shift. This works
because the hash should be uniformly distributed between 0 and 2^32-1. This speeds up the benchmark
by a factor of about 1.3:

RollingBloom, 5, 1500000, 3.73733, 4.97569e-07, 4.99002e-07, 4.98372e-07 # before
RollingBloom, 5, 1500000, 2.86842, 3.81630e-07, 3.83730e-07, 3.82473e-07 # FastMod

Be aware that this changes the position of the bits that are toggled, so this should probably
not be used for CBloomFilter which is serialized.
2018-05-06 13:55:33 +02:00
..
2018-02-16 08:59:28 -05:00
…
2017-09-29 16:02:39 +02:00
2018-02-10 09:55:54 -05:00
2018-03-06 21:52:53 +01:00
…
2018-03-21 11:57:57 +08:00
2018-05-06 13:55:33 +02:00
2018-02-11 10:48:15 +01:00
2018-03-06 19:52:19 +00:00
2018-03-06 19:52:19 +00:00
2018-03-13 17:04:31 -07:00
2018-04-16 13:24:14 -07:00
…
2018-03-13 17:04:31 -07:00
2018-01-23 13:16:56 -05:00
2018-04-26 15:33:11 +02:00
2018-04-09 09:18:49 +02:00
2018-03-14 23:10:39 -07:00
2018-04-16 13:24:14 -07:00
2018-04-16 13:24:14 -07:00
…
2018-03-21 08:34:44 +02:00
2018-04-27 16:09:59 -07:00
2018-03-06 20:28:08 -08:00