std::deque
From cppreference.com
Defined in header <deque>
|
||
template< class T, |
||
Double-ended queues (or deques) are similar to vectors, except that they allow fast insertions and deletions at both the beginning and the end of the container and that they are not required to be contiguous.
Deques are commonly implemented as lists of individual dynamically allocated arrays of some convenient size, e.g. memory page size. This guarantees constant time access, amortized constant time insertion and deletion at either end of the deque (a new array may have to be allocated), and linear time insertion and deletion from the middle of the deque.
std::deque meets the requirements of Container, AllocatorAwareContainer, SequenceContainer and ReversibleContainer.
Contents |
[edit] Member types
Member type | Definition |
value_type | T |
allocator_type | Allocator |
size_type | Unsigned integral type (usually size_t) |
difference_type | Signed integer type (usually ptrdiff_t) |
reference | Allocator::reference (until C++11) value_type& (since C++11) |
const_reference | Allocator::const_reference (until C++11) const value_type& (since C++11) |
pointer | Allocator::pointer (until C++11) std::allocator_traits<Allocator>::pointer (since C++11) |
const_pointer | Allocator::const_pointer (until C++11) std::allocator_traits<Allocator>::const_pointer (since C++11) |
iterator | RandomAccessIterator |
const_iterator | Constant random access iterator |
reverse_iterator
|
std::reverse_iterator<iterator> |
const_reverse_iterator
|
std::reverse_iterator<const_iterator> |
[edit] Member functions
constructs the deque (public member function) | |
destructs the deque (public member function) | |
assigns values to the container (public member function) | |
assigns values to the container (public member function) | |
returns the associated allocator (public member function) | |
Element access | |
access specified element with bounds checking (public member function) | |
access specified element (public member function) | |
access the first element (public member function) | |
access the last element (public member function) | |
Iterators | |
returns an iterator to the beginning (public member function) | |
returns an iterator to the end (public member function) | |
returns a reverse iterator to the beginning (public member function) | |
returns a reverse iterator to the end (public member function) | |
Capacity | |
checks whether the container is empty (public member function) | |
returns the number of elements (public member function) | |
returns the maximum possible number of elements (public member function) | |
(C++11) |
reduces memory usage by freeing unused memory (public member function) |
Modifiers | |
clears the contents (public member function) | |
inserts elements (public member function) | |
(C++11) |
constructs element in-place (public member function) |
erases elements (public member function) | |
adds elements to the end (public member function) | |
(C++11) |
constructs elements in-place at the end (public member function) |
removes the last element (public member function) | |
inserts elements to the beginning (public member function) | |
(C++11) |
constructs elements in-place at the beginning (public member function) |
removes the first element (public member function) | |
changes the number of elements stored (public member function) | |
swaps the contents (public member function) |
[edit] Non-member functions
lexicographically compares the values in the deque (function template) | |
specializes the std::swap algorithm (function template) |