tmp/tmptlc74pb3/{from.md → to.md}
RENAMED
|
@@ -1,23 +1,40 @@
|
|
| 1 |
#### `pop_heap` <a id="pop.heap">[[pop.heap]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
template<class RandomAccessIterator>
|
| 5 |
-
void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
|
| 6 |
|
| 7 |
template<class RandomAccessIterator, class Compare>
|
| 8 |
-
void pop_heap(RandomAccessIterator first, RandomAccessIterator last,
|
| 9 |
Compare comp);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 10 |
```
|
| 11 |
|
| 12 |
-
|
| 13 |
-
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
|
| 17 |
-
|
|
|
|
|
|
|
|
|
|
| 18 |
|
| 19 |
*Effects:* Swaps the value in the location `first` with the value in the
|
| 20 |
-
location `last - 1` and makes \[`first`, `last - 1`) into a heap
|
|
|
|
| 21 |
|
| 22 |
-
*
|
|
|
|
|
|
|
|
|
|
| 23 |
|
|
|
|
| 1 |
#### `pop_heap` <a id="pop.heap">[[pop.heap]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
template<class RandomAccessIterator>
|
| 5 |
+
constexpr void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
|
| 6 |
|
| 7 |
template<class RandomAccessIterator, class Compare>
|
| 8 |
+
constexpr void pop_heap(RandomAccessIterator first, RandomAccessIterator last,
|
| 9 |
Compare comp);
|
| 10 |
+
|
| 11 |
+
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
|
| 12 |
+
class Proj = identity>
|
| 13 |
+
requires sortable<I, Comp, Proj>
|
| 14 |
+
constexpr I
|
| 15 |
+
ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {});
|
| 16 |
+
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
|
| 17 |
+
requires sortable<iterator_t<R>, Comp, Proj>
|
| 18 |
+
constexpr borrowed_iterator_t<R>
|
| 19 |
+
ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {});
|
| 20 |
```
|
| 21 |
|
| 22 |
+
Let `comp` be `less{}` and `proj` be `identity{}` for the overloads with
|
| 23 |
+
no parameters by those names.
|
| 24 |
+
|
| 25 |
+
*Preconditions:* The range \[`first`, `last`) is a valid non-empty heap
|
| 26 |
+
with respect to `comp` and `proj`. For the overloads in namespace `std`,
|
| 27 |
+
`RandomAccessIterator` meets the *Cpp17ValueSwappable*
|
| 28 |
+
requirements [[swappable.requirements]] and the type of `*first` meets
|
| 29 |
+
the *Cpp17MoveConstructible* ([[cpp17.moveconstructible]]) and
|
| 30 |
+
*Cpp17MoveAssignable* ([[cpp17.moveassignable]]) requirements.
|
| 31 |
|
| 32 |
*Effects:* Swaps the value in the location `first` with the value in the
|
| 33 |
+
location `last - 1` and makes \[`first`, `last - 1`) into a heap with
|
| 34 |
+
respect to `comp` and `proj`.
|
| 35 |
|
| 36 |
+
*Returns:* `last` for the overloads in namespace `ranges`.
|
| 37 |
+
|
| 38 |
+
*Complexity:* At most 2 log(`last - first`) comparisons and twice as
|
| 39 |
+
many projections.
|
| 40 |
|