std::deque::deque
From cppreference.com
explicit deque( const Allocator& alloc = Allocator() ); |
(1) | |
explicit deque( size_type count, const T& value = T(), |
(2) | (until C++11) (since C++11) |
explicit deque( size_type count ); |
(3) | (since C++11) |
template <class InputIterator> deque( InputIterator first, InputIterator last, |
(4) | |
deque( const deque& other ); |
(5) | |
deque( const deque& other, const Allocator& alloc ); |
(5) | (since C++11) |
deque( deque&& other ) |
(6) | (since C++11) |
deque( deque&& other, const Allocator& alloc ); |
(6) | (since C++11) |
deque( std::initializer_list<T> init, const Allocator& alloc = Allocator() ); |
(7) | (since C++11) |
Constructs new container from a variety of data sources and optionally using user supplied allocator alloc.
1) Default constructor. Constructs empty container.
2) Constructs the container with count copies of elements with value value.
3) Constructs the container with count value-initialized (default constructed, for classes) instances of T. No copies are made.
4) Constructs the container with the contents of the range [first, last).
5) Copy constructor. Constructs the container with the copy of the contents of other. If alloc is not provided, allocator is obtained by calling std::allocator_traits<allocator_type>::select_on_copy_construction(other).
6) Move constructor. Constructs the container with the contents of other using move semantics. If alloc is not provided, allocator is obtained by move-construction from the allocator belonging to other.
7) Constructs the container with the contents of the initializer list init.
Contents |
[edit] Parameters
alloc | - | allocator to use for all memory allocations of this container |
count | - | the size of the container |
value | - | the value to initialize elements of the container with |
first, last | - | the range to copy the elements from |
other | - | another container to be used as source to initialize the elements of the container with |
init | - | initializer list to initialize the elements of the container with |
[edit] Complexity
1) Constant
2-3) Linear in count
4) Linear in distance between first and last
5) Linear in size of other
6) Constant. If alloc is given and alloc != other.get_allocator(), then linear.
7) Linear in size of init
[edit] Example
#include <deque> #include <string> int main() { // c++11 initializer list syntax: std::deque<std::string> words1 {"the", "frogurt", "is", "also", "cursed"}; // words2 == words1 std::deque<std::string> words2(words1.begin(), words1.end()); // words3 == words1 std::deque<std::string> words3(words1); // words4 is {"Mo", "Mo", "Mo", "Mo", "Mo"} std::deque<std::string> words4(5, "Mo"); return 0; }
[edit] See also
assigns values to the container (public member function) | |
assigns values to the container (public member function) |