3.3 KiB
[deque.cons]
23 Containers library [containers]
23.3 Sequence containers [sequences]
23.3.5 Class template deque [deque]
23.3.5.2 Constructors, copy, and assignment [deque.cons]
constexpr explicit deque(const Allocator&);
Effects: Constructs an emptydeque, using the specified allocator.
Complexity: Constant.
constexpr explicit deque(size_type n, const Allocator& = Allocator());
Preconditions: T is Cpp17DefaultInsertable into deque.
Effects: Constructs a deque withn default-inserted elements using the specified allocator.
Complexity: Linear in n.
constexpr deque(size_type n, const T& value, const Allocator& = Allocator());
Preconditions: T is Cpp17CopyInsertable into deque.
Effects: Constructs adeque with n copies of value, using the specified allocator.
Complexity: Linear in n.
template<class InputIterator> constexpr deque(InputIterator first, InputIterator last, const Allocator& = Allocator());
Effects: Constructs adeque equal to the range [first, last), using the specified allocator.
Complexity: Linear in distance(first, last).
template<[container-compatible-range](container.intro.reqmts#concept:container-compatible-range "23.2.2.1 Introduction [container.intro.reqmts]")<T> R> constexpr deque(from_range_t, R&& rg, const Allocator& = Allocator());
Effects: Constructs a deque with the elements of the range rg, using the specified allocator.
Complexity: Linear in ranges::distance(rg).