|
Stxxl
1.3.2
|
A deque container. More...
#include <deque.h>
Inherits noncopyable.
Public Types | |
| typedef VectorType::size_type | size_type |
| typedef VectorType::difference_type | difference_type |
| typedef VectorType | vector_type |
| typedef T | value_type |
| typedef T * | pointer |
| typedef const value_type * | const_pointer |
| typedef T & | reference |
| typedef const T & | const_reference |
| typedef deque_iterator< Self_ > | iterator |
|
typedef const_deque_iterator < Self_ > | const_iterator |
|
typedef std::reverse_iterator < iterator > | reverse_iterator |
|
typedef std::reverse_iterator < const_iterator > | const_reverse_iterator |
Public Member Functions | |
| deque (size_type n) | |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | cbegin () const |
| const_iterator | end () const |
| const_iterator | cend () const |
| reverse_iterator | rbegin () |
| const_reverse_iterator | rbegin () const |
| const_reverse_iterator | crbegin () const |
| reverse_iterator | rend () |
| const_reverse_iterator | rend () const |
| const_reverse_iterator | crend () const |
| size_type | size () const |
| size_type | max_size () const |
| bool | empty () const |
| reference | operator[] (size_type n) |
| const_reference | operator[] (size_type n) const |
| reference | front () |
| const_reference | front () const |
| reference | back () |
| const_reference | back () const |
| void | push_front (const T &el) |
| void | push_back (const T &el) |
| void | pop_front () |
| void | pop_back () |
| void | swap (deque &obj) |
| void | clear () |
| void | resize (size_type n) |
A deque container.
It is an adaptor of the VectorType. The implementation wraps the elements around the end of the VectorType circularly.
| T | type of the contained objects (POD with no references to internal memory) |
| VectorType | the type of the underlying vector container, the default is stxxl::vector<T> |
1.8.5