deque Class Reference

#include <stdapis/stlportv5/stl/_deque.h>

class deque
Public Member Type Definitions
typedef random_access_iterator_tag _Iterator_category
typedef_Base::const_iterator const_iterator
typedefconst value_type * const_pointer
typedefconst value_type & const_reference
typedef ptrdiff_t difference_type
typedef_Base::iterator iterator
typedef value_type * pointer
typedef value_type & reference
typedef size_t size_type
typedef_Tp value_type
Protected Member Type Definitions
typedef pointer * _Map_pointer
typedef __move_traits< _Tp >::implemented _Movable
typedef __type_traits< _Tp >::has_trivial_assignment_operator _TrivialAss
typedef __type_traits< _Tp >::has_trivial_copy_constructor _TrivialCpy
typedef _TrivialInit< _Tp >::_Ret _TrivialInit
Public Attributes
_STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS
Public Member Functions
deque(const allocator_type &)
deque(const _Self &)
deque(size_type)
deque(size_type, const value_type &, const allocator_type &)
deque(const value_type *, const value_type *, const allocator_type &)
deque(const_iterator, const_iterator, const allocator_type &)
deque(__move_source< _Self >)
~deque()
void_M_fill_assign(size_type, const _Tp &)
void_M_range_check(size_type)
voidassign(size_type, const _Tp &)
voidassign(const value_type *, const value_type *)
voidassign(const_iterator, const_iterator)
reference at(size_type)
const_reference at(size_type)
reference back()
const_reference back()
iterator begin()
const_iterator begin()
voidclear()
boolempty()
iterator end()
const_iterator end()
iterator erase(iterator)
iterator erase(iterator, iterator)
reference front()
const_reference front()
allocator_type get_allocator()
iterator insert(iterator, const value_type &)
voidinsert(iterator, size_type, const value_type &)
voidinsert(iterator, const value_type *, const value_type *)
voidinsert(iterator, const_iterator, const_iterator)
size_type max_size()
_Self &operator=(const _Self &)
reference operator[](size_type)
const_reference operator[](size_type)
voidpop_back()
voidpop_front()
voidpush_back(const value_type &)
voidpush_front(const value_type &)
reverse_iterator rbegin()
const_reverse_iteratorrbegin()
reverse_iterator rend()
const_reverse_iteratorrend()
voidresize(size_type, const value_type &)
size_type size()
voidswap(_Self &)
Protected Member Functions
iterator _M_erase(iterator, const __true_type &)
iterator _M_erase(iterator, const __false_type &)
iterator _M_erase(iterator, iterator, const __true_type &)
iterator _M_erase(iterator, iterator, const __false_type &)
void_M_fill_initialize(const value_type &, const __true_type &)
void_M_fill_initialize(const value_type &, const __false_type &)
void_M_fill_insert(iterator, size_type, const value_type &)
iterator _M_fill_insert_aux(iterator, size_type, const value_type &, const __true_type &)
iterator _M_fill_insert_aux(iterator, size_type, const value_type &, const __false_type &)
void_M_insert_range_aux(iterator, const value_type *, const value_type *, size_type, const __true_type &)
void_M_insert_range_aux(iterator, const value_type *, const value_type *, size_type, const __false_type &)
void_M_insert_range_aux(iterator, const_iterator, const_iterator, size_type, const __true_type &)
void_M_insert_range_aux(iterator, const_iterator, const_iterator, size_type, const __false_type &)
void_M_new_elements_at_back(size_type)
void_M_new_elements_at_front(size_type)
void_M_pop_back_aux()
void_M_pop_front_aux()
void_M_push_back_aux_v(const value_type &)
void_M_push_front_aux_v(const value_type &)
void_M_reallocate_map(size_type, bool)
iterator _M_reserve_elements_at_back(size_type)
iterator _M_reserve_elements_at_front(size_type)
void_M_reserve_map_at_back(size_type)
void_M_reserve_map_at_front(size_type)

Member Type Definition Documentation

Typedef _Iterator_category

typedef random_access_iterator_tag _Iterator_category

Typedef _Map_pointer

typedef pointer *_Map_pointer[protected]

Typedef _Movable

typedef __move_traits< _Tp >::implemented_Movable[protected]

Typedef _TrivialAss

typedef __type_traits< _Tp >::has_trivial_assignment_operator_TrivialAss[protected]

Typedef _TrivialCpy

typedef __type_traits< _Tp >::has_trivial_copy_constructor_TrivialCpy[protected]

Typedef _TrivialInit

typedef _TrivialInit< _Tp >::_Ret_TrivialInit[protected]

Typedef const_iterator

typedef _Base::const_iteratorconst_iterator

Typedef const_pointer

typedef const value_type *const_pointer

Typedef const_reference

typedef const value_type &const_reference

Typedef difference_type

typedef ptrdiff_t difference_type

Typedef iterator

typedef _Base::iteratoriterator

Typedef pointer

typedef value_type *pointer

Typedef reference

typedef value_type &reference

Typedef size_type

typedef size_t size_type

Typedef value_type

typedef _Tpvalue_type

Member Attribute Documentation

_STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS

_STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS

Constructor & Destructor Documentation

deque ( const allocator_type & )

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

deque ( const _Self & )

deque(const _Self &__x)[inline]

deque ( size_type )

deque(size_type__n)[inline, explicit]

deque ( size_type, const value_type &, const allocator_type & )

deque(size_type__n,
const value_type &__val,
const allocator_type &__a =  allocator_type()
)[inline]

deque ( const value_type *, const value_type *, const allocator_type & )

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

deque ( const_iterator, const_iterator, const allocator_type & )

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

deque ( __move_source< _Self > )

deque(__move_source< _Self >src)[inline]

~deque ( )

~deque()[inline]

Member Function Documentation

_M_erase ( iterator, const __true_type & )

iterator _M_erase(iterator__pos,
const __true_type &
)[protected]

_M_erase ( iterator, const __false_type & )

iterator _M_erase(iterator__pos,
const __false_type &
)[protected]

_M_erase ( iterator, iterator, const __true_type & )

iterator _M_erase(iterator__first,
iterator__last,
const __true_type &
)[protected]

_M_erase ( iterator, iterator, const __false_type & )

iterator _M_erase(iterator__first,
iterator__last,
const __false_type &
)[protected]

_M_fill_assign ( size_type, const _Tp & )

void_M_fill_assign(size_type__n,
const _Tp &__val
)[inline]

_M_fill_initialize ( const value_type &, const __true_type & )

void_M_fill_initialize(const value_type &__val,
const __true_type &
)[protected, inline]

_M_fill_initialize ( const value_type &, const __false_type & )

void_M_fill_initialize(const value_type &__val,
const __false_type &
)[protected]

_M_fill_insert ( iterator, size_type, const value_type & )

void_M_fill_insert(iterator__pos,
size_type__n,
const value_type &__x
)[protected]

_M_fill_insert_aux ( iterator, size_type, const value_type &, const __true_type & )

iterator _M_fill_insert_aux(iterator__pos,
size_type__n,
const value_type &__x,
const __true_type &
)[protected]

_M_fill_insert_aux ( iterator, size_type, const value_type &, const __false_type & )

iterator _M_fill_insert_aux(iterator__pos,
size_type__n,
const value_type &__x,
const __false_type &
)[protected]

_M_insert_range_aux ( iterator, const value_type *, const value_type *, size_type, const __true_type & )

void_M_insert_range_aux(iterator__pos,
const value_type *__first,
const value_type *__last,
size_type__n,
const __true_type &
)[protected]

_M_insert_range_aux ( iterator, const value_type *, const value_type *, size_type, const __false_type & )

void_M_insert_range_aux(iterator__pos,
const value_type *__first,
const value_type *__last,
size_type__n,
const __false_type &
)[protected]

_M_insert_range_aux ( iterator, const_iterator, const_iterator, size_type, const __true_type & )

void_M_insert_range_aux(iterator__pos,
const_iterator__first,
const_iterator__last,
size_type__n,
const __true_type &
)[protected]

_M_insert_range_aux ( iterator, const_iterator, const_iterator, size_type, const __false_type & )

void_M_insert_range_aux(iterator__pos,
const_iterator__first,
const_iterator__last,
size_type__n,
const __false_type &
)[protected]

_M_new_elements_at_back ( size_type )

void_M_new_elements_at_back(size_type__new_elements)[protected]

_M_new_elements_at_front ( size_type )

void_M_new_elements_at_front(size_type__new_elements)[protected]

_M_pop_back_aux ( )

void_M_pop_back_aux()[protected]

_M_pop_front_aux ( )

void_M_pop_front_aux()[protected]

_M_push_back_aux_v ( const value_type & )

void_M_push_back_aux_v(const value_type &)[protected]

_M_push_front_aux_v ( const value_type & )

void_M_push_front_aux_v(const value_type &)[protected]

_M_range_check ( size_type )

void_M_range_check(size_type__n)const [inline]

_M_reallocate_map ( size_type, bool )

void_M_reallocate_map(size_type__nodes_to_add,
bool__add_at_front
)[protected]

_M_reserve_elements_at_back ( size_type )

iterator _M_reserve_elements_at_back(size_type__n)[protected, inline]

_M_reserve_elements_at_front ( size_type )

iterator _M_reserve_elements_at_front(size_type__n)[protected, inline]

_M_reserve_map_at_back ( size_type )

void_M_reserve_map_at_back(size_type__nodes_to_add = 1)[protected, inline]

_M_reserve_map_at_front ( size_type )

void_M_reserve_map_at_front(size_type__nodes_to_add = 1)[protected, inline]

assign ( size_type, const _Tp & )

voidassign(size_type__n,
const _Tp &__val
)[inline]

assign ( const value_type *, const value_type * )

voidassign(const value_type *__first,
const value_type *__last
)[inline]

assign ( const_iterator, const_iterator )

voidassign(const_iterator__first,
const_iterator__last
)[inline]

at ( size_type )

reference at(size_type__n)[inline]

at ( size_type )

const_reference at(size_type__n)const [inline]

back ( )

reference back()[inline]

back ( )

const_reference back()const [inline]

begin ( )

iterator begin()[inline]

begin ( )

const_iterator begin()const [inline]

clear ( )

voidclear()

empty ( )

boolempty()const [inline]

end ( )

iterator end()[inline]

end ( )

const_iterator end()const [inline]

erase ( iterator )

iterator erase(iterator__pos)[inline]

erase ( iterator, iterator )

iterator erase(iterator__first,
iterator__last
)[inline]

front ( )

reference front()[inline]

front ( )

const_reference front()const [inline]

get_allocator ( )

allocator_type get_allocator()const [inline]

insert ( iterator, const value_type & )

iterator insert(iterator__pos,
const value_type &__x = _STLP_DEFAULT_CONSTRUCTED(_Tp)
)[inline]

insert ( iterator, size_type, const value_type & )

voidinsert(iterator__pos,
size_type__n,
const value_type &__x
)[inline]

insert ( iterator, const value_type *, const value_type * )

voidinsert(iterator__pos,
const value_type *__first,
const value_type *__last
)

insert ( iterator, const_iterator, const_iterator )

voidinsert(iterator__pos,
const_iterator__first,
const_iterator__last
)

max_size ( )

size_type max_size()const [inline]

operator= ( const _Self & )

_Self &operator=(const _Self &__x)

operator[] ( size_type )

reference operator[](size_type__n)[inline]

operator[] ( size_type )

const_reference operator[](size_type__n)const [inline]

pop_back ( )

voidpop_back()[inline]

pop_front ( )

voidpop_front()[inline]

push_back ( const value_type & )

voidpush_back(const value_type &__t = _STLP_DEFAULT_CONSTRUCTED(_Tp))[inline]

push_front ( const value_type & )

voidpush_front(const value_type &__t = _STLP_DEFAULT_CONSTRUCTED(_Tp))[inline]

rbegin ( )

reverse_iterator rbegin()[inline]

rbegin ( )

const_reverse_iteratorrbegin()const [inline]

rend ( )

reverse_iterator rend()[inline]

rend ( )

const_reverse_iteratorrend()const [inline]

resize ( size_type, const value_type & )

voidresize(size_type__new_size,
const value_type &__x = _STLP_DEFAULT_CONSTRUCTED(_Tp)
)[inline]

size ( )

size_type size()const [inline]

swap ( _Self & )

voidswap(_Self &__x)[inline]
© Nokia 2011.