Call the destructor on each of the elements of a deque of parameterized VALUE_TYPE in the specified range [first .. last)]. Shift the elements from the smaller of the specified range [fromBegin .. first)] and [last .. fromEnd)] to fill up the empty spaces after the erasure. Load in the specified toBegin and toEnd the new boundaries of the deque after erasure and return an iterator pointing to the element immediately following the removed elements. The behavior is undefined unless fromBegin <= first <= last <= fromEnd. Note that the last argument is for removing overload ambiguities and is not used.

Synopsis

Declared in <bslalg_dequeprimitives.h>

template<class ALLOCATOR>
static
DequePrimitives<VALUE_TYPE, BLOCK_LENGTH>::Iterator
erase(
    Iterator* toBegin,
    Iterator* toEnd,
    Iterator fromBegin,
    Iterator first,
    Iterator last,
    Iterator fromEnd,
    ALLOCATOR allocator,
    bsl::integral_constant<int, BSLALG_DEQUEPRIMITIVES_NIL_TRAITS>);

Created with MrDocs