From Jason Turner

[sort.heap]

Diff to HTML by rtfpessoa

tmp/tmptulfr4xz/{from.md → to.md} RENAMED
@@ -7,16 +7,16 @@ template<class RandomAccessIterator>
7
  template<class RandomAccessIterator, class Compare>
8
  void sort_heap(RandomAccessIterator first, RandomAccessIterator last,
9
  Compare comp);
10
  ```
11
 
12
- *Effects:* Sorts elements in the heap \[`first`, `last`).
13
-
14
  *Requires:* The range \[`first`, `last`) shall be a valid heap.
15
  `RandomAccessIterator` shall satisfy the requirements of
16
  `ValueSwappable` ([[swappable.requirements]]). The type of `*first`
17
  shall satisfy the requirements of `MoveConstructible`
18
- (Table  [[moveconstructible]]) and of `MoveAssignable`
19
- (Table  [[moveassignable]]).
20
 
21
- *Complexity:* At most N log(N) comparisons (where `N == last - first`).
 
 
22
 
 
7
  template<class RandomAccessIterator, class Compare>
8
  void sort_heap(RandomAccessIterator first, RandomAccessIterator last,
9
  Compare comp);
10
  ```
11
 
 
 
12
  *Requires:* The range \[`first`, `last`) shall be a valid heap.
13
  `RandomAccessIterator` shall satisfy the requirements of
14
  `ValueSwappable` ([[swappable.requirements]]). The type of `*first`
15
  shall satisfy the requirements of `MoveConstructible`
16
+ (Table  [[tab:moveconstructible]]) and of `MoveAssignable`
17
+ (Table  [[tab:moveassignable]]).
18
 
19
+ *Effects:* Sorts elements in the heap \[`first`, `last`).
20
+
21
+ *Complexity:* At most N log N comparisons, where N = `last - first`.
22