| Prev Next | Back Along | Up Home | Full TOC | Front Page / Sequences / Classes / deque |

deque

Description

deque is a variadic, random access, extensible sequence of types that supports constant-time insertion and removal of elements at both ends, and linear-time insertion and removal of elements in the middle. In this implementation of the library, deque is a synonym for vector.

Header

#include <[boost/mpl/deque.hpp](../../../../boost/mpl/deque.hpp)>

Model of

• Variadic Sequence
• Random Access Sequence
• Extensible Sequence
• Back Extensible Sequence
• Front Extensible Sequence

Expression semantics

See vector specification.

Example

typedef[deque](./deque.html)<float,double,long double> floats;
typedef[push\_back](./push-back.html)<floats,int>::type types;[BOOST\_MPL\_ASSERT](./assert.html)(( is_same<[at\_c](./at-c.html)<types,3>::type, int > ));

See also

Sequences, vector, list, set

| Prev Next | Back Along | Up Home | Full TOC |

Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) |