// 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 = max<size_t>(len, 10);
+ len = min<size_t>(len, 10);
return util::Fingerprint32(s, len) % num_buckets;
}