std::unordered_set::insert

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

std::pair<iterator,bool> insert( const value_type& value );	(1)	(C++11 feature)
std::pair<iterator, bool> insert( value_type&& value );	(2)	(C++11 feature)
iterator insert( const_iterator hint, const value_type& value );	(3)	(C++11 feature)
iterator insert( const_iterator hint, value_type&& value );	(4)	(C++11 feature)
template <class InputIterator> void insert( InputIterator first, InputIterator last );	(5)	(C++11 feature)
void insert( std::initializer_list<value_type> ilist );	(6)	(C++11 feature)

Inserts elements to the container.

1-2) inserts value.

3-4) inserts value, using hint as a suggestion where the element should go.

5) inserts elements from range [first, last).

6) inserts elements from initializer list ilist.

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

hint	-	iterator, used as a suggestion as to where to insert the content
value	-	element value to insert
first, last	-	range of elements to insert
ilist	-	initializer list to insert the values from

[edit] Return value

1-2) returns a pair consisting of a bool denoting whether the insertion took place and an iterator to the inserted element.

3-4) returns an iterator to the inserted element or to the element, that prevented the insertion.

5-6) none.

[edit] Complexity

This section is incomplete

[edit] See also

emplace	constructs element in-place (public member function)
emplace_hint	constructs elements in-place using a hint (public member function)