Create an unordered map from [first, last)] with hash and allocator.
Declared in <bslstl_unorderedmap.h>
template<class INPUT_ITERATOR>
unordered_map(
INPUT_ITERATOR first,
INPUT_ITERATOR last,
size_type initialNumBuckets,
HASH const& hashFunction,
ALLOCATOR const& basicAllocator);
Same as the preceding overload.
| Name | Description |
|---|---|
| first | start of the range |
| last | end of the range (one past last) |
| initialNumBuckets | initial number of buckets |
| hashFunction | hash functor |
| basicAllocator | allocator used to supply memory |