#include <stl_deque.h>
Inheritance diagram for std::deque< Type, Alloc >:
Public Types | |
typedef Type | value_type |
typedef value_type * | pointer |
typedef const value_type * | const_pointer |
typedef Base::iterator | iterator |
typedef Base::const_iterator | const_iterator |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
typedef std::reverse_iterator< iterator > | reverse_iterator |
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 |
Public Member Functions | |
deque (const allocator_type &a=allocator_type()) | |
Default constructor creates no elements. | |
deque (size_type n, const value_type &value, const allocator_type &a=allocator_type()) | |
Create a deque with copies of an exemplar element. | |
deque (size_type n) | |
Create a deque with default elements. | |
deque (const deque &x) | |
Deque copy constructor. | |
template<typename InputIterator> | |
deque (InputIterator first, InputIterator last, const allocator_type &a=allocator_type()) | |
Builds a deque from a range. | |
~deque () | |
deque & | operator= (const deque &x) |
Deque assignment operator. | |
void | assign (size_type n, const value_type &__val) |
Assigns a given value to a deque. | |
template<typename InputIterator> | |
void | assign (InputIterator first, InputIterator last) |
Assigns a range to a deque. | |
allocator_type | get_allocator () const |
Get a copy of the memory allocation object. | |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
size_type | size () const |
size_type | max_size () const |
void | resize (size_type new_size, const value_type &x) |
Resizes the deque to the specified number of elements. | |
void | resize (size_type new_size) |
Resizes the deque to the specified number of elements. | |
bool | empty () const |
reference | operator[] (size_type n) |
Subscript access to the data contained in the deque. | |
const_reference | operator[] (size_type n) const |
Subscript access to the data contained in the deque. | |
reference | at (size_type n) |
Provides access to the data contained in the deque. | |
const_reference | at (size_type n) const |
Provides access to the data contained in the deque. | |
reference | front () |
const_reference | front () const |
reference | back () |
const_reference | back () const |
void | push_front (const value_type &x) |
Add data to the front of the deque. | |
void | push_back (const value_type &x) |
Add data to the end of the deque. | |
void | pop_front () |
Removes first element. | |
void | pop_back () |
Removes last element. | |
iterator | insert (iterator position, const value_type &x) |
Inserts given value into deque before specified iterator. | |
void | insert (iterator position, size_type n, const value_type &x) |
Inserts a number of copies of given data into the deque. | |
template<typename InputIterator> | |
void | insert (iterator position, InputIterator first, InputIterator last) |
Inserts a range into the deque. | |
iterator | erase (iterator position) |
Remove element at given position. | |
iterator | erase (iterator first, iterator last) |
Remove a range of elements. | |
void | swap (deque &x) |
Swaps data with another deque. | |
void | clear () |
Protected Types | |
typedef pointer * | Map_pointer |
enum | |
typedef Alloc_traits< Type *, Alloc >::allocator_type | Map_allocator_type |
Protected Member Functions | |
void | M_range_check (size_type n) const |
template<typename Integer> | |
void | M_initialize_dispatch (Integer n, Integer x, __true_type) |
template<typename InputIter> | |
void | M_initialize_dispatch (InputIter first, InputIter last, __false_type) |
void | M_fill_initialize (const value_type &value) |
template<typename Integer> | |
void | M_assign_dispatch (Integer n, Integer __val, __true_type) |
template<typename InputIter> | |
void | M_assign_dispatch (InputIter first, InputIter last, __false_type) |
template<typename InputIterator> | |
void | M_assign_aux (InputIterator first, InputIterator last, input_iterator_tag) |
template<typename ForwardIterator> | |
void | M_assign_aux (ForwardIterator first, ForwardIterator last, forward_iterator_tag) |
void | M_fill_assign (size_type n, const value_type &__val) |
template<typename Integer> | |
void | M_insert_dispatch (iterator position, Integer n, Integer x, __true_type) |
template<typename InputIterator> | |
void | M_insert_dispatch (iterator position, InputIterator first, InputIterator last, __false_type) |
template<typename InputIterator> | |
void | M_range_insert_aux (iterator position, InputIterator first, InputIterator last, input_iterator_tag) |
template<typename ForwardIterator> | |
void | M_range_insert_aux (iterator position, ForwardIterator first, ForwardIterator last, forward_iterator_tag) |
void | M_fill_insert (iterator position, size_type n, const value_type &x) |
iterator | M_insert_aux (iterator position, const value_type &x) |
void | M_insert_aux (iterator position, size_type n, const value_type &x) |
template<typename ForwardIterator> | |
void | M_insert_aux (iterator position, ForwardIterator first, ForwardIterator last, size_type n) |
void | M_initialize_map (size_t) |
void | M_create_nodes (Type **nstart, Type **nfinish) |
void | M_destroy_nodes (Type **nstart, Type **nfinish) |
Deque_alloc_base (const allocator_type &a) | |
Type * | M_allocate_node () |
void | M_deallocate_node (Type *__p) |
Type ** | M_allocate_map (size_t n) |
void | M_deallocate_map (Type **__p, size_t n) |
template<typename InputIterator> | |
void | M_range_initialize (InputIterator first, InputIterator last, input_iterator_tag) |
template<typename ForwardIterator> | |
void | M_range_initialize (ForwardIterator first, ForwardIterator last, forward_iterator_tag) |
void | M_push_back_aux (const value_type &) |
void | M_push_front_aux (const value_type &) |
void | M_pop_back_aux () |
void | M_pop_front_aux () |
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 Member Functions | |
static size_t | S_buffer_size () |
Protected Attributes | |
iterator | M_start |
iterator | M_finish |
allocator_type | M_node_allocator |
Map_allocator_type | M_map_allocator |
Type ** | M_map |
size_t | M_map_size |
Private Types | |
typedef Deque_base< Type, Alloc > | Base |
Meets the requirements of a container, a reversible container, and a sequence, including the optional sequence requirements.
In previous HP/SGI versions of deque, there was an extra template parameter so users could control the node size. This extension turned out to violate the C++ standard (it can be detected using template template parameters), and it was removed.
Definition at line 637 of file stl_deque.h.
|
Default constructor creates no elements.
Definition at line 689 of file stl_deque.h. |
|
Create a deque with copies of an exemplar element.
Definition at line 699 of file stl_deque.h. |
|
Create a deque with default elements.
Definition at line 712 of file stl_deque.h. |
|
Deque copy constructor.
Definition at line 723 of file stl_deque.h. References std::deque< Type, Alloc >::begin(), std::deque< Type, Alloc >::end(), and std::uninitialized_copy(). |
|
Builds a deque from a range.
If the iterators are forward, bidirectional, or random-access, then this will call the elements' copy constructor N times (where N is distance(first,last)) and do no memory reallocation. But if only input iterators are used, then this will do at most 2N calls to the copy constructor, and logN memory reallocations. Definition at line 741 of file stl_deque.h. |
|
The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 755 of file stl_deque.h. |
|
Assigns a range to a deque.
Note that the assignment completely changes the deque and that the resulting deque's size is the same as the number of elements assigned. Old data may be lost. Definition at line 794 of file stl_deque.h. |
|
Assigns a given value to a deque.
Definition at line 778 of file stl_deque.h. |
|
Provides access to the data contained in the deque.
Definition at line 968 of file stl_deque.h. |
|
Provides access to the data contained in the deque.
Definition at line 955 of file stl_deque.h. |
|
Returns a read-only (constant) reference to the data at the last element of the deque. Definition at line 1001 of file stl_deque.h. |
|
Returns a read/write reference to the data at the last element of the deque. Definition at line 989 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::M_insert_aux(). |
|
Returns a read-only (constant) iterator that points to the first element in the deque. Iteration is done in ordinary element order. Definition at line 817 of file stl_deque.h. |
|
Returns a read/write iterator that points to the first element in the deque. Iteration is done in ordinary element order. Definition at line 810 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::deque(), std::deque< Type, Alloc >::M_assign_aux(), std::deque< Type, Alloc >::M_fill_assign(), std::operator<(), std::deque< Type, Alloc >::operator=(), and std::operator==(). |
|
Erases all the elements. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 165 of file deque.tcc. Referenced by std::deque< Type, Alloc >::erase(), and std::deque< Type, Alloc >::M_range_initialize(). |
|
Returns true if the deque is empty. (Thus begin() would equal end().) Definition at line 907 of file stl_deque.h. |
|
Returns a read-only (constant) iterator that points one past the last element in the deque. Iteration is done in ordinary element order. Definition at line 831 of file stl_deque.h. |
|
Returns a read/write iterator that points one past the last element in the deque. Iteration is done in ordinary element order. Definition at line 824 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::deque(), std::deque< Type, Alloc >::M_assign_aux(), std::deque< Type, Alloc >::M_fill_assign(), std::operator<(), std::deque< Type, Alloc >::operator=(), and std::operator==(). |
|
Remove a range of elements.
The user is cautioned that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 131 of file deque.tcc. References std::deque< Type, Alloc >::clear(), std::copy(), std::copy_backward(), and std::deque< Type, Alloc >::size(). |
|
Remove element at given position.
The user is cautioned that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 110 of file deque.tcc. References std::copy(), std::copy_backward(), std::deque< Type, Alloc >::pop_back(), std::deque< Type, Alloc >::pop_front(), and std::deque< Type, Alloc >::size(). Referenced by std::deque< Type, Alloc >::M_assign_aux(), std::deque< Type, Alloc >::M_fill_assign(), std::deque< Type, Alloc >::operator=(), and std::deque< Type, Alloc >::resize(). |
|
Returns a read-only (constant) reference to the data at the first element of the deque. Definition at line 982 of file stl_deque.h. |
|
Returns a read/write reference to the data at the first element of the deque. Definition at line 975 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::M_insert_aux(). |
|
Get a copy of the memory allocation object.
Reimplemented from std::Deque_alloc_base< Type, Alloc, Alloc_traits< Type, Alloc >::S_instanceless >. Definition at line 802 of file stl_deque.h. |
|
Inserts a range into the deque.
Definition at line 1191 of file stl_deque.h. |
|
Inserts a number of copies of given data into the deque.
Definition at line 1176 of file stl_deque.h. |
|
Inserts given value into deque before specified iterator.
Definition at line 89 of file deque.tcc. References std::deque< Type, Alloc >::push_back(), and std::deque< Type, Alloc >::push_front(). Referenced by std::deque< Type, Alloc >::M_assign_aux(), std::deque< Type, Alloc >::M_fill_assign(), std::deque< Type, Alloc >::operator=(), and std::deque< Type, Alloc >::resize(). |
|
Returns the size() of the largest possible deque. Definition at line 870 of file stl_deque.h. |
|
Deque assignment operator.
Definition at line 69 of file deque.tcc. References std::deque< Type, Alloc >::begin(), std::copy(), std::deque< Type, Alloc >::end(), std::deque< Type, Alloc >::erase(), std::deque< Type, Alloc >::insert(), and std::deque< Type, Alloc >::size(). |
|
Subscript access to the data contained in the deque.
Definition at line 932 of file stl_deque.h. |
|
Subscript access to the data contained in the deque.
Definition at line 920 of file stl_deque.h. |
|
Removes last element. This is a typical stack operation. It shrinks the deque by one. Note that no data is returned, and if the last element's data is needed, it should be retrieved before pop_back() is called. Definition at line 1125 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::erase(). |
|
Removes first element. This is a typical stack operation. It shrinks the deque by one. Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop_front() is called. Definition at line 1106 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::erase(). |
|
Add data to the end of the deque.
Definition at line 1062 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::insert(), std::deque< Type, Alloc >::M_insert_aux(), and std::deque< Type, Alloc >::M_range_initialize(). |
|
Add data to the front of the deque.
Definition at line 1018 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::insert(), and std::deque< Type, Alloc >::M_insert_aux(). |
|
Returns a read-only (constant) reverse iterator that points to the last element in the deque. Iteration is done in reverse element order. Definition at line 845 of file stl_deque.h. |
|
Returns a read/write reverse iterator that points to the last element in the deque. Iteration is done in reverse element order. Definition at line 838 of file stl_deque.h. |
|
Returns a read-only (constant) reverse iterator that points to one before the first element in the deque. Iteration is done in reverse element order. Definition at line 861 of file stl_deque.h. |
|
Returns a read/write reverse iterator that points to one before the first element in the deque. Iteration is done in reverse element order. Definition at line 853 of file stl_deque.h. |
|
Resizes the deque to the specified number of elements.
Definition at line 902 of file stl_deque.h. References std::deque< Type, Alloc >::resize(). |
|
Resizes the deque to the specified number of elements.
Definition at line 883 of file stl_deque.h. References std::deque< Type, Alloc >::erase(), std::deque< Type, Alloc >::insert(), and std::deque< Type, Alloc >::size(). Referenced by std::deque< Type, Alloc >::resize(). |
|
Returns the number of elements in the deque. Definition at line 866 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::erase(), std::deque< Type, Alloc >::M_assign_aux(), std::deque< Type, Alloc >::M_fill_assign(), std::deque< Type, Alloc >::M_insert_aux(), std::deque< Type, Alloc >::operator=(), std::operator==(), and std::deque< Type, Alloc >::resize(). |
|
Swaps data with another deque.
Definition at line 1243 of file stl_deque.h. References std::swap(). |