Navigation: Up, Table of Contents, Bibliography, Index, Title Page

deque (deque)

Definition

An object of the class deque is a sequence that supports random access iterators. In addition it supports constant time insert and erase operations at both ends. Insert and erase in the middle take linear time.

#include <deque.h>

Types

deque<T>::iterator
A mutable random access iterator.

deque<T>::const_iterator
A const random access iterator.

Creation

deque<T> D;
Introduces an empty deque.

deque<T> D ( deque<T> q);
Copy constructor.

deque<T> D ( int n, T t = T());
Introduces a deque with n items, all initialized to t.

Operations

deque<T> & D = deque<T> D1 Assignment.
bool D == deque<T> D1 Test for equality: Two deques are equal, iff they have the same size and if their corresponding elements are equal.
bool D != deque<T> D1 Test for inequality.
bool D < deque<T> D1 Test for lexicographically smaller.
iterator D.begin () Returns a mutable iterator referring to the first element in deque D.
const_iterator D.begin () const Returns a constant iterator referring to the first element in deque D.
iterator D.end () Returns a mutable iterator which is the past-end-value of deque D.
const_iterator D.end () const Returns a constant iterator which is the past-end-value of deque D.
bool D.empty () Returns true if D is empty.
int D.size () Returns the number of items in deque D.
T& D [ int pos] Random access operator.
T D [ int pos] const Random access operator.
T& D.front () Returns a reference to the first item in deque D.
T D.front () const Returns a const reference to the first item in deque D.
T& D.back () Returns a reference to the last item in deque D.
T D.back () const Returns a const reference to the last item in deque D.

Insert and Erase

void D.push_front ( T) Inserts an item at the beginning of deque D.
void D.push_back ( T) Inserts an item at the end of deque D.
iterator D.insert ( iterator pos, T t = T())
Inserts a copy of t in front of iterator pos. The return value points to the inserted item.
iterator D.insert ( iterator pos, int n, T t = T())
Inserts n copy of t in front of iterator pos. The return value points to the inserted item.
void
D.insert ( iterator pos,
const_iterator first,
const_iterator last)
Inserts a copy of the range [.first, last.) in front of iterator pos.
void D.pop_front () Removes the first item from deque D.
void D.pop_back () Removes the last item from deque D.
void D.erase ( iterator pos) Removes the item from deque D, where pos refers to.
void D.erase ( iterator first, iterator last)
Removes the items in the range[.first, last.) from deque D.
Return to chapter: Sequence Containers
Navigation: Up, Table of Contents, Bibliography, Index, Title Page
The CGAL Project. Mon, June 30, 1997.