C++ Double-Ended Queues

Constructors

  deque();
  deque( size_type size );
  deque( size_type num, const TYPE &val );
  deque( const deque &from );
  deque( input_iterator start, input_iterator end );

C++ Deques can be constructed with either:

• Nothing - which creates an empty deque,
• size - creates a deque of size num,
• num and val - puts num copies of val in the deque,
• from - creates a deque with the same contents as from, or
• start and end - which creates a deque containing elements from start to end.

For example, the following code creates and displays a deque:

  // create a deque with ten '1's in it
  deque dq( 10, 1 );
  // create an iterator
  deque::iterator iter;

  // display the contents of our deque
  for( iter = dq.begin(); iter != dq.end(); iter++ ){ 
    cout << *iter << endl;
  }

Operators

  []

You can access individual members of the double-ended queue using the [] operator.

assign

  void assign( input_iterator start, input_iterator end);
  void assign( Size num, const TYPE &val );

The function assign() sets the double-ended queue the sequence denoted by start and end, or sets num elements to val.

at

  reference at( size_type pos );

The at() function returns a reference to the element at pos in the double-ended queue.

back

  reference back();

The function back() returns a reference to the back element of the double-ended queue.

begin

  iterator begin();

The begin() function returns an iterator to the front element of the double-ended queue.

clear

  void clear();

The clear() function deletes all of the elements from the double-ended queue.

empty

  bool empty();

The function empty() returns true if the double-ended queue is empty, and false otherwise.

end

  iterator end();

The end() function returns an iterator to the back of the double-ended queue.

erase

  iterator erase( iterator pos );
  iterator erase( iterator start, iterator end );

The function erase() erases the element at location pos, or the items between start and end. The return value is an iterator to the element just after the last one erased.

front

  reference front();

The front() function returns a reference to the element at the beginning of the double-ended queue.

get_allocator

  allocator_type get_allocator();

The get_allocator() function returns the double-ended queue's allocator.

insert

  iterator insert( iterator pos, size_type num, const TYPE &val );
  void insert( iterator pos, input_iterator start, input_iterator end );

The insert() function inserts num copies of val before the element at pos, or inserts the sequence specified by start and end before the element at pos.

max_size

  size_type max_size();

The function max_size() returns the maximum number of items that the double-ended queue can hold.

pop_back

  void pop_back();

The pop_back() function removes the last element from the double-ended queue.

pop_front

  void pop_front();

The function pop_front() removes the first element from the double-ended queue.

push_back

  void push_back( const TYPE &val );

The push_back() function adds val to the end of the double-ended queue.

push_front

  void push_front( const TYPE &val );

The function push_front() adds val to the front of the double-ended queue.

rbegin

  reverse_iterator rbegin();

The rbegin() function returns a reverse iterator to the back of the double-ended queue.

rend

  reverse_iterator rend();

The function rend() returns a reverse iterator to the front of the double-ended queue.

resize

  void resize( size_type num, TYPE val );

The resize() function changes the size of the double-ended queue to num, padding any added entries with elements equal to val.

size

  size_type size();

The size() function returns the number of elements in the double-ended queue.

swap

  void swap( deque &target );

The swap() function swaps the elements in the current double-ended queue with those in target.