Erase all elements whose keys fall in [first, last)].
Declared in <bdlcc_stripedunorderedcontainerimpl.h>
template<class RANDOM_ITER>
std::size_t
eraseBulkAll(
RANDOM_ITER first,
RANDOM_ITER last);The iterators provide read access to a sequence of KEY objects. All erasures are done by the calling thread and the order of erasure is not specified. Return the number of elements removed. The behavior is undefined unless first <= last. Note that the map may not have an element for every value in keys.
number of elements removed
| Name | Description |
|---|---|
| first | beginning of the key range |
| last | end of the key range |