Main Page Namespace List Class Hierarchy Alphabetical List Compound List File List Namespace Members Compound Members File Members
std::deque Member List
This is the complete list of members for std::deque, including all inherited members.
- _Deque_alloc_base(const allocator_type &__a)
[inline, protected]
- _Deque_base(const allocator_type &__a, size_t __num_elements)
[inline, protected]
- _Deque_base(const allocator_type &__a)
[inline, protected]
- _M_allocate_map(size_t __n)
[inline, protected]
- _M_allocate_node()
[inline, protected]
- _M_create_nodes(_Tp **__nstart, _Tp **__nfinish)
[protected]
- _M_deallocate_map(_Tp **__p, size_t __n)
[inline, protected]
- _M_deallocate_node(_Tp *__p)
[inline, protected]
- _M_destroy_nodes(_Tp **__nstart, _Tp **__nfinish)
[protected]
- _M_fill_assign(size_type __n, const _Tp &__val)
[inline]
- _M_fill_initialize(const value_type &__value)
[protected]
- _M_fill_insert(iterator __pos, size_type __n, const value_type &__x)
- _M_finish
[protected]
- _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
[inline]
- _M_initialize_dispatch(_InputIter __first, _InputIter __last, __false_type)
[inline]
- _M_initialize_map(size_t)
[protected]
- _M_insert_aux(iterator __pos, const value_type &__x)
[protected]
- _M_insert_aux(iterator __pos)
[protected]
- _M_insert_aux(iterator __pos, size_type __n, const value_type &__x)
[protected]
- _M_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n)
[protected]
- _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type)
[inline]
- _M_insert_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)
[inline]
- _M_map
[protected]
- _M_map_allocator
[protected]
- _M_map_size
[protected]
- _M_new_elements_at_back(size_type __new_elements)
[protected]
- _M_new_elements_at_front(size_type __new_elements)
[protected]
- _M_node_allocator
[protected]
- _M_pop_back_aux()
[protected]
- _M_pop_front_aux()
[protected]
- _M_push_back_aux(const value_type &)
[protected]
- _M_push_back_aux()
[protected]
- _M_push_front_aux(const value_type &)
[protected]
- _M_push_front_aux()
[protected]
- _M_range_check(size_type __n) const
[inline]
- _M_range_initialize(_InputIterator __first, _InputIterator __last, input_iterator_tag)
[protected]
- _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag)
[protected]
- _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front)
[protected]
- _M_reserve_elements_at_back(size_type __n)
[inline, protected]
- _M_reserve_elements_at_front(size_type __n)
[inline, protected]
- _M_reserve_map_at_back(size_type __nodes_to_add=1)
[inline, protected]
- _M_reserve_map_at_front(size_type __nodes_to_add=1)
[inline, protected]
- _M_start
[protected]
- _Map_allocator_type typedef
[protected]
- _Map_pointer typedef
[protected]
- _S_buffer_size()
[inline, protected, static]
- _S_initial_map_size enum value
[protected]
- allocator_type typedef
- assign(size_type __n, const _Tp &__val)
[inline]
- assign(_InputIterator __first, _InputIterator __last)
[inline]
- at(size_type __n)
[inline]
- at(size_type __n) const
[inline]
- back()
[inline]
- back() const
[inline]
- begin()
[inline]
- begin() const
[inline]
- clear()
- const_iterator typedef
- const_pointer typedef
- const_reference typedef
- const_reverse_iterator typedef
- deque(const allocator_type &__a=allocator_type())
[inline, explicit]
- deque(const deque &__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]
- difference_type typedef
- empty() const
[inline]
- end()
[inline]
- end() const
[inline]
- erase(iterator __pos)
[inline]
- erase(iterator __first, iterator __last)
- front()
[inline]
- front() const
[inline]
- get_allocator() const
[inline]
- insert(iterator position, const value_type &__x)
[inline]
- insert(iterator __position)
[inline]
- insert(iterator __pos, size_type __n, const value_type &__x)
[inline]
- insert(iterator __pos, _InputIterator __first, _InputIterator __last)
[inline]
- insert(iterator __pos, _InputIterator __first, _InputIterator __last, input_iterator_tag)
[protected]
- insert(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag)
[protected]
- iterator typedef
- max_size() const
[inline]
- operator=(const deque &__x)
[inline]
- operator[](size_type __n)
[inline]
- operator[](size_type __n) const
[inline]
- pointer typedef
- pop_back()
[inline]
- pop_front()
[inline]
- push_back(const value_type &__t)
[inline]
- push_back()
[inline]
- push_front(const value_type &__t)
[inline]
- push_front()
[inline]
- rbegin()
[inline]
- rbegin() const
[inline]
- reference typedef
- rend()
[inline]
- rend() const
[inline]
- resize(size_type __new_size, const value_type &__x)
[inline]
- resize(size_type new_size)
[inline]
- reverse_iterator typedef
- size() const
[inline]
- size_type typedef
- swap(deque &__x)
[inline]
- value_type typedef
- ~_Deque_base()
[protected]
- ~deque()
[inline]
Generated at Fri Apr 6 15:54:34 2001 for libstdc++ by
1.2.6 written by Dimitri van Heesch,
© 1997-2001