Description
deque is a standard container, that implements a double-ended queue. That is, a queue where insert and delete operations at either end are efficiently handled.
Declaration
template <class T, class A = allocator<T> > class std::deque;
Concept
The program sets up a deque of strings and then adds several entries both at the front and the back of the structure. These are then removed from the front of the deque, resulting in output of:
banana apple orange peach
Special Notes:
Inserting elements in the middle of a deque tends to be inefficient.
Supported
Supported
Supported