erase overloads
Declared in <bslstl_list.h>
Remove the element at position and return an iterator to the next.
list<VALUE, ALLOCATOR>::iterator
erase(const_iterator position);Remove the elements in the half-open range [dstBegin .. dstEnd)].
list<VALUE, ALLOCATOR>::iterator
erase(
const_iterator dstBegin,
const_iterator dstEnd);| Name | Description |
|---|---|
| position | iterator to the element to remove |
| dstBegin | iterator to the first element to remove |
| dstEnd | iterator past the last element to remove |