Create an unordered multiset having the same value as the specified original object by moving (in constant time) the contents of original to the new unordered multiset. Use a copy of original.hash_function() to generate hash values for the keys contained in this unordered multiset. Use a copy of original.key_eq() to verify that two keys are equivalent. The allocator associated with original is propagated for use in the newly‐created unordered multiset. original is left in a valid but unspecified state.

Synopsis

Declared in <bslstl_unorderedmultiset.h>

Created with MrDocs