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