1// -*- C++ -*- 2//===----------------------------------------------------------------------===// 3// 4// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5// See https://llvm.org/LICENSE.txt for license information. 6// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7// 8//===----------------------------------------------------------------------===// 9 10#ifndef _LIBCPP_ALGORITHM 11#define _LIBCPP_ALGORITHM 12 13/* 14 algorithm synopsis 15 16#include <initializer_list> 17 18namespace std 19{ 20 21namespace ranges { 22 23 // [algorithms.results], algorithm result types 24 template <class I, class F> 25 struct in_fun_result; // since C++20 26 27 template <class I1, class I2> 28 struct in_in_result; // since C++20 29 30 template <class I, class O> 31 struct in_out_result; // since C++20 32 33 template <class I1, class I2, class O> 34 struct in_in_out_result; // since C++20 35 36 template <class I, class O1, class O2> 37 struct in_out_out_result; // since C++20 38 39 template <class I1, class I2> 40 struct min_max_result; // since C++20 41 42 template <class I> 43 struct in_found_result; // since C++20 44 45 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 46 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20 47 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {}); 48 49 template<forward_range R, class Proj = identity, 50 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20 51 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {}); 52 53 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 54 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 55 constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 56 57 template<forward_range R, class Proj = identity, 58 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 59 constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 60 61 template<class I1, class I2> 62 using mismatch_result = in_in_result<I1, I2>; 63 64 template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2, 65 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 66 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 67 constexpr mismatch_result<_I1, _I2> 68 mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20 69 70 template <input_range R1, input_range R2, 71 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 72 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 73 constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 74 mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20 75 76 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 77 constexpr I find(I first, S last, const T& value, Proj proj = {}); // since C++20 78 79 template<input_range R, class T, class Proj = identity> 80 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 81 constexpr borrowed_iterator_t<R> 82 find(R&& r, const T& value, Proj proj = {}); // since C++20 83 84 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 85 indirect_unary_predicate<projected<I, Proj>> Pred> 86 constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 87 88 template<input_range R, class Proj = identity, 89 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 90 constexpr borrowed_iterator_t<R> 91 find_if(R&& r, Pred pred, Proj proj = {}); // since C++20 92 93 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 94 indirect_unary_predicate<projected<I, Proj>> Pred> 95 constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20 96 97 template<input_range R, class Proj = identity, 98 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 99 constexpr borrowed_iterator_t<R> 100 find_if_not(R&& r, Pred pred, Proj proj = {}); // since C++20 101 102 template<class T, class Proj = identity, 103 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 104 constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 105 106 template<copyable T, class Proj = identity, 107 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 108 constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 109 110 template<input_range R, class Proj = identity, 111 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 112 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 113 constexpr range_value_t<R> 114 min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 115 116 template<class T, class Proj = identity, 117 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 118 constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 119 120 template<copyable T, class Proj = identity, 121 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 122 constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 123 124 template<input_range R, class Proj = identity, 125 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 126 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 127 constexpr range_value_t<R> 128 max(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 129 130 template<class I, class O> 131 using unary_transform_result = in_out_result<I, O>; // since C++20 132 133 template<class I1, class I2, class O> 134 using binary_transform_result = in_in_out_result<I1, I2, O>; // since C++20 135 136 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, 137 copy_constructible F, class Proj = identity> 138 requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>> 139 constexpr ranges::unary_transform_result<I, O> 140 transform(I first1, S last1, O result, F op, Proj proj = {}); // since C++20 141 142 template<input_range R, weakly_incrementable O, copy_constructible F, 143 class Proj = identity> 144 requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>> 145 constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O> 146 transform(R&& r, O result, F op, Proj proj = {}); // since C++20 147 148 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 149 weakly_incrementable O, copy_constructible F, class Proj1 = identity, 150 class Proj2 = identity> 151 requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>, 152 projected<I2, Proj2>>> 153 constexpr ranges::binary_transform_result<I1, I2, O> 154 transform(I1 first1, S1 last1, I2 first2, S2 last2, O result, 155 F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 156 157 template<input_range R1, input_range R2, weakly_incrementable O, 158 copy_constructible F, class Proj1 = identity, class Proj2 = identity> 159 requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>, 160 projected<iterator_t<R2>, Proj2>>> 161 constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 162 transform(R1&& r1, R2&& r2, O result, 163 F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 164 165 template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity> 166 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 167 constexpr iter_difference_t<I> 168 count(I first, S last, const T& value, Proj proj = {}); // since C++20 169 170 template<input_range R, class T, class Proj = identity> 171 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 172 constexpr range_difference_t<R> 173 count(R&& r, const T& value, Proj proj = {}); // since C++20 174 175 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 176 indirect_unary_predicate<projected<I, Proj>> Pred> 177 constexpr iter_difference_t<I> 178 count_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 179 180 template<input_range R, class Proj = identity, 181 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 182 constexpr range_difference_t<R> 183 count_if(R&& r, Pred pred, Proj proj = {}); // since C++20 184 185 template<class T> 186 using minmax_result = min_max_result<T>; 187 188 template<class T, class Proj = identity, 189 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 190 constexpr ranges::minmax_result<const T&> 191 minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 192 193 template<copyable T, class Proj = identity, 194 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 195 constexpr ranges::minmax_result<T> 196 minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 197 198 template<input_range R, class Proj = identity, 199 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 200 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 201 constexpr ranges::minmax_result<range_value_t<R>> 202 minmax(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 203 204 template<class I> 205 using minmax_element_result = min_max_result<I>; 206 207 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 208 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 209 constexpr ranges::minmax_element_result<I> 210 minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 211 212 template<forward_range R, class Proj = identity, 213 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 214 constexpr ranges::minmax_element_result<borrowed_iterator_t<R>> 215 minmax_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 216 217 template<class I, class O> 218 using copy_result = in_out_result<I, O>; // since C++20 219 220 template<class I, class O> 221 using copy_n_result = in_out_result<I, O>; // since C++20 222 223 template<class I, class O> 224 using copy_if_result = in_out_result<I, O>; // since C++20 225 226 template<class I1, class I2> 227 using copy_backward_result = in_out_result<I1, I2>; // since C++20 228 229 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O> 230 requires indirectly_copyable<I, O> 231 constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result); // since C++20 232 233 template<input_range R, weakly_incrementable O> 234 requires indirectly_copyable<iterator_t<R>, O> 235 constexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20 236 237 template<input_iterator I, weakly_incrementable O> 238 requires indirectly_copyable<I, O> 239 constexpr ranges::copy_n_result<I, O> 240 ranges::copy_n(I first, iter_difference_t<I> n, O result); // since C++20 241 242 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity, 243 indirect_unary_predicate<projected<I, Proj>> Pred> 244 requires indirectly_copyable<I, O> 245 constexpr ranges::copy_if_result<I, O> 246 ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20 247 248 template<input_range R, weakly_incrementable O, class Proj = identity, 249 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 250 requires indirectly_copyable<iterator_t<R>, O> 251 constexpr ranges::copy_if_result<borrowed_iterator_t<R>, O> 252 ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20 253 254 template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2> 255 requires indirectly_copyable<I1, I2> 256 constexpr ranges::copy_backward_result<I1, I2> 257 ranges::copy_backward(I1 first, S1 last, I2 result); // since C++20 258 259 template<bidirectional_range R, bidirectional_iterator I> 260 requires indirectly_copyable<iterator_t<R>, I> 261 constexpr ranges::copy_backward_result<borrowed_iterator_t<R>, I> 262 ranges::copy_backward(R&& r, I result); // since C++20 263 264 template<class I, class F> 265 using for_each_result = in_fun_result<I, F>; // since C++20 266 267 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 268 indirectly_unary_invocable<projected<I, Proj>> Fun> 269 constexpr ranges::for_each_result<I, Fun> 270 ranges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20 271 272 template<input_range R, class Proj = identity, 273 indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun> 274 constexpr ranges::for_each_result<borrowed_iterator_t<R>, Fun> 275 ranges::for_each(R&& r, Fun f, Proj proj = {}); // since C++20 276 277 template<input_iterator I, class Proj = identity, 278 indirectly_unary_invocable<projected<I, Proj>> Fun> 279 constexpr ranges::for_each_n_result<I, Fun> 280 ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20 281 282 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 283 indirect_unary_predicate<projected<I, Proj>> Pred> 284 constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20 285 286 template<input_range R, class Proj = identity, 287 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 288 constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C++20 289 290 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 291 class Proj = identity> 292 requires sortable<I, Comp, Proj> 293 constexpr I 294 ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 295 296 template<random_access_range R, class Comp = ranges::less, class Proj = identity> 297 requires sortable<iterator_t<R>, Comp, Proj> 298 constexpr borrowed_iterator_t<R> 299 ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 300 301 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 302 class Proj = identity> 303 requires sortable<I, Comp, Proj> 304 constexpr I 305 ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 306 307 template<random_access_range R, class Comp = ranges::less, class Proj = identity> 308 requires sortable<iterator_t<R>, Comp, Proj> 309 constexpr borrowed_iterator_t<R> 310 ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 311 312 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 313 class Proj = identity> 314 requires sortable<I, Comp, Proj> 315 constexpr I 316 ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 317 318 template<random_access_range R, class Comp = ranges::less, class Proj = identity> 319 requires sortable<iterator_t<R>, Comp, Proj> 320 constexpr borrowed_iterator_t<R> 321 ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 322 323 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 324 class Proj = identity> 325 requires sortable<I, Comp, Proj> 326 constexpr I 327 ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 328 329 template<random_access_range R, class Comp = ranges::less, class Proj = identity> 330 requires sortable<iterator_t<R>, Comp, Proj> 331 constexpr borrowed_iterator_t<R> 332 ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 333 334 template<random_access_iterator I, sentinel_for<I> S, class Proj = identity, 335 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 336 constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // Since C++20 337 338 template<random_access_range R, class Proj = identity, 339 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 340 constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // Since C++20 341 342 template<random_access_iterator I, sentinel_for<I> S, class Proj = identity, 343 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 344 constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // Since C++20 345 346 template<random_access_range R, class Proj = identity, 347 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 348 constexpr borrowed_iterator_t<R> 349 is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // Since C++20 350 351 template<bidirectional_iterator I, sentinel_for<I> S> 352 requires permutable<I> 353 constexpr I ranges::reverse(I first, S last); // since C++20 354 355 template<bidirectional_range R> 356 requires permutable<iterator_t<R>> 357 constexpr borrowed_iterator_t<R> ranges::reverse(R&& r); // since C++20 358 359 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 360 class Proj = identity> 361 requires sortable<I, Comp, Proj> 362 constexpr I 363 ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 364 365 template<random_access_range R, class Comp = ranges::less, class Proj = identity> 366 requires sortable<iterator_t<R>, Comp, Proj> 367 constexpr borrowed_iterator_t<R> 368 ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 369 370 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 371 class Proj = identity> 372 requires sortable<I, Comp, Proj> 373 I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 374 375 template<random_access_range R, class Comp = ranges::less, class Proj = identity> 376 requires sortable<iterator_t<R>, Comp, Proj> 377 borrowed_iterator_t<R> 378 ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 379 380 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 381 class Proj = identity> 382 requires sortable<I, Comp, Proj> 383 constexpr I 384 ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20 385 386 template<random_access_range R, class Comp = ranges::less, class Proj = identity> 387 requires sortable<iterator_t<R>, Comp, Proj> 388 constexpr borrowed_iterator_t<R> 389 ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++20 390 391 template<class T, output_iterator<const T&> O, sentinel_for<O> S> 392 constexpr O ranges::fill(O first, S last, const T& value); // since C++20 393 394 template<class T, output_range<const T&> R> 395 constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value); // since C++20 396 397 template<class T, output_iterator<const T&> O> 398 constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value); // since C++20 399 400 template<input_or_output_iterator O, sentinel_for<O> S, copy_constructible F> 401 requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>> 402 constexpr O generate(O first, S last, F gen); // Since C++20 403 404 template<class R, copy_constructible F> 405 requires invocable<F&> && output_range<R, invoke_result_t<F&>> 406 constexpr borrowed_iterator_t<R> generate(R&& r, F gen); // Since C++20 407 408 template<input_or_output_iterator O, copy_constructible F> 409 requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>> 410 constexpr O generate_n(O first, iter_difference_t<O> n, F gen); // Since C++20 411 412 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 413 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 414 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 415 constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2, 416 Pred pred = {}, 417 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 418 419 template<input_range R1, input_range R2, class Pred = ranges::equal_to, 420 class Proj1 = identity, class Proj2 = identity> 421 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 422 constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {}, 423 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 424 425 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 426 indirect_unary_predicate<projected<I, Proj>> Pred> 427 constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C++20 428 429 template<input_range R, class Proj = identity, 430 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 431 constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C++20 432 433 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 434 indirect_unary_predicate<projected<I, Proj>> Pred> 435 constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C++20 436 437 template<input_range R, class Proj = identity, 438 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 439 constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {}); // since C++20 440 441 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 442 indirect_unary_predicate<projected<I, Proj>> Pred> 443 constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C++20 444 445 template<input_range R, class Proj = identity, 446 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 447 constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {}); // since C++20 448 449 template<input_iterator I1, sentinel_for<I1> S1, 450 random_access_iterator I2, sentinel_for<I2> S2, 451 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 452 requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> && 453 indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>> 454 constexpr partial_sort_copy_result<I1, I2> 455 partial_sort_copy(I1 first, S1 last, I2 result_first, S2 result_last, 456 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20 457 458 template<input_range R1, random_access_range R2, class Comp = ranges::less, 459 class Proj1 = identity, class Proj2 = identity> 460 requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> && 461 sortable<iterator_t<R2>, Comp, Proj2> && 462 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>, 463 projected<iterator_t<R2>, Proj2>> 464 constexpr partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 465 partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {}, 466 Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20 467 468 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 469 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 470 constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 471 472 template<forward_range R, class Proj = identity, 473 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 474 constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 475 476 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 477 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 478 constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 479 480 template<forward_range R, class Proj = identity, 481 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 482 constexpr borrowed_iterator_t<R> 483 ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 484 485 template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 486 class Proj = identity> 487 requires sortable<I, Comp, Proj> 488 constexpr I 489 ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++20 490 491 template<random_access_range R, class Comp = ranges::less, class Proj = identity> 492 requires sortable<iterator_t<R>, Comp, Proj> 493 constexpr borrowed_iterator_t<R> 494 ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++20 495 496 template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity, 497 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> 498 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 499 500 template<forward_range R, class T, class Proj = identity, 501 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp = 502 ranges::less> 503 constexpr borrowed_iterator_t<R> 504 upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 505 506 template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity, 507 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> 508 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {}, 509 Proj proj = {}); // since C++20 510 template<forward_range R, class T, class Proj = identity, 511 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp = 512 ranges::less> 513 constexpr borrowed_iterator_t<R> 514 lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 515 516 template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity, 517 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> 518 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {}, 519 Proj proj = {}); // since C++20 520 521 template<forward_range R, class T, class Proj = identity, 522 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp = 523 ranges::less> 524 constexpr bool binary_search(R&& r, const T& value, Comp comp = {}, 525 Proj proj = {}); // since C++20 526 527 template<permutable I, sentinel_for<I> S, class Proj = identity, 528 indirect_unary_predicate<projected<I, Proj>> Pred> 529 constexpr subrange<I> 530 partition(I first, S last, Pred pred, Proj proj = {}); // Since C++20 531 532 template<forward_range R, class Proj = identity, 533 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 534 requires permutable<iterator_t<R>> 535 constexpr borrowed_subrange_t<R> 536 partition(R&& r, Pred pred, Proj proj = {}); // Since C++20 537 538 template<bidirectional_iterator I, sentinel_for<I> S, class Proj = identity, 539 indirect_unary_predicate<projected<I, Proj>> Pred> 540 requires permutable<I> 541 subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // Since C++20 542 543 template<bidirectional_range R, class Proj = identity, 544 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 545 requires permutable<iterator_t<R>> 546 borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {}); // Since C++20 547 548 template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, 549 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 550 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 551 constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2, 552 Pred pred = {}, 553 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 554 555 template<input_range R1, forward_range R2, 556 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 557 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 558 constexpr borrowed_iterator_t<R1> 559 ranges::find_first_of(R1&& r1, R2&& r2, 560 Pred pred = {}, 561 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 562 563 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 564 indirect_binary_predicate<projected<I, Proj>, 565 projected<I, Proj>> Pred = ranges::equal_to> 566 constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C+20 567 568 template<forward_range R, class Proj = identity, 569 indirect_binary_predicate<projected<iterator_t<R>, Proj>, 570 projected<iterator_t<R>, Proj>> Pred = ranges::equal_to> 571 constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); // since C++20 572 573 template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity> 574 requires indirectly_writable<I, const T2&> && 575 indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*> 576 constexpr I 577 ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20 578 579 template<input_range R, class T1, class T2, class Proj = identity> 580 requires indirectly_writable<iterator_t<R>, const T2&> && 581 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*> 582 constexpr borrowed_iterator_t<R> 583 ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20 584 585 template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity, 586 indirect_unary_predicate<projected<I, Proj>> Pred> 587 requires indirectly_writable<I, const T&> 588 constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20 589 590 template<input_range R, class T, class Proj = identity, 591 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 592 requires indirectly_writable<iterator_t<R>, const T&> 593 constexpr borrowed_iterator_t<R> 594 ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // since C++20 595 596 template<class T, class Proj = identity, 597 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 598 constexpr const T& 599 ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // since C++20 600 601 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 602 class Proj1 = identity, class Proj2 = identity, 603 indirect_strict_weak_order<projected<I1, Proj1>, 604 projected<I2, Proj2>> Comp = ranges::less> 605 constexpr bool 606 ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2, 607 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 608 609 template<input_range R1, input_range R2, class Proj1 = identity, 610 class Proj2 = identity, 611 indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>, 612 projected<iterator_t<R2>, Proj2>> Comp = ranges::less> 613 constexpr bool 614 ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {}, 615 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 616 617 template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2> 618 requires indirectly_movable<I1, I2> 619 constexpr ranges::move_backward_result<I1, I2> 620 ranges::move_backward(I1 first, S1 last, I2 result); // since C++20 621 622 template<bidirectional_range R, bidirectional_iterator I> 623 requires indirectly_movable<iterator_t<R>, I> 624 constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I> 625 ranges::move_backward(R&& r, I result); // since C++20 626 627 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O> 628 requires indirectly_movable<I, O> 629 constexpr ranges::move_result<I, O> 630 ranges::move(I first, S last, O result); // since C++20 631 632 template<input_range R, weakly_incrementable O> 633 requires indirectly_movable<iterator_t<R>, O> 634 constexpr ranges::move_result<borrowed_iterator_t<R>, O> 635 ranges::move(R&& r, O result); // since C++20 636 637 template<class I, class O1, class O2> 638 using partition_copy_result = in_out_out_result<I, O1, O2>; // since C++20 639 640 template<input_iterator I, sentinel_for<I> S, 641 weakly_incrementable O1, weakly_incrementable O2, 642 class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> 643 requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2> 644 constexpr partition_copy_result<I, O1, O2> 645 partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred, 646 Proj proj = {}); // Since C++20 647 648 template<input_range R, weakly_incrementable O1, weakly_incrementable O2, 649 class Proj = identity, 650 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 651 requires indirectly_copyable<iterator_t<R>, O1> && 652 indirectly_copyable<iterator_t<R>, O2> 653 constexpr partition_copy_result<borrowed_iterator_t<R>, O1, O2> 654 partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // Since C++20 655 656 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 657 indirect_unary_predicate<projected<I, Proj>> Pred> 658 constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); // Since C++20 659 660 template<forward_range R, class Proj = identity, 661 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 662 constexpr borrowed_iterator_t<R> 663 partition_point(R&& r, Pred pred, Proj proj = {}); // Since C++20 664 665 template<class I1, class I2, class O> 666 using merge_result = in_in_out_result<I1, I2, O>; // since C++20 667 668 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 669 weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, 670 class Proj2 = identity> 671 requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 672 constexpr merge_result<I1, I2, O> 673 merge(I1 first1, S1 last1, I2 first2, S2 last2, O result, 674 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 675 676 template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less, 677 class Proj1 = identity, class Proj2 = identity> 678 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 679 constexpr merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 680 merge(R1&& r1, R2&& r2, O result, 681 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 682 683 template<permutable I, sentinel_for<I> S, class T, class Proj = identity> 684 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 685 constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {}); // since C++20 686 687 template<forward_range R, class T, class Proj = identity> 688 requires permutable<iterator_t<R>> && 689 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 690 constexpr borrowed_subrange_t<R> 691 ranges::remove(R&& r, const T& value, Proj proj = {}); // since C++20 692 693 template<permutable I, sentinel_for<I> S, class Proj = identity, 694 indirect_unary_predicate<projected<I, Proj>> Pred> 695 constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 696 697 template<forward_range R, class Proj = identity, 698 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 699 requires permutable<iterator_t<R>> 700 constexpr borrowed_subrange_t<R> 701 ranges::remove_if(R&& r, Pred pred, Proj proj = {}); // since C++20 702 703 template<class I, class O> 704 using set_difference_result = in_out_result<I, O>; // since C++20 705 706 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 707 weakly_incrementable O, class Comp = ranges::less, 708 class Proj1 = identity, class Proj2 = identity> 709 requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 710 constexpr set_difference_result<I1, O> 711 set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result, 712 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 713 714 template<input_range R1, input_range R2, weakly_incrementable O, 715 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 716 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 717 constexpr set_difference_result<borrowed_iterator_t<R1>, O> 718 set_difference(R1&& r1, R2&& r2, O result, 719 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 720 721 template<class I1, class I2, class O> 722 using set_intersection_result = in_in_out_result<I1, I2, O>; // since C++20 723 724 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 725 weakly_incrementable O, class Comp = ranges::less, 726 class Proj1 = identity, class Proj2 = identity> 727 requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 728 constexpr set_intersection_result<I1, I2, O> 729 set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result, 730 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 731 732 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 733 weakly_incrementable O, class Comp = ranges::less, 734 class Proj1 = identity, class Proj2 = identity> 735 requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 736 constexpr set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 737 set_intersection(R1&& r1, R2&& r2, O result, 738 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 739 740 template <class _InIter, class _OutIter> 741 using reverse_copy_result = in_out_result<_InIter, _OutIter>; // since C++20 742 743 template<bidirectional_iterator I, sentinel_for<I> S, weakly_incrementable O> 744 requires indirectly_copyable<I, O> 745 constexpr ranges::reverse_copy_result<I, O> 746 ranges::reverse_copy(I first, S last, O result); // since C++20 747 748 template<bidirectional_range R, weakly_incrementable O> 749 requires indirectly_copyable<iterator_t<R>, O> 750 constexpr ranges::reverse_copy_result<borrowed_iterator_t<R>, O> 751 ranges::reverse_copy(R&& r, O result); // since C++20 752 753 template<permutable I, sentinel_for<I> S> 754 constexpr subrange<I> rotate(I first, I middle, S last); // since C++20 755 756 template<forward_range R> 757 requires permutable<iterator_t<R>> 758 constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle); // Since C++20 759 760 template <class _InIter, class _OutIter> 761 using rotate_copy_result = in_out_result<_InIter, _OutIter>; // since C++20 762 763 template<forward_iterator I, sentinel_for<I> S, weakly_incrementable O> 764 requires indirectly_copyable<I, O> 765 constexpr ranges::rotate_copy_result<I, O> 766 ranges::rotate_copy(I first, I middle, S last, O result); // since C++20 767 768 template<forward_range R, weakly_incrementable O> 769 requires indirectly_copyable<iterator_t<R>, O> 770 constexpr ranges::rotate_copy_result<borrowed_iterator_t<R>, O> 771 ranges::rotate_copy(R&& r, iterator_t<R> middle, O result); // since C++20 772 773 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Gen> 774 requires (forward_iterator<I> || random_access_iterator<O>) && 775 indirectly_copyable<I, O> && 776 uniform_random_bit_generator<remove_reference_t<Gen>> 777 O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g); // Since C++20 778 779 template<input_range R, weakly_incrementable O, class Gen> 780 requires (forward_range<R> || random_access_iterator<O>) && 781 indirectly_copyable<iterator_t<R>, O> && 782 uniform_random_bit_generator<remove_reference_t<Gen>> 783 O sample(R&& r, O out, range_difference_t<R> n, Gen&& g); // Since C++20 784 785 template<random_access_iterator I, sentinel_for<I> S, class Gen> 786 requires permutable<I> && 787 uniform_random_bit_generator<remove_reference_t<Gen>> 788 I shuffle(I first, S last, Gen&& g); // Since C++20 789 790 template<random_access_range R, class Gen> 791 requires permutable<iterator_t<R>> && 792 uniform_random_bit_generator<remove_reference_t<Gen>> 793 borrowed_iterator_t<R> shuffle(R&& r, Gen&& g); // Since C++20 794 795 template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, 796 sentinel_for<I2> S2, class Pred = ranges::equal_to, 797 class Proj1 = identity, class Proj2 = identity> 798 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 799 constexpr subrange<I1> 800 ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, 801 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 802 803 template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, 804 class Proj1 = identity, class Proj2 = identity> 805 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 806 constexpr borrowed_subrange_t<R1> 807 ranges::search(R1&& r1, R2&& r2, Pred pred = {}, 808 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 809 810 template<forward_iterator I, sentinel_for<I> S, class T, 811 class Pred = ranges::equal_to, class Proj = identity> 812 requires indirectly_comparable<I, const T*, Pred, Proj> 813 constexpr subrange<I> 814 ranges::search_n(I first, S last, iter_difference_t<I> count, 815 const T& value, Pred pred = {}, Proj proj = {}); // since C++20 816 817 template<forward_range R, class T, class Pred = ranges::equal_to, 818 class Proj = identity> 819 requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj> 820 constexpr borrowed_subrange_t<R> 821 ranges::search_n(R&& r, range_difference_t<R> count, 822 const T& value, Pred pred = {}, Proj proj = {}); // since C++20 823 824 template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, 825 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 826 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 827 constexpr subrange<I1> 828 ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, 829 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 830 831 template<forward_range R1, forward_range R2, 832 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 833 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 834 constexpr borrowed_subrange_t<R1> 835 ranges::find_end(R1&& r1, R2&& r2, Pred pred = {}, 836 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 837 838 template<class I1, class I2, class O> 839 using set_symmetric_difference_result = in_in_out_result<I1, I2, O>; // since C++20 840 841 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 842 weakly_incrementable O, class Comp = ranges::less, 843 class Proj1 = identity, class Proj2 = identity> 844 requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 845 constexpr set_symmetric_difference_result<I1, I2, O> 846 set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result, 847 Comp comp = {}, Proj1 proj1 = {}, 848 Proj2 proj2 = {}); // since C++20 849 850 template<input_range R1, input_range R2, weakly_incrementable O, 851 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 852 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 853 constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>, 854 borrowed_iterator_t<R2>, O> 855 set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {}, 856 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 857 858 template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity, 859 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> 860 constexpr subrange<I> 861 equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 862 863 template<forward_range R, class T, class Proj = identity, 864 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp = 865 ranges::less> 866 constexpr borrowed_subrange_t<R> 867 equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 868 869 template<class I1, class I2, class O> 870 using set_union_result = in_in_out_result<I1, I2, O>; // since C++20 871 872 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 873 weakly_incrementable O, class Comp = ranges::less, 874 class Proj1 = identity, class Proj2 = identity> 875 requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 876 constexpr set_union_result<I1, I2, O> 877 set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {}, 878 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 879 880 template<input_range R1, input_range R2, weakly_incrementable O, 881 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 882 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 883 constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 884 set_union(R1&& r1, R2&& r2, O result, Comp comp = {}, 885 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 886 887 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 888 class Proj1 = identity, class Proj2 = identity, 889 indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp = 890 ranges::less> 891 constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {}, 892 Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20 893 894 template<input_range R1, input_range R2, class Proj1 = identity, 895 class Proj2 = identity, 896 indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>, 897 projected<iterator_t<R2>, Proj2>> Comp = ranges::less> 898 constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {}, 899 Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20 900 901 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less, 902 class Proj = identity> 903 requires sortable<I, Comp, Proj> 904 I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // Since C++20 905 906 template<bidirectional_range R, class Comp = ranges::less, class Proj = identity> 907 requires sortable<iterator_t<R>, Comp, Proj> 908 borrowed_iterator_t<R> 909 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {}, 910 Proj proj = {}); // Since C++20 911 912 template<permutable I, sentinel_for<I> S, class Proj = identity, 913 indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to> 914 constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // Since C++20 915 916 template<forward_range R, class Proj = identity, 917 indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to> 918 requires permutable<iterator_t<R>> 919 constexpr borrowed_subrange_t<R> 920 unique(R&& r, C comp = {}, Proj proj = {}); // Since C++20 921 922 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity, 923 indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to> 924 requires indirectly_copyable<I, O> && 925 (forward_iterator<I> || 926 (input_iterator<O> && same_as<iter_value_t<I>, iter_value_t<O>>) || 927 indirectly_copyable_storable<I, O>) 928 constexpr unique_copy_result<I, O> 929 unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); // Since C++20 930 931 template<input_range R, weakly_incrementable O, class Proj = identity, 932 indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to> 933 requires indirectly_copyable<iterator_t<R>, O> && 934 (forward_iterator<iterator_t<R>> || 935 (input_iterator<O> && same_as<range_value_t<R>, iter_value_t<O>>) || 936 indirectly_copyable_storable<iterator_t<R>, O>) 937 constexpr unique_copy_result<borrowed_iterator_t<R>, O> 938 unique_copy(R&& r, O result, C comp = {}, Proj proj = {}); // Since C++20 939<<<<<<< HEAD 940 941 template<class I, class O> 942 using remove_copy_result = in_out_result<I, O>; // Since C++20 943 944 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class T, 945 class Proj = identity> 946 indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 947 constexpr remove_copy_result<I, O> 948 remove_copy(I first, S last, O result, const T& value, Proj proj = {}); // Since C++20 949 950 template<input_range R, weakly_incrementable O, class T, class Proj = identity> 951 requires indirectly_copyable<iterator_t<R>, O> && 952 indirect_binary_predicate<ranges::equal_to, 953 projected<iterator_t<R>, Proj>, const T*> 954 constexpr remove_copy_result<borrowed_iterator_t<R>, O> 955 remove_copy(R&& r, O result, const T& value, Proj proj = {}); // Since C++20 956 957 template<class I, class O> 958 using remove_copy_if_result = in_out_result<I, O>; // Since C++20 959 960 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, 961 class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> 962 requires indirectly_copyable<I, O> 963 constexpr remove_copy_if_result<I, O> 964 remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // Since C++20 965 966 template<input_range R, weakly_incrementable O, class Proj = identity, 967 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 968 requires indirectly_copyable<iterator_t<R>, O> 969 constexpr remove_copy_if_result<borrowed_iterator_t<R>, O> 970 remove_copy_if(R&& r, O result, Pred pred, Proj proj = {}); // Since C++20 971 972 template<class I, class O> 973 using replace_copy_result = in_out_result<I, O>; // Since C++20 974 975 template<input_iterator I, sentinel_for<I> S, class T1, class T2, 976 output_iterator<const T2&> O, class Proj = identity> 977 requires indirectly_copyable<I, O> && 978 indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*> 979 constexpr replace_copy_result<I, O> 980 replace_copy(I first, S last, O result, const T1& old_value, const T2& new_value, 981 Proj proj = {}); // Since C++20 982 983 template<input_range R, class T1, class T2, output_iterator<const T2&> O, 984 class Proj = identity> 985 requires indirectly_copyable<iterator_t<R>, O> && 986 indirect_binary_predicate<ranges::equal_to, 987 projected<iterator_t<R>, Proj>, const T1*> 988 constexpr replace_copy_result<borrowed_iterator_t<R>, O> 989 replace_copy(R&& r, O result, const T1& old_value, const T2& new_value, 990 Proj proj = {}); // Since C++20 991 992 template<class I, class O> 993 using replace_copy_if_result = in_out_result<I, O>; // Since C++20 994 995 template<input_iterator I, sentinel_for<I> S, class T, output_iterator<const T&> O, 996 class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> 997 requires indirectly_copyable<I, O> 998 constexpr replace_copy_if_result<I, O> 999 replace_copy_if(I first, S last, O result, Pred pred, const T& new_value, 1000 Proj proj = {}); // Since C++20 1001 1002 template<input_range R, class T, output_iterator<const T&> O, class Proj = identity, 1003 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 1004 requires indirectly_copyable<iterator_t<R>, O> 1005 constexpr replace_copy_if_result<borrowed_iterator_t<R>, O> 1006 replace_copy_if(R&& r, O result, Pred pred, const T& new_value, 1007 Proj proj = {}); // Since C++20 1008 1009 template<class I> 1010 using prev_permutation_result = in_found_result<I>; // Since C++20 1011 1012 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less, 1013 class Proj = identity> 1014 requires sortable<I, Comp, Proj> 1015 constexpr ranges::prev_permutation_result<I> 1016 ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // Since C++20 1017 1018 template<bidirectional_range R, class Comp = ranges::less, 1019 class Proj = identity> 1020 requires sortable<iterator_t<R>, Comp, Proj> 1021 constexpr ranges::prev_permutation_result<borrowed_iterator_t<R>> 1022 ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // Since C++20 1023 1024 template<class I> 1025 using next_permutation_result = in_found_result<I>; // Since C++20 1026 1027 template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less, 1028 class Proj = identity> 1029 requires sortable<I, Comp, Proj> 1030 constexpr ranges::next_permutation_result<I> 1031 ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // Since C++20 1032 1033 template<bidirectional_range R, class Comp = ranges::less, 1034 class Proj = identity> 1035 requires sortable<iterator_t<R>, Comp, Proj> 1036 constexpr ranges::next_permutation_result<borrowed_iterator_t<R>> 1037 ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // Since C++20 1038 1039} 1040 1041template <class InputIterator, class Predicate> 1042 constexpr bool // constexpr in C++20 1043 all_of(InputIterator first, InputIterator last, Predicate pred); 1044 1045template <class InputIterator, class Predicate> 1046 constexpr bool // constexpr in C++20 1047 any_of(InputIterator first, InputIterator last, Predicate pred); 1048 1049template <class InputIterator, class Predicate> 1050 constexpr bool // constexpr in C++20 1051 none_of(InputIterator first, InputIterator last, Predicate pred); 1052 1053template <class InputIterator, class Function> 1054 constexpr Function // constexpr in C++20 1055 for_each(InputIterator first, InputIterator last, Function f); 1056 1057template<class InputIterator, class Size, class Function> 1058 constexpr InputIterator // constexpr in C++20 1059 for_each_n(InputIterator first, Size n, Function f); // C++17 1060 1061template <class InputIterator, class T> 1062 constexpr InputIterator // constexpr in C++20 1063 find(InputIterator first, InputIterator last, const T& value); 1064 1065template <class InputIterator, class Predicate> 1066 constexpr InputIterator // constexpr in C++20 1067 find_if(InputIterator first, InputIterator last, Predicate pred); 1068 1069template<class InputIterator, class Predicate> 1070 constexpr InputIterator // constexpr in C++20 1071 find_if_not(InputIterator first, InputIterator last, Predicate pred); 1072 1073template <class ForwardIterator1, class ForwardIterator2> 1074 constexpr ForwardIterator1 // constexpr in C++20 1075 find_end(ForwardIterator1 first1, ForwardIterator1 last1, 1076 ForwardIterator2 first2, ForwardIterator2 last2); 1077 1078template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1079 constexpr ForwardIterator1 // constexpr in C++20 1080 find_end(ForwardIterator1 first1, ForwardIterator1 last1, 1081 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1082 1083template <class ForwardIterator1, class ForwardIterator2> 1084 constexpr ForwardIterator1 // constexpr in C++20 1085 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 1086 ForwardIterator2 first2, ForwardIterator2 last2); 1087 1088template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1089 constexpr ForwardIterator1 // constexpr in C++20 1090 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 1091 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1092 1093template <class ForwardIterator> 1094 constexpr ForwardIterator // constexpr in C++20 1095 adjacent_find(ForwardIterator first, ForwardIterator last); 1096 1097template <class ForwardIterator, class BinaryPredicate> 1098 constexpr ForwardIterator // constexpr in C++20 1099 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 1100 1101template <class InputIterator, class T> 1102 constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 1103 count(InputIterator first, InputIterator last, const T& value); 1104 1105template <class InputIterator, class Predicate> 1106 constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 1107 count_if(InputIterator first, InputIterator last, Predicate pred); 1108 1109template <class InputIterator1, class InputIterator2> 1110 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1111 mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1112 1113template <class InputIterator1, class InputIterator2> 1114 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1115 mismatch(InputIterator1 first1, InputIterator1 last1, 1116 InputIterator2 first2, InputIterator2 last2); // **C++14** 1117 1118template <class InputIterator1, class InputIterator2, class BinaryPredicate> 1119 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1120 mismatch(InputIterator1 first1, InputIterator1 last1, 1121 InputIterator2 first2, BinaryPredicate pred); 1122 1123template <class InputIterator1, class InputIterator2, class BinaryPredicate> 1124 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1125 mismatch(InputIterator1 first1, InputIterator1 last1, 1126 InputIterator2 first2, InputIterator2 last2, 1127 BinaryPredicate pred); // **C++14** 1128 1129template <class InputIterator1, class InputIterator2> 1130 constexpr bool // constexpr in C++20 1131 equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1132 1133template <class InputIterator1, class InputIterator2> 1134 constexpr bool // constexpr in C++20 1135 equal(InputIterator1 first1, InputIterator1 last1, 1136 InputIterator2 first2, InputIterator2 last2); // **C++14** 1137 1138template <class InputIterator1, class InputIterator2, class BinaryPredicate> 1139 constexpr bool // constexpr in C++20 1140 equal(InputIterator1 first1, InputIterator1 last1, 1141 InputIterator2 first2, BinaryPredicate pred); 1142 1143template <class InputIterator1, class InputIterator2, class BinaryPredicate> 1144 constexpr bool // constexpr in C++20 1145 equal(InputIterator1 first1, InputIterator1 last1, 1146 InputIterator2 first2, InputIterator2 last2, 1147 BinaryPredicate pred); // **C++14** 1148 1149template<class ForwardIterator1, class ForwardIterator2> 1150 constexpr bool // constexpr in C++20 1151 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1152 ForwardIterator2 first2); 1153 1154template<class ForwardIterator1, class ForwardIterator2> 1155 constexpr bool // constexpr in C++20 1156 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1157 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1158 1159template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1160 constexpr bool // constexpr in C++20 1161 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1162 ForwardIterator2 first2, BinaryPredicate pred); 1163 1164template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1165 constexpr bool // constexpr in C++20 1166 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1167 ForwardIterator2 first2, ForwardIterator2 last2, 1168 BinaryPredicate pred); // **C++14** 1169 1170template <class ForwardIterator1, class ForwardIterator2> 1171 constexpr ForwardIterator1 // constexpr in C++20 1172 search(ForwardIterator1 first1, ForwardIterator1 last1, 1173 ForwardIterator2 first2, ForwardIterator2 last2); 1174 1175template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1176 constexpr ForwardIterator1 // constexpr in C++20 1177 search(ForwardIterator1 first1, ForwardIterator1 last1, 1178 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1179 1180template <class ForwardIterator, class Size, class T> 1181 constexpr ForwardIterator // constexpr in C++20 1182 search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1183 1184template <class ForwardIterator, class Size, class T, class BinaryPredicate> 1185 constexpr ForwardIterator // constexpr in C++20 1186 search_n(ForwardIterator first, ForwardIterator last, 1187 Size count, const T& value, BinaryPredicate pred); 1188 1189template <class InputIterator, class OutputIterator> 1190 constexpr OutputIterator // constexpr in C++20 1191 copy(InputIterator first, InputIterator last, OutputIterator result); 1192 1193template<class InputIterator, class OutputIterator, class Predicate> 1194 constexpr OutputIterator // constexpr in C++20 1195 copy_if(InputIterator first, InputIterator last, 1196 OutputIterator result, Predicate pred); 1197 1198template<class InputIterator, class Size, class OutputIterator> 1199 constexpr OutputIterator // constexpr in C++20 1200 copy_n(InputIterator first, Size n, OutputIterator result); 1201 1202template <class BidirectionalIterator1, class BidirectionalIterator2> 1203 constexpr BidirectionalIterator2 // constexpr in C++20 1204 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1205 BidirectionalIterator2 result); 1206 1207// [alg.move], move 1208template<class InputIterator, class OutputIterator> 1209 constexpr OutputIterator move(InputIterator first, InputIterator last, 1210 OutputIterator result); 1211 1212template<class BidirectionalIterator1, class BidirectionalIterator2> 1213 constexpr BidirectionalIterator2 1214 move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1215 BidirectionalIterator2 result); 1216 1217template <class ForwardIterator1, class ForwardIterator2> 1218 constexpr ForwardIterator2 // constexpr in C++20 1219 swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1220 1221namespace ranges { 1222 template<class I1, class I2> 1223 using swap_ranges_result = in_in_result<I1, I2>; 1224 1225template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> 1226 requires indirectly_swappable<I1, I2> 1227 constexpr ranges::swap_ranges_result<I1, I2> 1228 swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); 1229 1230template<input_range R1, input_range R2> 1231 requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> 1232 constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 1233 swap_ranges(R1&& r1, R2&& r2); 1234} 1235 1236template <class ForwardIterator1, class ForwardIterator2> 1237 constexpr void // constexpr in C++20 1238 iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1239 1240template <class InputIterator, class OutputIterator, class UnaryOperation> 1241 constexpr OutputIterator // constexpr in C++20 1242 transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1243 1244template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 1245 constexpr OutputIterator // constexpr in C++20 1246 transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 1247 OutputIterator result, BinaryOperation binary_op); 1248 1249template <class ForwardIterator, class T> 1250 constexpr void // constexpr in C++20 1251 replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 1252 1253template <class ForwardIterator, class Predicate, class T> 1254 constexpr void // constexpr in C++20 1255 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 1256 1257template <class InputIterator, class OutputIterator, class T> 1258 constexpr OutputIterator // constexpr in C++20 1259 replace_copy(InputIterator first, InputIterator last, OutputIterator result, 1260 const T& old_value, const T& new_value); 1261 1262template <class InputIterator, class OutputIterator, class Predicate, class T> 1263 constexpr OutputIterator // constexpr in C++20 1264 replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 1265 1266template <class ForwardIterator, class T> 1267 constexpr void // constexpr in C++20 1268 fill(ForwardIterator first, ForwardIterator last, const T& value); 1269 1270template <class OutputIterator, class Size, class T> 1271 constexpr OutputIterator // constexpr in C++20 1272 fill_n(OutputIterator first, Size n, const T& value); 1273 1274template <class ForwardIterator, class Generator> 1275 constexpr void // constexpr in C++20 1276 generate(ForwardIterator first, ForwardIterator last, Generator gen); 1277 1278template <class OutputIterator, class Size, class Generator> 1279 constexpr OutputIterator // constexpr in C++20 1280 generate_n(OutputIterator first, Size n, Generator gen); 1281 1282template <class ForwardIterator, class T> 1283 constexpr ForwardIterator // constexpr in C++20 1284 remove(ForwardIterator first, ForwardIterator last, const T& value); 1285 1286template <class ForwardIterator, class Predicate> 1287 constexpr ForwardIterator // constexpr in C++20 1288 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 1289 1290template <class InputIterator, class OutputIterator, class T> 1291 constexpr OutputIterator // constexpr in C++20 1292 remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 1293 1294template <class InputIterator, class OutputIterator, class Predicate> 1295 constexpr OutputIterator // constexpr in C++20 1296 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 1297 1298template <class ForwardIterator> 1299 constexpr ForwardIterator // constexpr in C++20 1300 unique(ForwardIterator first, ForwardIterator last); 1301 1302template <class ForwardIterator, class BinaryPredicate> 1303 constexpr ForwardIterator // constexpr in C++20 1304 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 1305 1306template <class InputIterator, class OutputIterator> 1307 constexpr OutputIterator // constexpr in C++20 1308 unique_copy(InputIterator first, InputIterator last, OutputIterator result); 1309 1310template <class InputIterator, class OutputIterator, class BinaryPredicate> 1311 constexpr OutputIterator // constexpr in C++20 1312 unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 1313 1314template <class BidirectionalIterator> 1315 constexpr void // constexpr in C++20 1316 reverse(BidirectionalIterator first, BidirectionalIterator last); 1317 1318template <class BidirectionalIterator, class OutputIterator> 1319 constexpr OutputIterator // constexpr in C++20 1320 reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 1321 1322template <class ForwardIterator> 1323 constexpr ForwardIterator // constexpr in C++20 1324 rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 1325 1326template <class ForwardIterator, class OutputIterator> 1327 constexpr OutputIterator // constexpr in C++20 1328 rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 1329 1330template <class RandomAccessIterator> 1331 void 1332 random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 1333 1334template <class RandomAccessIterator, class RandomNumberGenerator> 1335 void 1336 random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 1337 RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 1338 1339template<class PopulationIterator, class SampleIterator, 1340 class Distance, class UniformRandomBitGenerator> 1341 SampleIterator sample(PopulationIterator first, PopulationIterator last, 1342 SampleIterator out, Distance n, 1343 UniformRandomBitGenerator&& g); // C++17 1344 1345template<class RandomAccessIterator, class UniformRandomNumberGenerator> 1346 void shuffle(RandomAccessIterator first, RandomAccessIterator last, 1347 UniformRandomNumberGenerator&& g); 1348 1349template<class ForwardIterator> 1350 constexpr ForwardIterator 1351 shift_left(ForwardIterator first, ForwardIterator last, 1352 typename iterator_traits<ForwardIterator>::difference_type n); // C++20 1353 1354template<class ForwardIterator> 1355 constexpr ForwardIterator 1356 shift_right(ForwardIterator first, ForwardIterator last, 1357 typename iterator_traits<ForwardIterator>::difference_type n); // C++20 1358 1359template <class InputIterator, class Predicate> 1360 constexpr bool // constexpr in C++20 1361 is_partitioned(InputIterator first, InputIterator last, Predicate pred); 1362 1363template <class ForwardIterator, class Predicate> 1364 constexpr ForwardIterator // constexpr in C++20 1365 partition(ForwardIterator first, ForwardIterator last, Predicate pred); 1366 1367template <class InputIterator, class OutputIterator1, 1368 class OutputIterator2, class Predicate> 1369 constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 1370 partition_copy(InputIterator first, InputIterator last, 1371 OutputIterator1 out_true, OutputIterator2 out_false, 1372 Predicate pred); 1373 1374template <class ForwardIterator, class Predicate> 1375 ForwardIterator 1376 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 1377 1378template<class ForwardIterator, class Predicate> 1379 constexpr ForwardIterator // constexpr in C++20 1380 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 1381 1382template <class ForwardIterator> 1383 constexpr bool // constexpr in C++20 1384 is_sorted(ForwardIterator first, ForwardIterator last); 1385 1386template <class ForwardIterator, class Compare> 1387 constexpr bool // constexpr in C++20 1388 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 1389 1390template<class ForwardIterator> 1391 constexpr ForwardIterator // constexpr in C++20 1392 is_sorted_until(ForwardIterator first, ForwardIterator last); 1393 1394template <class ForwardIterator, class Compare> 1395 constexpr ForwardIterator // constexpr in C++20 1396 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 1397 1398template <class RandomAccessIterator> 1399 constexpr void // constexpr in C++20 1400 sort(RandomAccessIterator first, RandomAccessIterator last); 1401 1402template <class RandomAccessIterator, class Compare> 1403 constexpr void // constexpr in C++20 1404 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1405 1406template <class RandomAccessIterator> 1407 void 1408 stable_sort(RandomAccessIterator first, RandomAccessIterator last); 1409 1410template <class RandomAccessIterator, class Compare> 1411 void 1412 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1413 1414template <class RandomAccessIterator> 1415 constexpr void // constexpr in C++20 1416 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 1417 1418template <class RandomAccessIterator, class Compare> 1419 constexpr void // constexpr in C++20 1420 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 1421 1422template <class InputIterator, class RandomAccessIterator> 1423 constexpr RandomAccessIterator // constexpr in C++20 1424 partial_sort_copy(InputIterator first, InputIterator last, 1425 RandomAccessIterator result_first, RandomAccessIterator result_last); 1426 1427template <class InputIterator, class RandomAccessIterator, class Compare> 1428 constexpr RandomAccessIterator // constexpr in C++20 1429 partial_sort_copy(InputIterator first, InputIterator last, 1430 RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 1431 1432template <class RandomAccessIterator> 1433 constexpr void // constexpr in C++20 1434 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 1435 1436template <class RandomAccessIterator, class Compare> 1437 constexpr void // constexpr in C++20 1438 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 1439 1440template <class ForwardIterator, class T> 1441 constexpr ForwardIterator // constexpr in C++20 1442 lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 1443 1444template <class ForwardIterator, class T, class Compare> 1445 constexpr ForwardIterator // constexpr in C++20 1446 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 1447 1448template <class ForwardIterator, class T> 1449 constexpr ForwardIterator // constexpr in C++20 1450 upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 1451 1452template <class ForwardIterator, class T, class Compare> 1453 constexpr ForwardIterator // constexpr in C++20 1454 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 1455 1456template <class ForwardIterator, class T> 1457 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 1458 equal_range(ForwardIterator first, ForwardIterator last, const T& value); 1459 1460template <class ForwardIterator, class T, class Compare> 1461 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 1462 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 1463 1464template <class ForwardIterator, class T> 1465 constexpr bool // constexpr in C++20 1466 binary_search(ForwardIterator first, ForwardIterator last, const T& value); 1467 1468template <class ForwardIterator, class T, class Compare> 1469 constexpr bool // constexpr in C++20 1470 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 1471 1472template <class InputIterator1, class InputIterator2, class OutputIterator> 1473 constexpr OutputIterator // constexpr in C++20 1474 merge(InputIterator1 first1, InputIterator1 last1, 1475 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1476 1477template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1478 constexpr OutputIterator // constexpr in C++20 1479 merge(InputIterator1 first1, InputIterator1 last1, 1480 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1481 1482template <class BidirectionalIterator> 1483 void 1484 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 1485 1486template <class BidirectionalIterator, class Compare> 1487 void 1488 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 1489 1490template <class InputIterator1, class InputIterator2> 1491 constexpr bool // constexpr in C++20 1492 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 1493 1494template <class InputIterator1, class InputIterator2, class Compare> 1495 constexpr bool // constexpr in C++20 1496 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 1497 1498template <class InputIterator1, class InputIterator2, class OutputIterator> 1499 constexpr OutputIterator // constexpr in C++20 1500 set_union(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 set_union(InputIterator1 first1, InputIterator1 last1, 1506 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1507 1508template <class InputIterator1, class InputIterator2, class OutputIterator> 1509 constexpr OutputIterator // constexpr in C++20 1510 set_intersection(InputIterator1 first1, InputIterator1 last1, 1511 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1512 1513template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1514 constexpr OutputIterator // constexpr in C++20 1515 set_intersection(InputIterator1 first1, InputIterator1 last1, 1516 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1517 1518template <class InputIterator1, class InputIterator2, class OutputIterator> 1519 constexpr OutputIterator // constexpr in C++20 1520 set_difference(InputIterator1 first1, InputIterator1 last1, 1521 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1522 1523template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1524 constexpr OutputIterator // constexpr in C++20 1525 set_difference(InputIterator1 first1, InputIterator1 last1, 1526 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1527 1528template <class InputIterator1, class InputIterator2, class OutputIterator> 1529 constexpr OutputIterator // constexpr in C++20 1530 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 1531 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 1532 1533template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1534 constexpr OutputIterator // constexpr in C++20 1535 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 1536 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 1537 1538template <class RandomAccessIterator> 1539 constexpr void // constexpr in C++20 1540 push_heap(RandomAccessIterator first, RandomAccessIterator last); 1541 1542template <class RandomAccessIterator, class Compare> 1543 constexpr void // constexpr in C++20 1544 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1545 1546template <class RandomAccessIterator> 1547 constexpr void // constexpr in C++20 1548 pop_heap(RandomAccessIterator first, RandomAccessIterator last); 1549 1550template <class RandomAccessIterator, class Compare> 1551 constexpr void // constexpr in C++20 1552 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1553 1554template <class RandomAccessIterator> 1555 constexpr void // constexpr in C++20 1556 make_heap(RandomAccessIterator first, RandomAccessIterator last); 1557 1558template <class RandomAccessIterator, class Compare> 1559 constexpr void // constexpr in C++20 1560 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1561 1562template <class RandomAccessIterator> 1563 constexpr void // constexpr in C++20 1564 sort_heap(RandomAccessIterator first, RandomAccessIterator last); 1565 1566template <class RandomAccessIterator, class Compare> 1567 constexpr void // constexpr in C++20 1568 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 1569 1570template <class RandomAccessIterator> 1571 constexpr bool // constexpr in C++20 1572 is_heap(RandomAccessIterator first, RandomAccessiterator last); 1573 1574template <class RandomAccessIterator, class Compare> 1575 constexpr bool // constexpr in C++20 1576 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 1577 1578template <class RandomAccessIterator> 1579 constexpr RandomAccessIterator // constexpr in C++20 1580 is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 1581 1582template <class RandomAccessIterator, class Compare> 1583 constexpr RandomAccessIterator // constexpr in C++20 1584 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 1585 1586template <class ForwardIterator> 1587 constexpr ForwardIterator // constexpr in C++14 1588 min_element(ForwardIterator first, ForwardIterator last); 1589 1590template <class ForwardIterator, class Compare> 1591 constexpr ForwardIterator // constexpr in C++14 1592 min_element(ForwardIterator first, ForwardIterator last, Compare comp); 1593 1594template <class T> 1595 constexpr const T& // constexpr in C++14 1596 min(const T& a, const T& b); 1597 1598template <class T, class Compare> 1599 constexpr const T& // constexpr in C++14 1600 min(const T& a, const T& b, Compare comp); 1601 1602template<class T> 1603 constexpr T // constexpr in C++14 1604 min(initializer_list<T> t); 1605 1606template<class T, class Compare> 1607 constexpr T // constexpr in C++14 1608 min(initializer_list<T> t, Compare comp); 1609 1610template<class T> 1611 constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 1612 1613template<class T, class Compare> 1614 constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 1615 1616template <class ForwardIterator> 1617 constexpr ForwardIterator // constexpr in C++14 1618 max_element(ForwardIterator first, ForwardIterator last); 1619 1620template <class ForwardIterator, class Compare> 1621 constexpr ForwardIterator // constexpr in C++14 1622 max_element(ForwardIterator first, ForwardIterator last, Compare comp); 1623 1624template <class T> 1625 constexpr const T& // constexpr in C++14 1626 max(const T& a, const T& b); 1627 1628template <class T, class Compare> 1629 constexpr const T& // constexpr in C++14 1630 max(const T& a, const T& b, Compare comp); 1631 1632template<class T> 1633 constexpr T // constexpr in C++14 1634 max(initializer_list<T> t); 1635 1636template<class T, class Compare> 1637 constexpr T // constexpr in C++14 1638 max(initializer_list<T> t, Compare comp); 1639 1640template<class ForwardIterator> 1641 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 1642 minmax_element(ForwardIterator first, ForwardIterator last); 1643 1644template<class ForwardIterator, class Compare> 1645 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 1646 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 1647 1648template<class T> 1649 constexpr pair<const T&, const T&> // constexpr in C++14 1650 minmax(const T& a, const T& b); 1651 1652template<class T, class Compare> 1653 constexpr pair<const T&, const T&> // constexpr in C++14 1654 minmax(const T& a, const T& b, Compare comp); 1655 1656template<class T> 1657 constexpr pair<T, T> // constexpr in C++14 1658 minmax(initializer_list<T> t); 1659 1660template<class T, class Compare> 1661 constexpr pair<T, T> // constexpr in C++14 1662 minmax(initializer_list<T> t, Compare comp); 1663 1664template <class InputIterator1, class InputIterator2> 1665 constexpr bool // constexpr in C++20 1666 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 1667 1668template <class InputIterator1, class InputIterator2, class Compare> 1669 constexpr bool // constexpr in C++20 1670 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 1671 InputIterator2 first2, InputIterator2 last2, Compare comp); 1672 1673template <class BidirectionalIterator> 1674 constexpr bool // constexpr in C++20 1675 next_permutation(BidirectionalIterator first, BidirectionalIterator last); 1676 1677template <class BidirectionalIterator, class Compare> 1678 constexpr bool // constexpr in C++20 1679 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 1680 1681template <class BidirectionalIterator> 1682 constexpr bool // constexpr in C++20 1683 prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 1684 1685template <class BidirectionalIterator, class Compare> 1686 constexpr bool // constexpr in C++20 1687 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 1688} // std 1689 1690*/ 1691 1692#include <__assert> // all public C++ headers provide the assertion handler 1693#include <__bits> 1694#include <__config> 1695#include <__debug> 1696#include <cstddef> 1697#include <cstring> 1698#include <memory> 1699#include <type_traits> 1700#include <version> 1701 1702#include <__algorithm/adjacent_find.h> 1703#include <__algorithm/all_of.h> 1704#include <__algorithm/any_of.h> 1705#include <__algorithm/binary_search.h> 1706#include <__algorithm/clamp.h> 1707#include <__algorithm/comp.h> 1708#include <__algorithm/comp_ref_type.h> 1709#include <__algorithm/copy.h> 1710#include <__algorithm/copy_backward.h> 1711#include <__algorithm/copy_if.h> 1712#include <__algorithm/copy_n.h> 1713#include <__algorithm/count.h> 1714#include <__algorithm/count_if.h> 1715#include <__algorithm/equal.h> 1716#include <__algorithm/equal_range.h> 1717#include <__algorithm/fill.h> 1718#include <__algorithm/fill_n.h> 1719#include <__algorithm/find.h> 1720#include <__algorithm/find_end.h> 1721#include <__algorithm/find_first_of.h> 1722#include <__algorithm/find_if.h> 1723#include <__algorithm/find_if_not.h> 1724#include <__algorithm/for_each.h> 1725#include <__algorithm/for_each_n.h> 1726#include <__algorithm/generate.h> 1727#include <__algorithm/generate_n.h> 1728#include <__algorithm/half_positive.h> 1729#include <__algorithm/in_found_result.h> 1730#include <__algorithm/in_fun_result.h> 1731#include <__algorithm/in_in_out_result.h> 1732#include <__algorithm/in_in_result.h> 1733#include <__algorithm/in_out_out_result.h> 1734#include <__algorithm/in_out_result.h> 1735#include <__algorithm/includes.h> 1736#include <__algorithm/inplace_merge.h> 1737#include <__algorithm/is_heap.h> 1738#include <__algorithm/is_heap_until.h> 1739#include <__algorithm/is_partitioned.h> 1740#include <__algorithm/is_permutation.h> 1741#include <__algorithm/is_sorted.h> 1742#include <__algorithm/is_sorted_until.h> 1743#include <__algorithm/iter_swap.h> 1744#include <__algorithm/lexicographical_compare.h> 1745#include <__algorithm/lower_bound.h> 1746#include <__algorithm/make_heap.h> 1747#include <__algorithm/max.h> 1748#include <__algorithm/max_element.h> 1749#include <__algorithm/merge.h> 1750#include <__algorithm/min.h> 1751#include <__algorithm/min_element.h> 1752#include <__algorithm/min_max_result.h> 1753#include <__algorithm/minmax.h> 1754#include <__algorithm/minmax_element.h> 1755#include <__algorithm/mismatch.h> 1756#include <__algorithm/move.h> 1757#include <__algorithm/move_backward.h> 1758#include <__algorithm/next_permutation.h> 1759#include <__algorithm/none_of.h> 1760#include <__algorithm/nth_element.h> 1761#include <__algorithm/partial_sort.h> 1762#include <__algorithm/partial_sort_copy.h> 1763#include <__algorithm/partition.h> 1764#include <__algorithm/partition_copy.h> 1765#include <__algorithm/partition_point.h> 1766#include <__algorithm/pop_heap.h> 1767#include <__algorithm/prev_permutation.h> 1768#include <__algorithm/push_heap.h> 1769#include <__algorithm/ranges_adjacent_find.h> 1770#include <__algorithm/ranges_all_of.h> 1771#include <__algorithm/ranges_any_of.h> 1772#include <__algorithm/ranges_binary_search.h> 1773#include <__algorithm/ranges_clamp.h> 1774#include <__algorithm/ranges_copy.h> 1775#include <__algorithm/ranges_copy_backward.h> 1776#include <__algorithm/ranges_copy_if.h> 1777#include <__algorithm/ranges_copy_n.h> 1778#include <__algorithm/ranges_count.h> 1779#include <__algorithm/ranges_count_if.h> 1780#include <__algorithm/ranges_equal.h> 1781#include <__algorithm/ranges_equal_range.h> 1782#include <__algorithm/ranges_fill.h> 1783#include <__algorithm/ranges_fill_n.h> 1784#include <__algorithm/ranges_find.h> 1785#include <__algorithm/ranges_find_end.h> 1786#include <__algorithm/ranges_find_first_of.h> 1787#include <__algorithm/ranges_find_if.h> 1788#include <__algorithm/ranges_find_if_not.h> 1789#include <__algorithm/ranges_for_each.h> 1790#include <__algorithm/ranges_for_each_n.h> 1791#include <__algorithm/ranges_generate.h> 1792#include <__algorithm/ranges_generate_n.h> 1793#include <__algorithm/ranges_includes.h> 1794#include <__algorithm/ranges_inplace_merge.h> 1795#include <__algorithm/ranges_is_heap.h> 1796#include <__algorithm/ranges_is_heap_until.h> 1797#include <__algorithm/ranges_is_partitioned.h> 1798#include <__algorithm/ranges_is_sorted.h> 1799#include <__algorithm/ranges_is_sorted_until.h> 1800#include <__algorithm/ranges_lexicographical_compare.h> 1801#include <__algorithm/ranges_lower_bound.h> 1802#include <__algorithm/ranges_make_heap.h> 1803#include <__algorithm/ranges_max.h> 1804#include <__algorithm/ranges_max_element.h> 1805#include <__algorithm/ranges_merge.h> 1806#include <__algorithm/ranges_min.h> 1807#include <__algorithm/ranges_min_element.h> 1808#include <__algorithm/ranges_minmax.h> 1809#include <__algorithm/ranges_minmax_element.h> 1810#include <__algorithm/ranges_mismatch.h> 1811#include <__algorithm/ranges_move.h> 1812#include <__algorithm/ranges_move_backward.h> 1813#include <__algorithm/ranges_next_permutation.h> 1814#include <__algorithm/ranges_none_of.h> 1815#include <__algorithm/ranges_nth_element.h> 1816#include <__algorithm/ranges_partial_sort.h> 1817#include <__algorithm/ranges_partial_sort_copy.h> 1818#include <__algorithm/ranges_partition.h> 1819#include <__algorithm/ranges_partition_copy.h> 1820#include <__algorithm/ranges_partition_point.h> 1821#include <__algorithm/ranges_pop_heap.h> 1822#include <__algorithm/ranges_prev_permutation.h> 1823#include <__algorithm/ranges_push_heap.h> 1824#include <__algorithm/ranges_remove.h> 1825#include <__algorithm/ranges_remove_copy.h> 1826#include <__algorithm/ranges_remove_copy_if.h> 1827#include <__algorithm/ranges_remove_if.h> 1828#include <__algorithm/ranges_replace.h> 1829#include <__algorithm/ranges_replace_copy.h> 1830#include <__algorithm/ranges_replace_copy_if.h> 1831#include <__algorithm/ranges_replace_if.h> 1832#include <__algorithm/ranges_reverse.h> 1833#include <__algorithm/ranges_reverse_copy.h> 1834#include <__algorithm/ranges_rotate.h> 1835#include <__algorithm/ranges_rotate_copy.h> 1836#include <__algorithm/ranges_sample.h> 1837#include <__algorithm/ranges_search.h> 1838#include <__algorithm/ranges_search_n.h> 1839#include <__algorithm/ranges_set_difference.h> 1840#include <__algorithm/ranges_set_intersection.h> 1841#include <__algorithm/ranges_set_symmetric_difference.h> 1842#include <__algorithm/ranges_set_union.h> 1843#include <__algorithm/ranges_shuffle.h> 1844#include <__algorithm/ranges_sort.h> 1845#include <__algorithm/ranges_sort_heap.h> 1846#include <__algorithm/ranges_stable_partition.h> 1847#include <__algorithm/ranges_stable_sort.h> 1848#include <__algorithm/ranges_swap_ranges.h> 1849#include <__algorithm/ranges_transform.h> 1850#include <__algorithm/ranges_unique.h> 1851#include <__algorithm/ranges_unique_copy.h> 1852#include <__algorithm/ranges_upper_bound.h> 1853#include <__algorithm/remove.h> 1854#include <__algorithm/remove_copy.h> 1855#include <__algorithm/remove_copy_if.h> 1856#include <__algorithm/remove_if.h> 1857#include <__algorithm/replace.h> 1858#include <__algorithm/replace_copy.h> 1859#include <__algorithm/replace_copy_if.h> 1860#include <__algorithm/replace_if.h> 1861#include <__algorithm/reverse.h> 1862#include <__algorithm/reverse_copy.h> 1863#include <__algorithm/rotate.h> 1864#include <__algorithm/rotate_copy.h> 1865#include <__algorithm/sample.h> 1866#include <__algorithm/search.h> 1867#include <__algorithm/search_n.h> 1868#include <__algorithm/set_difference.h> 1869#include <__algorithm/set_intersection.h> 1870#include <__algorithm/set_symmetric_difference.h> 1871#include <__algorithm/set_union.h> 1872#include <__algorithm/shift_left.h> 1873#include <__algorithm/shift_right.h> 1874#include <__algorithm/shuffle.h> 1875#include <__algorithm/sift_down.h> 1876#include <__algorithm/sort.h> 1877#include <__algorithm/sort_heap.h> 1878#include <__algorithm/stable_partition.h> 1879#include <__algorithm/stable_sort.h> 1880#include <__algorithm/swap_ranges.h> 1881#include <__algorithm/transform.h> 1882#include <__algorithm/unique.h> 1883#include <__algorithm/unique_copy.h> 1884#include <__algorithm/unwrap_iter.h> 1885#include <__algorithm/upper_bound.h> 1886 1887#ifndef _LIBCPP_REMOVE_TRANSITIVE_INCLUDES 1888# include <chrono> 1889# include <iterator> 1890# include <utility> 1891#endif 1892 1893// standard-mandated includes 1894#include <initializer_list> 1895 1896#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 1897# pragma GCC system_header 1898#endif 1899 1900#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 1901# include <__pstl_algorithm> 1902#endif 1903 1904#endif // _LIBCPP_ALGORITHM 1905