| allocator_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
| at(const key_type &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inline |
| begin(size_type index) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| begin() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| begin(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| bucket(const key_type &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| bucket_count() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| bucket_size(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| cbegin() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| cbegin(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| cend() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| cend(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| clear() BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | |
| contains(const key_type &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| contains(const LOOKUP_KEY &key) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inline |
| difference_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
| emplace(Args &&... args) | 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 > | inline |
| end() BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| end(size_type index) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| end() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| end(size_type index) const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inline |
| erase(iterator position) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inline |
| 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 > | inline |
| get_allocator() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| hash_function() const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| hasher typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
| insert(const value_type &value) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inline |
| 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_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 > | |
| 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 > | |
| iterator typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
| key_eq() const | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inline |
| 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 > | inline |
| max_load_factor(float newMaxLoadFactor) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| max_load_factor() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| max_size() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| operator=(const unordered_map &rhs) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| operator== | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | friend |
| operator[](const key_type &key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| operator[](BloombergLP::bslmf::MovableRef< key_type > key) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inline |
| reserve(size_type numElements) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| size() const BSLS_KEYWORD_NOEXCEPT | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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(LOOKUP_KEY &&key, Args &&... args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | |
| try_emplace(const_iterator hint, LOOKUP_KEY &&key, Args &&... args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| try_emplace(const KEY &key, Args &&... args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| try_emplace(BloombergLP::bslmf::MovableRef< KEY > key, Args &&... args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| try_emplace(const_iterator hint, const KEY &key, Args &&... args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| try_emplace(const_iterator hint, BloombergLP::bslmf::MovableRef< KEY > key, Args &&... args) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inlineexplicit |
| unordered_map(size_type initialNumBuckets, const HASH &hashFunction, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| unordered_map(size_type initialNumBuckets, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| unordered_map(const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inlineexplicit |
| unordered_map() | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| 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 > | inline |
| 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 > | inline |
| unordered_map(INPUT_ITERATOR first, INPUT_ITERATOR last, size_type initialNumBuckets, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| unordered_map(INPUT_ITERATOR first, INPUT_ITERATOR last, const ALLOCATOR &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| unordered_map(const unordered_map &original) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| unordered_map(const unordered_map &original, const typename type_identity< ALLOCATOR >::type &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| unordered_map(BloombergLP::bslmf::MovableRef< unordered_map > original) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| unordered_map(BloombergLP::bslmf::MovableRef< unordered_map > original, const typename type_identity< ALLOCATOR >::type &basicAllocator) | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
| value_type typedef | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | |
| ~unordered_map() | bsl::unordered_map< KEY, VALUE, HASH, EQUAL, ALLOCATOR > | inline |
1.9.8