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 595 of file stl_deque.h.
|
Default constructor creates no elements.
Definition at line 645 of file stl_deque.h. |
|
Create a deque with copies of an exemplar element.
Definition at line 655 of file stl_deque.h. References deque::_M_fill_initialize(). |
|
Create a deque with default elements.
Definition at line 668 of file stl_deque.h. References deque::_M_fill_initialize(). |
|
Deque copy constructor.
Definition at line 679 of file stl_deque.h. References std::__uninitialized_copy_a(), _Deque_base::_M_impl, deque::begin(), deque::end(), and deque::get_allocator(). |
|
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 700 of file stl_deque.h. References deque::_M_initialize_dispatch(). |
|
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 714 of file stl_deque.h. References std::_Destroy(). |
|
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 756 of file stl_deque.h. References deque::_M_assign_dispatch(). |
|
Assigns a given value to a deque.
Definition at line 739 of file stl_deque.h. References deque::_M_fill_assign(). |
|
Provides access to the data contained in the deque.
Definition at line 961 of file stl_deque.h. References deque::_M_range_check(). |
|
Provides access to the data contained in the deque.
Definition at line 943 of file stl_deque.h. References deque::_M_range_check(). |
|
Returns a read-only (constant) reference to the data at the last element of the deque. Definition at line 1000 of file stl_deque.h. References deque::end(). |
|
Returns a read/write reference to the data at the last element of the deque. Definition at line 988 of file stl_deque.h. References deque::end(). Referenced by deque::_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 781 of file stl_deque.h. References _Deque_base::_M_impl. |
|
Returns a read/write iterator that points to the first element in the deque. Iteration is done in ordinary element order. Definition at line 773 of file stl_deque.h. References _Deque_base::_M_impl. Referenced by deque::_M_assign_aux(), deque::_M_fill_assign(), deque::deque(), deque::front(), deque::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 172 of file deque.tcc. References std::_Destroy(), _Deque_base::_M_deallocate_node(), _Deque_base::_M_impl, and deque::_S_buffer_size(). Referenced by deque::_M_range_initialize(), and deque::erase(). |
|
Returns true if the deque is empty. (Thus begin() would equal end().) Definition at line 887 of file stl_deque.h. References _Deque_base::_M_impl. |
|
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 799 of file stl_deque.h. References _Deque_base::_M_impl. |
|
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 790 of file stl_deque.h. References _Deque_base::_M_impl. Referenced by deque::_M_assign_aux(), deque::_M_fill_assign(), deque::back(), deque::deque(), deque::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 132 of file deque.tcc. References std::_Destroy(), _Deque_base::_M_destroy_nodes(), _Deque_base::_M_impl, deque::clear(), std::copy(), std::copy_backward(), and deque::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 111 of file deque.tcc. References _Deque_base::_M_impl, std::copy(), std::copy_backward(), deque::pop_back(), deque::pop_front(), and deque::size(). Referenced by deque::_M_assign_aux(), deque::_M_fill_assign(), deque::operator=(), and deque::resize(). |
|
Returns a read-only (constant) reference to the data at the first element of the deque. Definition at line 980 of file stl_deque.h. References deque::begin(). |
|
Returns a read/write reference to the data at the first element of the deque. Definition at line 972 of file stl_deque.h. References deque::begin(). Referenced by deque::_M_insert_aux(). |
|
Get a copy of the memory allocation object.
Reimplemented from _Deque_base. Definition at line 764 of file stl_deque.h. References _Deque_base::get_allocator(). Referenced by deque::deque(). |
|
Inserts a range into the deque.
Definition at line 1130 of file stl_deque.h. References deque::_M_insert_dispatch(). |
|
Inserts a number of copies of given data into the deque.
Definition at line 1115 of file stl_deque.h. References deque::_M_fill_insert(). |
|
Inserts given value into deque before specified iterator.
Definition at line 90 of file deque.tcc. References _Deque_base::_M_impl, deque::_M_insert_aux(), deque::push_back(), and deque::push_front(). Referenced by deque::_M_assign_aux(), deque::_M_fill_assign(), deque::operator=(), and deque::resize(). |
|
Returns the size() of the largest possible deque. Definition at line 845 of file stl_deque.h. |
|
Deque assignment operator.
Definition at line 69 of file deque.tcc. References _Deque_base::_M_impl, deque::begin(), std::copy(), deque::end(), deque::erase(), deque::insert(), and deque::size(). |
|
Subscript access to the data contained in the deque.
Definition at line 918 of file stl_deque.h. References _Deque_base::_M_impl. |
|
Subscript access to the data contained in the deque.
Definition at line 903 of file stl_deque.h. References _Deque_base::_M_impl. |
|
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 1081 of file stl_deque.h. References _Deque_base::_M_impl, and deque::_M_pop_back_aux(). Referenced by deque::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 1060 of file stl_deque.h. References _Deque_base::_M_impl, and deque::_M_pop_front_aux(). Referenced by deque::erase(). |
|
Add data to the end of the deque.
Definition at line 1039 of file stl_deque.h. References _Deque_base::_M_impl, and deque::_M_push_back_aux(). Referenced by deque::_M_insert_aux(), deque::_M_range_initialize(), and deque::insert(). |
|
Add data to the front of the deque.
Definition at line 1018 of file stl_deque.h. References _Deque_base::_M_impl, and deque::_M_push_front_aux(). Referenced by deque::_M_insert_aux(), and deque::insert(). |
|
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 817 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 808 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 834 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 826 of file stl_deque.h. |
|
Resizes the deque to the specified number of elements.
Definition at line 879 of file stl_deque.h. References deque::resize(). |
|
Resizes the deque to the specified number of elements.
Definition at line 860 of file stl_deque.h. References deque::erase(), deque::insert(), and deque::size(). Referenced by deque::resize(). |
|
Returns the number of elements in the deque. Definition at line 840 of file stl_deque.h. References _Deque_base::_M_impl. Referenced by deque::_M_assign_aux(), deque::_M_fill_assign(), deque::_M_insert_aux(), deque::erase(), deque::operator=(), std::operator==(), and deque::resize(). |
|
Swaps data with another deque.
Definition at line 1183 of file stl_deque.h. References _Deque_base::_M_impl, and std::swap(). Referenced by std::swap(). |