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