, including all inherited members.
allocator_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
at(const key_type &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
at(const key_type &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
begin() BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
begin(size_type index) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
begin() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
begin(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
bucket(const key_type &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
bucket_count() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
bucket_size(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
cbegin() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
cbegin(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
cend() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
cend(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
clear() BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
const_iterator typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
const_local_iterator typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
const_pointer typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
const_reference typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
count(const LOOKUP_KEY &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [inline] |
count(const key_type &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
difference_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
emplace(Args &&...args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
emplace_hint(const_iterator hint, Args &&...args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
empty() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
end() BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
end(size_type index) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
end() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
end(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
equal_range(const LOOKUP_KEY &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [inline] |
equal_range(const key_type &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
equal_range(const LOOKUP_KEY &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [inline] |
equal_range(const key_type &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
erase(const_iterator position) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
erase(iterator position) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
erase(const key_type &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
erase(const_iterator first, const_iterator last) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
find(const LOOKUP_KEY &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [inline] |
find(const key_type &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
find(const LOOKUP_KEY &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [inline] |
find(const key_type &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
get_allocator() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
hash_function() const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
hasher typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
insert(const value_type &value) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
insert(BSLS_COMPILERFEATURES_FORWARD_REF(ALT_VALUE_TYPE) value) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [inline] |
insert(const_iterator hint, const value_type &value) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
insert(const_iterator hint, BSLS_COMPILERFEATURES_FORWARD_REF(ALT_VALUE_TYPE) value) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [inline] |
insert(INPUT_ITERATOR first, INPUT_ITERATOR last) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
insert(std::initializer_list< value_type > values) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
insert_or_assign(const KEY &key, BDE_OTHER_TYPE &&obj) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
insert_or_assign(BloombergLP::bslmf::MovableRef< KEY > key, BDE_OTHER_TYPE &&obj) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
insert_or_assign(const_iterator hint, const KEY &key, BDE_OTHER_TYPE &&obj) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
insert_or_assign(const_iterator hint, BloombergLP::bslmf::MovableRef< KEY > key, BDE_OTHER_TYPE &&obj) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
iterator typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
key_eq() const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
key_equal typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
key_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
load_factor() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
local_iterator typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
mapped_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
max_bucket_count() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
max_load_factor(float newMaxLoadFactor) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
max_load_factor() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
max_size() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
operator=(const unordered_map &rhs) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
operator=(std::initializer_list< value_type > rhs) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
operator==(const unordered_map< KEY2, VALUE2, HASH2, EQUAL2, ALLOCATOR2 > &, const unordered_map< KEY2, VALUE2, HASH2, EQUAL2, ALLOCATOR2 > &) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [friend] |
operator[](const key_type &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
operator[](BloombergLP::bslmf::MovableRef< key_type > key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
pointer typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
reference typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
rehash(size_type numBuckets) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
reserve(size_type numElements) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
size() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
size_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
try_emplace | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
try_emplace(BloombergLP::bslmf::MovableRef< KEY > key, Args &&...args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
try_emplace(const_iterator hint, const KEY &key, Args &&...args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
try_emplace(const_iterator hint, BloombergLP::bslmf::MovableRef< KEY > key, Args &&...args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(size_type initialNumBuckets, const HASH &hashFunction=HASH(), const EQUAL &keyEqual=EQUAL(), const ALLOCATOR &basicAllocator=ALLOCATOR()) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [explicit] |
unordered_map(size_type initialNumBuckets, const HASH &hashFunction, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(size_type initialNumBuckets, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | [explicit] |
unordered_map() | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(INPUT_ITERATOR first, INPUT_ITERATOR last, size_type initialNumBuckets=0, const HASH &hashFunction=HASH(), const EQUAL &keyEqual=EQUAL(), const ALLOCATOR &basicAllocator=ALLOCATOR()) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(INPUT_ITERATOR first, INPUT_ITERATOR last, size_type initialNumBuckets, const HASH &hashFunction, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(INPUT_ITERATOR first, INPUT_ITERATOR last, size_type initialNumBuckets, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(INPUT_ITERATOR first, INPUT_ITERATOR last, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(std::initializer_list< value_type > values, size_type initialNumBuckets=0, const HASH &hashFunction=HASH(), const EQUAL &keyEqual=EQUAL(), const ALLOCATOR &basicAllocator=ALLOCATOR()) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(std::initializer_list< value_type > values, size_type initialNumBuckets, const HASH &hashFunction, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(std::initializer_list< value_type > values, size_type initialNumBuckets, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(std::initializer_list< value_type > values, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(const unordered_map &original) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(const unordered_map &original, const typename type_identity< ALLOCATOR >::type &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(BloombergLP::bslmf::MovableRef< unordered_map > original) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
unordered_map(BloombergLP::bslmf::MovableRef< unordered_map > original, const typename type_identity< ALLOCATOR >::type &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
value_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
~unordered_map() | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |