Public Types | |
typedef Allocator::reference | reference |
typedef Allocator::const_reference | const_reference |
typedef __gnu_debug::Safe_iterator< typename Base::iterator, deque > | iterator |
typedef __gnu_debug::Safe_iterator< typename Base::const_iterator, deque > | const_iterator |
typedef Base::size_type | size_type |
typedef Base::difference_type | difference_type |
typedef Type | value_type |
typedef Allocator | allocator_type |
typedef Allocator::pointer | pointer |
typedef Allocator::const_pointer | const_pointer |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
Public Member Functions | |
deque (const Allocator &a=Allocator()) | |
deque (size_type n, const Type &value=Type(), const Allocator &a=Allocator()) | |
template<class InputIterator> | |
deque (InputIterator first, InputIterator last, const Allocator &a=Allocator()) | |
deque (const deque< Type, Allocator > &x) | |
deque (const Base &x) | |
~deque () | |
deque< Type, Allocator > & | operator= (const deque< Type, Allocator > &x) |
template<class InputIterator> | |
void | assign (InputIterator first, InputIterator last) |
Assigns a range to a deque. | |
void | assign (size_type n, const Type &__t) |
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 |
void | resize (size_type sz, Type c=Type()) |
reference | operator[] (size_type n) |
const_reference | operator[] (size_type n) const |
reference | front () |
const_reference | front () const |
reference | back () |
const_reference | back () const |
void | push_front (const Type &x) |
Add data to the front of the deque. | |
void | push_back (const Type &x) |
Add data to the end of the deque. | |
iterator | insert (iterator position, const Type &x) |
void | insert (iterator position, size_type n, const Type &x) |
template<class InputIterator> | |
void | insert (iterator position, InputIterator first, InputIterator last) |
void | pop_front () |
Removes first element. | |
void | pop_back () |
Removes last element. | |
iterator | erase (iterator position) |
iterator | erase (iterator first, iterator last) |
void | swap (deque< Type, Allocator > &x) |
void | clear () |
Base & | M_base () |
const Base & | M_base () const |
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. | |
deque (InputIterator first, InputIterator last, const allocator_type &a=allocator_type()) | |
Builds a deque from a range. | |
void | assign (size_type n, const value_type &__val) |
Assigns a given value to a deque. | |
allocator_type | get_allocator () const |
Get a copy of the memory allocation object. | |
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. | |
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. | |
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 | M_invalidate_if (Predicate pred) |
void | M_transfer_iter (const Safe_iterator< Iterator, deque< Type, Allocator > > &x) |
void | M_invalidate_all () const |
Public Attributes | |
Safe_iterator_base * | M_iterators |
The list of mutable iterators that reference this container. | |
Safe_iterator_base * | M_const_iterators |
The list of constant iterators that reference this container. | |
unsigned int | M_version |
The container version number. This number may never be 0. | |
Protected Types | |
typedef pointer * | Map_pointer |
typedef Allocator::template rebind< Type * >::other | Map_alloc_type |
Protected Member Functions | |
void | M_range_check (size_type n) const |
void | M_initialize_dispatch (Integer n, Integer x, __true_type) |
void | M_initialize_dispatch (InputIterator first, InputIterator last, __false_type) |
void | M_assign_dispatch (Integer n, Integer __val, __true_type) |
void | M_assign_dispatch (InputIterator first, InputIterator last, __false_type) |
void | M_assign_aux (ForwardIterator first, ForwardIterator last, forward_iterator_tag) |
void | M_fill_assign (size_type n, const value_type &__val) |
void | M_insert_dispatch (iterator position, Integer n, Integer x, __true_type) |
void | M_insert_dispatch (iterator position, InputIterator first, InputIterator last, __false_type) |
iterator | M_reserve_elements_at_front (size_type n) |
iterator | M_reserve_elements_at_back (size_type n) |
void | M_reserve_map_at_back (size_type nodes_to_add=1) |
void | M_reserve_map_at_front (size_type nodes_to_add=1) |
Deque_base (const allocator_type &a, size_t num_elements) | |
Deque_base (const allocator_type &a) | |
Map_alloc_type | M_get_map_allocator () const |
Type * | M_allocate_node () |
void | M_deallocate_node (Type *__p) |
Type ** | M_allocate_map (size_t n) |
void | M_deallocate_map (Type **__p, size_t n) |
void | M_detach_all () |
void | M_detach_singular () |
void | M_revalidate_singular () |
void | M_swap (Safe_sequence_base &x) |
Static Protected Member Functions | |
static size_t | S_buffer_size () |
Protected Attributes | |
Deque_impl | M_impl |
Private Types | |
typedef std::deque< Type, Allocator > | Base |
typedef __gnu_debug::Safe_sequence< deque > | Safe_base |
Definition at line 41 of file debug/deque.
|
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. Reimplemented from std::deque< Type, Allocator >. Definition at line 85 of file debug/deque. |
|
Assigns a given value to a deque.
Definition at line 726 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. Reimplemented from std::deque< Type, Allocator >. Definition at line 97 of file debug/deque. |
|
Provides access to the data contained in the deque.
Definition at line 934 of file stl_deque.h. |
|
Provides access to the data contained in the deque.
Definition at line 920 of file stl_deque.h. |
|
Returns a read-only (constant) reference to the data at the last element of the deque. Reimplemented from std::deque< Type, Allocator >. Definition at line 207 of file debug/deque. |
|
Returns a read/write reference to the data at the last element of the deque. Reimplemented from std::deque< Type, Allocator >. Definition at line 200 of file debug/deque. |
|
Returns a read-only (constant) iterator that points to the first element in the deque. Iteration is done in ordinary element order. Reimplemented from std::deque< Type, Allocator >. Definition at line 119 of file debug/deque. |
|
Returns a read/write iterator that points to the first element in the deque. Iteration is done in ordinary element order. Reimplemented from std::deque< Type, Allocator >. Definition at line 115 of file debug/deque. Referenced by __gnu_debug_def::deque< Type, Allocator >::erase(), __gnu_debug_def::deque< Type, Allocator >::pop_front(), __gnu_debug_def::deque< Type, Allocator >::rend(), and __gnu_debug_def::deque< Type, Allocator >::resize(). |
|
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. Reimplemented from std::deque< Type, Allocator >. Definition at line 333 of file debug/deque. |
|
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 688 of file stl_deque.h. |
|
Deque copy constructor.
Definition at line 669 of file stl_deque.h. References std::deque< Type, Alloc >::begin(), std::deque< Type, Alloc >::end(), and std::uninitialized_copy(). |
|
Create a deque with default elements.
Definition at line 658 of file stl_deque.h. |
|
Create a deque with copies of an exemplar element.
Definition at line 645 of file stl_deque.h. |
|
Default constructor creates no elements.
Definition at line 635 of file stl_deque.h. |
|
Returns true if the deque is empty. (Thus begin() would equal end().) Definition at line 869 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. Reimplemented from std::deque< Type, Allocator >. Definition at line 127 of file debug/deque. |
|
Returns a read/write iterator that points one past the last element in the deque. Iteration is done in ordinary element order. Reimplemented from std::deque< Type, Allocator >. Definition at line 123 of file debug/deque. Referenced by __gnu_debug_def::deque< Type, Allocator >::erase(), __gnu_debug_def::deque< Type, Allocator >::pop_back(), and __gnu_debug_def::deque< Type, Allocator >::rbegin(). |
|
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. |
|
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. |
|
Returns a read-only (constant) reference to the data at the first element of the deque. Reimplemented from std::deque< Type, Allocator >. Definition at line 193 of file debug/deque. |
|
Returns a read/write reference to the data at the first element of the deque. Reimplemented from std::deque< Type, Allocator >. Definition at line 186 of file debug/deque. |
|
Get a copy of the memory allocation object.
Reimplemented from std::Deque_base< Type, Allocator >. Definition at line 751 of file stl_deque.h. |
|
Inserts a range into the deque.
Definition at line 1098 of file stl_deque.h. |
|
Inserts a number of copies of given data into the deque.
Definition at line 1083 of file stl_deque.h. |
|
Inserts given value into deque before specified iterator.
|
|
Detach all iterators, leaving them singular. |
|
Detach all singular iterators.
|
|
Invalidates all iterators. Definition at line 202 of file safe_base.h. |
|
Invalidates all iterators |
|
Revalidates all attached singular iterators. This method may be used to validate iterators that were invalidated before (but for some reasion, such as an exception, need to become valid again). |
|
Swap this sequence with the given sequence. This operation also swaps ownership of the iterators, so that when the operation is complete all iterators that originally referenced one container now reference the other container. Definition at line 172 of file debug.cc. References __gnu_debug::swap(). |
|
Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to. |
|
Returns the size() of the largest possible deque. Definition at line 829 of file stl_deque.h. |
|
Subscript access to the data contained in the deque.
Definition at line 896 of file stl_deque.h. |
|
Subscript access to the data contained in the deque.
Definition at line 883 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. Reimplemented from std::deque< Type, Allocator >. Definition at line 265 of file debug/deque. References __gnu_debug_def::deque< Type, Allocator >::end(). |
|
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. Reimplemented from std::deque< Type, Allocator >. Definition at line 256 of file debug/deque. References __gnu_debug_def::deque< Type, Allocator >::begin(). |
|
Add data to the end of the deque.
Reimplemented from std::deque< Type, Allocator >. Definition at line 222 of file debug/deque. |
|
Add data to the front of the deque.
Reimplemented from std::deque< Type, Allocator >. Definition at line 215 of file debug/deque. |
|
Returns a read-only (constant) reverse iterator that points to the last element in the deque. Iteration is done in reverse element order. Reimplemented from std::deque< Type, Allocator >. Definition at line 135 of file debug/deque. References __gnu_debug_def::deque< Type, Allocator >::end(). |
|
Returns a read/write reverse iterator that points to the last element in the deque. Iteration is done in reverse element order. Reimplemented from std::deque< Type, Allocator >. Definition at line 131 of file debug/deque. References __gnu_debug_def::deque< Type, Allocator >::end(). |
|
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. Reimplemented from std::deque< Type, Allocator >. Definition at line 143 of file debug/deque. References __gnu_debug_def::deque< Type, Allocator >::begin(). |
|
Returns a read/write reverse iterator that points to one before the first element in the deque. Iteration is done in reverse element order. Reimplemented from std::deque< Type, Allocator >. Definition at line 139 of file debug/deque. References __gnu_debug_def::deque< Type, Allocator >::begin(). |
|
Resizes the deque to the specified number of elements.
Definition at line 862 of file stl_deque.h. References std::deque< Type, Alloc >::resize(). |
|
Resizes the deque to the specified number of elements.
Definition at line 843 of file stl_deque.h. References std::deque< Type, Alloc >::erase(), std::deque< Type, Alloc >::insert(), and std::deque< Type, Alloc >::size(). |
|
Returns the number of elements in the deque. Definition at line 824 of file stl_deque.h. Referenced by __gnu_debug_def::deque< Type, Allocator >::resize(). |
|
Swaps data with another deque.
Definition at line 1151 of file stl_deque.h. References std::swap(). |
|
The list of constant iterators that reference this container.
Definition at line 156 of file safe_base.h. |
|
The list of mutable iterators that reference this container.
Definition at line 153 of file safe_base.h. |
|
The container version number. This number may never be 0.
Definition at line 159 of file safe_base.h. |