bsl::unordered_map::unordered_map

Synopses

Declared in <bslstl_unorderedmap.h>

Create an empty unordered map.

unordered_map();

» more...

Create an unordered map as a copy of original.

unordered_map(unordered_map const& original);

» more...

Create an unordered map by moving from original.

unordered_map(BloombergLP::bslmf::MovableRef<unordered_map> original);

» more...

Create an empty unordered map using basicAllocator.

explicit
unordered_map(ALLOCATOR const& basicAllocator);

» more...

Create an empty unordered map with bucket count and allocator.

unordered_map(
    size_type initialNumBuckets,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map by moving from original using basicAllocator.

unordered_map(
    BloombergLP::bslmf::MovableRef<unordered_map> original,
    ALLOCATOR const& basicAllocator);

» more...

Create a copy of original using basicAllocator.

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

» more...

Create an unordered map from values using basicAllocator.

template<>
requires bsl::IsStdAllocator_v<ALLOCATOR>
unordered_map(
    std::initializer_list<value_type> values,
    ALLOCATOR const& basicAllocator);

» more...

Create an empty unordered map with hash and allocator.

unordered_map(
    size_type initialNumBuckets,
    HASH const& hashFunction,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map from values with bucket count and allocator.

template<>
requires bsl::IsStdAllocator_v<ALLOCATOR>
unordered_map(
    std::initializer_list<value_type> values,
    size_type initialNumBuckets,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map from [first, last)] using basicAllocator.

template<class INPUT_ITERATOR>
unordered_map(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map from range using basicAllocator.

template<class RANGE>
unordered_map(
    std::from_range_t tag,
    RANGE&& range,
    ALLOCATOR const& basicAllocator);

» more...

Create an empty unordered map.

explicit
unordered_map(
    size_type initialNumBuckets,
    HASH const& hashFunction = HASH(),
    EQUAL const& keyEqual = EQUAL(),
    ALLOCATOR const& basicAllocator = ALLOCATOR());

» more...

Create an unordered map from values with hash and allocator.

template<>
requires std::is_invocable_v<HASH, const KEY &> && bsl::IsStdAllocator_v<ALLOCATOR>
unordered_map(
    std::initializer_list<value_type> values,
    size_type initialNumBuckets,
    HASH const& hashFunction,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map from [first, last)] with bucket count.

template<class INPUT_ITERATOR>
unordered_map(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last,
    size_type initialNumBuckets,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map from range with bucket count and allocator.

template<class RANGE>
unordered_map(
    std::from_range_t tag,
    RANGE&& range,
    size_type initialNumBuckets,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map from the specified values initializer list.

template<>
requires std::is_invocable_v<HASH, const KEY &> && std::is_invocable_v<EQUAL, const KEY &, const KEY &> && bsl::IsStdAllocator_v<ALLOCATOR>
unordered_map(
    std::initializer_list<value_type> values,
    size_type initialNumBuckets = 0,
    HASH const& hashFunction = HASH(),
    EQUAL const& keyEqual = EQUAL(),
    ALLOCATOR const& basicAllocator = ALLOCATOR());

» more...

Create an unordered map from [first, last)] with hash and allocator.

template<class INPUT_ITERATOR>
unordered_map(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last,
    size_type initialNumBuckets,
    HASH const& hashFunction,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map from range with hash and allocator.

template<class RANGE>
unordered_map(
    std::from_range_t tag,
    RANGE&& range,
    size_type initialNumBuckets,
    HASH const& hashFunction,
    ALLOCATOR const& basicAllocator);

» more...

Create an unordered map from the iterator range [first, last)].

template<class INPUT_ITERATOR>
unordered_map(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last,
    size_type initialNumBuckets = 0,
    HASH const& hashFunction = HASH(),
    EQUAL const& keyEqual = EQUAL(),
    ALLOCATOR const& basicAllocator = ALLOCATOR());

» more...

Create an unordered map from the specified range.

template<class RANGE>
unordered_map(
    std::from_range_t tag,
    RANGE&& range,
    size_type initialNumBuckets = 0,
    HASH const& hashFunction = HASH(),
    EQUAL const& keyEqual = EQUAL(),
    ALLOCATOR const& basicAllocator = ALLOCATOR());

» more...