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  template <class I, class F>
23    struct in_fun_result;     // since C++20
24
25  template <class I1, class I2>
26    struct in_in_result;      // since C++20
27
28  template <class I1, class I2, class O>
29    struct in_in_out_result;  // since C++20
30
31  template <class I, class O1, class O2>
32    struct in_out_out_result; // since C++20
33
34  template <class I1, class I2>
35    struct min_max_result;    // since C++20
36
37  template <class I>
38    struct in_found_result;   // since C++20
39
40  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
41    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>             // since C++20
42  constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
43
44  template<forward_range R, class Proj = identity,
45    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
46  constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
47
48  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
49    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
50  constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {});                        // since C++20
51
52  template<forward_range R, class Proj = identity,
53    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
54  constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {});             // since C++20
55
56
57  template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2,
58          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
59    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
60  constexpr mismatch_result<_I1, _I2>
61  mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20
62
63  template <input_range R1, input_range R2,
64          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
65    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
66  constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
67  mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {})                           // since C++20
68
69    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
70    constexpr I find(I first, S last, const T& value, Proj proj = {});              // since C++20
71
72  template<input_range R, class T, class Proj = identity>
73    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
74    constexpr borrowed_iterator_t<R>
75      find(R&& r, const T& value, Proj proj = {});                                  // since C++20
76
77  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
78           indirect_unary_predicate<projected<I, Proj>> Pred>
79    constexpr I find_if(I first, S last, Pred pred, Proj proj = {});                // since C++20
80
81  template<input_range R, class Proj = identity,
82           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
83    constexpr borrowed_iterator_t<R>
84      find_if(R&& r, Pred pred, Proj proj = {});                                    // since C++20
85
86  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
87           indirect_unary_predicate<projected<I, Proj>> Pred>
88    constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {});            // since C++20
89
90  template<input_range R, class Proj = identity,
91           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
92    constexpr borrowed_iterator_t<R>
93      find_if_not(R&& r, Pred pred, Proj proj = {});                                // since C++20
94
95  template<class T, class Proj = identity,
96           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
97    constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
98
99  template<copyable T, class Proj = identity,
100           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
101    constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {});         // since C++20
102
103 template<input_range R, class Proj = identity,
104          indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
105   requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
106   constexpr range_value_t<R>
107     min(R&& r, Comp comp = {}, Proj proj = {});                                    // since C++20
108
109  template<class T, class Proj = identity,
110           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
111    constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
112
113  template<copyable T, class Proj = identity,
114           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
115    constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {});         // since C++20
116
117  template<input_range R, class Proj = identity,
118           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
119    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
120    constexpr range_value_t<R>
121      max(R&& r, Comp comp = {}, Proj proj = {});                                   // since C++20
122
123  template<class I, class O>
124    using unary_transform_result = in_out_result<I, O>;                             // since C++20
125
126  template<class I1, class I2, class O>
127    using binary_transform_result = in_in_out_result<I1, I2, O>;                    // since C++20
128
129  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O,
130           copy_constructible F, class Proj = identity>
131    requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>>
132    constexpr ranges::unary_transform_result<I, O>
133      transform(I first1, S last1, O result, F op, Proj proj = {});                 // since C++20
134
135  template<input_range R, weakly_incrementable O, copy_constructible F,
136           class Proj = identity>
137    requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>>
138    constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O>
139      transform(R&& r, O result, F op, Proj proj = {});                             // since C++20
140
141  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
142           weakly_incrementable O, copy_constructible F, class Proj1 = identity,
143           class Proj2 = identity>
144    requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>,
145                                           projected<I2, Proj2>>>
146    constexpr ranges::binary_transform_result<I1, I2, O>
147      transform(I1 first1, S1 last1, I2 first2, S2 last2, O result,
148                        F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});           // since C++20
149
150  template<input_range R1, input_range R2, weakly_incrementable O,
151           copy_constructible F, class Proj1 = identity, class Proj2 = identity>
152    requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>,
153                                           projected<iterator_t<R2>, Proj2>>>
154    constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
155      transform(R1&& r1, R2&& r2, O result,
156                        F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});           // since C++20
157
158  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity>
159    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
160    constexpr iter_difference_t<I>
161      count(I first, S last, const T& value, Proj proj = {});                       // since C++20
162
163  template<input_range R, class T, class Proj = identity>
164    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
165    constexpr range_difference_t<R>
166      count(R&& r, const T& value, Proj proj = {});                                 // since C++20
167
168  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
169           indirect_unary_predicate<projected<I, Proj>> Pred>
170    constexpr iter_difference_t<I>
171      count_if(I first, S last, Pred pred, Proj proj = {});                         // since C++20
172
173  template<input_range R, class Proj = identity,
174           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
175    constexpr range_difference_t<R>
176      count_if(R&& r, Pred pred, Proj proj = {});                                   // since C++20
177
178  template<class T, class Proj = identity,
179           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
180    constexpr ranges::minmax_result<const T&>
181      minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {});                     // since C++20
182
183  template<copyable T, class Proj = identity,
184           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
185    constexpr ranges::minmax_result<T>
186      minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {});                      // since C++20
187
188  template<input_range R, class Proj = identity,
189           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
190    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
191    constexpr ranges::minmax_result<range_value_t<R>>
192      minmax(R&& r, Comp comp = {}, Proj proj = {});                                      // since C++20
193
194  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
195           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
196    constexpr ranges::minmax_element_result<I>
197      minmax_element(I first, S last, Comp comp = {}, Proj proj = {});                    // since C++20
198
199  template<forward_range R, class Proj = identity,
200           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
201    constexpr ranges::minmax_element_result<borrowed_iterator_t<R>>
202      minmax_element(R&& r, Comp comp = {}, Proj proj = {});                              // since C++20
203
204  template<class I, class O>
205      using copy_result = in_out_result<I, O>;                                              // since C++20
206
207    template<class I, class O>
208      using copy_n_result = in_out_result<I, O>;                                            // since C++20
209
210  template<class I, class O>
211    using copy_if_result = in_out_result<I, O>;                                             // since C++20
212
213  template<class I1, class I2>
214    using copy_backward_result = in_out_result<I1, I2>;                                     // since C++20
215
216  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
217    requires indirectly_copyable<I, O>
218    constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result);            // since C++20
219
220  template<input_range R, weakly_incrementable O>
221    requires indirectly_copyable<iterator_t<R>, O>
222    constexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20
223
224  template<input_iterator I, weakly_incrementable O>
225    requires indirectly_copyable<I, O>
226    constexpr ranges::copy_n_result<I, O>
227      ranges::copy_n(I first, iter_difference_t<I> n, O result);                            // since C++20
228
229  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity,
230           indirect_unary_predicate<projected<I, Proj>> Pred>
231    requires indirectly_copyable<I, O>
232    constexpr ranges::copy_if_result<I, O>
233      ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {});                // since C++20
234
235  template<input_range R, weakly_incrementable O, class Proj = identity,
236           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
237    requires indirectly_copyable<iterator_t<R>, O>
238    constexpr ranges::copy_if_result<borrowed_iterator_t<R>, O>
239      ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {});                          // since C++20
240
241  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
242    requires indirectly_copyable<I1, I2>
243    constexpr ranges::copy_backward_result<I1, I2>
244      ranges::copy_backward(I1 first, S1 last, I2 result);                                  // since C++20
245
246  template<bidirectional_range R, bidirectional_iterator I>
247    requires indirectly_copyable<iterator_t<R>, I>
248    constexpr ranges::copy_backward_result<borrowed_iterator_t<R>, I>
249      ranges::copy_backward(R&& r, I result);                                               // since C++20
250
251  template<class I, class F>
252    using for_each_result = in_fun_result<I, F>;                                            // since C++20
253
254  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
255           indirectly_unary_invocable<projected<I, Proj>> Fun>
256    constexpr ranges::for_each_result<I, Fun>
257      ranges::for_each(I first, S last, Fun f, Proj proj = {});                             // since C++20
258
259  template<input_range R, class Proj = identity,
260           indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun>
261    constexpr ranges::for_each_result<borrowed_iterator_t<R>, Fun>
262      ranges::for_each(R&& r, Fun f, Proj proj = {});                                       // since C++20
263
264  template<input_iterator I, class Proj = identity,
265           indirectly_unary_invocable<projected<I, Proj>> Fun>
266    constexpr ranges::for_each_n_result<I, Fun>
267      ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {});           // since C++20
268
269  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
270           indirect_unary_predicate<projected<I, Proj>> Pred>
271    constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {});      // since C++20
272
273  template<input_range R, class Proj = identity,
274           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
275    constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {});                // since C++20
276
277
278  template<bidirectional_iterator I, sentinel_for<I> S>
279    requires permutable<I>
280    constexpr I ranges::reverse(I first, S last);                                           // since C++20
281
282  template<bidirectional_range R>
283    requires permutable<iterator_t<R>>
284    constexpr borrowed_iterator_t<R> ranges::reverse(R&& r);                                // since C++20
285
286  template<class T, output_iterator<const T&> O, sentinel_for<O> S>
287    constexpr O ranges::fill(O first, S last, const T& value);                              // since C++20
288
289  template<class T, output_range<const T&> R>
290    constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value);                   // since C++20
291
292  template<class T, output_iterator<const T&> O>
293    constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value);            // since C++20
294
295 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
296          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
297   requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
298   constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2,
299                                Pred pred = {},
300                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
301
302 template<input_range R1, input_range R2, class Pred = ranges::equal_to,
303          class Proj1 = identity, class Proj2 = identity>
304   requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
305   constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
306                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
307
308  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
309           indirect_unary_predicate<projected<I, Proj>> Pred>
310    constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
311
312  template<input_range R, class Proj = identity,
313           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
314    constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {});                // since C++20
315
316  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
317           indirect_unary_predicate<projected<I, Proj>> Pred>
318    constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
319
320  template<input_range R, class Proj = identity,
321           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
322    constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {});                // since C++20
323
324  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
325           indirect_unary_predicate<projected<I, Proj>> Pred>
326    constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {});     // since C++20
327
328  template<input_range R, class Proj = identity,
329           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
330    constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {});               // since C++20
331
332  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
333           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
334    constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});      // since C++20
335
336  template<forward_range R, class Proj = identity,
337           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
338    constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});                // since C++20
339
340  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
341           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
342    constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});   // since C++20
343
344  template<forward_range R, class Proj = identity,
345           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
346    constexpr borrowed_iterator_t<R>
347      ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});                       // since C++20
348
349  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
350           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
351    constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
352
353  template<forward_range R, class T, class Proj = identity,
354           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
355             ranges::less>
356    constexpr borrowed_iterator_t<R>
357      upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
358
359  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
360           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
361    constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
362                                    Proj proj = {});                                          // since C++20
363  template<forward_range R, class T, class Proj = identity,
364           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
365             ranges::less>
366    constexpr borrowed_iterator_t<R>
367      lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
368
369  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
370           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
371    constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
372                                         Proj proj = {});                                     // since C++20
373  template<forward_range R, class T, class Proj = identity,
374           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
375             ranges::less>
376    constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
377                                         Proj proj = {});                                     // since C++20
378
379}
380
381    constexpr bool     // constexpr in C++20
382    all_of(InputIterator first, InputIterator last, Predicate pred);
383
384template <class InputIterator, class Predicate>
385    constexpr bool     // constexpr in C++20
386    any_of(InputIterator first, InputIterator last, Predicate pred);
387
388template <class InputIterator, class Predicate>
389    constexpr bool     // constexpr in C++20
390    none_of(InputIterator first, InputIterator last, Predicate pred);
391
392template <class InputIterator, class Function>
393    constexpr Function          // constexpr in C++20
394    for_each(InputIterator first, InputIterator last, Function f);
395
396template<class InputIterator, class Size, class Function>
397    constexpr InputIterator     // constexpr in C++20
398    for_each_n(InputIterator first, Size n, Function f); // C++17
399
400template <class InputIterator, class T>
401    constexpr InputIterator     // constexpr in C++20
402    find(InputIterator first, InputIterator last, const T& value);
403
404template <class InputIterator, class Predicate>
405    constexpr InputIterator     // constexpr in C++20
406    find_if(InputIterator first, InputIterator last, Predicate pred);
407
408template<class InputIterator, class Predicate>
409    constexpr InputIterator     // constexpr in C++20
410    find_if_not(InputIterator first, InputIterator last, Predicate pred);
411
412template <class ForwardIterator1, class ForwardIterator2>
413    constexpr ForwardIterator1  // constexpr in C++20
414    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
415             ForwardIterator2 first2, ForwardIterator2 last2);
416
417template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
418    constexpr ForwardIterator1  // constexpr in C++20
419    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
420             ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
421
422template <class ForwardIterator1, class ForwardIterator2>
423    constexpr ForwardIterator1  // constexpr in C++20
424    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
425                  ForwardIterator2 first2, ForwardIterator2 last2);
426
427template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
428    constexpr ForwardIterator1  // constexpr in C++20
429    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
430                  ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
431
432template <class ForwardIterator>
433    constexpr ForwardIterator   // constexpr in C++20
434    adjacent_find(ForwardIterator first, ForwardIterator last);
435
436template <class ForwardIterator, class BinaryPredicate>
437    constexpr ForwardIterator   // constexpr in C++20
438    adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
439
440template <class InputIterator, class T>
441    constexpr typename iterator_traits<InputIterator>::difference_type  // constexpr in C++20
442    count(InputIterator first, InputIterator last, const T& value);
443
444template <class InputIterator, class Predicate>
445    constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20
446    count_if(InputIterator first, InputIterator last, Predicate pred);
447
448template <class InputIterator1, class InputIterator2>
449    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
450    mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
451
452template <class InputIterator1, class InputIterator2>
453    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
454    mismatch(InputIterator1 first1, InputIterator1 last1,
455             InputIterator2 first2, InputIterator2 last2); // **C++14**
456
457template <class InputIterator1, class InputIterator2, class BinaryPredicate>
458    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
459    mismatch(InputIterator1 first1, InputIterator1 last1,
460             InputIterator2 first2, BinaryPredicate pred);
461
462template <class InputIterator1, class InputIterator2, class BinaryPredicate>
463    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
464    mismatch(InputIterator1 first1, InputIterator1 last1,
465             InputIterator2 first2, InputIterator2 last2,
466             BinaryPredicate pred); // **C++14**
467
468template <class InputIterator1, class InputIterator2>
469    constexpr bool      // constexpr in C++20
470    equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
471
472template <class InputIterator1, class InputIterator2>
473    constexpr bool      // constexpr in C++20
474    equal(InputIterator1 first1, InputIterator1 last1,
475          InputIterator2 first2, InputIterator2 last2); // **C++14**
476
477template <class InputIterator1, class InputIterator2, class BinaryPredicate>
478    constexpr bool      // constexpr in C++20
479    equal(InputIterator1 first1, InputIterator1 last1,
480          InputIterator2 first2, BinaryPredicate pred);
481
482template <class InputIterator1, class InputIterator2, class BinaryPredicate>
483    constexpr bool      // constexpr in C++20
484    equal(InputIterator1 first1, InputIterator1 last1,
485          InputIterator2 first2, InputIterator2 last2,
486          BinaryPredicate pred); // **C++14**
487
488template<class ForwardIterator1, class ForwardIterator2>
489    constexpr bool      // constexpr in C++20
490    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
491                   ForwardIterator2 first2);
492
493template<class ForwardIterator1, class ForwardIterator2>
494    constexpr bool      // constexpr in C++20
495    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
496                   ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
497
498template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
499    constexpr bool      // constexpr in C++20
500    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
501                   ForwardIterator2 first2, BinaryPredicate pred);
502
503template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
504    constexpr bool      // constexpr in C++20
505    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
506                   ForwardIterator2 first2, ForwardIterator2 last2,
507                   BinaryPredicate pred);  // **C++14**
508
509template <class ForwardIterator1, class ForwardIterator2>
510    constexpr ForwardIterator1      // constexpr in C++20
511    search(ForwardIterator1 first1, ForwardIterator1 last1,
512           ForwardIterator2 first2, ForwardIterator2 last2);
513
514template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
515    constexpr ForwardIterator1      // constexpr in C++20
516    search(ForwardIterator1 first1, ForwardIterator1 last1,
517           ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
518
519template <class ForwardIterator, class Size, class T>
520    constexpr ForwardIterator       // constexpr in C++20
521    search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
522
523template <class ForwardIterator, class Size, class T, class BinaryPredicate>
524    constexpr ForwardIterator       // constexpr in C++20
525    search_n(ForwardIterator first, ForwardIterator last,
526             Size count, const T& value, BinaryPredicate pred);
527
528template <class InputIterator, class OutputIterator>
529    constexpr OutputIterator      // constexpr in C++20
530    copy(InputIterator first, InputIterator last, OutputIterator result);
531
532template<class InputIterator, class OutputIterator, class Predicate>
533    constexpr OutputIterator      // constexpr in C++20
534    copy_if(InputIterator first, InputIterator last,
535            OutputIterator result, Predicate pred);
536
537template<class InputIterator, class Size, class OutputIterator>
538    constexpr OutputIterator      // constexpr in C++20
539    copy_n(InputIterator first, Size n, OutputIterator result);
540
541template <class BidirectionalIterator1, class BidirectionalIterator2>
542    constexpr BidirectionalIterator2      // constexpr in C++20
543    copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
544                  BidirectionalIterator2 result);
545
546template <class ForwardIterator1, class ForwardIterator2>
547    constexpr ForwardIterator2    // constexpr in C++20
548    swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
549
550template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2>
551        requires indirectly_swappable<I1, I2>
552    constexpr ranges::swap_ranges_result<I1, I2>
553        ranges::swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2);
554
555template<input_range R1, input_range R2>
556        requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>
557    constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
558        ranges::swap_ranges(R1&& r1, R2&& r2);
559
560template <class ForwardIterator1, class ForwardIterator2>
561    constexpr void                // constexpr in C++20
562    iter_swap(ForwardIterator1 a, ForwardIterator2 b);
563
564template <class InputIterator, class OutputIterator, class UnaryOperation>
565    constexpr OutputIterator      // constexpr in C++20
566    transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
567
568template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
569    constexpr OutputIterator      // constexpr in C++20
570    transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
571              OutputIterator result, BinaryOperation binary_op);
572
573template <class ForwardIterator, class T>
574    constexpr void      // constexpr in C++20
575    replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
576
577template <class ForwardIterator, class Predicate, class T>
578    constexpr void      // constexpr in C++20
579    replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
580
581template <class InputIterator, class OutputIterator, class T>
582    constexpr OutputIterator      // constexpr in C++20
583    replace_copy(InputIterator first, InputIterator last, OutputIterator result,
584                 const T& old_value, const T& new_value);
585
586template <class InputIterator, class OutputIterator, class Predicate, class T>
587    constexpr OutputIterator      // constexpr in C++20
588    replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
589
590template <class ForwardIterator, class T>
591    constexpr void      // constexpr in C++20
592    fill(ForwardIterator first, ForwardIterator last, const T& value);
593
594template <class OutputIterator, class Size, class T>
595    constexpr OutputIterator      // constexpr in C++20
596    fill_n(OutputIterator first, Size n, const T& value);
597
598template <class ForwardIterator, class Generator>
599    constexpr void      // constexpr in C++20
600    generate(ForwardIterator first, ForwardIterator last, Generator gen);
601
602template <class OutputIterator, class Size, class Generator>
603    constexpr OutputIterator      // constexpr in C++20
604    generate_n(OutputIterator first, Size n, Generator gen);
605
606template <class ForwardIterator, class T>
607    constexpr ForwardIterator     // constexpr in C++20
608    remove(ForwardIterator first, ForwardIterator last, const T& value);
609
610template <class ForwardIterator, class Predicate>
611    constexpr ForwardIterator     // constexpr in C++20
612    remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
613
614template <class InputIterator, class OutputIterator, class T>
615    constexpr OutputIterator     // constexpr in C++20
616    remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
617
618template <class InputIterator, class OutputIterator, class Predicate>
619    constexpr OutputIterator     // constexpr in C++20
620    remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
621
622template <class ForwardIterator>
623    constexpr ForwardIterator    // constexpr in C++20
624    unique(ForwardIterator first, ForwardIterator last);
625
626template <class ForwardIterator, class BinaryPredicate>
627    constexpr ForwardIterator    // constexpr in C++20
628    unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
629
630template <class InputIterator, class OutputIterator>
631    constexpr OutputIterator     // constexpr in C++20
632    unique_copy(InputIterator first, InputIterator last, OutputIterator result);
633
634template <class InputIterator, class OutputIterator, class BinaryPredicate>
635    constexpr OutputIterator     // constexpr in C++20
636    unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
637
638template <class BidirectionalIterator>
639    constexpr void               // constexpr in C++20
640    reverse(BidirectionalIterator first, BidirectionalIterator last);
641
642template <class BidirectionalIterator, class OutputIterator>
643    constexpr OutputIterator       // constexpr in C++20
644    reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
645
646template <class ForwardIterator>
647    constexpr ForwardIterator      // constexpr in C++20
648    rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
649
650template <class ForwardIterator, class OutputIterator>
651    constexpr OutputIterator       // constexpr in C++20
652    rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
653
654template <class RandomAccessIterator>
655    void
656    random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
657
658template <class RandomAccessIterator, class RandomNumberGenerator>
659    void
660    random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
661                   RandomNumberGenerator& rand);  // deprecated in C++14, removed in C++17
662
663template<class PopulationIterator, class SampleIterator,
664         class Distance, class UniformRandomBitGenerator>
665    SampleIterator sample(PopulationIterator first, PopulationIterator last,
666                          SampleIterator out, Distance n,
667                          UniformRandomBitGenerator&& g); // C++17
668
669template<class RandomAccessIterator, class UniformRandomNumberGenerator>
670    void shuffle(RandomAccessIterator first, RandomAccessIterator last,
671                 UniformRandomNumberGenerator&& g);
672
673template<class ForwardIterator>
674  constexpr ForwardIterator
675    shift_left(ForwardIterator first, ForwardIterator last,
676               typename iterator_traits<ForwardIterator>::difference_type n); // C++20
677
678template<class ForwardIterator>
679  constexpr ForwardIterator
680    shift_right(ForwardIterator first, ForwardIterator last,
681                typename iterator_traits<ForwardIterator>::difference_type n); // C++20
682
683template <class InputIterator, class Predicate>
684    constexpr bool  // constexpr in C++20
685    is_partitioned(InputIterator first, InputIterator last, Predicate pred);
686
687template <class ForwardIterator, class Predicate>
688    constexpr ForwardIterator  // constexpr in C++20
689    partition(ForwardIterator first, ForwardIterator last, Predicate pred);
690
691template <class InputIterator, class OutputIterator1,
692          class OutputIterator2, class Predicate>
693    constexpr pair<OutputIterator1, OutputIterator2>   // constexpr in C++20
694    partition_copy(InputIterator first, InputIterator last,
695                   OutputIterator1 out_true, OutputIterator2 out_false,
696                   Predicate pred);
697
698template <class ForwardIterator, class Predicate>
699    ForwardIterator
700    stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
701
702template<class ForwardIterator, class Predicate>
703    constexpr ForwardIterator  // constexpr in C++20
704    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
705
706template <class ForwardIterator>
707    constexpr bool  // constexpr in C++20
708    is_sorted(ForwardIterator first, ForwardIterator last);
709
710template <class ForwardIterator, class Compare>
711    constexpr bool  // constexpr in C++20
712    is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
713
714template<class ForwardIterator>
715    constexpr ForwardIterator    // constexpr in C++20
716    is_sorted_until(ForwardIterator first, ForwardIterator last);
717
718template <class ForwardIterator, class Compare>
719    constexpr ForwardIterator    // constexpr in C++20
720    is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
721
722template <class RandomAccessIterator>
723    constexpr void               // constexpr in C++20
724    sort(RandomAccessIterator first, RandomAccessIterator last);
725
726template <class RandomAccessIterator, class Compare>
727    constexpr void               // constexpr in C++20
728    sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
729
730template <class RandomAccessIterator>
731    void
732    stable_sort(RandomAccessIterator first, RandomAccessIterator last);
733
734template <class RandomAccessIterator, class Compare>
735    void
736    stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
737
738template <class RandomAccessIterator>
739    constexpr void                    // constexpr in C++20
740    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
741
742template <class RandomAccessIterator, class Compare>
743    constexpr void                    // constexpr in C++20
744    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
745
746template <class InputIterator, class RandomAccessIterator>
747    constexpr RandomAccessIterator    // constexpr in C++20
748    partial_sort_copy(InputIterator first, InputIterator last,
749                      RandomAccessIterator result_first, RandomAccessIterator result_last);
750
751template <class InputIterator, class RandomAccessIterator, class Compare>
752    constexpr RandomAccessIterator    // constexpr in C++20
753    partial_sort_copy(InputIterator first, InputIterator last,
754                      RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
755
756template <class RandomAccessIterator>
757    constexpr void                    // constexpr in C++20
758    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
759
760template <class RandomAccessIterator, class Compare>
761    constexpr void                    // constexpr in C++20
762    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
763
764template <class ForwardIterator, class T>
765    constexpr ForwardIterator                         // constexpr in C++20
766    lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
767
768template <class ForwardIterator, class T, class Compare>
769    constexpr ForwardIterator                         // constexpr in C++20
770    lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
771
772template <class ForwardIterator, class T>
773    constexpr ForwardIterator                         // constexpr in C++20
774    upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
775
776template <class ForwardIterator, class T, class Compare>
777    constexpr ForwardIterator                         // constexpr in C++20
778    upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
779
780template <class ForwardIterator, class T>
781    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
782    equal_range(ForwardIterator first, ForwardIterator last, const T& value);
783
784template <class ForwardIterator, class T, class Compare>
785    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
786    equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
787
788template <class ForwardIterator, class T>
789    constexpr bool                                    // constexpr in C++20
790    binary_search(ForwardIterator first, ForwardIterator last, const T& value);
791
792template <class ForwardIterator, class T, class Compare>
793    constexpr bool                                    // constexpr in C++20
794    binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
795
796template <class InputIterator1, class InputIterator2, class OutputIterator>
797    constexpr OutputIterator                          // constexpr in C++20
798    merge(InputIterator1 first1, InputIterator1 last1,
799          InputIterator2 first2, InputIterator2 last2, OutputIterator result);
800
801template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
802    constexpr OutputIterator                          // constexpr in C++20
803    merge(InputIterator1 first1, InputIterator1 last1,
804          InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
805
806template <class BidirectionalIterator>
807    void
808    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
809
810template <class BidirectionalIterator, class Compare>
811    void
812    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
813
814template <class InputIterator1, class InputIterator2>
815    constexpr bool                                    // constexpr in C++20
816    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
817
818template <class InputIterator1, class InputIterator2, class Compare>
819    constexpr bool                                    // constexpr in C++20
820    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
821
822template <class InputIterator1, class InputIterator2, class OutputIterator>
823    constexpr OutputIterator                          // constexpr in C++20
824    set_union(InputIterator1 first1, InputIterator1 last1,
825              InputIterator2 first2, InputIterator2 last2, OutputIterator result);
826
827template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
828    constexpr OutputIterator                          // constexpr in C++20
829    set_union(InputIterator1 first1, InputIterator1 last1,
830              InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
831
832template <class InputIterator1, class InputIterator2, class OutputIterator>
833    constexpr OutputIterator                         // constexpr in C++20
834    set_intersection(InputIterator1 first1, InputIterator1 last1,
835                     InputIterator2 first2, InputIterator2 last2, OutputIterator result);
836
837template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
838    constexpr OutputIterator                         // constexpr in C++20
839    set_intersection(InputIterator1 first1, InputIterator1 last1,
840                     InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
841
842template <class InputIterator1, class InputIterator2, class OutputIterator>
843    constexpr OutputIterator                         // constexpr in C++20
844    set_difference(InputIterator1 first1, InputIterator1 last1,
845                   InputIterator2 first2, InputIterator2 last2, OutputIterator result);
846
847template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
848    constexpr OutputIterator                         // constexpr in C++20
849    set_difference(InputIterator1 first1, InputIterator1 last1,
850                   InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
851
852template <class InputIterator1, class InputIterator2, class OutputIterator>
853    constexpr OutputIterator                         // constexpr in C++20
854    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
855                             InputIterator2 first2, InputIterator2 last2, OutputIterator result);
856
857template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
858    constexpr OutputIterator                         // constexpr in C++20
859    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
860                             InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
861
862template <class RandomAccessIterator>
863    constexpr void                                   // constexpr in C++20
864    push_heap(RandomAccessIterator first, RandomAccessIterator last);
865
866template <class RandomAccessIterator, class Compare>
867    constexpr void                                   // constexpr in C++20
868    push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
869
870template <class RandomAccessIterator>
871    constexpr void                                   // constexpr in C++20
872    pop_heap(RandomAccessIterator first, RandomAccessIterator last);
873
874template <class RandomAccessIterator, class Compare>
875    constexpr void                                   // constexpr in C++20
876    pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
877
878template <class RandomAccessIterator>
879    constexpr void                                   // constexpr in C++20
880    make_heap(RandomAccessIterator first, RandomAccessIterator last);
881
882template <class RandomAccessIterator, class Compare>
883    constexpr void                                   // constexpr in C++20
884    make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
885
886template <class RandomAccessIterator>
887    constexpr void                                   // constexpr in C++20
888    sort_heap(RandomAccessIterator first, RandomAccessIterator last);
889
890template <class RandomAccessIterator, class Compare>
891    constexpr void                                   // constexpr in C++20
892    sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
893
894template <class RandomAccessIterator>
895    constexpr bool   // constexpr in C++20
896    is_heap(RandomAccessIterator first, RandomAccessiterator last);
897
898template <class RandomAccessIterator, class Compare>
899    constexpr bool   // constexpr in C++20
900    is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
901
902template <class RandomAccessIterator>
903    constexpr RandomAccessIterator   // constexpr in C++20
904    is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
905
906template <class RandomAccessIterator, class Compare>
907    constexpr RandomAccessIterator   // constexpr in C++20
908    is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
909
910template <class ForwardIterator>
911    constexpr ForwardIterator        // constexpr in C++14
912    min_element(ForwardIterator first, ForwardIterator last);
913
914template <class ForwardIterator, class Compare>
915    constexpr ForwardIterator        // constexpr in C++14
916    min_element(ForwardIterator first, ForwardIterator last, Compare comp);
917
918template <class T>
919    constexpr const T&               // constexpr in C++14
920    min(const T& a, const T& b);
921
922template <class T, class Compare>
923    constexpr const T&               // constexpr in C++14
924    min(const T& a, const T& b, Compare comp);
925
926template<class T>
927    constexpr T                      // constexpr in C++14
928    min(initializer_list<T> t);
929
930template<class T, class Compare>
931    constexpr T                      // constexpr in C++14
932    min(initializer_list<T> t, Compare comp);
933
934template<class T>
935    constexpr const T& clamp(const T& v, const T& lo, const T& hi);               // C++17
936
937template<class T, class Compare>
938    constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
939
940template <class ForwardIterator>
941    constexpr ForwardIterator        // constexpr in C++14
942    max_element(ForwardIterator first, ForwardIterator last);
943
944template <class ForwardIterator, class Compare>
945    constexpr ForwardIterator        // constexpr in C++14
946    max_element(ForwardIterator first, ForwardIterator last, Compare comp);
947
948template <class T>
949    constexpr const T&               // constexpr in C++14
950    max(const T& a, const T& b);
951
952template <class T, class Compare>
953    constexpr const T&               // constexpr in C++14
954    max(const T& a, const T& b, Compare comp);
955
956template<class T>
957    constexpr T                      // constexpr in C++14
958    max(initializer_list<T> t);
959
960template<class T, class Compare>
961    constexpr T                      // constexpr in C++14
962    max(initializer_list<T> t, Compare comp);
963
964template<class ForwardIterator>
965    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
966    minmax_element(ForwardIterator first, ForwardIterator last);
967
968template<class ForwardIterator, class Compare>
969    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
970    minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
971
972template<class T>
973    constexpr pair<const T&, const T&>  // constexpr in C++14
974    minmax(const T& a, const T& b);
975
976template<class T, class Compare>
977    constexpr pair<const T&, const T&>  // constexpr in C++14
978    minmax(const T& a, const T& b, Compare comp);
979
980template<class T>
981    constexpr pair<T, T>                // constexpr in C++14
982    minmax(initializer_list<T> t);
983
984template<class T, class Compare>
985    constexpr pair<T, T>                // constexpr in C++14
986    minmax(initializer_list<T> t, Compare comp);
987
988template <class InputIterator1, class InputIterator2>
989    constexpr bool     // constexpr in C++20
990    lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
991
992template <class InputIterator1, class InputIterator2, class Compare>
993    constexpr bool     // constexpr in C++20
994    lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
995                            InputIterator2 first2, InputIterator2 last2, Compare comp);
996
997template <class BidirectionalIterator>
998    constexpr bool     // constexpr in C++20
999    next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1000
1001template <class BidirectionalIterator, class Compare>
1002    constexpr bool     // constexpr in C++20
1003    next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1004
1005template <class BidirectionalIterator>
1006    constexpr bool     // constexpr in C++20
1007    prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1008
1009template <class BidirectionalIterator, class Compare>
1010    constexpr bool     // constexpr in C++20
1011    prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1012}  // std
1013
1014*/
1015
1016#include <__assert> // all public C++ headers provide the assertion handler
1017#include <__bits>
1018#include <__config>
1019#include <__debug>
1020#include <cstddef>
1021#include <cstring>
1022#include <initializer_list>
1023#include <iterator>
1024#include <memory>
1025#include <type_traits>
1026#include <version>
1027
1028#include <__algorithm/adjacent_find.h>
1029#include <__algorithm/all_of.h>
1030#include <__algorithm/any_of.h>
1031#include <__algorithm/binary_search.h>
1032#include <__algorithm/clamp.h>
1033#include <__algorithm/comp.h>
1034#include <__algorithm/comp_ref_type.h>
1035#include <__algorithm/copy.h>
1036#include <__algorithm/copy_backward.h>
1037#include <__algorithm/copy_if.h>
1038#include <__algorithm/copy_n.h>
1039#include <__algorithm/count.h>
1040#include <__algorithm/count_if.h>
1041#include <__algorithm/equal.h>
1042#include <__algorithm/equal_range.h>
1043#include <__algorithm/fill.h>
1044#include <__algorithm/fill_n.h>
1045#include <__algorithm/find.h>
1046#include <__algorithm/find_end.h>
1047#include <__algorithm/find_first_of.h>
1048#include <__algorithm/find_if.h>
1049#include <__algorithm/find_if_not.h>
1050#include <__algorithm/for_each.h>
1051#include <__algorithm/for_each_n.h>
1052#include <__algorithm/generate.h>
1053#include <__algorithm/generate_n.h>
1054#include <__algorithm/half_positive.h>
1055#include <__algorithm/in_found_result.h>
1056#include <__algorithm/in_fun_result.h>
1057#include <__algorithm/in_in_out_result.h>
1058#include <__algorithm/in_in_result.h>
1059#include <__algorithm/in_out_out_result.h>
1060#include <__algorithm/in_out_result.h>
1061#include <__algorithm/includes.h>
1062#include <__algorithm/inplace_merge.h>
1063#include <__algorithm/is_heap.h>
1064#include <__algorithm/is_heap_until.h>
1065#include <__algorithm/is_partitioned.h>
1066#include <__algorithm/is_permutation.h>
1067#include <__algorithm/is_sorted.h>
1068#include <__algorithm/is_sorted_until.h>
1069#include <__algorithm/iter_swap.h>
1070#include <__algorithm/lexicographical_compare.h>
1071#include <__algorithm/lower_bound.h>
1072#include <__algorithm/make_heap.h>
1073#include <__algorithm/max.h>
1074#include <__algorithm/max_element.h>
1075#include <__algorithm/merge.h>
1076#include <__algorithm/min.h>
1077#include <__algorithm/min_element.h>
1078#include <__algorithm/min_max_result.h>
1079#include <__algorithm/minmax.h>
1080#include <__algorithm/minmax_element.h>
1081#include <__algorithm/mismatch.h>
1082#include <__algorithm/move.h>
1083#include <__algorithm/move_backward.h>
1084#include <__algorithm/next_permutation.h>
1085#include <__algorithm/none_of.h>
1086#include <__algorithm/nth_element.h>
1087#include <__algorithm/partial_sort.h>
1088#include <__algorithm/partial_sort_copy.h>
1089#include <__algorithm/partition.h>
1090#include <__algorithm/partition_copy.h>
1091#include <__algorithm/partition_point.h>
1092#include <__algorithm/pop_heap.h>
1093#include <__algorithm/prev_permutation.h>
1094#include <__algorithm/push_heap.h>
1095#include <__algorithm/ranges_all_of.h>
1096#include <__algorithm/ranges_any_of.h>
1097#include <__algorithm/ranges_binary_search.h>
1098#include <__algorithm/ranges_copy.h>
1099#include <__algorithm/ranges_copy_backward.h>
1100#include <__algorithm/ranges_copy_if.h>
1101#include <__algorithm/ranges_copy_n.h>
1102#include <__algorithm/ranges_count.h>
1103#include <__algorithm/ranges_count_if.h>
1104#include <__algorithm/ranges_equal.h>
1105#include <__algorithm/ranges_fill.h>
1106#include <__algorithm/ranges_fill_n.h>
1107#include <__algorithm/ranges_find.h>
1108#include <__algorithm/ranges_find_if.h>
1109#include <__algorithm/ranges_find_if_not.h>
1110#include <__algorithm/ranges_for_each.h>
1111#include <__algorithm/ranges_for_each_n.h>
1112#include <__algorithm/ranges_is_partitioned.h>
1113#include <__algorithm/ranges_is_sorted.h>
1114#include <__algorithm/ranges_is_sorted_until.h>
1115#include <__algorithm/ranges_lower_bound.h>
1116#include <__algorithm/ranges_max.h>
1117#include <__algorithm/ranges_max_element.h>
1118#include <__algorithm/ranges_min.h>
1119#include <__algorithm/ranges_min_element.h>
1120#include <__algorithm/ranges_minmax.h>
1121#include <__algorithm/ranges_minmax_element.h>
1122#include <__algorithm/ranges_mismatch.h>
1123#include <__algorithm/ranges_none_of.h>
1124#include <__algorithm/ranges_reverse.h>
1125#include <__algorithm/ranges_swap_ranges.h>
1126#include <__algorithm/ranges_transform.h>
1127#include <__algorithm/ranges_upper_bound.h>
1128#include <__algorithm/remove.h>
1129#include <__algorithm/remove_copy.h>
1130#include <__algorithm/remove_copy_if.h>
1131#include <__algorithm/remove_if.h>
1132#include <__algorithm/replace.h>
1133#include <__algorithm/replace_copy.h>
1134#include <__algorithm/replace_copy_if.h>
1135#include <__algorithm/replace_if.h>
1136#include <__algorithm/reverse.h>
1137#include <__algorithm/reverse_copy.h>
1138#include <__algorithm/rotate.h>
1139#include <__algorithm/rotate_copy.h>
1140#include <__algorithm/sample.h>
1141#include <__algorithm/search.h>
1142#include <__algorithm/search_n.h>
1143#include <__algorithm/set_difference.h>
1144#include <__algorithm/set_intersection.h>
1145#include <__algorithm/set_symmetric_difference.h>
1146#include <__algorithm/set_union.h>
1147#include <__algorithm/shift_left.h>
1148#include <__algorithm/shift_right.h>
1149#include <__algorithm/shuffle.h>
1150#include <__algorithm/sift_down.h>
1151#include <__algorithm/sort.h>
1152#include <__algorithm/sort_heap.h>
1153#include <__algorithm/stable_partition.h>
1154#include <__algorithm/stable_sort.h>
1155#include <__algorithm/swap_ranges.h>
1156#include <__algorithm/transform.h>
1157#include <__algorithm/unique.h>
1158#include <__algorithm/unique_copy.h>
1159#include <__algorithm/unwrap_iter.h>
1160#include <__algorithm/upper_bound.h>
1161
1162#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
1163#  pragma GCC system_header
1164#endif
1165
1166#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
1167#   include <__pstl_algorithm>
1168#endif
1169
1170#endif // _LIBCPP_ALGORITHM
1171