erase overloads
Declared in <absl/container/linked_hash_map.h>
Removes the element at the given position.
iterator
erase(const_iterator position);
» more...
Removes the element at the given position.
iterator
erase(iterator position);
» more...
Removes the element with the given key.
template<class K = key_type>
size_type
erase(key_arg<K> const& key);
» more...
Removes the elements in the range [first, last)].
iterator
erase(
const_iterator first,
const_iterator last);
» more...
Removes the elements in the range [first, last)].
iterator
erase(
iterator first,
iterator last);
» more...
| 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. |