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
374  template<forward_range R, class T, class Proj = identity,
375           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
376             ranges::less>
377    constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
378                                         Proj proj = {});                                     // since C++20
379  template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
380           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
381    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
382    constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
383                                       Pred pred = {},
384                                       Proj1 proj1 = {}, Proj2 proj2 = {});                 // since C++20
385
386  template<input_range R1, forward_range R2,
387           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
388    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
389    constexpr borrowed_iterator_t<R1>
390      ranges::find_first_of(R1&& r1, R2&& r2,
391                            Pred pred = {},
392                            Proj1 proj1 = {}, Proj2 proj2 = {});                            // since C++20
393
394  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
395           indirect_binary_predicate<projected<I, Proj>,
396                                     projected<I, Proj>> Pred = ranges::equal_to>
397    constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {});     // since C+20
398
399  template<forward_range R, class Proj = identity,
400           indirect_binary_predicate<projected<iterator_t<R>, Proj>,
401                                     projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
402    constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {});  // since C++20
403
404  template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity>
405    requires indirectly_writable<I, const T2&> &&
406             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
407    constexpr I
408      ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {});   // since C++20
409
410  template<input_range R, class T1, class T2, class Proj = identity>
411    requires indirectly_writable<iterator_t<R>, const T2&> &&
412             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
413    constexpr borrowed_iterator_t<R>
414      ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {});             // since C++20
415
416  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity,
417           indirect_unary_predicate<projected<I, Proj>> Pred>
418    requires indirectly_writable<I, const T&>
419    constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
420
421  template<input_range R, class T, class Proj = identity,
422           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
423    requires indirectly_writable<iterator_t<R>, const T&>
424    constexpr borrowed_iterator_t<R>
425      ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {});                     // since C++20
426
427}
428
429    constexpr bool     // constexpr in C++20
430    all_of(InputIterator first, InputIterator last, Predicate pred);
431
432template <class InputIterator, class Predicate>
433    constexpr bool     // constexpr in C++20
434    any_of(InputIterator first, InputIterator last, Predicate pred);
435
436template <class InputIterator, class Predicate>
437    constexpr bool     // constexpr in C++20
438    none_of(InputIterator first, InputIterator last, Predicate pred);
439
440template <class InputIterator, class Function>
441    constexpr Function          // constexpr in C++20
442    for_each(InputIterator first, InputIterator last, Function f);
443
444template<class InputIterator, class Size, class Function>
445    constexpr InputIterator     // constexpr in C++20
446    for_each_n(InputIterator first, Size n, Function f); // C++17
447
448template <class InputIterator, class T>
449    constexpr InputIterator     // constexpr in C++20
450    find(InputIterator first, InputIterator last, const T& value);
451
452template <class InputIterator, class Predicate>
453    constexpr InputIterator     // constexpr in C++20
454    find_if(InputIterator first, InputIterator last, Predicate pred);
455
456template<class InputIterator, class Predicate>
457    constexpr InputIterator     // constexpr in C++20
458    find_if_not(InputIterator first, InputIterator last, Predicate pred);
459
460template <class ForwardIterator1, class ForwardIterator2>
461    constexpr ForwardIterator1  // constexpr in C++20
462    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
463             ForwardIterator2 first2, ForwardIterator2 last2);
464
465template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
466    constexpr ForwardIterator1  // constexpr in C++20
467    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
468             ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
469
470template <class ForwardIterator1, class ForwardIterator2>
471    constexpr ForwardIterator1  // constexpr in C++20
472    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
473                  ForwardIterator2 first2, ForwardIterator2 last2);
474
475template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
476    constexpr ForwardIterator1  // constexpr in C++20
477    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
478                  ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
479
480template <class ForwardIterator>
481    constexpr ForwardIterator   // constexpr in C++20
482    adjacent_find(ForwardIterator first, ForwardIterator last);
483
484template <class ForwardIterator, class BinaryPredicate>
485    constexpr ForwardIterator   // constexpr in C++20
486    adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
487
488template <class InputIterator, class T>
489    constexpr typename iterator_traits<InputIterator>::difference_type  // constexpr in C++20
490    count(InputIterator first, InputIterator last, const T& value);
491
492template <class InputIterator, class Predicate>
493    constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20
494    count_if(InputIterator first, InputIterator last, Predicate pred);
495
496template <class InputIterator1, class InputIterator2>
497    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
498    mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
499
500template <class InputIterator1, class InputIterator2>
501    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
502    mismatch(InputIterator1 first1, InputIterator1 last1,
503             InputIterator2 first2, InputIterator2 last2); // **C++14**
504
505template <class InputIterator1, class InputIterator2, class BinaryPredicate>
506    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
507    mismatch(InputIterator1 first1, InputIterator1 last1,
508             InputIterator2 first2, BinaryPredicate pred);
509
510template <class InputIterator1, class InputIterator2, class BinaryPredicate>
511    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
512    mismatch(InputIterator1 first1, InputIterator1 last1,
513             InputIterator2 first2, InputIterator2 last2,
514             BinaryPredicate pred); // **C++14**
515
516template <class InputIterator1, class InputIterator2>
517    constexpr bool      // constexpr in C++20
518    equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
519
520template <class InputIterator1, class InputIterator2>
521    constexpr bool      // constexpr in C++20
522    equal(InputIterator1 first1, InputIterator1 last1,
523          InputIterator2 first2, InputIterator2 last2); // **C++14**
524
525template <class InputIterator1, class InputIterator2, class BinaryPredicate>
526    constexpr bool      // constexpr in C++20
527    equal(InputIterator1 first1, InputIterator1 last1,
528          InputIterator2 first2, BinaryPredicate pred);
529
530template <class InputIterator1, class InputIterator2, class BinaryPredicate>
531    constexpr bool      // constexpr in C++20
532    equal(InputIterator1 first1, InputIterator1 last1,
533          InputIterator2 first2, InputIterator2 last2,
534          BinaryPredicate pred); // **C++14**
535
536template<class ForwardIterator1, class ForwardIterator2>
537    constexpr bool      // constexpr in C++20
538    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
539                   ForwardIterator2 first2);
540
541template<class ForwardIterator1, class ForwardIterator2>
542    constexpr bool      // constexpr in C++20
543    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
544                   ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
545
546template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
547    constexpr bool      // constexpr in C++20
548    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
549                   ForwardIterator2 first2, BinaryPredicate pred);
550
551template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
552    constexpr bool      // constexpr in C++20
553    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
554                   ForwardIterator2 first2, ForwardIterator2 last2,
555                   BinaryPredicate pred);  // **C++14**
556
557template <class ForwardIterator1, class ForwardIterator2>
558    constexpr ForwardIterator1      // constexpr in C++20
559    search(ForwardIterator1 first1, ForwardIterator1 last1,
560           ForwardIterator2 first2, ForwardIterator2 last2);
561
562template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
563    constexpr ForwardIterator1      // constexpr in C++20
564    search(ForwardIterator1 first1, ForwardIterator1 last1,
565           ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
566
567template <class ForwardIterator, class Size, class T>
568    constexpr ForwardIterator       // constexpr in C++20
569    search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
570
571template <class ForwardIterator, class Size, class T, class BinaryPredicate>
572    constexpr ForwardIterator       // constexpr in C++20
573    search_n(ForwardIterator first, ForwardIterator last,
574             Size count, const T& value, BinaryPredicate pred);
575
576template <class InputIterator, class OutputIterator>
577    constexpr OutputIterator      // constexpr in C++20
578    copy(InputIterator first, InputIterator last, OutputIterator result);
579
580template<class InputIterator, class OutputIterator, class Predicate>
581    constexpr OutputIterator      // constexpr in C++20
582    copy_if(InputIterator first, InputIterator last,
583            OutputIterator result, Predicate pred);
584
585template<class InputIterator, class Size, class OutputIterator>
586    constexpr OutputIterator      // constexpr in C++20
587    copy_n(InputIterator first, Size n, OutputIterator result);
588
589template <class BidirectionalIterator1, class BidirectionalIterator2>
590    constexpr BidirectionalIterator2      // constexpr in C++20
591    copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
592                  BidirectionalIterator2 result);
593
594template <class ForwardIterator1, class ForwardIterator2>
595    constexpr ForwardIterator2    // constexpr in C++20
596    swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
597
598template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2>
599        requires indirectly_swappable<I1, I2>
600    constexpr ranges::swap_ranges_result<I1, I2>
601        ranges::swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2);
602
603template<input_range R1, input_range R2>
604        requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>
605    constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
606        ranges::swap_ranges(R1&& r1, R2&& r2);
607
608template <class ForwardIterator1, class ForwardIterator2>
609    constexpr void                // constexpr in C++20
610    iter_swap(ForwardIterator1 a, ForwardIterator2 b);
611
612template <class InputIterator, class OutputIterator, class UnaryOperation>
613    constexpr OutputIterator      // constexpr in C++20
614    transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
615
616template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
617    constexpr OutputIterator      // constexpr in C++20
618    transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
619              OutputIterator result, BinaryOperation binary_op);
620
621template <class ForwardIterator, class T>
622    constexpr void      // constexpr in C++20
623    replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
624
625template <class ForwardIterator, class Predicate, class T>
626    constexpr void      // constexpr in C++20
627    replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
628
629template <class InputIterator, class OutputIterator, class T>
630    constexpr OutputIterator      // constexpr in C++20
631    replace_copy(InputIterator first, InputIterator last, OutputIterator result,
632                 const T& old_value, const T& new_value);
633
634template <class InputIterator, class OutputIterator, class Predicate, class T>
635    constexpr OutputIterator      // constexpr in C++20
636    replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
637
638template <class ForwardIterator, class T>
639    constexpr void      // constexpr in C++20
640    fill(ForwardIterator first, ForwardIterator last, const T& value);
641
642template <class OutputIterator, class Size, class T>
643    constexpr OutputIterator      // constexpr in C++20
644    fill_n(OutputIterator first, Size n, const T& value);
645
646template <class ForwardIterator, class Generator>
647    constexpr void      // constexpr in C++20
648    generate(ForwardIterator first, ForwardIterator last, Generator gen);
649
650template <class OutputIterator, class Size, class Generator>
651    constexpr OutputIterator      // constexpr in C++20
652    generate_n(OutputIterator first, Size n, Generator gen);
653
654template <class ForwardIterator, class T>
655    constexpr ForwardIterator     // constexpr in C++20
656    remove(ForwardIterator first, ForwardIterator last, const T& value);
657
658template <class ForwardIterator, class Predicate>
659    constexpr ForwardIterator     // constexpr in C++20
660    remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
661
662template <class InputIterator, class OutputIterator, class T>
663    constexpr OutputIterator     // constexpr in C++20
664    remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
665
666template <class InputIterator, class OutputIterator, class Predicate>
667    constexpr OutputIterator     // constexpr in C++20
668    remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
669
670template <class ForwardIterator>
671    constexpr ForwardIterator    // constexpr in C++20
672    unique(ForwardIterator first, ForwardIterator last);
673
674template <class ForwardIterator, class BinaryPredicate>
675    constexpr ForwardIterator    // constexpr in C++20
676    unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
677
678template <class InputIterator, class OutputIterator>
679    constexpr OutputIterator     // constexpr in C++20
680    unique_copy(InputIterator first, InputIterator last, OutputIterator result);
681
682template <class InputIterator, class OutputIterator, class BinaryPredicate>
683    constexpr OutputIterator     // constexpr in C++20
684    unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
685
686template <class BidirectionalIterator>
687    constexpr void               // constexpr in C++20
688    reverse(BidirectionalIterator first, BidirectionalIterator last);
689
690template <class BidirectionalIterator, class OutputIterator>
691    constexpr OutputIterator       // constexpr in C++20
692    reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
693
694template <class ForwardIterator>
695    constexpr ForwardIterator      // constexpr in C++20
696    rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
697
698template <class ForwardIterator, class OutputIterator>
699    constexpr OutputIterator       // constexpr in C++20
700    rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
701
702template <class RandomAccessIterator>
703    void
704    random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
705
706template <class RandomAccessIterator, class RandomNumberGenerator>
707    void
708    random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
709                   RandomNumberGenerator& rand);  // deprecated in C++14, removed in C++17
710
711template<class PopulationIterator, class SampleIterator,
712         class Distance, class UniformRandomBitGenerator>
713    SampleIterator sample(PopulationIterator first, PopulationIterator last,
714                          SampleIterator out, Distance n,
715                          UniformRandomBitGenerator&& g); // C++17
716
717template<class RandomAccessIterator, class UniformRandomNumberGenerator>
718    void shuffle(RandomAccessIterator first, RandomAccessIterator last,
719                 UniformRandomNumberGenerator&& g);
720
721template<class ForwardIterator>
722  constexpr ForwardIterator
723    shift_left(ForwardIterator first, ForwardIterator last,
724               typename iterator_traits<ForwardIterator>::difference_type n); // C++20
725
726template<class ForwardIterator>
727  constexpr ForwardIterator
728    shift_right(ForwardIterator first, ForwardIterator last,
729                typename iterator_traits<ForwardIterator>::difference_type n); // C++20
730
731template <class InputIterator, class Predicate>
732    constexpr bool  // constexpr in C++20
733    is_partitioned(InputIterator first, InputIterator last, Predicate pred);
734
735template <class ForwardIterator, class Predicate>
736    constexpr ForwardIterator  // constexpr in C++20
737    partition(ForwardIterator first, ForwardIterator last, Predicate pred);
738
739template <class InputIterator, class OutputIterator1,
740          class OutputIterator2, class Predicate>
741    constexpr pair<OutputIterator1, OutputIterator2>   // constexpr in C++20
742    partition_copy(InputIterator first, InputIterator last,
743                   OutputIterator1 out_true, OutputIterator2 out_false,
744                   Predicate pred);
745
746template <class ForwardIterator, class Predicate>
747    ForwardIterator
748    stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
749
750template<class ForwardIterator, class Predicate>
751    constexpr ForwardIterator  // constexpr in C++20
752    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
753
754template <class ForwardIterator>
755    constexpr bool  // constexpr in C++20
756    is_sorted(ForwardIterator first, ForwardIterator last);
757
758template <class ForwardIterator, class Compare>
759    constexpr bool  // constexpr in C++20
760    is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
761
762template<class ForwardIterator>
763    constexpr ForwardIterator    // constexpr in C++20
764    is_sorted_until(ForwardIterator first, ForwardIterator last);
765
766template <class ForwardIterator, class Compare>
767    constexpr ForwardIterator    // constexpr in C++20
768    is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
769
770template <class RandomAccessIterator>
771    constexpr void               // constexpr in C++20
772    sort(RandomAccessIterator first, RandomAccessIterator last);
773
774template <class RandomAccessIterator, class Compare>
775    constexpr void               // constexpr in C++20
776    sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
777
778template <class RandomAccessIterator>
779    void
780    stable_sort(RandomAccessIterator first, RandomAccessIterator last);
781
782template <class RandomAccessIterator, class Compare>
783    void
784    stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
785
786template <class RandomAccessIterator>
787    constexpr void                    // constexpr in C++20
788    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
789
790template <class RandomAccessIterator, class Compare>
791    constexpr void                    // constexpr in C++20
792    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
793
794template <class InputIterator, class RandomAccessIterator>
795    constexpr RandomAccessIterator    // constexpr in C++20
796    partial_sort_copy(InputIterator first, InputIterator last,
797                      RandomAccessIterator result_first, RandomAccessIterator result_last);
798
799template <class InputIterator, class RandomAccessIterator, class Compare>
800    constexpr RandomAccessIterator    // constexpr in C++20
801    partial_sort_copy(InputIterator first, InputIterator last,
802                      RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
803
804template <class RandomAccessIterator>
805    constexpr void                    // constexpr in C++20
806    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
807
808template <class RandomAccessIterator, class Compare>
809    constexpr void                    // constexpr in C++20
810    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
811
812template <class ForwardIterator, class T>
813    constexpr ForwardIterator                         // constexpr in C++20
814    lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
815
816template <class ForwardIterator, class T, class Compare>
817    constexpr ForwardIterator                         // constexpr in C++20
818    lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
819
820template <class ForwardIterator, class T>
821    constexpr ForwardIterator                         // constexpr in C++20
822    upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
823
824template <class ForwardIterator, class T, class Compare>
825    constexpr ForwardIterator                         // constexpr in C++20
826    upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
827
828template <class ForwardIterator, class T>
829    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
830    equal_range(ForwardIterator first, ForwardIterator last, const T& value);
831
832template <class ForwardIterator, class T, class Compare>
833    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
834    equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
835
836template <class ForwardIterator, class T>
837    constexpr bool                                    // constexpr in C++20
838    binary_search(ForwardIterator first, ForwardIterator last, const T& value);
839
840template <class ForwardIterator, class T, class Compare>
841    constexpr bool                                    // constexpr in C++20
842    binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
843
844template <class InputIterator1, class InputIterator2, class OutputIterator>
845    constexpr OutputIterator                          // constexpr in C++20
846    merge(InputIterator1 first1, InputIterator1 last1,
847          InputIterator2 first2, InputIterator2 last2, OutputIterator result);
848
849template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
850    constexpr OutputIterator                          // constexpr in C++20
851    merge(InputIterator1 first1, InputIterator1 last1,
852          InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
853
854template <class BidirectionalIterator>
855    void
856    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
857
858template <class BidirectionalIterator, class Compare>
859    void
860    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
861
862template <class InputIterator1, class InputIterator2>
863    constexpr bool                                    // constexpr in C++20
864    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
865
866template <class InputIterator1, class InputIterator2, class Compare>
867    constexpr bool                                    // constexpr in C++20
868    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
869
870template <class InputIterator1, class InputIterator2, class OutputIterator>
871    constexpr OutputIterator                          // constexpr in C++20
872    set_union(InputIterator1 first1, InputIterator1 last1,
873              InputIterator2 first2, InputIterator2 last2, OutputIterator result);
874
875template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
876    constexpr OutputIterator                          // constexpr in C++20
877    set_union(InputIterator1 first1, InputIterator1 last1,
878              InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
879
880template <class InputIterator1, class InputIterator2, class OutputIterator>
881    constexpr OutputIterator                         // constexpr in C++20
882    set_intersection(InputIterator1 first1, InputIterator1 last1,
883                     InputIterator2 first2, InputIterator2 last2, OutputIterator result);
884
885template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
886    constexpr OutputIterator                         // constexpr in C++20
887    set_intersection(InputIterator1 first1, InputIterator1 last1,
888                     InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
889
890template <class InputIterator1, class InputIterator2, class OutputIterator>
891    constexpr OutputIterator                         // constexpr in C++20
892    set_difference(InputIterator1 first1, InputIterator1 last1,
893                   InputIterator2 first2, InputIterator2 last2, OutputIterator result);
894
895template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
896    constexpr OutputIterator                         // constexpr in C++20
897    set_difference(InputIterator1 first1, InputIterator1 last1,
898                   InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
899
900template <class InputIterator1, class InputIterator2, class OutputIterator>
901    constexpr OutputIterator                         // constexpr in C++20
902    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
903                             InputIterator2 first2, InputIterator2 last2, OutputIterator result);
904
905template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
906    constexpr OutputIterator                         // constexpr in C++20
907    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
908                             InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
909
910template <class RandomAccessIterator>
911    constexpr void                                   // constexpr in C++20
912    push_heap(RandomAccessIterator first, RandomAccessIterator last);
913
914template <class RandomAccessIterator, class Compare>
915    constexpr void                                   // constexpr in C++20
916    push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
917
918template <class RandomAccessIterator>
919    constexpr void                                   // constexpr in C++20
920    pop_heap(RandomAccessIterator first, RandomAccessIterator last);
921
922template <class RandomAccessIterator, class Compare>
923    constexpr void                                   // constexpr in C++20
924    pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
925
926template <class RandomAccessIterator>
927    constexpr void                                   // constexpr in C++20
928    make_heap(RandomAccessIterator first, RandomAccessIterator last);
929
930template <class RandomAccessIterator, class Compare>
931    constexpr void                                   // constexpr in C++20
932    make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
933
934template <class RandomAccessIterator>
935    constexpr void                                   // constexpr in C++20
936    sort_heap(RandomAccessIterator first, RandomAccessIterator last);
937
938template <class RandomAccessIterator, class Compare>
939    constexpr void                                   // constexpr in C++20
940    sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
941
942template <class RandomAccessIterator>
943    constexpr bool   // constexpr in C++20
944    is_heap(RandomAccessIterator first, RandomAccessiterator last);
945
946template <class RandomAccessIterator, class Compare>
947    constexpr bool   // constexpr in C++20
948    is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
949
950template <class RandomAccessIterator>
951    constexpr RandomAccessIterator   // constexpr in C++20
952    is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
953
954template <class RandomAccessIterator, class Compare>
955    constexpr RandomAccessIterator   // constexpr in C++20
956    is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
957
958template <class ForwardIterator>
959    constexpr ForwardIterator        // constexpr in C++14
960    min_element(ForwardIterator first, ForwardIterator last);
961
962template <class ForwardIterator, class Compare>
963    constexpr ForwardIterator        // constexpr in C++14
964    min_element(ForwardIterator first, ForwardIterator last, Compare comp);
965
966template <class T>
967    constexpr const T&               // constexpr in C++14
968    min(const T& a, const T& b);
969
970template <class T, class Compare>
971    constexpr const T&               // constexpr in C++14
972    min(const T& a, const T& b, Compare comp);
973
974template<class T>
975    constexpr T                      // constexpr in C++14
976    min(initializer_list<T> t);
977
978template<class T, class Compare>
979    constexpr T                      // constexpr in C++14
980    min(initializer_list<T> t, Compare comp);
981
982template<class T>
983    constexpr const T& clamp(const T& v, const T& lo, const T& hi);               // C++17
984
985template<class T, class Compare>
986    constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
987
988template <class ForwardIterator>
989    constexpr ForwardIterator        // constexpr in C++14
990    max_element(ForwardIterator first, ForwardIterator last);
991
992template <class ForwardIterator, class Compare>
993    constexpr ForwardIterator        // constexpr in C++14
994    max_element(ForwardIterator first, ForwardIterator last, Compare comp);
995
996template <class T>
997    constexpr const T&               // constexpr in C++14
998    max(const T& a, const T& b);
999
1000template <class T, class Compare>
1001    constexpr const T&               // constexpr in C++14
1002    max(const T& a, const T& b, Compare comp);
1003
1004template<class T>
1005    constexpr T                      // constexpr in C++14
1006    max(initializer_list<T> t);
1007
1008template<class T, class Compare>
1009    constexpr T                      // constexpr in C++14
1010    max(initializer_list<T> t, Compare comp);
1011
1012template<class ForwardIterator>
1013    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1014    minmax_element(ForwardIterator first, ForwardIterator last);
1015
1016template<class ForwardIterator, class Compare>
1017    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1018    minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1019
1020template<class T>
1021    constexpr pair<const T&, const T&>  // constexpr in C++14
1022    minmax(const T& a, const T& b);
1023
1024template<class T, class Compare>
1025    constexpr pair<const T&, const T&>  // constexpr in C++14
1026    minmax(const T& a, const T& b, Compare comp);
1027
1028template<class T>
1029    constexpr pair<T, T>                // constexpr in C++14
1030    minmax(initializer_list<T> t);
1031
1032template<class T, class Compare>
1033    constexpr pair<T, T>                // constexpr in C++14
1034    minmax(initializer_list<T> t, Compare comp);
1035
1036template <class InputIterator1, class InputIterator2>
1037    constexpr bool     // constexpr in C++20
1038    lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1039
1040template <class InputIterator1, class InputIterator2, class Compare>
1041    constexpr bool     // constexpr in C++20
1042    lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
1043                            InputIterator2 first2, InputIterator2 last2, Compare comp);
1044
1045template <class BidirectionalIterator>
1046    constexpr bool     // constexpr in C++20
1047    next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1048
1049template <class BidirectionalIterator, class Compare>
1050    constexpr bool     // constexpr in C++20
1051    next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1052
1053template <class BidirectionalIterator>
1054    constexpr bool     // constexpr in C++20
1055    prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1056
1057template <class BidirectionalIterator, class Compare>
1058    constexpr bool     // constexpr in C++20
1059    prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1060}  // std
1061
1062*/
1063
1064#include <__assert> // all public C++ headers provide the assertion handler
1065#include <__bits>
1066#include <__config>
1067#include <__debug>
1068#include <cstddef>
1069#include <cstring>
1070#include <initializer_list>
1071#include <iterator> // TODO: Remove this include
1072#include <memory>
1073#include <type_traits>
1074#include <version>
1075
1076#include <__algorithm/adjacent_find.h>
1077#include <__algorithm/all_of.h>
1078#include <__algorithm/any_of.h>
1079#include <__algorithm/binary_search.h>
1080#include <__algorithm/clamp.h>
1081#include <__algorithm/comp.h>
1082#include <__algorithm/comp_ref_type.h>
1083#include <__algorithm/copy.h>
1084#include <__algorithm/copy_backward.h>
1085#include <__algorithm/copy_if.h>
1086#include <__algorithm/copy_n.h>
1087#include <__algorithm/count.h>
1088#include <__algorithm/count_if.h>
1089#include <__algorithm/equal.h>
1090#include <__algorithm/equal_range.h>
1091#include <__algorithm/fill.h>
1092#include <__algorithm/fill_n.h>
1093#include <__algorithm/find.h>
1094#include <__algorithm/find_end.h>
1095#include <__algorithm/find_first_of.h>
1096#include <__algorithm/find_if.h>
1097#include <__algorithm/find_if_not.h>
1098#include <__algorithm/for_each.h>
1099#include <__algorithm/for_each_n.h>
1100#include <__algorithm/generate.h>
1101#include <__algorithm/generate_n.h>
1102#include <__algorithm/half_positive.h>
1103#include <__algorithm/in_found_result.h>
1104#include <__algorithm/in_fun_result.h>
1105#include <__algorithm/in_in_out_result.h>
1106#include <__algorithm/in_in_result.h>
1107#include <__algorithm/in_out_out_result.h>
1108#include <__algorithm/in_out_result.h>
1109#include <__algorithm/includes.h>
1110#include <__algorithm/inplace_merge.h>
1111#include <__algorithm/is_heap.h>
1112#include <__algorithm/is_heap_until.h>
1113#include <__algorithm/is_partitioned.h>
1114#include <__algorithm/is_permutation.h>
1115#include <__algorithm/is_sorted.h>
1116#include <__algorithm/is_sorted_until.h>
1117#include <__algorithm/iter_swap.h>
1118#include <__algorithm/lexicographical_compare.h>
1119#include <__algorithm/lower_bound.h>
1120#include <__algorithm/make_heap.h>
1121#include <__algorithm/max.h>
1122#include <__algorithm/max_element.h>
1123#include <__algorithm/merge.h>
1124#include <__algorithm/min.h>
1125#include <__algorithm/min_element.h>
1126#include <__algorithm/min_max_result.h>
1127#include <__algorithm/minmax.h>
1128#include <__algorithm/minmax_element.h>
1129#include <__algorithm/mismatch.h>
1130#include <__algorithm/move.h>
1131#include <__algorithm/move_backward.h>
1132#include <__algorithm/next_permutation.h>
1133#include <__algorithm/none_of.h>
1134#include <__algorithm/nth_element.h>
1135#include <__algorithm/partial_sort.h>
1136#include <__algorithm/partial_sort_copy.h>
1137#include <__algorithm/partition.h>
1138#include <__algorithm/partition_copy.h>
1139#include <__algorithm/partition_point.h>
1140#include <__algorithm/pop_heap.h>
1141#include <__algorithm/prev_permutation.h>
1142#include <__algorithm/push_heap.h>
1143#include <__algorithm/ranges_adjacent_find.h>
1144#include <__algorithm/ranges_all_of.h>
1145#include <__algorithm/ranges_any_of.h>
1146#include <__algorithm/ranges_binary_search.h>
1147#include <__algorithm/ranges_copy.h>
1148#include <__algorithm/ranges_copy_backward.h>
1149#include <__algorithm/ranges_copy_if.h>
1150#include <__algorithm/ranges_copy_n.h>
1151#include <__algorithm/ranges_count.h>
1152#include <__algorithm/ranges_count_if.h>
1153#include <__algorithm/ranges_equal.h>
1154#include <__algorithm/ranges_fill.h>
1155#include <__algorithm/ranges_fill_n.h>
1156#include <__algorithm/ranges_find.h>
1157#include <__algorithm/ranges_find_first_of.h>
1158#include <__algorithm/ranges_find_if.h>
1159#include <__algorithm/ranges_find_if_not.h>
1160#include <__algorithm/ranges_for_each.h>
1161#include <__algorithm/ranges_for_each_n.h>
1162#include <__algorithm/ranges_is_partitioned.h>
1163#include <__algorithm/ranges_is_sorted.h>
1164#include <__algorithm/ranges_is_sorted_until.h>
1165#include <__algorithm/ranges_lower_bound.h>
1166#include <__algorithm/ranges_max.h>
1167#include <__algorithm/ranges_max_element.h>
1168#include <__algorithm/ranges_min.h>
1169#include <__algorithm/ranges_min_element.h>
1170#include <__algorithm/ranges_minmax.h>
1171#include <__algorithm/ranges_minmax_element.h>
1172#include <__algorithm/ranges_mismatch.h>
1173#include <__algorithm/ranges_none_of.h>
1174#include <__algorithm/ranges_replace.h>
1175#include <__algorithm/ranges_replace_if.h>
1176#include <__algorithm/ranges_reverse.h>
1177#include <__algorithm/ranges_swap_ranges.h>
1178#include <__algorithm/ranges_transform.h>
1179#include <__algorithm/ranges_upper_bound.h>
1180#include <__algorithm/remove.h>
1181#include <__algorithm/remove_copy.h>
1182#include <__algorithm/remove_copy_if.h>
1183#include <__algorithm/remove_if.h>
1184#include <__algorithm/replace.h>
1185#include <__algorithm/replace_copy.h>
1186#include <__algorithm/replace_copy_if.h>
1187#include <__algorithm/replace_if.h>
1188#include <__algorithm/reverse.h>
1189#include <__algorithm/reverse_copy.h>
1190#include <__algorithm/rotate.h>
1191#include <__algorithm/rotate_copy.h>
1192#include <__algorithm/sample.h>
1193#include <__algorithm/search.h>
1194#include <__algorithm/search_n.h>
1195#include <__algorithm/set_difference.h>
1196#include <__algorithm/set_intersection.h>
1197#include <__algorithm/set_symmetric_difference.h>
1198#include <__algorithm/set_union.h>
1199#include <__algorithm/shift_left.h>
1200#include <__algorithm/shift_right.h>
1201#include <__algorithm/shuffle.h>
1202#include <__algorithm/sift_down.h>
1203#include <__algorithm/sort.h>
1204#include <__algorithm/sort_heap.h>
1205#include <__algorithm/stable_partition.h>
1206#include <__algorithm/stable_sort.h>
1207#include <__algorithm/swap_ranges.h>
1208#include <__algorithm/transform.h>
1209#include <__algorithm/unique.h>
1210#include <__algorithm/unique_copy.h>
1211#include <__algorithm/unwrap_iter.h>
1212#include <__algorithm/upper_bound.h>
1213
1214#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
1215#  pragma GCC system_header
1216#endif
1217
1218#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
1219#   include <__pstl_algorithm>
1220#endif
1221
1222#endif // _LIBCPP_ALGORITHM
1223