Standard C++ Library Reference ISO/IEC (VERSION3)

deque::end
const_iterator end() const;
iterator end();
The member function returns a random-access iterator that points just beyond the end of the
sequence.
deque::erase
iterator erase(iterator where);
iterator erase(iterator first, iterator last);
The first member function removes the element of the controlled sequence pointed to by
where. The second member function removes the elements of the controlled sequence in the
range [first, last). Both return an iterator that designates the first element remaining
beyond any elements removed, or end() if no such element exists.
Removing N elements causes N destructor calls and an assignment for each of the elements
between the insertion point and the nearer end of the sequence. Removing an element at either
end invalidates only iterators and references that designate the erased elements. Otherwise,
erasing an element invalidates all iterators and references.
The member functions throw an exception only if a copy operation throws an exception.
deque::front
reference front();
const_reference front() const;
The member function returns a reference to the first element of the controlled sequence, which
must be non-empty.
deque::get_allocator
Alloc get_allocator() const;
The member function returns the stored allocator object.
deque::insert
iterator insert(iterator where, const Ty& val);
void insert(iterator where, size_type count, const Ty& val);
template<class InIt>
void insert(iterator where, InIt first, InIt last);