Main Page   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Namespace Members   Compound Members   File Members  

std::deque Class Template Reference

#include <stl_deque.h>

Inherits std::_Deque_base< _Tp, _Alloc >.

List of all members.

Public Types


Public Methods


Protected Types


Protected Methods


Static Protected Methods

template<class _Tp, class _Alloc = allocator<_Tp>> class std::deque


Member Typedef Documentation

typedef _Tp value_type
 

typedef value_type* pointer
 

typedef const value_type* const_pointer
 

typedef value_type& reference
 

typedef const value_type& const_reference
 

typedef size_t size_type
 

typedef ptrdiff_t difference_type
 

typedef _Base::allocator_type allocator_type
 

Reimplemented from std::_Deque_base.

typedef _Base::iterator iterator
 

Reimplemented from std::_Deque_base.

typedef _Base::const_iterator const_iterator
 

Reimplemented from std::_Deque_base.

typedef reverse_iterator<const_iterator> const_reverse_iterator
 

typedef reverse_iterator<iterator> reverse_iterator
 

typedef pointer* _Map_pointer [protected]
 


Constructor & Destructor Documentation

deque ( const allocator_type & __a = allocator_type() ) [inline, explicit]
 

deque ( const deque<_Tp, _Alloc> & __x ) [inline]
 

deque ( size_type __n,
const value_type & __value,
const allocator_type & __a = allocator_type() ) [inline]
 

deque ( size_type __n ) [inline, explicit]
 

deque ( _InputIterator __first,
_InputIterator __last,
const allocator_type & __a = allocator_type() ) [inline]
 

~deque ( ) [inline]
 


Member Function Documentation

allocator_type get_allocator ( ) const [inline]
 

Reimplemented from std::_Deque_alloc_base.

size_t _S_buffer_size ( ) [inline, static, protected]
 

iterator begin ( ) [inline]
 

iterator end ( ) [inline]
 

const_iterator begin ( ) const [inline]
 

const_iterator end ( ) const [inline]
 

reverse_iterator rbegin ( ) [inline]
 

reverse_iterator rend ( ) [inline]
 

const_reverse_iterator rbegin ( ) const [inline]
 

const_reverse_iterator rend ( ) const [inline]
 

reference operator[] ( size_type __n ) [inline]
 

const_reference operator[] ( size_type __n ) const [inline]
 

void _M_range_check ( size_type __n ) const [inline]
 

reference at ( size_type __n ) [inline]
 

const_reference at ( size_type __n ) const [inline]
 

reference front ( ) [inline]
 

reference back ( ) [inline]
 

const_reference front ( ) const [inline]
 

const_reference back ( ) const [inline]
 

size_type size ( ) const [inline]
 

size_type max_size ( ) const [inline]
 

bool empty ( ) const [inline]
 

void _M_initialize_dispatch ( _Integer __n,
_Integer __x,
__true_type ) [inline]
 

void _M_initialize_dispatch ( _InputIter __first,
_InputIter __last,
__false_type ) [inline]
 

deque & operator= ( const deque<_Tp, _Alloc> & __x ) [inline]
 

void swap ( deque<_Tp, _Alloc> & __x ) [inline]
 

void _M_fill_assign ( size_type __n,
const _Tp & __val ) [inline]
 

void assign ( size_type __n,
const _Tp & __val ) [inline]
 

void assign ( _InputIterator __first,
_InputIterator __last ) [inline]
 

void push_back ( const value_type & __t ) [inline]
 

void push_back ( ) [inline]
 

void push_front ( const value_type & __t ) [inline]
 

void push_front ( ) [inline]
 

void pop_back ( ) [inline]
 

void pop_front ( ) [inline]
 

iterator insert ( iterator position,
const value_type & __x ) [inline]
 

iterator insert ( iterator __position ) [inline]
 

void insert ( iterator __pos,
size_type __n,
const value_type & __x ) [inline]
 

void _M_fill_insert ( iterator __pos,
size_type __n,
const value_type & __x )
 

void insert ( iterator __pos,
_InputIterator __first,
_InputIterator __last ) [inline]
 

void _M_insert_dispatch ( iterator __pos,
_Integer __n,
_Integer __x,
__true_type ) [inline]
 

void _M_insert_dispatch ( iterator __pos,
_InputIterator __first,
_InputIterator __last,
__false_type ) [inline]
 

void resize ( size_type __new_size,
const value_type & __x ) [inline]
 

void resize ( size_type new_size ) [inline]
 

iterator erase ( iterator __pos ) [inline]
 

iterator erase ( iterator __first,
iterator __last )
 

void clear ( )
 

void _M_fill_initialize ( const value_type & __value ) [protected]
 

void _M_range_initialize ( _InputIterator __first,
_InputIterator __last,
input_iterator_tag ) [protected]
 

void _M_range_initialize ( _ForwardIterator __first,
_ForwardIterator __last,
forward_iterator_tag ) [protected]
 

void _M_push_back_aux ( const value_type & ) [protected]
 

void _M_push_back_aux ( ) [protected]
 

void _M_push_front_aux ( const value_type & ) [protected]
 

void _M_push_front_aux ( ) [protected]
 

void _M_pop_back_aux ( ) [protected]
 

void _M_pop_front_aux ( ) [protected]
 

void insert ( iterator __pos,
_InputIterator __first,
_InputIterator __last,
input_iterator_tag ) [protected]
 

void insert ( iterator __pos,
_ForwardIterator __first,
_ForwardIterator __last,
forward_iterator_tag ) [protected]
 

iterator _M_insert_aux ( iterator __pos,
const value_type & __x ) [protected]
 

iterator _M_insert_aux ( iterator __pos ) [protected]
 

void _M_insert_aux ( iterator __pos,
size_type __n,
const value_type & __x ) [protected]
 

void _M_insert_aux ( iterator __pos,
_ForwardIterator __first,
_ForwardIterator __last,
size_type __n ) [protected]
 

iterator _M_reserve_elements_at_front ( size_type __n ) [inline, protected]
 

iterator _M_reserve_elements_at_back ( size_type __n ) [inline, protected]
 

void _M_new_elements_at_front ( size_type __new_elements ) [protected]
 

void _M_new_elements_at_back ( size_type __new_elements ) [protected]
 

void _M_reserve_map_at_back ( size_type __nodes_to_add = 1 ) [inline, protected]
 

void _M_reserve_map_at_front ( size_type __nodes_to_add = 1 ) [inline, protected]
 

void _M_reallocate_map ( size_type __nodes_to_add,
bool __add_at_front ) [protected]
 


The documentation for this class was generated from the following file:
Generated at Fri Apr 6 15:54:34 2001 for libstdc++ by doxygen1.2.6 written by Dimitri van Heesch, © 1997-2001