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