tmp/tmpi9yin3q6/{from.md → to.md}
RENAMED
|
@@ -9,20 +9,41 @@ priority_queue(const Compare& x, Container&& y);
|
|
| 9 |
|
| 10 |
*Effects:* Initializes `comp` with `x` and `c` with `y` (copy
|
| 11 |
constructing or move constructing as appropriate); calls
|
| 12 |
`make_heap(c.begin(), c.end(), comp)`.
|
| 13 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 14 |
``` cpp
|
| 15 |
template<class InputIterator>
|
| 16 |
priority_queue(InputIterator first, InputIterator last, const Compare& x, const Container& y);
|
| 17 |
template<class InputIterator>
|
| 18 |
-
priority_queue(InputIterator first, InputIterator last, const Compare& x
|
| 19 |
-
Container&& y = Container());
|
| 20 |
```
|
| 21 |
|
| 22 |
*Preconditions:* `x` defines a strict weak ordering [[alg.sorting]].
|
| 23 |
|
| 24 |
*Effects:* Initializes `comp` with `x` and `c` with `y` (copy
|
| 25 |
constructing or move constructing as appropriate); calls
|
| 26 |
`c.insert(c.end(), first, last)`; and finally calls
|
| 27 |
`make_heap(c.begin(), c.end(), comp)`.
|
| 28 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 9 |
|
| 10 |
*Effects:* Initializes `comp` with `x` and `c` with `y` (copy
|
| 11 |
constructing or move constructing as appropriate); calls
|
| 12 |
`make_heap(c.begin(), c.end(), comp)`.
|
| 13 |
|
| 14 |
+
``` cpp
|
| 15 |
+
template<class InputIterator>
|
| 16 |
+
priority_queue(InputIterator first, InputIterator last, const Compare& x = Compare());
|
| 17 |
+
```
|
| 18 |
+
|
| 19 |
+
*Preconditions:* `x` defines a strict weak ordering [[alg.sorting]].
|
| 20 |
+
|
| 21 |
+
*Effects:* Initializes `c` with `first` as the first argument and `last`
|
| 22 |
+
as the second argument, and initializes `comp` with `x`; then calls
|
| 23 |
+
`make_heap(c.begin(), c.end(), comp)`.
|
| 24 |
+
|
| 25 |
``` cpp
|
| 26 |
template<class InputIterator>
|
| 27 |
priority_queue(InputIterator first, InputIterator last, const Compare& x, const Container& y);
|
| 28 |
template<class InputIterator>
|
| 29 |
+
priority_queue(InputIterator first, InputIterator last, const Compare& x, Container&& y);
|
|
|
|
| 30 |
```
|
| 31 |
|
| 32 |
*Preconditions:* `x` defines a strict weak ordering [[alg.sorting]].
|
| 33 |
|
| 34 |
*Effects:* Initializes `comp` with `x` and `c` with `y` (copy
|
| 35 |
constructing or move constructing as appropriate); calls
|
| 36 |
`c.insert(c.end(), first, last)`; and finally calls
|
| 37 |
`make_heap(c.begin(), c.end(), comp)`.
|
| 38 |
|
| 39 |
+
``` cpp
|
| 40 |
+
template<container-compatible-range<T> R>
|
| 41 |
+
priority_queue(from_range_t, R&& rg, const Compare& x = Compare());
|
| 42 |
+
```
|
| 43 |
+
|
| 44 |
+
*Preconditions:* `x` defines a strict weak ordering [[alg.sorting]].
|
| 45 |
+
|
| 46 |
+
*Effects:* Initializes `comp` with `x` and `c` with
|
| 47 |
+
`ranges::to<Container>(std::forward<R>(rg))` and finally calls
|
| 48 |
+
`make_heap(c.begin(), c.end(), comp)`.
|
| 49 |
+
|