#include <stl_deque.h>
Inheritance diagram for std::deque< Type, Alloc >:
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 () |
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 585 of file stl_deque.h.
|
Default constructor creates no elements.
Definition at line 635 of file stl_deque.h. |
|
Create a deque with copies of an exemplar element.
Definition at line 645 of file stl_deque.h. |
|
Create a deque with default elements.
Definition at line 658 of file stl_deque.h. |
|
Deque copy constructor.
Definition at line 669 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. Definition at line 689 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 703 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 744 of file stl_deque.h. |
|
Assigns a given value to a deque.
Definition at line 727 of file stl_deque.h. |
|
Provides access to the data contained in the deque.
Definition at line 935 of file stl_deque.h. |
|
Provides access to the data contained in the deque.
Definition at line 921 of file stl_deque.h. |
|
Returns a read-only (constant) reference to the data at the last element of the deque. Definition at line 974 of file stl_deque.h. |
|
Returns a read/write reference to the data at the last element of the deque. Definition at line 962 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 769 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 761 of file stl_deque.h. Referenced by std::deque< Type, Allocator >::deque(), 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 170 of file deque.tcc. Referenced by std::deque< Type, Alloc >::erase(). |
|
Returns true if the deque is empty. (Thus begin() would equal end().) Definition at line 870 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 785 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 777 of file stl_deque.h. Referenced by std::deque< Type, Allocator >::deque(), 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 132 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 111 of file deque.tcc. References std::copy(), std::copy_backward(), std::deque< Type, Alloc >::pop_back(), and std::deque< Type, Alloc >::pop_front(). Referenced by std::deque< Type, Alloc >::operator=(). |
|
Returns a read-only (constant) reference to the data at the first element of the deque. Definition at line 954 of file stl_deque.h. |
|
Returns a read/write reference to the data at the first element of the deque. Definition at line 946 of file stl_deque.h. |
|
Get a copy of the memory allocation object.
Definition at line 752 of file stl_deque.h. |
|
Inserts a range into the deque.
Definition at line 1102 of file stl_deque.h. |
|
Inserts a number of copies of given data into the deque.
Definition at line 1087 of file stl_deque.h. |
|
Inserts given value into deque before specified iterator.
Definition at line 90 of file deque.tcc. References std::deque< Type, Alloc >::push_back(), and std::deque< Type, Alloc >::push_front(). Referenced by std::deque< Type, Alloc >::operator=(). |
|
Returns the size() of the largest possible deque. Definition at line 830 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 897 of file stl_deque.h. |
|
Subscript access to the data contained in the deque.
Definition at line 884 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 1053 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 1032 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::erase(). |
|
Add data to the end of the deque.
Definition at line 1011 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::insert(). |
|
Add data to the front of the deque.
Definition at line 991 of file stl_deque.h. Referenced by std::deque< Type, 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. Definition at line 802 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 793 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 819 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 811 of file stl_deque.h. |
|
Resizes the deque to the specified number of elements.
Definition at line 863 of file stl_deque.h. |
|
Resizes the deque to the specified number of elements.
Definition at line 844 of file stl_deque.h. |
|
Returns the number of elements in the deque. Definition at line 825 of file stl_deque.h. Referenced by std::deque< Type, Alloc >::erase(), std::deque< Type, Alloc >::operator=(), std::operator==(), and std::deque< Type, Allocator >::resize(). |
|
Swaps data with another deque.
Definition at line 1155 of file stl_deque.h. Referenced by std::swap(). |