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