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