Double-ended queues are like vectors, except that they allow fast insertions and deletions at the beginning (as well as the end) of the container.
Display all entries for C++ Double-ended Queues on one page, or view entries individually:
| Container constructors | create dequeues and initialize them with some data |
| Container operators | compare, assign, and access elements of a dequeue |
| assign | assign elements to a dequeue |
| at | returns an element at a specific location |
| back | returns a reference to last element of a dequeue |
| begin | returns an iterator to the beginning of the dequeue |
| clear | removes all elements from the dequeue |
| empty | true if the dequeue has no elements |
| end | returns an iterator just past the last element of a dequeue |
| erase | removes elements from a dequeue |
| front | returns a reference to the first element of a dequeue |
| insert | inserts elements into the dequeue |
| max_size | returns the maximum number of elements that the dequeue can hold |
| pop_back | removes the last element of a dequeue |
| pop_front | removes the first element of the dequeue |
| push_back | add an element to the end of the dequeue |
| push_front | add an element to the front of the dequeue |
| rbegin | returns a reverse_iterator to the end of the dequeue |
| rend | returns a reverse_iterator to the beginning of the dequeue |
| resize | change the size of the dequeue |
| size | returns the number of items in the dequeue |
| swap | swap the contents of this dequeue with another |