13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 45b08a8a4SHoward Hinnant// The LLVM Compiler Infrastructure 53e519524SHoward Hinnant// 6412dbebeSHoward Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 7412dbebeSHoward Hinnant// Source Licenses. See LICENSE.TXT for details. 83e519524SHoward Hinnant// 93e519524SHoward Hinnant//===----------------------------------------------------------------------===// 103e519524SHoward Hinnant 113e519524SHoward Hinnant#ifndef _LIBCPP_ALGORITHM 123e519524SHoward Hinnant#define _LIBCPP_ALGORITHM 133e519524SHoward Hinnant 143e519524SHoward Hinnant/* 153e519524SHoward Hinnant algorithm synopsis 163e519524SHoward Hinnant 173e519524SHoward Hinnant#include <initializer_list> 183e519524SHoward Hinnant 193e519524SHoward Hinnantnamespace std 203e519524SHoward Hinnant{ 213e519524SHoward Hinnant 223e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 233e519524SHoward Hinnant bool 243e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 253e519524SHoward Hinnant 263e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 273e519524SHoward Hinnant bool 283e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 293e519524SHoward Hinnant 303e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 313e519524SHoward Hinnant bool 323e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 333e519524SHoward Hinnant 343e519524SHoward Hinnanttemplate <class InputIterator, class Function> 353e519524SHoward Hinnant Function 363e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 373e519524SHoward Hinnant 383e519524SHoward Hinnanttemplate <class InputIterator, class T> 393e519524SHoward Hinnant InputIterator 403e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 413e519524SHoward Hinnant 423e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 433e519524SHoward Hinnant InputIterator 443e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 453e519524SHoward Hinnant 463e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 473e519524SHoward Hinnant InputIterator 483e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 493e519524SHoward Hinnant 503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 513e519524SHoward Hinnant ForwardIterator1 523e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 543e519524SHoward Hinnant 553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 563e519524SHoward Hinnant ForwardIterator1 573e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 593e519524SHoward Hinnant 603e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 613e519524SHoward Hinnant ForwardIterator1 623e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 633e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 643e519524SHoward Hinnant 653e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 663e519524SHoward Hinnant ForwardIterator1 673e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 683e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 693e519524SHoward Hinnant 703e519524SHoward Hinnanttemplate <class ForwardIterator> 713e519524SHoward Hinnant ForwardIterator 723e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 733e519524SHoward Hinnant 743e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 753e519524SHoward Hinnant ForwardIterator 763e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 773e519524SHoward Hinnant 783e519524SHoward Hinnanttemplate <class InputIterator, class T> 793e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 803e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 813e519524SHoward Hinnant 823e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 833e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 843e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 853e519524SHoward Hinnant 863e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 873e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 883e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 893e519524SHoward Hinnant 90*0b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 91*0b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 92*0b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 93*0b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 94*0b0bbd2fSMarshall Clow 953e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 963e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 973e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 983e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 993e519524SHoward Hinnant 100*0b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 101*0b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 102*0b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 103*0b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 104*0b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 105*0b0bbd2fSMarshall Clow 1063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1073e519524SHoward Hinnant bool 1083e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1093e519524SHoward Hinnant 110*0b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 111*0b0bbd2fSMarshall Clow bool 112*0b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 113*0b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 114*0b0bbd2fSMarshall Clow 1153e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1163e519524SHoward Hinnant bool 1173e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1183e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1193e519524SHoward Hinnant 120*0b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 121*0b0bbd2fSMarshall Clow bool 122*0b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 123*0b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 124*0b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 125*0b0bbd2fSMarshall Clow 1263e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 1273e519524SHoward Hinnant bool 1283e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1293e519524SHoward Hinnant ForwardIterator2 first2); 1303e519524SHoward Hinnant 131*0b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 132*0b0bbd2fSMarshall Clow bool 133*0b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 134*0b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 135*0b0bbd2fSMarshall Clow 1363e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1373e519524SHoward Hinnant bool 1383e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1393e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1403e519524SHoward Hinnant 141*0b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 142*0b0bbd2fSMarshall Clow bool 143*0b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 144*0b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 145*0b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 146*0b0bbd2fSMarshall Clow 1473e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1483e519524SHoward Hinnant ForwardIterator1 1493e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1503e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1513e519524SHoward Hinnant 1523e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1533e519524SHoward Hinnant ForwardIterator1 1543e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1553e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1563e519524SHoward Hinnant 1573e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 1583e519524SHoward Hinnant ForwardIterator 1593e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1603e519524SHoward Hinnant 1613e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 1623e519524SHoward Hinnant ForwardIterator 1633e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1643e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1653e519524SHoward Hinnant 1663e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1673e519524SHoward Hinnant OutputIterator 1683e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1693e519524SHoward Hinnant 1703e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1713e519524SHoward Hinnant OutputIterator 1723e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1733e519524SHoward Hinnant OutputIterator result, Predicate pred); 1743e519524SHoward Hinnant 1753e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1763e519524SHoward Hinnant OutputIterator 1773e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1783e519524SHoward Hinnant 1793e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1803e519524SHoward Hinnant BidirectionalIterator2 1813e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1823e519524SHoward Hinnant BidirectionalIterator2 result); 1833e519524SHoward Hinnant 1843e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1853e519524SHoward Hinnant ForwardIterator2 1863e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1873e519524SHoward Hinnant 1883e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1893e519524SHoward Hinnant void 1903e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1913e519524SHoward Hinnant 1923e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 1933e519524SHoward Hinnant OutputIterator 1943e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1953e519524SHoward Hinnant 1963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 1973e519524SHoward Hinnant OutputIterator 1983e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 1993e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2023e519524SHoward Hinnant void 2033e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 2063e519524SHoward Hinnant void 2073e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2103e519524SHoward Hinnant OutputIterator 2113e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2123e519524SHoward Hinnant const T& old_value, const T& new_value); 2133e519524SHoward Hinnant 2143e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 2153e519524SHoward Hinnant OutputIterator 2163e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2173e519524SHoward Hinnant 2183e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2193e519524SHoward Hinnant void 2203e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2213e519524SHoward Hinnant 2223e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2233e519524SHoward Hinnant OutputIterator 2243e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2253e519524SHoward Hinnant 2263e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2273e519524SHoward Hinnant void 2283e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2293e519524SHoward Hinnant 2303e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2313e519524SHoward Hinnant OutputIterator 2323e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2333e519524SHoward Hinnant 2343e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2353e519524SHoward Hinnant ForwardIterator 2363e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2373e519524SHoward Hinnant 2383e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2393e519524SHoward Hinnant ForwardIterator 2403e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2413e519524SHoward Hinnant 2423e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2433e519524SHoward Hinnant OutputIterator 2443e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2453e519524SHoward Hinnant 2463e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 2473e519524SHoward Hinnant OutputIterator 2483e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2493e519524SHoward Hinnant 2503e519524SHoward Hinnanttemplate <class ForwardIterator> 2513e519524SHoward Hinnant ForwardIterator 2523e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2533e519524SHoward Hinnant 2543e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2553e519524SHoward Hinnant ForwardIterator 2563e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2573e519524SHoward Hinnant 2583e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2593e519524SHoward Hinnant OutputIterator 2603e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2613e519524SHoward Hinnant 2623e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2633e519524SHoward Hinnant OutputIterator 2643e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2653e519524SHoward Hinnant 2663e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2673e519524SHoward Hinnant void 2683e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2693e519524SHoward Hinnant 2703e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 2713e519524SHoward Hinnant OutputIterator 2723e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2733e519524SHoward Hinnant 2743e519524SHoward Hinnanttemplate <class ForwardIterator> 2753e519524SHoward Hinnant ForwardIterator 2763e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2773e519524SHoward Hinnant 2783e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2793e519524SHoward Hinnant OutputIterator 2803e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2813e519524SHoward Hinnant 2823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2833e519524SHoward Hinnant void 2843e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last); 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 2883e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator& rand); 2893e519524SHoward Hinnant 290f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 291f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 292fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 293f9d540b0SHoward Hinnant 2943e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2953e519524SHoward Hinnant bool 2963e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2973e519524SHoward Hinnant 2983e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2993e519524SHoward Hinnant ForwardIterator 3003e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3013e519524SHoward Hinnant 3023e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3033e519524SHoward Hinnant class OutputIterator2, class Predicate> 3043e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3053e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3063e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3073e519524SHoward Hinnant Predicate pred); 3083e519524SHoward Hinnant 3093e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3103e519524SHoward Hinnant ForwardIterator 3113e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3123e519524SHoward Hinnant 3133e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3143e519524SHoward Hinnant ForwardIterator 3153e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3163e519524SHoward Hinnant 3173e519524SHoward Hinnanttemplate <class ForwardIterator> 3183e519524SHoward Hinnant bool 3193e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3203e519524SHoward Hinnant 3213e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3223e519524SHoward Hinnant bool 3233e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3243e519524SHoward Hinnant 3253e519524SHoward Hinnanttemplate<class ForwardIterator> 3263e519524SHoward Hinnant ForwardIterator 3273e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3283e519524SHoward Hinnant 3293e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3303e519524SHoward Hinnant ForwardIterator 3313e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3323e519524SHoward Hinnant 3333e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3343e519524SHoward Hinnant void 3353e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3363e519524SHoward Hinnant 3373e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3383e519524SHoward Hinnant void 3393e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3403e519524SHoward Hinnant 3413e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3423e519524SHoward Hinnant void 3433e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3443e519524SHoward Hinnant 3453e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3463e519524SHoward Hinnant void 3473e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3483e519524SHoward Hinnant 3493e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3503e519524SHoward Hinnant void 3513e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3523e519524SHoward Hinnant 3533e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3543e519524SHoward Hinnant void 3553e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3563e519524SHoward Hinnant 3573e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3583e519524SHoward Hinnant RandomAccessIterator 3593e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3603e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3633e519524SHoward Hinnant RandomAccessIterator 3643e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3653e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3663e519524SHoward Hinnant 3673e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3683e519524SHoward Hinnant void 3693e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3703e519524SHoward Hinnant 3713e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3723e519524SHoward Hinnant void 3733e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3743e519524SHoward Hinnant 3753e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3763e519524SHoward Hinnant ForwardIterator 3773e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3803e519524SHoward Hinnant ForwardIterator 3813e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3823e519524SHoward Hinnant 3833e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3843e519524SHoward Hinnant ForwardIterator 3853e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3863e519524SHoward Hinnant 3873e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3883e519524SHoward Hinnant ForwardIterator 3893e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3903e519524SHoward Hinnant 3913e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3923e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3933e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3943e519524SHoward Hinnant 3953e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3963e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3973e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3983e519524SHoward Hinnant 3993e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4003e519524SHoward Hinnant bool 4013e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4023e519524SHoward Hinnant 4033e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4043e519524SHoward Hinnant bool 4053e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4063e519524SHoward Hinnant 4073e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4083e519524SHoward Hinnant OutputIterator 4093e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4103e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4113e519524SHoward Hinnant 4123e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4133e519524SHoward Hinnant OutputIterator 4143e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4153e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4163e519524SHoward Hinnant 4173e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4183e519524SHoward Hinnant void 4193e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4203e519524SHoward Hinnant 4213e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4223e519524SHoward Hinnant void 4233e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4243e519524SHoward Hinnant 4253e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4263e519524SHoward Hinnant bool 4273e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4283e519524SHoward Hinnant 4293e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4303e519524SHoward Hinnant bool 4313e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4323e519524SHoward Hinnant 4333e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4343e519524SHoward Hinnant OutputIterator 4353e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4363e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4373e519524SHoward Hinnant 4383e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4393e519524SHoward Hinnant OutputIterator 4403e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4413e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4423e519524SHoward Hinnant 4433e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4443e519524SHoward Hinnant OutputIterator 4453e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4463e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4493e519524SHoward Hinnant OutputIterator 4503e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4513e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4543e519524SHoward Hinnant OutputIterator 4553e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4563e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4593e519524SHoward Hinnant OutputIterator 4603e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4613e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4623e519524SHoward Hinnant 4633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4643e519524SHoward Hinnant OutputIterator 4653e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4663e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4693e519524SHoward Hinnant OutputIterator 4703e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4713e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4743e519524SHoward Hinnant void 4753e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4763e519524SHoward Hinnant 4773e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4783e519524SHoward Hinnant void 4793e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4803e519524SHoward Hinnant 4813e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4823e519524SHoward Hinnant void 4833e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4843e519524SHoward Hinnant 4853e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4863e519524SHoward Hinnant void 4873e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4883e519524SHoward Hinnant 4893e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4903e519524SHoward Hinnant void 4913e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4923e519524SHoward Hinnant 4933e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4943e519524SHoward Hinnant void 4953e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4963e519524SHoward Hinnant 4973e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4983e519524SHoward Hinnant void 4993e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5003e519524SHoward Hinnant 5013e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5023e519524SHoward Hinnant void 5033e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5043e519524SHoward Hinnant 5053e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5063e519524SHoward Hinnant bool 5073e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5083e519524SHoward Hinnant 5093e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5103e519524SHoward Hinnant bool 5113e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5123e519524SHoward Hinnant 5133e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5143e519524SHoward Hinnant RandomAccessIterator 5153e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5163e519524SHoward Hinnant 5173e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5183e519524SHoward Hinnant RandomAccessIterator 5193e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5203e519524SHoward Hinnant 5214eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5224eb27b79SHoward Hinnant ForwardIterator 5234eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 5244eb27b79SHoward Hinnant 5254eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5264eb27b79SHoward Hinnant ForwardIterator 5274eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 5284eb27b79SHoward Hinnant 5293e519524SHoward Hinnanttemplate <class T> 5303e519524SHoward Hinnant const T& 5313e519524SHoward Hinnant min(const T& a, const T& b); 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class T, class Compare> 5343e519524SHoward Hinnant const T& 5353e519524SHoward Hinnant min(const T& a, const T& b, Compare comp); 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate<class T> 5384eb27b79SHoward Hinnant T 5394eb27b79SHoward Hinnant min(initializer_list<T> t); 5403e519524SHoward Hinnant 5413e519524SHoward Hinnanttemplate<class T, class Compare> 5424eb27b79SHoward Hinnant T 5434eb27b79SHoward Hinnant min(initializer_list<T> t, Compare comp); 5443e519524SHoward Hinnant 5453e519524SHoward Hinnanttemplate <class ForwardIterator> 5463e519524SHoward Hinnant ForwardIterator 5473e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5483e519524SHoward Hinnant 5493e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5503e519524SHoward Hinnant ForwardIterator 5513e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5523e519524SHoward Hinnant 5534eb27b79SHoward Hinnanttemplate <class T> 5544eb27b79SHoward Hinnant const T& 5554eb27b79SHoward Hinnant max(const T& a, const T& b); 5564eb27b79SHoward Hinnant 5574eb27b79SHoward Hinnanttemplate <class T, class Compare> 5584eb27b79SHoward Hinnant const T& 5594eb27b79SHoward Hinnant max(const T& a, const T& b, Compare comp); 5604eb27b79SHoward Hinnant 5614eb27b79SHoward Hinnanttemplate<class T> 5624eb27b79SHoward Hinnant T 5634eb27b79SHoward Hinnant max(initializer_list<T> t); 5644eb27b79SHoward Hinnant 5654eb27b79SHoward Hinnanttemplate<class T, class Compare> 5664eb27b79SHoward Hinnant T 5674eb27b79SHoward Hinnant max(initializer_list<T> t, Compare comp); 5684eb27b79SHoward Hinnant 5694eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5704eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5714eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last); 5724eb27b79SHoward Hinnant 5734eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5744eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5754eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 5764eb27b79SHoward Hinnant 5774eb27b79SHoward Hinnanttemplate<class T> 5784eb27b79SHoward Hinnant pair<const T&, const T&> 5794eb27b79SHoward Hinnant minmax(const T& a, const T& b); 5804eb27b79SHoward Hinnant 5814eb27b79SHoward Hinnanttemplate<class T, class Compare> 5824eb27b79SHoward Hinnant pair<const T&, const T&> 5834eb27b79SHoward Hinnant minmax(const T& a, const T& b, Compare comp); 5844eb27b79SHoward Hinnant 5854eb27b79SHoward Hinnanttemplate<class T> 5864eb27b79SHoward Hinnant pair<T, T> 5874eb27b79SHoward Hinnant minmax(initializer_list<T> t); 5884eb27b79SHoward Hinnant 5894eb27b79SHoward Hinnanttemplate<class T, class Compare> 5904eb27b79SHoward Hinnant pair<T, T> 5914eb27b79SHoward Hinnant minmax(initializer_list<T> t, Compare comp); 5924eb27b79SHoward Hinnant 5933e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5943e519524SHoward Hinnant bool 5953e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5963e519524SHoward Hinnant 5973e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5983e519524SHoward Hinnant bool 5993e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6003e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6013e519524SHoward Hinnant 6023e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6033e519524SHoward Hinnant bool 6043e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6053e519524SHoward Hinnant 6063e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6073e519524SHoward Hinnant bool 6083e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6093e519524SHoward Hinnant 6103e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6113e519524SHoward Hinnant bool 6123e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6133e519524SHoward Hinnant 6143e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6153e519524SHoward Hinnant bool 6163e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6173e519524SHoward Hinnant 6183e519524SHoward Hinnant} // std 6193e519524SHoward Hinnant 6203e519524SHoward Hinnant*/ 6213e519524SHoward Hinnant 6223e519524SHoward Hinnant#include <__config> 6233e519524SHoward Hinnant#include <initializer_list> 6243e519524SHoward Hinnant#include <type_traits> 6253e519524SHoward Hinnant#include <cstring> 6263e519524SHoward Hinnant#include <utility> 6273e519524SHoward Hinnant#include <memory> 6283e519524SHoward Hinnant#include <iterator> 629a1d07d57SHoward Hinnant#include <cstddef> 6303e519524SHoward Hinnant 631ab4f4382SHoward Hinnant#include <__undef_min_max> 632ab4f4382SHoward Hinnant 633073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6343e519524SHoward Hinnant#pragma GCC system_header 635073458b1SHoward Hinnant#endif 6363e519524SHoward Hinnant 6373e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6383e519524SHoward Hinnant 6393e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6403e519524SHoward Hinnantstruct __equal_to 6413e519524SHoward Hinnant{ 6423e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6433e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6443e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6453e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6463e519524SHoward Hinnant}; 6473e519524SHoward Hinnant 6483e519524SHoward Hinnanttemplate <class _T1> 6493e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6503e519524SHoward Hinnant{ 6513e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6523e519524SHoward Hinnant}; 6533e519524SHoward Hinnant 6543e519524SHoward Hinnanttemplate <class _T1> 6553e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6563e519524SHoward Hinnant{ 6573e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6583e519524SHoward Hinnant}; 6593e519524SHoward Hinnant 6603e519524SHoward Hinnanttemplate <class _T1> 6613e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6623e519524SHoward Hinnant{ 6633e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6643e519524SHoward Hinnant}; 6653e519524SHoward Hinnant 6663e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6673e519524SHoward Hinnantstruct __less 6683e519524SHoward Hinnant{ 6693e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6703e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6713e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6723e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6733e519524SHoward Hinnant}; 6743e519524SHoward Hinnant 6753e519524SHoward Hinnanttemplate <class _T1> 6763e519524SHoward Hinnantstruct __less<_T1, _T1> 6773e519524SHoward Hinnant{ 6783e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6793e519524SHoward Hinnant}; 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class _T1> 6823e519524SHoward Hinnantstruct __less<const _T1, _T1> 6833e519524SHoward Hinnant{ 6843e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6853e519524SHoward Hinnant}; 6863e519524SHoward Hinnant 6873e519524SHoward Hinnanttemplate <class _T1> 6883e519524SHoward Hinnantstruct __less<_T1, const _T1> 6893e519524SHoward Hinnant{ 6903e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6913e519524SHoward Hinnant}; 6923e519524SHoward Hinnant 6933e519524SHoward Hinnanttemplate <class _Predicate> 6943e519524SHoward Hinnantclass __negate 6953e519524SHoward Hinnant{ 6963e519524SHoward Hinnantprivate: 6973e519524SHoward Hinnant _Predicate __p_; 6983e519524SHoward Hinnantpublic: 6993e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7003e519524SHoward Hinnant 7013e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7023e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7033e519524SHoward Hinnant 7043e519524SHoward Hinnant template <class _T1> 7053e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7063e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7073e519524SHoward Hinnant 7083e519524SHoward Hinnant template <class _T1, class _T2> 7093e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7103e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7113e519524SHoward Hinnant}; 7123e519524SHoward Hinnant 713f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 7143e519524SHoward Hinnant 7153e519524SHoward Hinnanttemplate <class _Compare> 7163e519524SHoward Hinnantstruct __debug_less 7173e519524SHoward Hinnant{ 7183e519524SHoward Hinnant _Compare __comp_; 7193e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 7203e519524SHoward Hinnant template <class _Tp, class _Up> 7213e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7223e519524SHoward Hinnant { 7233e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7243e519524SHoward Hinnant if (__r) 725f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 7263e519524SHoward Hinnant return __r; 7273e519524SHoward Hinnant } 7283e519524SHoward Hinnant}; 7293e519524SHoward Hinnant 730f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 7313e519524SHoward Hinnant 732c8edcb36SHoward Hinnant// Precondition: __x != 0 733c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 734c206366fSHoward Hinnantunsigned 735c206366fSHoward Hinnant__ctz(unsigned __x) 736c206366fSHoward Hinnant{ 737c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 738c206366fSHoward Hinnant} 739c206366fSHoward Hinnant 740c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 741c206366fSHoward Hinnantunsigned long 742c206366fSHoward Hinnant__ctz(unsigned long __x) 743c206366fSHoward Hinnant{ 744c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 745c206366fSHoward Hinnant} 746c206366fSHoward Hinnant 747c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 748c206366fSHoward Hinnantunsigned long long 749c206366fSHoward Hinnant__ctz(unsigned long long __x) 750c206366fSHoward Hinnant{ 751c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 752c206366fSHoward Hinnant} 753c8edcb36SHoward Hinnant 754c8edcb36SHoward Hinnant// Precondition: __x != 0 755c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 756c206366fSHoward Hinnantunsigned 757c206366fSHoward Hinnant__clz(unsigned __x) 758c206366fSHoward Hinnant{ 759c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 760c206366fSHoward Hinnant} 761c206366fSHoward Hinnant 762c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 763c206366fSHoward Hinnantunsigned long 764c206366fSHoward Hinnant__clz(unsigned long __x) 765c206366fSHoward Hinnant{ 766c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 767c206366fSHoward Hinnant} 768c206366fSHoward Hinnant 769c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 770c206366fSHoward Hinnantunsigned long long 771c206366fSHoward Hinnant__clz(unsigned long long __x) 772c206366fSHoward Hinnant{ 773c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 774c206366fSHoward Hinnant} 775c8edcb36SHoward Hinnant 776c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 777c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 778c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 779c8edcb36SHoward Hinnant 7803e519524SHoward Hinnant// all_of 7813e519524SHoward Hinnant 7823e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7843e519524SHoward Hinnantbool 7853e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7863e519524SHoward Hinnant{ 7873e519524SHoward Hinnant for (; __first != __last; ++__first) 7883e519524SHoward Hinnant if (!__pred(*__first)) 7893e519524SHoward Hinnant return false; 7903e519524SHoward Hinnant return true; 7913e519524SHoward Hinnant} 7923e519524SHoward Hinnant 7933e519524SHoward Hinnant// any_of 7943e519524SHoward Hinnant 7953e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7973e519524SHoward Hinnantbool 7983e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7993e519524SHoward Hinnant{ 8003e519524SHoward Hinnant for (; __first != __last; ++__first) 8013e519524SHoward Hinnant if (__pred(*__first)) 8023e519524SHoward Hinnant return true; 8033e519524SHoward Hinnant return false; 8043e519524SHoward Hinnant} 8053e519524SHoward Hinnant 8063e519524SHoward Hinnant// none_of 8073e519524SHoward Hinnant 8083e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8103e519524SHoward Hinnantbool 8113e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8123e519524SHoward Hinnant{ 8133e519524SHoward Hinnant for (; __first != __last; ++__first) 8143e519524SHoward Hinnant if (__pred(*__first)) 8153e519524SHoward Hinnant return false; 8163e519524SHoward Hinnant return true; 8173e519524SHoward Hinnant} 8183e519524SHoward Hinnant 8193e519524SHoward Hinnant// for_each 8203e519524SHoward Hinnant 8213e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8233e519524SHoward Hinnant_Function 8243e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8253e519524SHoward Hinnant{ 8263e519524SHoward Hinnant for (; __first != __last; ++__first) 8273e519524SHoward Hinnant __f(*__first); 828ce48a113SHoward Hinnant return _VSTD::move(__f); 8293e519524SHoward Hinnant} 8303e519524SHoward Hinnant 8313e519524SHoward Hinnant// find 8323e519524SHoward Hinnant 8333e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8353e519524SHoward Hinnant_InputIterator 836e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8373e519524SHoward Hinnant{ 8383e519524SHoward Hinnant for (; __first != __last; ++__first) 839e4383379SHoward Hinnant if (*__first == __value_) 8403e519524SHoward Hinnant break; 8413e519524SHoward Hinnant return __first; 8423e519524SHoward Hinnant} 8433e519524SHoward Hinnant 8443e519524SHoward Hinnant// find_if 8453e519524SHoward Hinnant 8463e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8483e519524SHoward Hinnant_InputIterator 8493e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8503e519524SHoward Hinnant{ 8513e519524SHoward Hinnant for (; __first != __last; ++__first) 8523e519524SHoward Hinnant if (__pred(*__first)) 8533e519524SHoward Hinnant break; 8543e519524SHoward Hinnant return __first; 8553e519524SHoward Hinnant} 8563e519524SHoward Hinnant 8573e519524SHoward Hinnant// find_if_not 8583e519524SHoward Hinnant 8593e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8613e519524SHoward Hinnant_InputIterator 8623e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8633e519524SHoward Hinnant{ 8643e519524SHoward Hinnant for (; __first != __last; ++__first) 8653e519524SHoward Hinnant if (!__pred(*__first)) 8663e519524SHoward Hinnant break; 8673e519524SHoward Hinnant return __first; 8683e519524SHoward Hinnant} 8693e519524SHoward Hinnant 8703e519524SHoward Hinnant// find_end 8713e519524SHoward Hinnant 8723e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8733e519524SHoward Hinnant_ForwardIterator1 8743e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8753e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 8763e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 8773e519524SHoward Hinnant{ 8783e519524SHoward Hinnant // modeled after search algorithm 8793e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 8803e519524SHoward Hinnant if (__first2 == __last2) 8813e519524SHoward Hinnant return __r; 8823e519524SHoward Hinnant while (true) 8833e519524SHoward Hinnant { 8843e519524SHoward Hinnant while (true) 8853e519524SHoward Hinnant { 8863e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 8873e519524SHoward Hinnant return __r; // (or __last1 if never found) 8883e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 8893e519524SHoward Hinnant break; 8903e519524SHoward Hinnant ++__first1; 8913e519524SHoward Hinnant } 8923e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 8933e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 8943e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 8953e519524SHoward Hinnant while (true) 8963e519524SHoward Hinnant { 8973e519524SHoward Hinnant if (++__m2 == __last2) 8983e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 8993e519524SHoward Hinnant __r = __first1; 9003e519524SHoward Hinnant ++__first1; 9013e519524SHoward Hinnant break; 9023e519524SHoward Hinnant } 9033e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9043e519524SHoward Hinnant return __r; 9053e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9063e519524SHoward Hinnant { 9073e519524SHoward Hinnant ++__first1; 9083e519524SHoward Hinnant break; 9093e519524SHoward Hinnant } // else there is a match, check next elements 9103e519524SHoward Hinnant } 9113e519524SHoward Hinnant } 9123e519524SHoward Hinnant} 9133e519524SHoward Hinnant 9143e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9153e519524SHoward Hinnant_BidirectionalIterator1 9163e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9173e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9183e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9193e519524SHoward Hinnant{ 9203e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9213e519524SHoward Hinnant if (__first2 == __last2) 9223e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9233e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9243e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9253e519524SHoward Hinnant --__l2; 9263e519524SHoward Hinnant while (true) 9273e519524SHoward Hinnant { 9283e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9293e519524SHoward Hinnant while (true) 9303e519524SHoward Hinnant { 9313e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9323e519524SHoward Hinnant return __last1; 9333e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9343e519524SHoward Hinnant break; 9353e519524SHoward Hinnant } 9363e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9373e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9383e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9393e519524SHoward Hinnant while (true) 9403e519524SHoward Hinnant { 9413e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9423e519524SHoward Hinnant return __m1; 9433e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9443e519524SHoward Hinnant return __last1; 9453e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9463e519524SHoward Hinnant { 9473e519524SHoward Hinnant break; 9483e519524SHoward Hinnant } // else there is a match, check next elements 9493e519524SHoward Hinnant } 9503e519524SHoward Hinnant } 9513e519524SHoward Hinnant} 9523e519524SHoward Hinnant 9533e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9543e519524SHoward Hinnant_RandomAccessIterator1 9553e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9563e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9573e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9583e519524SHoward Hinnant{ 9593e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9603e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9613e519524SHoward Hinnant if (__len2 == 0) 9623e519524SHoward Hinnant return __last1; 9633e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9643e519524SHoward Hinnant if (__len1 < __len2) 9653e519524SHoward Hinnant return __last1; 9663e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9673e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9683e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9693e519524SHoward Hinnant --__l2; 9703e519524SHoward Hinnant while (true) 9713e519524SHoward Hinnant { 9723e519524SHoward Hinnant while (true) 9733e519524SHoward Hinnant { 9743e519524SHoward Hinnant if (__s == __l1) 9753e519524SHoward Hinnant return __last1; 9763e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9773e519524SHoward Hinnant break; 9783e519524SHoward Hinnant } 9793e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 9803e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 9813e519524SHoward Hinnant while (true) 9823e519524SHoward Hinnant { 9833e519524SHoward Hinnant if (__m2 == __first2) 9843e519524SHoward Hinnant return __m1; 9853e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 9863e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 9873e519524SHoward Hinnant { 9883e519524SHoward Hinnant break; 9893e519524SHoward Hinnant } 9903e519524SHoward Hinnant } 9913e519524SHoward Hinnant } 9923e519524SHoward Hinnant} 9933e519524SHoward Hinnant 9943e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9963e519524SHoward Hinnant_ForwardIterator1 9973e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9983e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9993e519524SHoward Hinnant{ 1000ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10013e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10023e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10033e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10043e519524SHoward Hinnant} 10053e519524SHoward Hinnant 10063e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10083e519524SHoward Hinnant_ForwardIterator1 10093e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10103e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10113e519524SHoward Hinnant{ 10123e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10133e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1014ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10153e519524SHoward Hinnant} 10163e519524SHoward Hinnant 10173e519524SHoward Hinnant// find_first_of 10183e519524SHoward Hinnant 10193e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10203e519524SHoward Hinnant_ForwardIterator1 10213e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10223e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10233e519524SHoward Hinnant{ 10243e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10253e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10263e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10273e519524SHoward Hinnant return __first1; 10283e519524SHoward Hinnant return __last1; 10293e519524SHoward Hinnant} 10303e519524SHoward Hinnant 10313e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10333e519524SHoward Hinnant_ForwardIterator1 10343e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10353e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10363e519524SHoward Hinnant{ 10373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1039ce48a113SHoward Hinnant return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10403e519524SHoward Hinnant} 10413e519524SHoward Hinnant 10423e519524SHoward Hinnant// adjacent_find 10433e519524SHoward Hinnant 10443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10463e519524SHoward Hinnant_ForwardIterator 10473e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10483e519524SHoward Hinnant{ 10493e519524SHoward Hinnant if (__first != __last) 10503e519524SHoward Hinnant { 10513e519524SHoward Hinnant _ForwardIterator __i = __first; 10523e519524SHoward Hinnant while (++__i != __last) 10533e519524SHoward Hinnant { 10543e519524SHoward Hinnant if (__pred(*__first, *__i)) 10553e519524SHoward Hinnant return __first; 10563e519524SHoward Hinnant __first = __i; 10573e519524SHoward Hinnant } 10583e519524SHoward Hinnant } 10593e519524SHoward Hinnant return __last; 10603e519524SHoward Hinnant} 10613e519524SHoward Hinnant 10623e519524SHoward Hinnanttemplate <class _ForwardIterator> 10633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10643e519524SHoward Hinnant_ForwardIterator 10653e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 10663e519524SHoward Hinnant{ 10673e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1068ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 10693e519524SHoward Hinnant} 10703e519524SHoward Hinnant 10713e519524SHoward Hinnant// count 10723e519524SHoward Hinnant 10733e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10753e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1076e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 10773e519524SHoward Hinnant{ 10783e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10793e519524SHoward Hinnant for (; __first != __last; ++__first) 1080e4383379SHoward Hinnant if (*__first == __value_) 10813e519524SHoward Hinnant ++__r; 10823e519524SHoward Hinnant return __r; 10833e519524SHoward Hinnant} 10843e519524SHoward Hinnant 10853e519524SHoward Hinnant// count_if 10863e519524SHoward Hinnant 10873e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10893e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 10903e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10913e519524SHoward Hinnant{ 10923e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10933e519524SHoward Hinnant for (; __first != __last; ++__first) 10943e519524SHoward Hinnant if (__pred(*__first)) 10953e519524SHoward Hinnant ++__r; 10963e519524SHoward Hinnant return __r; 10973e519524SHoward Hinnant} 10983e519524SHoward Hinnant 10993e519524SHoward Hinnant// mismatch 11003e519524SHoward Hinnant 11013e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11033e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11043e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11053e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11063e519524SHoward Hinnant{ 11073e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11083e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11093e519524SHoward Hinnant break; 11103e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11113e519524SHoward Hinnant} 11123e519524SHoward Hinnant 11133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11153e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11163e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11173e519524SHoward Hinnant{ 11183e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11193e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1120ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11213e519524SHoward Hinnant} 11223e519524SHoward Hinnant 1123*0b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 1124*0b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 1125*0b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 1126*0b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 1127*0b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 1128*0b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 1129*0b0bbd2fSMarshall Clow _BinaryPredicate __pred) 1130*0b0bbd2fSMarshall Clow{ 1131*0b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 1132*0b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 1133*0b0bbd2fSMarshall Clow break; 1134*0b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 1135*0b0bbd2fSMarshall Clow} 1136*0b0bbd2fSMarshall Clow 1137*0b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 1138*0b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 1139*0b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 1140*0b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 1141*0b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 1142*0b0bbd2fSMarshall Clow{ 1143*0b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 1144*0b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1145*0b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 1146*0b0bbd2fSMarshall Clow} 1147*0b0bbd2fSMarshall Clow#endif 1148*0b0bbd2fSMarshall Clow 11493e519524SHoward Hinnant// equal 11503e519524SHoward Hinnant 11513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11533e519524SHoward Hinnantbool 11543e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11553e519524SHoward Hinnant{ 11563e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11573e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11583e519524SHoward Hinnant return false; 11593e519524SHoward Hinnant return true; 11603e519524SHoward Hinnant} 11613e519524SHoward Hinnant 11623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11643e519524SHoward Hinnantbool 11653e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11663e519524SHoward Hinnant{ 11673e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11683e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1169ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11703e519524SHoward Hinnant} 11713e519524SHoward Hinnant 1172*0b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 1173*0b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 1174*0b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 1175*0b0bbd2fSMarshall Clowbool 1176*0b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 1177*0b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 1178*0b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 1179*0b0bbd2fSMarshall Clow{ 1180*0b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 1181*0b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 1182*0b0bbd2fSMarshall Clow return false; 1183*0b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 1184*0b0bbd2fSMarshall Clow} 1185*0b0bbd2fSMarshall Clow 1186*0b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 1187*0b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 1188*0b0bbd2fSMarshall Clowbool 1189*0b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 1190*0b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 1191*0b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 1192*0b0bbd2fSMarshall Clow{ 1193*0b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 1194*0b0bbd2fSMarshall Clow return false; 1195*0b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 1196*0b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 1197*0b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 1198*0b0bbd2fSMarshall Clow} 1199*0b0bbd2fSMarshall Clow 1200*0b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 1201*0b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 1202*0b0bbd2fSMarshall Clowbool 1203*0b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 1204*0b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 1205*0b0bbd2fSMarshall Clow{ 1206*0b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 1207*0b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 1208*0b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 1209*0b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 1210*0b0bbd2fSMarshall Clow} 1211*0b0bbd2fSMarshall Clow 1212*0b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 1213*0b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 1214*0b0bbd2fSMarshall Clowbool 1215*0b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 1216*0b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 1217*0b0bbd2fSMarshall Clow{ 1218*0b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 1219*0b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1220*0b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 1221*0b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 1222*0b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 1223*0b0bbd2fSMarshall Clow} 1224*0b0bbd2fSMarshall Clow#endif 1225*0b0bbd2fSMarshall Clow 12263e519524SHoward Hinnant// is_permutation 12273e519524SHoward Hinnant 12283e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12293e519524SHoward Hinnantbool 12303e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12313e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12323e519524SHoward Hinnant{ 12333e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 12343e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 12353e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12363e519524SHoward Hinnant goto __not_done; 12373e519524SHoward Hinnant return true; 12383e519524SHoward Hinnant__not_done: 12393e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12403e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1241ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12423e519524SHoward Hinnant if (__l1 == _D1(1)) 12433e519524SHoward Hinnant return false; 1244ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12453e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12463e519524SHoward Hinnant // equal elements in [f2, l2) 12473e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12483e519524SHoward Hinnant { 12493e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 12503e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 12513e519524SHoward Hinnant if (__pred(*__j, *__i)) 12523e519524SHoward Hinnant goto __next_iter; 12533e519524SHoward Hinnant { 12543e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12553e519524SHoward Hinnant _D1 __c2 = 0; 12563e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12573e519524SHoward Hinnant if (__pred(*__i, *__j)) 12583e519524SHoward Hinnant ++__c2; 12593e519524SHoward Hinnant if (__c2 == 0) 12603e519524SHoward Hinnant return false; 12613e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 12623e519524SHoward Hinnant _D1 __c1 = 1; 1263ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 12643e519524SHoward Hinnant if (__pred(*__i, *__j)) 12653e519524SHoward Hinnant ++__c1; 12663e519524SHoward Hinnant if (__c1 != __c2) 12673e519524SHoward Hinnant return false; 12683e519524SHoward Hinnant } 12693e519524SHoward Hinnant__next_iter:; 12703e519524SHoward Hinnant } 12713e519524SHoward Hinnant return true; 12723e519524SHoward Hinnant} 12733e519524SHoward Hinnant 12743e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 12753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12763e519524SHoward Hinnantbool 12773e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12783e519524SHoward Hinnant _ForwardIterator2 __first2) 12793e519524SHoward Hinnant{ 12803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12813e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1282ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12833e519524SHoward Hinnant} 12843e519524SHoward Hinnant 1285*0b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 1286*0b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 1287*0b0bbd2fSMarshall Clowbool 1288*0b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1289*0b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 1290*0b0bbd2fSMarshall Clow _BinaryPredicate __pred, 1291*0b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 1292*0b0bbd2fSMarshall Clow{ 1293*0b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1294*0b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 1295*0b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 1296*0b0bbd2fSMarshall Clow goto __not_done; 1297*0b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 1298*0b0bbd2fSMarshall Clow__not_done: 1299*0b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 1300*0b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1301*0b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 1302*0b0bbd2fSMarshall Clow 1303*0b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1304*0b0bbd2fSMarshall Clow _D1 __l2 = _VSTD::distance(__first2, __last2); 1305*0b0bbd2fSMarshall Clow if (__l1 != __l2) 1306*0b0bbd2fSMarshall Clow return false; 1307*0b0bbd2fSMarshall Clow 1308*0b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 1309*0b0bbd2fSMarshall Clow // equal elements in [f2, l2) 1310*0b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 1311*0b0bbd2fSMarshall Clow { 1312*0b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1313*0b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 1314*0b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 1315*0b0bbd2fSMarshall Clow goto __next_iter; 1316*0b0bbd2fSMarshall Clow { 1317*0b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 1318*0b0bbd2fSMarshall Clow _D1 __c2 = 0; 1319*0b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 1320*0b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 1321*0b0bbd2fSMarshall Clow ++__c2; 1322*0b0bbd2fSMarshall Clow if (__c2 == 0) 1323*0b0bbd2fSMarshall Clow return false; 1324*0b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 1325*0b0bbd2fSMarshall Clow _D1 __c1 = 1; 1326*0b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 1327*0b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 1328*0b0bbd2fSMarshall Clow ++__c1; 1329*0b0bbd2fSMarshall Clow if (__c1 != __c2) 1330*0b0bbd2fSMarshall Clow return false; 1331*0b0bbd2fSMarshall Clow } 1332*0b0bbd2fSMarshall Clow__next_iter:; 1333*0b0bbd2fSMarshall Clow } 1334*0b0bbd2fSMarshall Clow return true; 1335*0b0bbd2fSMarshall Clow} 1336*0b0bbd2fSMarshall Clow 1337*0b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 1338*0b0bbd2fSMarshall Clowbool 1339*0b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 1340*0b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 1341*0b0bbd2fSMarshall Clow _BinaryPredicate __pred, 1342*0b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 1343*0b0bbd2fSMarshall Clow{ 1344*0b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 1345*0b0bbd2fSMarshall Clow return false; 1346*0b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 1347*0b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 1348*0b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 1349*0b0bbd2fSMarshall Clow} 1350*0b0bbd2fSMarshall Clow 1351*0b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 1352*0b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 1353*0b0bbd2fSMarshall Clowbool 1354*0b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1355*0b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 1356*0b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 1357*0b0bbd2fSMarshall Clow{ 1358*0b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 1359*0b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 1360*0b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 1361*0b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 1362*0b0bbd2fSMarshall Clow} 1363*0b0bbd2fSMarshall Clow 1364*0b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 1365*0b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 1366*0b0bbd2fSMarshall Clowbool 1367*0b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1368*0b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 1369*0b0bbd2fSMarshall Clow{ 1370*0b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 1371*0b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1372*0b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 1373*0b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 1374*0b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 1375*0b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 1376*0b0bbd2fSMarshall Clow} 1377*0b0bbd2fSMarshall Clow#endif 1378*0b0bbd2fSMarshall Clow 13793e519524SHoward Hinnant// search 13803e519524SHoward Hinnant 13813e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13823e519524SHoward Hinnant_ForwardIterator1 13833e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13843e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 13853e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 13863e519524SHoward Hinnant{ 13873e519524SHoward Hinnant if (__first2 == __last2) 13883e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 13893e519524SHoward Hinnant while (true) 13903e519524SHoward Hinnant { 13913e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 13923e519524SHoward Hinnant while (true) 13933e519524SHoward Hinnant { 13943e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 13953e519524SHoward Hinnant return __last1; 13963e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 13973e519524SHoward Hinnant break; 13983e519524SHoward Hinnant ++__first1; 13993e519524SHoward Hinnant } 14003e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14013e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14023e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14033e519524SHoward Hinnant while (true) 14043e519524SHoward Hinnant { 14053e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 14063e519524SHoward Hinnant return __first1; 14073e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 14083e519524SHoward Hinnant return __last1; 14093e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14103e519524SHoward Hinnant { 14113e519524SHoward Hinnant ++__first1; 14123e519524SHoward Hinnant break; 14133e519524SHoward Hinnant } // else there is a match, check next elements 14143e519524SHoward Hinnant } 14153e519524SHoward Hinnant } 14163e519524SHoward Hinnant} 14173e519524SHoward Hinnant 14183e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14193e519524SHoward Hinnant_RandomAccessIterator1 14203e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14213e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14223e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14233e519524SHoward Hinnant{ 14243e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 14253e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14263e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 14273e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 14283e519524SHoward Hinnant if (__len2 == 0) 14293e519524SHoward Hinnant return __first1; 14303e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 14313e519524SHoward Hinnant if (__len1 < __len2) 14323e519524SHoward Hinnant return __last1; 14333e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14343e519524SHoward Hinnant while (true) 14353e519524SHoward Hinnant { 14363e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14373e519524SHoward Hinnant while (true) 14383e519524SHoward Hinnant { 14393e519524SHoward Hinnant if (__first1 == __s) 14403e519524SHoward Hinnant return __last1; 14413e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14423e519524SHoward Hinnant break; 14433e519524SHoward Hinnant ++__first1; 14443e519524SHoward Hinnant } 1445b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14463e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 14473e519524SHoward Hinnant { 14483e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14493e519524SHoward Hinnant goto __phase2; 14503e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14513e519524SHoward Hinnant goto __phase2; 14523e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14533e519524SHoward Hinnant goto __phase2; 14543e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14553e519524SHoward Hinnant goto __phase2; 14563e519524SHoward Hinnant ++__first1; 14573e519524SHoward Hinnant } 14583e519524SHoward Hinnant switch (__s - __first1) 14593e519524SHoward Hinnant { 14603e519524SHoward Hinnant case 3: 14613e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14623e519524SHoward Hinnant break; 14633e519524SHoward Hinnant ++__first1; 14643e519524SHoward Hinnant case 2: 14653e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14663e519524SHoward Hinnant break; 14673e519524SHoward Hinnant ++__first1; 14683e519524SHoward Hinnant case 1: 14693e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14703e519524SHoward Hinnant break; 14713e519524SHoward Hinnant case 0: 14723e519524SHoward Hinnant return __last1; 14733e519524SHoward Hinnant } 14743e519524SHoward Hinnant __phase2: 1475b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 14763e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 14773e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 14783e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14793e519524SHoward Hinnant while (true) 14803e519524SHoward Hinnant { 14813e519524SHoward Hinnant if (++__m2 == __last2) 14823e519524SHoward Hinnant return __first1; 14833e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 14843e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 14853e519524SHoward Hinnant { 14863e519524SHoward Hinnant ++__first1; 14873e519524SHoward Hinnant break; 14883e519524SHoward Hinnant } 14893e519524SHoward Hinnant } 1490b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14913e519524SHoward Hinnant ++__m2; 14923e519524SHoward Hinnant ++__m1; 14933e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 14943e519524SHoward Hinnant { 14953e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 14963e519524SHoward Hinnant goto __continue; 14973e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 14983e519524SHoward Hinnant goto __continue; 14993e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15003e519524SHoward Hinnant goto __continue; 15013e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15023e519524SHoward Hinnant goto __continue; 15033e519524SHoward Hinnant ++__m1; 15043e519524SHoward Hinnant ++__m2; 15053e519524SHoward Hinnant } 15063e519524SHoward Hinnant switch (__last2 - __m2) 15073e519524SHoward Hinnant { 15083e519524SHoward Hinnant case 3: 15093e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15103e519524SHoward Hinnant break; 15113e519524SHoward Hinnant ++__m1; 15123e519524SHoward Hinnant ++__m2; 15133e519524SHoward Hinnant case 2: 15143e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15153e519524SHoward Hinnant break; 15163e519524SHoward Hinnant ++__m1; 15173e519524SHoward Hinnant ++__m2; 15183e519524SHoward Hinnant case 1: 15193e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15203e519524SHoward Hinnant break; 15213e519524SHoward Hinnant case 0: 15223e519524SHoward Hinnant return __first1; 15233e519524SHoward Hinnant } 15243e519524SHoward Hinnant __continue: 15253e519524SHoward Hinnant ++__first1; 1526b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15273e519524SHoward Hinnant } 15283e519524SHoward Hinnant} 15293e519524SHoward Hinnant 15303e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15323e519524SHoward Hinnant_ForwardIterator1 15333e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15343e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15353e519524SHoward Hinnant{ 1536ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15373e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 15383e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 15393e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 15403e519524SHoward Hinnant} 15413e519524SHoward Hinnant 15423e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15443e519524SHoward Hinnant_ForwardIterator1 15453e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15463e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15473e519524SHoward Hinnant{ 15483e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 15493e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1550ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15513e519524SHoward Hinnant} 15523e519524SHoward Hinnant 15533e519524SHoward Hinnant// search_n 15543e519524SHoward Hinnant 15553e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15563e519524SHoward Hinnant_ForwardIterator 15573e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1558e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15593e519524SHoward Hinnant{ 15603e519524SHoward Hinnant if (__count <= 0) 15613e519524SHoward Hinnant return __first; 15623e519524SHoward Hinnant while (true) 15633e519524SHoward Hinnant { 1564e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15653e519524SHoward Hinnant while (true) 15663e519524SHoward Hinnant { 1567e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15683e519524SHoward Hinnant return __last; 1569e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15703e519524SHoward Hinnant break; 15713e519524SHoward Hinnant ++__first; 15723e519524SHoward Hinnant } 1573e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15743e519524SHoward Hinnant _ForwardIterator __m = __first; 15753e519524SHoward Hinnant _Size __c(0); 15763e519524SHoward Hinnant while (true) 15773e519524SHoward Hinnant { 15783e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15793e519524SHoward Hinnant return __first; 15803e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15813e519524SHoward Hinnant return __last; 1582e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15833e519524SHoward Hinnant { 15843e519524SHoward Hinnant __first = __m; 15853e519524SHoward Hinnant ++__first; 15863e519524SHoward Hinnant break; 15873e519524SHoward Hinnant } // else there is a match, check next elements 15883e519524SHoward Hinnant } 15893e519524SHoward Hinnant } 15903e519524SHoward Hinnant} 15913e519524SHoward Hinnant 15923e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 15933e519524SHoward Hinnant_RandomAccessIterator 15943e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1595e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15963e519524SHoward Hinnant{ 15973e519524SHoward Hinnant if (__count <= 0) 15983e519524SHoward Hinnant return __first; 15993e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16003e519524SHoward Hinnant if (__len < __count) 16013e519524SHoward Hinnant return __last; 16023e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16033e519524SHoward Hinnant while (true) 16043e519524SHoward Hinnant { 1605e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16063e519524SHoward Hinnant while (true) 16073e519524SHoward Hinnant { 1608b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16093e519524SHoward Hinnant return __last; 1610e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16113e519524SHoward Hinnant break; 16123e519524SHoward Hinnant ++__first; 16133e519524SHoward Hinnant } 1614e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16153e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16163e519524SHoward Hinnant _Size __c(0); 16173e519524SHoward Hinnant while (true) 16183e519524SHoward Hinnant { 16193e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16203e519524SHoward Hinnant return __first; 16213e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1622e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16233e519524SHoward Hinnant { 16243e519524SHoward Hinnant __first = __m; 16253e519524SHoward Hinnant ++__first; 16263e519524SHoward Hinnant break; 16273e519524SHoward Hinnant } // else there is a match, check next elements 16283e519524SHoward Hinnant } 16293e519524SHoward Hinnant } 16303e519524SHoward Hinnant} 16313e519524SHoward Hinnant 16323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16343e519524SHoward Hinnant_ForwardIterator 16353e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1636e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16373e519524SHoward Hinnant{ 1638ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1639e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 16403e519524SHoward Hinnant} 16413e519524SHoward Hinnant 16423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16443e519524SHoward Hinnant_ForwardIterator 1645e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16463e519524SHoward Hinnant{ 16473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1648e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 16493e519524SHoward Hinnant} 16503e519524SHoward Hinnant 16513e519524SHoward Hinnant// copy 16523e519524SHoward Hinnant 16533e519524SHoward Hinnanttemplate <class _Iter> 16543e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 16553e519524SHoward Hinnant{ 16563e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16573e519524SHoward Hinnant}; 16583e519524SHoward Hinnant 16593e519524SHoward Hinnanttemplate <class _Iter> 16603e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 16613e519524SHoward Hinnant{ 16623e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16633e519524SHoward Hinnant}; 16643e519524SHoward Hinnant 16653e519524SHoward Hinnanttemplate <class _Iter> 16663e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 16673e519524SHoward Hinnant{ 16683e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16693e519524SHoward Hinnant}; 16703e519524SHoward Hinnant 16713e519524SHoward Hinnanttemplate <class _Iter> 16723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16733e519524SHoward Hinnant_Iter 16743e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16753e519524SHoward Hinnant{ 16763e519524SHoward Hinnant return __i; 16773e519524SHoward Hinnant} 16783e519524SHoward Hinnant 16793e519524SHoward Hinnanttemplate <class _Tp> 16803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16813e519524SHoward Hinnanttypename enable_if 16823e519524SHoward Hinnant< 1683ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16843e519524SHoward Hinnant _Tp* 16853e519524SHoward Hinnant>::type 16863e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16873e519524SHoward Hinnant{ 16883e519524SHoward Hinnant return __i.base(); 16893e519524SHoward Hinnant} 16903e519524SHoward Hinnant 16913e519524SHoward Hinnanttemplate <class _Tp> 16923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16933e519524SHoward Hinnanttypename enable_if 16943e519524SHoward Hinnant< 1695ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16963e519524SHoward Hinnant _Tp* 16973e519524SHoward Hinnant>::type 16983e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16993e519524SHoward Hinnant{ 17003e519524SHoward Hinnant return __i.base(); 17013e519524SHoward Hinnant} 17023e519524SHoward Hinnant 17033e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17053e519524SHoward Hinnant_OutputIterator 17063e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17073e519524SHoward Hinnant{ 17083e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17093e519524SHoward Hinnant *__result = *__first; 17103e519524SHoward Hinnant return __result; 17113e519524SHoward Hinnant} 17123e519524SHoward Hinnant 17133e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17153e519524SHoward Hinnanttypename enable_if 17163e519524SHoward Hinnant< 17173e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1718ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17193e519524SHoward Hinnant _Up* 17203e519524SHoward Hinnant>::type 17213e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17223e519524SHoward Hinnant{ 17233e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1724ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17253e519524SHoward Hinnant return __result + __n; 17263e519524SHoward Hinnant} 17273e519524SHoward Hinnant 17283e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17303e519524SHoward Hinnant_OutputIterator 17313e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17323e519524SHoward Hinnant{ 1733ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17343e519524SHoward Hinnant} 17353e519524SHoward Hinnant 17363e519524SHoward Hinnant// copy_backward 17373e519524SHoward Hinnant 1738d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17403e519524SHoward Hinnant_OutputIterator 1741d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17423e519524SHoward Hinnant{ 17433e519524SHoward Hinnant while (__first != __last) 17443e519524SHoward Hinnant *--__result = *--__last; 17453e519524SHoward Hinnant return __result; 17463e519524SHoward Hinnant} 17473e519524SHoward Hinnant 17483e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17503e519524SHoward Hinnanttypename enable_if 17513e519524SHoward Hinnant< 17523e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1753ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17543e519524SHoward Hinnant _Up* 17553e519524SHoward Hinnant>::type 17563e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17573e519524SHoward Hinnant{ 17583e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17593e519524SHoward Hinnant __result -= __n; 1760ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17613e519524SHoward Hinnant return __result; 17623e519524SHoward Hinnant} 17633e519524SHoward Hinnant 17643e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnant_BidirectionalIterator2 17673e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17683e519524SHoward Hinnant _BidirectionalIterator2 __result) 17693e519524SHoward Hinnant{ 1770ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17713e519524SHoward Hinnant} 17723e519524SHoward Hinnant 17733e519524SHoward Hinnant// copy_if 17743e519524SHoward Hinnant 17753e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17773e519524SHoward Hinnant_OutputIterator 17783e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17793e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17803e519524SHoward Hinnant{ 17813e519524SHoward Hinnant for (; __first != __last; ++__first) 17823e519524SHoward Hinnant { 17833e519524SHoward Hinnant if (__pred(*__first)) 17843e519524SHoward Hinnant { 17853e519524SHoward Hinnant *__result = *__first; 17863e519524SHoward Hinnant ++__result; 17873e519524SHoward Hinnant } 17883e519524SHoward Hinnant } 17893e519524SHoward Hinnant return __result; 17903e519524SHoward Hinnant} 17913e519524SHoward Hinnant 17923e519524SHoward Hinnant// copy_n 17933e519524SHoward Hinnant 17943e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17963e519524SHoward Hinnanttypename enable_if 17973e519524SHoward Hinnant< 17983e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 17993e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18003e519524SHoward Hinnant _OutputIterator 18013e519524SHoward Hinnant>::type 18023e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18033e519524SHoward Hinnant{ 180499847d2bSHoward Hinnant if (__n > 0) 180599847d2bSHoward Hinnant { 18063e519524SHoward Hinnant *__result = *__first; 180799847d2bSHoward Hinnant ++__result; 180899847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 180999847d2bSHoward Hinnant { 181099847d2bSHoward Hinnant ++__first; 181199847d2bSHoward Hinnant *__result = *__first; 181299847d2bSHoward Hinnant ++__result; 181399847d2bSHoward Hinnant } 181499847d2bSHoward Hinnant } 18153e519524SHoward Hinnant return __result; 18163e519524SHoward Hinnant} 18173e519524SHoward Hinnant 18183e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18203e519524SHoward Hinnanttypename enable_if 18213e519524SHoward Hinnant< 18223e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18233e519524SHoward Hinnant _OutputIterator 18243e519524SHoward Hinnant>::type 18253e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18263e519524SHoward Hinnant{ 1827ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18283e519524SHoward Hinnant} 18293e519524SHoward Hinnant 18303e519524SHoward Hinnant// move 18313e519524SHoward Hinnant 18323e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18343e519524SHoward Hinnant_OutputIterator 18353e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18363e519524SHoward Hinnant{ 18373e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 1838ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18393e519524SHoward Hinnant return __result; 18403e519524SHoward Hinnant} 18413e519524SHoward Hinnant 18423e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18443e519524SHoward Hinnanttypename enable_if 18453e519524SHoward Hinnant< 18463e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1847ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18483e519524SHoward Hinnant _Up* 18493e519524SHoward Hinnant>::type 18503e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18513e519524SHoward Hinnant{ 18523e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1853ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18543e519524SHoward Hinnant return __result + __n; 18553e519524SHoward Hinnant} 18563e519524SHoward Hinnant 18573e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18593e519524SHoward Hinnant_OutputIterator 18603e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18613e519524SHoward Hinnant{ 1862ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18633e519524SHoward Hinnant} 18643e519524SHoward Hinnant 18653e519524SHoward Hinnant// move_backward 18663e519524SHoward Hinnant 18673e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18693e519524SHoward Hinnant_OutputIterator 18703e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18713e519524SHoward Hinnant{ 18723e519524SHoward Hinnant while (__first != __last) 1873ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18743e519524SHoward Hinnant return __result; 18753e519524SHoward Hinnant} 18763e519524SHoward Hinnant 18773e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18793e519524SHoward Hinnanttypename enable_if 18803e519524SHoward Hinnant< 18813e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1882ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18833e519524SHoward Hinnant _Up* 18843e519524SHoward Hinnant>::type 18853e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18863e519524SHoward Hinnant{ 18873e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18883e519524SHoward Hinnant __result -= __n; 1889ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18903e519524SHoward Hinnant return __result; 18913e519524SHoward Hinnant} 18923e519524SHoward Hinnant 18933e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18953e519524SHoward Hinnant_BidirectionalIterator2 18963e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18973e519524SHoward Hinnant _BidirectionalIterator2 __result) 18983e519524SHoward Hinnant{ 1899ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19003e519524SHoward Hinnant} 19013e519524SHoward Hinnant 19023e519524SHoward Hinnant// iter_swap 19033e519524SHoward Hinnant 1904a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19053e519524SHoward Hinnant 19063e519524SHoward Hinnant// transform 19073e519524SHoward Hinnant 19083e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19103e519524SHoward Hinnant_OutputIterator 19113e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19123e519524SHoward Hinnant{ 19133e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19143e519524SHoward Hinnant *__result = __op(*__first); 19153e519524SHoward Hinnant return __result; 19163e519524SHoward Hinnant} 19173e519524SHoward Hinnant 19183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19203e519524SHoward Hinnant_OutputIterator 19213e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19223e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19233e519524SHoward Hinnant{ 19243e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 19253e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19263e519524SHoward Hinnant return __result; 19273e519524SHoward Hinnant} 19283e519524SHoward Hinnant 19293e519524SHoward Hinnant// replace 19303e519524SHoward Hinnant 19313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19333e519524SHoward Hinnantvoid 19343e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19353e519524SHoward Hinnant{ 19363e519524SHoward Hinnant for (; __first != __last; ++__first) 19373e519524SHoward Hinnant if (*__first == __old_value) 19383e519524SHoward Hinnant *__first = __new_value; 19393e519524SHoward Hinnant} 19403e519524SHoward Hinnant 19413e519524SHoward Hinnant// replace_if 19423e519524SHoward Hinnant 19433e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19453e519524SHoward Hinnantvoid 19463e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19473e519524SHoward Hinnant{ 19483e519524SHoward Hinnant for (; __first != __last; ++__first) 19493e519524SHoward Hinnant if (__pred(*__first)) 19503e519524SHoward Hinnant *__first = __new_value; 19513e519524SHoward Hinnant} 19523e519524SHoward Hinnant 19533e519524SHoward Hinnant// replace_copy 19543e519524SHoward Hinnant 19553e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19573e519524SHoward Hinnant_OutputIterator 19583e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19593e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19603e519524SHoward Hinnant{ 19613e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19623e519524SHoward Hinnant if (*__first == __old_value) 19633e519524SHoward Hinnant *__result = __new_value; 19643e519524SHoward Hinnant else 19653e519524SHoward Hinnant *__result = *__first; 19663e519524SHoward Hinnant return __result; 19673e519524SHoward Hinnant} 19683e519524SHoward Hinnant 19693e519524SHoward Hinnant// replace_copy_if 19703e519524SHoward Hinnant 19713e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 19723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19733e519524SHoward Hinnant_OutputIterator 19743e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19753e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19763e519524SHoward Hinnant{ 19773e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19783e519524SHoward Hinnant if (__pred(*__first)) 19793e519524SHoward Hinnant *__result = __new_value; 19803e519524SHoward Hinnant else 19813e519524SHoward Hinnant *__result = *__first; 19823e519524SHoward Hinnant return __result; 19833e519524SHoward Hinnant} 19843e519524SHoward Hinnant 19853e519524SHoward Hinnant// fill_n 19863e519524SHoward Hinnant 19873e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19893e519524SHoward Hinnant_OutputIterator 1990e4383379SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_, false_type) 19913e519524SHoward Hinnant{ 19923e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 1993e4383379SHoward Hinnant *__first = __value_; 19943e519524SHoward Hinnant return __first; 19953e519524SHoward Hinnant} 19963e519524SHoward Hinnant 19973e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19993e519524SHoward Hinnant_OutputIterator 2000e4383379SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_, true_type) 20013e519524SHoward Hinnant{ 20023e519524SHoward Hinnant if (__n > 0) 2003e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20043e519524SHoward Hinnant return __first + __n; 20053e519524SHoward Hinnant} 20063e519524SHoward Hinnant 20073e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20093e519524SHoward Hinnant_OutputIterator 2010e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20113e519524SHoward Hinnant{ 2012e4383379SHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_, integral_constant<bool, 20133e519524SHoward Hinnant is_pointer<_OutputIterator>::value && 2014ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value && 20153e519524SHoward Hinnant sizeof(_Tp) == 1>()); 20163e519524SHoward Hinnant} 20173e519524SHoward Hinnant 20183e519524SHoward Hinnant// fill 20193e519524SHoward Hinnant 20203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20223e519524SHoward Hinnantvoid 2023e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20243e519524SHoward Hinnant{ 20253e519524SHoward Hinnant for (; __first != __last; ++__first) 2026e4383379SHoward Hinnant *__first = __value_; 20273e519524SHoward Hinnant} 20283e519524SHoward Hinnant 20293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20313e519524SHoward Hinnantvoid 2032e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20333e519524SHoward Hinnant{ 2034e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20353e519524SHoward Hinnant} 20363e519524SHoward Hinnant 20373e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20393e519524SHoward Hinnantvoid 2040e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20413e519524SHoward Hinnant{ 2042e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20433e519524SHoward Hinnant} 20443e519524SHoward Hinnant 20453e519524SHoward Hinnant// generate 20463e519524SHoward Hinnant 20473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20493e519524SHoward Hinnantvoid 20503e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20513e519524SHoward Hinnant{ 20523e519524SHoward Hinnant for (; __first != __last; ++__first) 20533e519524SHoward Hinnant *__first = __gen(); 20543e519524SHoward Hinnant} 20553e519524SHoward Hinnant 20563e519524SHoward Hinnant// generate_n 20573e519524SHoward Hinnant 20583e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20603e519524SHoward Hinnant_OutputIterator 20613e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 20623e519524SHoward Hinnant{ 20633e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 20643e519524SHoward Hinnant *__first = __gen(); 20653e519524SHoward Hinnant return __first; 20663e519524SHoward Hinnant} 20673e519524SHoward Hinnant 20683e519524SHoward Hinnant// remove 20693e519524SHoward Hinnant 20703e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20713e519524SHoward Hinnant_ForwardIterator 2072e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20733e519524SHoward Hinnant{ 2074e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20753e519524SHoward Hinnant if (__first != __last) 20763e519524SHoward Hinnant { 20773e519524SHoward Hinnant _ForwardIterator __i = __first; 20783e519524SHoward Hinnant while (++__i != __last) 20793e519524SHoward Hinnant { 2080e4383379SHoward Hinnant if (!(*__i == __value_)) 20813e519524SHoward Hinnant { 2082ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20833e519524SHoward Hinnant ++__first; 20843e519524SHoward Hinnant } 20853e519524SHoward Hinnant } 20863e519524SHoward Hinnant } 20873e519524SHoward Hinnant return __first; 20883e519524SHoward Hinnant} 20893e519524SHoward Hinnant 20903e519524SHoward Hinnant// remove_if 20913e519524SHoward Hinnant 20923e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 20933e519524SHoward Hinnant_ForwardIterator 20943e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 20953e519524SHoward Hinnant{ 2096ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 20973e519524SHoward Hinnant (__first, __last, __pred); 20983e519524SHoward Hinnant if (__first != __last) 20993e519524SHoward Hinnant { 21003e519524SHoward Hinnant _ForwardIterator __i = __first; 21013e519524SHoward Hinnant while (++__i != __last) 21023e519524SHoward Hinnant { 21033e519524SHoward Hinnant if (!__pred(*__i)) 21043e519524SHoward Hinnant { 2105ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21063e519524SHoward Hinnant ++__first; 21073e519524SHoward Hinnant } 21083e519524SHoward Hinnant } 21093e519524SHoward Hinnant } 21103e519524SHoward Hinnant return __first; 21113e519524SHoward Hinnant} 21123e519524SHoward Hinnant 21133e519524SHoward Hinnant// remove_copy 21143e519524SHoward Hinnant 21153e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21173e519524SHoward Hinnant_OutputIterator 2118e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21193e519524SHoward Hinnant{ 21203e519524SHoward Hinnant for (; __first != __last; ++__first) 21213e519524SHoward Hinnant { 2122e4383379SHoward Hinnant if (!(*__first == __value_)) 21233e519524SHoward Hinnant { 21243e519524SHoward Hinnant *__result = *__first; 21253e519524SHoward Hinnant ++__result; 21263e519524SHoward Hinnant } 21273e519524SHoward Hinnant } 21283e519524SHoward Hinnant return __result; 21293e519524SHoward Hinnant} 21303e519524SHoward Hinnant 21313e519524SHoward Hinnant// remove_copy_if 21323e519524SHoward Hinnant 21333e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21353e519524SHoward Hinnant_OutputIterator 21363e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21373e519524SHoward Hinnant{ 21383e519524SHoward Hinnant for (; __first != __last; ++__first) 21393e519524SHoward Hinnant { 21403e519524SHoward Hinnant if (!__pred(*__first)) 21413e519524SHoward Hinnant { 21423e519524SHoward Hinnant *__result = *__first; 21433e519524SHoward Hinnant ++__result; 21443e519524SHoward Hinnant } 21453e519524SHoward Hinnant } 21463e519524SHoward Hinnant return __result; 21473e519524SHoward Hinnant} 21483e519524SHoward Hinnant 21493e519524SHoward Hinnant// unique 21503e519524SHoward Hinnant 21513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21523e519524SHoward Hinnant_ForwardIterator 21533e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21543e519524SHoward Hinnant{ 2155ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21563e519524SHoward Hinnant (__first, __last, __pred); 21573e519524SHoward Hinnant if (__first != __last) 21583e519524SHoward Hinnant { 21593e519524SHoward Hinnant // ... a a ? ... 21603e519524SHoward Hinnant // f i 21613e519524SHoward Hinnant _ForwardIterator __i = __first; 21623e519524SHoward Hinnant for (++__i; ++__i != __last;) 21633e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2164ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21653e519524SHoward Hinnant ++__first; 21663e519524SHoward Hinnant } 21673e519524SHoward Hinnant return __first; 21683e519524SHoward Hinnant} 21693e519524SHoward Hinnant 21703e519524SHoward Hinnanttemplate <class _ForwardIterator> 21713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21723e519524SHoward Hinnant_ForwardIterator 21733e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21743e519524SHoward Hinnant{ 21753e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2176ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21773e519524SHoward Hinnant} 21783e519524SHoward Hinnant 21793e519524SHoward Hinnant// unique_copy 21803e519524SHoward Hinnant 21813e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21823e519524SHoward Hinnant_OutputIterator 21833e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21843e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21853e519524SHoward Hinnant{ 21863e519524SHoward Hinnant if (__first != __last) 21873e519524SHoward Hinnant { 21883e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 21893e519524SHoward Hinnant *__result = __t; 21903e519524SHoward Hinnant ++__result; 21913e519524SHoward Hinnant while (++__first != __last) 21923e519524SHoward Hinnant { 21933e519524SHoward Hinnant if (!__pred(__t, *__first)) 21943e519524SHoward Hinnant { 21953e519524SHoward Hinnant __t = *__first; 21963e519524SHoward Hinnant *__result = __t; 21973e519524SHoward Hinnant ++__result; 21983e519524SHoward Hinnant } 21993e519524SHoward Hinnant } 22003e519524SHoward Hinnant } 22013e519524SHoward Hinnant return __result; 22023e519524SHoward Hinnant} 22033e519524SHoward Hinnant 22043e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22053e519524SHoward Hinnant_OutputIterator 22063e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22073e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22083e519524SHoward Hinnant{ 22093e519524SHoward Hinnant if (__first != __last) 22103e519524SHoward Hinnant { 22113e519524SHoward Hinnant _ForwardIterator __i = __first; 22123e519524SHoward Hinnant *__result = *__i; 22133e519524SHoward Hinnant ++__result; 22143e519524SHoward Hinnant while (++__first != __last) 22153e519524SHoward Hinnant { 22163e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22173e519524SHoward Hinnant { 22183e519524SHoward Hinnant *__result = *__first; 22193e519524SHoward Hinnant ++__result; 22203e519524SHoward Hinnant __i = __first; 22213e519524SHoward Hinnant } 22223e519524SHoward Hinnant } 22233e519524SHoward Hinnant } 22243e519524SHoward Hinnant return __result; 22253e519524SHoward Hinnant} 22263e519524SHoward Hinnant 22273e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22283e519524SHoward Hinnant_ForwardIterator 22293e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22303e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22313e519524SHoward Hinnant{ 22323e519524SHoward Hinnant if (__first != __last) 22333e519524SHoward Hinnant { 22343e519524SHoward Hinnant *__result = *__first; 22353e519524SHoward Hinnant while (++__first != __last) 22363e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22373e519524SHoward Hinnant *++__result = *__first; 22383e519524SHoward Hinnant ++__result; 22393e519524SHoward Hinnant } 22403e519524SHoward Hinnant return __result; 22413e519524SHoward Hinnant} 22423e519524SHoward Hinnant 22433e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22453e519524SHoward Hinnant_OutputIterator 22463e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22473e519524SHoward Hinnant{ 2248ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22493e519524SHoward Hinnant (__first, __last, __result, __pred, 22503e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22513e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22523e519524SHoward Hinnant} 22533e519524SHoward Hinnant 22543e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22563e519524SHoward Hinnant_OutputIterator 22573e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22583e519524SHoward Hinnant{ 22593e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2260ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22613e519524SHoward Hinnant} 22623e519524SHoward Hinnant 22633e519524SHoward Hinnant// reverse 22643e519524SHoward Hinnant 22653e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22673e519524SHoward Hinnantvoid 22683e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22693e519524SHoward Hinnant{ 22703e519524SHoward Hinnant while (__first != __last) 22713e519524SHoward Hinnant { 22723e519524SHoward Hinnant if (__first == --__last) 22733e519524SHoward Hinnant break; 22743e519524SHoward Hinnant swap(*__first, *__last); 22753e519524SHoward Hinnant ++__first; 22763e519524SHoward Hinnant } 22773e519524SHoward Hinnant} 22783e519524SHoward Hinnant 22793e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22813e519524SHoward Hinnantvoid 22823e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22833e519524SHoward Hinnant{ 22843e519524SHoward Hinnant if (__first != __last) 22853e519524SHoward Hinnant for (; __first < --__last; ++__first) 22863e519524SHoward Hinnant swap(*__first, *__last); 22873e519524SHoward Hinnant} 22883e519524SHoward Hinnant 22893e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22913e519524SHoward Hinnantvoid 22923e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 22933e519524SHoward Hinnant{ 2294ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 22953e519524SHoward Hinnant} 22963e519524SHoward Hinnant 22973e519524SHoward Hinnant// reverse_copy 22983e519524SHoward Hinnant 22993e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23013e519524SHoward Hinnant_OutputIterator 23023e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23033e519524SHoward Hinnant{ 23043e519524SHoward Hinnant for (; __first != __last; ++__result) 23053e519524SHoward Hinnant *__result = *--__last; 23063e519524SHoward Hinnant return __result; 23073e519524SHoward Hinnant} 23083e519524SHoward Hinnant 23093e519524SHoward Hinnant// rotate 23103e519524SHoward Hinnant 23113e519524SHoward Hinnanttemplate <class _ForwardIterator> 23123e519524SHoward Hinnant_ForwardIterator 2313aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23143e519524SHoward Hinnant{ 2315aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2316aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2317aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2318aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2319aca09de3SHoward Hinnant return __lm1; 2320aca09de3SHoward Hinnant} 2321aca09de3SHoward Hinnant 2322aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2323aca09de3SHoward Hinnant_BidirectionalIterator 2324aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2325aca09de3SHoward Hinnant{ 2326aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2327aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2328aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2329aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2330aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2331aca09de3SHoward Hinnant return __fp1; 2332aca09de3SHoward Hinnant} 2333aca09de3SHoward Hinnant 2334aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2335aca09de3SHoward Hinnant_ForwardIterator 2336aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2337aca09de3SHoward Hinnant{ 23383e519524SHoward Hinnant _ForwardIterator __i = __middle; 23393e519524SHoward Hinnant while (true) 23403e519524SHoward Hinnant { 23413e519524SHoward Hinnant swap(*__first, *__i); 23423e519524SHoward Hinnant ++__first; 23433e519524SHoward Hinnant if (++__i == __last) 23443e519524SHoward Hinnant break; 23453e519524SHoward Hinnant if (__first == __middle) 23463e519524SHoward Hinnant __middle = __i; 23473e519524SHoward Hinnant } 23483e519524SHoward Hinnant _ForwardIterator __r = __first; 23493e519524SHoward Hinnant if (__first != __middle) 23503e519524SHoward Hinnant { 23513e519524SHoward Hinnant __i = __middle; 23523e519524SHoward Hinnant while (true) 23533e519524SHoward Hinnant { 23543e519524SHoward Hinnant swap(*__first, *__i); 23553e519524SHoward Hinnant ++__first; 23563e519524SHoward Hinnant if (++__i == __last) 23573e519524SHoward Hinnant { 23583e519524SHoward Hinnant if (__first == __middle) 23593e519524SHoward Hinnant break; 23603e519524SHoward Hinnant __i = __middle; 23613e519524SHoward Hinnant } 23623e519524SHoward Hinnant else if (__first == __middle) 23633e519524SHoward Hinnant __middle = __i; 23643e519524SHoward Hinnant } 23653e519524SHoward Hinnant } 23663e519524SHoward Hinnant return __r; 23673e519524SHoward Hinnant} 23683e519524SHoward Hinnant 23693e519524SHoward Hinnanttemplate<typename _Integral> 23703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23713e519524SHoward Hinnant_Integral 23723e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 23733e519524SHoward Hinnant{ 23743e519524SHoward Hinnant do 23753e519524SHoward Hinnant { 23763e519524SHoward Hinnant _Integral __t = __x % __y; 23773e519524SHoward Hinnant __x = __y; 23783e519524SHoward Hinnant __y = __t; 23793e519524SHoward Hinnant } while (__y); 23803e519524SHoward Hinnant return __x; 23813e519524SHoward Hinnant} 23823e519524SHoward Hinnant 23833e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23843e519524SHoward Hinnant_RandomAccessIterator 2385aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 23863e519524SHoward Hinnant{ 23873e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 23883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 23893e519524SHoward Hinnant 23903e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 23913e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 23923e519524SHoward Hinnant if (__m1 == __m2) 23933e519524SHoward Hinnant { 2394ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 23953e519524SHoward Hinnant return __middle; 23963e519524SHoward Hinnant } 2397aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 23983e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 23993e519524SHoward Hinnant { 2400aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24013e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24023e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24033e519524SHoward Hinnant do 24043e519524SHoward Hinnant { 2405aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24063e519524SHoward Hinnant __p1 = __p2; 24073e519524SHoward Hinnant const difference_type __d = __last - __p2; 24083e519524SHoward Hinnant if (__m1 < __d) 24093e519524SHoward Hinnant __p2 += __m1; 24103e519524SHoward Hinnant else 24113e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24123e519524SHoward Hinnant } while (__p2 != __p); 2413aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24143e519524SHoward Hinnant } 24153e519524SHoward Hinnant return __first + __m2; 24163e519524SHoward Hinnant} 24173e519524SHoward Hinnant 24183e519524SHoward Hinnanttemplate <class _ForwardIterator> 24193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24203e519524SHoward Hinnant_ForwardIterator 2421aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2422aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2423aca09de3SHoward Hinnant{ 2424aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2425aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2426aca09de3SHoward Hinnant { 2427aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2428aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2429aca09de3SHoward Hinnant } 2430aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2431aca09de3SHoward Hinnant} 2432aca09de3SHoward Hinnant 2433aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2434aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2435aca09de3SHoward Hinnant_BidirectionalIterator 2436aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2437aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2438aca09de3SHoward Hinnant{ 2439aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2440aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2441aca09de3SHoward Hinnant { 2442aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2443aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2444aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2445aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2446aca09de3SHoward Hinnant } 2447aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2448aca09de3SHoward Hinnant} 2449aca09de3SHoward Hinnant 2450aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2451aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2452aca09de3SHoward Hinnant_RandomAccessIterator 2453aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2454aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2455aca09de3SHoward Hinnant{ 2456aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2457aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2458aca09de3SHoward Hinnant { 2459aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2460aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2461aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2462aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2463aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2464aca09de3SHoward Hinnant } 2465aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2466aca09de3SHoward Hinnant} 2467aca09de3SHoward Hinnant 2468aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2469aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2470aca09de3SHoward Hinnant_ForwardIterator 24713e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24723e519524SHoward Hinnant{ 2473aca09de3SHoward Hinnant if (__first == __middle) 2474aca09de3SHoward Hinnant return __last; 2475aca09de3SHoward Hinnant if (__middle == __last) 2476aca09de3SHoward Hinnant return __first; 2477ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2478aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24793e519524SHoward Hinnant} 24803e519524SHoward Hinnant 24813e519524SHoward Hinnant// rotate_copy 24823e519524SHoward Hinnant 24833e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24853e519524SHoward Hinnant_OutputIterator 24863e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 24873e519524SHoward Hinnant{ 2488ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 24893e519524SHoward Hinnant} 24903e519524SHoward Hinnant 24913e519524SHoward Hinnant// min_element 24923e519524SHoward Hinnant 24933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24953e519524SHoward Hinnant_ForwardIterator 24963e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24973e519524SHoward Hinnant{ 24983e519524SHoward Hinnant if (__first != __last) 24993e519524SHoward Hinnant { 25003e519524SHoward Hinnant _ForwardIterator __i = __first; 25013e519524SHoward Hinnant while (++__i != __last) 25023e519524SHoward Hinnant if (__comp(*__i, *__first)) 25033e519524SHoward Hinnant __first = __i; 25043e519524SHoward Hinnant } 25053e519524SHoward Hinnant return __first; 25063e519524SHoward Hinnant} 25073e519524SHoward Hinnant 25083e519524SHoward Hinnanttemplate <class _ForwardIterator> 25093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25103e519524SHoward Hinnant_ForwardIterator 25113e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25123e519524SHoward Hinnant{ 2513ce48a113SHoward Hinnant return _VSTD::min_element(__first, __last, 25144eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25154eb27b79SHoward Hinnant} 25164eb27b79SHoward Hinnant 25174eb27b79SHoward Hinnant// min 25184eb27b79SHoward Hinnant 25194eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25204eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25214eb27b79SHoward Hinnantconst _Tp& 25224eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25234eb27b79SHoward Hinnant{ 25244eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25254eb27b79SHoward Hinnant} 25264eb27b79SHoward Hinnant 25274eb27b79SHoward Hinnanttemplate <class _Tp> 25284eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25294eb27b79SHoward Hinnantconst _Tp& 25304eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25314eb27b79SHoward Hinnant{ 2532ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25334eb27b79SHoward Hinnant} 25344eb27b79SHoward Hinnant 253554976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 253654976f26SHoward Hinnant 25374eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25384eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25394eb27b79SHoward Hinnant_Tp 25404eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25414eb27b79SHoward Hinnant{ 2542ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25434eb27b79SHoward Hinnant} 25444eb27b79SHoward Hinnant 25454eb27b79SHoward Hinnanttemplate<class _Tp> 25464eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25474eb27b79SHoward Hinnant_Tp 25484eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25494eb27b79SHoward Hinnant{ 2550ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end()); 25513e519524SHoward Hinnant} 25523e519524SHoward Hinnant 255354976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 255454976f26SHoward Hinnant 25553e519524SHoward Hinnant// max_element 25563e519524SHoward Hinnant 25573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25593e519524SHoward Hinnant_ForwardIterator 25603e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25613e519524SHoward Hinnant{ 25623e519524SHoward Hinnant if (__first != __last) 25633e519524SHoward Hinnant { 25643e519524SHoward Hinnant _ForwardIterator __i = __first; 25653e519524SHoward Hinnant while (++__i != __last) 25663e519524SHoward Hinnant if (__comp(*__first, *__i)) 25673e519524SHoward Hinnant __first = __i; 25683e519524SHoward Hinnant } 25693e519524SHoward Hinnant return __first; 25703e519524SHoward Hinnant} 25713e519524SHoward Hinnant 25723e519524SHoward Hinnanttemplate <class _ForwardIterator> 25733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25743e519524SHoward Hinnant_ForwardIterator 25753e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25763e519524SHoward Hinnant{ 2577ce48a113SHoward Hinnant return _VSTD::max_element(__first, __last, 25784eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25794eb27b79SHoward Hinnant} 25804eb27b79SHoward Hinnant 25814eb27b79SHoward Hinnant// max 25824eb27b79SHoward Hinnant 25834eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25844eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25854eb27b79SHoward Hinnantconst _Tp& 25864eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 25874eb27b79SHoward Hinnant{ 25884eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 25894eb27b79SHoward Hinnant} 25904eb27b79SHoward Hinnant 25914eb27b79SHoward Hinnanttemplate <class _Tp> 25924eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25934eb27b79SHoward Hinnantconst _Tp& 25944eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 25954eb27b79SHoward Hinnant{ 2596ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 25974eb27b79SHoward Hinnant} 25984eb27b79SHoward Hinnant 259954976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 260054976f26SHoward Hinnant 26014eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26024eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26034eb27b79SHoward Hinnant_Tp 26044eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26054eb27b79SHoward Hinnant{ 2606ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26074eb27b79SHoward Hinnant} 26084eb27b79SHoward Hinnant 26094eb27b79SHoward Hinnanttemplate<class _Tp> 26104eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26114eb27b79SHoward Hinnant_Tp 26124eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26134eb27b79SHoward Hinnant{ 2614ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end()); 26153e519524SHoward Hinnant} 26163e519524SHoward Hinnant 261754976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 261854976f26SHoward Hinnant 26193e519524SHoward Hinnant// minmax_element 26203e519524SHoward Hinnant 26213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26223e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26233e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26243e519524SHoward Hinnant{ 26253e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26263e519524SHoward Hinnant if (__first != __last) 26273e519524SHoward Hinnant { 26283e519524SHoward Hinnant if (++__first != __last) 26293e519524SHoward Hinnant { 26303e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26313e519524SHoward Hinnant __result.first = __first; 26323e519524SHoward Hinnant else 26333e519524SHoward Hinnant __result.second = __first; 26343e519524SHoward Hinnant while (++__first != __last) 26353e519524SHoward Hinnant { 26363e519524SHoward Hinnant _ForwardIterator __i = __first; 26373e519524SHoward Hinnant if (++__first == __last) 26383e519524SHoward Hinnant { 26393e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26403e519524SHoward Hinnant __result.first = __i; 26413e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26423e519524SHoward Hinnant __result.second = __i; 26433e519524SHoward Hinnant break; 26443e519524SHoward Hinnant } 26453e519524SHoward Hinnant else 26463e519524SHoward Hinnant { 26473e519524SHoward Hinnant if (__comp(*__first, *__i)) 26483e519524SHoward Hinnant { 26493e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26503e519524SHoward Hinnant __result.first = __first; 26513e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26523e519524SHoward Hinnant __result.second = __i; 26533e519524SHoward Hinnant } 26543e519524SHoward Hinnant else 26553e519524SHoward Hinnant { 26563e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26573e519524SHoward Hinnant __result.first = __i; 26583e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26593e519524SHoward Hinnant __result.second = __first; 26603e519524SHoward Hinnant } 26613e519524SHoward Hinnant } 26623e519524SHoward Hinnant } 26633e519524SHoward Hinnant } 26643e519524SHoward Hinnant } 26653e519524SHoward Hinnant return __result; 26663e519524SHoward Hinnant} 26673e519524SHoward Hinnant 26683e519524SHoward Hinnanttemplate <class _ForwardIterator> 26693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26703e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26713e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26723e519524SHoward Hinnant{ 2673ce48a113SHoward Hinnant return _VSTD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26743e519524SHoward Hinnant} 26753e519524SHoward Hinnant 26764eb27b79SHoward Hinnant// minmax 26774eb27b79SHoward Hinnant 26784eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26794eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26804eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26814eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26824eb27b79SHoward Hinnant{ 26834eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 26844eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 26854eb27b79SHoward Hinnant} 26864eb27b79SHoward Hinnant 26874eb27b79SHoward Hinnanttemplate<class _Tp> 26884eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26894eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26904eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 26914eb27b79SHoward Hinnant{ 2692ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 26934eb27b79SHoward Hinnant} 26944eb27b79SHoward Hinnant 269554976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 269654976f26SHoward Hinnant 26974eb27b79SHoward Hinnanttemplate<class _Tp> 26984eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26994eb27b79SHoward Hinnantpair<_Tp, _Tp> 27004eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t) 27014eb27b79SHoward Hinnant{ 27024eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2703ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end()); 27044eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 27054eb27b79SHoward Hinnant} 27064eb27b79SHoward Hinnant 27074eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27084eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27094eb27b79SHoward Hinnantpair<_Tp, _Tp> 27104eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27114eb27b79SHoward Hinnant{ 27124eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2713ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end(), __comp); 27144eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 27154eb27b79SHoward Hinnant} 27164eb27b79SHoward Hinnant 271754976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 271854976f26SHoward Hinnant 27193e519524SHoward Hinnant// random_shuffle 27203e519524SHoward Hinnant 2721f9d540b0SHoward Hinnant// __independent_bits_engine 2722f9d540b0SHoward Hinnant 2723c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2724f9d540b0SHoward Hinnantstruct __log2_imp 27253e519524SHoward Hinnant{ 2726c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2727c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27283e519524SHoward Hinnant}; 27293e519524SHoward Hinnant 2730c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2731c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 27323e519524SHoward Hinnant{ 2733f9d540b0SHoward Hinnant static const size_t value = 0; 27343e519524SHoward Hinnant}; 27353e519524SHoward Hinnant 2736c003db1fSHoward Hinnanttemplate <size_t _Rp> 2737c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 27383e519524SHoward Hinnant{ 2739c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 27403e519524SHoward Hinnant}; 27413e519524SHoward Hinnant 2742c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2743f9d540b0SHoward Hinnantstruct __log2 27443e519524SHoward Hinnant{ 2745c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2746f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 27473e519524SHoward Hinnant}; 27483e519524SHoward Hinnant 2749f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2750f9d540b0SHoward Hinnantclass __independent_bits_engine 27513e519524SHoward Hinnant{ 2752f9d540b0SHoward Hinnantpublic: 2753f9d540b0SHoward Hinnant // types 2754f9d540b0SHoward Hinnant typedef _UIntType result_type; 2755f9d540b0SHoward Hinnant 2756f9d540b0SHoward Hinnantprivate: 2757f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2758f9d540b0SHoward Hinnant typedef typename conditional 2759f9d540b0SHoward Hinnant < 2760f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2761f9d540b0SHoward Hinnant result_type, 2762f9d540b0SHoward Hinnant _Engine_result_type 2763f9d540b0SHoward Hinnant >::type _Working_result_type; 2764f9d540b0SHoward Hinnant 2765f9d540b0SHoward Hinnant _Engine& __e_; 2766f9d540b0SHoward Hinnant size_t __w_; 2767f9d540b0SHoward Hinnant size_t __w0_; 2768f9d540b0SHoward Hinnant size_t __n_; 2769f9d540b0SHoward Hinnant size_t __n0_; 2770f9d540b0SHoward Hinnant _Working_result_type __y0_; 2771f9d540b0SHoward Hinnant _Working_result_type __y1_; 2772f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2773f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2774f9d540b0SHoward Hinnant 2775e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2776c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2777f9d540b0SHoward Hinnant + _Working_result_type(1); 2778e386b7b3SHoward Hinnant#else 2779e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2780e386b7b3SHoward Hinnant + _Working_result_type(1); 2781e386b7b3SHoward Hinnant#endif 2782e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2783e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2784e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2785f9d540b0SHoward Hinnant 2786f9d540b0SHoward Hinnantpublic: 2787f9d540b0SHoward Hinnant // constructors and seeding functions 2788f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2789f9d540b0SHoward Hinnant 2790f9d540b0SHoward Hinnant // generating functions 2791c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2792f9d540b0SHoward Hinnant 2793f9d540b0SHoward Hinnantprivate: 2794f9d540b0SHoward Hinnant result_type __eval(false_type); 2795f9d540b0SHoward Hinnant result_type __eval(true_type); 2796f9d540b0SHoward Hinnant}; 2797f9d540b0SHoward Hinnant 2798f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2799f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2800f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2801f9d540b0SHoward Hinnant : __e_(__e), 2802f9d540b0SHoward Hinnant __w_(__w) 2803f9d540b0SHoward Hinnant{ 2804f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2805f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2806c003db1fSHoward Hinnant if (_Rp == 0) 2807c003db1fSHoward Hinnant __y0_ = _Rp; 2808f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2809c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2810f9d540b0SHoward Hinnant else 2811f9d540b0SHoward Hinnant __y0_ = 0; 2812c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2813f9d540b0SHoward Hinnant { 2814f9d540b0SHoward Hinnant ++__n_; 2815f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2816f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2817c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2818f9d540b0SHoward Hinnant else 2819f9d540b0SHoward Hinnant __y0_ = 0; 2820f9d540b0SHoward Hinnant } 2821f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2822f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2823c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2824f9d540b0SHoward Hinnant else 2825f9d540b0SHoward Hinnant __y1_ = 0; 2826f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2827f9d540b0SHoward Hinnant _Engine_result_type(0); 2828f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2829f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2830f9d540b0SHoward Hinnant _Engine_result_type(~0); 28313e519524SHoward Hinnant} 28323e519524SHoward Hinnant 2833f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2834f9d540b0SHoward Hinnantinline 2835f9d540b0SHoward Hinnant_UIntType 2836f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 28373e519524SHoward Hinnant{ 2838f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 28393e519524SHoward Hinnant} 28403e519524SHoward Hinnant 2841f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2842f9d540b0SHoward Hinnant_UIntType 2843f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28443e519524SHoward Hinnant{ 2845c003db1fSHoward Hinnant result_type _Sp = 0; 2846f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2847f9d540b0SHoward Hinnant { 2848f9d540b0SHoward Hinnant _Engine_result_type __u; 28493e519524SHoward Hinnant do 2850f9d540b0SHoward Hinnant { 2851f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2852f9d540b0SHoward Hinnant } while (__u >= __y0_); 28530176bc6cSHoward Hinnant if (__w0_ < _WDt) 2854c003db1fSHoward Hinnant _Sp <<= __w0_; 2855f9d540b0SHoward Hinnant else 2856c003db1fSHoward Hinnant _Sp = 0; 2857c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2858f9d540b0SHoward Hinnant } 2859f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2860f9d540b0SHoward Hinnant { 2861f9d540b0SHoward Hinnant _Engine_result_type __u; 2862f9d540b0SHoward Hinnant do 2863f9d540b0SHoward Hinnant { 2864f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2865f9d540b0SHoward Hinnant } while (__u >= __y1_); 28660176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2867c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2868f9d540b0SHoward Hinnant else 2869c003db1fSHoward Hinnant _Sp = 0; 2870c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2871f9d540b0SHoward Hinnant } 2872c003db1fSHoward Hinnant return _Sp; 28733e519524SHoward Hinnant} 28743e519524SHoward Hinnant 2875f9d540b0SHoward Hinnant// uniform_int_distribution 28763e519524SHoward Hinnant 2877f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2878f9d540b0SHoward Hinnantclass uniform_int_distribution 28793e519524SHoward Hinnant{ 2880f9d540b0SHoward Hinnantpublic: 2881f9d540b0SHoward Hinnant // types 2882f9d540b0SHoward Hinnant typedef _IntType result_type; 2883f9d540b0SHoward Hinnant 2884f9d540b0SHoward Hinnant class param_type 2885f9d540b0SHoward Hinnant { 2886f9d540b0SHoward Hinnant result_type __a_; 2887f9d540b0SHoward Hinnant result_type __b_; 2888f9d540b0SHoward Hinnant public: 2889f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2890f9d540b0SHoward Hinnant 2891f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2892f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2893f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2894f9d540b0SHoward Hinnant 2895f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2896f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2897f9d540b0SHoward Hinnant 2898f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2899f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2900f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2901f9d540b0SHoward Hinnant {return !(__x == __y);} 29023e519524SHoward Hinnant }; 29033e519524SHoward Hinnant 2904f9d540b0SHoward Hinnantprivate: 2905f9d540b0SHoward Hinnant param_type __p_; 29063e519524SHoward Hinnant 2907f9d540b0SHoward Hinnantpublic: 2908f9d540b0SHoward Hinnant // constructors and reset functions 2909f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2910f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2911f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2912f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2913f9d540b0SHoward Hinnant void reset() {} 2914f9d540b0SHoward Hinnant 2915f9d540b0SHoward Hinnant // generating functions 2916f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2917f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2918f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2919f9d540b0SHoward Hinnant 2920f9d540b0SHoward Hinnant // property functions 2921f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2922f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2923f9d540b0SHoward Hinnant 2924f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2925f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2926f9d540b0SHoward Hinnant 2927f9d540b0SHoward Hinnant result_type min() const {return a();} 2928f9d540b0SHoward Hinnant result_type max() const {return b();} 2929f9d540b0SHoward Hinnant 2930f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2931f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2932f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2933f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2934f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2935f9d540b0SHoward Hinnant {return !(__x == __y);} 29363e519524SHoward Hinnant}; 29373e519524SHoward Hinnant 2938f9d540b0SHoward Hinnanttemplate<class _IntType> 2939f9d540b0SHoward Hinnanttemplate<class _URNG> 2940f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2941f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29423e519524SHoward Hinnant{ 2943f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2944f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2945c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 2946c003db1fSHoward Hinnant if (_Rp == 1) 2947f9d540b0SHoward Hinnant return __p.a(); 2948f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2949f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2950c003db1fSHoward Hinnant if (_Rp == 0) 2951f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2952c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2953c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 2954f9d540b0SHoward Hinnant ++__w; 2955f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2956f9d540b0SHoward Hinnant _UIntType __u; 2957f9d540b0SHoward Hinnant do 29583e519524SHoward Hinnant { 2959f9d540b0SHoward Hinnant __u = __e(); 2960c003db1fSHoward Hinnant } while (__u >= _Rp); 2961f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 29623e519524SHoward Hinnant} 2963f9d540b0SHoward Hinnant 2964f9d540b0SHoward Hinnantclass __rs_default; 2965f9d540b0SHoward Hinnant 2966f9d540b0SHoward Hinnant__rs_default __rs_get(); 2967f9d540b0SHoward Hinnant 2968f9d540b0SHoward Hinnantclass __rs_default 29693e519524SHoward Hinnant{ 2970f9d540b0SHoward Hinnant static unsigned __c_; 2971f9d540b0SHoward Hinnant 2972f9d540b0SHoward Hinnant __rs_default(); 2973f9d540b0SHoward Hinnantpublic: 2974b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 2975f9d540b0SHoward Hinnant 2976f9d540b0SHoward Hinnant static const result_type _Min = 0; 2977f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2978f9d540b0SHoward Hinnant 2979f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2980f9d540b0SHoward Hinnant ~__rs_default(); 2981f9d540b0SHoward Hinnant 2982f9d540b0SHoward Hinnant result_type operator()(); 2983f9d540b0SHoward Hinnant 2984788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2985788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 2986f9d540b0SHoward Hinnant 2987f9d540b0SHoward Hinnant friend __rs_default __rs_get(); 2988f9d540b0SHoward Hinnant}; 2989f9d540b0SHoward Hinnant 2990f9d540b0SHoward Hinnant__rs_default __rs_get(); 29913e519524SHoward Hinnant 29923e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 29933e519524SHoward Hinnantvoid 29943e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 29953e519524SHoward Hinnant{ 29963e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2997c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2998c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 29993e519524SHoward Hinnant difference_type __d = __last - __first; 30003e519524SHoward Hinnant if (__d > 1) 30013e519524SHoward Hinnant { 3002c003db1fSHoward Hinnant _Dp __uid; 3003f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3004f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3005007b26beSHoward Hinnant { 3006c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3007007b26beSHoward Hinnant if (__i != difference_type(0)) 3008007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3009007b26beSHoward Hinnant } 30103e519524SHoward Hinnant } 30113e519524SHoward Hinnant} 30123e519524SHoward Hinnant 30133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 30143e519524SHoward Hinnantvoid 30153e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 30167609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 30173e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30183e519524SHoward Hinnant#else 30193e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30203e519524SHoward Hinnant#endif 30213e519524SHoward Hinnant{ 30223e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30233e519524SHoward Hinnant difference_type __d = __last - __first; 30243e519524SHoward Hinnant if (__d > 1) 30253e519524SHoward Hinnant { 30263e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3027007b26beSHoward Hinnant { 3028007b26beSHoward Hinnant difference_type __i = __rand(__d); 3029007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3030007b26beSHoward Hinnant } 30313e519524SHoward Hinnant } 30323e519524SHoward Hinnant} 30333e519524SHoward Hinnant 3034f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3035f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3036fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3037fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3038fb340102SHoward Hinnant#else 3039f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3040fb340102SHoward Hinnant#endif 3041f9d540b0SHoward Hinnant{ 3042f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3043c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3044c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3045f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3046f9d540b0SHoward Hinnant if (__d > 1) 3047f9d540b0SHoward Hinnant { 3048c003db1fSHoward Hinnant _Dp __uid; 3049f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3050007b26beSHoward Hinnant { 3051c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3052007b26beSHoward Hinnant if (__i != difference_type(0)) 3053007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3054007b26beSHoward Hinnant } 3055f9d540b0SHoward Hinnant } 3056f9d540b0SHoward Hinnant} 3057f9d540b0SHoward Hinnant 30583e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 30593e519524SHoward Hinnantbool 30603e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 30613e519524SHoward Hinnant{ 30623e519524SHoward Hinnant for (; __first != __last; ++__first) 30633e519524SHoward Hinnant if (!__pred(*__first)) 30643e519524SHoward Hinnant break; 30653e519524SHoward Hinnant for (; __first != __last; ++__first) 30663e519524SHoward Hinnant if (__pred(*__first)) 30673e519524SHoward Hinnant return false; 30683e519524SHoward Hinnant return true; 30693e519524SHoward Hinnant} 30703e519524SHoward Hinnant 30713e519524SHoward Hinnant// partition 30723e519524SHoward Hinnant 30733e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 30743e519524SHoward Hinnant_ForwardIterator 30753e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 30763e519524SHoward Hinnant{ 30773e519524SHoward Hinnant while (true) 30783e519524SHoward Hinnant { 30793e519524SHoward Hinnant if (__first == __last) 30803e519524SHoward Hinnant return __first; 30813e519524SHoward Hinnant if (!__pred(*__first)) 30823e519524SHoward Hinnant break; 30833e519524SHoward Hinnant ++__first; 30843e519524SHoward Hinnant } 30853e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 30863e519524SHoward Hinnant { 30873e519524SHoward Hinnant if (__pred(*__p)) 30883e519524SHoward Hinnant { 30893e519524SHoward Hinnant swap(*__first, *__p); 30903e519524SHoward Hinnant ++__first; 30913e519524SHoward Hinnant } 30923e519524SHoward Hinnant } 30933e519524SHoward Hinnant return __first; 30943e519524SHoward Hinnant} 30953e519524SHoward Hinnant 30963e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 30973e519524SHoward Hinnant_BidirectionalIterator 30983e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 30993e519524SHoward Hinnant bidirectional_iterator_tag) 31003e519524SHoward Hinnant{ 31013e519524SHoward Hinnant while (true) 31023e519524SHoward Hinnant { 31033e519524SHoward Hinnant while (true) 31043e519524SHoward Hinnant { 31053e519524SHoward Hinnant if (__first == __last) 31063e519524SHoward Hinnant return __first; 31073e519524SHoward Hinnant if (!__pred(*__first)) 31083e519524SHoward Hinnant break; 31093e519524SHoward Hinnant ++__first; 31103e519524SHoward Hinnant } 31113e519524SHoward Hinnant do 31123e519524SHoward Hinnant { 31133e519524SHoward Hinnant if (__first == --__last) 31143e519524SHoward Hinnant return __first; 31153e519524SHoward Hinnant } while (!__pred(*__last)); 31163e519524SHoward Hinnant swap(*__first, *__last); 31173e519524SHoward Hinnant ++__first; 31183e519524SHoward Hinnant } 31193e519524SHoward Hinnant} 31203e519524SHoward Hinnant 31213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31233e519524SHoward Hinnant_ForwardIterator 31243e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31253e519524SHoward Hinnant{ 3126ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 31273e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31283e519524SHoward Hinnant} 31293e519524SHoward Hinnant 31303e519524SHoward Hinnant// partition_copy 31313e519524SHoward Hinnant 31323e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 31333e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 31343e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 31353e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 31363e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 31373e519524SHoward Hinnant _Predicate __pred) 31383e519524SHoward Hinnant{ 31393e519524SHoward Hinnant for (; __first != __last; ++__first) 31403e519524SHoward Hinnant { 31413e519524SHoward Hinnant if (__pred(*__first)) 31423e519524SHoward Hinnant { 31433e519524SHoward Hinnant *__out_true = *__first; 31443e519524SHoward Hinnant ++__out_true; 31453e519524SHoward Hinnant } 31463e519524SHoward Hinnant else 31473e519524SHoward Hinnant { 31483e519524SHoward Hinnant *__out_false = *__first; 31493e519524SHoward Hinnant ++__out_false; 31503e519524SHoward Hinnant } 31513e519524SHoward Hinnant } 31523e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 31533e519524SHoward Hinnant} 31543e519524SHoward Hinnant 31553e519524SHoward Hinnant// partition_point 31563e519524SHoward Hinnant 31573e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 31583e519524SHoward Hinnant_ForwardIterator 31593e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31603e519524SHoward Hinnant{ 31613e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3162ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 31633e519524SHoward Hinnant while (__len != 0) 31643e519524SHoward Hinnant { 31653e519524SHoward Hinnant difference_type __l2 = __len / 2; 31663e519524SHoward Hinnant _ForwardIterator __m = __first; 3167ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 31683e519524SHoward Hinnant if (__pred(*__m)) 31693e519524SHoward Hinnant { 31703e519524SHoward Hinnant __first = ++__m; 31713e519524SHoward Hinnant __len -= __l2 + 1; 31723e519524SHoward Hinnant } 31733e519524SHoward Hinnant else 31743e519524SHoward Hinnant __len = __l2; 31753e519524SHoward Hinnant } 31763e519524SHoward Hinnant return __first; 31773e519524SHoward Hinnant} 31783e519524SHoward Hinnant 31793e519524SHoward Hinnant// stable_partition 31803e519524SHoward Hinnant 31813e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 31823e519524SHoward Hinnant_ForwardIterator 31833e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 31843e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 31853e519524SHoward Hinnant{ 31863e519524SHoward Hinnant // *__first is known to be false 31873e519524SHoward Hinnant // __len >= 1 31883e519524SHoward Hinnant if (__len == 1) 31893e519524SHoward Hinnant return __first; 31903e519524SHoward Hinnant if (__len == 2) 31913e519524SHoward Hinnant { 31923e519524SHoward Hinnant _ForwardIterator __m = __first; 31933e519524SHoward Hinnant if (__pred(*++__m)) 31943e519524SHoward Hinnant { 31953e519524SHoward Hinnant swap(*__first, *__m); 31963e519524SHoward Hinnant return __m; 31973e519524SHoward Hinnant } 31983e519524SHoward Hinnant return __first; 31993e519524SHoward Hinnant } 32003e519524SHoward Hinnant if (__len <= __p.second) 32013e519524SHoward Hinnant { // The buffer is big enough to use 32023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32033e519524SHoward Hinnant __destruct_n __d(0); 32043e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32053e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32063e519524SHoward Hinnant // Update __first to always point to the end of the trues 32073e519524SHoward Hinnant value_type* __t = __p.first; 3208ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32093e519524SHoward Hinnant __d.__incr((value_type*)0); 32103e519524SHoward Hinnant ++__t; 32113e519524SHoward Hinnant _ForwardIterator __i = __first; 32123e519524SHoward Hinnant while (++__i != __last) 32133e519524SHoward Hinnant { 32143e519524SHoward Hinnant if (__pred(*__i)) 32153e519524SHoward Hinnant { 3216ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32173e519524SHoward Hinnant ++__first; 32183e519524SHoward Hinnant } 32193e519524SHoward Hinnant else 32203e519524SHoward Hinnant { 3221ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32223e519524SHoward Hinnant __d.__incr((value_type*)0); 32233e519524SHoward Hinnant ++__t; 32243e519524SHoward Hinnant } 32253e519524SHoward Hinnant } 32263e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 32273e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 32283e519524SHoward Hinnant __i = __first; 32293e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3230ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 32313e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 32323e519524SHoward Hinnant return __first; 32333e519524SHoward Hinnant } 32343e519524SHoward Hinnant // Else not enough buffer, do in place 32353e519524SHoward Hinnant // __len >= 3 32363e519524SHoward Hinnant _ForwardIterator __m = __first; 32373e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3238ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 32393e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 32403e519524SHoward Hinnant // F????????????????? 32413e519524SHoward Hinnant // f m l 32423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 32433e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 32443e519524SHoward Hinnant // TTTFFFFF?????????? 32453e519524SHoward Hinnant // f ff m l 32463e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 32473e519524SHoward Hinnant _ForwardIterator __m1 = __m; 32483e519524SHoward Hinnant _ForwardIterator __second_false = __last; 32493e519524SHoward Hinnant _Distance __len_half = __len - __len2; 32503e519524SHoward Hinnant while (__pred(*__m1)) 32513e519524SHoward Hinnant { 32523e519524SHoward Hinnant if (++__m1 == __last) 32533e519524SHoward Hinnant goto __second_half_done; 32543e519524SHoward Hinnant --__len_half; 32553e519524SHoward Hinnant } 32563e519524SHoward Hinnant // TTTFFFFFTTTF?????? 32573e519524SHoward Hinnant // f ff m m1 l 32583e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 32593e519524SHoward Hinnant__second_half_done: 32603e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 32613e519524SHoward Hinnant // f ff m sf l 3262ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 32633e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 32643e519524SHoward Hinnant // | 32653e519524SHoward Hinnant} 32663e519524SHoward Hinnant 32673e519524SHoward Hinnantstruct __return_temporary_buffer 32683e519524SHoward Hinnant{ 32693e519524SHoward Hinnant template <class _Tp> 3270ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 32713e519524SHoward Hinnant}; 32723e519524SHoward Hinnant 32733e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32743e519524SHoward Hinnant_ForwardIterator 32753e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32763e519524SHoward Hinnant forward_iterator_tag) 32773e519524SHoward Hinnant{ 32783e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 32793e519524SHoward Hinnant // Either prove all true and return __first or point to first false 32803e519524SHoward Hinnant while (true) 32813e519524SHoward Hinnant { 32823e519524SHoward Hinnant if (__first == __last) 32833e519524SHoward Hinnant return __first; 32843e519524SHoward Hinnant if (!__pred(*__first)) 32853e519524SHoward Hinnant break; 32863e519524SHoward Hinnant ++__first; 32873e519524SHoward Hinnant } 32883e519524SHoward Hinnant // We now have a reduced range [__first, __last) 32893e519524SHoward Hinnant // *__first is known to be false 32903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 32913e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3292ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32933e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 32943e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 32953e519524SHoward Hinnant if (__len >= __alloc_limit) 32963e519524SHoward Hinnant { 3297ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 32983e519524SHoward Hinnant __h.reset(__p.first); 32993e519524SHoward Hinnant } 33003e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33013e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33023e519524SHoward Hinnant} 33033e519524SHoward Hinnant 33043e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33053e519524SHoward Hinnant_BidirectionalIterator 33063e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33073e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33083e519524SHoward Hinnant{ 33093e519524SHoward Hinnant // *__first is known to be false 33103e519524SHoward Hinnant // *__last is known to be true 33113e519524SHoward Hinnant // __len >= 2 33123e519524SHoward Hinnant if (__len == 2) 33133e519524SHoward Hinnant { 33143e519524SHoward Hinnant swap(*__first, *__last); 33153e519524SHoward Hinnant return __last; 33163e519524SHoward Hinnant } 33173e519524SHoward Hinnant if (__len == 3) 33183e519524SHoward Hinnant { 33193e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33203e519524SHoward Hinnant if (__pred(*++__m)) 33213e519524SHoward Hinnant { 33223e519524SHoward Hinnant swap(*__first, *__m); 33233e519524SHoward Hinnant swap(*__m, *__last); 33243e519524SHoward Hinnant return __last; 33253e519524SHoward Hinnant } 33263e519524SHoward Hinnant swap(*__m, *__last); 33273e519524SHoward Hinnant swap(*__first, *__m); 33283e519524SHoward Hinnant return __m; 33293e519524SHoward Hinnant } 33303e519524SHoward Hinnant if (__len <= __p.second) 33313e519524SHoward Hinnant { // The buffer is big enough to use 33323e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 33333e519524SHoward Hinnant __destruct_n __d(0); 33343e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33353e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33363e519524SHoward Hinnant // Update __first to always point to the end of the trues 33373e519524SHoward Hinnant value_type* __t = __p.first; 3338ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33393e519524SHoward Hinnant __d.__incr((value_type*)0); 33403e519524SHoward Hinnant ++__t; 33413e519524SHoward Hinnant _BidirectionalIterator __i = __first; 33423e519524SHoward Hinnant while (++__i != __last) 33433e519524SHoward Hinnant { 33443e519524SHoward Hinnant if (__pred(*__i)) 33453e519524SHoward Hinnant { 3346ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33473e519524SHoward Hinnant ++__first; 33483e519524SHoward Hinnant } 33493e519524SHoward Hinnant else 33503e519524SHoward Hinnant { 3351ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33523e519524SHoward Hinnant __d.__incr((value_type*)0); 33533e519524SHoward Hinnant ++__t; 33543e519524SHoward Hinnant } 33553e519524SHoward Hinnant } 33563e519524SHoward Hinnant // move *__last, known to be true 3357ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33583e519524SHoward Hinnant __i = ++__first; 33593e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33603e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33613e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3362ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33633e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33643e519524SHoward Hinnant return __first; 33653e519524SHoward Hinnant } 33663e519524SHoward Hinnant // Else not enough buffer, do in place 33673e519524SHoward Hinnant // __len >= 4 33683e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33693e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3370ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33713e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 33723e519524SHoward Hinnant // F????????????????T 33733e519524SHoward Hinnant // f m l 33743e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 33753e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 33763e519524SHoward Hinnant _Distance __len_half = __len2; 33773e519524SHoward Hinnant while (!__pred(*--__m1)) 33783e519524SHoward Hinnant { 33793e519524SHoward Hinnant if (__m1 == __first) 33803e519524SHoward Hinnant goto __first_half_done; 33813e519524SHoward Hinnant --__len_half; 33823e519524SHoward Hinnant } 33833e519524SHoward Hinnant // F???TFFF?????????T 33843e519524SHoward Hinnant // f m1 m l 33853e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33863e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 33873e519524SHoward Hinnant__first_half_done: 33883e519524SHoward Hinnant // TTTFFFFF?????????T 33893e519524SHoward Hinnant // f ff m l 33903e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33913e519524SHoward Hinnant __m1 = __m; 33923e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 33933e519524SHoward Hinnant ++__second_false; 33943e519524SHoward Hinnant __len_half = __len - __len2; 33953e519524SHoward Hinnant while (__pred(*__m1)) 33963e519524SHoward Hinnant { 33973e519524SHoward Hinnant if (++__m1 == __last) 33983e519524SHoward Hinnant goto __second_half_done; 33993e519524SHoward Hinnant --__len_half; 34003e519524SHoward Hinnant } 34013e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34023e519524SHoward Hinnant // f ff m m1 l 34033e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34043e519524SHoward Hinnant__second_half_done: 34053e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34063e519524SHoward Hinnant // f ff m sf l 3407ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34083e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34093e519524SHoward Hinnant // | 34103e519524SHoward Hinnant} 34113e519524SHoward Hinnant 34123e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34133e519524SHoward Hinnant_BidirectionalIterator 34143e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34153e519524SHoward Hinnant bidirectional_iterator_tag) 34163e519524SHoward Hinnant{ 34173e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34183e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34193e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34203e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34213e519524SHoward Hinnant while (true) 34223e519524SHoward Hinnant { 34233e519524SHoward Hinnant if (__first == __last) 34243e519524SHoward Hinnant return __first; 34253e519524SHoward Hinnant if (!__pred(*__first)) 34263e519524SHoward Hinnant break; 34273e519524SHoward Hinnant ++__first; 34283e519524SHoward Hinnant } 34293e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 34303e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 34313e519524SHoward Hinnant do 34323e519524SHoward Hinnant { 34333e519524SHoward Hinnant if (__first == --__last) 34343e519524SHoward Hinnant return __first; 34353e519524SHoward Hinnant } while (!__pred(*__last)); 34363e519524SHoward Hinnant // We now have a reduced range [__first, __last] 34373e519524SHoward Hinnant // *__first is known to be false 34383e519524SHoward Hinnant // *__last is known to be true 34393e519524SHoward Hinnant // __len >= 2 3440ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 34413e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34423e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34433e519524SHoward Hinnant if (__len >= __alloc_limit) 34443e519524SHoward Hinnant { 3445ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34463e519524SHoward Hinnant __h.reset(__p.first); 34473e519524SHoward Hinnant } 34483e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34493e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 34503e519524SHoward Hinnant} 34513e519524SHoward Hinnant 34523e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 34533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34543e519524SHoward Hinnant_ForwardIterator 34553e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34563e519524SHoward Hinnant{ 34573e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34583e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 34593e519524SHoward Hinnant} 34603e519524SHoward Hinnant 34613e519524SHoward Hinnant// is_sorted_until 34623e519524SHoward Hinnant 34633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 34643e519524SHoward Hinnant_ForwardIterator 34653e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 34663e519524SHoward Hinnant{ 34673e519524SHoward Hinnant if (__first != __last) 34683e519524SHoward Hinnant { 34693e519524SHoward Hinnant _ForwardIterator __i = __first; 34703e519524SHoward Hinnant while (++__i != __last) 34713e519524SHoward Hinnant { 34723e519524SHoward Hinnant if (__comp(*__i, *__first)) 34733e519524SHoward Hinnant return __i; 34743e519524SHoward Hinnant __first = __i; 34753e519524SHoward Hinnant } 34763e519524SHoward Hinnant } 34773e519524SHoward Hinnant return __last; 34783e519524SHoward Hinnant} 34793e519524SHoward Hinnant 34803e519524SHoward Hinnanttemplate<class _ForwardIterator> 34813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34823e519524SHoward Hinnant_ForwardIterator 34833e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 34843e519524SHoward Hinnant{ 3485ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 34863e519524SHoward Hinnant} 34873e519524SHoward Hinnant 34883e519524SHoward Hinnant// is_sorted 34893e519524SHoward Hinnant 34903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 34913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34923e519524SHoward Hinnantbool 34933e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 34943e519524SHoward Hinnant{ 3495ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 34963e519524SHoward Hinnant} 34973e519524SHoward Hinnant 34983e519524SHoward Hinnanttemplate<class _ForwardIterator> 34993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35003e519524SHoward Hinnantbool 35013e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35023e519524SHoward Hinnant{ 3503ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35043e519524SHoward Hinnant} 35053e519524SHoward Hinnant 35063e519524SHoward Hinnant// sort 35073e519524SHoward Hinnant 35083e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35093e519524SHoward Hinnant 35103e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35113e519524SHoward Hinnantunsigned 35123e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35133e519524SHoward Hinnant{ 35143e519524SHoward Hinnant unsigned __r = 0; 35153e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35163e519524SHoward Hinnant { 35173e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35183e519524SHoward Hinnant return __r; // x <= y && y <= z 35193e519524SHoward Hinnant // x <= y && y > z 35203e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35213e519524SHoward Hinnant __r = 1; 35223e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35233e519524SHoward Hinnant { 35243e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35253e519524SHoward Hinnant __r = 2; 35263e519524SHoward Hinnant } 35273e519524SHoward Hinnant return __r; // x <= y && y < z 35283e519524SHoward Hinnant } 35293e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 35303e519524SHoward Hinnant { 35313e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 35323e519524SHoward Hinnant __r = 1; 35333e519524SHoward Hinnant return __r; 35343e519524SHoward Hinnant } 35353e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 35363e519524SHoward Hinnant __r = 1; // x < y && x <= z 35373e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 35383e519524SHoward Hinnant { 35393e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 35403e519524SHoward Hinnant __r = 2; 35413e519524SHoward Hinnant } 35423e519524SHoward Hinnant return __r; 35433e519524SHoward Hinnant} // x <= y && y <= z 35443e519524SHoward Hinnant 35453e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 35463e519524SHoward Hinnant 35473e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35483e519524SHoward Hinnantunsigned 35493e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35503e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 35513e519524SHoward Hinnant{ 35523e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 35533e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35543e519524SHoward Hinnant { 35553e519524SHoward Hinnant swap(*__x3, *__x4); 35563e519524SHoward Hinnant ++__r; 35573e519524SHoward Hinnant if (__c(*__x3, *__x2)) 35583e519524SHoward Hinnant { 35593e519524SHoward Hinnant swap(*__x2, *__x3); 35603e519524SHoward Hinnant ++__r; 35613e519524SHoward Hinnant if (__c(*__x2, *__x1)) 35623e519524SHoward Hinnant { 35633e519524SHoward Hinnant swap(*__x1, *__x2); 35643e519524SHoward Hinnant ++__r; 35653e519524SHoward Hinnant } 35663e519524SHoward Hinnant } 35673e519524SHoward Hinnant } 35683e519524SHoward Hinnant return __r; 35693e519524SHoward Hinnant} 35703e519524SHoward Hinnant 35713e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 35723e519524SHoward Hinnant 35733e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35743e519524SHoward Hinnantunsigned 35753e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35763e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 35773e519524SHoward Hinnant{ 35783e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 35793e519524SHoward Hinnant if (__c(*__x5, *__x4)) 35803e519524SHoward Hinnant { 35813e519524SHoward Hinnant swap(*__x4, *__x5); 35823e519524SHoward Hinnant ++__r; 35833e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35843e519524SHoward Hinnant { 35853e519524SHoward Hinnant swap(*__x3, *__x4); 35863e519524SHoward Hinnant ++__r; 35873e519524SHoward Hinnant if (__c(*__x3, *__x2)) 35883e519524SHoward Hinnant { 35893e519524SHoward Hinnant swap(*__x2, *__x3); 35903e519524SHoward Hinnant ++__r; 35913e519524SHoward Hinnant if (__c(*__x2, *__x1)) 35923e519524SHoward Hinnant { 35933e519524SHoward Hinnant swap(*__x1, *__x2); 35943e519524SHoward Hinnant ++__r; 35953e519524SHoward Hinnant } 35963e519524SHoward Hinnant } 35973e519524SHoward Hinnant } 35983e519524SHoward Hinnant } 35993e519524SHoward Hinnant return __r; 36003e519524SHoward Hinnant} 36013e519524SHoward Hinnant 36023e519524SHoward Hinnant// Assumes size > 0 36033e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36043e519524SHoward Hinnantvoid 36053e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36063e519524SHoward Hinnant{ 36073e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36083e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36093e519524SHoward Hinnant { 3610ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36113e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36123e519524SHoward Hinnant (__first, __last, __comp); 36133e519524SHoward Hinnant if (__i != __first) 36143e519524SHoward Hinnant swap(*__first, *__i); 36153e519524SHoward Hinnant } 36163e519524SHoward Hinnant} 36173e519524SHoward Hinnant 36183e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36193e519524SHoward Hinnantvoid 36203e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36213e519524SHoward Hinnant{ 36223e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36233e519524SHoward Hinnant if (__first != __last) 36243e519524SHoward Hinnant { 36253e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 36263e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 36273e519524SHoward Hinnant { 36283e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3629ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 36303e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3631ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3632ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36333e519524SHoward Hinnant } 36343e519524SHoward Hinnant } 36353e519524SHoward Hinnant} 36363e519524SHoward Hinnant 36373e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36383e519524SHoward Hinnantvoid 36393e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36403e519524SHoward Hinnant{ 36413e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 36423e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 36433e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 36443e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 36453e519524SHoward Hinnant { 36463e519524SHoward Hinnant if (__comp(*__i, *__j)) 36473e519524SHoward Hinnant { 3648ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 36493e519524SHoward Hinnant _RandomAccessIterator __k = __j; 36503e519524SHoward Hinnant __j = __i; 36513e519524SHoward Hinnant do 36523e519524SHoward Hinnant { 3653ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 36543e519524SHoward Hinnant __j = __k; 36553e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3656ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36573e519524SHoward Hinnant } 36583e519524SHoward Hinnant __j = __i; 36593e519524SHoward Hinnant } 36603e519524SHoward Hinnant} 36613e519524SHoward Hinnant 36623e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36633e519524SHoward Hinnantbool 36643e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36653e519524SHoward Hinnant{ 36663e519524SHoward Hinnant switch (__last - __first) 36673e519524SHoward Hinnant { 36683e519524SHoward Hinnant case 0: 36693e519524SHoward Hinnant case 1: 36703e519524SHoward Hinnant return true; 36713e519524SHoward Hinnant case 2: 36723e519524SHoward Hinnant if (__comp(*--__last, *__first)) 36733e519524SHoward Hinnant swap(*__first, *__last); 36743e519524SHoward Hinnant return true; 36753e519524SHoward Hinnant case 3: 3676ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 36773e519524SHoward Hinnant return true; 36783e519524SHoward Hinnant case 4: 3679ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 36803e519524SHoward Hinnant return true; 36813e519524SHoward Hinnant case 5: 3682ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 36833e519524SHoward Hinnant return true; 36843e519524SHoward Hinnant } 36853e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 36863e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 36873e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 36883e519524SHoward Hinnant const unsigned __limit = 8; 36893e519524SHoward Hinnant unsigned __count = 0; 36903e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 36913e519524SHoward Hinnant { 36923e519524SHoward Hinnant if (__comp(*__i, *__j)) 36933e519524SHoward Hinnant { 3694ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 36953e519524SHoward Hinnant _RandomAccessIterator __k = __j; 36963e519524SHoward Hinnant __j = __i; 36973e519524SHoward Hinnant do 36983e519524SHoward Hinnant { 3699ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37003e519524SHoward Hinnant __j = __k; 37013e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3702ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37033e519524SHoward Hinnant if (++__count == __limit) 37043e519524SHoward Hinnant return ++__i == __last; 37053e519524SHoward Hinnant } 37063e519524SHoward Hinnant __j = __i; 37073e519524SHoward Hinnant } 37083e519524SHoward Hinnant return true; 37093e519524SHoward Hinnant} 37103e519524SHoward Hinnant 37113e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37123e519524SHoward Hinnantvoid 37133e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37143e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37153e519524SHoward Hinnant{ 37163e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37173e519524SHoward Hinnant if (__first1 != __last1) 37183e519524SHoward Hinnant { 37193e519524SHoward Hinnant __destruct_n __d(0); 37203e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37213e519524SHoward Hinnant value_type* __last2 = __first2; 3722ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37233e519524SHoward Hinnant __d.__incr((value_type*)0); 37243e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37253e519524SHoward Hinnant { 37263e519524SHoward Hinnant value_type* __j2 = __last2; 37273e519524SHoward Hinnant value_type* __i2 = __j2; 37283e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 37293e519524SHoward Hinnant { 3730ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 37313e519524SHoward Hinnant __d.__incr((value_type*)0); 37323e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3733ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3734ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 37353e519524SHoward Hinnant } 37363e519524SHoward Hinnant else 37373e519524SHoward Hinnant { 3738ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 37393e519524SHoward Hinnant __d.__incr((value_type*)0); 37403e519524SHoward Hinnant } 37413e519524SHoward Hinnant } 37423e519524SHoward Hinnant __h.release(); 37433e519524SHoward Hinnant } 37443e519524SHoward Hinnant} 37453e519524SHoward Hinnant 37463e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37473e519524SHoward Hinnantvoid 37483e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37493e519524SHoward Hinnant{ 37503e519524SHoward Hinnant // _Compare is known to be a reference type 37513e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 37523e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3753ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3754ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 37553e519524SHoward Hinnant while (true) 37563e519524SHoward Hinnant { 37573e519524SHoward Hinnant __restart: 37583e519524SHoward Hinnant difference_type __len = __last - __first; 37593e519524SHoward Hinnant switch (__len) 37603e519524SHoward Hinnant { 37613e519524SHoward Hinnant case 0: 37623e519524SHoward Hinnant case 1: 37633e519524SHoward Hinnant return; 37643e519524SHoward Hinnant case 2: 37653e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37663e519524SHoward Hinnant swap(*__first, *__last); 37673e519524SHoward Hinnant return; 37683e519524SHoward Hinnant case 3: 3769ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37703e519524SHoward Hinnant return; 37713e519524SHoward Hinnant case 4: 3772ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37733e519524SHoward Hinnant return; 37743e519524SHoward Hinnant case 5: 3775ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37763e519524SHoward Hinnant return; 37773e519524SHoward Hinnant } 37783e519524SHoward Hinnant if (__len <= __limit) 37793e519524SHoward Hinnant { 3780ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 37813e519524SHoward Hinnant return; 37823e519524SHoward Hinnant } 37833e519524SHoward Hinnant // __len > 5 37843e519524SHoward Hinnant _RandomAccessIterator __m = __first; 37853e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 37863e519524SHoward Hinnant --__lm1; 37873e519524SHoward Hinnant unsigned __n_swaps; 37883e519524SHoward Hinnant { 37893e519524SHoward Hinnant difference_type __delta; 37903e519524SHoward Hinnant if (__len >= 1000) 37913e519524SHoward Hinnant { 37923e519524SHoward Hinnant __delta = __len/2; 37933e519524SHoward Hinnant __m += __delta; 37943e519524SHoward Hinnant __delta /= 2; 3795ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 37963e519524SHoward Hinnant } 37973e519524SHoward Hinnant else 37983e519524SHoward Hinnant { 37993e519524SHoward Hinnant __delta = __len/2; 38003e519524SHoward Hinnant __m += __delta; 3801ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38023e519524SHoward Hinnant } 38033e519524SHoward Hinnant } 38043e519524SHoward Hinnant // *__m is median 38053e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38063e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38073e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38083e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38093e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38103e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38113e519524SHoward Hinnant // Prime the downward search with a guard. 38123e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38133e519524SHoward Hinnant { 38143e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38153e519524SHoward Hinnant // manually guard downward moving __j against __i 38163e519524SHoward Hinnant while (true) 38173e519524SHoward Hinnant { 38183e519524SHoward Hinnant if (__i == --__j) 38193e519524SHoward Hinnant { 38203e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38213e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38223e519524SHoward Hinnant ++__i; // __first + 1 38233e519524SHoward Hinnant __j = __last; 38243e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38253e519524SHoward Hinnant { 38263e519524SHoward Hinnant while (true) 38273e519524SHoward Hinnant { 38283e519524SHoward Hinnant if (__i == __j) 38293e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 38303e519524SHoward Hinnant if (__comp(*__first, *__i)) 38313e519524SHoward Hinnant { 38323e519524SHoward Hinnant swap(*__i, *__j); 38333e519524SHoward Hinnant ++__n_swaps; 38343e519524SHoward Hinnant ++__i; 38353e519524SHoward Hinnant break; 38363e519524SHoward Hinnant } 38373e519524SHoward Hinnant ++__i; 38383e519524SHoward Hinnant } 38393e519524SHoward Hinnant } 38403e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 38413e519524SHoward Hinnant if (__i == __j) 38423e519524SHoward Hinnant return; 38433e519524SHoward Hinnant while (true) 38443e519524SHoward Hinnant { 38453e519524SHoward Hinnant while (!__comp(*__first, *__i)) 38463e519524SHoward Hinnant ++__i; 38473e519524SHoward Hinnant while (__comp(*__first, *--__j)) 38483e519524SHoward Hinnant ; 38493e519524SHoward Hinnant if (__i >= __j) 38503e519524SHoward Hinnant break; 38513e519524SHoward Hinnant swap(*__i, *__j); 38523e519524SHoward Hinnant ++__n_swaps; 38533e519524SHoward Hinnant ++__i; 38543e519524SHoward Hinnant } 38553e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 38563e519524SHoward Hinnant // The first part is sorted, sort the secod part 3857ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 38583e519524SHoward Hinnant __first = __i; 38593e519524SHoward Hinnant goto __restart; 38603e519524SHoward Hinnant } 38613e519524SHoward Hinnant if (__comp(*__j, *__m)) 38623e519524SHoward Hinnant { 38633e519524SHoward Hinnant swap(*__i, *__j); 38643e519524SHoward Hinnant ++__n_swaps; 38653e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 38663e519524SHoward Hinnant } 38673e519524SHoward Hinnant } 38683e519524SHoward Hinnant } 38693e519524SHoward Hinnant // It is known that *__i < *__m 38703e519524SHoward Hinnant ++__i; 38713e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38723e519524SHoward Hinnant // if not yet partitioned... 38733e519524SHoward Hinnant if (__i < __j) 38743e519524SHoward Hinnant { 38753e519524SHoward Hinnant // known that *(__i - 1) < *__m 38763e519524SHoward Hinnant // known that __i <= __m 38773e519524SHoward Hinnant while (true) 38783e519524SHoward Hinnant { 38793e519524SHoward Hinnant // __m still guards upward moving __i 38803e519524SHoward Hinnant while (__comp(*__i, *__m)) 38813e519524SHoward Hinnant ++__i; 38823e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 38833e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 38843e519524SHoward Hinnant ; 38853e519524SHoward Hinnant if (__i > __j) 38863e519524SHoward Hinnant break; 38873e519524SHoward Hinnant swap(*__i, *__j); 38883e519524SHoward Hinnant ++__n_swaps; 38893e519524SHoward Hinnant // It is known that __m != __j 38903e519524SHoward Hinnant // If __m just moved, follow it 38913e519524SHoward Hinnant if (__m == __i) 38923e519524SHoward Hinnant __m = __j; 38933e519524SHoward Hinnant ++__i; 38943e519524SHoward Hinnant } 38953e519524SHoward Hinnant } 38963e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 38973e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 38983e519524SHoward Hinnant { 38993e519524SHoward Hinnant swap(*__i, *__m); 39003e519524SHoward Hinnant ++__n_swaps; 39013e519524SHoward Hinnant } 39023e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39033e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39043e519524SHoward Hinnant if (__n_swaps == 0) 39053e519524SHoward Hinnant { 3906ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3907ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39083e519524SHoward Hinnant { 39093e519524SHoward Hinnant if (__fs) 39103e519524SHoward Hinnant return; 39113e519524SHoward Hinnant __last = __i; 39123e519524SHoward Hinnant continue; 39133e519524SHoward Hinnant } 39143e519524SHoward Hinnant else 39153e519524SHoward Hinnant { 39163e519524SHoward Hinnant if (__fs) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant __first = ++__i; 39193e519524SHoward Hinnant continue; 39203e519524SHoward Hinnant } 39213e519524SHoward Hinnant } 39223e519524SHoward Hinnant } 39233e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39243e519524SHoward Hinnant if (__i - __first < __last - __i) 39253e519524SHoward Hinnant { 3926ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3927ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 39283e519524SHoward Hinnant __first = ++__i; 39293e519524SHoward Hinnant } 39303e519524SHoward Hinnant else 39313e519524SHoward Hinnant { 3932ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 3933ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 39343e519524SHoward Hinnant __last = __i; 39353e519524SHoward Hinnant } 39363e519524SHoward Hinnant } 39373e519524SHoward Hinnant} 39383e519524SHoward Hinnant 39393e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 39403e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 39413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39423e519524SHoward Hinnantvoid 39433e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39443e519524SHoward Hinnant{ 3945f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 39463e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39473e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 39483e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 3949f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 39503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 39513e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 3952f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 39533e519524SHoward Hinnant} 39543e519524SHoward Hinnant 39553e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 39563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39573e519524SHoward Hinnantvoid 39583e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 39593e519524SHoward Hinnant{ 3960ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 39613e519524SHoward Hinnant} 39623e519524SHoward Hinnant 39633e519524SHoward Hinnanttemplate <class _Tp> 39643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39653e519524SHoward Hinnantvoid 39663e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 39673e519524SHoward Hinnant{ 3968ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 39693e519524SHoward Hinnant} 39703e519524SHoward Hinnant 39713e519524SHoward Hinnanttemplate <class _Tp> 39723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39733e519524SHoward Hinnantvoid 39743e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 39753e519524SHoward Hinnant{ 3976ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 39773e519524SHoward Hinnant} 39783e519524SHoward Hinnant 3979f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 3980f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 3981f554add5SHoward Hinnantvoid 3982f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 3983f554add5SHoward Hinnant{ 3984f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3985f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 3986f554add5SHoward Hinnant} 3987f554add5SHoward Hinnant 3988e4383379SHoward Hinnant#ifdef _MSC_VER 3989e4383379SHoward Hinnant#pragma warning( push ) 3990e4383379SHoward Hinnant#pragma warning( disable: 4231) 3991e4383379SHoward Hinnant#endif // _MSC_VER 3992cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 3993cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 3994cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 3995cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 3996cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 3997cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 3998cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 3999cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4000cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4001cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4002cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4003cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4004cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4005cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4006cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40073e519524SHoward Hinnant 4008cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4009cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4010cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4011cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4012cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4013cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4014cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4015cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4016cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4017cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4018cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4019cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4020cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4021cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4022cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40233e519524SHoward Hinnant 4024cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&)) 4025e4383379SHoward Hinnant#ifdef _MSC_VER 4026e4383379SHoward Hinnant#pragma warning( pop ) 4027c206366fSHoward Hinnant#endif // _MSC_VER 40283e519524SHoward Hinnant 40293e519524SHoward Hinnant// lower_bound 40303e519524SHoward Hinnant 40313e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 40323e519524SHoward Hinnant_ForwardIterator 4033e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40343e519524SHoward Hinnant{ 40353e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4036ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40373e519524SHoward Hinnant while (__len != 0) 40383e519524SHoward Hinnant { 40393e519524SHoward Hinnant difference_type __l2 = __len / 2; 40403e519524SHoward Hinnant _ForwardIterator __m = __first; 4041ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4042e4383379SHoward Hinnant if (__comp(*__m, __value_)) 40433e519524SHoward Hinnant { 40443e519524SHoward Hinnant __first = ++__m; 40453e519524SHoward Hinnant __len -= __l2 + 1; 40463e519524SHoward Hinnant } 40473e519524SHoward Hinnant else 40483e519524SHoward Hinnant __len = __l2; 40493e519524SHoward Hinnant } 40503e519524SHoward Hinnant return __first; 40513e519524SHoward Hinnant} 40523e519524SHoward Hinnant 40533e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 40543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40553e519524SHoward Hinnant_ForwardIterator 4056e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40573e519524SHoward Hinnant{ 4058f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 40593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4061e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4062f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 40633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4064e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4065f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 40663e519524SHoward Hinnant} 40673e519524SHoward Hinnant 40683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 40693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40703e519524SHoward Hinnant_ForwardIterator 4071e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 40723e519524SHoward Hinnant{ 4073e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 40743e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 40753e519524SHoward Hinnant} 40763e519524SHoward Hinnant 40773e519524SHoward Hinnant// upper_bound 40783e519524SHoward Hinnant 40793e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 40803e519524SHoward Hinnant_ForwardIterator 4081e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40823e519524SHoward Hinnant{ 40833e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4084ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40853e519524SHoward Hinnant while (__len != 0) 40863e519524SHoward Hinnant { 40873e519524SHoward Hinnant difference_type __l2 = __len / 2; 40883e519524SHoward Hinnant _ForwardIterator __m = __first; 4089ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4090e4383379SHoward Hinnant if (__comp(__value_, *__m)) 40913e519524SHoward Hinnant __len = __l2; 40923e519524SHoward Hinnant else 40933e519524SHoward Hinnant { 40943e519524SHoward Hinnant __first = ++__m; 40953e519524SHoward Hinnant __len -= __l2 + 1; 40963e519524SHoward Hinnant } 40973e519524SHoward Hinnant } 40983e519524SHoward Hinnant return __first; 40993e519524SHoward Hinnant} 41003e519524SHoward Hinnant 41013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41033e519524SHoward Hinnant_ForwardIterator 4104e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41053e519524SHoward Hinnant{ 4106f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 41073e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41083e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4109e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4110f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 41113e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4112e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4113f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 41143e519524SHoward Hinnant} 41153e519524SHoward Hinnant 41163e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41183e519524SHoward Hinnant_ForwardIterator 4119e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41203e519524SHoward Hinnant{ 4121e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41223e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41233e519524SHoward Hinnant} 41243e519524SHoward Hinnant 41253e519524SHoward Hinnant// equal_range 41263e519524SHoward Hinnant 41273e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41283e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4129e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41303e519524SHoward Hinnant{ 41313e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4132ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41333e519524SHoward Hinnant while (__len != 0) 41343e519524SHoward Hinnant { 41353e519524SHoward Hinnant difference_type __l2 = __len / 2; 41363e519524SHoward Hinnant _ForwardIterator __m = __first; 4137ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4138e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41393e519524SHoward Hinnant { 41403e519524SHoward Hinnant __first = ++__m; 41413e519524SHoward Hinnant __len -= __l2 + 1; 41423e519524SHoward Hinnant } 4143e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 41443e519524SHoward Hinnant { 41453e519524SHoward Hinnant __last = __m; 41463e519524SHoward Hinnant __len = __l2; 41473e519524SHoward Hinnant } 41483e519524SHoward Hinnant else 41493e519524SHoward Hinnant { 41503e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 41513e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 41523e519524SHoward Hinnant ( 4153e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4154e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 41553e519524SHoward Hinnant ); 41563e519524SHoward Hinnant } 41573e519524SHoward Hinnant } 41583e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 41593e519524SHoward Hinnant} 41603e519524SHoward Hinnant 41613e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41633e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4164e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41653e519524SHoward Hinnant{ 4166f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 41673e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41683e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4169e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4170f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 41713e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4172e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4173f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 41743e519524SHoward Hinnant} 41753e519524SHoward Hinnant 41763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41783e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4179e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41803e519524SHoward Hinnant{ 4181e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 41823e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41833e519524SHoward Hinnant} 41843e519524SHoward Hinnant 41853e519524SHoward Hinnant// binary_search 41863e519524SHoward Hinnant 41873e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41893e519524SHoward Hinnantbool 4190e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41913e519524SHoward Hinnant{ 4192e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4193e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 41943e519524SHoward Hinnant} 41953e519524SHoward Hinnant 41963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41983e519524SHoward Hinnantbool 4199e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42003e519524SHoward Hinnant{ 4201f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 42023e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42033e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4204e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4205f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 42063e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4207e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4208f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 42093e519524SHoward Hinnant} 42103e519524SHoward Hinnant 42113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42133e519524SHoward Hinnantbool 4214e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42153e519524SHoward Hinnant{ 4216e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42173e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42183e519524SHoward Hinnant} 42193e519524SHoward Hinnant 42203e519524SHoward Hinnant// merge 42213e519524SHoward Hinnant 42223e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42233e519524SHoward Hinnant_OutputIterator 42243e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42263e519524SHoward Hinnant{ 42273e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42283e519524SHoward Hinnant { 42293e519524SHoward Hinnant if (__first2 == __last2) 4230ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 42313e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42323e519524SHoward Hinnant { 42333e519524SHoward Hinnant *__result = *__first2; 42343e519524SHoward Hinnant ++__first2; 42353e519524SHoward Hinnant } 42363e519524SHoward Hinnant else 42373e519524SHoward Hinnant { 42383e519524SHoward Hinnant *__result = *__first1; 42393e519524SHoward Hinnant ++__first1; 42403e519524SHoward Hinnant } 42413e519524SHoward Hinnant } 4242ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 42433e519524SHoward Hinnant} 42443e519524SHoward Hinnant 42453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 42463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42473e519524SHoward Hinnant_OutputIterator 42483e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42503e519524SHoward Hinnant{ 4251f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 42523e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42533e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4254ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4255f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 42563e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4257ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4258f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 42593e519524SHoward Hinnant} 42603e519524SHoward Hinnant 42613e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 42623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42633e519524SHoward Hinnant_OutputIterator 42643e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 42663e519524SHoward Hinnant{ 42673e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 42683e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 42693e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 42703e519524SHoward Hinnant} 42713e519524SHoward Hinnant 42723e519524SHoward Hinnant// inplace_merge 42733e519524SHoward Hinnant 42743e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 42753e519524SHoward Hinnantvoid 42763e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 42773e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 42783e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 42793e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 42803e519524SHoward Hinnant{ 42813e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 42823e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 42833e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 42843e519524SHoward Hinnant __destruct_n __d(0); 42853e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 42863e519524SHoward Hinnant if (__len1 <= __len2) 42873e519524SHoward Hinnant { 42883e519524SHoward Hinnant value_type* __p = __buff; 42893e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 4290ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 42913e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 42923e519524SHoward Hinnant move_iterator<value_type*>(__p), 42933e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 42943e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 42953e519524SHoward Hinnant __first, __comp); 42963e519524SHoward Hinnant } 42973e519524SHoward Hinnant else 42983e519524SHoward Hinnant { 42993e519524SHoward Hinnant value_type* __p = __buff; 43003e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 4301ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43023e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43033e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 43043e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 43053e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 43063e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 43073e519524SHoward Hinnant } 43083e519524SHoward Hinnant} 43093e519524SHoward Hinnant 43103e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43113e519524SHoward Hinnantvoid 43123e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43133e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43143e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43153e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43163e519524SHoward Hinnant{ 43173e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43183e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43193e519524SHoward Hinnant while (true) 43203e519524SHoward Hinnant { 43213e519524SHoward Hinnant // if __middle == __last, we're done 43223e519524SHoward Hinnant if (__len2 == 0) 43233e519524SHoward Hinnant return; 43243e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 43253e519524SHoward Hinnant for (; true; ++__first, --__len1) 43263e519524SHoward Hinnant { 43273e519524SHoward Hinnant if (__len1 == 0) 43283e519524SHoward Hinnant return; 43293e519524SHoward Hinnant if (__comp(*__middle, *__first)) 43303e519524SHoward Hinnant break; 43313e519524SHoward Hinnant } 43323e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 43333e519524SHoward Hinnant { 43343e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 43353e519524SHoward Hinnant return; 43363e519524SHoward Hinnant } 43373e519524SHoward Hinnant // __first < __middle < __last 43383e519524SHoward Hinnant // *__first > *__middle 43393e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 43403e519524SHoward Hinnant // all elements in: 43413e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 43423e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 43433e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 43443e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 43453e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 43463e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 43473e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 43483e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 43493e519524SHoward Hinnant // binary search smaller range 43503e519524SHoward Hinnant if (__len1 < __len2) 43513e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 43523e519524SHoward Hinnant __len21 = __len2 / 2; 43533e519524SHoward Hinnant __m2 = __middle; 4354ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 43553e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4356ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 43573e519524SHoward Hinnant } 43583e519524SHoward Hinnant else 43593e519524SHoward Hinnant { 43603e519524SHoward Hinnant if (__len1 == 1) 43613e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 43623e519524SHoward Hinnant // It is known *__first > *__middle 43633e519524SHoward Hinnant swap(*__first, *__middle); 43643e519524SHoward Hinnant return; 43653e519524SHoward Hinnant } 43663e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 43673e519524SHoward Hinnant __len11 = __len1 / 2; 43683e519524SHoward Hinnant __m1 = __first; 4369ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 43703e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4371ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 43723e519524SHoward Hinnant } 43733e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 43743e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 43753e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 43763e519524SHoward Hinnant // swap middle two partitions 4377ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 43783e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 43793e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 43803e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 43813e519524SHoward Hinnant { 43823e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 43833e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 43843e519524SHoward Hinnant __first = __middle; 43853e519524SHoward Hinnant __middle = __m2; 43863e519524SHoward Hinnant __len1 = __len12; 43873e519524SHoward Hinnant __len2 = __len22; 43883e519524SHoward Hinnant } 43893e519524SHoward Hinnant else 43903e519524SHoward Hinnant { 43913e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 43923e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 43933e519524SHoward Hinnant __last = __middle; 43943e519524SHoward Hinnant __middle = __m1; 43953e519524SHoward Hinnant __len1 = __len11; 43963e519524SHoward Hinnant __len2 = __len21; 43973e519524SHoward Hinnant } 43983e519524SHoward Hinnant } 43993e519524SHoward Hinnant} 44003e519524SHoward Hinnant 44013e519524SHoward Hinnanttemplate <class _Tp> 44023e519524SHoward Hinnantstruct __inplace_merge_switch 44033e519524SHoward Hinnant{ 4404ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 44053e519524SHoward Hinnant}; 44063e519524SHoward Hinnant 44073e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44093e519524SHoward Hinnantvoid 44103e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44113e519524SHoward Hinnant _Compare __comp) 44123e519524SHoward Hinnant{ 44133e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44143e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4415ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4416ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4417ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44183e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 44193e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 44203e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 44213e519524SHoward Hinnant { 4422ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44233e519524SHoward Hinnant __h.reset(__buf.first); 44243e519524SHoward Hinnant } 4425f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 44263e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44273e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4428ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 44293e519524SHoward Hinnant __buf.first, __buf.second); 4430f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 44313e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4432ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 44333e519524SHoward Hinnant __buf.first, __buf.second); 4434f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 44353e519524SHoward Hinnant} 44363e519524SHoward Hinnant 44373e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 44383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44393e519524SHoward Hinnantvoid 44403e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 44413e519524SHoward Hinnant{ 4442ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 44433e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 44443e519524SHoward Hinnant} 44453e519524SHoward Hinnant 44463e519524SHoward Hinnant// stable_sort 44473e519524SHoward Hinnant 44483e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 44493e519524SHoward Hinnantvoid 44503e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 44513e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 44523e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 44533e519524SHoward Hinnant{ 44543e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 44553e519524SHoward Hinnant __destruct_n __d(0); 44563e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 44573e519524SHoward Hinnant for (; true; ++__result) 44583e519524SHoward Hinnant { 44593e519524SHoward Hinnant if (__first1 == __last1) 44603e519524SHoward Hinnant { 44613e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4462ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 44633e519524SHoward Hinnant __h.release(); 44643e519524SHoward Hinnant return; 44653e519524SHoward Hinnant } 44663e519524SHoward Hinnant if (__first2 == __last2) 44673e519524SHoward Hinnant { 44683e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4469ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 44703e519524SHoward Hinnant __h.release(); 44713e519524SHoward Hinnant return; 44723e519524SHoward Hinnant } 44733e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44743e519524SHoward Hinnant { 4475ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 44763e519524SHoward Hinnant __d.__incr((value_type*)0); 44773e519524SHoward Hinnant ++__first2; 44783e519524SHoward Hinnant } 44793e519524SHoward Hinnant else 44803e519524SHoward Hinnant { 4481ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 44823e519524SHoward Hinnant __d.__incr((value_type*)0); 44833e519524SHoward Hinnant ++__first1; 44843e519524SHoward Hinnant } 44853e519524SHoward Hinnant } 44863e519524SHoward Hinnant} 44873e519524SHoward Hinnant 44883e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 44893e519524SHoward Hinnantvoid 44903e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 44913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 44923e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 44933e519524SHoward Hinnant{ 44943e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 44953e519524SHoward Hinnant { 44963e519524SHoward Hinnant if (__first2 == __last2) 44973e519524SHoward Hinnant { 44983e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4499ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45003e519524SHoward Hinnant return; 45013e519524SHoward Hinnant } 45023e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45033e519524SHoward Hinnant { 4504ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45053e519524SHoward Hinnant ++__first2; 45063e519524SHoward Hinnant } 45073e519524SHoward Hinnant else 45083e519524SHoward Hinnant { 4509ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45103e519524SHoward Hinnant ++__first1; 45113e519524SHoward Hinnant } 45123e519524SHoward Hinnant } 45133e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4514ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45153e519524SHoward Hinnant} 45163e519524SHoward Hinnant 45173e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45183e519524SHoward Hinnantvoid 45193e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45203e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45213e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45223e519524SHoward Hinnant 45233e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45243e519524SHoward Hinnantvoid 45253e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45263e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45273e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 45283e519524SHoward Hinnant{ 45293e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45303e519524SHoward Hinnant switch (__len) 45313e519524SHoward Hinnant { 45323e519524SHoward Hinnant case 0: 45333e519524SHoward Hinnant return; 45343e519524SHoward Hinnant case 1: 4535ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45363e519524SHoward Hinnant return; 45373e519524SHoward Hinnant case 2: 45383e519524SHoward Hinnant __destruct_n __d(0); 45393e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 45403e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 45413e519524SHoward Hinnant { 4542ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45433e519524SHoward Hinnant __d.__incr((value_type*)0); 45443e519524SHoward Hinnant ++__first2; 4545ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45463e519524SHoward Hinnant } 45473e519524SHoward Hinnant else 45483e519524SHoward Hinnant { 4549ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45503e519524SHoward Hinnant __d.__incr((value_type*)0); 45513e519524SHoward Hinnant ++__first2; 4552ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45533e519524SHoward Hinnant } 45543e519524SHoward Hinnant __h2.release(); 45553e519524SHoward Hinnant return; 45563e519524SHoward Hinnant } 45573e519524SHoward Hinnant if (__len <= 8) 45583e519524SHoward Hinnant { 45593e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 45603e519524SHoward Hinnant return; 45613e519524SHoward Hinnant } 45623e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 45633e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 45643e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 45653e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 45663e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 45673e519524SHoward Hinnant} 45683e519524SHoward Hinnant 45693e519524SHoward Hinnanttemplate <class _Tp> 45703e519524SHoward Hinnantstruct __stable_sort_switch 45713e519524SHoward Hinnant{ 4572ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 45733e519524SHoward Hinnant}; 45743e519524SHoward Hinnant 45753e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45763e519524SHoward Hinnantvoid 45773e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45783e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45793e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 45803e519524SHoward Hinnant{ 45813e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45823e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45833e519524SHoward Hinnant switch (__len) 45843e519524SHoward Hinnant { 45853e519524SHoward Hinnant case 0: 45863e519524SHoward Hinnant case 1: 45873e519524SHoward Hinnant return; 45883e519524SHoward Hinnant case 2: 45893e519524SHoward Hinnant if (__comp(*--__last, *__first)) 45903e519524SHoward Hinnant swap(*__first, *__last); 45913e519524SHoward Hinnant return; 45923e519524SHoward Hinnant } 45933e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 45943e519524SHoward Hinnant { 45953e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 45963e519524SHoward Hinnant return; 45973e519524SHoward Hinnant } 45983e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 45993e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46003e519524SHoward Hinnant if (__len <= __buff_size) 46013e519524SHoward Hinnant { 46023e519524SHoward Hinnant __destruct_n __d(0); 46033e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46043e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46053e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46063e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46073e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46083e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46093e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46103e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46113e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46123e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46133e519524SHoward Hinnant// __first, __comp); 46143e519524SHoward Hinnant return; 46153e519524SHoward Hinnant } 46163e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46173e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46183e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46193e519524SHoward Hinnant} 46203e519524SHoward Hinnant 46213e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46233e519524SHoward Hinnantvoid 46243e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46253e519524SHoward Hinnant{ 46263e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46273e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46283e519524SHoward Hinnant difference_type __len = __last - __first; 46293e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 46303e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 46313e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46323e519524SHoward Hinnant { 4633ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 46343e519524SHoward Hinnant __h.reset(__buf.first); 46353e519524SHoward Hinnant } 4636f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 46373e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46383e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46393e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4640f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 46413e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46423e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4643f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46443e519524SHoward Hinnant} 46453e519524SHoward Hinnant 46463e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46483e519524SHoward Hinnantvoid 46493e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 46503e519524SHoward Hinnant{ 4651ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46523e519524SHoward Hinnant} 46533e519524SHoward Hinnant 46543e519524SHoward Hinnant// is_heap_until 46553e519524SHoward Hinnant 46563e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46573e519524SHoward Hinnant_RandomAccessIterator 46583e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46593e519524SHoward Hinnant{ 4660ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46613e519524SHoward Hinnant difference_type __len = __last - __first; 46623e519524SHoward Hinnant difference_type __p = 0; 46633e519524SHoward Hinnant difference_type __c = 1; 46643e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 46653e519524SHoward Hinnant while (__c < __len) 46663e519524SHoward Hinnant { 46673e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 46683e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 46693e519524SHoward Hinnant return __cp; 46703e519524SHoward Hinnant ++__c; 46713e519524SHoward Hinnant ++__cp; 46723e519524SHoward Hinnant if (__c == __len) 46733e519524SHoward Hinnant return __last; 46743e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 46753e519524SHoward Hinnant return __cp; 46763e519524SHoward Hinnant ++__p; 46773e519524SHoward Hinnant ++__pp; 46783e519524SHoward Hinnant __c = 2 * __p + 1; 46793e519524SHoward Hinnant } 46803e519524SHoward Hinnant return __last; 46813e519524SHoward Hinnant} 46823e519524SHoward Hinnant 46833e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 46843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46853e519524SHoward Hinnant_RandomAccessIterator 46863e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 46873e519524SHoward Hinnant{ 4688ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46893e519524SHoward Hinnant} 46903e519524SHoward Hinnant 46913e519524SHoward Hinnant// is_heap 46923e519524SHoward Hinnant 46933e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46953e519524SHoward Hinnantbool 46963e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46973e519524SHoward Hinnant{ 4698ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 46993e519524SHoward Hinnant} 47003e519524SHoward Hinnant 47013e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47033e519524SHoward Hinnantbool 47043e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47053e519524SHoward Hinnant{ 4706ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47073e519524SHoward Hinnant} 47083e519524SHoward Hinnant 47093e519524SHoward Hinnant// push_heap 47103e519524SHoward Hinnant 47113e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47123e519524SHoward Hinnantvoid 47133e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 47143e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47153e519524SHoward Hinnant{ 47163e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47183e519524SHoward Hinnant if (__len > 1) 47193e519524SHoward Hinnant { 47203e519524SHoward Hinnant difference_type __p = 0; 47213e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47223e519524SHoward Hinnant difference_type __c = 2; 47233e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47243e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47253e519524SHoward Hinnant { 47263e519524SHoward Hinnant --__c; 47273e519524SHoward Hinnant --__cp; 47283e519524SHoward Hinnant } 47293e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47303e519524SHoward Hinnant { 4731ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__pp)); 47323e519524SHoward Hinnant do 47333e519524SHoward Hinnant { 4734ce48a113SHoward Hinnant *__pp = _VSTD::move(*__cp); 47353e519524SHoward Hinnant __pp = __cp; 47363e519524SHoward Hinnant __p = __c; 47373e519524SHoward Hinnant __c = (__p + 1) * 2; 47383e519524SHoward Hinnant if (__c > __len) 47393e519524SHoward Hinnant break; 47403e519524SHoward Hinnant __cp = __first + __c; 47413e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47423e519524SHoward Hinnant { 47433e519524SHoward Hinnant --__c; 47443e519524SHoward Hinnant --__cp; 47453e519524SHoward Hinnant } 47463e519524SHoward Hinnant } while (__comp(__t, *__cp)); 4747ce48a113SHoward Hinnant *__pp = _VSTD::move(__t); 47483e519524SHoward Hinnant } 47493e519524SHoward Hinnant } 47503e519524SHoward Hinnant} 47513e519524SHoward Hinnant 47523e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47533e519524SHoward Hinnantvoid 47543e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47563e519524SHoward Hinnant{ 47573e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47593e519524SHoward Hinnant if (__len > 1) 47603e519524SHoward Hinnant { 47613e519524SHoward Hinnant __len = (__len - 2) / 2; 47623e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 47633e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 47643e519524SHoward Hinnant { 4765ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 47663e519524SHoward Hinnant do 47673e519524SHoward Hinnant { 4768ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 47693e519524SHoward Hinnant __last = __ptr; 47703e519524SHoward Hinnant if (__len == 0) 47713e519524SHoward Hinnant break; 47723e519524SHoward Hinnant __len = (__len - 1) / 2; 47733e519524SHoward Hinnant __ptr = __first + __len; 47743e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4775ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 47763e519524SHoward Hinnant } 47773e519524SHoward Hinnant } 47783e519524SHoward Hinnant} 47793e519524SHoward Hinnant 47803e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47823e519524SHoward Hinnantvoid 47833e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47843e519524SHoward Hinnant{ 4785f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 47863e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47873e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47883e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4789f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 47903e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47913e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4792f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 47933e519524SHoward Hinnant} 47943e519524SHoward Hinnant 47953e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47973e519524SHoward Hinnantvoid 47983e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47993e519524SHoward Hinnant{ 4800ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48013e519524SHoward Hinnant} 48023e519524SHoward Hinnant 48033e519524SHoward Hinnant// pop_heap 48043e519524SHoward Hinnant 48053e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48073e519524SHoward Hinnantvoid 48083e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48093e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48103e519524SHoward Hinnant{ 48113e519524SHoward Hinnant if (__len > 1) 48123e519524SHoward Hinnant { 48133e519524SHoward Hinnant swap(*__first, *--__last); 48143e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 48153e519524SHoward Hinnant } 48163e519524SHoward Hinnant} 48173e519524SHoward Hinnant 48183e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48203e519524SHoward Hinnantvoid 48213e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48223e519524SHoward Hinnant{ 4823f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 48243e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48253e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48263e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4827f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 48283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48293e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4830f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 48313e519524SHoward Hinnant} 48323e519524SHoward Hinnant 48333e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48353e519524SHoward Hinnantvoid 48363e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48373e519524SHoward Hinnant{ 4838ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48393e519524SHoward Hinnant} 48403e519524SHoward Hinnant 48413e519524SHoward Hinnant// make_heap 48423e519524SHoward Hinnant 48433e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48443e519524SHoward Hinnantvoid 48453e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48463e519524SHoward Hinnant{ 48473e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48483e519524SHoward Hinnant difference_type __n = __last - __first; 48493e519524SHoward Hinnant if (__n > 1) 48503e519524SHoward Hinnant { 48513e519524SHoward Hinnant __last = __first; 48523e519524SHoward Hinnant ++__last; 48533e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 48543e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 48553e519524SHoward Hinnant } 48563e519524SHoward Hinnant} 48573e519524SHoward Hinnant 48583e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48603e519524SHoward Hinnantvoid 48613e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48623e519524SHoward Hinnant{ 4863f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 48643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48663e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4867f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 48683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48693e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4870f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 48713e519524SHoward Hinnant} 48723e519524SHoward Hinnant 48733e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48753e519524SHoward Hinnantvoid 48763e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48773e519524SHoward Hinnant{ 4878ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48793e519524SHoward Hinnant} 48803e519524SHoward Hinnant 48813e519524SHoward Hinnant// sort_heap 48823e519524SHoward Hinnant 48833e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48843e519524SHoward Hinnantvoid 48853e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48863e519524SHoward Hinnant{ 48873e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48883e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 48893e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 48903e519524SHoward Hinnant} 48913e519524SHoward Hinnant 48923e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48943e519524SHoward Hinnantvoid 48953e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48963e519524SHoward Hinnant{ 4897f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 48983e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48993e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49003e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4901f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49023e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49033e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4904f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49053e519524SHoward Hinnant} 49063e519524SHoward Hinnant 49073e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49093e519524SHoward Hinnantvoid 49103e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49113e519524SHoward Hinnant{ 4912ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49133e519524SHoward Hinnant} 49143e519524SHoward Hinnant 49153e519524SHoward Hinnant// partial_sort 49163e519524SHoward Hinnant 49173e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49183e519524SHoward Hinnantvoid 49193e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49203e519524SHoward Hinnant _Compare __comp) 49213e519524SHoward Hinnant{ 49223e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49233e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49243e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49253e519524SHoward Hinnant { 49263e519524SHoward Hinnant if (__comp(*__i, *__first)) 49273e519524SHoward Hinnant { 49283e519524SHoward Hinnant swap(*__i, *__first); 49293e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 49303e519524SHoward Hinnant } 49313e519524SHoward Hinnant } 49323e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 49333e519524SHoward Hinnant} 49343e519524SHoward Hinnant 49353e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49373e519524SHoward Hinnantvoid 49383e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49393e519524SHoward Hinnant _Compare __comp) 49403e519524SHoward Hinnant{ 4941f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49423e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49433e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49443e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 4945f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49463e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49473e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 4948f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49493e519524SHoward Hinnant} 49503e519524SHoward Hinnant 49513e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49533e519524SHoward Hinnantvoid 49543e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 49553e519524SHoward Hinnant{ 4956ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 49573e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49583e519524SHoward Hinnant} 49593e519524SHoward Hinnant 49603e519524SHoward Hinnant// partial_sort_copy 49613e519524SHoward Hinnant 49623e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 49633e519524SHoward Hinnant_RandomAccessIterator 49643e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 49653e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 49663e519524SHoward Hinnant{ 49673e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 49683e519524SHoward Hinnant if (__r != __result_last) 49693e519524SHoward Hinnant { 49703e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 49713e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 49723e519524SHoward Hinnant *__r = *__first; 49733e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 49743e519524SHoward Hinnant for (; __first != __last; ++__first) 49753e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 49763e519524SHoward Hinnant { 49773e519524SHoward Hinnant *__result_first = *__first; 49783e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 49793e519524SHoward Hinnant } 49803e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 49813e519524SHoward Hinnant } 49823e519524SHoward Hinnant return __r; 49833e519524SHoward Hinnant} 49843e519524SHoward Hinnant 49853e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 49863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49873e519524SHoward Hinnant_RandomAccessIterator 49883e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 49893e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 49903e519524SHoward Hinnant{ 4991f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49923e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49933e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49943e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 4995f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49963e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49973e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 4998f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49993e519524SHoward Hinnant} 50003e519524SHoward Hinnant 50013e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50033e519524SHoward Hinnant_RandomAccessIterator 50043e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50053e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50063e519524SHoward Hinnant{ 5007ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50083e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50093e519524SHoward Hinnant} 50103e519524SHoward Hinnant 50113e519524SHoward Hinnant// nth_element 50123e519524SHoward Hinnant 50133e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50143e519524SHoward Hinnantvoid 50153e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50163e519524SHoward Hinnant{ 50173e519524SHoward Hinnant // _Compare is known to be a reference type 50183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50193e519524SHoward Hinnant const difference_type __limit = 7; 50203e519524SHoward Hinnant while (true) 50213e519524SHoward Hinnant { 50223e519524SHoward Hinnant __restart: 5023b34b4819SHoward Hinnant if (__nth == __last) 5024b34b4819SHoward Hinnant return; 50253e519524SHoward Hinnant difference_type __len = __last - __first; 50263e519524SHoward Hinnant switch (__len) 50273e519524SHoward Hinnant { 50283e519524SHoward Hinnant case 0: 50293e519524SHoward Hinnant case 1: 50303e519524SHoward Hinnant return; 50313e519524SHoward Hinnant case 2: 50323e519524SHoward Hinnant if (__comp(*--__last, *__first)) 50333e519524SHoward Hinnant swap(*__first, *__last); 50343e519524SHoward Hinnant return; 50353e519524SHoward Hinnant case 3: 50363e519524SHoward Hinnant { 50373e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5038ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 50393e519524SHoward Hinnant return; 50403e519524SHoward Hinnant } 50413e519524SHoward Hinnant } 50423e519524SHoward Hinnant if (__len <= __limit) 50433e519524SHoward Hinnant { 50443e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 50453e519524SHoward Hinnant return; 50463e519524SHoward Hinnant } 50473e519524SHoward Hinnant // __len > __limit >= 3 50483e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 50493e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5050ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 50513e519524SHoward Hinnant // *__m is median 50523e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 50533e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 50543e519524SHoward Hinnant _RandomAccessIterator __i = __first; 50553e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 50563e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 50573e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 50583e519524SHoward Hinnant // Prime the downward search with a guard. 50593e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 50603e519524SHoward Hinnant { 50613e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 50623e519524SHoward Hinnant // manually guard downward moving __j against __i 50633e519524SHoward Hinnant while (true) 50643e519524SHoward Hinnant { 50653e519524SHoward Hinnant if (__i == --__j) 50663e519524SHoward Hinnant { 50673e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 50683e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 50693e519524SHoward Hinnant ++__i; // __first + 1 50703e519524SHoward Hinnant __j = __last; 50713e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 50723e519524SHoward Hinnant { 50733e519524SHoward Hinnant while (true) 50743e519524SHoward Hinnant { 50753e519524SHoward Hinnant if (__i == __j) 50763e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 50773e519524SHoward Hinnant if (__comp(*__first, *__i)) 50783e519524SHoward Hinnant { 50793e519524SHoward Hinnant swap(*__i, *__j); 50803e519524SHoward Hinnant ++__n_swaps; 50813e519524SHoward Hinnant ++__i; 50823e519524SHoward Hinnant break; 50833e519524SHoward Hinnant } 50843e519524SHoward Hinnant ++__i; 50853e519524SHoward Hinnant } 50863e519524SHoward Hinnant } 50873e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 50883e519524SHoward Hinnant if (__i == __j) 50893e519524SHoward Hinnant return; 50903e519524SHoward Hinnant while (true) 50913e519524SHoward Hinnant { 50923e519524SHoward Hinnant while (!__comp(*__first, *__i)) 50933e519524SHoward Hinnant ++__i; 50943e519524SHoward Hinnant while (__comp(*__first, *--__j)) 50953e519524SHoward Hinnant ; 50963e519524SHoward Hinnant if (__i >= __j) 50973e519524SHoward Hinnant break; 50983e519524SHoward Hinnant swap(*__i, *__j); 50993e519524SHoward Hinnant ++__n_swaps; 51003e519524SHoward Hinnant ++__i; 51013e519524SHoward Hinnant } 51023e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51033e519524SHoward Hinnant // The first part is sorted, 51043e519524SHoward Hinnant if (__nth < __i) 51053e519524SHoward Hinnant return; 51063e519524SHoward Hinnant // __nth_element the secod part 51073e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51083e519524SHoward Hinnant __first = __i; 51093e519524SHoward Hinnant goto __restart; 51103e519524SHoward Hinnant } 51113e519524SHoward Hinnant if (__comp(*__j, *__m)) 51123e519524SHoward Hinnant { 51133e519524SHoward Hinnant swap(*__i, *__j); 51143e519524SHoward Hinnant ++__n_swaps; 51153e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51163e519524SHoward Hinnant } 51173e519524SHoward Hinnant } 51183e519524SHoward Hinnant } 51193e519524SHoward Hinnant ++__i; 51203e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51213e519524SHoward Hinnant // if not yet partitioned... 51223e519524SHoward Hinnant if (__i < __j) 51233e519524SHoward Hinnant { 51243e519524SHoward Hinnant // known that *(__i - 1) < *__m 51253e519524SHoward Hinnant while (true) 51263e519524SHoward Hinnant { 51273e519524SHoward Hinnant // __m still guards upward moving __i 51283e519524SHoward Hinnant while (__comp(*__i, *__m)) 51293e519524SHoward Hinnant ++__i; 51303e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 51313e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 51323e519524SHoward Hinnant ; 51333e519524SHoward Hinnant if (__i >= __j) 51343e519524SHoward Hinnant break; 51353e519524SHoward Hinnant swap(*__i, *__j); 51363e519524SHoward Hinnant ++__n_swaps; 51373e519524SHoward Hinnant // It is known that __m != __j 51383e519524SHoward Hinnant // If __m just moved, follow it 51393e519524SHoward Hinnant if (__m == __i) 51403e519524SHoward Hinnant __m = __j; 51413e519524SHoward Hinnant ++__i; 51423e519524SHoward Hinnant } 51433e519524SHoward Hinnant } 51443e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 51453e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 51463e519524SHoward Hinnant { 51473e519524SHoward Hinnant swap(*__i, *__m); 51483e519524SHoward Hinnant ++__n_swaps; 51493e519524SHoward Hinnant } 51503e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 51513e519524SHoward Hinnant if (__nth == __i) 51523e519524SHoward Hinnant return; 51533e519524SHoward Hinnant if (__n_swaps == 0) 51543e519524SHoward Hinnant { 51553e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 51563e519524SHoward Hinnant if (__nth < __i) 51573e519524SHoward Hinnant { 51583e519524SHoward Hinnant // Check for [__first, __i) already sorted 51593e519524SHoward Hinnant __j = __m = __first; 51603e519524SHoward Hinnant while (++__j != __i) 51613e519524SHoward Hinnant { 51623e519524SHoward Hinnant if (__comp(*__j, *__m)) 51633e519524SHoward Hinnant // not yet sorted, so sort 51643e519524SHoward Hinnant goto not_sorted; 51653e519524SHoward Hinnant __m = __j; 51663e519524SHoward Hinnant } 51673e519524SHoward Hinnant // [__first, __i) sorted 51683e519524SHoward Hinnant return; 51693e519524SHoward Hinnant } 51703e519524SHoward Hinnant else 51713e519524SHoward Hinnant { 51723e519524SHoward Hinnant // Check for [__i, __last) already sorted 51733e519524SHoward Hinnant __j = __m = __i; 51743e519524SHoward Hinnant while (++__j != __last) 51753e519524SHoward Hinnant { 51763e519524SHoward Hinnant if (__comp(*__j, *__m)) 51773e519524SHoward Hinnant // not yet sorted, so sort 51783e519524SHoward Hinnant goto not_sorted; 51793e519524SHoward Hinnant __m = __j; 51803e519524SHoward Hinnant } 51813e519524SHoward Hinnant // [__i, __last) sorted 51823e519524SHoward Hinnant return; 51833e519524SHoward Hinnant } 51843e519524SHoward Hinnant } 51853e519524SHoward Hinnantnot_sorted: 51863e519524SHoward Hinnant // __nth_element on range containing __nth 51873e519524SHoward Hinnant if (__nth < __i) 51883e519524SHoward Hinnant { 51893e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 51903e519524SHoward Hinnant __last = __i; 51913e519524SHoward Hinnant } 51923e519524SHoward Hinnant else 51933e519524SHoward Hinnant { 51943e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 51953e519524SHoward Hinnant __first = ++__i; 51963e519524SHoward Hinnant } 51973e519524SHoward Hinnant } 51983e519524SHoward Hinnant} 51993e519524SHoward Hinnant 52003e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52023e519524SHoward Hinnantvoid 52033e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52043e519524SHoward Hinnant{ 5205f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52083e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5209f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52113e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5212f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52133e519524SHoward Hinnant} 52143e519524SHoward Hinnant 52153e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52173e519524SHoward Hinnantvoid 52183e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52193e519524SHoward Hinnant{ 5220ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52213e519524SHoward Hinnant} 52223e519524SHoward Hinnant 52233e519524SHoward Hinnant// includes 52243e519524SHoward Hinnant 52253e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52263e519524SHoward Hinnantbool 52273e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52283e519524SHoward Hinnant _Compare __comp) 52293e519524SHoward Hinnant{ 52303e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 52313e519524SHoward Hinnant { 52323e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 52333e519524SHoward Hinnant return false; 52343e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 52353e519524SHoward Hinnant ++__first2; 52363e519524SHoward Hinnant } 52373e519524SHoward Hinnant return true; 52383e519524SHoward Hinnant} 52393e519524SHoward Hinnant 52403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 52413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52423e519524SHoward Hinnantbool 52433e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52443e519524SHoward Hinnant _Compare __comp) 52453e519524SHoward Hinnant{ 5246f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52473e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52483e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52493e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5250f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52523e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5253f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52543e519524SHoward Hinnant} 52553e519524SHoward Hinnant 52563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 52573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52583e519524SHoward Hinnantbool 52593e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 52603e519524SHoward Hinnant{ 5261ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 52623e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 52633e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 52643e519524SHoward Hinnant} 52653e519524SHoward Hinnant 52663e519524SHoward Hinnant// set_union 52673e519524SHoward Hinnant 52683e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 52693e519524SHoward Hinnant_OutputIterator 52703e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 52713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 52723e519524SHoward Hinnant{ 52733e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 52743e519524SHoward Hinnant { 52753e519524SHoward Hinnant if (__first2 == __last2) 5276ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 52773e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 52783e519524SHoward Hinnant { 52793e519524SHoward Hinnant *__result = *__first2; 52803e519524SHoward Hinnant ++__first2; 52813e519524SHoward Hinnant } 52823e519524SHoward Hinnant else 52833e519524SHoward Hinnant { 52843e519524SHoward Hinnant *__result = *__first1; 52853e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 52863e519524SHoward Hinnant ++__first2; 52873e519524SHoward Hinnant ++__first1; 52883e519524SHoward Hinnant } 52893e519524SHoward Hinnant } 5290ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 52913e519524SHoward Hinnant} 52923e519524SHoward Hinnant 52933e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 52943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52953e519524SHoward Hinnant_OutputIterator 52963e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 52973e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 52983e519524SHoward Hinnant{ 5299f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53023e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5303f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53053e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5306f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53073e519524SHoward Hinnant} 53083e519524SHoward Hinnant 53093e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53113e519524SHoward Hinnant_OutputIterator 53123e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53143e519524SHoward Hinnant{ 5315ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53163e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53173e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53183e519524SHoward Hinnant} 53193e519524SHoward Hinnant 53203e519524SHoward Hinnant// set_intersection 53213e519524SHoward Hinnant 53223e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53233e519524SHoward Hinnant_OutputIterator 53243e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53263e519524SHoward Hinnant{ 53273e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 53283e519524SHoward Hinnant { 53293e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53303e519524SHoward Hinnant ++__first1; 53313e519524SHoward Hinnant else 53323e519524SHoward Hinnant { 53333e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 53343e519524SHoward Hinnant { 53353e519524SHoward Hinnant *__result = *__first1; 53363e519524SHoward Hinnant ++__result; 53373e519524SHoward Hinnant ++__first1; 53383e519524SHoward Hinnant } 53393e519524SHoward Hinnant ++__first2; 53403e519524SHoward Hinnant } 53413e519524SHoward Hinnant } 53423e519524SHoward Hinnant return __result; 53433e519524SHoward Hinnant} 53443e519524SHoward Hinnant 53453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53473e519524SHoward Hinnant_OutputIterator 53483e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53503e519524SHoward Hinnant{ 5351f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53523e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53533e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53543e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5355f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53563e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53573e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5358f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53593e519524SHoward Hinnant} 53603e519524SHoward Hinnant 53613e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53633e519524SHoward Hinnant_OutputIterator 53643e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53663e519524SHoward Hinnant{ 5367ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 53683e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53693e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53703e519524SHoward Hinnant} 53713e519524SHoward Hinnant 53723e519524SHoward Hinnant// set_difference 53733e519524SHoward Hinnant 53743e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53753e519524SHoward Hinnant_OutputIterator 53763e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 53773e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53783e519524SHoward Hinnant{ 53793e519524SHoward Hinnant while (__first1 != __last1) 53803e519524SHoward Hinnant { 53813e519524SHoward Hinnant if (__first2 == __last2) 5382ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53833e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53843e519524SHoward Hinnant { 53853e519524SHoward Hinnant *__result = *__first1; 53863e519524SHoward Hinnant ++__result; 53873e519524SHoward Hinnant ++__first1; 53883e519524SHoward Hinnant } 53893e519524SHoward Hinnant else 53903e519524SHoward Hinnant { 53913e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 53923e519524SHoward Hinnant ++__first1; 53933e519524SHoward Hinnant ++__first2; 53943e519524SHoward Hinnant } 53953e519524SHoward Hinnant } 53963e519524SHoward Hinnant return __result; 53973e519524SHoward Hinnant} 53983e519524SHoward Hinnant 53993e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54013e519524SHoward Hinnant_OutputIterator 54023e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54033e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54043e519524SHoward Hinnant{ 5405f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 54063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54083e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5409f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 54103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54113e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5412f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 54133e519524SHoward Hinnant} 54143e519524SHoward Hinnant 54153e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54173e519524SHoward Hinnant_OutputIterator 54183e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54193e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54203e519524SHoward Hinnant{ 5421ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54223e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54233e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54243e519524SHoward Hinnant} 54253e519524SHoward Hinnant 54263e519524SHoward Hinnant// set_symmetric_difference 54273e519524SHoward Hinnant 54283e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54293e519524SHoward Hinnant_OutputIterator 54303e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54323e519524SHoward Hinnant{ 54333e519524SHoward Hinnant while (__first1 != __last1) 54343e519524SHoward Hinnant { 54353e519524SHoward Hinnant if (__first2 == __last2) 5436ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54373e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54383e519524SHoward Hinnant { 54393e519524SHoward Hinnant *__result = *__first1; 54403e519524SHoward Hinnant ++__result; 54413e519524SHoward Hinnant ++__first1; 54423e519524SHoward Hinnant } 54433e519524SHoward Hinnant else 54443e519524SHoward Hinnant { 54453e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54463e519524SHoward Hinnant { 54473e519524SHoward Hinnant *__result = *__first2; 54483e519524SHoward Hinnant ++__result; 54493e519524SHoward Hinnant } 54503e519524SHoward Hinnant else 54513e519524SHoward Hinnant ++__first1; 54523e519524SHoward Hinnant ++__first2; 54533e519524SHoward Hinnant } 54543e519524SHoward Hinnant } 5455ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54563e519524SHoward Hinnant} 54573e519524SHoward Hinnant 54583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54603e519524SHoward Hinnant_OutputIterator 54613e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54623e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54633e519524SHoward Hinnant{ 5464f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 54653e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54663e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54673e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5468f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 54693e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54703e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5471f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 54723e519524SHoward Hinnant} 54733e519524SHoward Hinnant 54743e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54763e519524SHoward Hinnant_OutputIterator 54773e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54783e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54793e519524SHoward Hinnant{ 5480ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 54813e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54823e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54833e519524SHoward Hinnant} 54843e519524SHoward Hinnant 54853e519524SHoward Hinnant// lexicographical_compare 54863e519524SHoward Hinnant 54873e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54883e519524SHoward Hinnantbool 54893e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 54903e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 54913e519524SHoward Hinnant{ 54923e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 54933e519524SHoward Hinnant { 54943e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 54953e519524SHoward Hinnant return true; 54963e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54973e519524SHoward Hinnant return false; 54983e519524SHoward Hinnant } 54993e519524SHoward Hinnant return false; 55003e519524SHoward Hinnant} 55013e519524SHoward Hinnant 55023e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55043e519524SHoward Hinnantbool 55053e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55063e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55073e519524SHoward Hinnant{ 5508f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 55093e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55103e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55113e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5512f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 55133e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55143e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5515f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 55163e519524SHoward Hinnant} 55173e519524SHoward Hinnant 55183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55203e519524SHoward Hinnantbool 55213e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55223e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55233e519524SHoward Hinnant{ 5524ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55253e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55263e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55273e519524SHoward Hinnant} 55283e519524SHoward Hinnant 55293e519524SHoward Hinnant// next_permutation 55303e519524SHoward Hinnant 55313e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55323e519524SHoward Hinnantbool 55333e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55343e519524SHoward Hinnant{ 55353e519524SHoward Hinnant _BidirectionalIterator __i = __last; 55363e519524SHoward Hinnant if (__first == __last || __first == --__i) 55373e519524SHoward Hinnant return false; 55383e519524SHoward Hinnant while (true) 55393e519524SHoward Hinnant { 55403e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 55413e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 55423e519524SHoward Hinnant { 55433e519524SHoward Hinnant _BidirectionalIterator __j = __last; 55443e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 55453e519524SHoward Hinnant ; 55463e519524SHoward Hinnant swap(*__i, *__j); 5547ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 55483e519524SHoward Hinnant return true; 55493e519524SHoward Hinnant } 55503e519524SHoward Hinnant if (__i == __first) 55513e519524SHoward Hinnant { 5552ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 55533e519524SHoward Hinnant return false; 55543e519524SHoward Hinnant } 55553e519524SHoward Hinnant } 55563e519524SHoward Hinnant} 55573e519524SHoward Hinnant 55583e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 55593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55603e519524SHoward Hinnantbool 55613e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55623e519524SHoward Hinnant{ 5563f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 55643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55663e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5567f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 55683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55693e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5570f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 55713e519524SHoward Hinnant} 55723e519524SHoward Hinnant 55733e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 55743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55753e519524SHoward Hinnantbool 55763e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 55773e519524SHoward Hinnant{ 5578ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 55793e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 55803e519524SHoward Hinnant} 55813e519524SHoward Hinnant 55823e519524SHoward Hinnant// prev_permutation 55833e519524SHoward Hinnant 55843e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55853e519524SHoward Hinnantbool 55863e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55873e519524SHoward Hinnant{ 55883e519524SHoward Hinnant _BidirectionalIterator __i = __last; 55893e519524SHoward Hinnant if (__first == __last || __first == --__i) 55903e519524SHoward Hinnant return false; 55913e519524SHoward Hinnant while (true) 55923e519524SHoward Hinnant { 55933e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 55943e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 55953e519524SHoward Hinnant { 55963e519524SHoward Hinnant _BidirectionalIterator __j = __last; 55973e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 55983e519524SHoward Hinnant ; 55993e519524SHoward Hinnant swap(*__i, *__j); 5600ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56013e519524SHoward Hinnant return true; 56023e519524SHoward Hinnant } 56033e519524SHoward Hinnant if (__i == __first) 56043e519524SHoward Hinnant { 5605ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56063e519524SHoward Hinnant return false; 56073e519524SHoward Hinnant } 56083e519524SHoward Hinnant } 56093e519524SHoward Hinnant} 56103e519524SHoward Hinnant 56113e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56133e519524SHoward Hinnantbool 56143e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56153e519524SHoward Hinnant{ 5616f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 56173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56193e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5620f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 56213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56223e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5623f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 56243e519524SHoward Hinnant} 56253e519524SHoward Hinnant 56263e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56283e519524SHoward Hinnantbool 56293e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56303e519524SHoward Hinnant{ 5631ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 56323e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56333e519524SHoward Hinnant} 56343e519524SHoward Hinnant 56353e519524SHoward Hinnanttemplate <class _Tp> 56363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56373e519524SHoward Hinnanttypename enable_if 56383e519524SHoward Hinnant< 56393e519524SHoward Hinnant is_integral<_Tp>::value, 56403e519524SHoward Hinnant _Tp 56413e519524SHoward Hinnant>::type 56423e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 56433e519524SHoward Hinnant{ 56443e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 56453e519524SHoward Hinnant __n &= __bits; 56463e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 56473e519524SHoward Hinnant} 56483e519524SHoward Hinnant 56493e519524SHoward Hinnanttemplate <class _Tp> 56503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56513e519524SHoward Hinnanttypename enable_if 56523e519524SHoward Hinnant< 56533e519524SHoward Hinnant is_integral<_Tp>::value, 56543e519524SHoward Hinnant _Tp 56553e519524SHoward Hinnant>::type 56563e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 56573e519524SHoward Hinnant{ 56583e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 56593e519524SHoward Hinnant __n &= __bits; 56603e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 56613e519524SHoward Hinnant} 56623e519524SHoward Hinnant 56633e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 56643e519524SHoward Hinnant 56653e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5666