std::deque< _Tp, _Alloc >(3cxx) | std::deque< _Tp, _Alloc >(3cxx) |
NAME¶
std::deque< _Tp, _Alloc > -SYNOPSIS¶
Inherits std::_Deque_base< _Tp, _Alloc >.Public Types¶
typedef _Alloc allocator_type
Public Member Functions¶
deque ()
Protected Types¶
enum { _S_initial_map_size }
Protected Member Functions¶
_Tp ** _M_allocate_map (size_t __n)
template<typename _InputIterator > void _M_range_initialize (_InputIterator __first, _InputIterator __last, std::input_iterator_tag)
template<typename... _Args> void _M_push_back_aux (_Args &&...__args)
iterator _M_reserve_elements_at_front (size_type __n)
void _M_reserve_map_at_back (size_type __nodes_to_add=1)
Static Protected Member Functions¶
static size_t _S_buffer_size ()
Protected Attributes¶
_Deque_impl _M_impl
Detailed Description¶
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>class std::deque< _Tp, _Alloc >¶
A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end.- •
- Tp** _M_map
- •
- size_t _M_map_size
- •
- iterator _M_start, _M_finish
- •
- For any nonsingular iterator i:
- •
- i.node points to a member of the map array. (Yes, you read that correctly: i.node does not actually point to a node.) The member of the map array is what actually points to the node.
- •
- i.first == *(i.node) (This points to the node (first Tp element).)
- •
- i.last == i.first + node_size
- •
- i.cur is a pointer in the range [i.first, i.last). NOTE: the implication of this is that i.cur is always a dereferenceable pointer, even if i is a past-the-end iterator.
- •
- Start and Finish are always nonsingular iterators. NOTE: this means that an empty deque must have one node, a deque with <N elements (where N is the node buffer size) must have one node, a deque with N through (2N-1) elements must have two nodes, etc.
- •
- For every node other than start.node and finish.node, every element in the node is an initialized object. If start.node == finish.node, then [start.cur, finish.cur) are initialized objects, and the elements outside that range are uninitialized storage. Otherwise, [start.cur, start.last) and [finish.first, finish.cur) are initialized objects, and [start.first, start.cur) and [finish.cur, finish.last) are uninitialized storage.
- •
- [map, map + map_size) is a valid, non-empty range.
- •
- [start.node, finish.node] is a valid range contained within [map, map + map_size).
- •
- A pointer in the range [map, map + map_size) points to an allocated node if and only if the pointer is in the range [start.node, finish.node].
Constructor & Destructor Documentation¶
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::deque< _Tp, _Alloc >::deque () [inline]¶
Default constructor creates no elements. Definition at line 780 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::deque< _Tp, _Alloc >::deque (const allocator_type &__a) [inline], [explicit]¶
Creates a deque with no elements. Parameters:__a An allocator object.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::deque< _Tp, _Alloc >::deque (size_type__n) [inline], [explicit]¶
Creates a deque with default constructed elements. Parameters:__n The number of elements to initially
create.
This constructor fills the deque with n default constructed elements.
Definition at line 800 of file stl_deque.h.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::deque< _Tp, _Alloc >::deque (size_type__n, const value_type &__value, const allocator_type &__a = allocator_type()) [inline]¶
Creates a deque with copies of an exemplar element. Parameters:__n The number of elements to initially
create.
__value An element to copy.
__a An allocator.
This constructor fills the deque with __n copies of __value.
Definition at line 812 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::_M_fill_initialize().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::deque< _Tp, _Alloc >::deque (const deque< _Tp, _Alloc > &__x) [inline]¶
Deque copy constructor. Parameters:__x A deque of identical element and
allocator types.
The newly-created deque uses a copy of the allocation object used by __x.
Definition at line 839 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::begin(), and std::deque< _Tp,
_Alloc >::end().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::deque< _Tp, _Alloc >::deque ( deque< _Tp, _Alloc > &&__x) [inline]¶
Deque move constructor. Parameters:__x A deque of identical element and
allocator types.
The newly-created deque contains the exact contents of __x. The contents
of __x are a valid, but unspecified deque.
Definition at line 853 of file stl_deque.h.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::deque< _Tp, _Alloc >::deque ( initializer_list< value_type >__l, const allocator_type &__a = allocator_type()) [inline]¶
Builds a deque from an initializer list. Parameters:__l An initializer_list.
__a An allocator object.
Create a deque consisting of copies of the elements in the
initializer_list __l.
This will call the element type's copy constructor N times (where N is
__l.size()) and do no memory reallocation.
Definition at line 867 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::_M_range_initialize().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _InputIterator > std::deque< _Tp, _Alloc >:: deque (_InputIterator__first, _InputIterator__last, const allocator_type &__a = allocator_type()) [inline]¶
Builds a deque from a range. Parameters:__first An input iterator.
__last An input iterator.
__a An allocator object.
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 892 of file stl_deque.h.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::deque< _Tp, _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 responsibility. Definition at line 906 of file stl_deque.h. References std::deque< _Tp, _Alloc >::begin(), and std::deque< _Tp, _Alloc >::end().Member Function Documentation¶
template<typename _Tp , typename _Alloc > void deque::_M_fill_initialize (const value_type &__value) [protected]¶
Fills the deque with copies of value. Parameters:__value Initial value.
Returns:
Nothing.
Precondition:
_M_start and _M_finish have already been
initialized, but none of the deque's elements have yet been constructed.
This function is called only when the user provides an explicit size (with or
without an explicit exemplar value).
Definition at line 353 of file deque.tcc.
References std::_Destroy().
Referenced by std::deque< _Tp, _Alloc >::deque().
template<typename _Tp , typename _Alloc > void std::_Deque_base< _Tp, _Alloc >::_M_initialize_map (size_t__num_elements) [protected], [inherited]¶
Layout storage. Parameters:__num_elements The count of T's for
which to allocate space at first.
Returns:
Nothing.
The initial underlying memory layout is a bit complicated...
Definition at line 583 of file stl_deque.h.
References std::max().
template<typename _Tp , typename _Alloc > void deque::_M_new_elements_at_back (size_type__new_elements) [protected]¶
Memory-handling helpers for the previous internal insert functions. Definition at line 847 of file deque.tcc. References std::size(). Referenced by std::deque< _Tp, _Alloc >::_M_reserve_elements_at_back().template<typename _Tp , typename _Alloc > void deque::_M_new_elements_at_front (size_type__new_elements) [protected]¶
Memory-handling helpers for the previous internal insert functions. Definition at line 822 of file deque.tcc. References std::size(). Referenced by std::deque< _Tp, _Alloc >::_M_reserve_elements_at_front().template<typename _Tp , typename _Alloc > void deque::_M_pop_back_aux () [protected]¶
Helper functions for push_* and pop_*. Definition at line 503 of file deque.tcc. Referenced by std::deque< _Tp, _Alloc >::pop_back().template<typename _Tp , typename _Alloc > void deque::_M_pop_front_aux () [protected]¶
Helper functions for push_* and pop_*. Definition at line 518 of file deque.tcc. Referenced by std::deque< _Tp, _Alloc >::pop_front().template<typename _Tp , typename _Alloc > template<typename... _Args> void deque::_M_push_back_aux (_Args &&...__args) [protected]¶
Helper functions for push_* and pop_*. Definition at line 437 of file deque.tcc. Referenced by std::deque< _Tp, _Alloc >::push_back().template<typename _Tp , typename _Alloc > template<typename... _Args> void deque::_M_push_front_aux (_Args &&...__args) [protected]¶
Helper functions for push_* and pop_*. Definition at line 471 of file deque.tcc. Referenced by std::deque< _Tp, _Alloc >::push_front().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::_M_range_check (size_type__n) const [inline], [protected]¶
Safety check used only from at(). Definition at line 1246 of file stl_deque.h. References std::deque< _Tp, _Alloc >::size(). Referenced by std::deque< _Tp, _Alloc >::at().template<typename _Tp , typename _Alloc > template<typename _InputIterator > void deque::_M_range_initialize (_InputIterator__first, _InputIterator__last, std::input_iterator_tag) [protected]¶
Fills the deque with whatever is in [first,last). Parameters:__first An input iterator.
__last An input iterator.
Returns:
Nothing.
If the iterators are actually forward iterators (or better), then the memory
layout can be done all at once. Else we move forward using push_back on each
value from the iterator.
Definition at line 379 of file deque.tcc.
Referenced by std::deque< _Tp, _Alloc >::deque().
template<typename _Tp , typename _Alloc > template<typename _ForwardIterator > void deque::_M_range_initialize (_ForwardIterator__first, _ForwardIterator__last, std::forward_iterator_tag) [protected]¶
Fills the deque with whatever is in [first,last). Parameters:__first An input iterator.
__last An input iterator.
Returns:
Nothing.
If the iterators are actually forward iterators (or better), then the memory
layout can be done all at once. Else we move forward using push_back on each
value from the iterator.
Definition at line 399 of file deque.tcc.
References std::_Destroy(), std::advance(), and std::distance().
template<typename _Tp , typename _Alloc > void deque::_M_reallocate_map (size_type__nodes_to_add, bool__add_at_front) [protected]¶
Memory-handling helpers for the major map. Makes sure the _M_map has space for new nodes. Does not actually add the nodes. Can invalidate _M_map pointers. (And consequently, deque iterators.) Definition at line 872 of file deque.tcc. References std::max(). Referenced by std::deque< _Tp, _Alloc >::_M_reserve_map_at_back(), and std::deque< _Tp, _Alloc >::_M_reserve_map_at_front().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::deque< _Tp, _Alloc >::_M_reserve_elements_at_back (size_type__n) [inline], [protected]¶
Memory-handling helpers for the previous internal insert functions. Definition at line 1870 of file stl_deque.h. References std::deque< _Tp, _Alloc >::_M_new_elements_at_back().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::deque< _Tp, _Alloc >::_M_reserve_elements_at_front (size_type__n) [inline], [protected]¶
Memory-handling helpers for the previous internal insert functions. Definition at line 1860 of file stl_deque.h. References std::deque< _Tp, _Alloc >::_M_new_elements_at_front().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::_M_reserve_map_at_back (size_type__nodes_to_add = 1) [inline], [protected]¶
Memory-handling helpers for the major map. Makes sure the _M_map has space for new nodes. Does not actually add the nodes. Can invalidate _M_map pointers. (And consequently, deque iterators.) Definition at line 1896 of file stl_deque.h. References std::deque< _Tp, _Alloc >::_M_reallocate_map().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::_M_reserve_map_at_front (size_type__nodes_to_add = 1) [inline], [protected]¶
Memory-handling helpers for the major map. Makes sure the _M_map has space for new nodes. Does not actually add the nodes. Can invalidate _M_map pointers. (And consequently, deque iterators.) Definition at line 1904 of file stl_deque.h. References std::deque< _Tp, _Alloc >::_M_reallocate_map().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::assign (size_type__n, const value_type &__val) [inline]¶
Assigns a given value to a deque. Parameters:__n Number of elements to be assigned.
__val Value to be assigned.
This function fills a deque with n copies of the given value. 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 967 of file stl_deque.h.
Referenced by std::deque< _Tp, _Alloc >::operator=().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _InputIterator > void std::deque< _Tp, _Alloc >::assign (_InputIterator__first, _InputIterator__last) [inline]¶
Assigns a range to a deque. Parameters:__first An input iterator.
__last An input iterator.
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 984 of file stl_deque.h.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::assign ( initializer_list< value_type >__l) [inline]¶
Assigns an initializer list to a deque. Parameters:__l An initializer_list.
This function fills a deque with copies of the elements in the
initializer_list __l.
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 1003 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::assign().
Referenced by std::deque< _Tp, _Alloc >::assign().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference std::deque< _Tp, _Alloc >::at (size_type__n) [inline]¶
Provides access to the data contained in the deque. Parameters:__n The index of the element for which
data should be accessed.
Returns:
Read/write reference to data.
Exceptions:
std::out_of_range If
__n is an invalid index.
This function provides for safer data access. The parameter is first checked
that it is in the range of the deque. The function throws out_of_range
if the check fails.
Definition at line 1265 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::_M_range_check().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference std::deque< _Tp, _Alloc >::at (size_type__n) const [inline]¶
Provides access to the data contained in the deque. Parameters:__n The index of the element for which
data should be accessed.
Returns:
Read-only (constant) reference to data.
Exceptions:
std::out_of_range If
__n is an invalid index.
This function provides for safer data access. The parameter is first checked
that it is in the range of the deque. The function throws out_of_range
if the check fails.
Definition at line 1283 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::_M_range_check().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference std::deque< _Tp, _Alloc >::back () [inline]¶
Returns a read/write reference to the data at the last element of the deque. Definition at line 1310 of file stl_deque.h. References std::deque< _Tp, _Alloc >::end().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference std::deque< _Tp, _Alloc >::back () const [inline]¶
Returns a read-only (constant) reference to the data at the last element of the deque. Definition at line 1322 of file stl_deque.h. References std::deque< _Tp, _Alloc >::end().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::deque< _Tp, _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 1018 of file stl_deque.h. Referenced by std::deque< _Tp, _Alloc >::clear(), std::deque< _Tp, _Alloc >::deque(), std::deque< _Tp, _Alloc >::front(), std::deque< _Tp, _Alloc >::operator=(), std::operator==(), and std::deque< _Tp, _Alloc >::~deque().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator std::deque< _Tp, _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 1026 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator std::deque< _Tp, _Alloc >::cbegin () const [inline], [noexcept]¶
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 1089 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator std::deque< _Tp, _Alloc >::cend () const [inline], [noexcept]¶
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 1098 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _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 responsibility. Definition at line 1588 of file stl_deque.h. References std::deque< _Tp, _Alloc >::begin(). Referenced by std::deque< _Tp, _Alloc >::operator=().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reverse_iterator std::deque< _Tp, _Alloc >::crbegin () const [inline], [noexcept]¶
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 1107 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reverse_iterator std::deque< _Tp, _Alloc >::crend () const [inline], [noexcept]¶
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 1116 of file stl_deque.h.template<typename _Tp , typename _Alloc > template<typename... _Args> deque< _Tp, _Alloc >::iterator deque::emplace ( iterator__position, _Args &&...__args)¶
Inserts an object in deque before specified iterator. Parameters:__position An iterator into the deque.
__args Arguments.
Returns:
An iterator that points to the inserted
data.
This function will insert an object of type T constructed with
T(std::forward<Args>(args)...) before the specified location.
Definition at line 174 of file deque.tcc.
Referenced by std::deque< _Tp, _Alloc >::insert().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> bool std::deque< _Tp, _Alloc >::empty () const [inline]¶
Returns true if the deque is empty. (Thus begin() would equal end().) Definition at line 1209 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::deque< _Tp, _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 1035 of file stl_deque.h. Referenced by std::deque< _Tp, _Alloc >::back(), std::deque< _Tp, _Alloc >::deque(), std::deque< _Tp, _Alloc >::operator=(), std::operator==(), and std::deque< _Tp, _Alloc >::~deque().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator std::deque< _Tp, _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 1044 of file stl_deque.h.template<typename _Tp , typename _Alloc > deque< _Tp, _Alloc >:: iterator deque::erase (iterator__position)¶
Remove element at given position. Parameters:__position Iterator pointing to element
to be erased.
Returns:
An iterator pointing to the next element (or
end()).
This function will erase the element at the given position and thus shorten the
deque by one.
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 responsibility.
Definition at line 196 of file deque.tcc.
References std::begin(), std::end(), and std::size().
template<typename _Tp , typename _Alloc > deque< _Tp, _Alloc >:: iterator deque::erase (iterator__first, iterator__last)¶
Remove a range of elements. Parameters:__first Iterator pointing to the first
element to be erased.
__last Iterator pointing to one past the last element to be erased.
Returns:
An iterator pointing to the element pointed to
by last prior to erasing (or end()).
This function will erase the elements in the range [ first,last) and
shorten the deque accordingly.
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 responsibility.
Definition at line 219 of file deque.tcc.
References std::begin(), std::end(), and std::size().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference std::deque< _Tp, _Alloc >::front () [inline]¶
Returns a read/write reference to the data at the first element of the deque. Definition at line 1294 of file stl_deque.h. References std::deque< _Tp, _Alloc >::begin().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference std::deque< _Tp, _Alloc >::front () const [inline]¶
Returns a read-only (constant) reference to the data at the first element of the deque. Definition at line 1302 of file stl_deque.h. References std::deque< _Tp, _Alloc >::begin().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> allocator_type std::deque< _Tp, _Alloc >::get_allocator () const [inline]¶
Get a copy of the memory allocation object. Definition at line 1009 of file stl_deque.h.template<typename _Tp , typename _Alloc > deque< _Tp, _Alloc >:: iterator deque::insert (iterator__position, const value_type &__x)¶
Inserts given value into deque before specified iterator. Parameters:__position An iterator into the deque.
__x Data to be inserted.
Returns:
An iterator that points to the inserted
data.
This function will insert a copy of the given value before the specified
location.
Definition at line 151 of file deque.tcc.
Referenced by std::deque< _Tp, _Alloc >::resize().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::deque< _Tp, _Alloc >::insert ( iterator__position, value_type &&__x) [inline]¶
Inserts given rvalue into deque before specified iterator. Parameters:__position An iterator into the deque.
__x Data to be inserted.
Returns:
An iterator that points to the inserted
data.
This function will insert a copy of the given rvalue before the specified
location.
Definition at line 1473 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::emplace().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::insert ( iterator__p, initializer_list< value_type >__l) [inline]¶
Inserts an initializer list into the deque. Parameters:__p An iterator into the deque.
__l An initializer_list.
This function will insert copies of the data in the initializer_list
__l into the deque before the location specified by __p. This is
known as list insert.
Definition at line 1486 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::insert().
Referenced by std::deque< _Tp, _Alloc >::insert().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::insert ( iterator__position, size_type__n, const value_type &__x) [inline]¶
Inserts a number of copies of given data into the deque. Parameters:__position An iterator into the deque.
__n Number of elements to be inserted.
__x Data to be inserted.
This function will insert a specified number of copies of the given data before
the location specified by __position.
Definition at line 1500 of file stl_deque.h.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _InputIterator > void std::deque< _Tp, _Alloc >::insert (iterator__position, _InputIterator__first, _InputIterator__last) [inline]¶
Inserts a range into the deque. Parameters:__position An iterator into the deque.
__first An input iterator.
__last An input iterator.
This function will insert copies of the data in the range [ first,last)
into the deque before the location specified by __position. This is
known as range insert.
Definition at line 1515 of file stl_deque.h.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> size_type std::deque< _Tp, _Alloc >::max_size () const [inline]¶
Returns the size() of the largest possible deque. Definition at line 1128 of file stl_deque.h.template<typename _Tp , typename _Alloc > deque< _Tp, _Alloc > & deque::operator= (const deque< _Tp, _Alloc > &__x)¶
Deque assignment operator. Parameters:__x A deque of identical element and
allocator types.
All the elements of x are copied, but unlike the copy constructor, the
allocator object is not copied.
Definition at line 95 of file deque.tcc.
References std::deque< _Tp, _Alloc >::begin(), std::deque< _Tp, _Alloc
>::end(), std::deque< _Tp, _Alloc >::size(), and std::size().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> deque& std::deque< _Tp, _Alloc >::operator= ( deque< _Tp, _Alloc > &&__x) [inline]¶
Deque move assignment operator. Parameters:__x A deque of identical element and
allocator types.
The contents of __x are moved into this deque (without copying).
__x is a valid, but unspecified deque.
Definition at line 928 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::clear(), and std::deque< _Tp,
_Alloc >::swap().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> deque& std::deque< _Tp, _Alloc >::operator= ( initializer_list< value_type >__l) [inline]¶
Assigns an initializer list to a deque. Parameters:__l An initializer_list.
This function fills a deque with copies of the elements in the
initializer_list __l.
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 949 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::assign().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference std::deque< _Tp, _Alloc >::operator[] (size_type__n) [inline]¶
Subscript access to the data contained in the deque. Parameters:__n The index of the element for which
data should be accessed.
Returns:
Read/write reference to data.
This operator allows for easy, array-style, data access. Note that data access
with this operator is unchecked and out_of_range lookups are not
defined. (For checked lookups see at().)
Definition at line 1225 of file stl_deque.h.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference std::deque< _Tp, _Alloc >::operator[] (size_type__n) const [inline]¶
Subscript access to the data contained in the deque. Parameters:__n The index of the element for which
data should be accessed.
Returns:
Read-only (constant) reference to data.
This operator allows for easy, array-style, data access. Note that data access
with this operator is unchecked and out_of_range lookups are not
defined. (For checked lookups see at().)
Definition at line 1240 of file stl_deque.h.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _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 1423 of file stl_deque.h. References std::deque< _Tp, _Alloc >::_M_pop_back_aux().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _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 1402 of file stl_deque.h. References std::deque< _Tp, _Alloc >::_M_pop_front_aux().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::push_back (const value_type &__x) [inline]¶
Add data to the end of the deque. Parameters:__x Data to be added.
This is a typical stack operation. The function creates an element at the end of
the deque and assigns the given data to it. Due to the nature of a deque this
operation can be done in constant time.
Definition at line 1371 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::_M_push_back_aux().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::push_front (const value_type &__x) [inline]¶
Add data to the front of the deque. Parameters:__x Data to be added.
This is a typical stack operation. The function creates an element at the front
of the deque and assigns the given data to it. Due to the nature of a deque
this operation can be done in constant time.
Definition at line 1340 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::_M_push_front_aux().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reverse_iterator std::deque< _Tp, _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 1053 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reverse_iterator std::deque< _Tp, _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 1062 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reverse_iterator std::deque< _Tp, _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 1071 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reverse_iterator std::deque< _Tp, _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 1080 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::resize (size_type__new_size) [inline]¶
Resizes the deque to the specified number of elements. Parameters:__new_size Number of elements the deque
should contain.
This function will resize the deque to the specified number of elements. If the
number is smaller than the deque's current size the deque is truncated,
otherwise default constructed elements are appended.
Definition at line 1142 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::size().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::resize (size_type__new_size, const value_type &__x) [inline]¶
Resizes the deque to the specified number of elements. Parameters:__new_size Number of elements the deque
should contain.
__x Data with which new elements should be populated.
This function will resize the deque to the specified number of elements. If the
number is smaller than the deque's current size the deque is truncated,
otherwise the deque is extended and new elements are populated with given
data.
Definition at line 1164 of file stl_deque.h.
References std::deque< _Tp, _Alloc >::insert(), and std::deque< _Tp,
_Alloc >::size().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::shrink_to_fit () [inline]¶
A non-binding request to reduce memory use. Definition at line 1200 of file stl_deque.h.template<typename _Tp, typename _Alloc = std::allocator<_Tp>> size_type std::deque< _Tp, _Alloc >::size () const [inline]¶
Returns the number of elements in the deque. Definition at line 1123 of file stl_deque.h. Referenced by std::deque< _Tp, _Alloc >::_M_range_check(), std::deque< _Tp, _Alloc >::operator=(), std::operator==(), and std::deque< _Tp, _Alloc >::resize().template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::deque< _Tp, _Alloc >::swap ( deque< _Tp, _Alloc > &__x) [inline]¶
Swaps data with another deque. Parameters:__x A deque of the same element and
allocator types.
This exchanges the elements between two deques in constant time. (Four pointers,
so it should be quite fast.) Note that the global std::swap() function is
specialized such that std::swap(d1,d2) will feed to this function.
Definition at line 1568 of file stl_deque.h.
Referenced by std::deque< _Tp, _Alloc >::operator=(), and std::swap().
Author¶
Generated automatically by Doxygen for libstdc++ from the source code.Sun Jan 6 2013 | libstdc++ |