Standard C++ Library Class Reference

Description

deque<T, Allocator> is a type of sequence that supports random access iterators. It supports

constant time insert and erase operations at the beginning or the end of the container. Insertion

and erase in the middle take linear time. Storage management is handled by the Allocator

template parameter.

Any type used for the template parameter T must provide the following (where T is the type, t is

a value of T and u is a const value of T):

Default constructor T()

Copy constructors T(t) and T(u)

Destructor t.~T()

Address of &t and &u yielding T* and const T* respectively

Assignment t = a where a is a (possibly const) value of T

Interface

template <class T, class Allocator = allocator>

class deque {

public:

// Types

class iterator;

class const_iterator;

typedef T value_type;

typedef Allocator allocator_type;

typename reference;

typename const_reference;

typename size_type;

typename difference_type;

typename reverse_iterator;

typename const_reverse_iterator;

// Construct/Copy/Destroy

explicit deque (const Allocator& = Allocator());

explicit deque (size_type, const Allocator& = Allocator ());

deque (size_type, const T& value,

const Allocator& = Allocator ());

deque (const deque<T,Allocator>&);

template <class InputIterator>

deque (InputIterator, InputIterator,

const Allocator& = Allocator ());

~deque ();