std::unordered_set::unordered_set
| (1) | ||
| explicit unordered_set( size_type bucket_count = /*implementation-defined*/, const Hash& hash = Hash(), |
(since C++11) (until C++14) |
|
| unordered_set() : unordered_set( size_type(/*implementation-defined*/) ) {} explicit unordered_set( size_type bucket_count, |
(since C++14) | |
| unordered_set( size_type bucket_count, const Allocator& alloc ) |
(1) | (since C++14) |
| explicit unordered_set( const Allocator& alloc ); |
(1) | (since C++11) |
| template< class InputIt > unordered_set( InputIt first, InputIt last, |
(2) | (since C++11) |
| template< class InputIt > unordered_set( InputIt first, InputIt last, |
(2) | (since C++14) |
| template< class InputIt > unordered_set( InputIt first, InputIt last, |
(2) | (since C++14) |
| unordered_set( const unordered_set& other ); |
(3) | (since C++11) |
| unordered_set( const unordered_set& other, const Allocator& alloc ); |
(3) | (since C++11) |
| unordered_set( unordered_set&& other ); |
(4) | (since C++11) |
| unordered_set( unordered_set&& other, const Allocator& alloc ); |
(4) | (since C++11) |
| unordered_set( std::initializer_list<value_type> init, size_type bucket_count = /*implementation-defined*/, |
(5) | (since C++11) |
| unordered_set( std::initializer_list<value_type> init, size_type bucket_count, |
(5) | (since C++14) |
| unordered_set( std::initializer_list<value_type> init, size_type bucket_count, |
(5) | (since C++14) |
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.
max_load_factor() to 1.0. For the default constructor, the number of buckets is implementation-defined.[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 LWG2844)other, copies the load factor, the predicate, and the hash function as well. If alloc is not provided, allocator is obtained by calling std::allocator_traits<allocator_type>::select_on_container_copy_construction(other.get_allocator()).other using move semantics. If alloc is not provided, allocator is obtained by move-construction from the allocator belonging to other.init, same as unordered_set(init.begin(), init.end()).Contents |
[edit] Parameters
| alloc | - | allocator to use for all memory allocations of this container |
| bucket_count | - | minimal number of buckets to use on initialization. If it is not specified, implementation-defined default value is used |
| hash | - | hash function to use |
| equal | - | comparison function to use for all key comparisons of this container |
| first, last | - | the range to copy the elements from |
| other | - | another container to be used as source to initialize the elements of the container with |
| init | - | initializer list to initialize the elements of the container with |
| Type requirements | ||
-InputIt must meet the requirements of InputIterator.
| ||
[edit] Complexity
first and lastotheralloc is given and alloc != other.get_allocator(), then linear.init[edit] Notes
other remain valid, but refer to elements that are now in *this. The current standard makes this guarantee via the blanket statement in §23.2.1[container.requirements.general]/12, and a more direct guarantee is under consideration via LWG 2321.
[edit] Example
| This section is incomplete Reason: no example |
[edit] See also
| assigns values to the container (public member function) |