|
|
Whole document tree
Templatestd::deque class Reference
Main Page Namespace List Class Hierarchy Alphabetical List Compound List File List Namespace Members Compound Members File Members
std::deque< _Tp, _Alloc > Class Template Reference#include <stl_deque.h>
Inheritance diagram for std::deque:
[legend]Collaboration diagram for std::deque< _Tp, _Alloc >:
[legend]List of all members.
Public Types |
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 |
typedef _Base::iterator | iterator |
typedef _Base::const_iterator | const_iterator |
typedef reverse_iterator<
const_iterator > | const_reverse_iterator |
typedef reverse_iterator<
iterator > | reverse_iterator |
Public Methods |
allocator_type | get_allocator () const |
iterator | begin () |
iterator | end () |
const_iterator | begin () const |
const_iterator | end () const |
reverse_iterator | rbegin () |
reverse_iterator | rend () |
const_reverse_iterator | rbegin () const |
const_reverse_iterator | rend () const |
reference | operator[] (size_type __n) |
const_reference | operator[] (size_type __n) const |
void | _M_range_check (size_type __n) const |
reference | at (size_type __n) |
const_reference | at (size_type __n) const |
reference | front () |
reference | back () |
const_reference | front () const |
const_reference | back () const |
size_type | size () const |
size_type | max_size () const |
bool | empty () const |
| deque (const allocator_type &__a=allocator_type()) |
| deque (const deque &__x) |
| deque (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type()) |
| deque (size_type __n) |
template<class _InputIterator> | deque (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type()) |
template<class _Integer> void | _M_initialize_dispatch (_Integer __n, _Integer __x, __true_type) |
template<class _InputIter> void | _M_initialize_dispatch (_InputIter __first, _InputIter __last, __false_type) |
| ~deque () |
deque & | operator= (const deque &__x) |
void | swap (deque &__x) |
void | _M_fill_assign (size_type __n, const _Tp &__val) |
void | assign (size_type __n, const _Tp &__val) |
template<class _InputIterator> void | assign (_InputIterator __first, _InputIterator __last) |
void | push_back (const value_type &__t) |
void | push_back () |
void | push_front (const value_type &__t) |
void | push_front () |
void | pop_back () |
void | pop_front () |
iterator | insert (iterator position, const value_type &__x) |
iterator | insert (iterator __position) |
void | insert (iterator __pos, size_type __n, const value_type &__x) |
void | _M_fill_insert (iterator __pos, size_type __n, const value_type &__x) |
template<class _InputIterator> void | insert (iterator __pos, _InputIterator __first, _InputIterator __last) |
template<class _Integer> void | _M_insert_dispatch (iterator __pos, _Integer __n, _Integer __x, __true_type) |
template<class _InputIterator> void | _M_insert_dispatch (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) |
void | resize (size_type __new_size, const value_type &__x) |
void | resize (size_type new_size) |
iterator | erase (iterator __pos) |
iterator | erase (iterator __first, iterator __last) |
void | clear () |
Protected Types |
typedef pointer * | _Map_pointer |
Protected Methods |
void | _M_fill_initialize (const value_type &__value) |
template<class _InputIterator> void | _M_range_initialize (_InputIterator __first, _InputIterator __last, input_iterator_tag) |
template<class _ForwardIterator> void | _M_range_initialize (_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) |
void | _M_push_back_aux (const value_type &) |
void | _M_push_back_aux () |
void | _M_push_front_aux (const value_type &) |
void | _M_push_front_aux () |
void | _M_pop_back_aux () |
void | _M_pop_front_aux () |
template<class _InputIterator> void | insert (iterator __pos, _InputIterator __first, _InputIterator __last, input_iterator_tag) |
template<class _ForwardIterator> void | insert (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) |
iterator | _M_insert_aux (iterator __pos, const value_type &__x) |
iterator | _M_insert_aux (iterator __pos) |
void | _M_insert_aux (iterator __pos, size_type __n, const value_type &__x) |
template<class _ForwardIterator> void | _M_insert_aux (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) |
iterator | _M_reserve_elements_at_front (size_type __n) |
iterator | _M_reserve_elements_at_back (size_type __n) |
void | _M_new_elements_at_front (size_type __new_elements) |
void | _M_new_elements_at_back (size_type __new_elements) |
void | _M_reserve_map_at_back (size_type __nodes_to_add=1) |
void | _M_reserve_map_at_front (size_type __nodes_to_add=1) |
void | _M_reallocate_map (size_type __nodes_to_add, bool __add_at_front) |
Static Protected Methods |
size_t | _S_buffer_size () |
Private Types |
typedef _Deque_base< _Tp,
_Alloc > | _Base |
Private Methods |
| __glibcpp_class_requires (_Tp, _SGIAssignableConcept) |
template<class _Integer> void | _M_assign_dispatch (_Integer __n, _Integer __val, __true_type) |
template<class _InputIterator> void | _M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type) |
template<class _InputIterator> void | _M_assign_aux (_InputIterator __first, _InputIterator __last, input_iterator_tag) |
template<class _ForwardIterator> void | _M_assign_aux (_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) |
template<class _Tp, class _Alloc = allocator<_Tp>>
class std::deque< _Tp, _Alloc >
Member Typedef Documentation
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef _Deque_base<_Tp, _Alloc> std::deque< _Tp, _Alloc >::_Base [private]
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef pointer* std::deque< _Tp, _Alloc >::_Map_pointer [protected]
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef _Base::allocator_type std::deque< _Tp, _Alloc >::allocator_type
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef _Base::const_iterator std::deque< _Tp, _Alloc >::const_iterator
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef const value_type* std::deque< _Tp, _Alloc >::const_pointer
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef const value_type& std::deque< _Tp, _Alloc >::const_reference
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef ptrdiff_t std::deque< _Tp, _Alloc >::difference_type
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef _Base::iterator std::deque< _Tp, _Alloc >::iterator
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef value_type* std::deque< _Tp, _Alloc >::pointer
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef value_type& std::deque< _Tp, _Alloc >::reference
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef reverse_iterator<iterator> std::deque< _Tp, _Alloc >::reverse_iterator
|
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef size_t std::deque< _Tp, _Alloc >::size_type
|
|
|
Definition at line 396 of file stl_deque.h.
Referenced by std::deque< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_assign_dispatch(), std::deque< _Tp, _Alloc >::_M_fill_assign(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_insert_dispatch(), std::deque< _Tp, _Alloc >::_M_new_elements_at_back(), std::deque< _Tp, _Alloc >::_M_new_elements_at_front(), std::deque< _Tp, _Alloc >::_M_range_initialize(), std::deque< _Tp, _Alloc >::_M_reallocate_map(), std::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), std::deque< _Tp, _Alloc >::_M_reserve_map_at_back(), std::deque< _Tp, _Alloc >::at(), std::deque< _Tp, _Alloc >::empty(), std::deque< _Tp, _Alloc >::erase(), std::deque< _Tp, _Alloc >::insert(), and std::deque< _Tp, _Alloc >::operator[](). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
typedef _Tp std::deque< _Tp, _Alloc >::value_type
|
|
|
Definition at line 391 of file stl_deque.h.
Referenced by std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_insert_dispatch(), std::deque< _Tp, _Alloc >::_M_push_back_aux(), std::deque< _Tp, _Alloc >::_M_push_front_aux(), std::deque< _Tp, _Alloc >::insert(), and std::deque< _Tp, _Alloc >::push_back(). |
Constructor & Destructor Documentation
template<class _Tp, class _Alloc = allocator<_Tp>> |
std::deque< _Tp, _Alloc >::deque |
( |
const allocator_type & |
__a = allocator_type() |
) |
[inline, explicit] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
std::deque< _Tp, _Alloc >::deque |
( |
const deque< _Tp, _Alloc > & |
__x |
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
std::deque< _Tp, _Alloc >::deque |
( |
size_type |
__n |
) |
[inline, explicit] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _InputIterator> |
std::deque< _Tp, _Alloc >::deque |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
const allocator_type & |
__a = allocator_type() |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
std::deque< _Tp, _Alloc >::~deque |
( |
|
) |
[inline] |
|
Member Function Documentation
template<class _Tp, class _Alloc = allocator<_Tp>> |
std::deque< _Tp, _Alloc >::__glibcpp_class_requires |
( |
_Tp |
, |
|
|
_SGIAssignableConcept |
|
|
) |
[private] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _ForwardIterator> |
void std::deque< _Tp, _Alloc >::_M_assign_aux |
( |
_ForwardIterator |
__first, |
|
|
_ForwardIterator |
__last, |
|
|
forward_iterator_tag |
|
|
) |
[inline, private] |
|
|
Definition at line 570 of file stl_deque.h.
References advance(), std::deque< _Tp, _Alloc >::begin(), std::copy(), distance(), std::deque< _Tp, _Alloc >::end(), std::deque< _Tp, _Alloc >::erase(), std::deque< _Tp, _Alloc >::insert(), std::deque< _Tp, _Alloc >::size(), and std::deque< _Tp, _Alloc >::size_type. |
template<class _Tp, class _Alloc> |
template<class _InputIter> |
void std::deque< _Tp, _Alloc >::_M_assign_aux |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
input_iterator_tag |
|
|
) |
[private] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _InputIterator> |
void std::deque< _Tp, _Alloc >::_M_assign_dispatch |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
__false_type |
|
|
) |
[inline, private] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _Integer> |
void std::deque< _Tp, _Alloc >::_M_assign_dispatch |
( |
_Integer |
__n, |
|
|
_Integer |
__val, |
|
|
__true_type |
|
|
) |
[inline, private] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::_M_fill_assign |
( |
size_type |
__n, |
|
|
const _Tp & |
__val |
|
) |
[inline] |
|
|
Definition at line 532 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::begin(), std::deque< _Tp, _Alloc >::end(), std::deque< _Tp, _Alloc >::erase(), std::fill(), std::deque< _Tp, _Alloc >::insert(), std::deque< _Tp, _Alloc >::size(), and std::deque< _Tp, _Alloc >::size_type.
Referenced by std::deque< _Tp, _Alloc >::_M_assign_dispatch(). |
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_fill_initialize |
( |
const value_type & |
__value |
) |
[protected] |
|
|
Definition at line 887 of file stl_deque.h.
References __STL_UNWIND, std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::_Map_pointer, std::deque< _Tp, _Alloc >::_S_buffer_size(), std::destroy(), std::deque< _Tp, _Alloc >::iterator, and std::uninitialized_fill().
Referenced by std::deque< _Tp, _Alloc >::_M_initialize_dispatch(), and std::deque< _Tp, _Alloc >::deque(). |
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_fill_insert |
( |
iterator |
__pos, |
|
|
size_type |
__n, |
|
|
const value_type & |
__x |
|
) |
|
|
|
Definition at line 810 of file stl_deque.h.
References __STL_UNWIND, std::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_reserve_elements_at_back(), std::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), std::_Deque_base< _Tp, _Alloc >::_M_start, and std::uninitialized_fill().
Referenced by std::deque< _Tp, _Alloc >::_M_insert_dispatch(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _InputIter> |
void std::deque< _Tp, _Alloc >::_M_initialize_dispatch |
( |
_InputIter |
__first, |
|
|
_InputIter |
__last, |
|
|
__false_type |
|
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _Integer> |
void std::deque< _Tp, _Alloc >::_M_initialize_dispatch |
( |
_Integer |
__n, |
|
|
_Integer |
__x, |
|
|
__true_type |
|
|
) |
[inline] |
|
template<class _Tp, class _Alloc> |
template<class _ForwardIterator> |
void std::deque< _Tp, _Alloc >::_M_insert_aux |
( |
iterator |
__pos, |
|
|
_ForwardIterator |
__first, |
|
|
_ForwardIterator |
__last, |
|
|
size_type |
__n |
|
) |
[protected] |
|
|
Definition at line 1166 of file stl_deque.h.
References __STL_UNWIND, std::__uninitialized_copy_copy(), std::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::deque< _Tp, _Alloc >::_M_reserve_elements_at_back(), std::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), std::_Deque_base< _Tp, _Alloc >::_M_start, advance(), std::copy(), std::copy_backward(), std::deque< _Tp, _Alloc >::difference_type, std::deque< _Tp, _Alloc >::size(), std::deque< _Tp, _Alloc >::size_type, and std::uninitialized_copy(). |
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_insert_aux |
( |
iterator |
__pos, |
|
|
size_type |
__n, |
|
|
const value_type & |
__x |
|
) |
[protected] |
|
|
Definition at line 1111 of file stl_deque.h.
References __STL_UNWIND, std::__uninitialized_copy_fill(), std::__uninitialized_fill_copy(), std::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::deque< _Tp, _Alloc >::_M_reserve_elements_at_back(), std::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), std::_Deque_base< _Tp, _Alloc >::_M_start, std::copy(), std::copy_backward(), std::deque< _Tp, _Alloc >::difference_type, std::fill(), std::deque< _Tp, _Alloc >::size(), std::deque< _Tp, _Alloc >::size_type, std::uninitialized_copy(), and std::deque< _Tp, _Alloc >::value_type. |
template<class _Tp, class _Alloc> |
deque< _Tp, _Alloc >::iterator std::deque< _Tp, _Alloc >::_M_insert_aux |
( |
iterator |
__pos |
) |
[protected] |
|
|
Definition at line 1083 of file stl_deque.h.
References std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::back(), std::copy(), std::copy_backward(), std::deque< _Tp, _Alloc >::difference_type, std::deque< _Tp, _Alloc >::front(), std::deque< _Tp, _Alloc >::push_back(), std::deque< _Tp, _Alloc >::push_front(), std::deque< _Tp, _Alloc >::size(), and std::deque< _Tp, _Alloc >::value_type. |
template<class _Tp, class _Alloc> |
deque< _Tp, _Alloc >::iterator std::deque< _Tp, _Alloc >::_M_insert_aux |
( |
iterator |
__pos, |
|
|
const value_type & |
__x |
|
) |
[protected] |
|
|
Definition at line 1053 of file stl_deque.h.
References std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::back(), std::copy(), std::copy_backward(), std::deque< _Tp, _Alloc >::difference_type, std::deque< _Tp, _Alloc >::front(), std::deque< _Tp, _Alloc >::push_back(), std::deque< _Tp, _Alloc >::push_front(), std::deque< _Tp, _Alloc >::size(), and std::deque< _Tp, _Alloc >::value_type.
Referenced by std::deque< _Tp, _Alloc >::_M_fill_insert(), and std::deque< _Tp, _Alloc >::insert(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _InputIterator> |
void std::deque< _Tp, _Alloc >::_M_insert_dispatch |
( |
iterator |
__pos, |
|
|
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
__false_type |
|
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _Integer> |
void std::deque< _Tp, _Alloc >::_M_insert_dispatch |
( |
iterator |
__pos, |
|
|
_Integer |
__n, |
|
|
_Integer |
__x, |
|
|
__true_type |
|
|
) |
[inline] |
|
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_new_elements_at_back |
( |
size_type |
__new_elements |
) |
[protected] |
|
|
Definition at line 1244 of file stl_deque.h.
References std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_allocate_node(), std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_deallocate_node(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::deque< _Tp, _Alloc >::_M_reserve_map_at_back(), std::deque< _Tp, _Alloc >::_S_buffer_size(), and std::deque< _Tp, _Alloc >::size_type. |
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_new_elements_at_front |
( |
size_type |
__new_elements |
) |
[protected] |
|
|
Definition at line 1224 of file stl_deque.h.
References std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_allocate_node(), std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_deallocate_node(), std::deque< _Tp, _Alloc >::_M_reserve_map_at_front(), std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::_S_buffer_size(), and std::deque< _Tp, _Alloc >::size_type. |
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_pop_back_aux |
( |
|
) |
[protected] |
|
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_pop_front_aux |
( |
|
) |
[protected] |
|
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_push_back_aux |
( |
|
) |
[protected] |
|
|
Definition at line 951 of file stl_deque.h.
References __STL_UNWIND, std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_allocate_node(), std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_deallocate_node(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::deque< _Tp, _Alloc >::_M_reserve_map_at_back(), and std::construct().
Referenced by std::deque< _Tp, _Alloc >::push_back(). |
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_push_back_aux |
( |
const value_type & |
|
) |
[protected] |
|
|
Definition at line 936 of file stl_deque.h.
References __STL_UNWIND, std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_allocate_node(), std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_deallocate_node(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::deque< _Tp, _Alloc >::_M_reserve_map_at_back(), std::construct(), and std::deque< _Tp, _Alloc >::value_type. |
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_push_front_aux |
( |
|
) |
[protected] |
|
|
Definition at line 980 of file stl_deque.h.
References __STL_UNWIND, std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_allocate_node(), std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_deallocate_node(), std::deque< _Tp, _Alloc >::_M_reserve_map_at_front(), std::_Deque_base< _Tp, _Alloc >::_M_start, and std::construct(). |
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_push_front_aux |
( |
const value_type & |
|
) |
[protected] |
|
|
Definition at line 965 of file stl_deque.h.
References __STL_UNWIND, std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_allocate_node(), std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_deallocate_node(), std::deque< _Tp, _Alloc >::_M_reserve_map_at_front(), std::_Deque_base< _Tp, _Alloc >::_M_start, std::construct(), and std::deque< _Tp, _Alloc >::value_type. |
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::_M_range_check |
( |
size_type |
__n |
) |
const [inline] |
|
template<class _Tp, class _Alloc> |
template<class _ForwardIterator> |
void std::deque< _Tp, _Alloc >::_M_range_initialize |
( |
_ForwardIterator |
__first, |
|
|
_ForwardIterator |
__last, |
|
|
forward_iterator_tag |
|
|
) |
[protected] |
|
|
Definition at line 911 of file stl_deque.h.
References __STL_UNWIND, std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::_Map_pointer, std::deque< _Tp, _Alloc >::_S_buffer_size(), advance(), std::destroy(), distance(), std::deque< _Tp, _Alloc >::iterator, std::deque< _Tp, _Alloc >::size_type, and std::uninitialized_copy(). |
template<class _Tp, class _Alloc> |
template<class _InputIterator> |
void std::deque< _Tp, _Alloc >::_M_range_initialize |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
input_iterator_tag |
|
|
) |
[protected] |
|
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::_M_reallocate_map |
( |
size_type |
__nodes_to_add, |
|
|
bool |
__add_at_front |
|
) |
[protected] |
|
|
Definition at line 1264 of file stl_deque.h.
References std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_allocate_map(), std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_deallocate_map(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_map, std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_map_size, std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::_Map_pointer, std::copy(), std::copy_backward(), std::max(), and std::deque< _Tp, _Alloc >::size_type.
Referenced by std::deque< _Tp, _Alloc >::_M_reserve_map_at_back(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
iterator std::deque< _Tp, _Alloc >::_M_reserve_elements_at_back |
( |
size_type |
__n |
) |
[inline, protected] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
iterator std::deque< _Tp, _Alloc >::_M_reserve_elements_at_front |
( |
size_type |
__n |
) |
[inline, protected] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::_M_reserve_map_at_back |
( |
size_type |
__nodes_to_add = 1 |
) |
[inline, protected] |
|
|
Definition at line 780 of file stl_deque.h.
References std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_map, std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_map_size, std::deque< _Tp, _Alloc >::_M_reallocate_map(), and std::deque< _Tp, _Alloc >::size_type.
Referenced by std::deque< _Tp, _Alloc >::_M_new_elements_at_back(), and std::deque< _Tp, _Alloc >::_M_push_back_aux(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::_M_reserve_map_at_front |
( |
size_type |
__nodes_to_add = 1 |
) |
[inline, protected] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
size_t std::deque< _Tp, _Alloc >::_S_buffer_size |
( |
|
) |
[inline, static, protected] |
|
|
Definition at line 411 of file stl_deque.h.
References std::__deque_buf_size(), std::deque< _Tp, _Alloc >::_Map_pointer, and std::deque< _Tp, _Alloc >::pointer.
Referenced by std::deque< _Tp, _Alloc >::_M_fill_initialize(), std::deque< _Tp, _Alloc >::_M_new_elements_at_back(), std::deque< _Tp, _Alloc >::_M_new_elements_at_front(), std::deque< _Tp, _Alloc >::_M_range_initialize(), and std::deque< _Tp, _Alloc >::clear(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _InputIterator> |
void std::deque< _Tp, _Alloc >::assign |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::assign |
( |
size_type |
__n, |
|
|
const _Tp & |
__val |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
const_reference std::deque< _Tp, _Alloc >::at |
( |
size_type |
__n |
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
reference std::deque< _Tp, _Alloc >::at |
( |
size_type |
__n |
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
const_reference std::deque< _Tp, _Alloc >::back |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
reference std::deque< _Tp, _Alloc >::back |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
const_iterator std::deque< _Tp, _Alloc >::begin |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
iterator std::deque< _Tp, _Alloc >::begin |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc> |
void std::deque< _Tp, _Alloc >::clear |
( |
|
) |
|
|
|
Definition at line 864 of file stl_deque.h.
References std::_Deque_alloc_base< _Tp, _Alloc, _Alloc_traits< _Tp, _Alloc >::_S_instanceless >::_M_deallocate_node(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::_Map_pointer, std::deque< _Tp, _Alloc >::_S_buffer_size(), and std::destroy().
Referenced by std::deque< _Tp, _Alloc >::_M_range_initialize(), and std::deque< _Tp, _Alloc >::erase(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
bool std::deque< _Tp, _Alloc >::empty |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
const_iterator std::deque< _Tp, _Alloc >::end |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
iterator std::deque< _Tp, _Alloc >::end |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc> |
deque< _Tp, _Alloc >::iterator std::deque< _Tp, _Alloc >::erase |
( |
iterator |
__first, |
|
|
iterator |
__last |
|
) |
|
|
|
Definition at line 836 of file stl_deque.h.
References std::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::clear(), std::copy(), std::copy_backward(), std::destroy(), std::deque< _Tp, _Alloc >::difference_type, and std::deque< _Tp, _Alloc >::size(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
iterator std::deque< _Tp, _Alloc >::erase |
( |
iterator |
__pos |
) |
[inline] |
|
|
Definition at line 698 of file stl_deque.h.
References std::_Deque_base< _Tp, _Alloc >::_M_finish, std::_Deque_base< _Tp, _Alloc >::_M_start, std::copy(), std::copy_backward(), std::deque< _Tp, _Alloc >::pop_back(), std::deque< _Tp, _Alloc >::pop_front(), and std::deque< _Tp, _Alloc >::size_type.
Referenced by std::deque< _Tp, _Alloc >::_M_assign_aux(), and std::deque< _Tp, _Alloc >::_M_fill_assign(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
const_reference std::deque< _Tp, _Alloc >::front |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
reference std::deque< _Tp, _Alloc >::front |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
allocator_type std::deque< _Tp, _Alloc >::get_allocator |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc> |
template<class _ForwardIterator> |
void std::deque< _Tp, _Alloc >::insert |
( |
iterator |
__pos, |
|
|
_ForwardIterator |
__first, |
|
|
_ForwardIterator |
__last, |
|
|
forward_iterator_tag |
|
|
) |
[protected] |
|
|
Definition at line 1025 of file stl_deque.h.
References __STL_UNWIND, std::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), std::_Deque_base< _Tp, _Alloc >::_M_finish, std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_reserve_elements_at_back(), std::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), std::_Deque_base< _Tp, _Alloc >::_M_start, distance(), std::deque< _Tp, _Alloc >::size_type, and std::uninitialized_copy(). |
template<class _Tp, class _Alloc> |
template<class _InputIterator> |
void std::deque< _Tp, _Alloc >::insert |
( |
iterator |
__pos, |
|
|
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
input_iterator_tag |
|
|
) |
[protected] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
template<class _InputIterator> |
void std::deque< _Tp, _Alloc >::insert |
( |
iterator |
__pos, |
|
|
_InputIterator |
__first, |
|
|
_InputIterator |
__last |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::insert |
( |
iterator |
__pos, |
|
|
size_type |
__n, |
|
|
const value_type & |
__x |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
iterator std::deque< _Tp, _Alloc >::insert |
( |
iterator |
__position |
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
iterator std::deque< _Tp, _Alloc >::insert |
( |
iterator |
position, |
|
|
const value_type & |
__x |
|
) |
[inline] |
|
|
Definition at line 643 of file stl_deque.h.
References std::_Deque_base< _Tp, _Alloc >::_M_finish, std::deque< _Tp, _Alloc >::_M_insert_aux(), std::_Deque_base< _Tp, _Alloc >::_M_start, std::deque< _Tp, _Alloc >::push_back(), std::deque< _Tp, _Alloc >::push_front(), and std::deque< _Tp, _Alloc >::value_type.
Referenced by std::deque< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_fill_assign(), std::deque< _Tp, _Alloc >::_M_insert_dispatch(), and std::deque< _Tp, _Alloc >::insert(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
size_type std::deque< _Tp, _Alloc >::max_size |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
deque& std::deque< _Tp, _Alloc >::operator= |
( |
const deque< _Tp, _Alloc > & |
__x |
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
const_reference std::deque< _Tp, _Alloc >::operator[] |
( |
size_type |
__n |
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
reference std::deque< _Tp, _Alloc >::operator[] |
( |
size_type |
__n |
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::pop_back |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::pop_front |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::push_back |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::push_back |
( |
const value_type & |
__t |
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::push_front |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::push_front |
( |
const value_type & |
__t |
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
const_reverse_iterator std::deque< _Tp, _Alloc >::rbegin |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
reverse_iterator std::deque< _Tp, _Alloc >::rbegin |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
const_reverse_iterator std::deque< _Tp, _Alloc >::rend |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
reverse_iterator std::deque< _Tp, _Alloc >::rend |
( |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::resize |
( |
size_type |
new_size |
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::resize |
( |
size_type |
__new_size, |
|
|
const value_type & |
__x |
|
) |
[inline] |
|
template<class _Tp, class _Alloc = allocator<_Tp>> |
size_type std::deque< _Tp, _Alloc >::size |
( |
|
) |
const [inline] |
|
|
Definition at line 468 of file stl_deque.h.
Referenced by std::deque< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_fill_assign(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::deque(), std::deque< _Tp, _Alloc >::erase(), and std::operator==(). |
template<class _Tp, class _Alloc = allocator<_Tp>> |
void std::deque< _Tp, _Alloc >::swap |
( |
deque< _Tp, _Alloc > & |
__x |
) |
[inline] |
|
The documentation for this class was generated from the following file:
Generated on Mon Apr 8 03:18:27 2002 for libstdc++-v3 Source by
1.2.15
|