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