From Jason Turner

[is.heap]

C++14 → C++17 2.3 KB 36 lines
Current Draft | LaTeX Source
Archived: C++14 | C++17
Markdown: C++14 | C++17
Explore in Adventure Game

Diff to HTML by rtfpessoa

Files changed (1) hide show
  1. tmp/tmpp8ybff07/{from.md → to.md} +31 -2
tmp/tmpp8ybff07/{from.md → to.md} RENAMED
@@ -5,26 +5,55 @@ template<class RandomAccessIterator>
5
  bool is_heap(RandomAccessIterator first, RandomAccessIterator last);
6
  ```
7
 
8
  *Returns:* `is_heap_until(first, last) == last`
9
 
 
 
 
 
 
 
 
 
 
10
  ``` cpp
11
  template<class RandomAccessIterator, class Compare>
12
  bool is_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
13
  ```
14
 
15
  *Returns:* `is_heap_until(first, last, comp) == last`
16
 
 
 
 
 
 
 
 
 
 
 
 
 
17
  ``` cpp
18
  template<class RandomAccessIterator>
19
  RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last);
 
 
 
 
20
  template<class RandomAccessIterator, class Compare>
21
  RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last,
22
  Compare comp);
 
 
 
 
23
  ```
24
 
25
- *Returns:* If `distance(first, last) < 2`, returns `last`. Otherwise,
26
- returns the last iterator `i` in \[`first`, `last`\] for which the range
27
  \[`first`, `i`) is a heap.
28
 
29
  *Complexity:* Linear.
30
 
 
5
  bool is_heap(RandomAccessIterator first, RandomAccessIterator last);
6
  ```
7
 
8
  *Returns:* `is_heap_until(first, last) == last`
9
 
10
+ ``` cpp
11
+ template<class ExecutionPolicy, class RandomAccessIterator>
12
+ bool is_heap(ExecutionPolicy&& exec,
13
+ RandomAccessIterator first, RandomAccessIterator last);
14
+ ```
15
+
16
+ *Returns:*
17
+ `is_heap_until(std::forward<ExecutionPolicy>(exec), first, last) == last`
18
+
19
  ``` cpp
20
  template<class RandomAccessIterator, class Compare>
21
  bool is_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
22
  ```
23
 
24
  *Returns:* `is_heap_until(first, last, comp) == last`
25
 
26
+ ``` cpp
27
+ template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
28
+ bool is_heap(ExecutionPolicy&& exec,
29
+ RandomAccessIterator first, RandomAccessIterator last, Compare comp);
30
+ ```
31
+
32
+ *Returns:*
33
+
34
+ ``` cpp
35
+ is_heap_until(std::forward<ExecutionPolicy>(exec), first, last, comp) == last
36
+ ```
37
+
38
  ``` cpp
39
  template<class RandomAccessIterator>
40
  RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last);
41
+ template<class ExecutionPolicy, class RandomAccessIterator>
42
+ RandomAccessIterator is_heap_until(ExecutionPolicy&& exec,
43
+ RandomAccessIterator first, RandomAccessIterator last);
44
+
45
  template<class RandomAccessIterator, class Compare>
46
  RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last,
47
  Compare comp);
48
+ template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
49
+ RandomAccessIterator is_heap_until(ExecutionPolicy&& exec,
50
+ RandomAccessIterator first, RandomAccessIterator last,
51
+ Compare comp);
52
  ```
53
 
54
+ *Returns:* If `(last - first) < 2`, returns `last`. Otherwise, returns
55
+ the last iterator `i` in \[`first`, `last`\] for which the range
56
  \[`first`, `i`) is a heap.
57
 
58
  *Complexity:* Linear.
59