Create a hash‐table having the same value (and maxLoadFactor) as the specified original object that uses the specified basicAllocator to supply memory. Use a copy of original.hasher() and a copy of original.comparator() to organize elements in this hash‐table. This method requires that the ValueType defined by the (template parameter) type KEY_CONFIG be move‐insertable into this hash‐table. Note that this hash‐table may have a different numBuckets than original, and a correspondingly different loadFactor, as long as maxLoadFactor is not exceeded.

Synopsis

Declared in <bslstl_hashtable.h>

HashTable(
    HashTable const& original,
    ALLOCATOR const& basicAllocator);

Created with MrDocs