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 template <class _InIter, class _OutIter> 627 using reverse_copy_result = in_out_result<_InIter, _OutIter>; // since C++20 628 629 template<bidirectional_iterator I, sentinel_for<I> S, weakly_incrementable O> 630 requires indirectly_copyable<I, O> 631 constexpr ranges::reverse_copy_result<I, O> 632 ranges::reverse_copy(I first, S last, O result); // since C++20 633 634 template<bidirectional_range R, weakly_incrementable O> 635 requires indirectly_copyable<iterator_t<R>, O> 636 constexpr ranges::reverse_copy_result<borrowed_iterator_t<R>, O> 637 ranges::reverse_copy(R&& r, O result); // since C++20 638 639 template <class _InIter, class _OutIter> 640 using rotate_copy_result = in_out_result<_InIter, _OutIter>; // since C++20 641 642 template<forward_iterator I, sentinel_for<I> S, weakly_incrementable O> 643 requires indirectly_copyable<I, O> 644 constexpr ranges::rotate_copy_result<I, O> 645 ranges::rotate_copy(I first, I middle, S last, O result); // since C++20 646 647 template<forward_range R, weakly_incrementable O> 648 requires indirectly_copyable<iterator_t<R>, O> 649 constexpr ranges::rotate_copy_result<borrowed_iterator_t<R>, O> 650 ranges::rotate_copy(R&& r, iterator_t<R> middle, O result); // since C++20 651 652 template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, 653 sentinel_for<I2> S2, class Pred = ranges::equal_to, 654 class Proj1 = identity, class Proj2 = identity> 655 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 656 constexpr subrange<I1> 657 ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, 658 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 659 660 template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, 661 class Proj1 = identity, class Proj2 = identity> 662 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 663 constexpr borrowed_subrange_t<R1> 664 ranges::search(R1&& r1, R2&& r2, Pred pred = {}, 665 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 666 667 template<forward_iterator I, sentinel_for<I> S, class T, 668 class Pred = ranges::equal_to, class Proj = identity> 669 requires indirectly_comparable<I, const T*, Pred, Proj> 670 constexpr subrange<I> 671 ranges::search_n(I first, S last, iter_difference_t<I> count, 672 const T& value, Pred pred = {}, Proj proj = {}); // since C++20 673 674 template<forward_range R, class T, class Pred = ranges::equal_to, 675 class Proj = identity> 676 requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj> 677 constexpr borrowed_subrange_t<R> 678 ranges::search_n(R&& r, range_difference_t<R> count, 679 const T& value, Pred pred = {}, Proj proj = {}); // since C++20 680 681 template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, 682 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 683 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 684 constexpr subrange<I1> 685 ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, 686 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 687 688 template<forward_range R1, forward_range R2, 689 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 690 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 691 constexpr borrowed_subrange_t<R1> 692 ranges::find_end(R1&& r1, R2&& r2, Pred pred = {}, 693 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 694 695 template<class I1, class I2, class O> 696 using set_symmetric_difference_result = in_in_out_result<I1, I2, O>; // since C++20 697 698 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 699 weakly_incrementable O, class Comp = ranges::less, 700 class Proj1 = identity, class Proj2 = identity> 701 requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 702 constexpr set_symmetric_difference_result<I1, I2, O> 703 set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result, 704 Comp comp = {}, Proj1 proj1 = {}, 705 Proj2 proj2 = {}); // since C++20 706 707 template<input_range R1, input_range R2, weakly_incrementable O, 708 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 709 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 710 constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>, 711 borrowed_iterator_t<R2>, O> 712 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {}, 713 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 714 715 template<class I1, class I2, class O> 716 using set_union_result = in_in_out_result<I1, I2, O>; // since C++20 717 718 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 719 weakly_incrementable O, class Comp = ranges::less, 720 class Proj1 = identity, class Proj2 = identity> 721 requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 722 constexpr set_union_result<I1, I2, O> 723 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {}, 724 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 725 726 template<input_range R1, input_range R2, weakly_incrementable O, 727 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 728 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 729 constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 730 set_union(R1&& r1, R2&& r2, O result, Comp comp = {}, 731 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 732} 733 734 constexpr bool // constexpr in C++20 735 all_of(InputIterator first, InputIterator last, Predicate pred); 736 737template <class InputIterator, class Predicate> 738 constexpr bool // constexpr in C++20 739 any_of(InputIterator first, InputIterator last, Predicate pred); 740 741template <class InputIterator, class Predicate> 742 constexpr bool // constexpr in C++20 743 none_of(InputIterator first, InputIterator last, Predicate pred); 744 745template <class InputIterator, class Function> 746 constexpr Function // constexpr in C++20 747 for_each(InputIterator first, InputIterator last, Function f); 748 749template<class InputIterator, class Size, class Function> 750 constexpr InputIterator // constexpr in C++20 751 for_each_n(InputIterator first, Size n, Function f); // C++17 752 753template <class InputIterator, class T> 754 constexpr InputIterator // constexpr in C++20 755 find(InputIterator first, InputIterator last, const T& value); 756 757template <class InputIterator, class Predicate> 758 constexpr InputIterator // constexpr in C++20 759 find_if(InputIterator first, InputIterator last, Predicate pred); 760 761template<class InputIterator, class Predicate> 762 constexpr InputIterator // constexpr in C++20 763 find_if_not(InputIterator first, InputIterator last, Predicate pred); 764 765template <class ForwardIterator1, class ForwardIterator2> 766 constexpr ForwardIterator1 // constexpr in C++20 767 find_end(ForwardIterator1 first1, ForwardIterator1 last1, 768 ForwardIterator2 first2, ForwardIterator2 last2); 769 770template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 771 constexpr ForwardIterator1 // constexpr in C++20 772 find_end(ForwardIterator1 first1, ForwardIterator1 last1, 773 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 774 775template <class ForwardIterator1, class ForwardIterator2> 776 constexpr ForwardIterator1 // constexpr in C++20 777 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 778 ForwardIterator2 first2, ForwardIterator2 last2); 779 780template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 781 constexpr ForwardIterator1 // constexpr in C++20 782 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 783 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 784 785template <class ForwardIterator> 786 constexpr ForwardIterator // constexpr in C++20 787 adjacent_find(ForwardIterator first, ForwardIterator last); 788 789template <class ForwardIterator, class BinaryPredicate> 790 constexpr ForwardIterator // constexpr in C++20 791 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 792 793template <class InputIterator, class T> 794 constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 795 count(InputIterator first, InputIterator last, const T& value); 796 797template <class InputIterator, class Predicate> 798 constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 799 count_if(InputIterator first, InputIterator last, Predicate pred); 800 801template <class InputIterator1, class InputIterator2> 802 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 803 mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 804 805template <class InputIterator1, class InputIterator2> 806 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 807 mismatch(InputIterator1 first1, InputIterator1 last1, 808 InputIterator2 first2, InputIterator2 last2); // **C++14** 809 810template <class InputIterator1, class InputIterator2, class BinaryPredicate> 811 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 812 mismatch(InputIterator1 first1, InputIterator1 last1, 813 InputIterator2 first2, BinaryPredicate pred); 814 815template <class InputIterator1, class InputIterator2, class BinaryPredicate> 816 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 817 mismatch(InputIterator1 first1, InputIterator1 last1, 818 InputIterator2 first2, InputIterator2 last2, 819 BinaryPredicate pred); // **C++14** 820 821template <class InputIterator1, class InputIterator2> 822 constexpr bool // constexpr in C++20 823 equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 824 825template <class InputIterator1, class InputIterator2> 826 constexpr bool // constexpr in C++20 827 equal(InputIterator1 first1, InputIterator1 last1, 828 InputIterator2 first2, InputIterator2 last2); // **C++14** 829 830template <class InputIterator1, class InputIterator2, class BinaryPredicate> 831 constexpr bool // constexpr in C++20 832 equal(InputIterator1 first1, InputIterator1 last1, 833 InputIterator2 first2, BinaryPredicate pred); 834 835template <class InputIterator1, class InputIterator2, class BinaryPredicate> 836 constexpr bool // constexpr in C++20 837 equal(InputIterator1 first1, InputIterator1 last1, 838 InputIterator2 first2, InputIterator2 last2, 839 BinaryPredicate pred); // **C++14** 840 841template<class ForwardIterator1, class ForwardIterator2> 842 constexpr bool // constexpr in C++20 843 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 844 ForwardIterator2 first2); 845 846template<class ForwardIterator1, class ForwardIterator2> 847 constexpr bool // constexpr in C++20 848 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 849 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 850 851template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 852 constexpr bool // constexpr in C++20 853 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 854 ForwardIterator2 first2, BinaryPredicate pred); 855 856template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 857 constexpr bool // constexpr in C++20 858 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 859 ForwardIterator2 first2, ForwardIterator2 last2, 860 BinaryPredicate pred); // **C++14** 861 862template <class ForwardIterator1, class ForwardIterator2> 863 constexpr ForwardIterator1 // constexpr in C++20 864 search(ForwardIterator1 first1, ForwardIterator1 last1, 865 ForwardIterator2 first2, ForwardIterator2 last2); 866 867template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 868 constexpr ForwardIterator1 // constexpr in C++20 869 search(ForwardIterator1 first1, ForwardIterator1 last1, 870 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 871 872template <class ForwardIterator, class Size, class T> 873 constexpr ForwardIterator // constexpr in C++20 874 search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 875 876template <class ForwardIterator, class Size, class T, class BinaryPredicate> 877 constexpr ForwardIterator // constexpr in C++20 878 search_n(ForwardIterator first, ForwardIterator last, 879 Size count, const T& value, BinaryPredicate pred); 880 881template <class InputIterator, class OutputIterator> 882 constexpr OutputIterator // constexpr in C++20 883 copy(InputIterator first, InputIterator last, OutputIterator result); 884 885template<class InputIterator, class OutputIterator, class Predicate> 886 constexpr OutputIterator // constexpr in C++20 887 copy_if(InputIterator first, InputIterator last, 888 OutputIterator result, Predicate pred); 889 890template<class InputIterator, class Size, class OutputIterator> 891 constexpr OutputIterator // constexpr in C++20 892 copy_n(InputIterator first, Size n, OutputIterator result); 893 894template <class BidirectionalIterator1, class BidirectionalIterator2> 895 constexpr BidirectionalIterator2 // constexpr in C++20 896 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 897 BidirectionalIterator2 result); 898 899// [alg.move], move 900template<class InputIterator, class OutputIterator> 901 constexpr OutputIterator move(InputIterator first, InputIterator last, 902 OutputIterator result); 903 904template<class BidirectionalIterator1, class BidirectionalIterator2> 905 constexpr BidirectionalIterator2 906 move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 907 BidirectionalIterator2 result); 908 909template <class ForwardIterator1, class ForwardIterator2> 910 constexpr ForwardIterator2 // constexpr in C++20 911 swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 912 913namespace ranges { 914 template<class I1, class I2> 915 using swap_ranges_result = in_in_result<I1, I2>; 916 917template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> 918 requires indirectly_swappable<I1, I2> 919 constexpr ranges::swap_ranges_result<I1, I2> 920 swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); 921 922template<input_range R1, input_range R2> 923 requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> 924 constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 925 swap_ranges(R1&& r1, R2&& r2); 926} 927 928template <class ForwardIterator1, class ForwardIterator2> 929 constexpr void // constexpr in C++20 930 iter_swap(ForwardIterator1 a, ForwardIterator2 b); 931 932template <class InputIterator, class OutputIterator, class UnaryOperation> 933 constexpr OutputIterator // constexpr in C++20 934 transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 935 936template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 937 constexpr OutputIterator // constexpr in C++20 938 transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 939 OutputIterator result, BinaryOperation binary_op); 940 941template <class ForwardIterator, class T> 942 constexpr void // constexpr in C++20 943 replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 944 945template <class ForwardIterator, class Predicate, class T> 946 constexpr void // constexpr in C++20 947 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 948 949template <class InputIterator, class OutputIterator, class T> 950 constexpr OutputIterator // constexpr in C++20 951 replace_copy(InputIterator first, InputIterator last, OutputIterator result, 952 const T& old_value, const T& new_value); 953 954template <class InputIterator, class OutputIterator, class Predicate, class T> 955 constexpr OutputIterator // constexpr in C++20 956 replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 957 958template <class ForwardIterator, class T> 959 constexpr void // constexpr in C++20 960 fill(ForwardIterator first, ForwardIterator last, const T& value); 961 962template <class OutputIterator, class Size, class T> 963 constexpr OutputIterator // constexpr in C++20 964 fill_n(OutputIterator first, Size n, const T& value); 965 966template <class ForwardIterator, class Generator> 967 constexpr void // constexpr in C++20 968 generate(ForwardIterator first, ForwardIterator last, Generator gen); 969 970template <class OutputIterator, class Size, class Generator> 971 constexpr OutputIterator // constexpr in C++20 972 generate_n(OutputIterator first, Size n, Generator gen); 973 974template <class ForwardIterator, class T> 975 constexpr ForwardIterator // constexpr in C++20 976 remove(ForwardIterator first, ForwardIterator last, const T& value); 977 978template <class ForwardIterator, class Predicate> 979 constexpr ForwardIterator // constexpr in C++20 980 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 981 982template <class InputIterator, class OutputIterator, class T> 983 constexpr OutputIterator // constexpr in C++20 984 remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 985 986template <class InputIterator, class OutputIterator, class Predicate> 987 constexpr OutputIterator // constexpr in C++20 988 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 989 990template <class ForwardIterator> 991 constexpr ForwardIterator // constexpr in C++20 992 unique(ForwardIterator first, ForwardIterator last); 993 994template <class ForwardIterator, class BinaryPredicate> 995 constexpr ForwardIterator // constexpr in C++20 996 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 997 998template <class InputIterator, class OutputIterator> 999 constexpr OutputIterator // constexpr in C++20 1000 unique_copy(InputIterator first, InputIterator last, OutputIterator result); 1001 1002template <class InputIterator, class OutputIterator, class BinaryPredicate> 1003 constexpr OutputIterator // constexpr in C++20 1004 unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 1005 1006template <class BidirectionalIterator> 1007 constexpr void // constexpr in C++20 1008 reverse(BidirectionalIterator first, BidirectionalIterator last); 1009 1010template <class BidirectionalIterator, class OutputIterator> 1011 constexpr OutputIterator // constexpr in C++20 1012 reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 1013 1014template <class ForwardIterator> 1015 constexpr ForwardIterator // constexpr in C++20 1016 rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 1017 1018template <class ForwardIterator, class OutputIterator> 1019 constexpr OutputIterator // constexpr in C++20 1020 rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 1021 1022template <class RandomAccessIterator> 1023 void 1024 random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 1025 1026template <class RandomAccessIterator, class RandomNumberGenerator> 1027 void 1028 random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 1029 RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 1030 1031template<class PopulationIterator, class SampleIterator, 1032 class Distance, class UniformRandomBitGenerator> 1033 SampleIterator sample(PopulationIterator first, PopulationIterator last, 1034 SampleIterator out, Distance n, 1035 UniformRandomBitGenerator&& g); // C++17 1036 1037template<class RandomAccessIterator, class UniformRandomNumberGenerator> 1038 void shuffle(RandomAccessIterator first, RandomAccessIterator last, 1039 UniformRandomNumberGenerator&& g); 1040 1041template<class ForwardIterator> 1042 constexpr ForwardIterator 1043 shift_left(ForwardIterator first, ForwardIterator last, 1044 typename iterator_traits<ForwardIterator>::difference_type n); // C++20 1045 1046template<class ForwardIterator> 1047 constexpr ForwardIterator 1048 shift_right(ForwardIterator first, ForwardIterator last, 1049 typename iterator_traits<ForwardIterator>::difference_type n); // C++20 1050 1051template <class InputIterator, class Predicate> 1052 constexpr bool // constexpr in C++20 1053 is_partitioned(InputIterator first, InputIterator last, Predicate pred); 1054 1055template <class ForwardIterator, class Predicate> 1056 constexpr ForwardIterator // constexpr in C++20 1057 partition(ForwardIterator first, ForwardIterator last, Predicate pred); 1058 1059template <class InputIterator, class OutputIterator1, 1060 class OutputIterator2, class Predicate> 1061 constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 1062 partition_copy(InputIterator first, InputIterator last, 1063 OutputIterator1 out_true, OutputIterator2 out_false, 1064 Predicate pred); 1065 1066template <class ForwardIterator, class Predicate> 1067 ForwardIterator 1068 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 1069 1070template<class ForwardIterator, class Predicate> 1071 constexpr ForwardIterator // constexpr in C++20 1072 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 1073 1074template <class ForwardIterator> 1075 constexpr bool // constexpr in C++20 1076 is_sorted(ForwardIterator first, ForwardIterator last); 1077 1078template <class ForwardIterator, class Compare> 1079 constexpr bool // constexpr in C++20 1080 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 1081 1082template<class ForwardIterator> 1083 constexpr ForwardIterator // constexpr in C++20 1084 is_sorted_until(ForwardIterator first, ForwardIterator last); 1085 1086template <class ForwardIterator, class Compare> 1087 constexpr ForwardIterator // constexpr in C++20 1088 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 1089 1090template <class RandomAccessIterator> 1091 constexpr void // constexpr in C++20 1092 sort(RandomAccessIterator first, RandomAccessIterator last); 1093 1094template <class RandomAccessIterator, class Compare> 1095 constexpr void // constexpr in C++20 1096 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1097 1098template <class RandomAccessIterator> 1099 void 1100 stable_sort(RandomAccessIterator first, RandomAccessIterator last); 1101 1102template <class RandomAccessIterator, class Compare> 1103 void 1104 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1105 1106template <class RandomAccessIterator> 1107 constexpr void // constexpr in C++20 1108 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 1109 1110template <class RandomAccessIterator, class Compare> 1111 constexpr void // constexpr in C++20 1112 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 1113 1114template <class InputIterator, class RandomAccessIterator> 1115 constexpr RandomAccessIterator // constexpr in C++20 1116 partial_sort_copy(InputIterator first, InputIterator last, 1117 RandomAccessIterator result_first, RandomAccessIterator result_last); 1118 1119template <class InputIterator, class RandomAccessIterator, class Compare> 1120 constexpr RandomAccessIterator // constexpr in C++20 1121 partial_sort_copy(InputIterator first, InputIterator last, 1122 RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 1123 1124template <class RandomAccessIterator> 1125 constexpr void // constexpr in C++20 1126 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 1127 1128template <class RandomAccessIterator, class Compare> 1129 constexpr void // constexpr in C++20 1130 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 1131 1132template <class ForwardIterator, class T> 1133 constexpr ForwardIterator // constexpr in C++20 1134 lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 1135 1136template <class ForwardIterator, class T, class Compare> 1137 constexpr ForwardIterator // constexpr in C++20 1138 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 1139 1140template <class ForwardIterator, class T> 1141 constexpr ForwardIterator // constexpr in C++20 1142 upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 1143 1144template <class ForwardIterator, class T, class Compare> 1145 constexpr ForwardIterator // constexpr in C++20 1146 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 1147 1148template <class ForwardIterator, class T> 1149 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 1150 equal_range(ForwardIterator first, ForwardIterator last, const T& value); 1151 1152template <class ForwardIterator, class T, class Compare> 1153 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 1154 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 1155 1156template <class ForwardIterator, class T> 1157 constexpr bool // constexpr in C++20 1158 binary_search(ForwardIterator first, ForwardIterator last, const T& value); 1159 1160template <class ForwardIterator, class T, class Compare> 1161 constexpr bool // constexpr in C++20 1162 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 1163 1164template <class InputIterator1, class InputIterator2, class OutputIterator> 1165 constexpr OutputIterator // constexpr in C++20 1166 merge(InputIterator1 first1, InputIterator1 last1, 1167 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1168 1169template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1170 constexpr OutputIterator // constexpr in C++20 1171 merge(InputIterator1 first1, InputIterator1 last1, 1172 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1173 1174template <class BidirectionalIterator> 1175 void 1176 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 1177 1178template <class BidirectionalIterator, class Compare> 1179 void 1180 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 1181 1182template <class InputIterator1, class InputIterator2> 1183 constexpr bool // constexpr in C++20 1184 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 1185 1186template <class InputIterator1, class InputIterator2, class Compare> 1187 constexpr bool // constexpr in C++20 1188 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 1189 1190template <class InputIterator1, class InputIterator2, class OutputIterator> 1191 constexpr OutputIterator // constexpr in C++20 1192 set_union(InputIterator1 first1, InputIterator1 last1, 1193 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1194 1195template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1196 constexpr OutputIterator // constexpr in C++20 1197 set_union(InputIterator1 first1, InputIterator1 last1, 1198 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1199 1200template <class InputIterator1, class InputIterator2, class OutputIterator> 1201 constexpr OutputIterator // constexpr in C++20 1202 set_intersection(InputIterator1 first1, InputIterator1 last1, 1203 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1204 1205template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1206 constexpr OutputIterator // constexpr in C++20 1207 set_intersection(InputIterator1 first1, InputIterator1 last1, 1208 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1209 1210template <class InputIterator1, class InputIterator2, class OutputIterator> 1211 constexpr OutputIterator // constexpr in C++20 1212 set_difference(InputIterator1 first1, InputIterator1 last1, 1213 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1214 1215template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1216 constexpr OutputIterator // constexpr in C++20 1217 set_difference(InputIterator1 first1, InputIterator1 last1, 1218 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1219 1220template <class InputIterator1, class InputIterator2, class OutputIterator> 1221 constexpr OutputIterator // constexpr in C++20 1222 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 1223 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1224 1225template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1226 constexpr OutputIterator // constexpr in C++20 1227 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 1228 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1229 1230template <class RandomAccessIterator> 1231 constexpr void // constexpr in C++20 1232 push_heap(RandomAccessIterator first, RandomAccessIterator last); 1233 1234template <class RandomAccessIterator, class Compare> 1235 constexpr void // constexpr in C++20 1236 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1237 1238template <class RandomAccessIterator> 1239 constexpr void // constexpr in C++20 1240 pop_heap(RandomAccessIterator first, RandomAccessIterator last); 1241 1242template <class RandomAccessIterator, class Compare> 1243 constexpr void // constexpr in C++20 1244 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1245 1246template <class RandomAccessIterator> 1247 constexpr void // constexpr in C++20 1248 make_heap(RandomAccessIterator first, RandomAccessIterator last); 1249 1250template <class RandomAccessIterator, class Compare> 1251 constexpr void // constexpr in C++20 1252 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1253 1254template <class RandomAccessIterator> 1255 constexpr void // constexpr in C++20 1256 sort_heap(RandomAccessIterator first, RandomAccessIterator last); 1257 1258template <class RandomAccessIterator, class Compare> 1259 constexpr void // constexpr in C++20 1260 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1261 1262template <class RandomAccessIterator> 1263 constexpr bool // constexpr in C++20 1264 is_heap(RandomAccessIterator first, RandomAccessiterator last); 1265 1266template <class RandomAccessIterator, class Compare> 1267 constexpr bool // constexpr in C++20 1268 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 1269 1270template <class RandomAccessIterator> 1271 constexpr RandomAccessIterator // constexpr in C++20 1272 is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 1273 1274template <class RandomAccessIterator, class Compare> 1275 constexpr RandomAccessIterator // constexpr in C++20 1276 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 1277 1278template <class ForwardIterator> 1279 constexpr ForwardIterator // constexpr in C++14 1280 min_element(ForwardIterator first, ForwardIterator last); 1281 1282template <class ForwardIterator, class Compare> 1283 constexpr ForwardIterator // constexpr in C++14 1284 min_element(ForwardIterator first, ForwardIterator last, Compare comp); 1285 1286template <class T> 1287 constexpr const T& // constexpr in C++14 1288 min(const T& a, const T& b); 1289 1290template <class T, class Compare> 1291 constexpr const T& // constexpr in C++14 1292 min(const T& a, const T& b, Compare comp); 1293 1294template<class T> 1295 constexpr T // constexpr in C++14 1296 min(initializer_list<T> t); 1297 1298template<class T, class Compare> 1299 constexpr T // constexpr in C++14 1300 min(initializer_list<T> t, Compare comp); 1301 1302template<class T> 1303 constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 1304 1305template<class T, class Compare> 1306 constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 1307 1308template <class ForwardIterator> 1309 constexpr ForwardIterator // constexpr in C++14 1310 max_element(ForwardIterator first, ForwardIterator last); 1311 1312template <class ForwardIterator, class Compare> 1313 constexpr ForwardIterator // constexpr in C++14 1314 max_element(ForwardIterator first, ForwardIterator last, Compare comp); 1315 1316template <class T> 1317 constexpr const T& // constexpr in C++14 1318 max(const T& a, const T& b); 1319 1320template <class T, class Compare> 1321 constexpr const T& // constexpr in C++14 1322 max(const T& a, const T& b, Compare comp); 1323 1324template<class T> 1325 constexpr T // constexpr in C++14 1326 max(initializer_list<T> t); 1327 1328template<class T, class Compare> 1329 constexpr T // constexpr in C++14 1330 max(initializer_list<T> t, Compare comp); 1331 1332template<class ForwardIterator> 1333 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 1334 minmax_element(ForwardIterator first, ForwardIterator last); 1335 1336template<class ForwardIterator, class Compare> 1337 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 1338 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 1339 1340template<class T> 1341 constexpr pair<const T&, const T&> // constexpr in C++14 1342 minmax(const T& a, const T& b); 1343 1344template<class T, class Compare> 1345 constexpr pair<const T&, const T&> // constexpr in C++14 1346 minmax(const T& a, const T& b, Compare comp); 1347 1348template<class T> 1349 constexpr pair<T, T> // constexpr in C++14 1350 minmax(initializer_list<T> t); 1351 1352template<class T, class Compare> 1353 constexpr pair<T, T> // constexpr in C++14 1354 minmax(initializer_list<T> t, Compare comp); 1355 1356template <class InputIterator1, class InputIterator2> 1357 constexpr bool // constexpr in C++20 1358 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 1359 1360template <class InputIterator1, class InputIterator2, class Compare> 1361 constexpr bool // constexpr in C++20 1362 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 1363 InputIterator2 first2, InputIterator2 last2, Compare comp); 1364 1365template <class BidirectionalIterator> 1366 constexpr bool // constexpr in C++20 1367 next_permutation(BidirectionalIterator first, BidirectionalIterator last); 1368 1369template <class BidirectionalIterator, class Compare> 1370 constexpr bool // constexpr in C++20 1371 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 1372 1373template <class BidirectionalIterator> 1374 constexpr bool // constexpr in C++20 1375 prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 1376 1377template <class BidirectionalIterator, class Compare> 1378 constexpr bool // constexpr in C++20 1379 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 1380} // std 1381 1382*/ 1383 1384#include <__assert> // all public C++ headers provide the assertion handler 1385#include <__bits> 1386#include <__config> 1387#include <__debug> 1388#include <cstddef> 1389#include <cstring> 1390#include <memory> 1391#include <type_traits> 1392#include <version> 1393 1394#include <__algorithm/adjacent_find.h> 1395#include <__algorithm/all_of.h> 1396#include <__algorithm/any_of.h> 1397#include <__algorithm/binary_search.h> 1398#include <__algorithm/clamp.h> 1399#include <__algorithm/comp.h> 1400#include <__algorithm/comp_ref_type.h> 1401#include <__algorithm/copy.h> 1402#include <__algorithm/copy_backward.h> 1403#include <__algorithm/copy_if.h> 1404#include <__algorithm/copy_n.h> 1405#include <__algorithm/count.h> 1406#include <__algorithm/count_if.h> 1407#include <__algorithm/equal.h> 1408#include <__algorithm/equal_range.h> 1409#include <__algorithm/fill.h> 1410#include <__algorithm/fill_n.h> 1411#include <__algorithm/find.h> 1412#include <__algorithm/find_end.h> 1413#include <__algorithm/find_first_of.h> 1414#include <__algorithm/find_if.h> 1415#include <__algorithm/find_if_not.h> 1416#include <__algorithm/for_each.h> 1417#include <__algorithm/for_each_n.h> 1418#include <__algorithm/generate.h> 1419#include <__algorithm/generate_n.h> 1420#include <__algorithm/half_positive.h> 1421#include <__algorithm/in_found_result.h> 1422#include <__algorithm/in_fun_result.h> 1423#include <__algorithm/in_in_out_result.h> 1424#include <__algorithm/in_in_result.h> 1425#include <__algorithm/in_out_out_result.h> 1426#include <__algorithm/in_out_result.h> 1427#include <__algorithm/includes.h> 1428#include <__algorithm/inplace_merge.h> 1429#include <__algorithm/is_heap.h> 1430#include <__algorithm/is_heap_until.h> 1431#include <__algorithm/is_partitioned.h> 1432#include <__algorithm/is_permutation.h> 1433#include <__algorithm/is_sorted.h> 1434#include <__algorithm/is_sorted_until.h> 1435#include <__algorithm/iter_swap.h> 1436#include <__algorithm/lexicographical_compare.h> 1437#include <__algorithm/lower_bound.h> 1438#include <__algorithm/make_heap.h> 1439#include <__algorithm/max.h> 1440#include <__algorithm/max_element.h> 1441#include <__algorithm/merge.h> 1442#include <__algorithm/min.h> 1443#include <__algorithm/min_element.h> 1444#include <__algorithm/min_max_result.h> 1445#include <__algorithm/minmax.h> 1446#include <__algorithm/minmax_element.h> 1447#include <__algorithm/mismatch.h> 1448#include <__algorithm/move.h> 1449#include <__algorithm/move_backward.h> 1450#include <__algorithm/next_permutation.h> 1451#include <__algorithm/none_of.h> 1452#include <__algorithm/nth_element.h> 1453#include <__algorithm/partial_sort.h> 1454#include <__algorithm/partial_sort_copy.h> 1455#include <__algorithm/partition.h> 1456#include <__algorithm/partition_copy.h> 1457#include <__algorithm/partition_point.h> 1458#include <__algorithm/pop_heap.h> 1459#include <__algorithm/prev_permutation.h> 1460#include <__algorithm/push_heap.h> 1461#include <__algorithm/ranges_adjacent_find.h> 1462#include <__algorithm/ranges_all_of.h> 1463#include <__algorithm/ranges_any_of.h> 1464#include <__algorithm/ranges_binary_search.h> 1465#include <__algorithm/ranges_copy.h> 1466#include <__algorithm/ranges_copy_backward.h> 1467#include <__algorithm/ranges_copy_if.h> 1468#include <__algorithm/ranges_copy_n.h> 1469#include <__algorithm/ranges_count.h> 1470#include <__algorithm/ranges_count_if.h> 1471#include <__algorithm/ranges_equal.h> 1472#include <__algorithm/ranges_fill.h> 1473#include <__algorithm/ranges_fill_n.h> 1474#include <__algorithm/ranges_find.h> 1475#include <__algorithm/ranges_find_end.h> 1476#include <__algorithm/ranges_find_first_of.h> 1477#include <__algorithm/ranges_find_if.h> 1478#include <__algorithm/ranges_find_if_not.h> 1479#include <__algorithm/ranges_for_each.h> 1480#include <__algorithm/ranges_for_each_n.h> 1481#include <__algorithm/ranges_is_partitioned.h> 1482#include <__algorithm/ranges_is_sorted.h> 1483#include <__algorithm/ranges_is_sorted_until.h> 1484#include <__algorithm/ranges_lexicographical_compare.h> 1485#include <__algorithm/ranges_lower_bound.h> 1486#include <__algorithm/ranges_make_heap.h> 1487#include <__algorithm/ranges_max.h> 1488#include <__algorithm/ranges_max_element.h> 1489#include <__algorithm/ranges_merge.h> 1490#include <__algorithm/ranges_min.h> 1491#include <__algorithm/ranges_min_element.h> 1492#include <__algorithm/ranges_minmax.h> 1493#include <__algorithm/ranges_minmax_element.h> 1494#include <__algorithm/ranges_mismatch.h> 1495#include <__algorithm/ranges_move.h> 1496#include <__algorithm/ranges_move_backward.h> 1497#include <__algorithm/ranges_none_of.h> 1498#include <__algorithm/ranges_nth_element.h> 1499#include <__algorithm/ranges_pop_heap.h> 1500#include <__algorithm/ranges_push_heap.h> 1501#include <__algorithm/ranges_remove.h> 1502#include <__algorithm/ranges_remove_if.h> 1503#include <__algorithm/ranges_replace.h> 1504#include <__algorithm/ranges_replace_if.h> 1505#include <__algorithm/ranges_reverse.h> 1506#include <__algorithm/ranges_reverse_copy.h> 1507#include <__algorithm/ranges_rotate_copy.h> 1508#include <__algorithm/ranges_search.h> 1509#include <__algorithm/ranges_search_n.h> 1510#include <__algorithm/ranges_set_difference.h> 1511#include <__algorithm/ranges_set_intersection.h> 1512#include <__algorithm/ranges_set_symmetric_difference.h> 1513#include <__algorithm/ranges_set_union.h> 1514#include <__algorithm/ranges_sort.h> 1515#include <__algorithm/ranges_sort_heap.h> 1516#include <__algorithm/ranges_stable_sort.h> 1517#include <__algorithm/ranges_swap_ranges.h> 1518#include <__algorithm/ranges_transform.h> 1519#include <__algorithm/ranges_upper_bound.h> 1520#include <__algorithm/remove.h> 1521#include <__algorithm/remove_copy.h> 1522#include <__algorithm/remove_copy_if.h> 1523#include <__algorithm/remove_if.h> 1524#include <__algorithm/replace.h> 1525#include <__algorithm/replace_copy.h> 1526#include <__algorithm/replace_copy_if.h> 1527#include <__algorithm/replace_if.h> 1528#include <__algorithm/reverse.h> 1529#include <__algorithm/reverse_copy.h> 1530#include <__algorithm/rotate.h> 1531#include <__algorithm/rotate_copy.h> 1532#include <__algorithm/sample.h> 1533#include <__algorithm/search.h> 1534#include <__algorithm/search_n.h> 1535#include <__algorithm/set_difference.h> 1536#include <__algorithm/set_intersection.h> 1537#include <__algorithm/set_symmetric_difference.h> 1538#include <__algorithm/set_union.h> 1539#include <__algorithm/shift_left.h> 1540#include <__algorithm/shift_right.h> 1541#include <__algorithm/shuffle.h> 1542#include <__algorithm/sift_down.h> 1543#include <__algorithm/sort.h> 1544#include <__algorithm/sort_heap.h> 1545#include <__algorithm/stable_partition.h> 1546#include <__algorithm/stable_sort.h> 1547#include <__algorithm/swap_ranges.h> 1548#include <__algorithm/transform.h> 1549#include <__algorithm/unique.h> 1550#include <__algorithm/unique_copy.h> 1551#include <__algorithm/unwrap_iter.h> 1552#include <__algorithm/upper_bound.h> 1553 1554#ifndef _LIBCPP_REMOVE_TRANSITIVE_INCLUDES 1555# include <chrono> 1556# include <iterator> 1557# include <utility> 1558#endif 1559 1560// standard-mandated includes 1561#include <initializer_list> 1562 1563#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 1564# pragma GCC system_header 1565#endif 1566 1567#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 1568# include <__pstl_algorithm> 1569#endif 1570 1571#endif // _LIBCPP_ALGORITHM 1572