#include <stl_deque.h>
Inherits std::Deque_base< 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 637 of file stl_deque.h.
std::deque< Type, Alloc >::deque | ( | const allocator_type & | a = allocator_type() |
) | [inline, explicit] |
std::deque< Type, Alloc >::deque | ( | size_type | n, | |
const value_type & | value, | |||
const allocator_type & | a = allocator_type() | |||
) | [inline] |
Create a deque with copies of an exemplar element.
n | The number of elements to initially create. | |
value | An element to copy. |
Definition at line 699 of file stl_deque.h.
std::deque< Type, Alloc >::deque | ( | size_type | n | ) | [inline, explicit] |
Create a deque with default elements.
n | The number of elements to initially create. |
Definition at line 712 of file stl_deque.h.
std::deque< Type, Alloc >::deque | ( | const deque< Type, Alloc > & | x | ) | [inline] |
Deque copy constructor.
x | A deque of identical element and allocator types. |
Definition at line 723 of file stl_deque.h.
References std::deque< Type, Alloc >::begin(), std::deque< Type, Alloc >::end(), and std::uninitialized_copy().
std::deque< Type, Alloc >::deque | ( | InputIterator | first, | |
InputIterator | last, | |||
const allocator_type & | a = allocator_type() | |||
) | [inline] |
Builds a deque from a range.
Create a deque consisting of copies of the elements from [first,last).
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.
std::deque< Type, Alloc >::~deque | ( | ) | [inline] |
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.
deque< Type, Alloc > & std::deque< Type, Alloc >::operator= | ( | const deque< Type, Alloc > & | x | ) | [inline] |
Deque assignment operator.
x | A deque of identical element and allocator types. |
Definition at line 69 of file deque.tcc.
References std::deque< Type, Alloc >::begin(), std::deque< Type, Alloc >::end(), std::deque< Type, Alloc >::erase(), std::deque< Type, Alloc >::insert(), and std::deque< Type, Alloc >::size().
void std::deque< Type, Alloc >::assign | ( | size_type | n, | |
const value_type & | __val | |||
) | [inline] |
Assigns a given value to a deque.
n | Number of elements to be assigned. | |
val | Value to be assigned. |
Definition at line 778 of file stl_deque.h.
void std::deque< Type, Alloc >::assign | ( | InputIterator | first, | |
InputIterator | last | |||
) | [inline] |
Assigns a range to a deque.
This function fills a deque with copies of the elements in the range [first,last).
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.
allocator_type std::deque< Type, Alloc >::get_allocator | ( | ) | const [inline] |
iterator std::deque< Type, Alloc >::begin | ( | ) | [inline] |
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 >::operator=(), and std::operator==().
const_iterator std::deque< Type, Alloc >::begin | ( | ) | const [inline] |
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.
iterator std::deque< Type, Alloc >::end | ( | ) | [inline] |
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 >::operator=(), and std::operator==().
const_iterator std::deque< Type, Alloc >::end | ( | ) | const [inline] |
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.
reverse_iterator std::deque< Type, Alloc >::rbegin | ( | ) | [inline] |
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.
const_reverse_iterator std::deque< Type, Alloc >::rbegin | ( | ) | const [inline] |
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.
reverse_iterator std::deque< Type, Alloc >::rend | ( | ) | [inline] |
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.
const_reverse_iterator std::deque< Type, Alloc >::rend | ( | ) | const [inline] |
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.
size_type std::deque< Type, Alloc >::size | ( | ) | const [inline] |
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 >::operator=(), and std::operator==().
size_type std::deque< Type, Alloc >::max_size | ( | ) | const [inline] |
Returns the size() of the largest possible deque.
Definition at line 870 of file stl_deque.h.
void std::deque< Type, Alloc >::resize | ( | size_type | new_size, | |
const value_type & | x | |||
) | [inline] |
Resizes the deque to the specified number of elements.
new_size | Number of elements the deque should contain. | |
x | Data with which new elements should be populated. |
Definition at line 883 of file stl_deque.h.
void std::deque< Type, Alloc >::resize | ( | size_type | new_size | ) | [inline] |
Resizes the deque to the specified number of elements.
new_size | Number of elements the deque should contain. |
Definition at line 902 of file stl_deque.h.
bool std::deque< Type, Alloc >::empty | ( | ) | const [inline] |
Returns true if the deque is empty. (Thus begin() would equal end().)
Definition at line 907 of file stl_deque.h.
reference std::deque< Type, Alloc >::operator[] | ( | size_type | n | ) | [inline] |
Subscript access to the data contained in the deque.
n | The index of the element for which data should be accessed. |
Definition at line 920 of file stl_deque.h.
const_reference std::deque< Type, Alloc >::operator[] | ( | size_type | n | ) | const [inline] |
Subscript access to the data contained in the deque.
n | The index of the element for which data should be accessed. |
Definition at line 932 of file stl_deque.h.
reference std::deque< Type, Alloc >::at | ( | size_type | n | ) | [inline] |
Provides access to the data contained in the deque.
n | The index of the element for which data should be accessed. |
std::out_of_range | If n is an invalid index. |
Definition at line 955 of file stl_deque.h.
const_reference std::deque< Type, Alloc >::at | ( | size_type | n | ) | const [inline] |
Provides access to the data contained in the deque.
n | The index of the element for which data should be accessed. |
std::out_of_range | If n is an invalid index. |
Definition at line 968 of file stl_deque.h.
reference std::deque< Type, Alloc >::front | ( | ) | [inline] |
Returns a read/write reference to the data at the first element of the deque.
Definition at line 975 of file stl_deque.h.
const_reference std::deque< Type, Alloc >::front | ( | ) | const [inline] |
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.
reference std::deque< Type, Alloc >::back | ( | ) | [inline] |
Returns a read/write reference to the data at the last element of the deque.
Definition at line 989 of file stl_deque.h.
const_reference std::deque< Type, Alloc >::back | ( | ) | const [inline] |
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.
void std::deque< Type, Alloc >::push_front | ( | const value_type & | x | ) | [inline] |
Add data to the front of the deque.
x | Data to be added. |
Definition at line 1018 of file stl_deque.h.
Referenced by std::deque< Type, Alloc >::insert().
void std::deque< Type, Alloc >::push_back | ( | const value_type & | x | ) | [inline] |
Add data to the end of the deque.
x | Data to be added. |
Definition at line 1062 of file stl_deque.h.
Referenced by std::deque< Type, Alloc >::insert().
void std::deque< Type, Alloc >::pop_front | ( | ) | [inline] |
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().
void std::deque< Type, Alloc >::pop_back | ( | ) | [inline] |
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().
deque< Type, Alloc >::iterator std::deque< Type, Alloc >::insert | ( | iterator | position, | |
const value_type & | x | |||
) | [inline] |
Inserts given value into deque before specified iterator.
position | An iterator into the deque. | |
x | Data to be inserted. |
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 >::operator=().
void std::deque< Type, Alloc >::insert | ( | iterator | position, | |
size_type | n, | |||
const value_type & | x | |||
) | [inline] |
Inserts a number of copies of given data into the deque.
position | An iterator into the deque. | |
n | Number of elements to be inserted. | |
x | Data to be inserted. |
Definition at line 1176 of file stl_deque.h.
void std::deque< Type, Alloc >::insert | ( | iterator | position, | |
InputIterator | first, | |||
InputIterator | last | |||
) | [inline] |
Inserts a range into the deque.
This function will insert copies of the data in the range [first,last) into the deque before the location specified by pos. This is known as "range insert."
Definition at line 1191 of file stl_deque.h.
deque< Type, Alloc >::iterator std::deque< Type, Alloc >::erase | ( | iterator | position | ) | [inline] |
Remove element at given position.
position | Iterator pointing to element to be erased. |
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::deque< Type, Alloc >::pop_back(), std::deque< Type, Alloc >::pop_front(), and std::deque< Type, Alloc >::size().
Referenced by std::deque< Type, Alloc >::operator=().
deque< Type, Alloc >::iterator std::deque< Type, Alloc >::erase | ( | iterator | first, | |
iterator | last | |||
) | [inline] |
Remove a range of elements.
first | Iterator pointing to the first element to be erased. | |
last | Iterator pointing to one past the last element to be erased. |
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(), and std::deque< Type, Alloc >::size().
void std::deque< Type, Alloc >::swap | ( | deque< Type, Alloc > & | x | ) | [inline] |
Swaps data with another deque.
x | A deque of the same element and allocator types. |
Definition at line 1243 of file stl_deque.h.
Referenced by std::swap().
void std::deque< Type, Alloc >::clear | ( | ) | [inline] |
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().