erase overloads
Synopses
Declared in <absl/container/linked_hash_map.h>
Removes the element at the given position.
iterator
erase(const_iterator position);Removes the element at the given position.
Removes the element with the given key.
template<class K = key_type>
size_type
erase(key_arg<K> const& key);Removes the elements in the range [first, last)].
iterator
erase(
const_iterator first,
const_iterator last);Removes the elements in the range [first, last)].
Return Value
-
An iterator to the element following the erased element.
-
The number of elements removed (0 or 1).
-
An iterator to the element following the last erased element.
Parameters
Name |
Description |
position |
An iterator to the element to erase. |
key |
The key to erase. |
first |
An iterator to the first element to erase. |
last |
An iterator past the last element to erase. |
Created with MrDocs