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