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
291  template<bidirectional_iterator I, sentinel_for<I> S>
292    requires permutable<I>
293    constexpr I ranges::reverse(I first, S last);                                           // since C++20
294
295  template<bidirectional_range R>
296    requires permutable<iterator_t<R>>
297    constexpr borrowed_iterator_t<R> ranges::reverse(R&& r);                                // since C++20
298
299  template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
300            class Proj = identity>
301    requires sortable<I, Comp, Proj>
302    constexpr I
303      sort(I first, S last, Comp comp = {}, Proj proj = {});                                // since C++20
304
305  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
306    requires sortable<iterator_t<R>, Comp, Proj>
307    constexpr borrowed_iterator_t<R>
308      sort(R&& r, Comp comp = {}, Proj proj = {});                                          // since C++20
309
310  template<class T, output_iterator<const T&> O, sentinel_for<O> S>
311    constexpr O ranges::fill(O first, S last, const T& value);                              // since C++20
312
313  template<class T, output_range<const T&> R>
314    constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value);                   // since C++20
315
316  template<class T, output_iterator<const T&> O>
317    constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value);            // since C++20
318
319 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
320          class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
321   requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
322   constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2,
323                                Pred pred = {},
324                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
325
326 template<input_range R1, input_range R2, class Pred = ranges::equal_to,
327          class Proj1 = identity, class Proj2 = identity>
328   requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
329   constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
330                                Proj1 proj1 = {}, Proj2 proj2 = {});                        // since C++20
331
332  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
333           indirect_unary_predicate<projected<I, Proj>> Pred>
334    constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
335
336  template<input_range R, class Proj = identity,
337           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
338    constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {});                // since C++20
339
340  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
341           indirect_unary_predicate<projected<I, Proj>> Pred>
342    constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {});      // since C++20
343
344  template<input_range R, class Proj = identity,
345           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
346    constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {});                // since C++20
347
348  template<input_iterator I, sentinel_for<I> S, class Proj = identity,
349           indirect_unary_predicate<projected<I, Proj>> Pred>
350    constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {});     // since C++20
351
352  template<input_range R, class Proj = identity,
353           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
354    constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {});               // since C++20
355
356  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
357           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
358    constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});      // since C++20
359
360  template<forward_range R, class Proj = identity,
361           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
362    constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});                // since C++20
363
364  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
365           indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
366    constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});   // since C++20
367
368  template<forward_range R, class Proj = identity,
369           indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
370    constexpr borrowed_iterator_t<R>
371      ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});                       // since C++20
372
373  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
374           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
375    constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
376
377  template<forward_range R, class T, class Proj = identity,
378           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
379             ranges::less>
380    constexpr borrowed_iterator_t<R>
381      upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
382
383  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
384           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
385    constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
386                                    Proj proj = {});                                          // since C++20
387  template<forward_range R, class T, class Proj = identity,
388           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
389             ranges::less>
390    constexpr borrowed_iterator_t<R>
391      lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});                     // since C++20
392
393  template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
394           indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
395    constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
396                                         Proj proj = {});                                     // since C++20
397
398  template<forward_range R, class T, class Proj = identity,
399           indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
400             ranges::less>
401    constexpr bool binary_search(R&& r, const T& value, Comp comp = {},
402                                         Proj proj = {});                                     // since C++20
403  template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2,
404           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
405    requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
406    constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
407                                       Pred pred = {},
408                                       Proj1 proj1 = {}, Proj2 proj2 = {});                 // since C++20
409
410  template<input_range R1, forward_range R2,
411           class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
412    requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
413    constexpr borrowed_iterator_t<R1>
414      ranges::find_first_of(R1&& r1, R2&& r2,
415                            Pred pred = {},
416                            Proj1 proj1 = {}, Proj2 proj2 = {});                            // since C++20
417
418  template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
419           indirect_binary_predicate<projected<I, Proj>,
420                                     projected<I, Proj>> Pred = ranges::equal_to>
421    constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {});     // since C+20
422
423  template<forward_range R, class Proj = identity,
424           indirect_binary_predicate<projected<iterator_t<R>, Proj>,
425                                     projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
426    constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {});  // since C++20
427
428  template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity>
429    requires indirectly_writable<I, const T2&> &&
430             indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>
431    constexpr I
432      ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {});   // since C++20
433
434  template<input_range R, class T1, class T2, class Proj = identity>
435    requires indirectly_writable<iterator_t<R>, const T2&> &&
436             indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
437    constexpr borrowed_iterator_t<R>
438      ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {});             // since C++20
439
440  template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity,
441           indirect_unary_predicate<projected<I, Proj>> Pred>
442    requires indirectly_writable<I, const T&>
443    constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
444
445  template<input_range R, class T, class Proj = identity,
446           indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
447    requires indirectly_writable<iterator_t<R>, const T&>
448    constexpr borrowed_iterator_t<R>
449      ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {});                     // since C++20
450
451  template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
452           class Proj1 = identity, class Proj2 = identity,
453           indirect_strict_weak_order<projected<I1, Proj1>,
454                                      projected<I2, Proj2>> Comp = ranges::less>
455    constexpr bool
456      ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2,
457                                      Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});    // since C++20
458
459  template<input_range R1, input_range R2, class Proj1 = identity,
460           class Proj2 = identity,
461           indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
462                                      projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
463    constexpr bool
464      ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
465                                      Proj1 proj1 = {}, Proj2 proj2 = {});                    // since C++20
466
467  template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2>
468    requires indirectly_movable<I1, I2>
469    constexpr ranges::move_backward_result<I1, I2>
470      ranges::move_backward(I1 first, S1 last, I2 result);                                          // since C++20
471
472  template<bidirectional_range R, bidirectional_iterator I>
473    requires indirectly_movable<iterator_t<R>, I>
474    constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I>
475      ranges::move_backward(R&& r, I result);                                                       // since C++20
476
477  template<input_iterator I, sentinel_for<I> S, weakly_incrementable O>
478    requires indirectly_movable<I, O>
479    constexpr ranges::move_result<I, O>
480      ranges::move(I first, S last, O result);                                                      // since C++20
481
482  template<input_range R, weakly_incrementable O>
483    requires indirectly_movable<iterator_t<R>, O>
484    constexpr ranges::move_result<borrowed_iterator_t<R>, O>
485      ranges::move(R&& r, O result);                                                                // since C++20
486
487
488}
489
490    constexpr bool     // constexpr in C++20
491    all_of(InputIterator first, InputIterator last, Predicate pred);
492
493template <class InputIterator, class Predicate>
494    constexpr bool     // constexpr in C++20
495    any_of(InputIterator first, InputIterator last, Predicate pred);
496
497template <class InputIterator, class Predicate>
498    constexpr bool     // constexpr in C++20
499    none_of(InputIterator first, InputIterator last, Predicate pred);
500
501template <class InputIterator, class Function>
502    constexpr Function          // constexpr in C++20
503    for_each(InputIterator first, InputIterator last, Function f);
504
505template<class InputIterator, class Size, class Function>
506    constexpr InputIterator     // constexpr in C++20
507    for_each_n(InputIterator first, Size n, Function f); // C++17
508
509template <class InputIterator, class T>
510    constexpr InputIterator     // constexpr in C++20
511    find(InputIterator first, InputIterator last, const T& value);
512
513template <class InputIterator, class Predicate>
514    constexpr InputIterator     // constexpr in C++20
515    find_if(InputIterator first, InputIterator last, Predicate pred);
516
517template<class InputIterator, class Predicate>
518    constexpr InputIterator     // constexpr in C++20
519    find_if_not(InputIterator first, InputIterator last, Predicate pred);
520
521template <class ForwardIterator1, class ForwardIterator2>
522    constexpr ForwardIterator1  // constexpr in C++20
523    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
524             ForwardIterator2 first2, ForwardIterator2 last2);
525
526template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
527    constexpr ForwardIterator1  // constexpr in C++20
528    find_end(ForwardIterator1 first1, ForwardIterator1 last1,
529             ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
530
531template <class ForwardIterator1, class ForwardIterator2>
532    constexpr ForwardIterator1  // constexpr in C++20
533    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
534                  ForwardIterator2 first2, ForwardIterator2 last2);
535
536template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
537    constexpr ForwardIterator1  // constexpr in C++20
538    find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
539                  ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
540
541template <class ForwardIterator>
542    constexpr ForwardIterator   // constexpr in C++20
543    adjacent_find(ForwardIterator first, ForwardIterator last);
544
545template <class ForwardIterator, class BinaryPredicate>
546    constexpr ForwardIterator   // constexpr in C++20
547    adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
548
549template <class InputIterator, class T>
550    constexpr typename iterator_traits<InputIterator>::difference_type  // constexpr in C++20
551    count(InputIterator first, InputIterator last, const T& value);
552
553template <class InputIterator, class Predicate>
554    constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20
555    count_if(InputIterator first, InputIterator last, Predicate pred);
556
557template <class InputIterator1, class InputIterator2>
558    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
559    mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
560
561template <class InputIterator1, class InputIterator2>
562    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
563    mismatch(InputIterator1 first1, InputIterator1 last1,
564             InputIterator2 first2, InputIterator2 last2); // **C++14**
565
566template <class InputIterator1, class InputIterator2, class BinaryPredicate>
567    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
568    mismatch(InputIterator1 first1, InputIterator1 last1,
569             InputIterator2 first2, BinaryPredicate pred);
570
571template <class InputIterator1, class InputIterator2, class BinaryPredicate>
572    constexpr pair<InputIterator1, InputIterator2>   // constexpr in C++20
573    mismatch(InputIterator1 first1, InputIterator1 last1,
574             InputIterator2 first2, InputIterator2 last2,
575             BinaryPredicate pred); // **C++14**
576
577template <class InputIterator1, class InputIterator2>
578    constexpr bool      // constexpr in C++20
579    equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
580
581template <class InputIterator1, class InputIterator2>
582    constexpr bool      // constexpr in C++20
583    equal(InputIterator1 first1, InputIterator1 last1,
584          InputIterator2 first2, InputIterator2 last2); // **C++14**
585
586template <class InputIterator1, class InputIterator2, class BinaryPredicate>
587    constexpr bool      // constexpr in C++20
588    equal(InputIterator1 first1, InputIterator1 last1,
589          InputIterator2 first2, BinaryPredicate pred);
590
591template <class InputIterator1, class InputIterator2, class BinaryPredicate>
592    constexpr bool      // constexpr in C++20
593    equal(InputIterator1 first1, InputIterator1 last1,
594          InputIterator2 first2, InputIterator2 last2,
595          BinaryPredicate pred); // **C++14**
596
597template<class ForwardIterator1, class ForwardIterator2>
598    constexpr bool      // constexpr in C++20
599    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
600                   ForwardIterator2 first2);
601
602template<class ForwardIterator1, class ForwardIterator2>
603    constexpr bool      // constexpr in C++20
604    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
605                   ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
606
607template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
608    constexpr bool      // constexpr in C++20
609    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
610                   ForwardIterator2 first2, BinaryPredicate pred);
611
612template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
613    constexpr bool      // constexpr in C++20
614    is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
615                   ForwardIterator2 first2, ForwardIterator2 last2,
616                   BinaryPredicate pred);  // **C++14**
617
618template <class ForwardIterator1, class ForwardIterator2>
619    constexpr ForwardIterator1      // constexpr in C++20
620    search(ForwardIterator1 first1, ForwardIterator1 last1,
621           ForwardIterator2 first2, ForwardIterator2 last2);
622
623template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
624    constexpr ForwardIterator1      // constexpr in C++20
625    search(ForwardIterator1 first1, ForwardIterator1 last1,
626           ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
627
628template <class ForwardIterator, class Size, class T>
629    constexpr ForwardIterator       // constexpr in C++20
630    search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
631
632template <class ForwardIterator, class Size, class T, class BinaryPredicate>
633    constexpr ForwardIterator       // constexpr in C++20
634    search_n(ForwardIterator first, ForwardIterator last,
635             Size count, const T& value, BinaryPredicate pred);
636
637template <class InputIterator, class OutputIterator>
638    constexpr OutputIterator      // constexpr in C++20
639    copy(InputIterator first, InputIterator last, OutputIterator result);
640
641template<class InputIterator, class OutputIterator, class Predicate>
642    constexpr OutputIterator      // constexpr in C++20
643    copy_if(InputIterator first, InputIterator last,
644            OutputIterator result, Predicate pred);
645
646template<class InputIterator, class Size, class OutputIterator>
647    constexpr OutputIterator      // constexpr in C++20
648    copy_n(InputIterator first, Size n, OutputIterator result);
649
650template <class BidirectionalIterator1, class BidirectionalIterator2>
651    constexpr BidirectionalIterator2      // constexpr in C++20
652    copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
653                  BidirectionalIterator2 result);
654
655// [alg.move], move
656template<class InputIterator, class OutputIterator>
657    constexpr OutputIterator move(InputIterator first, InputIterator last,
658                                OutputIterator result);
659
660template<class BidirectionalIterator1, class BidirectionalIterator2>
661    constexpr BidirectionalIterator2
662    move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
663                  BidirectionalIterator2 result);
664
665template <class ForwardIterator1, class ForwardIterator2>
666    constexpr ForwardIterator2    // constexpr in C++20
667    swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
668
669namespace ranges {
670    template<class I1, class I2>
671    using swap_ranges_result = in_in_result<I1, I2>;
672
673template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2>
674        requires indirectly_swappable<I1, I2>
675    constexpr ranges::swap_ranges_result<I1, I2>
676        swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2);
677
678template<input_range R1, input_range R2>
679        requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>
680    constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
681        swap_ranges(R1&& r1, R2&& r2);
682}
683
684template <class ForwardIterator1, class ForwardIterator2>
685    constexpr void                // constexpr in C++20
686    iter_swap(ForwardIterator1 a, ForwardIterator2 b);
687
688template <class InputIterator, class OutputIterator, class UnaryOperation>
689    constexpr OutputIterator      // constexpr in C++20
690    transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
691
692template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
693    constexpr OutputIterator      // constexpr in C++20
694    transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
695              OutputIterator result, BinaryOperation binary_op);
696
697template <class ForwardIterator, class T>
698    constexpr void      // constexpr in C++20
699    replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
700
701template <class ForwardIterator, class Predicate, class T>
702    constexpr void      // constexpr in C++20
703    replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
704
705template <class InputIterator, class OutputIterator, class T>
706    constexpr OutputIterator      // constexpr in C++20
707    replace_copy(InputIterator first, InputIterator last, OutputIterator result,
708                 const T& old_value, const T& new_value);
709
710template <class InputIterator, class OutputIterator, class Predicate, class T>
711    constexpr OutputIterator      // constexpr in C++20
712    replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
713
714template <class ForwardIterator, class T>
715    constexpr void      // constexpr in C++20
716    fill(ForwardIterator first, ForwardIterator last, const T& value);
717
718template <class OutputIterator, class Size, class T>
719    constexpr OutputIterator      // constexpr in C++20
720    fill_n(OutputIterator first, Size n, const T& value);
721
722template <class ForwardIterator, class Generator>
723    constexpr void      // constexpr in C++20
724    generate(ForwardIterator first, ForwardIterator last, Generator gen);
725
726template <class OutputIterator, class Size, class Generator>
727    constexpr OutputIterator      // constexpr in C++20
728    generate_n(OutputIterator first, Size n, Generator gen);
729
730template <class ForwardIterator, class T>
731    constexpr ForwardIterator     // constexpr in C++20
732    remove(ForwardIterator first, ForwardIterator last, const T& value);
733
734template <class ForwardIterator, class Predicate>
735    constexpr ForwardIterator     // constexpr in C++20
736    remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
737
738template <class InputIterator, class OutputIterator, class T>
739    constexpr OutputIterator     // constexpr in C++20
740    remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
741
742template <class InputIterator, class OutputIterator, class Predicate>
743    constexpr OutputIterator     // constexpr in C++20
744    remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
745
746template <class ForwardIterator>
747    constexpr ForwardIterator    // constexpr in C++20
748    unique(ForwardIterator first, ForwardIterator last);
749
750template <class ForwardIterator, class BinaryPredicate>
751    constexpr ForwardIterator    // constexpr in C++20
752    unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
753
754template <class InputIterator, class OutputIterator>
755    constexpr OutputIterator     // constexpr in C++20
756    unique_copy(InputIterator first, InputIterator last, OutputIterator result);
757
758template <class InputIterator, class OutputIterator, class BinaryPredicate>
759    constexpr OutputIterator     // constexpr in C++20
760    unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
761
762template <class BidirectionalIterator>
763    constexpr void               // constexpr in C++20
764    reverse(BidirectionalIterator first, BidirectionalIterator last);
765
766template <class BidirectionalIterator, class OutputIterator>
767    constexpr OutputIterator       // constexpr in C++20
768    reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
769
770template <class ForwardIterator>
771    constexpr ForwardIterator      // constexpr in C++20
772    rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
773
774template <class ForwardIterator, class OutputIterator>
775    constexpr OutputIterator       // constexpr in C++20
776    rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
777
778template <class RandomAccessIterator>
779    void
780    random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
781
782template <class RandomAccessIterator, class RandomNumberGenerator>
783    void
784    random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
785                   RandomNumberGenerator& rand);  // deprecated in C++14, removed in C++17
786
787template<class PopulationIterator, class SampleIterator,
788         class Distance, class UniformRandomBitGenerator>
789    SampleIterator sample(PopulationIterator first, PopulationIterator last,
790                          SampleIterator out, Distance n,
791                          UniformRandomBitGenerator&& g); // C++17
792
793template<class RandomAccessIterator, class UniformRandomNumberGenerator>
794    void shuffle(RandomAccessIterator first, RandomAccessIterator last,
795                 UniformRandomNumberGenerator&& g);
796
797template<class ForwardIterator>
798  constexpr ForwardIterator
799    shift_left(ForwardIterator first, ForwardIterator last,
800               typename iterator_traits<ForwardIterator>::difference_type n); // C++20
801
802template<class ForwardIterator>
803  constexpr ForwardIterator
804    shift_right(ForwardIterator first, ForwardIterator last,
805                typename iterator_traits<ForwardIterator>::difference_type n); // C++20
806
807template <class InputIterator, class Predicate>
808    constexpr bool  // constexpr in C++20
809    is_partitioned(InputIterator first, InputIterator last, Predicate pred);
810
811template <class ForwardIterator, class Predicate>
812    constexpr ForwardIterator  // constexpr in C++20
813    partition(ForwardIterator first, ForwardIterator last, Predicate pred);
814
815template <class InputIterator, class OutputIterator1,
816          class OutputIterator2, class Predicate>
817    constexpr pair<OutputIterator1, OutputIterator2>   // constexpr in C++20
818    partition_copy(InputIterator first, InputIterator last,
819                   OutputIterator1 out_true, OutputIterator2 out_false,
820                   Predicate pred);
821
822template <class ForwardIterator, class Predicate>
823    ForwardIterator
824    stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
825
826template<class ForwardIterator, class Predicate>
827    constexpr ForwardIterator  // constexpr in C++20
828    partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
829
830template <class ForwardIterator>
831    constexpr bool  // constexpr in C++20
832    is_sorted(ForwardIterator first, ForwardIterator last);
833
834template <class ForwardIterator, class Compare>
835    constexpr bool  // constexpr in C++20
836    is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
837
838template<class ForwardIterator>
839    constexpr ForwardIterator    // constexpr in C++20
840    is_sorted_until(ForwardIterator first, ForwardIterator last);
841
842template <class ForwardIterator, class Compare>
843    constexpr ForwardIterator    // constexpr in C++20
844    is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
845
846template <class RandomAccessIterator>
847    constexpr void               // constexpr in C++20
848    sort(RandomAccessIterator first, RandomAccessIterator last);
849
850template <class RandomAccessIterator, class Compare>
851    constexpr void               // constexpr in C++20
852    sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
853
854template <class RandomAccessIterator>
855    void
856    stable_sort(RandomAccessIterator first, RandomAccessIterator last);
857
858template <class RandomAccessIterator, class Compare>
859    void
860    stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
861
862template <class RandomAccessIterator>
863    constexpr void                    // constexpr in C++20
864    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
865
866template <class RandomAccessIterator, class Compare>
867    constexpr void                    // constexpr in C++20
868    partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
869
870template <class InputIterator, class RandomAccessIterator>
871    constexpr RandomAccessIterator    // constexpr in C++20
872    partial_sort_copy(InputIterator first, InputIterator last,
873                      RandomAccessIterator result_first, RandomAccessIterator result_last);
874
875template <class InputIterator, class RandomAccessIterator, class Compare>
876    constexpr RandomAccessIterator    // constexpr in C++20
877    partial_sort_copy(InputIterator first, InputIterator last,
878                      RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
879
880template <class RandomAccessIterator>
881    constexpr void                    // constexpr in C++20
882    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
883
884template <class RandomAccessIterator, class Compare>
885    constexpr void                    // constexpr in C++20
886    nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
887
888template <class ForwardIterator, class T>
889    constexpr ForwardIterator                         // constexpr in C++20
890    lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
891
892template <class ForwardIterator, class T, class Compare>
893    constexpr ForwardIterator                         // constexpr in C++20
894    lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
895
896template <class ForwardIterator, class T>
897    constexpr ForwardIterator                         // constexpr in C++20
898    upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
899
900template <class ForwardIterator, class T, class Compare>
901    constexpr ForwardIterator                         // constexpr in C++20
902    upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
903
904template <class ForwardIterator, class T>
905    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
906    equal_range(ForwardIterator first, ForwardIterator last, const T& value);
907
908template <class ForwardIterator, class T, class Compare>
909    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++20
910    equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
911
912template <class ForwardIterator, class T>
913    constexpr bool                                    // constexpr in C++20
914    binary_search(ForwardIterator first, ForwardIterator last, const T& value);
915
916template <class ForwardIterator, class T, class Compare>
917    constexpr bool                                    // constexpr in C++20
918    binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
919
920template <class InputIterator1, class InputIterator2, class OutputIterator>
921    constexpr OutputIterator                          // constexpr in C++20
922    merge(InputIterator1 first1, InputIterator1 last1,
923          InputIterator2 first2, InputIterator2 last2, OutputIterator result);
924
925template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
926    constexpr OutputIterator                          // constexpr in C++20
927    merge(InputIterator1 first1, InputIterator1 last1,
928          InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
929
930template <class BidirectionalIterator>
931    void
932    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
933
934template <class BidirectionalIterator, class Compare>
935    void
936    inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
937
938template <class InputIterator1, class InputIterator2>
939    constexpr bool                                    // constexpr in C++20
940    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
941
942template <class InputIterator1, class InputIterator2, class Compare>
943    constexpr bool                                    // constexpr in C++20
944    includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
945
946template <class InputIterator1, class InputIterator2, class OutputIterator>
947    constexpr OutputIterator                          // constexpr in C++20
948    set_union(InputIterator1 first1, InputIterator1 last1,
949              InputIterator2 first2, InputIterator2 last2, OutputIterator result);
950
951template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
952    constexpr OutputIterator                          // constexpr in C++20
953    set_union(InputIterator1 first1, InputIterator1 last1,
954              InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
955
956template <class InputIterator1, class InputIterator2, class OutputIterator>
957    constexpr OutputIterator                         // constexpr in C++20
958    set_intersection(InputIterator1 first1, InputIterator1 last1,
959                     InputIterator2 first2, InputIterator2 last2, OutputIterator result);
960
961template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
962    constexpr OutputIterator                         // constexpr in C++20
963    set_intersection(InputIterator1 first1, InputIterator1 last1,
964                     InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
965
966template <class InputIterator1, class InputIterator2, class OutputIterator>
967    constexpr OutputIterator                         // constexpr in C++20
968    set_difference(InputIterator1 first1, InputIterator1 last1,
969                   InputIterator2 first2, InputIterator2 last2, OutputIterator result);
970
971template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
972    constexpr OutputIterator                         // constexpr in C++20
973    set_difference(InputIterator1 first1, InputIterator1 last1,
974                   InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
975
976template <class InputIterator1, class InputIterator2, class OutputIterator>
977    constexpr OutputIterator                         // constexpr in C++20
978    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
979                             InputIterator2 first2, InputIterator2 last2, OutputIterator result);
980
981template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
982    constexpr OutputIterator                         // constexpr in C++20
983    set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
984                             InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
985
986template <class RandomAccessIterator>
987    constexpr void                                   // constexpr in C++20
988    push_heap(RandomAccessIterator first, RandomAccessIterator last);
989
990template <class RandomAccessIterator, class Compare>
991    constexpr void                                   // constexpr in C++20
992    push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
993
994template <class RandomAccessIterator>
995    constexpr void                                   // constexpr in C++20
996    pop_heap(RandomAccessIterator first, RandomAccessIterator last);
997
998template <class RandomAccessIterator, class Compare>
999    constexpr void                                   // constexpr in C++20
1000    pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1001
1002template <class RandomAccessIterator>
1003    constexpr void                                   // constexpr in C++20
1004    make_heap(RandomAccessIterator first, RandomAccessIterator last);
1005
1006template <class RandomAccessIterator, class Compare>
1007    constexpr void                                   // constexpr in C++20
1008    make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1009
1010template <class RandomAccessIterator>
1011    constexpr void                                   // constexpr in C++20
1012    sort_heap(RandomAccessIterator first, RandomAccessIterator last);
1013
1014template <class RandomAccessIterator, class Compare>
1015    constexpr void                                   // constexpr in C++20
1016    sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1017
1018template <class RandomAccessIterator>
1019    constexpr bool   // constexpr in C++20
1020    is_heap(RandomAccessIterator first, RandomAccessiterator last);
1021
1022template <class RandomAccessIterator, class Compare>
1023    constexpr bool   // constexpr in C++20
1024    is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1025
1026template <class RandomAccessIterator>
1027    constexpr RandomAccessIterator   // constexpr in C++20
1028    is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
1029
1030template <class RandomAccessIterator, class Compare>
1031    constexpr RandomAccessIterator   // constexpr in C++20
1032    is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1033
1034template <class ForwardIterator>
1035    constexpr ForwardIterator        // constexpr in C++14
1036    min_element(ForwardIterator first, ForwardIterator last);
1037
1038template <class ForwardIterator, class Compare>
1039    constexpr ForwardIterator        // constexpr in C++14
1040    min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1041
1042template <class T>
1043    constexpr const T&               // constexpr in C++14
1044    min(const T& a, const T& b);
1045
1046template <class T, class Compare>
1047    constexpr const T&               // constexpr in C++14
1048    min(const T& a, const T& b, Compare comp);
1049
1050template<class T>
1051    constexpr T                      // constexpr in C++14
1052    min(initializer_list<T> t);
1053
1054template<class T, class Compare>
1055    constexpr T                      // constexpr in C++14
1056    min(initializer_list<T> t, Compare comp);
1057
1058template<class T>
1059    constexpr const T& clamp(const T& v, const T& lo, const T& hi);               // C++17
1060
1061template<class T, class Compare>
1062    constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17
1063
1064template <class ForwardIterator>
1065    constexpr ForwardIterator        // constexpr in C++14
1066    max_element(ForwardIterator first, ForwardIterator last);
1067
1068template <class ForwardIterator, class Compare>
1069    constexpr ForwardIterator        // constexpr in C++14
1070    max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1071
1072template <class T>
1073    constexpr const T&               // constexpr in C++14
1074    max(const T& a, const T& b);
1075
1076template <class T, class Compare>
1077    constexpr const T&               // constexpr in C++14
1078    max(const T& a, const T& b, Compare comp);
1079
1080template<class T>
1081    constexpr T                      // constexpr in C++14
1082    max(initializer_list<T> t);
1083
1084template<class T, class Compare>
1085    constexpr T                      // constexpr in C++14
1086    max(initializer_list<T> t, Compare comp);
1087
1088template<class ForwardIterator>
1089    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1090    minmax_element(ForwardIterator first, ForwardIterator last);
1091
1092template<class ForwardIterator, class Compare>
1093    constexpr pair<ForwardIterator, ForwardIterator>  // constexpr in C++14
1094    minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1095
1096template<class T>
1097    constexpr pair<const T&, const T&>  // constexpr in C++14
1098    minmax(const T& a, const T& b);
1099
1100template<class T, class Compare>
1101    constexpr pair<const T&, const T&>  // constexpr in C++14
1102    minmax(const T& a, const T& b, Compare comp);
1103
1104template<class T>
1105    constexpr pair<T, T>                // constexpr in C++14
1106    minmax(initializer_list<T> t);
1107
1108template<class T, class Compare>
1109    constexpr pair<T, T>                // constexpr in C++14
1110    minmax(initializer_list<T> t, Compare comp);
1111
1112template <class InputIterator1, class InputIterator2>
1113    constexpr bool     // constexpr in C++20
1114    lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
1115
1116template <class InputIterator1, class InputIterator2, class Compare>
1117    constexpr bool     // constexpr in C++20
1118    lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
1119                            InputIterator2 first2, InputIterator2 last2, Compare comp);
1120
1121template <class BidirectionalIterator>
1122    constexpr bool     // constexpr in C++20
1123    next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1124
1125template <class BidirectionalIterator, class Compare>
1126    constexpr bool     // constexpr in C++20
1127    next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1128
1129template <class BidirectionalIterator>
1130    constexpr bool     // constexpr in C++20
1131    prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1132
1133template <class BidirectionalIterator, class Compare>
1134    constexpr bool     // constexpr in C++20
1135    prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1136}  // std
1137
1138*/
1139
1140#include <__assert> // all public C++ headers provide the assertion handler
1141#include <__bits>
1142#include <__config>
1143#include <__debug>
1144#include <cstddef>
1145#include <cstring>
1146#include <memory>
1147#include <type_traits>
1148#include <version>
1149
1150#include <__algorithm/adjacent_find.h>
1151#include <__algorithm/all_of.h>
1152#include <__algorithm/any_of.h>
1153#include <__algorithm/binary_search.h>
1154#include <__algorithm/clamp.h>
1155#include <__algorithm/comp.h>
1156#include <__algorithm/comp_ref_type.h>
1157#include <__algorithm/copy.h>
1158#include <__algorithm/copy_backward.h>
1159#include <__algorithm/copy_if.h>
1160#include <__algorithm/copy_n.h>
1161#include <__algorithm/count.h>
1162#include <__algorithm/count_if.h>
1163#include <__algorithm/equal.h>
1164#include <__algorithm/equal_range.h>
1165#include <__algorithm/fill.h>
1166#include <__algorithm/fill_n.h>
1167#include <__algorithm/find.h>
1168#include <__algorithm/find_end.h>
1169#include <__algorithm/find_first_of.h>
1170#include <__algorithm/find_if.h>
1171#include <__algorithm/find_if_not.h>
1172#include <__algorithm/for_each.h>
1173#include <__algorithm/for_each_n.h>
1174#include <__algorithm/generate.h>
1175#include <__algorithm/generate_n.h>
1176#include <__algorithm/half_positive.h>
1177#include <__algorithm/in_found_result.h>
1178#include <__algorithm/in_fun_result.h>
1179#include <__algorithm/in_in_out_result.h>
1180#include <__algorithm/in_in_result.h>
1181#include <__algorithm/in_out_out_result.h>
1182#include <__algorithm/in_out_result.h>
1183#include <__algorithm/includes.h>
1184#include <__algorithm/inplace_merge.h>
1185#include <__algorithm/is_heap.h>
1186#include <__algorithm/is_heap_until.h>
1187#include <__algorithm/is_partitioned.h>
1188#include <__algorithm/is_permutation.h>
1189#include <__algorithm/is_sorted.h>
1190#include <__algorithm/is_sorted_until.h>
1191#include <__algorithm/iter_swap.h>
1192#include <__algorithm/lexicographical_compare.h>
1193#include <__algorithm/lower_bound.h>
1194#include <__algorithm/make_heap.h>
1195#include <__algorithm/max.h>
1196#include <__algorithm/max_element.h>
1197#include <__algorithm/merge.h>
1198#include <__algorithm/min.h>
1199#include <__algorithm/min_element.h>
1200#include <__algorithm/min_max_result.h>
1201#include <__algorithm/minmax.h>
1202#include <__algorithm/minmax_element.h>
1203#include <__algorithm/mismatch.h>
1204#include <__algorithm/move.h>
1205#include <__algorithm/move_backward.h>
1206#include <__algorithm/next_permutation.h>
1207#include <__algorithm/none_of.h>
1208#include <__algorithm/nth_element.h>
1209#include <__algorithm/partial_sort.h>
1210#include <__algorithm/partial_sort_copy.h>
1211#include <__algorithm/partition.h>
1212#include <__algorithm/partition_copy.h>
1213#include <__algorithm/partition_point.h>
1214#include <__algorithm/pop_heap.h>
1215#include <__algorithm/prev_permutation.h>
1216#include <__algorithm/push_heap.h>
1217#include <__algorithm/ranges_adjacent_find.h>
1218#include <__algorithm/ranges_all_of.h>
1219#include <__algorithm/ranges_any_of.h>
1220#include <__algorithm/ranges_binary_search.h>
1221#include <__algorithm/ranges_copy.h>
1222#include <__algorithm/ranges_copy_backward.h>
1223#include <__algorithm/ranges_copy_if.h>
1224#include <__algorithm/ranges_copy_n.h>
1225#include <__algorithm/ranges_count.h>
1226#include <__algorithm/ranges_count_if.h>
1227#include <__algorithm/ranges_equal.h>
1228#include <__algorithm/ranges_fill.h>
1229#include <__algorithm/ranges_fill_n.h>
1230#include <__algorithm/ranges_find.h>
1231#include <__algorithm/ranges_find_first_of.h>
1232#include <__algorithm/ranges_find_if.h>
1233#include <__algorithm/ranges_find_if_not.h>
1234#include <__algorithm/ranges_for_each.h>
1235#include <__algorithm/ranges_for_each_n.h>
1236#include <__algorithm/ranges_is_partitioned.h>
1237#include <__algorithm/ranges_is_sorted.h>
1238#include <__algorithm/ranges_is_sorted_until.h>
1239#include <__algorithm/ranges_lexicographical_compare.h>
1240#include <__algorithm/ranges_lower_bound.h>
1241#include <__algorithm/ranges_max.h>
1242#include <__algorithm/ranges_max_element.h>
1243#include <__algorithm/ranges_min.h>
1244#include <__algorithm/ranges_min_element.h>
1245#include <__algorithm/ranges_minmax.h>
1246#include <__algorithm/ranges_minmax_element.h>
1247#include <__algorithm/ranges_mismatch.h>
1248#include <__algorithm/ranges_move.h>
1249#include <__algorithm/ranges_move_backward.h>
1250#include <__algorithm/ranges_none_of.h>
1251#include <__algorithm/ranges_replace.h>
1252#include <__algorithm/ranges_replace_if.h>
1253#include <__algorithm/ranges_reverse.h>
1254#include <__algorithm/ranges_sort.h>
1255#include <__algorithm/ranges_swap_ranges.h>
1256#include <__algorithm/ranges_transform.h>
1257#include <__algorithm/ranges_upper_bound.h>
1258#include <__algorithm/remove.h>
1259#include <__algorithm/remove_copy.h>
1260#include <__algorithm/remove_copy_if.h>
1261#include <__algorithm/remove_if.h>
1262#include <__algorithm/replace.h>
1263#include <__algorithm/replace_copy.h>
1264#include <__algorithm/replace_copy_if.h>
1265#include <__algorithm/replace_if.h>
1266#include <__algorithm/reverse.h>
1267#include <__algorithm/reverse_copy.h>
1268#include <__algorithm/rotate.h>
1269#include <__algorithm/rotate_copy.h>
1270#include <__algorithm/sample.h>
1271#include <__algorithm/search.h>
1272#include <__algorithm/search_n.h>
1273#include <__algorithm/set_difference.h>
1274#include <__algorithm/set_intersection.h>
1275#include <__algorithm/set_symmetric_difference.h>
1276#include <__algorithm/set_union.h>
1277#include <__algorithm/shift_left.h>
1278#include <__algorithm/shift_right.h>
1279#include <__algorithm/shuffle.h>
1280#include <__algorithm/sift_down.h>
1281#include <__algorithm/sort.h>
1282#include <__algorithm/sort_heap.h>
1283#include <__algorithm/stable_partition.h>
1284#include <__algorithm/stable_sort.h>
1285#include <__algorithm/swap_ranges.h>
1286#include <__algorithm/transform.h>
1287#include <__algorithm/unique.h>
1288#include <__algorithm/unique_copy.h>
1289#include <__algorithm/unwrap_iter.h>
1290#include <__algorithm/upper_bound.h>
1291
1292#ifndef _LIBCPP_REMOVE_TRANSITIVE_INCLUDES
1293#  include <chrono>
1294#  include <iterator>
1295#  include <utility>
1296#endif
1297
1298// standard-mandated includes
1299#include <initializer_list>
1300
1301#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
1302#  pragma GCC system_header
1303#endif
1304
1305#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
1306#   include <__pstl_algorithm>
1307#endif
1308
1309#endif // _LIBCPP_ALGORITHM
1310