deque::deque

explicit deque ( const Allocator& = Allocator() );
explicit deque ( size_type n, const T& value= T(), const Allocator& = Allocator() );
template <class InputIterator>
         deque ( InputIterator first, InputIterator last, const Allocator& = Allocator() );
deque ( const deque<T,Allocator>& x );

Construct deque container

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

Default constructor: constructs an empty deque container, with no content and a size of zero.

explicit deque ( size_type n, const T& value= T(), const Allocator& = Allocator() );

Repetitive sequence constructor: Initializes the container with its content set to a repetition, n times, of copies of value.

template <class InputIterator> deque ( InputIterator first, InputIterator last, const Allocator& = Allocator() );

Iteration constructor: Iterates between first and last, setting a copy of each of the sequence of elements as the content of the container.

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

Copy constructor: The deque container is initialized to have the same contents (copies) and properties as deque container x.

Parameters

n

Times that value is repeated to form the content of the container object.
Member type size_type is an unsigned integral type.

value

Value to be repeated n times as the content of the container object.
T is the first class template parameter (the type of the elements stored in the deque container).

first, last

Input iterators to the initial and final positions in a sequence. The range used is [first,last), which includes all the elements between first and last, including the element pointed by first but not the element pointed by last.
The function template type can be any type of input iterator.

x

Another deque object with the same class template parameters (T and Allocator).

unnamed Allocator parameter

Allocator object to be used instead of constructing a new one.
For class instantiations using their version of the default allocator class template, this parameter is not relevant.

Example

// constructing deques
#include <iostream>
#include <deque>
using namespace std;
int main ()
{
  unsigned int i;
  // constructors used in the same order as described above:
  deque<int> first;                                // empty deque of ints
  deque<int> second (4,100);                       // four ints with value 100
  deque<int> third (second.begin(),second.end());  // iterating through second
  deque<int> fourth (third);                       // a copy of third
  // the iterator constructor can also be used to construct from arrays:
  int myints[] = {16,2,77,29};
  deque<int> fifth (myints, myints + sizeof(myints) / sizeof(int) );
  cout << "The contents of fifth are:";
  for (i=0; i < fifth.size(); i++)
    cout << " " << fifth[i];
  cout << endl;
  return 0;
}

The contents of fifth are: 16 2 77 29 

Complexity

See also