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 629 of file stl_deque.h.
|
Default constructor creates no elements.
Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 683 of file stl_deque.h. |
|
Create a deque with copies of an exemplar element.
Definition at line 694 of file stl_deque.h. |
|
Deque copy constructor.
Definition at line 706 of file stl_deque.h. |
|
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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 727 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 741 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 782 of file stl_deque.h. |
|
Assigns a given value to a deque.
Definition at line 765 of file stl_deque.h. |
|
Provides access to the data contained in the deque.
Definition at line 975 of file stl_deque.h. |
|
Provides access to the data contained in the deque.
Definition at line 957 of file stl_deque.h. |
|
Returns a read-only (constant) reference to the data at the last element of the deque. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 1014 of file stl_deque.h. |
|
Returns a read/write reference to the data at the last element of the deque. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 1002 of file stl_deque.h. Referenced by std::deque< _Tp, _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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 807 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 799 of file stl_deque.h. Referenced by std::deque< _Tp, _Allocator >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_erase_at_begin(), std::deque< _Tp, _Allocator >::_M_fill_assign(), std::deque< _Tp, _Allocator >::clear(), std::deque< _Tp, _Allocator >::deque(), std::deque< _Tp, _Alloc >::erase(), std::deque< _Tp, _Allocator >::front(), std::operator==(), and std::deque< _Tp, _Allocator >::~deque(). |
|
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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 1217 of file stl_deque.h. Referenced by std::deque< _Tp, _Alloc >::_M_range_initialize(), and std::deque< _Tp, _Alloc >::erase(). |
|
Returns true if the deque is empty. (Thus begin() would equal end().) Definition at line 901 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 825 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 816 of file stl_deque.h. Referenced by std::deque< _Tp, _Allocator >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_erase_at_end(), std::deque< _Tp, _Allocator >::_M_fill_assign(), std::deque< _Tp, _Allocator >::back(), std::deque< _Tp, _Allocator >::deque(), std::deque< _Tp, _Alloc >::erase(), std::operator==(), and std::deque< _Tp, _Allocator >::~deque(). |
|
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 135 of file deque.tcc. References std::deque< _Tp, _Alloc >::_M_erase_at_begin(), std::deque< _Tp, _Alloc >::_M_erase_at_end(), std::deque< _Tp, _Alloc >::begin(), std::deque< _Tp, _Alloc >::clear(), std::copy_backward(), std::deque< _Tp, _Alloc >::end(), and std::deque< _Tp, _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 112 of file deque.tcc. References std::deque< _Tp, _Alloc >::begin(), std::copy_backward(), std::deque< _Tp, _Alloc >::end(), std::deque< _Tp, _Alloc >::pop_back(), std::deque< _Tp, _Alloc >::pop_front(), and std::deque< _Tp, _Alloc >::size(). |
|
Returns a read-only (constant) reference to the data at the first element of the deque. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 994 of file stl_deque.h. |
|
Returns a read/write reference to the data at the first element of the deque. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 986 of file stl_deque.h. Referenced by std::deque< _Tp, _Alloc >::_M_insert_aux(). |
|
Get a copy of the memory allocation object.
Reimplemented from std::_Deque_base< _Tp, _Alloc >. Definition at line 790 of file stl_deque.h. |
|
Inserts a range into the deque.
Definition at line 1144 of file stl_deque.h. |
|
Inserts a number of copies of given data into the deque.
Definition at line 1129 of file stl_deque.h. |
|
Inserts given value into deque before specified iterator.
Definition at line 91 of file deque.tcc. References std::_Deque_base< _Tp, _Alloc >::_M_impl, std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::push_back(), and std::deque< _Tp, _Alloc >::push_front(). Referenced by std::deque< _Tp, _Allocator >::_M_assign_aux(), std::deque< _Tp, _Alloc >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_fill_assign(), and std::deque< _Tp, _Allocator >::resize(). |
|
Returns the size() of the largest possible deque. Definition at line 872 of file stl_deque.h. |
|
Deque assignment operator.
|
|
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 917 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 1095 of file stl_deque.h. Referenced by std::deque< _Tp, _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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 1074 of file stl_deque.h. Referenced by std::deque< _Tp, _Alloc >::erase(). |
|
Add data to the end of the deque.
Definition at line 1053 of file stl_deque.h. Referenced by std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_range_initialize(), and std::deque< _Tp, _Alloc >::insert(). |
|
Add data to the front of the deque.
Definition at line 1032 of file stl_deque.h. Referenced by std::deque< _Tp, _Alloc >::_M_insert_aux(), and std::deque< _Tp, _Alloc >::insert(). |
|
Returns a read-only (constant) reverse iterator that points to the last element in the deque. Iteration is done in reverse element order. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 843 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 834 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. 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. Reimplemented in std::__debug::deque< _Tp, _Allocator >. Definition at line 852 of file stl_deque.h. |
|
Resizes the deque to the specified number of elements.
Definition at line 887 of file stl_deque.h. |
|
Returns the number of elements in the deque. Definition at line 867 of file stl_deque.h. Referenced by std::deque< _Tp, _Allocator >::_M_assign_aux(), std::deque< _Tp, _Allocator >::_M_fill_assign(), std::deque< _Tp, _Alloc >::_M_insert_aux(), std::deque< _Tp, _Alloc >::_M_new_elements_at_back(), std::deque< _Tp, _Alloc >::_M_new_elements_at_front(), std::deque< _Tp, _Alloc >::erase(), std::operator==(), and std::deque< _Tp, _Allocator >::resize(). |
|
Swaps data with another deque.
Definition at line 1197 of file stl_deque.h. Referenced by std::swap(). |