std::unordered_set::unordered_set

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::unordered_set
Member functions unordered_set::unordered_set unordered_set::~unordered_set unordered_set::operator= unordered_set::get_allocator Iterators unordered_set::begin unordered_set::cbegin unordered_set::end unordered_set::cend Capacity unordered_set::erase unordered_set::size unordered_set::max_size Modifiers unordered_set::clear unordered_set::insert unordered_set::emplace unordered_set::emplace_hint unordered_set::erase unordered_set::swap Lookup unordered_set::count unordered_set::find unordered_set::equal_range Bucket interface unordered_set::begin(int) unordered_set::end(int) unordered_set::bucket_count unordered_set::max_bucket_count unordered_set::bucket_size unordered_set::bucket Hash policy unordered_set::load_factor unordered_set::max_load_factor unordered_set::rehash unordered_set::reserve Observers unordered_set::hash_function unordered_set::key_eq

explicit unordered_set( size_type bucket_count = /*implementation-defined*/,                         const Hash& hash = Hash(),                         const KeyEqual& equal = KeyEqual(),                         const Allocator& alloc = Allocator() );	(1)	(C++11 feature)
explicit unordered_set( const Allocator& alloc );	(1)	(C++11 feature)
template< class InputIterator > unordered_set( InputIterator first, InputIterator last,                size_type bucket_count = /*implementation-defined*/,                const Hash& hash = Hash(),                const KeyEqual& equal = KeyEqual(),                const Allocator& alloc = Allocator() );	(2)	(C++11 feature)
unordered_set( const unordered_set& other );	(3)	(C++11 feature)
unordered_set( const unordered_set& other, const Allocator& alloc );	(3)	(C++11 feature)
unordered_set( unordered_set&& other );	(4)	(C++11 feature)
unordered_set( unordered_set&& other, const Allocator& alloc );	(4)	(C++11 feature)
unordered_set( std::initializer_list<value_type> init,                size_type bucket_count = /*implementation-defined*/,                const Hash& hash = Hash(),                const KeyEqual& equal = KeyEqual(),                const Allocator& alloc = Allocator() );	(5)	(C++11 feature)

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.

1) default constructor. Constructs empty container.

2) constructs the container with the contents of the range [first, last).

3) copy constructor. Constructs the container with the copy of the contents of other.

4) move constructor. Constructs the container with the contents of other using move semantics.

5) constructs the container with the contents of the initializer list init.

Contents 1 Parameters 2 Complexity 3 Example 4 See also

[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

[edit] Complexity

This section is incomplete

1) constant

2) linear in distance between first and last

3) linear in size of other

4) constant. If alloc is given and alloc != other.get_allocator(), then linear.

5) linear in size of init

[edit] Example

This section is incomplete

[edit] See also

operator=	assigns values to the container (public member function)