Similar to CBloomFilter::Hash */
| 242 | |
| 243 | /* Similar to CBloomFilter::Hash */ |
| 244 | static inline uint32_t RollingBloomHash(unsigned int nHashNum, uint32_t nTweak, const std::vector<unsigned char>& vDataToHash) { |
| 245 | return MurmurHash3(nHashNum * 0xFBA4C795 + nTweak, vDataToHash); |
| 246 | } |
| 247 | |
| 248 | |
| 249 | // A replacement for x % n. This assumes that x and n are 32bit integers, and x is a uniformly random distributed 32bit value |
no test coverage detected