int hash_key_to_bucket(const char* s, size_t len, int num_buckets)
{
- // We hash only the first 10 bytes; it should be enough to get a
- // reasonable spread, but also mostly miss the move, so that
- // same position + different move usually land in the same bucket.
- len = min<size_t>(len, 10);
+ len = min<size_t>(len, HASH_PREFIX_BYTES);
return util::Fingerprint32(s, len) % num_buckets;
}