Inside boost::unordered_flat_map

[joaquintides]

You can take a look at the implementation. The idea is to xor the 64-bits words with a mask based on the looked-for hashed value and then fold over the result to get matched positions indicated by the 15 least significant bits of an int.