deque Class Reference
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) |
void | assign(size_type, const _Tp &) |
void | assign(const value_type *, const value_type *) |
void | assign(const_iterator, const_iterator) |
reference
| at(size_type) |
const_reference
| at(size_type) |
reference
| back() |
const_reference
| back() |
iterator
| begin() |
const_iterator
| begin() |
void | clear() |
bool | empty() |
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 &) |
void | insert(iterator, size_type, const value_type &) |
void | insert(iterator, const value_type *, const value_type *) |
void | insert(iterator, const_iterator, const_iterator) |
size_type
| max_size() |
_Self & | operator=(const _Self &) |
reference
| operator[](size_type) |
const_reference
| operator[](size_type) |
void | pop_back() |
void | pop_front() |
void | push_back(const value_type &) |
void | push_front(const value_type &) |
reverse_iterator
| rbegin() |
const_reverse_iterator | rbegin() |
reverse_iterator
| rend() |
const_reverse_iterator | rend() |
void | resize(size_type, const value_type &) |
size_type
| size() |
void | swap(_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) |
Constructor & Destructor Documentation
deque(const allocator_type &)
deque(const _Self &)
deque | ( | const _Self & | __x | ) | [inline] |
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 >)
Member Functions Documentation
_M_erase(iterator, const __true_type &)
_M_erase(iterator, const __false_type &)
_M_erase(iterator, iterator, const __true_type &)
_M_erase(iterator, iterator, const __false_type &)
_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 &)
_M_fill_initialize(const value_type &, const __false_type &)
_M_fill_insert(iterator, size_type, const value_type &)
_M_fill_insert_aux(iterator, size_type, const value_type &, const __true_type &)
_M_fill_insert_aux(iterator, size_type, const value_type &, const __false_type &)
_M_initialize(size_type, const value_type &)
void | _M_initialize | ( | size_type | __n, |
| const value_type & | __val = _STLP_DEFAULT_CONSTRUCTED(_Tp) |
| ) | [private, inline] |
_M_insert_range_aux(iterator, const value_type *, const value_type *, size_type, const __true_type &)
_M_insert_range_aux(iterator, const value_type *, const value_type *, size_type, const __false_type &)
_M_insert_range_aux(iterator, const_iterator, const_iterator, size_type, const __true_type &)
_M_insert_range_aux(iterator, const_iterator, const_iterator, size_type, const __false_type &)
_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)
_M_reserve_elements_at_front(size_type)
_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 &)
void | assign | ( | size_type | __n, |
| const _Tp & | __val |
| ) | [inline] |
assign(const value_type *, const value_type *)
assign(const_iterator, const_iterator)
empty()
bool | empty | ( | ) | const [inline] |
erase(iterator, iterator)
insert(iterator, const value_type &)
insert(iterator, size_type, const value_type &)
insert(iterator, const value_type *, const value_type *)
insert(iterator, const_iterator, const_iterator)
push_back(const value_type &)
void | push_back | ( | const value_type & | __t = _STLP_DEFAULT_CONSTRUCTED(_Tp) | ) | [inline] |
Parameters
const value_type & __t = _STLP_DEFAULT_CONSTRUCTED(_Tp) | |
push_front(const value_type &)
void | push_front | ( | const value_type & | __t = _STLP_DEFAULT_CONSTRUCTED(_Tp) | ) | [inline] |
Parameters
const value_type & __t = _STLP_DEFAULT_CONSTRUCTED(_Tp) | |
rbegin()
const_reverse_iterator | rbegin | ( | ) | const [inline] |
rend()
const_reverse_iterator | rend | ( | ) | const [inline] |
resize(size_type, const value_type &)
void | resize | ( | size_type | __new_size, |
| const value_type & | __x = _STLP_DEFAULT_CONSTRUCTED(_Tp) |
| ) | [inline] |
swap(_Self &)
void | swap | ( | _Self & | __x | ) | [inline] |
Member Type Definitions Documentation
Typedef _Base
typedef _STLP_PRIV _Deque_base< _Tp, _Alloc > | _Base | [private] |
Typedef _Iterator_category
Typedef _Map_pointer
typedef
pointer * | _Map_pointer | [protected] |
Typedef _Self
typedef
deque< _Tp, _Alloc > | _Self | [private] |
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 const_iterator
typedef _Base::const_iterator | const_iterator |
Typedef iterator
typedef _Base::iterator | iterator |
Member Data Documentation
_STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS
| _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS |
Copyright ©2010 Nokia Corporation and/or its subsidiary(-ies).
All rights
reserved. Unless otherwise stated, these materials are provided under the terms of the Eclipse Public License
v1.0.