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
23  // [algorithms.results], algorithm result types
24  template <class I, class F>
25    struct in_fun_result;     // since C++20
26
27  template <class I1, class I2>
28    struct in_in_result;      // since C++20
29
30  template <class I, class O>
31    struct in_out_result;  // since C++20
32
33  template <class I1, class I2, class O>
34    struct in_in_out_result;  // since C++20
35
36  template <class I, class O1, class O2>
37    struct in_out_out_result; // since C++20
38
39  template <class I1, class I2>
40    struct min_max_result;    // since C++20
41
42  template <class I>
43    struct in_found_result;   // since C++20
44
45  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
46    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>             // since C++20
47  constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
48
49  template<forward_range R, class Proj = identity,
50    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
51  constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
52
53  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
54    indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
55  constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {});                        // since C++20
56
57  template<forward_range R, class Proj = identity,
58    indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
59  constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {});             // since C++20
60
61  template<class I1, class I2>
62    using mismatch_result = in_in_result<I1, I2>;
63
64  template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2,
65          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
66    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
67  constexpr mismatch_result<_I1, _I2>
68  mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20
69
70  template <input_range R1, input_range R2,
71          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
72    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
73  constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
74  mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {})                           // since C++20
75
76    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
77    constexpr I find(I first, S last, const T& value, Proj proj = {});              // since C++20
78
79  template<input_range R, class T, class Proj = identity>
80    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
81    constexpr borrowed_iterator_t<R>
82      find(R&& r, const T& value, Proj proj = {});                                  // since C++20
83
84  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
85           indirect_unary_predicate<projected<I, Proj>> Pred>
86    constexpr I find_if(I first, S last, Pred pred, Proj proj = {});                // since C++20
87
88  template<input_range R, class Proj = identity,
89           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
90    constexpr borrowed_iterator_t<R>
91      find_if(R&& r, Pred pred, Proj proj = {});                                    // since C++20
92
93  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
94           indirect_unary_predicate<projected<I, Proj>> Pred>
95    constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {});            // since C++20
96
97  template<input_range R, class Proj = identity,
98           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
99    constexpr borrowed_iterator_t<R>
100      find_if_not(R&& r, Pred pred, Proj proj = {});                                // since C++20
101
102  template<class T, class Proj = identity,
103           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
104    constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
105
106  template<copyable T, class Proj = identity,
107           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
108    constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {});         // since C++20
109
110 template<input_range R, class Proj = identity,
111          indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
112   requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
113   constexpr range_value_t<R>
114     min(R&& r, Comp comp = {}, Proj proj = {});                                    // since C++20
115
116  template<class T, class Proj = identity,
117           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
118    constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
119
120  template<copyable T, class Proj = identity,
121           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
122    constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {});         // since C++20
123
124  template<input_range R, class Proj = identity,
125           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
126    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
127    constexpr range_value_t<R>
128      max(R&& r, Comp comp = {}, Proj proj = {});                                   // since C++20
129
130  template<class I, class O>
131    using unary_transform_result = in_out_result<I, O>;                             // since C++20
132
133  template<class I1, class I2, class O>
134    using binary_transform_result = in_in_out_result<I1, I2, O>;                    // since C++20
135
136  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O,
137           copy_constructible F, class Proj = identity>
138    requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>>
139    constexpr ranges::unary_transform_result<I, O>
140      transform(I first1, S last1, O result, F op, Proj proj = {});                 // since C++20
141
142  template<input_range R, weakly_incrementable O, copy_constructible F,
143           class Proj = identity>
144    requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>>
145    constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O>
146      transform(R&& r, O result, F op, Proj proj = {});                             // since C++20
147
148  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
149           weakly_incrementable O, copy_constructible F, class Proj1 = identity,
150           class Proj2 = identity>
151    requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>,
152                                           projected<I2, Proj2>>>
153    constexpr ranges::binary_transform_result<I1, I2, O>
154      transform(I1 first1, S1 last1, I2 first2, S2 last2, O result,
155                        F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});           // since C++20
156
157  template<input_range R1, input_range R2, weakly_incrementable O,
158           copy_constructible F, class Proj1 = identity, class Proj2 = identity>
159    requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>,
160                                           projected<iterator_t<R2>, Proj2>>>
161    constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
162      transform(R1&& r1, R2&& r2, O result,
163                        F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});           // since C++20
164
165  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity>
166    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
167    constexpr iter_difference_t<I>
168      count(I first, S last, const T& value, Proj proj = {});                       // since C++20
169
170  template<input_range R, class T, class Proj = identity>
171    requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
172    constexpr range_difference_t<R>
173      count(R&& r, const T& value, Proj proj = {});                                 // since C++20
174
175  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
176           indirect_unary_predicate<projected<I, Proj>> Pred>
177    constexpr iter_difference_t<I>
178      count_if(I first, S last, Pred pred, Proj proj = {});                         // since C++20
179
180  template<input_range R, class Proj = identity,
181           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
182    constexpr range_difference_t<R>
183      count_if(R&& r, Pred pred, Proj proj = {});                                   // since C++20
184
185  template<class T>
186  using minmax_result = min_max_result<T>;
187
188  template<class T, class Proj = identity,
189           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
190    constexpr ranges::minmax_result<const T&>
191      minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {});                     // since C++20
192
193  template<copyable T, class Proj = identity,
194           indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
195    constexpr ranges::minmax_result<T>
196      minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {});                      // since C++20
197
198  template<input_range R, class Proj = identity,
199           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
200    requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
201    constexpr ranges::minmax_result<range_value_t<R>>
202      minmax(R&& r, Comp comp = {}, Proj proj = {});                                      // since C++20
203
204  template<class I>
205  using minmax_element_result = min_max_result<I>;
206
207  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
208           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
209    constexpr ranges::minmax_element_result<I>
210      minmax_element(I first, S last, Comp comp = {}, Proj proj = {});                    // since C++20
211
212  template<forward_range R, class Proj = identity,
213           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
214    constexpr ranges::minmax_element_result<borrowed_iterator_t<R>>
215      minmax_element(R&& r, Comp comp = {}, Proj proj = {});                              // since C++20
216
217  template<class I, class O>
218    using copy_result = in_out_result<I, O>;                                              // since C++20
219
220  template<class I, class O>
221    using copy_n_result = in_out_result<I, O>;                                            // since C++20
222
223  template<class I, class O>
224    using copy_if_result = in_out_result<I, O>;                                             // since C++20
225
226  template<class I1, class I2>
227    using copy_backward_result = in_out_result<I1, I2>;                                     // since C++20
228
229  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
230    requires indirectly_copyable<I, O>
231    constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result);            // since C++20
232
233  template<input_range R, weakly_incrementable O>
234    requires indirectly_copyable<iterator_t<R>, O>
235    constexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20
236
237  template<input_iterator I, weakly_incrementable O>
238    requires indirectly_copyable<I, O>
239    constexpr ranges::copy_n_result<I, O>
240      ranges::copy_n(I first, iter_difference_t<I> n, O result);                            // since C++20
241
242  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity,
243           indirect_unary_predicate<projected<I, Proj>> Pred>
244    requires indirectly_copyable<I, O>
245    constexpr ranges::copy_if_result<I, O>
246      ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {});                // since C++20
247
248  template<input_range R, weakly_incrementable O, class Proj = identity,
249           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
250    requires indirectly_copyable<iterator_t<R>, O>
251    constexpr ranges::copy_if_result<borrowed_iterator_t<R>, O>
252      ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {});                          // since C++20
253
254  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
255    requires indirectly_copyable<I1, I2>
256    constexpr ranges::copy_backward_result<I1, I2>
257      ranges::copy_backward(I1 first, S1 last, I2 result);                                  // since C++20
258
259  template<bidirectional_range R, bidirectional_iterator I>
260    requires indirectly_copyable<iterator_t<R>, I>
261    constexpr ranges::copy_backward_result<borrowed_iterator_t<R>, I>
262      ranges::copy_backward(R&& r, I result);                                               // since C++20
263
264  template<class I, class F>
265    using for_each_result = in_fun_result<I, F>;                                            // since C++20
266
267  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
268           indirectly_unary_invocable<projected<I, Proj>> Fun>
269    constexpr ranges::for_each_result<I, Fun>
270      ranges::for_each(I first, S last, Fun f, Proj proj = {});                             // since C++20
271
272  template<input_range R, class Proj = identity,
273           indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun>
274    constexpr ranges::for_each_result<borrowed_iterator_t<R>, Fun>
275      ranges::for_each(R&& r, Fun f, Proj proj = {});                                       // since C++20
276
277  template<input_iterator I, class Proj = identity,
278           indirectly_unary_invocable<projected<I, Proj>> Fun>
279    constexpr ranges::for_each_n_result<I, Fun>
280      ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {});           // since C++20
281
282  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
283           indirect_unary_predicate<projected<I, Proj>> Pred>
284    constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {});      // since C++20
285
286  template<input_range R, class Proj = identity,
287           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
288    constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {});                // since C++20
289
290  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
291          class Proj = identity>
292    requires sortable<I, Comp, Proj>
293    constexpr I
294      ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
295
296  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
297    requires sortable<iterator_t<R>, Comp, Proj>
298    constexpr borrowed_iterator_t<R>
299      ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
300
301  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
302          class Proj = identity>
303    requires sortable<I, Comp, Proj>
304    constexpr I
305      ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {});                    // since C++20
306
307  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
308    requires sortable<iterator_t<R>, Comp, Proj>
309    constexpr borrowed_iterator_t<R>
310      ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {});                              // since C++20
311
312  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
313          class Proj = identity>
314    requires sortable<I, Comp, Proj>
315    constexpr I
316      ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
317
318  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
319    requires sortable<iterator_t<R>, Comp, Proj>
320    constexpr borrowed_iterator_t<R>
321      ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
322
323  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
324          class Proj = identity>
325    requires sortable<I, Comp, Proj>
326    constexpr I
327      ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {});                   // since C++20
328
329  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
330    requires sortable<iterator_t<R>, Comp, Proj>
331    constexpr borrowed_iterator_t<R>
332      ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {});                             // since C++20
333
334  template<bidirectional_iterator I, sentinel_for<I> S>
335    requires permutable<I>
336    constexpr I ranges::reverse(I first, S last);                                           // since C++20
337
338  template<bidirectional_range R>
339    requires permutable<iterator_t<R>>
340    constexpr borrowed_iterator_t<R> ranges::reverse(R&& r);                                // since C++20
341
342  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
343            class Proj = identity>
344    requires sortable<I, Comp, Proj>
345    constexpr I
346      ranges::sort(I first, S last, Comp comp = {}, Proj proj = {});                        // since C++20
347
348  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
349    requires sortable<iterator_t<R>, Comp, Proj>
350    constexpr borrowed_iterator_t<R>
351      ranges::sort(R&& r, Comp comp = {}, Proj proj = {});                                  // since C++20
352
353  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
354          class Proj = identity>
355    requires sortable<I, Comp, Proj>
356    I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {});                 // since C++20
357
358  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
359    requires sortable<iterator_t<R>, Comp, Proj>
360    borrowed_iterator_t<R>
361      ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {});                           // since C++20
362
363  template<class T, output_iterator<const T&> O, sentinel_for<O> S>
364    constexpr O ranges::fill(O first, S last, const T& value);                              // since C++20
365
366  template<class T, output_range<const T&> R>
367    constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value);                   // since C++20
368
369  template<class T, output_iterator<const T&> O>
370    constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value);            // since C++20
371
372 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
373          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
374   requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
375   constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2,
376                                Pred pred = {},
377                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
378
379 template<input_range R1, input_range R2, class Pred = ranges::equal_to,
380          class Proj1 = identity, class Proj2 = identity>
381   requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
382   constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
383                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
384
385  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
386           indirect_unary_predicate<projected<I, Proj>> Pred>
387    constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
388
389  template<input_range R, class Proj = identity,
390           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
391    constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {});                // since C++20
392
393  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
394           indirect_unary_predicate<projected<I, Proj>> Pred>
395    constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
396
397  template<input_range R, class Proj = identity,
398           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
399    constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {});                // since C++20
400
401  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
402           indirect_unary_predicate<projected<I, Proj>> Pred>
403    constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {});     // since C++20
404
405  template<input_range R, class Proj = identity,
406           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
407    constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {});               // since C++20
408
409  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
410           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
411    constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});      // since C++20
412
413  template<forward_range R, class Proj = identity,
414           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
415    constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});                // since C++20
416
417  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
418           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
419    constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});   // since C++20
420
421  template<forward_range R, class Proj = identity,
422           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
423    constexpr borrowed_iterator_t<R>
424      ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});                       // since C++20
425
426  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
427          class Proj = identity>
428    requires sortable<I, Comp, Proj>
429    constexpr I
430      ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {});            // since C++20
431
432  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
433    requires sortable<iterator_t<R>, Comp, Proj>
434    constexpr borrowed_iterator_t<R>
435      ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {});          // since C++20
436
437  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
438           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
439    constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
440
441  template<forward_range R, class T, class Proj = identity,
442           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
443             ranges::less>
444    constexpr borrowed_iterator_t<R>
445      upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
446
447  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
448           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
449    constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
450                                    Proj proj = {});                                          // since C++20
451  template<forward_range R, class T, class Proj = identity,
452           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
453             ranges::less>
454    constexpr borrowed_iterator_t<R>
455      lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
456
457  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
458           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
459    constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
460                                         Proj proj = {});                                     // since C++20
461
462  template<forward_range R, class T, class Proj = identity,
463           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
464             ranges::less>
465    constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
466                                         Proj proj = {});                                     // since C++20
467  template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
468           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
469    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
470    constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
471                                       Pred pred = {},
472                                       Proj1 proj1 = {}, Proj2 proj2 = {});                 // since C++20
473
474  template<input_range R1, forward_range R2,
475           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
476    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
477    constexpr borrowed_iterator_t<R1>
478      ranges::find_first_of(R1&& r1, R2&& r2,
479                            Pred pred = {},
480                            Proj1 proj1 = {}, Proj2 proj2 = {});                            // since C++20
481
482  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
483           indirect_binary_predicate<projected<I, Proj>,
484                                     projected<I, Proj>> Pred = ranges::equal_to>
485    constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {});     // since C+20
486
487  template<forward_range R, class Proj = identity,
488           indirect_binary_predicate<projected<iterator_t<R>, Proj>,
489                                     projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
490    constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {});  // since C++20
491
492  template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity>
493    requires indirectly_writable<I, const T2&> &&
494             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
495    constexpr I
496      ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {});   // since C++20
497
498  template<input_range R, class T1, class T2, class Proj = identity>
499    requires indirectly_writable<iterator_t<R>, const T2&> &&
500             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
501    constexpr borrowed_iterator_t<R>
502      ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {});             // since C++20
503
504  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity,
505           indirect_unary_predicate<projected<I, Proj>> Pred>
506    requires indirectly_writable<I, const T&>
507    constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
508
509  template<input_range R, class T, class Proj = identity,
510           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
511    requires indirectly_writable<iterator_t<R>, const T&>
512    constexpr borrowed_iterator_t<R>
513      ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {});                     // since C++20
514
515  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
516           class Proj1 = identity, class Proj2 = identity,
517           indirect_strict_weak_order<projected<I1, Proj1>,
518                                      projected<I2, Proj2>> Comp = ranges::less>
519    constexpr bool
520      ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2,
521                                      Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});    // since C++20
522
523  template<input_range R1, input_range R2, class Proj1 = identity,
524           class Proj2 = identity,
525           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
526                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
527    constexpr bool
528      ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
529                                      Proj1 proj1 = {}, Proj2 proj2 = {});                    // since C++20
530
531  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
532    requires indirectly_movable<I1, I2>
533    constexpr ranges::move_backward_result<I1, I2>
534      ranges::move_backward(I1 first, S1 last, I2 result);                                          // since C++20
535
536  template<bidirectional_range R, bidirectional_iterator I>
537    requires indirectly_movable<iterator_t<R>, I>
538    constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I>
539      ranges::move_backward(R&& r, I result);                                                       // since C++20
540
541  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
542    requires indirectly_movable<I, O>
543    constexpr ranges::move_result<I, O>
544      ranges::move(I first, S last, O result);                                                      // since C++20
545
546  template<input_range R, weakly_incrementable O>
547    requires indirectly_movable<iterator_t<R>, O>
548    constexpr ranges::move_result<borrowed_iterator_t<R>, O>
549      ranges::move(R&& r, O result);                                                                // since C++20
550
551  template<class I1, class I2, class O>
552    using merge_result = in_in_out_result<I1, I2, O>;                                               // since C++20
553
554  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
555           weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
556           class Proj2 = identity>
557    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
558    constexpr merge_result<I1, I2, O>
559      merge(I1 first1, S1 last1, I2 first2, S2 last2, O result,
560            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
561
562  template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
563           class Proj1 = identity, class Proj2 = identity>
564    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
565    constexpr merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
566      merge(R1&& r1, R2&& r2, O result,
567            Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                                    // since C++20
568
569  template<permutable I, sentinel_for<I> S, class T, class Proj = identity>
570    requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>
571    constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {});          // since C++20
572
573  template<forward_range R, class T, class Proj = identity>
574    requires permutable<iterator_t<R>> &&
575             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
576    constexpr borrowed_subrange_t<R>
577      ranges::remove(R&& r, const T& value, Proj proj = {});                                        // since C++20
578
579  template<permutable I, sentinel_for<I> S, class Proj = identity,
580           indirect_unary_predicate<projected<I, Proj>> Pred>
581    constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {});            // since C++20
582
583  template<forward_range R, class Proj = identity,
584           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
585    requires permutable<iterator_t<R>>
586    constexpr borrowed_subrange_t<R>
587      ranges::remove_if(R&& r, Pred pred, Proj proj = {});                                          // since C++20
588
589  template<class I, class O>
590    using set_difference_result = in_out_result<I, O>;                                              // since C++20
591
592  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
593           weakly_incrementable O, class Comp = ranges::less,
594           class Proj1 = identity, class Proj2 = identity>
595    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
596    constexpr set_difference_result<I1, O>
597      set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
598                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
599
600  template<input_range R1, input_range R2, weakly_incrementable O,
601           class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
602    requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
603    constexpr set_difference_result<borrowed_iterator_t<R1>, O>
604      set_difference(R1&& r1, R2&& r2, O result,
605                     Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                           // since C++20
606
607  template<class I1, class I2, class O>
608    using set_intersection_result = in_in_out_result<I1, I2, O>;                                    // since C++20
609
610  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
611           weakly_incrementable O, class Comp = ranges::less,
612           class Proj1 = identity, class Proj2 = identity>
613    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
614    constexpr set_intersection_result<I1, I2, O>
615      set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result,
616                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
617
618  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
619           weakly_incrementable O, class Comp = ranges::less,
620           class Proj1 = identity, class Proj2 = identity>
621    requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
622    constexpr set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
623      set_intersection(R1&& r1, R2&& r2, O result,
624                       Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});                         // since C++20
625
626}
627
628    constexpr bool     // constexpr in C++20
629    all_of(InputIterator first, InputIterator last, Predicate pred);
630
631template <class InputIterator, class Predicate>
632    constexpr bool     // constexpr in C++20
633    any_of(InputIterator first, InputIterator last, Predicate pred);
634
635template <class InputIterator, class Predicate>
636    constexpr bool     // constexpr in C++20
637    none_of(InputIterator first, InputIterator last, Predicate pred);
638
639template <class InputIterator, class Function>
640    constexpr Function          // constexpr in C++20
641    for_each(InputIterator first, InputIterator last, Function f);
642
643template<class InputIterator, class Size, class Function>
644    constexpr InputIterator     // constexpr in C++20
645    for_each_n(InputIterator first, Size n, Function f); // C++17
646
647template <class InputIterator, class T>
648    constexpr InputIterator     // constexpr in C++20
649    find(InputIterator first, InputIterator last, const T& value);
650
651template <class InputIterator, class Predicate>
652    constexpr InputIterator     // constexpr in C++20
653    find_if(InputIterator first, InputIterator last, Predicate pred);
654
655template<class InputIterator, class Predicate>
656    constexpr InputIterator     // constexpr in C++20
657    find_if_not(InputIterator first, InputIterator last, Predicate pred);
658
659template <class ForwardIterator1, class ForwardIterator2>
660    constexpr ForwardIterator1  // constexpr in C++20
661    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
662             ForwardIterator2 first2, ForwardIterator2 last2);
663
664template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
665    constexpr ForwardIterator1  // constexpr in C++20
666    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
667             ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
668
669template <class ForwardIterator1, class ForwardIterator2>
670    constexpr ForwardIterator1  // constexpr in C++20
671    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
672                  ForwardIterator2 first2, ForwardIterator2 last2);
673
674template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
675    constexpr ForwardIterator1  // constexpr in C++20
676    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
677                  ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
678
679template <class ForwardIterator>
680    constexpr ForwardIterator   // constexpr in C++20
681    adjacent_find(ForwardIterator first, ForwardIterator last);
682
683template <class ForwardIterator, class BinaryPredicate>
684    constexpr ForwardIterator   // constexpr in C++20
685    adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
686
687template <class InputIterator, class T>
688    constexpr typename iterator_traits<InputIterator>::difference_type  // constexpr in C++20
689    count(InputIterator first, InputIterator last, const T& value);
690
691template <class InputIterator, class Predicate>
692    constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20
693    count_if(InputIterator first, InputIterator last, Predicate pred);
694
695template <class InputIterator1, class InputIterator2>
696    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
697    mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
698
699template <class InputIterator1, class InputIterator2>
700    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
701    mismatch(InputIterator1 first1, InputIterator1 last1,
702             InputIterator2 first2, InputIterator2 last2); // **C++14**
703
704template <class InputIterator1, class InputIterator2, class BinaryPredicate>
705    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
706    mismatch(InputIterator1 first1, InputIterator1 last1,
707             InputIterator2 first2, BinaryPredicate pred);
708
709template <class InputIterator1, class InputIterator2, class BinaryPredicate>
710    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
711    mismatch(InputIterator1 first1, InputIterator1 last1,
712             InputIterator2 first2, InputIterator2 last2,
713             BinaryPredicate pred); // **C++14**
714
715template <class InputIterator1, class InputIterator2>
716    constexpr bool      // constexpr in C++20
717    equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
718
719template <class InputIterator1, class InputIterator2>
720    constexpr bool      // constexpr in C++20
721    equal(InputIterator1 first1, InputIterator1 last1,
722          InputIterator2 first2, InputIterator2 last2); // **C++14**
723
724template <class InputIterator1, class InputIterator2, class BinaryPredicate>
725    constexpr bool      // constexpr in C++20
726    equal(InputIterator1 first1, InputIterator1 last1,
727          InputIterator2 first2, BinaryPredicate pred);
728
729template <class InputIterator1, class InputIterator2, class BinaryPredicate>
730    constexpr bool      // constexpr in C++20
731    equal(InputIterator1 first1, InputIterator1 last1,
732          InputIterator2 first2, InputIterator2 last2,
733          BinaryPredicate pred); // **C++14**
734
735template<class ForwardIterator1, class ForwardIterator2>
736    constexpr bool      // constexpr in C++20
737    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
738                   ForwardIterator2 first2);
739
740template<class ForwardIterator1, class ForwardIterator2>
741    constexpr bool      // constexpr in C++20
742    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
743                   ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
744
745template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
746    constexpr bool      // constexpr in C++20
747    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
748                   ForwardIterator2 first2, BinaryPredicate pred);
749
750template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
751    constexpr bool      // constexpr in C++20
752    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
753                   ForwardIterator2 first2, ForwardIterator2 last2,
754                   BinaryPredicate pred);  // **C++14**
755
756template <class ForwardIterator1, class ForwardIterator2>
757    constexpr ForwardIterator1      // constexpr in C++20
758    search(ForwardIterator1 first1, ForwardIterator1 last1,
759           ForwardIterator2 first2, ForwardIterator2 last2);
760
761template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
762    constexpr ForwardIterator1      // constexpr in C++20
763    search(ForwardIterator1 first1, ForwardIterator1 last1,
764           ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
765
766template <class ForwardIterator, class Size, class T>
767    constexpr ForwardIterator       // constexpr in C++20
768    search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
769
770template <class ForwardIterator, class Size, class T, class BinaryPredicate>
771    constexpr ForwardIterator       // constexpr in C++20
772    search_n(ForwardIterator first, ForwardIterator last,
773             Size count, const T& value, BinaryPredicate pred);
774
775template <class InputIterator, class OutputIterator>
776    constexpr OutputIterator      // constexpr in C++20
777    copy(InputIterator first, InputIterator last, OutputIterator result);
778
779template<class InputIterator, class OutputIterator, class Predicate>
780    constexpr OutputIterator      // constexpr in C++20
781    copy_if(InputIterator first, InputIterator last,
782            OutputIterator result, Predicate pred);
783
784template<class InputIterator, class Size, class OutputIterator>
785    constexpr OutputIterator      // constexpr in C++20
786    copy_n(InputIterator first, Size n, OutputIterator result);
787
788template <class BidirectionalIterator1, class BidirectionalIterator2>
789    constexpr BidirectionalIterator2      // constexpr in C++20
790    copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
791                  BidirectionalIterator2 result);
792
793// [alg.move], move
794template<class InputIterator, class OutputIterator>
795    constexpr OutputIterator move(InputIterator first, InputIterator last,
796                                OutputIterator result);
797
798template<class BidirectionalIterator1, class BidirectionalIterator2>
799    constexpr BidirectionalIterator2
800    move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
801                  BidirectionalIterator2 result);
802
803template <class ForwardIterator1, class ForwardIterator2>
804    constexpr ForwardIterator2    // constexpr in C++20
805    swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
806
807namespace ranges {
808    template<class I1, class I2>
809    using swap_ranges_result = in_in_result<I1, I2>;
810
811template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2>
812        requires indirectly_swappable<I1, I2>
813    constexpr ranges::swap_ranges_result<I1, I2>
814        swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2);
815
816template<input_range R1, input_range R2>
817        requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>
818    constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
819        swap_ranges(R1&& r1, R2&& r2);
820}
821
822template <class ForwardIterator1, class ForwardIterator2>
823    constexpr void                // constexpr in C++20
824    iter_swap(ForwardIterator1 a, ForwardIterator2 b);
825
826template <class InputIterator, class OutputIterator, class UnaryOperation>
827    constexpr OutputIterator      // constexpr in C++20
828    transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
829
830template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
831    constexpr OutputIterator      // constexpr in C++20
832    transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
833              OutputIterator result, BinaryOperation binary_op);
834
835template <class ForwardIterator, class T>
836    constexpr void      // constexpr in C++20
837    replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
838
839template <class ForwardIterator, class Predicate, class T>
840    constexpr void      // constexpr in C++20
841    replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
842
843template <class InputIterator, class OutputIterator, class T>
844    constexpr OutputIterator      // constexpr in C++20
845    replace_copy(InputIterator first, InputIterator last, OutputIterator result,
846                 const T& old_value, const T& new_value);
847
848template <class InputIterator, class OutputIterator, class Predicate, class T>
849    constexpr OutputIterator      // constexpr in C++20
850    replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
851
852template <class ForwardIterator, class T>
853    constexpr void      // constexpr in C++20
854    fill(ForwardIterator first, ForwardIterator last, const T& value);
855
856template <class OutputIterator, class Size, class T>
857    constexpr OutputIterator      // constexpr in C++20
858    fill_n(OutputIterator first, Size n, const T& value);
859
860template <class ForwardIterator, class Generator>
861    constexpr void      // constexpr in C++20
862    generate(ForwardIterator first, ForwardIterator last, Generator gen);
863
864template <class OutputIterator, class Size, class Generator>
865    constexpr OutputIterator      // constexpr in C++20
866    generate_n(OutputIterator first, Size n, Generator gen);
867
868template <class ForwardIterator, class T>
869    constexpr ForwardIterator     // constexpr in C++20
870    remove(ForwardIterator first, ForwardIterator last, const T& value);
871
872template <class ForwardIterator, class Predicate>
873    constexpr ForwardIterator     // constexpr in C++20
874    remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
875
876template <class InputIterator, class OutputIterator, class T>
877    constexpr OutputIterator     // constexpr in C++20
878    remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
879
880template <class InputIterator, class OutputIterator, class Predicate>
881    constexpr OutputIterator     // constexpr in C++20
882    remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
883
884template <class ForwardIterator>
885    constexpr ForwardIterator    // constexpr in C++20
886    unique(ForwardIterator first, ForwardIterator last);
887
888template <class ForwardIterator, class BinaryPredicate>
889    constexpr ForwardIterator    // constexpr in C++20
890    unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
891
892template <class InputIterator, class OutputIterator>
893    constexpr OutputIterator     // constexpr in C++20
894    unique_copy(InputIterator first, InputIterator last, OutputIterator result);
895
896template <class InputIterator, class OutputIterator, class BinaryPredicate>
897    constexpr OutputIterator     // constexpr in C++20
898    unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
899
900template <class BidirectionalIterator>
901    constexpr void               // constexpr in C++20
902    reverse(BidirectionalIterator first, BidirectionalIterator last);
903
904template <class BidirectionalIterator, class OutputIterator>
905    constexpr OutputIterator       // constexpr in C++20
906    reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
907
908template <class ForwardIterator>
909    constexpr ForwardIterator      // constexpr in C++20
910    rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
911
912template <class ForwardIterator, class OutputIterator>
913    constexpr OutputIterator       // constexpr in C++20
914    rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
915
916template <class RandomAccessIterator>
917    void
918    random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
919
920template <class RandomAccessIterator, class RandomNumberGenerator>
921    void
922    random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
923                   RandomNumberGenerator& rand);  // deprecated in C++14, removed in C++17
924
925template<class PopulationIterator, class SampleIterator,
926         class Distance, class UniformRandomBitGenerator>
927    SampleIterator sample(PopulationIterator first, PopulationIterator last,
928                          SampleIterator out, Distance n,
929                          UniformRandomBitGenerator&& g); // C++17
930
931template<class RandomAccessIterator, class UniformRandomNumberGenerator>
932    void shuffle(RandomAccessIterator first, RandomAccessIterator last,
933                 UniformRandomNumberGenerator&& g);
934
935template<class ForwardIterator>
936  constexpr ForwardIterator
937    shift_left(ForwardIterator first, ForwardIterator last,
938               typename iterator_traits<ForwardIterator>::difference_type n); // C++20
939
940template<class ForwardIterator>
941  constexpr ForwardIterator
942    shift_right(ForwardIterator first, ForwardIterator last,
943                typename iterator_traits<ForwardIterator>::difference_type n); // C++20
944
945template <class InputIterator, class Predicate>
946    constexpr bool  // constexpr in C++20
947    is_partitioned(InputIterator first, InputIterator last, Predicate pred);
948
949template <class ForwardIterator, class Predicate>
950    constexpr ForwardIterator  // constexpr in C++20
951    partition(ForwardIterator first, ForwardIterator last, Predicate pred);
952
953template <class InputIterator, class OutputIterator1,
954          class OutputIterator2, class Predicate>
955    constexpr pair<OutputIterator1, OutputIterator2>   // constexpr in C++20
956    partition_copy(InputIterator first, InputIterator last,
957                   OutputIterator1 out_true, OutputIterator2 out_false,
958                   Predicate pred);
959
960template <class ForwardIterator, class Predicate>
961    ForwardIterator
962    stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
963
964template<class ForwardIterator, class Predicate>
965    constexpr ForwardIterator  // constexpr in C++20
966    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
967
968template <class ForwardIterator>
969    constexpr bool  // constexpr in C++20
970    is_sorted(ForwardIterator first, ForwardIterator last);
971
972template <class ForwardIterator, class Compare>
973    constexpr bool  // constexpr in C++20
974    is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
975
976template<class ForwardIterator>
977    constexpr ForwardIterator    // constexpr in C++20
978    is_sorted_until(ForwardIterator first, ForwardIterator last);
979
980template <class ForwardIterator, class Compare>
981    constexpr ForwardIterator    // constexpr in C++20
982    is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
983
984template <class RandomAccessIterator>
985    constexpr void               // constexpr in C++20
986    sort(RandomAccessIterator first, RandomAccessIterator last);
987
988template <class RandomAccessIterator, class Compare>
989    constexpr void               // constexpr in C++20
990    sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
991
992template <class RandomAccessIterator>
993    void
994    stable_sort(RandomAccessIterator first, RandomAccessIterator last);
995
996template <class RandomAccessIterator, class Compare>
997    void
998    stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
999
1000template <class RandomAccessIterator>
1001    constexpr void                    // constexpr in C++20
1002    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
1003
1004template <class RandomAccessIterator, class Compare>
1005    constexpr void                    // constexpr in C++20
1006    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1007
1008template <class InputIterator, class RandomAccessIterator>
1009    constexpr RandomAccessIterator    // constexpr in C++20
1010    partial_sort_copy(InputIterator first, InputIterator last,
1011                      RandomAccessIterator result_first, RandomAccessIterator result_last);
1012
1013template <class InputIterator, class RandomAccessIterator, class Compare>
1014    constexpr RandomAccessIterator    // constexpr in C++20
1015    partial_sort_copy(InputIterator first, InputIterator last,
1016                      RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
1017
1018template <class RandomAccessIterator>
1019    constexpr void                    // constexpr in C++20
1020    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
1021
1022template <class RandomAccessIterator, class Compare>
1023    constexpr void                    // constexpr in C++20
1024    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1025
1026template <class ForwardIterator, class T>
1027    constexpr ForwardIterator                         // constexpr in C++20
1028    lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
1029
1030template <class ForwardIterator, class T, class Compare>
1031    constexpr ForwardIterator                         // constexpr in C++20
1032    lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1033
1034template <class ForwardIterator, class T>
1035    constexpr ForwardIterator                         // constexpr in C++20
1036    upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
1037
1038template <class ForwardIterator, class T, class Compare>
1039    constexpr ForwardIterator                         // constexpr in C++20
1040    upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1041
1042template <class ForwardIterator, class T>
1043    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
1044    equal_range(ForwardIterator first, ForwardIterator last, const T& value);
1045
1046template <class ForwardIterator, class T, class Compare>
1047    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
1048    equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1049
1050template <class ForwardIterator, class T>
1051    constexpr bool                                    // constexpr in C++20
1052    binary_search(ForwardIterator first, ForwardIterator last, const T& value);
1053
1054template <class ForwardIterator, class T, class Compare>
1055    constexpr bool                                    // constexpr in C++20
1056    binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1057
1058template <class InputIterator1, class InputIterator2, class OutputIterator>
1059    constexpr OutputIterator                          // constexpr in C++20
1060    merge(InputIterator1 first1, InputIterator1 last1,
1061          InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1062
1063template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1064    constexpr OutputIterator                          // constexpr in C++20
1065    merge(InputIterator1 first1, InputIterator1 last1,
1066          InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1067
1068template <class BidirectionalIterator>
1069    void
1070    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
1071
1072template <class BidirectionalIterator, class Compare>
1073    void
1074    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1075
1076template <class InputIterator1, class InputIterator2>
1077    constexpr bool                                    // constexpr in C++20
1078    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1079
1080template <class InputIterator1, class InputIterator2, class Compare>
1081    constexpr bool                                    // constexpr in C++20
1082    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
1083
1084template <class InputIterator1, class InputIterator2, class OutputIterator>
1085    constexpr OutputIterator                          // constexpr in C++20
1086    set_union(InputIterator1 first1, InputIterator1 last1,
1087              InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1088
1089template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1090    constexpr OutputIterator                          // constexpr in C++20
1091    set_union(InputIterator1 first1, InputIterator1 last1,
1092              InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1093
1094template <class InputIterator1, class InputIterator2, class OutputIterator>
1095    constexpr OutputIterator                         // constexpr in C++20
1096    set_intersection(InputIterator1 first1, InputIterator1 last1,
1097                     InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1098
1099template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1100    constexpr OutputIterator                         // constexpr in C++20
1101    set_intersection(InputIterator1 first1, InputIterator1 last1,
1102                     InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1103
1104template <class InputIterator1, class InputIterator2, class OutputIterator>
1105    constexpr OutputIterator                         // constexpr in C++20
1106    set_difference(InputIterator1 first1, InputIterator1 last1,
1107                   InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1108
1109template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1110    constexpr OutputIterator                         // constexpr in C++20
1111    set_difference(InputIterator1 first1, InputIterator1 last1,
1112                   InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1113
1114template <class InputIterator1, class InputIterator2, class OutputIterator>
1115    constexpr OutputIterator                         // constexpr in C++20
1116    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
1117                             InputIterator2 first2, InputIterator2 last2, OutputIterator result);
1118
1119template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
1120    constexpr OutputIterator                         // constexpr in C++20
1121    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
1122                             InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
1123
1124template <class RandomAccessIterator>
1125    constexpr void                                   // constexpr in C++20
1126    push_heap(RandomAccessIterator first, RandomAccessIterator last);
1127
1128template <class RandomAccessIterator, class Compare>
1129    constexpr void                                   // constexpr in C++20
1130    push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1131
1132template <class RandomAccessIterator>
1133    constexpr void                                   // constexpr in C++20
1134    pop_heap(RandomAccessIterator first, RandomAccessIterator last);
1135
1136template <class RandomAccessIterator, class Compare>
1137    constexpr void                                   // constexpr in C++20
1138    pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1139
1140template <class RandomAccessIterator>
1141    constexpr void                                   // constexpr in C++20
1142    make_heap(RandomAccessIterator first, RandomAccessIterator last);
1143
1144template <class RandomAccessIterator, class Compare>
1145    constexpr void                                   // constexpr in C++20
1146    make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1147
1148template <class RandomAccessIterator>
1149    constexpr void                                   // constexpr in C++20
1150    sort_heap(RandomAccessIterator first, RandomAccessIterator last);
1151
1152template <class RandomAccessIterator, class Compare>
1153    constexpr void                                   // constexpr in C++20
1154    sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1155
1156template <class RandomAccessIterator>
1157    constexpr bool   // constexpr in C++20
1158    is_heap(RandomAccessIterator first, RandomAccessiterator last);
1159
1160template <class RandomAccessIterator, class Compare>
1161    constexpr bool   // constexpr in C++20
1162    is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1163
1164template <class RandomAccessIterator>
1165    constexpr RandomAccessIterator   // constexpr in C++20
1166    is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
1167
1168template <class RandomAccessIterator, class Compare>
1169    constexpr RandomAccessIterator   // constexpr in C++20
1170    is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1171
1172template <class ForwardIterator>
1173    constexpr ForwardIterator        // constexpr in C++14
1174    min_element(ForwardIterator first, ForwardIterator last);
1175
1176template <class ForwardIterator, class Compare>
1177    constexpr ForwardIterator        // constexpr in C++14
1178    min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1179
1180template <class T>
1181    constexpr const T&               // constexpr in C++14
1182    min(const T& a, const T& b);
1183
1184template <class T, class Compare>
1185    constexpr const T&               // constexpr in C++14
1186    min(const T& a, const T& b, Compare comp);
1187
1188template<class T>
1189    constexpr T                      // constexpr in C++14
1190    min(initializer_list<T> t);
1191
1192template<class T, class Compare>
1193    constexpr T                      // constexpr in C++14
1194    min(initializer_list<T> t, Compare comp);
1195
1196template<class T>
1197    constexpr const T& clamp(const T& v, const T& lo, const T& hi);               // C++17
1198
1199template<class T, class Compare>
1200    constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1201
1202template <class ForwardIterator>
1203    constexpr ForwardIterator        // constexpr in C++14
1204    max_element(ForwardIterator first, ForwardIterator last);
1205
1206template <class ForwardIterator, class Compare>
1207    constexpr ForwardIterator        // constexpr in C++14
1208    max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1209
1210template <class T>
1211    constexpr const T&               // constexpr in C++14
1212    max(const T& a, const T& b);
1213
1214template <class T, class Compare>
1215    constexpr const T&               // constexpr in C++14
1216    max(const T& a, const T& b, Compare comp);
1217
1218template<class T>
1219    constexpr T                      // constexpr in C++14
1220    max(initializer_list<T> t);
1221
1222template<class T, class Compare>
1223    constexpr T                      // constexpr in C++14
1224    max(initializer_list<T> t, Compare comp);
1225
1226template<class ForwardIterator>
1227    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1228    minmax_element(ForwardIterator first, ForwardIterator last);
1229
1230template<class ForwardIterator, class Compare>
1231    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1232    minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1233
1234template<class T>
1235    constexpr pair<const T&, const T&>  // constexpr in C++14
1236    minmax(const T& a, const T& b);
1237
1238template<class T, class Compare>
1239    constexpr pair<const T&, const T&>  // constexpr in C++14
1240    minmax(const T& a, const T& b, Compare comp);
1241
1242template<class T>
1243    constexpr pair<T, T>                // constexpr in C++14
1244    minmax(initializer_list<T> t);
1245
1246template<class T, class Compare>
1247    constexpr pair<T, T>                // constexpr in C++14
1248    minmax(initializer_list<T> t, Compare comp);
1249
1250template <class InputIterator1, class InputIterator2>
1251    constexpr bool     // constexpr in C++20
1252    lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1253
1254template <class InputIterator1, class InputIterator2, class Compare>
1255    constexpr bool     // constexpr in C++20
1256    lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
1257                            InputIterator2 first2, InputIterator2 last2, Compare comp);
1258
1259template <class BidirectionalIterator>
1260    constexpr bool     // constexpr in C++20
1261    next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1262
1263template <class BidirectionalIterator, class Compare>
1264    constexpr bool     // constexpr in C++20
1265    next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1266
1267template <class BidirectionalIterator>
1268    constexpr bool     // constexpr in C++20
1269    prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1270
1271template <class BidirectionalIterator, class Compare>
1272    constexpr bool     // constexpr in C++20
1273    prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1274}  // std
1275
1276*/
1277
1278#include <__assert> // all public C++ headers provide the assertion handler
1279#include <__bits>
1280#include <__config>
1281#include <__debug>
1282#include <cstddef>
1283#include <cstring>
1284#include <memory>
1285#include <type_traits>
1286#include <version>
1287
1288#include <__algorithm/adjacent_find.h>
1289#include <__algorithm/all_of.h>
1290#include <__algorithm/any_of.h>
1291#include <__algorithm/binary_search.h>
1292#include <__algorithm/clamp.h>
1293#include <__algorithm/comp.h>
1294#include <__algorithm/comp_ref_type.h>
1295#include <__algorithm/copy.h>
1296#include <__algorithm/copy_backward.h>
1297#include <__algorithm/copy_if.h>
1298#include <__algorithm/copy_n.h>
1299#include <__algorithm/count.h>
1300#include <__algorithm/count_if.h>
1301#include <__algorithm/equal.h>
1302#include <__algorithm/equal_range.h>
1303#include <__algorithm/fill.h>
1304#include <__algorithm/fill_n.h>
1305#include <__algorithm/find.h>
1306#include <__algorithm/find_end.h>
1307#include <__algorithm/find_first_of.h>
1308#include <__algorithm/find_if.h>
1309#include <__algorithm/find_if_not.h>
1310#include <__algorithm/for_each.h>
1311#include <__algorithm/for_each_n.h>
1312#include <__algorithm/generate.h>
1313#include <__algorithm/generate_n.h>
1314#include <__algorithm/half_positive.h>
1315#include <__algorithm/in_found_result.h>
1316#include <__algorithm/in_fun_result.h>
1317#include <__algorithm/in_in_out_result.h>
1318#include <__algorithm/in_in_result.h>
1319#include <__algorithm/in_out_out_result.h>
1320#include <__algorithm/in_out_result.h>
1321#include <__algorithm/includes.h>
1322#include <__algorithm/inplace_merge.h>
1323#include <__algorithm/is_heap.h>
1324#include <__algorithm/is_heap_until.h>
1325#include <__algorithm/is_partitioned.h>
1326#include <__algorithm/is_permutation.h>
1327#include <__algorithm/is_sorted.h>
1328#include <__algorithm/is_sorted_until.h>
1329#include <__algorithm/iter_swap.h>
1330#include <__algorithm/lexicographical_compare.h>
1331#include <__algorithm/lower_bound.h>
1332#include <__algorithm/make_heap.h>
1333#include <__algorithm/max.h>
1334#include <__algorithm/max_element.h>
1335#include <__algorithm/merge.h>
1336#include <__algorithm/min.h>
1337#include <__algorithm/min_element.h>
1338#include <__algorithm/min_max_result.h>
1339#include <__algorithm/minmax.h>
1340#include <__algorithm/minmax_element.h>
1341#include <__algorithm/mismatch.h>
1342#include <__algorithm/move.h>
1343#include <__algorithm/move_backward.h>
1344#include <__algorithm/next_permutation.h>
1345#include <__algorithm/none_of.h>
1346#include <__algorithm/nth_element.h>
1347#include <__algorithm/partial_sort.h>
1348#include <__algorithm/partial_sort_copy.h>
1349#include <__algorithm/partition.h>
1350#include <__algorithm/partition_copy.h>
1351#include <__algorithm/partition_point.h>
1352#include <__algorithm/pop_heap.h>
1353#include <__algorithm/prev_permutation.h>
1354#include <__algorithm/push_heap.h>
1355#include <__algorithm/ranges_adjacent_find.h>
1356#include <__algorithm/ranges_all_of.h>
1357#include <__algorithm/ranges_any_of.h>
1358#include <__algorithm/ranges_binary_search.h>
1359#include <__algorithm/ranges_copy.h>
1360#include <__algorithm/ranges_copy_backward.h>
1361#include <__algorithm/ranges_copy_if.h>
1362#include <__algorithm/ranges_copy_n.h>
1363#include <__algorithm/ranges_count.h>
1364#include <__algorithm/ranges_count_if.h>
1365#include <__algorithm/ranges_equal.h>
1366#include <__algorithm/ranges_fill.h>
1367#include <__algorithm/ranges_fill_n.h>
1368#include <__algorithm/ranges_find.h>
1369#include <__algorithm/ranges_find_first_of.h>
1370#include <__algorithm/ranges_find_if.h>
1371#include <__algorithm/ranges_find_if_not.h>
1372#include <__algorithm/ranges_for_each.h>
1373#include <__algorithm/ranges_for_each_n.h>
1374#include <__algorithm/ranges_is_partitioned.h>
1375#include <__algorithm/ranges_is_sorted.h>
1376#include <__algorithm/ranges_is_sorted_until.h>
1377#include <__algorithm/ranges_lexicographical_compare.h>
1378#include <__algorithm/ranges_lower_bound.h>
1379#include <__algorithm/ranges_make_heap.h>
1380#include <__algorithm/ranges_max.h>
1381#include <__algorithm/ranges_max_element.h>
1382#include <__algorithm/ranges_merge.h>
1383#include <__algorithm/ranges_min.h>
1384#include <__algorithm/ranges_min_element.h>
1385#include <__algorithm/ranges_minmax.h>
1386#include <__algorithm/ranges_minmax_element.h>
1387#include <__algorithm/ranges_mismatch.h>
1388#include <__algorithm/ranges_move.h>
1389#include <__algorithm/ranges_move_backward.h>
1390#include <__algorithm/ranges_none_of.h>
1391#include <__algorithm/ranges_nth_element.h>
1392#include <__algorithm/ranges_pop_heap.h>
1393#include <__algorithm/ranges_push_heap.h>
1394#include <__algorithm/ranges_remove.h>
1395#include <__algorithm/ranges_remove_if.h>
1396#include <__algorithm/ranges_replace.h>
1397#include <__algorithm/ranges_replace_if.h>
1398#include <__algorithm/ranges_reverse.h>
1399#include <__algorithm/ranges_set_difference.h>
1400#include <__algorithm/ranges_set_intersection.h>
1401#include <__algorithm/ranges_sort.h>
1402#include <__algorithm/ranges_sort_heap.h>
1403#include <__algorithm/ranges_stable_sort.h>
1404#include <__algorithm/ranges_swap_ranges.h>
1405#include <__algorithm/ranges_transform.h>
1406#include <__algorithm/ranges_upper_bound.h>
1407#include <__algorithm/remove.h>
1408#include <__algorithm/remove_copy.h>
1409#include <__algorithm/remove_copy_if.h>
1410#include <__algorithm/remove_if.h>
1411#include <__algorithm/replace.h>
1412#include <__algorithm/replace_copy.h>
1413#include <__algorithm/replace_copy_if.h>
1414#include <__algorithm/replace_if.h>
1415#include <__algorithm/reverse.h>
1416#include <__algorithm/reverse_copy.h>
1417#include <__algorithm/rotate.h>
1418#include <__algorithm/rotate_copy.h>
1419#include <__algorithm/sample.h>
1420#include <__algorithm/search.h>
1421#include <__algorithm/search_n.h>
1422#include <__algorithm/set_difference.h>
1423#include <__algorithm/set_intersection.h>
1424#include <__algorithm/set_symmetric_difference.h>
1425#include <__algorithm/set_union.h>
1426#include <__algorithm/shift_left.h>
1427#include <__algorithm/shift_right.h>
1428#include <__algorithm/shuffle.h>
1429#include <__algorithm/sift_down.h>
1430#include <__algorithm/sort.h>
1431#include <__algorithm/sort_heap.h>
1432#include <__algorithm/stable_partition.h>
1433#include <__algorithm/stable_sort.h>
1434#include <__algorithm/swap_ranges.h>
1435#include <__algorithm/transform.h>
1436#include <__algorithm/unique.h>
1437#include <__algorithm/unique_copy.h>
1438#include <__algorithm/unwrap_iter.h>
1439#include <__algorithm/upper_bound.h>
1440
1441#ifndef _LIBCPP_REMOVE_TRANSITIVE_INCLUDES
1442#  include <chrono>
1443#  include <iterator>
1444#  include <utility>
1445#endif
1446
1447// standard-mandated includes
1448#include <initializer_list>
1449
1450#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
1451#  pragma GCC system_header
1452#endif
1453
1454#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
1455#   include <__pstl_algorithm>
1456#endif
1457
1458#endif // _LIBCPP_ALGORITHM
1459