2 //===-------------------------- algorithm ---------------------------------===//
4 // The LLVM Compiler Infrastructure
6 // This file is dual licensed under the MIT and the University of Illinois Open
7 // Source Licenses. See LICENSE.TXT for details.
9 //===----------------------------------------------------------------------===//
11 #ifndef _LIBCPP_ALGORITHM
12 #define _LIBCPP_ALGORITHM
17 #include <initializer_list>
22 template <class InputIterator, class Predicate>
24 all_of(InputIterator first, InputIterator last, Predicate pred);
26 template <class InputIterator, class Predicate>
28 any_of(InputIterator first, InputIterator last, Predicate pred);
30 template <class InputIterator, class Predicate>
32 none_of(InputIterator first, InputIterator last, Predicate pred);
34 template <class InputIterator, class Function>
36 for_each(InputIterator first, InputIterator last, Function f);
38 template<class InputIterator, class Size, class Function>
39 InputIterator for_each_n(InputIterator first, Size n, Function f); // C++17
41 template <class InputIterator, class T>
43 find(InputIterator first, InputIterator last, const T& value);
45 template <class InputIterator, class Predicate>
47 find_if(InputIterator first, InputIterator last, Predicate pred);
49 template<class InputIterator, class Predicate>
51 find_if_not(InputIterator first, InputIterator last, Predicate pred);
53 template <class ForwardIterator1, class ForwardIterator2>
55 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
56 ForwardIterator2 first2, ForwardIterator2 last2);
58 template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
60 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
61 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
63 template <class ForwardIterator1, class ForwardIterator2>
65 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
66 ForwardIterator2 first2, ForwardIterator2 last2);
68 template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
70 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
71 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
73 template <class ForwardIterator>
75 adjacent_find(ForwardIterator first, ForwardIterator last);
77 template <class ForwardIterator, class BinaryPredicate>
79 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
81 template <class InputIterator, class T>
82 typename iterator_traits<InputIterator>::difference_type
83 count(InputIterator first, InputIterator last, const T& value);
85 template <class InputIterator, class Predicate>
86 typename iterator_traits<InputIterator>::difference_type
87 count_if(InputIterator first, InputIterator last, Predicate pred);
89 template <class InputIterator1, class InputIterator2>
90 pair<InputIterator1, InputIterator2>
91 mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
93 template <class InputIterator1, class InputIterator2>
94 pair<InputIterator1, InputIterator2>
95 mismatch(InputIterator1 first1, InputIterator1 last1,
96 InputIterator2 first2, InputIterator2 last2); // **C++14**
98 template <class InputIterator1, class InputIterator2, class BinaryPredicate>
99 pair<InputIterator1, InputIterator2>
100 mismatch(InputIterator1 first1, InputIterator1 last1,
101 InputIterator2 first2, BinaryPredicate pred);
103 template <class InputIterator1, class InputIterator2, class BinaryPredicate>
104 pair<InputIterator1, InputIterator2>
105 mismatch(InputIterator1 first1, InputIterator1 last1,
106 InputIterator2 first2, InputIterator2 last2,
107 BinaryPredicate pred); // **C++14**
109 template <class InputIterator1, class InputIterator2>
111 equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
113 template <class InputIterator1, class InputIterator2>
115 equal(InputIterator1 first1, InputIterator1 last1,
116 InputIterator2 first2, InputIterator2 last2); // **C++14**
118 template <class InputIterator1, class InputIterator2, class BinaryPredicate>
120 equal(InputIterator1 first1, InputIterator1 last1,
121 InputIterator2 first2, BinaryPredicate pred);
123 template <class InputIterator1, class InputIterator2, class BinaryPredicate>
125 equal(InputIterator1 first1, InputIterator1 last1,
126 InputIterator2 first2, InputIterator2 last2,
127 BinaryPredicate pred); // **C++14**
129 template<class ForwardIterator1, class ForwardIterator2>
131 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
132 ForwardIterator2 first2);
134 template<class ForwardIterator1, class ForwardIterator2>
136 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
137 ForwardIterator2 first2, ForwardIterator2 last2); // **C++14**
139 template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
141 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
142 ForwardIterator2 first2, BinaryPredicate pred);
144 template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
146 is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
147 ForwardIterator2 first2, ForwardIterator2 last2,
148 BinaryPredicate pred); // **C++14**
150 template <class ForwardIterator1, class ForwardIterator2>
152 search(ForwardIterator1 first1, ForwardIterator1 last1,
153 ForwardIterator2 first2, ForwardIterator2 last2);
155 template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
157 search(ForwardIterator1 first1, ForwardIterator1 last1,
158 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
160 template <class ForwardIterator, class Size, class T>
162 search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
164 template <class ForwardIterator, class Size, class T, class BinaryPredicate>
166 search_n(ForwardIterator first, ForwardIterator last,
167 Size count, const T& value, BinaryPredicate pred);
169 template <class InputIterator, class OutputIterator>
171 copy(InputIterator first, InputIterator last, OutputIterator result);
173 template<class InputIterator, class OutputIterator, class Predicate>
175 copy_if(InputIterator first, InputIterator last,
176 OutputIterator result, Predicate pred);
178 template<class InputIterator, class Size, class OutputIterator>
180 copy_n(InputIterator first, Size n, OutputIterator result);
182 template <class BidirectionalIterator1, class BidirectionalIterator2>
183 BidirectionalIterator2
184 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
185 BidirectionalIterator2 result);
187 template <class ForwardIterator1, class ForwardIterator2>
189 swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
191 template <class ForwardIterator1, class ForwardIterator2>
193 iter_swap(ForwardIterator1 a, ForwardIterator2 b);
195 template <class InputIterator, class OutputIterator, class UnaryOperation>
197 transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
199 template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>
201 transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
202 OutputIterator result, BinaryOperation binary_op);
204 template <class ForwardIterator, class T>
206 replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
208 template <class ForwardIterator, class Predicate, class T>
210 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
212 template <class InputIterator, class OutputIterator, class T>
214 replace_copy(InputIterator first, InputIterator last, OutputIterator result,
215 const T& old_value, const T& new_value);
217 template <class InputIterator, class OutputIterator, class Predicate, class T>
219 replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
221 template <class ForwardIterator, class T>
223 fill(ForwardIterator first, ForwardIterator last, const T& value);
225 template <class OutputIterator, class Size, class T>
227 fill_n(OutputIterator first, Size n, const T& value);
229 template <class ForwardIterator, class Generator>
231 generate(ForwardIterator first, ForwardIterator last, Generator gen);
233 template <class OutputIterator, class Size, class Generator>
235 generate_n(OutputIterator first, Size n, Generator gen);
237 template <class ForwardIterator, class T>
239 remove(ForwardIterator first, ForwardIterator last, const T& value);
241 template <class ForwardIterator, class Predicate>
243 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
245 template <class InputIterator, class OutputIterator, class T>
247 remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
249 template <class InputIterator, class OutputIterator, class Predicate>
251 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
253 template <class ForwardIterator>
255 unique(ForwardIterator first, ForwardIterator last);
257 template <class ForwardIterator, class BinaryPredicate>
259 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
261 template <class InputIterator, class OutputIterator>
263 unique_copy(InputIterator first, InputIterator last, OutputIterator result);
265 template <class InputIterator, class OutputIterator, class BinaryPredicate>
267 unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
269 template <class BidirectionalIterator>
271 reverse(BidirectionalIterator first, BidirectionalIterator last);
273 template <class BidirectionalIterator, class OutputIterator>
275 reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
277 template <class ForwardIterator>
279 rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
281 template <class ForwardIterator, class OutputIterator>
283 rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
285 template <class RandomAccessIterator>
287 random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
289 template <class RandomAccessIterator, class RandomNumberGenerator>
291 random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
292 RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17
294 template<class PopulationIterator, class SampleIterator,
295 class Distance, class UniformRandomBitGenerator>
296 SampleIterator sample(PopulationIterator first, PopulationIterator last,
297 SampleIterator out, Distance n,
298 UniformRandomBitGenerator&& g); // C++17
300 template<class RandomAccessIterator, class UniformRandomNumberGenerator>
301 void shuffle(RandomAccessIterator first, RandomAccessIterator last,
302 UniformRandomNumberGenerator&& g);
304 template <class InputIterator, class Predicate>
306 is_partitioned(InputIterator first, InputIterator last, Predicate pred);
308 template <class ForwardIterator, class Predicate>
310 partition(ForwardIterator first, ForwardIterator last, Predicate pred);
312 template <class InputIterator, class OutputIterator1,
313 class OutputIterator2, class Predicate>
314 pair<OutputIterator1, OutputIterator2>
315 partition_copy(InputIterator first, InputIterator last,
316 OutputIterator1 out_true, OutputIterator2 out_false,
319 template <class ForwardIterator, class Predicate>
321 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
323 template<class ForwardIterator, class Predicate>
325 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
327 template <class ForwardIterator>
329 is_sorted(ForwardIterator first, ForwardIterator last);
331 template <class ForwardIterator, class Compare>
333 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
335 template<class ForwardIterator>
337 is_sorted_until(ForwardIterator first, ForwardIterator last);
339 template <class ForwardIterator, class Compare>
341 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
343 template <class RandomAccessIterator>
345 sort(RandomAccessIterator first, RandomAccessIterator last);
347 template <class RandomAccessIterator, class Compare>
349 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
351 template <class RandomAccessIterator>
353 stable_sort(RandomAccessIterator first, RandomAccessIterator last);
355 template <class RandomAccessIterator, class Compare>
357 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
359 template <class RandomAccessIterator>
361 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
363 template <class RandomAccessIterator, class Compare>
365 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
367 template <class InputIterator, class RandomAccessIterator>
369 partial_sort_copy(InputIterator first, InputIterator last,
370 RandomAccessIterator result_first, RandomAccessIterator result_last);
372 template <class InputIterator, class RandomAccessIterator, class Compare>
374 partial_sort_copy(InputIterator first, InputIterator last,
375 RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp);
377 template <class RandomAccessIterator>
379 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
381 template <class RandomAccessIterator, class Compare>
383 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
385 template <class ForwardIterator, class T>
387 lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
389 template <class ForwardIterator, class T, class Compare>
391 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
393 template <class ForwardIterator, class T>
395 upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
397 template <class ForwardIterator, class T, class Compare>
399 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
401 template <class ForwardIterator, class T>
402 pair<ForwardIterator, ForwardIterator>
403 equal_range(ForwardIterator first, ForwardIterator last, const T& value);
405 template <class ForwardIterator, class T, class Compare>
406 pair<ForwardIterator, ForwardIterator>
407 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
409 template <class ForwardIterator, class T>
411 binary_search(ForwardIterator first, ForwardIterator last, const T& value);
413 template <class ForwardIterator, class T, class Compare>
415 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
417 template <class InputIterator1, class InputIterator2, class OutputIterator>
419 merge(InputIterator1 first1, InputIterator1 last1,
420 InputIterator2 first2, InputIterator2 last2, OutputIterator result);
422 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
424 merge(InputIterator1 first1, InputIterator1 last1,
425 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
427 template <class BidirectionalIterator>
429 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
431 template <class BidirectionalIterator, class Compare>
433 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
435 template <class InputIterator1, class InputIterator2>
437 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
439 template <class InputIterator1, class InputIterator2, class Compare>
441 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);
443 template <class InputIterator1, class InputIterator2, class OutputIterator>
445 set_union(InputIterator1 first1, InputIterator1 last1,
446 InputIterator2 first2, InputIterator2 last2, OutputIterator result);
448 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
450 set_union(InputIterator1 first1, InputIterator1 last1,
451 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
453 template <class InputIterator1, class InputIterator2, class OutputIterator>
455 set_intersection(InputIterator1 first1, InputIterator1 last1,
456 InputIterator2 first2, InputIterator2 last2, OutputIterator result);
458 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
460 set_intersection(InputIterator1 first1, InputIterator1 last1,
461 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
463 template <class InputIterator1, class InputIterator2, class OutputIterator>
465 set_difference(InputIterator1 first1, InputIterator1 last1,
466 InputIterator2 first2, InputIterator2 last2, OutputIterator result);
468 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
470 set_difference(InputIterator1 first1, InputIterator1 last1,
471 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
473 template <class InputIterator1, class InputIterator2, class OutputIterator>
475 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
476 InputIterator2 first2, InputIterator2 last2, OutputIterator result);
478 template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
480 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
481 InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp);
483 template <class RandomAccessIterator>
485 push_heap(RandomAccessIterator first, RandomAccessIterator last);
487 template <class RandomAccessIterator, class Compare>
489 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
491 template <class RandomAccessIterator>
493 pop_heap(RandomAccessIterator first, RandomAccessIterator last);
495 template <class RandomAccessIterator, class Compare>
497 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
499 template <class RandomAccessIterator>
501 make_heap(RandomAccessIterator first, RandomAccessIterator last);
503 template <class RandomAccessIterator, class Compare>
505 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
507 template <class RandomAccessIterator>
509 sort_heap(RandomAccessIterator first, RandomAccessIterator last);
511 template <class RandomAccessIterator, class Compare>
513 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
515 template <class RandomAccessIterator>
517 is_heap(RandomAccessIterator first, RandomAccessiterator last);
519 template <class RandomAccessIterator, class Compare>
521 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
523 template <class RandomAccessIterator>
525 is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
527 template <class RandomAccessIterator, class Compare>
529 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
531 template <class ForwardIterator>
533 min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14
535 template <class ForwardIterator, class Compare>
537 min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14
541 min(const T& a, const T& b); // constexpr in C++14
543 template <class T, class Compare>
545 min(const T& a, const T& b, Compare comp); // constexpr in C++14
549 min(initializer_list<T> t); // constexpr in C++14
551 template<class T, class Compare>
553 min(initializer_list<T> t, Compare comp); // constexpr in C++14
556 constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17
558 template<class T, class Compare>
559 constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17
561 template <class ForwardIterator>
563 max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14
565 template <class ForwardIterator, class Compare>
567 max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14
571 max(const T& a, const T& b); // constexpr in C++14
573 template <class T, class Compare>
575 max(const T& a, const T& b, Compare comp); // constexpr in C++14
579 max(initializer_list<T> t); // constexpr in C++14
581 template<class T, class Compare>
583 max(initializer_list<T> t, Compare comp); // constexpr in C++14
585 template<class ForwardIterator>
586 pair<ForwardIterator, ForwardIterator>
587 minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14
589 template<class ForwardIterator, class Compare>
590 pair<ForwardIterator, ForwardIterator>
591 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14
594 pair<const T&, const T&>
595 minmax(const T& a, const T& b); // constexpr in C++14
597 template<class T, class Compare>
598 pair<const T&, const T&>
599 minmax(const T& a, const T& b, Compare comp); // constexpr in C++14
603 minmax(initializer_list<T> t); // constexpr in C++14
605 template<class T, class Compare>
607 minmax(initializer_list<T> t, Compare comp); // constexpr in C++14
609 template <class InputIterator1, class InputIterator2>
611 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2);
613 template <class InputIterator1, class InputIterator2, class Compare>
615 lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
616 InputIterator2 first2, InputIterator2 last2, Compare comp);
618 template <class BidirectionalIterator>
620 next_permutation(BidirectionalIterator first, BidirectionalIterator last);
622 template <class BidirectionalIterator, class Compare>
624 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
626 template <class BidirectionalIterator>
628 prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
630 template <class BidirectionalIterator, class Compare>
632 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
639 #include <initializer_list>
640 #include <type_traits>
642 #include <utility> // needed to provide swap_ranges.
647 #if defined(__IBMCPP__)
648 #include "support/ibm/support.h"
650 #if defined(_LIBCPP_COMPILER_MSVC)
656 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
657 #pragma GCC system_header
661 #include <__undef_macros>
664 _LIBCPP_BEGIN_NAMESPACE_STD
666 // I'd like to replace these with _VSTD::equal_to<void>, but can't because:
667 // * That only works with C++14 and later, and
668 // * We haven't included <functional> here.
669 template <class _T1, class _T2 = _T1>
672 _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;}
673 _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;}
674 _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;}
675 _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;}
679 struct __equal_to<_T1, _T1>
681 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
682 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;}
686 struct __equal_to<const _T1, _T1>
688 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
689 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;}
693 struct __equal_to<_T1, const _T1>
695 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
696 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;}
699 template <class _T1, class _T2 = _T1>
702 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
703 bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
705 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
706 bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;}
708 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
709 bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;}
711 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
712 bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;}
716 struct __less<_T1, _T1>
718 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
719 bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
723 struct __less<const _T1, _T1>
725 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
726 bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
730 struct __less<_T1, const _T1>
732 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
733 bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;}
736 template <class _Predicate>
742 _LIBCPP_INLINE_VISIBILITY __negate() {}
744 _LIBCPP_INLINE_VISIBILITY
745 explicit __negate(_Predicate __p) : __p_(__p) {}
748 _LIBCPP_INLINE_VISIBILITY
749 bool operator()(const _T1& __x) {return !__p_(__x);}
751 template <class _T1, class _T2>
752 _LIBCPP_INLINE_VISIBILITY
753 bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);}
758 template <class _Compare>
762 __debug_less(_Compare& __c) : __comp_(__c) {}
764 template <class _Tp, class _Up>
765 bool operator()(const _Tp& __x, const _Up& __y)
767 bool __r = __comp_(__x, __y);
769 __do_compare_assert(0, __y, __x);
773 template <class _LHS, class _RHS>
774 inline _LIBCPP_INLINE_VISIBILITY
775 decltype((void)_VSTD::declval<_Compare&>()(
776 _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>()))
777 __do_compare_assert(int, _LHS const& __l, _RHS const& __r) {
778 _LIBCPP_ASSERT(!__comp_(__l, __r),
779 "Comparator does not induce a strict weak ordering");
782 template <class _LHS, class _RHS>
783 inline _LIBCPP_INLINE_VISIBILITY
784 void __do_compare_assert(long, _LHS const&, _RHS const&) {}
787 #endif // _LIBCPP_DEBUG
789 // Precondition: __x != 0
790 inline _LIBCPP_INLINE_VISIBILITY
791 unsigned __ctz(unsigned __x) {
792 #ifndef _LIBCPP_COMPILER_MSVC
793 return static_cast<unsigned>(__builtin_ctz(__x));
795 static_assert(sizeof(unsigned) == sizeof(unsigned long), "");
796 static_assert(sizeof(unsigned long) == 4, "");
798 // Search from LSB to MSB for first set bit.
799 // Returns zero if no set bit is found.
800 if (_BitScanForward(&where, mask))
806 inline _LIBCPP_INLINE_VISIBILITY
807 unsigned long __ctz(unsigned long __x) {
808 #ifndef _LIBCPP_COMPILER_MSVC
809 return static_cast<unsigned long>(__builtin_ctzl(__x));
811 static_assert(sizeof(unsigned long) == sizeof(unsigned), "");
812 return __ctz(static_cast<unsigned>(__x));
816 inline _LIBCPP_INLINE_VISIBILITY
817 unsigned long long __ctz(unsigned long long __x) {
818 #ifndef _LIBCPP_COMPILER_MSVC
819 return static_cast<unsigned long long>(__builtin_ctzll(__x));
822 // Search from LSB to MSB for first set bit.
823 // Returns zero if no set bit is found.
824 #if defined(_LIBCPP_HAS_BITSCAN64)
825 (defined(_M_AMD64) || defined(__x86_64__))
826 if (_BitScanForward64(&where, mask))
827 return static_cast<int>(where);
829 // Win32 doesn't have _BitScanForward64 so emulate it with two 32 bit calls.
830 // Scan the Low Word.
831 if (_BitScanForward(&where, static_cast<unsigned long>(mask)))
833 // Scan the High Word.
834 if (_BitScanForward(&where, static_cast<unsigned long>(mask >> 32)))
835 return where + 32; // Create a bit offset from the LSB.
838 #endif // _LIBCPP_COMPILER_MSVC
841 // Precondition: __x != 0
842 inline _LIBCPP_INLINE_VISIBILITY
843 unsigned __clz(unsigned __x) {
844 #ifndef _LIBCPP_COMPILER_MSVC
845 return static_cast<unsigned>(__builtin_clz(__x));
847 static_assert(sizeof(unsigned) == sizeof(unsigned long), "");
848 static_assert(sizeof(unsigned long) == 4, "");
850 // Search from LSB to MSB for first set bit.
851 // Returns zero if no set bit is found.
852 if (_BitScanReverse(&where, mask))
854 return 32; // Undefined Behavior.
858 inline _LIBCPP_INLINE_VISIBILITY
859 unsigned long __clz(unsigned long __x) {
860 #ifndef _LIBCPP_COMPILER_MSVC
861 return static_cast<unsigned long>(__builtin_clzl (__x));
863 static_assert(sizeof(unsigned) == sizeof(unsigned long), "");
864 return __clz(static_cast<unsigned>(__x));
868 inline _LIBCPP_INLINE_VISIBILITY
869 unsigned long long __clz(unsigned long long __x) {
870 #ifndef _LIBCPP_COMPILER_MSVC
871 return static_cast<unsigned long long>(__builtin_clzll(__x));
874 // BitScanReverse scans from MSB to LSB for first set bit.
875 // Returns 0 if no set bit is found.
876 #if defined(_LIBCPP_HAS_BITSCAN64)
877 if (_BitScanReverse64(&where, mask))
878 return static_cast<int>(63 - where);
880 // Scan the high 32 bits.
881 if (_BitScanReverse(&where, static_cast<unsigned long>(mask >> 32)))
882 return 63 - (where + 32); // Create a bit offset from the MSB.
883 // Scan the low 32 bits.
884 if (_BitScanReverse(&where, static_cast<unsigned long>(mask)))
887 return 64; // Undefined Behavior.
888 #endif // _LIBCPP_COMPILER_MSVC
891 inline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {
892 #ifndef _LIBCPP_COMPILER_MSVC
893 return __builtin_popcount (__x);
895 static_assert(sizeof(unsigned) == 4, "");
896 return __popcnt(__x);
900 inline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {
901 #ifndef _LIBCPP_COMPILER_MSVC
902 return __builtin_popcountl (__x);
904 static_assert(sizeof(unsigned long) == 4, "");
905 return __popcnt(__x);
909 inline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {
910 #ifndef _LIBCPP_COMPILER_MSVC
911 return __builtin_popcountll(__x);
913 static_assert(sizeof(unsigned long long) == 8, "");
914 return __popcnt64(__x);
920 template <class _InputIterator, class _Predicate>
921 inline _LIBCPP_INLINE_VISIBILITY
923 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
925 for (; __first != __last; ++__first)
926 if (!__pred(*__first))
933 template <class _InputIterator, class _Predicate>
934 inline _LIBCPP_INLINE_VISIBILITY
936 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
938 for (; __first != __last; ++__first)
939 if (__pred(*__first))
946 template <class _InputIterator, class _Predicate>
947 inline _LIBCPP_INLINE_VISIBILITY
949 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
951 for (; __first != __last; ++__first)
952 if (__pred(*__first))
959 template <class _InputIterator, class _Function>
960 inline _LIBCPP_INLINE_VISIBILITY
962 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
964 for (; __first != __last; ++__first)
969 #if _LIBCPP_STD_VER > 14
972 template <class _InputIterator, class _Size, class _Function>
973 inline _LIBCPP_INLINE_VISIBILITY
975 for_each_n(_InputIterator __first, _Size __orig_n, _Function __f)
977 typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize;
978 _IntegralSize __n = __orig_n;
991 template <class _InputIterator, class _Tp>
992 inline _LIBCPP_INLINE_VISIBILITY
994 find(_InputIterator __first, _InputIterator __last, const _Tp& __value_)
996 for (; __first != __last; ++__first)
997 if (*__first == __value_)
1004 template <class _InputIterator, class _Predicate>
1005 inline _LIBCPP_INLINE_VISIBILITY
1007 find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
1009 for (; __first != __last; ++__first)
1010 if (__pred(*__first))
1017 template<class _InputIterator, class _Predicate>
1018 inline _LIBCPP_INLINE_VISIBILITY
1020 find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred)
1022 for (; __first != __last; ++__first)
1023 if (!__pred(*__first))
1030 template <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2>
1032 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1033 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
1034 forward_iterator_tag, forward_iterator_tag)
1036 // modeled after search algorithm
1037 _ForwardIterator1 __r = __last1; // __last1 is the "default" answer
1038 if (__first2 == __last2)
1044 if (__first1 == __last1) // if source exhausted return last correct answer
1045 return __r; // (or __last1 if never found)
1046 if (__pred(*__first1, *__first2))
1050 // *__first1 matches *__first2, now match elements after here
1051 _ForwardIterator1 __m1 = __first1;
1052 _ForwardIterator2 __m2 = __first2;
1055 if (++__m2 == __last2)
1056 { // Pattern exhaused, record answer and search for another one
1061 if (++__m1 == __last1) // Source exhausted, return last answer
1063 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first
1067 } // else there is a match, check next elements
1072 template <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2>
1073 _BidirectionalIterator1
1074 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1,
1075 _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
1076 bidirectional_iterator_tag, bidirectional_iterator_tag)
1078 // modeled after search algorithm (in reverse)
1079 if (__first2 == __last2)
1080 return __last1; // Everything matches an empty sequence
1081 _BidirectionalIterator1 __l1 = __last1;
1082 _BidirectionalIterator2 __l2 = __last2;
1086 // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks
1089 if (__first1 == __l1) // return __last1 if no element matches *__first2
1091 if (__pred(*--__l1, *__l2))
1094 // *__l1 matches *__l2, now match elements before here
1095 _BidirectionalIterator1 __m1 = __l1;
1096 _BidirectionalIterator2 __m2 = __l2;
1099 if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
1101 if (__m1 == __first1) // Otherwise if source exhaused, pattern not found
1103 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1
1106 } // else there is a match, check next elements
1111 template <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2>
1112 _LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1
1113 __find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
1114 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1115 random_access_iterator_tag, random_access_iterator_tag)
1117 // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern
1118 typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2;
1121 typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1;
1122 if (__len1 < __len2)
1124 const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here
1125 _RandomAccessIterator1 __l1 = __last1;
1126 _RandomAccessIterator2 __l2 = __last2;
1134 if (__pred(*--__l1, *__l2))
1137 _RandomAccessIterator1 __m1 = __l1;
1138 _RandomAccessIterator2 __m2 = __l2;
1141 if (__m2 == __first2)
1143 // no need to check range on __m1 because __s guarantees we have enough source
1144 if (!__pred(*--__m1, *--__m2))
1152 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
1153 inline _LIBCPP_INLINE_VISIBILITY
1155 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1156 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred)
1158 return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type>
1159 (__first1, __last1, __first2, __last2, __pred,
1160 typename iterator_traits<_ForwardIterator1>::iterator_category(),
1161 typename iterator_traits<_ForwardIterator2>::iterator_category());
1164 template <class _ForwardIterator1, class _ForwardIterator2>
1165 inline _LIBCPP_INLINE_VISIBILITY
1167 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1168 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
1170 typedef typename iterator_traits<_ForwardIterator1>::value_type __v1;
1171 typedef typename iterator_traits<_ForwardIterator2>::value_type __v2;
1172 return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1177 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
1178 _LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1
1179 __find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1180 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred)
1182 for (; __first1 != __last1; ++__first1)
1183 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1184 if (__pred(*__first1, *__j))
1190 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
1191 inline _LIBCPP_INLINE_VISIBILITY
1193 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1194 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred)
1196 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred);
1199 template <class _ForwardIterator1, class _ForwardIterator2>
1200 inline _LIBCPP_INLINE_VISIBILITY
1202 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1203 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
1205 typedef typename iterator_traits<_ForwardIterator1>::value_type __v1;
1206 typedef typename iterator_traits<_ForwardIterator2>::value_type __v2;
1207 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1212 template <class _ForwardIterator, class _BinaryPredicate>
1213 inline _LIBCPP_INLINE_VISIBILITY
1215 adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred)
1217 if (__first != __last)
1219 _ForwardIterator __i = __first;
1220 while (++__i != __last)
1222 if (__pred(*__first, *__i))
1230 template <class _ForwardIterator>
1231 inline _LIBCPP_INLINE_VISIBILITY
1233 adjacent_find(_ForwardIterator __first, _ForwardIterator __last)
1235 typedef typename iterator_traits<_ForwardIterator>::value_type __v;
1236 return _VSTD::adjacent_find(__first, __last, __equal_to<__v>());
1241 template <class _InputIterator, class _Tp>
1242 inline _LIBCPP_INLINE_VISIBILITY
1243 typename iterator_traits<_InputIterator>::difference_type
1244 count(_InputIterator __first, _InputIterator __last, const _Tp& __value_)
1246 typename iterator_traits<_InputIterator>::difference_type __r(0);
1247 for (; __first != __last; ++__first)
1248 if (*__first == __value_)
1255 template <class _InputIterator, class _Predicate>
1256 inline _LIBCPP_INLINE_VISIBILITY
1257 typename iterator_traits<_InputIterator>::difference_type
1258 count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
1260 typename iterator_traits<_InputIterator>::difference_type __r(0);
1261 for (; __first != __last; ++__first)
1262 if (__pred(*__first))
1269 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate>
1270 inline _LIBCPP_INLINE_VISIBILITY
1271 pair<_InputIterator1, _InputIterator2>
1272 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1273 _InputIterator2 __first2, _BinaryPredicate __pred)
1275 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1276 if (!__pred(*__first1, *__first2))
1278 return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
1281 template <class _InputIterator1, class _InputIterator2>
1282 inline _LIBCPP_INLINE_VISIBILITY
1283 pair<_InputIterator1, _InputIterator2>
1284 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2)
1286 typedef typename iterator_traits<_InputIterator1>::value_type __v1;
1287 typedef typename iterator_traits<_InputIterator2>::value_type __v2;
1288 return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1291 #if _LIBCPP_STD_VER > 11
1292 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate>
1293 inline _LIBCPP_INLINE_VISIBILITY
1294 pair<_InputIterator1, _InputIterator2>
1295 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1296 _InputIterator2 __first2, _InputIterator2 __last2,
1297 _BinaryPredicate __pred)
1299 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1300 if (!__pred(*__first1, *__first2))
1302 return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
1305 template <class _InputIterator1, class _InputIterator2>
1306 inline _LIBCPP_INLINE_VISIBILITY
1307 pair<_InputIterator1, _InputIterator2>
1308 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1309 _InputIterator2 __first2, _InputIterator2 __last2)
1311 typedef typename iterator_traits<_InputIterator1>::value_type __v1;
1312 typedef typename iterator_traits<_InputIterator2>::value_type __v2;
1313 return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1319 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate>
1320 inline _LIBCPP_INLINE_VISIBILITY
1322 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred)
1324 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1325 if (!__pred(*__first1, *__first2))
1330 template <class _InputIterator1, class _InputIterator2>
1331 inline _LIBCPP_INLINE_VISIBILITY
1333 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2)
1335 typedef typename iterator_traits<_InputIterator1>::value_type __v1;
1336 typedef typename iterator_traits<_InputIterator2>::value_type __v2;
1337 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1340 #if _LIBCPP_STD_VER > 11
1341 template <class _BinaryPredicate, class _InputIterator1, class _InputIterator2>
1342 inline _LIBCPP_INLINE_VISIBILITY
1344 __equal(_InputIterator1 __first1, _InputIterator1 __last1,
1345 _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred,
1346 input_iterator_tag, input_iterator_tag )
1348 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1349 if (!__pred(*__first1, *__first2))
1351 return __first1 == __last1 && __first2 == __last2;
1354 template <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2>
1355 inline _LIBCPP_INLINE_VISIBILITY
1357 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
1358 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1359 random_access_iterator_tag, random_access_iterator_tag )
1361 if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
1363 return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2,
1364 typename add_lvalue_reference<_BinaryPredicate>::type>
1365 (__first1, __last1, __first2, __pred );
1368 template <class _InputIterator1, class _InputIterator2, class _BinaryPredicate>
1369 inline _LIBCPP_INLINE_VISIBILITY
1371 equal(_InputIterator1 __first1, _InputIterator1 __last1,
1372 _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred )
1374 return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type>
1375 (__first1, __last1, __first2, __last2, __pred,
1376 typename iterator_traits<_InputIterator1>::iterator_category(),
1377 typename iterator_traits<_InputIterator2>::iterator_category());
1380 template <class _InputIterator1, class _InputIterator2>
1381 inline _LIBCPP_INLINE_VISIBILITY
1383 equal(_InputIterator1 __first1, _InputIterator1 __last1,
1384 _InputIterator2 __first2, _InputIterator2 __last2)
1386 typedef typename iterator_traits<_InputIterator1>::value_type __v1;
1387 typedef typename iterator_traits<_InputIterator2>::value_type __v2;
1388 return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(),
1389 typename iterator_traits<_InputIterator1>::iterator_category(),
1390 typename iterator_traits<_InputIterator2>::iterator_category());
1396 template<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
1398 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1399 _ForwardIterator2 __first2, _BinaryPredicate __pred)
1401 // shorten sequences as much as possible by lopping of any equal parts
1402 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1403 if (!__pred(*__first1, *__first2))
1407 // __first1 != __last1 && *__first1 != *__first2
1408 typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1;
1409 _D1 __l1 = _VSTD::distance(__first1, __last1);
1412 _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1);
1413 // For each element in [f1, l1) see if there are the same number of
1414 // equal elements in [f2, l2)
1415 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1417 // Have we already counted the number of *__i in [f1, l1)?
1418 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1419 if (__pred(*__j, *__i))
1422 // Count number of *__i in [f2, l2)
1424 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1425 if (__pred(*__i, *__j))
1429 // Count number of *__i in [__i, l1) (we can start with 1)
1431 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1432 if (__pred(*__i, *__j))
1442 template<class _ForwardIterator1, class _ForwardIterator2>
1443 inline _LIBCPP_INLINE_VISIBILITY
1445 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1446 _ForwardIterator2 __first2)
1448 typedef typename iterator_traits<_ForwardIterator1>::value_type __v1;
1449 typedef typename iterator_traits<_ForwardIterator2>::value_type __v2;
1450 return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1453 #if _LIBCPP_STD_VER > 11
1454 template<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2>
1456 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1457 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
1458 _BinaryPredicate __pred,
1459 forward_iterator_tag, forward_iterator_tag )
1461 // shorten sequences as much as possible by lopping of any equal parts
1462 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1463 if (!__pred(*__first1, *__first2))
1465 return __first1 == __last1 && __first2 == __last2;
1467 // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2
1468 typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1;
1469 _D1 __l1 = _VSTD::distance(__first1, __last1);
1471 typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2;
1472 _D2 __l2 = _VSTD::distance(__first2, __last2);
1476 // For each element in [f1, l1) see if there are the same number of
1477 // equal elements in [f2, l2)
1478 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1480 // Have we already counted the number of *__i in [f1, l1)?
1481 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1482 if (__pred(*__j, *__i))
1485 // Count number of *__i in [f2, l2)
1487 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1488 if (__pred(*__i, *__j))
1492 // Count number of *__i in [__i, l1) (we can start with 1)
1494 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1495 if (__pred(*__i, *__j))
1505 template<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2>
1507 __is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1,
1508 _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2,
1509 _BinaryPredicate __pred,
1510 random_access_iterator_tag, random_access_iterator_tag )
1512 if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
1514 return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2,
1515 typename add_lvalue_reference<_BinaryPredicate>::type>
1516 (__first1, __last1, __first2, __pred );
1519 template<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
1520 inline _LIBCPP_INLINE_VISIBILITY
1522 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1523 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
1524 _BinaryPredicate __pred )
1526 return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type>
1527 (__first1, __last1, __first2, __last2, __pred,
1528 typename iterator_traits<_ForwardIterator1>::iterator_category(),
1529 typename iterator_traits<_ForwardIterator2>::iterator_category());
1532 template<class _ForwardIterator1, class _ForwardIterator2>
1533 inline _LIBCPP_INLINE_VISIBILITY
1535 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1536 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
1538 typedef typename iterator_traits<_ForwardIterator1>::value_type __v1;
1539 typedef typename iterator_traits<_ForwardIterator2>::value_type __v2;
1540 return _VSTD::__is_permutation(__first1, __last1, __first2, __last2,
1541 __equal_to<__v1, __v2>(),
1542 typename iterator_traits<_ForwardIterator1>::iterator_category(),
1543 typename iterator_traits<_ForwardIterator2>::iterator_category());
1549 template <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2>
1550 pair<_ForwardIterator1, _ForwardIterator1>
1551 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1552 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
1553 forward_iterator_tag, forward_iterator_tag)
1555 if (__first2 == __last2)
1556 return make_pair(__first1, __first1); // Everything matches an empty sequence
1559 // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks
1562 if (__first1 == __last1) // return __last1 if no element matches *__first2
1563 return make_pair(__last1, __last1);
1564 if (__pred(*__first1, *__first2))
1568 // *__first1 matches *__first2, now match elements after here
1569 _ForwardIterator1 __m1 = __first1;
1570 _ForwardIterator2 __m2 = __first2;
1573 if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern)
1574 return make_pair(__first1, __m1);
1575 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found
1576 return make_pair(__last1, __last1);
1577 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1
1581 } // else there is a match, check next elements
1586 template <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2>
1587 _LIBCPP_CONSTEXPR_AFTER_CXX11
1588 pair<_RandomAccessIterator1, _RandomAccessIterator1>
1589 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
1590 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1591 random_access_iterator_tag, random_access_iterator_tag)
1593 typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1;
1594 typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2;
1595 // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern
1596 const _D2 __len2 = __last2 - __first2;
1598 return make_pair(__first1, __first1);
1599 const _D1 __len1 = __last1 - __first1;
1600 if (__len1 < __len2)
1601 return make_pair(__last1, __last1);
1602 const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here
1608 if (__first1 == __s)
1609 return make_pair(__last1, __last1);
1610 if (__pred(*__first1, *__first2))
1615 _RandomAccessIterator1 __m1 = __first1;
1616 _RandomAccessIterator2 __m2 = __first2;
1619 if (++__m2 == __last2)
1620 return make_pair(__first1, __first1 + __len2);
1621 ++__m1; // no need to check range on __m1 because __s guarantees we have enough source
1622 if (!__pred(*__m1, *__m2))
1631 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
1632 inline _LIBCPP_INLINE_VISIBILITY
1634 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1635 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred)
1637 return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type>
1638 (__first1, __last1, __first2, __last2, __pred,
1639 typename iterator_traits<_ForwardIterator1>::iterator_category(),
1640 typename iterator_traits<_ForwardIterator2>::iterator_category())
1644 template <class _ForwardIterator1, class _ForwardIterator2>
1645 inline _LIBCPP_INLINE_VISIBILITY
1647 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1648 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
1650 typedef typename iterator_traits<_ForwardIterator1>::value_type __v1;
1651 typedef typename iterator_traits<_ForwardIterator2>::value_type __v2;
1652 return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1657 template <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp>
1659 __search_n(_ForwardIterator __first, _ForwardIterator __last,
1660 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag)
1666 // Find first element in sequence that matchs __value_, with a mininum of loop checks
1669 if (__first == __last) // return __last if no element matches __value_
1671 if (__pred(*__first, __value_))
1675 // *__first matches __value_, now match elements after here
1676 _ForwardIterator __m = __first;
1680 if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)
1682 if (++__m == __last) // Otherwise if source exhaused, pattern not found
1684 if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first
1689 } // else there is a match, check next elements
1694 template <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp>
1695 _RandomAccessIterator
1696 __search_n(_RandomAccessIterator __first, _RandomAccessIterator __last,
1697 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag)
1701 _Size __len = static_cast<_Size>(__last - __first);
1702 if (__len < __count)
1704 const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here
1707 // Find first element in sequence that matchs __value_, with a mininum of loop checks
1710 if (__first >= __s) // return __last if no element matches __value_
1712 if (__pred(*__first, __value_))
1716 // *__first matches __value_, now match elements after here
1717 _RandomAccessIterator __m = __first;
1721 if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern)
1723 ++__m; // no need to check range on __m because __s guarantees we have enough source
1724 if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first
1729 } // else there is a match, check next elements
1734 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
1735 inline _LIBCPP_INLINE_VISIBILITY
1737 search_n(_ForwardIterator __first, _ForwardIterator __last,
1738 _Size __count, const _Tp& __value_, _BinaryPredicate __pred)
1740 return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type>
1741 (__first, __last, __convert_to_integral(__count), __value_, __pred,
1742 typename iterator_traits<_ForwardIterator>::iterator_category());
1745 template <class _ForwardIterator, class _Size, class _Tp>
1746 inline _LIBCPP_INLINE_VISIBILITY
1748 search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_)
1750 typedef typename iterator_traits<_ForwardIterator>::value_type __v;
1751 return _VSTD::search_n(__first, __last, __convert_to_integral(__count),
1752 __value_, __equal_to<__v, _Tp>());
1756 template <class _Iter>
1757 inline _LIBCPP_INLINE_VISIBILITY
1759 __unwrap_iter(_Iter __i)
1764 template <class _Tp>
1765 inline _LIBCPP_INLINE_VISIBILITY
1768 is_trivially_copy_assignable<_Tp>::value,
1771 __unwrap_iter(move_iterator<_Tp*> __i)
1776 #if _LIBCPP_DEBUG_LEVEL < 2
1778 template <class _Tp>
1779 inline _LIBCPP_INLINE_VISIBILITY
1782 is_trivially_copy_assignable<_Tp>::value,
1785 __unwrap_iter(__wrap_iter<_Tp*> __i)
1792 template <class _Tp>
1793 inline _LIBCPP_INLINE_VISIBILITY
1796 is_trivially_copy_assignable<_Tp>::value,
1799 __unwrap_iter(__wrap_iter<_Tp*> __i)
1804 #endif // _LIBCPP_DEBUG_LEVEL < 2
1806 template <class _InputIterator, class _OutputIterator>
1807 inline _LIBCPP_INLINE_VISIBILITY
1809 __copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
1811 for (; __first != __last; ++__first, (void) ++__result)
1812 *__result = *__first;
1816 template <class _Tp, class _Up>
1817 inline _LIBCPP_INLINE_VISIBILITY
1820 is_same<typename remove_const<_Tp>::type, _Up>::value &&
1821 is_trivially_copy_assignable<_Up>::value,
1824 __copy(_Tp* __first, _Tp* __last, _Up* __result)
1826 const size_t __n = static_cast<size_t>(__last - __first);
1828 _VSTD::memmove(__result, __first, __n * sizeof(_Up));
1829 return __result + __n;
1832 template <class _InputIterator, class _OutputIterator>
1833 inline _LIBCPP_INLINE_VISIBILITY
1835 copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
1837 return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result));
1842 template <class _BidirectionalIterator, class _OutputIterator>
1843 inline _LIBCPP_INLINE_VISIBILITY
1845 __copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result)
1847 while (__first != __last)
1848 *--__result = *--__last;
1852 template <class _Tp, class _Up>
1853 inline _LIBCPP_INLINE_VISIBILITY
1856 is_same<typename remove_const<_Tp>::type, _Up>::value &&
1857 is_trivially_copy_assignable<_Up>::value,
1860 __copy_backward(_Tp* __first, _Tp* __last, _Up* __result)
1862 const size_t __n = static_cast<size_t>(__last - __first);
1866 _VSTD::memmove(__result, __first, __n * sizeof(_Up));
1871 template <class _BidirectionalIterator1, class _BidirectionalIterator2>
1872 inline _LIBCPP_INLINE_VISIBILITY
1873 _BidirectionalIterator2
1874 copy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last,
1875 _BidirectionalIterator2 __result)
1877 return _VSTD::__copy_backward(__unwrap_iter(__first),
1878 __unwrap_iter(__last),
1879 __unwrap_iter(__result));
1884 template<class _InputIterator, class _OutputIterator, class _Predicate>
1885 inline _LIBCPP_INLINE_VISIBILITY
1887 copy_if(_InputIterator __first, _InputIterator __last,
1888 _OutputIterator __result, _Predicate __pred)
1890 for (; __first != __last; ++__first)
1892 if (__pred(*__first))
1894 *__result = *__first;
1903 template<class _InputIterator, class _Size, class _OutputIterator>
1904 inline _LIBCPP_INLINE_VISIBILITY
1907 __is_input_iterator<_InputIterator>::value &&
1908 !__is_random_access_iterator<_InputIterator>::value,
1911 copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result)
1913 typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize;
1914 _IntegralSize __n = __orig_n;
1917 *__result = *__first;
1919 for (--__n; __n > 0; --__n)
1922 *__result = *__first;
1929 template<class _InputIterator, class _Size, class _OutputIterator>
1930 inline _LIBCPP_INLINE_VISIBILITY
1933 __is_random_access_iterator<_InputIterator>::value,
1936 copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result)
1938 typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize;
1939 _IntegralSize __n = __orig_n;
1940 return _VSTD::copy(__first, __first + __n, __result);
1945 template <class _InputIterator, class _OutputIterator>
1946 inline _LIBCPP_INLINE_VISIBILITY
1948 __move(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
1950 for (; __first != __last; ++__first, (void) ++__result)
1951 *__result = _VSTD::move(*__first);
1955 template <class _Tp, class _Up>
1956 inline _LIBCPP_INLINE_VISIBILITY
1959 is_same<typename remove_const<_Tp>::type, _Up>::value &&
1960 is_trivially_copy_assignable<_Up>::value,
1963 __move(_Tp* __first, _Tp* __last, _Up* __result)
1965 const size_t __n = static_cast<size_t>(__last - __first);
1967 _VSTD::memmove(__result, __first, __n * sizeof(_Up));
1968 return __result + __n;
1971 template <class _InputIterator, class _OutputIterator>
1972 inline _LIBCPP_INLINE_VISIBILITY
1974 move(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
1976 return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result));
1981 template <class _InputIterator, class _OutputIterator>
1982 inline _LIBCPP_INLINE_VISIBILITY
1984 __move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
1986 while (__first != __last)
1987 *--__result = _VSTD::move(*--__last);
1991 template <class _Tp, class _Up>
1992 inline _LIBCPP_INLINE_VISIBILITY
1995 is_same<typename remove_const<_Tp>::type, _Up>::value &&
1996 is_trivially_copy_assignable<_Up>::value,
1999 __move_backward(_Tp* __first, _Tp* __last, _Up* __result)
2001 const size_t __n = static_cast<size_t>(__last - __first);
2005 _VSTD::memmove(__result, __first, __n * sizeof(_Up));
2010 template <class _BidirectionalIterator1, class _BidirectionalIterator2>
2011 inline _LIBCPP_INLINE_VISIBILITY
2012 _BidirectionalIterator2
2013 move_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last,
2014 _BidirectionalIterator2 __result)
2016 return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result));
2021 // moved to <type_traits> for better swap / noexcept support
2025 template <class _InputIterator, class _OutputIterator, class _UnaryOperation>
2026 inline _LIBCPP_INLINE_VISIBILITY
2028 transform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op)
2030 for (; __first != __last; ++__first, (void) ++__result)
2031 *__result = __op(*__first);
2035 template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation>
2036 inline _LIBCPP_INLINE_VISIBILITY
2038 transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
2039 _OutputIterator __result, _BinaryOperation __binary_op)
2041 for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result)
2042 *__result = __binary_op(*__first1, *__first2);
2048 template <class _ForwardIterator, class _Tp>
2049 inline _LIBCPP_INLINE_VISIBILITY
2051 replace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value)
2053 for (; __first != __last; ++__first)
2054 if (*__first == __old_value)
2055 *__first = __new_value;
2060 template <class _ForwardIterator, class _Predicate, class _Tp>
2061 inline _LIBCPP_INLINE_VISIBILITY
2063 replace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value)
2065 for (; __first != __last; ++__first)
2066 if (__pred(*__first))
2067 *__first = __new_value;
2072 template <class _InputIterator, class _OutputIterator, class _Tp>
2073 inline _LIBCPP_INLINE_VISIBILITY
2075 replace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
2076 const _Tp& __old_value, const _Tp& __new_value)
2078 for (; __first != __last; ++__first, (void) ++__result)
2079 if (*__first == __old_value)
2080 *__result = __new_value;
2082 *__result = *__first;
2088 template <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp>
2089 inline _LIBCPP_INLINE_VISIBILITY
2091 replace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
2092 _Predicate __pred, const _Tp& __new_value)
2094 for (; __first != __last; ++__first, (void) ++__result)
2095 if (__pred(*__first))
2096 *__result = __new_value;
2098 *__result = *__first;
2104 template <class _OutputIterator, class _Size, class _Tp>
2105 inline _LIBCPP_INLINE_VISIBILITY
2107 __fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_)
2109 for (; __n > 0; ++__first, (void) --__n)
2110 *__first = __value_;
2114 template <class _Tp, class _Size, class _Up>
2115 inline _LIBCPP_INLINE_VISIBILITY
2118 is_integral<_Tp>::value && sizeof(_Tp) == 1 &&
2119 !is_same<_Tp, bool>::value &&
2120 is_integral<_Up>::value && sizeof(_Up) == 1,
2123 __fill_n(_Tp* __first, _Size __n,_Up __value_)
2126 _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n));
2127 return __first + __n;
2130 template <class _OutputIterator, class _Size, class _Tp>
2131 inline _LIBCPP_INLINE_VISIBILITY
2133 fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_)
2135 return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_);
2140 template <class _ForwardIterator, class _Tp>
2141 inline _LIBCPP_INLINE_VISIBILITY
2143 __fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag)
2145 for (; __first != __last; ++__first)
2146 *__first = __value_;
2149 template <class _RandomAccessIterator, class _Tp>
2150 inline _LIBCPP_INLINE_VISIBILITY
2152 __fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag)
2154 _VSTD::fill_n(__first, __last - __first, __value_);
2157 template <class _ForwardIterator, class _Tp>
2158 inline _LIBCPP_INLINE_VISIBILITY
2160 fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
2162 _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category());
2167 template <class _ForwardIterator, class _Generator>
2168 inline _LIBCPP_INLINE_VISIBILITY
2170 generate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen)
2172 for (; __first != __last; ++__first)
2178 template <class _OutputIterator, class _Size, class _Generator>
2179 inline _LIBCPP_INLINE_VISIBILITY
2181 generate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen)
2183 typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize;
2184 _IntegralSize __n = __orig_n;
2185 for (; __n > 0; ++__first, (void) --__n)
2192 template <class _ForwardIterator, class _Tp>
2194 remove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
2196 __first = _VSTD::find(__first, __last, __value_);
2197 if (__first != __last)
2199 _ForwardIterator __i = __first;
2200 while (++__i != __last)
2202 if (!(*__i == __value_))
2204 *__first = _VSTD::move(*__i);
2214 template <class _ForwardIterator, class _Predicate>
2216 remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
2218 __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type>
2219 (__first, __last, __pred);
2220 if (__first != __last)
2222 _ForwardIterator __i = __first;
2223 while (++__i != __last)
2227 *__first = _VSTD::move(*__i);
2237 template <class _InputIterator, class _OutputIterator, class _Tp>
2238 inline _LIBCPP_INLINE_VISIBILITY
2240 remove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_)
2242 for (; __first != __last; ++__first)
2244 if (!(*__first == __value_))
2246 *__result = *__first;
2255 template <class _InputIterator, class _OutputIterator, class _Predicate>
2256 inline _LIBCPP_INLINE_VISIBILITY
2258 remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred)
2260 for (; __first != __last; ++__first)
2262 if (!__pred(*__first))
2264 *__result = *__first;
2273 template <class _ForwardIterator, class _BinaryPredicate>
2275 unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred)
2277 __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type>
2278 (__first, __last, __pred);
2279 if (__first != __last)
2283 _ForwardIterator __i = __first;
2284 for (++__i; ++__i != __last;)
2285 if (!__pred(*__first, *__i))
2286 *++__first = _VSTD::move(*__i);
2292 template <class _ForwardIterator>
2293 inline _LIBCPP_INLINE_VISIBILITY
2295 unique(_ForwardIterator __first, _ForwardIterator __last)
2297 typedef typename iterator_traits<_ForwardIterator>::value_type __v;
2298 return _VSTD::unique(__first, __last, __equal_to<__v>());
2303 template <class _BinaryPredicate, class _InputIterator, class _OutputIterator>
2305 __unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred,
2306 input_iterator_tag, output_iterator_tag)
2308 if (__first != __last)
2310 typename iterator_traits<_InputIterator>::value_type __t(*__first);
2313 while (++__first != __last)
2315 if (!__pred(__t, *__first))
2326 template <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator>
2328 __unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred,
2329 forward_iterator_tag, output_iterator_tag)
2331 if (__first != __last)
2333 _ForwardIterator __i = __first;
2336 while (++__first != __last)
2338 if (!__pred(*__i, *__first))
2340 *__result = *__first;
2349 template <class _BinaryPredicate, class _InputIterator, class _ForwardIterator>
2351 __unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred,
2352 input_iterator_tag, forward_iterator_tag)
2354 if (__first != __last)
2356 *__result = *__first;
2357 while (++__first != __last)
2358 if (!__pred(*__result, *__first))
2359 *++__result = *__first;
2365 template <class _InputIterator, class _OutputIterator, class _BinaryPredicate>
2366 inline _LIBCPP_INLINE_VISIBILITY
2368 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred)
2370 return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type>
2371 (__first, __last, __result, __pred,
2372 typename iterator_traits<_InputIterator>::iterator_category(),
2373 typename iterator_traits<_OutputIterator>::iterator_category());
2376 template <class _InputIterator, class _OutputIterator>
2377 inline _LIBCPP_INLINE_VISIBILITY
2379 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
2381 typedef typename iterator_traits<_InputIterator>::value_type __v;
2382 return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>());
2387 template <class _BidirectionalIterator>
2388 inline _LIBCPP_INLINE_VISIBILITY
2390 __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag)
2392 while (__first != __last)
2394 if (__first == --__last)
2396 _VSTD::iter_swap(__first, __last);
2401 template <class _RandomAccessIterator>
2402 inline _LIBCPP_INLINE_VISIBILITY
2404 __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag)
2406 if (__first != __last)
2407 for (; __first < --__last; ++__first)
2408 _VSTD::iter_swap(__first, __last);
2411 template <class _BidirectionalIterator>
2412 inline _LIBCPP_INLINE_VISIBILITY
2414 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
2416 _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category());
2421 template <class _BidirectionalIterator, class _OutputIterator>
2422 inline _LIBCPP_INLINE_VISIBILITY
2424 reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result)
2426 for (; __first != __last; ++__result)
2427 *__result = *--__last;
2433 template <class _ForwardIterator>
2435 __rotate_left(_ForwardIterator __first, _ForwardIterator __last)
2437 typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
2438 value_type __tmp = _VSTD::move(*__first);
2439 _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first);
2440 *__lm1 = _VSTD::move(__tmp);
2444 template <class _BidirectionalIterator>
2445 _BidirectionalIterator
2446 __rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last)
2448 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
2449 _BidirectionalIterator __lm1 = _VSTD::prev(__last);
2450 value_type __tmp = _VSTD::move(*__lm1);
2451 _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last);
2452 *__first = _VSTD::move(__tmp);
2456 template <class _ForwardIterator>
2458 __rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last)
2460 _ForwardIterator __i = __middle;
2463 swap(*__first, *__i);
2465 if (++__i == __last)
2467 if (__first == __middle)
2470 _ForwardIterator __r = __first;
2471 if (__first != __middle)
2476 swap(*__first, *__i);
2478 if (++__i == __last)
2480 if (__first == __middle)
2484 else if (__first == __middle)
2491 template<typename _Integral>
2492 inline _LIBCPP_INLINE_VISIBILITY
2494 __algo_gcd(_Integral __x, _Integral __y)
2498 _Integral __t = __x % __y;
2505 template<typename _RandomAccessIterator>
2506 _RandomAccessIterator
2507 __rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last)
2509 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
2510 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
2512 const difference_type __m1 = __middle - __first;
2513 const difference_type __m2 = __last - __middle;
2516 _VSTD::swap_ranges(__first, __middle, __middle);
2519 const difference_type __g = _VSTD::__algo_gcd(__m1, __m2);
2520 for (_RandomAccessIterator __p = __first + __g; __p != __first;)
2522 value_type __t(_VSTD::move(*--__p));
2523 _RandomAccessIterator __p1 = __p;
2524 _RandomAccessIterator __p2 = __p1 + __m1;
2527 *__p1 = _VSTD::move(*__p2);
2529 const difference_type __d = __last - __p2;
2533 __p2 = __first + (__m1 - __d);
2534 } while (__p2 != __p);
2535 *__p1 = _VSTD::move(__t);
2537 return __first + __m2;
2540 template <class _ForwardIterator>
2541 inline _LIBCPP_INLINE_VISIBILITY
2543 __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last,
2544 _VSTD::forward_iterator_tag)
2546 typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type;
2547 if (_VSTD::is_trivially_move_assignable<value_type>::value)
2549 if (_VSTD::next(__first) == __middle)
2550 return _VSTD::__rotate_left(__first, __last);
2552 return _VSTD::__rotate_forward(__first, __middle, __last);
2555 template <class _BidirectionalIterator>
2556 inline _LIBCPP_INLINE_VISIBILITY
2557 _BidirectionalIterator
2558 __rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last,
2559 _VSTD::bidirectional_iterator_tag)
2561 typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type;
2562 if (_VSTD::is_trivially_move_assignable<value_type>::value)
2564 if (_VSTD::next(__first) == __middle)
2565 return _VSTD::__rotate_left(__first, __last);
2566 if (_VSTD::next(__middle) == __last)
2567 return _VSTD::__rotate_right(__first, __last);
2569 return _VSTD::__rotate_forward(__first, __middle, __last);
2572 template <class _RandomAccessIterator>
2573 inline _LIBCPP_INLINE_VISIBILITY
2574 _RandomAccessIterator
2575 __rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
2576 _VSTD::random_access_iterator_tag)
2578 typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type;
2579 if (_VSTD::is_trivially_move_assignable<value_type>::value)
2581 if (_VSTD::next(__first) == __middle)
2582 return _VSTD::__rotate_left(__first, __last);
2583 if (_VSTD::next(__middle) == __last)
2584 return _VSTD::__rotate_right(__first, __last);
2585 return _VSTD::__rotate_gcd(__first, __middle, __last);
2587 return _VSTD::__rotate_forward(__first, __middle, __last);
2590 template <class _ForwardIterator>
2591 inline _LIBCPP_INLINE_VISIBILITY
2593 rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last)
2595 if (__first == __middle)
2597 if (__middle == __last)
2599 return _VSTD::__rotate(__first, __middle, __last,
2600 typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category());
2605 template <class _ForwardIterator, class _OutputIterator>
2606 inline _LIBCPP_INLINE_VISIBILITY
2608 rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result)
2610 return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result));
2615 template <class _ForwardIterator, class _Compare>
2616 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2618 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2620 if (__first != __last)
2622 _ForwardIterator __i = __first;
2623 while (++__i != __last)
2624 if (__comp(*__i, *__first))
2630 template <class _ForwardIterator>
2631 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2633 min_element(_ForwardIterator __first, _ForwardIterator __last)
2635 return _VSTD::min_element(__first, __last,
2636 __less<typename iterator_traits<_ForwardIterator>::value_type>());
2641 template <class _Tp, class _Compare>
2642 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2644 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2646 return __comp(__b, __a) ? __b : __a;
2649 template <class _Tp>
2650 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2652 min(const _Tp& __a, const _Tp& __b)
2654 return _VSTD::min(__a, __b, __less<_Tp>());
2657 #ifndef _LIBCPP_CXX03_LANG
2659 template<class _Tp, class _Compare>
2660 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2662 min(initializer_list<_Tp> __t, _Compare __comp)
2664 return *_VSTD::min_element(__t.begin(), __t.end(), __comp);
2668 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2670 min(initializer_list<_Tp> __t)
2672 return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>());
2675 #endif // _LIBCPP_CXX03_LANG
2679 template <class _ForwardIterator, class _Compare>
2680 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2682 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2684 if (__first != __last)
2686 _ForwardIterator __i = __first;
2687 while (++__i != __last)
2688 if (__comp(*__first, *__i))
2695 template <class _ForwardIterator>
2696 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2698 max_element(_ForwardIterator __first, _ForwardIterator __last)
2700 return _VSTD::max_element(__first, __last,
2701 __less<typename iterator_traits<_ForwardIterator>::value_type>());
2706 template <class _Tp, class _Compare>
2707 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2709 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
2711 return __comp(__a, __b) ? __b : __a;
2714 template <class _Tp>
2715 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2717 max(const _Tp& __a, const _Tp& __b)
2719 return _VSTD::max(__a, __b, __less<_Tp>());
2722 #ifndef _LIBCPP_CXX03_LANG
2724 template<class _Tp, class _Compare>
2725 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2727 max(initializer_list<_Tp> __t, _Compare __comp)
2729 return *_VSTD::max_element(__t.begin(), __t.end(), __comp);
2733 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2735 max(initializer_list<_Tp> __t)
2737 return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>());
2740 #endif // _LIBCPP_CXX03_LANG
2742 #if _LIBCPP_STD_VER > 14
2744 template<class _Tp, class _Compare>
2745 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
2747 clamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp)
2749 _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp");
2750 return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v;
2755 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR
2757 clamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi)
2759 return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>());
2765 template <class _ForwardIterator, class _Compare>
2766 _LIBCPP_CONSTEXPR_AFTER_CXX11
2767 std::pair<_ForwardIterator, _ForwardIterator>
2768 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2770 std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first);
2771 if (__first != __last)
2773 if (++__first != __last)
2775 if (__comp(*__first, *__result.first))
2776 __result.first = __first;
2778 __result.second = __first;
2779 while (++__first != __last)
2781 _ForwardIterator __i = __first;
2782 if (++__first == __last)
2784 if (__comp(*__i, *__result.first))
2785 __result.first = __i;
2786 else if (!__comp(*__i, *__result.second))
2787 __result.second = __i;
2792 if (__comp(*__first, *__i))
2794 if (__comp(*__first, *__result.first))
2795 __result.first = __first;
2796 if (!__comp(*__i, *__result.second))
2797 __result.second = __i;
2801 if (__comp(*__i, *__result.first))
2802 __result.first = __i;
2803 if (!__comp(*__first, *__result.second))
2804 __result.second = __first;
2813 template <class _ForwardIterator>
2814 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2815 std::pair<_ForwardIterator, _ForwardIterator>
2816 minmax_element(_ForwardIterator __first, _ForwardIterator __last)
2818 return _VSTD::minmax_element(__first, __last,
2819 __less<typename iterator_traits<_ForwardIterator>::value_type>());
2824 template<class _Tp, class _Compare>
2825 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2826 pair<const _Tp&, const _Tp&>
2827 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp)
2829 return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) :
2830 pair<const _Tp&, const _Tp&>(__a, __b);
2834 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2835 pair<const _Tp&, const _Tp&>
2836 minmax(const _Tp& __a, const _Tp& __b)
2838 return _VSTD::minmax(__a, __b, __less<_Tp>());
2841 #ifndef _LIBCPP_CXX03_LANG
2843 template<class _Tp, class _Compare>
2844 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2846 minmax(initializer_list<_Tp> __t, _Compare __comp)
2848 typedef typename initializer_list<_Tp>::const_iterator _Iter;
2849 _Iter __first = __t.begin();
2850 _Iter __last = __t.end();
2851 std::pair<_Tp, _Tp> __result(*__first, *__first);
2854 if (__t.size() % 2 == 0)
2856 if (__comp(*__first, __result.first))
2857 __result.first = *__first;
2859 __result.second = *__first;
2863 while (__first != __last)
2865 _Tp __prev = *__first++;
2866 if (__comp(*__first, __prev)) {
2867 if ( __comp(*__first, __result.first)) __result.first = *__first;
2868 if (!__comp(__prev, __result.second)) __result.second = __prev;
2871 if ( __comp(__prev, __result.first)) __result.first = __prev;
2872 if (!__comp(*__first, __result.second)) __result.second = *__first;
2881 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11
2883 minmax(initializer_list<_Tp> __t)
2885 return _VSTD::minmax(__t, __less<_Tp>());
2888 #endif // _LIBCPP_CXX03_LANG
2892 // __independent_bits_engine
2894 template <unsigned long long _Xp, size_t _Rp>
2897 static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp
2898 : __log2_imp<_Xp, _Rp - 1>::value;
2901 template <unsigned long long _Xp>
2902 struct __log2_imp<_Xp, 0>
2904 static const size_t value = 0;
2907 template <size_t _Rp>
2908 struct __log2_imp<0, _Rp>
2910 static const size_t value = _Rp + 1;
2913 template <class _UIntType, _UIntType _Xp>
2916 static const size_t value = __log2_imp<_Xp,
2917 sizeof(_UIntType) * __CHAR_BIT__ - 1>::value;
2920 template<class _Engine, class _UIntType>
2921 class __independent_bits_engine
2925 typedef _UIntType result_type;
2928 typedef typename _Engine::result_type _Engine_result_type;
2929 typedef typename conditional
2931 sizeof(_Engine_result_type) <= sizeof(result_type),
2934 >::type _Working_result_type;
2941 _Working_result_type __y0_;
2942 _Working_result_type __y1_;
2943 _Engine_result_type __mask0_;
2944 _Engine_result_type __mask1_;
2946 #ifdef _LIBCPP_CXX03_LANG
2947 static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min
2948 + _Working_result_type(1);
2950 static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min()
2951 + _Working_result_type(1);
2953 static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value;
2954 static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits;
2955 static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits;
2958 // constructors and seeding functions
2959 __independent_bits_engine(_Engine& __e, size_t __w);
2961 // generating functions
2962 result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());}
2965 result_type __eval(false_type);
2966 result_type __eval(true_type);
2969 template<class _Engine, class _UIntType>
2970 __independent_bits_engine<_Engine, _UIntType>
2971 ::__independent_bits_engine(_Engine& __e, size_t __w)
2975 __n_ = __w_ / __m + (__w_ % __m != 0);
2976 __w0_ = __w_ / __n_;
2979 else if (__w0_ < _WDt)
2980 __y0_ = (_Rp >> __w0_) << __w0_;
2983 if (_Rp - __y0_ > __y0_ / __n_)
2986 __w0_ = __w_ / __n_;
2988 __y0_ = (_Rp >> __w0_) << __w0_;
2992 __n0_ = __n_ - __w_ % __n_;
2993 if (__w0_ < _WDt - 1)
2994 __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1);
2997 __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) :
2998 _Engine_result_type(0);
2999 __mask1_ = __w0_ < _EDt - 1 ?
3000 _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) :
3001 _Engine_result_type(~0);
3004 template<class _Engine, class _UIntType>
3007 __independent_bits_engine<_Engine, _UIntType>::__eval(false_type)
3009 return static_cast<result_type>(__e_() & __mask0_);
3012 template<class _Engine, class _UIntType>
3014 __independent_bits_engine<_Engine, _UIntType>::__eval(true_type)
3016 result_type _Sp = 0;
3017 for (size_t __k = 0; __k < __n0_; ++__k)
3019 _Engine_result_type __u;
3022 __u = __e_() - _Engine::min();
3023 } while (__u >= __y0_);
3028 _Sp += __u & __mask0_;
3030 for (size_t __k = __n0_; __k < __n_; ++__k)
3032 _Engine_result_type __u;
3035 __u = __e_() - _Engine::min();
3036 } while (__u >= __y1_);
3037 if (__w0_ < _WDt - 1)
3041 _Sp += __u & __mask1_;
3046 // uniform_int_distribution
3048 template<class _IntType = int>
3049 class uniform_int_distribution
3053 typedef _IntType result_type;
3060 typedef uniform_int_distribution distribution_type;
3062 explicit param_type(result_type __a = 0,
3063 result_type __b = numeric_limits<result_type>::max())
3064 : __a_(__a), __b_(__b) {}
3066 result_type a() const {return __a_;}
3067 result_type b() const {return __b_;}
3069 friend bool operator==(const param_type& __x, const param_type& __y)
3070 {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;}
3071 friend bool operator!=(const param_type& __x, const param_type& __y)
3072 {return !(__x == __y);}
3079 // constructors and reset functions
3080 explicit uniform_int_distribution(result_type __a = 0,
3081 result_type __b = numeric_limits<result_type>::max())
3082 : __p_(param_type(__a, __b)) {}
3083 explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {}
3086 // generating functions
3087 template<class _URNG> result_type operator()(_URNG& __g)
3088 {return (*this)(__g, __p_);}
3089 template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p);
3091 // property functions
3092 result_type a() const {return __p_.a();}
3093 result_type b() const {return __p_.b();}
3095 param_type param() const {return __p_;}
3096 void param(const param_type& __p) {__p_ = __p;}
3098 result_type min() const {return a();}
3099 result_type max() const {return b();}
3101 friend bool operator==(const uniform_int_distribution& __x,
3102 const uniform_int_distribution& __y)
3103 {return __x.__p_ == __y.__p_;}
3104 friend bool operator!=(const uniform_int_distribution& __x,
3105 const uniform_int_distribution& __y)
3106 {return !(__x == __y);}
3109 template<class _IntType>
3110 template<class _URNG>
3111 typename uniform_int_distribution<_IntType>::result_type
3112 uniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p)
3114 typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t),
3115 uint32_t, uint64_t>::type _UIntType;
3116 const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1);
3119 const size_t _Dt = numeric_limits<_UIntType>::digits;
3120 typedef __independent_bits_engine<_URNG, _UIntType> _Eng;
3122 return static_cast<result_type>(_Eng(__g, _Dt)());
3123 size_t __w = _Dt - __clz(_Rp) - 1;
3124 if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0)
3131 } while (__u >= _Rp);
3132 return static_cast<result_type>(__u + __p.a());
3135 #if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \
3136 || defined(_LIBCPP_BUILDING_LIBRARY)
3137 class _LIBCPP_TYPE_VIS __rs_default;
3139 _LIBCPP_FUNC_VIS __rs_default __rs_get();
3141 class _LIBCPP_TYPE_VIS __rs_default
3143 static unsigned __c_;
3147 typedef uint_fast32_t result_type;
3149 static const result_type _Min = 0;
3150 static const result_type _Max = 0xFFFFFFFF;
3152 __rs_default(const __rs_default&);
3155 result_type operator()();
3157 static _LIBCPP_CONSTEXPR result_type min() {return _Min;}
3158 static _LIBCPP_CONSTEXPR result_type max() {return _Max;}
3160 friend _LIBCPP_FUNC_VIS __rs_default __rs_get();
3163 _LIBCPP_FUNC_VIS __rs_default __rs_get();
3165 template <class _RandomAccessIterator>
3167 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
3169 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
3170 typedef uniform_int_distribution<ptrdiff_t> _Dp;
3171 typedef typename _Dp::param_type _Pp;
3172 difference_type __d = __last - __first;
3176 __rs_default __g = __rs_get();
3177 for (--__last, --__d; __first < __last; ++__first, --__d)
3179 difference_type __i = __uid(__g, _Pp(0, __d));
3180 if (__i != difference_type(0))
3181 swap(*__first, *(__first + __i));
3186 template <class _RandomAccessIterator, class _RandomNumberGenerator>
3188 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
3189 #ifndef _LIBCPP_CXX03_LANG
3190 _RandomNumberGenerator&& __rand)
3192 _RandomNumberGenerator& __rand)
3195 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
3196 difference_type __d = __last - __first;
3199 for (--__last; __first < __last; ++__first, --__d)
3201 difference_type __i = __rand(__d);
3202 swap(*__first, *(__first + __i));
3208 template <class _PopulationIterator, class _SampleIterator, class _Distance,
3209 class _UniformRandomNumberGenerator>
3210 _LIBCPP_INLINE_VISIBILITY
3211 _SampleIterator __sample(_PopulationIterator __first,
3212 _PopulationIterator __last, _SampleIterator __output,
3214 _UniformRandomNumberGenerator & __g,
3215 input_iterator_tag) {
3218 for (; __first != __last && __k < __n; ++__first, (void)++__k)
3219 __output[__k] = *__first;
3220 _Distance __sz = __k;
3221 for (; __first != __last; ++__first, (void)++__k) {
3222 _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g);
3224 __output[__r] = *__first;
3226 return __output + _VSTD::min(__n, __k);
3229 template <class _PopulationIterator, class _SampleIterator, class _Distance,
3230 class _UniformRandomNumberGenerator>
3231 _LIBCPP_INLINE_VISIBILITY
3232 _SampleIterator __sample(_PopulationIterator __first,
3233 _PopulationIterator __last, _SampleIterator __output,
3235 _UniformRandomNumberGenerator& __g,
3236 forward_iterator_tag) {
3237 _Distance __unsampled_sz = _VSTD::distance(__first, __last);
3238 for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) {
3240 _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g);
3242 *__output++ = *__first;
3249 template <class _PopulationIterator, class _SampleIterator, class _Distance,
3250 class _UniformRandomNumberGenerator>
3251 _LIBCPP_INLINE_VISIBILITY
3252 _SampleIterator __sample(_PopulationIterator __first,
3253 _PopulationIterator __last, _SampleIterator __output,
3254 _Distance __n, _UniformRandomNumberGenerator& __g) {
3255 typedef typename iterator_traits<_PopulationIterator>::iterator_category
3257 typedef typename iterator_traits<_PopulationIterator>::difference_type
3259 static_assert(__is_forward_iterator<_PopulationIterator>::value ||
3260 __is_random_access_iterator<_SampleIterator>::value,
3261 "SampleIterator must meet the requirements of RandomAccessIterator");
3262 typedef typename common_type<_Distance, _Difference>::type _CommonType;
3263 _LIBCPP_ASSERT(__n >= 0, "N must be a positive number.");
3264 return _VSTD::__sample(
3265 __first, __last, __output, _CommonType(__n),
3266 __g, _PopCategory());
3269 #if _LIBCPP_STD_VER > 14
3270 template <class _PopulationIterator, class _SampleIterator, class _Distance,
3271 class _UniformRandomNumberGenerator>
3272 inline _LIBCPP_INLINE_VISIBILITY
3273 _SampleIterator sample(_PopulationIterator __first,
3274 _PopulationIterator __last, _SampleIterator __output,
3275 _Distance __n, _UniformRandomNumberGenerator&& __g) {
3276 return _VSTD::__sample(__first, __last, __output, __n, __g);
3278 #endif // _LIBCPP_STD_VER > 14
3280 template<class _RandomAccessIterator, class _UniformRandomNumberGenerator>
3281 void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
3282 #ifndef _LIBCPP_CXX03_LANG
3283 _UniformRandomNumberGenerator&& __g)
3285 _UniformRandomNumberGenerator& __g)
3288 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
3289 typedef uniform_int_distribution<ptrdiff_t> _Dp;
3290 typedef typename _Dp::param_type _Pp;
3291 difference_type __d = __last - __first;
3295 for (--__last, --__d; __first < __last; ++__first, --__d)
3297 difference_type __i = __uid(__g, _Pp(0, __d));
3298 if (__i != difference_type(0))
3299 swap(*__first, *(__first + __i));
3304 template <class _InputIterator, class _Predicate>
3306 is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred)
3308 for (; __first != __last; ++__first)
3309 if (!__pred(*__first))
3311 if ( __first == __last )
3314 for (; __first != __last; ++__first)
3315 if (__pred(*__first))
3322 template <class _Predicate, class _ForwardIterator>
3324 __partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag)
3328 if (__first == __last)
3330 if (!__pred(*__first))
3334 for (_ForwardIterator __p = __first; ++__p != __last;)
3338 swap(*__first, *__p);
3345 template <class _Predicate, class _BidirectionalIterator>
3346 _BidirectionalIterator
3347 __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred,
3348 bidirectional_iterator_tag)
3354 if (__first == __last)
3356 if (!__pred(*__first))
3362 if (__first == --__last)
3364 } while (!__pred(*__last));
3365 swap(*__first, *__last);
3370 template <class _ForwardIterator, class _Predicate>
3371 inline _LIBCPP_INLINE_VISIBILITY
3373 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
3375 return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type>
3376 (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category());
3381 template <class _InputIterator, class _OutputIterator1,
3382 class _OutputIterator2, class _Predicate>
3383 pair<_OutputIterator1, _OutputIterator2>
3384 partition_copy(_InputIterator __first, _InputIterator __last,
3385 _OutputIterator1 __out_true, _OutputIterator2 __out_false,
3388 for (; __first != __last; ++__first)
3390 if (__pred(*__first))
3392 *__out_true = *__first;
3397 *__out_false = *__first;
3401 return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false);
3406 template<class _ForwardIterator, class _Predicate>
3408 partition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
3410 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
3411 difference_type __len = _VSTD::distance(__first, __last);
3414 difference_type __l2 = __len / 2;
3415 _ForwardIterator __m = __first;
3416 _VSTD::advance(__m, __l2);
3430 template <class _Predicate, class _ForwardIterator, class _Distance, class _Pair>
3432 __stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred,
3433 _Distance __len, _Pair __p, forward_iterator_tag __fit)
3435 // *__first is known to be false
3441 _ForwardIterator __m = __first;
3444 swap(*__first, *__m);
3449 if (__len <= __p.second)
3450 { // The buffer is big enough to use
3451 typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
3452 __destruct_n __d(0);
3453 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
3454 // Move the falses into the temporary buffer, and the trues to the front of the line
3455 // Update __first to always point to the end of the trues
3456 value_type* __t = __p.first;
3457 ::new(__t) value_type(_VSTD::move(*__first));
3458 __d.__incr((value_type*)0);
3460 _ForwardIterator __i = __first;
3461 while (++__i != __last)
3465 *__first = _VSTD::move(*__i);
3470 ::new(__t) value_type(_VSTD::move(*__i));
3471 __d.__incr((value_type*)0);
3475 // All trues now at start of range, all falses in buffer
3476 // Move falses back into range, but don't mess up __first which points to first false
3478 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i)
3479 *__i = _VSTD::move(*__t2);
3480 // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
3483 // Else not enough buffer, do in place
3485 _ForwardIterator __m = __first;
3486 _Distance __len2 = __len / 2; // __len2 >= 2
3487 _VSTD::advance(__m, __len2);
3488 // recurse on [__first, __m), *__first know to be false
3489 // F?????????????????
3491 typedef typename add_lvalue_reference<_Predicate>::type _PredRef;
3492 _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit);
3493 // TTTFFFFF??????????
3495 // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true
3496 _ForwardIterator __m1 = __m;
3497 _ForwardIterator __second_false = __last;
3498 _Distance __len_half = __len - __len2;
3499 while (__pred(*__m1))
3501 if (++__m1 == __last)
3502 goto __second_half_done;
3505 // TTTFFFFFTTTF??????
3507 __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit);
3509 // TTTFFFFFTTTTTFFFFF
3511 return _VSTD::rotate(__first_false, __m, __second_false);
3512 // TTTTTTTTFFFFFFFFFF
3516 struct __return_temporary_buffer
3518 template <class _Tp>
3519 _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);}
3522 template <class _Predicate, class _ForwardIterator>
3524 __stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred,
3525 forward_iterator_tag)
3527 const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment
3528 // Either prove all true and return __first or point to first false
3531 if (__first == __last)
3533 if (!__pred(*__first))
3537 // We now have a reduced range [__first, __last)
3538 // *__first is known to be false
3539 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
3540 typedef typename iterator_traits<_ForwardIterator>::value_type value_type;
3541 difference_type __len = _VSTD::distance(__first, __last);
3542 pair<value_type*, ptrdiff_t> __p(0, 0);
3543 unique_ptr<value_type, __return_temporary_buffer> __h;
3544 if (__len >= __alloc_limit)
3546 __p = _VSTD::get_temporary_buffer<value_type>(__len);
3547 __h.reset(__p.first);
3549 return __stable_partition<typename add_lvalue_reference<_Predicate>::type>
3550 (__first, __last, __pred, __len, __p, forward_iterator_tag());
3553 template <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair>
3554 _BidirectionalIterator
3555 __stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred,
3556 _Distance __len, _Pair __p, bidirectional_iterator_tag __bit)
3558 // *__first is known to be false
3559 // *__last is known to be true
3563 swap(*__first, *__last);
3568 _BidirectionalIterator __m = __first;
3571 swap(*__first, *__m);
3572 swap(*__m, *__last);
3575 swap(*__m, *__last);
3576 swap(*__first, *__m);
3579 if (__len <= __p.second)
3580 { // The buffer is big enough to use
3581 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
3582 __destruct_n __d(0);
3583 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
3584 // Move the falses into the temporary buffer, and the trues to the front of the line
3585 // Update __first to always point to the end of the trues
3586 value_type* __t = __p.first;
3587 ::new(__t) value_type(_VSTD::move(*__first));
3588 __d.__incr((value_type*)0);
3590 _BidirectionalIterator __i = __first;
3591 while (++__i != __last)
3595 *__first = _VSTD::move(*__i);
3600 ::new(__t) value_type(_VSTD::move(*__i));
3601 __d.__incr((value_type*)0);
3605 // move *__last, known to be true
3606 *__first = _VSTD::move(*__i);
3608 // All trues now at start of range, all falses in buffer
3609 // Move falses back into range, but don't mess up __first which points to first false
3610 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i)
3611 *__i = _VSTD::move(*__t2);
3612 // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
3615 // Else not enough buffer, do in place
3617 _BidirectionalIterator __m = __first;
3618 _Distance __len2 = __len / 2; // __len2 >= 2
3619 _VSTD::advance(__m, __len2);
3620 // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false
3621 // F????????????????T
3623 _BidirectionalIterator __m1 = __m;
3624 _BidirectionalIterator __first_false = __first;
3625 _Distance __len_half = __len2;
3626 while (!__pred(*--__m1))
3628 if (__m1 == __first)
3629 goto __first_half_done;
3632 // F???TFFF?????????T
3634 typedef typename add_lvalue_reference<_Predicate>::type _PredRef;
3635 __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit);
3637 // TTTFFFFF?????????T
3639 // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true
3641 _BidirectionalIterator __second_false = __last;
3643 __len_half = __len - __len2;
3644 while (__pred(*__m1))
3646 if (++__m1 == __last)
3647 goto __second_half_done;
3650 // TTTFFFFFTTTF?????T
3652 __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit);
3654 // TTTFFFFFTTTTTFFFFF
3656 return _VSTD::rotate(__first_false, __m, __second_false);
3657 // TTTTTTTTFFFFFFFFFF
3661 template <class _Predicate, class _BidirectionalIterator>
3662 _BidirectionalIterator
3663 __stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred,
3664 bidirectional_iterator_tag)
3666 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type;
3667 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
3668 const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment
3669 // Either prove all true and return __first or point to first false
3672 if (__first == __last)
3674 if (!__pred(*__first))
3678 // __first points to first false, everything prior to __first is already set.
3679 // Either prove [__first, __last) is all false and return __first, or point __last to last true
3682 if (__first == --__last)
3684 } while (!__pred(*__last));
3685 // We now have a reduced range [__first, __last]
3686 // *__first is known to be false
3687 // *__last is known to be true
3689 difference_type __len = _VSTD::distance(__first, __last) + 1;
3690 pair<value_type*, ptrdiff_t> __p(0, 0);
3691 unique_ptr<value_type, __return_temporary_buffer> __h;
3692 if (__len >= __alloc_limit)
3694 __p = _VSTD::get_temporary_buffer<value_type>(__len);
3695 __h.reset(__p.first);
3697 return __stable_partition<typename add_lvalue_reference<_Predicate>::type>
3698 (__first, __last, __pred, __len, __p, bidirectional_iterator_tag());
3701 template <class _ForwardIterator, class _Predicate>
3702 inline _LIBCPP_INLINE_VISIBILITY
3704 stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
3706 return __stable_partition<typename add_lvalue_reference<_Predicate>::type>
3707 (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category());
3712 template <class _ForwardIterator, class _Compare>
3714 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3716 if (__first != __last)
3718 _ForwardIterator __i = __first;
3719 while (++__i != __last)
3721 if (__comp(*__i, *__first))
3729 template<class _ForwardIterator>
3730 inline _LIBCPP_INLINE_VISIBILITY
3732 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last)
3734 return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>());
3739 template <class _ForwardIterator, class _Compare>
3740 inline _LIBCPP_INLINE_VISIBILITY
3742 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3744 return _VSTD::is_sorted_until(__first, __last, __comp) == __last;
3747 template<class _ForwardIterator>
3748 inline _LIBCPP_INLINE_VISIBILITY
3750 is_sorted(_ForwardIterator __first, _ForwardIterator __last)
3752 return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>());
3757 // stable, 2-3 compares, 0-2 swaps
3759 template <class _Compare, class _ForwardIterator>
3761 __sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c)
3764 if (!__c(*__y, *__x)) // if x <= y
3766 if (!__c(*__z, *__y)) // if y <= z
3767 return __r; // x <= y && y <= z
3769 swap(*__y, *__z); // x <= z && y < z
3771 if (__c(*__y, *__x)) // if x > y
3773 swap(*__x, *__y); // x < y && y <= z
3776 return __r; // x <= y && y < z
3778 if (__c(*__z, *__y)) // x > y, if y > z
3780 swap(*__x, *__z); // x < y && y < z
3784 swap(*__x, *__y); // x > y && y <= z
3785 __r = 1; // x < y && x <= z
3786 if (__c(*__z, *__y)) // if y > z
3788 swap(*__y, *__z); // x <= y && y < z
3792 } // x <= y && y <= z
3794 // stable, 3-6 compares, 0-5 swaps
3796 template <class _Compare, class _ForwardIterator>
3798 __sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3,
3799 _ForwardIterator __x4, _Compare __c)
3801 unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c);
3802 if (__c(*__x4, *__x3))
3806 if (__c(*__x3, *__x2))
3810 if (__c(*__x2, *__x1))
3820 // stable, 4-10 compares, 0-9 swaps
3822 template <class _Compare, class _ForwardIterator>
3824 __sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3,
3825 _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c)
3827 unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c);
3828 if (__c(*__x5, *__x4))
3832 if (__c(*__x4, *__x3))
3836 if (__c(*__x3, *__x2))
3840 if (__c(*__x2, *__x1))
3852 template <class _Compare, class _BirdirectionalIterator>
3854 __selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3856 _BirdirectionalIterator __lm1 = __last;
3857 for (--__lm1; __first != __lm1; ++__first)
3859 _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator,
3860 typename add_lvalue_reference<_Compare>::type>
3861 (__first, __last, __comp);
3863 swap(*__first, *__i);
3867 template <class _Compare, class _BirdirectionalIterator>
3869 __insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3871 typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type;
3872 if (__first != __last)
3874 _BirdirectionalIterator __i = __first;
3875 for (++__i; __i != __last; ++__i)
3877 _BirdirectionalIterator __j = __i;
3878 value_type __t(_VSTD::move(*__j));
3879 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3880 *__j = _VSTD::move(*__k);
3881 *__j = _VSTD::move(__t);
3886 template <class _Compare, class _RandomAccessIterator>
3888 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3890 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
3891 _RandomAccessIterator __j = __first+2;
3892 __sort3<_Compare>(__first, __first+1, __j, __comp);
3893 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3895 if (__comp(*__i, *__j))
3897 value_type __t(_VSTD::move(*__i));
3898 _RandomAccessIterator __k = __j;
3902 *__j = _VSTD::move(*__k);
3904 } while (__j != __first && __comp(__t, *--__k));
3905 *__j = _VSTD::move(__t);
3911 template <class _Compare, class _RandomAccessIterator>
3913 __insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3915 switch (__last - __first)
3921 if (__comp(*--__last, *__first))
3922 swap(*__first, *__last);
3925 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
3928 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
3931 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
3934 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
3935 _RandomAccessIterator __j = __first+2;
3936 __sort3<_Compare>(__first, __first+1, __j, __comp);
3937 const unsigned __limit = 8;
3938 unsigned __count = 0;
3939 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3941 if (__comp(*__i, *__j))
3943 value_type __t(_VSTD::move(*__i));
3944 _RandomAccessIterator __k = __j;
3948 *__j = _VSTD::move(*__k);
3950 } while (__j != __first && __comp(__t, *--__k));
3951 *__j = _VSTD::move(__t);
3952 if (++__count == __limit)
3953 return ++__i == __last;
3960 template <class _Compare, class _BirdirectionalIterator>
3962 __insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1,
3963 typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp)
3965 typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type;
3966 if (__first1 != __last1)
3968 __destruct_n __d(0);
3969 unique_ptr<value_type, __destruct_n&> __h(__first2, __d);
3970 value_type* __last2 = __first2;
3971 ::new(__last2) value_type(_VSTD::move(*__first1));
3972 __d.__incr((value_type*)0);
3973 for (++__last2; ++__first1 != __last1; ++__last2)
3975 value_type* __j2 = __last2;
3976 value_type* __i2 = __j2;
3977 if (__comp(*__first1, *--__i2))
3979 ::new(__j2) value_type(_VSTD::move(*__i2));
3980 __d.__incr((value_type*)0);
3981 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
3982 *__j2 = _VSTD::move(*__i2);
3983 *__j2 = _VSTD::move(*__first1);
3987 ::new(__j2) value_type(_VSTD::move(*__first1));
3988 __d.__incr((value_type*)0);
3995 template <class _Compare, class _RandomAccessIterator>
3997 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3999 // _Compare is known to be a reference type
4000 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
4001 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
4002 const difference_type __limit = is_trivially_copy_constructible<value_type>::value &&
4003 is_trivially_copy_assignable<value_type>::value ? 30 : 6;
4007 difference_type __len = __last - __first;
4014 if (__comp(*--__last, *__first))
4015 swap(*__first, *__last);
4018 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
4021 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
4024 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
4027 if (__len <= __limit)
4029 _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp);
4033 _RandomAccessIterator __m = __first;
4034 _RandomAccessIterator __lm1 = __last;
4038 difference_type __delta;
4044 __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp);
4050 __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp);
4054 // partition [__first, __m) < *__m and *__m <= [__m, __last)
4055 // (this inhibits tossing elements equivalent to __m around unnecessarily)
4056 _RandomAccessIterator __i = __first;
4057 _RandomAccessIterator __j = __lm1;
4058 // j points beyond range to be tested, *__m is known to be <= *__lm1
4059 // The search going up is known to be guarded but the search coming down isn't.
4060 // Prime the downward search with a guard.
4061 if (!__comp(*__i, *__m)) // if *__first == *__m
4063 // *__first == *__m, *__first doesn't go in first part
4064 // manually guard downward moving __j against __i
4069 // *__first == *__m, *__m <= all other elements
4070 // Parition instead into [__first, __i) == *__first and *__first < [__i, __last)
4071 ++__i; // __first + 1
4073 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
4078 return; // [__first, __last) all equivalent elements
4079 if (__comp(*__first, *__i))
4089 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
4094 while (!__comp(*__first, *__i))
4096 while (__comp(*__first, *--__j))
4104 // [__first, __i) == *__first and *__first < [__i, __last)
4105 // The first part is sorted, sort the secod part
4106 // _VSTD::__sort<_Compare>(__i, __last, __comp);
4110 if (__comp(*__j, *__m))
4114 break; // found guard for downward moving __j, now use unguarded partition
4118 // It is known that *__i < *__m
4120 // j points beyond range to be tested, *__m is known to be <= *__lm1
4121 // if not yet partitioned...
4124 // known that *(__i - 1) < *__m
4125 // known that __i <= __m
4128 // __m still guards upward moving __i
4129 while (__comp(*__i, *__m))
4131 // It is now known that a guard exists for downward moving __j
4132 while (!__comp(*--__j, *__m))
4138 // It is known that __m != __j
4139 // If __m just moved, follow it
4145 // [__first, __i) < *__m and *__m <= [__i, __last)
4146 if (__i != __m && __comp(*__m, *__i))
4151 // [__first, __i) < *__i and *__i <= [__i+1, __last)
4152 // If we were given a perfect partition, see if insertion sort is quick...
4155 bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp);
4156 if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp))
4172 // sort smaller range with recursive call and larger with tail recursion elimination
4173 if (__i - __first < __last - __i)
4175 _VSTD::__sort<_Compare>(__first, __i, __comp);
4176 // _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4181 _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4182 // _VSTD::__sort<_Compare>(__first, __i, __comp);
4188 // This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare
4189 template <class _RandomAccessIterator, class _Compare>
4190 inline _LIBCPP_INLINE_VISIBILITY
4192 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4194 #ifdef _LIBCPP_DEBUG
4195 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
4196 __debug_less<_Compare> __c(__comp);
4197 __sort<_Comp_ref>(__first, __last, __c);
4198 #else // _LIBCPP_DEBUG
4199 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4200 __sort<_Comp_ref>(__first, __last, __comp);
4201 #endif // _LIBCPP_DEBUG
4204 template <class _RandomAccessIterator>
4205 inline _LIBCPP_INLINE_VISIBILITY
4207 sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
4209 _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
4212 template <class _Tp>
4213 inline _LIBCPP_INLINE_VISIBILITY
4215 sort(_Tp** __first, _Tp** __last)
4217 _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>());
4220 template <class _Tp>
4221 inline _LIBCPP_INLINE_VISIBILITY
4223 sort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last)
4225 _VSTD::sort(__first.base(), __last.base());
4228 template <class _Tp, class _Compare>
4229 inline _LIBCPP_INLINE_VISIBILITY
4231 sort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp)
4233 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4234 _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp);
4238 #pragma warning( push )
4239 #pragma warning( disable: 4231)
4240 #endif // _LIBCPP_MSVC
4241 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&))
4242 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&))
4243 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&))
4244 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&))
4245 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&))
4246 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&))
4247 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&))
4248 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&))
4249 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&))
4250 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&))
4251 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&))
4252 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&))
4253 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&))
4254 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&))
4255 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&))
4257 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&))
4258 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&))
4259 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&))
4260 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&))
4261 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&))
4262 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&))
4263 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&))
4264 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&))
4265 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&))
4266 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&))
4267 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&))
4268 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&))
4269 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&))
4270 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&))
4271 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&))
4273 _LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&))
4275 #pragma warning( pop )
4276 #endif // _LIBCPP_MSVC
4280 template <class _Compare, class _ForwardIterator, class _Tp>
4282 __lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4284 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
4285 difference_type __len = _VSTD::distance(__first, __last);
4288 difference_type __l2 = __len / 2;
4289 _ForwardIterator __m = __first;
4290 _VSTD::advance(__m, __l2);
4291 if (__comp(*__m, __value_))
4302 template <class _ForwardIterator, class _Tp, class _Compare>
4303 inline _LIBCPP_INLINE_VISIBILITY
4305 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4307 #ifdef _LIBCPP_DEBUG
4308 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
4309 __debug_less<_Compare> __c(__comp);
4310 return __lower_bound<_Comp_ref>(__first, __last, __value_, __c);
4311 #else // _LIBCPP_DEBUG
4312 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4313 return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp);
4314 #endif // _LIBCPP_DEBUG
4317 template <class _ForwardIterator, class _Tp>
4318 inline _LIBCPP_INLINE_VISIBILITY
4320 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
4322 return _VSTD::lower_bound(__first, __last, __value_,
4323 __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>());
4328 template <class _Compare, class _ForwardIterator, class _Tp>
4330 __upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4332 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
4333 difference_type __len = _VSTD::distance(__first, __last);
4336 difference_type __l2 = __len / 2;
4337 _ForwardIterator __m = __first;
4338 _VSTD::advance(__m, __l2);
4339 if (__comp(__value_, *__m))
4350 template <class _ForwardIterator, class _Tp, class _Compare>
4351 inline _LIBCPP_INLINE_VISIBILITY
4353 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4355 #ifdef _LIBCPP_DEBUG
4356 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
4357 __debug_less<_Compare> __c(__comp);
4358 return __upper_bound<_Comp_ref>(__first, __last, __value_, __c);
4359 #else // _LIBCPP_DEBUG
4360 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4361 return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp);
4362 #endif // _LIBCPP_DEBUG
4365 template <class _ForwardIterator, class _Tp>
4366 inline _LIBCPP_INLINE_VISIBILITY
4368 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
4370 return _VSTD::upper_bound(__first, __last, __value_,
4371 __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>());
4376 template <class _Compare, class _ForwardIterator, class _Tp>
4377 pair<_ForwardIterator, _ForwardIterator>
4378 __equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4380 typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type;
4381 difference_type __len = _VSTD::distance(__first, __last);
4384 difference_type __l2 = __len / 2;
4385 _ForwardIterator __m = __first;
4386 _VSTD::advance(__m, __l2);
4387 if (__comp(*__m, __value_))
4392 else if (__comp(__value_, *__m))
4399 _ForwardIterator __mp1 = __m;
4400 return pair<_ForwardIterator, _ForwardIterator>
4402 __lower_bound<_Compare>(__first, __m, __value_, __comp),
4403 __upper_bound<_Compare>(++__mp1, __last, __value_, __comp)
4407 return pair<_ForwardIterator, _ForwardIterator>(__first, __first);
4410 template <class _ForwardIterator, class _Tp, class _Compare>
4411 inline _LIBCPP_INLINE_VISIBILITY
4412 pair<_ForwardIterator, _ForwardIterator>
4413 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4415 #ifdef _LIBCPP_DEBUG
4416 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
4417 __debug_less<_Compare> __c(__comp);
4418 return __equal_range<_Comp_ref>(__first, __last, __value_, __c);
4419 #else // _LIBCPP_DEBUG
4420 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4421 return __equal_range<_Comp_ref>(__first, __last, __value_, __comp);
4422 #endif // _LIBCPP_DEBUG
4425 template <class _ForwardIterator, class _Tp>
4426 inline _LIBCPP_INLINE_VISIBILITY
4427 pair<_ForwardIterator, _ForwardIterator>
4428 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
4430 return _VSTD::equal_range(__first, __last, __value_,
4431 __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>());
4436 template <class _Compare, class _ForwardIterator, class _Tp>
4437 inline _LIBCPP_INLINE_VISIBILITY
4439 __binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4441 __first = __lower_bound<_Compare>(__first, __last, __value_, __comp);
4442 return __first != __last && !__comp(__value_, *__first);
4445 template <class _ForwardIterator, class _Tp, class _Compare>
4446 inline _LIBCPP_INLINE_VISIBILITY
4448 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4450 #ifdef _LIBCPP_DEBUG
4451 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
4452 __debug_less<_Compare> __c(__comp);
4453 return __binary_search<_Comp_ref>(__first, __last, __value_, __c);
4454 #else // _LIBCPP_DEBUG
4455 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4456 return __binary_search<_Comp_ref>(__first, __last, __value_, __comp);
4457 #endif // _LIBCPP_DEBUG
4460 template <class _ForwardIterator, class _Tp>
4461 inline _LIBCPP_INLINE_VISIBILITY
4463 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_)
4465 return _VSTD::binary_search(__first, __last, __value_,
4466 __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>());
4471 template <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator>
4473 __merge(_InputIterator1 __first1, _InputIterator1 __last1,
4474 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4476 for (; __first1 != __last1; ++__result)
4478 if (__first2 == __last2)
4479 return _VSTD::copy(__first1, __last1, __result);
4480 if (__comp(*__first2, *__first1))
4482 *__result = *__first2;
4487 *__result = *__first1;
4491 return _VSTD::copy(__first2, __last2, __result);
4494 template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
4495 inline _LIBCPP_INLINE_VISIBILITY
4497 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4498 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4500 #ifdef _LIBCPP_DEBUG
4501 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
4502 __debug_less<_Compare> __c(__comp);
4503 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
4504 #else // _LIBCPP_DEBUG
4505 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4506 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
4507 #endif // _LIBCPP_DEBUG
4510 template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
4511 inline _LIBCPP_INLINE_VISIBILITY
4513 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4514 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
4516 typedef typename iterator_traits<_InputIterator1>::value_type __v1;
4517 typedef typename iterator_traits<_InputIterator2>::value_type __v2;
4518 return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>());
4523 template <class _Compare, class _InputIterator1, class _InputIterator2,
4524 class _OutputIterator>
4525 void __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1,
4526 _InputIterator2 __first2, _InputIterator2 __last2,
4527 _OutputIterator __result, _Compare __comp)
4529 for (; __first1 != __last1; ++__result)
4531 if (__first2 == __last2)
4533 _VSTD::move(__first1, __last1, __result);
4537 if (__comp(*__first2, *__first1))
4539 *__result = _VSTD::move(*__first2);
4544 *__result = _VSTD::move(*__first1);
4548 // __first2 through __last2 are already in the right spot.
4551 template <class _Compare, class _BidirectionalIterator>
4553 __buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last,
4554 _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4555 typename iterator_traits<_BidirectionalIterator>::difference_type __len2,
4556 typename iterator_traits<_BidirectionalIterator>::value_type* __buff)
4558 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
4559 __destruct_n __d(0);
4560 unique_ptr<value_type, __destruct_n&> __h2(__buff, __d);
4561 if (__len1 <= __len2)
4563 value_type* __p = __buff;
4564 for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p)
4565 ::new(__p) value_type(_VSTD::move(*__i));
4566 __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp);
4570 value_type* __p = __buff;
4571 for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p)
4572 ::new(__p) value_type(_VSTD::move(*__i));
4573 typedef reverse_iterator<_BidirectionalIterator> _RBi;
4574 typedef reverse_iterator<value_type*> _Rv;
4575 __half_inplace_merge(_Rv(__p), _Rv(__buff),
4576 _RBi(__middle), _RBi(__first),
4577 _RBi(__last), __negate<_Compare>(__comp));
4581 template <class _Compare, class _BidirectionalIterator>
4583 __inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last,
4584 _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4585 typename iterator_traits<_BidirectionalIterator>::difference_type __len2,
4586 typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size)
4588 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type;
4591 // if __middle == __last, we're done
4594 if (__len1 <= __buff_size || __len2 <= __buff_size)
4595 return __buffered_inplace_merge<_Compare>
4596 (__first, __middle, __last, __comp, __len1, __len2, __buff);
4597 // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0
4598 for (; true; ++__first, (void) --__len1)
4602 if (__comp(*__middle, *__first))
4605 // __first < __middle < __last
4606 // *__first > *__middle
4607 // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that
4609 // [__first, __m1) <= [__middle, __m2)
4610 // [__middle, __m2) < [__m1, __middle)
4611 // [__m1, __middle) <= [__m2, __last)
4612 // and __m1 or __m2 is in the middle of its range
4613 _BidirectionalIterator __m1; // "median" of [__first, __middle)
4614 _BidirectionalIterator __m2; // "median" of [__middle, __last)
4615 difference_type __len11; // distance(__first, __m1)
4616 difference_type __len21; // distance(__middle, __m2)
4617 // binary search smaller range
4618 if (__len1 < __len2)
4619 { // __len >= 1, __len2 >= 2
4620 __len21 = __len2 / 2;
4622 _VSTD::advance(__m2, __len21);
4623 __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp);
4624 __len11 = _VSTD::distance(__first, __m1);
4629 { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1
4630 // It is known *__first > *__middle
4631 swap(*__first, *__middle);
4634 // __len1 >= 2, __len2 >= 1
4635 __len11 = __len1 / 2;
4637 _VSTD::advance(__m1, __len11);
4638 __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp);
4639 __len21 = _VSTD::distance(__middle, __m2);
4641 difference_type __len12 = __len1 - __len11; // distance(__m1, __middle)
4642 difference_type __len22 = __len2 - __len21; // distance(__m2, __last)
4643 // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last)
4644 // swap middle two partitions
4645 __middle = _VSTD::rotate(__m1, __middle, __m2);
4646 // __len12 and __len21 now have swapped meanings
4647 // merge smaller range with recurisve call and larger with tail recursion elimination
4648 if (__len11 + __len21 < __len12 + __len22)
4650 __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4651 // __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
4659 __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
4660 // __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4669 template <class _BidirectionalIterator, class _Compare>
4670 inline _LIBCPP_INLINE_VISIBILITY
4672 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last,
4675 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type;
4676 typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type;
4677 difference_type __len1 = _VSTD::distance(__first, __middle);
4678 difference_type __len2 = _VSTD::distance(__middle, __last);
4679 difference_type __buf_size = _VSTD::min(__len1, __len2);
4680 pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size);
4681 unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first);
4683 #ifdef _LIBCPP_DEBUG
4684 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
4685 __debug_less<_Compare> __c(__comp);
4686 return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2,
4687 __buf.first, __buf.second);
4688 #else // _LIBCPP_DEBUG
4689 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4690 return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2,
4691 __buf.first, __buf.second);
4692 #endif // _LIBCPP_DEBUG
4695 template <class _BidirectionalIterator>
4696 inline _LIBCPP_INLINE_VISIBILITY
4698 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last)
4700 _VSTD::inplace_merge(__first, __middle, __last,
4701 __less<typename iterator_traits<_BidirectionalIterator>::value_type>());
4706 template <class _Compare, class _InputIterator1, class _InputIterator2>
4708 __merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1,
4709 _InputIterator2 __first2, _InputIterator2 __last2,
4710 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp)
4712 typedef typename iterator_traits<_InputIterator1>::value_type value_type;
4713 __destruct_n __d(0);
4714 unique_ptr<value_type, __destruct_n&> __h(__result, __d);
4715 for (; true; ++__result)
4717 if (__first1 == __last1)
4719 for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0))
4720 ::new (__result) value_type(_VSTD::move(*__first2));
4724 if (__first2 == __last2)
4726 for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0))
4727 ::new (__result) value_type(_VSTD::move(*__first1));
4731 if (__comp(*__first2, *__first1))
4733 ::new (__result) value_type(_VSTD::move(*__first2));
4734 __d.__incr((value_type*)0);
4739 ::new (__result) value_type(_VSTD::move(*__first1));
4740 __d.__incr((value_type*)0);
4746 template <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator>
4748 __merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1,
4749 _InputIterator2 __first2, _InputIterator2 __last2,
4750 _OutputIterator __result, _Compare __comp)
4752 for (; __first1 != __last1; ++__result)
4754 if (__first2 == __last2)
4756 for (; __first1 != __last1; ++__first1, ++__result)
4757 *__result = _VSTD::move(*__first1);
4760 if (__comp(*__first2, *__first1))
4762 *__result = _VSTD::move(*__first2);
4767 *__result = _VSTD::move(*__first1);
4771 for (; __first2 != __last2; ++__first2, ++__result)
4772 *__result = _VSTD::move(*__first2);
4775 template <class _Compare, class _RandomAccessIterator>
4777 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4778 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4779 typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size);
4781 template <class _Compare, class _RandomAccessIterator>
4783 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp,
4784 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4785 typename iterator_traits<_RandomAccessIterator>::value_type* __first2)
4787 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
4793 ::new(__first2) value_type(_VSTD::move(*__first1));
4796 __destruct_n __d(0);
4797 unique_ptr<value_type, __destruct_n&> __h2(__first2, __d);
4798 if (__comp(*--__last1, *__first1))
4800 ::new(__first2) value_type(_VSTD::move(*__last1));
4801 __d.__incr((value_type*)0);
4803 ::new(__first2) value_type(_VSTD::move(*__first1));
4807 ::new(__first2) value_type(_VSTD::move(*__first1));
4808 __d.__incr((value_type*)0);
4810 ::new(__first2) value_type(_VSTD::move(*__last1));
4817 __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp);
4820 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2;
4821 _RandomAccessIterator __m = __first1 + __l2;
4822 __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2);
4823 __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4824 __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp);
4827 template <class _Tp>
4828 struct __stable_sort_switch
4830 static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value;
4833 template <class _Compare, class _RandomAccessIterator>
4835 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4836 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4837 typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size)
4839 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
4840 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
4847 if (__comp(*--__last, *__first))
4848 swap(*__first, *__last);
4851 if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value))
4853 __insertion_sort<_Compare>(__first, __last, __comp);
4856 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2;
4857 _RandomAccessIterator __m = __first + __l2;
4858 if (__len <= __buff_size)
4860 __destruct_n __d(0);
4861 unique_ptr<value_type, __destruct_n&> __h2(__buff, __d);
4862 __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff);
4863 __d.__set(__l2, (value_type*)0);
4864 __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2);
4865 __d.__set(__len, (value_type*)0);
4866 __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp);
4867 // __merge<_Compare>(move_iterator<value_type*>(__buff),
4868 // move_iterator<value_type*>(__buff + __l2),
4869 // move_iterator<_RandomAccessIterator>(__buff + __l2),
4870 // move_iterator<_RandomAccessIterator>(__buff + __len),
4871 // __first, __comp);
4874 __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size);
4875 __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size);
4876 __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size);
4879 template <class _RandomAccessIterator, class _Compare>
4880 inline _LIBCPP_INLINE_VISIBILITY
4882 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4884 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
4885 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
4886 difference_type __len = __last - __first;
4887 pair<value_type*, ptrdiff_t> __buf(0, 0);
4888 unique_ptr<value_type, __return_temporary_buffer> __h;
4889 if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value))
4891 __buf = _VSTD::get_temporary_buffer<value_type>(__len);
4892 __h.reset(__buf.first);
4894 #ifdef _LIBCPP_DEBUG
4895 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
4896 __debug_less<_Compare> __c(__comp);
4897 __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second);
4898 #else // _LIBCPP_DEBUG
4899 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
4900 __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second);
4901 #endif // _LIBCPP_DEBUG
4904 template <class _RandomAccessIterator>
4905 inline _LIBCPP_INLINE_VISIBILITY
4907 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
4909 _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
4914 template <class _RandomAccessIterator, class _Compare>
4915 _RandomAccessIterator
4916 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4918 typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type;
4919 difference_type __len = __last - __first;
4920 difference_type __p = 0;
4921 difference_type __c = 1;
4922 _RandomAccessIterator __pp = __first;
4925 _RandomAccessIterator __cp = __first + __c;
4926 if (__comp(*__pp, *__cp))
4932 if (__comp(*__pp, *__cp))
4941 template<class _RandomAccessIterator>
4942 inline _LIBCPP_INLINE_VISIBILITY
4943 _RandomAccessIterator
4944 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last)
4946 return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
4951 template <class _RandomAccessIterator, class _Compare>
4952 inline _LIBCPP_INLINE_VISIBILITY
4954 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4956 return _VSTD::is_heap_until(__first, __last, __comp) == __last;
4959 template<class _RandomAccessIterator>
4960 inline _LIBCPP_INLINE_VISIBILITY
4962 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
4964 return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
4969 template <class _Compare, class _RandomAccessIterator>
4971 __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4972 typename iterator_traits<_RandomAccessIterator>::difference_type __len)
4974 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
4977 __len = (__len - 2) / 2;
4978 _RandomAccessIterator __ptr = __first + __len;
4979 if (__comp(*__ptr, *--__last))
4981 value_type __t(_VSTD::move(*__last));
4984 *__last = _VSTD::move(*__ptr);
4988 __len = (__len - 1) / 2;
4989 __ptr = __first + __len;
4990 } while (__comp(*__ptr, __t));
4991 *__last = _VSTD::move(__t);
4996 template <class _RandomAccessIterator, class _Compare>
4997 inline _LIBCPP_INLINE_VISIBILITY
4999 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5001 #ifdef _LIBCPP_DEBUG
5002 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5003 __debug_less<_Compare> __c(__comp);
5004 __sift_up<_Comp_ref>(__first, __last, __c, __last - __first);
5005 #else // _LIBCPP_DEBUG
5006 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5007 __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first);
5008 #endif // _LIBCPP_DEBUG
5011 template <class _RandomAccessIterator>
5012 inline _LIBCPP_INLINE_VISIBILITY
5014 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
5016 _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
5021 template <class _Compare, class _RandomAccessIterator>
5023 __sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/,
5025 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
5026 _RandomAccessIterator __start)
5028 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
5029 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
5030 // left-child of __start is at 2 * __start + 1
5031 // right-child of __start is at 2 * __start + 2
5032 difference_type __child = __start - __first;
5034 if (__len < 2 || (__len - 2) / 2 < __child)
5037 __child = 2 * __child + 1;
5038 _RandomAccessIterator __child_i = __first + __child;
5040 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
5041 // right-child exists and is greater than left-child
5046 // check if we are in heap-order
5047 if (__comp(*__child_i, *__start))
5048 // we are, __start is larger than it's largest child
5051 value_type __top(_VSTD::move(*__start));
5054 // we are not in heap-order, swap the parent with it's largest child
5055 *__start = _VSTD::move(*__child_i);
5056 __start = __child_i;
5058 if ((__len - 2) / 2 < __child)
5061 // recompute the child based off of the updated parent
5062 __child = 2 * __child + 1;
5063 __child_i = __first + __child;
5065 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
5066 // right-child exists and is greater than left-child
5071 // check if we are in heap-order
5072 } while (!__comp(*__child_i, __top));
5073 *__start = _VSTD::move(__top);
5076 template <class _Compare, class _RandomAccessIterator>
5077 inline _LIBCPP_INLINE_VISIBILITY
5079 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
5080 typename iterator_traits<_RandomAccessIterator>::difference_type __len)
5084 swap(*__first, *--__last);
5085 __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first);
5089 template <class _RandomAccessIterator, class _Compare>
5090 inline _LIBCPP_INLINE_VISIBILITY
5092 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5094 #ifdef _LIBCPP_DEBUG
5095 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5096 __debug_less<_Compare> __c(__comp);
5097 __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first);
5098 #else // _LIBCPP_DEBUG
5099 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5100 __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first);
5101 #endif // _LIBCPP_DEBUG
5104 template <class _RandomAccessIterator>
5105 inline _LIBCPP_INLINE_VISIBILITY
5107 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
5109 _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
5114 template <class _Compare, class _RandomAccessIterator>
5116 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5118 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
5119 difference_type __n = __last - __first;
5122 // start from the first parent, there is no need to consider children
5123 for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start)
5125 __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start);
5130 template <class _RandomAccessIterator, class _Compare>
5131 inline _LIBCPP_INLINE_VISIBILITY
5133 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5135 #ifdef _LIBCPP_DEBUG
5136 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5137 __debug_less<_Compare> __c(__comp);
5138 __make_heap<_Comp_ref>(__first, __last, __c);
5139 #else // _LIBCPP_DEBUG
5140 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5141 __make_heap<_Comp_ref>(__first, __last, __comp);
5142 #endif // _LIBCPP_DEBUG
5145 template <class _RandomAccessIterator>
5146 inline _LIBCPP_INLINE_VISIBILITY
5148 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
5150 _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
5155 template <class _Compare, class _RandomAccessIterator>
5157 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5159 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
5160 for (difference_type __n = __last - __first; __n > 1; --__last, --__n)
5161 __pop_heap<_Compare>(__first, __last, __comp, __n);
5164 template <class _RandomAccessIterator, class _Compare>
5165 inline _LIBCPP_INLINE_VISIBILITY
5167 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5169 #ifdef _LIBCPP_DEBUG
5170 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5171 __debug_less<_Compare> __c(__comp);
5172 __sort_heap<_Comp_ref>(__first, __last, __c);
5173 #else // _LIBCPP_DEBUG
5174 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5175 __sort_heap<_Comp_ref>(__first, __last, __comp);
5176 #endif // _LIBCPP_DEBUG
5179 template <class _RandomAccessIterator>
5180 inline _LIBCPP_INLINE_VISIBILITY
5182 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
5184 _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
5189 template <class _Compare, class _RandomAccessIterator>
5191 __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
5194 __make_heap<_Compare>(__first, __middle, __comp);
5195 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first;
5196 for (_RandomAccessIterator __i = __middle; __i != __last; ++__i)
5198 if (__comp(*__i, *__first))
5200 swap(*__i, *__first);
5201 __sift_down<_Compare>(__first, __middle, __comp, __len, __first);
5204 __sort_heap<_Compare>(__first, __middle, __comp);
5207 template <class _RandomAccessIterator, class _Compare>
5208 inline _LIBCPP_INLINE_VISIBILITY
5210 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
5213 #ifdef _LIBCPP_DEBUG
5214 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5215 __debug_less<_Compare> __c(__comp);
5216 __partial_sort<_Comp_ref>(__first, __middle, __last, __c);
5217 #else // _LIBCPP_DEBUG
5218 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5219 __partial_sort<_Comp_ref>(__first, __middle, __last, __comp);
5220 #endif // _LIBCPP_DEBUG
5223 template <class _RandomAccessIterator>
5224 inline _LIBCPP_INLINE_VISIBILITY
5226 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last)
5228 _VSTD::partial_sort(__first, __middle, __last,
5229 __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
5232 // partial_sort_copy
5234 template <class _Compare, class _InputIterator, class _RandomAccessIterator>
5235 _RandomAccessIterator
5236 __partial_sort_copy(_InputIterator __first, _InputIterator __last,
5237 _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5239 _RandomAccessIterator __r = __result_first;
5240 if (__r != __result_last)
5242 for (; __first != __last && __r != __result_last; (void) ++__first, ++__r)
5244 __make_heap<_Compare>(__result_first, __r, __comp);
5245 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first;
5246 for (; __first != __last; ++__first)
5247 if (__comp(*__first, *__result_first))
5249 *__result_first = *__first;
5250 __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first);
5252 __sort_heap<_Compare>(__result_first, __r, __comp);
5257 template <class _InputIterator, class _RandomAccessIterator, class _Compare>
5258 inline _LIBCPP_INLINE_VISIBILITY
5259 _RandomAccessIterator
5260 partial_sort_copy(_InputIterator __first, _InputIterator __last,
5261 _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5263 #ifdef _LIBCPP_DEBUG
5264 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5265 __debug_less<_Compare> __c(__comp);
5266 return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c);
5267 #else // _LIBCPP_DEBUG
5268 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5269 return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp);
5270 #endif // _LIBCPP_DEBUG
5273 template <class _InputIterator, class _RandomAccessIterator>
5274 inline _LIBCPP_INLINE_VISIBILITY
5275 _RandomAccessIterator
5276 partial_sort_copy(_InputIterator __first, _InputIterator __last,
5277 _RandomAccessIterator __result_first, _RandomAccessIterator __result_last)
5279 return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last,
5280 __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
5285 template <class _Compare, class _RandomAccessIterator>
5287 __nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5289 // _Compare is known to be a reference type
5290 typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
5291 const difference_type __limit = 7;
5295 if (__nth == __last)
5297 difference_type __len = __last - __first;
5304 if (__comp(*--__last, *__first))
5305 swap(*__first, *__last);
5309 _RandomAccessIterator __m = __first;
5310 _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp);
5314 if (__len <= __limit)
5316 __selection_sort<_Compare>(__first, __last, __comp);
5319 // __len > __limit >= 3
5320 _RandomAccessIterator __m = __first + __len/2;
5321 _RandomAccessIterator __lm1 = __last;
5322 unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp);
5324 // partition [__first, __m) < *__m and *__m <= [__m, __last)
5325 // (this inhibits tossing elements equivalent to __m around unnecessarily)
5326 _RandomAccessIterator __i = __first;
5327 _RandomAccessIterator __j = __lm1;
5328 // j points beyond range to be tested, *__lm1 is known to be <= *__m
5329 // The search going up is known to be guarded but the search coming down isn't.
5330 // Prime the downward search with a guard.
5331 if (!__comp(*__i, *__m)) // if *__first == *__m
5333 // *__first == *__m, *__first doesn't go in first part
5334 // manually guard downward moving __j against __i
5339 // *__first == *__m, *__m <= all other elements
5340 // Parition instead into [__first, __i) == *__first and *__first < [__i, __last)
5341 ++__i; // __first + 1
5343 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
5348 return; // [__first, __last) all equivalent elements
5349 if (__comp(*__first, *__i))
5359 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
5364 while (!__comp(*__first, *__i))
5366 while (__comp(*__first, *--__j))
5374 // [__first, __i) == *__first and *__first < [__i, __last)
5375 // The first part is sorted,
5378 // __nth_element the secod part
5379 // __nth_element<_Compare>(__i, __nth, __last, __comp);
5383 if (__comp(*__j, *__m))
5387 break; // found guard for downward moving __j, now use unguarded partition
5392 // j points beyond range to be tested, *__lm1 is known to be <= *__m
5393 // if not yet partitioned...
5396 // known that *(__i - 1) < *__m
5399 // __m still guards upward moving __i
5400 while (__comp(*__i, *__m))
5402 // It is now known that a guard exists for downward moving __j
5403 while (!__comp(*--__j, *__m))
5409 // It is known that __m != __j
5410 // If __m just moved, follow it
5416 // [__first, __i) < *__m and *__m <= [__i, __last)
5417 if (__i != __m && __comp(*__m, *__i))
5422 // [__first, __i) < *__i and *__i <= [__i+1, __last)
5427 // We were given a perfectly partitioned sequence. Coincidence?
5430 // Check for [__first, __i) already sorted
5431 __j = __m = __first;
5432 while (++__j != __i)
5434 if (__comp(*__j, *__m))
5435 // not yet sorted, so sort
5439 // [__first, __i) sorted
5444 // Check for [__i, __last) already sorted
5446 while (++__j != __last)
5448 if (__comp(*__j, *__m))
5449 // not yet sorted, so sort
5453 // [__i, __last) sorted
5458 // __nth_element on range containing __nth
5461 // __nth_element<_Compare>(__first, __nth, __i, __comp);
5466 // __nth_element<_Compare>(__i+1, __nth, __last, __comp);
5472 template <class _RandomAccessIterator, class _Compare>
5473 inline _LIBCPP_INLINE_VISIBILITY
5475 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5477 #ifdef _LIBCPP_DEBUG
5478 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5479 __debug_less<_Compare> __c(__comp);
5480 __nth_element<_Comp_ref>(__first, __nth, __last, __c);
5481 #else // _LIBCPP_DEBUG
5482 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5483 __nth_element<_Comp_ref>(__first, __nth, __last, __comp);
5484 #endif // _LIBCPP_DEBUG
5487 template <class _RandomAccessIterator>
5488 inline _LIBCPP_INLINE_VISIBILITY
5490 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last)
5492 _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
5497 template <class _Compare, class _InputIterator1, class _InputIterator2>
5499 __includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2,
5502 for (; __first2 != __last2; ++__first1)
5504 if (__first1 == __last1 || __comp(*__first2, *__first1))
5506 if (!__comp(*__first1, *__first2))
5512 template <class _InputIterator1, class _InputIterator2, class _Compare>
5513 inline _LIBCPP_INLINE_VISIBILITY
5515 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2,
5518 #ifdef _LIBCPP_DEBUG
5519 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5520 __debug_less<_Compare> __c(__comp);
5521 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c);
5522 #else // _LIBCPP_DEBUG
5523 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5524 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5525 #endif // _LIBCPP_DEBUG
5528 template <class _InputIterator1, class _InputIterator2>
5529 inline _LIBCPP_INLINE_VISIBILITY
5531 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2)
5533 return _VSTD::includes(__first1, __last1, __first2, __last2,
5534 __less<typename iterator_traits<_InputIterator1>::value_type,
5535 typename iterator_traits<_InputIterator2>::value_type>());
5540 template <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator>
5542 __set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5543 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5545 for (; __first1 != __last1; ++__result)
5547 if (__first2 == __last2)
5548 return _VSTD::copy(__first1, __last1, __result);
5549 if (__comp(*__first2, *__first1))
5551 *__result = *__first2;
5556 *__result = *__first1;
5557 if (!__comp(*__first1, *__first2))
5562 return _VSTD::copy(__first2, __last2, __result);
5565 template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
5566 inline _LIBCPP_INLINE_VISIBILITY
5568 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5569 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5571 #ifdef _LIBCPP_DEBUG
5572 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5573 __debug_less<_Compare> __c(__comp);
5574 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5575 #else // _LIBCPP_DEBUG
5576 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5577 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5578 #endif // _LIBCPP_DEBUG
5581 template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
5582 inline _LIBCPP_INLINE_VISIBILITY
5584 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5585 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
5587 return _VSTD::set_union(__first1, __last1, __first2, __last2, __result,
5588 __less<typename iterator_traits<_InputIterator1>::value_type,
5589 typename iterator_traits<_InputIterator2>::value_type>());
5594 template <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator>
5596 __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5597 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5599 while (__first1 != __last1 && __first2 != __last2)
5601 if (__comp(*__first1, *__first2))
5605 if (!__comp(*__first2, *__first1))
5607 *__result = *__first1;
5617 template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
5618 inline _LIBCPP_INLINE_VISIBILITY
5620 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5621 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5623 #ifdef _LIBCPP_DEBUG
5624 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5625 __debug_less<_Compare> __c(__comp);
5626 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5627 #else // _LIBCPP_DEBUG
5628 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5629 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5630 #endif // _LIBCPP_DEBUG
5633 template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
5634 inline _LIBCPP_INLINE_VISIBILITY
5636 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5637 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
5639 return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result,
5640 __less<typename iterator_traits<_InputIterator1>::value_type,
5641 typename iterator_traits<_InputIterator2>::value_type>());
5646 template <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator>
5648 __set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5649 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5651 while (__first1 != __last1)
5653 if (__first2 == __last2)
5654 return _VSTD::copy(__first1, __last1, __result);
5655 if (__comp(*__first1, *__first2))
5657 *__result = *__first1;
5663 if (!__comp(*__first2, *__first1))
5671 template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
5672 inline _LIBCPP_INLINE_VISIBILITY
5674 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5675 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5677 #ifdef _LIBCPP_DEBUG
5678 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5679 __debug_less<_Compare> __c(__comp);
5680 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5681 #else // _LIBCPP_DEBUG
5682 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5683 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5684 #endif // _LIBCPP_DEBUG
5687 template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
5688 inline _LIBCPP_INLINE_VISIBILITY
5690 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5691 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
5693 return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result,
5694 __less<typename iterator_traits<_InputIterator1>::value_type,
5695 typename iterator_traits<_InputIterator2>::value_type>());
5698 // set_symmetric_difference
5700 template <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator>
5702 __set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5703 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5705 while (__first1 != __last1)
5707 if (__first2 == __last2)
5708 return _VSTD::copy(__first1, __last1, __result);
5709 if (__comp(*__first1, *__first2))
5711 *__result = *__first1;
5717 if (__comp(*__first2, *__first1))
5719 *__result = *__first2;
5727 return _VSTD::copy(__first2, __last2, __result);
5730 template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
5731 inline _LIBCPP_INLINE_VISIBILITY
5733 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5734 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5736 #ifdef _LIBCPP_DEBUG
5737 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5738 __debug_less<_Compare> __c(__comp);
5739 return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5740 #else // _LIBCPP_DEBUG
5741 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5742 return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5743 #endif // _LIBCPP_DEBUG
5746 template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
5747 inline _LIBCPP_INLINE_VISIBILITY
5749 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5750 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
5752 return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result,
5753 __less<typename iterator_traits<_InputIterator1>::value_type,
5754 typename iterator_traits<_InputIterator2>::value_type>());
5757 // lexicographical_compare
5759 template <class _Compare, class _InputIterator1, class _InputIterator2>
5761 __lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5762 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5764 for (; __first2 != __last2; ++__first1, (void) ++__first2)
5766 if (__first1 == __last1 || __comp(*__first1, *__first2))
5768 if (__comp(*__first2, *__first1))
5774 template <class _InputIterator1, class _InputIterator2, class _Compare>
5775 inline _LIBCPP_INLINE_VISIBILITY
5777 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5778 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5780 #ifdef _LIBCPP_DEBUG
5781 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5782 __debug_less<_Compare> __c(__comp);
5783 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c);
5784 #else // _LIBCPP_DEBUG
5785 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5786 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5787 #endif // _LIBCPP_DEBUG
5790 template <class _InputIterator1, class _InputIterator2>
5791 inline _LIBCPP_INLINE_VISIBILITY
5793 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5794 _InputIterator2 __first2, _InputIterator2 __last2)
5796 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2,
5797 __less<typename iterator_traits<_InputIterator1>::value_type,
5798 typename iterator_traits<_InputIterator2>::value_type>());
5803 template <class _Compare, class _BidirectionalIterator>
5805 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5807 _BidirectionalIterator __i = __last;
5808 if (__first == __last || __first == --__i)
5812 _BidirectionalIterator __ip1 = __i;
5813 if (__comp(*--__i, *__ip1))
5815 _BidirectionalIterator __j = __last;
5816 while (!__comp(*__i, *--__j))
5819 _VSTD::reverse(__ip1, __last);
5824 _VSTD::reverse(__first, __last);
5830 template <class _BidirectionalIterator, class _Compare>
5831 inline _LIBCPP_INLINE_VISIBILITY
5833 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5835 #ifdef _LIBCPP_DEBUG
5836 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5837 __debug_less<_Compare> __c(__comp);
5838 return __next_permutation<_Comp_ref>(__first, __last, __c);
5839 #else // _LIBCPP_DEBUG
5840 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5841 return __next_permutation<_Comp_ref>(__first, __last, __comp);
5842 #endif // _LIBCPP_DEBUG
5845 template <class _BidirectionalIterator>
5846 inline _LIBCPP_INLINE_VISIBILITY
5848 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last)
5850 return _VSTD::next_permutation(__first, __last,
5851 __less<typename iterator_traits<_BidirectionalIterator>::value_type>());
5856 template <class _Compare, class _BidirectionalIterator>
5858 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5860 _BidirectionalIterator __i = __last;
5861 if (__first == __last || __first == --__i)
5865 _BidirectionalIterator __ip1 = __i;
5866 if (__comp(*__ip1, *--__i))
5868 _BidirectionalIterator __j = __last;
5869 while (!__comp(*--__j, *__i))
5872 _VSTD::reverse(__ip1, __last);
5877 _VSTD::reverse(__first, __last);
5883 template <class _BidirectionalIterator, class _Compare>
5884 inline _LIBCPP_INLINE_VISIBILITY
5886 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5888 #ifdef _LIBCPP_DEBUG
5889 typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
5890 __debug_less<_Compare> __c(__comp);
5891 return __prev_permutation<_Comp_ref>(__first, __last, __c);
5892 #else // _LIBCPP_DEBUG
5893 typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
5894 return __prev_permutation<_Comp_ref>(__first, __last, __comp);
5895 #endif // _LIBCPP_DEBUG
5898 template <class _BidirectionalIterator>
5899 inline _LIBCPP_INLINE_VISIBILITY
5901 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last)
5903 return _VSTD::prev_permutation(__first, __last,
5904 __less<typename iterator_traits<_BidirectionalIterator>::value_type>());
5907 _LIBCPP_END_NAMESPACE_STD
5911 #endif // _LIBCPP_ALGORITHM