Init

2025-10-25 03:02:53 +03:00
commit 043225d523
3416 changed files with 681196 additions and 0 deletions
--- a/cppdraft/is/heap.md
+++ b/cppdraft/is/heap.md
@@ -0,0 +1,152 @@
+[is.heap]
+
+# 26 Algorithms library [[algorithms]](./#algorithms)
+
+## 26.8 Sorting and related operations [[alg.sorting]](alg.sorting#is.heap)
+
+### 26.8.8 Heap operations [[alg.heap.operations]](alg.heap.operations#is.heap)
+
+#### 26.8.8.6 is_heap [is.heap]
+
+[ð](#lib:is_heap)
+
+`template<class RandomAccessIterator>
+  constexpr bool is_heap(RandomAccessIterator first, RandomAccessIterator last);
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11126)
+
+*Effects*: Equivalent to: return is_heap_until(first, last) == last;
+
+[ð](#lib:is_heap_)
+
+`template<class ExecutionPolicy, class RandomAccessIterator>
+  bool is_heap(ExecutionPolicy&& exec,
+               RandomAccessIterator first, RandomAccessIterator last);
+`
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11139)
+
+*Effects*: Equivalent to:return is_heap_until(std::forward<ExecutionPolicy>(exec), first, last) == last;
+
+[ð](#lib:is_heap__)
+
+`template<class RandomAccessIterator, class Compare>
+  constexpr bool is_heap(RandomAccessIterator first, RandomAccessIterator last,
+                         Compare comp);
+`
+
+[3](#3)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11155)
+
+*Effects*: Equivalent to: return is_heap_until(first, last, comp) == last;
+
+[ð](#lib:is_heap___)
+
+`template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
+  bool is_heap(ExecutionPolicy&& exec,
+               RandomAccessIterator first, RandomAccessIterator last,
+               Compare comp);
+`
+
+[4](#4)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11169)
+
+*Effects*: Equivalent to:return is_heap_until(std::forward<ExecutionPolicy>(exec), first, last, comp) == last;
+
+[ð](#lib:is_heap____)
+
+`template<[random_access_iterator](iterator.concept.random.access#concept:random_access_iterator "24.3.4.13 Concept random_access_iterator [iterator.concept.random.access]") I, [sentinel_for](iterator.concept.sentinel#concept:sentinel_for "24.3.4.7 Concept sentinel_for [iterator.concept.sentinel]")<I> S, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>> Comp = ranges::less>
+  constexpr bool ranges::is_heap(I first, S last, Comp comp = {}, Proj proj = {});
+template<[random_access_range](range.refinements#concept:random_access_range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  constexpr bool ranges::is_heap(R&& r, Comp comp = {}, Proj proj = {});
+`
+
+[5](#5)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11188)
+
+*Effects*: Equivalent to:return ranges::is_heap_until(first, last, comp, proj) == last;
+
+[ð](#itemdecl:6)
+
+`template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [random_access_iterator](iterator.concept.random.access#concept:random_access_iterator "24.3.4.13 Concept random_access_iterator [iterator.concept.random.access]") I, [sized_sentinel_for](iterator.concept.sizedsentinel#concept:sized_sentinel_for "24.3.4.8 Concept sized_sentinel_for [iterator.concept.sizedsentinel]")<I> S,
+         class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>> Comp = ranges::less>
+  bool ranges::is_heap(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {});
+template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [sized-random-access-range](range.refinements#concept:sized-random-access-range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  bool ranges::is_heap(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {});
+`
+
+[6](#6)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11205)
+
+*Effects*: Equivalent to:return ranges::is_heap_until(std::forward<Ep>(exec), first, last, comp, proj) == last;
+
+[ð](#lib:is_heap_until)
+
+`template<class RandomAccessIterator>
+  constexpr RandomAccessIterator
+    is_heap_until(RandomAccessIterator first, RandomAccessIterator last);
+template<class ExecutionPolicy, class RandomAccessIterator>
+  RandomAccessIterator
+    is_heap_until(ExecutionPolicy&& exec,
+                  RandomAccessIterator first, RandomAccessIterator last);
+
+template<class RandomAccessIterator, class Compare>
+  constexpr RandomAccessIterator
+    is_heap_until(RandomAccessIterator first, RandomAccessIterator last,
+                  Compare comp);
+template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
+  RandomAccessIterator
+    is_heap_until(ExecutionPolicy&& exec,
+                  RandomAccessIterator first, RandomAccessIterator last,
+                  Compare comp);
+
+template<[random_access_iterator](iterator.concept.random.access#concept:random_access_iterator "24.3.4.13 Concept random_access_iterator [iterator.concept.random.access]") I, [sentinel_for](iterator.concept.sentinel#concept:sentinel_for "24.3.4.7 Concept sentinel_for [iterator.concept.sentinel]")<I> S, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>> Comp = ranges::less>
+  constexpr I ranges::is_heap_until(I first, S last, Comp comp = {}, Proj proj = {});
+template<[random_access_range](range.refinements#concept:random_access_range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  constexpr borrowed_iterator_t<R>
+    ranges::is_heap_until(R&& r, Comp comp = {}, Proj proj = {});
+
+template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [random_access_iterator](iterator.concept.random.access#concept:random_access_iterator "24.3.4.13 Concept random_access_iterator [iterator.concept.random.access]") I, [sized_sentinel_for](iterator.concept.sizedsentinel#concept:sized_sentinel_for "24.3.4.8 Concept sized_sentinel_for [iterator.concept.sizedsentinel]")<I> S,
+         class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>> Comp = ranges::less>
+  I ranges::is_heap_until(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {});
+template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [sized-random-access-range](range.refinements#concept:sized-random-access-range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  borrowed_iterator_t<R>
+    ranges::is_heap_until(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {});
+`
+
+[7](#7)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11252)
+
+Let comp be less{} and proj be identity{} for the overloads with no parameters by those names[.](#7.sentence-1)
+
+[8](#8)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11257)
+
+*Returns*: The last iterator i in [first, last]
+for which the range [first, i)
+is a heap with respect to comp and proj[.](#8.sentence-1)
+
+[9](#9)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L11263)
+
+*Complexity*: Linear[.](#9.sentence-1)
--- a/cppdraft/is/sorted.md
+++ b/cppdraft/is/sorted.md
@@ -0,0 +1,153 @@
+[is.sorted]
+
+# 26 Algorithms library [[algorithms]](./#algorithms)
+
+## 26.8 Sorting and related operations [[alg.sorting]](alg.sorting#is.sorted)
+
+### 26.8.2 Sorting [[alg.sort]](alg.sort#is.sorted)
+
+#### 26.8.2.5 is_sorted [is.sorted]
+
+[ð](#lib:is_sorted)
+
+`template<class ForwardIterator>
+  constexpr bool is_sorted(ForwardIterator first, ForwardIterator last);
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9144)
+
+*Effects*: Equivalent to: return is_sorted_until(first, last) == last;
+
+[ð](#lib:is_sorted_)
+
+`template<class ExecutionPolicy, class ForwardIterator>
+  bool is_sorted(ExecutionPolicy&& exec,
+                 ForwardIterator first, ForwardIterator last);
+`
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9157)
+
+*Effects*: Equivalent to:return is_sorted_until(std::forward<ExecutionPolicy>(exec), first, last) == last;
+
+[ð](#lib:is_sorted__)
+
+`template<class ForwardIterator, class Compare>
+  constexpr bool is_sorted(ForwardIterator first, ForwardIterator last,
+                           Compare comp);
+`
+
+[3](#3)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9173)
+
+*Effects*: Equivalent to: return is_sorted_until(first, last, comp) == last;
+
+[ð](#lib:is_sorted___)
+
+`template<class ExecutionPolicy, class ForwardIterator, class Compare>
+  bool is_sorted(ExecutionPolicy&& exec,
+                 ForwardIterator first, ForwardIterator last,
+                 Compare comp);
+`
+
+[4](#4)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9188)
+
+*Effects*: Equivalent to:return is_sorted_until(std::forward<ExecutionPolicy>(exec), first, last, comp) == last;
+
+[ð](#lib:is_sorted____)
+
+`template<[forward_iterator](iterator.concept.forward#concept:forward_iterator "24.3.4.11 Concept forward_iterator [iterator.concept.forward]") I, [sentinel_for](iterator.concept.sentinel#concept:sentinel_for "24.3.4.7 Concept sentinel_for [iterator.concept.sentinel]")<I> S, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>> Comp = ranges::less>
+  constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});
+template<[forward_range](range.refinements#concept:forward_range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});
+`
+
+[5](#5)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9207)
+
+*Effects*: Equivalent to:return ranges::is_sorted_until(first, last, comp, proj) == last;
+
+[ð](#itemdecl:6)
+
+`template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [random_access_iterator](iterator.concept.random.access#concept:random_access_iterator "24.3.4.13 Concept random_access_iterator [iterator.concept.random.access]") I, [sized_sentinel_for](iterator.concept.sizedsentinel#concept:sized_sentinel_for "24.3.4.8 Concept sized_sentinel_for [iterator.concept.sizedsentinel]")<I> S,
+         class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>> Comp = ranges::less>
+  bool ranges::is_sorted(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {});
+template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [sized-random-access-range](range.refinements#concept:sized-random-access-range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  bool ranges::is_sorted(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {});
+`
+
+[6](#6)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9224)
+
+*Effects*: Equivalent to:return ranges::is_sorted_until(std::forward<Ep>(exec), first, last, comp, proj) == last;
+
+[ð](#lib:is_sorted_until)
+
+`template<class ForwardIterator>
+  constexpr ForwardIterator
+    is_sorted_until(ForwardIterator first, ForwardIterator last);
+template<class ExecutionPolicy, class ForwardIterator>
+  ForwardIterator
+    is_sorted_until(ExecutionPolicy&& exec,
+                    ForwardIterator first, ForwardIterator last);
+
+template<class ForwardIterator, class Compare>
+  constexpr ForwardIterator
+    is_sorted_until(ForwardIterator first, ForwardIterator last,
+                    Compare comp);
+template<class ExecutionPolicy, class ForwardIterator, class Compare>
+  ForwardIterator
+    is_sorted_until(ExecutionPolicy&& exec,
+                    ForwardIterator first, ForwardIterator last,
+                    Compare comp);
+
+template<[forward_iterator](iterator.concept.forward#concept:forward_iterator "24.3.4.11 Concept forward_iterator [iterator.concept.forward]") I, [sentinel_for](iterator.concept.sentinel#concept:sentinel_for "24.3.4.7 Concept sentinel_for [iterator.concept.sentinel]")<I> S, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>> Comp = ranges::less>
+  constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});
+template<[forward_range](range.refinements#concept:forward_range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  constexpr borrowed_iterator_t<R>
+    ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});
+
+template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [random_access_iterator](iterator.concept.random.access#concept:random_access_iterator "24.3.4.13 Concept random_access_iterator [iterator.concept.random.access]") I, [sized_sentinel_for](iterator.concept.sizedsentinel#concept:sized_sentinel_for "24.3.4.8 Concept sized_sentinel_for [iterator.concept.sizedsentinel]")<I> S,
+         class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>> Comp = ranges::less>
+  I ranges::is_sorted_until(Ep&& exec, I first, S last, Comp comp = {},
+                    Proj proj = {});
+template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [sized-random-access-range](range.refinements#concept:sized-random-access-range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
+         [indirect_strict_weak_order](indirectcallable.indirectinvocable#concept:indirect_strict_weak_order "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>> Comp = ranges::less>
+  borrowed_iterator_t<R>
+    ranges::is_sorted_until(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {});
+`
+
+[7](#7)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9272)
+
+Let comp be less{} and proj be identity{} for the overloads with no parameters by those names[.](#7.sentence-1)
+
+[8](#8)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9277)
+
+*Returns*: The last iterator i in [first, last]
+for which the range [first, i)
+is sorted with respect to comp and proj[.](#8.sentence-1)
+
+[9](#9)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L9283)
+
+*Complexity*: Linear[.](#9.sentence-1)