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