tmp/tmp1eyh999y/{from.md → to.md}
RENAMED
|
@@ -1,20 +1,20 @@
|
|
| 1 |
#### Members <a id="priqueue.members">[[priqueue.members]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
-
void push(const value_type& x);
|
| 5 |
```
|
| 6 |
|
| 7 |
*Effects:* As if by:
|
| 8 |
|
| 9 |
``` cpp
|
| 10 |
c.push_back(x);
|
| 11 |
push_heap(c.begin(), c.end(), comp);
|
| 12 |
```
|
| 13 |
|
| 14 |
``` cpp
|
| 15 |
-
void push(value_type&& x);
|
| 16 |
```
|
| 17 |
|
| 18 |
*Effects:* As if by:
|
| 19 |
|
| 20 |
``` cpp
|
|
@@ -22,33 +22,33 @@ c.push_back(std::move(x));
|
|
| 22 |
push_heap(c.begin(), c.end(), comp);
|
| 23 |
```
|
| 24 |
|
| 25 |
``` cpp
|
| 26 |
template<container-compatible-range<T> R>
|
| 27 |
-
void push_range(R&& rg);
|
| 28 |
```
|
| 29 |
|
| 30 |
*Effects:* Inserts all elements of `rg` in `c` via
|
| 31 |
`c.append_range(std::forward<R>(rg))` if that is a valid expression, or
|
| 32 |
`ranges::copy(rg, back_inserter(c))` otherwise. Then restores the heap
|
| 33 |
property as if by `make_heap(c.begin(), c.end(), comp)`.
|
| 34 |
|
| 35 |
*Ensures:* `is_heap(c.begin(), c.end(), comp)` is `true`.
|
| 36 |
|
| 37 |
``` cpp
|
| 38 |
-
template<class... Args> void emplace(Args&&... args);
|
| 39 |
```
|
| 40 |
|
| 41 |
*Effects:* As if by:
|
| 42 |
|
| 43 |
``` cpp
|
| 44 |
c.emplace_back(std::forward<Args>(args)...);
|
| 45 |
push_heap(c.begin(), c.end(), comp);
|
| 46 |
```
|
| 47 |
|
| 48 |
``` cpp
|
| 49 |
-
void pop();
|
| 50 |
```
|
| 51 |
|
| 52 |
*Effects:* As if by:
|
| 53 |
|
| 54 |
``` cpp
|
|
|
|
| 1 |
#### Members <a id="priqueue.members">[[priqueue.members]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
+
constexpr void push(const value_type& x);
|
| 5 |
```
|
| 6 |
|
| 7 |
*Effects:* As if by:
|
| 8 |
|
| 9 |
``` cpp
|
| 10 |
c.push_back(x);
|
| 11 |
push_heap(c.begin(), c.end(), comp);
|
| 12 |
```
|
| 13 |
|
| 14 |
``` cpp
|
| 15 |
+
constexpr void push(value_type&& x);
|
| 16 |
```
|
| 17 |
|
| 18 |
*Effects:* As if by:
|
| 19 |
|
| 20 |
``` cpp
|
|
|
|
| 22 |
push_heap(c.begin(), c.end(), comp);
|
| 23 |
```
|
| 24 |
|
| 25 |
``` cpp
|
| 26 |
template<container-compatible-range<T> R>
|
| 27 |
+
constexpr void push_range(R&& rg);
|
| 28 |
```
|
| 29 |
|
| 30 |
*Effects:* Inserts all elements of `rg` in `c` via
|
| 31 |
`c.append_range(std::forward<R>(rg))` if that is a valid expression, or
|
| 32 |
`ranges::copy(rg, back_inserter(c))` otherwise. Then restores the heap
|
| 33 |
property as if by `make_heap(c.begin(), c.end(), comp)`.
|
| 34 |
|
| 35 |
*Ensures:* `is_heap(c.begin(), c.end(), comp)` is `true`.
|
| 36 |
|
| 37 |
``` cpp
|
| 38 |
+
template<class... Args> constexpr void emplace(Args&&... args);
|
| 39 |
```
|
| 40 |
|
| 41 |
*Effects:* As if by:
|
| 42 |
|
| 43 |
``` cpp
|
| 44 |
c.emplace_back(std::forward<Args>(args)...);
|
| 45 |
push_heap(c.begin(), c.end(), comp);
|
| 46 |
```
|
| 47 |
|
| 48 |
``` cpp
|
| 49 |
+
constexpr void pop();
|
| 50 |
```
|
| 51 |
|
| 52 |
*Effects:* As if by:
|
| 53 |
|
| 54 |
``` cpp
|