Function FastMod

src/bloom.cpp:252–254

A replacement for x % n. This assumes that x and n are 32bit integers, and x is a uniformly random distributed 32bit value which should be the case for a good hash. See https://lemire.me/blog/2016/06/27/a-fast-alternative-to-the-modulo-reduction/

// which should be the case for a good hash.
// See https://lemire.me/blog/2016/06/27/a-fast-alternative-to-the-modulo-reduction/
static inline uint32_t FastMod(uint32_t x, size_t n) {
    return ((uint64_t)x * (uint64_t)n) >> 32;
}

void CRollingBloomFilter::insert(const std::vector<unsigned char>& vKey)
{