Difference between revisions of "cpp/container/unordered map"
m (Add "See also" section to bottom) |
m (→Member types: ~Type) |
||
(43 intermediate revisions by 17 users not shown) | |||
Line 3: | Line 3: | ||
{{dcl begin}} | {{dcl begin}} | ||
{{dcl header|unordered_map}} | {{dcl header|unordered_map}} | ||
− | {{dcl|num=1 | + | {{dcl|num=1|since=c++11|1= |
template< | template< | ||
class Key, | class Key, | ||
class T, | class T, | ||
− | class Hash | + | class Hash = std::hash<Key>, |
− | class KeyEqual | + | class KeyEqual = std::equal_to<Key>, |
− | class Allocator | + | class Allocator = std::allocator<std::pair<const Key, T>> |
> class unordered_map; | > class unordered_map; | ||
}} | }} | ||
{{dcl|num=2|since=c++17|1= | {{dcl|num=2|since=c++17|1= | ||
namespace pmr { | namespace pmr { | ||
− | template <class Key, | + | template< |
− | + | class Key, | |
− | + | class T, | |
− | + | class Hash = std::hash<Key>, | |
− | using unordered_map = std::unordered_map<Key, T, Hash, | + | class KeyEqual = std::equal_to<Key> |
− | + | > using unordered_map = | |
+ | std::unordered_map<Key, T, Hash, KeyEqual, | ||
+ | std::pmr::polymorphic_allocator<std::pair<const Key, T>>>; | ||
} | } | ||
}} | }} | ||
{{dcl end}} | {{dcl end}} | ||
− | + | {{tt|std::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. Keys with the same hash code appear in the same bucket. This allows fast access to individual elements, since once the hash is computed, it refers to the exact bucket the element is placed into. | 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. Keys with the same hash code appear in the same bucket. This allows fast access to individual elements, since once the hash is computed, it refers to the exact bucket the element is placed into. | ||
+ | |||
+ | Two keys are considered ''equivalent'' if the map's key equality predicate returns true when passed those keys. If two keys are equivalent, the hash function must return the same value for both keys. | ||
{{tt|std::unordered_map}} meets the requirements of {{named req|Container}}, {{named req|AllocatorAwareContainer}}, {{named req|UnorderedAssociativeContainer}}. | {{tt|std::unordered_map}} meets the requirements of {{named req|Container}}, {{named req|AllocatorAwareContainer}}, {{named req|UnorderedAssociativeContainer}}. | ||
===Iterator invalidation=== | ===Iterator invalidation=== | ||
− | + | {|class="dsctable" style="font-size:1.0em" | |
− | {| class="dsctable" style="font-size: | + | !Operations |
− | ! Operations | + | !Invalidated |
− | ! Invalidated | + | |
|- | |- | ||
− | | All read only operations, {{lc|swap}}, {{lc|std::swap}} | + | |All read only operations, {{lc|swap}}, {{lc|std::swap}} |
− | | Never | + | |Never |
|- | |- | ||
− | | {{lc|clear}}, {{lc|rehash}}, {{lc|reserve}}, {{lc|1=operator=}} | + | |{{lc|clear}}, {{lc|rehash}}, {{lc|reserve}}, {{lc|1=operator=}} |
− | | Always | + | |Always |
|- | |- | ||
− | | {{lc|insert}}, {{lc|emplace}}, {{lc|emplace_hint}}, {{lc|operator[]}} | + | |{{lc|insert}}, {{lc|emplace}}, {{lc|emplace_hint}}, {{lc|operator[]}} |
− | | Only if causes rehash | + | |Only if causes rehash |
|- | |- | ||
− | | {{lc|erase}} | + | |{{lc|erase}} |
− | | Only to the element erased | + | |Only to the element erased |
|} | |} | ||
Line 53: | Line 56: | ||
* 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. | * 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. | ||
+ | |||
+ | ===Template parameters=== | ||
+ | {{todo|Add descriptions of the template parameters.}} | ||
===Member types=== | ===Member types=== | ||
{{dsc begin}} | {{dsc begin}} | ||
− | {{dsc hitem | | + | {{dsc hitem|Type|Definition}} |
− | {{dsc inc | cpp/container/dsc key_type | unordered_map}} | + | {{dsc inc|cpp/container/dsc key_type|unordered_map}} |
− | {{dsc inc | cpp/container/dsc mapped_type | unordered_map}} | + | {{dsc inc|cpp/container/dsc mapped_type|unordered_map}} |
− | {{dsc inc | cpp/container/dsc value_type | unordered_map}} | + | {{dsc inc|cpp/container/dsc value_type|unordered_map}} |
− | {{dsc inc | cpp/container/dsc size_type | unordered_map}} | + | {{dsc inc|cpp/container/dsc size_type|unordered_map}} |
− | {{dsc inc | cpp/container/dsc difference_type | unordered_map}} | + | {{dsc inc|cpp/container/dsc difference_type|unordered_map}} |
− | {{dsc inc | cpp/container/dsc hasher | unordered_map}} | + | {{dsc inc|cpp/container/dsc hasher|unordered_map}} |
− | {{dsc inc | cpp/container/dsc key_equal | unordered_map}} | + | {{dsc inc|cpp/container/dsc key_equal|unordered_map}} |
− | {{dsc inc | cpp/container/dsc allocator_type | unordered_map}} | + | {{dsc inc|cpp/container/dsc allocator_type|unordered_map}} |
− | {{dsc inc | cpp/container/dsc reference | unordered_map}} | + | {{dsc inc|cpp/container/dsc reference|unordered_map}} |
− | {{dsc inc | cpp/container/dsc const_reference | unordered_map}} | + | {{dsc inc|cpp/container/dsc const_reference|unordered_map}} |
− | {{dsc inc | cpp/container/dsc pointer | unordered_map}} | + | {{dsc inc|cpp/container/dsc pointer|unordered_map}} |
− | {{dsc inc | cpp/container/dsc const_pointer | unordered_map}} | + | {{dsc inc|cpp/container/dsc const_pointer|unordered_map}} |
− | {{dsc inc | cpp/container/dsc iterator | unordered_map}} | + | {{dsc inc|cpp/container/dsc iterator|unordered_map}} |
− | {{dsc inc | cpp/container/dsc const_iterator | unordered_map}} | + | {{dsc inc|cpp/container/dsc const_iterator|unordered_map}} |
− | {{dsc inc | cpp/container/dsc local_iterator | unordered_map}} | + | {{dsc inc|cpp/container/dsc local_iterator|unordered_map}} |
− | {{dsc inc | cpp/container/dsc const_local_iterator | unordered_map}} | + | {{dsc inc|cpp/container/dsc const_local_iterator|unordered_map}} |
− | {{dsc inc | cpp/container/dsc node_type | unordered_map}} | + | {{dsc inc|cpp/container/dsc node_type|unordered_map}} |
− | {{dsc inc | cpp/container/dsc insert_return_type | unordered_map}} | + | {{dsc inc|cpp/container/dsc insert_return_type|unordered_map}} |
{{dsc end}} | {{dsc end}} | ||
===Member functions=== | ===Member functions=== | ||
{{dsc begin}} | {{dsc begin}} | ||
− | {{dsc inc | cpp/container/dsc constructor | unordered_map}} | + | {{dsc inc|cpp/container/dsc constructor|unordered_map}} |
− | {{dsc inc | cpp/container/dsc destructor | unordered_map}} | + | {{dsc inc|cpp/container/dsc destructor|unordered_map}} |
− | {{dsc inc | cpp/container/dsc operator{{=}} | unordered_map}} | + | {{dsc inc|cpp/container/dsc operator{{=}}|unordered_map}} |
− | {{dsc inc | cpp/container/dsc get_allocator | unordered_map}} | + | {{dsc inc|cpp/container/dsc get_allocator|unordered_map}} |
− | {{dsc h2 | Iterators}} | + | {{dsc h2|Iterators}} |
− | {{dsc inc | cpp/container/dsc begin | unordered_map}} | + | {{dsc inc|cpp/container/dsc begin|unordered_map}} |
− | {{dsc inc | cpp/container/dsc end | unordered_map}} | + | {{dsc inc|cpp/container/dsc end|unordered_map}} |
− | {{dsc h2 | Capacity}} | + | {{dsc h2|Capacity}} |
− | {{dsc inc | cpp/container/dsc empty | unordered_map}} | + | {{dsc inc|cpp/container/dsc empty|unordered_map}} |
− | {{dsc inc | cpp/container/dsc size | unordered_map}} | + | {{dsc inc|cpp/container/dsc size|unordered_map}} |
− | {{dsc inc | cpp/container/dsc max_size | unordered_map}} | + | {{dsc inc|cpp/container/dsc max_size|unordered_map}} |
− | {{dsc h2 | Modifiers}} | + | {{dsc h2|Modifiers}} |
− | {{dsc inc | cpp/container/dsc clear | unordered_map}} | + | {{dsc inc|cpp/container/dsc clear|unordered_map}} |
− | {{dsc inc | cpp/container/dsc insert | unordered_map}} | + | {{dsc inc|cpp/container/dsc insert|unordered_map}} |
− | {{dsc inc | cpp/container/dsc insert_or_assign | unordered_map}} | + | {{dsc inc|cpp/container/dsc insert_range|unordered_map}} |
− | {{dsc inc | cpp/container/dsc emplace | unordered_map}} | + | {{dsc inc|cpp/container/dsc insert_or_assign|unordered_map}} |
− | {{dsc inc | cpp/container/dsc emplace_hint | unordered_map}} | + | {{dsc inc|cpp/container/dsc emplace|unordered_map}} |
− | {{dsc inc | cpp/container/dsc try_emplace | unordered_map}} | + | {{dsc inc|cpp/container/dsc emplace_hint|unordered_map}} |
− | {{dsc inc | cpp/container/dsc erase | unordered_map}} | + | {{dsc inc|cpp/container/dsc try_emplace|unordered_map}} |
− | {{dsc inc | cpp/container/dsc swap | unordered_map}} | + | {{dsc inc|cpp/container/dsc erase|unordered_map}} |
− | {{dsc inc | cpp/container/dsc extract | unordered_map}} | + | {{dsc inc|cpp/container/dsc swap|unordered_map}} |
− | {{dsc inc | cpp/container/dsc merge | unordered_map}} | + | {{dsc inc|cpp/container/dsc extract|unordered_map}} |
+ | {{dsc inc|cpp/container/dsc merge|unordered_map}} | ||
− | {{dsc h2 | Lookup}} | + | {{dsc h2|Lookup}} |
− | {{dsc inc | cpp/container/dsc at | unordered_map}} | + | {{dsc inc|cpp/container/dsc at|unordered_map}} |
− | {{dsc inc | cpp/container/dsc operator_at | unordered_map}} | + | {{dsc inc|cpp/container/dsc operator_at|unordered_map}} |
− | {{dsc inc | cpp/container/dsc count | unordered_map}} | + | {{dsc inc|cpp/container/dsc count|unordered_map}} |
− | {{dsc inc | cpp/container/dsc find | unordered_map}} | + | {{dsc inc|cpp/container/dsc find|unordered_map}} |
− | {{dsc inc | cpp/container/dsc contains | unordered_map}} | + | {{dsc inc|cpp/container/dsc contains|unordered_map}} |
− | {{dsc inc | cpp/container/dsc equal_range | unordered_map}} | + | {{dsc inc|cpp/container/dsc equal_range|unordered_map}} |
− | {{dsc h2 | Bucket interface}} | + | {{dsc h2|Bucket interface}} |
− | {{dsc inc | cpp/container/dsc begin(int) | unordered_map}} | + | {{dsc inc|cpp/container/dsc begin(int)|unordered_map}} |
− | {{dsc inc | cpp/container/dsc end(int) | unordered_map}} | + | {{dsc inc|cpp/container/dsc end(int)|unordered_map}} |
− | {{dsc inc | cpp/container/dsc bucket_count | unordered_map}} | + | {{dsc inc|cpp/container/dsc bucket_count|unordered_map}} |
− | {{dsc inc | cpp/container/dsc max_bucket_count | unordered_map}} | + | {{dsc inc|cpp/container/dsc max_bucket_count|unordered_map}} |
− | {{dsc inc | cpp/container/dsc bucket_size | unordered_map}} | + | {{dsc inc|cpp/container/dsc bucket_size|unordered_map}} |
− | {{dsc inc | cpp/container/dsc bucket | unordered_map}} | + | {{dsc inc|cpp/container/dsc bucket|unordered_map}} |
− | {{dsc h2 | Hash policy}} | + | {{dsc h2|Hash policy}} |
− | {{dsc inc | cpp/container/dsc load_factor | unordered_map}} | + | {{dsc inc|cpp/container/dsc load_factor|unordered_map}} |
− | {{dsc inc | cpp/container/dsc max_load_factor | unordered_map}} | + | {{dsc inc|cpp/container/dsc max_load_factor|unordered_map}} |
− | {{dsc inc | cpp/container/dsc rehash | unordered_map}} | + | {{dsc inc|cpp/container/dsc rehash|unordered_map}} |
− | {{dsc inc | cpp/container/dsc reserve | unordered_map}} | + | {{dsc inc|cpp/container/dsc reserve|unordered_map}} |
− | {{dsc h2 | Observers}} | + | {{dsc h2|Observers}} |
− | {{dsc inc | cpp/container/dsc hash_function | unordered_map}} | + | {{dsc inc|cpp/container/dsc hash_function|unordered_map}} |
− | {{dsc inc | cpp/container/dsc key_eq | unordered_map}} | + | {{dsc inc|cpp/container/dsc key_eq|unordered_map}} |
{{dsc end}} | {{dsc end}} | ||
===Non-member functions=== | ===Non-member functions=== | ||
{{dsc begin}} | {{dsc begin}} | ||
− | {{dsc inc | cpp/container/dsc operator_cmp_unord | unordered_map}} | + | {{dsc inc|cpp/container/dsc operator_cmp_unord|unordered_map}} |
− | {{dsc inc | cpp/container/dsc swap2 | unordered_map}} | + | {{dsc inc|cpp/container/dsc swap2|unordered_map}} |
− | {{dsc inc | cpp/container/dsc erase_if | unordered_map}} | + | {{dsc inc|cpp/container/dsc erase_if|unordered_map}} |
{{dsc end}} | {{dsc end}} | ||
− | + | {{rrev|since=c++17| | |
+ | ==={{rl|deduction guides|Deduction guides}}=== | ||
+ | }} | ||
+ | |||
+ | ===Notes=== | ||
+ | {{ftm begin|std=1|comment=1}} | ||
+ | {{ftm|__cpp_lib_containers_ranges|value=202202L|std=C++23|Ranges construction and insertion for containers}} | ||
+ | {{ftm end}} | ||
===Example=== | ===Example=== | ||
{{example | {{example | ||
− | + | |code= | |
− | + | ||
#include <iostream> | #include <iostream> | ||
#include <string> | #include <string> | ||
#include <unordered_map> | #include <unordered_map> | ||
− | + | ||
int main() | int main() | ||
{ | { | ||
// Create an unordered_map of three strings (that map to strings) | // Create an unordered_map of three strings (that map to strings) | ||
− | std::unordered_map<std::string, std::string> u = { | + | std::unordered_map<std::string, std::string> u = |
− | {"RED","#FF0000"}, | + | { |
− | {"GREEN","#00FF00"}, | + | {"RED", "#FF0000"}, |
− | {"BLUE","#0000FF"} | + | {"GREEN", "#00FF00"}, |
+ | {"BLUE", "#0000FF"} | ||
}; | }; | ||
− | + | ||
− | + | // Helper lambda function to print key-value pairs | |
− | + | auto print_key_value = [](const auto& key, const auto& value) | |
− | + | { | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
std::cout << "Key:[" << key << "] Value:[" << value << "]\n"; | std::cout << "Key:[" << key << "] Value:[" << value << "]\n"; | ||
− | } | + | }; |
− | + | ||
+ | std::cout << "Iterate and print key-value pairs of unordered_map, being\n" | ||
+ | "explicit with their types:\n"; | ||
+ | for (const std::pair<const std::string, std::string>& n : u) | ||
+ | print_key_value(n.first, n.second); | ||
+ | |||
+ | std::cout << "\nIterate and print key-value pairs using C++17 structured binding:\n"; | ||
+ | for (const auto& [key, value] : u) | ||
+ | print_key_value(key, value); | ||
+ | |||
// Add two new entries to the unordered_map | // Add two new entries to the unordered_map | ||
u["BLACK"] = "#000000"; | u["BLACK"] = "#000000"; | ||
u["WHITE"] = "#FFFFFF"; | u["WHITE"] = "#FFFFFF"; | ||
− | + | ||
− | std::cout << " | + | std::cout << "\nOutput values by key:\n" |
− | + | "The HEX of color RED is:[" << u["RED"] << "]\n" | |
− | + | "The HEX of color BLACK is:[" << u["BLACK"] << "]\n\n"; | |
+ | |||
+ | std::cout << "Use operator[] with non-existent key to insert a new key-value pair:\n"; | ||
+ | print_key_value("new_key", u["new_key"]); | ||
+ | |||
+ | std::cout << "\nIterate and print key-value pairs, using `auto`;\n" | ||
+ | "new_key is now one of the keys in the map:\n"; | ||
+ | for (const auto& n : u) | ||
+ | print_key_value(n.first, n.second); | ||
} | } | ||
− | + | |p=true<!--the order of elements is not specified--> | |
− | Iterate and print | + | |output= |
− | + | Iterate and print key-value pairs of unordered_map, being | |
+ | explicit with their types: | ||
Key:[BLUE] Value:[#0000FF] | Key:[BLUE] Value:[#0000FF] | ||
Key:[GREEN] Value:[#00FF00] | Key:[GREEN] Value:[#00FF00] | ||
Key:[RED] Value:[#FF0000] | Key:[RED] Value:[#FF0000] | ||
− | + | ||
− | + | Iterate and print key-value pairs using C++17 structured binding: | |
− | + | ||
− | + | ||
− | Iterate and print | + | |
Key:[BLUE] Value:[#0000FF] | Key:[BLUE] Value:[#0000FF] | ||
Key:[GREEN] Value:[#00FF00] | Key:[GREEN] Value:[#00FF00] | ||
Key:[RED] Value:[#FF0000] | Key:[RED] Value:[#FF0000] | ||
+ | |||
Output values by key: | Output values by key: | ||
The HEX of color RED is:[#FF0000] | The HEX of color RED is:[#FF0000] | ||
The HEX of color BLACK is:[#000000] | The HEX of color BLACK is:[#000000] | ||
+ | |||
+ | Use operator[] with non-existent key to insert a new key-value pair: | ||
+ | Key:[new_key] Value:[] | ||
+ | |||
+ | Iterate and print key-value pairs, using `auto`; | ||
+ | new_key is now one of the keys in the map: | ||
+ | Key:[new_key] Value:[] | ||
+ | Key:[WHITE] Value:[#FFFFFF] | ||
+ | Key:[BLACK] Value:[#000000] | ||
+ | Key:[BLUE] Value:[#0000FF] | ||
+ | Key:[GREEN] Value:[#00FF00] | ||
+ | Key:[RED] Value:[#FF0000] | ||
}} | }} | ||
+ | |||
+ | ===Defect reports=== | ||
+ | {{dr list begin}} | ||
+ | {{dr list item|wg=lwg|dr=2050|std=C++11|before=the definitions of {{tt|reference}}, {{tt|const_reference}}, {{tt|pointer}}<br>and {{tt|const_pointer}} were based on {{tt|allocator_type}}|after=based on {{tt|value_type}} and<br>{{lc|std::allocator_traits}}}} | ||
+ | {{dr list end}} | ||
===See also=== | ===See also=== | ||
{{dsc begin}} | {{dsc begin}} | ||
− | {{dsc | + | {{dsc inc|cpp/container/dsc unordered_multimap}} |
+ | {{dsc inc|cpp/container/dsc map}} | ||
+ | {{dsc inc|cpp/container/dsc flat_map}} | ||
{{dsc end}} | {{dsc end}} | ||
{{langlinks|de|es|fr|it|ja|ko|pt|ru|zh}} | {{langlinks|de|es|fr|it|ja|ko|pt|ru|zh}} |
Latest revision as of 15:45, 1 November 2024
Defined in header <unordered_map>
|
||
template< class Key, |
(1) | (since C++11) |
namespace pmr { template< |
(2) | (since C++17) |
std::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. Keys with the same hash code appear in the same bucket. This allows fast access to individual elements, since once the hash is computed, it refers to the exact bucket the element is placed into.
Two keys are considered equivalent if the map's key equality predicate returns true when passed those keys. If two keys are equivalent, the hash function must return the same value for both keys.
std::unordered_map
meets the requirements of Container, AllocatorAwareContainer, UnorderedAssociativeContainer.
Contents |
[edit] 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 |
[edit] 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.
[edit] Template parameters
This section is incomplete Reason: Add descriptions of the template parameters. |
[edit] Member types
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
|
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 to value_type
|
const_iterator
|
LegacyForwardIterator to const value_type |
local_iterator
|
An iterator type whose category, value, difference, pointer and reference types are the same as iterator . This iteratorcan 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 iteratorcan 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 oftemplate<class Iter, class NodeType> |
[edit] Member functions
constructs the unordered_map (public member function) | |
destructs the unordered_map (public member function) | |
assigns values to the container (public member function) | |
returns the associated allocator (public member function) | |
Iterators | |
returns an iterator to the beginning (public member function) | |
returns an iterator to the end (public member function) | |
Capacity | |
checks whether the container is empty (public member function) | |
returns the number of elements (public member function) | |
returns the maximum possible number of elements (public member function) | |
Modifiers | |
clears the contents (public member function) | |
inserts elements or nodes(since C++17) (public member function) | |
(C++23) |
inserts a range of elements (public member function) |
(C++17) |
inserts an element or assigns to the current element if the key already exists (public member function) |
constructs element in-place (public member function) | |
constructs elements in-place using a hint (public member function) | |
(C++17) |
inserts in-place if the key does not exist, does nothing if the key exists (public member function) |
erases elements (public member function) | |
swaps the contents (public member function) | |
(C++17) |
extracts nodes from the container (public member function) |
(C++17) |
splices nodes from another container (public member function) |
Lookup | |
access specified element with bounds checking (public member function) | |
access or insert specified element (public member function) | |
returns the number of elements matching specific key (public member function) | |
finds element with specific key (public member function) | |
(C++20) |
checks if the container contains element with specific key (public member function) |
returns range of elements matching a specific key (public member function) | |
Bucket interface | |
returns an iterator to the beginning of the specified bucket (public member function) | |
returns an iterator to the end of the specified bucket (public member function) | |
returns the number of buckets (public member function) | |
returns the maximum number of buckets (public member function) | |
returns the number of elements in specific bucket (public member function) | |
returns the bucket for specific key (public member function) | |
Hash policy | |
returns average number of elements per bucket (public member function) | |
manages maximum average number of elements per bucket (public member function) | |
reserves at least the specified number of buckets and regenerates the hash table (public member function) | |
reserves space for at least the specified number of elements and regenerates the hash table (public member function) | |
Observers | |
returns function used to hash the keys (public member function) | |
returns the function used to compare keys for equality (public member function) |
[edit] Non-member functions
(C++11)(C++11)(removed in C++20) |
compares the values in the unordered_map (function template) |
specializes the std::swap algorithm (function template) | |
(C++20) |
erases all elements satisfying specific criteria (function template) |
Deduction guides |
(since C++17) |
[edit] Notes
Feature-test macro | Value | Std | Feature |
---|---|---|---|
__cpp_lib_containers_ranges |
202202L | (C++23) | Ranges construction and insertion for containers |
[edit] Example
#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"} }; // Helper lambda function to print key-value pairs auto print_key_value = [](const auto& key, const auto& value) { std::cout << "Key:[" << key << "] Value:[" << value << "]\n"; }; std::cout << "Iterate and print key-value pairs of unordered_map, being\n" "explicit with their types:\n"; for (const std::pair<const std::string, std::string>& n : u) print_key_value(n.first, n.second); std::cout << "\nIterate and print key-value pairs using C++17 structured binding:\n"; for (const auto& [key, value] : u) print_key_value(key, value); // Add two new entries to the unordered_map u["BLACK"] = "#000000"; u["WHITE"] = "#FFFFFF"; std::cout << "\nOutput values by key:\n" "The HEX of color RED is:[" << u["RED"] << "]\n" "The HEX of color BLACK is:[" << u["BLACK"] << "]\n\n"; std::cout << "Use operator[] with non-existent key to insert a new key-value pair:\n"; print_key_value("new_key", u["new_key"]); std::cout << "\nIterate and print key-value pairs, using `auto`;\n" "new_key is now one of the keys in the map:\n"; for (const auto& n : u) print_key_value(n.first, n.second); }
Possible output:
Iterate and print key-value pairs of unordered_map, being explicit with their types: Key:[BLUE] Value:[#0000FF] Key:[GREEN] Value:[#00FF00] Key:[RED] Value:[#FF0000] Iterate and print key-value pairs using C++17 structured binding: Key:[BLUE] Value:[#0000FF] Key:[GREEN] Value:[#00FF00] Key:[RED] Value:[#FF0000] Output values by key: The HEX of color RED is:[#FF0000] The HEX of color BLACK is:[#000000] Use operator[] with non-existent key to insert a new key-value pair: Key:[new_key] Value:[] Iterate and print key-value pairs, using `auto`; new_key is now one of the keys in the map: Key:[new_key] Value:[] Key:[WHITE] Value:[#FFFFFF] Key:[BLACK] Value:[#000000] Key:[BLUE] Value:[#0000FF] Key:[GREEN] Value:[#00FF00] Key:[RED] Value:[#FF0000]
[edit] Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 2050 | C++11 | the definitions of reference , const_reference , pointer and const_pointer were based on allocator_type
|
based on value_type andstd::allocator_traits |
[edit] See also
(C++11) |
collection of key-value pairs, hashed by keys (class template) |
collection of key-value pairs, sorted by keys, keys are unique (class template) | |
(C++23) |
adapts two containers to provide a collection of key-value pairs, sorted by unique keys (class template) |