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