Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
If two keys for a std::unordered_map have the same hash value, is it guaranteed by the standard that they will go into the same bucket? We are assuming that the keys are not equal according to the template equality predicate, they only have the same hash value.
Bonus question: If same hash does not imply same bucket, then what is the purpose of being able to traverse buckets individually?
Objects with the same hash are put into the same bucket by unordered associative containers. Consequently, two equal objects must have the same hash.
23.2.5 paragraph 8:
Bonus question: Why might you want to traverse buckets individually?
Bonus answer: Because you want to process the container’s contents in parallel. The bucket iterators are independent of each other, so each thread can process a bucket without co-ordination (provided no new entries are added to the container). And the buckets should be roughly the same size, so they provide a convenient parallelisation quantum.