const_reverse_iterator rbegin() const | Reversible Container | Returns a const_reverse_iterator pointing to the beginning of the reversed deque. |
const_reverse_iterator rend() const | Reversible Container | Returns a const_reverse_iterator pointing to the end of the reversed deque. |
size_type size() const | Container | Returns the size of the deque. |
size_type max_size() const | Container | Returns the largest possible size of the deque. |
bool empty() const | Container | true if the deque 's size is 0. |
reference operator[](size_type n) | Random Access Container | Returns the n 'th element. |
const_reference operator[](size_type n) const | Random Access Container | Returns the n'th element. |
deque() | Container | Creates an empty deque. |
deque(size_type n) | Sequence | Creates a deque with n elements. |
deque(size_type n, const T& t) | Sequence | Creates a deque with n copies of t. |
deque(const deque&) | Container | The copy constructor |
template <class InputIterator> deque(InputIterator f, InputIterator l) [4] | Sequence | Creates a deque with a copy of a range. |
~deque() | Container | The destructor. |
deque& operator=(const deque&) | Container | The assignment operator |
reference front() | Front Insertion Sequence | Returns the first element. |
const_reference front() const | Front Insertion Sequence | Returns the first element. |
reference back() | Back Insertion Sequence | Returns the last element. |
const_reference back() const | Back Insertion Sequence | Returns the last element. |
void push_front(const T&) | Front Insertion Sequence | Inserts a new element at the beginning. |
