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