tmp/tmpllaci44l/{from.md → to.md}
RENAMED
|
@@ -1,50 +1,50 @@
|
|
| 1 |
#### Constructors, copy, and assignment <a id="deque.cons">[[deque.cons]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
-
explicit deque(const Allocator&);
|
| 5 |
```
|
| 6 |
|
| 7 |
*Effects:* Constructs an empty `deque`, using the specified allocator.
|
| 8 |
|
| 9 |
*Complexity:* Constant.
|
| 10 |
|
| 11 |
``` cpp
|
| 12 |
-
explicit deque(size_type n, const Allocator& = Allocator());
|
| 13 |
```
|
| 14 |
|
| 15 |
-
*Preconditions:* `T` is *Cpp17DefaultInsertable* into `
|
| 16 |
|
| 17 |
*Effects:* Constructs a `deque` with `n` default-inserted elements using
|
| 18 |
the specified allocator.
|
| 19 |
|
| 20 |
*Complexity:* Linear in `n`.
|
| 21 |
|
| 22 |
``` cpp
|
| 23 |
-
deque(size_type n, const T& value, const Allocator& = Allocator());
|
| 24 |
```
|
| 25 |
|
| 26 |
-
*Preconditions:* `T` is *Cpp17CopyInsertable* into `
|
| 27 |
|
| 28 |
*Effects:* Constructs a `deque` with `n` copies of `value`, using the
|
| 29 |
specified allocator.
|
| 30 |
|
| 31 |
*Complexity:* Linear in `n`.
|
| 32 |
|
| 33 |
``` cpp
|
| 34 |
template<class InputIterator>
|
| 35 |
-
deque(InputIterator first, InputIterator last, const Allocator& = Allocator());
|
| 36 |
```
|
| 37 |
|
| 38 |
*Effects:* Constructs a `deque` equal to the range \[`first`, `last`),
|
| 39 |
using the specified allocator.
|
| 40 |
|
| 41 |
*Complexity:* Linear in `distance(first, last)`.
|
| 42 |
|
| 43 |
``` cpp
|
| 44 |
template<container-compatible-range<T> R>
|
| 45 |
-
deque(from_range_t, R&& rg, const Allocator& = Allocator());
|
| 46 |
```
|
| 47 |
|
| 48 |
*Effects:* Constructs a `deque` with the elements of the range `rg`,
|
| 49 |
using the specified allocator.
|
| 50 |
|
|
|
|
| 1 |
#### Constructors, copy, and assignment <a id="deque.cons">[[deque.cons]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
+
constexpr explicit deque(const Allocator&);
|
| 5 |
```
|
| 6 |
|
| 7 |
*Effects:* Constructs an empty `deque`, using the specified allocator.
|
| 8 |
|
| 9 |
*Complexity:* Constant.
|
| 10 |
|
| 11 |
``` cpp
|
| 12 |
+
constexpr explicit deque(size_type n, const Allocator& = Allocator());
|
| 13 |
```
|
| 14 |
|
| 15 |
+
*Preconditions:* `T` is *Cpp17DefaultInsertable* into `deque`.
|
| 16 |
|
| 17 |
*Effects:* Constructs a `deque` with `n` default-inserted elements using
|
| 18 |
the specified allocator.
|
| 19 |
|
| 20 |
*Complexity:* Linear in `n`.
|
| 21 |
|
| 22 |
``` cpp
|
| 23 |
+
constexpr deque(size_type n, const T& value, const Allocator& = Allocator());
|
| 24 |
```
|
| 25 |
|
| 26 |
+
*Preconditions:* `T` is *Cpp17CopyInsertable* into `deque`.
|
| 27 |
|
| 28 |
*Effects:* Constructs a `deque` with `n` copies of `value`, using the
|
| 29 |
specified allocator.
|
| 30 |
|
| 31 |
*Complexity:* Linear in `n`.
|
| 32 |
|
| 33 |
``` cpp
|
| 34 |
template<class InputIterator>
|
| 35 |
+
constexpr deque(InputIterator first, InputIterator last, const Allocator& = Allocator());
|
| 36 |
```
|
| 37 |
|
| 38 |
*Effects:* Constructs a `deque` equal to the range \[`first`, `last`),
|
| 39 |
using the specified allocator.
|
| 40 |
|
| 41 |
*Complexity:* Linear in `distance(first, last)`.
|
| 42 |
|
| 43 |
``` cpp
|
| 44 |
template<container-compatible-range<T> R>
|
| 45 |
+
constexpr deque(from_range_t, R&& rg, const Allocator& = Allocator());
|
| 46 |
```
|
| 47 |
|
| 48 |
*Effects:* Constructs a `deque` with the elements of the range `rg`,
|
| 49 |
using the specified allocator.
|
| 50 |
|