Standard C++ Library Class Reference

Returns size() of the largest possible deque.
void
pop_back ();
Removes the last element. Note that this function does not return the element.
void
pop_front ();
Removes the first element. Note that this function does not return the element
void
push_back (const T& x);
Appends a copy of x to the end.
void
push_front (const T& x);
Inserts a copy of x at the front.
void
resize (size_type sz);
Alters the size of self. If the new size (sz) is greater than the current size then sz-size()
copies of the default value of type T are inserted at the end of the deque. If the new size is
smaller than the current capacity, then the deque is truncated by erasing size()-sz
elements off the end. Otherwise, no action is taken. Requires that type T have a default
constructor.
void
resize (size_type sz, T c);
Alters the size of self. If the new size (sz) is greater than the current size then sz-size() c's
are inserted at the end of the deque. If the new size is smaller than the current capacity,
then the deque is truncated by erasing size()-sz elements off the end. Otherwise, no action
is taken.
size_type
size () const;
Returns the number of elements.
void
swap (deque<T,Allocator>& x);
Exchanges self with x.
Non-member Functions
template <class T, class Allocator>
bool operator== (const deque<T, Allocator>& x,
const deque<T, Allocator>& y);