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<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
364           class Proj = identity>
365    requires sortable<I, Comp, Proj>
366    constexpr I
367      ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {});      // since C++20
368
369  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
370    requires sortable<iterator_t<R>, Comp, Proj>
371    constexpr borrowed_iterator_t<R>
372      ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {});    // since C++20
373
374  template<class T, output_iterator<const T&> O, sentinel_for<O> S>
375    constexpr O ranges::fill(O first, S last, const T& value);                              // since C++20
376
377  template<class T, output_range<const T&> R>
378    constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value);                   // since C++20
379
380  template<class T, output_iterator<const T&> O>
381    constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value);            // since C++20
382
383 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
384          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
385   requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
386   constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2,
387                                Pred pred = {},
388                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
389
390 template<input_range R1, input_range R2, class Pred = ranges::equal_to,
391          class Proj1 = identity, class Proj2 = identity>
392   requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
393   constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
394                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
395
396  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
397           indirect_unary_predicate<projected<I, Proj>> Pred>
398    constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
399
400  template<input_range R, class Proj = identity,
401           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
402    constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {});                // since C++20
403
404  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
405           indirect_unary_predicate<projected<I, Proj>> Pred>
406    constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
407
408  template<input_range R, class Proj = identity,
409           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
410    constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {});                // since C++20
411
412  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
413           indirect_unary_predicate<projected<I, Proj>> Pred>
414    constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {});     // since C++20
415
416  template<input_range R, class Proj = identity,
417           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
418    constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {});               // since C++20
419
420  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
421           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
422    constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});      // since C++20
423
424  template<forward_range R, class Proj = identity,
425           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
426    constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});                // since C++20
427
428  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
429           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
430    constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});   // since C++20
431
432  template<forward_range R, class Proj = identity,
433           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
434    constexpr borrowed_iterator_t<R>
435      ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});                       // since C++20
436
437  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
438          class Proj = identity>
439    requires sortable<I, Comp, Proj>
440    constexpr I
441      ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {});            // since C++20
442
443  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
444    requires sortable<iterator_t<R>, Comp, Proj>
445    constexpr borrowed_iterator_t<R>
446      ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {});          // since C++20
447
448  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
449           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
450    constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
451
452  template<forward_range R, class T, class Proj = identity,
453           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
454             ranges::less>
455    constexpr borrowed_iterator_t<R>
456      upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
457
458  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
459           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
460    constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
461                                    Proj proj = {});                                          // since C++20
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 borrowed_iterator_t<R>
466      lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
467
468  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
469           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
470    constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
471                                         Proj proj = {});                                     // since C++20
472
473  template<forward_range R, class T, class Proj = identity,
474           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
475             ranges::less>
476    constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
477                                         Proj proj = {});                                     // since C++20
478
479  template<permutable I, sentinel_for<I> S, class Proj = identity,
480           indirect_unary_predicate<projected<I, Proj>> Pred>
481    constexpr subrange<I>
482      partition(I first, S last, Pred pred, Proj proj = {});                                  // Since C++20
483
484  template<forward_range R, class Proj = identity,
485           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
486    requires permutable<iterator_t<R>>
487    constexpr borrowed_subrange_t<R>
488      partition(R&& r, Pred pred, Proj proj = {});                                            // Since C++20
489
490  template<bidirectional_iterator I, sentinel_for<I> S, class Proj = identity,
491           indirect_unary_predicate<projected<I, Proj>> Pred>
492    requires permutable<I>
493    subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {});                 // Since C++20
494
495  template<bidirectional_range R, class Proj = identity,
496           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
497    requires permutable<iterator_t<R>>
498    borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {});                // Since C++20
499
500  template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
501           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
502    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
503    constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
504                                       Pred pred = {},
505                                       Proj1 proj1 = {}, Proj2 proj2 = {});                 // since C++20
506
507  template<input_range R1, forward_range R2,
508           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
509    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
510    constexpr borrowed_iterator_t<R1>
511      ranges::find_first_of(R1&& r1, R2&& r2,
512                            Pred pred = {},
513                            Proj1 proj1 = {}, Proj2 proj2 = {});                            // since C++20
514
515  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
516           indirect_binary_predicate<projected<I, Proj>,
517                                     projected<I, Proj>> Pred = ranges::equal_to>
518    constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {});     // since C+20
519
520  template<forward_range R, class Proj = identity,
521           indirect_binary_predicate<projected<iterator_t<R>, Proj>,
522                                     projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
523    constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {});  // since C++20
524
525  template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity>
526    requires indirectly_writable<I, const T2&> &&
527             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
528    constexpr I
529      ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {});   // since C++20
530
531  template<input_range R, class T1, class T2, class Proj = identity>
532    requires indirectly_writable<iterator_t<R>, const T2&> &&
533             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
534    constexpr borrowed_iterator_t<R>
535      ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {});             // since C++20
536
537  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity,
538           indirect_unary_predicate<projected<I, Proj>> Pred>
539    requires indirectly_writable<I, const T&>
540    constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
541
542  template<input_range R, class T, class Proj = identity,
543           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
544    requires indirectly_writable<iterator_t<R>, const T&>
545    constexpr borrowed_iterator_t<R>
546      ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {});                     // since C++20
547
548  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
549           class Proj1 = identity, class Proj2 = identity,
550           indirect_strict_weak_order<projected<I1, Proj1>,
551                                      projected<I2, Proj2>> Comp = ranges::less>
552    constexpr bool
553      ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2,
554                                      Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});    // since C++20
555
556  template<input_range R1, input_range R2, class Proj1 = identity,
557           class Proj2 = identity,
558           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
559                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
560    constexpr bool
561      ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
562                                      Proj1 proj1 = {}, Proj2 proj2 = {});                    // since C++20
563
564  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
565    requires indirectly_movable<I1, I2>
566    constexpr ranges::move_backward_result<I1, I2>
567      ranges::move_backward(I1 first, S1 last, I2 result);                                          // since C++20
568
569  template<bidirectional_range R, bidirectional_iterator I>
570    requires indirectly_movable<iterator_t<R>, I>
571    constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I>
572      ranges::move_backward(R&& r, I result);                                                       // since C++20
573
574  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
575    requires indirectly_movable<I, O>
576    constexpr ranges::move_result<I, O>
577      ranges::move(I first, S last, O result);                                                      // since C++20
578
579  template<input_range R, weakly_incrementable O>
580    requires indirectly_movable<iterator_t<R>, O>
581    constexpr ranges::move_result<borrowed_iterator_t<R>, O>
582      ranges::move(R&& r, O result);                                                                // since C++20
583
584  template<class I, class O1, class O2>
585      using partition_copy_result = in_out_out_result<I, O1, O2>;                                   // since C++20
586
587  template<input_iterator I, sentinel_for<I> S,
588          weakly_incrementable O1, weakly_incrementable O2,
589          class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
590    requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2>
591    constexpr partition_copy_result<I, O1, O2>
592      partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
593                    Proj proj = {});                                                                // Since C++20
594
595  template<input_range R, weakly_incrementable O1, weakly_incrementable O2,
596          class Proj = identity,
597          indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
598    requires indirectly_copyable<iterator_t<R>, O1> &&
599            indirectly_copyable<iterator_t<R>, O2>
600    constexpr partition_copy_result<borrowed_iterator_t<R>, O1, O2>
601      partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {});                  // Since C++20
602
603  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
604           indirect_unary_predicate<projected<I, Proj>> Pred>
605    constexpr I partition_point(I first, S last, Pred pred, Proj proj = {});                        // Since C++20
606
607  template<forward_range R, class Proj = identity,
608           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
609    constexpr borrowed_iterator_t<R>
610      partition_point(R&& r, Pred pred, Proj proj = {});                                            // Since C++20
611
612  template<class I1, class I2, class O>
613    using merge_result = in_in_out_result<I1, I2, O>;                                               // since C++20
614
615  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
616           weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
617           class Proj2 = identity>
618    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
619    constexpr merge_result<I1, I2, O>
620      merge(I1 first1, S1 last1, I2 first2, S2 last2, O result,
621            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
622
623  template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
624           class Proj1 = identity, class Proj2 = identity>
625    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
626    constexpr merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
627      merge(R1&& r1, R2&& r2, O result,
628            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
629
630  template<permutable I, sentinel_for<I> S, class T, class Proj = identity>
631    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
632    constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {});          // since C++20
633
634  template<forward_range R, class T, class Proj = identity>
635    requires permutable<iterator_t<R>> &&
636             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
637    constexpr borrowed_subrange_t<R>
638      ranges::remove(R&& r, const T& value, Proj proj = {});                                        // since C++20
639
640  template<permutable I, sentinel_for<I> S, class Proj = identity,
641           indirect_unary_predicate<projected<I, Proj>> Pred>
642    constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {});            // since C++20
643
644  template<forward_range R, class Proj = identity,
645           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
646    requires permutable<iterator_t<R>>
647    constexpr borrowed_subrange_t<R>
648      ranges::remove_if(R&& r, Pred pred, Proj proj = {});                                          // since C++20
649
650  template<class I, class O>
651    using set_difference_result = in_out_result<I, O>;                                              // since C++20
652
653  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
654           weakly_incrementable O, class Comp = ranges::less,
655           class Proj1 = identity, class Proj2 = identity>
656    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
657    constexpr set_difference_result<I1, O>
658      set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
659                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
660
661  template<input_range R1, input_range R2, weakly_incrementable O,
662           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
663    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
664    constexpr set_difference_result<borrowed_iterator_t<R1>, O>
665      set_difference(R1&& r1, R2&& r2, O result,
666                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
667
668  template<class I1, class I2, class O>
669    using set_intersection_result = in_in_out_result<I1, I2, O>;                                    // since C++20
670
671  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
672           weakly_incrementable O, class Comp = ranges::less,
673           class Proj1 = identity, class Proj2 = identity>
674    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
675    constexpr set_intersection_result<I1, I2, O>
676      set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result,
677                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
678
679  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
680           weakly_incrementable O, class Comp = ranges::less,
681           class Proj1 = identity, class Proj2 = identity>
682    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
683    constexpr set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
684      set_intersection(R1&& r1, R2&& r2, O result,
685                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
686
687  template <class _InIter, class _OutIter>
688  using reverse_copy_result = in_out_result<_InIter, _OutIter>;                                     // since C++20
689
690  template<bidirectional_iterator I, sentinel_for<I> S, weakly_incrementable O>
691    requires indirectly_copyable<I, O>
692    constexpr ranges::reverse_copy_result<I, O>
693      ranges::reverse_copy(I first, S last, O result);                                              // since C++20
694
695  template<bidirectional_range R, weakly_incrementable O>
696    requires indirectly_copyable<iterator_t<R>, O>
697    constexpr ranges::reverse_copy_result<borrowed_iterator_t<R>, O>
698      ranges::reverse_copy(R&& r, O result);                                                        // since C++20
699
700  template <class _InIter, class _OutIter>
701  using rotate_copy_result = in_out_result<_InIter, _OutIter>;                                      // since C++20
702
703  template<forward_iterator I, sentinel_for<I> S, weakly_incrementable O>
704    requires indirectly_copyable<I, O>
705    constexpr ranges::rotate_copy_result<I, O>
706      ranges::rotate_copy(I first, I middle, S last, O result);                                     // since C++20
707
708  template<forward_range R, weakly_incrementable O>
709    requires indirectly_copyable<iterator_t<R>, O>
710    constexpr ranges::rotate_copy_result<borrowed_iterator_t<R>, O>
711      ranges::rotate_copy(R&& r, iterator_t<R> middle, O result);                                   // since C++20
712
713  template<random_access_iterator I, sentinel_for<I> S, class Gen>
714    requires permutable<I> &&
715            uniform_random_bit_generator<remove_reference_t<Gen>>
716    I shuffle(I first, S last, Gen&& g);                                                           // Since C++20
717
718  template<random_access_range R, class Gen>
719    requires permutable<iterator_t<R>> &&
720            uniform_random_bit_generator<remove_reference_t<Gen>>
721    borrowed_iterator_t<R> shuffle(R&& r, Gen&& g);                                                // Since C++20
722
723  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2,
724           sentinel_for<I2> S2, class Pred = ranges::equal_to,
725           class Proj1 = identity, class Proj2 = identity>
726    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
727    constexpr subrange<I1>
728      ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
729                     Proj1 proj1 = {}, Proj2 proj2 = {});                                           // since C++20
730
731  template<forward_range R1, forward_range R2, class Pred = ranges::equal_to,
732           class Proj1 = identity, class Proj2 = identity>
733    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
734    constexpr borrowed_subrange_t<R1>
735      ranges::search(R1&& r1, R2&& r2, Pred pred = {},
736                     Proj1 proj1 = {}, Proj2 proj2 = {});                                           // since C++20
737
738  template<forward_iterator I, sentinel_for<I> S, class T,
739           class Pred = ranges::equal_to, class Proj = identity>
740    requires indirectly_comparable<I, const T*, Pred, Proj>
741    constexpr subrange<I>
742      ranges::search_n(I first, S last, iter_difference_t<I> count,
743                       const T& value, Pred pred = {}, Proj proj = {});                             // since C++20
744
745  template<forward_range R, class T, class Pred = ranges::equal_to,
746           class Proj = identity>
747    requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj>
748    constexpr borrowed_subrange_t<R>
749      ranges::search_n(R&& r, range_difference_t<R> count,
750                       const T& value, Pred pred = {}, Proj proj = {});                             // since C++20
751
752  template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
753           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
754    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
755    constexpr subrange<I1>
756      ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
757                       Proj1 proj1 = {}, Proj2 proj2 = {});                                         // since C++20
758
759  template<forward_range R1, forward_range R2,
760           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
761    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
762    constexpr borrowed_subrange_t<R1>
763      ranges::find_end(R1&& r1, R2&& r2, Pred pred = {},
764                       Proj1 proj1 = {}, Proj2 proj2 = {});                                         // since C++20
765
766  template<class I1, class I2, class O>
767    using set_symmetric_difference_result = in_in_out_result<I1, I2, O>;                            // since C++20
768
769  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
770           weakly_incrementable O, class Comp = ranges::less,
771           class Proj1 = identity, class Proj2 = identity>
772    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
773    constexpr set_symmetric_difference_result<I1, I2, O>
774      set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
775                               Comp comp = {}, Proj1 proj1 = {},
776                               Proj2 proj2 = {});                                                   // since C++20
777
778  template<input_range R1, input_range R2, weakly_incrementable O,
779           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
780    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
781    constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>,
782                                                      borrowed_iterator_t<R2>, O>
783      set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
784                               Proj1 proj1 = {}, Proj2 proj2 = {});                                 // since C++20
785
786  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
787           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
788    constexpr subrange<I>
789      equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {});                 // since C++20
790
791  template<forward_range R, class T, class Proj = identity,
792           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
793             ranges::less>
794    constexpr borrowed_subrange_t<R>
795      equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {});                           // since C++20
796
797  template<class I1, class I2, class O>
798    using set_union_result = in_in_out_result<I1, I2, O>;                                           // since C++20
799
800  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
801           weakly_incrementable O, class Comp = ranges::less,
802           class Proj1 = identity, class Proj2 = identity>
803    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
804    constexpr set_union_result<I1, I2, O>
805      set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
806                Proj1 proj1 = {}, Proj2 proj2 = {});                                                // since C++20
807
808  template<input_range R1, input_range R2, weakly_incrementable O,
809           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
810    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
811    constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
812      set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
813                Proj1 proj1 = {}, Proj2 proj2 = {});                                                // since C++20
814
815  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
816           class Proj1 = identity, class Proj2 = identity,
817           indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp =
818             ranges::less>
819    constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
820                            Proj1 proj1 = {}, Proj2 proj2 = {});                                   // Since C++20
821
822  template<input_range R1, input_range R2, class Proj1 = identity,
823           class Proj2 = identity,
824           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
825                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
826    constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {},
827                            Proj1 proj1 = {}, Proj2 proj2 = {});                                   // Since C++20
828}
829
830    constexpr bool     // constexpr in C++20
831    all_of(InputIterator first, InputIterator last, Predicate pred);
832
833template <class InputIterator, class Predicate>
834    constexpr bool     // constexpr in C++20
835    any_of(InputIterator first, InputIterator last, Predicate pred);
836
837template <class InputIterator, class Predicate>
838    constexpr bool     // constexpr in C++20
839    none_of(InputIterator first, InputIterator last, Predicate pred);
840
841template <class InputIterator, class Function>
842    constexpr Function          // constexpr in C++20
843    for_each(InputIterator first, InputIterator last, Function f);
844
845template<class InputIterator, class Size, class Function>
846    constexpr InputIterator     // constexpr in C++20
847    for_each_n(InputIterator first, Size n, Function f); // C++17
848
849template <class InputIterator, class T>
850    constexpr InputIterator     // constexpr in C++20
851    find(InputIterator first, InputIterator last, const T& value);
852
853template <class InputIterator, class Predicate>
854    constexpr InputIterator     // constexpr in C++20
855    find_if(InputIterator first, InputIterator last, Predicate pred);
856
857template<class InputIterator, class Predicate>
858    constexpr InputIterator     // constexpr in C++20
859    find_if_not(InputIterator first, InputIterator last, Predicate pred);
860
861template <class ForwardIterator1, class ForwardIterator2>
862    constexpr ForwardIterator1  // constexpr in C++20
863    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
864             ForwardIterator2 first2, ForwardIterator2 last2);
865
866template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
867    constexpr ForwardIterator1  // constexpr in C++20
868    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
869             ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
870
871template <class ForwardIterator1, class ForwardIterator2>
872    constexpr ForwardIterator1  // constexpr in C++20
873    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
874                  ForwardIterator2 first2, ForwardIterator2 last2);
875
876template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
877    constexpr ForwardIterator1  // constexpr in C++20
878    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
879                  ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
880
881template <class ForwardIterator>
882    constexpr ForwardIterator   // constexpr in C++20
883    adjacent_find(ForwardIterator first, ForwardIterator last);
884
885template <class ForwardIterator, class BinaryPredicate>
886    constexpr ForwardIterator   // constexpr in C++20
887    adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
888
889template <class InputIterator, class T>
890    constexpr typename iterator_traits<InputIterator>::difference_type  // constexpr in C++20
891    count(InputIterator first, InputIterator last, const T& value);
892
893template <class InputIterator, class Predicate>
894    constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20
895    count_if(InputIterator first, InputIterator last, Predicate pred);
896
897template <class InputIterator1, class InputIterator2>
898    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
899    mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
900
901template <class InputIterator1, class InputIterator2>
902    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
903    mismatch(InputIterator1 first1, InputIterator1 last1,
904             InputIterator2 first2, InputIterator2 last2); // **C++14**
905
906template <class InputIterator1, class InputIterator2, class BinaryPredicate>
907    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
908    mismatch(InputIterator1 first1, InputIterator1 last1,
909             InputIterator2 first2, BinaryPredicate pred);
910
911template <class InputIterator1, class InputIterator2, class BinaryPredicate>
912    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
913    mismatch(InputIterator1 first1, InputIterator1 last1,
914             InputIterator2 first2, InputIterator2 last2,
915             BinaryPredicate pred); // **C++14**
916
917template <class InputIterator1, class InputIterator2>
918    constexpr bool      // constexpr in C++20
919    equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
920
921template <class InputIterator1, class InputIterator2>
922    constexpr bool      // constexpr in C++20
923    equal(InputIterator1 first1, InputIterator1 last1,
924          InputIterator2 first2, InputIterator2 last2); // **C++14**
925
926template <class InputIterator1, class InputIterator2, class BinaryPredicate>
927    constexpr bool      // constexpr in C++20
928    equal(InputIterator1 first1, InputIterator1 last1,
929          InputIterator2 first2, BinaryPredicate pred);
930
931template <class InputIterator1, class InputIterator2, class BinaryPredicate>
932    constexpr bool      // constexpr in C++20
933    equal(InputIterator1 first1, InputIterator1 last1,
934          InputIterator2 first2, InputIterator2 last2,
935          BinaryPredicate pred); // **C++14**
936
937template<class ForwardIterator1, class ForwardIterator2>
938    constexpr bool      // constexpr in C++20
939    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
940                   ForwardIterator2 first2);
941
942template<class ForwardIterator1, class ForwardIterator2>
943    constexpr bool      // constexpr in C++20
944    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
945                   ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
946
947template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
948    constexpr bool      // constexpr in C++20
949    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
950                   ForwardIterator2 first2, BinaryPredicate pred);
951
952template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
953    constexpr bool      // constexpr in C++20
954    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
955                   ForwardIterator2 first2, ForwardIterator2 last2,
956                   BinaryPredicate pred);  // **C++14**
957
958template <class ForwardIterator1, class ForwardIterator2>
959    constexpr ForwardIterator1      // constexpr in C++20
960    search(ForwardIterator1 first1, ForwardIterator1 last1,
961           ForwardIterator2 first2, ForwardIterator2 last2);
962
963template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
964    constexpr ForwardIterator1      // constexpr in C++20
965    search(ForwardIterator1 first1, ForwardIterator1 last1,
966           ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
967
968template <class ForwardIterator, class Size, class T>
969    constexpr ForwardIterator       // constexpr in C++20
970    search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
971
972template <class ForwardIterator, class Size, class T, class BinaryPredicate>
973    constexpr ForwardIterator       // constexpr in C++20
974    search_n(ForwardIterator first, ForwardIterator last,
975             Size count, const T& value, BinaryPredicate pred);
976
977template <class InputIterator, class OutputIterator>
978    constexpr OutputIterator      // constexpr in C++20
979    copy(InputIterator first, InputIterator last, OutputIterator result);
980
981template<class InputIterator, class OutputIterator, class Predicate>
982    constexpr OutputIterator      // constexpr in C++20
983    copy_if(InputIterator first, InputIterator last,
984            OutputIterator result, Predicate pred);
985
986template<class InputIterator, class Size, class OutputIterator>
987    constexpr OutputIterator      // constexpr in C++20
988    copy_n(InputIterator first, Size n, OutputIterator result);
989
990template <class BidirectionalIterator1, class BidirectionalIterator2>
991    constexpr BidirectionalIterator2      // constexpr in C++20
992    copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
993                  BidirectionalIterator2 result);
994
995// [alg.move], move
996template<class InputIterator, class OutputIterator>
997    constexpr OutputIterator move(InputIterator first, InputIterator last,
998                                OutputIterator result);
999
1000template<class BidirectionalIterator1, class BidirectionalIterator2>
1001    constexpr BidirectionalIterator2
1002    move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1003                  BidirectionalIterator2 result);
1004
1005template <class ForwardIterator1, class ForwardIterator2>
1006    constexpr ForwardIterator2    // constexpr in C++20
1007    swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
1008
1009namespace ranges {
1010    template<class I1, class I2>
1011    using swap_ranges_result = in_in_result<I1, I2>;
1012
1013template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2>
1014        requires indirectly_swappable<I1, I2>
1015    constexpr ranges::swap_ranges_result<I1, I2>
1016        swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2);
1017
1018template<input_range R1, input_range R2>
1019        requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>
1020    constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
1021        swap_ranges(R1&& r1, R2&& r2);
1022}
1023
1024template <class ForwardIterator1, class ForwardIterator2>
1025    constexpr void                // constexpr in C++20
1026    iter_swap(ForwardIterator1 a, ForwardIterator2 b);
1027
1028template <class InputIterator, class OutputIterator, class UnaryOperation>
1029    constexpr OutputIterator      // constexpr in C++20
1030    transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
1031
1032template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
1033    constexpr OutputIterator      // constexpr in C++20
1034    transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
1035              OutputIterator result, BinaryOperation binary_op);
1036
1037template <class ForwardIterator, class T>
1038    constexpr void      // constexpr in C++20
1039    replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
1040
1041template <class ForwardIterator, class Predicate, class T>
1042    constexpr void      // constexpr in C++20
1043    replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
1044
1045template <class InputIterator, class OutputIterator, class T>
1046    constexpr OutputIterator      // constexpr in C++20
1047    replace_copy(InputIterator first, InputIterator last, OutputIterator result,
1048                 const T& old_value, const T& new_value);
1049
1050template <class InputIterator, class OutputIterator, class Predicate, class T>
1051    constexpr OutputIterator      // constexpr in C++20
1052    replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
1053
1054template <class ForwardIterator, class T>
1055    constexpr void      // constexpr in C++20
1056    fill(ForwardIterator first, ForwardIterator last, const T& value);
1057
1058template <class OutputIterator, class Size, class T>
1059    constexpr OutputIterator      // constexpr in C++20
1060    fill_n(OutputIterator first, Size n, const T& value);
1061
1062template <class ForwardIterator, class Generator>
1063    constexpr void      // constexpr in C++20
1064    generate(ForwardIterator first, ForwardIterator last, Generator gen);
1065
1066template <class OutputIterator, class Size, class Generator>
1067    constexpr OutputIterator      // constexpr in C++20
1068    generate_n(OutputIterator first, Size n, Generator gen);
1069
1070template <class ForwardIterator, class T>
1071    constexpr ForwardIterator     // constexpr in C++20
1072    remove(ForwardIterator first, ForwardIterator last, const T& value);
1073
1074template <class ForwardIterator, class Predicate>
1075    constexpr ForwardIterator     // constexpr in C++20
1076    remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
1077
1078template <class InputIterator, class OutputIterator, class T>
1079    constexpr OutputIterator     // constexpr in C++20
1080    remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
1081
1082template <class InputIterator, class OutputIterator, class Predicate>
1083    constexpr OutputIterator     // constexpr in C++20
1084    remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
1085
1086template <class ForwardIterator>
1087    constexpr ForwardIterator    // constexpr in C++20
1088    unique(ForwardIterator first, ForwardIterator last);
1089
1090template <class ForwardIterator, class BinaryPredicate>
1091    constexpr ForwardIterator    // constexpr in C++20
1092    unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1093
1094template <class InputIterator, class OutputIterator>
1095    constexpr OutputIterator     // constexpr in C++20
1096    unique_copy(InputIterator first, InputIterator last, OutputIterator result);
1097
1098template <class InputIterator, class OutputIterator, class BinaryPredicate>
1099    constexpr OutputIterator     // constexpr in C++20
1100    unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
1101
1102template <class BidirectionalIterator>
1103    constexpr void               // constexpr in C++20
1104    reverse(BidirectionalIterator first, BidirectionalIterator last);
1105
1106template <class BidirectionalIterator, class OutputIterator>
1107    constexpr OutputIterator       // constexpr in C++20
1108    reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
1109
1110template <class ForwardIterator>
1111    constexpr ForwardIterator      // constexpr in C++20
1112    rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
1113
1114template <class ForwardIterator, class OutputIterator>
1115    constexpr OutputIterator       // constexpr in C++20
1116    rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
1117
1118template <class RandomAccessIterator>
1119    void
1120    random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
1121
1122template <class RandomAccessIterator, class RandomNumberGenerator>
1123    void
1124    random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
1125                   RandomNumberGenerator& rand);  // deprecated in C++14, removed in C++17
1126
1127template<class PopulationIterator, class SampleIterator,
1128         class Distance, class UniformRandomBitGenerator>
1129    SampleIterator sample(PopulationIterator first, PopulationIterator last,
1130                          SampleIterator out, Distance n,
1131                          UniformRandomBitGenerator&& g); // C++17
1132
1133template<class RandomAccessIterator, class UniformRandomNumberGenerator>
1134    void shuffle(RandomAccessIterator first, RandomAccessIterator last,
1135                 UniformRandomNumberGenerator&& g);
1136
1137template<class ForwardIterator>
1138  constexpr ForwardIterator
1139    shift_left(ForwardIterator first, ForwardIterator last,
1140               typename iterator_traits<ForwardIterator>::difference_type n); // C++20
1141
1142template<class ForwardIterator>
1143  constexpr ForwardIterator
1144    shift_right(ForwardIterator first, ForwardIterator last,
1145                typename iterator_traits<ForwardIterator>::difference_type n); // C++20
1146
1147template <class InputIterator, class Predicate>
1148    constexpr bool  // constexpr in C++20
1149    is_partitioned(InputIterator first, InputIterator last, Predicate pred);
1150
1151template <class ForwardIterator, class Predicate>
1152    constexpr ForwardIterator  // constexpr in C++20
1153    partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1154
1155template <class InputIterator, class OutputIterator1,
1156          class OutputIterator2, class Predicate>
1157    constexpr pair<OutputIterator1, OutputIterator2>   // constexpr in C++20
1158    partition_copy(InputIterator first, InputIterator last,
1159                   OutputIterator1 out_true, OutputIterator2 out_false,
1160                   Predicate pred);
1161
1162template <class ForwardIterator, class Predicate>
1163    ForwardIterator
1164    stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1165
1166template<class ForwardIterator, class Predicate>
1167    constexpr ForwardIterator  // constexpr in C++20
1168    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
1169
1170template <class ForwardIterator>
1171    constexpr bool  // constexpr in C++20
1172    is_sorted(ForwardIterator first, ForwardIterator last);
1173
1174template <class ForwardIterator, class Compare>
1175    constexpr bool  // constexpr in C++20
1176    is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1177
1178template<class ForwardIterator>
1179    constexpr ForwardIterator    // constexpr in C++20
1180    is_sorted_until(ForwardIterator first, ForwardIterator last);
1181
1182template <class ForwardIterator, class Compare>
1183    constexpr ForwardIterator    // constexpr in C++20
1184    is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1185
1186template <class RandomAccessIterator>
1187    constexpr void               // constexpr in C++20
1188    sort(RandomAccessIterator first, RandomAccessIterator last);
1189
1190template <class RandomAccessIterator, class Compare>
1191    constexpr void               // constexpr in C++20
1192    sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1193
1194template <class RandomAccessIterator>
1195    void
1196    stable_sort(RandomAccessIterator first, RandomAccessIterator last);
1197
1198template <class RandomAccessIterator, class Compare>
1199    void
1200    stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1201
1202template <class RandomAccessIterator>
1203    constexpr void                    // constexpr in C++20
1204    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
1205
1206template <class RandomAccessIterator, class Compare>
1207    constexpr void                    // constexpr in C++20
1208    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1209
1210template <class InputIterator, class RandomAccessIterator>
1211    constexpr RandomAccessIterator    // constexpr in C++20
1212    partial_sort_copy(InputIterator first, InputIterator last,
1213                      RandomAccessIterator result_first, RandomAccessIterator result_last);
1214
1215template <class InputIterator, class RandomAccessIterator, class Compare>
1216    constexpr RandomAccessIterator    // constexpr in C++20
1217    partial_sort_copy(InputIterator first, InputIterator last,
1218                      RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1219
1220template <class RandomAccessIterator>
1221    constexpr void                    // constexpr in C++20
1222    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
1223
1224template <class RandomAccessIterator, class Compare>
1225    constexpr void                    // constexpr in C++20
1226    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1227
1228template <class ForwardIterator, class T>
1229    constexpr ForwardIterator                         // constexpr in C++20
1230    lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
1231
1232template <class ForwardIterator, class T, class Compare>
1233    constexpr ForwardIterator                         // constexpr in C++20
1234    lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1235
1236template <class ForwardIterator, class T>
1237    constexpr ForwardIterator                         // constexpr in C++20
1238    upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
1239
1240template <class ForwardIterator, class T, class Compare>
1241    constexpr ForwardIterator                         // constexpr in C++20
1242    upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1243
1244template <class ForwardIterator, class T>
1245    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
1246    equal_range(ForwardIterator first, ForwardIterator last, const T& value);
1247
1248template <class ForwardIterator, class T, class Compare>
1249    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
1250    equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1251
1252template <class ForwardIterator, class T>
1253    constexpr bool                                    // constexpr in C++20
1254    binary_search(ForwardIterator first, ForwardIterator last, const T& value);
1255
1256template <class ForwardIterator, class T, class Compare>
1257    constexpr bool                                    // constexpr in C++20
1258    binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1259
1260template <class InputIterator1, class InputIterator2, class OutputIterator>
1261    constexpr OutputIterator                          // constexpr in C++20
1262    merge(InputIterator1 first1, InputIterator1 last1,
1263          InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1264
1265template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1266    constexpr OutputIterator                          // constexpr in C++20
1267    merge(InputIterator1 first1, InputIterator1 last1,
1268          InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1269
1270template <class BidirectionalIterator>
1271    void
1272    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
1273
1274template <class BidirectionalIterator, class Compare>
1275    void
1276    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1277
1278template <class InputIterator1, class InputIterator2>
1279    constexpr bool                                    // constexpr in C++20
1280    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1281
1282template <class InputIterator1, class InputIterator2, class Compare>
1283    constexpr bool                                    // constexpr in C++20
1284    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1285
1286template <class InputIterator1, class InputIterator2, class OutputIterator>
1287    constexpr OutputIterator                          // constexpr in C++20
1288    set_union(InputIterator1 first1, InputIterator1 last1,
1289              InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1290
1291template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1292    constexpr OutputIterator                          // constexpr in C++20
1293    set_union(InputIterator1 first1, InputIterator1 last1,
1294              InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1295
1296template <class InputIterator1, class InputIterator2, class OutputIterator>
1297    constexpr OutputIterator                         // constexpr in C++20
1298    set_intersection(InputIterator1 first1, InputIterator1 last1,
1299                     InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1300
1301template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1302    constexpr OutputIterator                         // constexpr in C++20
1303    set_intersection(InputIterator1 first1, InputIterator1 last1,
1304                     InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1305
1306template <class InputIterator1, class InputIterator2, class OutputIterator>
1307    constexpr OutputIterator                         // constexpr in C++20
1308    set_difference(InputIterator1 first1, InputIterator1 last1,
1309                   InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1310
1311template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1312    constexpr OutputIterator                         // constexpr in C++20
1313    set_difference(InputIterator1 first1, InputIterator1 last1,
1314                   InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1315
1316template <class InputIterator1, class InputIterator2, class OutputIterator>
1317    constexpr OutputIterator                         // constexpr in C++20
1318    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
1319                             InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1320
1321template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1322    constexpr OutputIterator                         // constexpr in C++20
1323    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
1324                             InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1325
1326template <class RandomAccessIterator>
1327    constexpr void                                   // constexpr in C++20
1328    push_heap(RandomAccessIterator first, RandomAccessIterator last);
1329
1330template <class RandomAccessIterator, class Compare>
1331    constexpr void                                   // constexpr in C++20
1332    push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1333
1334template <class RandomAccessIterator>
1335    constexpr void                                   // constexpr in C++20
1336    pop_heap(RandomAccessIterator first, RandomAccessIterator last);
1337
1338template <class RandomAccessIterator, class Compare>
1339    constexpr void                                   // constexpr in C++20
1340    pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1341
1342template <class RandomAccessIterator>
1343    constexpr void                                   // constexpr in C++20
1344    make_heap(RandomAccessIterator first, RandomAccessIterator last);
1345
1346template <class RandomAccessIterator, class Compare>
1347    constexpr void                                   // constexpr in C++20
1348    make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1349
1350template <class RandomAccessIterator>
1351    constexpr void                                   // constexpr in C++20
1352    sort_heap(RandomAccessIterator first, RandomAccessIterator last);
1353
1354template <class RandomAccessIterator, class Compare>
1355    constexpr void                                   // constexpr in C++20
1356    sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1357
1358template <class RandomAccessIterator>
1359    constexpr bool   // constexpr in C++20
1360    is_heap(RandomAccessIterator first, RandomAccessiterator last);
1361
1362template <class RandomAccessIterator, class Compare>
1363    constexpr bool   // constexpr in C++20
1364    is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1365
1366template <class RandomAccessIterator>
1367    constexpr RandomAccessIterator   // constexpr in C++20
1368    is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
1369
1370template <class RandomAccessIterator, class Compare>
1371    constexpr RandomAccessIterator   // constexpr in C++20
1372    is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1373
1374template <class ForwardIterator>
1375    constexpr ForwardIterator        // constexpr in C++14
1376    min_element(ForwardIterator first, ForwardIterator last);
1377
1378template <class ForwardIterator, class Compare>
1379    constexpr ForwardIterator        // constexpr in C++14
1380    min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1381
1382template <class T>
1383    constexpr const T&               // constexpr in C++14
1384    min(const T& a, const T& b);
1385
1386template <class T, class Compare>
1387    constexpr const T&               // constexpr in C++14
1388    min(const T& a, const T& b, Compare comp);
1389
1390template<class T>
1391    constexpr T                      // constexpr in C++14
1392    min(initializer_list<T> t);
1393
1394template<class T, class Compare>
1395    constexpr T                      // constexpr in C++14
1396    min(initializer_list<T> t, Compare comp);
1397
1398template<class T>
1399    constexpr const T& clamp(const T& v, const T& lo, const T& hi);               // C++17
1400
1401template<class T, class Compare>
1402    constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1403
1404template <class ForwardIterator>
1405    constexpr ForwardIterator        // constexpr in C++14
1406    max_element(ForwardIterator first, ForwardIterator last);
1407
1408template <class ForwardIterator, class Compare>
1409    constexpr ForwardIterator        // constexpr in C++14
1410    max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1411
1412template <class T>
1413    constexpr const T&               // constexpr in C++14
1414    max(const T& a, const T& b);
1415
1416template <class T, class Compare>
1417    constexpr const T&               // constexpr in C++14
1418    max(const T& a, const T& b, Compare comp);
1419
1420template<class T>
1421    constexpr T                      // constexpr in C++14
1422    max(initializer_list<T> t);
1423
1424template<class T, class Compare>
1425    constexpr T                      // constexpr in C++14
1426    max(initializer_list<T> t, Compare comp);
1427
1428template<class ForwardIterator>
1429    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1430    minmax_element(ForwardIterator first, ForwardIterator last);
1431
1432template<class ForwardIterator, class Compare>
1433    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1434    minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1435
1436template<class T>
1437    constexpr pair<const T&, const T&>  // constexpr in C++14
1438    minmax(const T& a, const T& b);
1439
1440template<class T, class Compare>
1441    constexpr pair<const T&, const T&>  // constexpr in C++14
1442    minmax(const T& a, const T& b, Compare comp);
1443
1444template<class T>
1445    constexpr pair<T, T>                // constexpr in C++14
1446    minmax(initializer_list<T> t);
1447
1448template<class T, class Compare>
1449    constexpr pair<T, T>                // constexpr in C++14
1450    minmax(initializer_list<T> t, Compare comp);
1451
1452template <class InputIterator1, class InputIterator2>
1453    constexpr bool     // constexpr in C++20
1454    lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1455
1456template <class InputIterator1, class InputIterator2, class Compare>
1457    constexpr bool     // constexpr in C++20
1458    lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
1459                            InputIterator2 first2, InputIterator2 last2, Compare comp);
1460
1461template <class BidirectionalIterator>
1462    constexpr bool     // constexpr in C++20
1463    next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1464
1465template <class BidirectionalIterator, class Compare>
1466    constexpr bool     // constexpr in C++20
1467    next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1468
1469template <class BidirectionalIterator>
1470    constexpr bool     // constexpr in C++20
1471    prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1472
1473template <class BidirectionalIterator, class Compare>
1474    constexpr bool     // constexpr in C++20
1475    prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1476}  // std
1477
1478*/
1479
1480#include <__assert> // all public C++ headers provide the assertion handler
1481#include <__bits>
1482#include <__config>
1483#include <__debug>
1484#include <cstddef>
1485#include <cstring>
1486#include <memory>
1487#include <type_traits>
1488#include <version>
1489
1490#include <__algorithm/adjacent_find.h>
1491#include <__algorithm/all_of.h>
1492#include <__algorithm/any_of.h>
1493#include <__algorithm/binary_search.h>
1494#include <__algorithm/clamp.h>
1495#include <__algorithm/comp.h>
1496#include <__algorithm/comp_ref_type.h>
1497#include <__algorithm/copy.h>
1498#include <__algorithm/copy_backward.h>
1499#include <__algorithm/copy_if.h>
1500#include <__algorithm/copy_n.h>
1501#include <__algorithm/count.h>
1502#include <__algorithm/count_if.h>
1503#include <__algorithm/equal.h>
1504#include <__algorithm/equal_range.h>
1505#include <__algorithm/fill.h>
1506#include <__algorithm/fill_n.h>
1507#include <__algorithm/find.h>
1508#include <__algorithm/find_end.h>
1509#include <__algorithm/find_first_of.h>
1510#include <__algorithm/find_if.h>
1511#include <__algorithm/find_if_not.h>
1512#include <__algorithm/for_each.h>
1513#include <__algorithm/for_each_n.h>
1514#include <__algorithm/generate.h>
1515#include <__algorithm/generate_n.h>
1516#include <__algorithm/half_positive.h>
1517#include <__algorithm/in_found_result.h>
1518#include <__algorithm/in_fun_result.h>
1519#include <__algorithm/in_in_out_result.h>
1520#include <__algorithm/in_in_result.h>
1521#include <__algorithm/in_out_out_result.h>
1522#include <__algorithm/in_out_result.h>
1523#include <__algorithm/includes.h>
1524#include <__algorithm/inplace_merge.h>
1525#include <__algorithm/is_heap.h>
1526#include <__algorithm/is_heap_until.h>
1527#include <__algorithm/is_partitioned.h>
1528#include <__algorithm/is_permutation.h>
1529#include <__algorithm/is_sorted.h>
1530#include <__algorithm/is_sorted_until.h>
1531#include <__algorithm/iter_swap.h>
1532#include <__algorithm/lexicographical_compare.h>
1533#include <__algorithm/lower_bound.h>
1534#include <__algorithm/make_heap.h>
1535#include <__algorithm/max.h>
1536#include <__algorithm/max_element.h>
1537#include <__algorithm/merge.h>
1538#include <__algorithm/min.h>
1539#include <__algorithm/min_element.h>
1540#include <__algorithm/min_max_result.h>
1541#include <__algorithm/minmax.h>
1542#include <__algorithm/minmax_element.h>
1543#include <__algorithm/mismatch.h>
1544#include <__algorithm/move.h>
1545#include <__algorithm/move_backward.h>
1546#include <__algorithm/next_permutation.h>
1547#include <__algorithm/none_of.h>
1548#include <__algorithm/nth_element.h>
1549#include <__algorithm/partial_sort.h>
1550#include <__algorithm/partial_sort_copy.h>
1551#include <__algorithm/partition.h>
1552#include <__algorithm/partition_copy.h>
1553#include <__algorithm/partition_point.h>
1554#include <__algorithm/pop_heap.h>
1555#include <__algorithm/prev_permutation.h>
1556#include <__algorithm/push_heap.h>
1557#include <__algorithm/ranges_adjacent_find.h>
1558#include <__algorithm/ranges_all_of.h>
1559#include <__algorithm/ranges_any_of.h>
1560#include <__algorithm/ranges_binary_search.h>
1561#include <__algorithm/ranges_copy.h>
1562#include <__algorithm/ranges_copy_backward.h>
1563#include <__algorithm/ranges_copy_if.h>
1564#include <__algorithm/ranges_copy_n.h>
1565#include <__algorithm/ranges_count.h>
1566#include <__algorithm/ranges_count_if.h>
1567#include <__algorithm/ranges_equal.h>
1568#include <__algorithm/ranges_equal_range.h>
1569#include <__algorithm/ranges_fill.h>
1570#include <__algorithm/ranges_fill_n.h>
1571#include <__algorithm/ranges_find.h>
1572#include <__algorithm/ranges_find_end.h>
1573#include <__algorithm/ranges_find_first_of.h>
1574#include <__algorithm/ranges_find_if.h>
1575#include <__algorithm/ranges_find_if_not.h>
1576#include <__algorithm/ranges_for_each.h>
1577#include <__algorithm/ranges_for_each_n.h>
1578#include <__algorithm/ranges_includes.h>
1579#include <__algorithm/ranges_is_partitioned.h>
1580#include <__algorithm/ranges_is_sorted.h>
1581#include <__algorithm/ranges_is_sorted_until.h>
1582#include <__algorithm/ranges_lexicographical_compare.h>
1583#include <__algorithm/ranges_lower_bound.h>
1584#include <__algorithm/ranges_make_heap.h>
1585#include <__algorithm/ranges_max.h>
1586#include <__algorithm/ranges_max_element.h>
1587#include <__algorithm/ranges_merge.h>
1588#include <__algorithm/ranges_min.h>
1589#include <__algorithm/ranges_min_element.h>
1590#include <__algorithm/ranges_minmax.h>
1591#include <__algorithm/ranges_minmax_element.h>
1592#include <__algorithm/ranges_mismatch.h>
1593#include <__algorithm/ranges_move.h>
1594#include <__algorithm/ranges_move_backward.h>
1595#include <__algorithm/ranges_none_of.h>
1596#include <__algorithm/ranges_nth_element.h>
1597#include <__algorithm/ranges_partial_sort.h>
1598#include <__algorithm/ranges_partition.h>
1599#include <__algorithm/ranges_partition_copy.h>
1600#include <__algorithm/ranges_partition_point.h>
1601#include <__algorithm/ranges_pop_heap.h>
1602#include <__algorithm/ranges_push_heap.h>
1603#include <__algorithm/ranges_remove.h>
1604#include <__algorithm/ranges_remove_if.h>
1605#include <__algorithm/ranges_replace.h>
1606#include <__algorithm/ranges_replace_if.h>
1607#include <__algorithm/ranges_reverse.h>
1608#include <__algorithm/ranges_reverse_copy.h>
1609#include <__algorithm/ranges_rotate_copy.h>
1610#include <__algorithm/ranges_search.h>
1611#include <__algorithm/ranges_search_n.h>
1612#include <__algorithm/ranges_set_difference.h>
1613#include <__algorithm/ranges_set_intersection.h>
1614#include <__algorithm/ranges_set_symmetric_difference.h>
1615#include <__algorithm/ranges_set_union.h>
1616#include <__algorithm/ranges_shuffle.h>
1617#include <__algorithm/ranges_sort.h>
1618#include <__algorithm/ranges_sort_heap.h>
1619#include <__algorithm/ranges_stable_partition.h>
1620#include <__algorithm/ranges_stable_sort.h>
1621#include <__algorithm/ranges_swap_ranges.h>
1622#include <__algorithm/ranges_transform.h>
1623#include <__algorithm/ranges_upper_bound.h>
1624#include <__algorithm/remove.h>
1625#include <__algorithm/remove_copy.h>
1626#include <__algorithm/remove_copy_if.h>
1627#include <__algorithm/remove_if.h>
1628#include <__algorithm/replace.h>
1629#include <__algorithm/replace_copy.h>
1630#include <__algorithm/replace_copy_if.h>
1631#include <__algorithm/replace_if.h>
1632#include <__algorithm/reverse.h>
1633#include <__algorithm/reverse_copy.h>
1634#include <__algorithm/rotate.h>
1635#include <__algorithm/rotate_copy.h>
1636#include <__algorithm/sample.h>
1637#include <__algorithm/search.h>
1638#include <__algorithm/search_n.h>
1639#include <__algorithm/set_difference.h>
1640#include <__algorithm/set_intersection.h>
1641#include <__algorithm/set_symmetric_difference.h>
1642#include <__algorithm/set_union.h>
1643#include <__algorithm/shift_left.h>
1644#include <__algorithm/shift_right.h>
1645#include <__algorithm/shuffle.h>
1646#include <__algorithm/sift_down.h>
1647#include <__algorithm/sort.h>
1648#include <__algorithm/sort_heap.h>
1649#include <__algorithm/stable_partition.h>
1650#include <__algorithm/stable_sort.h>
1651#include <__algorithm/swap_ranges.h>
1652#include <__algorithm/transform.h>
1653#include <__algorithm/unique.h>
1654#include <__algorithm/unique_copy.h>
1655#include <__algorithm/unwrap_iter.h>
1656#include <__algorithm/upper_bound.h>
1657
1658#ifndef _LIBCPP_REMOVE_TRANSITIVE_INCLUDES
1659#  include <chrono>
1660#  include <iterator>
1661#  include <utility>
1662#endif
1663
1664// standard-mandated includes
1665#include <initializer_list>
1666
1667#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
1668#  pragma GCC system_header
1669#endif
1670
1671#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
1672#   include <__pstl_algorithm>
1673#endif
1674
1675#endif // _LIBCPP_ALGORITHM
1676