Create a hash‐table having the same value (and maxLoadFactor) as the specified original object by moving (in constant time) the contents of original to the new hash‐table. Use a copy of original.hasher() and a copy of original.comparator() to organize elements in this hash‐table. The allocator associated with original is propagated for use in the newly created hash‐table. original is left in a valid but unspecified state.

Synopsis

Declared in <bslstl_hashtable.h>

Created with MrDocs