tmp/tmpjvfg4bz9/{from.md → to.md}
RENAMED
|
@@ -1,51 +1,51 @@
|
|
| 1 |
-
####
|
| 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 priority_queue(const Alloc& a);
|
| 8 |
```
|
| 9 |
|
| 10 |
-
*Effects:*
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
template<class Alloc> priority_queue(const Compare& compare, const Alloc& a);
|
| 14 |
```
|
| 15 |
|
| 16 |
-
*Effects:*
|
| 17 |
`compare`.
|
| 18 |
|
| 19 |
``` cpp
|
| 20 |
template<class Alloc>
|
| 21 |
priority_queue(const Compare& compare, const Container& cont, const Alloc& a);
|
| 22 |
```
|
| 23 |
|
| 24 |
-
*Effects:*
|
| 25 |
the second argument, and initializes `comp` with `compare`; calls
|
| 26 |
`make_heap(c.begin(), c.end(), comp)`.
|
| 27 |
|
| 28 |
``` cpp
|
| 29 |
template<class Alloc>
|
| 30 |
priority_queue(const Compare& compare, Container&& cont, const Alloc& a);
|
| 31 |
```
|
| 32 |
|
| 33 |
-
*Effects:*
|
| 34 |
and `a` as the second argument, and initializes `comp` with `compare`;
|
| 35 |
calls `make_heap(c.begin(), c.end(), comp)`.
|
| 36 |
|
| 37 |
``` cpp
|
| 38 |
template<class Alloc> priority_queue(const priority_queue& q, const Alloc& a);
|
| 39 |
```
|
| 40 |
|
| 41 |
-
*Effects:*
|
| 42 |
the second argument, and initializes `comp` with `q.comp`.
|
| 43 |
|
| 44 |
``` cpp
|
| 45 |
template<class Alloc> priority_queue(priority_queue&& q, const Alloc& a);
|
| 46 |
```
|
| 47 |
|
| 48 |
-
*Effects:*
|
| 49 |
and `a` as the second argument, and initializes `comp` with
|
| 50 |
`std::move(q.comp)`.
|
| 51 |
|
|
|
|
| 1 |
+
#### Constructors with allocators <a id="priqueue.cons.alloc">[[priqueue.cons.alloc]]</a>
|
| 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 priority_queue(const Alloc& a);
|
| 8 |
```
|
| 9 |
|
| 10 |
+
*Effects:* Initializes `c` with `a` and value-initializes `comp`.
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
template<class Alloc> priority_queue(const Compare& compare, const Alloc& a);
|
| 14 |
```
|
| 15 |
|
| 16 |
+
*Effects:* Initializes `c` with `a` and initializes `comp` with
|
| 17 |
`compare`.
|
| 18 |
|
| 19 |
``` cpp
|
| 20 |
template<class Alloc>
|
| 21 |
priority_queue(const Compare& compare, const Container& cont, const Alloc& a);
|
| 22 |
```
|
| 23 |
|
| 24 |
+
*Effects:* Initializes `c` with `cont` as the first argument and `a` as
|
| 25 |
the second argument, and initializes `comp` with `compare`; calls
|
| 26 |
`make_heap(c.begin(), c.end(), comp)`.
|
| 27 |
|
| 28 |
``` cpp
|
| 29 |
template<class Alloc>
|
| 30 |
priority_queue(const Compare& compare, Container&& cont, const Alloc& a);
|
| 31 |
```
|
| 32 |
|
| 33 |
+
*Effects:* Initializes `c` with `std::move(cont)` as the first argument
|
| 34 |
and `a` as the second argument, and initializes `comp` with `compare`;
|
| 35 |
calls `make_heap(c.begin(), c.end(), comp)`.
|
| 36 |
|
| 37 |
``` cpp
|
| 38 |
template<class Alloc> priority_queue(const priority_queue& q, const Alloc& a);
|
| 39 |
```
|
| 40 |
|
| 41 |
+
*Effects:* Initializes `c` with `q.c` as the first argument and `a` as
|
| 42 |
the second argument, and initializes `comp` with `q.comp`.
|
| 43 |
|
| 44 |
``` cpp
|
| 45 |
template<class Alloc> priority_queue(priority_queue&& q, const Alloc& a);
|
| 46 |
```
|
| 47 |
|
| 48 |
+
*Effects:* Initializes `c` with `std::move(q.c)` as the first argument
|
| 49 |
and `a` as the second argument, and initializes `comp` with
|
| 50 |
`std::move(q.comp)`.
|
| 51 |
|