std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::unordered_map
(1) | ||
unordered_map() : unordered_map(size_type(/* unspecified */)) {} |
(since C++11) (until C++20) |
|
unordered_map(); |
(since C++20) | |
explicit unordered_map( size_type bucket_count, const Hash& hash = Hash(), |
(2) | (since C++11) |
unordered_map( size_type bucket_count, const Allocator& alloc ) |
(3) | (since C++14) |
unordered_map( size_type bucket_count, const Hash& hash, |
(4) | (since C++14) |
explicit unordered_map( const Allocator& alloc ); |
(5) | (since C++11) |
template< class InputIt > unordered_map( InputIt first, InputIt last, |
(6) | (since C++11) |
template< class InputIt > unordered_map( InputIt first, InputIt last, |
(7) | (since C++14) |
template< class InputIt > unordered_map( InputIt first, InputIt last, |
(8) | (since C++14) |
unordered_map( const unordered_map& other ); |
(9) | (since C++11) |
unordered_map( const unordered_map& other, const Allocator& alloc ); |
(10) | (since C++11) |
unordered_map( unordered_map&& other ); |
(11) | (since C++11) |
unordered_map( unordered_map&& other, const Allocator& alloc ); |
(12) | (since C++11) |
unordered_map( std::initializer_list<value_type> init, size_type bucket_count = /* unspecified */, |
(13) | (since C++11) |
unordered_map( std::initializer_list<value_type> init, size_type bucket_count, |
(14) | (since C++14) |
unordered_map( std::initializer_list<value_type> init, size_type bucket_count, |
(15) | (since C++14) |
template< container-compatible-range<value_type> R > unordered_map( std::from_range_t, R&& rg, |
(16) | (since C++23) |
template< container-compatible-range<value_type> R > unordered_map( std::from_range_t, R&& rg, |
(17) | (since C++23) |
template< container-compatible-range<value_type> R > unordered_map( std::from_range_t, R&& rg, |
(18) | (since C++23) |
Constructs new container from a variety of data sources. Optionally uses user supplied bucket_count as a minimal number of buckets to create, hash as the hash function, equal as the function to compare keys and alloc as the allocator.
[
first,
last)
. Sets max_load_factor() to 1.0. If multiple elements in the range have keys that compare equivalent, it is unspecified which element is inserted (pending