c++ unordered_map collision handling , resize and rehash

Question

I have not read the C++ standard but this is how I feel that the unordered_map of c++ suppose to work.

• Allocate a memory block in the heap.
• With every p

Answer 1

std::unordered_map contains a load factor that it uses to manage the size of it's internal buckets. std::unordered_map uses this odd factor to keep the size of the container somewhere in between a 0.0 and 1.0 factor. This decreases the likelihood of a collision in a bucket. After that, I'm not sure if they fallback to linear probing within a bucket that a collision was found in, but I would assume so.