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 2843e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last); 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 2883e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator& rand); 2893e519524SHoward Hinnant 290f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 291f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 292fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 293f9d540b0SHoward Hinnant 2943e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2953e519524SHoward Hinnant bool 2963e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2973e519524SHoward Hinnant 2983e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2993e519524SHoward Hinnant ForwardIterator 3003e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3013e519524SHoward Hinnant 3023e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3033e519524SHoward Hinnant class OutputIterator2, class Predicate> 3043e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3053e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3063e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3073e519524SHoward Hinnant Predicate pred); 3083e519524SHoward Hinnant 3093e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3103e519524SHoward Hinnant ForwardIterator 3113e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3123e519524SHoward Hinnant 3133e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3143e519524SHoward Hinnant ForwardIterator 3153e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3163e519524SHoward Hinnant 3173e519524SHoward Hinnanttemplate <class ForwardIterator> 3183e519524SHoward Hinnant bool 3193e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3203e519524SHoward Hinnant 3213e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3223e519524SHoward Hinnant bool 3233e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3243e519524SHoward Hinnant 3253e519524SHoward Hinnanttemplate<class ForwardIterator> 3263e519524SHoward Hinnant ForwardIterator 3273e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3283e519524SHoward Hinnant 3293e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3303e519524SHoward Hinnant ForwardIterator 3313e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3323e519524SHoward Hinnant 3333e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3343e519524SHoward Hinnant void 3353e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3363e519524SHoward Hinnant 3373e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3383e519524SHoward Hinnant void 3393e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3403e519524SHoward Hinnant 3413e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3423e519524SHoward Hinnant void 3433e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3443e519524SHoward Hinnant 3453e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3463e519524SHoward Hinnant void 3473e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3483e519524SHoward Hinnant 3493e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3503e519524SHoward Hinnant void 3513e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3523e519524SHoward Hinnant 3533e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3543e519524SHoward Hinnant void 3553e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3563e519524SHoward Hinnant 3573e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3583e519524SHoward Hinnant RandomAccessIterator 3593e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3603e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3633e519524SHoward Hinnant RandomAccessIterator 3643e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3653e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3663e519524SHoward Hinnant 3673e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3683e519524SHoward Hinnant void 3693e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3703e519524SHoward Hinnant 3713e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3723e519524SHoward Hinnant void 3733e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3743e519524SHoward Hinnant 3753e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3763e519524SHoward Hinnant ForwardIterator 3773e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3803e519524SHoward Hinnant ForwardIterator 3813e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3823e519524SHoward Hinnant 3833e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3843e519524SHoward Hinnant ForwardIterator 3853e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3863e519524SHoward Hinnant 3873e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3883e519524SHoward Hinnant ForwardIterator 3893e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3903e519524SHoward Hinnant 3913e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3923e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3933e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3943e519524SHoward Hinnant 3953e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3963e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3973e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3983e519524SHoward Hinnant 3993e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4003e519524SHoward Hinnant bool 4013e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4023e519524SHoward Hinnant 4033e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4043e519524SHoward Hinnant bool 4053e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4063e519524SHoward Hinnant 4073e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4083e519524SHoward Hinnant OutputIterator 4093e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4103e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4113e519524SHoward Hinnant 4123e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4133e519524SHoward Hinnant OutputIterator 4143e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4153e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4163e519524SHoward Hinnant 4173e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4183e519524SHoward Hinnant void 4193e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4203e519524SHoward Hinnant 4213e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4223e519524SHoward Hinnant void 4233e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4243e519524SHoward Hinnant 4253e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4263e519524SHoward Hinnant bool 4273e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4283e519524SHoward Hinnant 4293e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4303e519524SHoward Hinnant bool 4313e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4323e519524SHoward Hinnant 4333e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4343e519524SHoward Hinnant OutputIterator 4353e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4363e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4373e519524SHoward Hinnant 4383e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4393e519524SHoward Hinnant OutputIterator 4403e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4413e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4423e519524SHoward Hinnant 4433e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4443e519524SHoward Hinnant OutputIterator 4453e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4463e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4493e519524SHoward Hinnant OutputIterator 4503e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4513e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4543e519524SHoward Hinnant OutputIterator 4553e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4563e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4593e519524SHoward Hinnant OutputIterator 4603e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4613e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4623e519524SHoward Hinnant 4633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4643e519524SHoward Hinnant OutputIterator 4653e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4663e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4693e519524SHoward Hinnant OutputIterator 4703e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4713e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4743e519524SHoward Hinnant void 4753e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4763e519524SHoward Hinnant 4773e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4783e519524SHoward Hinnant void 4793e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4803e519524SHoward Hinnant 4813e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4823e519524SHoward Hinnant void 4833e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4843e519524SHoward Hinnant 4853e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4863e519524SHoward Hinnant void 4873e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4883e519524SHoward Hinnant 4893e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4903e519524SHoward Hinnant void 4913e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4923e519524SHoward Hinnant 4933e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4943e519524SHoward Hinnant void 4953e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4963e519524SHoward Hinnant 4973e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4983e519524SHoward Hinnant void 4993e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5003e519524SHoward Hinnant 5013e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5023e519524SHoward Hinnant void 5033e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5043e519524SHoward Hinnant 5053e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5063e519524SHoward Hinnant bool 5073e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5083e519524SHoward Hinnant 5093e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5103e519524SHoward Hinnant bool 5113e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5123e519524SHoward Hinnant 5133e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5143e519524SHoward Hinnant RandomAccessIterator 5153e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5163e519524SHoward Hinnant 5173e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5183e519524SHoward Hinnant RandomAccessIterator 5193e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5203e519524SHoward Hinnant 5214eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5224eb27b79SHoward Hinnant ForwardIterator 5234eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 5244eb27b79SHoward Hinnant 5254eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5264eb27b79SHoward Hinnant ForwardIterator 5274eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 5284eb27b79SHoward Hinnant 5293e519524SHoward Hinnanttemplate <class T> 5303e519524SHoward Hinnant const T& 531*9d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class T, class Compare> 5343e519524SHoward Hinnant const T& 535*9d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate<class T> 5384eb27b79SHoward Hinnant T 539*9d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5403e519524SHoward Hinnant 5413e519524SHoward Hinnanttemplate<class T, class Compare> 5424eb27b79SHoward Hinnant T 543*9d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5443e519524SHoward Hinnant 5453e519524SHoward Hinnanttemplate <class ForwardIterator> 5463e519524SHoward Hinnant ForwardIterator 5473e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5483e519524SHoward Hinnant 5493e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5503e519524SHoward Hinnant ForwardIterator 5513e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5523e519524SHoward Hinnant 5534eb27b79SHoward Hinnanttemplate <class T> 5544eb27b79SHoward Hinnant const T& 555*9d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5564eb27b79SHoward Hinnant 5574eb27b79SHoward Hinnanttemplate <class T, class Compare> 5584eb27b79SHoward Hinnant const T& 559*9d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5604eb27b79SHoward Hinnant 5614eb27b79SHoward Hinnanttemplate<class T> 5624eb27b79SHoward Hinnant T 563*9d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5644eb27b79SHoward Hinnant 5654eb27b79SHoward Hinnanttemplate<class T, class Compare> 5664eb27b79SHoward Hinnant T 567*9d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5684eb27b79SHoward Hinnant 5694eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5704eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5714eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last); 5724eb27b79SHoward Hinnant 5734eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5744eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5754eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 5764eb27b79SHoward Hinnant 5774eb27b79SHoward Hinnanttemplate<class T> 5784eb27b79SHoward Hinnant pair<const T&, const T&> 579*9d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5804eb27b79SHoward Hinnant 5814eb27b79SHoward Hinnanttemplate<class T, class Compare> 5824eb27b79SHoward Hinnant pair<const T&, const T&> 583*9d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 5844eb27b79SHoward Hinnant 5854eb27b79SHoward Hinnanttemplate<class T> 5864eb27b79SHoward Hinnant pair<T, T> 587*9d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 5884eb27b79SHoward Hinnant 5894eb27b79SHoward Hinnanttemplate<class T, class Compare> 5904eb27b79SHoward Hinnant pair<T, T> 591*9d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 5924eb27b79SHoward Hinnant 5933e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5943e519524SHoward Hinnant bool 5953e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5963e519524SHoward Hinnant 5973e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5983e519524SHoward Hinnant bool 5993e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6003e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6013e519524SHoward Hinnant 6023e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6033e519524SHoward Hinnant bool 6043e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6053e519524SHoward Hinnant 6063e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6073e519524SHoward Hinnant bool 6083e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6093e519524SHoward Hinnant 6103e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6113e519524SHoward Hinnant bool 6123e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6133e519524SHoward Hinnant 6143e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6153e519524SHoward Hinnant bool 6163e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6173e519524SHoward Hinnant 6183e519524SHoward Hinnant} // std 6193e519524SHoward Hinnant 6203e519524SHoward Hinnant*/ 6213e519524SHoward Hinnant 6223e519524SHoward Hinnant#include <__config> 6233e519524SHoward Hinnant#include <initializer_list> 6243e519524SHoward Hinnant#include <type_traits> 6253e519524SHoward Hinnant#include <cstring> 6263e519524SHoward Hinnant#include <utility> 6273e519524SHoward Hinnant#include <memory> 6283e519524SHoward Hinnant#include <iterator> 629a1d07d57SHoward Hinnant#include <cstddef> 6303e519524SHoward Hinnant 6315d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6325d1a701dSHoward Hinnant#include "support/ibm/support.h" 6335d1a701dSHoward Hinnant#endif 6345f878d4bSHoward Hinnant#if defined(_LIBCPP_MSVCRT) || defined(__MINGW32__) 6355f878d4bSHoward Hinnant#include "support/win32/support.h" 6365f878d4bSHoward Hinnant#endif 6375d1a701dSHoward Hinnant 638ab4f4382SHoward Hinnant#include <__undef_min_max> 639ab4f4382SHoward Hinnant 640073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6413e519524SHoward Hinnant#pragma GCC system_header 642073458b1SHoward Hinnant#endif 6433e519524SHoward Hinnant 6443e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6453e519524SHoward Hinnant 646*9d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 647*9d67c6d5SMarshall Clow// * That only works with C++14 and later, and 648*9d67c6d5SMarshall Clow// * We haven't included <functional> here. 6493e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6503e519524SHoward Hinnantstruct __equal_to 6513e519524SHoward Hinnant{ 6523e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6533e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6543e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6553e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6563e519524SHoward Hinnant}; 6573e519524SHoward Hinnant 6583e519524SHoward Hinnanttemplate <class _T1> 6593e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6603e519524SHoward Hinnant{ 661*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 662*9d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6633e519524SHoward Hinnant}; 6643e519524SHoward Hinnant 6653e519524SHoward Hinnanttemplate <class _T1> 6663e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6673e519524SHoward Hinnant{ 668*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 669*9d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6703e519524SHoward Hinnant}; 6713e519524SHoward Hinnant 6723e519524SHoward Hinnanttemplate <class _T1> 6733e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6743e519524SHoward Hinnant{ 675*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 676*9d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6773e519524SHoward Hinnant}; 6783e519524SHoward Hinnant 6793e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6803e519524SHoward Hinnantstruct __less 6813e519524SHoward Hinnant{ 682*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 683*9d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 684*9d67c6d5SMarshall Clow 685*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 686*9d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 687*9d67c6d5SMarshall Clow 688*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 689*9d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 690*9d67c6d5SMarshall Clow 691*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 692*9d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6933e519524SHoward Hinnant}; 6943e519524SHoward Hinnant 6953e519524SHoward Hinnanttemplate <class _T1> 6963e519524SHoward Hinnantstruct __less<_T1, _T1> 6973e519524SHoward Hinnant{ 698*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 699*9d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7003e519524SHoward Hinnant}; 7013e519524SHoward Hinnant 7023e519524SHoward Hinnanttemplate <class _T1> 7033e519524SHoward Hinnantstruct __less<const _T1, _T1> 7043e519524SHoward Hinnant{ 705*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 706*9d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7073e519524SHoward Hinnant}; 7083e519524SHoward Hinnant 7093e519524SHoward Hinnanttemplate <class _T1> 7103e519524SHoward Hinnantstruct __less<_T1, const _T1> 7113e519524SHoward Hinnant{ 712*9d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 713*9d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7143e519524SHoward Hinnant}; 7153e519524SHoward Hinnant 7163e519524SHoward Hinnanttemplate <class _Predicate> 7173e519524SHoward Hinnantclass __negate 7183e519524SHoward Hinnant{ 7193e519524SHoward Hinnantprivate: 7203e519524SHoward Hinnant _Predicate __p_; 7213e519524SHoward Hinnantpublic: 7223e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7233e519524SHoward Hinnant 7243e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7253e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7263e519524SHoward Hinnant 7273e519524SHoward Hinnant template <class _T1> 7283e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7293e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7303e519524SHoward Hinnant 7313e519524SHoward Hinnant template <class _T1, class _T2> 7323e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7333e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7343e519524SHoward Hinnant}; 7353e519524SHoward Hinnant 736145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7373e519524SHoward Hinnant 7383e519524SHoward Hinnanttemplate <class _Compare> 7393e519524SHoward Hinnantstruct __debug_less 7403e519524SHoward Hinnant{ 7413e519524SHoward Hinnant _Compare __comp_; 7423e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 7433e519524SHoward Hinnant template <class _Tp, class _Up> 7443e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7453e519524SHoward Hinnant { 7463e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7473e519524SHoward Hinnant if (__r) 748f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 7493e519524SHoward Hinnant return __r; 7503e519524SHoward Hinnant } 7513e519524SHoward Hinnant}; 7523e519524SHoward Hinnant 753145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7543e519524SHoward Hinnant 755c8edcb36SHoward Hinnant// Precondition: __x != 0 756c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 757c206366fSHoward Hinnantunsigned 758c206366fSHoward Hinnant__ctz(unsigned __x) 759c206366fSHoward Hinnant{ 760c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 761c206366fSHoward Hinnant} 762c206366fSHoward Hinnant 763c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 764c206366fSHoward Hinnantunsigned long 765c206366fSHoward Hinnant__ctz(unsigned long __x) 766c206366fSHoward Hinnant{ 767c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 768c206366fSHoward Hinnant} 769c206366fSHoward Hinnant 770c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 771c206366fSHoward Hinnantunsigned long long 772c206366fSHoward Hinnant__ctz(unsigned long long __x) 773c206366fSHoward Hinnant{ 774c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 775c206366fSHoward Hinnant} 776c8edcb36SHoward Hinnant 777c8edcb36SHoward Hinnant// Precondition: __x != 0 778c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 779c206366fSHoward Hinnantunsigned 780c206366fSHoward Hinnant__clz(unsigned __x) 781c206366fSHoward Hinnant{ 782c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 783c206366fSHoward Hinnant} 784c206366fSHoward Hinnant 785c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 786c206366fSHoward Hinnantunsigned long 787c206366fSHoward Hinnant__clz(unsigned long __x) 788c206366fSHoward Hinnant{ 789c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 790c206366fSHoward Hinnant} 791c206366fSHoward Hinnant 792c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 793c206366fSHoward Hinnantunsigned long long 794c206366fSHoward Hinnant__clz(unsigned long long __x) 795c206366fSHoward Hinnant{ 796c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 797c206366fSHoward Hinnant} 798c8edcb36SHoward Hinnant 799c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 800c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 801c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 802c8edcb36SHoward Hinnant 8033e519524SHoward Hinnant// all_of 8043e519524SHoward Hinnant 8053e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8073e519524SHoward Hinnantbool 8083e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8093e519524SHoward Hinnant{ 8103e519524SHoward Hinnant for (; __first != __last; ++__first) 8113e519524SHoward Hinnant if (!__pred(*__first)) 8123e519524SHoward Hinnant return false; 8133e519524SHoward Hinnant return true; 8143e519524SHoward Hinnant} 8153e519524SHoward Hinnant 8163e519524SHoward Hinnant// any_of 8173e519524SHoward Hinnant 8183e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8203e519524SHoward Hinnantbool 8213e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8223e519524SHoward Hinnant{ 8233e519524SHoward Hinnant for (; __first != __last; ++__first) 8243e519524SHoward Hinnant if (__pred(*__first)) 8253e519524SHoward Hinnant return true; 8263e519524SHoward Hinnant return false; 8273e519524SHoward Hinnant} 8283e519524SHoward Hinnant 8293e519524SHoward Hinnant// none_of 8303e519524SHoward Hinnant 8313e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8333e519524SHoward Hinnantbool 8343e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8353e519524SHoward Hinnant{ 8363e519524SHoward Hinnant for (; __first != __last; ++__first) 8373e519524SHoward Hinnant if (__pred(*__first)) 8383e519524SHoward Hinnant return false; 8393e519524SHoward Hinnant return true; 8403e519524SHoward Hinnant} 8413e519524SHoward Hinnant 8423e519524SHoward Hinnant// for_each 8433e519524SHoward Hinnant 8443e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8463e519524SHoward Hinnant_Function 8473e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8483e519524SHoward Hinnant{ 8493e519524SHoward Hinnant for (; __first != __last; ++__first) 8503e519524SHoward Hinnant __f(*__first); 851179b1f8cSHoward Hinnant return _VSTD::move(__f); // explicitly moved for (emulated) C++03 8523e519524SHoward Hinnant} 8533e519524SHoward Hinnant 8543e519524SHoward Hinnant// find 8553e519524SHoward Hinnant 8563e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8583e519524SHoward Hinnant_InputIterator 859e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8603e519524SHoward Hinnant{ 8613e519524SHoward Hinnant for (; __first != __last; ++__first) 862e4383379SHoward Hinnant if (*__first == __value_) 8633e519524SHoward Hinnant break; 8643e519524SHoward Hinnant return __first; 8653e519524SHoward Hinnant} 8663e519524SHoward Hinnant 8673e519524SHoward Hinnant// find_if 8683e519524SHoward Hinnant 8693e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8713e519524SHoward Hinnant_InputIterator 8723e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8733e519524SHoward Hinnant{ 8743e519524SHoward Hinnant for (; __first != __last; ++__first) 8753e519524SHoward Hinnant if (__pred(*__first)) 8763e519524SHoward Hinnant break; 8773e519524SHoward Hinnant return __first; 8783e519524SHoward Hinnant} 8793e519524SHoward Hinnant 8803e519524SHoward Hinnant// find_if_not 8813e519524SHoward Hinnant 8823e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8843e519524SHoward Hinnant_InputIterator 8853e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8863e519524SHoward Hinnant{ 8873e519524SHoward Hinnant for (; __first != __last; ++__first) 8883e519524SHoward Hinnant if (!__pred(*__first)) 8893e519524SHoward Hinnant break; 8903e519524SHoward Hinnant return __first; 8913e519524SHoward Hinnant} 8923e519524SHoward Hinnant 8933e519524SHoward Hinnant// find_end 8943e519524SHoward Hinnant 8953e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8963e519524SHoward Hinnant_ForwardIterator1 8973e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8983e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 8993e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9003e519524SHoward Hinnant{ 9013e519524SHoward Hinnant // modeled after search algorithm 9023e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9033e519524SHoward Hinnant if (__first2 == __last2) 9043e519524SHoward Hinnant return __r; 9053e519524SHoward Hinnant while (true) 9063e519524SHoward Hinnant { 9073e519524SHoward Hinnant while (true) 9083e519524SHoward Hinnant { 9093e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9103e519524SHoward Hinnant return __r; // (or __last1 if never found) 9113e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9123e519524SHoward Hinnant break; 9133e519524SHoward Hinnant ++__first1; 9143e519524SHoward Hinnant } 9153e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9163e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9173e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9183e519524SHoward Hinnant while (true) 9193e519524SHoward Hinnant { 9203e519524SHoward Hinnant if (++__m2 == __last2) 9213e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9223e519524SHoward Hinnant __r = __first1; 9233e519524SHoward Hinnant ++__first1; 9243e519524SHoward Hinnant break; 9253e519524SHoward Hinnant } 9263e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9273e519524SHoward Hinnant return __r; 9283e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9293e519524SHoward Hinnant { 9303e519524SHoward Hinnant ++__first1; 9313e519524SHoward Hinnant break; 9323e519524SHoward Hinnant } // else there is a match, check next elements 9333e519524SHoward Hinnant } 9343e519524SHoward Hinnant } 9353e519524SHoward Hinnant} 9363e519524SHoward Hinnant 9373e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9383e519524SHoward Hinnant_BidirectionalIterator1 9393e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9403e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9413e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9423e519524SHoward Hinnant{ 9433e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9443e519524SHoward Hinnant if (__first2 == __last2) 9453e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9463e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9473e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9483e519524SHoward Hinnant --__l2; 9493e519524SHoward Hinnant while (true) 9503e519524SHoward Hinnant { 9513e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9523e519524SHoward Hinnant while (true) 9533e519524SHoward Hinnant { 9543e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9553e519524SHoward Hinnant return __last1; 9563e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9573e519524SHoward Hinnant break; 9583e519524SHoward Hinnant } 9593e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9603e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9613e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9623e519524SHoward Hinnant while (true) 9633e519524SHoward Hinnant { 9643e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9653e519524SHoward Hinnant return __m1; 9663e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9673e519524SHoward Hinnant return __last1; 9683e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9693e519524SHoward Hinnant { 9703e519524SHoward Hinnant break; 9713e519524SHoward Hinnant } // else there is a match, check next elements 9723e519524SHoward Hinnant } 9733e519524SHoward Hinnant } 9743e519524SHoward Hinnant} 9753e519524SHoward Hinnant 9763e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9773e519524SHoward Hinnant_RandomAccessIterator1 9783e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9793e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9803e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9813e519524SHoward Hinnant{ 9823e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9833e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9843e519524SHoward Hinnant if (__len2 == 0) 9853e519524SHoward Hinnant return __last1; 9863e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9873e519524SHoward Hinnant if (__len1 < __len2) 9883e519524SHoward Hinnant return __last1; 9893e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9903e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9913e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9923e519524SHoward Hinnant --__l2; 9933e519524SHoward Hinnant while (true) 9943e519524SHoward Hinnant { 9953e519524SHoward Hinnant while (true) 9963e519524SHoward Hinnant { 9973e519524SHoward Hinnant if (__s == __l1) 9983e519524SHoward Hinnant return __last1; 9993e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10003e519524SHoward Hinnant break; 10013e519524SHoward Hinnant } 10023e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10033e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10043e519524SHoward Hinnant while (true) 10053e519524SHoward Hinnant { 10063e519524SHoward Hinnant if (__m2 == __first2) 10073e519524SHoward Hinnant return __m1; 10083e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10093e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10103e519524SHoward Hinnant { 10113e519524SHoward Hinnant break; 10123e519524SHoward Hinnant } 10133e519524SHoward Hinnant } 10143e519524SHoward Hinnant } 10153e519524SHoward Hinnant} 10163e519524SHoward Hinnant 10173e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10193e519524SHoward Hinnant_ForwardIterator1 10203e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10213e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10223e519524SHoward Hinnant{ 1023ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10243e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10253e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10263e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10273e519524SHoward Hinnant} 10283e519524SHoward Hinnant 10293e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10313e519524SHoward Hinnant_ForwardIterator1 10323e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10333e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10343e519524SHoward Hinnant{ 10353e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1037ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10383e519524SHoward Hinnant} 10393e519524SHoward Hinnant 10403e519524SHoward Hinnant// find_first_of 10413e519524SHoward Hinnant 10423e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10433e519524SHoward Hinnant_ForwardIterator1 10443e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10453e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10463e519524SHoward Hinnant{ 10473e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10483e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10493e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10503e519524SHoward Hinnant return __first1; 10513e519524SHoward Hinnant return __last1; 10523e519524SHoward Hinnant} 10533e519524SHoward Hinnant 10543e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10563e519524SHoward Hinnant_ForwardIterator1 10573e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10583e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10593e519524SHoward Hinnant{ 10603e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10613e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1062ce48a113SHoward Hinnant return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10633e519524SHoward Hinnant} 10643e519524SHoward Hinnant 10653e519524SHoward Hinnant// adjacent_find 10663e519524SHoward Hinnant 10673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10693e519524SHoward Hinnant_ForwardIterator 10703e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10713e519524SHoward Hinnant{ 10723e519524SHoward Hinnant if (__first != __last) 10733e519524SHoward Hinnant { 10743e519524SHoward Hinnant _ForwardIterator __i = __first; 10753e519524SHoward Hinnant while (++__i != __last) 10763e519524SHoward Hinnant { 10773e519524SHoward Hinnant if (__pred(*__first, *__i)) 10783e519524SHoward Hinnant return __first; 10793e519524SHoward Hinnant __first = __i; 10803e519524SHoward Hinnant } 10813e519524SHoward Hinnant } 10823e519524SHoward Hinnant return __last; 10833e519524SHoward Hinnant} 10843e519524SHoward Hinnant 10853e519524SHoward Hinnanttemplate <class _ForwardIterator> 10863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10873e519524SHoward Hinnant_ForwardIterator 10883e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 10893e519524SHoward Hinnant{ 10903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1091ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 10923e519524SHoward Hinnant} 10933e519524SHoward Hinnant 10943e519524SHoward Hinnant// count 10953e519524SHoward Hinnant 10963e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10983e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1099e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11003e519524SHoward Hinnant{ 11013e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11023e519524SHoward Hinnant for (; __first != __last; ++__first) 1103e4383379SHoward Hinnant if (*__first == __value_) 11043e519524SHoward Hinnant ++__r; 11053e519524SHoward Hinnant return __r; 11063e519524SHoward Hinnant} 11073e519524SHoward Hinnant 11083e519524SHoward Hinnant// count_if 11093e519524SHoward Hinnant 11103e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11123e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11133e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11143e519524SHoward Hinnant{ 11153e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11163e519524SHoward Hinnant for (; __first != __last; ++__first) 11173e519524SHoward Hinnant if (__pred(*__first)) 11183e519524SHoward Hinnant ++__r; 11193e519524SHoward Hinnant return __r; 11203e519524SHoward Hinnant} 11213e519524SHoward Hinnant 11223e519524SHoward Hinnant// mismatch 11233e519524SHoward Hinnant 11243e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11263e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11273e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11283e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11293e519524SHoward Hinnant{ 11303e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11313e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11323e519524SHoward Hinnant break; 11333e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11343e519524SHoward Hinnant} 11353e519524SHoward Hinnant 11363e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11383e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11393e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11403e519524SHoward Hinnant{ 11413e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11423e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1143ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11443e519524SHoward Hinnant} 11453e519524SHoward Hinnant 11460b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11470b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11480b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11490b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11500b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11510b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11520b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11530b0bbd2fSMarshall Clow{ 11540b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 11550b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11560b0bbd2fSMarshall Clow break; 11570b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11580b0bbd2fSMarshall Clow} 11590b0bbd2fSMarshall Clow 11600b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11610b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11620b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11630b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11640b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11650b0bbd2fSMarshall Clow{ 11660b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11670b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 11680b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11690b0bbd2fSMarshall Clow} 11700b0bbd2fSMarshall Clow#endif 11710b0bbd2fSMarshall Clow 11723e519524SHoward Hinnant// equal 11733e519524SHoward Hinnant 11743e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11763e519524SHoward Hinnantbool 11773e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11783e519524SHoward Hinnant{ 11793e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11803e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11813e519524SHoward Hinnant return false; 11823e519524SHoward Hinnant return true; 11833e519524SHoward Hinnant} 11843e519524SHoward Hinnant 11853e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11873e519524SHoward Hinnantbool 11883e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11893e519524SHoward Hinnant{ 11903e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11913e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1192ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11933e519524SHoward Hinnant} 11943e519524SHoward Hinnant 11950b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11960b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 11970b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11980b0bbd2fSMarshall Clowbool 11990b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12000b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12010b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12020b0bbd2fSMarshall Clow{ 12030b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 12040b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12050b0bbd2fSMarshall Clow return false; 12060b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12070b0bbd2fSMarshall Clow} 12080b0bbd2fSMarshall Clow 12090b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12100b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12110b0bbd2fSMarshall Clowbool 12120b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12130b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12140b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12150b0bbd2fSMarshall Clow{ 12160b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12170b0bbd2fSMarshall Clow return false; 12180b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12190b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12200b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12210b0bbd2fSMarshall Clow} 12220b0bbd2fSMarshall Clow 12230b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12240b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12250b0bbd2fSMarshall Clowbool 12260b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12270b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12280b0bbd2fSMarshall Clow{ 12290b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12300b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12310b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12320b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12330b0bbd2fSMarshall Clow} 12340b0bbd2fSMarshall Clow 12350b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12360b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12370b0bbd2fSMarshall Clowbool 12380b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12390b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12400b0bbd2fSMarshall Clow{ 12410b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12420b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12430b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12440b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12450b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12460b0bbd2fSMarshall Clow} 12470b0bbd2fSMarshall Clow#endif 12480b0bbd2fSMarshall Clow 12493e519524SHoward Hinnant// is_permutation 12503e519524SHoward Hinnant 12513e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12523e519524SHoward Hinnantbool 12533e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12543e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12553e519524SHoward Hinnant{ 12563e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 12573e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 12583e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12593e519524SHoward Hinnant goto __not_done; 12603e519524SHoward Hinnant return true; 12613e519524SHoward Hinnant__not_done: 12623e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12633e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1264ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12653e519524SHoward Hinnant if (__l1 == _D1(1)) 12663e519524SHoward Hinnant return false; 1267ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12683e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12693e519524SHoward Hinnant // equal elements in [f2, l2) 12703e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12713e519524SHoward Hinnant { 12723e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 12733e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 12743e519524SHoward Hinnant if (__pred(*__j, *__i)) 12753e519524SHoward Hinnant goto __next_iter; 12763e519524SHoward Hinnant { 12773e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12783e519524SHoward Hinnant _D1 __c2 = 0; 12793e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12803e519524SHoward Hinnant if (__pred(*__i, *__j)) 12813e519524SHoward Hinnant ++__c2; 12823e519524SHoward Hinnant if (__c2 == 0) 12833e519524SHoward Hinnant return false; 12843e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 12853e519524SHoward Hinnant _D1 __c1 = 1; 1286ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 12873e519524SHoward Hinnant if (__pred(*__i, *__j)) 12883e519524SHoward Hinnant ++__c1; 12893e519524SHoward Hinnant if (__c1 != __c2) 12903e519524SHoward Hinnant return false; 12913e519524SHoward Hinnant } 12923e519524SHoward Hinnant__next_iter:; 12933e519524SHoward Hinnant } 12943e519524SHoward Hinnant return true; 12953e519524SHoward Hinnant} 12963e519524SHoward Hinnant 12973e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 12983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12993e519524SHoward Hinnantbool 13003e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13013e519524SHoward Hinnant _ForwardIterator2 __first2) 13023e519524SHoward Hinnant{ 13033e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1305ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13063e519524SHoward Hinnant} 13073e519524SHoward Hinnant 13080b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13090b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13100b0bbd2fSMarshall Clowbool 13110b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13120b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13130b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13140b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13150b0bbd2fSMarshall Clow{ 13160b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 13170b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 13180b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13190b0bbd2fSMarshall Clow goto __not_done; 13200b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13210b0bbd2fSMarshall Clow__not_done: 13220b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13230b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13240b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13250b0bbd2fSMarshall Clow 13260b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1327fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13280b0bbd2fSMarshall Clow if (__l1 != __l2) 13290b0bbd2fSMarshall Clow return false; 13300b0bbd2fSMarshall Clow 13310b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13320b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13330b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13340b0bbd2fSMarshall Clow { 13350b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13360b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13370b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13380b0bbd2fSMarshall Clow goto __next_iter; 13390b0bbd2fSMarshall Clow { 13400b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13410b0bbd2fSMarshall Clow _D1 __c2 = 0; 13420b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13430b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13440b0bbd2fSMarshall Clow ++__c2; 13450b0bbd2fSMarshall Clow if (__c2 == 0) 13460b0bbd2fSMarshall Clow return false; 13470b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13480b0bbd2fSMarshall Clow _D1 __c1 = 1; 13490b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13500b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13510b0bbd2fSMarshall Clow ++__c1; 13520b0bbd2fSMarshall Clow if (__c1 != __c2) 13530b0bbd2fSMarshall Clow return false; 13540b0bbd2fSMarshall Clow } 13550b0bbd2fSMarshall Clow__next_iter:; 13560b0bbd2fSMarshall Clow } 13570b0bbd2fSMarshall Clow return true; 13580b0bbd2fSMarshall Clow} 13590b0bbd2fSMarshall Clow 13600b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13610b0bbd2fSMarshall Clowbool 13620b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13630b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13640b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13650b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13660b0bbd2fSMarshall Clow{ 13670b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13680b0bbd2fSMarshall Clow return false; 13690b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 13700b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13710b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13720b0bbd2fSMarshall Clow} 13730b0bbd2fSMarshall Clow 13740b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13750b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13760b0bbd2fSMarshall Clowbool 13770b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13780b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13790b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 13800b0bbd2fSMarshall Clow{ 13810b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 13820b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13830b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13840b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13850b0bbd2fSMarshall Clow} 13860b0bbd2fSMarshall Clow 13870b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 13880b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13890b0bbd2fSMarshall Clowbool 13900b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13910b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 13920b0bbd2fSMarshall Clow{ 13930b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13940b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 13950b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 13960b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 13970b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13980b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13990b0bbd2fSMarshall Clow} 14000b0bbd2fSMarshall Clow#endif 14010b0bbd2fSMarshall Clow 14023e519524SHoward Hinnant// search 14033e519524SHoward Hinnant 14043e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 14053e519524SHoward Hinnant_ForwardIterator1 14063e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14073e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 14083e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 14093e519524SHoward Hinnant{ 14103e519524SHoward Hinnant if (__first2 == __last2) 14113e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 14123e519524SHoward Hinnant while (true) 14133e519524SHoward Hinnant { 14143e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 14153e519524SHoward Hinnant while (true) 14163e519524SHoward Hinnant { 14173e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 14183e519524SHoward Hinnant return __last1; 14193e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14203e519524SHoward Hinnant break; 14213e519524SHoward Hinnant ++__first1; 14223e519524SHoward Hinnant } 14233e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14243e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14253e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14263e519524SHoward Hinnant while (true) 14273e519524SHoward Hinnant { 14283e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 14293e519524SHoward Hinnant return __first1; 14303e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 14313e519524SHoward Hinnant return __last1; 14323e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14333e519524SHoward Hinnant { 14343e519524SHoward Hinnant ++__first1; 14353e519524SHoward Hinnant break; 14363e519524SHoward Hinnant } // else there is a match, check next elements 14373e519524SHoward Hinnant } 14383e519524SHoward Hinnant } 14393e519524SHoward Hinnant} 14403e519524SHoward Hinnant 14413e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14423e519524SHoward Hinnant_RandomAccessIterator1 14433e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14443e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14453e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14463e519524SHoward Hinnant{ 14473e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 14483e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14493e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 14503e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 14513e519524SHoward Hinnant if (__len2 == 0) 14523e519524SHoward Hinnant return __first1; 14533e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 14543e519524SHoward Hinnant if (__len1 < __len2) 14553e519524SHoward Hinnant return __last1; 14563e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14573e519524SHoward Hinnant while (true) 14583e519524SHoward Hinnant { 14593e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14603e519524SHoward Hinnant while (true) 14613e519524SHoward Hinnant { 14623e519524SHoward Hinnant if (__first1 == __s) 14633e519524SHoward Hinnant return __last1; 14643e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14653e519524SHoward Hinnant break; 14663e519524SHoward Hinnant ++__first1; 14673e519524SHoward Hinnant } 1468b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14693e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 14703e519524SHoward Hinnant { 14713e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14723e519524SHoward Hinnant goto __phase2; 14733e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14743e519524SHoward Hinnant goto __phase2; 14753e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14763e519524SHoward Hinnant goto __phase2; 14773e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14783e519524SHoward Hinnant goto __phase2; 14793e519524SHoward Hinnant ++__first1; 14803e519524SHoward Hinnant } 14813e519524SHoward Hinnant switch (__s - __first1) 14823e519524SHoward Hinnant { 14833e519524SHoward Hinnant case 3: 14843e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14853e519524SHoward Hinnant break; 14863e519524SHoward Hinnant ++__first1; 14873e519524SHoward Hinnant case 2: 14883e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14893e519524SHoward Hinnant break; 14903e519524SHoward Hinnant ++__first1; 14913e519524SHoward Hinnant case 1: 14923e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14933e519524SHoward Hinnant break; 14943e519524SHoward Hinnant case 0: 14953e519524SHoward Hinnant return __last1; 14963e519524SHoward Hinnant } 14973e519524SHoward Hinnant __phase2: 1498b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 14993e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 15003e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 15013e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 15023e519524SHoward Hinnant while (true) 15033e519524SHoward Hinnant { 15043e519524SHoward Hinnant if (++__m2 == __last2) 15053e519524SHoward Hinnant return __first1; 15063e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 15073e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15083e519524SHoward Hinnant { 15093e519524SHoward Hinnant ++__first1; 15103e519524SHoward Hinnant break; 15113e519524SHoward Hinnant } 15123e519524SHoward Hinnant } 1513b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 15143e519524SHoward Hinnant ++__m2; 15153e519524SHoward Hinnant ++__m1; 15163e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 15173e519524SHoward Hinnant { 15183e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15193e519524SHoward Hinnant goto __continue; 15203e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15213e519524SHoward Hinnant goto __continue; 15223e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15233e519524SHoward Hinnant goto __continue; 15243e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15253e519524SHoward Hinnant goto __continue; 15263e519524SHoward Hinnant ++__m1; 15273e519524SHoward Hinnant ++__m2; 15283e519524SHoward Hinnant } 15293e519524SHoward Hinnant switch (__last2 - __m2) 15303e519524SHoward Hinnant { 15313e519524SHoward Hinnant case 3: 15323e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15333e519524SHoward Hinnant break; 15343e519524SHoward Hinnant ++__m1; 15353e519524SHoward Hinnant ++__m2; 15363e519524SHoward Hinnant case 2: 15373e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15383e519524SHoward Hinnant break; 15393e519524SHoward Hinnant ++__m1; 15403e519524SHoward Hinnant ++__m2; 15413e519524SHoward Hinnant case 1: 15423e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15433e519524SHoward Hinnant break; 15443e519524SHoward Hinnant case 0: 15453e519524SHoward Hinnant return __first1; 15463e519524SHoward Hinnant } 15473e519524SHoward Hinnant __continue: 15483e519524SHoward Hinnant ++__first1; 1549b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15503e519524SHoward Hinnant } 15513e519524SHoward Hinnant} 15523e519524SHoward Hinnant 15533e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15553e519524SHoward Hinnant_ForwardIterator1 15563e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15573e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15583e519524SHoward Hinnant{ 1559ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15603e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 15613e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 15623e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 15633e519524SHoward Hinnant} 15643e519524SHoward Hinnant 15653e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15673e519524SHoward Hinnant_ForwardIterator1 15683e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15693e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15703e519524SHoward Hinnant{ 15713e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 15723e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1573ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15743e519524SHoward Hinnant} 15753e519524SHoward Hinnant 15763e519524SHoward Hinnant// search_n 15773e519524SHoward Hinnant 15783e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15793e519524SHoward Hinnant_ForwardIterator 15803e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1581e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15823e519524SHoward Hinnant{ 15833e519524SHoward Hinnant if (__count <= 0) 15843e519524SHoward Hinnant return __first; 15853e519524SHoward Hinnant while (true) 15863e519524SHoward Hinnant { 1587e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15883e519524SHoward Hinnant while (true) 15893e519524SHoward Hinnant { 1590e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15913e519524SHoward Hinnant return __last; 1592e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15933e519524SHoward Hinnant break; 15943e519524SHoward Hinnant ++__first; 15953e519524SHoward Hinnant } 1596e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15973e519524SHoward Hinnant _ForwardIterator __m = __first; 15983e519524SHoward Hinnant _Size __c(0); 15993e519524SHoward Hinnant while (true) 16003e519524SHoward Hinnant { 16013e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16023e519524SHoward Hinnant return __first; 16033e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16043e519524SHoward Hinnant return __last; 1605e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16063e519524SHoward Hinnant { 16073e519524SHoward Hinnant __first = __m; 16083e519524SHoward Hinnant ++__first; 16093e519524SHoward Hinnant break; 16103e519524SHoward Hinnant } // else there is a match, check next elements 16113e519524SHoward Hinnant } 16123e519524SHoward Hinnant } 16133e519524SHoward Hinnant} 16143e519524SHoward Hinnant 16153e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16163e519524SHoward Hinnant_RandomAccessIterator 16173e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1618e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16193e519524SHoward Hinnant{ 16203e519524SHoward Hinnant if (__count <= 0) 16213e519524SHoward Hinnant return __first; 16223e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16233e519524SHoward Hinnant if (__len < __count) 16243e519524SHoward Hinnant return __last; 16253e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16263e519524SHoward Hinnant while (true) 16273e519524SHoward Hinnant { 1628e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16293e519524SHoward Hinnant while (true) 16303e519524SHoward Hinnant { 1631b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16323e519524SHoward Hinnant return __last; 1633e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16343e519524SHoward Hinnant break; 16353e519524SHoward Hinnant ++__first; 16363e519524SHoward Hinnant } 1637e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16383e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16393e519524SHoward Hinnant _Size __c(0); 16403e519524SHoward Hinnant while (true) 16413e519524SHoward Hinnant { 16423e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16433e519524SHoward Hinnant return __first; 16443e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1645e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16463e519524SHoward Hinnant { 16473e519524SHoward Hinnant __first = __m; 16483e519524SHoward Hinnant ++__first; 16493e519524SHoward Hinnant break; 16503e519524SHoward Hinnant } // else there is a match, check next elements 16513e519524SHoward Hinnant } 16523e519524SHoward Hinnant } 16533e519524SHoward Hinnant} 16543e519524SHoward Hinnant 16553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16573e519524SHoward Hinnant_ForwardIterator 16583e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1659e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16603e519524SHoward Hinnant{ 1661ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1662e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 16633e519524SHoward Hinnant} 16643e519524SHoward Hinnant 16653e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16673e519524SHoward Hinnant_ForwardIterator 1668e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16693e519524SHoward Hinnant{ 16703e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1671e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 16723e519524SHoward Hinnant} 16733e519524SHoward Hinnant 16743e519524SHoward Hinnant// copy 16753e519524SHoward Hinnant 16763e519524SHoward Hinnanttemplate <class _Iter> 16773e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 16783e519524SHoward Hinnant{ 16793e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16803e519524SHoward Hinnant}; 16813e519524SHoward Hinnant 16823e519524SHoward Hinnanttemplate <class _Iter> 16833e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 16843e519524SHoward Hinnant{ 16853e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16863e519524SHoward Hinnant}; 16873e519524SHoward Hinnant 16883e519524SHoward Hinnanttemplate <class _Iter> 16893e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 16903e519524SHoward Hinnant{ 16913e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16923e519524SHoward Hinnant}; 16933e519524SHoward Hinnant 16943e519524SHoward Hinnanttemplate <class _Iter> 16953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16963e519524SHoward Hinnant_Iter 16973e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16983e519524SHoward Hinnant{ 16993e519524SHoward Hinnant return __i; 17003e519524SHoward Hinnant} 17013e519524SHoward Hinnant 17023e519524SHoward Hinnanttemplate <class _Tp> 17033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17043e519524SHoward Hinnanttypename enable_if 17053e519524SHoward Hinnant< 1706ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17073e519524SHoward Hinnant _Tp* 17083e519524SHoward Hinnant>::type 17093e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17103e519524SHoward Hinnant{ 17113e519524SHoward Hinnant return __i.base(); 17123e519524SHoward Hinnant} 17133e519524SHoward Hinnant 1714fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1715fc88dbd2SHoward Hinnant 17163e519524SHoward Hinnanttemplate <class _Tp> 17173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17183e519524SHoward Hinnanttypename enable_if 17193e519524SHoward Hinnant< 1720ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17213e519524SHoward Hinnant _Tp* 17223e519524SHoward Hinnant>::type 17233e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17243e519524SHoward Hinnant{ 17253e519524SHoward Hinnant return __i.base(); 17263e519524SHoward Hinnant} 17273e519524SHoward Hinnant 1728fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1729fc88dbd2SHoward Hinnant 17303e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17323e519524SHoward Hinnant_OutputIterator 17333e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17343e519524SHoward Hinnant{ 17353e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17363e519524SHoward Hinnant *__result = *__first; 17373e519524SHoward Hinnant return __result; 17383e519524SHoward Hinnant} 17393e519524SHoward Hinnant 17403e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17423e519524SHoward Hinnanttypename enable_if 17433e519524SHoward Hinnant< 17443e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1745ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17463e519524SHoward Hinnant _Up* 17473e519524SHoward Hinnant>::type 17483e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17493e519524SHoward Hinnant{ 17503e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1751ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17523e519524SHoward Hinnant return __result + __n; 17533e519524SHoward Hinnant} 17543e519524SHoward Hinnant 17553e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17573e519524SHoward Hinnant_OutputIterator 17583e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17593e519524SHoward Hinnant{ 1760ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17613e519524SHoward Hinnant} 17623e519524SHoward Hinnant 17633e519524SHoward Hinnant// copy_backward 17643e519524SHoward Hinnant 1765d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17673e519524SHoward Hinnant_OutputIterator 1768d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17693e519524SHoward Hinnant{ 17703e519524SHoward Hinnant while (__first != __last) 17713e519524SHoward Hinnant *--__result = *--__last; 17723e519524SHoward Hinnant return __result; 17733e519524SHoward Hinnant} 17743e519524SHoward Hinnant 17753e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17773e519524SHoward Hinnanttypename enable_if 17783e519524SHoward Hinnant< 17793e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1780ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17813e519524SHoward Hinnant _Up* 17823e519524SHoward Hinnant>::type 17833e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17843e519524SHoward Hinnant{ 17853e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17863e519524SHoward Hinnant __result -= __n; 1787ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17883e519524SHoward Hinnant return __result; 17893e519524SHoward Hinnant} 17903e519524SHoward Hinnant 17913e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17933e519524SHoward Hinnant_BidirectionalIterator2 17943e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17953e519524SHoward Hinnant _BidirectionalIterator2 __result) 17963e519524SHoward Hinnant{ 1797ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17983e519524SHoward Hinnant} 17993e519524SHoward Hinnant 18003e519524SHoward Hinnant// copy_if 18013e519524SHoward Hinnant 18023e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18043e519524SHoward Hinnant_OutputIterator 18053e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18063e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18073e519524SHoward Hinnant{ 18083e519524SHoward Hinnant for (; __first != __last; ++__first) 18093e519524SHoward Hinnant { 18103e519524SHoward Hinnant if (__pred(*__first)) 18113e519524SHoward Hinnant { 18123e519524SHoward Hinnant *__result = *__first; 18133e519524SHoward Hinnant ++__result; 18143e519524SHoward Hinnant } 18153e519524SHoward Hinnant } 18163e519524SHoward Hinnant return __result; 18173e519524SHoward Hinnant} 18183e519524SHoward Hinnant 18193e519524SHoward Hinnant// copy_n 18203e519524SHoward Hinnant 18213e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18233e519524SHoward Hinnanttypename enable_if 18243e519524SHoward Hinnant< 18253e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18263e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18273e519524SHoward Hinnant _OutputIterator 18283e519524SHoward Hinnant>::type 18293e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18303e519524SHoward Hinnant{ 183199847d2bSHoward Hinnant if (__n > 0) 183299847d2bSHoward Hinnant { 18333e519524SHoward Hinnant *__result = *__first; 183499847d2bSHoward Hinnant ++__result; 183599847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 183699847d2bSHoward Hinnant { 183799847d2bSHoward Hinnant ++__first; 183899847d2bSHoward Hinnant *__result = *__first; 183999847d2bSHoward Hinnant ++__result; 184099847d2bSHoward Hinnant } 184199847d2bSHoward Hinnant } 18423e519524SHoward Hinnant return __result; 18433e519524SHoward Hinnant} 18443e519524SHoward Hinnant 18453e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18473e519524SHoward Hinnanttypename enable_if 18483e519524SHoward Hinnant< 18493e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18503e519524SHoward Hinnant _OutputIterator 18513e519524SHoward Hinnant>::type 18523e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18533e519524SHoward Hinnant{ 1854ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18553e519524SHoward Hinnant} 18563e519524SHoward Hinnant 18573e519524SHoward Hinnant// move 18583e519524SHoward Hinnant 18593e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18613e519524SHoward Hinnant_OutputIterator 18623e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18633e519524SHoward Hinnant{ 18643e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 1865ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18663e519524SHoward Hinnant return __result; 18673e519524SHoward Hinnant} 18683e519524SHoward Hinnant 18693e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18713e519524SHoward Hinnanttypename enable_if 18723e519524SHoward Hinnant< 18733e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1874ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18753e519524SHoward Hinnant _Up* 18763e519524SHoward Hinnant>::type 18773e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18783e519524SHoward Hinnant{ 18793e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1880ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18813e519524SHoward Hinnant return __result + __n; 18823e519524SHoward Hinnant} 18833e519524SHoward Hinnant 18843e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18863e519524SHoward Hinnant_OutputIterator 18873e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18883e519524SHoward Hinnant{ 1889ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18903e519524SHoward Hinnant} 18913e519524SHoward Hinnant 18923e519524SHoward Hinnant// move_backward 18933e519524SHoward Hinnant 18943e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18963e519524SHoward Hinnant_OutputIterator 18973e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18983e519524SHoward Hinnant{ 18993e519524SHoward Hinnant while (__first != __last) 1900ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19013e519524SHoward Hinnant return __result; 19023e519524SHoward Hinnant} 19033e519524SHoward Hinnant 19043e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19063e519524SHoward Hinnanttypename enable_if 19073e519524SHoward Hinnant< 19083e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1909ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19103e519524SHoward Hinnant _Up* 19113e519524SHoward Hinnant>::type 19123e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19133e519524SHoward Hinnant{ 19143e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19153e519524SHoward Hinnant __result -= __n; 1916ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19173e519524SHoward Hinnant return __result; 19183e519524SHoward Hinnant} 19193e519524SHoward Hinnant 19203e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19223e519524SHoward Hinnant_BidirectionalIterator2 19233e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19243e519524SHoward Hinnant _BidirectionalIterator2 __result) 19253e519524SHoward Hinnant{ 1926ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19273e519524SHoward Hinnant} 19283e519524SHoward Hinnant 19293e519524SHoward Hinnant// iter_swap 19303e519524SHoward Hinnant 1931a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19323e519524SHoward Hinnant 19333e519524SHoward Hinnant// transform 19343e519524SHoward Hinnant 19353e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19373e519524SHoward Hinnant_OutputIterator 19383e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19393e519524SHoward Hinnant{ 19403e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19413e519524SHoward Hinnant *__result = __op(*__first); 19423e519524SHoward Hinnant return __result; 19433e519524SHoward Hinnant} 19443e519524SHoward Hinnant 19453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19473e519524SHoward Hinnant_OutputIterator 19483e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19493e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19503e519524SHoward Hinnant{ 19513e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 19523e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19533e519524SHoward Hinnant return __result; 19543e519524SHoward Hinnant} 19553e519524SHoward Hinnant 19563e519524SHoward Hinnant// replace 19573e519524SHoward Hinnant 19583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19603e519524SHoward Hinnantvoid 19613e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19623e519524SHoward Hinnant{ 19633e519524SHoward Hinnant for (; __first != __last; ++__first) 19643e519524SHoward Hinnant if (*__first == __old_value) 19653e519524SHoward Hinnant *__first = __new_value; 19663e519524SHoward Hinnant} 19673e519524SHoward Hinnant 19683e519524SHoward Hinnant// replace_if 19693e519524SHoward Hinnant 19703e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19723e519524SHoward Hinnantvoid 19733e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19743e519524SHoward Hinnant{ 19753e519524SHoward Hinnant for (; __first != __last; ++__first) 19763e519524SHoward Hinnant if (__pred(*__first)) 19773e519524SHoward Hinnant *__first = __new_value; 19783e519524SHoward Hinnant} 19793e519524SHoward Hinnant 19803e519524SHoward Hinnant// replace_copy 19813e519524SHoward Hinnant 19823e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19843e519524SHoward Hinnant_OutputIterator 19853e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19863e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19873e519524SHoward Hinnant{ 19883e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19893e519524SHoward Hinnant if (*__first == __old_value) 19903e519524SHoward Hinnant *__result = __new_value; 19913e519524SHoward Hinnant else 19923e519524SHoward Hinnant *__result = *__first; 19933e519524SHoward Hinnant return __result; 19943e519524SHoward Hinnant} 19953e519524SHoward Hinnant 19963e519524SHoward Hinnant// replace_copy_if 19973e519524SHoward Hinnant 19983e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 19993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20003e519524SHoward Hinnant_OutputIterator 20013e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20023e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20033e519524SHoward Hinnant{ 20043e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 20053e519524SHoward Hinnant if (__pred(*__first)) 20063e519524SHoward Hinnant *__result = __new_value; 20073e519524SHoward Hinnant else 20083e519524SHoward Hinnant *__result = *__first; 20093e519524SHoward Hinnant return __result; 20103e519524SHoward Hinnant} 20113e519524SHoward Hinnant 20123e519524SHoward Hinnant// fill_n 20133e519524SHoward Hinnant 20143e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20163e519524SHoward Hinnant_OutputIterator 20170f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20183e519524SHoward Hinnant{ 20193e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 2020e4383379SHoward Hinnant *__first = __value_; 20213e519524SHoward Hinnant return __first; 20223e519524SHoward Hinnant} 20233e519524SHoward Hinnant 20240f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20260f242beaSHoward Hinnanttypename enable_if 20270f242beaSHoward Hinnant< 20280f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20290f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20300f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20310f242beaSHoward Hinnant _Tp* 20320f242beaSHoward Hinnant>::type 20330f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20343e519524SHoward Hinnant{ 20353e519524SHoward Hinnant if (__n > 0) 2036e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20373e519524SHoward Hinnant return __first + __n; 20383e519524SHoward Hinnant} 20393e519524SHoward Hinnant 20403e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20423e519524SHoward Hinnant_OutputIterator 2043e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20443e519524SHoward Hinnant{ 20450f242beaSHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_); 20463e519524SHoward Hinnant} 20473e519524SHoward Hinnant 20483e519524SHoward Hinnant// fill 20493e519524SHoward Hinnant 20503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20523e519524SHoward Hinnantvoid 2053e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20543e519524SHoward Hinnant{ 20553e519524SHoward Hinnant for (; __first != __last; ++__first) 2056e4383379SHoward Hinnant *__first = __value_; 20573e519524SHoward Hinnant} 20583e519524SHoward Hinnant 20593e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20613e519524SHoward Hinnantvoid 2062e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20633e519524SHoward Hinnant{ 2064e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20653e519524SHoward Hinnant} 20663e519524SHoward Hinnant 20673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20693e519524SHoward Hinnantvoid 2070e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20713e519524SHoward Hinnant{ 2072e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20733e519524SHoward Hinnant} 20743e519524SHoward Hinnant 20753e519524SHoward Hinnant// generate 20763e519524SHoward Hinnant 20773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20793e519524SHoward Hinnantvoid 20803e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20813e519524SHoward Hinnant{ 20823e519524SHoward Hinnant for (; __first != __last; ++__first) 20833e519524SHoward Hinnant *__first = __gen(); 20843e519524SHoward Hinnant} 20853e519524SHoward Hinnant 20863e519524SHoward Hinnant// generate_n 20873e519524SHoward Hinnant 20883e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20903e519524SHoward Hinnant_OutputIterator 20913e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 20923e519524SHoward Hinnant{ 20933e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 20943e519524SHoward Hinnant *__first = __gen(); 20953e519524SHoward Hinnant return __first; 20963e519524SHoward Hinnant} 20973e519524SHoward Hinnant 20983e519524SHoward Hinnant// remove 20993e519524SHoward Hinnant 21003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21013e519524SHoward Hinnant_ForwardIterator 2102e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21033e519524SHoward Hinnant{ 2104e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21053e519524SHoward Hinnant if (__first != __last) 21063e519524SHoward Hinnant { 21073e519524SHoward Hinnant _ForwardIterator __i = __first; 21083e519524SHoward Hinnant while (++__i != __last) 21093e519524SHoward Hinnant { 2110e4383379SHoward Hinnant if (!(*__i == __value_)) 21113e519524SHoward Hinnant { 2112ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21133e519524SHoward Hinnant ++__first; 21143e519524SHoward Hinnant } 21153e519524SHoward Hinnant } 21163e519524SHoward Hinnant } 21173e519524SHoward Hinnant return __first; 21183e519524SHoward Hinnant} 21193e519524SHoward Hinnant 21203e519524SHoward Hinnant// remove_if 21213e519524SHoward Hinnant 21223e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21233e519524SHoward Hinnant_ForwardIterator 21243e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21253e519524SHoward Hinnant{ 2126ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21273e519524SHoward Hinnant (__first, __last, __pred); 21283e519524SHoward Hinnant if (__first != __last) 21293e519524SHoward Hinnant { 21303e519524SHoward Hinnant _ForwardIterator __i = __first; 21313e519524SHoward Hinnant while (++__i != __last) 21323e519524SHoward Hinnant { 21333e519524SHoward Hinnant if (!__pred(*__i)) 21343e519524SHoward Hinnant { 2135ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21363e519524SHoward Hinnant ++__first; 21373e519524SHoward Hinnant } 21383e519524SHoward Hinnant } 21393e519524SHoward Hinnant } 21403e519524SHoward Hinnant return __first; 21413e519524SHoward Hinnant} 21423e519524SHoward Hinnant 21433e519524SHoward Hinnant// remove_copy 21443e519524SHoward Hinnant 21453e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21473e519524SHoward Hinnant_OutputIterator 2148e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21493e519524SHoward Hinnant{ 21503e519524SHoward Hinnant for (; __first != __last; ++__first) 21513e519524SHoward Hinnant { 2152e4383379SHoward Hinnant if (!(*__first == __value_)) 21533e519524SHoward Hinnant { 21543e519524SHoward Hinnant *__result = *__first; 21553e519524SHoward Hinnant ++__result; 21563e519524SHoward Hinnant } 21573e519524SHoward Hinnant } 21583e519524SHoward Hinnant return __result; 21593e519524SHoward Hinnant} 21603e519524SHoward Hinnant 21613e519524SHoward Hinnant// remove_copy_if 21623e519524SHoward Hinnant 21633e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21653e519524SHoward Hinnant_OutputIterator 21663e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21673e519524SHoward Hinnant{ 21683e519524SHoward Hinnant for (; __first != __last; ++__first) 21693e519524SHoward Hinnant { 21703e519524SHoward Hinnant if (!__pred(*__first)) 21713e519524SHoward Hinnant { 21723e519524SHoward Hinnant *__result = *__first; 21733e519524SHoward Hinnant ++__result; 21743e519524SHoward Hinnant } 21753e519524SHoward Hinnant } 21763e519524SHoward Hinnant return __result; 21773e519524SHoward Hinnant} 21783e519524SHoward Hinnant 21793e519524SHoward Hinnant// unique 21803e519524SHoward Hinnant 21813e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21823e519524SHoward Hinnant_ForwardIterator 21833e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21843e519524SHoward Hinnant{ 2185ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21863e519524SHoward Hinnant (__first, __last, __pred); 21873e519524SHoward Hinnant if (__first != __last) 21883e519524SHoward Hinnant { 21893e519524SHoward Hinnant // ... a a ? ... 21903e519524SHoward Hinnant // f i 21913e519524SHoward Hinnant _ForwardIterator __i = __first; 21923e519524SHoward Hinnant for (++__i; ++__i != __last;) 21933e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2194ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21953e519524SHoward Hinnant ++__first; 21963e519524SHoward Hinnant } 21973e519524SHoward Hinnant return __first; 21983e519524SHoward Hinnant} 21993e519524SHoward Hinnant 22003e519524SHoward Hinnanttemplate <class _ForwardIterator> 22013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22023e519524SHoward Hinnant_ForwardIterator 22033e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22043e519524SHoward Hinnant{ 22053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2206ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22073e519524SHoward Hinnant} 22083e519524SHoward Hinnant 22093e519524SHoward Hinnant// unique_copy 22103e519524SHoward Hinnant 22113e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22123e519524SHoward Hinnant_OutputIterator 22133e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22143e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22153e519524SHoward Hinnant{ 22163e519524SHoward Hinnant if (__first != __last) 22173e519524SHoward Hinnant { 22183e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22193e519524SHoward Hinnant *__result = __t; 22203e519524SHoward Hinnant ++__result; 22213e519524SHoward Hinnant while (++__first != __last) 22223e519524SHoward Hinnant { 22233e519524SHoward Hinnant if (!__pred(__t, *__first)) 22243e519524SHoward Hinnant { 22253e519524SHoward Hinnant __t = *__first; 22263e519524SHoward Hinnant *__result = __t; 22273e519524SHoward Hinnant ++__result; 22283e519524SHoward Hinnant } 22293e519524SHoward Hinnant } 22303e519524SHoward Hinnant } 22313e519524SHoward Hinnant return __result; 22323e519524SHoward Hinnant} 22333e519524SHoward Hinnant 22343e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22353e519524SHoward Hinnant_OutputIterator 22363e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22373e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22383e519524SHoward Hinnant{ 22393e519524SHoward Hinnant if (__first != __last) 22403e519524SHoward Hinnant { 22413e519524SHoward Hinnant _ForwardIterator __i = __first; 22423e519524SHoward Hinnant *__result = *__i; 22433e519524SHoward Hinnant ++__result; 22443e519524SHoward Hinnant while (++__first != __last) 22453e519524SHoward Hinnant { 22463e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22473e519524SHoward Hinnant { 22483e519524SHoward Hinnant *__result = *__first; 22493e519524SHoward Hinnant ++__result; 22503e519524SHoward Hinnant __i = __first; 22513e519524SHoward Hinnant } 22523e519524SHoward Hinnant } 22533e519524SHoward Hinnant } 22543e519524SHoward Hinnant return __result; 22553e519524SHoward Hinnant} 22563e519524SHoward Hinnant 22573e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22583e519524SHoward Hinnant_ForwardIterator 22593e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22603e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22613e519524SHoward Hinnant{ 22623e519524SHoward Hinnant if (__first != __last) 22633e519524SHoward Hinnant { 22643e519524SHoward Hinnant *__result = *__first; 22653e519524SHoward Hinnant while (++__first != __last) 22663e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22673e519524SHoward Hinnant *++__result = *__first; 22683e519524SHoward Hinnant ++__result; 22693e519524SHoward Hinnant } 22703e519524SHoward Hinnant return __result; 22713e519524SHoward Hinnant} 22723e519524SHoward Hinnant 22733e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22753e519524SHoward Hinnant_OutputIterator 22763e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22773e519524SHoward Hinnant{ 2278ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22793e519524SHoward Hinnant (__first, __last, __result, __pred, 22803e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22813e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22823e519524SHoward Hinnant} 22833e519524SHoward Hinnant 22843e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22863e519524SHoward Hinnant_OutputIterator 22873e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22883e519524SHoward Hinnant{ 22893e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2290ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22913e519524SHoward Hinnant} 22923e519524SHoward Hinnant 22933e519524SHoward Hinnant// reverse 22943e519524SHoward Hinnant 22953e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22973e519524SHoward Hinnantvoid 22983e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22993e519524SHoward Hinnant{ 23003e519524SHoward Hinnant while (__first != __last) 23013e519524SHoward Hinnant { 23023e519524SHoward Hinnant if (__first == --__last) 23033e519524SHoward Hinnant break; 23043e519524SHoward Hinnant swap(*__first, *__last); 23053e519524SHoward Hinnant ++__first; 23063e519524SHoward Hinnant } 23073e519524SHoward Hinnant} 23083e519524SHoward Hinnant 23093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23113e519524SHoward Hinnantvoid 23123e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23133e519524SHoward Hinnant{ 23143e519524SHoward Hinnant if (__first != __last) 23153e519524SHoward Hinnant for (; __first < --__last; ++__first) 23163e519524SHoward Hinnant swap(*__first, *__last); 23173e519524SHoward Hinnant} 23183e519524SHoward Hinnant 23193e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23213e519524SHoward Hinnantvoid 23223e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23233e519524SHoward Hinnant{ 2324ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23253e519524SHoward Hinnant} 23263e519524SHoward Hinnant 23273e519524SHoward Hinnant// reverse_copy 23283e519524SHoward Hinnant 23293e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23313e519524SHoward Hinnant_OutputIterator 23323e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23333e519524SHoward Hinnant{ 23343e519524SHoward Hinnant for (; __first != __last; ++__result) 23353e519524SHoward Hinnant *__result = *--__last; 23363e519524SHoward Hinnant return __result; 23373e519524SHoward Hinnant} 23383e519524SHoward Hinnant 23393e519524SHoward Hinnant// rotate 23403e519524SHoward Hinnant 23413e519524SHoward Hinnanttemplate <class _ForwardIterator> 23423e519524SHoward Hinnant_ForwardIterator 2343aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23443e519524SHoward Hinnant{ 2345aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2346aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2347aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2348aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2349aca09de3SHoward Hinnant return __lm1; 2350aca09de3SHoward Hinnant} 2351aca09de3SHoward Hinnant 2352aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2353aca09de3SHoward Hinnant_BidirectionalIterator 2354aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2355aca09de3SHoward Hinnant{ 2356aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2357aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2358aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2359aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2360aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2361aca09de3SHoward Hinnant return __fp1; 2362aca09de3SHoward Hinnant} 2363aca09de3SHoward Hinnant 2364aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2365aca09de3SHoward Hinnant_ForwardIterator 2366aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2367aca09de3SHoward Hinnant{ 23683e519524SHoward Hinnant _ForwardIterator __i = __middle; 23693e519524SHoward Hinnant while (true) 23703e519524SHoward Hinnant { 23713e519524SHoward Hinnant swap(*__first, *__i); 23723e519524SHoward Hinnant ++__first; 23733e519524SHoward Hinnant if (++__i == __last) 23743e519524SHoward Hinnant break; 23753e519524SHoward Hinnant if (__first == __middle) 23763e519524SHoward Hinnant __middle = __i; 23773e519524SHoward Hinnant } 23783e519524SHoward Hinnant _ForwardIterator __r = __first; 23793e519524SHoward Hinnant if (__first != __middle) 23803e519524SHoward Hinnant { 23813e519524SHoward Hinnant __i = __middle; 23823e519524SHoward Hinnant while (true) 23833e519524SHoward Hinnant { 23843e519524SHoward Hinnant swap(*__first, *__i); 23853e519524SHoward Hinnant ++__first; 23863e519524SHoward Hinnant if (++__i == __last) 23873e519524SHoward Hinnant { 23883e519524SHoward Hinnant if (__first == __middle) 23893e519524SHoward Hinnant break; 23903e519524SHoward Hinnant __i = __middle; 23913e519524SHoward Hinnant } 23923e519524SHoward Hinnant else if (__first == __middle) 23933e519524SHoward Hinnant __middle = __i; 23943e519524SHoward Hinnant } 23953e519524SHoward Hinnant } 23963e519524SHoward Hinnant return __r; 23973e519524SHoward Hinnant} 23983e519524SHoward Hinnant 23993e519524SHoward Hinnanttemplate<typename _Integral> 24003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24013e519524SHoward Hinnant_Integral 24023e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 24033e519524SHoward Hinnant{ 24043e519524SHoward Hinnant do 24053e519524SHoward Hinnant { 24063e519524SHoward Hinnant _Integral __t = __x % __y; 24073e519524SHoward Hinnant __x = __y; 24083e519524SHoward Hinnant __y = __t; 24093e519524SHoward Hinnant } while (__y); 24103e519524SHoward Hinnant return __x; 24113e519524SHoward Hinnant} 24123e519524SHoward Hinnant 24133e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24143e519524SHoward Hinnant_RandomAccessIterator 2415aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24163e519524SHoward Hinnant{ 24173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24193e519524SHoward Hinnant 24203e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24213e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24223e519524SHoward Hinnant if (__m1 == __m2) 24233e519524SHoward Hinnant { 2424ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24253e519524SHoward Hinnant return __middle; 24263e519524SHoward Hinnant } 2427aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24283e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24293e519524SHoward Hinnant { 2430aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24313e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24323e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24333e519524SHoward Hinnant do 24343e519524SHoward Hinnant { 2435aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24363e519524SHoward Hinnant __p1 = __p2; 24373e519524SHoward Hinnant const difference_type __d = __last - __p2; 24383e519524SHoward Hinnant if (__m1 < __d) 24393e519524SHoward Hinnant __p2 += __m1; 24403e519524SHoward Hinnant else 24413e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24423e519524SHoward Hinnant } while (__p2 != __p); 2443aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24443e519524SHoward Hinnant } 24453e519524SHoward Hinnant return __first + __m2; 24463e519524SHoward Hinnant} 24473e519524SHoward Hinnant 24483e519524SHoward Hinnanttemplate <class _ForwardIterator> 24493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24503e519524SHoward Hinnant_ForwardIterator 2451aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2452aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2453aca09de3SHoward Hinnant{ 2454aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2455aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2456aca09de3SHoward Hinnant { 2457aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2458aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2459aca09de3SHoward Hinnant } 2460aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2461aca09de3SHoward Hinnant} 2462aca09de3SHoward Hinnant 2463aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2464aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2465aca09de3SHoward Hinnant_BidirectionalIterator 2466aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2467aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2468aca09de3SHoward Hinnant{ 2469aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2470aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2471aca09de3SHoward Hinnant { 2472aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2473aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2474aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2475aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2476aca09de3SHoward Hinnant } 2477aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2478aca09de3SHoward Hinnant} 2479aca09de3SHoward Hinnant 2480aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2481aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2482aca09de3SHoward Hinnant_RandomAccessIterator 2483aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2484aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2485aca09de3SHoward Hinnant{ 2486aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2487aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2488aca09de3SHoward Hinnant { 2489aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2490aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2491aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2492aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2493aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2494aca09de3SHoward Hinnant } 2495aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2496aca09de3SHoward Hinnant} 2497aca09de3SHoward Hinnant 2498aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2499aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2500aca09de3SHoward Hinnant_ForwardIterator 25013e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25023e519524SHoward Hinnant{ 2503aca09de3SHoward Hinnant if (__first == __middle) 2504aca09de3SHoward Hinnant return __last; 2505aca09de3SHoward Hinnant if (__middle == __last) 2506aca09de3SHoward Hinnant return __first; 2507ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2508aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25093e519524SHoward Hinnant} 25103e519524SHoward Hinnant 25113e519524SHoward Hinnant// rotate_copy 25123e519524SHoward Hinnant 25133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25153e519524SHoward Hinnant_OutputIterator 25163e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25173e519524SHoward Hinnant{ 2518ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25193e519524SHoward Hinnant} 25203e519524SHoward Hinnant 25213e519524SHoward Hinnant// min_element 25223e519524SHoward Hinnant 25233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 2524*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25253e519524SHoward Hinnant_ForwardIterator 2526*9d67c6d5SMarshall Clow__min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25273e519524SHoward Hinnant{ 25283e519524SHoward Hinnant if (__first != __last) 25293e519524SHoward Hinnant { 25303e519524SHoward Hinnant _ForwardIterator __i = __first; 25313e519524SHoward Hinnant while (++__i != __last) 25323e519524SHoward Hinnant if (__comp(*__i, *__first)) 25333e519524SHoward Hinnant __first = __i; 25343e519524SHoward Hinnant } 25353e519524SHoward Hinnant return __first; 25363e519524SHoward Hinnant} 25373e519524SHoward Hinnant 2538*9d67c6d5SMarshall Clowtemplate <class _ForwardIterator, class _Compare> 2539*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 2540*9d67c6d5SMarshall Clow_ForwardIterator 2541*9d67c6d5SMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 2542*9d67c6d5SMarshall Clow{ 2543*9d67c6d5SMarshall Clow return __min_element(__first, __last, __comp); 2544*9d67c6d5SMarshall Clow} 2545*9d67c6d5SMarshall Clow 25463e519524SHoward Hinnanttemplate <class _ForwardIterator> 25473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25483e519524SHoward Hinnant_ForwardIterator 25493e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25503e519524SHoward Hinnant{ 2551*9d67c6d5SMarshall Clow return __min_element(__first, __last, 25524eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25534eb27b79SHoward Hinnant} 25544eb27b79SHoward Hinnant 25554eb27b79SHoward Hinnant// min 25564eb27b79SHoward Hinnant 25574eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 2558*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25594eb27b79SHoward Hinnantconst _Tp& 25604eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25614eb27b79SHoward Hinnant{ 25624eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25634eb27b79SHoward Hinnant} 25644eb27b79SHoward Hinnant 25654eb27b79SHoward Hinnanttemplate <class _Tp> 2566*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25674eb27b79SHoward Hinnantconst _Tp& 25684eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25694eb27b79SHoward Hinnant{ 2570ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25714eb27b79SHoward Hinnant} 25724eb27b79SHoward Hinnant 257354976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 257454976f26SHoward Hinnant 25754eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 2576*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25774eb27b79SHoward Hinnant_Tp 25784eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25794eb27b79SHoward Hinnant{ 2580*9d67c6d5SMarshall Clow return *__min_element(__t.begin(), __t.end(), __comp); 25814eb27b79SHoward Hinnant} 25824eb27b79SHoward Hinnant 25834eb27b79SHoward Hinnanttemplate<class _Tp> 2584*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25854eb27b79SHoward Hinnant_Tp 25864eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25874eb27b79SHoward Hinnant{ 2588*9d67c6d5SMarshall Clow return *__min_element(__t.begin(), __t.end(), __less<_Tp>()); 25893e519524SHoward Hinnant} 25903e519524SHoward Hinnant 259154976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 259254976f26SHoward Hinnant 25933e519524SHoward Hinnant// max_element 25943e519524SHoward Hinnant 25953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 2596*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25973e519524SHoward Hinnant_ForwardIterator 2598*9d67c6d5SMarshall Clow__max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25993e519524SHoward Hinnant{ 26003e519524SHoward Hinnant if (__first != __last) 26013e519524SHoward Hinnant { 26023e519524SHoward Hinnant _ForwardIterator __i = __first; 26033e519524SHoward Hinnant while (++__i != __last) 26043e519524SHoward Hinnant if (__comp(*__first, *__i)) 26053e519524SHoward Hinnant __first = __i; 26063e519524SHoward Hinnant } 26073e519524SHoward Hinnant return __first; 26083e519524SHoward Hinnant} 26093e519524SHoward Hinnant 2610*9d67c6d5SMarshall Clow 2611*9d67c6d5SMarshall Clowtemplate <class _ForwardIterator, class _Compare> 2612*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 2613*9d67c6d5SMarshall Clow_ForwardIterator 2614*9d67c6d5SMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 2615*9d67c6d5SMarshall Clow{ 2616*9d67c6d5SMarshall Clow return __max_element(__first, __last, __comp); 2617*9d67c6d5SMarshall Clow} 2618*9d67c6d5SMarshall Clow 26193e519524SHoward Hinnanttemplate <class _ForwardIterator> 26203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26213e519524SHoward Hinnant_ForwardIterator 26223e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26233e519524SHoward Hinnant{ 2624*9d67c6d5SMarshall Clow return __max_element(__first, __last, 26254eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26264eb27b79SHoward Hinnant} 26274eb27b79SHoward Hinnant 26284eb27b79SHoward Hinnant// max 26294eb27b79SHoward Hinnant 26304eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 2631*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26324eb27b79SHoward Hinnantconst _Tp& 26334eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26344eb27b79SHoward Hinnant{ 26354eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26364eb27b79SHoward Hinnant} 26374eb27b79SHoward Hinnant 26384eb27b79SHoward Hinnanttemplate <class _Tp> 2639*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26404eb27b79SHoward Hinnantconst _Tp& 26414eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26424eb27b79SHoward Hinnant{ 2643ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26444eb27b79SHoward Hinnant} 26454eb27b79SHoward Hinnant 264654976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 264754976f26SHoward Hinnant 26484eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 2649*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26504eb27b79SHoward Hinnant_Tp 26514eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26524eb27b79SHoward Hinnant{ 2653*9d67c6d5SMarshall Clow return *__max_element(__t.begin(), __t.end(), __comp); 26544eb27b79SHoward Hinnant} 26554eb27b79SHoward Hinnant 26564eb27b79SHoward Hinnanttemplate<class _Tp> 2657*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26584eb27b79SHoward Hinnant_Tp 26594eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26604eb27b79SHoward Hinnant{ 2661*9d67c6d5SMarshall Clow return *__max_element(__t.begin(), __t.end(), __less<_Tp>()); 26623e519524SHoward Hinnant} 26633e519524SHoward Hinnant 266454976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 266554976f26SHoward Hinnant 26663e519524SHoward Hinnant// minmax_element 26673e519524SHoward Hinnant 26683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26693e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26703e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26713e519524SHoward Hinnant{ 26723e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26733e519524SHoward Hinnant if (__first != __last) 26743e519524SHoward Hinnant { 26753e519524SHoward Hinnant if (++__first != __last) 26763e519524SHoward Hinnant { 26773e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26783e519524SHoward Hinnant __result.first = __first; 26793e519524SHoward Hinnant else 26803e519524SHoward Hinnant __result.second = __first; 26813e519524SHoward Hinnant while (++__first != __last) 26823e519524SHoward Hinnant { 26833e519524SHoward Hinnant _ForwardIterator __i = __first; 26843e519524SHoward Hinnant if (++__first == __last) 26853e519524SHoward Hinnant { 26863e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26873e519524SHoward Hinnant __result.first = __i; 26883e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26893e519524SHoward Hinnant __result.second = __i; 26903e519524SHoward Hinnant break; 26913e519524SHoward Hinnant } 26923e519524SHoward Hinnant else 26933e519524SHoward Hinnant { 26943e519524SHoward Hinnant if (__comp(*__first, *__i)) 26953e519524SHoward Hinnant { 26963e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26973e519524SHoward Hinnant __result.first = __first; 26983e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26993e519524SHoward Hinnant __result.second = __i; 27003e519524SHoward Hinnant } 27013e519524SHoward Hinnant else 27023e519524SHoward Hinnant { 27033e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27043e519524SHoward Hinnant __result.first = __i; 27053e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27063e519524SHoward Hinnant __result.second = __first; 27073e519524SHoward Hinnant } 27083e519524SHoward Hinnant } 27093e519524SHoward Hinnant } 27103e519524SHoward Hinnant } 27113e519524SHoward Hinnant } 27123e519524SHoward Hinnant return __result; 27133e519524SHoward Hinnant} 27143e519524SHoward Hinnant 27153e519524SHoward Hinnanttemplate <class _ForwardIterator> 27163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27173e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27183e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27193e519524SHoward Hinnant{ 2720*9d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 2721*9d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27223e519524SHoward Hinnant} 27233e519524SHoward Hinnant 27244eb27b79SHoward Hinnant// minmax 27254eb27b79SHoward Hinnant 27264eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 2727*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27284eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27294eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27304eb27b79SHoward Hinnant{ 27314eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27324eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27334eb27b79SHoward Hinnant} 27344eb27b79SHoward Hinnant 27354eb27b79SHoward Hinnanttemplate<class _Tp> 2736*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27374eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27384eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27394eb27b79SHoward Hinnant{ 2740ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27414eb27b79SHoward Hinnant} 27424eb27b79SHoward Hinnant 274354976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 274454976f26SHoward Hinnant 27454eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 2746*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27474eb27b79SHoward Hinnantpair<_Tp, _Tp> 27484eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27494eb27b79SHoward Hinnant{ 2750*9d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 2751*9d67c6d5SMarshall Clow _Iter __first = __t.begin(); 2752*9d67c6d5SMarshall Clow _Iter __last = __t.end(); 2753*9d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result ( *__first, *__first ); 2754*9d67c6d5SMarshall Clow 2755*9d67c6d5SMarshall Clow ++__first; 2756*9d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 2757*9d67c6d5SMarshall Clow { 2758*9d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 2759*9d67c6d5SMarshall Clow __result.first = *__first; 2760*9d67c6d5SMarshall Clow else 2761*9d67c6d5SMarshall Clow __result.second = *__first; 2762*9d67c6d5SMarshall Clow ++__first; 2763*9d67c6d5SMarshall Clow } 2764*9d67c6d5SMarshall Clow 2765*9d67c6d5SMarshall Clow while (__first != __last) 2766*9d67c6d5SMarshall Clow { 2767*9d67c6d5SMarshall Clow _Tp __prev = *__first++; 2768*9d67c6d5SMarshall Clow if (__comp(__prev, *__first)) { 2769*9d67c6d5SMarshall Clow if (__comp(__prev, __result.first)) __result.first = __prev; 2770*9d67c6d5SMarshall Clow if (__comp(__result.second, *__first)) __result.second = *__first; 2771*9d67c6d5SMarshall Clow } 2772*9d67c6d5SMarshall Clow else { 2773*9d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) __result.first = *__first; 2774*9d67c6d5SMarshall Clow if (__comp(__result.second, __prev)) __result.second = __prev; 2775*9d67c6d5SMarshall Clow } 2776*9d67c6d5SMarshall Clow 2777*9d67c6d5SMarshall Clow __first++; 2778*9d67c6d5SMarshall Clow } 2779*9d67c6d5SMarshall Clow return __result; 2780*9d67c6d5SMarshall Clow} 2781*9d67c6d5SMarshall Clow 2782*9d67c6d5SMarshall Clowtemplate<class _Tp> 2783*9d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2784*9d67c6d5SMarshall Clowpair<_Tp, _Tp> 2785*9d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 2786*9d67c6d5SMarshall Clow{ 2787*9d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 27884eb27b79SHoward Hinnant} 27894eb27b79SHoward Hinnant 279054976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 279154976f26SHoward Hinnant 27923e519524SHoward Hinnant// random_shuffle 27933e519524SHoward Hinnant 2794f9d540b0SHoward Hinnant// __independent_bits_engine 2795f9d540b0SHoward Hinnant 2796c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2797f9d540b0SHoward Hinnantstruct __log2_imp 27983e519524SHoward Hinnant{ 2799c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2800c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28013e519524SHoward Hinnant}; 28023e519524SHoward Hinnant 2803c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2804c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28053e519524SHoward Hinnant{ 2806f9d540b0SHoward Hinnant static const size_t value = 0; 28073e519524SHoward Hinnant}; 28083e519524SHoward Hinnant 2809c003db1fSHoward Hinnanttemplate <size_t _Rp> 2810c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28113e519524SHoward Hinnant{ 2812c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28133e519524SHoward Hinnant}; 28143e519524SHoward Hinnant 2815c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2816f9d540b0SHoward Hinnantstruct __log2 28173e519524SHoward Hinnant{ 2818c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2819f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 28203e519524SHoward Hinnant}; 28213e519524SHoward Hinnant 2822f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2823f9d540b0SHoward Hinnantclass __independent_bits_engine 28243e519524SHoward Hinnant{ 2825f9d540b0SHoward Hinnantpublic: 2826f9d540b0SHoward Hinnant // types 2827f9d540b0SHoward Hinnant typedef _UIntType result_type; 2828f9d540b0SHoward Hinnant 2829f9d540b0SHoward Hinnantprivate: 2830f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2831f9d540b0SHoward Hinnant typedef typename conditional 2832f9d540b0SHoward Hinnant < 2833f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2834f9d540b0SHoward Hinnant result_type, 2835f9d540b0SHoward Hinnant _Engine_result_type 2836f9d540b0SHoward Hinnant >::type _Working_result_type; 2837f9d540b0SHoward Hinnant 2838f9d540b0SHoward Hinnant _Engine& __e_; 2839f9d540b0SHoward Hinnant size_t __w_; 2840f9d540b0SHoward Hinnant size_t __w0_; 2841f9d540b0SHoward Hinnant size_t __n_; 2842f9d540b0SHoward Hinnant size_t __n0_; 2843f9d540b0SHoward Hinnant _Working_result_type __y0_; 2844f9d540b0SHoward Hinnant _Working_result_type __y1_; 2845f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2846f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2847f9d540b0SHoward Hinnant 2848e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2849c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2850f9d540b0SHoward Hinnant + _Working_result_type(1); 2851e386b7b3SHoward Hinnant#else 2852e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2853e386b7b3SHoward Hinnant + _Working_result_type(1); 2854e386b7b3SHoward Hinnant#endif 2855e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2856e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2857e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2858f9d540b0SHoward Hinnant 2859f9d540b0SHoward Hinnantpublic: 2860f9d540b0SHoward Hinnant // constructors and seeding functions 2861f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2862f9d540b0SHoward Hinnant 2863f9d540b0SHoward Hinnant // generating functions 2864c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2865f9d540b0SHoward Hinnant 2866f9d540b0SHoward Hinnantprivate: 2867f9d540b0SHoward Hinnant result_type __eval(false_type); 2868f9d540b0SHoward Hinnant result_type __eval(true_type); 2869f9d540b0SHoward Hinnant}; 2870f9d540b0SHoward Hinnant 2871f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2872f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2873f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2874f9d540b0SHoward Hinnant : __e_(__e), 2875f9d540b0SHoward Hinnant __w_(__w) 2876f9d540b0SHoward Hinnant{ 2877f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2878f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2879c003db1fSHoward Hinnant if (_Rp == 0) 2880c003db1fSHoward Hinnant __y0_ = _Rp; 2881f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2882c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2883f9d540b0SHoward Hinnant else 2884f9d540b0SHoward Hinnant __y0_ = 0; 2885c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2886f9d540b0SHoward Hinnant { 2887f9d540b0SHoward Hinnant ++__n_; 2888f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2889f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2890c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2891f9d540b0SHoward Hinnant else 2892f9d540b0SHoward Hinnant __y0_ = 0; 2893f9d540b0SHoward Hinnant } 2894f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2895f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2896c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2897f9d540b0SHoward Hinnant else 2898f9d540b0SHoward Hinnant __y1_ = 0; 2899f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2900f9d540b0SHoward Hinnant _Engine_result_type(0); 2901f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2902f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2903f9d540b0SHoward Hinnant _Engine_result_type(~0); 29043e519524SHoward Hinnant} 29053e519524SHoward Hinnant 2906f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2907f9d540b0SHoward Hinnantinline 2908f9d540b0SHoward Hinnant_UIntType 2909f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29103e519524SHoward Hinnant{ 2911f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29123e519524SHoward Hinnant} 29133e519524SHoward Hinnant 2914f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2915f9d540b0SHoward Hinnant_UIntType 2916f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29173e519524SHoward Hinnant{ 2918c003db1fSHoward Hinnant result_type _Sp = 0; 2919f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2920f9d540b0SHoward Hinnant { 2921f9d540b0SHoward Hinnant _Engine_result_type __u; 29223e519524SHoward Hinnant do 2923f9d540b0SHoward Hinnant { 2924f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2925f9d540b0SHoward Hinnant } while (__u >= __y0_); 29260176bc6cSHoward Hinnant if (__w0_ < _WDt) 2927c003db1fSHoward Hinnant _Sp <<= __w0_; 2928f9d540b0SHoward Hinnant else 2929c003db1fSHoward Hinnant _Sp = 0; 2930c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2931f9d540b0SHoward Hinnant } 2932f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2933f9d540b0SHoward Hinnant { 2934f9d540b0SHoward Hinnant _Engine_result_type __u; 2935f9d540b0SHoward Hinnant do 2936f9d540b0SHoward Hinnant { 2937f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2938f9d540b0SHoward Hinnant } while (__u >= __y1_); 29390176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2940c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2941f9d540b0SHoward Hinnant else 2942c003db1fSHoward Hinnant _Sp = 0; 2943c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2944f9d540b0SHoward Hinnant } 2945c003db1fSHoward Hinnant return _Sp; 29463e519524SHoward Hinnant} 29473e519524SHoward Hinnant 2948f9d540b0SHoward Hinnant// uniform_int_distribution 29493e519524SHoward Hinnant 2950f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2951f9d540b0SHoward Hinnantclass uniform_int_distribution 29523e519524SHoward Hinnant{ 2953f9d540b0SHoward Hinnantpublic: 2954f9d540b0SHoward Hinnant // types 2955f9d540b0SHoward Hinnant typedef _IntType result_type; 2956f9d540b0SHoward Hinnant 2957f9d540b0SHoward Hinnant class param_type 2958f9d540b0SHoward Hinnant { 2959f9d540b0SHoward Hinnant result_type __a_; 2960f9d540b0SHoward Hinnant result_type __b_; 2961f9d540b0SHoward Hinnant public: 2962f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2963f9d540b0SHoward Hinnant 2964f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2965f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2966f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2967f9d540b0SHoward Hinnant 2968f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2969f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2970f9d540b0SHoward Hinnant 2971f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2972f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2973f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2974f9d540b0SHoward Hinnant {return !(__x == __y);} 29753e519524SHoward Hinnant }; 29763e519524SHoward Hinnant 2977f9d540b0SHoward Hinnantprivate: 2978f9d540b0SHoward Hinnant param_type __p_; 29793e519524SHoward Hinnant 2980f9d540b0SHoward Hinnantpublic: 2981f9d540b0SHoward Hinnant // constructors and reset functions 2982f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2983f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2984f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2985f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2986f9d540b0SHoward Hinnant void reset() {} 2987f9d540b0SHoward Hinnant 2988f9d540b0SHoward Hinnant // generating functions 2989f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2990f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2991f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2992f9d540b0SHoward Hinnant 2993f9d540b0SHoward Hinnant // property functions 2994f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2995f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2996f9d540b0SHoward Hinnant 2997f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2998f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2999f9d540b0SHoward Hinnant 3000f9d540b0SHoward Hinnant result_type min() const {return a();} 3001f9d540b0SHoward Hinnant result_type max() const {return b();} 3002f9d540b0SHoward Hinnant 3003f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3004f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3005f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3006f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3007f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3008f9d540b0SHoward Hinnant {return !(__x == __y);} 30093e519524SHoward Hinnant}; 30103e519524SHoward Hinnant 3011f9d540b0SHoward Hinnanttemplate<class _IntType> 3012f9d540b0SHoward Hinnanttemplate<class _URNG> 3013f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3014f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30153e519524SHoward Hinnant{ 3016f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3017f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3018c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3019c003db1fSHoward Hinnant if (_Rp == 1) 3020f9d540b0SHoward Hinnant return __p.a(); 3021f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3022f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3023c003db1fSHoward Hinnant if (_Rp == 0) 3024f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3025c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3026c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 3027f9d540b0SHoward Hinnant ++__w; 3028f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3029f9d540b0SHoward Hinnant _UIntType __u; 3030f9d540b0SHoward Hinnant do 30313e519524SHoward Hinnant { 3032f9d540b0SHoward Hinnant __u = __e(); 3033c003db1fSHoward Hinnant } while (__u >= _Rp); 3034f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30353e519524SHoward Hinnant} 3036f9d540b0SHoward Hinnant 3037f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3038f9d540b0SHoward Hinnant 3039f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3040f9d540b0SHoward Hinnant 3041f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30423e519524SHoward Hinnant{ 3043f9d540b0SHoward Hinnant static unsigned __c_; 3044f9d540b0SHoward Hinnant 3045f9d540b0SHoward Hinnant __rs_default(); 3046f9d540b0SHoward Hinnantpublic: 3047b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3048f9d540b0SHoward Hinnant 3049f9d540b0SHoward Hinnant static const result_type _Min = 0; 3050f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3051f9d540b0SHoward Hinnant 3052f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3053f9d540b0SHoward Hinnant ~__rs_default(); 3054f9d540b0SHoward Hinnant 3055f9d540b0SHoward Hinnant result_type operator()(); 3056f9d540b0SHoward Hinnant 3057788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3058788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3059f9d540b0SHoward Hinnant 3060f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3061f9d540b0SHoward Hinnant}; 3062f9d540b0SHoward Hinnant 3063f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30643e519524SHoward Hinnant 30653e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30663e519524SHoward Hinnantvoid 30673e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30683e519524SHoward Hinnant{ 30693e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3070c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3071c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30723e519524SHoward Hinnant difference_type __d = __last - __first; 30733e519524SHoward Hinnant if (__d > 1) 30743e519524SHoward Hinnant { 3075c003db1fSHoward Hinnant _Dp __uid; 3076f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3077f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3078007b26beSHoward Hinnant { 3079c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3080007b26beSHoward Hinnant if (__i != difference_type(0)) 3081007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3082007b26beSHoward Hinnant } 30833e519524SHoward Hinnant } 30843e519524SHoward Hinnant} 30853e519524SHoward Hinnant 30863e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 30873e519524SHoward Hinnantvoid 30883e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 30897609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 30903e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30913e519524SHoward Hinnant#else 30923e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30933e519524SHoward Hinnant#endif 30943e519524SHoward Hinnant{ 30953e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30963e519524SHoward Hinnant difference_type __d = __last - __first; 30973e519524SHoward Hinnant if (__d > 1) 30983e519524SHoward Hinnant { 30993e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3100007b26beSHoward Hinnant { 3101007b26beSHoward Hinnant difference_type __i = __rand(__d); 3102007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3103007b26beSHoward Hinnant } 31043e519524SHoward Hinnant } 31053e519524SHoward Hinnant} 31063e519524SHoward Hinnant 3107f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3108f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3109fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3110fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3111fb340102SHoward Hinnant#else 3112f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3113fb340102SHoward Hinnant#endif 3114f9d540b0SHoward Hinnant{ 3115f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3116c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3117c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3118f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3119f9d540b0SHoward Hinnant if (__d > 1) 3120f9d540b0SHoward Hinnant { 3121c003db1fSHoward Hinnant _Dp __uid; 3122f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3123007b26beSHoward Hinnant { 3124c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3125007b26beSHoward Hinnant if (__i != difference_type(0)) 3126007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3127007b26beSHoward Hinnant } 3128f9d540b0SHoward Hinnant } 3129f9d540b0SHoward Hinnant} 3130f9d540b0SHoward Hinnant 31313e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 31323e519524SHoward Hinnantbool 31333e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31343e519524SHoward Hinnant{ 31353e519524SHoward Hinnant for (; __first != __last; ++__first) 31363e519524SHoward Hinnant if (!__pred(*__first)) 31373e519524SHoward Hinnant break; 31383e519524SHoward Hinnant for (; __first != __last; ++__first) 31393e519524SHoward Hinnant if (__pred(*__first)) 31403e519524SHoward Hinnant return false; 31413e519524SHoward Hinnant return true; 31423e519524SHoward Hinnant} 31433e519524SHoward Hinnant 31443e519524SHoward Hinnant// partition 31453e519524SHoward Hinnant 31463e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31473e519524SHoward Hinnant_ForwardIterator 31483e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31493e519524SHoward Hinnant{ 31503e519524SHoward Hinnant while (true) 31513e519524SHoward Hinnant { 31523e519524SHoward Hinnant if (__first == __last) 31533e519524SHoward Hinnant return __first; 31543e519524SHoward Hinnant if (!__pred(*__first)) 31553e519524SHoward Hinnant break; 31563e519524SHoward Hinnant ++__first; 31573e519524SHoward Hinnant } 31583e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31593e519524SHoward Hinnant { 31603e519524SHoward Hinnant if (__pred(*__p)) 31613e519524SHoward Hinnant { 31623e519524SHoward Hinnant swap(*__first, *__p); 31633e519524SHoward Hinnant ++__first; 31643e519524SHoward Hinnant } 31653e519524SHoward Hinnant } 31663e519524SHoward Hinnant return __first; 31673e519524SHoward Hinnant} 31683e519524SHoward Hinnant 31693e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31703e519524SHoward Hinnant_BidirectionalIterator 31713e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31723e519524SHoward Hinnant bidirectional_iterator_tag) 31733e519524SHoward Hinnant{ 31743e519524SHoward Hinnant while (true) 31753e519524SHoward Hinnant { 31763e519524SHoward Hinnant while (true) 31773e519524SHoward Hinnant { 31783e519524SHoward Hinnant if (__first == __last) 31793e519524SHoward Hinnant return __first; 31803e519524SHoward Hinnant if (!__pred(*__first)) 31813e519524SHoward Hinnant break; 31823e519524SHoward Hinnant ++__first; 31833e519524SHoward Hinnant } 31843e519524SHoward Hinnant do 31853e519524SHoward Hinnant { 31863e519524SHoward Hinnant if (__first == --__last) 31873e519524SHoward Hinnant return __first; 31883e519524SHoward Hinnant } while (!__pred(*__last)); 31893e519524SHoward Hinnant swap(*__first, *__last); 31903e519524SHoward Hinnant ++__first; 31913e519524SHoward Hinnant } 31923e519524SHoward Hinnant} 31933e519524SHoward Hinnant 31943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31963e519524SHoward Hinnant_ForwardIterator 31973e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31983e519524SHoward Hinnant{ 3199ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32003e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32013e519524SHoward Hinnant} 32023e519524SHoward Hinnant 32033e519524SHoward Hinnant// partition_copy 32043e519524SHoward Hinnant 32053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32063e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32073e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 32083e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32093e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32103e519524SHoward Hinnant _Predicate __pred) 32113e519524SHoward Hinnant{ 32123e519524SHoward Hinnant for (; __first != __last; ++__first) 32133e519524SHoward Hinnant { 32143e519524SHoward Hinnant if (__pred(*__first)) 32153e519524SHoward Hinnant { 32163e519524SHoward Hinnant *__out_true = *__first; 32173e519524SHoward Hinnant ++__out_true; 32183e519524SHoward Hinnant } 32193e519524SHoward Hinnant else 32203e519524SHoward Hinnant { 32213e519524SHoward Hinnant *__out_false = *__first; 32223e519524SHoward Hinnant ++__out_false; 32233e519524SHoward Hinnant } 32243e519524SHoward Hinnant } 32253e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32263e519524SHoward Hinnant} 32273e519524SHoward Hinnant 32283e519524SHoward Hinnant// partition_point 32293e519524SHoward Hinnant 32303e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 32313e519524SHoward Hinnant_ForwardIterator 32323e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32333e519524SHoward Hinnant{ 32343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3235ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32363e519524SHoward Hinnant while (__len != 0) 32373e519524SHoward Hinnant { 32383e519524SHoward Hinnant difference_type __l2 = __len / 2; 32393e519524SHoward Hinnant _ForwardIterator __m = __first; 3240ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32413e519524SHoward Hinnant if (__pred(*__m)) 32423e519524SHoward Hinnant { 32433e519524SHoward Hinnant __first = ++__m; 32443e519524SHoward Hinnant __len -= __l2 + 1; 32453e519524SHoward Hinnant } 32463e519524SHoward Hinnant else 32473e519524SHoward Hinnant __len = __l2; 32483e519524SHoward Hinnant } 32493e519524SHoward Hinnant return __first; 32503e519524SHoward Hinnant} 32513e519524SHoward Hinnant 32523e519524SHoward Hinnant// stable_partition 32533e519524SHoward Hinnant 32543e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32553e519524SHoward Hinnant_ForwardIterator 32563e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32573e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32583e519524SHoward Hinnant{ 32593e519524SHoward Hinnant // *__first is known to be false 32603e519524SHoward Hinnant // __len >= 1 32613e519524SHoward Hinnant if (__len == 1) 32623e519524SHoward Hinnant return __first; 32633e519524SHoward Hinnant if (__len == 2) 32643e519524SHoward Hinnant { 32653e519524SHoward Hinnant _ForwardIterator __m = __first; 32663e519524SHoward Hinnant if (__pred(*++__m)) 32673e519524SHoward Hinnant { 32683e519524SHoward Hinnant swap(*__first, *__m); 32693e519524SHoward Hinnant return __m; 32703e519524SHoward Hinnant } 32713e519524SHoward Hinnant return __first; 32723e519524SHoward Hinnant } 32733e519524SHoward Hinnant if (__len <= __p.second) 32743e519524SHoward Hinnant { // The buffer is big enough to use 32753e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32763e519524SHoward Hinnant __destruct_n __d(0); 32773e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32783e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32793e519524SHoward Hinnant // Update __first to always point to the end of the trues 32803e519524SHoward Hinnant value_type* __t = __p.first; 3281ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32823e519524SHoward Hinnant __d.__incr((value_type*)0); 32833e519524SHoward Hinnant ++__t; 32843e519524SHoward Hinnant _ForwardIterator __i = __first; 32853e519524SHoward Hinnant while (++__i != __last) 32863e519524SHoward Hinnant { 32873e519524SHoward Hinnant if (__pred(*__i)) 32883e519524SHoward Hinnant { 3289ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32903e519524SHoward Hinnant ++__first; 32913e519524SHoward Hinnant } 32923e519524SHoward Hinnant else 32933e519524SHoward Hinnant { 3294ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32953e519524SHoward Hinnant __d.__incr((value_type*)0); 32963e519524SHoward Hinnant ++__t; 32973e519524SHoward Hinnant } 32983e519524SHoward Hinnant } 32993e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33003e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33013e519524SHoward Hinnant __i = __first; 33023e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3303ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33043e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33053e519524SHoward Hinnant return __first; 33063e519524SHoward Hinnant } 33073e519524SHoward Hinnant // Else not enough buffer, do in place 33083e519524SHoward Hinnant // __len >= 3 33093e519524SHoward Hinnant _ForwardIterator __m = __first; 33103e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3311ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33123e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33133e519524SHoward Hinnant // F????????????????? 33143e519524SHoward Hinnant // f m l 33153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33163e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33173e519524SHoward Hinnant // TTTFFFFF?????????? 33183e519524SHoward Hinnant // f ff m l 33193e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33203e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33213e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33223e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33233e519524SHoward Hinnant while (__pred(*__m1)) 33243e519524SHoward Hinnant { 33253e519524SHoward Hinnant if (++__m1 == __last) 33263e519524SHoward Hinnant goto __second_half_done; 33273e519524SHoward Hinnant --__len_half; 33283e519524SHoward Hinnant } 33293e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33303e519524SHoward Hinnant // f ff m m1 l 33313e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33323e519524SHoward Hinnant__second_half_done: 33333e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33343e519524SHoward Hinnant // f ff m sf l 3335ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33363e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33373e519524SHoward Hinnant // | 33383e519524SHoward Hinnant} 33393e519524SHoward Hinnant 33403e519524SHoward Hinnantstruct __return_temporary_buffer 33413e519524SHoward Hinnant{ 33423e519524SHoward Hinnant template <class _Tp> 3343ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33443e519524SHoward Hinnant}; 33453e519524SHoward Hinnant 33463e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33473e519524SHoward Hinnant_ForwardIterator 33483e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33493e519524SHoward Hinnant forward_iterator_tag) 33503e519524SHoward Hinnant{ 33513e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33523e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33533e519524SHoward Hinnant while (true) 33543e519524SHoward Hinnant { 33553e519524SHoward Hinnant if (__first == __last) 33563e519524SHoward Hinnant return __first; 33573e519524SHoward Hinnant if (!__pred(*__first)) 33583e519524SHoward Hinnant break; 33593e519524SHoward Hinnant ++__first; 33603e519524SHoward Hinnant } 33613e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33623e519524SHoward Hinnant // *__first is known to be false 33633e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3365ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33663e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33673e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33683e519524SHoward Hinnant if (__len >= __alloc_limit) 33693e519524SHoward Hinnant { 3370ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33713e519524SHoward Hinnant __h.reset(__p.first); 33723e519524SHoward Hinnant } 33733e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33743e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33753e519524SHoward Hinnant} 33763e519524SHoward Hinnant 33773e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33783e519524SHoward Hinnant_BidirectionalIterator 33793e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33803e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33813e519524SHoward Hinnant{ 33823e519524SHoward Hinnant // *__first is known to be false 33833e519524SHoward Hinnant // *__last is known to be true 33843e519524SHoward Hinnant // __len >= 2 33853e519524SHoward Hinnant if (__len == 2) 33863e519524SHoward Hinnant { 33873e519524SHoward Hinnant swap(*__first, *__last); 33883e519524SHoward Hinnant return __last; 33893e519524SHoward Hinnant } 33903e519524SHoward Hinnant if (__len == 3) 33913e519524SHoward Hinnant { 33923e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33933e519524SHoward Hinnant if (__pred(*++__m)) 33943e519524SHoward Hinnant { 33953e519524SHoward Hinnant swap(*__first, *__m); 33963e519524SHoward Hinnant swap(*__m, *__last); 33973e519524SHoward Hinnant return __last; 33983e519524SHoward Hinnant } 33993e519524SHoward Hinnant swap(*__m, *__last); 34003e519524SHoward Hinnant swap(*__first, *__m); 34013e519524SHoward Hinnant return __m; 34023e519524SHoward Hinnant } 34033e519524SHoward Hinnant if (__len <= __p.second) 34043e519524SHoward Hinnant { // The buffer is big enough to use 34053e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34063e519524SHoward Hinnant __destruct_n __d(0); 34073e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34083e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34093e519524SHoward Hinnant // Update __first to always point to the end of the trues 34103e519524SHoward Hinnant value_type* __t = __p.first; 3411ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34123e519524SHoward Hinnant __d.__incr((value_type*)0); 34133e519524SHoward Hinnant ++__t; 34143e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34153e519524SHoward Hinnant while (++__i != __last) 34163e519524SHoward Hinnant { 34173e519524SHoward Hinnant if (__pred(*__i)) 34183e519524SHoward Hinnant { 3419ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34203e519524SHoward Hinnant ++__first; 34213e519524SHoward Hinnant } 34223e519524SHoward Hinnant else 34233e519524SHoward Hinnant { 3424ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34253e519524SHoward Hinnant __d.__incr((value_type*)0); 34263e519524SHoward Hinnant ++__t; 34273e519524SHoward Hinnant } 34283e519524SHoward Hinnant } 34293e519524SHoward Hinnant // move *__last, known to be true 3430ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34313e519524SHoward Hinnant __i = ++__first; 34323e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34333e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34343e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3435ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34363e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34373e519524SHoward Hinnant return __first; 34383e519524SHoward Hinnant } 34393e519524SHoward Hinnant // Else not enough buffer, do in place 34403e519524SHoward Hinnant // __len >= 4 34413e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34423e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3443ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34443e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34453e519524SHoward Hinnant // F????????????????T 34463e519524SHoward Hinnant // f m l 34473e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34483e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34493e519524SHoward Hinnant _Distance __len_half = __len2; 34503e519524SHoward Hinnant while (!__pred(*--__m1)) 34513e519524SHoward Hinnant { 34523e519524SHoward Hinnant if (__m1 == __first) 34533e519524SHoward Hinnant goto __first_half_done; 34543e519524SHoward Hinnant --__len_half; 34553e519524SHoward Hinnant } 34563e519524SHoward Hinnant // F???TFFF?????????T 34573e519524SHoward Hinnant // f m1 m l 34583e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34593e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34603e519524SHoward Hinnant__first_half_done: 34613e519524SHoward Hinnant // TTTFFFFF?????????T 34623e519524SHoward Hinnant // f ff m l 34633e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34643e519524SHoward Hinnant __m1 = __m; 34653e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34663e519524SHoward Hinnant ++__second_false; 34673e519524SHoward Hinnant __len_half = __len - __len2; 34683e519524SHoward Hinnant while (__pred(*__m1)) 34693e519524SHoward Hinnant { 34703e519524SHoward Hinnant if (++__m1 == __last) 34713e519524SHoward Hinnant goto __second_half_done; 34723e519524SHoward Hinnant --__len_half; 34733e519524SHoward Hinnant } 34743e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34753e519524SHoward Hinnant // f ff m m1 l 34763e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34773e519524SHoward Hinnant__second_half_done: 34783e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34793e519524SHoward Hinnant // f ff m sf l 3480ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34813e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34823e519524SHoward Hinnant // | 34833e519524SHoward Hinnant} 34843e519524SHoward Hinnant 34853e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34863e519524SHoward Hinnant_BidirectionalIterator 34873e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34883e519524SHoward Hinnant bidirectional_iterator_tag) 34893e519524SHoward Hinnant{ 34903e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34913e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34923e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34933e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34943e519524SHoward Hinnant while (true) 34953e519524SHoward Hinnant { 34963e519524SHoward Hinnant if (__first == __last) 34973e519524SHoward Hinnant return __first; 34983e519524SHoward Hinnant if (!__pred(*__first)) 34993e519524SHoward Hinnant break; 35003e519524SHoward Hinnant ++__first; 35013e519524SHoward Hinnant } 35023e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35033e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35043e519524SHoward Hinnant do 35053e519524SHoward Hinnant { 35063e519524SHoward Hinnant if (__first == --__last) 35073e519524SHoward Hinnant return __first; 35083e519524SHoward Hinnant } while (!__pred(*__last)); 35093e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35103e519524SHoward Hinnant // *__first is known to be false 35113e519524SHoward Hinnant // *__last is known to be true 35123e519524SHoward Hinnant // __len >= 2 3513ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35143e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35153e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35163e519524SHoward Hinnant if (__len >= __alloc_limit) 35173e519524SHoward Hinnant { 3518ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35193e519524SHoward Hinnant __h.reset(__p.first); 35203e519524SHoward Hinnant } 35213e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35223e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35233e519524SHoward Hinnant} 35243e519524SHoward Hinnant 35253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35273e519524SHoward Hinnant_ForwardIterator 35283e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35293e519524SHoward Hinnant{ 35303e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35313e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35323e519524SHoward Hinnant} 35333e519524SHoward Hinnant 35343e519524SHoward Hinnant// is_sorted_until 35353e519524SHoward Hinnant 35363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35373e519524SHoward Hinnant_ForwardIterator 35383e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35393e519524SHoward Hinnant{ 35403e519524SHoward Hinnant if (__first != __last) 35413e519524SHoward Hinnant { 35423e519524SHoward Hinnant _ForwardIterator __i = __first; 35433e519524SHoward Hinnant while (++__i != __last) 35443e519524SHoward Hinnant { 35453e519524SHoward Hinnant if (__comp(*__i, *__first)) 35463e519524SHoward Hinnant return __i; 35473e519524SHoward Hinnant __first = __i; 35483e519524SHoward Hinnant } 35493e519524SHoward Hinnant } 35503e519524SHoward Hinnant return __last; 35513e519524SHoward Hinnant} 35523e519524SHoward Hinnant 35533e519524SHoward Hinnanttemplate<class _ForwardIterator> 35543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35553e519524SHoward Hinnant_ForwardIterator 35563e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35573e519524SHoward Hinnant{ 3558ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35593e519524SHoward Hinnant} 35603e519524SHoward Hinnant 35613e519524SHoward Hinnant// is_sorted 35623e519524SHoward Hinnant 35633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35653e519524SHoward Hinnantbool 35663e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35673e519524SHoward Hinnant{ 3568ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35693e519524SHoward Hinnant} 35703e519524SHoward Hinnant 35713e519524SHoward Hinnanttemplate<class _ForwardIterator> 35723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35733e519524SHoward Hinnantbool 35743e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35753e519524SHoward Hinnant{ 3576ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35773e519524SHoward Hinnant} 35783e519524SHoward Hinnant 35793e519524SHoward Hinnant// sort 35803e519524SHoward Hinnant 35813e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35823e519524SHoward Hinnant 35833e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35843e519524SHoward Hinnantunsigned 35853e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35863e519524SHoward Hinnant{ 35873e519524SHoward Hinnant unsigned __r = 0; 35883e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35893e519524SHoward Hinnant { 35903e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35913e519524SHoward Hinnant return __r; // x <= y && y <= z 35923e519524SHoward Hinnant // x <= y && y > z 35933e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35943e519524SHoward Hinnant __r = 1; 35953e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35963e519524SHoward Hinnant { 35973e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35983e519524SHoward Hinnant __r = 2; 35993e519524SHoward Hinnant } 36003e519524SHoward Hinnant return __r; // x <= y && y < z 36013e519524SHoward Hinnant } 36023e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36033e519524SHoward Hinnant { 36043e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36053e519524SHoward Hinnant __r = 1; 36063e519524SHoward Hinnant return __r; 36073e519524SHoward Hinnant } 36083e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36093e519524SHoward Hinnant __r = 1; // x < y && x <= z 36103e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36113e519524SHoward Hinnant { 36123e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36133e519524SHoward Hinnant __r = 2; 36143e519524SHoward Hinnant } 36153e519524SHoward Hinnant return __r; 36163e519524SHoward Hinnant} // x <= y && y <= z 36173e519524SHoward Hinnant 36183e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36193e519524SHoward Hinnant 36203e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36213e519524SHoward Hinnantunsigned 36223e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36233e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36243e519524SHoward Hinnant{ 36253e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36263e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36273e519524SHoward Hinnant { 36283e519524SHoward Hinnant swap(*__x3, *__x4); 36293e519524SHoward Hinnant ++__r; 36303e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36313e519524SHoward Hinnant { 36323e519524SHoward Hinnant swap(*__x2, *__x3); 36333e519524SHoward Hinnant ++__r; 36343e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36353e519524SHoward Hinnant { 36363e519524SHoward Hinnant swap(*__x1, *__x2); 36373e519524SHoward Hinnant ++__r; 36383e519524SHoward Hinnant } 36393e519524SHoward Hinnant } 36403e519524SHoward Hinnant } 36413e519524SHoward Hinnant return __r; 36423e519524SHoward Hinnant} 36433e519524SHoward Hinnant 36443e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36453e519524SHoward Hinnant 36463e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36473e519524SHoward Hinnantunsigned 36483e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36493e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36503e519524SHoward Hinnant{ 36513e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36523e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36533e519524SHoward Hinnant { 36543e519524SHoward Hinnant swap(*__x4, *__x5); 36553e519524SHoward Hinnant ++__r; 36563e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36573e519524SHoward Hinnant { 36583e519524SHoward Hinnant swap(*__x3, *__x4); 36593e519524SHoward Hinnant ++__r; 36603e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36613e519524SHoward Hinnant { 36623e519524SHoward Hinnant swap(*__x2, *__x3); 36633e519524SHoward Hinnant ++__r; 36643e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36653e519524SHoward Hinnant { 36663e519524SHoward Hinnant swap(*__x1, *__x2); 36673e519524SHoward Hinnant ++__r; 36683e519524SHoward Hinnant } 36693e519524SHoward Hinnant } 36703e519524SHoward Hinnant } 36713e519524SHoward Hinnant } 36723e519524SHoward Hinnant return __r; 36733e519524SHoward Hinnant} 36743e519524SHoward Hinnant 36753e519524SHoward Hinnant// Assumes size > 0 36763e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36773e519524SHoward Hinnantvoid 36783e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36793e519524SHoward Hinnant{ 36803e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36813e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36823e519524SHoward Hinnant { 3683ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36843e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36853e519524SHoward Hinnant (__first, __last, __comp); 36863e519524SHoward Hinnant if (__i != __first) 36873e519524SHoward Hinnant swap(*__first, *__i); 36883e519524SHoward Hinnant } 36893e519524SHoward Hinnant} 36903e519524SHoward Hinnant 36913e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36923e519524SHoward Hinnantvoid 36933e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36943e519524SHoward Hinnant{ 36953e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36963e519524SHoward Hinnant if (__first != __last) 36973e519524SHoward Hinnant { 36983e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 36993e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37003e519524SHoward Hinnant { 37013e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3702ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37033e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3704ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3705ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37063e519524SHoward Hinnant } 37073e519524SHoward Hinnant } 37083e519524SHoward Hinnant} 37093e519524SHoward Hinnant 37103e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37113e519524SHoward Hinnantvoid 37123e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37133e519524SHoward Hinnant{ 37143e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37153e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37163e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37173e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37183e519524SHoward Hinnant { 37193e519524SHoward Hinnant if (__comp(*__i, *__j)) 37203e519524SHoward Hinnant { 3721ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37223e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37233e519524SHoward Hinnant __j = __i; 37243e519524SHoward Hinnant do 37253e519524SHoward Hinnant { 3726ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37273e519524SHoward Hinnant __j = __k; 37283e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3729ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37303e519524SHoward Hinnant } 37313e519524SHoward Hinnant __j = __i; 37323e519524SHoward Hinnant } 37333e519524SHoward Hinnant} 37343e519524SHoward Hinnant 37353e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37363e519524SHoward Hinnantbool 37373e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37383e519524SHoward Hinnant{ 37393e519524SHoward Hinnant switch (__last - __first) 37403e519524SHoward Hinnant { 37413e519524SHoward Hinnant case 0: 37423e519524SHoward Hinnant case 1: 37433e519524SHoward Hinnant return true; 37443e519524SHoward Hinnant case 2: 37453e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37463e519524SHoward Hinnant swap(*__first, *__last); 37473e519524SHoward Hinnant return true; 37483e519524SHoward Hinnant case 3: 3749ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37503e519524SHoward Hinnant return true; 37513e519524SHoward Hinnant case 4: 3752ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37533e519524SHoward Hinnant return true; 37543e519524SHoward Hinnant case 5: 3755ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37563e519524SHoward Hinnant return true; 37573e519524SHoward Hinnant } 37583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37593e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37603e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37613e519524SHoward Hinnant const unsigned __limit = 8; 37623e519524SHoward Hinnant unsigned __count = 0; 37633e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37643e519524SHoward Hinnant { 37653e519524SHoward Hinnant if (__comp(*__i, *__j)) 37663e519524SHoward Hinnant { 3767ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37683e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37693e519524SHoward Hinnant __j = __i; 37703e519524SHoward Hinnant do 37713e519524SHoward Hinnant { 3772ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37733e519524SHoward Hinnant __j = __k; 37743e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3775ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37763e519524SHoward Hinnant if (++__count == __limit) 37773e519524SHoward Hinnant return ++__i == __last; 37783e519524SHoward Hinnant } 37793e519524SHoward Hinnant __j = __i; 37803e519524SHoward Hinnant } 37813e519524SHoward Hinnant return true; 37823e519524SHoward Hinnant} 37833e519524SHoward Hinnant 37843e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37853e519524SHoward Hinnantvoid 37863e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37873e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37883e519524SHoward Hinnant{ 37893e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37903e519524SHoward Hinnant if (__first1 != __last1) 37913e519524SHoward Hinnant { 37923e519524SHoward Hinnant __destruct_n __d(0); 37933e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37943e519524SHoward Hinnant value_type* __last2 = __first2; 3795ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37963e519524SHoward Hinnant __d.__incr((value_type*)0); 37973e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37983e519524SHoward Hinnant { 37993e519524SHoward Hinnant value_type* __j2 = __last2; 38003e519524SHoward Hinnant value_type* __i2 = __j2; 38013e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38023e519524SHoward Hinnant { 3803ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38043e519524SHoward Hinnant __d.__incr((value_type*)0); 38053e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3806ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3807ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38083e519524SHoward Hinnant } 38093e519524SHoward Hinnant else 38103e519524SHoward Hinnant { 3811ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38123e519524SHoward Hinnant __d.__incr((value_type*)0); 38133e519524SHoward Hinnant } 38143e519524SHoward Hinnant } 38153e519524SHoward Hinnant __h.release(); 38163e519524SHoward Hinnant } 38173e519524SHoward Hinnant} 38183e519524SHoward Hinnant 38193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38203e519524SHoward Hinnantvoid 38213e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38223e519524SHoward Hinnant{ 38233e519524SHoward Hinnant // _Compare is known to be a reference type 38243e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3826ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3827ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38283e519524SHoward Hinnant while (true) 38293e519524SHoward Hinnant { 38303e519524SHoward Hinnant __restart: 38313e519524SHoward Hinnant difference_type __len = __last - __first; 38323e519524SHoward Hinnant switch (__len) 38333e519524SHoward Hinnant { 38343e519524SHoward Hinnant case 0: 38353e519524SHoward Hinnant case 1: 38363e519524SHoward Hinnant return; 38373e519524SHoward Hinnant case 2: 38383e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38393e519524SHoward Hinnant swap(*__first, *__last); 38403e519524SHoward Hinnant return; 38413e519524SHoward Hinnant case 3: 3842ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38433e519524SHoward Hinnant return; 38443e519524SHoward Hinnant case 4: 3845ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38463e519524SHoward Hinnant return; 38473e519524SHoward Hinnant case 5: 3848ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38493e519524SHoward Hinnant return; 38503e519524SHoward Hinnant } 38513e519524SHoward Hinnant if (__len <= __limit) 38523e519524SHoward Hinnant { 3853ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38543e519524SHoward Hinnant return; 38553e519524SHoward Hinnant } 38563e519524SHoward Hinnant // __len > 5 38573e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38583e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38593e519524SHoward Hinnant --__lm1; 38603e519524SHoward Hinnant unsigned __n_swaps; 38613e519524SHoward Hinnant { 38623e519524SHoward Hinnant difference_type __delta; 38633e519524SHoward Hinnant if (__len >= 1000) 38643e519524SHoward Hinnant { 38653e519524SHoward Hinnant __delta = __len/2; 38663e519524SHoward Hinnant __m += __delta; 38673e519524SHoward Hinnant __delta /= 2; 3868ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38693e519524SHoward Hinnant } 38703e519524SHoward Hinnant else 38713e519524SHoward Hinnant { 38723e519524SHoward Hinnant __delta = __len/2; 38733e519524SHoward Hinnant __m += __delta; 3874ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38753e519524SHoward Hinnant } 38763e519524SHoward Hinnant } 38773e519524SHoward Hinnant // *__m is median 38783e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38793e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38803e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38813e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38823e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38833e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38843e519524SHoward Hinnant // Prime the downward search with a guard. 38853e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38863e519524SHoward Hinnant { 38873e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38883e519524SHoward Hinnant // manually guard downward moving __j against __i 38893e519524SHoward Hinnant while (true) 38903e519524SHoward Hinnant { 38913e519524SHoward Hinnant if (__i == --__j) 38923e519524SHoward Hinnant { 38933e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38943e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38953e519524SHoward Hinnant ++__i; // __first + 1 38963e519524SHoward Hinnant __j = __last; 38973e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38983e519524SHoward Hinnant { 38993e519524SHoward Hinnant while (true) 39003e519524SHoward Hinnant { 39013e519524SHoward Hinnant if (__i == __j) 39023e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39033e519524SHoward Hinnant if (__comp(*__first, *__i)) 39043e519524SHoward Hinnant { 39053e519524SHoward Hinnant swap(*__i, *__j); 39063e519524SHoward Hinnant ++__n_swaps; 39073e519524SHoward Hinnant ++__i; 39083e519524SHoward Hinnant break; 39093e519524SHoward Hinnant } 39103e519524SHoward Hinnant ++__i; 39113e519524SHoward Hinnant } 39123e519524SHoward Hinnant } 39133e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39143e519524SHoward Hinnant if (__i == __j) 39153e519524SHoward Hinnant return; 39163e519524SHoward Hinnant while (true) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39193e519524SHoward Hinnant ++__i; 39203e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39213e519524SHoward Hinnant ; 39223e519524SHoward Hinnant if (__i >= __j) 39233e519524SHoward Hinnant break; 39243e519524SHoward Hinnant swap(*__i, *__j); 39253e519524SHoward Hinnant ++__n_swaps; 39263e519524SHoward Hinnant ++__i; 39273e519524SHoward Hinnant } 39283e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39293e519524SHoward Hinnant // The first part is sorted, sort the secod part 3930ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39313e519524SHoward Hinnant __first = __i; 39323e519524SHoward Hinnant goto __restart; 39333e519524SHoward Hinnant } 39343e519524SHoward Hinnant if (__comp(*__j, *__m)) 39353e519524SHoward Hinnant { 39363e519524SHoward Hinnant swap(*__i, *__j); 39373e519524SHoward Hinnant ++__n_swaps; 39383e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39393e519524SHoward Hinnant } 39403e519524SHoward Hinnant } 39413e519524SHoward Hinnant } 39423e519524SHoward Hinnant // It is known that *__i < *__m 39433e519524SHoward Hinnant ++__i; 39443e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39453e519524SHoward Hinnant // if not yet partitioned... 39463e519524SHoward Hinnant if (__i < __j) 39473e519524SHoward Hinnant { 39483e519524SHoward Hinnant // known that *(__i - 1) < *__m 39493e519524SHoward Hinnant // known that __i <= __m 39503e519524SHoward Hinnant while (true) 39513e519524SHoward Hinnant { 39523e519524SHoward Hinnant // __m still guards upward moving __i 39533e519524SHoward Hinnant while (__comp(*__i, *__m)) 39543e519524SHoward Hinnant ++__i; 39553e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39563e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39573e519524SHoward Hinnant ; 39583e519524SHoward Hinnant if (__i > __j) 39593e519524SHoward Hinnant break; 39603e519524SHoward Hinnant swap(*__i, *__j); 39613e519524SHoward Hinnant ++__n_swaps; 39623e519524SHoward Hinnant // It is known that __m != __j 39633e519524SHoward Hinnant // If __m just moved, follow it 39643e519524SHoward Hinnant if (__m == __i) 39653e519524SHoward Hinnant __m = __j; 39663e519524SHoward Hinnant ++__i; 39673e519524SHoward Hinnant } 39683e519524SHoward Hinnant } 39693e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39703e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39713e519524SHoward Hinnant { 39723e519524SHoward Hinnant swap(*__i, *__m); 39733e519524SHoward Hinnant ++__n_swaps; 39743e519524SHoward Hinnant } 39753e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39763e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39773e519524SHoward Hinnant if (__n_swaps == 0) 39783e519524SHoward Hinnant { 3979ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3980ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39813e519524SHoward Hinnant { 39823e519524SHoward Hinnant if (__fs) 39833e519524SHoward Hinnant return; 39843e519524SHoward Hinnant __last = __i; 39853e519524SHoward Hinnant continue; 39863e519524SHoward Hinnant } 39873e519524SHoward Hinnant else 39883e519524SHoward Hinnant { 39893e519524SHoward Hinnant if (__fs) 39903e519524SHoward Hinnant { 39913e519524SHoward Hinnant __first = ++__i; 39923e519524SHoward Hinnant continue; 39933e519524SHoward Hinnant } 39943e519524SHoward Hinnant } 39953e519524SHoward Hinnant } 39963e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39973e519524SHoward Hinnant if (__i - __first < __last - __i) 39983e519524SHoward Hinnant { 3999ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4000ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40013e519524SHoward Hinnant __first = ++__i; 40023e519524SHoward Hinnant } 40033e519524SHoward Hinnant else 40043e519524SHoward Hinnant { 4005ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4006ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40073e519524SHoward Hinnant __last = __i; 40083e519524SHoward Hinnant } 40093e519524SHoward Hinnant } 40103e519524SHoward Hinnant} 40113e519524SHoward Hinnant 40123e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40153e519524SHoward Hinnantvoid 40163e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40173e519524SHoward Hinnant{ 4018145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40193e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40203e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40213e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4022145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40233e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40243e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4025145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40263e519524SHoward Hinnant} 40273e519524SHoward Hinnant 40283e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40303e519524SHoward Hinnantvoid 40313e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40323e519524SHoward Hinnant{ 4033ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40343e519524SHoward Hinnant} 40353e519524SHoward Hinnant 40363e519524SHoward Hinnanttemplate <class _Tp> 40373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40383e519524SHoward Hinnantvoid 40393e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40403e519524SHoward Hinnant{ 4041ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40423e519524SHoward Hinnant} 40433e519524SHoward Hinnant 40443e519524SHoward Hinnanttemplate <class _Tp> 40453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40463e519524SHoward Hinnantvoid 40473e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40483e519524SHoward Hinnant{ 4049ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40503e519524SHoward Hinnant} 40513e519524SHoward Hinnant 4052f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4053f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4054f554add5SHoward Hinnantvoid 4055f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4056f554add5SHoward Hinnant{ 4057f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4058f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4059f554add5SHoward Hinnant} 4060f554add5SHoward Hinnant 40610be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4062e4383379SHoward Hinnant#pragma warning( push ) 4063e4383379SHoward Hinnant#pragma warning( disable: 4231) 40640be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4065f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4066f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4067f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4068f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4069f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4070f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4071f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4072f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4073f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4074f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4075f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4076f0544c20SHoward 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>&)) 4077f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4078f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4079f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40803e519524SHoward Hinnant 4081f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4082f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4083f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4084f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4085f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4086f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4087f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4088f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4089f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4090f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4091f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4092f0544c20SHoward 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>&)) 4093f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4094f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4095f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40963e519524SHoward Hinnant 4097f0544c20SHoward 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>&)) 40980be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4099e4383379SHoward Hinnant#pragma warning( pop ) 41000be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 41013e519524SHoward Hinnant 41023e519524SHoward Hinnant// lower_bound 41033e519524SHoward Hinnant 41043e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41053e519524SHoward Hinnant_ForwardIterator 4106e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41073e519524SHoward Hinnant{ 41083e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4109ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41103e519524SHoward Hinnant while (__len != 0) 41113e519524SHoward Hinnant { 41123e519524SHoward Hinnant difference_type __l2 = __len / 2; 41133e519524SHoward Hinnant _ForwardIterator __m = __first; 4114ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4115e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41163e519524SHoward Hinnant { 41173e519524SHoward Hinnant __first = ++__m; 41183e519524SHoward Hinnant __len -= __l2 + 1; 41193e519524SHoward Hinnant } 41203e519524SHoward Hinnant else 41213e519524SHoward Hinnant __len = __l2; 41223e519524SHoward Hinnant } 41233e519524SHoward Hinnant return __first; 41243e519524SHoward Hinnant} 41253e519524SHoward Hinnant 41263e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41283e519524SHoward Hinnant_ForwardIterator 4129e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41303e519524SHoward Hinnant{ 4131145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41323e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41333e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4134e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4135145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41363e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4137e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4138145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41393e519524SHoward Hinnant} 41403e519524SHoward Hinnant 41413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41433e519524SHoward Hinnant_ForwardIterator 4144e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41453e519524SHoward Hinnant{ 4146e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41473e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41483e519524SHoward Hinnant} 41493e519524SHoward Hinnant 41503e519524SHoward Hinnant// upper_bound 41513e519524SHoward Hinnant 41523e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41533e519524SHoward Hinnant_ForwardIterator 4154e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41553e519524SHoward Hinnant{ 41563e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4157ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41583e519524SHoward Hinnant while (__len != 0) 41593e519524SHoward Hinnant { 41603e519524SHoward Hinnant difference_type __l2 = __len / 2; 41613e519524SHoward Hinnant _ForwardIterator __m = __first; 4162ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4163e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41643e519524SHoward Hinnant __len = __l2; 41653e519524SHoward Hinnant else 41663e519524SHoward Hinnant { 41673e519524SHoward Hinnant __first = ++__m; 41683e519524SHoward Hinnant __len -= __l2 + 1; 41693e519524SHoward Hinnant } 41703e519524SHoward Hinnant } 41713e519524SHoward Hinnant return __first; 41723e519524SHoward Hinnant} 41733e519524SHoward Hinnant 41743e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41763e519524SHoward Hinnant_ForwardIterator 4177e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41783e519524SHoward Hinnant{ 4179145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41803e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41813e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4182e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4183145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41843e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4185e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4186145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41873e519524SHoward Hinnant} 41883e519524SHoward Hinnant 41893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41913e519524SHoward Hinnant_ForwardIterator 4192e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41933e519524SHoward Hinnant{ 4194e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41953e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41963e519524SHoward Hinnant} 41973e519524SHoward Hinnant 41983e519524SHoward Hinnant// equal_range 41993e519524SHoward Hinnant 42003e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42013e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4202e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42033e519524SHoward Hinnant{ 42043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4205ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42063e519524SHoward Hinnant while (__len != 0) 42073e519524SHoward Hinnant { 42083e519524SHoward Hinnant difference_type __l2 = __len / 2; 42093e519524SHoward Hinnant _ForwardIterator __m = __first; 4210ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4211e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42123e519524SHoward Hinnant { 42133e519524SHoward Hinnant __first = ++__m; 42143e519524SHoward Hinnant __len -= __l2 + 1; 42153e519524SHoward Hinnant } 4216e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42173e519524SHoward Hinnant { 42183e519524SHoward Hinnant __last = __m; 42193e519524SHoward Hinnant __len = __l2; 42203e519524SHoward Hinnant } 42213e519524SHoward Hinnant else 42223e519524SHoward Hinnant { 42233e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42243e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42253e519524SHoward Hinnant ( 4226e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4227e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42283e519524SHoward Hinnant ); 42293e519524SHoward Hinnant } 42303e519524SHoward Hinnant } 42313e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42323e519524SHoward Hinnant} 42333e519524SHoward Hinnant 42343e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42363e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4237e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42383e519524SHoward Hinnant{ 4239145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42403e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42413e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4242e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4243145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42443e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4245e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4246145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42473e519524SHoward Hinnant} 42483e519524SHoward Hinnant 42493e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42513e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4252e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42533e519524SHoward Hinnant{ 4254e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42553e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42563e519524SHoward Hinnant} 42573e519524SHoward Hinnant 42583e519524SHoward Hinnant// binary_search 42593e519524SHoward Hinnant 42603e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42623e519524SHoward Hinnantbool 4263e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42643e519524SHoward Hinnant{ 4265e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4266e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42673e519524SHoward Hinnant} 42683e519524SHoward Hinnant 42693e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42713e519524SHoward Hinnantbool 4272e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42733e519524SHoward Hinnant{ 4274145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42753e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42763e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4277e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4278145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42793e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4280e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4281145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42823e519524SHoward Hinnant} 42833e519524SHoward Hinnant 42843e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42863e519524SHoward Hinnantbool 4287e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42883e519524SHoward Hinnant{ 4289e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42903e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42913e519524SHoward Hinnant} 42923e519524SHoward Hinnant 42933e519524SHoward Hinnant// merge 42943e519524SHoward Hinnant 42953e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42963e519524SHoward Hinnant_OutputIterator 42973e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42983e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42993e519524SHoward Hinnant{ 43003e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43013e519524SHoward Hinnant { 43023e519524SHoward Hinnant if (__first2 == __last2) 4303ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43043e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43053e519524SHoward Hinnant { 43063e519524SHoward Hinnant *__result = *__first2; 43073e519524SHoward Hinnant ++__first2; 43083e519524SHoward Hinnant } 43093e519524SHoward Hinnant else 43103e519524SHoward Hinnant { 43113e519524SHoward Hinnant *__result = *__first1; 43123e519524SHoward Hinnant ++__first1; 43133e519524SHoward Hinnant } 43143e519524SHoward Hinnant } 4315ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43163e519524SHoward Hinnant} 43173e519524SHoward Hinnant 43183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43203e519524SHoward Hinnant_OutputIterator 43213e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43223e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43233e519524SHoward Hinnant{ 4324145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43253e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43263e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4327ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4328145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43293e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4330ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4331145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43323e519524SHoward Hinnant} 43333e519524SHoward Hinnant 43343e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43363e519524SHoward Hinnant_OutputIterator 43373e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43383e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43393e519524SHoward Hinnant{ 43403e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43413e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43423e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43433e519524SHoward Hinnant} 43443e519524SHoward Hinnant 43453e519524SHoward Hinnant// inplace_merge 43463e519524SHoward Hinnant 43473e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43483e519524SHoward Hinnantvoid 43493e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43503e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43513e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43523e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 43533e519524SHoward Hinnant{ 43543e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43553e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43563e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 43573e519524SHoward Hinnant __destruct_n __d(0); 43583e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43593e519524SHoward Hinnant if (__len1 <= __len2) 43603e519524SHoward Hinnant { 43613e519524SHoward Hinnant value_type* __p = __buff; 43623e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 4363ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43643e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 43653e519524SHoward Hinnant move_iterator<value_type*>(__p), 43663e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 43673e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 43683e519524SHoward Hinnant __first, __comp); 43693e519524SHoward Hinnant } 43703e519524SHoward Hinnant else 43713e519524SHoward Hinnant { 43723e519524SHoward Hinnant value_type* __p = __buff; 43733e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 4374ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43753e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43763e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 43773e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 43783e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 43793e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 43803e519524SHoward Hinnant } 43813e519524SHoward Hinnant} 43823e519524SHoward Hinnant 43833e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43843e519524SHoward Hinnantvoid 43853e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43863e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43873e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43883e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43893e519524SHoward Hinnant{ 43903e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43913e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43923e519524SHoward Hinnant while (true) 43933e519524SHoward Hinnant { 43943e519524SHoward Hinnant // if __middle == __last, we're done 43953e519524SHoward Hinnant if (__len2 == 0) 43963e519524SHoward Hinnant return; 43973e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 43983e519524SHoward Hinnant for (; true; ++__first, --__len1) 43993e519524SHoward Hinnant { 44003e519524SHoward Hinnant if (__len1 == 0) 44013e519524SHoward Hinnant return; 44023e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44033e519524SHoward Hinnant break; 44043e519524SHoward Hinnant } 44053e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 44063e519524SHoward Hinnant { 44073e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 44083e519524SHoward Hinnant return; 44093e519524SHoward Hinnant } 44103e519524SHoward Hinnant // __first < __middle < __last 44113e519524SHoward Hinnant // *__first > *__middle 44123e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44133e519524SHoward Hinnant // all elements in: 44143e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44153e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44163e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44173e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44183e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44193e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44203e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44213e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44223e519524SHoward Hinnant // binary search smaller range 44233e519524SHoward Hinnant if (__len1 < __len2) 44243e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44253e519524SHoward Hinnant __len21 = __len2 / 2; 44263e519524SHoward Hinnant __m2 = __middle; 4427ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44283e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4429ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44303e519524SHoward Hinnant } 44313e519524SHoward Hinnant else 44323e519524SHoward Hinnant { 44333e519524SHoward Hinnant if (__len1 == 1) 44343e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44353e519524SHoward Hinnant // It is known *__first > *__middle 44363e519524SHoward Hinnant swap(*__first, *__middle); 44373e519524SHoward Hinnant return; 44383e519524SHoward Hinnant } 44393e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44403e519524SHoward Hinnant __len11 = __len1 / 2; 44413e519524SHoward Hinnant __m1 = __first; 4442ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44433e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4444ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44453e519524SHoward Hinnant } 44463e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44473e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44483e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44493e519524SHoward Hinnant // swap middle two partitions 4450ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44513e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44523e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44533e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 44543e519524SHoward Hinnant { 44553e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44563e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44573e519524SHoward Hinnant __first = __middle; 44583e519524SHoward Hinnant __middle = __m2; 44593e519524SHoward Hinnant __len1 = __len12; 44603e519524SHoward Hinnant __len2 = __len22; 44613e519524SHoward Hinnant } 44623e519524SHoward Hinnant else 44633e519524SHoward Hinnant { 44643e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44653e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44663e519524SHoward Hinnant __last = __middle; 44673e519524SHoward Hinnant __middle = __m1; 44683e519524SHoward Hinnant __len1 = __len11; 44693e519524SHoward Hinnant __len2 = __len21; 44703e519524SHoward Hinnant } 44713e519524SHoward Hinnant } 44723e519524SHoward Hinnant} 44733e519524SHoward Hinnant 44743e519524SHoward Hinnanttemplate <class _Tp> 44753e519524SHoward Hinnantstruct __inplace_merge_switch 44763e519524SHoward Hinnant{ 4477ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 44783e519524SHoward Hinnant}; 44793e519524SHoward Hinnant 44803e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44823e519524SHoward Hinnantvoid 44833e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44843e519524SHoward Hinnant _Compare __comp) 44853e519524SHoward Hinnant{ 44863e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44873e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4488ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4489ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4490ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44913e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 44923e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 44933e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 44943e519524SHoward Hinnant { 4495ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44963e519524SHoward Hinnant __h.reset(__buf.first); 44973e519524SHoward Hinnant } 4498145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4501ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 45023e519524SHoward Hinnant __buf.first, __buf.second); 4503145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4505ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45063e519524SHoward Hinnant __buf.first, __buf.second); 4507145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45083e519524SHoward Hinnant} 45093e519524SHoward Hinnant 45103e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45123e519524SHoward Hinnantvoid 45133e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45143e519524SHoward Hinnant{ 4515ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45163e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45173e519524SHoward Hinnant} 45183e519524SHoward Hinnant 45193e519524SHoward Hinnant// stable_sort 45203e519524SHoward Hinnant 45213e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45223e519524SHoward Hinnantvoid 45233e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45253e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45263e519524SHoward Hinnant{ 45273e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45283e519524SHoward Hinnant __destruct_n __d(0); 45293e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45303e519524SHoward Hinnant for (; true; ++__result) 45313e519524SHoward Hinnant { 45323e519524SHoward Hinnant if (__first1 == __last1) 45333e519524SHoward Hinnant { 45343e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4535ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45363e519524SHoward Hinnant __h.release(); 45373e519524SHoward Hinnant return; 45383e519524SHoward Hinnant } 45393e519524SHoward Hinnant if (__first2 == __last2) 45403e519524SHoward Hinnant { 45413e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4542ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45433e519524SHoward Hinnant __h.release(); 45443e519524SHoward Hinnant return; 45453e519524SHoward Hinnant } 45463e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45473e519524SHoward Hinnant { 4548ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45493e519524SHoward Hinnant __d.__incr((value_type*)0); 45503e519524SHoward Hinnant ++__first2; 45513e519524SHoward Hinnant } 45523e519524SHoward Hinnant else 45533e519524SHoward Hinnant { 4554ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45553e519524SHoward Hinnant __d.__incr((value_type*)0); 45563e519524SHoward Hinnant ++__first1; 45573e519524SHoward Hinnant } 45583e519524SHoward Hinnant } 45593e519524SHoward Hinnant} 45603e519524SHoward Hinnant 45613e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45623e519524SHoward Hinnantvoid 45633e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45643e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45653e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45663e519524SHoward Hinnant{ 45673e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45683e519524SHoward Hinnant { 45693e519524SHoward Hinnant if (__first2 == __last2) 45703e519524SHoward Hinnant { 45713e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4572ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45733e519524SHoward Hinnant return; 45743e519524SHoward Hinnant } 45753e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45763e519524SHoward Hinnant { 4577ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45783e519524SHoward Hinnant ++__first2; 45793e519524SHoward Hinnant } 45803e519524SHoward Hinnant else 45813e519524SHoward Hinnant { 4582ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45833e519524SHoward Hinnant ++__first1; 45843e519524SHoward Hinnant } 45853e519524SHoward Hinnant } 45863e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4587ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45883e519524SHoward Hinnant} 45893e519524SHoward Hinnant 45903e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45913e519524SHoward Hinnantvoid 45923e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45933e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45943e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45953e519524SHoward Hinnant 45963e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45973e519524SHoward Hinnantvoid 45983e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45993e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46003e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46013e519524SHoward Hinnant{ 46023e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46033e519524SHoward Hinnant switch (__len) 46043e519524SHoward Hinnant { 46053e519524SHoward Hinnant case 0: 46063e519524SHoward Hinnant return; 46073e519524SHoward Hinnant case 1: 4608ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46093e519524SHoward Hinnant return; 46103e519524SHoward Hinnant case 2: 46113e519524SHoward Hinnant __destruct_n __d(0); 46123e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46133e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46143e519524SHoward Hinnant { 4615ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46163e519524SHoward Hinnant __d.__incr((value_type*)0); 46173e519524SHoward Hinnant ++__first2; 4618ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46193e519524SHoward Hinnant } 46203e519524SHoward Hinnant else 46213e519524SHoward Hinnant { 4622ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46233e519524SHoward Hinnant __d.__incr((value_type*)0); 46243e519524SHoward Hinnant ++__first2; 4625ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46263e519524SHoward Hinnant } 46273e519524SHoward Hinnant __h2.release(); 46283e519524SHoward Hinnant return; 46293e519524SHoward Hinnant } 46303e519524SHoward Hinnant if (__len <= 8) 46313e519524SHoward Hinnant { 46323e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46333e519524SHoward Hinnant return; 46343e519524SHoward Hinnant } 46353e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46363e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46373e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46383e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46393e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46403e519524SHoward Hinnant} 46413e519524SHoward Hinnant 46423e519524SHoward Hinnanttemplate <class _Tp> 46433e519524SHoward Hinnantstruct __stable_sort_switch 46443e519524SHoward Hinnant{ 4645ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46463e519524SHoward Hinnant}; 46473e519524SHoward Hinnant 46483e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46493e519524SHoward Hinnantvoid 46503e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46513e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46523e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46533e519524SHoward Hinnant{ 46543e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46563e519524SHoward Hinnant switch (__len) 46573e519524SHoward Hinnant { 46583e519524SHoward Hinnant case 0: 46593e519524SHoward Hinnant case 1: 46603e519524SHoward Hinnant return; 46613e519524SHoward Hinnant case 2: 46623e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46633e519524SHoward Hinnant swap(*__first, *__last); 46643e519524SHoward Hinnant return; 46653e519524SHoward Hinnant } 46663e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46673e519524SHoward Hinnant { 46683e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46693e519524SHoward Hinnant return; 46703e519524SHoward Hinnant } 46713e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46723e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46733e519524SHoward Hinnant if (__len <= __buff_size) 46743e519524SHoward Hinnant { 46753e519524SHoward Hinnant __destruct_n __d(0); 46763e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46773e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46783e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46793e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46803e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46813e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46823e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46833e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46843e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46853e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46863e519524SHoward Hinnant// __first, __comp); 46873e519524SHoward Hinnant return; 46883e519524SHoward Hinnant } 46893e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46903e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46913e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46923e519524SHoward Hinnant} 46933e519524SHoward Hinnant 46943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46963e519524SHoward Hinnantvoid 46973e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46983e519524SHoward Hinnant{ 46993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47003e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47013e519524SHoward Hinnant difference_type __len = __last - __first; 47023e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47033e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47043e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47053e519524SHoward Hinnant { 4706ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47073e519524SHoward Hinnant __h.reset(__buf.first); 47083e519524SHoward Hinnant } 4709145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47103e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47113e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47123e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4713145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47143e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47153e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4716145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47173e519524SHoward Hinnant} 47183e519524SHoward Hinnant 47193e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47213e519524SHoward Hinnantvoid 47223e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47233e519524SHoward Hinnant{ 4724ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47253e519524SHoward Hinnant} 47263e519524SHoward Hinnant 47273e519524SHoward Hinnant// is_heap_until 47283e519524SHoward Hinnant 47293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47303e519524SHoward Hinnant_RandomAccessIterator 47313e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47323e519524SHoward Hinnant{ 4733ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47343e519524SHoward Hinnant difference_type __len = __last - __first; 47353e519524SHoward Hinnant difference_type __p = 0; 47363e519524SHoward Hinnant difference_type __c = 1; 47373e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47383e519524SHoward Hinnant while (__c < __len) 47393e519524SHoward Hinnant { 47403e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47413e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47423e519524SHoward Hinnant return __cp; 47433e519524SHoward Hinnant ++__c; 47443e519524SHoward Hinnant ++__cp; 47453e519524SHoward Hinnant if (__c == __len) 47463e519524SHoward Hinnant return __last; 47473e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47483e519524SHoward Hinnant return __cp; 47493e519524SHoward Hinnant ++__p; 47503e519524SHoward Hinnant ++__pp; 47513e519524SHoward Hinnant __c = 2 * __p + 1; 47523e519524SHoward Hinnant } 47533e519524SHoward Hinnant return __last; 47543e519524SHoward Hinnant} 47553e519524SHoward Hinnant 47563e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47583e519524SHoward Hinnant_RandomAccessIterator 47593e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47603e519524SHoward Hinnant{ 4761ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47623e519524SHoward Hinnant} 47633e519524SHoward Hinnant 47643e519524SHoward Hinnant// is_heap 47653e519524SHoward Hinnant 47663e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47683e519524SHoward Hinnantbool 47693e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47703e519524SHoward Hinnant{ 4771ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47723e519524SHoward Hinnant} 47733e519524SHoward Hinnant 47743e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47763e519524SHoward Hinnantbool 47773e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47783e519524SHoward Hinnant{ 4779ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47803e519524SHoward Hinnant} 47813e519524SHoward Hinnant 47823e519524SHoward Hinnant// push_heap 47833e519524SHoward Hinnant 47843e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47853e519524SHoward Hinnantvoid 47863e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 47873e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47883e519524SHoward Hinnant{ 47893e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47913e519524SHoward Hinnant if (__len > 1) 47923e519524SHoward Hinnant { 47933e519524SHoward Hinnant difference_type __p = 0; 47943e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47953e519524SHoward Hinnant difference_type __c = 2; 47963e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47973e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47983e519524SHoward Hinnant { 47993e519524SHoward Hinnant --__c; 48003e519524SHoward Hinnant --__cp; 48013e519524SHoward Hinnant } 48023e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48033e519524SHoward Hinnant { 4804ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__pp)); 48053e519524SHoward Hinnant do 48063e519524SHoward Hinnant { 4807ce48a113SHoward Hinnant *__pp = _VSTD::move(*__cp); 48083e519524SHoward Hinnant __pp = __cp; 48093e519524SHoward Hinnant __p = __c; 48103e519524SHoward Hinnant __c = (__p + 1) * 2; 48113e519524SHoward Hinnant if (__c > __len) 48123e519524SHoward Hinnant break; 48133e519524SHoward Hinnant __cp = __first + __c; 48143e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 48153e519524SHoward Hinnant { 48163e519524SHoward Hinnant --__c; 48173e519524SHoward Hinnant --__cp; 48183e519524SHoward Hinnant } 48193e519524SHoward Hinnant } while (__comp(__t, *__cp)); 4820ce48a113SHoward Hinnant *__pp = _VSTD::move(__t); 48213e519524SHoward Hinnant } 48223e519524SHoward Hinnant } 48233e519524SHoward Hinnant} 48243e519524SHoward Hinnant 48253e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48263e519524SHoward Hinnantvoid 48273e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48283e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48293e519524SHoward Hinnant{ 48303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48313e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48323e519524SHoward Hinnant if (__len > 1) 48333e519524SHoward Hinnant { 48343e519524SHoward Hinnant __len = (__len - 2) / 2; 48353e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48363e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48373e519524SHoward Hinnant { 4838ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48393e519524SHoward Hinnant do 48403e519524SHoward Hinnant { 4841ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48423e519524SHoward Hinnant __last = __ptr; 48433e519524SHoward Hinnant if (__len == 0) 48443e519524SHoward Hinnant break; 48453e519524SHoward Hinnant __len = (__len - 1) / 2; 48463e519524SHoward Hinnant __ptr = __first + __len; 48473e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4848ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48493e519524SHoward Hinnant } 48503e519524SHoward Hinnant } 48513e519524SHoward Hinnant} 48523e519524SHoward Hinnant 48533e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48553e519524SHoward Hinnantvoid 48563e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48573e519524SHoward Hinnant{ 4858145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48613e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4862145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48643e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4865145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48663e519524SHoward Hinnant} 48673e519524SHoward Hinnant 48683e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48703e519524SHoward Hinnantvoid 48713e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48723e519524SHoward Hinnant{ 4873ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48743e519524SHoward Hinnant} 48753e519524SHoward Hinnant 48763e519524SHoward Hinnant// pop_heap 48773e519524SHoward Hinnant 48783e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48803e519524SHoward Hinnantvoid 48813e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48823e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48833e519524SHoward Hinnant{ 48843e519524SHoward Hinnant if (__len > 1) 48853e519524SHoward Hinnant { 48863e519524SHoward Hinnant swap(*__first, *--__last); 48873e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 48883e519524SHoward Hinnant } 48893e519524SHoward Hinnant} 48903e519524SHoward Hinnant 48913e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48933e519524SHoward Hinnantvoid 48943e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48953e519524SHoward Hinnant{ 4896145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48973e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48983e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48993e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4900145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49013e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49023e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4903145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49043e519524SHoward Hinnant} 49053e519524SHoward Hinnant 49063e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49083e519524SHoward Hinnantvoid 49093e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49103e519524SHoward Hinnant{ 4911ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49123e519524SHoward Hinnant} 49133e519524SHoward Hinnant 49143e519524SHoward Hinnant// make_heap 49153e519524SHoward Hinnant 49163e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49173e519524SHoward Hinnantvoid 49183e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49193e519524SHoward Hinnant{ 49203e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49213e519524SHoward Hinnant difference_type __n = __last - __first; 49223e519524SHoward Hinnant if (__n > 1) 49233e519524SHoward Hinnant { 49243e519524SHoward Hinnant __last = __first; 49253e519524SHoward Hinnant ++__last; 49263e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 49273e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 49283e519524SHoward Hinnant } 49293e519524SHoward Hinnant} 49303e519524SHoward Hinnant 49313e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49333e519524SHoward Hinnantvoid 49343e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49353e519524SHoward Hinnant{ 4936145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49373e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49383e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49393e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4940145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49413e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49423e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4943145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49443e519524SHoward Hinnant} 49453e519524SHoward Hinnant 49463e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49483e519524SHoward Hinnantvoid 49493e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49503e519524SHoward Hinnant{ 4951ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49523e519524SHoward Hinnant} 49533e519524SHoward Hinnant 49543e519524SHoward Hinnant// sort_heap 49553e519524SHoward Hinnant 49563e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49573e519524SHoward Hinnantvoid 49583e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49593e519524SHoward Hinnant{ 49603e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49613e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49623e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49633e519524SHoward Hinnant} 49643e519524SHoward Hinnant 49653e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49673e519524SHoward Hinnantvoid 49683e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49693e519524SHoward Hinnant{ 4970145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49713e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49723e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49733e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4974145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49753e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49763e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4977145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49783e519524SHoward Hinnant} 49793e519524SHoward Hinnant 49803e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49823e519524SHoward Hinnantvoid 49833e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49843e519524SHoward Hinnant{ 4985ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49863e519524SHoward Hinnant} 49873e519524SHoward Hinnant 49883e519524SHoward Hinnant// partial_sort 49893e519524SHoward Hinnant 49903e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49913e519524SHoward Hinnantvoid 49923e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49933e519524SHoward Hinnant _Compare __comp) 49943e519524SHoward Hinnant{ 49953e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49963e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49973e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49983e519524SHoward Hinnant { 49993e519524SHoward Hinnant if (__comp(*__i, *__first)) 50003e519524SHoward Hinnant { 50013e519524SHoward Hinnant swap(*__i, *__first); 50023e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 50033e519524SHoward Hinnant } 50043e519524SHoward Hinnant } 50053e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50063e519524SHoward Hinnant} 50073e519524SHoward Hinnant 50083e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50103e519524SHoward Hinnantvoid 50113e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50123e519524SHoward Hinnant _Compare __comp) 50133e519524SHoward Hinnant{ 5014145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50153e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50163e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50173e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5018145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50193e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50203e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5021145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50223e519524SHoward Hinnant} 50233e519524SHoward Hinnant 50243e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50263e519524SHoward Hinnantvoid 50273e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50283e519524SHoward Hinnant{ 5029ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50303e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50313e519524SHoward Hinnant} 50323e519524SHoward Hinnant 50333e519524SHoward Hinnant// partial_sort_copy 50343e519524SHoward Hinnant 50353e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50363e519524SHoward Hinnant_RandomAccessIterator 50373e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50383e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50393e519524SHoward Hinnant{ 50403e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50413e519524SHoward Hinnant if (__r != __result_last) 50423e519524SHoward Hinnant { 50433e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 50443e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 50453e519524SHoward Hinnant *__r = *__first; 50463e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50473e519524SHoward Hinnant for (; __first != __last; ++__first) 50483e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50493e519524SHoward Hinnant { 50503e519524SHoward Hinnant *__result_first = *__first; 50513e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 50523e519524SHoward Hinnant } 50533e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50543e519524SHoward Hinnant } 50553e519524SHoward Hinnant return __r; 50563e519524SHoward Hinnant} 50573e519524SHoward Hinnant 50583e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50603e519524SHoward Hinnant_RandomAccessIterator 50613e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50623e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50633e519524SHoward Hinnant{ 5064145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50653e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50663e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50673e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5068145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50693e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50703e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5071145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50723e519524SHoward Hinnant} 50733e519524SHoward Hinnant 50743e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50763e519524SHoward Hinnant_RandomAccessIterator 50773e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50783e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50793e519524SHoward Hinnant{ 5080ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50813e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50823e519524SHoward Hinnant} 50833e519524SHoward Hinnant 50843e519524SHoward Hinnant// nth_element 50853e519524SHoward Hinnant 50863e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50873e519524SHoward Hinnantvoid 50883e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50893e519524SHoward Hinnant{ 50903e519524SHoward Hinnant // _Compare is known to be a reference type 50913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50923e519524SHoward Hinnant const difference_type __limit = 7; 50933e519524SHoward Hinnant while (true) 50943e519524SHoward Hinnant { 50953e519524SHoward Hinnant __restart: 5096b34b4819SHoward Hinnant if (__nth == __last) 5097b34b4819SHoward Hinnant return; 50983e519524SHoward Hinnant difference_type __len = __last - __first; 50993e519524SHoward Hinnant switch (__len) 51003e519524SHoward Hinnant { 51013e519524SHoward Hinnant case 0: 51023e519524SHoward Hinnant case 1: 51033e519524SHoward Hinnant return; 51043e519524SHoward Hinnant case 2: 51053e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51063e519524SHoward Hinnant swap(*__first, *__last); 51073e519524SHoward Hinnant return; 51083e519524SHoward Hinnant case 3: 51093e519524SHoward Hinnant { 51103e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5111ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51123e519524SHoward Hinnant return; 51133e519524SHoward Hinnant } 51143e519524SHoward Hinnant } 51153e519524SHoward Hinnant if (__len <= __limit) 51163e519524SHoward Hinnant { 51173e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51183e519524SHoward Hinnant return; 51193e519524SHoward Hinnant } 51203e519524SHoward Hinnant // __len > __limit >= 3 51213e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51223e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5123ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51243e519524SHoward Hinnant // *__m is median 51253e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51263e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51273e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51283e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51293e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51303e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51313e519524SHoward Hinnant // Prime the downward search with a guard. 51323e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51333e519524SHoward Hinnant { 51343e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51353e519524SHoward Hinnant // manually guard downward moving __j against __i 51363e519524SHoward Hinnant while (true) 51373e519524SHoward Hinnant { 51383e519524SHoward Hinnant if (__i == --__j) 51393e519524SHoward Hinnant { 51403e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51413e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51423e519524SHoward Hinnant ++__i; // __first + 1 51433e519524SHoward Hinnant __j = __last; 51443e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51453e519524SHoward Hinnant { 51463e519524SHoward Hinnant while (true) 51473e519524SHoward Hinnant { 51483e519524SHoward Hinnant if (__i == __j) 51493e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51503e519524SHoward Hinnant if (__comp(*__first, *__i)) 51513e519524SHoward Hinnant { 51523e519524SHoward Hinnant swap(*__i, *__j); 51533e519524SHoward Hinnant ++__n_swaps; 51543e519524SHoward Hinnant ++__i; 51553e519524SHoward Hinnant break; 51563e519524SHoward Hinnant } 51573e519524SHoward Hinnant ++__i; 51583e519524SHoward Hinnant } 51593e519524SHoward Hinnant } 51603e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51613e519524SHoward Hinnant if (__i == __j) 51623e519524SHoward Hinnant return; 51633e519524SHoward Hinnant while (true) 51643e519524SHoward Hinnant { 51653e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51663e519524SHoward Hinnant ++__i; 51673e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51683e519524SHoward Hinnant ; 51693e519524SHoward Hinnant if (__i >= __j) 51703e519524SHoward Hinnant break; 51713e519524SHoward Hinnant swap(*__i, *__j); 51723e519524SHoward Hinnant ++__n_swaps; 51733e519524SHoward Hinnant ++__i; 51743e519524SHoward Hinnant } 51753e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51763e519524SHoward Hinnant // The first part is sorted, 51773e519524SHoward Hinnant if (__nth < __i) 51783e519524SHoward Hinnant return; 51793e519524SHoward Hinnant // __nth_element the secod part 51803e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51813e519524SHoward Hinnant __first = __i; 51823e519524SHoward Hinnant goto __restart; 51833e519524SHoward Hinnant } 51843e519524SHoward Hinnant if (__comp(*__j, *__m)) 51853e519524SHoward Hinnant { 51863e519524SHoward Hinnant swap(*__i, *__j); 51873e519524SHoward Hinnant ++__n_swaps; 51883e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51893e519524SHoward Hinnant } 51903e519524SHoward Hinnant } 51913e519524SHoward Hinnant } 51923e519524SHoward Hinnant ++__i; 51933e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51943e519524SHoward Hinnant // if not yet partitioned... 51953e519524SHoward Hinnant if (__i < __j) 51963e519524SHoward Hinnant { 51973e519524SHoward Hinnant // known that *(__i - 1) < *__m 51983e519524SHoward Hinnant while (true) 51993e519524SHoward Hinnant { 52003e519524SHoward Hinnant // __m still guards upward moving __i 52013e519524SHoward Hinnant while (__comp(*__i, *__m)) 52023e519524SHoward Hinnant ++__i; 52033e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52043e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52053e519524SHoward Hinnant ; 52063e519524SHoward Hinnant if (__i >= __j) 52073e519524SHoward Hinnant break; 52083e519524SHoward Hinnant swap(*__i, *__j); 52093e519524SHoward Hinnant ++__n_swaps; 52103e519524SHoward Hinnant // It is known that __m != __j 52113e519524SHoward Hinnant // If __m just moved, follow it 52123e519524SHoward Hinnant if (__m == __i) 52133e519524SHoward Hinnant __m = __j; 52143e519524SHoward Hinnant ++__i; 52153e519524SHoward Hinnant } 52163e519524SHoward Hinnant } 52173e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52183e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52193e519524SHoward Hinnant { 52203e519524SHoward Hinnant swap(*__i, *__m); 52213e519524SHoward Hinnant ++__n_swaps; 52223e519524SHoward Hinnant } 52233e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52243e519524SHoward Hinnant if (__nth == __i) 52253e519524SHoward Hinnant return; 52263e519524SHoward Hinnant if (__n_swaps == 0) 52273e519524SHoward Hinnant { 52283e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52293e519524SHoward Hinnant if (__nth < __i) 52303e519524SHoward Hinnant { 52313e519524SHoward Hinnant // Check for [__first, __i) already sorted 52323e519524SHoward Hinnant __j = __m = __first; 52333e519524SHoward Hinnant while (++__j != __i) 52343e519524SHoward Hinnant { 52353e519524SHoward Hinnant if (__comp(*__j, *__m)) 52363e519524SHoward Hinnant // not yet sorted, so sort 52373e519524SHoward Hinnant goto not_sorted; 52383e519524SHoward Hinnant __m = __j; 52393e519524SHoward Hinnant } 52403e519524SHoward Hinnant // [__first, __i) sorted 52413e519524SHoward Hinnant return; 52423e519524SHoward Hinnant } 52433e519524SHoward Hinnant else 52443e519524SHoward Hinnant { 52453e519524SHoward Hinnant // Check for [__i, __last) already sorted 52463e519524SHoward Hinnant __j = __m = __i; 52473e519524SHoward Hinnant while (++__j != __last) 52483e519524SHoward Hinnant { 52493e519524SHoward Hinnant if (__comp(*__j, *__m)) 52503e519524SHoward Hinnant // not yet sorted, so sort 52513e519524SHoward Hinnant goto not_sorted; 52523e519524SHoward Hinnant __m = __j; 52533e519524SHoward Hinnant } 52543e519524SHoward Hinnant // [__i, __last) sorted 52553e519524SHoward Hinnant return; 52563e519524SHoward Hinnant } 52573e519524SHoward Hinnant } 52583e519524SHoward Hinnantnot_sorted: 52593e519524SHoward Hinnant // __nth_element on range containing __nth 52603e519524SHoward Hinnant if (__nth < __i) 52613e519524SHoward Hinnant { 52623e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52633e519524SHoward Hinnant __last = __i; 52643e519524SHoward Hinnant } 52653e519524SHoward Hinnant else 52663e519524SHoward Hinnant { 52673e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52683e519524SHoward Hinnant __first = ++__i; 52693e519524SHoward Hinnant } 52703e519524SHoward Hinnant } 52713e519524SHoward Hinnant} 52723e519524SHoward Hinnant 52733e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52753e519524SHoward Hinnantvoid 52763e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52773e519524SHoward Hinnant{ 5278145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52793e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52803e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52813e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5282145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52833e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52843e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5285145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52863e519524SHoward Hinnant} 52873e519524SHoward Hinnant 52883e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52903e519524SHoward Hinnantvoid 52913e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52923e519524SHoward Hinnant{ 5293ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52943e519524SHoward Hinnant} 52953e519524SHoward Hinnant 52963e519524SHoward Hinnant// includes 52973e519524SHoward Hinnant 52983e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52993e519524SHoward Hinnantbool 53003e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53013e519524SHoward Hinnant _Compare __comp) 53023e519524SHoward Hinnant{ 53033e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53043e519524SHoward Hinnant { 53053e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53063e519524SHoward Hinnant return false; 53073e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53083e519524SHoward Hinnant ++__first2; 53093e519524SHoward Hinnant } 53103e519524SHoward Hinnant return true; 53113e519524SHoward Hinnant} 53123e519524SHoward Hinnant 53133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53153e519524SHoward Hinnantbool 53163e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53173e519524SHoward Hinnant _Compare __comp) 53183e519524SHoward Hinnant{ 5319145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53223e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5323145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53253e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5326145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53273e519524SHoward Hinnant} 53283e519524SHoward Hinnant 53293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53313e519524SHoward Hinnantbool 53323e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53333e519524SHoward Hinnant{ 5334ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53353e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53363e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53373e519524SHoward Hinnant} 53383e519524SHoward Hinnant 53393e519524SHoward Hinnant// set_union 53403e519524SHoward Hinnant 53413e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53423e519524SHoward Hinnant_OutputIterator 53433e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53443e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53453e519524SHoward Hinnant{ 53463e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53473e519524SHoward Hinnant { 53483e519524SHoward Hinnant if (__first2 == __last2) 5349ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53503e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53513e519524SHoward Hinnant { 53523e519524SHoward Hinnant *__result = *__first2; 53533e519524SHoward Hinnant ++__first2; 53543e519524SHoward Hinnant } 53553e519524SHoward Hinnant else 53563e519524SHoward Hinnant { 53573e519524SHoward Hinnant *__result = *__first1; 53583e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53593e519524SHoward Hinnant ++__first2; 53603e519524SHoward Hinnant ++__first1; 53613e519524SHoward Hinnant } 53623e519524SHoward Hinnant } 5363ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53643e519524SHoward Hinnant} 53653e519524SHoward Hinnant 53663e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53683e519524SHoward Hinnant_OutputIterator 53693e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53703e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53713e519524SHoward Hinnant{ 5372145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53733e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53743e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53753e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5376145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53773e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53783e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5379145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53803e519524SHoward Hinnant} 53813e519524SHoward Hinnant 53823e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53843e519524SHoward Hinnant_OutputIterator 53853e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53863e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53873e519524SHoward Hinnant{ 5388ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53893e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53903e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53913e519524SHoward Hinnant} 53923e519524SHoward Hinnant 53933e519524SHoward Hinnant// set_intersection 53943e519524SHoward Hinnant 53953e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53963e519524SHoward Hinnant_OutputIterator 53973e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53983e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53993e519524SHoward Hinnant{ 54003e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54013e519524SHoward Hinnant { 54023e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54033e519524SHoward Hinnant ++__first1; 54043e519524SHoward Hinnant else 54053e519524SHoward Hinnant { 54063e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54073e519524SHoward Hinnant { 54083e519524SHoward Hinnant *__result = *__first1; 54093e519524SHoward Hinnant ++__result; 54103e519524SHoward Hinnant ++__first1; 54113e519524SHoward Hinnant } 54123e519524SHoward Hinnant ++__first2; 54133e519524SHoward Hinnant } 54143e519524SHoward Hinnant } 54153e519524SHoward Hinnant return __result; 54163e519524SHoward Hinnant} 54173e519524SHoward Hinnant 54183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54203e519524SHoward Hinnant_OutputIterator 54213e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54223e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54233e519524SHoward Hinnant{ 5424145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54253e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54263e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54273e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5428145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54293e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54303e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5431145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54323e519524SHoward Hinnant} 54333e519524SHoward Hinnant 54343e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54363e519524SHoward Hinnant_OutputIterator 54373e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54383e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54393e519524SHoward Hinnant{ 5440ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54413e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54423e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54433e519524SHoward Hinnant} 54443e519524SHoward Hinnant 54453e519524SHoward Hinnant// set_difference 54463e519524SHoward Hinnant 54473e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54483e519524SHoward Hinnant_OutputIterator 54493e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54503e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54513e519524SHoward Hinnant{ 54523e519524SHoward Hinnant while (__first1 != __last1) 54533e519524SHoward Hinnant { 54543e519524SHoward Hinnant if (__first2 == __last2) 5455ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54563e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54573e519524SHoward Hinnant { 54583e519524SHoward Hinnant *__result = *__first1; 54593e519524SHoward Hinnant ++__result; 54603e519524SHoward Hinnant ++__first1; 54613e519524SHoward Hinnant } 54623e519524SHoward Hinnant else 54633e519524SHoward Hinnant { 54643e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54653e519524SHoward Hinnant ++__first1; 54663e519524SHoward Hinnant ++__first2; 54673e519524SHoward Hinnant } 54683e519524SHoward Hinnant } 54693e519524SHoward Hinnant return __result; 54703e519524SHoward Hinnant} 54713e519524SHoward Hinnant 54723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54743e519524SHoward Hinnant_OutputIterator 54753e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54773e519524SHoward Hinnant{ 5478145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54793e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54803e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54813e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5482145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54833e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54843e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5485145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54863e519524SHoward Hinnant} 54873e519524SHoward Hinnant 54883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54903e519524SHoward Hinnant_OutputIterator 54913e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54933e519524SHoward Hinnant{ 5494ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54953e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54963e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54973e519524SHoward Hinnant} 54983e519524SHoward Hinnant 54993e519524SHoward Hinnant// set_symmetric_difference 55003e519524SHoward Hinnant 55013e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55023e519524SHoward Hinnant_OutputIterator 55033e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55043e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55053e519524SHoward Hinnant{ 55063e519524SHoward Hinnant while (__first1 != __last1) 55073e519524SHoward Hinnant { 55083e519524SHoward Hinnant if (__first2 == __last2) 5509ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55103e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55113e519524SHoward Hinnant { 55123e519524SHoward Hinnant *__result = *__first1; 55133e519524SHoward Hinnant ++__result; 55143e519524SHoward Hinnant ++__first1; 55153e519524SHoward Hinnant } 55163e519524SHoward Hinnant else 55173e519524SHoward Hinnant { 55183e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55193e519524SHoward Hinnant { 55203e519524SHoward Hinnant *__result = *__first2; 55213e519524SHoward Hinnant ++__result; 55223e519524SHoward Hinnant } 55233e519524SHoward Hinnant else 55243e519524SHoward Hinnant ++__first1; 55253e519524SHoward Hinnant ++__first2; 55263e519524SHoward Hinnant } 55273e519524SHoward Hinnant } 5528ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55293e519524SHoward Hinnant} 55303e519524SHoward Hinnant 55313e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55333e519524SHoward Hinnant_OutputIterator 55343e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55353e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55363e519524SHoward Hinnant{ 5537145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55403e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5541145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55433e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5544145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55453e519524SHoward Hinnant} 55463e519524SHoward Hinnant 55473e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55493e519524SHoward Hinnant_OutputIterator 55503e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55513e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55523e519524SHoward Hinnant{ 5553ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55543e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55553e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55563e519524SHoward Hinnant} 55573e519524SHoward Hinnant 55583e519524SHoward Hinnant// lexicographical_compare 55593e519524SHoward Hinnant 55603e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55613e519524SHoward Hinnantbool 55623e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55633e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55643e519524SHoward Hinnant{ 55653e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 55663e519524SHoward Hinnant { 55673e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55683e519524SHoward Hinnant return true; 55693e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55703e519524SHoward Hinnant return false; 55713e519524SHoward Hinnant } 55723e519524SHoward Hinnant return false; 55733e519524SHoward Hinnant} 55743e519524SHoward Hinnant 55753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55773e519524SHoward Hinnantbool 55783e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55803e519524SHoward Hinnant{ 5581145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55823e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55833e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55843e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5585145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55863e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55873e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5588145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55893e519524SHoward Hinnant} 55903e519524SHoward Hinnant 55913e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55933e519524SHoward Hinnantbool 55943e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55953e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55963e519524SHoward Hinnant{ 5597ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55983e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55993e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56003e519524SHoward Hinnant} 56013e519524SHoward Hinnant 56023e519524SHoward Hinnant// next_permutation 56033e519524SHoward Hinnant 56043e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56053e519524SHoward Hinnantbool 56063e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56073e519524SHoward Hinnant{ 56083e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56093e519524SHoward Hinnant if (__first == __last || __first == --__i) 56103e519524SHoward Hinnant return false; 56113e519524SHoward Hinnant while (true) 56123e519524SHoward Hinnant { 56133e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56143e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56153e519524SHoward Hinnant { 56163e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56173e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56183e519524SHoward Hinnant ; 56193e519524SHoward Hinnant swap(*__i, *__j); 5620ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56213e519524SHoward Hinnant return true; 56223e519524SHoward Hinnant } 56233e519524SHoward Hinnant if (__i == __first) 56243e519524SHoward Hinnant { 5625ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56263e519524SHoward Hinnant return false; 56273e519524SHoward Hinnant } 56283e519524SHoward Hinnant } 56293e519524SHoward Hinnant} 56303e519524SHoward Hinnant 56313e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56333e519524SHoward Hinnantbool 56343e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56353e519524SHoward Hinnant{ 5636145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56373e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56383e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56393e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5640145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56413e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56423e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5643145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56443e519524SHoward Hinnant} 56453e519524SHoward Hinnant 56463e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56483e519524SHoward Hinnantbool 56493e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56503e519524SHoward Hinnant{ 5651ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56523e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56533e519524SHoward Hinnant} 56543e519524SHoward Hinnant 56553e519524SHoward Hinnant// prev_permutation 56563e519524SHoward Hinnant 56573e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56583e519524SHoward Hinnantbool 56593e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56603e519524SHoward Hinnant{ 56613e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56623e519524SHoward Hinnant if (__first == __last || __first == --__i) 56633e519524SHoward Hinnant return false; 56643e519524SHoward Hinnant while (true) 56653e519524SHoward Hinnant { 56663e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56673e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56683e519524SHoward Hinnant { 56693e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56703e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56713e519524SHoward Hinnant ; 56723e519524SHoward Hinnant swap(*__i, *__j); 5673ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56743e519524SHoward Hinnant return true; 56753e519524SHoward Hinnant } 56763e519524SHoward Hinnant if (__i == __first) 56773e519524SHoward Hinnant { 5678ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56793e519524SHoward Hinnant return false; 56803e519524SHoward Hinnant } 56813e519524SHoward Hinnant } 56823e519524SHoward Hinnant} 56833e519524SHoward Hinnant 56843e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56863e519524SHoward Hinnantbool 56873e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56883e519524SHoward Hinnant{ 5689145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56903e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56913e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56923e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5693145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56943e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56953e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5696145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56973e519524SHoward Hinnant} 56983e519524SHoward Hinnant 56993e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57013e519524SHoward Hinnantbool 57023e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57033e519524SHoward Hinnant{ 5704ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57053e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57063e519524SHoward Hinnant} 57073e519524SHoward Hinnant 57083e519524SHoward Hinnanttemplate <class _Tp> 57093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57103e519524SHoward Hinnanttypename enable_if 57113e519524SHoward Hinnant< 57123e519524SHoward Hinnant is_integral<_Tp>::value, 57133e519524SHoward Hinnant _Tp 57143e519524SHoward Hinnant>::type 57153e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 57163e519524SHoward Hinnant{ 57173e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57183e519524SHoward Hinnant __n &= __bits; 57193e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 57203e519524SHoward Hinnant} 57213e519524SHoward Hinnant 57223e519524SHoward Hinnanttemplate <class _Tp> 57233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57243e519524SHoward Hinnanttypename enable_if 57253e519524SHoward Hinnant< 57263e519524SHoward Hinnant is_integral<_Tp>::value, 57273e519524SHoward Hinnant _Tp 57283e519524SHoward Hinnant>::type 57293e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 57303e519524SHoward Hinnant{ 57313e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57323e519524SHoward Hinnant __n &= __bits; 57333e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 57343e519524SHoward Hinnant} 57353e519524SHoward Hinnant 57363e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57373e519524SHoward Hinnant 57383e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5739