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