std::unordered_multimap::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_multimap
Member functions unordered_multimap::unordered_multimap unordered_multimap::~unordered_multimap unordered_multimap::operator= unordered_multimap::get_allocator Iterators unordered_multimap::begin unordered_multimap::cbegin unordered_multimap::end unordered_multimap::cend Capacity unordered_multimap::erase unordered_multimap::size unordered_multimap::max_size Modifiers unordered_multimap::clear unordered_multimap::insert unordered_multimap::emplace unordered_multimap::emplace_hint unordered_multimap::erase unordered_multimap::swap Lookup unordered_multimap::count unordered_multimap::find unordered_multimap::equal_range Bucket interface unordered_multimap::begin(int) unordered_multimap::end(int) unordered_multimap::bucket_count unordered_multimap::max_bucket_count unordered_multimap::bucket_size unordered_multimap::bucket Hash policy unordered_multimap::load_factor unordered_multimap::max_load_factor unordered_multimap::rehash unordered_multimap::reserve Observers unordered_multimap::hash_function unordered_multimap::key_eq

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

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

References and iterators to the erased elements are invalidated. If rehashing occurs due to the erasure, all other iterators are invalidated also. Otherwise, other iterators are not affected. References to elements other than the erased ones are not invalidated.

This section is incomplete Reason: when rehashing occurs?

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)