[#BloombergLP-bslstl-HashTable-09-2constructor-0d]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslstl.adoc[bslstl]::xref:BloombergLP/bslstl/HashTable-09.adoc[HashTable<UnorderedMapKeyConfiguration<basic_string<char> const, pair<basic_string<char> const, Json>>, TransparentHash, TransparentEqualTo, allocator<pair<basic_string<char> const, Json>>>]::HashTable
:relfileprefix: ../../../
:mrdocs:

Create a hash‐table having the same value (and `maxLoadFactor`) as the specified `original` object. Use a copy of `original.hasher()` and a copy of `original.comparator()` to organize elements in this hash‐table. Use the allocator returned by 'bsl::allocator_traits<ALLOCATOR>:: select_on_container_copy_construction(original.allocator())' to allocate memory. This method requires that the `ValueType` defined by the (template parameter) type `KEY_CONFIG` be `copy‐insertable` into this hash‐table (see '{Requirements on `KEY_CONFIG`}). Note that this hash‐table may have fewer buckets than `original`, and a correspondingly higher `loadFactor`, so long as `maxLoadFactor` is not exceeded. Also note that the created 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>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
HashTable(xref:BloombergLP/bslstl/HashTable-06.adoc[HashTable<UnorderedMapKeyConfiguration<basic_string<char> const, pair<basic_string<char> const, Json>>, TransparentHash, TransparentEqualTo, allocator<pair<basic_string<char> const, Json>>>] const& original);
----


[.small]#Created with https://www.mrdocs.com[MrDocs]#