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 template <class I, class F> 23 struct in_fun_result; // since C++20 24 25 template <class I1, class I2> 26 struct in_in_result; // since C++20 27 28 template <class I1, class I2, class O> 29 struct in_in_out_result; // since C++20 30 31 template <class I, class O1, class O2> 32 struct in_out_out_result; // since C++20 33 34 template <class I1, class I2> 35 struct min_max_result; // since C++20 36 37 template <class I> 38 struct in_found_result; // since C++20 39 40 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 41 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20 42 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {}); 43 44 template<forward_range R, class Proj = identity, 45 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20 46 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {}); 47 48 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 49 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 50 constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 51 52 template<forward_range R, class Proj = identity, 53 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 54 constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 55 56 57 template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2, 58 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 59 requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 60 constexpr mismatch_result<_I1, _I2> 61 mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20 62 63 template <input_range R1, input_range R2, 64 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 65 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 66 constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 67 mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20 68 69 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 70 constexpr I find(I first, S last, const T& value, Proj proj = {}); // since C++20 71 72 template<input_range R, class T, class Proj = identity> 73 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 74 constexpr borrowed_iterator_t<R> 75 find(R&& r, const T& value, Proj proj = {}); // since C++20 76 77 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 78 indirect_unary_predicate<projected<I, Proj>> Pred> 79 constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 80 81 template<input_range R, class Proj = identity, 82 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 83 constexpr borrowed_iterator_t<R> 84 find_if(R&& r, Pred pred, Proj proj = {}); // since C++20 85 86 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 87 indirect_unary_predicate<projected<I, Proj>> Pred> 88 constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20 89 90 template<input_range R, class Proj = identity, 91 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 92 constexpr borrowed_iterator_t<R> 93 find_if_not(R&& r, Pred pred, Proj proj = {}); // since C++20 94 95 template<class T, class Proj = identity, 96 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 97 constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 98 99 template<copyable T, class Proj = identity, 100 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 101 constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 102 103 template<input_range R, class Proj = identity, 104 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 105 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 106 constexpr range_value_t<R> 107 min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 108 109 template<class T, class Proj = identity, 110 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 111 constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 112 113 template<copyable T, class Proj = identity, 114 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 115 constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 116 117 template<input_range R, class Proj = identity, 118 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 119 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 120 constexpr range_value_t<R> 121 max(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 122 123 template<class I, class O> 124 using unary_transform_result = in_out_result<I, O>; // since C++20 125 126 template<class I1, class I2, class O> 127 using binary_transform_result = in_in_out_result<I1, I2, O>; // since C++20 128 129 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, 130 copy_constructible F, class Proj = identity> 131 requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>> 132 constexpr ranges::unary_transform_result<I, O> 133 transform(I first1, S last1, O result, F op, Proj proj = {}); // since C++20 134 135 template<input_range R, weakly_incrementable O, copy_constructible F, 136 class Proj = identity> 137 requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>> 138 constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O> 139 transform(R&& r, O result, F op, Proj proj = {}); // since C++20 140 141 template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 142 weakly_incrementable O, copy_constructible F, class Proj1 = identity, 143 class Proj2 = identity> 144 requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>, 145 projected<I2, Proj2>>> 146 constexpr ranges::binary_transform_result<I1, I2, O> 147 transform(I1 first1, S1 last1, I2 first2, S2 last2, O result, 148 F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 149 150 template<input_range R1, input_range R2, weakly_incrementable O, 151 copy_constructible F, class Proj1 = identity, class Proj2 = identity> 152 requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>, 153 projected<iterator_t<R2>, Proj2>>> 154 constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 155 transform(R1&& r1, R2&& r2, O result, 156 F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 157 158 template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity> 159 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 160 constexpr iter_difference_t<I> 161 count(I first, S last, const T& value, Proj proj = {}); // since C++20 162 163 template<input_range R, class T, class Proj = identity> 164 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 165 constexpr range_difference_t<R> 166 count(R&& r, const T& value, Proj proj = {}); // since C++20 167 168 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 169 indirect_unary_predicate<projected<I, Proj>> Pred> 170 constexpr iter_difference_t<I> 171 count_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 172 173 template<input_range R, class Proj = identity, 174 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 175 constexpr range_difference_t<R> 176 count_if(R&& r, Pred pred, Proj proj = {}); // since C++20 177 178 template<class T, class Proj = identity, 179 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 180 constexpr ranges::minmax_result<const T&> 181 minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 182 183 template<copyable T, class Proj = identity, 184 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 185 constexpr ranges::minmax_result<T> 186 minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 187 188 template<input_range R, class Proj = identity, 189 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 190 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 191 constexpr ranges::minmax_result<range_value_t<R>> 192 minmax(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 193 194 template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 195 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 196 constexpr ranges::minmax_element_result<I> 197 minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 198 199 template<forward_range R, class Proj = identity, 200 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 201 constexpr ranges::minmax_element_result<borrowed_iterator_t<R>> 202 minmax_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 203 204 template<class I, class O> 205 using copy_result = in_out_result<I, O>; // since C++20 206 207 template<class I, class O> 208 using copy_n_result = in_out_result<I, O>; // since C++20 209 210 template<class I, class O> 211 using copy_if_result = in_out_result<I, O>; // since C++20 212 213 template<class I1, class I2> 214 using copy_backward_result = in_out_result<I1, I2>; // since C++20 215 216 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O> 217 requires indirectly_copyable<I, O> 218 constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result); // since C++20 219 220 template<input_range R, weakly_incrementable O> 221 requires indirectly_copyable<iterator_t<R>, O> 222 constexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20 223 224 template<input_iterator I, weakly_incrementable O> 225 requires indirectly_copyable<I, O> 226 constexpr ranges::copy_n_result<I, O> 227 ranges::copy_n(I first, iter_difference_t<I> n, O result); // since C++20 228 229 template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity, 230 indirect_unary_predicate<projected<I, Proj>> Pred> 231 requires indirectly_copyable<I, O> 232 constexpr ranges::copy_if_result<I, O> 233 ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20 234 235 template<input_range R, weakly_incrementable O, class Proj = identity, 236 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 237 requires indirectly_copyable<iterator_t<R>, O> 238 constexpr ranges::copy_if_result<borrowed_iterator_t<R>, O> 239 ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20 240 241 template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2> 242 requires indirectly_copyable<I1, I2> 243 constexpr ranges::copy_backward_result<I1, I2> 244 ranges::copy_backward(I1 first, S1 last, I2 result); // since C++20 245 246 template<bidirectional_range R, bidirectional_iterator I> 247 requires indirectly_copyable<iterator_t<R>, I> 248 constexpr ranges::copy_backward_result<borrowed_iterator_t<R>, I> 249 ranges::copy_backward(R&& r, I result); // since C++20 250 251 template<class I, class F> 252 using for_each_result = in_fun_result<I, F>; // since C++20 253 254 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 255 indirectly_unary_invocable<projected<I, Proj>> Fun> 256 constexpr ranges::for_each_result<I, Fun> 257 ranges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20 258 259 template<input_range R, class Proj = identity, 260 indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun> 261 constexpr ranges::for_each_result<borrowed_iterator_t<R>, Fun> 262 ranges::for_each(R&& r, Fun f, Proj proj = {}); // since C++20 263 264 template<input_iterator I, class Proj = identity, 265 indirectly_unary_invocable<projected<I, Proj>> Fun> 266 constexpr ranges::for_each_n_result<I, Fun> 267 ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20 268 269 template<input_iterator I, sentinel_for<I> S, class Proj = identity, 270 indirect_unary_predicate<projected<I, Proj>> Pred> 271 constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20 272 273 template<input_range R, class Proj = identity, 274 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 275 constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C++20 276 277} 278 279 constexpr bool // constexpr in C++20 280 all_of(InputIterator first, InputIterator last, Predicate pred); 281 282template <class InputIterator, class Predicate> 283 constexpr bool // constexpr in C++20 284 any_of(InputIterator first, InputIterator last, Predicate pred); 285 286template <class InputIterator, class Predicate> 287 constexpr bool // constexpr in C++20 288 none_of(InputIterator first, InputIterator last, Predicate pred); 289 290template <class InputIterator, class Function> 291 constexpr Function // constexpr in C++20 292 for_each(InputIterator first, InputIterator last, Function f); 293 294template<class InputIterator, class Size, class Function> 295 constexpr InputIterator // constexpr in C++20 296 for_each_n(InputIterator first, Size n, Function f); // C++17 297 298template <class InputIterator, class T> 299 constexpr InputIterator // constexpr in C++20 300 find(InputIterator first, InputIterator last, const T& value); 301 302template <class InputIterator, class Predicate> 303 constexpr InputIterator // constexpr in C++20 304 find_if(InputIterator first, InputIterator last, Predicate pred); 305 306template<class InputIterator, class Predicate> 307 constexpr InputIterator // constexpr in C++20 308 find_if_not(InputIterator first, InputIterator last, Predicate pred); 309 310template <class ForwardIterator1, class ForwardIterator2> 311 constexpr ForwardIterator1 // constexpr in C++20 312 find_end(ForwardIterator1 first1, ForwardIterator1 last1, 313 ForwardIterator2 first2, ForwardIterator2 last2); 314 315template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 316 constexpr ForwardIterator1 // constexpr in C++20 317 find_end(ForwardIterator1 first1, ForwardIterator1 last1, 318 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 319 320template <class ForwardIterator1, class ForwardIterator2> 321 constexpr ForwardIterator1 // constexpr in C++20 322 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 323 ForwardIterator2 first2, ForwardIterator2 last2); 324 325template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 326 constexpr ForwardIterator1 // constexpr in C++20 327 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 328 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 329 330template <class ForwardIterator> 331 constexpr ForwardIterator // constexpr in C++20 332 adjacent_find(ForwardIterator first, ForwardIterator last); 333 334template <class ForwardIterator, class BinaryPredicate> 335 constexpr ForwardIterator // constexpr in C++20 336 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 337 338template <class InputIterator, class T> 339 constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 340 count(InputIterator first, InputIterator last, const T& value); 341 342template <class InputIterator, class Predicate> 343 constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 344 count_if(InputIterator first, InputIterator last, Predicate pred); 345 346template <class InputIterator1, class InputIterator2> 347 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 348 mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 349 350template <class InputIterator1, class InputIterator2> 351 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 352 mismatch(InputIterator1 first1, InputIterator1 last1, 353 InputIterator2 first2, InputIterator2 last2); // **C++14** 354 355template <class InputIterator1, class InputIterator2, class BinaryPredicate> 356 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 357 mismatch(InputIterator1 first1, InputIterator1 last1, 358 InputIterator2 first2, BinaryPredicate pred); 359 360template <class InputIterator1, class InputIterator2, class BinaryPredicate> 361 constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 362 mismatch(InputIterator1 first1, InputIterator1 last1, 363 InputIterator2 first2, InputIterator2 last2, 364 BinaryPredicate pred); // **C++14** 365 366template <class InputIterator1, class InputIterator2> 367 constexpr bool // constexpr in C++20 368 equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 369 370template <class InputIterator1, class InputIterator2> 371 constexpr bool // constexpr in C++20 372 equal(InputIterator1 first1, InputIterator1 last1, 373 InputIterator2 first2, InputIterator2 last2); // **C++14** 374 375template <class InputIterator1, class InputIterator2, class BinaryPredicate> 376 constexpr bool // constexpr in C++20 377 equal(InputIterator1 first1, InputIterator1 last1, 378 InputIterator2 first2, BinaryPredicate pred); 379 380template <class InputIterator1, class InputIterator2, class BinaryPredicate> 381 constexpr bool // constexpr in C++20 382 equal(InputIterator1 first1, InputIterator1 last1, 383 InputIterator2 first2, InputIterator2 last2, 384 BinaryPredicate pred); // **C++14** 385 386template<class ForwardIterator1, class ForwardIterator2> 387 constexpr bool // constexpr in C++20 388 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 389 ForwardIterator2 first2); 390 391template<class ForwardIterator1, class ForwardIterator2> 392 constexpr bool // constexpr in C++20 393 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 394 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 395 396template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 397 constexpr bool // constexpr in C++20 398 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 399 ForwardIterator2 first2, BinaryPredicate pred); 400 401template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 402 constexpr bool // constexpr in C++20 403 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 404 ForwardIterator2 first2, ForwardIterator2 last2, 405 BinaryPredicate pred); // **C++14** 406 407template <class ForwardIterator1, class ForwardIterator2> 408 constexpr ForwardIterator1 // constexpr in C++20 409 search(ForwardIterator1 first1, ForwardIterator1 last1, 410 ForwardIterator2 first2, ForwardIterator2 last2); 411 412template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 413 constexpr ForwardIterator1 // constexpr in C++20 414 search(ForwardIterator1 first1, ForwardIterator1 last1, 415 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 416 417template <class ForwardIterator, class Size, class T> 418 constexpr ForwardIterator // constexpr in C++20 419 search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 420 421template <class ForwardIterator, class Size, class T, class BinaryPredicate> 422 constexpr ForwardIterator // constexpr in C++20 423 search_n(ForwardIterator first, ForwardIterator last, 424 Size count, const T& value, BinaryPredicate pred); 425 426template <class InputIterator, class OutputIterator> 427 constexpr OutputIterator // constexpr in C++20 428 copy(InputIterator first, InputIterator last, OutputIterator result); 429 430template<class InputIterator, class OutputIterator, class Predicate> 431 constexpr OutputIterator // constexpr in C++20 432 copy_if(InputIterator first, InputIterator last, 433 OutputIterator result, Predicate pred); 434 435template<class InputIterator, class Size, class OutputIterator> 436 constexpr OutputIterator // constexpr in C++20 437 copy_n(InputIterator first, Size n, OutputIterator result); 438 439template <class BidirectionalIterator1, class BidirectionalIterator2> 440 constexpr BidirectionalIterator2 // constexpr in C++20 441 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 442 BidirectionalIterator2 result); 443 444template <class ForwardIterator1, class ForwardIterator2> 445 constexpr ForwardIterator2 // constexpr in C++20 446 swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 447 448template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> 449 requires indirectly_swappable<I1, I2> 450 constexpr ranges::swap_ranges_result<I1, I2> 451 ranges::swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); 452 453template<input_range R1, input_range R2> 454 requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> 455 constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 456 ranges::swap_ranges(R1&& r1, R2&& r2); 457 458template <class ForwardIterator1, class ForwardIterator2> 459 constexpr void // constexpr in C++20 460 iter_swap(ForwardIterator1 a, ForwardIterator2 b); 461 462template <class InputIterator, class OutputIterator, class UnaryOperation> 463 constexpr OutputIterator // constexpr in C++20 464 transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 465 466template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 467 constexpr OutputIterator // constexpr in C++20 468 transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 469 OutputIterator result, BinaryOperation binary_op); 470 471template <class ForwardIterator, class T> 472 constexpr void // constexpr in C++20 473 replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 474 475template <class ForwardIterator, class Predicate, class T> 476 constexpr void // constexpr in C++20 477 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 478 479template <class InputIterator, class OutputIterator, class T> 480 constexpr OutputIterator // constexpr in C++20 481 replace_copy(InputIterator first, InputIterator last, OutputIterator result, 482 const T& old_value, const T& new_value); 483 484template <class InputIterator, class OutputIterator, class Predicate, class T> 485 constexpr OutputIterator // constexpr in C++20 486 replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 487 488template <class ForwardIterator, class T> 489 constexpr void // constexpr in C++20 490 fill(ForwardIterator first, ForwardIterator last, const T& value); 491 492template <class OutputIterator, class Size, class T> 493 constexpr OutputIterator // constexpr in C++20 494 fill_n(OutputIterator first, Size n, const T& value); 495 496template <class ForwardIterator, class Generator> 497 constexpr void // constexpr in C++20 498 generate(ForwardIterator first, ForwardIterator last, Generator gen); 499 500template <class OutputIterator, class Size, class Generator> 501 constexpr OutputIterator // constexpr in C++20 502 generate_n(OutputIterator first, Size n, Generator gen); 503 504template <class ForwardIterator, class T> 505 constexpr ForwardIterator // constexpr in C++20 506 remove(ForwardIterator first, ForwardIterator last, const T& value); 507 508template <class ForwardIterator, class Predicate> 509 constexpr ForwardIterator // constexpr in C++20 510 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 511 512template <class InputIterator, class OutputIterator, class T> 513 constexpr OutputIterator // constexpr in C++20 514 remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 515 516template <class InputIterator, class OutputIterator, class Predicate> 517 constexpr OutputIterator // constexpr in C++20 518 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 519 520template <class ForwardIterator> 521 constexpr ForwardIterator // constexpr in C++20 522 unique(ForwardIterator first, ForwardIterator last); 523 524template <class ForwardIterator, class BinaryPredicate> 525 constexpr ForwardIterator // constexpr in C++20 526 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 527 528template <class InputIterator, class OutputIterator> 529 constexpr OutputIterator // constexpr in C++20 530 unique_copy(InputIterator first, InputIterator last, OutputIterator result); 531 532template <class InputIterator, class OutputIterator, class BinaryPredicate> 533 constexpr OutputIterator // constexpr in C++20 534 unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 535 536template <class BidirectionalIterator> 537 constexpr void // constexpr in C++20 538 reverse(BidirectionalIterator first, BidirectionalIterator last); 539 540template <class BidirectionalIterator, class OutputIterator> 541 constexpr OutputIterator // constexpr in C++20 542 reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 543 544template <class ForwardIterator> 545 constexpr ForwardIterator // constexpr in C++20 546 rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 547 548template <class ForwardIterator, class OutputIterator> 549 constexpr OutputIterator // constexpr in C++20 550 rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 551 552template <class RandomAccessIterator> 553 void 554 random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 555 556template <class RandomAccessIterator, class RandomNumberGenerator> 557 void 558 random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 559 RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 560 561template<class PopulationIterator, class SampleIterator, 562 class Distance, class UniformRandomBitGenerator> 563 SampleIterator sample(PopulationIterator first, PopulationIterator last, 564 SampleIterator out, Distance n, 565 UniformRandomBitGenerator&& g); // C++17 566 567template<class RandomAccessIterator, class UniformRandomNumberGenerator> 568 void shuffle(RandomAccessIterator first, RandomAccessIterator last, 569 UniformRandomNumberGenerator&& g); 570 571template<class ForwardIterator> 572 constexpr ForwardIterator 573 shift_left(ForwardIterator first, ForwardIterator last, 574 typename iterator_traits<ForwardIterator>::difference_type n); // C++20 575 576template<class ForwardIterator> 577 constexpr ForwardIterator 578 shift_right(ForwardIterator first, ForwardIterator last, 579 typename iterator_traits<ForwardIterator>::difference_type n); // C++20 580 581template <class InputIterator, class Predicate> 582 constexpr bool // constexpr in C++20 583 is_partitioned(InputIterator first, InputIterator last, Predicate pred); 584 585template <class ForwardIterator, class Predicate> 586 constexpr ForwardIterator // constexpr in C++20 587 partition(ForwardIterator first, ForwardIterator last, Predicate pred); 588 589template <class InputIterator, class OutputIterator1, 590 class OutputIterator2, class Predicate> 591 constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 592 partition_copy(InputIterator first, InputIterator last, 593 OutputIterator1 out_true, OutputIterator2 out_false, 594 Predicate pred); 595 596template <class ForwardIterator, class Predicate> 597 ForwardIterator 598 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 599 600template<class ForwardIterator, class Predicate> 601 constexpr ForwardIterator // constexpr in C++20 602 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 603 604template <class ForwardIterator> 605 constexpr bool // constexpr in C++20 606 is_sorted(ForwardIterator first, ForwardIterator last); 607 608template <class ForwardIterator, class Compare> 609 constexpr bool // constexpr in C++20 610 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 611 612template<class ForwardIterator> 613 constexpr ForwardIterator // constexpr in C++20 614 is_sorted_until(ForwardIterator first, ForwardIterator last); 615 616template <class ForwardIterator, class Compare> 617 constexpr ForwardIterator // constexpr in C++20 618 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 619 620template <class RandomAccessIterator> 621 constexpr void // constexpr in C++20 622 sort(RandomAccessIterator first, RandomAccessIterator last); 623 624template <class RandomAccessIterator, class Compare> 625 constexpr void // constexpr in C++20 626 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 627 628template <class RandomAccessIterator> 629 void 630 stable_sort(RandomAccessIterator first, RandomAccessIterator last); 631 632template <class RandomAccessIterator, class Compare> 633 void 634 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 635 636template <class RandomAccessIterator> 637 constexpr void // constexpr in C++20 638 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 639 640template <class RandomAccessIterator, class Compare> 641 constexpr void // constexpr in C++20 642 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 643 644template <class InputIterator, class RandomAccessIterator> 645 constexpr RandomAccessIterator // constexpr in C++20 646 partial_sort_copy(InputIterator first, InputIterator last, 647 RandomAccessIterator result_first, RandomAccessIterator result_last); 648 649template <class InputIterator, class RandomAccessIterator, class Compare> 650 constexpr RandomAccessIterator // constexpr in C++20 651 partial_sort_copy(InputIterator first, InputIterator last, 652 RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 653 654template <class RandomAccessIterator> 655 constexpr void // constexpr in C++20 656 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 657 658template <class RandomAccessIterator, class Compare> 659 constexpr void // constexpr in C++20 660 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 661 662template <class ForwardIterator, class T> 663 constexpr ForwardIterator // constexpr in C++20 664 lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 665 666template <class ForwardIterator, class T, class Compare> 667 constexpr ForwardIterator // constexpr in C++20 668 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 669 670template <class ForwardIterator, class T> 671 constexpr ForwardIterator // constexpr in C++20 672 upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 673 674template <class ForwardIterator, class T, class Compare> 675 constexpr ForwardIterator // constexpr in C++20 676 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 677 678template <class ForwardIterator, class T> 679 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 680 equal_range(ForwardIterator first, ForwardIterator last, const T& value); 681 682template <class ForwardIterator, class T, class Compare> 683 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 684 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 685 686template <class ForwardIterator, class T> 687 constexpr bool // constexpr in C++20 688 binary_search(ForwardIterator first, ForwardIterator last, const T& value); 689 690template <class ForwardIterator, class T, class Compare> 691 constexpr bool // constexpr in C++20 692 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 693 694template <class InputIterator1, class InputIterator2, class OutputIterator> 695 constexpr OutputIterator // constexpr in C++20 696 merge(InputIterator1 first1, InputIterator1 last1, 697 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 698 699template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 700 constexpr OutputIterator // constexpr in C++20 701 merge(InputIterator1 first1, InputIterator1 last1, 702 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 703 704template <class BidirectionalIterator> 705 void 706 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 707 708template <class BidirectionalIterator, class Compare> 709 void 710 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 711 712template <class InputIterator1, class InputIterator2> 713 constexpr bool // constexpr in C++20 714 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 715 716template <class InputIterator1, class InputIterator2, class Compare> 717 constexpr bool // constexpr in C++20 718 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 719 720template <class InputIterator1, class InputIterator2, class OutputIterator> 721 constexpr OutputIterator // constexpr in C++20 722 set_union(InputIterator1 first1, InputIterator1 last1, 723 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 724 725template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 726 constexpr OutputIterator // constexpr in C++20 727 set_union(InputIterator1 first1, InputIterator1 last1, 728 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 729 730template <class InputIterator1, class InputIterator2, class OutputIterator> 731 constexpr OutputIterator // constexpr in C++20 732 set_intersection(InputIterator1 first1, InputIterator1 last1, 733 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 734 735template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 736 constexpr OutputIterator // constexpr in C++20 737 set_intersection(InputIterator1 first1, InputIterator1 last1, 738 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 739 740template <class InputIterator1, class InputIterator2, class OutputIterator> 741 constexpr OutputIterator // constexpr in C++20 742 set_difference(InputIterator1 first1, InputIterator1 last1, 743 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 744 745template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 746 constexpr OutputIterator // constexpr in C++20 747 set_difference(InputIterator1 first1, InputIterator1 last1, 748 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 749 750template <class InputIterator1, class InputIterator2, class OutputIterator> 751 constexpr OutputIterator // constexpr in C++20 752 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 753 InputIterator2 first2, InputIterator2 last2, OutputIterator result); 754 755template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 756 constexpr OutputIterator // constexpr in C++20 757 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 758 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 759 760template <class RandomAccessIterator> 761 constexpr void // constexpr in C++20 762 push_heap(RandomAccessIterator first, RandomAccessIterator last); 763 764template <class RandomAccessIterator, class Compare> 765 constexpr void // constexpr in C++20 766 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 767 768template <class RandomAccessIterator> 769 constexpr void // constexpr in C++20 770 pop_heap(RandomAccessIterator first, RandomAccessIterator last); 771 772template <class RandomAccessIterator, class Compare> 773 constexpr void // constexpr in C++20 774 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 775 776template <class RandomAccessIterator> 777 constexpr void // constexpr in C++20 778 make_heap(RandomAccessIterator first, RandomAccessIterator last); 779 780template <class RandomAccessIterator, class Compare> 781 constexpr void // constexpr in C++20 782 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 783 784template <class RandomAccessIterator> 785 constexpr void // constexpr in C++20 786 sort_heap(RandomAccessIterator first, RandomAccessIterator last); 787 788template <class RandomAccessIterator, class Compare> 789 constexpr void // constexpr in C++20 790 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 791 792template <class RandomAccessIterator> 793 constexpr bool // constexpr in C++20 794 is_heap(RandomAccessIterator first, RandomAccessiterator last); 795 796template <class RandomAccessIterator, class Compare> 797 constexpr bool // constexpr in C++20 798 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 799 800template <class RandomAccessIterator> 801 constexpr RandomAccessIterator // constexpr in C++20 802 is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 803 804template <class RandomAccessIterator, class Compare> 805 constexpr RandomAccessIterator // constexpr in C++20 806 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 807 808template <class ForwardIterator> 809 constexpr ForwardIterator // constexpr in C++14 810 min_element(ForwardIterator first, ForwardIterator last); 811 812template <class ForwardIterator, class Compare> 813 constexpr ForwardIterator // constexpr in C++14 814 min_element(ForwardIterator first, ForwardIterator last, Compare comp); 815 816template <class T> 817 constexpr const T& // constexpr in C++14 818 min(const T& a, const T& b); 819 820template <class T, class Compare> 821 constexpr const T& // constexpr in C++14 822 min(const T& a, const T& b, Compare comp); 823 824template<class T> 825 constexpr T // constexpr in C++14 826 min(initializer_list<T> t); 827 828template<class T, class Compare> 829 constexpr T // constexpr in C++14 830 min(initializer_list<T> t, Compare comp); 831 832template<class T> 833 constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 834 835template<class T, class Compare> 836 constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 837 838template <class ForwardIterator> 839 constexpr ForwardIterator // constexpr in C++14 840 max_element(ForwardIterator first, ForwardIterator last); 841 842template <class ForwardIterator, class Compare> 843 constexpr ForwardIterator // constexpr in C++14 844 max_element(ForwardIterator first, ForwardIterator last, Compare comp); 845 846template <class T> 847 constexpr const T& // constexpr in C++14 848 max(const T& a, const T& b); 849 850template <class T, class Compare> 851 constexpr const T& // constexpr in C++14 852 max(const T& a, const T& b, Compare comp); 853 854template<class T> 855 constexpr T // constexpr in C++14 856 max(initializer_list<T> t); 857 858template<class T, class Compare> 859 constexpr T // constexpr in C++14 860 max(initializer_list<T> t, Compare comp); 861 862template<class ForwardIterator> 863 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 864 minmax_element(ForwardIterator first, ForwardIterator last); 865 866template<class ForwardIterator, class Compare> 867 constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 868 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 869 870template<class T> 871 constexpr pair<const T&, const T&> // constexpr in C++14 872 minmax(const T& a, const T& b); 873 874template<class T, class Compare> 875 constexpr pair<const T&, const T&> // constexpr in C++14 876 minmax(const T& a, const T& b, Compare comp); 877 878template<class T> 879 constexpr pair<T, T> // constexpr in C++14 880 minmax(initializer_list<T> t); 881 882template<class T, class Compare> 883 constexpr pair<T, T> // constexpr in C++14 884 minmax(initializer_list<T> t, Compare comp); 885 886template <class InputIterator1, class InputIterator2> 887 constexpr bool // constexpr in C++20 888 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 889 890template <class InputIterator1, class InputIterator2, class Compare> 891 constexpr bool // constexpr in C++20 892 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 893 InputIterator2 first2, InputIterator2 last2, Compare comp); 894 895template <class BidirectionalIterator> 896 constexpr bool // constexpr in C++20 897 next_permutation(BidirectionalIterator first, BidirectionalIterator last); 898 899template <class BidirectionalIterator, class Compare> 900 constexpr bool // constexpr in C++20 901 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 902 903template <class BidirectionalIterator> 904 constexpr bool // constexpr in C++20 905 prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 906 907template <class BidirectionalIterator, class Compare> 908 constexpr bool // constexpr in C++20 909 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 910} // std 911 912*/ 913 914#include <__assert> // all public C++ headers provide the assertion handler 915#include <__bits> 916#include <__config> 917#include <__debug> 918#include <cstddef> 919#include <cstring> 920#include <initializer_list> 921#include <iterator> 922#include <memory> 923#include <type_traits> 924#include <version> 925 926#include <__algorithm/adjacent_find.h> 927#include <__algorithm/all_of.h> 928#include <__algorithm/any_of.h> 929#include <__algorithm/binary_search.h> 930#include <__algorithm/clamp.h> 931#include <__algorithm/comp.h> 932#include <__algorithm/comp_ref_type.h> 933#include <__algorithm/copy.h> 934#include <__algorithm/copy_backward.h> 935#include <__algorithm/copy_if.h> 936#include <__algorithm/copy_n.h> 937#include <__algorithm/count.h> 938#include <__algorithm/count_if.h> 939#include <__algorithm/equal.h> 940#include <__algorithm/equal_range.h> 941#include <__algorithm/fill.h> 942#include <__algorithm/fill_n.h> 943#include <__algorithm/find.h> 944#include <__algorithm/find_end.h> 945#include <__algorithm/find_first_of.h> 946#include <__algorithm/find_if.h> 947#include <__algorithm/find_if_not.h> 948#include <__algorithm/for_each.h> 949#include <__algorithm/for_each_n.h> 950#include <__algorithm/generate.h> 951#include <__algorithm/generate_n.h> 952#include <__algorithm/half_positive.h> 953#include <__algorithm/in_found_result.h> 954#include <__algorithm/in_fun_result.h> 955#include <__algorithm/in_in_out_result.h> 956#include <__algorithm/in_in_result.h> 957#include <__algorithm/in_out_out_result.h> 958#include <__algorithm/in_out_result.h> 959#include <__algorithm/includes.h> 960#include <__algorithm/inplace_merge.h> 961#include <__algorithm/is_heap.h> 962#include <__algorithm/is_heap_until.h> 963#include <__algorithm/is_partitioned.h> 964#include <__algorithm/is_permutation.h> 965#include <__algorithm/is_sorted.h> 966#include <__algorithm/is_sorted_until.h> 967#include <__algorithm/iter_swap.h> 968#include <__algorithm/lexicographical_compare.h> 969#include <__algorithm/lower_bound.h> 970#include <__algorithm/make_heap.h> 971#include <__algorithm/max.h> 972#include <__algorithm/max_element.h> 973#include <__algorithm/merge.h> 974#include <__algorithm/min.h> 975#include <__algorithm/min_element.h> 976#include <__algorithm/min_max_result.h> 977#include <__algorithm/minmax.h> 978#include <__algorithm/minmax_element.h> 979#include <__algorithm/mismatch.h> 980#include <__algorithm/move.h> 981#include <__algorithm/move_backward.h> 982#include <__algorithm/next_permutation.h> 983#include <__algorithm/none_of.h> 984#include <__algorithm/nth_element.h> 985#include <__algorithm/partial_sort.h> 986#include <__algorithm/partial_sort_copy.h> 987#include <__algorithm/partition.h> 988#include <__algorithm/partition_copy.h> 989#include <__algorithm/partition_point.h> 990#include <__algorithm/pop_heap.h> 991#include <__algorithm/prev_permutation.h> 992#include <__algorithm/push_heap.h> 993#include <__algorithm/ranges_copy.h> 994#include <__algorithm/ranges_copy_backward.h> 995#include <__algorithm/ranges_copy_if.h> 996#include <__algorithm/ranges_copy_n.h> 997#include <__algorithm/ranges_count.h> 998#include <__algorithm/ranges_count_if.h> 999#include <__algorithm/ranges_find.h> 1000#include <__algorithm/ranges_find_if.h> 1001#include <__algorithm/ranges_find_if_not.h> 1002#include <__algorithm/ranges_for_each.h> 1003#include <__algorithm/ranges_for_each_n.h> 1004#include <__algorithm/ranges_is_partitioned.h> 1005#include <__algorithm/ranges_max.h> 1006#include <__algorithm/ranges_max_element.h> 1007#include <__algorithm/ranges_min.h> 1008#include <__algorithm/ranges_min_element.h> 1009#include <__algorithm/ranges_minmax.h> 1010#include <__algorithm/ranges_minmax_element.h> 1011#include <__algorithm/ranges_mismatch.h> 1012#include <__algorithm/ranges_swap_ranges.h> 1013#include <__algorithm/ranges_transform.h> 1014#include <__algorithm/remove.h> 1015#include <__algorithm/remove_copy.h> 1016#include <__algorithm/remove_copy_if.h> 1017#include <__algorithm/remove_if.h> 1018#include <__algorithm/replace.h> 1019#include <__algorithm/replace_copy.h> 1020#include <__algorithm/replace_copy_if.h> 1021#include <__algorithm/replace_if.h> 1022#include <__algorithm/reverse.h> 1023#include <__algorithm/reverse_copy.h> 1024#include <__algorithm/rotate.h> 1025#include <__algorithm/rotate_copy.h> 1026#include <__algorithm/sample.h> 1027#include <__algorithm/search.h> 1028#include <__algorithm/search_n.h> 1029#include <__algorithm/set_difference.h> 1030#include <__algorithm/set_intersection.h> 1031#include <__algorithm/set_symmetric_difference.h> 1032#include <__algorithm/set_union.h> 1033#include <__algorithm/shift_left.h> 1034#include <__algorithm/shift_right.h> 1035#include <__algorithm/shuffle.h> 1036#include <__algorithm/sift_down.h> 1037#include <__algorithm/sort.h> 1038#include <__algorithm/sort_heap.h> 1039#include <__algorithm/stable_partition.h> 1040#include <__algorithm/stable_sort.h> 1041#include <__algorithm/swap_ranges.h> 1042#include <__algorithm/transform.h> 1043#include <__algorithm/unique.h> 1044#include <__algorithm/unique_copy.h> 1045#include <__algorithm/unwrap_iter.h> 1046#include <__algorithm/upper_bound.h> 1047 1048#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 1049# pragma GCC system_header 1050#endif 1051 1052#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 1053# include <__pstl_algorithm> 1054#endif 1055 1056#endif // _LIBCPP_ALGORITHM 1057