# std::unordered_map

From cppreference.com
< cpp‎ | container

Defined in header `<unordered_map>` |  |
template< class Key, class T, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator< std::pair<const Key, T> > > class unordered_map; | (1) | (since C++11)
namespace pmr { template <class Key, class T, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>> using unordered_map = std::unordered_map<Key, T, Hash, Pred, std::pmr::polymorphic_allocator<std::pair<const Key,T>>>; } | (2) | (since C++17)

Unordered map is an associative container that contains key-value pairs with unique keys. Search, insertion, and removal of elements have average constant-time complexity.

Internally, the elements are not sorted in any particular order, but organized into buckets. Which bucket an element is placed into depends entirely on the hash of its key. This allows fast access to individual elements, since once the hash is computed, it refers to the exact bucket the element is placed into.

`std::unordered_map` meets the requirements of Container, AllocatorAwareContainer, UnorderedAssociativeContainer.

### Iterator invalidation

Operations | Invalidated
--- | ---
All read only operations, swap, std::swap | Never
clear, rehash, reserve, operator= | Always
insert, emplace, emplace_hint, operator[] | Only if causes rehash
erase | Only to the element erased

#### Notes

- The swap functions do not invalidate any of the iterators inside the container, but they do invalidate the iterator marking the end of the swap region.

- References and pointers to either key or data stored in the container are only invalidated by erasing that element, even when the corresponding iterator is invalidated.

### Member types

Member type | Definition
`key_type` | `Key`
`mapped_type` | `T`
`value_type` | std::pair<const Key, T>
`size_type` | Unsigned integer type (usually std::size_t)
`difference_type` | Signed integer type (usually std::ptrdiff_t)
`hasher` | `Hash`
`key_equal` |
`KeyEqual` | (until C++20)
`Hash::transparent_key_equal` if defined and names a type, otherwise `KeyEqual` | (since C++20)
`allocator_type` | `Allocator`
`reference` | `value_type&`
`const_reference` | `const value_type&`
`pointer` | std::allocator_traits<Allocator>::pointer
`const_pointer` | std::allocator_traits<Allocator>::const_pointer
`iterator` | LegacyForwardIterator
`const_iterator` | Constant LegacyForwardIterator
`local_iterator` | An iterator type whose category, value, difference, pointer and reference types are the same as `iterator`. This iterator can be used to iterate through a single bucket but not across buckets
`const_local_iterator` | An iterator type whose category, value, difference, pointer and reference types are the same as `const_iterator`. This iterator can be used to iterate through a single bucket but not across buckets
`node_type`(since C++17) | a specialization of node handle representing a container node
`insert_return_type`(since C++17) | type describing the result of inserting a `node_type`, a specialization of
    template <class Iter, class NodeType> struct /*unspecified*/ {
        Iter     position;
        bool     inserted;
        NodeType node;
    };
instantiated with template arguments `iterator` and `node_type`.

### Member functions

(constructor) | constructs the `unordered_map` (public member function)
(destructor) | destructs the `unordered_map` (public member function)
operator= | assigns values to the container (public member function)
get_allocator | returns the associated allocator (public member function)
##### Iterators
begin cbegin | returns an iterator to the beginning (public member function)
end cend | returns an iterator to the end (public member function)
##### Capacity
empty | checks whether the container is empty (public member function)
size | returns the number of elements (public member function)
max_size | returns the maximum possible number of elements (public member function)
##### Modifiers
clear | clears the contents (public member function)
insert | inserts elements or nodes (since C++17) (public member function)
insert_or_assign (C++17) | inserts an element or assigns to the current element if the key already exists (public member function)
emplace | constructs element in-place (public member function)
emplace_hint | constructs elements in-place using a hint (public member function)
try_emplace (C++17) | inserts in-place if the key does not exist, does nothing if the key exists (public member function)
erase | erases elements (public member function)
swap | swaps the contents (public member function)
extract (C++17) | extracts nodes from the container (public member function)
merge (C++17) | splices nodes from another container (public member function)
##### Lookup
at | access specified element with bounds checking (public member function)
operator[] | access or insert specified element (public member function)
count | returns the number of elements matching specific key (public member function)
find | finds element with specific key (public member function)
contains (C++20) | checks if the container contains element with specific key (public member function)
equal_range | returns range of elements matching a specific key (public member function)
##### Bucket interface
begin(size_type) cbegin(size_type) | returns an iterator to the beginning of the specified bucket (public member function)
end(size_type) cend(size_type) | returns an iterator to the end of the specified bucket (public member function)
bucket_count | returns the number of buckets (public member function)
max_bucket_count | returns the maximum number of buckets (public member function)
bucket_size | returns the number of elements in specific bucket (public member function)
bucket | returns the bucket for specific key (public member function)
##### Hash policy
load_factor | returns average number of elements per bucket (public member function)
max_load_factor | manages maximum average number of elements per bucket (public member function)
rehash | reserves at least the specified number of buckets. This regenerates the hash table. (public member function)
reserve | reserves space for at least the specified number of elements. This regenerates the hash table. (public member function)
##### Observers
hash_function | returns function used to hash the keys (public member function)
key_eq | returns the function used to compare keys for equality (public member function)

### Non-member functions

operator==operator!= | compares the values in the unordered_map (function template)
std::swap(std::unordered_map) (C++11) | specializes the std::swap algorithm (function template)
erase_if(std::unordered_map) (C++20) | Erases all elements satisfying specific criteria (function template)

### Deduction guides(since C++17)

### Example

Run this code

    #include <iostream>
    #include <string>
    #include <unordered_map>

    int main()
    {
        // Create an unordered_map of three strings (that map to strings)
        std::unordered_map<std::string, std::string> u = {
            {"RED","#FF0000"},
            {"GREEN","#00FF00"},
            {"BLUE","#0000FF"}
        };

        // Iterate and print keys and values of unordered_map
        for( const auto& n : u ) {
            std::cout << "Key:[" << n.first << "] Value:[" << n.second << "]\n";
        }

        // Add two new entries to the unordered_map
        u["BLACK"] = "#000000";
        u["WHITE"] = "#FFFFFF";

        // Output values by key
        std::cout << "The HEX of color RED is:[" << u["RED"] << "]\n";
        std::cout << "The HEX of color BLACK is:[" << u["BLACK"] << "]\n";

        return 0;
    }

Output:

    Key:[RED] Value:[#FF0000]
    Key:[BLUE] Value:[#0000FF]
    Key:[GREEN] Value:[#00FF00]
    The HEX of color RED is:[#FF0000]
    The HEX of color BLACK is:[#000000]

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/unordered_map&oldid=107669"