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