tmp/tmp88avrm3h/{from.md → to.md}
RENAMED
|
@@ -2,54 +2,54 @@
|
|
| 2 |
|
| 3 |
If `uses_allocator_v<container_type, Alloc>` is `false` the constructors
|
| 4 |
in this subclause shall not participate in overload resolution.
|
| 5 |
|
| 6 |
``` cpp
|
| 7 |
-
template<class Alloc> explicit queue(const Alloc& a);
|
| 8 |
```
|
| 9 |
|
| 10 |
*Effects:* Initializes `c` with `a`.
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
-
template<class Alloc> queue(const container_type& cont, const Alloc& a);
|
| 14 |
```
|
| 15 |
|
| 16 |
*Effects:* Initializes `c` with `cont` as the first argument and `a` as
|
| 17 |
the second argument.
|
| 18 |
|
| 19 |
``` cpp
|
| 20 |
-
template<class Alloc> queue(container_type&& cont, const Alloc& a);
|
| 21 |
```
|
| 22 |
|
| 23 |
*Effects:* Initializes `c` with `std::move(cont)` as the first argument
|
| 24 |
and `a` as the second argument.
|
| 25 |
|
| 26 |
``` cpp
|
| 27 |
-
template<class Alloc> queue(const queue& q, const Alloc& a);
|
| 28 |
```
|
| 29 |
|
| 30 |
*Effects:* Initializes `c` with `q.c` as the first argument and `a` as
|
| 31 |
the second argument.
|
| 32 |
|
| 33 |
``` cpp
|
| 34 |
-
template<class Alloc> queue(queue&& q, const Alloc& a);
|
| 35 |
```
|
| 36 |
|
| 37 |
*Effects:* Initializes `c` with `std::move(q.c)` as the first argument
|
| 38 |
and `a` as the second argument.
|
| 39 |
|
| 40 |
``` cpp
|
| 41 |
template<class InputIterator, class Alloc>
|
| 42 |
-
queue(InputIterator first, InputIterator last, const Alloc& alloc);
|
| 43 |
```
|
| 44 |
|
| 45 |
*Effects:* Initializes `c` with `first` as the first argument, `last` as
|
| 46 |
the second argument, and `alloc` as the third argument.
|
| 47 |
|
| 48 |
``` cpp
|
| 49 |
template<container-compatible-range<T> R, class Alloc>
|
| 50 |
-
queue(from_range_t, R&& rg, const Alloc& a);
|
| 51 |
```
|
| 52 |
|
| 53 |
*Effects:* Initializes `c` with
|
| 54 |
`ranges::to<Container>(std::forward<R>(rg), a)`.
|
| 55 |
|
|
|
|
| 2 |
|
| 3 |
If `uses_allocator_v<container_type, Alloc>` is `false` the constructors
|
| 4 |
in this subclause shall not participate in overload resolution.
|
| 5 |
|
| 6 |
``` cpp
|
| 7 |
+
template<class Alloc> constexpr explicit queue(const Alloc& a);
|
| 8 |
```
|
| 9 |
|
| 10 |
*Effects:* Initializes `c` with `a`.
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
+
template<class Alloc> constexpr queue(const container_type& cont, const Alloc& a);
|
| 14 |
```
|
| 15 |
|
| 16 |
*Effects:* Initializes `c` with `cont` as the first argument and `a` as
|
| 17 |
the second argument.
|
| 18 |
|
| 19 |
``` cpp
|
| 20 |
+
template<class Alloc> constexpr queue(container_type&& cont, const Alloc& a);
|
| 21 |
```
|
| 22 |
|
| 23 |
*Effects:* Initializes `c` with `std::move(cont)` as the first argument
|
| 24 |
and `a` as the second argument.
|
| 25 |
|
| 26 |
``` cpp
|
| 27 |
+
template<class Alloc> constexpr queue(const queue& q, const Alloc& a);
|
| 28 |
```
|
| 29 |
|
| 30 |
*Effects:* Initializes `c` with `q.c` as the first argument and `a` as
|
| 31 |
the second argument.
|
| 32 |
|
| 33 |
``` cpp
|
| 34 |
+
template<class Alloc> constexpr queue(queue&& q, const Alloc& a);
|
| 35 |
```
|
| 36 |
|
| 37 |
*Effects:* Initializes `c` with `std::move(q.c)` as the first argument
|
| 38 |
and `a` as the second argument.
|
| 39 |
|
| 40 |
``` cpp
|
| 41 |
template<class InputIterator, class Alloc>
|
| 42 |
+
constexpr queue(InputIterator first, InputIterator last, const Alloc& alloc);
|
| 43 |
```
|
| 44 |
|
| 45 |
*Effects:* Initializes `c` with `first` as the first argument, `last` as
|
| 46 |
the second argument, and `alloc` as the third argument.
|
| 47 |
|
| 48 |
``` cpp
|
| 49 |
template<container-compatible-range<T> R, class Alloc>
|
| 50 |
+
constexpr queue(from_range_t, R&& rg, const Alloc& a);
|
| 51 |
```
|
| 52 |
|
| 53 |
*Effects:* Initializes `c` with
|
| 54 |
`ranges::to<Container>(std::forward<R>(rg), a)`.
|
| 55 |
|