Init

2025-10-25 03:02:53 +03:00
commit 043225d523
3416 changed files with 681196 additions and 0 deletions
--- a/cppdraft/alg/move.md
+++ b/cppdraft/alg/move.md
@@ -0,0 +1,230 @@
+[alg.move]
+
+# 26 Algorithms library [[algorithms]](./#algorithms)
+
+## 26.7 Mutating sequence operations [[alg.modifying.operations]](alg.modifying.operations#alg.move)
+
+### 26.7.2 Move [alg.move]
+
+[ð](#lib:move,algorithm)
+
+`template<class InputIterator, class OutputIterator>
+  constexpr OutputIterator move(InputIterator first, InputIterator last,
+                                OutputIterator result);
+
+template<[input_iterator](iterator.concept.input#concept:input_iterator "24.3.4.9 Concept input_iterator [iterator.concept.input]") I, [sentinel_for](iterator.concept.sentinel#concept:sentinel_for "24.3.4.7 Concept sentinel_for [iterator.concept.sentinel]")<I> S, [weakly_incrementable](iterator.concept.winc#concept:weakly_incrementable "24.3.4.4 Concept weakly_incrementable [iterator.concept.winc]") O>
+  requires [indirectly_movable](alg.req.ind.move#concept:indirectly_movable "24.3.7.2 Concept indirectly_movable [alg.req.ind.move]")<I, O>
+  constexpr ranges::move_result<I, O>
+    ranges::move(I first, S last, O result);
+template<[input_range](range.refinements#concept:input_range "25.4.6 Other range refinements [range.refinements]") R, [weakly_incrementable](iterator.concept.winc#concept:weakly_incrementable "24.3.4.4 Concept weakly_incrementable [iterator.concept.winc]") O>
+  requires [indirectly_movable](alg.req.ind.move#concept:indirectly_movable "24.3.7.2 Concept indirectly_movable [alg.req.ind.move]")<iterator_t<R>, O>
+  constexpr ranges::move_result<borrowed_iterator_t<R>, O>
+    ranges::move(R&& r, O result);
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6685)
+
+Let E(n) be
+
+- [(1.1)](#1.1)
+
+std::move(*(first + n)) for the overload in namespace std;
+
+- [(1.2)](#1.2)
+
+ranges::iter_move(first + n) for the overloads in namespace ranges[.](#1.sentence-1)
+
+Let N be last - first[.](#1.sentence-2)
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6697)
+
+*Preconditions*: result is not in the range [first, last)[.](#2.sentence-1)
+
+[3](#3)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6701)
+
+*Effects*: Moves elements in the range [first, last)
+into the range [result, result + N)
+starting from first and proceeding to last[.](#3.sentence-1)
+
+For each non-negative integer n<N, performs *(result + n) = E(n)[.](#3.sentence-2)
+
+[4](#4)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6708)
+
+*Returns*: 
+
+- [(4.1)](#4.1)
+
+  result + N for the overload in namespace std[.](#4.1.sentence-1)
+
+- [(4.2)](#4.2)
+
+  {last, result + N} for the overloads in namespace ranges[.](#4.2.sentence-1)
+
+[5](#5)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6719)
+
+*Complexity*: Exactly N assignments[.](#5.sentence-1)
+
+[ð](#lib:move,algorithm_)
+
+`template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2>
+  ForwardIterator2 move(ExecutionPolicy&& exec,
+                        ForwardIterator1 first, ForwardIterator1 last,
+                        ForwardIterator2 result);
+
+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,
+         [random_access_iterator](iterator.concept.random.access#concept:random_access_iterator "24.3.4.13 Concept random_access_iterator [iterator.concept.random.access]") O, [sized_sentinel_for](iterator.concept.sizedsentinel#concept:sized_sentinel_for "24.3.4.8 Concept sized_sentinel_for [iterator.concept.sizedsentinel]")<O> OutS>
+  requires [indirectly_movable](alg.req.ind.move#concept:indirectly_movable "24.3.7.2 Concept indirectly_movable [alg.req.ind.move]")<I, O>
+  ranges::move_result<I, O>
+    ranges::move(Ep&& exec, I first, S last, O result, OutS result_last);
+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, [sized-random-access-range](range.refinements#concept:sized-random-access-range "25.4.6 Other range refinements [range.refinements]") OutR>
+  requires [indirectly_movable](alg.req.ind.move#concept:indirectly_movable "24.3.7.2 Concept indirectly_movable [alg.req.ind.move]")<iterator_t<R>, iterator_t<OutR>>
+  ranges::move_result<borrowed_iterator_t<R>, borrowed_iterator_t<OutR>>
+    ranges::move(Ep&& exec, R&& r, OutR&& result_r);
+`
+
+[6](#6)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6743)
+
+Let E(n) be:
+
+- [(6.1)](#6.1)
+
+std::move(*(first + n)) for the overload in namespace std;
+
+- [(6.2)](#6.2)
+
+ranges::iter_move(first + n) for the overloads in namespace ranges[.](#6.sentence-1)
+
+[7](#7)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6754)
+
+Let result_last be result + (last - first) for the overloads in namespace std[.](#7.sentence-1)
+
+[8](#8)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6758)
+
+Let N be min(last - first, result_last - result)[.](#8.sentence-1)
+
+[9](#9)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6761)
+
+*Preconditions*: The ranges [first, last) and [result, result + N)
+do not overlap[.](#9.sentence-1)
+
+[10](#10)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6766)
+
+*Effects*: Moves elements in the range [first, first + N)
+into the range [result, result + N)[.](#10.sentence-1)
+
+For each non-negative integer n<N,
+performs *(result + n) = E(n)[.](#10.sentence-2)
+
+[11](#11)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6773)
+
+*Returns*: 
+
+- [(11.1)](#11.1)
+
+  result + N for the overload in namespace std[.](#11.1.sentence-1)
+
+- [(11.2)](#11.2)
+
+  {first + N, result + N} for the overloads in namespace ranges[.](#11.2.sentence-1)
+
+[12](#12)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6784)
+
+*Complexity*: Exactly N assignments[.](#12.sentence-1)
+
+[ð](#lib:move_backward)
+
+`template<class BidirectionalIterator1, class BidirectionalIterator2>
+  constexpr BidirectionalIterator2
+    move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
+                  BidirectionalIterator2 result);
+
+template<[bidirectional_iterator](iterator.concept.bidir#concept:bidirectional_iterator "24.3.4.12 Concept bidirectional_iterator [iterator.concept.bidir]") I1, [sentinel_for](iterator.concept.sentinel#concept:sentinel_for "24.3.4.7 Concept sentinel_for [iterator.concept.sentinel]")<I1> S1, [bidirectional_iterator](iterator.concept.bidir#concept:bidirectional_iterator "24.3.4.12 Concept bidirectional_iterator [iterator.concept.bidir]") I2>
+  requires [indirectly_movable](alg.req.ind.move#concept:indirectly_movable "24.3.7.2 Concept indirectly_movable [alg.req.ind.move]")<I1, I2>
+  constexpr ranges::move_backward_result<I1, I2>
+    ranges::move_backward(I1 first, S1 last, I2 result);
+template<[bidirectional_range](range.refinements#concept:bidirectional_range "25.4.6 Other range refinements [range.refinements]") R, [bidirectional_iterator](iterator.concept.bidir#concept:bidirectional_iterator "24.3.4.12 Concept bidirectional_iterator [iterator.concept.bidir]") I>
+  requires [indirectly_movable](alg.req.ind.move#concept:indirectly_movable "24.3.7.2 Concept indirectly_movable [alg.req.ind.move]")<iterator_t<R>, I>
+  constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I>
+    ranges::move_backward(R&& r, I result);
+`
+
+[13](#13)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6807)
+
+Let E(n) be
+
+- [(13.1)](#13.1)
+
+std::move(*(last - n)) for the overload in namespace std;
+
+- [(13.2)](#13.2)
+
+ranges::iter_move(last - n) for the overloads in namespace ranges[.](#13.sentence-1)
+
+Let N be last - first[.](#13.sentence-2)
+
+[14](#14)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6819)
+
+*Preconditions*: result is not in the range (first, last][.](#14.sentence-1)
+
+[15](#15)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6823)
+
+*Effects*: Moves elements in the range [first, last)
+into the range [result - N, result)
+starting from last - 1 and proceeding to first[.](#15.sentence-1)[202](#footnote-202 "move_backward can be used instead of move when last is in the range [result - N, result).")
+
+For each positive integer n â¤ N,
+performs *(result - n) = E(n)[.](#15.sentence-2)
+
+[16](#16)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6835)
+
+*Returns*: 
+
+- [(16.1)](#16.1)
+
+  result - N for the overload in namespace std[.](#16.1.sentence-1)
+
+- [(16.2)](#16.2)
+
+  {last, result - N} for the overloads in namespace ranges[.](#16.2.sentence-1)
+
+[17](#17)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L6846)
+
+*Complexity*: Exactly N assignments[.](#17.sentence-1)
+
+[202)](#footnote-202)[202)](#footnoteref-202)
+
+move_backward can be used instead of move when last is in the range [result - N, result)[.](#footnote-202.sentence-1)