tmp/tmp7c5mra2i/{from.md → to.md}
RENAMED
|
@@ -47,5 +47,63 @@ template<class Alloc> priority_queue(priority_queue&& q, const Alloc& a);
|
|
| 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 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 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 |
|
| 52 |
+
``` cpp
|
| 53 |
+
template<class InputIterator, class Alloc>
|
| 54 |
+
priority_queue(InputIterator first, InputIterator last, const Alloc& a);
|
| 55 |
+
```
|
| 56 |
+
|
| 57 |
+
*Effects:* Initializes `c` with `first` as the first argument, `last` as
|
| 58 |
+
the second argument, and `a` as the third argument, and
|
| 59 |
+
value-initializes `comp`; calls `make_heap(c.begin(), c.end(), comp)`.
|
| 60 |
+
|
| 61 |
+
``` cpp
|
| 62 |
+
template<class InputIterator, class Alloc>
|
| 63 |
+
priority_queue(InputIterator first, InputIterator last, const Compare& compare, const Alloc& a);
|
| 64 |
+
```
|
| 65 |
+
|
| 66 |
+
*Effects:* Initializes `c` with `first` as the first argument, `last` as
|
| 67 |
+
the second argument, and `a` as the third argument, and initializes
|
| 68 |
+
`comp` with `compare`; calls `make_heap(c.begin(), c.end(), comp)`.
|
| 69 |
+
|
| 70 |
+
``` cpp
|
| 71 |
+
template<class InputIterator, class Alloc>
|
| 72 |
+
priority_queue(InputIterator first, InputIterator last, const Compare& compare,
|
| 73 |
+
const Container& cont, const Alloc& a);
|
| 74 |
+
```
|
| 75 |
+
|
| 76 |
+
*Effects:* Initializes `c` with `cont` as the first argument and `a` as
|
| 77 |
+
the second argument, and initializes `comp` with `compare`; calls
|
| 78 |
+
`c.insert(c.end(), first, last)`; and finally calls
|
| 79 |
+
`make_heap(c.begin(), c.end(), comp)`.
|
| 80 |
+
|
| 81 |
+
``` cpp
|
| 82 |
+
template<class InputIterator, class Alloc>
|
| 83 |
+
priority_queue(InputIterator first, InputIterator last, const Compare& compare, Container&& cont,
|
| 84 |
+
const Alloc& a);
|
| 85 |
+
```
|
| 86 |
+
|
| 87 |
+
*Effects:* Initializes `c` with `std::move(cont)` as the first argument
|
| 88 |
+
and `a` as the second argument, and initializes `comp` with `compare`;
|
| 89 |
+
calls `c.insert(c.end(), first, last)`; and finally calls
|
| 90 |
+
`make_heap(c.begin(), c.end(), comp)`.
|
| 91 |
+
|
| 92 |
+
``` cpp
|
| 93 |
+
template<container-compatible-range<T> R, class Alloc>
|
| 94 |
+
priority_queue(from_range_t, R&& rg, const Compare& compare, const Alloc& a);
|
| 95 |
+
```
|
| 96 |
+
|
| 97 |
+
*Effects:* Initializes `comp` with `compare` and `c` with
|
| 98 |
+
`ranges::to<Container>(std::forward<R>(rg), a)`; calls
|
| 99 |
+
`make_heap(c.begin(), c.end(), comp)`.
|
| 100 |
+
|
| 101 |
+
``` cpp
|
| 102 |
+
template<container-compatible-range<T> R, class Alloc>
|
| 103 |
+
priority_queue(from_range_t, R&& rg, const Alloc& a);
|
| 104 |
+
```
|
| 105 |
+
|
| 106 |
+
*Effects:* Initializes `c` with
|
| 107 |
+
`ranges::to<Container>(std::forward<R>(rg), a)`; calls
|
| 108 |
+
`make_heap(c.begin(), c.end(), comp)`.
|
| 109 |
+
|