Normalized keys have non0-random bits. Bits need to be propagated up to make a tag byte and down so that non-lowest bits of normalized key affect the hash table index.
| 552 | // up to make a tag byte and down so that non-lowest bits of |
| 553 | // normalized key affect the hash table index. |
| 554 | inline uint64_t mixNormalizedKey(uint64_t k, uint8_t bits) { |
| 555 | return folly::hasher<uint64_t>()(k); |
| 556 | } |
| 557 | |
| 558 | void populateNormalizedKeys(HashLookup& lookup, int8_t sizeBits) { |
| 559 | lookup.normalizedKeys.resize(lookup.rows.back() + 1); |
no outgoing calls
no test coverage detected