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 900b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 910b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 920b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 930b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 940b0bbd2fSMarshall 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 1000b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1010b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 1020b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1030b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1040b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1050b0bbd2fSMarshall Clow 1063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1073e519524SHoward Hinnant bool 1083e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1093e519524SHoward Hinnant 1100b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1110b0bbd2fSMarshall Clow bool 1120b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1130b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1140b0bbd2fSMarshall 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 1200b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1210b0bbd2fSMarshall Clow bool 1220b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1230b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1240b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1250b0bbd2fSMarshall Clow 1263e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 1273e519524SHoward Hinnant bool 1283e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1293e519524SHoward Hinnant ForwardIterator2 first2); 1303e519524SHoward Hinnant 1310b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 1320b0bbd2fSMarshall Clow bool 1330b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1340b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1350b0bbd2fSMarshall 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 1410b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1420b0bbd2fSMarshall Clow bool 1430b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1440b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1450b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1460b0bbd2fSMarshall 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 28406965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 28806965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 28906965c1fSMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14 2903e519524SHoward Hinnant 291f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 292f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 293fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 294f9d540b0SHoward Hinnant 2953e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2963e519524SHoward Hinnant bool 2973e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2983e519524SHoward Hinnant 2993e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3003e519524SHoward Hinnant ForwardIterator 3013e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3023e519524SHoward Hinnant 3033e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3043e519524SHoward Hinnant class OutputIterator2, class Predicate> 3053e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3063e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3073e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3083e519524SHoward Hinnant Predicate pred); 3093e519524SHoward Hinnant 3103e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3113e519524SHoward Hinnant ForwardIterator 3123e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3133e519524SHoward Hinnant 3143e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3153e519524SHoward Hinnant ForwardIterator 3163e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3173e519524SHoward Hinnant 3183e519524SHoward Hinnanttemplate <class ForwardIterator> 3193e519524SHoward Hinnant bool 3203e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3213e519524SHoward Hinnant 3223e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3233e519524SHoward Hinnant bool 3243e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3253e519524SHoward Hinnant 3263e519524SHoward Hinnanttemplate<class ForwardIterator> 3273e519524SHoward Hinnant ForwardIterator 3283e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3293e519524SHoward Hinnant 3303e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3313e519524SHoward Hinnant ForwardIterator 3323e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3353e519524SHoward Hinnant void 3363e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3393e519524SHoward Hinnant void 3403e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3433e519524SHoward Hinnant void 3443e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3473e519524SHoward Hinnant void 3483e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3513e519524SHoward Hinnant void 3523e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3533e519524SHoward Hinnant 3543e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3553e519524SHoward Hinnant void 3563e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3573e519524SHoward Hinnant 3583e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3593e519524SHoward Hinnant RandomAccessIterator 3603e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3613e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3623e519524SHoward Hinnant 3633e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3643e519524SHoward Hinnant RandomAccessIterator 3653e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3663e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3673e519524SHoward Hinnant 3683e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3693e519524SHoward Hinnant void 3703e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3713e519524SHoward Hinnant 3723e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3733e519524SHoward Hinnant void 3743e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3753e519524SHoward Hinnant 3763e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3773e519524SHoward Hinnant ForwardIterator 3783e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3793e519524SHoward Hinnant 3803e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3813e519524SHoward Hinnant ForwardIterator 3823e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3833e519524SHoward Hinnant 3843e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3853e519524SHoward Hinnant ForwardIterator 3863e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3873e519524SHoward Hinnant 3883e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3893e519524SHoward Hinnant ForwardIterator 3903e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3913e519524SHoward Hinnant 3923e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3933e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3943e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3953e519524SHoward Hinnant 3963e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3973e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3983e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3993e519524SHoward Hinnant 4003e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4013e519524SHoward Hinnant bool 4023e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4033e519524SHoward Hinnant 4043e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4053e519524SHoward Hinnant bool 4063e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4073e519524SHoward Hinnant 4083e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4093e519524SHoward Hinnant OutputIterator 4103e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4113e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4123e519524SHoward Hinnant 4133e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4143e519524SHoward Hinnant OutputIterator 4153e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4163e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4173e519524SHoward Hinnant 4183e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4193e519524SHoward Hinnant void 4203e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4213e519524SHoward Hinnant 4223e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4233e519524SHoward Hinnant void 4243e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4253e519524SHoward Hinnant 4263e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4273e519524SHoward Hinnant bool 4283e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4293e519524SHoward Hinnant 4303e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4313e519524SHoward Hinnant bool 4323e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4333e519524SHoward Hinnant 4343e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4353e519524SHoward Hinnant OutputIterator 4363e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4373e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4383e519524SHoward Hinnant 4393e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4403e519524SHoward Hinnant OutputIterator 4413e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4423e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4433e519524SHoward Hinnant 4443e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4453e519524SHoward Hinnant OutputIterator 4463e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4473e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4483e519524SHoward Hinnant 4493e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4503e519524SHoward Hinnant OutputIterator 4513e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4523e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4533e519524SHoward Hinnant 4543e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4553e519524SHoward Hinnant OutputIterator 4563e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4573e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4583e519524SHoward Hinnant 4593e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4603e519524SHoward Hinnant OutputIterator 4613e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4623e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4633e519524SHoward Hinnant 4643e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4653e519524SHoward Hinnant OutputIterator 4663e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4673e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4683e519524SHoward Hinnant 4693e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4703e519524SHoward Hinnant OutputIterator 4713e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4723e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4733e519524SHoward Hinnant 4743e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4753e519524SHoward Hinnant void 4763e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4773e519524SHoward Hinnant 4783e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4793e519524SHoward Hinnant void 4803e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4813e519524SHoward Hinnant 4823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4833e519524SHoward Hinnant void 4843e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4853e519524SHoward Hinnant 4863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4873e519524SHoward Hinnant void 4883e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4893e519524SHoward Hinnant 4903e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4913e519524SHoward Hinnant void 4923e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4933e519524SHoward Hinnant 4943e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4953e519524SHoward Hinnant void 4963e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4973e519524SHoward Hinnant 4983e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4993e519524SHoward Hinnant void 5003e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5013e519524SHoward Hinnant 5023e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5033e519524SHoward Hinnant void 5043e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5053e519524SHoward Hinnant 5063e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5073e519524SHoward Hinnant bool 5083e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5093e519524SHoward Hinnant 5103e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5113e519524SHoward Hinnant bool 5123e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5133e519524SHoward Hinnant 5143e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5153e519524SHoward Hinnant RandomAccessIterator 5163e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5173e519524SHoward Hinnant 5183e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5193e519524SHoward Hinnant RandomAccessIterator 5203e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5213e519524SHoward Hinnant 5224eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5234eb27b79SHoward Hinnant ForwardIterator 5240b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5254eb27b79SHoward Hinnant 5264eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5274eb27b79SHoward Hinnant ForwardIterator 5280b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5294eb27b79SHoward Hinnant 5303e519524SHoward Hinnanttemplate <class T> 5313e519524SHoward Hinnant const T& 5329d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5333e519524SHoward Hinnant 5343e519524SHoward Hinnanttemplate <class T, class Compare> 5353e519524SHoward Hinnant const T& 5369d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5373e519524SHoward Hinnant 5383e519524SHoward Hinnanttemplate<class T> 5394eb27b79SHoward Hinnant T 5409d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5413e519524SHoward Hinnant 5423e519524SHoward Hinnanttemplate<class T, class Compare> 5434eb27b79SHoward Hinnant T 5449d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5453e519524SHoward Hinnant 546146c14acSMarshall Clowtemplate<class T> 547146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17 548146c14acSMarshall Clow 549146c14acSMarshall Clowtemplate<class T, class Compare> 550146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17 551146c14acSMarshall Clow 5523e519524SHoward Hinnanttemplate <class ForwardIterator> 5533e519524SHoward Hinnant ForwardIterator 5540b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5553e519524SHoward Hinnant 5563e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5573e519524SHoward Hinnant ForwardIterator 5580b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5593e519524SHoward Hinnant 5604eb27b79SHoward Hinnanttemplate <class T> 5614eb27b79SHoward Hinnant const T& 5629d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5634eb27b79SHoward Hinnant 5644eb27b79SHoward Hinnanttemplate <class T, class Compare> 5654eb27b79SHoward Hinnant const T& 5669d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5674eb27b79SHoward Hinnant 5684eb27b79SHoward Hinnanttemplate<class T> 5694eb27b79SHoward Hinnant T 5709d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5714eb27b79SHoward Hinnant 5724eb27b79SHoward Hinnanttemplate<class T, class Compare> 5734eb27b79SHoward Hinnant T 5749d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5754eb27b79SHoward Hinnant 5764eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5774eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5780b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5794eb27b79SHoward Hinnant 5804eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5814eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5820b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5834eb27b79SHoward Hinnant 5844eb27b79SHoward Hinnanttemplate<class T> 5854eb27b79SHoward Hinnant pair<const T&, const T&> 5869d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5874eb27b79SHoward Hinnant 5884eb27b79SHoward Hinnanttemplate<class T, class Compare> 5894eb27b79SHoward Hinnant pair<const T&, const T&> 5909d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 5914eb27b79SHoward Hinnant 5924eb27b79SHoward Hinnanttemplate<class T> 5934eb27b79SHoward Hinnant pair<T, T> 5949d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 5954eb27b79SHoward Hinnant 5964eb27b79SHoward Hinnanttemplate<class T, class Compare> 5974eb27b79SHoward Hinnant pair<T, T> 5989d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 5994eb27b79SHoward Hinnant 6003e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6013e519524SHoward Hinnant bool 6023e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6033e519524SHoward Hinnant 6043e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6053e519524SHoward Hinnant bool 6063e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6073e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6083e519524SHoward Hinnant 6093e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6103e519524SHoward Hinnant bool 6113e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6123e519524SHoward Hinnant 6133e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6143e519524SHoward Hinnant bool 6153e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6163e519524SHoward Hinnant 6173e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6183e519524SHoward Hinnant bool 6193e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6203e519524SHoward Hinnant 6213e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6223e519524SHoward Hinnant bool 6233e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6243e519524SHoward Hinnant 6253e519524SHoward Hinnant} // std 6263e519524SHoward Hinnant 6273e519524SHoward Hinnant*/ 6283e519524SHoward Hinnant 6293e519524SHoward Hinnant#include <__config> 6303e519524SHoward Hinnant#include <initializer_list> 6313e519524SHoward Hinnant#include <type_traits> 6323e519524SHoward Hinnant#include <cstring> 6333e519524SHoward Hinnant#include <utility> 6343e519524SHoward Hinnant#include <memory> 6353e519524SHoward Hinnant#include <iterator> 636a1d07d57SHoward Hinnant#include <cstddef> 6373e519524SHoward Hinnant 6385d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6395d1a701dSHoward Hinnant#include "support/ibm/support.h" 6405d1a701dSHoward Hinnant#endif 6415f878d4bSHoward Hinnant#if defined(_LIBCPP_MSVCRT) || defined(__MINGW32__) 6425f878d4bSHoward Hinnant#include "support/win32/support.h" 6435f878d4bSHoward Hinnant#endif 6445d1a701dSHoward Hinnant 645ab4f4382SHoward Hinnant#include <__undef_min_max> 646ab4f4382SHoward Hinnant 647c1bd9197SEric Fiselier#include <__debug> 648c1bd9197SEric Fiselier 649073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6503e519524SHoward Hinnant#pragma GCC system_header 651073458b1SHoward Hinnant#endif 6523e519524SHoward Hinnant 6533e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6543e519524SHoward Hinnant 6559d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6569d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6579d67c6d5SMarshall Clow// * We haven't included <functional> here. 6583e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6593e519524SHoward Hinnantstruct __equal_to 6603e519524SHoward Hinnant{ 6613e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6623e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6633e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6643e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6653e519524SHoward Hinnant}; 6663e519524SHoward Hinnant 6673e519524SHoward Hinnanttemplate <class _T1> 6683e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6693e519524SHoward Hinnant{ 6709d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6719d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6723e519524SHoward Hinnant}; 6733e519524SHoward Hinnant 6743e519524SHoward Hinnanttemplate <class _T1> 6753e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6763e519524SHoward Hinnant{ 6779d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6789d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6793e519524SHoward Hinnant}; 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class _T1> 6823e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6833e519524SHoward Hinnant{ 6849d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6859d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6863e519524SHoward Hinnant}; 6873e519524SHoward Hinnant 6883e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6893e519524SHoward Hinnantstruct __less 6903e519524SHoward Hinnant{ 6919d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6929d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6939d67c6d5SMarshall Clow 6949d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6959d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6969d67c6d5SMarshall Clow 6979d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6989d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6999d67c6d5SMarshall Clow 7009d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7019d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7023e519524SHoward Hinnant}; 7033e519524SHoward Hinnant 7043e519524SHoward Hinnanttemplate <class _T1> 7053e519524SHoward Hinnantstruct __less<_T1, _T1> 7063e519524SHoward Hinnant{ 7079d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7089d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7093e519524SHoward Hinnant}; 7103e519524SHoward Hinnant 7113e519524SHoward Hinnanttemplate <class _T1> 7123e519524SHoward Hinnantstruct __less<const _T1, _T1> 7133e519524SHoward Hinnant{ 7149d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7159d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7163e519524SHoward Hinnant}; 7173e519524SHoward Hinnant 7183e519524SHoward Hinnanttemplate <class _T1> 7193e519524SHoward Hinnantstruct __less<_T1, const _T1> 7203e519524SHoward Hinnant{ 7219d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7229d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7233e519524SHoward Hinnant}; 7243e519524SHoward Hinnant 7253e519524SHoward Hinnanttemplate <class _Predicate> 7263e519524SHoward Hinnantclass __negate 7273e519524SHoward Hinnant{ 7283e519524SHoward Hinnantprivate: 7293e519524SHoward Hinnant _Predicate __p_; 7303e519524SHoward Hinnantpublic: 7313e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7323e519524SHoward Hinnant 7333e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7343e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7353e519524SHoward Hinnant 7363e519524SHoward Hinnant template <class _T1> 7373e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7383e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7393e519524SHoward Hinnant 7403e519524SHoward Hinnant template <class _T1, class _T2> 7413e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7423e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7433e519524SHoward Hinnant}; 7443e519524SHoward Hinnant 745145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7463e519524SHoward Hinnant 7473e519524SHoward Hinnanttemplate <class _Compare> 7483e519524SHoward Hinnantstruct __debug_less 7493e519524SHoward Hinnant{ 7503e519524SHoward Hinnant _Compare __comp_; 7513e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 7523e519524SHoward Hinnant template <class _Tp, class _Up> 7533e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7543e519524SHoward Hinnant { 7553e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7563e519524SHoward Hinnant if (__r) 757f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 7583e519524SHoward Hinnant return __r; 7593e519524SHoward Hinnant } 7603e519524SHoward Hinnant}; 7613e519524SHoward Hinnant 762145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7633e519524SHoward Hinnant 764c8edcb36SHoward Hinnant// Precondition: __x != 0 765c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 766c206366fSHoward Hinnantunsigned 767c206366fSHoward Hinnant__ctz(unsigned __x) 768c206366fSHoward Hinnant{ 769c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 770c206366fSHoward Hinnant} 771c206366fSHoward Hinnant 772c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 773c206366fSHoward Hinnantunsigned long 774c206366fSHoward Hinnant__ctz(unsigned long __x) 775c206366fSHoward Hinnant{ 776c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 777c206366fSHoward Hinnant} 778c206366fSHoward Hinnant 779c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 780c206366fSHoward Hinnantunsigned long long 781c206366fSHoward Hinnant__ctz(unsigned long long __x) 782c206366fSHoward Hinnant{ 783c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 784c206366fSHoward Hinnant} 785c8edcb36SHoward Hinnant 786c8edcb36SHoward Hinnant// Precondition: __x != 0 787c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 788c206366fSHoward Hinnantunsigned 789c206366fSHoward Hinnant__clz(unsigned __x) 790c206366fSHoward Hinnant{ 791c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 792c206366fSHoward Hinnant} 793c206366fSHoward Hinnant 794c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 795c206366fSHoward Hinnantunsigned long 796c206366fSHoward Hinnant__clz(unsigned long __x) 797c206366fSHoward Hinnant{ 798c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 799c206366fSHoward Hinnant} 800c206366fSHoward Hinnant 801c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 802c206366fSHoward Hinnantunsigned long long 803c206366fSHoward Hinnant__clz(unsigned long long __x) 804c206366fSHoward Hinnant{ 805c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 806c206366fSHoward Hinnant} 807c8edcb36SHoward Hinnant 808c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 809c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 810c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 811c8edcb36SHoward Hinnant 8123e519524SHoward Hinnant// all_of 8133e519524SHoward Hinnant 8143e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8163e519524SHoward Hinnantbool 8173e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8183e519524SHoward Hinnant{ 8193e519524SHoward Hinnant for (; __first != __last; ++__first) 8203e519524SHoward Hinnant if (!__pred(*__first)) 8213e519524SHoward Hinnant return false; 8223e519524SHoward Hinnant return true; 8233e519524SHoward Hinnant} 8243e519524SHoward Hinnant 8253e519524SHoward Hinnant// any_of 8263e519524SHoward Hinnant 8273e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8293e519524SHoward Hinnantbool 8303e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8313e519524SHoward Hinnant{ 8323e519524SHoward Hinnant for (; __first != __last; ++__first) 8333e519524SHoward Hinnant if (__pred(*__first)) 8343e519524SHoward Hinnant return true; 8353e519524SHoward Hinnant return false; 8363e519524SHoward Hinnant} 8373e519524SHoward Hinnant 8383e519524SHoward Hinnant// none_of 8393e519524SHoward Hinnant 8403e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8423e519524SHoward Hinnantbool 8433e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8443e519524SHoward Hinnant{ 8453e519524SHoward Hinnant for (; __first != __last; ++__first) 8463e519524SHoward Hinnant if (__pred(*__first)) 8473e519524SHoward Hinnant return false; 8483e519524SHoward Hinnant return true; 8493e519524SHoward Hinnant} 8503e519524SHoward Hinnant 8513e519524SHoward Hinnant// for_each 8523e519524SHoward Hinnant 8533e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8553e519524SHoward Hinnant_Function 8563e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8573e519524SHoward Hinnant{ 8583e519524SHoward Hinnant for (; __first != __last; ++__first) 8593e519524SHoward Hinnant __f(*__first); 860251c6291SDimitry Andric return _LIBCPP_EXPLICIT_MOVE(__f); // explicitly moved for (emulated) C++03 8613e519524SHoward Hinnant} 8623e519524SHoward Hinnant 8633e519524SHoward Hinnant// find 8643e519524SHoward Hinnant 8653e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8673e519524SHoward Hinnant_InputIterator 868e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8693e519524SHoward Hinnant{ 8703e519524SHoward Hinnant for (; __first != __last; ++__first) 871e4383379SHoward Hinnant if (*__first == __value_) 8723e519524SHoward Hinnant break; 8733e519524SHoward Hinnant return __first; 8743e519524SHoward Hinnant} 8753e519524SHoward Hinnant 8763e519524SHoward Hinnant// find_if 8773e519524SHoward Hinnant 8783e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8803e519524SHoward Hinnant_InputIterator 8813e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8823e519524SHoward Hinnant{ 8833e519524SHoward Hinnant for (; __first != __last; ++__first) 8843e519524SHoward Hinnant if (__pred(*__first)) 8853e519524SHoward Hinnant break; 8863e519524SHoward Hinnant return __first; 8873e519524SHoward Hinnant} 8883e519524SHoward Hinnant 8893e519524SHoward Hinnant// find_if_not 8903e519524SHoward Hinnant 8913e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8933e519524SHoward Hinnant_InputIterator 8943e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8953e519524SHoward Hinnant{ 8963e519524SHoward Hinnant for (; __first != __last; ++__first) 8973e519524SHoward Hinnant if (!__pred(*__first)) 8983e519524SHoward Hinnant break; 8993e519524SHoward Hinnant return __first; 9003e519524SHoward Hinnant} 9013e519524SHoward Hinnant 9023e519524SHoward Hinnant// find_end 9033e519524SHoward Hinnant 9043e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9053e519524SHoward Hinnant_ForwardIterator1 9063e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9073e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9083e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9093e519524SHoward Hinnant{ 9103e519524SHoward Hinnant // modeled after search algorithm 9113e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9123e519524SHoward Hinnant if (__first2 == __last2) 9133e519524SHoward Hinnant return __r; 9143e519524SHoward Hinnant while (true) 9153e519524SHoward Hinnant { 9163e519524SHoward Hinnant while (true) 9173e519524SHoward Hinnant { 9183e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9193e519524SHoward Hinnant return __r; // (or __last1 if never found) 9203e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9213e519524SHoward Hinnant break; 9223e519524SHoward Hinnant ++__first1; 9233e519524SHoward Hinnant } 9243e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9253e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9263e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9273e519524SHoward Hinnant while (true) 9283e519524SHoward Hinnant { 9293e519524SHoward Hinnant if (++__m2 == __last2) 9303e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9313e519524SHoward Hinnant __r = __first1; 9323e519524SHoward Hinnant ++__first1; 9333e519524SHoward Hinnant break; 9343e519524SHoward Hinnant } 9353e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9363e519524SHoward Hinnant return __r; 9373e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9383e519524SHoward Hinnant { 9393e519524SHoward Hinnant ++__first1; 9403e519524SHoward Hinnant break; 9413e519524SHoward Hinnant } // else there is a match, check next elements 9423e519524SHoward Hinnant } 9433e519524SHoward Hinnant } 9443e519524SHoward Hinnant} 9453e519524SHoward Hinnant 9463e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9473e519524SHoward Hinnant_BidirectionalIterator1 9483e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9493e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9503e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9513e519524SHoward Hinnant{ 9523e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9533e519524SHoward Hinnant if (__first2 == __last2) 9543e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9553e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9563e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9573e519524SHoward Hinnant --__l2; 9583e519524SHoward Hinnant while (true) 9593e519524SHoward Hinnant { 9603e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9613e519524SHoward Hinnant while (true) 9623e519524SHoward Hinnant { 9633e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9643e519524SHoward Hinnant return __last1; 9653e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9663e519524SHoward Hinnant break; 9673e519524SHoward Hinnant } 9683e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9693e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9703e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9713e519524SHoward Hinnant while (true) 9723e519524SHoward Hinnant { 9733e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9743e519524SHoward Hinnant return __m1; 9753e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9763e519524SHoward Hinnant return __last1; 9773e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9783e519524SHoward Hinnant { 9793e519524SHoward Hinnant break; 9803e519524SHoward Hinnant } // else there is a match, check next elements 9813e519524SHoward Hinnant } 9823e519524SHoward Hinnant } 9833e519524SHoward Hinnant} 9843e519524SHoward Hinnant 9853e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9869b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 9873e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9883e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9893e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9903e519524SHoward Hinnant{ 9913e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9923e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9933e519524SHoward Hinnant if (__len2 == 0) 9943e519524SHoward Hinnant return __last1; 9953e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9963e519524SHoward Hinnant if (__len1 < __len2) 9973e519524SHoward Hinnant return __last1; 9983e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9993e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10003e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10013e519524SHoward Hinnant --__l2; 10023e519524SHoward Hinnant while (true) 10033e519524SHoward Hinnant { 10043e519524SHoward Hinnant while (true) 10053e519524SHoward Hinnant { 10063e519524SHoward Hinnant if (__s == __l1) 10073e519524SHoward Hinnant return __last1; 10083e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10093e519524SHoward Hinnant break; 10103e519524SHoward Hinnant } 10113e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10123e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10133e519524SHoward Hinnant while (true) 10143e519524SHoward Hinnant { 10153e519524SHoward Hinnant if (__m2 == __first2) 10163e519524SHoward Hinnant return __m1; 10173e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10183e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10193e519524SHoward Hinnant { 10203e519524SHoward Hinnant break; 10213e519524SHoward Hinnant } 10223e519524SHoward Hinnant } 10233e519524SHoward Hinnant } 10243e519524SHoward Hinnant} 10253e519524SHoward Hinnant 10263e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10283e519524SHoward Hinnant_ForwardIterator1 10293e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10303e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10313e519524SHoward Hinnant{ 1032ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10333e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10343e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10353e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10363e519524SHoward Hinnant} 10373e519524SHoward Hinnant 10383e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10403e519524SHoward Hinnant_ForwardIterator1 10413e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10423e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10433e519524SHoward Hinnant{ 10443e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1046ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10473e519524SHoward Hinnant} 10483e519524SHoward Hinnant 10493e519524SHoward Hinnant// find_first_of 10503e519524SHoward Hinnant 10513e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10529b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 10539b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10543e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10553e519524SHoward Hinnant{ 10563e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10573e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10583e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10593e519524SHoward Hinnant return __first1; 10603e519524SHoward Hinnant return __last1; 10613e519524SHoward Hinnant} 10623e519524SHoward Hinnant 10639b0af34dSMarshall Clow 10649b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10659b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 10669b0af34dSMarshall Clow_ForwardIterator1 10679b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10689b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10699b0af34dSMarshall Clow{ 10709b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 10719b0af34dSMarshall Clow} 10729b0af34dSMarshall Clow 10733e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10753e519524SHoward Hinnant_ForwardIterator1 10763e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10773e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10783e519524SHoward Hinnant{ 10793e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 10819b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10823e519524SHoward Hinnant} 10833e519524SHoward Hinnant 10843e519524SHoward Hinnant// adjacent_find 10853e519524SHoward Hinnant 10863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10883e519524SHoward Hinnant_ForwardIterator 10893e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10903e519524SHoward Hinnant{ 10913e519524SHoward Hinnant if (__first != __last) 10923e519524SHoward Hinnant { 10933e519524SHoward Hinnant _ForwardIterator __i = __first; 10943e519524SHoward Hinnant while (++__i != __last) 10953e519524SHoward Hinnant { 10963e519524SHoward Hinnant if (__pred(*__first, *__i)) 10973e519524SHoward Hinnant return __first; 10983e519524SHoward Hinnant __first = __i; 10993e519524SHoward Hinnant } 11003e519524SHoward Hinnant } 11013e519524SHoward Hinnant return __last; 11023e519524SHoward Hinnant} 11033e519524SHoward Hinnant 11043e519524SHoward Hinnanttemplate <class _ForwardIterator> 11053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11063e519524SHoward Hinnant_ForwardIterator 11073e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11083e519524SHoward Hinnant{ 11093e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1110ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11113e519524SHoward Hinnant} 11123e519524SHoward Hinnant 11133e519524SHoward Hinnant// count 11143e519524SHoward Hinnant 11153e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 11163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11173e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1118e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11193e519524SHoward Hinnant{ 11203e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11213e519524SHoward Hinnant for (; __first != __last; ++__first) 1122e4383379SHoward Hinnant if (*__first == __value_) 11233e519524SHoward Hinnant ++__r; 11243e519524SHoward Hinnant return __r; 11253e519524SHoward Hinnant} 11263e519524SHoward Hinnant 11273e519524SHoward Hinnant// count_if 11283e519524SHoward Hinnant 11293e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11313e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11323e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11333e519524SHoward Hinnant{ 11343e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11353e519524SHoward Hinnant for (; __first != __last; ++__first) 11363e519524SHoward Hinnant if (__pred(*__first)) 11373e519524SHoward Hinnant ++__r; 11383e519524SHoward Hinnant return __r; 11393e519524SHoward Hinnant} 11403e519524SHoward Hinnant 11413e519524SHoward Hinnant// mismatch 11423e519524SHoward Hinnant 11433e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11453e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11463e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11473e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11483e519524SHoward Hinnant{ 1149bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 11503e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11513e519524SHoward Hinnant break; 11523e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11533e519524SHoward Hinnant} 11543e519524SHoward Hinnant 11553e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11573e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11583e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11593e519524SHoward Hinnant{ 11603e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11613e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1162ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11633e519524SHoward Hinnant} 11643e519524SHoward Hinnant 11650b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11660b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11670b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11680b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11690b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11700b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11710b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11720b0bbd2fSMarshall Clow{ 1173bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 11740b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11750b0bbd2fSMarshall Clow break; 11760b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11770b0bbd2fSMarshall Clow} 11780b0bbd2fSMarshall Clow 11790b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11800b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11810b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11820b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11830b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11840b0bbd2fSMarshall Clow{ 11850b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11860b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 11870b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11880b0bbd2fSMarshall Clow} 11890b0bbd2fSMarshall Clow#endif 11900b0bbd2fSMarshall Clow 11913e519524SHoward Hinnant// equal 11923e519524SHoward Hinnant 11933e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11953e519524SHoward Hinnantbool 11963e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11973e519524SHoward Hinnant{ 1198910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 11993e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12003e519524SHoward Hinnant return false; 12013e519524SHoward Hinnant return true; 12023e519524SHoward Hinnant} 12033e519524SHoward Hinnant 12043e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12063e519524SHoward Hinnantbool 12073e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12083e519524SHoward Hinnant{ 12093e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12103e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1211ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12123e519524SHoward Hinnant} 12133e519524SHoward Hinnant 12140b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12150b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12160b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12170b0bbd2fSMarshall Clowbool 12180b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12190b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12200b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12210b0bbd2fSMarshall Clow{ 1222910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12230b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12240b0bbd2fSMarshall Clow return false; 12250b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12260b0bbd2fSMarshall Clow} 12270b0bbd2fSMarshall Clow 12280b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12290b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12300b0bbd2fSMarshall Clowbool 12310b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12320b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12330b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12340b0bbd2fSMarshall Clow{ 12350b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12360b0bbd2fSMarshall Clow return false; 12370b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12380b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12390b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12400b0bbd2fSMarshall Clow} 12410b0bbd2fSMarshall Clow 12420b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12430b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12440b0bbd2fSMarshall Clowbool 12450b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12460b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12470b0bbd2fSMarshall Clow{ 12480b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12490b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12500b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12510b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12520b0bbd2fSMarshall Clow} 12530b0bbd2fSMarshall Clow 12540b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12550b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12560b0bbd2fSMarshall Clowbool 12570b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12580b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12590b0bbd2fSMarshall Clow{ 12600b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12610b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12620b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12630b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12640b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12650b0bbd2fSMarshall Clow} 12660b0bbd2fSMarshall Clow#endif 12670b0bbd2fSMarshall Clow 12683e519524SHoward Hinnant// is_permutation 12693e519524SHoward Hinnant 12703e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12713e519524SHoward Hinnantbool 12723e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12733e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12743e519524SHoward Hinnant{ 12753e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1276910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12773e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12783e519524SHoward Hinnant goto __not_done; 12793e519524SHoward Hinnant return true; 12803e519524SHoward Hinnant__not_done: 12813e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12823e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1283ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12843e519524SHoward Hinnant if (__l1 == _D1(1)) 12853e519524SHoward Hinnant return false; 1286ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12873e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12883e519524SHoward Hinnant // equal elements in [f2, l2) 12893e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12903e519524SHoward Hinnant { 12913e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 12923e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 12933e519524SHoward Hinnant if (__pred(*__j, *__i)) 12943e519524SHoward Hinnant goto __next_iter; 12953e519524SHoward Hinnant { 12963e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12973e519524SHoward Hinnant _D1 __c2 = 0; 12983e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12993e519524SHoward Hinnant if (__pred(*__i, *__j)) 13003e519524SHoward Hinnant ++__c2; 13013e519524SHoward Hinnant if (__c2 == 0) 13023e519524SHoward Hinnant return false; 13033e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13043e519524SHoward Hinnant _D1 __c1 = 1; 1305ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13063e519524SHoward Hinnant if (__pred(*__i, *__j)) 13073e519524SHoward Hinnant ++__c1; 13083e519524SHoward Hinnant if (__c1 != __c2) 13093e519524SHoward Hinnant return false; 13103e519524SHoward Hinnant } 13113e519524SHoward Hinnant__next_iter:; 13123e519524SHoward Hinnant } 13133e519524SHoward Hinnant return true; 13143e519524SHoward Hinnant} 13153e519524SHoward Hinnant 13163e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 13173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13183e519524SHoward Hinnantbool 13193e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13203e519524SHoward Hinnant _ForwardIterator2 __first2) 13213e519524SHoward Hinnant{ 13223e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13233e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1324ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13253e519524SHoward Hinnant} 13263e519524SHoward Hinnant 13270b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13280b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13290b0bbd2fSMarshall Clowbool 13300b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13310b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13320b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13330b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13340b0bbd2fSMarshall Clow{ 13350b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1336847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13370b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13380b0bbd2fSMarshall Clow goto __not_done; 13390b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13400b0bbd2fSMarshall Clow__not_done: 13410b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13420b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13430b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13440b0bbd2fSMarshall Clow 13450b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1346fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13470b0bbd2fSMarshall Clow if (__l1 != __l2) 13480b0bbd2fSMarshall Clow return false; 13490b0bbd2fSMarshall Clow 13500b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13510b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13520b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13530b0bbd2fSMarshall Clow { 13540b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13550b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13560b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13570b0bbd2fSMarshall Clow goto __next_iter; 13580b0bbd2fSMarshall Clow { 13590b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13600b0bbd2fSMarshall Clow _D1 __c2 = 0; 13610b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13620b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13630b0bbd2fSMarshall Clow ++__c2; 13640b0bbd2fSMarshall Clow if (__c2 == 0) 13650b0bbd2fSMarshall Clow return false; 13660b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13670b0bbd2fSMarshall Clow _D1 __c1 = 1; 13680b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13690b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13700b0bbd2fSMarshall Clow ++__c1; 13710b0bbd2fSMarshall Clow if (__c1 != __c2) 13720b0bbd2fSMarshall Clow return false; 13730b0bbd2fSMarshall Clow } 13740b0bbd2fSMarshall Clow__next_iter:; 13750b0bbd2fSMarshall Clow } 13760b0bbd2fSMarshall Clow return true; 13770b0bbd2fSMarshall Clow} 13780b0bbd2fSMarshall Clow 13790b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13800b0bbd2fSMarshall Clowbool 13810b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13820b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13830b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13840b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13850b0bbd2fSMarshall Clow{ 13860b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13870b0bbd2fSMarshall Clow return false; 13880b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 13890b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13900b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13910b0bbd2fSMarshall Clow} 13920b0bbd2fSMarshall Clow 13930b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13940b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13950b0bbd2fSMarshall Clowbool 13960b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13970b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13980b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 13990b0bbd2fSMarshall Clow{ 14000b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14010b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14020b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14030b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14040b0bbd2fSMarshall Clow} 14050b0bbd2fSMarshall Clow 14060b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 14070b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 14080b0bbd2fSMarshall Clowbool 14090b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14100b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14110b0bbd2fSMarshall Clow{ 14120b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14130b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14140b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14150b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14160b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14170b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14180b0bbd2fSMarshall Clow} 14190b0bbd2fSMarshall Clow#endif 14200b0bbd2fSMarshall Clow 14213e519524SHoward Hinnant// search 14223e519524SHoward Hinnant 14233e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 1424*28cc4ddeSMarshall Clowpair<_ForwardIterator1, _ForwardIterator1> 14253e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14263e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 14273e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 14283e519524SHoward Hinnant{ 14293e519524SHoward Hinnant if (__first2 == __last2) 1430*28cc4ddeSMarshall Clow return make_pair(__first1, __first1); // Everything matches an empty sequence 14313e519524SHoward Hinnant while (true) 14323e519524SHoward Hinnant { 14333e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 14343e519524SHoward Hinnant while (true) 14353e519524SHoward Hinnant { 14363e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 1437*28cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14383e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14393e519524SHoward Hinnant break; 14403e519524SHoward Hinnant ++__first1; 14413e519524SHoward Hinnant } 14423e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14433e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14443e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14453e519524SHoward Hinnant while (true) 14463e519524SHoward Hinnant { 14473e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 1448*28cc4ddeSMarshall Clow return make_pair(__first1, __m1); 14493e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 1450*28cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14513e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14523e519524SHoward Hinnant { 14533e519524SHoward Hinnant ++__first1; 14543e519524SHoward Hinnant break; 14553e519524SHoward Hinnant } // else there is a match, check next elements 14563e519524SHoward Hinnant } 14573e519524SHoward Hinnant } 14583e519524SHoward Hinnant} 14593e519524SHoward Hinnant 14603e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 1461*28cc4ddeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 1462*28cc4ddeSMarshall Clowpair<_RandomAccessIterator1, _RandomAccessIterator1> 14633e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14643e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14653e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14663e519524SHoward Hinnant{ 1467*28cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1; 1468*28cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14693e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 1470*28cc4ddeSMarshall Clow const _D2 __len2 = __last2 - __first2; 14713e519524SHoward Hinnant if (__len2 == 0) 1472*28cc4ddeSMarshall Clow return make_pair(__first1, __first1); 1473*28cc4ddeSMarshall Clow const _D1 __len1 = __last1 - __first1; 14743e519524SHoward Hinnant if (__len1 < __len2) 1475*28cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14763e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14773e519524SHoward Hinnant while (true) 14783e519524SHoward Hinnant { 14793e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14803e519524SHoward Hinnant while (true) 14813e519524SHoward Hinnant { 14823e519524SHoward Hinnant if (__first1 == __s) 1483*28cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14843e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14853e519524SHoward Hinnant break; 14863e519524SHoward Hinnant ++__first1; 14873e519524SHoward Hinnant } 1488b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14893e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 14903e519524SHoward Hinnant { 14913e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14923e519524SHoward Hinnant goto __phase2; 14933e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14943e519524SHoward Hinnant goto __phase2; 14953e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14963e519524SHoward Hinnant goto __phase2; 14973e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14983e519524SHoward Hinnant goto __phase2; 14993e519524SHoward Hinnant ++__first1; 15003e519524SHoward Hinnant } 15013e519524SHoward Hinnant switch (__s - __first1) 15023e519524SHoward Hinnant { 15033e519524SHoward Hinnant case 3: 15043e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15053e519524SHoward Hinnant break; 15063e519524SHoward Hinnant ++__first1; 15073e519524SHoward Hinnant case 2: 15083e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15093e519524SHoward Hinnant break; 15103e519524SHoward Hinnant ++__first1; 15113e519524SHoward Hinnant case 1: 15123e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15133e519524SHoward Hinnant break; 15143e519524SHoward Hinnant case 0: 1515*28cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15163e519524SHoward Hinnant } 15173e519524SHoward Hinnant __phase2: 1518b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15193e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 15203e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 15213e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 15223e519524SHoward Hinnant while (true) 15233e519524SHoward Hinnant { 15243e519524SHoward Hinnant if (++__m2 == __last2) 1525*28cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 15263e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 15273e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15283e519524SHoward Hinnant { 15293e519524SHoward Hinnant ++__first1; 15303e519524SHoward Hinnant break; 15313e519524SHoward Hinnant } 15323e519524SHoward Hinnant } 1533b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 15343e519524SHoward Hinnant ++__m2; 15353e519524SHoward Hinnant ++__m1; 15363e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 15373e519524SHoward Hinnant { 15383e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15393e519524SHoward Hinnant goto __continue; 15403e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15413e519524SHoward Hinnant goto __continue; 15423e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15433e519524SHoward Hinnant goto __continue; 15443e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15453e519524SHoward Hinnant goto __continue; 15463e519524SHoward Hinnant ++__m1; 15473e519524SHoward Hinnant ++__m2; 15483e519524SHoward Hinnant } 15493e519524SHoward Hinnant switch (__last2 - __m2) 15503e519524SHoward Hinnant { 15513e519524SHoward Hinnant case 3: 15523e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15533e519524SHoward Hinnant break; 15543e519524SHoward Hinnant ++__m1; 15553e519524SHoward Hinnant ++__m2; 15563e519524SHoward Hinnant case 2: 15573e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15583e519524SHoward Hinnant break; 15593e519524SHoward Hinnant ++__m1; 15603e519524SHoward Hinnant ++__m2; 15613e519524SHoward Hinnant case 1: 15623e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15633e519524SHoward Hinnant break; 15643e519524SHoward Hinnant case 0: 1565*28cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 15663e519524SHoward Hinnant } 15673e519524SHoward Hinnant __continue: 15683e519524SHoward Hinnant ++__first1; 1569b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15703e519524SHoward Hinnant } 15713e519524SHoward Hinnant} 15723e519524SHoward Hinnant 15733e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15753e519524SHoward Hinnant_ForwardIterator1 15763e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15773e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15783e519524SHoward Hinnant{ 1579ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15803e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 1581*28cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 1582*28cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 1583*28cc4ddeSMarshall Clow .first; 15843e519524SHoward Hinnant} 15853e519524SHoward Hinnant 15863e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15883e519524SHoward Hinnant_ForwardIterator1 15893e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15903e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15913e519524SHoward Hinnant{ 1592*28cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 1593*28cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1594ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15953e519524SHoward Hinnant} 15963e519524SHoward Hinnant 15973e519524SHoward Hinnant// search_n 15983e519524SHoward Hinnant 15993e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 16003e519524SHoward Hinnant_ForwardIterator 16013e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1602e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 16033e519524SHoward Hinnant{ 16043e519524SHoward Hinnant if (__count <= 0) 16053e519524SHoward Hinnant return __first; 16063e519524SHoward Hinnant while (true) 16073e519524SHoward Hinnant { 1608e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16093e519524SHoward Hinnant while (true) 16103e519524SHoward Hinnant { 1611e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16123e519524SHoward Hinnant return __last; 1613e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16143e519524SHoward Hinnant break; 16153e519524SHoward Hinnant ++__first; 16163e519524SHoward Hinnant } 1617e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16183e519524SHoward Hinnant _ForwardIterator __m = __first; 16193e519524SHoward Hinnant _Size __c(0); 16203e519524SHoward Hinnant while (true) 16213e519524SHoward Hinnant { 16223e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16233e519524SHoward Hinnant return __first; 16243e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16253e519524SHoward Hinnant return __last; 1626e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16273e519524SHoward Hinnant { 16283e519524SHoward Hinnant __first = __m; 16293e519524SHoward Hinnant ++__first; 16303e519524SHoward Hinnant break; 16313e519524SHoward Hinnant } // else there is a match, check next elements 16323e519524SHoward Hinnant } 16333e519524SHoward Hinnant } 16343e519524SHoward Hinnant} 16353e519524SHoward Hinnant 16363e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16373e519524SHoward Hinnant_RandomAccessIterator 16383e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1639e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16403e519524SHoward Hinnant{ 16413e519524SHoward Hinnant if (__count <= 0) 16423e519524SHoward Hinnant return __first; 16433e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16443e519524SHoward Hinnant if (__len < __count) 16453e519524SHoward Hinnant return __last; 16463e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16473e519524SHoward Hinnant while (true) 16483e519524SHoward Hinnant { 1649e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16503e519524SHoward Hinnant while (true) 16513e519524SHoward Hinnant { 1652b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16533e519524SHoward Hinnant return __last; 1654e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16553e519524SHoward Hinnant break; 16563e519524SHoward Hinnant ++__first; 16573e519524SHoward Hinnant } 1658e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16593e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16603e519524SHoward Hinnant _Size __c(0); 16613e519524SHoward Hinnant while (true) 16623e519524SHoward Hinnant { 16633e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16643e519524SHoward Hinnant return __first; 16653e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1666e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16673e519524SHoward Hinnant { 16683e519524SHoward Hinnant __first = __m; 16693e519524SHoward Hinnant ++__first; 16703e519524SHoward Hinnant break; 16713e519524SHoward Hinnant } // else there is a match, check next elements 16723e519524SHoward Hinnant } 16733e519524SHoward Hinnant } 16743e519524SHoward Hinnant} 16753e519524SHoward Hinnant 16763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16783e519524SHoward Hinnant_ForwardIterator 16793e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1680e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16813e519524SHoward Hinnant{ 1682ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 168351544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 168451544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16853e519524SHoward Hinnant} 16863e519524SHoward Hinnant 16873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16893e519524SHoward Hinnant_ForwardIterator 1690e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16913e519524SHoward Hinnant{ 16923e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 169351544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 169451544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16953e519524SHoward Hinnant} 16963e519524SHoward Hinnant 16973e519524SHoward Hinnant// copy 16983e519524SHoward Hinnanttemplate <class _Iter> 16993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17003e519524SHoward Hinnant_Iter 17013e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17023e519524SHoward Hinnant{ 17033e519524SHoward Hinnant return __i; 17043e519524SHoward Hinnant} 17053e519524SHoward Hinnant 17063e519524SHoward Hinnanttemplate <class _Tp> 17073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17083e519524SHoward Hinnanttypename enable_if 17093e519524SHoward Hinnant< 1710ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17113e519524SHoward Hinnant _Tp* 17123e519524SHoward Hinnant>::type 17133e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17143e519524SHoward Hinnant{ 17153e519524SHoward Hinnant return __i.base(); 17163e519524SHoward Hinnant} 17173e519524SHoward Hinnant 1718fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1719fc88dbd2SHoward Hinnant 17203e519524SHoward Hinnanttemplate <class _Tp> 17213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17223e519524SHoward Hinnanttypename enable_if 17233e519524SHoward Hinnant< 1724ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17253e519524SHoward Hinnant _Tp* 17263e519524SHoward Hinnant>::type 17273e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17283e519524SHoward Hinnant{ 17293e519524SHoward Hinnant return __i.base(); 17303e519524SHoward Hinnant} 17313e519524SHoward Hinnant 1732fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1733fc88dbd2SHoward Hinnant 17343e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17363e519524SHoward Hinnant_OutputIterator 17373e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17383e519524SHoward Hinnant{ 1739910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17403e519524SHoward Hinnant *__result = *__first; 17413e519524SHoward Hinnant return __result; 17423e519524SHoward Hinnant} 17433e519524SHoward Hinnant 17443e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17463e519524SHoward Hinnanttypename enable_if 17473e519524SHoward Hinnant< 17483e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1749ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17503e519524SHoward Hinnant _Up* 17513e519524SHoward Hinnant>::type 17523e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17533e519524SHoward Hinnant{ 17543e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17555b312052SMarshall Clow if (__n > 0) 1756ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17573e519524SHoward Hinnant return __result + __n; 17583e519524SHoward Hinnant} 17593e519524SHoward Hinnant 17603e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17623e519524SHoward Hinnant_OutputIterator 17633e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17643e519524SHoward Hinnant{ 1765ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17663e519524SHoward Hinnant} 17673e519524SHoward Hinnant 17683e519524SHoward Hinnant// copy_backward 17693e519524SHoward Hinnant 1770d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17723e519524SHoward Hinnant_OutputIterator 1773d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17743e519524SHoward Hinnant{ 17753e519524SHoward Hinnant while (__first != __last) 17763e519524SHoward Hinnant *--__result = *--__last; 17773e519524SHoward Hinnant return __result; 17783e519524SHoward Hinnant} 17793e519524SHoward Hinnant 17803e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17823e519524SHoward Hinnanttypename enable_if 17833e519524SHoward Hinnant< 17843e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1785ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17863e519524SHoward Hinnant _Up* 17873e519524SHoward Hinnant>::type 17883e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17893e519524SHoward Hinnant{ 17903e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17915b312052SMarshall Clow if (__n > 0) 17925b312052SMarshall Clow { 17933e519524SHoward Hinnant __result -= __n; 1794ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17955b312052SMarshall Clow } 17963e519524SHoward Hinnant return __result; 17973e519524SHoward Hinnant} 17983e519524SHoward Hinnant 17993e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18013e519524SHoward Hinnant_BidirectionalIterator2 18023e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18033e519524SHoward Hinnant _BidirectionalIterator2 __result) 18043e519524SHoward Hinnant{ 1805ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18063e519524SHoward Hinnant} 18073e519524SHoward Hinnant 18083e519524SHoward Hinnant// copy_if 18093e519524SHoward Hinnant 18103e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18123e519524SHoward Hinnant_OutputIterator 18133e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18143e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18153e519524SHoward Hinnant{ 18163e519524SHoward Hinnant for (; __first != __last; ++__first) 18173e519524SHoward Hinnant { 18183e519524SHoward Hinnant if (__pred(*__first)) 18193e519524SHoward Hinnant { 18203e519524SHoward Hinnant *__result = *__first; 18213e519524SHoward Hinnant ++__result; 18223e519524SHoward Hinnant } 18233e519524SHoward Hinnant } 18243e519524SHoward Hinnant return __result; 18253e519524SHoward Hinnant} 18263e519524SHoward Hinnant 18273e519524SHoward Hinnant// copy_n 18283e519524SHoward Hinnant 18293e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18313e519524SHoward Hinnanttypename enable_if 18323e519524SHoward Hinnant< 18333e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18343e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18353e519524SHoward Hinnant _OutputIterator 18363e519524SHoward Hinnant>::type 183751544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18383e519524SHoward Hinnant{ 183951544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 184051544023SEric Fiselier _IntegralSize __n = __orig_n; 184199847d2bSHoward Hinnant if (__n > 0) 184299847d2bSHoward Hinnant { 18433e519524SHoward Hinnant *__result = *__first; 184499847d2bSHoward Hinnant ++__result; 184599847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 184699847d2bSHoward Hinnant { 184799847d2bSHoward Hinnant ++__first; 184899847d2bSHoward Hinnant *__result = *__first; 184999847d2bSHoward Hinnant ++__result; 185099847d2bSHoward Hinnant } 185199847d2bSHoward Hinnant } 18523e519524SHoward Hinnant return __result; 18533e519524SHoward Hinnant} 18543e519524SHoward Hinnant 18553e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18573e519524SHoward Hinnanttypename enable_if 18583e519524SHoward Hinnant< 18593e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18603e519524SHoward Hinnant _OutputIterator 18613e519524SHoward Hinnant>::type 186251544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18633e519524SHoward Hinnant{ 186451544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 186551544023SEric Fiselier _IntegralSize __n = __orig_n; 1866ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18673e519524SHoward Hinnant} 18683e519524SHoward Hinnant 18693e519524SHoward Hinnant// move 18703e519524SHoward Hinnant 18713e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18733e519524SHoward Hinnant_OutputIterator 18743e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18753e519524SHoward Hinnant{ 1876910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1877ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18783e519524SHoward Hinnant return __result; 18793e519524SHoward Hinnant} 18803e519524SHoward Hinnant 18813e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18833e519524SHoward Hinnanttypename enable_if 18843e519524SHoward Hinnant< 18853e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1886ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18873e519524SHoward Hinnant _Up* 18883e519524SHoward Hinnant>::type 18893e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18903e519524SHoward Hinnant{ 18913e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18925b312052SMarshall Clow if (__n > 0) 1893ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18943e519524SHoward Hinnant return __result + __n; 18953e519524SHoward Hinnant} 18963e519524SHoward Hinnant 18973e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18993e519524SHoward Hinnant_OutputIterator 19003e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19013e519524SHoward Hinnant{ 1902ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19033e519524SHoward Hinnant} 19043e519524SHoward Hinnant 19053e519524SHoward Hinnant// move_backward 19063e519524SHoward Hinnant 19073e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19093e519524SHoward Hinnant_OutputIterator 19103e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19113e519524SHoward Hinnant{ 19123e519524SHoward Hinnant while (__first != __last) 1913ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19143e519524SHoward Hinnant return __result; 19153e519524SHoward Hinnant} 19163e519524SHoward Hinnant 19173e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19193e519524SHoward Hinnanttypename enable_if 19203e519524SHoward Hinnant< 19213e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1922ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19233e519524SHoward Hinnant _Up* 19243e519524SHoward Hinnant>::type 19253e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19263e519524SHoward Hinnant{ 19273e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19285b312052SMarshall Clow if (__n > 0) 19295b312052SMarshall Clow { 19303e519524SHoward Hinnant __result -= __n; 1931ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19325b312052SMarshall Clow } 19333e519524SHoward Hinnant return __result; 19343e519524SHoward Hinnant} 19353e519524SHoward Hinnant 19363e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19383e519524SHoward Hinnant_BidirectionalIterator2 19393e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19403e519524SHoward Hinnant _BidirectionalIterator2 __result) 19413e519524SHoward Hinnant{ 1942ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19433e519524SHoward Hinnant} 19443e519524SHoward Hinnant 19453e519524SHoward Hinnant// iter_swap 19463e519524SHoward Hinnant 1947a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19483e519524SHoward Hinnant 19493e519524SHoward Hinnant// transform 19503e519524SHoward Hinnant 19513e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19533e519524SHoward Hinnant_OutputIterator 19543e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19553e519524SHoward Hinnant{ 1956910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19573e519524SHoward Hinnant *__result = __op(*__first); 19583e519524SHoward Hinnant return __result; 19593e519524SHoward Hinnant} 19603e519524SHoward Hinnant 19613e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19633e519524SHoward Hinnant_OutputIterator 19643e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19653e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19663e519524SHoward Hinnant{ 1967910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19683e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19693e519524SHoward Hinnant return __result; 19703e519524SHoward Hinnant} 19713e519524SHoward Hinnant 19723e519524SHoward Hinnant// replace 19733e519524SHoward Hinnant 19743e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19763e519524SHoward Hinnantvoid 19773e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19783e519524SHoward Hinnant{ 19793e519524SHoward Hinnant for (; __first != __last; ++__first) 19803e519524SHoward Hinnant if (*__first == __old_value) 19813e519524SHoward Hinnant *__first = __new_value; 19823e519524SHoward Hinnant} 19833e519524SHoward Hinnant 19843e519524SHoward Hinnant// replace_if 19853e519524SHoward Hinnant 19863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19883e519524SHoward Hinnantvoid 19893e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19903e519524SHoward Hinnant{ 19913e519524SHoward Hinnant for (; __first != __last; ++__first) 19923e519524SHoward Hinnant if (__pred(*__first)) 19933e519524SHoward Hinnant *__first = __new_value; 19943e519524SHoward Hinnant} 19953e519524SHoward Hinnant 19963e519524SHoward Hinnant// replace_copy 19973e519524SHoward Hinnant 19983e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20003e519524SHoward Hinnant_OutputIterator 20013e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20023e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20033e519524SHoward Hinnant{ 2004910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20053e519524SHoward Hinnant if (*__first == __old_value) 20063e519524SHoward Hinnant *__result = __new_value; 20073e519524SHoward Hinnant else 20083e519524SHoward Hinnant *__result = *__first; 20093e519524SHoward Hinnant return __result; 20103e519524SHoward Hinnant} 20113e519524SHoward Hinnant 20123e519524SHoward Hinnant// replace_copy_if 20133e519524SHoward Hinnant 20143e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20163e519524SHoward Hinnant_OutputIterator 20173e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20183e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20193e519524SHoward Hinnant{ 2020910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20213e519524SHoward Hinnant if (__pred(*__first)) 20223e519524SHoward Hinnant *__result = __new_value; 20233e519524SHoward Hinnant else 20243e519524SHoward Hinnant *__result = *__first; 20253e519524SHoward Hinnant return __result; 20263e519524SHoward Hinnant} 20273e519524SHoward Hinnant 20283e519524SHoward Hinnant// fill_n 20293e519524SHoward Hinnant 20303e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20323e519524SHoward Hinnant_OutputIterator 20330f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20343e519524SHoward Hinnant{ 2035910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2036e4383379SHoward Hinnant *__first = __value_; 20373e519524SHoward Hinnant return __first; 20383e519524SHoward Hinnant} 20393e519524SHoward Hinnant 20400f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20420f242beaSHoward Hinnanttypename enable_if 20430f242beaSHoward Hinnant< 20440f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20450f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20460f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20470f242beaSHoward Hinnant _Tp* 20480f242beaSHoward Hinnant>::type 20490f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20503e519524SHoward Hinnant{ 20513e519524SHoward Hinnant if (__n > 0) 2052e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20533e519524SHoward Hinnant return __first + __n; 20543e519524SHoward Hinnant} 20553e519524SHoward Hinnant 20563e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20583e519524SHoward Hinnant_OutputIterator 2059e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20603e519524SHoward Hinnant{ 206151544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20623e519524SHoward Hinnant} 20633e519524SHoward Hinnant 20643e519524SHoward Hinnant// fill 20653e519524SHoward Hinnant 20663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20683e519524SHoward Hinnantvoid 2069e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20703e519524SHoward Hinnant{ 20713e519524SHoward Hinnant for (; __first != __last; ++__first) 2072e4383379SHoward Hinnant *__first = __value_; 20733e519524SHoward Hinnant} 20743e519524SHoward Hinnant 20753e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20773e519524SHoward Hinnantvoid 2078e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20793e519524SHoward Hinnant{ 2080e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20813e519524SHoward Hinnant} 20823e519524SHoward Hinnant 20833e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20853e519524SHoward Hinnantvoid 2086e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20873e519524SHoward Hinnant{ 2088e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20893e519524SHoward Hinnant} 20903e519524SHoward Hinnant 20913e519524SHoward Hinnant// generate 20923e519524SHoward Hinnant 20933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20953e519524SHoward Hinnantvoid 20963e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20973e519524SHoward Hinnant{ 20983e519524SHoward Hinnant for (; __first != __last; ++__first) 20993e519524SHoward Hinnant *__first = __gen(); 21003e519524SHoward Hinnant} 21013e519524SHoward Hinnant 21023e519524SHoward Hinnant// generate_n 21033e519524SHoward Hinnant 21043e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21063e519524SHoward Hinnant_OutputIterator 210751544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21083e519524SHoward Hinnant{ 210951544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 211051544023SEric Fiselier _IntegralSize __n = __orig_n; 2111910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21123e519524SHoward Hinnant *__first = __gen(); 21133e519524SHoward Hinnant return __first; 21143e519524SHoward Hinnant} 21153e519524SHoward Hinnant 21163e519524SHoward Hinnant// remove 21173e519524SHoward Hinnant 21183e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21193e519524SHoward Hinnant_ForwardIterator 2120e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21213e519524SHoward Hinnant{ 2122e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21233e519524SHoward Hinnant if (__first != __last) 21243e519524SHoward Hinnant { 21253e519524SHoward Hinnant _ForwardIterator __i = __first; 21263e519524SHoward Hinnant while (++__i != __last) 21273e519524SHoward Hinnant { 2128e4383379SHoward Hinnant if (!(*__i == __value_)) 21293e519524SHoward Hinnant { 2130ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21313e519524SHoward Hinnant ++__first; 21323e519524SHoward Hinnant } 21333e519524SHoward Hinnant } 21343e519524SHoward Hinnant } 21353e519524SHoward Hinnant return __first; 21363e519524SHoward Hinnant} 21373e519524SHoward Hinnant 21383e519524SHoward Hinnant// remove_if 21393e519524SHoward Hinnant 21403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21413e519524SHoward Hinnant_ForwardIterator 21423e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21433e519524SHoward Hinnant{ 2144ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21453e519524SHoward Hinnant (__first, __last, __pred); 21463e519524SHoward Hinnant if (__first != __last) 21473e519524SHoward Hinnant { 21483e519524SHoward Hinnant _ForwardIterator __i = __first; 21493e519524SHoward Hinnant while (++__i != __last) 21503e519524SHoward Hinnant { 21513e519524SHoward Hinnant if (!__pred(*__i)) 21523e519524SHoward Hinnant { 2153ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21543e519524SHoward Hinnant ++__first; 21553e519524SHoward Hinnant } 21563e519524SHoward Hinnant } 21573e519524SHoward Hinnant } 21583e519524SHoward Hinnant return __first; 21593e519524SHoward Hinnant} 21603e519524SHoward Hinnant 21613e519524SHoward Hinnant// remove_copy 21623e519524SHoward Hinnant 21633e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21653e519524SHoward Hinnant_OutputIterator 2166e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21673e519524SHoward Hinnant{ 21683e519524SHoward Hinnant for (; __first != __last; ++__first) 21693e519524SHoward Hinnant { 2170e4383379SHoward Hinnant if (!(*__first == __value_)) 21713e519524SHoward Hinnant { 21723e519524SHoward Hinnant *__result = *__first; 21733e519524SHoward Hinnant ++__result; 21743e519524SHoward Hinnant } 21753e519524SHoward Hinnant } 21763e519524SHoward Hinnant return __result; 21773e519524SHoward Hinnant} 21783e519524SHoward Hinnant 21793e519524SHoward Hinnant// remove_copy_if 21803e519524SHoward Hinnant 21813e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21833e519524SHoward Hinnant_OutputIterator 21843e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21853e519524SHoward Hinnant{ 21863e519524SHoward Hinnant for (; __first != __last; ++__first) 21873e519524SHoward Hinnant { 21883e519524SHoward Hinnant if (!__pred(*__first)) 21893e519524SHoward Hinnant { 21903e519524SHoward Hinnant *__result = *__first; 21913e519524SHoward Hinnant ++__result; 21923e519524SHoward Hinnant } 21933e519524SHoward Hinnant } 21943e519524SHoward Hinnant return __result; 21953e519524SHoward Hinnant} 21963e519524SHoward Hinnant 21973e519524SHoward Hinnant// unique 21983e519524SHoward Hinnant 21993e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22003e519524SHoward Hinnant_ForwardIterator 22013e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22023e519524SHoward Hinnant{ 2203ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22043e519524SHoward Hinnant (__first, __last, __pred); 22053e519524SHoward Hinnant if (__first != __last) 22063e519524SHoward Hinnant { 22073e519524SHoward Hinnant // ... a a ? ... 22083e519524SHoward Hinnant // f i 22093e519524SHoward Hinnant _ForwardIterator __i = __first; 22103e519524SHoward Hinnant for (++__i; ++__i != __last;) 22113e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2212ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22133e519524SHoward Hinnant ++__first; 22143e519524SHoward Hinnant } 22153e519524SHoward Hinnant return __first; 22163e519524SHoward Hinnant} 22173e519524SHoward Hinnant 22183e519524SHoward Hinnanttemplate <class _ForwardIterator> 22193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22203e519524SHoward Hinnant_ForwardIterator 22213e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22223e519524SHoward Hinnant{ 22233e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2224ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22253e519524SHoward Hinnant} 22263e519524SHoward Hinnant 22273e519524SHoward Hinnant// unique_copy 22283e519524SHoward Hinnant 22293e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22303e519524SHoward Hinnant_OutputIterator 22313e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22323e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22333e519524SHoward Hinnant{ 22343e519524SHoward Hinnant if (__first != __last) 22353e519524SHoward Hinnant { 22363e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22373e519524SHoward Hinnant *__result = __t; 22383e519524SHoward Hinnant ++__result; 22393e519524SHoward Hinnant while (++__first != __last) 22403e519524SHoward Hinnant { 22413e519524SHoward Hinnant if (!__pred(__t, *__first)) 22423e519524SHoward Hinnant { 22433e519524SHoward Hinnant __t = *__first; 22443e519524SHoward Hinnant *__result = __t; 22453e519524SHoward Hinnant ++__result; 22463e519524SHoward Hinnant } 22473e519524SHoward Hinnant } 22483e519524SHoward Hinnant } 22493e519524SHoward Hinnant return __result; 22503e519524SHoward Hinnant} 22513e519524SHoward Hinnant 22523e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22533e519524SHoward Hinnant_OutputIterator 22543e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22553e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22563e519524SHoward Hinnant{ 22573e519524SHoward Hinnant if (__first != __last) 22583e519524SHoward Hinnant { 22593e519524SHoward Hinnant _ForwardIterator __i = __first; 22603e519524SHoward Hinnant *__result = *__i; 22613e519524SHoward Hinnant ++__result; 22623e519524SHoward Hinnant while (++__first != __last) 22633e519524SHoward Hinnant { 22643e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22653e519524SHoward Hinnant { 22663e519524SHoward Hinnant *__result = *__first; 22673e519524SHoward Hinnant ++__result; 22683e519524SHoward Hinnant __i = __first; 22693e519524SHoward Hinnant } 22703e519524SHoward Hinnant } 22713e519524SHoward Hinnant } 22723e519524SHoward Hinnant return __result; 22733e519524SHoward Hinnant} 22743e519524SHoward Hinnant 22753e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22763e519524SHoward Hinnant_ForwardIterator 22773e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22783e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22793e519524SHoward Hinnant{ 22803e519524SHoward Hinnant if (__first != __last) 22813e519524SHoward Hinnant { 22823e519524SHoward Hinnant *__result = *__first; 22833e519524SHoward Hinnant while (++__first != __last) 22843e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22853e519524SHoward Hinnant *++__result = *__first; 22863e519524SHoward Hinnant ++__result; 22873e519524SHoward Hinnant } 22883e519524SHoward Hinnant return __result; 22893e519524SHoward Hinnant} 22903e519524SHoward Hinnant 22913e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22933e519524SHoward Hinnant_OutputIterator 22943e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22953e519524SHoward Hinnant{ 2296ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22973e519524SHoward Hinnant (__first, __last, __result, __pred, 22983e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22993e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23003e519524SHoward Hinnant} 23013e519524SHoward Hinnant 23023e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23043e519524SHoward Hinnant_OutputIterator 23053e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23063e519524SHoward Hinnant{ 23073e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2308ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23093e519524SHoward Hinnant} 23103e519524SHoward Hinnant 23113e519524SHoward Hinnant// reverse 23123e519524SHoward Hinnant 23133e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23153e519524SHoward Hinnantvoid 23163e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23173e519524SHoward Hinnant{ 23183e519524SHoward Hinnant while (__first != __last) 23193e519524SHoward Hinnant { 23203e519524SHoward Hinnant if (__first == --__last) 23213e519524SHoward Hinnant break; 2322def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23233e519524SHoward Hinnant ++__first; 23243e519524SHoward Hinnant } 23253e519524SHoward Hinnant} 23263e519524SHoward Hinnant 23273e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23293e519524SHoward Hinnantvoid 23303e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23313e519524SHoward Hinnant{ 23323e519524SHoward Hinnant if (__first != __last) 23333e519524SHoward Hinnant for (; __first < --__last; ++__first) 2334def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23353e519524SHoward Hinnant} 23363e519524SHoward Hinnant 23373e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23393e519524SHoward Hinnantvoid 23403e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23413e519524SHoward Hinnant{ 2342ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23433e519524SHoward Hinnant} 23443e519524SHoward Hinnant 23453e519524SHoward Hinnant// reverse_copy 23463e519524SHoward Hinnant 23473e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23493e519524SHoward Hinnant_OutputIterator 23503e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23513e519524SHoward Hinnant{ 23523e519524SHoward Hinnant for (; __first != __last; ++__result) 23533e519524SHoward Hinnant *__result = *--__last; 23543e519524SHoward Hinnant return __result; 23553e519524SHoward Hinnant} 23563e519524SHoward Hinnant 23573e519524SHoward Hinnant// rotate 23583e519524SHoward Hinnant 23593e519524SHoward Hinnanttemplate <class _ForwardIterator> 23603e519524SHoward Hinnant_ForwardIterator 2361aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23623e519524SHoward Hinnant{ 2363aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2364aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2365aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2366aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2367aca09de3SHoward Hinnant return __lm1; 2368aca09de3SHoward Hinnant} 2369aca09de3SHoward Hinnant 2370aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2371aca09de3SHoward Hinnant_BidirectionalIterator 2372aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2373aca09de3SHoward Hinnant{ 2374aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2375aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2376aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2377aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2378aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2379aca09de3SHoward Hinnant return __fp1; 2380aca09de3SHoward Hinnant} 2381aca09de3SHoward Hinnant 2382aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2383aca09de3SHoward Hinnant_ForwardIterator 2384aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2385aca09de3SHoward Hinnant{ 23863e519524SHoward Hinnant _ForwardIterator __i = __middle; 23873e519524SHoward Hinnant while (true) 23883e519524SHoward Hinnant { 23893e519524SHoward Hinnant swap(*__first, *__i); 23903e519524SHoward Hinnant ++__first; 23913e519524SHoward Hinnant if (++__i == __last) 23923e519524SHoward Hinnant break; 23933e519524SHoward Hinnant if (__first == __middle) 23943e519524SHoward Hinnant __middle = __i; 23953e519524SHoward Hinnant } 23963e519524SHoward Hinnant _ForwardIterator __r = __first; 23973e519524SHoward Hinnant if (__first != __middle) 23983e519524SHoward Hinnant { 23993e519524SHoward Hinnant __i = __middle; 24003e519524SHoward Hinnant while (true) 24013e519524SHoward Hinnant { 24023e519524SHoward Hinnant swap(*__first, *__i); 24033e519524SHoward Hinnant ++__first; 24043e519524SHoward Hinnant if (++__i == __last) 24053e519524SHoward Hinnant { 24063e519524SHoward Hinnant if (__first == __middle) 24073e519524SHoward Hinnant break; 24083e519524SHoward Hinnant __i = __middle; 24093e519524SHoward Hinnant } 24103e519524SHoward Hinnant else if (__first == __middle) 24113e519524SHoward Hinnant __middle = __i; 24123e519524SHoward Hinnant } 24133e519524SHoward Hinnant } 24143e519524SHoward Hinnant return __r; 24153e519524SHoward Hinnant} 24163e519524SHoward Hinnant 24173e519524SHoward Hinnanttemplate<typename _Integral> 24183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24193e519524SHoward Hinnant_Integral 24203e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 24213e519524SHoward Hinnant{ 24223e519524SHoward Hinnant do 24233e519524SHoward Hinnant { 24243e519524SHoward Hinnant _Integral __t = __x % __y; 24253e519524SHoward Hinnant __x = __y; 24263e519524SHoward Hinnant __y = __t; 24273e519524SHoward Hinnant } while (__y); 24283e519524SHoward Hinnant return __x; 24293e519524SHoward Hinnant} 24303e519524SHoward Hinnant 24313e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24323e519524SHoward Hinnant_RandomAccessIterator 2433aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24343e519524SHoward Hinnant{ 24353e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24363e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24373e519524SHoward Hinnant 24383e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24393e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24403e519524SHoward Hinnant if (__m1 == __m2) 24413e519524SHoward Hinnant { 2442ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24433e519524SHoward Hinnant return __middle; 24443e519524SHoward Hinnant } 2445aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24463e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24473e519524SHoward Hinnant { 2448aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24493e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24503e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24513e519524SHoward Hinnant do 24523e519524SHoward Hinnant { 2453aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24543e519524SHoward Hinnant __p1 = __p2; 24553e519524SHoward Hinnant const difference_type __d = __last - __p2; 24563e519524SHoward Hinnant if (__m1 < __d) 24573e519524SHoward Hinnant __p2 += __m1; 24583e519524SHoward Hinnant else 24593e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24603e519524SHoward Hinnant } while (__p2 != __p); 2461aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24623e519524SHoward Hinnant } 24633e519524SHoward Hinnant return __first + __m2; 24643e519524SHoward Hinnant} 24653e519524SHoward Hinnant 24663e519524SHoward Hinnanttemplate <class _ForwardIterator> 24673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24683e519524SHoward Hinnant_ForwardIterator 2469aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2470aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2471aca09de3SHoward Hinnant{ 2472aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2473aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2474aca09de3SHoward Hinnant { 2475aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2476aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2477aca09de3SHoward Hinnant } 2478aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2479aca09de3SHoward Hinnant} 2480aca09de3SHoward Hinnant 2481aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2482aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2483aca09de3SHoward Hinnant_BidirectionalIterator 2484aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2485aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2486aca09de3SHoward Hinnant{ 2487aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2488aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2489aca09de3SHoward Hinnant { 2490aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2491aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2492aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2493aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2494aca09de3SHoward Hinnant } 2495aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2496aca09de3SHoward Hinnant} 2497aca09de3SHoward Hinnant 2498aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2499aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2500aca09de3SHoward Hinnant_RandomAccessIterator 2501aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2502aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2503aca09de3SHoward Hinnant{ 2504aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2505aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2506aca09de3SHoward Hinnant { 2507aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2508aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2509aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2510aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2511aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2512aca09de3SHoward Hinnant } 2513aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2514aca09de3SHoward Hinnant} 2515aca09de3SHoward Hinnant 2516aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2517aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2518aca09de3SHoward Hinnant_ForwardIterator 25193e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25203e519524SHoward Hinnant{ 2521aca09de3SHoward Hinnant if (__first == __middle) 2522aca09de3SHoward Hinnant return __last; 2523aca09de3SHoward Hinnant if (__middle == __last) 2524aca09de3SHoward Hinnant return __first; 2525ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2526aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25273e519524SHoward Hinnant} 25283e519524SHoward Hinnant 25293e519524SHoward Hinnant// rotate_copy 25303e519524SHoward Hinnant 25313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25333e519524SHoward Hinnant_OutputIterator 25343e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25353e519524SHoward Hinnant{ 2536ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25373e519524SHoward Hinnant} 25383e519524SHoward Hinnant 25393e519524SHoward Hinnant// min_element 25403e519524SHoward Hinnant 25413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25429d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25433e519524SHoward Hinnant_ForwardIterator 25440b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25453e519524SHoward Hinnant{ 25463e519524SHoward Hinnant if (__first != __last) 25473e519524SHoward Hinnant { 25483e519524SHoward Hinnant _ForwardIterator __i = __first; 25493e519524SHoward Hinnant while (++__i != __last) 25503e519524SHoward Hinnant if (__comp(*__i, *__first)) 25513e519524SHoward Hinnant __first = __i; 25523e519524SHoward Hinnant } 25533e519524SHoward Hinnant return __first; 25543e519524SHoward Hinnant} 25553e519524SHoward Hinnant 25563e519524SHoward Hinnanttemplate <class _ForwardIterator> 25570b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25583e519524SHoward Hinnant_ForwardIterator 25593e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25603e519524SHoward Hinnant{ 25610b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25624eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25634eb27b79SHoward Hinnant} 25644eb27b79SHoward Hinnant 25654eb27b79SHoward Hinnant// min 25664eb27b79SHoward Hinnant 25674eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25689d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25694eb27b79SHoward Hinnantconst _Tp& 25704eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25714eb27b79SHoward Hinnant{ 25724eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25734eb27b79SHoward Hinnant} 25744eb27b79SHoward Hinnant 25754eb27b79SHoward Hinnanttemplate <class _Tp> 25769d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25774eb27b79SHoward Hinnantconst _Tp& 25784eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25794eb27b79SHoward Hinnant{ 2580ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25814eb27b79SHoward Hinnant} 25824eb27b79SHoward Hinnant 258354976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 258454976f26SHoward Hinnant 25854eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25869d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25874eb27b79SHoward Hinnant_Tp 25884eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25894eb27b79SHoward Hinnant{ 25900b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25914eb27b79SHoward Hinnant} 25924eb27b79SHoward Hinnant 25934eb27b79SHoward Hinnanttemplate<class _Tp> 25949d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25954eb27b79SHoward Hinnant_Tp 25964eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25974eb27b79SHoward Hinnant{ 25980b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 25993e519524SHoward Hinnant} 26003e519524SHoward Hinnant 260154976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 260254976f26SHoward Hinnant 26033e519524SHoward Hinnant// max_element 26043e519524SHoward Hinnant 26053e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26069d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26073e519524SHoward Hinnant_ForwardIterator 26080b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26093e519524SHoward Hinnant{ 26103e519524SHoward Hinnant if (__first != __last) 26113e519524SHoward Hinnant { 26123e519524SHoward Hinnant _ForwardIterator __i = __first; 26133e519524SHoward Hinnant while (++__i != __last) 26143e519524SHoward Hinnant if (__comp(*__first, *__i)) 26153e519524SHoward Hinnant __first = __i; 26163e519524SHoward Hinnant } 26173e519524SHoward Hinnant return __first; 26183e519524SHoward Hinnant} 26193e519524SHoward Hinnant 26209d67c6d5SMarshall Clow 26213e519524SHoward Hinnanttemplate <class _ForwardIterator> 26220b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26233e519524SHoward Hinnant_ForwardIterator 26243e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26253e519524SHoward Hinnant{ 26260b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26274eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26284eb27b79SHoward Hinnant} 26294eb27b79SHoward Hinnant 26304eb27b79SHoward Hinnant// max 26314eb27b79SHoward Hinnant 26324eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26339d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26344eb27b79SHoward Hinnantconst _Tp& 26354eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26364eb27b79SHoward Hinnant{ 26374eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26384eb27b79SHoward Hinnant} 26394eb27b79SHoward Hinnant 26404eb27b79SHoward Hinnanttemplate <class _Tp> 26419d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26424eb27b79SHoward Hinnantconst _Tp& 26434eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26444eb27b79SHoward Hinnant{ 2645ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26464eb27b79SHoward Hinnant} 26474eb27b79SHoward Hinnant 264854976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 264954976f26SHoward Hinnant 26504eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26519d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26524eb27b79SHoward Hinnant_Tp 26534eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26544eb27b79SHoward Hinnant{ 26550b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26564eb27b79SHoward Hinnant} 26574eb27b79SHoward Hinnant 26584eb27b79SHoward Hinnanttemplate<class _Tp> 26599d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26604eb27b79SHoward Hinnant_Tp 26614eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26624eb27b79SHoward Hinnant{ 26630b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26643e519524SHoward Hinnant} 26653e519524SHoward Hinnant 266654976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 266754976f26SHoward Hinnant 2668146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2669146c14acSMarshall Clow// clamp 2670146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2671146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2672146c14acSMarshall Clowconst _Tp& 2673146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2674146c14acSMarshall Clow{ 2675146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2676146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2677146c14acSMarshall Clow 2678146c14acSMarshall Clow} 2679146c14acSMarshall Clow 2680146c14acSMarshall Clowtemplate<class _Tp> 2681146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2682146c14acSMarshall Clowconst _Tp& 2683146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2684146c14acSMarshall Clow{ 2685146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2686146c14acSMarshall Clow} 2687146c14acSMarshall Clow#endif 2688146c14acSMarshall Clow 26893e519524SHoward Hinnant// minmax_element 26903e519524SHoward Hinnant 26913e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26920b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 26933e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26943e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26953e519524SHoward Hinnant{ 26963e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26973e519524SHoward Hinnant if (__first != __last) 26983e519524SHoward Hinnant { 26993e519524SHoward Hinnant if (++__first != __last) 27003e519524SHoward Hinnant { 27013e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27023e519524SHoward Hinnant __result.first = __first; 27033e519524SHoward Hinnant else 27043e519524SHoward Hinnant __result.second = __first; 27053e519524SHoward Hinnant while (++__first != __last) 27063e519524SHoward Hinnant { 27073e519524SHoward Hinnant _ForwardIterator __i = __first; 27083e519524SHoward Hinnant if (++__first == __last) 27093e519524SHoward Hinnant { 27103e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27113e519524SHoward Hinnant __result.first = __i; 27123e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27133e519524SHoward Hinnant __result.second = __i; 27143e519524SHoward Hinnant break; 27153e519524SHoward Hinnant } 27163e519524SHoward Hinnant else 27173e519524SHoward Hinnant { 27183e519524SHoward Hinnant if (__comp(*__first, *__i)) 27193e519524SHoward Hinnant { 27203e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27213e519524SHoward Hinnant __result.first = __first; 27223e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27233e519524SHoward Hinnant __result.second = __i; 27243e519524SHoward Hinnant } 27253e519524SHoward Hinnant else 27263e519524SHoward Hinnant { 27273e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27283e519524SHoward Hinnant __result.first = __i; 27293e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27303e519524SHoward Hinnant __result.second = __first; 27313e519524SHoward Hinnant } 27323e519524SHoward Hinnant } 27333e519524SHoward Hinnant } 27343e519524SHoward Hinnant } 27353e519524SHoward Hinnant } 27363e519524SHoward Hinnant return __result; 27373e519524SHoward Hinnant} 27383e519524SHoward Hinnant 27393e519524SHoward Hinnanttemplate <class _ForwardIterator> 27400b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27413e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27423e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27433e519524SHoward Hinnant{ 27449d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27459d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27463e519524SHoward Hinnant} 27473e519524SHoward Hinnant 27484eb27b79SHoward Hinnant// minmax 27494eb27b79SHoward Hinnant 27504eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27519d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27524eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27534eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27544eb27b79SHoward Hinnant{ 27554eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27564eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27574eb27b79SHoward Hinnant} 27584eb27b79SHoward Hinnant 27594eb27b79SHoward Hinnanttemplate<class _Tp> 27609d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27614eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27624eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27634eb27b79SHoward Hinnant{ 2764ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27654eb27b79SHoward Hinnant} 27664eb27b79SHoward Hinnant 276754976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 276854976f26SHoward Hinnant 27694eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27709d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27714eb27b79SHoward Hinnantpair<_Tp, _Tp> 27724eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27734eb27b79SHoward Hinnant{ 27749d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27759d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27769d67c6d5SMarshall Clow _Iter __last = __t.end(); 27779d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27789d67c6d5SMarshall Clow 27799d67c6d5SMarshall Clow ++__first; 27809d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27819d67c6d5SMarshall Clow { 27829d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27839d67c6d5SMarshall Clow __result.first = *__first; 27849d67c6d5SMarshall Clow else 27859d67c6d5SMarshall Clow __result.second = *__first; 27869d67c6d5SMarshall Clow ++__first; 27879d67c6d5SMarshall Clow } 27889d67c6d5SMarshall Clow 27899d67c6d5SMarshall Clow while (__first != __last) 27909d67c6d5SMarshall Clow { 27919d67c6d5SMarshall Clow _Tp __prev = *__first++; 2792002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2793002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2794002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 27959d67c6d5SMarshall Clow } 27969d67c6d5SMarshall Clow else { 2797002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2798002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 27999d67c6d5SMarshall Clow } 28009d67c6d5SMarshall Clow 28019d67c6d5SMarshall Clow __first++; 28029d67c6d5SMarshall Clow } 28039d67c6d5SMarshall Clow return __result; 28049d67c6d5SMarshall Clow} 28059d67c6d5SMarshall Clow 28069d67c6d5SMarshall Clowtemplate<class _Tp> 28079d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28089d67c6d5SMarshall Clowpair<_Tp, _Tp> 28099d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28109d67c6d5SMarshall Clow{ 28119d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28124eb27b79SHoward Hinnant} 28134eb27b79SHoward Hinnant 281454976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 281554976f26SHoward Hinnant 28163e519524SHoward Hinnant// random_shuffle 28173e519524SHoward Hinnant 2818f9d540b0SHoward Hinnant// __independent_bits_engine 2819f9d540b0SHoward Hinnant 2820c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2821f9d540b0SHoward Hinnantstruct __log2_imp 28223e519524SHoward Hinnant{ 2823c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2824c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28253e519524SHoward Hinnant}; 28263e519524SHoward Hinnant 2827c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2828c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28293e519524SHoward Hinnant{ 2830f9d540b0SHoward Hinnant static const size_t value = 0; 28313e519524SHoward Hinnant}; 28323e519524SHoward Hinnant 2833c003db1fSHoward Hinnanttemplate <size_t _Rp> 2834c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28353e519524SHoward Hinnant{ 2836c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28373e519524SHoward Hinnant}; 28383e519524SHoward Hinnant 2839c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2840f9d540b0SHoward Hinnantstruct __log2 28413e519524SHoward Hinnant{ 2842c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2843f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 28443e519524SHoward Hinnant}; 28453e519524SHoward Hinnant 2846f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2847f9d540b0SHoward Hinnantclass __independent_bits_engine 28483e519524SHoward Hinnant{ 2849f9d540b0SHoward Hinnantpublic: 2850f9d540b0SHoward Hinnant // types 2851f9d540b0SHoward Hinnant typedef _UIntType result_type; 2852f9d540b0SHoward Hinnant 2853f9d540b0SHoward Hinnantprivate: 2854f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2855f9d540b0SHoward Hinnant typedef typename conditional 2856f9d540b0SHoward Hinnant < 2857f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2858f9d540b0SHoward Hinnant result_type, 2859f9d540b0SHoward Hinnant _Engine_result_type 2860f9d540b0SHoward Hinnant >::type _Working_result_type; 2861f9d540b0SHoward Hinnant 2862f9d540b0SHoward Hinnant _Engine& __e_; 2863f9d540b0SHoward Hinnant size_t __w_; 2864f9d540b0SHoward Hinnant size_t __w0_; 2865f9d540b0SHoward Hinnant size_t __n_; 2866f9d540b0SHoward Hinnant size_t __n0_; 2867f9d540b0SHoward Hinnant _Working_result_type __y0_; 2868f9d540b0SHoward Hinnant _Working_result_type __y1_; 2869f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2870f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2871f9d540b0SHoward Hinnant 2872e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2873c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2874f9d540b0SHoward Hinnant + _Working_result_type(1); 2875e386b7b3SHoward Hinnant#else 2876e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2877e386b7b3SHoward Hinnant + _Working_result_type(1); 2878e386b7b3SHoward Hinnant#endif 2879e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2880e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2881e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2882f9d540b0SHoward Hinnant 2883f9d540b0SHoward Hinnantpublic: 2884f9d540b0SHoward Hinnant // constructors and seeding functions 2885f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2886f9d540b0SHoward Hinnant 2887f9d540b0SHoward Hinnant // generating functions 2888c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2889f9d540b0SHoward Hinnant 2890f9d540b0SHoward Hinnantprivate: 2891f9d540b0SHoward Hinnant result_type __eval(false_type); 2892f9d540b0SHoward Hinnant result_type __eval(true_type); 2893f9d540b0SHoward Hinnant}; 2894f9d540b0SHoward Hinnant 2895f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2896f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2897f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2898f9d540b0SHoward Hinnant : __e_(__e), 2899f9d540b0SHoward Hinnant __w_(__w) 2900f9d540b0SHoward Hinnant{ 2901f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2902f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2903c003db1fSHoward Hinnant if (_Rp == 0) 2904c003db1fSHoward Hinnant __y0_ = _Rp; 2905f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2906c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2907f9d540b0SHoward Hinnant else 2908f9d540b0SHoward Hinnant __y0_ = 0; 2909c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2910f9d540b0SHoward Hinnant { 2911f9d540b0SHoward Hinnant ++__n_; 2912f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2913f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2914c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2915f9d540b0SHoward Hinnant else 2916f9d540b0SHoward Hinnant __y0_ = 0; 2917f9d540b0SHoward Hinnant } 2918f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2919f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2920c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2921f9d540b0SHoward Hinnant else 2922f9d540b0SHoward Hinnant __y1_ = 0; 2923f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2924f9d540b0SHoward Hinnant _Engine_result_type(0); 2925f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2926f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2927f9d540b0SHoward Hinnant _Engine_result_type(~0); 29283e519524SHoward Hinnant} 29293e519524SHoward Hinnant 2930f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2931f9d540b0SHoward Hinnantinline 2932f9d540b0SHoward Hinnant_UIntType 2933f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29343e519524SHoward Hinnant{ 2935f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29363e519524SHoward Hinnant} 29373e519524SHoward Hinnant 2938f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2939f9d540b0SHoward Hinnant_UIntType 2940f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29413e519524SHoward Hinnant{ 2942c003db1fSHoward Hinnant result_type _Sp = 0; 2943f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2944f9d540b0SHoward Hinnant { 2945f9d540b0SHoward Hinnant _Engine_result_type __u; 29463e519524SHoward Hinnant do 2947f9d540b0SHoward Hinnant { 2948f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2949f9d540b0SHoward Hinnant } while (__u >= __y0_); 29500176bc6cSHoward Hinnant if (__w0_ < _WDt) 2951c003db1fSHoward Hinnant _Sp <<= __w0_; 2952f9d540b0SHoward Hinnant else 2953c003db1fSHoward Hinnant _Sp = 0; 2954c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2955f9d540b0SHoward Hinnant } 2956f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2957f9d540b0SHoward Hinnant { 2958f9d540b0SHoward Hinnant _Engine_result_type __u; 2959f9d540b0SHoward Hinnant do 2960f9d540b0SHoward Hinnant { 2961f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2962f9d540b0SHoward Hinnant } while (__u >= __y1_); 29630176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2964c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2965f9d540b0SHoward Hinnant else 2966c003db1fSHoward Hinnant _Sp = 0; 2967c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2968f9d540b0SHoward Hinnant } 2969c003db1fSHoward Hinnant return _Sp; 29703e519524SHoward Hinnant} 29713e519524SHoward Hinnant 2972f9d540b0SHoward Hinnant// uniform_int_distribution 29733e519524SHoward Hinnant 2974f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2975f9d540b0SHoward Hinnantclass uniform_int_distribution 29763e519524SHoward Hinnant{ 2977f9d540b0SHoward Hinnantpublic: 2978f9d540b0SHoward Hinnant // types 2979f9d540b0SHoward Hinnant typedef _IntType result_type; 2980f9d540b0SHoward Hinnant 2981f9d540b0SHoward Hinnant class param_type 2982f9d540b0SHoward Hinnant { 2983f9d540b0SHoward Hinnant result_type __a_; 2984f9d540b0SHoward Hinnant result_type __b_; 2985f9d540b0SHoward Hinnant public: 2986f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2987f9d540b0SHoward Hinnant 2988f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2989f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2990f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2991f9d540b0SHoward Hinnant 2992f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2993f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2994f9d540b0SHoward Hinnant 2995f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2996f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2997f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2998f9d540b0SHoward Hinnant {return !(__x == __y);} 29993e519524SHoward Hinnant }; 30003e519524SHoward Hinnant 3001f9d540b0SHoward Hinnantprivate: 3002f9d540b0SHoward Hinnant param_type __p_; 30033e519524SHoward Hinnant 3004f9d540b0SHoward Hinnantpublic: 3005f9d540b0SHoward Hinnant // constructors and reset functions 3006f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3007f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3008f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3009f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3010f9d540b0SHoward Hinnant void reset() {} 3011f9d540b0SHoward Hinnant 3012f9d540b0SHoward Hinnant // generating functions 3013f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3014f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3015f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3016f9d540b0SHoward Hinnant 3017f9d540b0SHoward Hinnant // property functions 3018f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3019f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3020f9d540b0SHoward Hinnant 3021f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3022f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3023f9d540b0SHoward Hinnant 3024f9d540b0SHoward Hinnant result_type min() const {return a();} 3025f9d540b0SHoward Hinnant result_type max() const {return b();} 3026f9d540b0SHoward Hinnant 3027f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3028f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3029f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3030f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3031f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3032f9d540b0SHoward Hinnant {return !(__x == __y);} 30333e519524SHoward Hinnant}; 30343e519524SHoward Hinnant 3035f9d540b0SHoward Hinnanttemplate<class _IntType> 3036f9d540b0SHoward Hinnanttemplate<class _URNG> 3037f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3038f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30393e519524SHoward Hinnant{ 3040f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3041f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3042c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3043c003db1fSHoward Hinnant if (_Rp == 1) 3044f9d540b0SHoward Hinnant return __p.a(); 3045f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3046f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3047c003db1fSHoward Hinnant if (_Rp == 0) 3048f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3049c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3050a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3051f9d540b0SHoward Hinnant ++__w; 3052f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3053f9d540b0SHoward Hinnant _UIntType __u; 3054f9d540b0SHoward Hinnant do 30553e519524SHoward Hinnant { 3056f9d540b0SHoward Hinnant __u = __e(); 3057c003db1fSHoward Hinnant } while (__u >= _Rp); 3058f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30593e519524SHoward Hinnant} 3060f9d540b0SHoward Hinnant 3061f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3062f9d540b0SHoward Hinnant 3063f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3064f9d540b0SHoward Hinnant 3065f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30663e519524SHoward Hinnant{ 3067f9d540b0SHoward Hinnant static unsigned __c_; 3068f9d540b0SHoward Hinnant 3069f9d540b0SHoward Hinnant __rs_default(); 3070f9d540b0SHoward Hinnantpublic: 3071b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3072f9d540b0SHoward Hinnant 3073f9d540b0SHoward Hinnant static const result_type _Min = 0; 3074f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3075f9d540b0SHoward Hinnant 3076f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3077f9d540b0SHoward Hinnant ~__rs_default(); 3078f9d540b0SHoward Hinnant 3079f9d540b0SHoward Hinnant result_type operator()(); 3080f9d540b0SHoward Hinnant 3081788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3082788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3083f9d540b0SHoward Hinnant 3084f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3085f9d540b0SHoward Hinnant}; 3086f9d540b0SHoward Hinnant 3087f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30883e519524SHoward Hinnant 30893e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30903e519524SHoward Hinnantvoid 30913e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30923e519524SHoward Hinnant{ 30933e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3094c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3095c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30963e519524SHoward Hinnant difference_type __d = __last - __first; 30973e519524SHoward Hinnant if (__d > 1) 30983e519524SHoward Hinnant { 3099c003db1fSHoward Hinnant _Dp __uid; 3100f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3101f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3102007b26beSHoward Hinnant { 3103c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3104007b26beSHoward Hinnant if (__i != difference_type(0)) 3105007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3106007b26beSHoward Hinnant } 31073e519524SHoward Hinnant } 31083e519524SHoward Hinnant} 31093e519524SHoward Hinnant 31103e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31113e519524SHoward Hinnantvoid 31123e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 31137609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 31143e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31153e519524SHoward Hinnant#else 31163e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31173e519524SHoward Hinnant#endif 31183e519524SHoward Hinnant{ 31193e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31203e519524SHoward Hinnant difference_type __d = __last - __first; 31213e519524SHoward Hinnant if (__d > 1) 31223e519524SHoward Hinnant { 31233e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3124007b26beSHoward Hinnant { 3125007b26beSHoward Hinnant difference_type __i = __rand(__d); 3126007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3127007b26beSHoward Hinnant } 31283e519524SHoward Hinnant } 31293e519524SHoward Hinnant} 31303e519524SHoward Hinnant 3131f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3132f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3133fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3134fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3135fb340102SHoward Hinnant#else 3136f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3137fb340102SHoward Hinnant#endif 3138f9d540b0SHoward Hinnant{ 3139f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3140c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3141c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3142f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3143f9d540b0SHoward Hinnant if (__d > 1) 3144f9d540b0SHoward Hinnant { 3145c003db1fSHoward Hinnant _Dp __uid; 3146f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3147007b26beSHoward Hinnant { 3148c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3149007b26beSHoward Hinnant if (__i != difference_type(0)) 3150007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3151007b26beSHoward Hinnant } 3152f9d540b0SHoward Hinnant } 3153f9d540b0SHoward Hinnant} 3154f9d540b0SHoward Hinnant 31553e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 31563e519524SHoward Hinnantbool 31573e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31583e519524SHoward Hinnant{ 31593e519524SHoward Hinnant for (; __first != __last; ++__first) 31603e519524SHoward Hinnant if (!__pred(*__first)) 31613e519524SHoward Hinnant break; 3162b9595b79SMarshall Clow if ( __first == __last ) 3163b9595b79SMarshall Clow return true; 3164b9595b79SMarshall Clow ++__first; 31653e519524SHoward Hinnant for (; __first != __last; ++__first) 31663e519524SHoward Hinnant if (__pred(*__first)) 31673e519524SHoward Hinnant return false; 31683e519524SHoward Hinnant return true; 31693e519524SHoward Hinnant} 31703e519524SHoward Hinnant 31713e519524SHoward Hinnant// partition 31723e519524SHoward Hinnant 31733e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31743e519524SHoward Hinnant_ForwardIterator 31753e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31763e519524SHoward Hinnant{ 31773e519524SHoward Hinnant while (true) 31783e519524SHoward Hinnant { 31793e519524SHoward Hinnant if (__first == __last) 31803e519524SHoward Hinnant return __first; 31813e519524SHoward Hinnant if (!__pred(*__first)) 31823e519524SHoward Hinnant break; 31833e519524SHoward Hinnant ++__first; 31843e519524SHoward Hinnant } 31853e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31863e519524SHoward Hinnant { 31873e519524SHoward Hinnant if (__pred(*__p)) 31883e519524SHoward Hinnant { 31893e519524SHoward Hinnant swap(*__first, *__p); 31903e519524SHoward Hinnant ++__first; 31913e519524SHoward Hinnant } 31923e519524SHoward Hinnant } 31933e519524SHoward Hinnant return __first; 31943e519524SHoward Hinnant} 31953e519524SHoward Hinnant 31963e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31973e519524SHoward Hinnant_BidirectionalIterator 31983e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31993e519524SHoward Hinnant bidirectional_iterator_tag) 32003e519524SHoward Hinnant{ 32013e519524SHoward Hinnant while (true) 32023e519524SHoward Hinnant { 32033e519524SHoward Hinnant while (true) 32043e519524SHoward Hinnant { 32053e519524SHoward Hinnant if (__first == __last) 32063e519524SHoward Hinnant return __first; 32073e519524SHoward Hinnant if (!__pred(*__first)) 32083e519524SHoward Hinnant break; 32093e519524SHoward Hinnant ++__first; 32103e519524SHoward Hinnant } 32113e519524SHoward Hinnant do 32123e519524SHoward Hinnant { 32133e519524SHoward Hinnant if (__first == --__last) 32143e519524SHoward Hinnant return __first; 32153e519524SHoward Hinnant } while (!__pred(*__last)); 32163e519524SHoward Hinnant swap(*__first, *__last); 32173e519524SHoward Hinnant ++__first; 32183e519524SHoward Hinnant } 32193e519524SHoward Hinnant} 32203e519524SHoward Hinnant 32213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32233e519524SHoward Hinnant_ForwardIterator 32243e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32253e519524SHoward Hinnant{ 3226ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32273e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32283e519524SHoward Hinnant} 32293e519524SHoward Hinnant 32303e519524SHoward Hinnant// partition_copy 32313e519524SHoward Hinnant 32323e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32333e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32343e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 32353e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32363e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32373e519524SHoward Hinnant _Predicate __pred) 32383e519524SHoward Hinnant{ 32393e519524SHoward Hinnant for (; __first != __last; ++__first) 32403e519524SHoward Hinnant { 32413e519524SHoward Hinnant if (__pred(*__first)) 32423e519524SHoward Hinnant { 32433e519524SHoward Hinnant *__out_true = *__first; 32443e519524SHoward Hinnant ++__out_true; 32453e519524SHoward Hinnant } 32463e519524SHoward Hinnant else 32473e519524SHoward Hinnant { 32483e519524SHoward Hinnant *__out_false = *__first; 32493e519524SHoward Hinnant ++__out_false; 32503e519524SHoward Hinnant } 32513e519524SHoward Hinnant } 32523e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32533e519524SHoward Hinnant} 32543e519524SHoward Hinnant 32553e519524SHoward Hinnant// partition_point 32563e519524SHoward Hinnant 32573e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 32583e519524SHoward Hinnant_ForwardIterator 32593e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32603e519524SHoward Hinnant{ 32613e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3262ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32633e519524SHoward Hinnant while (__len != 0) 32643e519524SHoward Hinnant { 32653e519524SHoward Hinnant difference_type __l2 = __len / 2; 32663e519524SHoward Hinnant _ForwardIterator __m = __first; 3267ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32683e519524SHoward Hinnant if (__pred(*__m)) 32693e519524SHoward Hinnant { 32703e519524SHoward Hinnant __first = ++__m; 32713e519524SHoward Hinnant __len -= __l2 + 1; 32723e519524SHoward Hinnant } 32733e519524SHoward Hinnant else 32743e519524SHoward Hinnant __len = __l2; 32753e519524SHoward Hinnant } 32763e519524SHoward Hinnant return __first; 32773e519524SHoward Hinnant} 32783e519524SHoward Hinnant 32793e519524SHoward Hinnant// stable_partition 32803e519524SHoward Hinnant 32813e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32823e519524SHoward Hinnant_ForwardIterator 32833e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32843e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32853e519524SHoward Hinnant{ 32863e519524SHoward Hinnant // *__first is known to be false 32873e519524SHoward Hinnant // __len >= 1 32883e519524SHoward Hinnant if (__len == 1) 32893e519524SHoward Hinnant return __first; 32903e519524SHoward Hinnant if (__len == 2) 32913e519524SHoward Hinnant { 32923e519524SHoward Hinnant _ForwardIterator __m = __first; 32933e519524SHoward Hinnant if (__pred(*++__m)) 32943e519524SHoward Hinnant { 32953e519524SHoward Hinnant swap(*__first, *__m); 32963e519524SHoward Hinnant return __m; 32973e519524SHoward Hinnant } 32983e519524SHoward Hinnant return __first; 32993e519524SHoward Hinnant } 33003e519524SHoward Hinnant if (__len <= __p.second) 33013e519524SHoward Hinnant { // The buffer is big enough to use 33023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33033e519524SHoward Hinnant __destruct_n __d(0); 33043e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33053e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33063e519524SHoward Hinnant // Update __first to always point to the end of the trues 33073e519524SHoward Hinnant value_type* __t = __p.first; 3308ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33093e519524SHoward Hinnant __d.__incr((value_type*)0); 33103e519524SHoward Hinnant ++__t; 33113e519524SHoward Hinnant _ForwardIterator __i = __first; 33123e519524SHoward Hinnant while (++__i != __last) 33133e519524SHoward Hinnant { 33143e519524SHoward Hinnant if (__pred(*__i)) 33153e519524SHoward Hinnant { 3316ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33173e519524SHoward Hinnant ++__first; 33183e519524SHoward Hinnant } 33193e519524SHoward Hinnant else 33203e519524SHoward Hinnant { 3321ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33223e519524SHoward Hinnant __d.__incr((value_type*)0); 33233e519524SHoward Hinnant ++__t; 33243e519524SHoward Hinnant } 33253e519524SHoward Hinnant } 33263e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33273e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33283e519524SHoward Hinnant __i = __first; 33293e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3330ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33313e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33323e519524SHoward Hinnant return __first; 33333e519524SHoward Hinnant } 33343e519524SHoward Hinnant // Else not enough buffer, do in place 33353e519524SHoward Hinnant // __len >= 3 33363e519524SHoward Hinnant _ForwardIterator __m = __first; 33373e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3338ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33393e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33403e519524SHoward Hinnant // F????????????????? 33413e519524SHoward Hinnant // f m l 33423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33433e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33443e519524SHoward Hinnant // TTTFFFFF?????????? 33453e519524SHoward Hinnant // f ff m l 33463e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33473e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33483e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33493e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33503e519524SHoward Hinnant while (__pred(*__m1)) 33513e519524SHoward Hinnant { 33523e519524SHoward Hinnant if (++__m1 == __last) 33533e519524SHoward Hinnant goto __second_half_done; 33543e519524SHoward Hinnant --__len_half; 33553e519524SHoward Hinnant } 33563e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33573e519524SHoward Hinnant // f ff m m1 l 33583e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33593e519524SHoward Hinnant__second_half_done: 33603e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33613e519524SHoward Hinnant // f ff m sf l 3362ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33633e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33643e519524SHoward Hinnant // | 33653e519524SHoward Hinnant} 33663e519524SHoward Hinnant 33673e519524SHoward Hinnantstruct __return_temporary_buffer 33683e519524SHoward Hinnant{ 33693e519524SHoward Hinnant template <class _Tp> 3370ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33713e519524SHoward Hinnant}; 33723e519524SHoward Hinnant 33733e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33743e519524SHoward Hinnant_ForwardIterator 33753e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33763e519524SHoward Hinnant forward_iterator_tag) 33773e519524SHoward Hinnant{ 33783e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33793e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33803e519524SHoward Hinnant while (true) 33813e519524SHoward Hinnant { 33823e519524SHoward Hinnant if (__first == __last) 33833e519524SHoward Hinnant return __first; 33843e519524SHoward Hinnant if (!__pred(*__first)) 33853e519524SHoward Hinnant break; 33863e519524SHoward Hinnant ++__first; 33873e519524SHoward Hinnant } 33883e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33893e519524SHoward Hinnant // *__first is known to be false 33903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33913e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3392ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33933e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33943e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33953e519524SHoward Hinnant if (__len >= __alloc_limit) 33963e519524SHoward Hinnant { 3397ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33983e519524SHoward Hinnant __h.reset(__p.first); 33993e519524SHoward Hinnant } 34003e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34013e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34023e519524SHoward Hinnant} 34033e519524SHoward Hinnant 34043e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34053e519524SHoward Hinnant_BidirectionalIterator 34063e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34073e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 34083e519524SHoward Hinnant{ 34093e519524SHoward Hinnant // *__first is known to be false 34103e519524SHoward Hinnant // *__last is known to be true 34113e519524SHoward Hinnant // __len >= 2 34123e519524SHoward Hinnant if (__len == 2) 34133e519524SHoward Hinnant { 34143e519524SHoward Hinnant swap(*__first, *__last); 34153e519524SHoward Hinnant return __last; 34163e519524SHoward Hinnant } 34173e519524SHoward Hinnant if (__len == 3) 34183e519524SHoward Hinnant { 34193e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34203e519524SHoward Hinnant if (__pred(*++__m)) 34213e519524SHoward Hinnant { 34223e519524SHoward Hinnant swap(*__first, *__m); 34233e519524SHoward Hinnant swap(*__m, *__last); 34243e519524SHoward Hinnant return __last; 34253e519524SHoward Hinnant } 34263e519524SHoward Hinnant swap(*__m, *__last); 34273e519524SHoward Hinnant swap(*__first, *__m); 34283e519524SHoward Hinnant return __m; 34293e519524SHoward Hinnant } 34303e519524SHoward Hinnant if (__len <= __p.second) 34313e519524SHoward Hinnant { // The buffer is big enough to use 34323e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34333e519524SHoward Hinnant __destruct_n __d(0); 34343e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34353e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34363e519524SHoward Hinnant // Update __first to always point to the end of the trues 34373e519524SHoward Hinnant value_type* __t = __p.first; 3438ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34393e519524SHoward Hinnant __d.__incr((value_type*)0); 34403e519524SHoward Hinnant ++__t; 34413e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34423e519524SHoward Hinnant while (++__i != __last) 34433e519524SHoward Hinnant { 34443e519524SHoward Hinnant if (__pred(*__i)) 34453e519524SHoward Hinnant { 3446ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34473e519524SHoward Hinnant ++__first; 34483e519524SHoward Hinnant } 34493e519524SHoward Hinnant else 34503e519524SHoward Hinnant { 3451ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34523e519524SHoward Hinnant __d.__incr((value_type*)0); 34533e519524SHoward Hinnant ++__t; 34543e519524SHoward Hinnant } 34553e519524SHoward Hinnant } 34563e519524SHoward Hinnant // move *__last, known to be true 3457ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34583e519524SHoward Hinnant __i = ++__first; 34593e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34603e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34613e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3462ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34633e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34643e519524SHoward Hinnant return __first; 34653e519524SHoward Hinnant } 34663e519524SHoward Hinnant // Else not enough buffer, do in place 34673e519524SHoward Hinnant // __len >= 4 34683e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34693e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3470ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34713e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34723e519524SHoward Hinnant // F????????????????T 34733e519524SHoward Hinnant // f m l 34743e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34753e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34763e519524SHoward Hinnant _Distance __len_half = __len2; 34773e519524SHoward Hinnant while (!__pred(*--__m1)) 34783e519524SHoward Hinnant { 34793e519524SHoward Hinnant if (__m1 == __first) 34803e519524SHoward Hinnant goto __first_half_done; 34813e519524SHoward Hinnant --__len_half; 34823e519524SHoward Hinnant } 34833e519524SHoward Hinnant // F???TFFF?????????T 34843e519524SHoward Hinnant // f m1 m l 34853e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34863e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34873e519524SHoward Hinnant__first_half_done: 34883e519524SHoward Hinnant // TTTFFFFF?????????T 34893e519524SHoward Hinnant // f ff m l 34903e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34913e519524SHoward Hinnant __m1 = __m; 34923e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34933e519524SHoward Hinnant ++__second_false; 34943e519524SHoward Hinnant __len_half = __len - __len2; 34953e519524SHoward Hinnant while (__pred(*__m1)) 34963e519524SHoward Hinnant { 34973e519524SHoward Hinnant if (++__m1 == __last) 34983e519524SHoward Hinnant goto __second_half_done; 34993e519524SHoward Hinnant --__len_half; 35003e519524SHoward Hinnant } 35013e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35023e519524SHoward Hinnant // f ff m m1 l 35033e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35043e519524SHoward Hinnant__second_half_done: 35053e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35063e519524SHoward Hinnant // f ff m sf l 3507ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35083e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35093e519524SHoward Hinnant // | 35103e519524SHoward Hinnant} 35113e519524SHoward Hinnant 35123e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35133e519524SHoward Hinnant_BidirectionalIterator 35143e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35153e519524SHoward Hinnant bidirectional_iterator_tag) 35163e519524SHoward Hinnant{ 35173e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35183e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35193e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35203e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35213e519524SHoward Hinnant while (true) 35223e519524SHoward Hinnant { 35233e519524SHoward Hinnant if (__first == __last) 35243e519524SHoward Hinnant return __first; 35253e519524SHoward Hinnant if (!__pred(*__first)) 35263e519524SHoward Hinnant break; 35273e519524SHoward Hinnant ++__first; 35283e519524SHoward Hinnant } 35293e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35303e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35313e519524SHoward Hinnant do 35323e519524SHoward Hinnant { 35333e519524SHoward Hinnant if (__first == --__last) 35343e519524SHoward Hinnant return __first; 35353e519524SHoward Hinnant } while (!__pred(*__last)); 35363e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35373e519524SHoward Hinnant // *__first is known to be false 35383e519524SHoward Hinnant // *__last is known to be true 35393e519524SHoward Hinnant // __len >= 2 3540ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35413e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35423e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35433e519524SHoward Hinnant if (__len >= __alloc_limit) 35443e519524SHoward Hinnant { 3545ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35463e519524SHoward Hinnant __h.reset(__p.first); 35473e519524SHoward Hinnant } 35483e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35493e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35503e519524SHoward Hinnant} 35513e519524SHoward Hinnant 35523e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35543e519524SHoward Hinnant_ForwardIterator 35553e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35563e519524SHoward Hinnant{ 35573e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35583e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35593e519524SHoward Hinnant} 35603e519524SHoward Hinnant 35613e519524SHoward Hinnant// is_sorted_until 35623e519524SHoward Hinnant 35633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35643e519524SHoward Hinnant_ForwardIterator 35653e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35663e519524SHoward Hinnant{ 35673e519524SHoward Hinnant if (__first != __last) 35683e519524SHoward Hinnant { 35693e519524SHoward Hinnant _ForwardIterator __i = __first; 35703e519524SHoward Hinnant while (++__i != __last) 35713e519524SHoward Hinnant { 35723e519524SHoward Hinnant if (__comp(*__i, *__first)) 35733e519524SHoward Hinnant return __i; 35743e519524SHoward Hinnant __first = __i; 35753e519524SHoward Hinnant } 35763e519524SHoward Hinnant } 35773e519524SHoward Hinnant return __last; 35783e519524SHoward Hinnant} 35793e519524SHoward Hinnant 35803e519524SHoward Hinnanttemplate<class _ForwardIterator> 35813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35823e519524SHoward Hinnant_ForwardIterator 35833e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35843e519524SHoward Hinnant{ 3585ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35863e519524SHoward Hinnant} 35873e519524SHoward Hinnant 35883e519524SHoward Hinnant// is_sorted 35893e519524SHoward Hinnant 35903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35923e519524SHoward Hinnantbool 35933e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35943e519524SHoward Hinnant{ 3595ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35963e519524SHoward Hinnant} 35973e519524SHoward Hinnant 35983e519524SHoward Hinnanttemplate<class _ForwardIterator> 35993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36003e519524SHoward Hinnantbool 36013e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36023e519524SHoward Hinnant{ 3603ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36043e519524SHoward Hinnant} 36053e519524SHoward Hinnant 36063e519524SHoward Hinnant// sort 36073e519524SHoward Hinnant 36083e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 36093e519524SHoward Hinnant 36103e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36113e519524SHoward Hinnantunsigned 36123e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36133e519524SHoward Hinnant{ 36143e519524SHoward Hinnant unsigned __r = 0; 36153e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36163e519524SHoward Hinnant { 36173e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36183e519524SHoward Hinnant return __r; // x <= y && y <= z 36193e519524SHoward Hinnant // x <= y && y > z 36203e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36213e519524SHoward Hinnant __r = 1; 36223e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36233e519524SHoward Hinnant { 36243e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36253e519524SHoward Hinnant __r = 2; 36263e519524SHoward Hinnant } 36273e519524SHoward Hinnant return __r; // x <= y && y < z 36283e519524SHoward Hinnant } 36293e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36303e519524SHoward Hinnant { 36313e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36323e519524SHoward Hinnant __r = 1; 36333e519524SHoward Hinnant return __r; 36343e519524SHoward Hinnant } 36353e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36363e519524SHoward Hinnant __r = 1; // x < y && x <= z 36373e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36383e519524SHoward Hinnant { 36393e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36403e519524SHoward Hinnant __r = 2; 36413e519524SHoward Hinnant } 36423e519524SHoward Hinnant return __r; 36433e519524SHoward Hinnant} // x <= y && y <= z 36443e519524SHoward Hinnant 36453e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36463e519524SHoward Hinnant 36473e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36483e519524SHoward Hinnantunsigned 36493e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36503e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36513e519524SHoward Hinnant{ 36523e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36533e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36543e519524SHoward Hinnant { 36553e519524SHoward Hinnant swap(*__x3, *__x4); 36563e519524SHoward Hinnant ++__r; 36573e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36583e519524SHoward Hinnant { 36593e519524SHoward Hinnant swap(*__x2, *__x3); 36603e519524SHoward Hinnant ++__r; 36613e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36623e519524SHoward Hinnant { 36633e519524SHoward Hinnant swap(*__x1, *__x2); 36643e519524SHoward Hinnant ++__r; 36653e519524SHoward Hinnant } 36663e519524SHoward Hinnant } 36673e519524SHoward Hinnant } 36683e519524SHoward Hinnant return __r; 36693e519524SHoward Hinnant} 36703e519524SHoward Hinnant 36713e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36723e519524SHoward Hinnant 36733e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36743e519524SHoward Hinnantunsigned 36753e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36763e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36773e519524SHoward Hinnant{ 36783e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36793e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36803e519524SHoward Hinnant { 36813e519524SHoward Hinnant swap(*__x4, *__x5); 36823e519524SHoward Hinnant ++__r; 36833e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36843e519524SHoward Hinnant { 36853e519524SHoward Hinnant swap(*__x3, *__x4); 36863e519524SHoward Hinnant ++__r; 36873e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36883e519524SHoward Hinnant { 36893e519524SHoward Hinnant swap(*__x2, *__x3); 36903e519524SHoward Hinnant ++__r; 36913e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36923e519524SHoward Hinnant { 36933e519524SHoward Hinnant swap(*__x1, *__x2); 36943e519524SHoward Hinnant ++__r; 36953e519524SHoward Hinnant } 36963e519524SHoward Hinnant } 36973e519524SHoward Hinnant } 36983e519524SHoward Hinnant } 36993e519524SHoward Hinnant return __r; 37003e519524SHoward Hinnant} 37013e519524SHoward Hinnant 37023e519524SHoward Hinnant// Assumes size > 0 37033e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37043e519524SHoward Hinnantvoid 37053e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37063e519524SHoward Hinnant{ 37073e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 37083e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 37093e519524SHoward Hinnant { 3710ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37113e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37123e519524SHoward Hinnant (__first, __last, __comp); 37133e519524SHoward Hinnant if (__i != __first) 37143e519524SHoward Hinnant swap(*__first, *__i); 37153e519524SHoward Hinnant } 37163e519524SHoward Hinnant} 37173e519524SHoward Hinnant 37183e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37193e519524SHoward Hinnantvoid 37203e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37213e519524SHoward Hinnant{ 37223e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37233e519524SHoward Hinnant if (__first != __last) 37243e519524SHoward Hinnant { 37253e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37263e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37273e519524SHoward Hinnant { 37283e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3729ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37303e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3731ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3732ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37333e519524SHoward Hinnant } 37343e519524SHoward Hinnant } 37353e519524SHoward Hinnant} 37363e519524SHoward Hinnant 37373e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37383e519524SHoward Hinnantvoid 37393e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37403e519524SHoward Hinnant{ 37413e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37423e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37433e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37443e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37453e519524SHoward Hinnant { 37463e519524SHoward Hinnant if (__comp(*__i, *__j)) 37473e519524SHoward Hinnant { 3748ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37493e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37503e519524SHoward Hinnant __j = __i; 37513e519524SHoward Hinnant do 37523e519524SHoward Hinnant { 3753ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37543e519524SHoward Hinnant __j = __k; 37553e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3756ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37573e519524SHoward Hinnant } 37583e519524SHoward Hinnant __j = __i; 37593e519524SHoward Hinnant } 37603e519524SHoward Hinnant} 37613e519524SHoward Hinnant 37623e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37633e519524SHoward Hinnantbool 37643e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37653e519524SHoward Hinnant{ 37663e519524SHoward Hinnant switch (__last - __first) 37673e519524SHoward Hinnant { 37683e519524SHoward Hinnant case 0: 37693e519524SHoward Hinnant case 1: 37703e519524SHoward Hinnant return true; 37713e519524SHoward Hinnant case 2: 37723e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37733e519524SHoward Hinnant swap(*__first, *__last); 37743e519524SHoward Hinnant return true; 37753e519524SHoward Hinnant case 3: 3776ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37773e519524SHoward Hinnant return true; 37783e519524SHoward Hinnant case 4: 3779ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37803e519524SHoward Hinnant return true; 37813e519524SHoward Hinnant case 5: 3782ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37833e519524SHoward Hinnant return true; 37843e519524SHoward Hinnant } 37853e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37863e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37873e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37883e519524SHoward Hinnant const unsigned __limit = 8; 37893e519524SHoward Hinnant unsigned __count = 0; 37903e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37913e519524SHoward Hinnant { 37923e519524SHoward Hinnant if (__comp(*__i, *__j)) 37933e519524SHoward Hinnant { 3794ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37953e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37963e519524SHoward Hinnant __j = __i; 37973e519524SHoward Hinnant do 37983e519524SHoward Hinnant { 3799ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38003e519524SHoward Hinnant __j = __k; 38013e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3802ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38033e519524SHoward Hinnant if (++__count == __limit) 38043e519524SHoward Hinnant return ++__i == __last; 38053e519524SHoward Hinnant } 38063e519524SHoward Hinnant __j = __i; 38073e519524SHoward Hinnant } 38083e519524SHoward Hinnant return true; 38093e519524SHoward Hinnant} 38103e519524SHoward Hinnant 38113e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38123e519524SHoward Hinnantvoid 38133e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38143e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38153e519524SHoward Hinnant{ 38163e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38173e519524SHoward Hinnant if (__first1 != __last1) 38183e519524SHoward Hinnant { 38193e519524SHoward Hinnant __destruct_n __d(0); 38203e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38213e519524SHoward Hinnant value_type* __last2 = __first2; 3822ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38233e519524SHoward Hinnant __d.__incr((value_type*)0); 38243e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38253e519524SHoward Hinnant { 38263e519524SHoward Hinnant value_type* __j2 = __last2; 38273e519524SHoward Hinnant value_type* __i2 = __j2; 38283e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38293e519524SHoward Hinnant { 3830ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38313e519524SHoward Hinnant __d.__incr((value_type*)0); 38323e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3833ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3834ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38353e519524SHoward Hinnant } 38363e519524SHoward Hinnant else 38373e519524SHoward Hinnant { 3838ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38393e519524SHoward Hinnant __d.__incr((value_type*)0); 38403e519524SHoward Hinnant } 38413e519524SHoward Hinnant } 38423e519524SHoward Hinnant __h.release(); 38433e519524SHoward Hinnant } 38443e519524SHoward Hinnant} 38453e519524SHoward Hinnant 38463e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38473e519524SHoward Hinnantvoid 38483e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38493e519524SHoward Hinnant{ 38503e519524SHoward Hinnant // _Compare is known to be a reference type 38513e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38523e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3853ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3854ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38553e519524SHoward Hinnant while (true) 38563e519524SHoward Hinnant { 38573e519524SHoward Hinnant __restart: 38583e519524SHoward Hinnant difference_type __len = __last - __first; 38593e519524SHoward Hinnant switch (__len) 38603e519524SHoward Hinnant { 38613e519524SHoward Hinnant case 0: 38623e519524SHoward Hinnant case 1: 38633e519524SHoward Hinnant return; 38643e519524SHoward Hinnant case 2: 38653e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38663e519524SHoward Hinnant swap(*__first, *__last); 38673e519524SHoward Hinnant return; 38683e519524SHoward Hinnant case 3: 3869ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38703e519524SHoward Hinnant return; 38713e519524SHoward Hinnant case 4: 3872ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38733e519524SHoward Hinnant return; 38743e519524SHoward Hinnant case 5: 3875ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38763e519524SHoward Hinnant return; 38773e519524SHoward Hinnant } 38783e519524SHoward Hinnant if (__len <= __limit) 38793e519524SHoward Hinnant { 3880ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38813e519524SHoward Hinnant return; 38823e519524SHoward Hinnant } 38833e519524SHoward Hinnant // __len > 5 38843e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38853e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38863e519524SHoward Hinnant --__lm1; 38873e519524SHoward Hinnant unsigned __n_swaps; 38883e519524SHoward Hinnant { 38893e519524SHoward Hinnant difference_type __delta; 38903e519524SHoward Hinnant if (__len >= 1000) 38913e519524SHoward Hinnant { 38923e519524SHoward Hinnant __delta = __len/2; 38933e519524SHoward Hinnant __m += __delta; 38943e519524SHoward Hinnant __delta /= 2; 3895ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38963e519524SHoward Hinnant } 38973e519524SHoward Hinnant else 38983e519524SHoward Hinnant { 38993e519524SHoward Hinnant __delta = __len/2; 39003e519524SHoward Hinnant __m += __delta; 3901ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39023e519524SHoward Hinnant } 39033e519524SHoward Hinnant } 39043e519524SHoward Hinnant // *__m is median 39053e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39063e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39073e519524SHoward Hinnant _RandomAccessIterator __i = __first; 39083e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 39093e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39103e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39113e519524SHoward Hinnant // Prime the downward search with a guard. 39123e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39133e519524SHoward Hinnant { 39143e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39153e519524SHoward Hinnant // manually guard downward moving __j against __i 39163e519524SHoward Hinnant while (true) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant if (__i == --__j) 39193e519524SHoward Hinnant { 39203e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39213e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39223e519524SHoward Hinnant ++__i; // __first + 1 39233e519524SHoward Hinnant __j = __last; 39243e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39253e519524SHoward Hinnant { 39263e519524SHoward Hinnant while (true) 39273e519524SHoward Hinnant { 39283e519524SHoward Hinnant if (__i == __j) 39293e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39303e519524SHoward Hinnant if (__comp(*__first, *__i)) 39313e519524SHoward Hinnant { 39323e519524SHoward Hinnant swap(*__i, *__j); 39333e519524SHoward Hinnant ++__n_swaps; 39343e519524SHoward Hinnant ++__i; 39353e519524SHoward Hinnant break; 39363e519524SHoward Hinnant } 39373e519524SHoward Hinnant ++__i; 39383e519524SHoward Hinnant } 39393e519524SHoward Hinnant } 39403e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39413e519524SHoward Hinnant if (__i == __j) 39423e519524SHoward Hinnant return; 39433e519524SHoward Hinnant while (true) 39443e519524SHoward Hinnant { 39453e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39463e519524SHoward Hinnant ++__i; 39473e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39483e519524SHoward Hinnant ; 39493e519524SHoward Hinnant if (__i >= __j) 39503e519524SHoward Hinnant break; 39513e519524SHoward Hinnant swap(*__i, *__j); 39523e519524SHoward Hinnant ++__n_swaps; 39533e519524SHoward Hinnant ++__i; 39543e519524SHoward Hinnant } 39553e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39563e519524SHoward Hinnant // The first part is sorted, sort the secod part 3957ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39583e519524SHoward Hinnant __first = __i; 39593e519524SHoward Hinnant goto __restart; 39603e519524SHoward Hinnant } 39613e519524SHoward Hinnant if (__comp(*__j, *__m)) 39623e519524SHoward Hinnant { 39633e519524SHoward Hinnant swap(*__i, *__j); 39643e519524SHoward Hinnant ++__n_swaps; 39653e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39663e519524SHoward Hinnant } 39673e519524SHoward Hinnant } 39683e519524SHoward Hinnant } 39693e519524SHoward Hinnant // It is known that *__i < *__m 39703e519524SHoward Hinnant ++__i; 39713e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39723e519524SHoward Hinnant // if not yet partitioned... 39733e519524SHoward Hinnant if (__i < __j) 39743e519524SHoward Hinnant { 39753e519524SHoward Hinnant // known that *(__i - 1) < *__m 39763e519524SHoward Hinnant // known that __i <= __m 39773e519524SHoward Hinnant while (true) 39783e519524SHoward Hinnant { 39793e519524SHoward Hinnant // __m still guards upward moving __i 39803e519524SHoward Hinnant while (__comp(*__i, *__m)) 39813e519524SHoward Hinnant ++__i; 39823e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39833e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39843e519524SHoward Hinnant ; 39853e519524SHoward Hinnant if (__i > __j) 39863e519524SHoward Hinnant break; 39873e519524SHoward Hinnant swap(*__i, *__j); 39883e519524SHoward Hinnant ++__n_swaps; 39893e519524SHoward Hinnant // It is known that __m != __j 39903e519524SHoward Hinnant // If __m just moved, follow it 39913e519524SHoward Hinnant if (__m == __i) 39923e519524SHoward Hinnant __m = __j; 39933e519524SHoward Hinnant ++__i; 39943e519524SHoward Hinnant } 39953e519524SHoward Hinnant } 39963e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39973e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39983e519524SHoward Hinnant { 39993e519524SHoward Hinnant swap(*__i, *__m); 40003e519524SHoward Hinnant ++__n_swaps; 40013e519524SHoward Hinnant } 40023e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40033e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40043e519524SHoward Hinnant if (__n_swaps == 0) 40053e519524SHoward Hinnant { 4006ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4007ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 40083e519524SHoward Hinnant { 40093e519524SHoward Hinnant if (__fs) 40103e519524SHoward Hinnant return; 40113e519524SHoward Hinnant __last = __i; 40123e519524SHoward Hinnant continue; 40133e519524SHoward Hinnant } 40143e519524SHoward Hinnant else 40153e519524SHoward Hinnant { 40163e519524SHoward Hinnant if (__fs) 40173e519524SHoward Hinnant { 40183e519524SHoward Hinnant __first = ++__i; 40193e519524SHoward Hinnant continue; 40203e519524SHoward Hinnant } 40213e519524SHoward Hinnant } 40223e519524SHoward Hinnant } 40233e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40243e519524SHoward Hinnant if (__i - __first < __last - __i) 40253e519524SHoward Hinnant { 4026ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4027ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40283e519524SHoward Hinnant __first = ++__i; 40293e519524SHoward Hinnant } 40303e519524SHoward Hinnant else 40313e519524SHoward Hinnant { 4032ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4033ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40343e519524SHoward Hinnant __last = __i; 40353e519524SHoward Hinnant } 40363e519524SHoward Hinnant } 40373e519524SHoward Hinnant} 40383e519524SHoward Hinnant 40393e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40403e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40423e519524SHoward Hinnantvoid 40433e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40443e519524SHoward Hinnant{ 4045145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40463e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40473e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40483e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4049145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40513e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4052145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40533e519524SHoward Hinnant} 40543e519524SHoward Hinnant 40553e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40573e519524SHoward Hinnantvoid 40583e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40593e519524SHoward Hinnant{ 4060ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40613e519524SHoward Hinnant} 40623e519524SHoward Hinnant 40633e519524SHoward Hinnanttemplate <class _Tp> 40643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40653e519524SHoward Hinnantvoid 40663e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40673e519524SHoward Hinnant{ 4068ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40693e519524SHoward Hinnant} 40703e519524SHoward Hinnant 40713e519524SHoward Hinnanttemplate <class _Tp> 40723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40733e519524SHoward Hinnantvoid 40743e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40753e519524SHoward Hinnant{ 4076ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40773e519524SHoward Hinnant} 40783e519524SHoward Hinnant 4079f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4080f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4081f554add5SHoward Hinnantvoid 4082f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4083f554add5SHoward Hinnant{ 4084f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4085f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4086f554add5SHoward Hinnant} 4087f554add5SHoward Hinnant 40880be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4089e4383379SHoward Hinnant#pragma warning( push ) 4090e4383379SHoward Hinnant#pragma warning( disable: 4231) 40910be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4092f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4093f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4094f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4095f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4096f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4097f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4098f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4099f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4100f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4101f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4102f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4103f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4104f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4105f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4106f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41073e519524SHoward Hinnant 4108f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4109f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4110f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4111f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4112f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4113f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4114f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4115f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4116f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4117f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4118f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4119f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4120f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4121f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4122f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41233e519524SHoward Hinnant 4124f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&)) 41250be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4126e4383379SHoward Hinnant#pragma warning( pop ) 41270be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 41283e519524SHoward Hinnant 41293e519524SHoward Hinnant// lower_bound 41303e519524SHoward Hinnant 41313e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41323e519524SHoward Hinnant_ForwardIterator 4133e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41343e519524SHoward Hinnant{ 41353e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4136ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41373e519524SHoward Hinnant while (__len != 0) 41383e519524SHoward Hinnant { 41393e519524SHoward Hinnant difference_type __l2 = __len / 2; 41403e519524SHoward Hinnant _ForwardIterator __m = __first; 4141ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4142e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41433e519524SHoward Hinnant { 41443e519524SHoward Hinnant __first = ++__m; 41453e519524SHoward Hinnant __len -= __l2 + 1; 41463e519524SHoward Hinnant } 41473e519524SHoward Hinnant else 41483e519524SHoward Hinnant __len = __l2; 41493e519524SHoward Hinnant } 41503e519524SHoward Hinnant return __first; 41513e519524SHoward Hinnant} 41523e519524SHoward Hinnant 41533e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41553e519524SHoward Hinnant_ForwardIterator 4156e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41573e519524SHoward Hinnant{ 4158145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4161e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4162145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4164e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4165145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41663e519524SHoward Hinnant} 41673e519524SHoward Hinnant 41683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41703e519524SHoward Hinnant_ForwardIterator 4171e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41723e519524SHoward Hinnant{ 4173e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41743e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41753e519524SHoward Hinnant} 41763e519524SHoward Hinnant 41773e519524SHoward Hinnant// upper_bound 41783e519524SHoward Hinnant 41793e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41803e519524SHoward Hinnant_ForwardIterator 4181e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41823e519524SHoward Hinnant{ 41833e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4184ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41853e519524SHoward Hinnant while (__len != 0) 41863e519524SHoward Hinnant { 41873e519524SHoward Hinnant difference_type __l2 = __len / 2; 41883e519524SHoward Hinnant _ForwardIterator __m = __first; 4189ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4190e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41913e519524SHoward Hinnant __len = __l2; 41923e519524SHoward Hinnant else 41933e519524SHoward Hinnant { 41943e519524SHoward Hinnant __first = ++__m; 41953e519524SHoward Hinnant __len -= __l2 + 1; 41963e519524SHoward Hinnant } 41973e519524SHoward Hinnant } 41983e519524SHoward Hinnant return __first; 41993e519524SHoward Hinnant} 42003e519524SHoward Hinnant 42013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42033e519524SHoward Hinnant_ForwardIterator 4204e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42053e519524SHoward Hinnant{ 4206145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42073e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42083e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4209e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4210145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42113e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4212e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4213145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42143e519524SHoward Hinnant} 42153e519524SHoward Hinnant 42163e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42183e519524SHoward Hinnant_ForwardIterator 4219e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42203e519524SHoward Hinnant{ 4221e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42223e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42233e519524SHoward Hinnant} 42243e519524SHoward Hinnant 42253e519524SHoward Hinnant// equal_range 42263e519524SHoward Hinnant 42273e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42283e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4229e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42303e519524SHoward Hinnant{ 42313e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4232ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42333e519524SHoward Hinnant while (__len != 0) 42343e519524SHoward Hinnant { 42353e519524SHoward Hinnant difference_type __l2 = __len / 2; 42363e519524SHoward Hinnant _ForwardIterator __m = __first; 4237ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4238e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42393e519524SHoward Hinnant { 42403e519524SHoward Hinnant __first = ++__m; 42413e519524SHoward Hinnant __len -= __l2 + 1; 42423e519524SHoward Hinnant } 4243e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42443e519524SHoward Hinnant { 42453e519524SHoward Hinnant __last = __m; 42463e519524SHoward Hinnant __len = __l2; 42473e519524SHoward Hinnant } 42483e519524SHoward Hinnant else 42493e519524SHoward Hinnant { 42503e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42513e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42523e519524SHoward Hinnant ( 4253e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4254e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42553e519524SHoward Hinnant ); 42563e519524SHoward Hinnant } 42573e519524SHoward Hinnant } 42583e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42593e519524SHoward Hinnant} 42603e519524SHoward Hinnant 42613e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42633e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4264e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42653e519524SHoward Hinnant{ 4266145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42673e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42683e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4269e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4270145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42713e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4272e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4273145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42743e519524SHoward Hinnant} 42753e519524SHoward Hinnant 42763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42783e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4279e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42803e519524SHoward Hinnant{ 4281e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42823e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42833e519524SHoward Hinnant} 42843e519524SHoward Hinnant 42853e519524SHoward Hinnant// binary_search 42863e519524SHoward Hinnant 42873e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42893e519524SHoward Hinnantbool 4290e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42913e519524SHoward Hinnant{ 4292e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4293e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42943e519524SHoward Hinnant} 42953e519524SHoward Hinnant 42963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42983e519524SHoward Hinnantbool 4299e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43003e519524SHoward Hinnant{ 4301145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43023e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43033e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4304e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4305145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43063e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4307e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4308145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43093e519524SHoward Hinnant} 43103e519524SHoward Hinnant 43113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43133e519524SHoward Hinnantbool 4314e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43153e519524SHoward Hinnant{ 4316e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43173e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43183e519524SHoward Hinnant} 43193e519524SHoward Hinnant 43203e519524SHoward Hinnant// merge 43213e519524SHoward Hinnant 43223e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43233e519524SHoward Hinnant_OutputIterator 43243e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43263e519524SHoward Hinnant{ 43273e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43283e519524SHoward Hinnant { 43293e519524SHoward Hinnant if (__first2 == __last2) 4330ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43313e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43323e519524SHoward Hinnant { 43333e519524SHoward Hinnant *__result = *__first2; 43343e519524SHoward Hinnant ++__first2; 43353e519524SHoward Hinnant } 43363e519524SHoward Hinnant else 43373e519524SHoward Hinnant { 43383e519524SHoward Hinnant *__result = *__first1; 43393e519524SHoward Hinnant ++__first1; 43403e519524SHoward Hinnant } 43413e519524SHoward Hinnant } 4342ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43433e519524SHoward Hinnant} 43443e519524SHoward Hinnant 43453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43473e519524SHoward Hinnant_OutputIterator 43483e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43503e519524SHoward Hinnant{ 4351145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43523e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43533e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4354ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4355145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43563e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4357ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4358145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43593e519524SHoward Hinnant} 43603e519524SHoward Hinnant 43613e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43633e519524SHoward Hinnant_OutputIterator 43643e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43663e519524SHoward Hinnant{ 43673e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43683e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43693e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43703e519524SHoward Hinnant} 43713e519524SHoward Hinnant 43723e519524SHoward Hinnant// inplace_merge 43733e519524SHoward Hinnant 4374adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4375adfdae18SMarshall Clow class _OutputIterator> 4376adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4377adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4378adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4379adfdae18SMarshall Clow{ 4380adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4381adfdae18SMarshall Clow { 4382adfdae18SMarshall Clow if (__first2 == __last2) 4383adfdae18SMarshall Clow { 4384adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4385adfdae18SMarshall Clow return; 4386adfdae18SMarshall Clow } 4387adfdae18SMarshall Clow 4388adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4389adfdae18SMarshall Clow { 4390adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4391adfdae18SMarshall Clow ++__first2; 4392adfdae18SMarshall Clow } 4393adfdae18SMarshall Clow else 4394adfdae18SMarshall Clow { 4395adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4396adfdae18SMarshall Clow ++__first1; 4397adfdae18SMarshall Clow } 4398adfdae18SMarshall Clow } 4399adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4400adfdae18SMarshall Clow} 4401adfdae18SMarshall Clow 44023e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44033e519524SHoward Hinnantvoid 44043e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44053e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44063e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44073e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 44083e519524SHoward Hinnant{ 44093e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44103e519524SHoward Hinnant __destruct_n __d(0); 44113e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44123e519524SHoward Hinnant if (__len1 <= __len2) 44133e519524SHoward Hinnant { 44143e519524SHoward Hinnant value_type* __p = __buff; 4415910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4416ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4417adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44183e519524SHoward Hinnant } 44193e519524SHoward Hinnant else 44203e519524SHoward Hinnant { 44213e519524SHoward Hinnant value_type* __p = __buff; 4422910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4423ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44243e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44253e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4426adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4427adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 44283e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 44293e519524SHoward Hinnant } 44303e519524SHoward Hinnant} 44313e519524SHoward Hinnant 44323e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44333e519524SHoward Hinnantvoid 44343e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44353e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44363e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44373e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 44383e519524SHoward Hinnant{ 44393e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 44403e519524SHoward Hinnant while (true) 44413e519524SHoward Hinnant { 44423e519524SHoward Hinnant // if __middle == __last, we're done 44433e519524SHoward Hinnant if (__len2 == 0) 44443e519524SHoward Hinnant return; 4445526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4446526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4447526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 44483e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4449910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 44503e519524SHoward Hinnant { 44513e519524SHoward Hinnant if (__len1 == 0) 44523e519524SHoward Hinnant return; 44533e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44543e519524SHoward Hinnant break; 44553e519524SHoward Hinnant } 44563e519524SHoward Hinnant // __first < __middle < __last 44573e519524SHoward Hinnant // *__first > *__middle 44583e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44593e519524SHoward Hinnant // all elements in: 44603e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44613e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44623e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44633e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44643e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44653e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44663e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44673e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44683e519524SHoward Hinnant // binary search smaller range 44693e519524SHoward Hinnant if (__len1 < __len2) 44703e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44713e519524SHoward Hinnant __len21 = __len2 / 2; 44723e519524SHoward Hinnant __m2 = __middle; 4473ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44743e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4475ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44763e519524SHoward Hinnant } 44773e519524SHoward Hinnant else 44783e519524SHoward Hinnant { 44793e519524SHoward Hinnant if (__len1 == 1) 44803e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44813e519524SHoward Hinnant // It is known *__first > *__middle 44823e519524SHoward Hinnant swap(*__first, *__middle); 44833e519524SHoward Hinnant return; 44843e519524SHoward Hinnant } 44853e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44863e519524SHoward Hinnant __len11 = __len1 / 2; 44873e519524SHoward Hinnant __m1 = __first; 4488ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44893e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4490ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44913e519524SHoward Hinnant } 44923e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44933e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44943e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44953e519524SHoward Hinnant // swap middle two partitions 4496ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44973e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44983e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44993e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45003e519524SHoward Hinnant { 45013e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45023e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45033e519524SHoward Hinnant __first = __middle; 45043e519524SHoward Hinnant __middle = __m2; 45053e519524SHoward Hinnant __len1 = __len12; 45063e519524SHoward Hinnant __len2 = __len22; 45073e519524SHoward Hinnant } 45083e519524SHoward Hinnant else 45093e519524SHoward Hinnant { 45103e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45113e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45123e519524SHoward Hinnant __last = __middle; 45133e519524SHoward Hinnant __middle = __m1; 45143e519524SHoward Hinnant __len1 = __len11; 45153e519524SHoward Hinnant __len2 = __len21; 45163e519524SHoward Hinnant } 45173e519524SHoward Hinnant } 45183e519524SHoward Hinnant} 45193e519524SHoward Hinnant 45203e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45223e519524SHoward Hinnantvoid 45233e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45243e519524SHoward Hinnant _Compare __comp) 45253e519524SHoward Hinnant{ 45263e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45273e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4528ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4529ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4530ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45310b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45320b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 45330b48cf9aSMarshall Clow 4534145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 45353e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45363e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4537ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 45383e519524SHoward Hinnant __buf.first, __buf.second); 4539145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4541ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45423e519524SHoward Hinnant __buf.first, __buf.second); 4543145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45443e519524SHoward Hinnant} 45453e519524SHoward Hinnant 45463e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45483e519524SHoward Hinnantvoid 45493e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45503e519524SHoward Hinnant{ 4551ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45523e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45533e519524SHoward Hinnant} 45543e519524SHoward Hinnant 45553e519524SHoward Hinnant// stable_sort 45563e519524SHoward Hinnant 45573e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45583e519524SHoward Hinnantvoid 45593e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45613e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45623e519524SHoward Hinnant{ 45633e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45643e519524SHoward Hinnant __destruct_n __d(0); 45653e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45663e519524SHoward Hinnant for (; true; ++__result) 45673e519524SHoward Hinnant { 45683e519524SHoward Hinnant if (__first1 == __last1) 45693e519524SHoward Hinnant { 45703e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4571ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45723e519524SHoward Hinnant __h.release(); 45733e519524SHoward Hinnant return; 45743e519524SHoward Hinnant } 45753e519524SHoward Hinnant if (__first2 == __last2) 45763e519524SHoward Hinnant { 45773e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4578ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45793e519524SHoward Hinnant __h.release(); 45803e519524SHoward Hinnant return; 45813e519524SHoward Hinnant } 45823e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45833e519524SHoward Hinnant { 4584ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45853e519524SHoward Hinnant __d.__incr((value_type*)0); 45863e519524SHoward Hinnant ++__first2; 45873e519524SHoward Hinnant } 45883e519524SHoward Hinnant else 45893e519524SHoward Hinnant { 4590ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45913e519524SHoward Hinnant __d.__incr((value_type*)0); 45923e519524SHoward Hinnant ++__first1; 45933e519524SHoward Hinnant } 45943e519524SHoward Hinnant } 45953e519524SHoward Hinnant} 45963e519524SHoward Hinnant 45973e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45983e519524SHoward Hinnantvoid 45993e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46003e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46013e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46023e519524SHoward Hinnant{ 46033e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46043e519524SHoward Hinnant { 46053e519524SHoward Hinnant if (__first2 == __last2) 46063e519524SHoward Hinnant { 46073e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4608ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46093e519524SHoward Hinnant return; 46103e519524SHoward Hinnant } 46113e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46123e519524SHoward Hinnant { 4613ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46143e519524SHoward Hinnant ++__first2; 46153e519524SHoward Hinnant } 46163e519524SHoward Hinnant else 46173e519524SHoward Hinnant { 4618ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46193e519524SHoward Hinnant ++__first1; 46203e519524SHoward Hinnant } 46213e519524SHoward Hinnant } 46223e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4623ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46243e519524SHoward Hinnant} 46253e519524SHoward Hinnant 46263e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46273e519524SHoward Hinnantvoid 46283e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46293e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46303e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46313e519524SHoward Hinnant 46323e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46333e519524SHoward Hinnantvoid 46343e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46353e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46363e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46373e519524SHoward Hinnant{ 46383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46393e519524SHoward Hinnant switch (__len) 46403e519524SHoward Hinnant { 46413e519524SHoward Hinnant case 0: 46423e519524SHoward Hinnant return; 46433e519524SHoward Hinnant case 1: 4644ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46453e519524SHoward Hinnant return; 46463e519524SHoward Hinnant case 2: 46473e519524SHoward Hinnant __destruct_n __d(0); 46483e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46493e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46503e519524SHoward Hinnant { 4651ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46523e519524SHoward Hinnant __d.__incr((value_type*)0); 46533e519524SHoward Hinnant ++__first2; 4654ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46553e519524SHoward Hinnant } 46563e519524SHoward Hinnant else 46573e519524SHoward Hinnant { 4658ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46593e519524SHoward Hinnant __d.__incr((value_type*)0); 46603e519524SHoward Hinnant ++__first2; 4661ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46623e519524SHoward Hinnant } 46633e519524SHoward Hinnant __h2.release(); 46643e519524SHoward Hinnant return; 46653e519524SHoward Hinnant } 46663e519524SHoward Hinnant if (__len <= 8) 46673e519524SHoward Hinnant { 46683e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46693e519524SHoward Hinnant return; 46703e519524SHoward Hinnant } 46713e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46723e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46733e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46743e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46753e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46763e519524SHoward Hinnant} 46773e519524SHoward Hinnant 46783e519524SHoward Hinnanttemplate <class _Tp> 46793e519524SHoward Hinnantstruct __stable_sort_switch 46803e519524SHoward Hinnant{ 4681ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46823e519524SHoward Hinnant}; 46833e519524SHoward Hinnant 46843e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46853e519524SHoward Hinnantvoid 46863e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46873e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46883e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46893e519524SHoward Hinnant{ 46903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46923e519524SHoward Hinnant switch (__len) 46933e519524SHoward Hinnant { 46943e519524SHoward Hinnant case 0: 46953e519524SHoward Hinnant case 1: 46963e519524SHoward Hinnant return; 46973e519524SHoward Hinnant case 2: 46983e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46993e519524SHoward Hinnant swap(*__first, *__last); 47003e519524SHoward Hinnant return; 47013e519524SHoward Hinnant } 47023e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47033e519524SHoward Hinnant { 47043e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47053e519524SHoward Hinnant return; 47063e519524SHoward Hinnant } 47073e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47083e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 47093e519524SHoward Hinnant if (__len <= __buff_size) 47103e519524SHoward Hinnant { 47113e519524SHoward Hinnant __destruct_n __d(0); 47123e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47133e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47143e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47153e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47163e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47173e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47183e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47193e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47203e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47213e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47223e519524SHoward Hinnant// __first, __comp); 47233e519524SHoward Hinnant return; 47243e519524SHoward Hinnant } 47253e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47263e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47273e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47283e519524SHoward Hinnant} 47293e519524SHoward Hinnant 47303e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47323e519524SHoward Hinnantvoid 47333e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47343e519524SHoward Hinnant{ 47353e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47363e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47373e519524SHoward Hinnant difference_type __len = __last - __first; 47383e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47393e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47403e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47413e519524SHoward Hinnant { 4742ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47433e519524SHoward Hinnant __h.reset(__buf.first); 47443e519524SHoward Hinnant } 4745145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47463e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47473e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47483e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4749145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47513e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4752145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47533e519524SHoward Hinnant} 47543e519524SHoward Hinnant 47553e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47573e519524SHoward Hinnantvoid 47583e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47593e519524SHoward Hinnant{ 4760ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47613e519524SHoward Hinnant} 47623e519524SHoward Hinnant 47633e519524SHoward Hinnant// is_heap_until 47643e519524SHoward Hinnant 47653e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47663e519524SHoward Hinnant_RandomAccessIterator 47673e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47683e519524SHoward Hinnant{ 4769ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47703e519524SHoward Hinnant difference_type __len = __last - __first; 47713e519524SHoward Hinnant difference_type __p = 0; 47723e519524SHoward Hinnant difference_type __c = 1; 47733e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47743e519524SHoward Hinnant while (__c < __len) 47753e519524SHoward Hinnant { 47763e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47773e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47783e519524SHoward Hinnant return __cp; 47793e519524SHoward Hinnant ++__c; 47803e519524SHoward Hinnant ++__cp; 47813e519524SHoward Hinnant if (__c == __len) 47823e519524SHoward Hinnant return __last; 47833e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47843e519524SHoward Hinnant return __cp; 47853e519524SHoward Hinnant ++__p; 47863e519524SHoward Hinnant ++__pp; 47873e519524SHoward Hinnant __c = 2 * __p + 1; 47883e519524SHoward Hinnant } 47893e519524SHoward Hinnant return __last; 47903e519524SHoward Hinnant} 47913e519524SHoward Hinnant 47923e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47943e519524SHoward Hinnant_RandomAccessIterator 47953e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47963e519524SHoward Hinnant{ 4797ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47983e519524SHoward Hinnant} 47993e519524SHoward Hinnant 48003e519524SHoward Hinnant// is_heap 48013e519524SHoward Hinnant 48023e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48043e519524SHoward Hinnantbool 48053e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48063e519524SHoward Hinnant{ 4807ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 48083e519524SHoward Hinnant} 48093e519524SHoward Hinnant 48103e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48123e519524SHoward Hinnantbool 48133e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48143e519524SHoward Hinnant{ 4815ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48163e519524SHoward Hinnant} 48173e519524SHoward Hinnant 48183e519524SHoward Hinnant// push_heap 48193e519524SHoward Hinnant 48203e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48213e519524SHoward Hinnantvoid 48228b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48233e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48243e519524SHoward Hinnant{ 48253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48263e519524SHoward Hinnant if (__len > 1) 48273e519524SHoward Hinnant { 48283e519524SHoward Hinnant __len = (__len - 2) / 2; 48293e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48303e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48313e519524SHoward Hinnant { 4832ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48333e519524SHoward Hinnant do 48343e519524SHoward Hinnant { 4835ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48363e519524SHoward Hinnant __last = __ptr; 48373e519524SHoward Hinnant if (__len == 0) 48383e519524SHoward Hinnant break; 48393e519524SHoward Hinnant __len = (__len - 1) / 2; 48403e519524SHoward Hinnant __ptr = __first + __len; 48413e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4842ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48433e519524SHoward Hinnant } 48443e519524SHoward Hinnant } 48453e519524SHoward Hinnant} 48463e519524SHoward Hinnant 48473e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48493e519524SHoward Hinnantvoid 48503e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48513e519524SHoward Hinnant{ 4852145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48558b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4856145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48588b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4859145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48603e519524SHoward Hinnant} 48613e519524SHoward Hinnant 48623e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48643e519524SHoward Hinnantvoid 48653e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48663e519524SHoward Hinnant{ 4867ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48683e519524SHoward Hinnant} 48693e519524SHoward Hinnant 48703e519524SHoward Hinnant// pop_heap 48713e519524SHoward Hinnant 48723e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48738b512602SDavid Majnemervoid 48748b512602SDavid Majnemer__sift_down(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48758b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48768b512602SDavid Majnemer _RandomAccessIterator __start) 48778b512602SDavid Majnemer{ 48788b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48798b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48808b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48818b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48828b512602SDavid Majnemer difference_type __child = __start - __first; 48838b512602SDavid Majnemer 48848b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48858b512602SDavid Majnemer return; 48868b512602SDavid Majnemer 48878b512602SDavid Majnemer __child = 2 * __child + 1; 48888b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 48898b512602SDavid Majnemer 48908b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48918b512602SDavid Majnemer // right-child exists and is greater than left-child 48928b512602SDavid Majnemer ++__child_i; 48938b512602SDavid Majnemer ++__child; 48948b512602SDavid Majnemer } 48958b512602SDavid Majnemer 48968b512602SDavid Majnemer // check if we are in heap-order 48978b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 48988b512602SDavid Majnemer // we are, __start is larger than it's largest child 48998b512602SDavid Majnemer return; 49008b512602SDavid Majnemer 49018b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49028b512602SDavid Majnemer do 49038b512602SDavid Majnemer { 49048b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49058b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49068b512602SDavid Majnemer __start = __child_i; 49078b512602SDavid Majnemer 49088b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 49098b512602SDavid Majnemer break; 49108b512602SDavid Majnemer 49118b512602SDavid Majnemer // recompute the child based off of the updated parent 49128b512602SDavid Majnemer __child = 2 * __child + 1; 49138b512602SDavid Majnemer __child_i = __first + __child; 49148b512602SDavid Majnemer 49158b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49168b512602SDavid Majnemer // right-child exists and is greater than left-child 49178b512602SDavid Majnemer ++__child_i; 49188b512602SDavid Majnemer ++__child; 49198b512602SDavid Majnemer } 49208b512602SDavid Majnemer 49218b512602SDavid Majnemer // check if we are in heap-order 49228b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49238b512602SDavid Majnemer *__start = _VSTD::move(__top); 49248b512602SDavid Majnemer} 49258b512602SDavid Majnemer 49268b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49283e519524SHoward Hinnantvoid 49293e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49303e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49313e519524SHoward Hinnant{ 49323e519524SHoward Hinnant if (__len > 1) 49333e519524SHoward Hinnant { 49343e519524SHoward Hinnant swap(*__first, *--__last); 49358b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 49363e519524SHoward Hinnant } 49373e519524SHoward Hinnant} 49383e519524SHoward Hinnant 49393e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49413e519524SHoward Hinnantvoid 49423e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49433e519524SHoward Hinnant{ 4944145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49473e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4948145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49503e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4951145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49523e519524SHoward Hinnant} 49533e519524SHoward Hinnant 49543e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49563e519524SHoward Hinnantvoid 49573e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49583e519524SHoward Hinnant{ 4959ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49603e519524SHoward Hinnant} 49613e519524SHoward Hinnant 49623e519524SHoward Hinnant// make_heap 49633e519524SHoward Hinnant 49643e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49653e519524SHoward Hinnantvoid 49663e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49673e519524SHoward Hinnant{ 49683e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49693e519524SHoward Hinnant difference_type __n = __last - __first; 49703e519524SHoward Hinnant if (__n > 1) 49713e519524SHoward Hinnant { 49728b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49738b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49748b512602SDavid Majnemer { 49758b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49768b512602SDavid Majnemer } 49773e519524SHoward Hinnant } 49783e519524SHoward Hinnant} 49793e519524SHoward Hinnant 49803e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49823e519524SHoward Hinnantvoid 49833e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49843e519524SHoward Hinnant{ 4985145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49863e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49873e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49883e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4989145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49903e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49913e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4992145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49933e519524SHoward Hinnant} 49943e519524SHoward Hinnant 49953e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49973e519524SHoward Hinnantvoid 49983e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49993e519524SHoward Hinnant{ 5000ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50013e519524SHoward Hinnant} 50023e519524SHoward Hinnant 50033e519524SHoward Hinnant// sort_heap 50043e519524SHoward Hinnant 50053e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50063e519524SHoward Hinnantvoid 50073e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50083e519524SHoward Hinnant{ 50093e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50103e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 50113e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50123e519524SHoward Hinnant} 50133e519524SHoward Hinnant 50143e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50163e519524SHoward Hinnantvoid 50173e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50183e519524SHoward Hinnant{ 5019145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50223e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5023145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50253e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5026145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50273e519524SHoward Hinnant} 50283e519524SHoward Hinnant 50293e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50313e519524SHoward Hinnantvoid 50323e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50333e519524SHoward Hinnant{ 5034ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50353e519524SHoward Hinnant} 50363e519524SHoward Hinnant 50373e519524SHoward Hinnant// partial_sort 50383e519524SHoward Hinnant 50393e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50403e519524SHoward Hinnantvoid 50413e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50423e519524SHoward Hinnant _Compare __comp) 50433e519524SHoward Hinnant{ 50443e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 50453e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 50463e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 50473e519524SHoward Hinnant { 50483e519524SHoward Hinnant if (__comp(*__i, *__first)) 50493e519524SHoward Hinnant { 50503e519524SHoward Hinnant swap(*__i, *__first); 50518b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50523e519524SHoward Hinnant } 50533e519524SHoward Hinnant } 50543e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50553e519524SHoward Hinnant} 50563e519524SHoward Hinnant 50573e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50593e519524SHoward Hinnantvoid 50603e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50613e519524SHoward Hinnant _Compare __comp) 50623e519524SHoward Hinnant{ 5063145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50663e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5067145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50693e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5070145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50713e519524SHoward Hinnant} 50723e519524SHoward Hinnant 50733e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50753e519524SHoward Hinnantvoid 50763e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50773e519524SHoward Hinnant{ 5078ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50793e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50803e519524SHoward Hinnant} 50813e519524SHoward Hinnant 50823e519524SHoward Hinnant// partial_sort_copy 50833e519524SHoward Hinnant 50843e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50853e519524SHoward Hinnant_RandomAccessIterator 50863e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50873e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50883e519524SHoward Hinnant{ 50893e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50903e519524SHoward Hinnant if (__r != __result_last) 50913e519524SHoward Hinnant { 5092910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 50933e519524SHoward Hinnant *__r = *__first; 50943e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50958b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 50963e519524SHoward Hinnant for (; __first != __last; ++__first) 50973e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50983e519524SHoward Hinnant { 50993e519524SHoward Hinnant *__result_first = *__first; 51008b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 51013e519524SHoward Hinnant } 51023e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 51033e519524SHoward Hinnant } 51043e519524SHoward Hinnant return __r; 51053e519524SHoward Hinnant} 51063e519524SHoward Hinnant 51073e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 51083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51093e519524SHoward Hinnant_RandomAccessIterator 51103e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51113e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51123e519524SHoward Hinnant{ 5113145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51143e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51153e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51163e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5117145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51183e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51193e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5120145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51213e519524SHoward Hinnant} 51223e519524SHoward Hinnant 51233e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51253e519524SHoward Hinnant_RandomAccessIterator 51263e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51273e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51283e519524SHoward Hinnant{ 5129ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51303e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51313e519524SHoward Hinnant} 51323e519524SHoward Hinnant 51333e519524SHoward Hinnant// nth_element 51343e519524SHoward Hinnant 51353e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51363e519524SHoward Hinnantvoid 51373e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 51383e519524SHoward Hinnant{ 51393e519524SHoward Hinnant // _Compare is known to be a reference type 51403e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51413e519524SHoward Hinnant const difference_type __limit = 7; 51423e519524SHoward Hinnant while (true) 51433e519524SHoward Hinnant { 51443e519524SHoward Hinnant __restart: 5145b34b4819SHoward Hinnant if (__nth == __last) 5146b34b4819SHoward Hinnant return; 51473e519524SHoward Hinnant difference_type __len = __last - __first; 51483e519524SHoward Hinnant switch (__len) 51493e519524SHoward Hinnant { 51503e519524SHoward Hinnant case 0: 51513e519524SHoward Hinnant case 1: 51523e519524SHoward Hinnant return; 51533e519524SHoward Hinnant case 2: 51543e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51553e519524SHoward Hinnant swap(*__first, *__last); 51563e519524SHoward Hinnant return; 51573e519524SHoward Hinnant case 3: 51583e519524SHoward Hinnant { 51593e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5160ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51613e519524SHoward Hinnant return; 51623e519524SHoward Hinnant } 51633e519524SHoward Hinnant } 51643e519524SHoward Hinnant if (__len <= __limit) 51653e519524SHoward Hinnant { 51663e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51673e519524SHoward Hinnant return; 51683e519524SHoward Hinnant } 51693e519524SHoward Hinnant // __len > __limit >= 3 51703e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51713e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5172ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51733e519524SHoward Hinnant // *__m is median 51743e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51753e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51763e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51773e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51783e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51793e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51803e519524SHoward Hinnant // Prime the downward search with a guard. 51813e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51823e519524SHoward Hinnant { 51833e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51843e519524SHoward Hinnant // manually guard downward moving __j against __i 51853e519524SHoward Hinnant while (true) 51863e519524SHoward Hinnant { 51873e519524SHoward Hinnant if (__i == --__j) 51883e519524SHoward Hinnant { 51893e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51903e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51913e519524SHoward Hinnant ++__i; // __first + 1 51923e519524SHoward Hinnant __j = __last; 51933e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51943e519524SHoward Hinnant { 51953e519524SHoward Hinnant while (true) 51963e519524SHoward Hinnant { 51973e519524SHoward Hinnant if (__i == __j) 51983e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51993e519524SHoward Hinnant if (__comp(*__first, *__i)) 52003e519524SHoward Hinnant { 52013e519524SHoward Hinnant swap(*__i, *__j); 52023e519524SHoward Hinnant ++__n_swaps; 52033e519524SHoward Hinnant ++__i; 52043e519524SHoward Hinnant break; 52053e519524SHoward Hinnant } 52063e519524SHoward Hinnant ++__i; 52073e519524SHoward Hinnant } 52083e519524SHoward Hinnant } 52093e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 52103e519524SHoward Hinnant if (__i == __j) 52113e519524SHoward Hinnant return; 52123e519524SHoward Hinnant while (true) 52133e519524SHoward Hinnant { 52143e519524SHoward Hinnant while (!__comp(*__first, *__i)) 52153e519524SHoward Hinnant ++__i; 52163e519524SHoward Hinnant while (__comp(*__first, *--__j)) 52173e519524SHoward Hinnant ; 52183e519524SHoward Hinnant if (__i >= __j) 52193e519524SHoward Hinnant break; 52203e519524SHoward Hinnant swap(*__i, *__j); 52213e519524SHoward Hinnant ++__n_swaps; 52223e519524SHoward Hinnant ++__i; 52233e519524SHoward Hinnant } 52243e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52253e519524SHoward Hinnant // The first part is sorted, 52263e519524SHoward Hinnant if (__nth < __i) 52273e519524SHoward Hinnant return; 52283e519524SHoward Hinnant // __nth_element the secod part 52293e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52303e519524SHoward Hinnant __first = __i; 52313e519524SHoward Hinnant goto __restart; 52323e519524SHoward Hinnant } 52333e519524SHoward Hinnant if (__comp(*__j, *__m)) 52343e519524SHoward Hinnant { 52353e519524SHoward Hinnant swap(*__i, *__j); 52363e519524SHoward Hinnant ++__n_swaps; 52373e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 52383e519524SHoward Hinnant } 52393e519524SHoward Hinnant } 52403e519524SHoward Hinnant } 52413e519524SHoward Hinnant ++__i; 52423e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52433e519524SHoward Hinnant // if not yet partitioned... 52443e519524SHoward Hinnant if (__i < __j) 52453e519524SHoward Hinnant { 52463e519524SHoward Hinnant // known that *(__i - 1) < *__m 52473e519524SHoward Hinnant while (true) 52483e519524SHoward Hinnant { 52493e519524SHoward Hinnant // __m still guards upward moving __i 52503e519524SHoward Hinnant while (__comp(*__i, *__m)) 52513e519524SHoward Hinnant ++__i; 52523e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52533e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52543e519524SHoward Hinnant ; 52553e519524SHoward Hinnant if (__i >= __j) 52563e519524SHoward Hinnant break; 52573e519524SHoward Hinnant swap(*__i, *__j); 52583e519524SHoward Hinnant ++__n_swaps; 52593e519524SHoward Hinnant // It is known that __m != __j 52603e519524SHoward Hinnant // If __m just moved, follow it 52613e519524SHoward Hinnant if (__m == __i) 52623e519524SHoward Hinnant __m = __j; 52633e519524SHoward Hinnant ++__i; 52643e519524SHoward Hinnant } 52653e519524SHoward Hinnant } 52663e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52673e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52683e519524SHoward Hinnant { 52693e519524SHoward Hinnant swap(*__i, *__m); 52703e519524SHoward Hinnant ++__n_swaps; 52713e519524SHoward Hinnant } 52723e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52733e519524SHoward Hinnant if (__nth == __i) 52743e519524SHoward Hinnant return; 52753e519524SHoward Hinnant if (__n_swaps == 0) 52763e519524SHoward Hinnant { 52773e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52783e519524SHoward Hinnant if (__nth < __i) 52793e519524SHoward Hinnant { 52803e519524SHoward Hinnant // Check for [__first, __i) already sorted 52813e519524SHoward Hinnant __j = __m = __first; 52823e519524SHoward Hinnant while (++__j != __i) 52833e519524SHoward Hinnant { 52843e519524SHoward Hinnant if (__comp(*__j, *__m)) 52853e519524SHoward Hinnant // not yet sorted, so sort 52863e519524SHoward Hinnant goto not_sorted; 52873e519524SHoward Hinnant __m = __j; 52883e519524SHoward Hinnant } 52893e519524SHoward Hinnant // [__first, __i) sorted 52903e519524SHoward Hinnant return; 52913e519524SHoward Hinnant } 52923e519524SHoward Hinnant else 52933e519524SHoward Hinnant { 52943e519524SHoward Hinnant // Check for [__i, __last) already sorted 52953e519524SHoward Hinnant __j = __m = __i; 52963e519524SHoward Hinnant while (++__j != __last) 52973e519524SHoward Hinnant { 52983e519524SHoward Hinnant if (__comp(*__j, *__m)) 52993e519524SHoward Hinnant // not yet sorted, so sort 53003e519524SHoward Hinnant goto not_sorted; 53013e519524SHoward Hinnant __m = __j; 53023e519524SHoward Hinnant } 53033e519524SHoward Hinnant // [__i, __last) sorted 53043e519524SHoward Hinnant return; 53053e519524SHoward Hinnant } 53063e519524SHoward Hinnant } 53073e519524SHoward Hinnantnot_sorted: 53083e519524SHoward Hinnant // __nth_element on range containing __nth 53093e519524SHoward Hinnant if (__nth < __i) 53103e519524SHoward Hinnant { 53113e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 53123e519524SHoward Hinnant __last = __i; 53133e519524SHoward Hinnant } 53143e519524SHoward Hinnant else 53153e519524SHoward Hinnant { 53163e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 53173e519524SHoward Hinnant __first = ++__i; 53183e519524SHoward Hinnant } 53193e519524SHoward Hinnant } 53203e519524SHoward Hinnant} 53213e519524SHoward Hinnant 53223e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53243e519524SHoward Hinnantvoid 53253e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53263e519524SHoward Hinnant{ 5327145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53283e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53293e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53303e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5331145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53333e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5334145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53353e519524SHoward Hinnant} 53363e519524SHoward Hinnant 53373e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 53383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53393e519524SHoward Hinnantvoid 53403e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 53413e519524SHoward Hinnant{ 5342ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 53433e519524SHoward Hinnant} 53443e519524SHoward Hinnant 53453e519524SHoward Hinnant// includes 53463e519524SHoward Hinnant 53473e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53483e519524SHoward Hinnantbool 53493e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53503e519524SHoward Hinnant _Compare __comp) 53513e519524SHoward Hinnant{ 53523e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53533e519524SHoward Hinnant { 53543e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53553e519524SHoward Hinnant return false; 53563e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53573e519524SHoward Hinnant ++__first2; 53583e519524SHoward Hinnant } 53593e519524SHoward Hinnant return true; 53603e519524SHoward Hinnant} 53613e519524SHoward Hinnant 53623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53643e519524SHoward Hinnantbool 53653e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53663e519524SHoward Hinnant _Compare __comp) 53673e519524SHoward Hinnant{ 5368145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53693e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53703e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53713e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5372145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53733e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53743e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5375145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53763e519524SHoward Hinnant} 53773e519524SHoward Hinnant 53783e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53803e519524SHoward Hinnantbool 53813e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53823e519524SHoward Hinnant{ 5383ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53843e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53853e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53863e519524SHoward Hinnant} 53873e519524SHoward Hinnant 53883e519524SHoward Hinnant// set_union 53893e519524SHoward Hinnant 53903e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53913e519524SHoward Hinnant_OutputIterator 53923e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53933e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53943e519524SHoward Hinnant{ 53953e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53963e519524SHoward Hinnant { 53973e519524SHoward Hinnant if (__first2 == __last2) 5398ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53993e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54003e519524SHoward Hinnant { 54013e519524SHoward Hinnant *__result = *__first2; 54023e519524SHoward Hinnant ++__first2; 54033e519524SHoward Hinnant } 54043e519524SHoward Hinnant else 54053e519524SHoward Hinnant { 54063e519524SHoward Hinnant *__result = *__first1; 54073e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54083e519524SHoward Hinnant ++__first2; 54093e519524SHoward Hinnant ++__first1; 54103e519524SHoward Hinnant } 54113e519524SHoward Hinnant } 5412ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54133e519524SHoward Hinnant} 54143e519524SHoward Hinnant 54153e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54173e519524SHoward Hinnant_OutputIterator 54183e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54193e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54203e519524SHoward Hinnant{ 5421145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54223e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54233e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54243e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5425145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54263e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54273e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5428145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54293e519524SHoward Hinnant} 54303e519524SHoward Hinnant 54313e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54333e519524SHoward Hinnant_OutputIterator 54343e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54353e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54363e519524SHoward Hinnant{ 5437ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 54383e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54393e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54403e519524SHoward Hinnant} 54413e519524SHoward Hinnant 54423e519524SHoward Hinnant// set_intersection 54433e519524SHoward Hinnant 54443e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54453e519524SHoward Hinnant_OutputIterator 54463e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54483e519524SHoward Hinnant{ 54493e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54503e519524SHoward Hinnant { 54513e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54523e519524SHoward Hinnant ++__first1; 54533e519524SHoward Hinnant else 54543e519524SHoward Hinnant { 54553e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54563e519524SHoward Hinnant { 54573e519524SHoward Hinnant *__result = *__first1; 54583e519524SHoward Hinnant ++__result; 54593e519524SHoward Hinnant ++__first1; 54603e519524SHoward Hinnant } 54613e519524SHoward Hinnant ++__first2; 54623e519524SHoward Hinnant } 54633e519524SHoward Hinnant } 54643e519524SHoward Hinnant return __result; 54653e519524SHoward Hinnant} 54663e519524SHoward Hinnant 54673e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54693e519524SHoward Hinnant_OutputIterator 54703e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54723e519524SHoward Hinnant{ 5473145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54743e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54753e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54763e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5477145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54783e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54793e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5480145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54813e519524SHoward Hinnant} 54823e519524SHoward Hinnant 54833e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54853e519524SHoward Hinnant_OutputIterator 54863e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54873e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54883e519524SHoward Hinnant{ 5489ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54903e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54913e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54923e519524SHoward Hinnant} 54933e519524SHoward Hinnant 54943e519524SHoward Hinnant// set_difference 54953e519524SHoward Hinnant 54963e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54973e519524SHoward Hinnant_OutputIterator 54983e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54993e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55003e519524SHoward Hinnant{ 55013e519524SHoward Hinnant while (__first1 != __last1) 55023e519524SHoward Hinnant { 55033e519524SHoward Hinnant if (__first2 == __last2) 5504ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55053e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55063e519524SHoward Hinnant { 55073e519524SHoward Hinnant *__result = *__first1; 55083e519524SHoward Hinnant ++__result; 55093e519524SHoward Hinnant ++__first1; 55103e519524SHoward Hinnant } 55113e519524SHoward Hinnant else 55123e519524SHoward Hinnant { 55133e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55143e519524SHoward Hinnant ++__first1; 55153e519524SHoward Hinnant ++__first2; 55163e519524SHoward Hinnant } 55173e519524SHoward Hinnant } 55183e519524SHoward Hinnant return __result; 55193e519524SHoward Hinnant} 55203e519524SHoward Hinnant 55213e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55233e519524SHoward Hinnant_OutputIterator 55243e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55263e519524SHoward Hinnant{ 5527145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55283e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55293e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55303e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5531145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55333e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5534145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55353e519524SHoward Hinnant} 55363e519524SHoward Hinnant 55373e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55393e519524SHoward Hinnant_OutputIterator 55403e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55413e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55423e519524SHoward Hinnant{ 5543ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 55443e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55453e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55463e519524SHoward Hinnant} 55473e519524SHoward Hinnant 55483e519524SHoward Hinnant// set_symmetric_difference 55493e519524SHoward Hinnant 55503e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55513e519524SHoward Hinnant_OutputIterator 55523e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55533e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55543e519524SHoward Hinnant{ 55553e519524SHoward Hinnant while (__first1 != __last1) 55563e519524SHoward Hinnant { 55573e519524SHoward Hinnant if (__first2 == __last2) 5558ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55593e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55603e519524SHoward Hinnant { 55613e519524SHoward Hinnant *__result = *__first1; 55623e519524SHoward Hinnant ++__result; 55633e519524SHoward Hinnant ++__first1; 55643e519524SHoward Hinnant } 55653e519524SHoward Hinnant else 55663e519524SHoward Hinnant { 55673e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55683e519524SHoward Hinnant { 55693e519524SHoward Hinnant *__result = *__first2; 55703e519524SHoward Hinnant ++__result; 55713e519524SHoward Hinnant } 55723e519524SHoward Hinnant else 55733e519524SHoward Hinnant ++__first1; 55743e519524SHoward Hinnant ++__first2; 55753e519524SHoward Hinnant } 55763e519524SHoward Hinnant } 5577ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55783e519524SHoward Hinnant} 55793e519524SHoward Hinnant 55803e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55823e519524SHoward Hinnant_OutputIterator 55833e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55843e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55853e519524SHoward Hinnant{ 5586145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55873e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55883e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55893e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5590145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55913e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55923e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5593145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55943e519524SHoward Hinnant} 55953e519524SHoward Hinnant 55963e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55983e519524SHoward Hinnant_OutputIterator 55993e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56003e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56013e519524SHoward Hinnant{ 5602ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 56033e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56043e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56053e519524SHoward Hinnant} 56063e519524SHoward Hinnant 56073e519524SHoward Hinnant// lexicographical_compare 56083e519524SHoward Hinnant 56093e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 56103e519524SHoward Hinnantbool 56113e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56123e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56133e519524SHoward Hinnant{ 5614910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 56153e519524SHoward Hinnant { 56163e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 56173e519524SHoward Hinnant return true; 56183e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56193e519524SHoward Hinnant return false; 56203e519524SHoward Hinnant } 56213e519524SHoward Hinnant return false; 56223e519524SHoward Hinnant} 56233e519524SHoward Hinnant 56243e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 56253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56263e519524SHoward Hinnantbool 56273e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56283e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56293e519524SHoward Hinnant{ 5630145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56313e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56323e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56333e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5634145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56363e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5637145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56383e519524SHoward Hinnant} 56393e519524SHoward Hinnant 56403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 56413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56423e519524SHoward Hinnantbool 56433e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56443e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 56453e519524SHoward Hinnant{ 5646ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 56473e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56483e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56493e519524SHoward Hinnant} 56503e519524SHoward Hinnant 56513e519524SHoward Hinnant// next_permutation 56523e519524SHoward Hinnant 56533e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56543e519524SHoward Hinnantbool 56553e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56563e519524SHoward Hinnant{ 56573e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56583e519524SHoward Hinnant if (__first == __last || __first == --__i) 56593e519524SHoward Hinnant return false; 56603e519524SHoward Hinnant while (true) 56613e519524SHoward Hinnant { 56623e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56633e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56643e519524SHoward Hinnant { 56653e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56663e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56673e519524SHoward Hinnant ; 56683e519524SHoward Hinnant swap(*__i, *__j); 5669ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56703e519524SHoward Hinnant return true; 56713e519524SHoward Hinnant } 56723e519524SHoward Hinnant if (__i == __first) 56733e519524SHoward Hinnant { 5674ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56753e519524SHoward Hinnant return false; 56763e519524SHoward Hinnant } 56773e519524SHoward Hinnant } 56783e519524SHoward Hinnant} 56793e519524SHoward Hinnant 56803e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56823e519524SHoward Hinnantbool 56833e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56843e519524SHoward Hinnant{ 5685145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56863e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56873e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56883e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5689145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56903e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56913e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5692145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56933e519524SHoward Hinnant} 56943e519524SHoward Hinnant 56953e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56973e519524SHoward Hinnantbool 56983e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56993e519524SHoward Hinnant{ 5700ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 57013e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57023e519524SHoward Hinnant} 57033e519524SHoward Hinnant 57043e519524SHoward Hinnant// prev_permutation 57053e519524SHoward Hinnant 57063e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57073e519524SHoward Hinnantbool 57083e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57093e519524SHoward Hinnant{ 57103e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57113e519524SHoward Hinnant if (__first == __last || __first == --__i) 57123e519524SHoward Hinnant return false; 57133e519524SHoward Hinnant while (true) 57143e519524SHoward Hinnant { 57153e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57163e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 57173e519524SHoward Hinnant { 57183e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57193e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 57203e519524SHoward Hinnant ; 57213e519524SHoward Hinnant swap(*__i, *__j); 5722ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57233e519524SHoward Hinnant return true; 57243e519524SHoward Hinnant } 57253e519524SHoward Hinnant if (__i == __first) 57263e519524SHoward Hinnant { 5727ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57283e519524SHoward Hinnant return false; 57293e519524SHoward Hinnant } 57303e519524SHoward Hinnant } 57313e519524SHoward Hinnant} 57323e519524SHoward Hinnant 57333e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57353e519524SHoward Hinnantbool 57363e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57373e519524SHoward Hinnant{ 5738145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57393e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57403e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57413e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5742145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57433e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57443e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5745145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57463e519524SHoward Hinnant} 57473e519524SHoward Hinnant 57483e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57503e519524SHoward Hinnantbool 57513e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57523e519524SHoward Hinnant{ 5753ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57543e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57553e519524SHoward Hinnant} 57563e519524SHoward Hinnant 57573e519524SHoward Hinnanttemplate <class _Tp> 57583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57593e519524SHoward Hinnanttypename enable_if 57603e519524SHoward Hinnant< 57613e519524SHoward Hinnant is_integral<_Tp>::value, 57623e519524SHoward Hinnant _Tp 57633e519524SHoward Hinnant>::type 57643e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 57653e519524SHoward Hinnant{ 57663e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57673e519524SHoward Hinnant __n &= __bits; 57683e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 57693e519524SHoward Hinnant} 57703e519524SHoward Hinnant 57713e519524SHoward Hinnanttemplate <class _Tp> 57723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57733e519524SHoward Hinnanttypename enable_if 57743e519524SHoward Hinnant< 57753e519524SHoward Hinnant is_integral<_Tp>::value, 57763e519524SHoward Hinnant _Tp 57773e519524SHoward Hinnant>::type 57783e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 57793e519524SHoward Hinnant{ 57803e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57813e519524SHoward Hinnant __n &= __bits; 57823e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 57833e519524SHoward Hinnant} 57843e519524SHoward Hinnant 57853e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57863e519524SHoward Hinnant 57873e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5788