#include <stl_deque.h>
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 590 of file stl_deque.h.
|
Default constructor creates no elements. Definition at line 640 of file stl_deque.h. |
|
Create a deque with copies of an exemplar element.
|
|
Create a deque with default elements.
|
|
Deque copy constructor.
References deque::begin(), deque::end(), deque::get_allocator(), and deque::size(). |
|
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 694 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 708 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 750 of file stl_deque.h. |
|
Assigns a given value to a deque.
|
|
Provides access to the data contained in the deque.
|
|
Provides access to the data contained in the deque.
|
|
Returns a read-only (constant) reference to the data at the last element of the deque. Definition at line 983 of file stl_deque.h. |
|
Returns a read/write reference to the data at the last element of the deque. Definition at line 971 of file stl_deque.h. |
|
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 775 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 767 of file stl_deque.h. Referenced by deque::deque(), 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. Referenced by deque::erase(). |
|
Returns true if the deque is empty. (Thus begin() would equal end().) Definition at line 876 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 791 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 783 of file stl_deque.h. Referenced by 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 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 std::copy(), std::copy_backward(), deque::pop_back(), and deque::pop_front(). Referenced by deque::operator=(), and deque::resize(). |
|
Returns a read-only (constant) reference to the data at the first element of the deque. Definition at line 963 of file stl_deque.h. |
|
Returns a read/write reference to the data at the first element of the deque. Definition at line 955 of file stl_deque.h. |
|
Get a copy of the memory allocation object. Definition at line 758 of file stl_deque.h. Referenced by deque::deque(). |
|
Inserts a range into the deque.
|
|
Inserts a number of copies of given data into the deque.
|
|
Inserts given value into deque before specified iterator.
References deque::push_back(), and deque::push_front(). Referenced by deque::operator=(), and deque::resize(). |
|
Returns the size() of the largest possible deque. Definition at line 836 of file stl_deque.h. |
|
Deque assignment operator.
References deque::begin(), std::copy(), deque::end(), deque::erase(), deque::insert(), and deque::size(). |
|
Subscript access to the data contained in the deque.
|
|
Subscript access to the data contained in the deque.
|
|
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 1062 of file stl_deque.h. 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 1041 of file stl_deque.h. Referenced by deque::erase(). |
|
Add data to the end of the deque.
Referenced by deque::insert(). |
|
Add data to the front of the deque.
Referenced by 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 808 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 799 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 825 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 817 of file stl_deque.h. |
|
Resizes the deque to the specified number of elements.
References deque::resize(). |
|
Resizes the deque to the specified number of elements.
References deque::erase(), deque::insert(), and deque::size(). Referenced by deque::resize(). |
|
Returns the number of elements in the deque. Definition at line 831 of file stl_deque.h. Referenced by deque::deque(), deque::erase(), deque::operator=(), std::operator==(), and deque::resize(). |
|
Swaps data with another deque.
References std::swap(). Referenced by std::swap(). |