Inherits std::_Deque_base< _Tp, _Alloc >.
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 612 of file stl_deque.h.
deque | ( | const allocator_type & | __a = allocator_type() |
) | [inline, explicit] |
deque | ( | size_type | __n, | |
const value_type & | __value = value_type() , |
|||
const allocator_type & | __a = allocator_type() | |||
) | [inline, explicit] |
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 677 of file stl_deque.h.
Deque copy constructor.
x | A deque of identical element and allocator types. |
Definition at line 689 of file stl_deque.h.
References deque::begin(), and deque::end().
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 710 of file stl_deque.h.
~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 724 of file stl_deque.h.
void 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 766 of file stl_deque.h.
void 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 749 of file stl_deque.h.
const_reference 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 958 of file stl_deque.h.
reference 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 940 of file stl_deque.h.
const_reference back | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the last element of the deque.
Definition at line 997 of file stl_deque.h.
References deque::end().
reference back | ( | ) | [inline] |
Returns a read/write reference to the data at the last element of the deque.
Definition at line 985 of file stl_deque.h.
References deque::end().
const_iterator 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 791 of file stl_deque.h.
iterator 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 783 of file stl_deque.h.
Referenced by deque::deque(), deque::front(), deque::operator=(), and std::operator==().
void 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 172 of file deque.tcc.
Referenced by deque::erase().
bool empty | ( | ) | const [inline] |
Returns true if the deque is empty. (Thus begin() would equal end().)
Definition at line 884 of file stl_deque.h.
const_iterator 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 809 of file stl_deque.h.
iterator 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 800 of file stl_deque.h.
Referenced by deque::back(), deque::deque(), deque::operator=(), and std::operator==().
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 132 of file deque.tcc.
References _Deque_iterator::_M_node, deque::clear(), std::copy(), std::copy_backward(), and deque::size().
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 111 of file deque.tcc.
References std::copy(), std::copy_backward(), deque::pop_back(), deque::pop_front(), and deque::size().
Referenced by deque::operator=(), and deque::resize().
const_reference front | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the first element of the deque.
Definition at line 977 of file stl_deque.h.
References deque::begin().
reference front | ( | ) | [inline] |
Returns a read/write reference to the data at the first element of the deque.
Definition at line 969 of file stl_deque.h.
References deque::begin().
allocator_type get_allocator | ( | ) | const [inline] |
void 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 1127 of file stl_deque.h.
void 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 1112 of file stl_deque.h.
Inserts given value into deque before specified iterator.
position | An iterator into the deque. | |
x | Data to be inserted. |
Definition at line 90 of file deque.tcc.
References _Deque_iterator::_M_cur, deque::push_back(), and deque::push_front().
Referenced by deque::operator=(), and deque::resize().
size_type max_size | ( | ) | const [inline] |
Returns the size() of the largest possible deque.
Definition at line 855 of file stl_deque.h.
Deque assignment operator.
x | A deque of identical element and allocator types. |
Definition at line 69 of file deque.tcc.
References deque::begin(), std::copy(), deque::end(), deque::erase(), deque::insert(), and deque::size().
const_reference 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 915 of file stl_deque.h.
reference 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 900 of file stl_deque.h.
void 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 1078 of file stl_deque.h.
Referenced by deque::erase().
void 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 1057 of file stl_deque.h.
Referenced by deque::erase().
void push_back | ( | const value_type & | __x | ) | [inline] |
Add data to the end of the deque.
x | Data to be added. |
Definition at line 1036 of file stl_deque.h.
Referenced by deque::insert().
void push_front | ( | const value_type & | __x | ) | [inline] |
Add data to the front of the deque.
x | Data to be added. |
Definition at line 1015 of file stl_deque.h.
Referenced by deque::insert().
const_reverse_iterator 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 827 of file stl_deque.h.
reverse_iterator 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 818 of file stl_deque.h.
const_reverse_iterator 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 844 of file stl_deque.h.
reverse_iterator 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 836 of file stl_deque.h.
void resize | ( | size_type | __new_size, | |
value_type | __x = value_type() | |||
) | [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 870 of file stl_deque.h.
References deque::erase(), deque::insert(), and deque::size().
size_type size | ( | ) | const [inline] |
Returns the number of elements in the deque.
Definition at line 850 of file stl_deque.h.
Referenced by deque::erase(), deque::operator=(), std::operator==(), and deque::resize().
void swap | ( | deque< _Tp, _Alloc > & | __x | ) | [inline] |
Swaps data with another deque.
x | A deque of the same element and allocator types. |
Definition at line 1180 of file stl_deque.h.
Referenced by std::swap().