std::unordered_set::erase

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

void erase( iterator position ); iterator erase( const_iterator position );	(1)	(C++11 feature)
void erase( iterator first, iterator last ); iterator erase( const_iterator first, const_iterator last );	(2)	(C++11 feature)
size_type erase( const key_type& key );	(3)	(C++11 feature)

Removes specified elements from the container.

1) Removes the element at pos.

2) Removes the elements in the range [first; last).

3) Removes the elements with the key value key

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

pos	-	iterator to the element to remove
first, last	-	range of elements to remove
key	-	key value of the elements to remove

[edit] Return value

1-2) iterator following the last removed element.

3) number of elements removed

[edit] Complexity

1) Average case: constant, worst case: a.size()

2) Average case: std::distance(first, last), worst case: a.size()

3) Average case: a.count(key), worst case: a.size()

[edit] See also

clear	clears the contents (public member function)