xref: /freebsd/contrib/llvm-project/libcxx/include/algorithm (revision e6bfd18d21b225af6a0ed67ceeaf1293b7b9eba5)
1// -*- C++ -*-
2//===----------------------------------------------------------------------===//
3//
4// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
5// See https://llvm.org/LICENSE.txt for license information.
6// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7//
8//===----------------------------------------------------------------------===//
9
10#ifndef _LIBCPP_ALGORITHM
11#define _LIBCPP_ALGORITHM
12
13/*
14    algorithm synopsis
15
16#include <initializer_list>
17
18namespace std
19{
20
21namespace ranges {
22
23  // [algorithms.results], algorithm result types
24  template <class I, class F>
25    struct in_fun_result;     // since C++20
26
27  template <class I1, class I2>
28    struct in_in_result;      // since C++20
29
30  template <class I, class O>
31    struct in_out_result;  // since C++20
32
33  template <class I1, class I2, class O>
34    struct in_in_out_result;  // since C++20
35
36  template <class I, class O1, class O2>
37    struct in_out_out_result; // since C++20
38
39  template <class I1, class I2>
40    struct min_max_result;    // since C++20
41
42  template <class I>
43    struct in_found_result;   // since C++20
44
45  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
46    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>             // since C++20
47  constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
48
49  template<forward_range R, class Proj = identity,
50    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
51  constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
52
53  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
54    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
55  constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {});                        // since C++20
56
57  template<forward_range R, class Proj = identity,
58    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
59  constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {});             // since C++20
60
61  template<class I1, class I2>
62    using mismatch_result = in_in_result<I1, I2>;
63
64  template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2,
65          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
66    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
67  constexpr mismatch_result<_I1, _I2>
68  mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20
69
70  template <input_range R1, input_range R2,
71          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
72    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
73  constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
74  mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {})                           // since C++20
75
76    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
77    constexpr I find(I first, S last, const T& value, Proj proj = {});              // since C++20
78
79  template<input_range R, class T, class Proj = identity>
80    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
81    constexpr borrowed_iterator_t<R>
82      find(R&& r, const T& value, Proj proj = {});                                  // since C++20
83
84  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
85           indirect_unary_predicate<projected<I, Proj>> Pred>
86    constexpr I find_if(I first, S last, Pred pred, Proj proj = {});                // since C++20
87
88  template<input_range R, class Proj = identity,
89           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
90    constexpr borrowed_iterator_t<R>
91      find_if(R&& r, Pred pred, Proj proj = {});                                    // since C++20
92
93  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
94           indirect_unary_predicate<projected<I, Proj>> Pred>
95    constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {});            // since C++20
96
97  template<input_range R, class Proj = identity,
98           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
99    constexpr borrowed_iterator_t<R>
100      find_if_not(R&& r, Pred pred, Proj proj = {});                                // since C++20
101
102  template<class T, class Proj = identity,
103           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
104    constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
105
106  template<copyable T, class Proj = identity,
107           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
108    constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {});         // since C++20
109
110 template<input_range R, class Proj = identity,
111          indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
112   requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
113   constexpr range_value_t<R>
114     min(R&& r, Comp comp = {}, Proj proj = {});                                    // since C++20
115
116  template<class T, class Proj = identity,
117           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
118    constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
119
120  template<copyable T, class Proj = identity,
121           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
122    constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {});         // since C++20
123
124  template<input_range R, class Proj = identity,
125           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
126    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
127    constexpr range_value_t<R>
128      max(R&& r, Comp comp = {}, Proj proj = {});                                   // since C++20
129
130  template<class I, class O>
131    using unary_transform_result = in_out_result<I, O>;                             // since C++20
132
133  template<class I1, class I2, class O>
134    using binary_transform_result = in_in_out_result<I1, I2, O>;                    // since C++20
135
136  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O,
137           copy_constructible F, class Proj = identity>
138    requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>>
139    constexpr ranges::unary_transform_result<I, O>
140      transform(I first1, S last1, O result, F op, Proj proj = {});                 // since C++20
141
142  template<input_range R, weakly_incrementable O, copy_constructible F,
143           class Proj = identity>
144    requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>>
145    constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O>
146      transform(R&& r, O result, F op, Proj proj = {});                             // since C++20
147
148  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
149           weakly_incrementable O, copy_constructible F, class Proj1 = identity,
150           class Proj2 = identity>
151    requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>,
152                                           projected<I2, Proj2>>>
153    constexpr ranges::binary_transform_result<I1, I2, O>
154      transform(I1 first1, S1 last1, I2 first2, S2 last2, O result,
155                        F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});           // since C++20
156
157  template<input_range R1, input_range R2, weakly_incrementable O,
158           copy_constructible F, class Proj1 = identity, class Proj2 = identity>
159    requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>,
160                                           projected<iterator_t<R2>, Proj2>>>
161    constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
162      transform(R1&& r1, R2&& r2, O result,
163                        F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});           // since C++20
164
165  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity>
166    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
167    constexpr iter_difference_t<I>
168      count(I first, S last, const T& value, Proj proj = {});                       // since C++20
169
170  template<input_range R, class T, class Proj = identity>
171    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
172    constexpr range_difference_t<R>
173      count(R&& r, const T& value, Proj proj = {});                                 // since C++20
174
175  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
176           indirect_unary_predicate<projected<I, Proj>> Pred>
177    constexpr iter_difference_t<I>
178      count_if(I first, S last, Pred pred, Proj proj = {});                         // since C++20
179
180  template<input_range R, class Proj = identity,
181           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
182    constexpr range_difference_t<R>
183      count_if(R&& r, Pred pred, Proj proj = {});                                   // since C++20
184
185  template<class T>
186  using minmax_result = min_max_result<T>;
187
188  template<class T, class Proj = identity,
189           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
190    constexpr ranges::minmax_result<const T&>
191      minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {});                     // since C++20
192
193  template<copyable T, class Proj = identity,
194           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
195    constexpr ranges::minmax_result<T>
196      minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {});                      // since C++20
197
198  template<input_range R, class Proj = identity,
199           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
200    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
201    constexpr ranges::minmax_result<range_value_t<R>>
202      minmax(R&& r, Comp comp = {}, Proj proj = {});                                      // since C++20
203
204  template<class I>
205  using minmax_element_result = min_max_result<I>;
206
207  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
208           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
209    constexpr ranges::minmax_element_result<I>
210      minmax_element(I first, S last, Comp comp = {}, Proj proj = {});                    // since C++20
211
212  template<forward_range R, class Proj = identity,
213           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
214    constexpr ranges::minmax_element_result<borrowed_iterator_t<R>>
215      minmax_element(R&& r, Comp comp = {}, Proj proj = {});                              // since C++20
216
217  template<class I, class O>
218    using copy_result = in_out_result<I, O>;                                              // since C++20
219
220  template<class I, class O>
221    using copy_n_result = in_out_result<I, O>;                                            // since C++20
222
223  template<class I, class O>
224    using copy_if_result = in_out_result<I, O>;                                             // since C++20
225
226  template<class I1, class I2>
227    using copy_backward_result = in_out_result<I1, I2>;                                     // since C++20
228
229  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
230    requires indirectly_copyable<I, O>
231    constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result);            // since C++20
232
233  template<input_range R, weakly_incrementable O>
234    requires indirectly_copyable<iterator_t<R>, O>
235    constexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20
236
237  template<input_iterator I, weakly_incrementable O>
238    requires indirectly_copyable<I, O>
239    constexpr ranges::copy_n_result<I, O>
240      ranges::copy_n(I first, iter_difference_t<I> n, O result);                            // since C++20
241
242  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity,
243           indirect_unary_predicate<projected<I, Proj>> Pred>
244    requires indirectly_copyable<I, O>
245    constexpr ranges::copy_if_result<I, O>
246      ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {});                // since C++20
247
248  template<input_range R, weakly_incrementable O, class Proj = identity,
249           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
250    requires indirectly_copyable<iterator_t<R>, O>
251    constexpr ranges::copy_if_result<borrowed_iterator_t<R>, O>
252      ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {});                          // since C++20
253
254  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
255    requires indirectly_copyable<I1, I2>
256    constexpr ranges::copy_backward_result<I1, I2>
257      ranges::copy_backward(I1 first, S1 last, I2 result);                                  // since C++20
258
259  template<bidirectional_range R, bidirectional_iterator I>
260    requires indirectly_copyable<iterator_t<R>, I>
261    constexpr ranges::copy_backward_result<borrowed_iterator_t<R>, I>
262      ranges::copy_backward(R&& r, I result);                                               // since C++20
263
264  template<class I, class F>
265    using for_each_result = in_fun_result<I, F>;                                            // since C++20
266
267  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
268           indirectly_unary_invocable<projected<I, Proj>> Fun>
269    constexpr ranges::for_each_result<I, Fun>
270      ranges::for_each(I first, S last, Fun f, Proj proj = {});                             // since C++20
271
272  template<input_range R, class Proj = identity,
273           indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun>
274    constexpr ranges::for_each_result<borrowed_iterator_t<R>, Fun>
275      ranges::for_each(R&& r, Fun f, Proj proj = {});                                       // since C++20
276
277  template<input_iterator I, class Proj = identity,
278           indirectly_unary_invocable<projected<I, Proj>> Fun>
279    constexpr ranges::for_each_n_result<I, Fun>
280      ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {});           // since C++20
281
282  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
283           indirect_unary_predicate<projected<I, Proj>> Pred>
284    constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {});      // since C++20
285
286  template<input_range R, class Proj = identity,
287           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
288    constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {});                // since C++20
289
290  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
291          class Proj = identity>
292    requires sortable<I, Comp, Proj>
293    constexpr I
294      ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
295
296  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
297    requires sortable<iterator_t<R>, Comp, Proj>
298    constexpr borrowed_iterator_t<R>
299      ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
300
301  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
302          class Proj = identity>
303    requires sortable<I, Comp, Proj>
304    constexpr I
305      ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {});                    // since C++20
306
307  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
308    requires sortable<iterator_t<R>, Comp, Proj>
309    constexpr borrowed_iterator_t<R>
310      ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {});                              // since C++20
311
312  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
313          class Proj = identity>
314    requires sortable<I, Comp, Proj>
315    constexpr I
316      ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
317
318  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
319    requires sortable<iterator_t<R>, Comp, Proj>
320    constexpr borrowed_iterator_t<R>
321      ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
322
323  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
324          class Proj = identity>
325    requires sortable<I, Comp, Proj>
326    constexpr I
327      ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
328
329  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
330    requires sortable<iterator_t<R>, Comp, Proj>
331    constexpr borrowed_iterator_t<R>
332      ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
333
334  template<random_access_iterator I, sentinel_for<I> S, class Proj = identity,
335            indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
336    constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {});                // Since C++20
337
338  template<random_access_range R, class Proj = identity,
339            indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
340    constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {});                          // Since C++20
341
342  template<random_access_iterator I, sentinel_for<I> S, class Proj = identity,
343           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
344    constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {});             // Since C++20
345
346  template<random_access_range R, class Proj = identity,
347           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
348    constexpr borrowed_iterator_t<R>
349      is_heap_until(R&& r, Comp comp = {}, Proj proj = {});                                 // Since C++20
350
351  template<bidirectional_iterator I, sentinel_for<I> S>
352    requires permutable<I>
353    constexpr I ranges::reverse(I first, S last);                                           // since C++20
354
355  template<bidirectional_range R>
356    requires permutable<iterator_t<R>>
357    constexpr borrowed_iterator_t<R> ranges::reverse(R&& r);                                // since C++20
358
359  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
360            class Proj = identity>
361    requires sortable<I, Comp, Proj>
362    constexpr I
363      ranges::sort(I first, S last, Comp comp = {}, Proj proj = {});                        // since C++20
364
365  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
366    requires sortable<iterator_t<R>, Comp, Proj>
367    constexpr borrowed_iterator_t<R>
368      ranges::sort(R&& r, Comp comp = {}, Proj proj = {});                                  // since C++20
369
370  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
371          class Proj = identity>
372    requires sortable<I, Comp, Proj>
373    I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {});                 // since C++20
374
375  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
376    requires sortable<iterator_t<R>, Comp, Proj>
377    borrowed_iterator_t<R>
378      ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {});                           // since C++20
379
380  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
381           class Proj = identity>
382    requires sortable<I, Comp, Proj>
383    constexpr I
384      ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {});      // since C++20
385
386  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
387    requires sortable<iterator_t<R>, Comp, Proj>
388    constexpr borrowed_iterator_t<R>
389      ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {});    // since C++20
390
391  template<class T, output_iterator<const T&> O, sentinel_for<O> S>
392    constexpr O ranges::fill(O first, S last, const T& value);                              // since C++20
393
394  template<class T, output_range<const T&> R>
395    constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value);                   // since C++20
396
397  template<class T, output_iterator<const T&> O>
398    constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value);            // since C++20
399
400  template<input_or_output_iterator O, sentinel_for<O> S, copy_constructible F>
401    requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>>
402    constexpr O generate(O first, S last, F gen);                                           // Since C++20
403
404  template<class R, copy_constructible F>
405    requires invocable<F&> && output_range<R, invoke_result_t<F&>>
406    constexpr borrowed_iterator_t<R> generate(R&& r, F gen);                                // Since C++20
407
408  template<input_or_output_iterator O, copy_constructible F>
409    requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>>
410    constexpr O generate_n(O first, iter_difference_t<O> n, F gen);                         // Since C++20
411
412 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
413          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
414   requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
415   constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2,
416                                Pred pred = {},
417                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
418
419 template<input_range R1, input_range R2, class Pred = ranges::equal_to,
420          class Proj1 = identity, class Proj2 = identity>
421   requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
422   constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
423                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
424
425  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
426           indirect_unary_predicate<projected<I, Proj>> Pred>
427    constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
428
429  template<input_range R, class Proj = identity,
430           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
431    constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {});                // since C++20
432
433  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
434           indirect_unary_predicate<projected<I, Proj>> Pred>
435    constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
436
437  template<input_range R, class Proj = identity,
438           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
439    constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {});                // since C++20
440
441  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
442           indirect_unary_predicate<projected<I, Proj>> Pred>
443    constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {});     // since C++20
444
445  template<input_range R, class Proj = identity,
446           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
447    constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {});               // since C++20
448
449  template<input_iterator I1, sentinel_for<I1> S1,
450          random_access_iterator I2, sentinel_for<I2> S2,
451          class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
452    requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
453            indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
454    constexpr partial_sort_copy_result<I1, I2>
455      partial_sort_copy(I1 first, S1 last, I2 result_first, S2 result_last,
456                        Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});        // Since C++20
457
458  template<input_range R1, random_access_range R2, class Comp = ranges::less,
459          class Proj1 = identity, class Proj2 = identity>
460    requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> &&
461            sortable<iterator_t<R2>, Comp, Proj2> &&
462            indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
463                                        projected<iterator_t<R2>, Proj2>>
464    constexpr partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
465      partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
466                        Proj1 proj1 = {}, Proj2 proj2 = {});                        // Since C++20
467
468  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
469           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
470    constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});      // since C++20
471
472  template<forward_range R, class Proj = identity,
473           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
474    constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});                // since C++20
475
476  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
477           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
478    constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});   // since C++20
479
480  template<forward_range R, class Proj = identity,
481           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
482    constexpr borrowed_iterator_t<R>
483      ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});                       // since C++20
484
485  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
486          class Proj = identity>
487    requires sortable<I, Comp, Proj>
488    constexpr I
489      ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {});            // since C++20
490
491  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
492    requires sortable<iterator_t<R>, Comp, Proj>
493    constexpr borrowed_iterator_t<R>
494      ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {});          // since C++20
495
496  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
497           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
498    constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
499
500  template<forward_range R, class T, class Proj = identity,
501           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
502             ranges::less>
503    constexpr borrowed_iterator_t<R>
504      upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
505
506  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
507           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
508    constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
509                                    Proj proj = {});                                          // since C++20
510  template<forward_range R, class T, class Proj = identity,
511           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
512             ranges::less>
513    constexpr borrowed_iterator_t<R>
514      lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
515
516  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
517           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
518    constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
519                                         Proj proj = {});                                     // since C++20
520
521  template<forward_range R, class T, class Proj = identity,
522           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
523             ranges::less>
524    constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
525                                         Proj proj = {});                                     // since C++20
526
527  template<permutable I, sentinel_for<I> S, class Proj = identity,
528           indirect_unary_predicate<projected<I, Proj>> Pred>
529    constexpr subrange<I>
530      partition(I first, S last, Pred pred, Proj proj = {});                                  // Since C++20
531
532  template<forward_range R, class Proj = identity,
533           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
534    requires permutable<iterator_t<R>>
535    constexpr borrowed_subrange_t<R>
536      partition(R&& r, Pred pred, Proj proj = {});                                            // Since C++20
537
538  template<bidirectional_iterator I, sentinel_for<I> S, class Proj = identity,
539           indirect_unary_predicate<projected<I, Proj>> Pred>
540    requires permutable<I>
541    subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {});                 // Since C++20
542
543  template<bidirectional_range R, class Proj = identity,
544           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
545    requires permutable<iterator_t<R>>
546    borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {});                // Since C++20
547
548  template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
549           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
550    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
551    constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
552                                       Pred pred = {},
553                                       Proj1 proj1 = {}, Proj2 proj2 = {});                 // since C++20
554
555  template<input_range R1, forward_range R2,
556           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
557    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
558    constexpr borrowed_iterator_t<R1>
559      ranges::find_first_of(R1&& r1, R2&& r2,
560                            Pred pred = {},
561                            Proj1 proj1 = {}, Proj2 proj2 = {});                            // since C++20
562
563  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
564           indirect_binary_predicate<projected<I, Proj>,
565                                     projected<I, Proj>> Pred = ranges::equal_to>
566    constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {});     // since C+20
567
568  template<forward_range R, class Proj = identity,
569           indirect_binary_predicate<projected<iterator_t<R>, Proj>,
570                                     projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
571    constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {});  // since C++20
572
573  template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity>
574    requires indirectly_writable<I, const T2&> &&
575             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
576    constexpr I
577      ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {});   // since C++20
578
579  template<input_range R, class T1, class T2, class Proj = identity>
580    requires indirectly_writable<iterator_t<R>, const T2&> &&
581             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
582    constexpr borrowed_iterator_t<R>
583      ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {});             // since C++20
584
585  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity,
586           indirect_unary_predicate<projected<I, Proj>> Pred>
587    requires indirectly_writable<I, const T&>
588    constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
589
590  template<input_range R, class T, class Proj = identity,
591           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
592    requires indirectly_writable<iterator_t<R>, const T&>
593    constexpr borrowed_iterator_t<R>
594      ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {});                     // since C++20
595
596  template<class T, class Proj = identity,
597           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
598    constexpr const T&
599      ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {});          // since C++20
600
601  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
602           class Proj1 = identity, class Proj2 = identity,
603           indirect_strict_weak_order<projected<I1, Proj1>,
604                                      projected<I2, Proj2>> Comp = ranges::less>
605    constexpr bool
606      ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2,
607                                      Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});    // since C++20
608
609  template<input_range R1, input_range R2, class Proj1 = identity,
610           class Proj2 = identity,
611           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
612                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
613    constexpr bool
614      ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
615                                      Proj1 proj1 = {}, Proj2 proj2 = {});                    // since C++20
616
617  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
618    requires indirectly_movable<I1, I2>
619    constexpr ranges::move_backward_result<I1, I2>
620      ranges::move_backward(I1 first, S1 last, I2 result);                                          // since C++20
621
622  template<bidirectional_range R, bidirectional_iterator I>
623    requires indirectly_movable<iterator_t<R>, I>
624    constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I>
625      ranges::move_backward(R&& r, I result);                                                       // since C++20
626
627  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
628    requires indirectly_movable<I, O>
629    constexpr ranges::move_result<I, O>
630      ranges::move(I first, S last, O result);                                                      // since C++20
631
632  template<input_range R, weakly_incrementable O>
633    requires indirectly_movable<iterator_t<R>, O>
634    constexpr ranges::move_result<borrowed_iterator_t<R>, O>
635      ranges::move(R&& r, O result);                                                                // since C++20
636
637  template<class I, class O1, class O2>
638      using partition_copy_result = in_out_out_result<I, O1, O2>;                                   // since C++20
639
640  template<input_iterator I, sentinel_for<I> S,
641          weakly_incrementable O1, weakly_incrementable O2,
642          class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
643    requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2>
644    constexpr partition_copy_result<I, O1, O2>
645      partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
646                    Proj proj = {});                                                                // Since C++20
647
648  template<input_range R, weakly_incrementable O1, weakly_incrementable O2,
649          class Proj = identity,
650          indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
651    requires indirectly_copyable<iterator_t<R>, O1> &&
652            indirectly_copyable<iterator_t<R>, O2>
653    constexpr partition_copy_result<borrowed_iterator_t<R>, O1, O2>
654      partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {});                  // Since C++20
655
656  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
657           indirect_unary_predicate<projected<I, Proj>> Pred>
658    constexpr I partition_point(I first, S last, Pred pred, Proj proj = {});                        // Since C++20
659
660  template<forward_range R, class Proj = identity,
661           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
662    constexpr borrowed_iterator_t<R>
663      partition_point(R&& r, Pred pred, Proj proj = {});                                            // Since C++20
664
665  template<class I1, class I2, class O>
666    using merge_result = in_in_out_result<I1, I2, O>;                                               // since C++20
667
668  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
669           weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
670           class Proj2 = identity>
671    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
672    constexpr merge_result<I1, I2, O>
673      merge(I1 first1, S1 last1, I2 first2, S2 last2, O result,
674            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
675
676  template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
677           class Proj1 = identity, class Proj2 = identity>
678    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
679    constexpr merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
680      merge(R1&& r1, R2&& r2, O result,
681            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
682
683  template<permutable I, sentinel_for<I> S, class T, class Proj = identity>
684    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
685    constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {});          // since C++20
686
687  template<forward_range R, class T, class Proj = identity>
688    requires permutable<iterator_t<R>> &&
689             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
690    constexpr borrowed_subrange_t<R>
691      ranges::remove(R&& r, const T& value, Proj proj = {});                                        // since C++20
692
693  template<permutable I, sentinel_for<I> S, class Proj = identity,
694           indirect_unary_predicate<projected<I, Proj>> Pred>
695    constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {});            // since C++20
696
697  template<forward_range R, class Proj = identity,
698           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
699    requires permutable<iterator_t<R>>
700    constexpr borrowed_subrange_t<R>
701      ranges::remove_if(R&& r, Pred pred, Proj proj = {});                                          // since C++20
702
703  template<class I, class O>
704    using set_difference_result = in_out_result<I, O>;                                              // since C++20
705
706  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
707           weakly_incrementable O, class Comp = ranges::less,
708           class Proj1 = identity, class Proj2 = identity>
709    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
710    constexpr set_difference_result<I1, O>
711      set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
712                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
713
714  template<input_range R1, input_range R2, weakly_incrementable O,
715           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
716    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
717    constexpr set_difference_result<borrowed_iterator_t<R1>, O>
718      set_difference(R1&& r1, R2&& r2, O result,
719                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
720
721  template<class I1, class I2, class O>
722    using set_intersection_result = in_in_out_result<I1, I2, O>;                                    // since C++20
723
724  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
725           weakly_incrementable O, class Comp = ranges::less,
726           class Proj1 = identity, class Proj2 = identity>
727    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
728    constexpr set_intersection_result<I1, I2, O>
729      set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result,
730                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
731
732  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
733           weakly_incrementable O, class Comp = ranges::less,
734           class Proj1 = identity, class Proj2 = identity>
735    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
736    constexpr set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
737      set_intersection(R1&& r1, R2&& r2, O result,
738                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
739
740  template <class _InIter, class _OutIter>
741  using reverse_copy_result = in_out_result<_InIter, _OutIter>;                                     // since C++20
742
743  template<bidirectional_iterator I, sentinel_for<I> S, weakly_incrementable O>
744    requires indirectly_copyable<I, O>
745    constexpr ranges::reverse_copy_result<I, O>
746      ranges::reverse_copy(I first, S last, O result);                                              // since C++20
747
748  template<bidirectional_range R, weakly_incrementable O>
749    requires indirectly_copyable<iterator_t<R>, O>
750    constexpr ranges::reverse_copy_result<borrowed_iterator_t<R>, O>
751      ranges::reverse_copy(R&& r, O result);                                                        // since C++20
752
753  template<permutable I, sentinel_for<I> S>
754    constexpr subrange<I> rotate(I first, I middle, S last);                                        // since C++20
755
756  template<forward_range R>
757    requires permutable<iterator_t<R>>
758    constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle);                           // Since C++20
759
760  template <class _InIter, class _OutIter>
761  using rotate_copy_result = in_out_result<_InIter, _OutIter>;                                      // since C++20
762
763  template<forward_iterator I, sentinel_for<I> S, weakly_incrementable O>
764    requires indirectly_copyable<I, O>
765    constexpr ranges::rotate_copy_result<I, O>
766      ranges::rotate_copy(I first, I middle, S last, O result);                                     // since C++20
767
768  template<forward_range R, weakly_incrementable O>
769    requires indirectly_copyable<iterator_t<R>, O>
770    constexpr ranges::rotate_copy_result<borrowed_iterator_t<R>, O>
771      ranges::rotate_copy(R&& r, iterator_t<R> middle, O result);                                   // since C++20
772
773  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Gen>
774    requires (forward_iterator<I> || random_access_iterator<O>) &&
775            indirectly_copyable<I, O> &&
776            uniform_random_bit_generator<remove_reference_t<Gen>>
777    O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g);                              // Since C++20
778
779  template<input_range R, weakly_incrementable O, class Gen>
780    requires (forward_range<R> || random_access_iterator<O>) &&
781            indirectly_copyable<iterator_t<R>, O> &&
782            uniform_random_bit_generator<remove_reference_t<Gen>>
783    O sample(R&& r, O out, range_difference_t<R> n, Gen&& g);                                       // Since C++20
784
785  template<random_access_iterator I, sentinel_for<I> S, class Gen>
786    requires permutable<I> &&
787            uniform_random_bit_generator<remove_reference_t<Gen>>
788    I shuffle(I first, S last, Gen&& g);                                                           // Since C++20
789
790  template<random_access_range R, class Gen>
791    requires permutable<iterator_t<R>> &&
792            uniform_random_bit_generator<remove_reference_t<Gen>>
793    borrowed_iterator_t<R> shuffle(R&& r, Gen&& g);                                                // Since C++20
794
795  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2,
796         sentinel_for<I2> S2, class Proj1 = identity, class Proj2 = identity,
797         indirect_equivalence_relation<projected<I1, Proj1>,
798                                       projected<I2, Proj2>> Pred = ranges::equal_to>
799  constexpr bool ranges::is_permutation(I1 first1, S1 last1, I2 first2, S2 last2,
800                                        Pred pred = {},
801                                        Proj1 proj1 = {}, Proj2 proj2 = {});                       // Since C++20
802
803  template<forward_range R1, forward_range R2,
804         class Proj1 = identity, class Proj2 = identity,
805         indirect_equivalence_relation<projected<iterator_t<R1>, Proj1>,
806                                       projected<iterator_t<R2>, Proj2>> Pred = ranges::equal_to>
807  constexpr bool ranges::is_permutation(R1&& r1, R2&& r2, Pred pred = {},
808                                        Proj1 proj1 = {}, Proj2 proj2 = {});                       // Since C++20
809
810  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2,
811           sentinel_for<I2> S2, class Pred = ranges::equal_to,
812           class Proj1 = identity, class Proj2 = identity>
813    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
814    constexpr subrange<I1>
815      ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
816                     Proj1 proj1 = {}, Proj2 proj2 = {});                                           // since C++20
817
818  template<forward_range R1, forward_range R2, class Pred = ranges::equal_to,
819           class Proj1 = identity, class Proj2 = identity>
820    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
821    constexpr borrowed_subrange_t<R1>
822      ranges::search(R1&& r1, R2&& r2, Pred pred = {},
823                     Proj1 proj1 = {}, Proj2 proj2 = {});                                           // since C++20
824
825  template<forward_iterator I, sentinel_for<I> S, class T,
826           class Pred = ranges::equal_to, class Proj = identity>
827    requires indirectly_comparable<I, const T*, Pred, Proj>
828    constexpr subrange<I>
829      ranges::search_n(I first, S last, iter_difference_t<I> count,
830                       const T& value, Pred pred = {}, Proj proj = {});                             // since C++20
831
832  template<forward_range R, class T, class Pred = ranges::equal_to,
833           class Proj = identity>
834    requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj>
835    constexpr borrowed_subrange_t<R>
836      ranges::search_n(R&& r, range_difference_t<R> count,
837                       const T& value, Pred pred = {}, Proj proj = {});                             // since C++20
838
839  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
840           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
841    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
842    constexpr subrange<I1>
843      ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
844                       Proj1 proj1 = {}, Proj2 proj2 = {});                                         // since C++20
845
846  template<forward_range R1, forward_range R2,
847           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
848    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
849    constexpr borrowed_subrange_t<R1>
850      ranges::find_end(R1&& r1, R2&& r2, Pred pred = {},
851                       Proj1 proj1 = {}, Proj2 proj2 = {});                                         // since C++20
852
853  template<class I1, class I2, class O>
854    using set_symmetric_difference_result = in_in_out_result<I1, I2, O>;                            // since C++20
855
856  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
857           weakly_incrementable O, class Comp = ranges::less,
858           class Proj1 = identity, class Proj2 = identity>
859    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
860    constexpr set_symmetric_difference_result<I1, I2, O>
861      set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
862                               Comp comp = {}, Proj1 proj1 = {},
863                               Proj2 proj2 = {});                                                   // since C++20
864
865  template<input_range R1, input_range R2, weakly_incrementable O,
866           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
867    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
868    constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>,
869                                                      borrowed_iterator_t<R2>, O>
870      set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
871                               Proj1 proj1 = {}, Proj2 proj2 = {});                                 // since C++20
872
873  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
874           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
875    constexpr subrange<I>
876      equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {});                 // since C++20
877
878  template<forward_range R, class T, class Proj = identity,
879           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
880             ranges::less>
881    constexpr borrowed_subrange_t<R>
882      equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {});                           // since C++20
883
884  template<class I1, class I2, class O>
885    using set_union_result = in_in_out_result<I1, I2, O>;                                           // since C++20
886
887  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
888           weakly_incrementable O, class Comp = ranges::less,
889           class Proj1 = identity, class Proj2 = identity>
890    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
891    constexpr set_union_result<I1, I2, O>
892      set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
893                Proj1 proj1 = {}, Proj2 proj2 = {});                                                // since C++20
894
895  template<input_range R1, input_range R2, weakly_incrementable O,
896           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
897    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
898    constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
899      set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
900                Proj1 proj1 = {}, Proj2 proj2 = {});                                                // since C++20
901
902  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
903           class Proj1 = identity, class Proj2 = identity,
904           indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
905             ranges::less>
906    constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
907                            Proj1 proj1 = {}, Proj2 proj2 = {});                                   // Since C++20
908
909  template<input_range R1, input_range R2, class Proj1 = identity,
910           class Proj2 = identity,
911           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
912                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
913    constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
914                            Proj1 proj1 = {}, Proj2 proj2 = {});                                   // Since C++20
915
916  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
917           class Proj = identity>
918    requires sortable<I, Comp, Proj>
919    I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {});                    // Since C++20
920
921  template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
922    requires sortable<iterator_t<R>, Comp, Proj>
923    borrowed_iterator_t<R>
924      inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
925                    Proj proj = {});                                                               // Since C++20
926
927  template<permutable I, sentinel_for<I> S, class Proj = identity,
928           indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>
929    constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {});                    // Since C++20
930
931  template<forward_range R, class Proj = identity,
932           indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
933    requires permutable<iterator_t<R>>
934    constexpr borrowed_subrange_t<R>
935      unique(R&& r, C comp = {}, Proj proj = {});                                                  // Since C++20
936
937  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity,
938           indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>
939    requires indirectly_copyable<I, O> &&
940             (forward_iterator<I> ||
941              (input_iterator<O> && same_as<iter_value_t<I>, iter_value_t<O>>) ||
942              indirectly_copyable_storable<I, O>)
943    constexpr unique_copy_result<I, O>
944      unique_copy(I first, S last, O result, C comp = {}, Proj proj = {});                         // Since C++20
945
946  template<input_range R, weakly_incrementable O, class Proj = identity,
947           indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
948    requires indirectly_copyable<iterator_t<R>, O> &&
949             (forward_iterator<iterator_t<R>> ||
950              (input_iterator<O> && same_as<range_value_t<R>, iter_value_t<O>>) ||
951              indirectly_copyable_storable<iterator_t<R>, O>)
952    constexpr unique_copy_result<borrowed_iterator_t<R>, O>
953      unique_copy(R&& r, O result, C comp = {}, Proj proj = {});                                   // Since C++20
954
955  template<class I, class O>
956      using remove_copy_result = in_out_result<I, O>;                                              // Since C++20
957
958  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class T,
959           class Proj = identity>
960             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
961    constexpr remove_copy_result<I, O>
962      remove_copy(I first, S last, O result, const T& value, Proj proj = {});                      // Since C++20
963
964  template<input_range R, weakly_incrementable O, class T, class Proj = identity>
965    requires indirectly_copyable<iterator_t<R>, O> &&
966             indirect_binary_predicate<ranges::equal_to,
967                                       projected<iterator_t<R>, Proj>, const T*>
968    constexpr remove_copy_result<borrowed_iterator_t<R>, O>
969      remove_copy(R&& r, O result, const T& value, Proj proj = {});                                // Since C++20
970
971  template<class I, class O>
972      using remove_copy_if_result = in_out_result<I, O>;                                           // Since C++20
973
974  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O,
975           class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
976    requires indirectly_copyable<I, O>
977    constexpr remove_copy_if_result<I, O>
978      remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {});                        // Since C++20
979
980  template<input_range R, weakly_incrementable O, class Proj = identity,
981           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
982    requires indirectly_copyable<iterator_t<R>, O>
983    constexpr remove_copy_if_result<borrowed_iterator_t<R>, O>
984      remove_copy_if(R&& r, O result, Pred pred, Proj proj = {});                                  // Since C++20
985
986  template<class I, class O>
987      using replace_copy_result = in_out_result<I, O>;                                             // Since C++20
988
989  template<input_iterator I, sentinel_for<I> S, class T1, class T2,
990           output_iterator<const T2&> O, class Proj = identity>
991    requires indirectly_copyable<I, O> &&
992             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
993    constexpr replace_copy_result<I, O>
994      replace_copy(I first, S last, O result, const T1& old_value, const T2& new_value,
995                   Proj proj = {});                                                                // Since C++20
996
997  template<input_range R, class T1, class T2, output_iterator<const T2&> O,
998           class Proj = identity>
999    requires indirectly_copyable<iterator_t<R>, O> &&
1000             indirect_binary_predicate<ranges::equal_to,
1001                                       projected<iterator_t<R>, Proj>, const T1*>
1002    constexpr replace_copy_result<borrowed_iterator_t<R>, O>
1003      replace_copy(R&& r, O result, const T1& old_value, const T2& new_value,
1004                   Proj proj = {});                                                                // Since C++20
1005
1006  template<class I, class O>
1007      using replace_copy_if_result = in_out_result<I, O>;                                          // Since C++20
1008
1009  template<input_iterator I, sentinel_for<I> S, class T, output_iterator<const T&> O,
1010           class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
1011    requires indirectly_copyable<I, O>
1012    constexpr replace_copy_if_result<I, O>
1013      replace_copy_if(I first, S last, O result, Pred pred, const T& new_value,
1014                      Proj proj = {});                                                             // Since C++20
1015
1016  template<input_range R, class T, output_iterator<const T&> O, class Proj = identity,
1017           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
1018    requires indirectly_copyable<iterator_t<R>, O>
1019    constexpr replace_copy_if_result<borrowed_iterator_t<R>, O>
1020      replace_copy_if(R&& r, O result, Pred pred, const T& new_value,
1021                      Proj proj = {});                                                             // Since C++20
1022
1023  template<class I>
1024    using prev_permutation_result = in_found_result<I>;                                            // Since C++20
1025
1026  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1027           class Proj = identity>
1028    requires sortable<I, Comp, Proj>
1029    constexpr ranges::prev_permutation_result<I>
1030      ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {});                   // Since C++20
1031
1032  template<bidirectional_range R, class Comp = ranges::less,
1033           class Proj = identity>
1034    requires sortable<iterator_t<R>, Comp, Proj>
1035    constexpr ranges::prev_permutation_result<borrowed_iterator_t<R>>
1036      ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {});                             // Since C++20
1037
1038  template<class I>
1039    using next_permutation_result = in_found_result<I>;                                            // Since C++20
1040
1041  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1042           class Proj = identity>
1043    requires sortable<I, Comp, Proj>
1044    constexpr ranges::next_permutation_result<I>
1045      ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {});                   // Since C++20
1046
1047  template<bidirectional_range R, class Comp = ranges::less,
1048           class Proj = identity>
1049    requires sortable<iterator_t<R>, Comp, Proj>
1050    constexpr ranges::next_permutation_result<borrowed_iterator_t<R>>
1051      ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {});                             // Since C++20
1052
1053}
1054
1055template <class InputIterator, class Predicate>
1056    constexpr bool     // constexpr in C++20
1057    all_of(InputIterator first, InputIterator last, Predicate pred);
1058
1059template <class InputIterator, class Predicate>
1060    constexpr bool     // constexpr in C++20
1061    any_of(InputIterator first, InputIterator last, Predicate pred);
1062
1063template <class InputIterator, class Predicate>
1064    constexpr bool     // constexpr in C++20
1065    none_of(InputIterator first, InputIterator last, Predicate pred);
1066
1067template <class InputIterator, class Function>
1068    constexpr Function          // constexpr in C++20
1069    for_each(InputIterator first, InputIterator last, Function f);
1070
1071template<class InputIterator, class Size, class Function>
1072    constexpr InputIterator     // constexpr in C++20
1073    for_each_n(InputIterator first, Size n, Function f); // C++17
1074
1075template <class InputIterator, class T>
1076    constexpr InputIterator     // constexpr in C++20
1077    find(InputIterator first, InputIterator last, const T& value);
1078
1079template <class InputIterator, class Predicate>
1080    constexpr InputIterator     // constexpr in C++20
1081    find_if(InputIterator first, InputIterator last, Predicate pred);
1082
1083template<class InputIterator, class Predicate>
1084    constexpr InputIterator     // constexpr in C++20
1085    find_if_not(InputIterator first, InputIterator last, Predicate pred);
1086
1087template <class ForwardIterator1, class ForwardIterator2>
1088    constexpr ForwardIterator1  // constexpr in C++20
1089    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
1090             ForwardIterator2 first2, ForwardIterator2 last2);
1091
1092template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1093    constexpr ForwardIterator1  // constexpr in C++20
1094    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
1095             ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1096
1097template <class ForwardIterator1, class ForwardIterator2>
1098    constexpr ForwardIterator1  // constexpr in C++20
1099    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
1100                  ForwardIterator2 first2, ForwardIterator2 last2);
1101
1102template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1103    constexpr ForwardIterator1  // constexpr in C++20
1104    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
1105                  ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1106
1107template <class ForwardIterator>
1108    constexpr ForwardIterator   // constexpr in C++20
1109    adjacent_find(ForwardIterator first, ForwardIterator last);
1110
1111template <class ForwardIterator, class BinaryPredicate>
1112    constexpr ForwardIterator   // constexpr in C++20
1113    adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1114
1115template <class InputIterator, class T>
1116    constexpr typename iterator_traits<InputIterator>::difference_type  // constexpr in C++20
1117    count(InputIterator first, InputIterator last, const T& value);
1118
1119template <class InputIterator, class Predicate>
1120    constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20
1121    count_if(InputIterator first, InputIterator last, Predicate pred);
1122
1123template <class InputIterator1, class InputIterator2>
1124    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
1125    mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
1126
1127template <class InputIterator1, class InputIterator2>
1128    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
1129    mismatch(InputIterator1 first1, InputIterator1 last1,
1130             InputIterator2 first2, InputIterator2 last2); // **C++14**
1131
1132template <class InputIterator1, class InputIterator2, class BinaryPredicate>
1133    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
1134    mismatch(InputIterator1 first1, InputIterator1 last1,
1135             InputIterator2 first2, BinaryPredicate pred);
1136
1137template <class InputIterator1, class InputIterator2, class BinaryPredicate>
1138    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
1139    mismatch(InputIterator1 first1, InputIterator1 last1,
1140             InputIterator2 first2, InputIterator2 last2,
1141             BinaryPredicate pred); // **C++14**
1142
1143template <class InputIterator1, class InputIterator2>
1144    constexpr bool      // constexpr in C++20
1145    equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
1146
1147template <class InputIterator1, class InputIterator2>
1148    constexpr bool      // constexpr in C++20
1149    equal(InputIterator1 first1, InputIterator1 last1,
1150          InputIterator2 first2, InputIterator2 last2); // **C++14**
1151
1152template <class InputIterator1, class InputIterator2, class BinaryPredicate>
1153    constexpr bool      // constexpr in C++20
1154    equal(InputIterator1 first1, InputIterator1 last1,
1155          InputIterator2 first2, BinaryPredicate pred);
1156
1157template <class InputIterator1, class InputIterator2, class BinaryPredicate>
1158    constexpr bool      // constexpr in C++20
1159    equal(InputIterator1 first1, InputIterator1 last1,
1160          InputIterator2 first2, InputIterator2 last2,
1161          BinaryPredicate pred); // **C++14**
1162
1163template<class ForwardIterator1, class ForwardIterator2>
1164    constexpr bool      // constexpr in C++20
1165    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1166                   ForwardIterator2 first2);
1167
1168template<class ForwardIterator1, class ForwardIterator2>
1169    constexpr bool      // constexpr in C++20
1170    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1171                   ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
1172
1173template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1174    constexpr bool      // constexpr in C++20
1175    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1176                   ForwardIterator2 first2, BinaryPredicate pred);
1177
1178template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1179    constexpr bool      // constexpr in C++20
1180    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1181                   ForwardIterator2 first2, ForwardIterator2 last2,
1182                   BinaryPredicate pred);  // **C++14**
1183
1184template <class ForwardIterator1, class ForwardIterator2>
1185    constexpr ForwardIterator1      // constexpr in C++20
1186    search(ForwardIterator1 first1, ForwardIterator1 last1,
1187           ForwardIterator2 first2, ForwardIterator2 last2);
1188
1189template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1190    constexpr ForwardIterator1      // constexpr in C++20
1191    search(ForwardIterator1 first1, ForwardIterator1 last1,
1192           ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1193
1194template <class ForwardIterator, class Size, class T>
1195    constexpr ForwardIterator       // constexpr in C++20
1196    search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
1197
1198template <class ForwardIterator, class Size, class T, class BinaryPredicate>
1199    constexpr ForwardIterator       // constexpr in C++20
1200    search_n(ForwardIterator first, ForwardIterator last,
1201             Size count, const T& value, BinaryPredicate pred);
1202
1203template <class InputIterator, class OutputIterator>
1204    constexpr OutputIterator      // constexpr in C++20
1205    copy(InputIterator first, InputIterator last, OutputIterator result);
1206
1207template<class InputIterator, class OutputIterator, class Predicate>
1208    constexpr OutputIterator      // constexpr in C++20
1209    copy_if(InputIterator first, InputIterator last,
1210            OutputIterator result, Predicate pred);
1211
1212template<class InputIterator, class Size, class OutputIterator>
1213    constexpr OutputIterator      // constexpr in C++20
1214    copy_n(InputIterator first, Size n, OutputIterator result);
1215
1216template <class BidirectionalIterator1, class BidirectionalIterator2>
1217    constexpr BidirectionalIterator2      // constexpr in C++20
1218    copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1219                  BidirectionalIterator2 result);
1220
1221// [alg.move], move
1222template<class InputIterator, class OutputIterator>
1223    constexpr OutputIterator move(InputIterator first, InputIterator last,
1224                                OutputIterator result);
1225
1226template<class BidirectionalIterator1, class BidirectionalIterator2>
1227    constexpr BidirectionalIterator2
1228    move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1229                  BidirectionalIterator2 result);
1230
1231template <class ForwardIterator1, class ForwardIterator2>
1232    constexpr ForwardIterator2    // constexpr in C++20
1233    swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
1234
1235namespace ranges {
1236    template<class I1, class I2>
1237    using swap_ranges_result = in_in_result<I1, I2>;
1238
1239template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2>
1240        requires indirectly_swappable<I1, I2>
1241    constexpr ranges::swap_ranges_result<I1, I2>
1242        swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2);
1243
1244template<input_range R1, input_range R2>
1245        requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>
1246    constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
1247        swap_ranges(R1&& r1, R2&& r2);
1248}
1249
1250template <class ForwardIterator1, class ForwardIterator2>
1251    constexpr void                // constexpr in C++20
1252    iter_swap(ForwardIterator1 a, ForwardIterator2 b);
1253
1254template <class InputIterator, class OutputIterator, class UnaryOperation>
1255    constexpr OutputIterator      // constexpr in C++20
1256    transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
1257
1258template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
1259    constexpr OutputIterator      // constexpr in C++20
1260    transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
1261              OutputIterator result, BinaryOperation binary_op);
1262
1263template <class ForwardIterator, class T>
1264    constexpr void      // constexpr in C++20
1265    replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
1266
1267template <class ForwardIterator, class Predicate, class T>
1268    constexpr void      // constexpr in C++20
1269    replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
1270
1271template <class InputIterator, class OutputIterator, class T>
1272    constexpr OutputIterator      // constexpr in C++20
1273    replace_copy(InputIterator first, InputIterator last, OutputIterator result,
1274                 const T& old_value, const T& new_value);
1275
1276template <class InputIterator, class OutputIterator, class Predicate, class T>
1277    constexpr OutputIterator      // constexpr in C++20
1278    replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
1279
1280template <class ForwardIterator, class T>
1281    constexpr void      // constexpr in C++20
1282    fill(ForwardIterator first, ForwardIterator last, const T& value);
1283
1284template <class OutputIterator, class Size, class T>
1285    constexpr OutputIterator      // constexpr in C++20
1286    fill_n(OutputIterator first, Size n, const T& value);
1287
1288template <class ForwardIterator, class Generator>
1289    constexpr void      // constexpr in C++20
1290    generate(ForwardIterator first, ForwardIterator last, Generator gen);
1291
1292template <class OutputIterator, class Size, class Generator>
1293    constexpr OutputIterator      // constexpr in C++20
1294    generate_n(OutputIterator first, Size n, Generator gen);
1295
1296template <class ForwardIterator, class T>
1297    constexpr ForwardIterator     // constexpr in C++20
1298    remove(ForwardIterator first, ForwardIterator last, const T& value);
1299
1300template <class ForwardIterator, class Predicate>
1301    constexpr ForwardIterator     // constexpr in C++20
1302    remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
1303
1304template <class InputIterator, class OutputIterator, class T>
1305    constexpr OutputIterator     // constexpr in C++20
1306    remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
1307
1308template <class InputIterator, class OutputIterator, class Predicate>
1309    constexpr OutputIterator     // constexpr in C++20
1310    remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
1311
1312template <class ForwardIterator>
1313    constexpr ForwardIterator    // constexpr in C++20
1314    unique(ForwardIterator first, ForwardIterator last);
1315
1316template <class ForwardIterator, class BinaryPredicate>
1317    constexpr ForwardIterator    // constexpr in C++20
1318    unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1319
1320template <class InputIterator, class OutputIterator>
1321    constexpr OutputIterator     // constexpr in C++20
1322    unique_copy(InputIterator first, InputIterator last, OutputIterator result);
1323
1324template <class InputIterator, class OutputIterator, class BinaryPredicate>
1325    constexpr OutputIterator     // constexpr in C++20
1326    unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
1327
1328template <class BidirectionalIterator>
1329    constexpr void               // constexpr in C++20
1330    reverse(BidirectionalIterator first, BidirectionalIterator last);
1331
1332template <class BidirectionalIterator, class OutputIterator>
1333    constexpr OutputIterator       // constexpr in C++20
1334    reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
1335
1336template <class ForwardIterator>
1337    constexpr ForwardIterator      // constexpr in C++20
1338    rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
1339
1340template <class ForwardIterator, class OutputIterator>
1341    constexpr OutputIterator       // constexpr in C++20
1342    rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
1343
1344template <class RandomAccessIterator>
1345    void
1346    random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
1347
1348template <class RandomAccessIterator, class RandomNumberGenerator>
1349    void
1350    random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
1351                   RandomNumberGenerator& rand);  // deprecated in C++14, removed in C++17
1352
1353template<class PopulationIterator, class SampleIterator,
1354         class Distance, class UniformRandomBitGenerator>
1355    SampleIterator sample(PopulationIterator first, PopulationIterator last,
1356                          SampleIterator out, Distance n,
1357                          UniformRandomBitGenerator&& g); // C++17
1358
1359template<class RandomAccessIterator, class UniformRandomNumberGenerator>
1360    void shuffle(RandomAccessIterator first, RandomAccessIterator last,
1361                 UniformRandomNumberGenerator&& g);
1362
1363template<class ForwardIterator>
1364  constexpr ForwardIterator
1365    shift_left(ForwardIterator first, ForwardIterator last,
1366               typename iterator_traits<ForwardIterator>::difference_type n); // C++20
1367
1368template<class ForwardIterator>
1369  constexpr ForwardIterator
1370    shift_right(ForwardIterator first, ForwardIterator last,
1371                typename iterator_traits<ForwardIterator>::difference_type n); // C++20
1372
1373template <class InputIterator, class Predicate>
1374    constexpr bool  // constexpr in C++20
1375    is_partitioned(InputIterator first, InputIterator last, Predicate pred);
1376
1377template <class ForwardIterator, class Predicate>
1378    constexpr ForwardIterator  // constexpr in C++20
1379    partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1380
1381template <class InputIterator, class OutputIterator1,
1382          class OutputIterator2, class Predicate>
1383    constexpr pair<OutputIterator1, OutputIterator2>   // constexpr in C++20
1384    partition_copy(InputIterator first, InputIterator last,
1385                   OutputIterator1 out_true, OutputIterator2 out_false,
1386                   Predicate pred);
1387
1388template <class ForwardIterator, class Predicate>
1389    ForwardIterator
1390    stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1391
1392template<class ForwardIterator, class Predicate>
1393    constexpr ForwardIterator  // constexpr in C++20
1394    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
1395
1396template <class ForwardIterator>
1397    constexpr bool  // constexpr in C++20
1398    is_sorted(ForwardIterator first, ForwardIterator last);
1399
1400template <class ForwardIterator, class Compare>
1401    constexpr bool  // constexpr in C++20
1402    is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1403
1404template<class ForwardIterator>
1405    constexpr ForwardIterator    // constexpr in C++20
1406    is_sorted_until(ForwardIterator first, ForwardIterator last);
1407
1408template <class ForwardIterator, class Compare>
1409    constexpr ForwardIterator    // constexpr in C++20
1410    is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1411
1412template <class RandomAccessIterator>
1413    constexpr void               // constexpr in C++20
1414    sort(RandomAccessIterator first, RandomAccessIterator last);
1415
1416template <class RandomAccessIterator, class Compare>
1417    constexpr void               // constexpr in C++20
1418    sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1419
1420template <class RandomAccessIterator>
1421    void
1422    stable_sort(RandomAccessIterator first, RandomAccessIterator last);
1423
1424template <class RandomAccessIterator, class Compare>
1425    void
1426    stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1427
1428template <class RandomAccessIterator>
1429    constexpr void                    // constexpr in C++20
1430    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
1431
1432template <class RandomAccessIterator, class Compare>
1433    constexpr void                    // constexpr in C++20
1434    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1435
1436template <class InputIterator, class RandomAccessIterator>
1437    constexpr RandomAccessIterator    // constexpr in C++20
1438    partial_sort_copy(InputIterator first, InputIterator last,
1439                      RandomAccessIterator result_first, RandomAccessIterator result_last);
1440
1441template <class InputIterator, class RandomAccessIterator, class Compare>
1442    constexpr RandomAccessIterator    // constexpr in C++20
1443    partial_sort_copy(InputIterator first, InputIterator last,
1444                      RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1445
1446template <class RandomAccessIterator>
1447    constexpr void                    // constexpr in C++20
1448    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
1449
1450template <class RandomAccessIterator, class Compare>
1451    constexpr void                    // constexpr in C++20
1452    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1453
1454template <class ForwardIterator, class T>
1455    constexpr ForwardIterator                         // constexpr in C++20
1456    lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
1457
1458template <class ForwardIterator, class T, class Compare>
1459    constexpr ForwardIterator                         // constexpr in C++20
1460    lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1461
1462template <class ForwardIterator, class T>
1463    constexpr ForwardIterator                         // constexpr in C++20
1464    upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
1465
1466template <class ForwardIterator, class T, class Compare>
1467    constexpr ForwardIterator                         // constexpr in C++20
1468    upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1469
1470template <class ForwardIterator, class T>
1471    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
1472    equal_range(ForwardIterator first, ForwardIterator last, const T& value);
1473
1474template <class ForwardIterator, class T, class Compare>
1475    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
1476    equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1477
1478template <class ForwardIterator, class T>
1479    constexpr bool                                    // constexpr in C++20
1480    binary_search(ForwardIterator first, ForwardIterator last, const T& value);
1481
1482template <class ForwardIterator, class T, class Compare>
1483    constexpr bool                                    // constexpr in C++20
1484    binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1485
1486template <class InputIterator1, class InputIterator2, class OutputIterator>
1487    constexpr OutputIterator                          // constexpr in C++20
1488    merge(InputIterator1 first1, InputIterator1 last1,
1489          InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1490
1491template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1492    constexpr OutputIterator                          // constexpr in C++20
1493    merge(InputIterator1 first1, InputIterator1 last1,
1494          InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1495
1496template <class BidirectionalIterator>
1497    void
1498    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
1499
1500template <class BidirectionalIterator, class Compare>
1501    void
1502    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1503
1504template <class InputIterator1, class InputIterator2>
1505    constexpr bool                                    // constexpr in C++20
1506    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1507
1508template <class InputIterator1, class InputIterator2, class Compare>
1509    constexpr bool                                    // constexpr in C++20
1510    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1511
1512template <class InputIterator1, class InputIterator2, class OutputIterator>
1513    constexpr OutputIterator                          // constexpr in C++20
1514    set_union(InputIterator1 first1, InputIterator1 last1,
1515              InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1516
1517template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1518    constexpr OutputIterator                          // constexpr in C++20
1519    set_union(InputIterator1 first1, InputIterator1 last1,
1520              InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1521
1522template <class InputIterator1, class InputIterator2, class OutputIterator>
1523    constexpr OutputIterator                         // constexpr in C++20
1524    set_intersection(InputIterator1 first1, InputIterator1 last1,
1525                     InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1526
1527template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1528    constexpr OutputIterator                         // constexpr in C++20
1529    set_intersection(InputIterator1 first1, InputIterator1 last1,
1530                     InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1531
1532template <class InputIterator1, class InputIterator2, class OutputIterator>
1533    constexpr OutputIterator                         // constexpr in C++20
1534    set_difference(InputIterator1 first1, InputIterator1 last1,
1535                   InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1536
1537template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1538    constexpr OutputIterator                         // constexpr in C++20
1539    set_difference(InputIterator1 first1, InputIterator1 last1,
1540                   InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1541
1542template <class InputIterator1, class InputIterator2, class OutputIterator>
1543    constexpr OutputIterator                         // constexpr in C++20
1544    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
1545                             InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1546
1547template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1548    constexpr OutputIterator                         // constexpr in C++20
1549    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
1550                             InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1551
1552template <class RandomAccessIterator>
1553    constexpr void                                   // constexpr in C++20
1554    push_heap(RandomAccessIterator first, RandomAccessIterator last);
1555
1556template <class RandomAccessIterator, class Compare>
1557    constexpr void                                   // constexpr in C++20
1558    push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1559
1560template <class RandomAccessIterator>
1561    constexpr void                                   // constexpr in C++20
1562    pop_heap(RandomAccessIterator first, RandomAccessIterator last);
1563
1564template <class RandomAccessIterator, class Compare>
1565    constexpr void                                   // constexpr in C++20
1566    pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1567
1568template <class RandomAccessIterator>
1569    constexpr void                                   // constexpr in C++20
1570    make_heap(RandomAccessIterator first, RandomAccessIterator last);
1571
1572template <class RandomAccessIterator, class Compare>
1573    constexpr void                                   // constexpr in C++20
1574    make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1575
1576template <class RandomAccessIterator>
1577    constexpr void                                   // constexpr in C++20
1578    sort_heap(RandomAccessIterator first, RandomAccessIterator last);
1579
1580template <class RandomAccessIterator, class Compare>
1581    constexpr void                                   // constexpr in C++20
1582    sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1583
1584template <class RandomAccessIterator>
1585    constexpr bool   // constexpr in C++20
1586    is_heap(RandomAccessIterator first, RandomAccessiterator last);
1587
1588template <class RandomAccessIterator, class Compare>
1589    constexpr bool   // constexpr in C++20
1590    is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1591
1592template <class RandomAccessIterator>
1593    constexpr RandomAccessIterator   // constexpr in C++20
1594    is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
1595
1596template <class RandomAccessIterator, class Compare>
1597    constexpr RandomAccessIterator   // constexpr in C++20
1598    is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1599
1600template <class ForwardIterator>
1601    constexpr ForwardIterator        // constexpr in C++14
1602    min_element(ForwardIterator first, ForwardIterator last);
1603
1604template <class ForwardIterator, class Compare>
1605    constexpr ForwardIterator        // constexpr in C++14
1606    min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1607
1608template <class T>
1609    constexpr const T&               // constexpr in C++14
1610    min(const T& a, const T& b);
1611
1612template <class T, class Compare>
1613    constexpr const T&               // constexpr in C++14
1614    min(const T& a, const T& b, Compare comp);
1615
1616template<class T>
1617    constexpr T                      // constexpr in C++14
1618    min(initializer_list<T> t);
1619
1620template<class T, class Compare>
1621    constexpr T                      // constexpr in C++14
1622    min(initializer_list<T> t, Compare comp);
1623
1624template<class T>
1625    constexpr const T& clamp(const T& v, const T& lo, const T& hi);               // C++17
1626
1627template<class T, class Compare>
1628    constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1629
1630template <class ForwardIterator>
1631    constexpr ForwardIterator        // constexpr in C++14
1632    max_element(ForwardIterator first, ForwardIterator last);
1633
1634template <class ForwardIterator, class Compare>
1635    constexpr ForwardIterator        // constexpr in C++14
1636    max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1637
1638template <class T>
1639    constexpr const T&               // constexpr in C++14
1640    max(const T& a, const T& b);
1641
1642template <class T, class Compare>
1643    constexpr const T&               // constexpr in C++14
1644    max(const T& a, const T& b, Compare comp);
1645
1646template<class T>
1647    constexpr T                      // constexpr in C++14
1648    max(initializer_list<T> t);
1649
1650template<class T, class Compare>
1651    constexpr T                      // constexpr in C++14
1652    max(initializer_list<T> t, Compare comp);
1653
1654template<class ForwardIterator>
1655    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1656    minmax_element(ForwardIterator first, ForwardIterator last);
1657
1658template<class ForwardIterator, class Compare>
1659    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1660    minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1661
1662template<class T>
1663    constexpr pair<const T&, const T&>  // constexpr in C++14
1664    minmax(const T& a, const T& b);
1665
1666template<class T, class Compare>
1667    constexpr pair<const T&, const T&>  // constexpr in C++14
1668    minmax(const T& a, const T& b, Compare comp);
1669
1670template<class T>
1671    constexpr pair<T, T>                // constexpr in C++14
1672    minmax(initializer_list<T> t);
1673
1674template<class T, class Compare>
1675    constexpr pair<T, T>                // constexpr in C++14
1676    minmax(initializer_list<T> t, Compare comp);
1677
1678template <class InputIterator1, class InputIterator2>
1679    constexpr bool     // constexpr in C++20
1680    lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1681
1682template <class InputIterator1, class InputIterator2, class Compare>
1683    constexpr bool     // constexpr in C++20
1684    lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
1685                            InputIterator2 first2, InputIterator2 last2, Compare comp);
1686
1687template <class BidirectionalIterator>
1688    constexpr bool     // constexpr in C++20
1689    next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1690
1691template <class BidirectionalIterator, class Compare>
1692    constexpr bool     // constexpr in C++20
1693    next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1694
1695template <class BidirectionalIterator>
1696    constexpr bool     // constexpr in C++20
1697    prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1698
1699template <class BidirectionalIterator, class Compare>
1700    constexpr bool     // constexpr in C++20
1701    prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1702}  // std
1703
1704*/
1705
1706#include <__assert> // all public C++ headers provide the assertion handler
1707#include <__bits>
1708#include <__config>
1709#include <__debug>
1710#include <cstddef>
1711#include <cstring>
1712#include <memory>
1713#include <type_traits>
1714#include <version>
1715
1716#include <__algorithm/adjacent_find.h>
1717#include <__algorithm/all_of.h>
1718#include <__algorithm/any_of.h>
1719#include <__algorithm/binary_search.h>
1720#include <__algorithm/clamp.h>
1721#include <__algorithm/comp.h>
1722#include <__algorithm/comp_ref_type.h>
1723#include <__algorithm/copy.h>
1724#include <__algorithm/copy_backward.h>
1725#include <__algorithm/copy_if.h>
1726#include <__algorithm/copy_n.h>
1727#include <__algorithm/count.h>
1728#include <__algorithm/count_if.h>
1729#include <__algorithm/equal.h>
1730#include <__algorithm/equal_range.h>
1731#include <__algorithm/fill.h>
1732#include <__algorithm/fill_n.h>
1733#include <__algorithm/find.h>
1734#include <__algorithm/find_end.h>
1735#include <__algorithm/find_first_of.h>
1736#include <__algorithm/find_if.h>
1737#include <__algorithm/find_if_not.h>
1738#include <__algorithm/for_each.h>
1739#include <__algorithm/for_each_n.h>
1740#include <__algorithm/generate.h>
1741#include <__algorithm/generate_n.h>
1742#include <__algorithm/half_positive.h>
1743#include <__algorithm/in_found_result.h>
1744#include <__algorithm/in_fun_result.h>
1745#include <__algorithm/in_in_out_result.h>
1746#include <__algorithm/in_in_result.h>
1747#include <__algorithm/in_out_out_result.h>
1748#include <__algorithm/in_out_result.h>
1749#include <__algorithm/includes.h>
1750#include <__algorithm/inplace_merge.h>
1751#include <__algorithm/is_heap.h>
1752#include <__algorithm/is_heap_until.h>
1753#include <__algorithm/is_partitioned.h>
1754#include <__algorithm/is_permutation.h>
1755#include <__algorithm/is_sorted.h>
1756#include <__algorithm/is_sorted_until.h>
1757#include <__algorithm/iter_swap.h>
1758#include <__algorithm/lexicographical_compare.h>
1759#include <__algorithm/lower_bound.h>
1760#include <__algorithm/make_heap.h>
1761#include <__algorithm/max.h>
1762#include <__algorithm/max_element.h>
1763#include <__algorithm/merge.h>
1764#include <__algorithm/min.h>
1765#include <__algorithm/min_element.h>
1766#include <__algorithm/min_max_result.h>
1767#include <__algorithm/minmax.h>
1768#include <__algorithm/minmax_element.h>
1769#include <__algorithm/mismatch.h>
1770#include <__algorithm/move.h>
1771#include <__algorithm/move_backward.h>
1772#include <__algorithm/next_permutation.h>
1773#include <__algorithm/none_of.h>
1774#include <__algorithm/nth_element.h>
1775#include <__algorithm/partial_sort.h>
1776#include <__algorithm/partial_sort_copy.h>
1777#include <__algorithm/partition.h>
1778#include <__algorithm/partition_copy.h>
1779#include <__algorithm/partition_point.h>
1780#include <__algorithm/pop_heap.h>
1781#include <__algorithm/prev_permutation.h>
1782#include <__algorithm/push_heap.h>
1783#include <__algorithm/ranges_adjacent_find.h>
1784#include <__algorithm/ranges_all_of.h>
1785#include <__algorithm/ranges_any_of.h>
1786#include <__algorithm/ranges_binary_search.h>
1787#include <__algorithm/ranges_clamp.h>
1788#include <__algorithm/ranges_copy.h>
1789#include <__algorithm/ranges_copy_backward.h>
1790#include <__algorithm/ranges_copy_if.h>
1791#include <__algorithm/ranges_copy_n.h>
1792#include <__algorithm/ranges_count.h>
1793#include <__algorithm/ranges_count_if.h>
1794#include <__algorithm/ranges_equal.h>
1795#include <__algorithm/ranges_equal_range.h>
1796#include <__algorithm/ranges_fill.h>
1797#include <__algorithm/ranges_fill_n.h>
1798#include <__algorithm/ranges_find.h>
1799#include <__algorithm/ranges_find_end.h>
1800#include <__algorithm/ranges_find_first_of.h>
1801#include <__algorithm/ranges_find_if.h>
1802#include <__algorithm/ranges_find_if_not.h>
1803#include <__algorithm/ranges_for_each.h>
1804#include <__algorithm/ranges_for_each_n.h>
1805#include <__algorithm/ranges_generate.h>
1806#include <__algorithm/ranges_generate_n.h>
1807#include <__algorithm/ranges_includes.h>
1808#include <__algorithm/ranges_inplace_merge.h>
1809#include <__algorithm/ranges_is_heap.h>
1810#include <__algorithm/ranges_is_heap_until.h>
1811#include <__algorithm/ranges_is_partitioned.h>
1812#include <__algorithm/ranges_is_permutation.h>
1813#include <__algorithm/ranges_is_sorted.h>
1814#include <__algorithm/ranges_is_sorted_until.h>
1815#include <__algorithm/ranges_lexicographical_compare.h>
1816#include <__algorithm/ranges_lower_bound.h>
1817#include <__algorithm/ranges_make_heap.h>
1818#include <__algorithm/ranges_max.h>
1819#include <__algorithm/ranges_max_element.h>
1820#include <__algorithm/ranges_merge.h>
1821#include <__algorithm/ranges_min.h>
1822#include <__algorithm/ranges_min_element.h>
1823#include <__algorithm/ranges_minmax.h>
1824#include <__algorithm/ranges_minmax_element.h>
1825#include <__algorithm/ranges_mismatch.h>
1826#include <__algorithm/ranges_move.h>
1827#include <__algorithm/ranges_move_backward.h>
1828#include <__algorithm/ranges_next_permutation.h>
1829#include <__algorithm/ranges_none_of.h>
1830#include <__algorithm/ranges_nth_element.h>
1831#include <__algorithm/ranges_partial_sort.h>
1832#include <__algorithm/ranges_partial_sort_copy.h>
1833#include <__algorithm/ranges_partition.h>
1834#include <__algorithm/ranges_partition_copy.h>
1835#include <__algorithm/ranges_partition_point.h>
1836#include <__algorithm/ranges_pop_heap.h>
1837#include <__algorithm/ranges_prev_permutation.h>
1838#include <__algorithm/ranges_push_heap.h>
1839#include <__algorithm/ranges_remove.h>
1840#include <__algorithm/ranges_remove_copy.h>
1841#include <__algorithm/ranges_remove_copy_if.h>
1842#include <__algorithm/ranges_remove_if.h>
1843#include <__algorithm/ranges_replace.h>
1844#include <__algorithm/ranges_replace_copy.h>
1845#include <__algorithm/ranges_replace_copy_if.h>
1846#include <__algorithm/ranges_replace_if.h>
1847#include <__algorithm/ranges_reverse.h>
1848#include <__algorithm/ranges_reverse_copy.h>
1849#include <__algorithm/ranges_rotate.h>
1850#include <__algorithm/ranges_rotate_copy.h>
1851#include <__algorithm/ranges_sample.h>
1852#include <__algorithm/ranges_search.h>
1853#include <__algorithm/ranges_search_n.h>
1854#include <__algorithm/ranges_set_difference.h>
1855#include <__algorithm/ranges_set_intersection.h>
1856#include <__algorithm/ranges_set_symmetric_difference.h>
1857#include <__algorithm/ranges_set_union.h>
1858#include <__algorithm/ranges_shuffle.h>
1859#include <__algorithm/ranges_sort.h>
1860#include <__algorithm/ranges_sort_heap.h>
1861#include <__algorithm/ranges_stable_partition.h>
1862#include <__algorithm/ranges_stable_sort.h>
1863#include <__algorithm/ranges_swap_ranges.h>
1864#include <__algorithm/ranges_transform.h>
1865#include <__algorithm/ranges_unique.h>
1866#include <__algorithm/ranges_unique_copy.h>
1867#include <__algorithm/ranges_upper_bound.h>
1868#include <__algorithm/remove.h>
1869#include <__algorithm/remove_copy.h>
1870#include <__algorithm/remove_copy_if.h>
1871#include <__algorithm/remove_if.h>
1872#include <__algorithm/replace.h>
1873#include <__algorithm/replace_copy.h>
1874#include <__algorithm/replace_copy_if.h>
1875#include <__algorithm/replace_if.h>
1876#include <__algorithm/reverse.h>
1877#include <__algorithm/reverse_copy.h>
1878#include <__algorithm/rotate.h>
1879#include <__algorithm/rotate_copy.h>
1880#include <__algorithm/sample.h>
1881#include <__algorithm/search.h>
1882#include <__algorithm/search_n.h>
1883#include <__algorithm/set_difference.h>
1884#include <__algorithm/set_intersection.h>
1885#include <__algorithm/set_symmetric_difference.h>
1886#include <__algorithm/set_union.h>
1887#include <__algorithm/shift_left.h>
1888#include <__algorithm/shift_right.h>
1889#include <__algorithm/shuffle.h>
1890#include <__algorithm/sift_down.h>
1891#include <__algorithm/sort.h>
1892#include <__algorithm/sort_heap.h>
1893#include <__algorithm/stable_partition.h>
1894#include <__algorithm/stable_sort.h>
1895#include <__algorithm/swap_ranges.h>
1896#include <__algorithm/transform.h>
1897#include <__algorithm/unique.h>
1898#include <__algorithm/unique_copy.h>
1899#include <__algorithm/unwrap_iter.h>
1900#include <__algorithm/upper_bound.h>
1901
1902#ifndef _LIBCPP_REMOVE_TRANSITIVE_INCLUDES
1903#  include <chrono>
1904#  include <iterator>
1905#  include <utility>
1906#endif
1907
1908// standard-mandated includes
1909#include <initializer_list>
1910
1911#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
1912#  pragma GCC system_header
1913#endif
1914
1915#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
1916#   include <__pstl_algorithm>
1917#endif
1918
1919#endif // _LIBCPP_ALGORITHM
1920