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>                                                                     // since C++20
68  mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {})
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 ExecutionPolicy, class ForwardIterator, class Generator>
405    void generate(ExecutionPolicy&& exec,
406                  ForwardIterator first, ForwardIterator last,
407                  Generator gen);                                                           // since C++17
408
409  template<class R, copy_constructible F>
410    requires invocable<F&> && output_range<R, invoke_result_t<F&>>
411    constexpr borrowed_iterator_t<R> generate(R&& r, F gen);                                // since C++20
412
413  template<input_or_output_iterator O, copy_constructible F>
414    requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>>
415    constexpr O generate_n(O first, iter_difference_t<O> n, F gen);                         // since C++20
416
417  template<class ExecutionPolicy, class ForwardIterator, class Size, class Generator>
418    ForwardIterator generate_n(ExecutionPolicy&& exec,
419                               ForwardIterator first, Size n, Generator gen);               // since C++17
420
421 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
422          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
423   requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
424   constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2,
425                                Pred pred = {},
426                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
427
428 template<input_range R1, input_range R2, class Pred = ranges::equal_to,
429          class Proj1 = identity, class Proj2 = identity>
430   requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
431   constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
432                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
433
434  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
435           indirect_unary_predicate<projected<I, Proj>> Pred>
436    constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {});              // since C++20
437
438  template<input_range R, class Proj = identity,
439           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
440    constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {});                        // since C++20
441
442  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
443           indirect_unary_predicate<projected<I, Proj>> Pred>
444    constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {});              // since C++20
445
446  template<input_range R, class Proj = identity,
447           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
448    constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {});                        // since C++20
449
450  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
451           indirect_unary_predicate<projected<I, Proj>> Pred>
452    constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {});             // since C++20
453
454  template<input_range R, class Proj = identity,
455           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
456    constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {});                       // since C++20
457
458  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
459          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
460    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
461    constexpr bool ranges::starts_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
462                                      Proj1 proj1 = {}, Proj2 proj2 = {});                 // since C++23
463
464  template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity,
465          class Proj2 = identity>
466    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
467    constexpr bool ranges::starts_with(R1&& r1, R2&& r2, Pred pred = {},
468                                      Proj1 proj1 = {}, Proj2 proj2 = {});                // since C++23
469
470  template<input_iterator I1, sentinel_for<I1> S1,
471          random_access_iterator I2, sentinel_for<I2> S2,
472          class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
473    requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
474            indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
475    constexpr partial_sort_copy_result<I1, I2>
476      partial_sort_copy(I1 first, S1 last, I2 result_first, S2 result_last,
477                        Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                // since C++20
478
479  template<input_range R1, random_access_range R2, class Comp = ranges::less,
480          class Proj1 = identity, class Proj2 = identity>
481    requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> &&
482            sortable<iterator_t<R2>, Comp, Proj2> &&
483            indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
484                                        projected<iterator_t<R2>, Proj2>>
485    constexpr partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
486      partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
487                        Proj1 proj1 = {}, Proj2 proj2 = {});                                // since C++20
488
489  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
490           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
491    constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});      // since C++20
492
493  template<forward_range R, class Proj = identity,
494           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
495    constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});                // since C++20
496
497  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
498           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
499    constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});   // since C++20
500
501  template<forward_range R, class Proj = identity,
502           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
503    constexpr borrowed_iterator_t<R>
504      ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});                       // since C++20
505
506  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
507          class Proj = identity>
508    requires sortable<I, Comp, Proj>
509    constexpr I
510      ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {});          // since C++20
511
512  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
513    requires sortable<iterator_t<R>, Comp, Proj>
514    constexpr borrowed_iterator_t<R>
515      ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {});        // since C++20
516
517  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
518           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>    // since C++20
519    constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
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 borrowed_iterator_t<R>
525      upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                   // since C++20
526
527  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
528           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
529    constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
530                                    Proj proj = {});                                        // since C++20
531  template<forward_range R, class T, class Proj = identity,
532           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
533             ranges::less>
534    constexpr borrowed_iterator_t<R>
535      lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                   // since C++20
536
537  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
538           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
539    constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
540                                         Proj proj = {});                                   // since C++20
541
542  template<forward_range R, class T, class Proj = identity,
543           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
544             ranges::less>
545    constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
546                                         Proj proj = {});                                   // since C++20
547
548  template<permutable I, sentinel_for<I> S, class Proj = identity,
549           indirect_unary_predicate<projected<I, Proj>> Pred>
550    constexpr subrange<I>
551      partition(I first, S last, Pred pred, Proj proj = {});                                // since C++20
552
553  template<forward_range R, class Proj = identity,
554           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
555    requires permutable<iterator_t<R>>
556    constexpr borrowed_subrange_t<R>
557      partition(R&& r, Pred pred, Proj proj = {});                                          // since C++20
558
559  template<bidirectional_iterator I, sentinel_for<I> S, class Proj = identity,
560           indirect_unary_predicate<projected<I, Proj>> Pred>
561    requires permutable<I>
562    subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {});               // since C++20
563
564  template<bidirectional_range R, class Proj = identity,
565           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
566    requires permutable<iterator_t<R>>
567    borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {});              // since C++20
568
569  template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
570           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
571    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
572    constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
573                                       Pred pred = {},
574                                       Proj1 proj1 = {}, Proj2 proj2 = {});                 // since C++20
575
576  template<input_range R1, forward_range R2,
577           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
578    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
579    constexpr borrowed_iterator_t<R1>
580      ranges::find_first_of(R1&& r1, R2&& r2,
581                            Pred pred = {},
582                            Proj1 proj1 = {}, Proj2 proj2 = {});                            // since C++20
583
584  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
585           indirect_binary_predicate<projected<I, Proj>,
586                                     projected<I, Proj>> Pred = ranges::equal_to>
587    constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {});     // since C++20
588
589  template<forward_range R, class Proj = identity,
590           indirect_binary_predicate<projected<iterator_t<R>, Proj>,
591                                     projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
592    constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {});  // since C++20
593
594  template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity>
595    requires indirectly_writable<I, const T2&> &&
596             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
597    constexpr I
598      ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {});   // since C++20
599
600  template<input_range R, class T1, class T2, class Proj = identity>
601    requires indirectly_writable<iterator_t<R>, const T2&> &&
602             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
603    constexpr borrowed_iterator_t<R>
604      ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {});             // since C++20
605
606  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity,
607           indirect_unary_predicate<projected<I, Proj>> Pred>
608    requires indirectly_writable<I, const T&>
609    constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
610
611  template<input_range R, class T, class Proj = identity,
612           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
613    requires indirectly_writable<iterator_t<R>, const T&>
614    constexpr borrowed_iterator_t<R>
615      ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {});                     // since C++20
616
617  template<class T, class Proj = identity,
618           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
619    constexpr const T&
620      ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {});          // since C++20
621
622  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
623           class Proj1 = identity, class Proj2 = identity,
624           indirect_strict_weak_order<projected<I1, Proj1>,
625                                      projected<I2, Proj2>> Comp = ranges::less>
626    constexpr bool
627      ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2,
628                                      Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});          // since C++20
629
630  template<input_range R1, input_range R2, class Proj1 = identity,
631           class Proj2 = identity,
632           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
633                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
634    constexpr bool
635      ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
636                                      Proj1 proj1 = {}, Proj2 proj2 = {});                          // since C++20
637
638  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
639    requires indirectly_movable<I1, I2>
640    constexpr ranges::move_backward_result<I1, I2>
641      ranges::move_backward(I1 first, S1 last, I2 result);                                          // since C++20
642
643  template<bidirectional_range R, bidirectional_iterator I>
644    requires indirectly_movable<iterator_t<R>, I>
645    constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I>
646      ranges::move_backward(R&& r, I result);                                                       // since C++20
647
648  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
649    requires indirectly_movable<I, O>
650    constexpr ranges::move_result<I, O>
651      ranges::move(I first, S last, O result);                                                      // since C++20
652
653  template<input_range R, weakly_incrementable O>
654    requires indirectly_movable<iterator_t<R>, O>
655    constexpr ranges::move_result<borrowed_iterator_t<R>, O>
656      ranges::move(R&& r, O result);                                                                // since C++20
657
658  template<class I, class O1, class O2>
659      using partition_copy_result = in_out_out_result<I, O1, O2>;                                   // since C++20
660
661  template<input_iterator I, sentinel_for<I> S,
662          weakly_incrementable O1, weakly_incrementable O2,
663          class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
664    requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2>
665    constexpr partition_copy_result<I, O1, O2>
666      partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
667                    Proj proj = {});                                                                // since C++20
668
669  template<input_range R, weakly_incrementable O1, weakly_incrementable O2,
670          class Proj = identity,
671          indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
672    requires indirectly_copyable<iterator_t<R>, O1> &&
673            indirectly_copyable<iterator_t<R>, O2>
674    constexpr partition_copy_result<borrowed_iterator_t<R>, O1, O2>
675      partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {});                  // since C++20
676
677  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
678           indirect_unary_predicate<projected<I, Proj>> Pred>
679    constexpr I partition_point(I first, S last, Pred pred, Proj proj = {});                        // since C++20
680
681  template<forward_range R, class Proj = identity,
682           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
683    constexpr borrowed_iterator_t<R>
684      partition_point(R&& r, Pred pred, Proj proj = {});                                            // since C++20
685
686  template<class I1, class I2, class O>
687    using merge_result = in_in_out_result<I1, I2, O>;                                               // since C++20
688
689  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
690           weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
691           class Proj2 = identity>
692    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
693    constexpr merge_result<I1, I2, O>
694      merge(I1 first1, S1 last1, I2 first2, S2 last2, O result,
695            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
696
697  template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
698           class Proj1 = identity, class Proj2 = identity>
699    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
700    constexpr merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
701      merge(R1&& r1, R2&& r2, O result,
702            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
703
704  template<permutable I, sentinel_for<I> S, class T, class Proj = identity>
705    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
706    constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {});          // since C++20
707
708  template<forward_range R, class T, class Proj = identity>
709    requires permutable<iterator_t<R>> &&
710             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
711    constexpr borrowed_subrange_t<R>
712      ranges::remove(R&& r, const T& value, Proj proj = {});                                        // since C++20
713
714  template<permutable I, sentinel_for<I> S, class Proj = identity,
715           indirect_unary_predicate<projected<I, Proj>> Pred>
716    constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {});            // since C++20
717
718  template<forward_range R, class Proj = identity,
719           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
720    requires permutable<iterator_t<R>>
721    constexpr borrowed_subrange_t<R>
722      ranges::remove_if(R&& r, Pred pred, Proj proj = {});                                          // since C++20
723
724  template<class I, class O>
725    using set_difference_result = in_out_result<I, O>;                                              // since C++20
726
727  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
728           weakly_incrementable O, class Comp = ranges::less,
729           class Proj1 = identity, class Proj2 = identity>
730    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
731    constexpr set_difference_result<I1, O>
732      set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
733                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
734
735  template<input_range R1, input_range R2, weakly_incrementable O,
736           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
737    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
738    constexpr set_difference_result<borrowed_iterator_t<R1>, O>
739      set_difference(R1&& r1, R2&& r2, O result,
740                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
741
742  template<class I1, class I2, class O>
743    using set_intersection_result = in_in_out_result<I1, I2, O>;                                    // since C++20
744
745  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
746           weakly_incrementable O, class Comp = ranges::less,
747           class Proj1 = identity, class Proj2 = identity>
748    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
749    constexpr set_intersection_result<I1, I2, O>
750      set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result,
751                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
752
753  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
754           weakly_incrementable O, class Comp = ranges::less,
755           class Proj1 = identity, class Proj2 = identity>
756    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
757    constexpr set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
758      set_intersection(R1&& r1, R2&& r2, O result,
759                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
760
761  template <class _InIter, class _OutIter>
762  using reverse_copy_result = in_out_result<_InIter, _OutIter>;                                     // since C++20
763
764  template<bidirectional_iterator I, sentinel_for<I> S, weakly_incrementable O>
765    requires indirectly_copyable<I, O>
766    constexpr ranges::reverse_copy_result<I, O>
767      ranges::reverse_copy(I first, S last, O result);                                              // since C++20
768
769  template<bidirectional_range R, weakly_incrementable O>
770    requires indirectly_copyable<iterator_t<R>, O>
771    constexpr ranges::reverse_copy_result<borrowed_iterator_t<R>, O>
772      ranges::reverse_copy(R&& r, O result);                                                        // since C++20
773
774  template<permutable I, sentinel_for<I> S>
775    constexpr subrange<I> rotate(I first, I middle, S last);                                        // since C++20
776
777  template<forward_range R>
778    requires permutable<iterator_t<R>>
779    constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle);                           // since C++20
780
781  template <class _InIter, class _OutIter>
782  using rotate_copy_result = in_out_result<_InIter, _OutIter>;                                      // since C++20
783
784  template<forward_iterator I, sentinel_for<I> S, weakly_incrementable O>
785    requires indirectly_copyable<I, O>
786    constexpr ranges::rotate_copy_result<I, O>
787      ranges::rotate_copy(I first, I middle, S last, O result);                                     // since C++20
788
789  template<forward_range R, weakly_incrementable O>
790    requires indirectly_copyable<iterator_t<R>, O>
791    constexpr ranges::rotate_copy_result<borrowed_iterator_t<R>, O>
792      ranges::rotate_copy(R&& r, iterator_t<R> middle, O result);                                   // since C++20
793
794  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Gen>
795    requires (forward_iterator<I> || random_access_iterator<O>) &&
796            indirectly_copyable<I, O> &&
797            uniform_random_bit_generator<remove_reference_t<Gen>>
798    O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g);                              // since C++20
799
800  template<input_range R, weakly_incrementable O, class Gen>
801    requires (forward_range<R> || random_access_iterator<O>) &&
802            indirectly_copyable<iterator_t<R>, O> &&
803            uniform_random_bit_generator<remove_reference_t<Gen>>
804    O sample(R&& r, O out, range_difference_t<R> n, Gen&& g);                                       // since C++20
805
806  template<random_access_iterator I, sentinel_for<I> S, class Gen>
807    requires permutable<I> &&
808            uniform_random_bit_generator<remove_reference_t<Gen>>
809    I shuffle(I first, S last, Gen&& g);                                                            // since C++20
810
811  template<random_access_range R, class Gen>
812    requires permutable<iterator_t<R>> &&
813            uniform_random_bit_generator<remove_reference_t<Gen>>
814    borrowed_iterator_t<R> shuffle(R&& r, Gen&& g);                                                 // since C++20
815
816  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2,
817         sentinel_for<I2> S2, class Proj1 = identity, class Proj2 = identity,
818         indirect_equivalence_relation<projected<I1, Proj1>,
819                                       projected<I2, Proj2>> Pred = ranges::equal_to>
820  constexpr bool ranges::is_permutation(I1 first1, S1 last1, I2 first2, S2 last2,
821                                        Pred pred = {},
822                                        Proj1 proj1 = {}, Proj2 proj2 = {});                       // since C++20
823
824  template<forward_range R1, forward_range R2,
825         class Proj1 = identity, class Proj2 = identity,
826         indirect_equivalence_relation<projected<iterator_t<R1>, Proj1>,
827                                       projected<iterator_t<R2>, Proj2>> Pred = ranges::equal_to>
828  constexpr bool ranges::is_permutation(R1&& r1, R2&& r2, Pred pred = {},
829                                        Proj1 proj1 = {}, Proj2 proj2 = {});                       // since C++20
830
831  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2,
832           sentinel_for<I2> S2, class Pred = ranges::equal_to,
833           class Proj1 = identity, class Proj2 = identity>
834    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
835    constexpr subrange<I1>
836      ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
837                     Proj1 proj1 = {}, Proj2 proj2 = {});                                           // since C++20
838
839  template<forward_range R1, forward_range R2, class Pred = ranges::equal_to,
840           class Proj1 = identity, class Proj2 = identity>
841    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
842    constexpr borrowed_subrange_t<R1>
843      ranges::search(R1&& r1, R2&& r2, Pred pred = {},
844                     Proj1 proj1 = {}, Proj2 proj2 = {});                                           // since C++20
845
846  template<forward_iterator I, sentinel_for<I> S, class T,
847           class Pred = ranges::equal_to, class Proj = identity>
848    requires indirectly_comparable<I, const T*, Pred, Proj>
849    constexpr subrange<I>
850      ranges::search_n(I first, S last, iter_difference_t<I> count,
851                       const T& value, Pred pred = {}, Proj proj = {});                             // since C++20
852
853  template<forward_range R, class T, class Pred = ranges::equal_to,
854           class Proj = identity>
855    requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj>
856    constexpr borrowed_subrange_t<R>
857      ranges::search_n(R&& r, range_difference_t<R> count,
858                       const T& value, Pred pred = {}, Proj proj = {});                             // since C++20
859
860  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
861           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
862    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
863    constexpr subrange<I1>
864      ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
865                       Proj1 proj1 = {}, Proj2 proj2 = {});                                         // since C++20
866
867  template<forward_range R1, forward_range R2,
868           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
869    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
870    constexpr borrowed_subrange_t<R1>
871      ranges::find_end(R1&& r1, R2&& r2, Pred pred = {},
872                       Proj1 proj1 = {}, Proj2 proj2 = {});                                         // since C++20
873
874  template<class I1, class I2, class O>
875    using set_symmetric_difference_result = in_in_out_result<I1, I2, O>;                            // since C++20
876
877  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
878           weakly_incrementable O, class Comp = ranges::less,
879           class Proj1 = identity, class Proj2 = identity>
880    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
881    constexpr set_symmetric_difference_result<I1, I2, O>
882      set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
883                               Comp comp = {}, Proj1 proj1 = {},
884                               Proj2 proj2 = {});                                                   // since C++20
885
886  template<input_range R1, input_range R2, weakly_incrementable O,
887           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
888    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
889    constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>,
890                                                      borrowed_iterator_t<R2>, O>
891      set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
892                               Proj1 proj1 = {}, Proj2 proj2 = {});                                 // since C++20
893
894  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
895           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
896    constexpr subrange<I>
897      equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {});                 // since C++20
898
899  template<forward_range R, class T, class Proj = identity,
900           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
901             ranges::less>
902    constexpr borrowed_subrange_t<R>
903      equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {});                           // since C++20
904
905  template<class I1, class I2, class O>
906    using set_union_result = in_in_out_result<I1, I2, O>;                                           // since C++20
907
908  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
909           weakly_incrementable O, class Comp = ranges::less,
910           class Proj1 = identity, class Proj2 = identity>
911    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
912    constexpr set_union_result<I1, I2, O>
913      set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
914                Proj1 proj1 = {}, Proj2 proj2 = {});                                                // since C++20
915
916  template<input_range R1, input_range R2, weakly_incrementable O,
917           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
918    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
919    constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
920      set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
921                Proj1 proj1 = {}, Proj2 proj2 = {});                                                // since C++20
922
923  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
924           class Proj1 = identity, class Proj2 = identity,
925           indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
926             ranges::less>
927    constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
928                            Proj1 proj1 = {}, Proj2 proj2 = {});                                   // since C++20
929
930  template<input_range R1, input_range R2, class Proj1 = identity,
931           class Proj2 = identity,
932           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
933                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
934    constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
935                            Proj1 proj1 = {}, Proj2 proj2 = {});                                   // since C++20
936
937  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
938           class Proj = identity>
939    requires sortable<I, Comp, Proj>
940    I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {});                    // since C++20
941
942  template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
943    requires sortable<iterator_t<R>, Comp, Proj>
944    borrowed_iterator_t<R>
945      inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
946                    Proj proj = {});                                                               // since C++20
947
948  template<permutable I, sentinel_for<I> S, class Proj = identity,
949           indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>
950    constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {});                    // since C++20
951
952  template<forward_range R, class Proj = identity,
953           indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
954    requires permutable<iterator_t<R>>
955    constexpr borrowed_subrange_t<R>
956      unique(R&& r, C comp = {}, Proj proj = {});                                                  // since C++20
957
958  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity,
959           indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>
960    requires indirectly_copyable<I, O> &&
961             (forward_iterator<I> ||
962              (input_iterator<O> && same_as<iter_value_t<I>, iter_value_t<O>>) ||
963              indirectly_copyable_storable<I, O>)
964    constexpr unique_copy_result<I, O>
965      unique_copy(I first, S last, O result, C comp = {}, Proj proj = {});                         // since C++20
966
967  template<input_range R, weakly_incrementable O, class Proj = identity,
968           indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
969    requires indirectly_copyable<iterator_t<R>, O> &&
970             (forward_iterator<iterator_t<R>> ||
971              (input_iterator<O> && same_as<range_value_t<R>, iter_value_t<O>>) ||
972              indirectly_copyable_storable<iterator_t<R>, O>)
973    constexpr unique_copy_result<borrowed_iterator_t<R>, O>
974      unique_copy(R&& r, O result, C comp = {}, Proj proj = {});                                   // since C++20
975
976  template<class I, class O>
977      using remove_copy_result = in_out_result<I, O>;                                              // since C++20
978
979  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class T,
980           class Proj = identity>
981             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
982    constexpr remove_copy_result<I, O>
983      remove_copy(I first, S last, O result, const T& value, Proj proj = {});                      // since C++20
984
985  template<input_range R, weakly_incrementable O, class T, class Proj = identity>
986    requires indirectly_copyable<iterator_t<R>, O> &&
987             indirect_binary_predicate<ranges::equal_to,
988                                       projected<iterator_t<R>, Proj>, const T*>
989    constexpr remove_copy_result<borrowed_iterator_t<R>, O>
990      remove_copy(R&& r, O result, const T& value, Proj proj = {});                                // since C++20
991
992  template<class I, class O>
993      using remove_copy_if_result = in_out_result<I, O>;                                           // since C++20
994
995  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O,
996           class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
997    requires indirectly_copyable<I, O>
998    constexpr remove_copy_if_result<I, O>
999      remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {});                        // since C++20
1000
1001  template<input_range R, weakly_incrementable O, class Proj = identity,
1002           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
1003    requires indirectly_copyable<iterator_t<R>, O>
1004    constexpr remove_copy_if_result<borrowed_iterator_t<R>, O>
1005      remove_copy_if(R&& r, O result, Pred pred, Proj proj = {});                                  // since C++20
1006
1007  template<class I, class O>
1008      using replace_copy_result = in_out_result<I, O>;                                             // since C++20
1009
1010  template<input_iterator I, sentinel_for<I> S, class T1, class T2,
1011           output_iterator<const T2&> O, class Proj = identity>
1012    requires indirectly_copyable<I, O> &&
1013             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
1014    constexpr replace_copy_result<I, O>
1015      replace_copy(I first, S last, O result, const T1& old_value, const T2& new_value,
1016                   Proj proj = {});                                                                // since C++20
1017
1018  template<input_range R, class T1, class T2, output_iterator<const T2&> O,
1019           class Proj = identity>
1020    requires indirectly_copyable<iterator_t<R>, O> &&
1021             indirect_binary_predicate<ranges::equal_to,
1022                                       projected<iterator_t<R>, Proj>, const T1*>
1023    constexpr replace_copy_result<borrowed_iterator_t<R>, O>
1024      replace_copy(R&& r, O result, const T1& old_value, const T2& new_value,
1025                   Proj proj = {});                                                                // since C++20
1026
1027  template<class I, class O>
1028      using replace_copy_if_result = in_out_result<I, O>;                                          // since C++20
1029
1030  template<input_iterator I, sentinel_for<I> S, class T, output_iterator<const T&> O,
1031           class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
1032    requires indirectly_copyable<I, O>
1033    constexpr replace_copy_if_result<I, O>
1034      replace_copy_if(I first, S last, O result, Pred pred, const T& new_value,
1035                      Proj proj = {});                                                             // since C++20
1036
1037  template<input_range R, class T, output_iterator<const T&> O, class Proj = identity,
1038           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
1039    requires indirectly_copyable<iterator_t<R>, O>
1040    constexpr replace_copy_if_result<borrowed_iterator_t<R>, O>
1041      replace_copy_if(R&& r, O result, Pred pred, const T& new_value,
1042                      Proj proj = {});                                                             // since C++20
1043
1044  template<class I>
1045    using prev_permutation_result = in_found_result<I>;                                            // since C++20
1046
1047  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1048           class Proj = identity>
1049    requires sortable<I, Comp, Proj>
1050    constexpr ranges::prev_permutation_result<I>
1051      ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
1052
1053  template<bidirectional_range R, class Comp = ranges::less,
1054           class Proj = identity>
1055    requires sortable<iterator_t<R>, Comp, Proj>
1056    constexpr ranges::prev_permutation_result<borrowed_iterator_t<R>>
1057      ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
1058
1059  template<class I>
1060    using next_permutation_result = in_found_result<I>;                                            // since C++20
1061
1062  template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
1063           class Proj = identity>
1064    requires sortable<I, Comp, Proj>
1065    constexpr ranges::next_permutation_result<I>
1066      ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
1067
1068  template<bidirectional_range R, class Comp = ranges::less,
1069           class Proj = identity>
1070    requires sortable<iterator_t<R>, Comp, Proj>
1071    constexpr ranges::next_permutation_result<borrowed_iterator_t<R>>
1072      ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
1073
1074}
1075
1076template <class InputIterator, class Predicate>
1077    constexpr bool     // constexpr in C++20
1078    all_of(InputIterator first, InputIterator last, Predicate pred);
1079
1080template <class InputIterator, class Predicate>
1081    constexpr bool     // constexpr in C++20
1082    any_of(InputIterator first, InputIterator last, Predicate pred);
1083
1084template <class InputIterator, class Predicate>
1085    constexpr bool     // constexpr in C++20
1086    none_of(InputIterator first, InputIterator last, Predicate pred);
1087
1088template <class InputIterator, class Function>
1089    constexpr Function          // constexpr in C++20
1090    for_each(InputIterator first, InputIterator last, Function f);
1091
1092template<class InputIterator, class Size, class Function>
1093    constexpr InputIterator     // constexpr in C++20
1094    for_each_n(InputIterator first, Size n, Function f); // C++17
1095
1096template <class InputIterator, class T>
1097    constexpr InputIterator     // constexpr in C++20
1098    find(InputIterator first, InputIterator last, const T& value);
1099
1100template <class InputIterator, class Predicate>
1101    constexpr InputIterator     // constexpr in C++20
1102    find_if(InputIterator first, InputIterator last, Predicate pred);
1103
1104template<class InputIterator, class Predicate>
1105    constexpr InputIterator     // constexpr in C++20
1106    find_if_not(InputIterator first, InputIterator last, Predicate pred);
1107
1108template <class ForwardIterator1, class ForwardIterator2>
1109    constexpr ForwardIterator1  // constexpr in C++20
1110    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
1111             ForwardIterator2 first2, ForwardIterator2 last2);
1112
1113template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1114    constexpr ForwardIterator1  // constexpr in C++20
1115    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
1116             ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1117
1118template <class ForwardIterator1, class ForwardIterator2>
1119    constexpr ForwardIterator1  // constexpr in C++20
1120    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
1121                  ForwardIterator2 first2, ForwardIterator2 last2);
1122
1123template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1124    constexpr ForwardIterator1  // constexpr in C++20
1125    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
1126                  ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1127
1128template <class ForwardIterator>
1129    constexpr ForwardIterator   // constexpr in C++20
1130    adjacent_find(ForwardIterator first, ForwardIterator last);
1131
1132template <class ForwardIterator, class BinaryPredicate>
1133    constexpr ForwardIterator   // constexpr in C++20
1134    adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1135
1136template <class InputIterator, class T>
1137    constexpr typename iterator_traits<InputIterator>::difference_type  // constexpr in C++20
1138    count(InputIterator first, InputIterator last, const T& value);
1139
1140template <class InputIterator, class Predicate>
1141    constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20
1142    count_if(InputIterator first, InputIterator last, Predicate pred);
1143
1144template <class InputIterator1, class InputIterator2>
1145    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
1146    mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
1147
1148template <class InputIterator1, class InputIterator2>
1149    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
1150    mismatch(InputIterator1 first1, InputIterator1 last1,
1151             InputIterator2 first2, InputIterator2 last2); // **C++14**
1152
1153template <class InputIterator1, class InputIterator2, class BinaryPredicate>
1154    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
1155    mismatch(InputIterator1 first1, InputIterator1 last1,
1156             InputIterator2 first2, BinaryPredicate pred);
1157
1158template <class InputIterator1, class InputIterator2, class BinaryPredicate>
1159    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
1160    mismatch(InputIterator1 first1, InputIterator1 last1,
1161             InputIterator2 first2, InputIterator2 last2,
1162             BinaryPredicate pred); // **C++14**
1163
1164template <class InputIterator1, class InputIterator2>
1165    constexpr bool      // constexpr in C++20
1166    equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
1167
1168template <class InputIterator1, class InputIterator2>
1169    constexpr bool      // constexpr in C++20
1170    equal(InputIterator1 first1, InputIterator1 last1,
1171          InputIterator2 first2, InputIterator2 last2); // **C++14**
1172
1173template <class InputIterator1, class InputIterator2, class BinaryPredicate>
1174    constexpr bool      // constexpr in C++20
1175    equal(InputIterator1 first1, InputIterator1 last1,
1176          InputIterator2 first2, BinaryPredicate pred);
1177
1178template <class InputIterator1, class InputIterator2, class BinaryPredicate>
1179    constexpr bool      // constexpr in C++20
1180    equal(InputIterator1 first1, InputIterator1 last1,
1181          InputIterator2 first2, InputIterator2 last2,
1182          BinaryPredicate pred); // **C++14**
1183
1184template<class ForwardIterator1, class ForwardIterator2>
1185    constexpr bool      // constexpr in C++20
1186    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1187                   ForwardIterator2 first2);
1188
1189template<class ForwardIterator1, class ForwardIterator2>
1190    constexpr bool      // constexpr in C++20
1191    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1192                   ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
1193
1194template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1195    constexpr bool      // constexpr in C++20
1196    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1197                   ForwardIterator2 first2, BinaryPredicate pred);
1198
1199template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1200    constexpr bool      // constexpr in C++20
1201    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
1202                   ForwardIterator2 first2, ForwardIterator2 last2,
1203                   BinaryPredicate pred);  // **C++14**
1204
1205template <class ForwardIterator1, class ForwardIterator2>
1206    constexpr ForwardIterator1      // constexpr in C++20
1207    search(ForwardIterator1 first1, ForwardIterator1 last1,
1208           ForwardIterator2 first2, ForwardIterator2 last2);
1209
1210template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
1211    constexpr ForwardIterator1      // constexpr in C++20
1212    search(ForwardIterator1 first1, ForwardIterator1 last1,
1213           ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1214
1215template <class ForwardIterator, class Size, class T>
1216    constexpr ForwardIterator       // constexpr in C++20
1217    search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
1218
1219template <class ForwardIterator, class Size, class T, class BinaryPredicate>
1220    constexpr ForwardIterator       // constexpr in C++20
1221    search_n(ForwardIterator first, ForwardIterator last,
1222             Size count, const T& value, BinaryPredicate pred);
1223
1224template <class InputIterator, class OutputIterator>
1225    constexpr OutputIterator      // constexpr in C++20
1226    copy(InputIterator first, InputIterator last, OutputIterator result);
1227
1228template<class InputIterator, class OutputIterator, class Predicate>
1229    constexpr OutputIterator      // constexpr in C++20
1230    copy_if(InputIterator first, InputIterator last,
1231            OutputIterator result, Predicate pred);
1232
1233template<class InputIterator, class Size, class OutputIterator>
1234    constexpr OutputIterator      // constexpr in C++20
1235    copy_n(InputIterator first, Size n, OutputIterator result);
1236
1237template <class BidirectionalIterator1, class BidirectionalIterator2>
1238    constexpr BidirectionalIterator2      // constexpr in C++20
1239    copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1240                  BidirectionalIterator2 result);
1241
1242// [alg.move], move
1243template<class InputIterator, class OutputIterator>
1244    constexpr OutputIterator move(InputIterator first, InputIterator last,
1245                                OutputIterator result);
1246
1247template<class BidirectionalIterator1, class BidirectionalIterator2>
1248    constexpr BidirectionalIterator2
1249    move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1250                  BidirectionalIterator2 result);
1251
1252template <class ForwardIterator1, class ForwardIterator2>
1253    constexpr ForwardIterator2    // constexpr in C++20
1254    swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
1255
1256namespace ranges {
1257    template<class I1, class I2>
1258    using swap_ranges_result = in_in_result<I1, I2>;
1259
1260template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2>
1261        requires indirectly_swappable<I1, I2>
1262    constexpr ranges::swap_ranges_result<I1, I2>
1263        swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2);
1264
1265template<input_range R1, input_range R2>
1266        requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>
1267    constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
1268        swap_ranges(R1&& r1, R2&& r2);
1269}
1270
1271template <class ForwardIterator1, class ForwardIterator2>
1272    constexpr void                // constexpr in C++20
1273    iter_swap(ForwardIterator1 a, ForwardIterator2 b);
1274
1275template <class InputIterator, class OutputIterator, class UnaryOperation>
1276    constexpr OutputIterator      // constexpr in C++20
1277    transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
1278
1279template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
1280    constexpr OutputIterator      // constexpr in C++20
1281    transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
1282              OutputIterator result, BinaryOperation binary_op);
1283
1284template <class ForwardIterator, class T>
1285    constexpr void      // constexpr in C++20
1286    replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
1287
1288template <class ForwardIterator, class Predicate, class T>
1289    constexpr void      // constexpr in C++20
1290    replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
1291
1292template <class InputIterator, class OutputIterator, class T>
1293    constexpr OutputIterator      // constexpr in C++20
1294    replace_copy(InputIterator first, InputIterator last, OutputIterator result,
1295                 const T& old_value, const T& new_value);
1296
1297template <class InputIterator, class OutputIterator, class Predicate, class T>
1298    constexpr OutputIterator      // constexpr in C++20
1299    replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
1300
1301template <class ForwardIterator, class T>
1302    constexpr void      // constexpr in C++20
1303    fill(ForwardIterator first, ForwardIterator last, const T& value);
1304
1305template <class OutputIterator, class Size, class T>
1306    constexpr OutputIterator      // constexpr in C++20
1307    fill_n(OutputIterator first, Size n, const T& value);
1308
1309template <class ForwardIterator, class Generator>
1310    constexpr void      // constexpr in C++20
1311    generate(ForwardIterator first, ForwardIterator last, Generator gen);
1312
1313template <class OutputIterator, class Size, class Generator>
1314    constexpr OutputIterator      // constexpr in C++20
1315    generate_n(OutputIterator first, Size n, Generator gen);
1316
1317template <class ForwardIterator, class T>
1318    constexpr ForwardIterator     // constexpr in C++20
1319    remove(ForwardIterator first, ForwardIterator last, const T& value);
1320
1321template <class ForwardIterator, class Predicate>
1322    constexpr ForwardIterator     // constexpr in C++20
1323    remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
1324
1325template <class InputIterator, class OutputIterator, class T>
1326    constexpr OutputIterator     // constexpr in C++20
1327    remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
1328
1329template <class InputIterator, class OutputIterator, class Predicate>
1330    constexpr OutputIterator     // constexpr in C++20
1331    remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
1332
1333template <class ForwardIterator>
1334    constexpr ForwardIterator    // constexpr in C++20
1335    unique(ForwardIterator first, ForwardIterator last);
1336
1337template <class ForwardIterator, class BinaryPredicate>
1338    constexpr ForwardIterator    // constexpr in C++20
1339    unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1340
1341template <class InputIterator, class OutputIterator>
1342    constexpr OutputIterator     // constexpr in C++20
1343    unique_copy(InputIterator first, InputIterator last, OutputIterator result);
1344
1345template <class InputIterator, class OutputIterator, class BinaryPredicate>
1346    constexpr OutputIterator     // constexpr in C++20
1347    unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
1348
1349template <class BidirectionalIterator>
1350    constexpr void               // constexpr in C++20
1351    reverse(BidirectionalIterator first, BidirectionalIterator last);
1352
1353template <class BidirectionalIterator, class OutputIterator>
1354    constexpr OutputIterator       // constexpr in C++20
1355    reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
1356
1357template <class ForwardIterator>
1358    constexpr ForwardIterator      // constexpr in C++20
1359    rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
1360
1361template <class ForwardIterator, class OutputIterator>
1362    constexpr OutputIterator       // constexpr in C++20
1363    rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
1364
1365template <class RandomAccessIterator>
1366    void
1367    random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
1368
1369template <class RandomAccessIterator, class RandomNumberGenerator>
1370    void
1371    random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
1372                   RandomNumberGenerator& rand);  // deprecated in C++14, removed in C++17
1373
1374template<class PopulationIterator, class SampleIterator,
1375         class Distance, class UniformRandomBitGenerator>
1376    SampleIterator sample(PopulationIterator first, PopulationIterator last,
1377                          SampleIterator out, Distance n,
1378                          UniformRandomBitGenerator&& g); // C++17
1379
1380template<class RandomAccessIterator, class UniformRandomNumberGenerator>
1381    void shuffle(RandomAccessIterator first, RandomAccessIterator last,
1382                 UniformRandomNumberGenerator&& g);
1383
1384template<class ForwardIterator>
1385  constexpr ForwardIterator
1386    shift_left(ForwardIterator first, ForwardIterator last,
1387               typename iterator_traits<ForwardIterator>::difference_type n); // C++20
1388
1389template<class ForwardIterator>
1390  constexpr ForwardIterator
1391    shift_right(ForwardIterator first, ForwardIterator last,
1392                typename iterator_traits<ForwardIterator>::difference_type n); // C++20
1393
1394template <class InputIterator, class Predicate>
1395    constexpr bool  // constexpr in C++20
1396    is_partitioned(InputIterator first, InputIterator last, Predicate pred);
1397
1398template <class ForwardIterator, class Predicate>
1399    constexpr ForwardIterator  // constexpr in C++20
1400    partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1401
1402template <class InputIterator, class OutputIterator1,
1403          class OutputIterator2, class Predicate>
1404    constexpr pair<OutputIterator1, OutputIterator2>   // constexpr in C++20
1405    partition_copy(InputIterator first, InputIterator last,
1406                   OutputIterator1 out_true, OutputIterator2 out_false,
1407                   Predicate pred);
1408
1409template <class ForwardIterator, class Predicate>
1410    ForwardIterator
1411    stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1412
1413template<class ForwardIterator, class Predicate>
1414    constexpr ForwardIterator  // constexpr in C++20
1415    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
1416
1417template <class ForwardIterator>
1418    constexpr bool  // constexpr in C++20
1419    is_sorted(ForwardIterator first, ForwardIterator last);
1420
1421template <class ForwardIterator, class Compare>
1422    constexpr bool  // constexpr in C++20
1423    is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1424
1425template<class ForwardIterator>
1426    constexpr ForwardIterator    // constexpr in C++20
1427    is_sorted_until(ForwardIterator first, ForwardIterator last);
1428
1429template <class ForwardIterator, class Compare>
1430    constexpr ForwardIterator    // constexpr in C++20
1431    is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1432
1433template <class RandomAccessIterator>
1434    constexpr void               // constexpr in C++20
1435    sort(RandomAccessIterator first, RandomAccessIterator last);
1436
1437template <class RandomAccessIterator, class Compare>
1438    constexpr void               // constexpr in C++20
1439    sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1440
1441template <class RandomAccessIterator>
1442    void
1443    stable_sort(RandomAccessIterator first, RandomAccessIterator last);
1444
1445template <class RandomAccessIterator, class Compare>
1446    void
1447    stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1448
1449template <class RandomAccessIterator>
1450    constexpr void                    // constexpr in C++20
1451    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
1452
1453template <class RandomAccessIterator, class Compare>
1454    constexpr void                    // constexpr in C++20
1455    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1456
1457template <class InputIterator, class RandomAccessIterator>
1458    constexpr RandomAccessIterator    // constexpr in C++20
1459    partial_sort_copy(InputIterator first, InputIterator last,
1460                      RandomAccessIterator result_first, RandomAccessIterator result_last);
1461
1462template <class InputIterator, class RandomAccessIterator, class Compare>
1463    constexpr RandomAccessIterator    // constexpr in C++20
1464    partial_sort_copy(InputIterator first, InputIterator last,
1465                      RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1466
1467template <class RandomAccessIterator>
1468    constexpr void                    // constexpr in C++20
1469    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
1470
1471template <class RandomAccessIterator, class Compare>
1472    constexpr void                    // constexpr in C++20
1473    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1474
1475template <class ForwardIterator, class T>
1476    constexpr ForwardIterator                         // constexpr in C++20
1477    lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
1478
1479template <class ForwardIterator, class T, class Compare>
1480    constexpr ForwardIterator                         // constexpr in C++20
1481    lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1482
1483template <class ForwardIterator, class T>
1484    constexpr ForwardIterator                         // constexpr in C++20
1485    upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
1486
1487template <class ForwardIterator, class T, class Compare>
1488    constexpr ForwardIterator                         // constexpr in C++20
1489    upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1490
1491template <class ForwardIterator, class T>
1492    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
1493    equal_range(ForwardIterator first, ForwardIterator last, const T& value);
1494
1495template <class ForwardIterator, class T, class Compare>
1496    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
1497    equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1498
1499template <class ForwardIterator, class T>
1500    constexpr bool                                    // constexpr in C++20
1501    binary_search(ForwardIterator first, ForwardIterator last, const T& value);
1502
1503template <class ForwardIterator, class T, class Compare>
1504    constexpr bool                                    // constexpr in C++20
1505    binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1506
1507template <class InputIterator1, class InputIterator2, class OutputIterator>
1508    constexpr OutputIterator                          // constexpr in C++20
1509    merge(InputIterator1 first1, InputIterator1 last1,
1510          InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1511
1512template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1513    constexpr OutputIterator                          // constexpr in C++20
1514    merge(InputIterator1 first1, InputIterator1 last1,
1515          InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1516
1517template <class BidirectionalIterator>
1518    void
1519    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
1520
1521template <class BidirectionalIterator, class Compare>
1522    void
1523    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1524
1525template <class InputIterator1, class InputIterator2>
1526    constexpr bool                                    // constexpr in C++20
1527    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1528
1529template <class InputIterator1, class InputIterator2, class Compare>
1530    constexpr bool                                    // constexpr in C++20
1531    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1532
1533template <class InputIterator1, class InputIterator2, class OutputIterator>
1534    constexpr OutputIterator                          // constexpr in C++20
1535    set_union(InputIterator1 first1, InputIterator1 last1,
1536              InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1537
1538template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1539    constexpr OutputIterator                          // constexpr in C++20
1540    set_union(InputIterator1 first1, InputIterator1 last1,
1541              InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1542
1543template <class InputIterator1, class InputIterator2, class OutputIterator>
1544    constexpr OutputIterator                         // constexpr in C++20
1545    set_intersection(InputIterator1 first1, InputIterator1 last1,
1546                     InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1547
1548template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1549    constexpr OutputIterator                         // constexpr in C++20
1550    set_intersection(InputIterator1 first1, InputIterator1 last1,
1551                     InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1552
1553template <class InputIterator1, class InputIterator2, class OutputIterator>
1554    constexpr OutputIterator                         // constexpr in C++20
1555    set_difference(InputIterator1 first1, InputIterator1 last1,
1556                   InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1557
1558template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1559    constexpr OutputIterator                         // constexpr in C++20
1560    set_difference(InputIterator1 first1, InputIterator1 last1,
1561                   InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1562
1563template <class InputIterator1, class InputIterator2, class OutputIterator>
1564    constexpr OutputIterator                         // constexpr in C++20
1565    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
1566                             InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1567
1568template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1569    constexpr OutputIterator                         // constexpr in C++20
1570    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
1571                             InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1572
1573template <class RandomAccessIterator>
1574    constexpr void                                   // constexpr in C++20
1575    push_heap(RandomAccessIterator first, RandomAccessIterator last);
1576
1577template <class RandomAccessIterator, class Compare>
1578    constexpr void                                   // constexpr in C++20
1579    push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1580
1581template <class RandomAccessIterator>
1582    constexpr void                                   // constexpr in C++20
1583    pop_heap(RandomAccessIterator first, RandomAccessIterator last);
1584
1585template <class RandomAccessIterator, class Compare>
1586    constexpr void                                   // constexpr in C++20
1587    pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1588
1589template <class RandomAccessIterator>
1590    constexpr void                                   // constexpr in C++20
1591    make_heap(RandomAccessIterator first, RandomAccessIterator last);
1592
1593template <class RandomAccessIterator, class Compare>
1594    constexpr void                                   // constexpr in C++20
1595    make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1596
1597template <class RandomAccessIterator>
1598    constexpr void                                   // constexpr in C++20
1599    sort_heap(RandomAccessIterator first, RandomAccessIterator last);
1600
1601template <class RandomAccessIterator, class Compare>
1602    constexpr void                                   // constexpr in C++20
1603    sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1604
1605template <class RandomAccessIterator>
1606    constexpr bool   // constexpr in C++20
1607    is_heap(RandomAccessIterator first, RandomAccessiterator last);
1608
1609template <class RandomAccessIterator, class Compare>
1610    constexpr bool   // constexpr in C++20
1611    is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1612
1613template <class RandomAccessIterator>
1614    constexpr RandomAccessIterator   // constexpr in C++20
1615    is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
1616
1617template <class RandomAccessIterator, class Compare>
1618    constexpr RandomAccessIterator   // constexpr in C++20
1619    is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1620
1621template <class ForwardIterator>
1622    constexpr ForwardIterator        // constexpr in C++14
1623    min_element(ForwardIterator first, ForwardIterator last);
1624
1625template <class ForwardIterator, class Compare>
1626    constexpr ForwardIterator        // constexpr in C++14
1627    min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1628
1629template <class T>
1630    constexpr const T&               // constexpr in C++14
1631    min(const T& a, const T& b);
1632
1633template <class T, class Compare>
1634    constexpr const T&               // constexpr in C++14
1635    min(const T& a, const T& b, Compare comp);
1636
1637template<class T>
1638    constexpr T                      // constexpr in C++14
1639    min(initializer_list<T> t);
1640
1641template<class T, class Compare>
1642    constexpr T                      // constexpr in C++14
1643    min(initializer_list<T> t, Compare comp);
1644
1645template<class T>
1646    constexpr const T& clamp(const T& v, const T& lo, const T& hi);               // C++17
1647
1648template<class T, class Compare>
1649    constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1650
1651template <class ForwardIterator>
1652    constexpr ForwardIterator        // constexpr in C++14
1653    max_element(ForwardIterator first, ForwardIterator last);
1654
1655template <class ForwardIterator, class Compare>
1656    constexpr ForwardIterator        // constexpr in C++14
1657    max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1658
1659template <class T>
1660    constexpr const T&               // constexpr in C++14
1661    max(const T& a, const T& b);
1662
1663template <class T, class Compare>
1664    constexpr const T&               // constexpr in C++14
1665    max(const T& a, const T& b, Compare comp);
1666
1667template<class T>
1668    constexpr T                      // constexpr in C++14
1669    max(initializer_list<T> t);
1670
1671template<class T, class Compare>
1672    constexpr T                      // constexpr in C++14
1673    max(initializer_list<T> t, Compare comp);
1674
1675template<class ForwardIterator>
1676    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1677    minmax_element(ForwardIterator first, ForwardIterator last);
1678
1679template<class ForwardIterator, class Compare>
1680    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1681    minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1682
1683template<class T>
1684    constexpr pair<const T&, const T&>  // constexpr in C++14
1685    minmax(const T& a, const T& b);
1686
1687template<class T, class Compare>
1688    constexpr pair<const T&, const T&>  // constexpr in C++14
1689    minmax(const T& a, const T& b, Compare comp);
1690
1691template<class T>
1692    constexpr pair<T, T>                // constexpr in C++14
1693    minmax(initializer_list<T> t);
1694
1695template<class T, class Compare>
1696    constexpr pair<T, T>                // constexpr in C++14
1697    minmax(initializer_list<T> t, Compare comp);
1698
1699template <class InputIterator1, class InputIterator2>
1700    constexpr bool     // constexpr in C++20
1701    lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1702
1703template <class InputIterator1, class InputIterator2, class Compare>
1704    constexpr bool     // constexpr in C++20
1705    lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
1706                            InputIterator2 first2, InputIterator2 last2, Compare comp);
1707
1708template<class InputIterator1, class InputIterator2, class Cmp>
1709    constexpr auto
1710    lexicographical_compare_three_way(InputIterator1 first1, InputIterator1 last1,
1711                                      InputIterator2 first2, InputIterator2 last2,
1712                                      Cmp comp)
1713      -> decltype(comp(*b1, *b2));                                                        // since C++20
1714
1715template<class InputIterator1, class InputIterator2>
1716    constexpr auto
1717    lexicographical_compare_three_way(InputIterator1 first1, InputIterator1 last1,
1718                                      InputIterator2 first2, InputIterator2 last2);      // since C++20
1719
1720template <class BidirectionalIterator>
1721    constexpr bool     // constexpr in C++20
1722    next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1723
1724template <class BidirectionalIterator, class Compare>
1725    constexpr bool     // constexpr in C++20
1726    next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1727
1728template <class BidirectionalIterator>
1729    constexpr bool     // constexpr in C++20
1730    prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1731
1732template <class BidirectionalIterator, class Compare>
1733    constexpr bool     // constexpr in C++20
1734    prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1735}  // std
1736
1737*/
1738
1739#include <__assert> // all public C++ headers provide the assertion handler
1740#include <__config>
1741#include <cstddef>
1742#include <version>
1743
1744#include <__algorithm/adjacent_find.h>
1745#include <__algorithm/all_of.h>
1746#include <__algorithm/any_of.h>
1747#include <__algorithm/binary_search.h>
1748#include <__algorithm/clamp.h>
1749#include <__algorithm/comp.h>
1750#include <__algorithm/comp_ref_type.h>
1751#include <__algorithm/copy.h>
1752#include <__algorithm/copy_backward.h>
1753#include <__algorithm/copy_if.h>
1754#include <__algorithm/copy_n.h>
1755#include <__algorithm/count.h>
1756#include <__algorithm/count_if.h>
1757#include <__algorithm/equal.h>
1758#include <__algorithm/equal_range.h>
1759#include <__algorithm/fill.h>
1760#include <__algorithm/fill_n.h>
1761#include <__algorithm/find.h>
1762#include <__algorithm/find_end.h>
1763#include <__algorithm/find_first_of.h>
1764#include <__algorithm/find_if.h>
1765#include <__algorithm/find_if_not.h>
1766#include <__algorithm/for_each.h>
1767#include <__algorithm/for_each_n.h>
1768#include <__algorithm/generate.h>
1769#include <__algorithm/generate_n.h>
1770#include <__algorithm/half_positive.h>
1771#include <__algorithm/in_found_result.h>
1772#include <__algorithm/in_fun_result.h>
1773#include <__algorithm/in_in_out_result.h>
1774#include <__algorithm/in_in_result.h>
1775#include <__algorithm/in_out_out_result.h>
1776#include <__algorithm/in_out_result.h>
1777#include <__algorithm/includes.h>
1778#include <__algorithm/inplace_merge.h>
1779#include <__algorithm/is_heap.h>
1780#include <__algorithm/is_heap_until.h>
1781#include <__algorithm/is_partitioned.h>
1782#include <__algorithm/is_permutation.h>
1783#include <__algorithm/is_sorted.h>
1784#include <__algorithm/is_sorted_until.h>
1785#include <__algorithm/iter_swap.h>
1786#include <__algorithm/lexicographical_compare.h>
1787#include <__algorithm/lexicographical_compare_three_way.h>
1788#include <__algorithm/lower_bound.h>
1789#include <__algorithm/make_heap.h>
1790#include <__algorithm/max.h>
1791#include <__algorithm/max_element.h>
1792#include <__algorithm/merge.h>
1793#include <__algorithm/min.h>
1794#include <__algorithm/min_element.h>
1795#include <__algorithm/min_max_result.h>
1796#include <__algorithm/minmax.h>
1797#include <__algorithm/minmax_element.h>
1798#include <__algorithm/mismatch.h>
1799#include <__algorithm/move.h>
1800#include <__algorithm/move_backward.h>
1801#include <__algorithm/next_permutation.h>
1802#include <__algorithm/none_of.h>
1803#include <__algorithm/nth_element.h>
1804#include <__algorithm/partial_sort.h>
1805#include <__algorithm/partial_sort_copy.h>
1806#include <__algorithm/partition.h>
1807#include <__algorithm/partition_copy.h>
1808#include <__algorithm/partition_point.h>
1809#include <__algorithm/pop_heap.h>
1810#include <__algorithm/prev_permutation.h>
1811#include <__algorithm/pstl_any_all_none_of.h>
1812#include <__algorithm/pstl_copy.h>
1813#include <__algorithm/pstl_count.h>
1814#include <__algorithm/pstl_fill.h>
1815#include <__algorithm/pstl_find.h>
1816#include <__algorithm/pstl_for_each.h>
1817#include <__algorithm/pstl_generate.h>
1818#include <__algorithm/pstl_is_partitioned.h>
1819#include <__algorithm/pstl_merge.h>
1820#include <__algorithm/pstl_replace.h>
1821#include <__algorithm/pstl_sort.h>
1822#include <__algorithm/pstl_stable_sort.h>
1823#include <__algorithm/pstl_transform.h>
1824#include <__algorithm/push_heap.h>
1825#include <__algorithm/ranges_adjacent_find.h>
1826#include <__algorithm/ranges_all_of.h>
1827#include <__algorithm/ranges_any_of.h>
1828#include <__algorithm/ranges_binary_search.h>
1829#include <__algorithm/ranges_clamp.h>
1830#include <__algorithm/ranges_copy.h>
1831#include <__algorithm/ranges_copy_backward.h>
1832#include <__algorithm/ranges_copy_if.h>
1833#include <__algorithm/ranges_copy_n.h>
1834#include <__algorithm/ranges_count.h>
1835#include <__algorithm/ranges_count_if.h>
1836#include <__algorithm/ranges_equal.h>
1837#include <__algorithm/ranges_equal_range.h>
1838#include <__algorithm/ranges_fill.h>
1839#include <__algorithm/ranges_fill_n.h>
1840#include <__algorithm/ranges_find.h>
1841#include <__algorithm/ranges_find_end.h>
1842#include <__algorithm/ranges_find_first_of.h>
1843#include <__algorithm/ranges_find_if.h>
1844#include <__algorithm/ranges_find_if_not.h>
1845#include <__algorithm/ranges_for_each.h>
1846#include <__algorithm/ranges_for_each_n.h>
1847#include <__algorithm/ranges_generate.h>
1848#include <__algorithm/ranges_generate_n.h>
1849#include <__algorithm/ranges_includes.h>
1850#include <__algorithm/ranges_inplace_merge.h>
1851#include <__algorithm/ranges_is_heap.h>
1852#include <__algorithm/ranges_is_heap_until.h>
1853#include <__algorithm/ranges_is_partitioned.h>
1854#include <__algorithm/ranges_is_permutation.h>
1855#include <__algorithm/ranges_is_sorted.h>
1856#include <__algorithm/ranges_is_sorted_until.h>
1857#include <__algorithm/ranges_lexicographical_compare.h>
1858#include <__algorithm/ranges_lower_bound.h>
1859#include <__algorithm/ranges_make_heap.h>
1860#include <__algorithm/ranges_max.h>
1861#include <__algorithm/ranges_max_element.h>
1862#include <__algorithm/ranges_merge.h>
1863#include <__algorithm/ranges_min.h>
1864#include <__algorithm/ranges_min_element.h>
1865#include <__algorithm/ranges_minmax.h>
1866#include <__algorithm/ranges_minmax_element.h>
1867#include <__algorithm/ranges_mismatch.h>
1868#include <__algorithm/ranges_move.h>
1869#include <__algorithm/ranges_move_backward.h>
1870#include <__algorithm/ranges_next_permutation.h>
1871#include <__algorithm/ranges_none_of.h>
1872#include <__algorithm/ranges_nth_element.h>
1873#include <__algorithm/ranges_partial_sort.h>
1874#include <__algorithm/ranges_partial_sort_copy.h>
1875#include <__algorithm/ranges_partition.h>
1876#include <__algorithm/ranges_partition_copy.h>
1877#include <__algorithm/ranges_partition_point.h>
1878#include <__algorithm/ranges_pop_heap.h>
1879#include <__algorithm/ranges_prev_permutation.h>
1880#include <__algorithm/ranges_push_heap.h>
1881#include <__algorithm/ranges_remove.h>
1882#include <__algorithm/ranges_remove_copy.h>
1883#include <__algorithm/ranges_remove_copy_if.h>
1884#include <__algorithm/ranges_remove_if.h>
1885#include <__algorithm/ranges_replace.h>
1886#include <__algorithm/ranges_replace_copy.h>
1887#include <__algorithm/ranges_replace_copy_if.h>
1888#include <__algorithm/ranges_replace_if.h>
1889#include <__algorithm/ranges_reverse.h>
1890#include <__algorithm/ranges_reverse_copy.h>
1891#include <__algorithm/ranges_rotate.h>
1892#include <__algorithm/ranges_rotate_copy.h>
1893#include <__algorithm/ranges_sample.h>
1894#include <__algorithm/ranges_search.h>
1895#include <__algorithm/ranges_search_n.h>
1896#include <__algorithm/ranges_set_difference.h>
1897#include <__algorithm/ranges_set_intersection.h>
1898#include <__algorithm/ranges_set_symmetric_difference.h>
1899#include <__algorithm/ranges_set_union.h>
1900#include <__algorithm/ranges_shuffle.h>
1901#include <__algorithm/ranges_sort.h>
1902#include <__algorithm/ranges_sort_heap.h>
1903#include <__algorithm/ranges_stable_partition.h>
1904#include <__algorithm/ranges_stable_sort.h>
1905#include <__algorithm/ranges_starts_with.h>
1906#include <__algorithm/ranges_swap_ranges.h>
1907#include <__algorithm/ranges_transform.h>
1908#include <__algorithm/ranges_unique.h>
1909#include <__algorithm/ranges_unique_copy.h>
1910#include <__algorithm/ranges_upper_bound.h>
1911#include <__algorithm/remove.h>
1912#include <__algorithm/remove_copy.h>
1913#include <__algorithm/remove_copy_if.h>
1914#include <__algorithm/remove_if.h>
1915#include <__algorithm/replace.h>
1916#include <__algorithm/replace_copy.h>
1917#include <__algorithm/replace_copy_if.h>
1918#include <__algorithm/replace_if.h>
1919#include <__algorithm/reverse.h>
1920#include <__algorithm/reverse_copy.h>
1921#include <__algorithm/rotate.h>
1922#include <__algorithm/rotate_copy.h>
1923#include <__algorithm/sample.h>
1924#include <__algorithm/search.h>
1925#include <__algorithm/search_n.h>
1926#include <__algorithm/set_difference.h>
1927#include <__algorithm/set_intersection.h>
1928#include <__algorithm/set_symmetric_difference.h>
1929#include <__algorithm/set_union.h>
1930#include <__algorithm/shift_left.h>
1931#include <__algorithm/shift_right.h>
1932#include <__algorithm/shuffle.h>
1933#include <__algorithm/sift_down.h>
1934#include <__algorithm/sort.h>
1935#include <__algorithm/sort_heap.h>
1936#include <__algorithm/stable_partition.h>
1937#include <__algorithm/stable_sort.h>
1938#include <__algorithm/swap_ranges.h>
1939#include <__algorithm/transform.h>
1940#include <__algorithm/unique.h>
1941#include <__algorithm/unique_copy.h>
1942#include <__algorithm/unwrap_iter.h>
1943#include <__algorithm/upper_bound.h>
1944
1945// standard-mandated includes
1946
1947// [algorithm.syn]
1948#include <initializer_list>
1949
1950#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
1951#  pragma GCC system_header
1952#endif
1953
1954#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20
1955#  include <atomic>
1956#  include <bit>
1957#  include <concepts>
1958#  include <cstdlib>
1959#  include <cstring>
1960#  include <iterator>
1961#  include <memory>
1962#  include <stdexcept>
1963#  include <type_traits>
1964#  include <utility>
1965#endif
1966
1967#endif // _LIBCPP_ALGORITHM
1968