www.fifi.org     Documentation         Manpages         GNU Info         Debian document tree         Whole document tree     Trigance web page     Public services     User info     Mailing lists     Secure server     Multilingual usage   Copyright (C) 2000-2012 Philippe Troin <webmaster@fifi.org>. Validate HTML Validate CSS

Whole document tree                   std::deque< _Tp, _Alloc > Member List This is the complete list of members for std::deque< _Tp, _Alloc >, including all inherited members. __glibcpp_class_requires(_Tp, _SGIAssignableConcept) std::deque< _Tp, _Alloc > [private] _Base typedef std::deque< _Tp, _Alloc > [private] _Deque_alloc_base(const allocator_type &__a) std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [inline, protected] _Deque_base(const allocator_type &__a, size_t __num_elements) std::_Deque_base< _Tp, _Alloc > [inline, protected] _Deque_base(const allocator_type &__a) std::_Deque_base< _Tp, _Alloc > [inline, protected] _M_allocate_map(size_t __n) std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [inline, protected] _M_allocate_node() std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [inline, protected] _M_assign_aux(_InputIterator __first, _InputIterator __last, input_iterator_tag) std::deque< _Tp, _Alloc > [private] _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) std::deque< _Tp, _Alloc > [inline, private] _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) std::deque< _Tp, _Alloc > [inline, private] _M_assign_dispatch(_InputIterator __first, _InputIterator __last, __false_type) std::deque< _Tp, _Alloc > [inline, private] _M_create_nodes(_Tp **__nstart, _Tp **__nfinish) std::_Deque_base< _Tp, _Alloc > [protected] _M_deallocate_map(_Tp **__p, size_t __n) std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [inline, protected] _M_deallocate_node(_Tp *__p) std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [inline, protected] _M_destroy_nodes(_Tp **__nstart, _Tp **__nfinish) std::_Deque_base< _Tp, _Alloc > [protected] _M_fill_assign(size_type __n, const _Tp &__val) std::deque< _Tp, _Alloc > [inline] _M_fill_initialize(const value_type &__value) std::deque< _Tp, _Alloc > [protected] _M_fill_insert(iterator __pos, size_type __n, const value_type &__x) std::deque< _Tp, _Alloc > _M_finish std::_Deque_base< _Tp, _Alloc > [protected] _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) std::deque< _Tp, _Alloc > [inline] _M_initialize_dispatch(_InputIter __first, _InputIter __last, __false_type) std::deque< _Tp, _Alloc > [inline] _M_initialize_map(size_t) std::_Deque_base< _Tp, _Alloc > [protected] _M_insert_aux(iterator __pos, const value_type &__x) std::deque< _Tp, _Alloc > [protected] _M_insert_aux(iterator __pos) std::deque< _Tp, _Alloc > [protected] _M_insert_aux(iterator __pos, size_type __n, const value_type &__x) std::deque< _Tp, _Alloc > [protected] _M_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) std::deque< _Tp, _Alloc > [protected] _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) std::deque< _Tp, _Alloc > [inline] _M_insert_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) std::deque< _Tp, _Alloc > [inline] _M_map std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [protected] _M_map_allocator std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [protected] _M_map_size std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [protected] _M_new_elements_at_back(size_type __new_elements) std::deque< _Tp, _Alloc > [protected] _M_new_elements_at_front(size_type __new_elements) std::deque< _Tp, _Alloc > [protected] _M_node_allocator std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [protected] _M_pop_back_aux() std::deque< _Tp, _Alloc > [protected] _M_pop_front_aux() std::deque< _Tp, _Alloc > [protected] _M_push_back_aux(const value_type &) std::deque< _Tp, _Alloc > [protected] _M_push_back_aux() std::deque< _Tp, _Alloc > [protected] _M_push_front_aux(const value_type &) std::deque< _Tp, _Alloc > [protected] _M_push_front_aux() std::deque< _Tp, _Alloc > [protected] _M_range_check(size_type __n) const std::deque< _Tp, _Alloc > [inline] _M_range_initialize(_InputIterator __first, _InputIterator __last, input_iterator_tag) std::deque< _Tp, _Alloc > [protected] _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) std::deque< _Tp, _Alloc > [protected] _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front) std::deque< _Tp, _Alloc > [protected] _M_reserve_elements_at_back(size_type __n) std::deque< _Tp, _Alloc > [inline, protected] _M_reserve_elements_at_front(size_type __n) std::deque< _Tp, _Alloc > [inline, protected] _M_reserve_map_at_back(size_type __nodes_to_add=1) std::deque< _Tp, _Alloc > [inline, protected] _M_reserve_map_at_front(size_type __nodes_to_add=1) std::deque< _Tp, _Alloc > [inline, protected] _M_start std::_Deque_base< _Tp, _Alloc > [protected] _Map_allocator_type typedef std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless > [protected] _Map_pointer typedef std::deque< _Tp, _Alloc > [protected] _S_buffer_size() std::deque< _Tp, _Alloc > [inline, protected, static] _S_initial_map_size enum value std::_Deque_base< _Tp, _Alloc > [protected] allocator_type typedef std::deque< _Tp, _Alloc > assign(size_type __n, const _Tp &__val) std::deque< _Tp, _Alloc > [inline] assign(_InputIterator __first, _InputIterator __last) std::deque< _Tp, _Alloc > [inline] at(size_type __n) std::deque< _Tp, _Alloc > [inline] at(size_type __n) const std::deque< _Tp, _Alloc > [inline] back() std::deque< _Tp, _Alloc > [inline] back() const std::deque< _Tp, _Alloc > [inline] begin() std::deque< _Tp, _Alloc > [inline] begin() const std::deque< _Tp, _Alloc > [inline] clear() std::deque< _Tp, _Alloc > const_iterator typedef std::deque< _Tp, _Alloc > const_pointer typedef std::deque< _Tp, _Alloc > const_reference typedef std::deque< _Tp, _Alloc > const_reverse_iterator typedef std::deque< _Tp, _Alloc > deque(const allocator_type &__a=allocator_type()) std::deque< _Tp, _Alloc > [inline, explicit] deque(const deque &__x) std::deque< _Tp, _Alloc > [inline] deque(size_type __n, const value_type &__value, const allocator_type &__a=allocator_type()) std::deque< _Tp, _Alloc > [inline] deque(size_type __n) std::deque< _Tp, _Alloc > [inline, explicit] deque(_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type()) std::deque< _Tp, _Alloc > [inline] difference_type typedef std::deque< _Tp, _Alloc > empty() const std::deque< _Tp, _Alloc > [inline] end() std::deque< _Tp, _Alloc > [inline] end() const std::deque< _Tp, _Alloc > [inline] erase(iterator __pos) std::deque< _Tp, _Alloc > [inline] erase(iterator __first, iterator __last) std::deque< _Tp, _Alloc > front() std::deque< _Tp, _Alloc > [inline] front() const std::deque< _Tp, _Alloc > [inline] get_allocator() const std::deque< _Tp, _Alloc > [inline] insert(iterator position, const value_type &__x) std::deque< _Tp, _Alloc > [inline] insert(iterator __position) std::deque< _Tp, _Alloc > [inline] insert(iterator __pos, size_type __n, const value_type &__x) std::deque< _Tp, _Alloc > [inline] insert(iterator __pos, _InputIterator __first, _InputIterator __last) std::deque< _Tp, _Alloc > [inline] insert(iterator __pos, _InputIterator __first, _InputIterator __last, input_iterator_tag) std::deque< _Tp, _Alloc > [protected] insert(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) std::deque< _Tp, _Alloc > [protected] iterator typedef std::deque< _Tp, _Alloc > max_size() const std::deque< _Tp, _Alloc > [inline] operator=(const deque &__x) std::deque< _Tp, _Alloc > [inline] operator[](size_type __n) std::deque< _Tp, _Alloc > [inline] operator[](size_type __n) const std::deque< _Tp, _Alloc > [inline] pointer typedef std::deque< _Tp, _Alloc > pop_back() std::deque< _Tp, _Alloc > [inline] pop_front() std::deque< _Tp, _Alloc > [inline] push_back(const value_type &__t) std::deque< _Tp, _Alloc > [inline] push_back() std::deque< _Tp, _Alloc > [inline] push_front(const value_type &__t) std::deque< _Tp, _Alloc > [inline] push_front() std::deque< _Tp, _Alloc > [inline] rbegin() std::deque< _Tp, _Alloc > [inline] rbegin() const std::deque< _Tp, _Alloc > [inline] reference typedef std::deque< _Tp, _Alloc > rend() std::deque< _Tp, _Alloc > [inline] rend() const std::deque< _Tp, _Alloc > [inline] resize(size_type __new_size, const value_type &__x) std::deque< _Tp, _Alloc > [inline] resize(size_type new_size) std::deque< _Tp, _Alloc > [inline] reverse_iterator typedef std::deque< _Tp, _Alloc > size() const std::deque< _Tp, _Alloc > [inline] size_type typedef std::deque< _Tp, _Alloc > swap(deque &__x) std::deque< _Tp, _Alloc > [inline] value_type typedef std::deque< _Tp, _Alloc > ~_Deque_base() std::_Deque_base< _Tp, _Alloc > [protected] ~deque() std::deque< _Tp, _Alloc > [inline]