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 284*06965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 288*06965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 289*06965c1fSMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14 2903e519524SHoward Hinnant 291f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 292f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 293fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 294f9d540b0SHoward Hinnant 2953e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2963e519524SHoward Hinnant bool 2973e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2983e519524SHoward Hinnant 2993e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3003e519524SHoward Hinnant ForwardIterator 3013e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3023e519524SHoward Hinnant 3033e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3043e519524SHoward Hinnant class OutputIterator2, class Predicate> 3053e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3063e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3073e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3083e519524SHoward Hinnant Predicate pred); 3093e519524SHoward Hinnant 3103e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3113e519524SHoward Hinnant ForwardIterator 3123e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3133e519524SHoward Hinnant 3143e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3153e519524SHoward Hinnant ForwardIterator 3163e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3173e519524SHoward Hinnant 3183e519524SHoward Hinnanttemplate <class ForwardIterator> 3193e519524SHoward Hinnant bool 3203e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3213e519524SHoward Hinnant 3223e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3233e519524SHoward Hinnant bool 3243e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3253e519524SHoward Hinnant 3263e519524SHoward Hinnanttemplate<class ForwardIterator> 3273e519524SHoward Hinnant ForwardIterator 3283e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3293e519524SHoward Hinnant 3303e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3313e519524SHoward Hinnant ForwardIterator 3323e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3353e519524SHoward Hinnant void 3363e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3393e519524SHoward Hinnant void 3403e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3433e519524SHoward Hinnant void 3443e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3473e519524SHoward Hinnant void 3483e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3513e519524SHoward Hinnant void 3523e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3533e519524SHoward Hinnant 3543e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3553e519524SHoward Hinnant void 3563e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3573e519524SHoward Hinnant 3583e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3593e519524SHoward Hinnant RandomAccessIterator 3603e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3613e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3623e519524SHoward Hinnant 3633e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3643e519524SHoward Hinnant RandomAccessIterator 3653e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3663e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3673e519524SHoward Hinnant 3683e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3693e519524SHoward Hinnant void 3703e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3713e519524SHoward Hinnant 3723e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3733e519524SHoward Hinnant void 3743e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3753e519524SHoward Hinnant 3763e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3773e519524SHoward Hinnant ForwardIterator 3783e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3793e519524SHoward Hinnant 3803e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3813e519524SHoward Hinnant ForwardIterator 3823e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3833e519524SHoward Hinnant 3843e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3853e519524SHoward Hinnant ForwardIterator 3863e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3873e519524SHoward Hinnant 3883e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3893e519524SHoward Hinnant ForwardIterator 3903e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3913e519524SHoward Hinnant 3923e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3933e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3943e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3953e519524SHoward Hinnant 3963e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3973e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3983e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3993e519524SHoward Hinnant 4003e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4013e519524SHoward Hinnant bool 4023e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4033e519524SHoward Hinnant 4043e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4053e519524SHoward Hinnant bool 4063e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4073e519524SHoward Hinnant 4083e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4093e519524SHoward Hinnant OutputIterator 4103e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4113e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4123e519524SHoward Hinnant 4133e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4143e519524SHoward Hinnant OutputIterator 4153e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4163e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4173e519524SHoward Hinnant 4183e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4193e519524SHoward Hinnant void 4203e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4213e519524SHoward Hinnant 4223e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4233e519524SHoward Hinnant void 4243e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4253e519524SHoward Hinnant 4263e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4273e519524SHoward Hinnant bool 4283e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4293e519524SHoward Hinnant 4303e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4313e519524SHoward Hinnant bool 4323e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4333e519524SHoward Hinnant 4343e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4353e519524SHoward Hinnant OutputIterator 4363e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4373e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4383e519524SHoward Hinnant 4393e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4403e519524SHoward Hinnant OutputIterator 4413e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4423e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4433e519524SHoward Hinnant 4443e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4453e519524SHoward Hinnant OutputIterator 4463e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4473e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4483e519524SHoward Hinnant 4493e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4503e519524SHoward Hinnant OutputIterator 4513e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4523e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4533e519524SHoward Hinnant 4543e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4553e519524SHoward Hinnant OutputIterator 4563e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4573e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4583e519524SHoward Hinnant 4593e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4603e519524SHoward Hinnant OutputIterator 4613e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4623e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4633e519524SHoward Hinnant 4643e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4653e519524SHoward Hinnant OutputIterator 4663e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4673e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4683e519524SHoward Hinnant 4693e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4703e519524SHoward Hinnant OutputIterator 4713e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4723e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4733e519524SHoward Hinnant 4743e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4753e519524SHoward Hinnant void 4763e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4773e519524SHoward Hinnant 4783e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4793e519524SHoward Hinnant void 4803e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4813e519524SHoward Hinnant 4823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4833e519524SHoward Hinnant void 4843e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4853e519524SHoward Hinnant 4863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4873e519524SHoward Hinnant void 4883e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4893e519524SHoward Hinnant 4903e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4913e519524SHoward Hinnant void 4923e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4933e519524SHoward Hinnant 4943e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4953e519524SHoward Hinnant void 4963e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4973e519524SHoward Hinnant 4983e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4993e519524SHoward Hinnant void 5003e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5013e519524SHoward Hinnant 5023e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5033e519524SHoward Hinnant void 5043e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5053e519524SHoward Hinnant 5063e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5073e519524SHoward Hinnant bool 5083e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5093e519524SHoward Hinnant 5103e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5113e519524SHoward Hinnant bool 5123e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5133e519524SHoward Hinnant 5143e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5153e519524SHoward Hinnant RandomAccessIterator 5163e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5173e519524SHoward Hinnant 5183e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5193e519524SHoward Hinnant RandomAccessIterator 5203e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5213e519524SHoward Hinnant 5224eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5234eb27b79SHoward Hinnant ForwardIterator 5244eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 5254eb27b79SHoward Hinnant 5264eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5274eb27b79SHoward Hinnant ForwardIterator 5284eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 5294eb27b79SHoward Hinnant 5303e519524SHoward Hinnanttemplate <class T> 5313e519524SHoward Hinnant const T& 5329d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5333e519524SHoward Hinnant 5343e519524SHoward Hinnanttemplate <class T, class Compare> 5353e519524SHoward Hinnant const T& 5369d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5373e519524SHoward Hinnant 5383e519524SHoward Hinnanttemplate<class T> 5394eb27b79SHoward Hinnant T 5409d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5413e519524SHoward Hinnant 5423e519524SHoward Hinnanttemplate<class T, class Compare> 5434eb27b79SHoward Hinnant T 5449d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5453e519524SHoward Hinnant 5463e519524SHoward Hinnanttemplate <class ForwardIterator> 5473e519524SHoward Hinnant ForwardIterator 5483e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5493e519524SHoward Hinnant 5503e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5513e519524SHoward Hinnant ForwardIterator 5523e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5533e519524SHoward Hinnant 5544eb27b79SHoward Hinnanttemplate <class T> 5554eb27b79SHoward Hinnant const T& 5569d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5574eb27b79SHoward Hinnant 5584eb27b79SHoward Hinnanttemplate <class T, class Compare> 5594eb27b79SHoward Hinnant const T& 5609d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5614eb27b79SHoward Hinnant 5624eb27b79SHoward Hinnanttemplate<class T> 5634eb27b79SHoward Hinnant T 5649d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5654eb27b79SHoward Hinnant 5664eb27b79SHoward Hinnanttemplate<class T, class Compare> 5674eb27b79SHoward Hinnant T 5689d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5694eb27b79SHoward Hinnant 5704eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5714eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5724eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last); 5734eb27b79SHoward Hinnant 5744eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5754eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5764eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 5774eb27b79SHoward Hinnant 5784eb27b79SHoward Hinnanttemplate<class T> 5794eb27b79SHoward Hinnant pair<const T&, const T&> 5809d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5814eb27b79SHoward Hinnant 5824eb27b79SHoward Hinnanttemplate<class T, class Compare> 5834eb27b79SHoward Hinnant pair<const T&, const T&> 5849d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 5854eb27b79SHoward Hinnant 5864eb27b79SHoward Hinnanttemplate<class T> 5874eb27b79SHoward Hinnant pair<T, T> 5889d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 5894eb27b79SHoward Hinnant 5904eb27b79SHoward Hinnanttemplate<class T, class Compare> 5914eb27b79SHoward Hinnant pair<T, T> 5929d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 5934eb27b79SHoward Hinnant 5943e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5953e519524SHoward Hinnant bool 5963e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5973e519524SHoward Hinnant 5983e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5993e519524SHoward Hinnant bool 6003e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6013e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6023e519524SHoward Hinnant 6033e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6043e519524SHoward Hinnant bool 6053e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6063e519524SHoward Hinnant 6073e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6083e519524SHoward Hinnant bool 6093e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6103e519524SHoward Hinnant 6113e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6123e519524SHoward Hinnant bool 6133e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6143e519524SHoward Hinnant 6153e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6163e519524SHoward Hinnant bool 6173e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6183e519524SHoward Hinnant 6193e519524SHoward Hinnant} // std 6203e519524SHoward Hinnant 6213e519524SHoward Hinnant*/ 6223e519524SHoward Hinnant 6233e519524SHoward Hinnant#include <__config> 6243e519524SHoward Hinnant#include <initializer_list> 6253e519524SHoward Hinnant#include <type_traits> 6263e519524SHoward Hinnant#include <cstring> 6273e519524SHoward Hinnant#include <utility> 6283e519524SHoward Hinnant#include <memory> 6293e519524SHoward Hinnant#include <iterator> 630a1d07d57SHoward Hinnant#include <cstddef> 6313e519524SHoward Hinnant 6325d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6335d1a701dSHoward Hinnant#include "support/ibm/support.h" 6345d1a701dSHoward Hinnant#endif 6355f878d4bSHoward Hinnant#if defined(_LIBCPP_MSVCRT) || defined(__MINGW32__) 6365f878d4bSHoward Hinnant#include "support/win32/support.h" 6375f878d4bSHoward Hinnant#endif 6385d1a701dSHoward Hinnant 639ab4f4382SHoward Hinnant#include <__undef_min_max> 640ab4f4382SHoward Hinnant 641073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6423e519524SHoward Hinnant#pragma GCC system_header 643073458b1SHoward Hinnant#endif 6443e519524SHoward Hinnant 6453e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6463e519524SHoward Hinnant 6479d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6489d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6499d67c6d5SMarshall Clow// * We haven't included <functional> here. 6503e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6513e519524SHoward Hinnantstruct __equal_to 6523e519524SHoward Hinnant{ 6533e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6543e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6553e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6563e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6573e519524SHoward Hinnant}; 6583e519524SHoward Hinnant 6593e519524SHoward Hinnanttemplate <class _T1> 6603e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6613e519524SHoward Hinnant{ 6629d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6639d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6643e519524SHoward Hinnant}; 6653e519524SHoward Hinnant 6663e519524SHoward Hinnanttemplate <class _T1> 6673e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6683e519524SHoward Hinnant{ 6699d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6709d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6713e519524SHoward Hinnant}; 6723e519524SHoward Hinnant 6733e519524SHoward Hinnanttemplate <class _T1> 6743e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6753e519524SHoward Hinnant{ 6769d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6779d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6783e519524SHoward Hinnant}; 6793e519524SHoward Hinnant 6803e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6813e519524SHoward Hinnantstruct __less 6823e519524SHoward Hinnant{ 6839d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6849d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6859d67c6d5SMarshall Clow 6869d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6879d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6889d67c6d5SMarshall Clow 6899d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6909d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6919d67c6d5SMarshall Clow 6929d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6939d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6943e519524SHoward Hinnant}; 6953e519524SHoward Hinnant 6963e519524SHoward Hinnanttemplate <class _T1> 6973e519524SHoward Hinnantstruct __less<_T1, _T1> 6983e519524SHoward Hinnant{ 6999d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7009d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7013e519524SHoward Hinnant}; 7023e519524SHoward Hinnant 7033e519524SHoward Hinnanttemplate <class _T1> 7043e519524SHoward Hinnantstruct __less<const _T1, _T1> 7053e519524SHoward Hinnant{ 7069d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7079d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7083e519524SHoward Hinnant}; 7093e519524SHoward Hinnant 7103e519524SHoward Hinnanttemplate <class _T1> 7113e519524SHoward Hinnantstruct __less<_T1, const _T1> 7123e519524SHoward Hinnant{ 7139d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7149d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7153e519524SHoward Hinnant}; 7163e519524SHoward Hinnant 7173e519524SHoward Hinnanttemplate <class _Predicate> 7183e519524SHoward Hinnantclass __negate 7193e519524SHoward Hinnant{ 7203e519524SHoward Hinnantprivate: 7213e519524SHoward Hinnant _Predicate __p_; 7223e519524SHoward Hinnantpublic: 7233e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7243e519524SHoward Hinnant 7253e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7263e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7273e519524SHoward Hinnant 7283e519524SHoward Hinnant template <class _T1> 7293e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7303e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7313e519524SHoward Hinnant 7323e519524SHoward Hinnant template <class _T1, class _T2> 7333e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7343e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7353e519524SHoward Hinnant}; 7363e519524SHoward Hinnant 737145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7383e519524SHoward Hinnant 7393e519524SHoward Hinnanttemplate <class _Compare> 7403e519524SHoward Hinnantstruct __debug_less 7413e519524SHoward Hinnant{ 7423e519524SHoward Hinnant _Compare __comp_; 7433e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 7443e519524SHoward Hinnant template <class _Tp, class _Up> 7453e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7463e519524SHoward Hinnant { 7473e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7483e519524SHoward Hinnant if (__r) 749f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 7503e519524SHoward Hinnant return __r; 7513e519524SHoward Hinnant } 7523e519524SHoward Hinnant}; 7533e519524SHoward Hinnant 754145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7553e519524SHoward Hinnant 756c8edcb36SHoward Hinnant// Precondition: __x != 0 757c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 758c206366fSHoward Hinnantunsigned 759c206366fSHoward Hinnant__ctz(unsigned __x) 760c206366fSHoward Hinnant{ 761c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 762c206366fSHoward Hinnant} 763c206366fSHoward Hinnant 764c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 765c206366fSHoward Hinnantunsigned long 766c206366fSHoward Hinnant__ctz(unsigned long __x) 767c206366fSHoward Hinnant{ 768c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 769c206366fSHoward Hinnant} 770c206366fSHoward Hinnant 771c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 772c206366fSHoward Hinnantunsigned long long 773c206366fSHoward Hinnant__ctz(unsigned long long __x) 774c206366fSHoward Hinnant{ 775c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 776c206366fSHoward Hinnant} 777c8edcb36SHoward Hinnant 778c8edcb36SHoward Hinnant// Precondition: __x != 0 779c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 780c206366fSHoward Hinnantunsigned 781c206366fSHoward Hinnant__clz(unsigned __x) 782c206366fSHoward Hinnant{ 783c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 784c206366fSHoward Hinnant} 785c206366fSHoward Hinnant 786c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 787c206366fSHoward Hinnantunsigned long 788c206366fSHoward Hinnant__clz(unsigned long __x) 789c206366fSHoward Hinnant{ 790c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 791c206366fSHoward Hinnant} 792c206366fSHoward Hinnant 793c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 794c206366fSHoward Hinnantunsigned long long 795c206366fSHoward Hinnant__clz(unsigned long long __x) 796c206366fSHoward Hinnant{ 797c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 798c206366fSHoward Hinnant} 799c8edcb36SHoward Hinnant 800c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 801c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 802c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 803c8edcb36SHoward Hinnant 8043e519524SHoward Hinnant// all_of 8053e519524SHoward Hinnant 8063e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8083e519524SHoward Hinnantbool 8093e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8103e519524SHoward Hinnant{ 8113e519524SHoward Hinnant for (; __first != __last; ++__first) 8123e519524SHoward Hinnant if (!__pred(*__first)) 8133e519524SHoward Hinnant return false; 8143e519524SHoward Hinnant return true; 8153e519524SHoward Hinnant} 8163e519524SHoward Hinnant 8173e519524SHoward Hinnant// any_of 8183e519524SHoward Hinnant 8193e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8213e519524SHoward Hinnantbool 8223e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8233e519524SHoward Hinnant{ 8243e519524SHoward Hinnant for (; __first != __last; ++__first) 8253e519524SHoward Hinnant if (__pred(*__first)) 8263e519524SHoward Hinnant return true; 8273e519524SHoward Hinnant return false; 8283e519524SHoward Hinnant} 8293e519524SHoward Hinnant 8303e519524SHoward Hinnant// none_of 8313e519524SHoward Hinnant 8323e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8343e519524SHoward Hinnantbool 8353e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8363e519524SHoward Hinnant{ 8373e519524SHoward Hinnant for (; __first != __last; ++__first) 8383e519524SHoward Hinnant if (__pred(*__first)) 8393e519524SHoward Hinnant return false; 8403e519524SHoward Hinnant return true; 8413e519524SHoward Hinnant} 8423e519524SHoward Hinnant 8433e519524SHoward Hinnant// for_each 8443e519524SHoward Hinnant 8453e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8473e519524SHoward Hinnant_Function 8483e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8493e519524SHoward Hinnant{ 8503e519524SHoward Hinnant for (; __first != __last; ++__first) 8513e519524SHoward Hinnant __f(*__first); 852179b1f8cSHoward Hinnant return _VSTD::move(__f); // explicitly moved for (emulated) C++03 8533e519524SHoward Hinnant} 8543e519524SHoward Hinnant 8553e519524SHoward Hinnant// find 8563e519524SHoward Hinnant 8573e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8593e519524SHoward Hinnant_InputIterator 860e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8613e519524SHoward Hinnant{ 8623e519524SHoward Hinnant for (; __first != __last; ++__first) 863e4383379SHoward Hinnant if (*__first == __value_) 8643e519524SHoward Hinnant break; 8653e519524SHoward Hinnant return __first; 8663e519524SHoward Hinnant} 8673e519524SHoward Hinnant 8683e519524SHoward Hinnant// find_if 8693e519524SHoward Hinnant 8703e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8723e519524SHoward Hinnant_InputIterator 8733e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8743e519524SHoward Hinnant{ 8753e519524SHoward Hinnant for (; __first != __last; ++__first) 8763e519524SHoward Hinnant if (__pred(*__first)) 8773e519524SHoward Hinnant break; 8783e519524SHoward Hinnant return __first; 8793e519524SHoward Hinnant} 8803e519524SHoward Hinnant 8813e519524SHoward Hinnant// find_if_not 8823e519524SHoward Hinnant 8833e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8853e519524SHoward Hinnant_InputIterator 8863e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8873e519524SHoward Hinnant{ 8883e519524SHoward Hinnant for (; __first != __last; ++__first) 8893e519524SHoward Hinnant if (!__pred(*__first)) 8903e519524SHoward Hinnant break; 8913e519524SHoward Hinnant return __first; 8923e519524SHoward Hinnant} 8933e519524SHoward Hinnant 8943e519524SHoward Hinnant// find_end 8953e519524SHoward Hinnant 8963e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8973e519524SHoward Hinnant_ForwardIterator1 8983e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8993e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9003e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9013e519524SHoward Hinnant{ 9023e519524SHoward Hinnant // modeled after search algorithm 9033e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9043e519524SHoward Hinnant if (__first2 == __last2) 9053e519524SHoward Hinnant return __r; 9063e519524SHoward Hinnant while (true) 9073e519524SHoward Hinnant { 9083e519524SHoward Hinnant while (true) 9093e519524SHoward Hinnant { 9103e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9113e519524SHoward Hinnant return __r; // (or __last1 if never found) 9123e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9133e519524SHoward Hinnant break; 9143e519524SHoward Hinnant ++__first1; 9153e519524SHoward Hinnant } 9163e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9173e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9183e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9193e519524SHoward Hinnant while (true) 9203e519524SHoward Hinnant { 9213e519524SHoward Hinnant if (++__m2 == __last2) 9223e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9233e519524SHoward Hinnant __r = __first1; 9243e519524SHoward Hinnant ++__first1; 9253e519524SHoward Hinnant break; 9263e519524SHoward Hinnant } 9273e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9283e519524SHoward Hinnant return __r; 9293e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9303e519524SHoward Hinnant { 9313e519524SHoward Hinnant ++__first1; 9323e519524SHoward Hinnant break; 9333e519524SHoward Hinnant } // else there is a match, check next elements 9343e519524SHoward Hinnant } 9353e519524SHoward Hinnant } 9363e519524SHoward Hinnant} 9373e519524SHoward Hinnant 9383e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9393e519524SHoward Hinnant_BidirectionalIterator1 9403e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9413e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9423e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9433e519524SHoward Hinnant{ 9443e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9453e519524SHoward Hinnant if (__first2 == __last2) 9463e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9473e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9483e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9493e519524SHoward Hinnant --__l2; 9503e519524SHoward Hinnant while (true) 9513e519524SHoward Hinnant { 9523e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9533e519524SHoward Hinnant while (true) 9543e519524SHoward Hinnant { 9553e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9563e519524SHoward Hinnant return __last1; 9573e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9583e519524SHoward Hinnant break; 9593e519524SHoward Hinnant } 9603e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9613e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9623e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9633e519524SHoward Hinnant while (true) 9643e519524SHoward Hinnant { 9653e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9663e519524SHoward Hinnant return __m1; 9673e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9683e519524SHoward Hinnant return __last1; 9693e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9703e519524SHoward Hinnant { 9713e519524SHoward Hinnant break; 9723e519524SHoward Hinnant } // else there is a match, check next elements 9733e519524SHoward Hinnant } 9743e519524SHoward Hinnant } 9753e519524SHoward Hinnant} 9763e519524SHoward Hinnant 9773e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9783e519524SHoward Hinnant_RandomAccessIterator1 9793e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9803e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9813e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9823e519524SHoward Hinnant{ 9833e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9843e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9853e519524SHoward Hinnant if (__len2 == 0) 9863e519524SHoward Hinnant return __last1; 9873e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9883e519524SHoward Hinnant if (__len1 < __len2) 9893e519524SHoward Hinnant return __last1; 9903e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9913e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9923e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9933e519524SHoward Hinnant --__l2; 9943e519524SHoward Hinnant while (true) 9953e519524SHoward Hinnant { 9963e519524SHoward Hinnant while (true) 9973e519524SHoward Hinnant { 9983e519524SHoward Hinnant if (__s == __l1) 9993e519524SHoward Hinnant return __last1; 10003e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10013e519524SHoward Hinnant break; 10023e519524SHoward Hinnant } 10033e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10043e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10053e519524SHoward Hinnant while (true) 10063e519524SHoward Hinnant { 10073e519524SHoward Hinnant if (__m2 == __first2) 10083e519524SHoward Hinnant return __m1; 10093e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10103e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10113e519524SHoward Hinnant { 10123e519524SHoward Hinnant break; 10133e519524SHoward Hinnant } 10143e519524SHoward Hinnant } 10153e519524SHoward Hinnant } 10163e519524SHoward Hinnant} 10173e519524SHoward Hinnant 10183e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10203e519524SHoward Hinnant_ForwardIterator1 10213e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10223e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10233e519524SHoward Hinnant{ 1024ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10253e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10263e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10273e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10283e519524SHoward Hinnant} 10293e519524SHoward Hinnant 10303e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10323e519524SHoward Hinnant_ForwardIterator1 10333e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10343e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10353e519524SHoward Hinnant{ 10363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1038ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10393e519524SHoward Hinnant} 10403e519524SHoward Hinnant 10413e519524SHoward Hinnant// find_first_of 10423e519524SHoward Hinnant 10433e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10443e519524SHoward Hinnant_ForwardIterator1 10453e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10463e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10473e519524SHoward Hinnant{ 10483e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10493e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10503e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10513e519524SHoward Hinnant return __first1; 10523e519524SHoward Hinnant return __last1; 10533e519524SHoward Hinnant} 10543e519524SHoward Hinnant 10553e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10573e519524SHoward Hinnant_ForwardIterator1 10583e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10593e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10603e519524SHoward Hinnant{ 10613e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10623e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1063ce48a113SHoward Hinnant return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10643e519524SHoward Hinnant} 10653e519524SHoward Hinnant 10663e519524SHoward Hinnant// adjacent_find 10673e519524SHoward Hinnant 10683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10703e519524SHoward Hinnant_ForwardIterator 10713e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10723e519524SHoward Hinnant{ 10733e519524SHoward Hinnant if (__first != __last) 10743e519524SHoward Hinnant { 10753e519524SHoward Hinnant _ForwardIterator __i = __first; 10763e519524SHoward Hinnant while (++__i != __last) 10773e519524SHoward Hinnant { 10783e519524SHoward Hinnant if (__pred(*__first, *__i)) 10793e519524SHoward Hinnant return __first; 10803e519524SHoward Hinnant __first = __i; 10813e519524SHoward Hinnant } 10823e519524SHoward Hinnant } 10833e519524SHoward Hinnant return __last; 10843e519524SHoward Hinnant} 10853e519524SHoward Hinnant 10863e519524SHoward Hinnanttemplate <class _ForwardIterator> 10873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10883e519524SHoward Hinnant_ForwardIterator 10893e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 10903e519524SHoward Hinnant{ 10913e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1092ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 10933e519524SHoward Hinnant} 10943e519524SHoward Hinnant 10953e519524SHoward Hinnant// count 10963e519524SHoward Hinnant 10973e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10993e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1100e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11013e519524SHoward Hinnant{ 11023e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11033e519524SHoward Hinnant for (; __first != __last; ++__first) 1104e4383379SHoward Hinnant if (*__first == __value_) 11053e519524SHoward Hinnant ++__r; 11063e519524SHoward Hinnant return __r; 11073e519524SHoward Hinnant} 11083e519524SHoward Hinnant 11093e519524SHoward Hinnant// count_if 11103e519524SHoward Hinnant 11113e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11133e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11143e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11153e519524SHoward Hinnant{ 11163e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11173e519524SHoward Hinnant for (; __first != __last; ++__first) 11183e519524SHoward Hinnant if (__pred(*__first)) 11193e519524SHoward Hinnant ++__r; 11203e519524SHoward Hinnant return __r; 11213e519524SHoward Hinnant} 11223e519524SHoward Hinnant 11233e519524SHoward Hinnant// mismatch 11243e519524SHoward Hinnant 11253e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11273e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11283e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11293e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11303e519524SHoward Hinnant{ 11313e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11323e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11333e519524SHoward Hinnant break; 11343e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11353e519524SHoward Hinnant} 11363e519524SHoward Hinnant 11373e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11393e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11403e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11413e519524SHoward Hinnant{ 11423e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11433e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1144ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11453e519524SHoward Hinnant} 11463e519524SHoward Hinnant 11470b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11480b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11490b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11500b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11510b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11520b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11530b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11540b0bbd2fSMarshall Clow{ 11550b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 11560b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11570b0bbd2fSMarshall Clow break; 11580b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11590b0bbd2fSMarshall Clow} 11600b0bbd2fSMarshall Clow 11610b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11620b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11630b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11640b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11650b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11660b0bbd2fSMarshall Clow{ 11670b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11680b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 11690b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11700b0bbd2fSMarshall Clow} 11710b0bbd2fSMarshall Clow#endif 11720b0bbd2fSMarshall Clow 11733e519524SHoward Hinnant// equal 11743e519524SHoward Hinnant 11753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11773e519524SHoward Hinnantbool 11783e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11793e519524SHoward Hinnant{ 11803e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11813e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11823e519524SHoward Hinnant return false; 11833e519524SHoward Hinnant return true; 11843e519524SHoward Hinnant} 11853e519524SHoward Hinnant 11863e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11883e519524SHoward Hinnantbool 11893e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11903e519524SHoward Hinnant{ 11913e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11923e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1193ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11943e519524SHoward Hinnant} 11953e519524SHoward Hinnant 11960b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11970b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 11980b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11990b0bbd2fSMarshall Clowbool 12000b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12010b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12020b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12030b0bbd2fSMarshall Clow{ 12040b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 12050b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12060b0bbd2fSMarshall Clow return false; 12070b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12080b0bbd2fSMarshall Clow} 12090b0bbd2fSMarshall Clow 12100b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12110b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12120b0bbd2fSMarshall Clowbool 12130b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12140b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12150b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12160b0bbd2fSMarshall Clow{ 12170b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12180b0bbd2fSMarshall Clow return false; 12190b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12200b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12210b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12220b0bbd2fSMarshall Clow} 12230b0bbd2fSMarshall Clow 12240b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12250b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12260b0bbd2fSMarshall Clowbool 12270b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12280b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12290b0bbd2fSMarshall Clow{ 12300b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12310b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12320b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12330b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12340b0bbd2fSMarshall Clow} 12350b0bbd2fSMarshall Clow 12360b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12370b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12380b0bbd2fSMarshall Clowbool 12390b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12400b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12410b0bbd2fSMarshall Clow{ 12420b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12430b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12440b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12450b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12460b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12470b0bbd2fSMarshall Clow} 12480b0bbd2fSMarshall Clow#endif 12490b0bbd2fSMarshall Clow 12503e519524SHoward Hinnant// is_permutation 12513e519524SHoward Hinnant 12523e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12533e519524SHoward Hinnantbool 12543e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12553e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12563e519524SHoward Hinnant{ 12573e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 12583e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 12593e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12603e519524SHoward Hinnant goto __not_done; 12613e519524SHoward Hinnant return true; 12623e519524SHoward Hinnant__not_done: 12633e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1265ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12663e519524SHoward Hinnant if (__l1 == _D1(1)) 12673e519524SHoward Hinnant return false; 1268ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12693e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12703e519524SHoward Hinnant // equal elements in [f2, l2) 12713e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12723e519524SHoward Hinnant { 12733e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 12743e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 12753e519524SHoward Hinnant if (__pred(*__j, *__i)) 12763e519524SHoward Hinnant goto __next_iter; 12773e519524SHoward Hinnant { 12783e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12793e519524SHoward Hinnant _D1 __c2 = 0; 12803e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12813e519524SHoward Hinnant if (__pred(*__i, *__j)) 12823e519524SHoward Hinnant ++__c2; 12833e519524SHoward Hinnant if (__c2 == 0) 12843e519524SHoward Hinnant return false; 12853e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 12863e519524SHoward Hinnant _D1 __c1 = 1; 1287ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 12883e519524SHoward Hinnant if (__pred(*__i, *__j)) 12893e519524SHoward Hinnant ++__c1; 12903e519524SHoward Hinnant if (__c1 != __c2) 12913e519524SHoward Hinnant return false; 12923e519524SHoward Hinnant } 12933e519524SHoward Hinnant__next_iter:; 12943e519524SHoward Hinnant } 12953e519524SHoward Hinnant return true; 12963e519524SHoward Hinnant} 12973e519524SHoward Hinnant 12983e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 12993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13003e519524SHoward Hinnantbool 13013e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13023e519524SHoward Hinnant _ForwardIterator2 __first2) 13033e519524SHoward Hinnant{ 13043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1306ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13073e519524SHoward Hinnant} 13083e519524SHoward Hinnant 13090b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13100b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13110b0bbd2fSMarshall Clowbool 13120b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13130b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13140b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13150b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13160b0bbd2fSMarshall Clow{ 13170b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 13180b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 13190b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13200b0bbd2fSMarshall Clow goto __not_done; 13210b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13220b0bbd2fSMarshall Clow__not_done: 13230b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13240b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13250b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13260b0bbd2fSMarshall Clow 13270b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1328fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13290b0bbd2fSMarshall Clow if (__l1 != __l2) 13300b0bbd2fSMarshall Clow return false; 13310b0bbd2fSMarshall Clow 13320b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13330b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13340b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13350b0bbd2fSMarshall Clow { 13360b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13370b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13380b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13390b0bbd2fSMarshall Clow goto __next_iter; 13400b0bbd2fSMarshall Clow { 13410b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13420b0bbd2fSMarshall Clow _D1 __c2 = 0; 13430b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13440b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13450b0bbd2fSMarshall Clow ++__c2; 13460b0bbd2fSMarshall Clow if (__c2 == 0) 13470b0bbd2fSMarshall Clow return false; 13480b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13490b0bbd2fSMarshall Clow _D1 __c1 = 1; 13500b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13510b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13520b0bbd2fSMarshall Clow ++__c1; 13530b0bbd2fSMarshall Clow if (__c1 != __c2) 13540b0bbd2fSMarshall Clow return false; 13550b0bbd2fSMarshall Clow } 13560b0bbd2fSMarshall Clow__next_iter:; 13570b0bbd2fSMarshall Clow } 13580b0bbd2fSMarshall Clow return true; 13590b0bbd2fSMarshall Clow} 13600b0bbd2fSMarshall Clow 13610b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13620b0bbd2fSMarshall Clowbool 13630b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13640b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13650b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13660b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13670b0bbd2fSMarshall Clow{ 13680b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13690b0bbd2fSMarshall Clow return false; 13700b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 13710b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13720b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13730b0bbd2fSMarshall Clow} 13740b0bbd2fSMarshall Clow 13750b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13760b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13770b0bbd2fSMarshall Clowbool 13780b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13790b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13800b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 13810b0bbd2fSMarshall Clow{ 13820b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 13830b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13840b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13850b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13860b0bbd2fSMarshall Clow} 13870b0bbd2fSMarshall Clow 13880b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 13890b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13900b0bbd2fSMarshall Clowbool 13910b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13920b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 13930b0bbd2fSMarshall Clow{ 13940b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13950b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 13960b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 13970b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 13980b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13990b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14000b0bbd2fSMarshall Clow} 14010b0bbd2fSMarshall Clow#endif 14020b0bbd2fSMarshall Clow 14033e519524SHoward Hinnant// search 14043e519524SHoward Hinnant 14053e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 14063e519524SHoward Hinnant_ForwardIterator1 14073e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14083e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 14093e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 14103e519524SHoward Hinnant{ 14113e519524SHoward Hinnant if (__first2 == __last2) 14123e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 14133e519524SHoward Hinnant while (true) 14143e519524SHoward Hinnant { 14153e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 14163e519524SHoward Hinnant while (true) 14173e519524SHoward Hinnant { 14183e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 14193e519524SHoward Hinnant return __last1; 14203e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14213e519524SHoward Hinnant break; 14223e519524SHoward Hinnant ++__first1; 14233e519524SHoward Hinnant } 14243e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14253e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14263e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14273e519524SHoward Hinnant while (true) 14283e519524SHoward Hinnant { 14293e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 14303e519524SHoward Hinnant return __first1; 14313e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 14323e519524SHoward Hinnant return __last1; 14333e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14343e519524SHoward Hinnant { 14353e519524SHoward Hinnant ++__first1; 14363e519524SHoward Hinnant break; 14373e519524SHoward Hinnant } // else there is a match, check next elements 14383e519524SHoward Hinnant } 14393e519524SHoward Hinnant } 14403e519524SHoward Hinnant} 14413e519524SHoward Hinnant 14423e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14433e519524SHoward Hinnant_RandomAccessIterator1 14443e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14453e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14463e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14473e519524SHoward Hinnant{ 14483e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 14493e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14503e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 14513e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 14523e519524SHoward Hinnant if (__len2 == 0) 14533e519524SHoward Hinnant return __first1; 14543e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 14553e519524SHoward Hinnant if (__len1 < __len2) 14563e519524SHoward Hinnant return __last1; 14573e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14583e519524SHoward Hinnant while (true) 14593e519524SHoward Hinnant { 14603e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14613e519524SHoward Hinnant while (true) 14623e519524SHoward Hinnant { 14633e519524SHoward Hinnant if (__first1 == __s) 14643e519524SHoward Hinnant return __last1; 14653e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14663e519524SHoward Hinnant break; 14673e519524SHoward Hinnant ++__first1; 14683e519524SHoward Hinnant } 1469b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14703e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 14713e519524SHoward Hinnant { 14723e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14733e519524SHoward Hinnant goto __phase2; 14743e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14753e519524SHoward Hinnant goto __phase2; 14763e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14773e519524SHoward Hinnant goto __phase2; 14783e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14793e519524SHoward Hinnant goto __phase2; 14803e519524SHoward Hinnant ++__first1; 14813e519524SHoward Hinnant } 14823e519524SHoward Hinnant switch (__s - __first1) 14833e519524SHoward Hinnant { 14843e519524SHoward Hinnant case 3: 14853e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14863e519524SHoward Hinnant break; 14873e519524SHoward Hinnant ++__first1; 14883e519524SHoward Hinnant case 2: 14893e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14903e519524SHoward Hinnant break; 14913e519524SHoward Hinnant ++__first1; 14923e519524SHoward Hinnant case 1: 14933e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14943e519524SHoward Hinnant break; 14953e519524SHoward Hinnant case 0: 14963e519524SHoward Hinnant return __last1; 14973e519524SHoward Hinnant } 14983e519524SHoward Hinnant __phase2: 1499b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15003e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 15013e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 15023e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 15033e519524SHoward Hinnant while (true) 15043e519524SHoward Hinnant { 15053e519524SHoward Hinnant if (++__m2 == __last2) 15063e519524SHoward Hinnant return __first1; 15073e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 15083e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15093e519524SHoward Hinnant { 15103e519524SHoward Hinnant ++__first1; 15113e519524SHoward Hinnant break; 15123e519524SHoward Hinnant } 15133e519524SHoward Hinnant } 1514b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 15153e519524SHoward Hinnant ++__m2; 15163e519524SHoward Hinnant ++__m1; 15173e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 15183e519524SHoward Hinnant { 15193e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15203e519524SHoward Hinnant goto __continue; 15213e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15223e519524SHoward Hinnant goto __continue; 15233e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15243e519524SHoward Hinnant goto __continue; 15253e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15263e519524SHoward Hinnant goto __continue; 15273e519524SHoward Hinnant ++__m1; 15283e519524SHoward Hinnant ++__m2; 15293e519524SHoward Hinnant } 15303e519524SHoward Hinnant switch (__last2 - __m2) 15313e519524SHoward Hinnant { 15323e519524SHoward Hinnant case 3: 15333e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15343e519524SHoward Hinnant break; 15353e519524SHoward Hinnant ++__m1; 15363e519524SHoward Hinnant ++__m2; 15373e519524SHoward Hinnant case 2: 15383e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15393e519524SHoward Hinnant break; 15403e519524SHoward Hinnant ++__m1; 15413e519524SHoward Hinnant ++__m2; 15423e519524SHoward Hinnant case 1: 15433e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15443e519524SHoward Hinnant break; 15453e519524SHoward Hinnant case 0: 15463e519524SHoward Hinnant return __first1; 15473e519524SHoward Hinnant } 15483e519524SHoward Hinnant __continue: 15493e519524SHoward Hinnant ++__first1; 1550b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15513e519524SHoward Hinnant } 15523e519524SHoward Hinnant} 15533e519524SHoward Hinnant 15543e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15563e519524SHoward Hinnant_ForwardIterator1 15573e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15583e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15593e519524SHoward Hinnant{ 1560ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15613e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 15623e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 15633e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 15643e519524SHoward Hinnant} 15653e519524SHoward Hinnant 15663e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15683e519524SHoward Hinnant_ForwardIterator1 15693e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15703e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15713e519524SHoward Hinnant{ 15723e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 15733e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1574ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15753e519524SHoward Hinnant} 15763e519524SHoward Hinnant 15773e519524SHoward Hinnant// search_n 15783e519524SHoward Hinnant 15793e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15803e519524SHoward Hinnant_ForwardIterator 15813e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1582e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15833e519524SHoward Hinnant{ 15843e519524SHoward Hinnant if (__count <= 0) 15853e519524SHoward Hinnant return __first; 15863e519524SHoward Hinnant while (true) 15873e519524SHoward Hinnant { 1588e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15893e519524SHoward Hinnant while (true) 15903e519524SHoward Hinnant { 1591e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15923e519524SHoward Hinnant return __last; 1593e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15943e519524SHoward Hinnant break; 15953e519524SHoward Hinnant ++__first; 15963e519524SHoward Hinnant } 1597e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15983e519524SHoward Hinnant _ForwardIterator __m = __first; 15993e519524SHoward Hinnant _Size __c(0); 16003e519524SHoward Hinnant while (true) 16013e519524SHoward Hinnant { 16023e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16033e519524SHoward Hinnant return __first; 16043e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16053e519524SHoward Hinnant return __last; 1606e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16073e519524SHoward Hinnant { 16083e519524SHoward Hinnant __first = __m; 16093e519524SHoward Hinnant ++__first; 16103e519524SHoward Hinnant break; 16113e519524SHoward Hinnant } // else there is a match, check next elements 16123e519524SHoward Hinnant } 16133e519524SHoward Hinnant } 16143e519524SHoward Hinnant} 16153e519524SHoward Hinnant 16163e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16173e519524SHoward Hinnant_RandomAccessIterator 16183e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1619e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16203e519524SHoward Hinnant{ 16213e519524SHoward Hinnant if (__count <= 0) 16223e519524SHoward Hinnant return __first; 16233e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16243e519524SHoward Hinnant if (__len < __count) 16253e519524SHoward Hinnant return __last; 16263e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16273e519524SHoward Hinnant while (true) 16283e519524SHoward Hinnant { 1629e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16303e519524SHoward Hinnant while (true) 16313e519524SHoward Hinnant { 1632b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16333e519524SHoward Hinnant return __last; 1634e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16353e519524SHoward Hinnant break; 16363e519524SHoward Hinnant ++__first; 16373e519524SHoward Hinnant } 1638e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16393e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16403e519524SHoward Hinnant _Size __c(0); 16413e519524SHoward Hinnant while (true) 16423e519524SHoward Hinnant { 16433e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16443e519524SHoward Hinnant return __first; 16453e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1646e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16473e519524SHoward Hinnant { 16483e519524SHoward Hinnant __first = __m; 16493e519524SHoward Hinnant ++__first; 16503e519524SHoward Hinnant break; 16513e519524SHoward Hinnant } // else there is a match, check next elements 16523e519524SHoward Hinnant } 16533e519524SHoward Hinnant } 16543e519524SHoward Hinnant} 16553e519524SHoward Hinnant 16563e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16583e519524SHoward Hinnant_ForwardIterator 16593e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1660e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16613e519524SHoward Hinnant{ 1662ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1663e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 16643e519524SHoward Hinnant} 16653e519524SHoward Hinnant 16663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16683e519524SHoward Hinnant_ForwardIterator 1669e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16703e519524SHoward Hinnant{ 16713e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1672e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 16733e519524SHoward Hinnant} 16743e519524SHoward Hinnant 16753e519524SHoward Hinnant// copy 16763e519524SHoward Hinnant 16773e519524SHoward Hinnanttemplate <class _Iter> 16783e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 16793e519524SHoward Hinnant{ 16803e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16813e519524SHoward Hinnant}; 16823e519524SHoward Hinnant 16833e519524SHoward Hinnanttemplate <class _Iter> 16843e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 16853e519524SHoward Hinnant{ 16863e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16873e519524SHoward Hinnant}; 16883e519524SHoward Hinnant 16893e519524SHoward Hinnanttemplate <class _Iter> 16903e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 16913e519524SHoward Hinnant{ 16923e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16933e519524SHoward Hinnant}; 16943e519524SHoward Hinnant 16953e519524SHoward Hinnanttemplate <class _Iter> 16963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16973e519524SHoward Hinnant_Iter 16983e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16993e519524SHoward Hinnant{ 17003e519524SHoward Hinnant return __i; 17013e519524SHoward Hinnant} 17023e519524SHoward Hinnant 17033e519524SHoward Hinnanttemplate <class _Tp> 17043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17053e519524SHoward Hinnanttypename enable_if 17063e519524SHoward Hinnant< 1707ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17083e519524SHoward Hinnant _Tp* 17093e519524SHoward Hinnant>::type 17103e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17113e519524SHoward Hinnant{ 17123e519524SHoward Hinnant return __i.base(); 17133e519524SHoward Hinnant} 17143e519524SHoward Hinnant 1715fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1716fc88dbd2SHoward Hinnant 17173e519524SHoward Hinnanttemplate <class _Tp> 17183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17193e519524SHoward Hinnanttypename enable_if 17203e519524SHoward Hinnant< 1721ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17223e519524SHoward Hinnant _Tp* 17233e519524SHoward Hinnant>::type 17243e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17253e519524SHoward Hinnant{ 17263e519524SHoward Hinnant return __i.base(); 17273e519524SHoward Hinnant} 17283e519524SHoward Hinnant 1729fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1730fc88dbd2SHoward Hinnant 17313e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17333e519524SHoward Hinnant_OutputIterator 17343e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17353e519524SHoward Hinnant{ 17363e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17373e519524SHoward Hinnant *__result = *__first; 17383e519524SHoward Hinnant return __result; 17393e519524SHoward Hinnant} 17403e519524SHoward Hinnant 17413e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17433e519524SHoward Hinnanttypename enable_if 17443e519524SHoward Hinnant< 17453e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1746ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17473e519524SHoward Hinnant _Up* 17483e519524SHoward Hinnant>::type 17493e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17503e519524SHoward Hinnant{ 17513e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1752ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17533e519524SHoward Hinnant return __result + __n; 17543e519524SHoward Hinnant} 17553e519524SHoward Hinnant 17563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17583e519524SHoward Hinnant_OutputIterator 17593e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17603e519524SHoward Hinnant{ 1761ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17623e519524SHoward Hinnant} 17633e519524SHoward Hinnant 17643e519524SHoward Hinnant// copy_backward 17653e519524SHoward Hinnant 1766d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17683e519524SHoward Hinnant_OutputIterator 1769d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17703e519524SHoward Hinnant{ 17713e519524SHoward Hinnant while (__first != __last) 17723e519524SHoward Hinnant *--__result = *--__last; 17733e519524SHoward Hinnant return __result; 17743e519524SHoward Hinnant} 17753e519524SHoward Hinnant 17763e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17783e519524SHoward Hinnanttypename enable_if 17793e519524SHoward Hinnant< 17803e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1781ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17823e519524SHoward Hinnant _Up* 17833e519524SHoward Hinnant>::type 17843e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17853e519524SHoward Hinnant{ 17863e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17873e519524SHoward Hinnant __result -= __n; 1788ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17893e519524SHoward Hinnant return __result; 17903e519524SHoward Hinnant} 17913e519524SHoward Hinnant 17923e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17943e519524SHoward Hinnant_BidirectionalIterator2 17953e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17963e519524SHoward Hinnant _BidirectionalIterator2 __result) 17973e519524SHoward Hinnant{ 1798ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17993e519524SHoward Hinnant} 18003e519524SHoward Hinnant 18013e519524SHoward Hinnant// copy_if 18023e519524SHoward Hinnant 18033e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18053e519524SHoward Hinnant_OutputIterator 18063e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18073e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18083e519524SHoward Hinnant{ 18093e519524SHoward Hinnant for (; __first != __last; ++__first) 18103e519524SHoward Hinnant { 18113e519524SHoward Hinnant if (__pred(*__first)) 18123e519524SHoward Hinnant { 18133e519524SHoward Hinnant *__result = *__first; 18143e519524SHoward Hinnant ++__result; 18153e519524SHoward Hinnant } 18163e519524SHoward Hinnant } 18173e519524SHoward Hinnant return __result; 18183e519524SHoward Hinnant} 18193e519524SHoward Hinnant 18203e519524SHoward Hinnant// copy_n 18213e519524SHoward Hinnant 18223e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18243e519524SHoward Hinnanttypename enable_if 18253e519524SHoward Hinnant< 18263e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18273e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18283e519524SHoward Hinnant _OutputIterator 18293e519524SHoward Hinnant>::type 18303e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18313e519524SHoward Hinnant{ 183299847d2bSHoward Hinnant if (__n > 0) 183399847d2bSHoward Hinnant { 18343e519524SHoward Hinnant *__result = *__first; 183599847d2bSHoward Hinnant ++__result; 183699847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 183799847d2bSHoward Hinnant { 183899847d2bSHoward Hinnant ++__first; 183999847d2bSHoward Hinnant *__result = *__first; 184099847d2bSHoward Hinnant ++__result; 184199847d2bSHoward Hinnant } 184299847d2bSHoward Hinnant } 18433e519524SHoward Hinnant return __result; 18443e519524SHoward Hinnant} 18453e519524SHoward Hinnant 18463e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18483e519524SHoward Hinnanttypename enable_if 18493e519524SHoward Hinnant< 18503e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18513e519524SHoward Hinnant _OutputIterator 18523e519524SHoward Hinnant>::type 18533e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18543e519524SHoward Hinnant{ 1855ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18563e519524SHoward Hinnant} 18573e519524SHoward Hinnant 18583e519524SHoward Hinnant// move 18593e519524SHoward Hinnant 18603e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18623e519524SHoward Hinnant_OutputIterator 18633e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18643e519524SHoward Hinnant{ 18653e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 1866ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18673e519524SHoward Hinnant return __result; 18683e519524SHoward Hinnant} 18693e519524SHoward Hinnant 18703e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18723e519524SHoward Hinnanttypename enable_if 18733e519524SHoward Hinnant< 18743e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1875ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18763e519524SHoward Hinnant _Up* 18773e519524SHoward Hinnant>::type 18783e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18793e519524SHoward Hinnant{ 18803e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1881ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18823e519524SHoward Hinnant return __result + __n; 18833e519524SHoward Hinnant} 18843e519524SHoward Hinnant 18853e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18873e519524SHoward Hinnant_OutputIterator 18883e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18893e519524SHoward Hinnant{ 1890ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18913e519524SHoward Hinnant} 18923e519524SHoward Hinnant 18933e519524SHoward Hinnant// move_backward 18943e519524SHoward Hinnant 18953e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18973e519524SHoward Hinnant_OutputIterator 18983e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18993e519524SHoward Hinnant{ 19003e519524SHoward Hinnant while (__first != __last) 1901ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19023e519524SHoward Hinnant return __result; 19033e519524SHoward Hinnant} 19043e519524SHoward Hinnant 19053e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19073e519524SHoward Hinnanttypename enable_if 19083e519524SHoward Hinnant< 19093e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1910ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19113e519524SHoward Hinnant _Up* 19123e519524SHoward Hinnant>::type 19133e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19143e519524SHoward Hinnant{ 19153e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19163e519524SHoward Hinnant __result -= __n; 1917ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19183e519524SHoward Hinnant return __result; 19193e519524SHoward Hinnant} 19203e519524SHoward Hinnant 19213e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19233e519524SHoward Hinnant_BidirectionalIterator2 19243e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19253e519524SHoward Hinnant _BidirectionalIterator2 __result) 19263e519524SHoward Hinnant{ 1927ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19283e519524SHoward Hinnant} 19293e519524SHoward Hinnant 19303e519524SHoward Hinnant// iter_swap 19313e519524SHoward Hinnant 1932a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19333e519524SHoward Hinnant 19343e519524SHoward Hinnant// transform 19353e519524SHoward Hinnant 19363e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19383e519524SHoward Hinnant_OutputIterator 19393e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19403e519524SHoward Hinnant{ 19413e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19423e519524SHoward Hinnant *__result = __op(*__first); 19433e519524SHoward Hinnant return __result; 19443e519524SHoward Hinnant} 19453e519524SHoward Hinnant 19463e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19483e519524SHoward Hinnant_OutputIterator 19493e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19503e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19513e519524SHoward Hinnant{ 19523e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 19533e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19543e519524SHoward Hinnant return __result; 19553e519524SHoward Hinnant} 19563e519524SHoward Hinnant 19573e519524SHoward Hinnant// replace 19583e519524SHoward Hinnant 19593e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19613e519524SHoward Hinnantvoid 19623e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19633e519524SHoward Hinnant{ 19643e519524SHoward Hinnant for (; __first != __last; ++__first) 19653e519524SHoward Hinnant if (*__first == __old_value) 19663e519524SHoward Hinnant *__first = __new_value; 19673e519524SHoward Hinnant} 19683e519524SHoward Hinnant 19693e519524SHoward Hinnant// replace_if 19703e519524SHoward Hinnant 19713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19733e519524SHoward Hinnantvoid 19743e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19753e519524SHoward Hinnant{ 19763e519524SHoward Hinnant for (; __first != __last; ++__first) 19773e519524SHoward Hinnant if (__pred(*__first)) 19783e519524SHoward Hinnant *__first = __new_value; 19793e519524SHoward Hinnant} 19803e519524SHoward Hinnant 19813e519524SHoward Hinnant// replace_copy 19823e519524SHoward Hinnant 19833e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19853e519524SHoward Hinnant_OutputIterator 19863e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19873e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19883e519524SHoward Hinnant{ 19893e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19903e519524SHoward Hinnant if (*__first == __old_value) 19913e519524SHoward Hinnant *__result = __new_value; 19923e519524SHoward Hinnant else 19933e519524SHoward Hinnant *__result = *__first; 19943e519524SHoward Hinnant return __result; 19953e519524SHoward Hinnant} 19963e519524SHoward Hinnant 19973e519524SHoward Hinnant// replace_copy_if 19983e519524SHoward Hinnant 19993e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20013e519524SHoward Hinnant_OutputIterator 20023e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20033e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20043e519524SHoward Hinnant{ 20053e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 20063e519524SHoward Hinnant if (__pred(*__first)) 20073e519524SHoward Hinnant *__result = __new_value; 20083e519524SHoward Hinnant else 20093e519524SHoward Hinnant *__result = *__first; 20103e519524SHoward Hinnant return __result; 20113e519524SHoward Hinnant} 20123e519524SHoward Hinnant 20133e519524SHoward Hinnant// fill_n 20143e519524SHoward Hinnant 20153e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20173e519524SHoward Hinnant_OutputIterator 20180f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20193e519524SHoward Hinnant{ 20203e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 2021e4383379SHoward Hinnant *__first = __value_; 20223e519524SHoward Hinnant return __first; 20233e519524SHoward Hinnant} 20243e519524SHoward Hinnant 20250f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20270f242beaSHoward Hinnanttypename enable_if 20280f242beaSHoward Hinnant< 20290f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20300f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20310f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20320f242beaSHoward Hinnant _Tp* 20330f242beaSHoward Hinnant>::type 20340f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20353e519524SHoward Hinnant{ 20363e519524SHoward Hinnant if (__n > 0) 2037e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20383e519524SHoward Hinnant return __first + __n; 20393e519524SHoward Hinnant} 20403e519524SHoward Hinnant 20413e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20433e519524SHoward Hinnant_OutputIterator 2044e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20453e519524SHoward Hinnant{ 20460f242beaSHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_); 20473e519524SHoward Hinnant} 20483e519524SHoward Hinnant 20493e519524SHoward Hinnant// fill 20503e519524SHoward Hinnant 20513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20533e519524SHoward Hinnantvoid 2054e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20553e519524SHoward Hinnant{ 20563e519524SHoward Hinnant for (; __first != __last; ++__first) 2057e4383379SHoward Hinnant *__first = __value_; 20583e519524SHoward Hinnant} 20593e519524SHoward Hinnant 20603e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20623e519524SHoward Hinnantvoid 2063e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20643e519524SHoward Hinnant{ 2065e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20663e519524SHoward Hinnant} 20673e519524SHoward Hinnant 20683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20703e519524SHoward Hinnantvoid 2071e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20723e519524SHoward Hinnant{ 2073e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20743e519524SHoward Hinnant} 20753e519524SHoward Hinnant 20763e519524SHoward Hinnant// generate 20773e519524SHoward Hinnant 20783e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20803e519524SHoward Hinnantvoid 20813e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20823e519524SHoward Hinnant{ 20833e519524SHoward Hinnant for (; __first != __last; ++__first) 20843e519524SHoward Hinnant *__first = __gen(); 20853e519524SHoward Hinnant} 20863e519524SHoward Hinnant 20873e519524SHoward Hinnant// generate_n 20883e519524SHoward Hinnant 20893e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20913e519524SHoward Hinnant_OutputIterator 20923e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 20933e519524SHoward Hinnant{ 20943e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 20953e519524SHoward Hinnant *__first = __gen(); 20963e519524SHoward Hinnant return __first; 20973e519524SHoward Hinnant} 20983e519524SHoward Hinnant 20993e519524SHoward Hinnant// remove 21003e519524SHoward Hinnant 21013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21023e519524SHoward Hinnant_ForwardIterator 2103e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21043e519524SHoward Hinnant{ 2105e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21063e519524SHoward Hinnant if (__first != __last) 21073e519524SHoward Hinnant { 21083e519524SHoward Hinnant _ForwardIterator __i = __first; 21093e519524SHoward Hinnant while (++__i != __last) 21103e519524SHoward Hinnant { 2111e4383379SHoward Hinnant if (!(*__i == __value_)) 21123e519524SHoward Hinnant { 2113ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21143e519524SHoward Hinnant ++__first; 21153e519524SHoward Hinnant } 21163e519524SHoward Hinnant } 21173e519524SHoward Hinnant } 21183e519524SHoward Hinnant return __first; 21193e519524SHoward Hinnant} 21203e519524SHoward Hinnant 21213e519524SHoward Hinnant// remove_if 21223e519524SHoward Hinnant 21233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21243e519524SHoward Hinnant_ForwardIterator 21253e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21263e519524SHoward Hinnant{ 2127ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21283e519524SHoward Hinnant (__first, __last, __pred); 21293e519524SHoward Hinnant if (__first != __last) 21303e519524SHoward Hinnant { 21313e519524SHoward Hinnant _ForwardIterator __i = __first; 21323e519524SHoward Hinnant while (++__i != __last) 21333e519524SHoward Hinnant { 21343e519524SHoward Hinnant if (!__pred(*__i)) 21353e519524SHoward Hinnant { 2136ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21373e519524SHoward Hinnant ++__first; 21383e519524SHoward Hinnant } 21393e519524SHoward Hinnant } 21403e519524SHoward Hinnant } 21413e519524SHoward Hinnant return __first; 21423e519524SHoward Hinnant} 21433e519524SHoward Hinnant 21443e519524SHoward Hinnant// remove_copy 21453e519524SHoward Hinnant 21463e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21483e519524SHoward Hinnant_OutputIterator 2149e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21503e519524SHoward Hinnant{ 21513e519524SHoward Hinnant for (; __first != __last; ++__first) 21523e519524SHoward Hinnant { 2153e4383379SHoward Hinnant if (!(*__first == __value_)) 21543e519524SHoward Hinnant { 21553e519524SHoward Hinnant *__result = *__first; 21563e519524SHoward Hinnant ++__result; 21573e519524SHoward Hinnant } 21583e519524SHoward Hinnant } 21593e519524SHoward Hinnant return __result; 21603e519524SHoward Hinnant} 21613e519524SHoward Hinnant 21623e519524SHoward Hinnant// remove_copy_if 21633e519524SHoward Hinnant 21643e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21663e519524SHoward Hinnant_OutputIterator 21673e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21683e519524SHoward Hinnant{ 21693e519524SHoward Hinnant for (; __first != __last; ++__first) 21703e519524SHoward Hinnant { 21713e519524SHoward Hinnant if (!__pred(*__first)) 21723e519524SHoward Hinnant { 21733e519524SHoward Hinnant *__result = *__first; 21743e519524SHoward Hinnant ++__result; 21753e519524SHoward Hinnant } 21763e519524SHoward Hinnant } 21773e519524SHoward Hinnant return __result; 21783e519524SHoward Hinnant} 21793e519524SHoward Hinnant 21803e519524SHoward Hinnant// unique 21813e519524SHoward Hinnant 21823e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21833e519524SHoward Hinnant_ForwardIterator 21843e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21853e519524SHoward Hinnant{ 2186ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21873e519524SHoward Hinnant (__first, __last, __pred); 21883e519524SHoward Hinnant if (__first != __last) 21893e519524SHoward Hinnant { 21903e519524SHoward Hinnant // ... a a ? ... 21913e519524SHoward Hinnant // f i 21923e519524SHoward Hinnant _ForwardIterator __i = __first; 21933e519524SHoward Hinnant for (++__i; ++__i != __last;) 21943e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2195ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21963e519524SHoward Hinnant ++__first; 21973e519524SHoward Hinnant } 21983e519524SHoward Hinnant return __first; 21993e519524SHoward Hinnant} 22003e519524SHoward Hinnant 22013e519524SHoward Hinnanttemplate <class _ForwardIterator> 22023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22033e519524SHoward Hinnant_ForwardIterator 22043e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22053e519524SHoward Hinnant{ 22063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2207ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22083e519524SHoward Hinnant} 22093e519524SHoward Hinnant 22103e519524SHoward Hinnant// unique_copy 22113e519524SHoward Hinnant 22123e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22133e519524SHoward Hinnant_OutputIterator 22143e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22153e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22163e519524SHoward Hinnant{ 22173e519524SHoward Hinnant if (__first != __last) 22183e519524SHoward Hinnant { 22193e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22203e519524SHoward Hinnant *__result = __t; 22213e519524SHoward Hinnant ++__result; 22223e519524SHoward Hinnant while (++__first != __last) 22233e519524SHoward Hinnant { 22243e519524SHoward Hinnant if (!__pred(__t, *__first)) 22253e519524SHoward Hinnant { 22263e519524SHoward Hinnant __t = *__first; 22273e519524SHoward Hinnant *__result = __t; 22283e519524SHoward Hinnant ++__result; 22293e519524SHoward Hinnant } 22303e519524SHoward Hinnant } 22313e519524SHoward Hinnant } 22323e519524SHoward Hinnant return __result; 22333e519524SHoward Hinnant} 22343e519524SHoward Hinnant 22353e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22363e519524SHoward Hinnant_OutputIterator 22373e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22383e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22393e519524SHoward Hinnant{ 22403e519524SHoward Hinnant if (__first != __last) 22413e519524SHoward Hinnant { 22423e519524SHoward Hinnant _ForwardIterator __i = __first; 22433e519524SHoward Hinnant *__result = *__i; 22443e519524SHoward Hinnant ++__result; 22453e519524SHoward Hinnant while (++__first != __last) 22463e519524SHoward Hinnant { 22473e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22483e519524SHoward Hinnant { 22493e519524SHoward Hinnant *__result = *__first; 22503e519524SHoward Hinnant ++__result; 22513e519524SHoward Hinnant __i = __first; 22523e519524SHoward Hinnant } 22533e519524SHoward Hinnant } 22543e519524SHoward Hinnant } 22553e519524SHoward Hinnant return __result; 22563e519524SHoward Hinnant} 22573e519524SHoward Hinnant 22583e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22593e519524SHoward Hinnant_ForwardIterator 22603e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22613e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22623e519524SHoward Hinnant{ 22633e519524SHoward Hinnant if (__first != __last) 22643e519524SHoward Hinnant { 22653e519524SHoward Hinnant *__result = *__first; 22663e519524SHoward Hinnant while (++__first != __last) 22673e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22683e519524SHoward Hinnant *++__result = *__first; 22693e519524SHoward Hinnant ++__result; 22703e519524SHoward Hinnant } 22713e519524SHoward Hinnant return __result; 22723e519524SHoward Hinnant} 22733e519524SHoward Hinnant 22743e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22763e519524SHoward Hinnant_OutputIterator 22773e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22783e519524SHoward Hinnant{ 2279ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22803e519524SHoward Hinnant (__first, __last, __result, __pred, 22813e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22823e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22833e519524SHoward Hinnant} 22843e519524SHoward Hinnant 22853e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22873e519524SHoward Hinnant_OutputIterator 22883e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22893e519524SHoward Hinnant{ 22903e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2291ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22923e519524SHoward Hinnant} 22933e519524SHoward Hinnant 22943e519524SHoward Hinnant// reverse 22953e519524SHoward Hinnant 22963e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22983e519524SHoward Hinnantvoid 22993e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23003e519524SHoward Hinnant{ 23013e519524SHoward Hinnant while (__first != __last) 23023e519524SHoward Hinnant { 23033e519524SHoward Hinnant if (__first == --__last) 23043e519524SHoward Hinnant break; 23053e519524SHoward Hinnant swap(*__first, *__last); 23063e519524SHoward Hinnant ++__first; 23073e519524SHoward Hinnant } 23083e519524SHoward Hinnant} 23093e519524SHoward Hinnant 23103e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23123e519524SHoward Hinnantvoid 23133e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23143e519524SHoward Hinnant{ 23153e519524SHoward Hinnant if (__first != __last) 23163e519524SHoward Hinnant for (; __first < --__last; ++__first) 23173e519524SHoward Hinnant swap(*__first, *__last); 23183e519524SHoward Hinnant} 23193e519524SHoward Hinnant 23203e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23223e519524SHoward Hinnantvoid 23233e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23243e519524SHoward Hinnant{ 2325ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23263e519524SHoward Hinnant} 23273e519524SHoward Hinnant 23283e519524SHoward Hinnant// reverse_copy 23293e519524SHoward Hinnant 23303e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23323e519524SHoward Hinnant_OutputIterator 23333e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23343e519524SHoward Hinnant{ 23353e519524SHoward Hinnant for (; __first != __last; ++__result) 23363e519524SHoward Hinnant *__result = *--__last; 23373e519524SHoward Hinnant return __result; 23383e519524SHoward Hinnant} 23393e519524SHoward Hinnant 23403e519524SHoward Hinnant// rotate 23413e519524SHoward Hinnant 23423e519524SHoward Hinnanttemplate <class _ForwardIterator> 23433e519524SHoward Hinnant_ForwardIterator 2344aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23453e519524SHoward Hinnant{ 2346aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2347aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2348aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2349aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2350aca09de3SHoward Hinnant return __lm1; 2351aca09de3SHoward Hinnant} 2352aca09de3SHoward Hinnant 2353aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2354aca09de3SHoward Hinnant_BidirectionalIterator 2355aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2356aca09de3SHoward Hinnant{ 2357aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2358aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2359aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2360aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2361aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2362aca09de3SHoward Hinnant return __fp1; 2363aca09de3SHoward Hinnant} 2364aca09de3SHoward Hinnant 2365aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2366aca09de3SHoward Hinnant_ForwardIterator 2367aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2368aca09de3SHoward Hinnant{ 23693e519524SHoward Hinnant _ForwardIterator __i = __middle; 23703e519524SHoward Hinnant while (true) 23713e519524SHoward Hinnant { 23723e519524SHoward Hinnant swap(*__first, *__i); 23733e519524SHoward Hinnant ++__first; 23743e519524SHoward Hinnant if (++__i == __last) 23753e519524SHoward Hinnant break; 23763e519524SHoward Hinnant if (__first == __middle) 23773e519524SHoward Hinnant __middle = __i; 23783e519524SHoward Hinnant } 23793e519524SHoward Hinnant _ForwardIterator __r = __first; 23803e519524SHoward Hinnant if (__first != __middle) 23813e519524SHoward Hinnant { 23823e519524SHoward Hinnant __i = __middle; 23833e519524SHoward Hinnant while (true) 23843e519524SHoward Hinnant { 23853e519524SHoward Hinnant swap(*__first, *__i); 23863e519524SHoward Hinnant ++__first; 23873e519524SHoward Hinnant if (++__i == __last) 23883e519524SHoward Hinnant { 23893e519524SHoward Hinnant if (__first == __middle) 23903e519524SHoward Hinnant break; 23913e519524SHoward Hinnant __i = __middle; 23923e519524SHoward Hinnant } 23933e519524SHoward Hinnant else if (__first == __middle) 23943e519524SHoward Hinnant __middle = __i; 23953e519524SHoward Hinnant } 23963e519524SHoward Hinnant } 23973e519524SHoward Hinnant return __r; 23983e519524SHoward Hinnant} 23993e519524SHoward Hinnant 24003e519524SHoward Hinnanttemplate<typename _Integral> 24013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24023e519524SHoward Hinnant_Integral 24033e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 24043e519524SHoward Hinnant{ 24053e519524SHoward Hinnant do 24063e519524SHoward Hinnant { 24073e519524SHoward Hinnant _Integral __t = __x % __y; 24083e519524SHoward Hinnant __x = __y; 24093e519524SHoward Hinnant __y = __t; 24103e519524SHoward Hinnant } while (__y); 24113e519524SHoward Hinnant return __x; 24123e519524SHoward Hinnant} 24133e519524SHoward Hinnant 24143e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24153e519524SHoward Hinnant_RandomAccessIterator 2416aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24173e519524SHoward Hinnant{ 24183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24193e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24203e519524SHoward Hinnant 24213e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24223e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24233e519524SHoward Hinnant if (__m1 == __m2) 24243e519524SHoward Hinnant { 2425ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24263e519524SHoward Hinnant return __middle; 24273e519524SHoward Hinnant } 2428aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24293e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24303e519524SHoward Hinnant { 2431aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24323e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24333e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24343e519524SHoward Hinnant do 24353e519524SHoward Hinnant { 2436aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24373e519524SHoward Hinnant __p1 = __p2; 24383e519524SHoward Hinnant const difference_type __d = __last - __p2; 24393e519524SHoward Hinnant if (__m1 < __d) 24403e519524SHoward Hinnant __p2 += __m1; 24413e519524SHoward Hinnant else 24423e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24433e519524SHoward Hinnant } while (__p2 != __p); 2444aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24453e519524SHoward Hinnant } 24463e519524SHoward Hinnant return __first + __m2; 24473e519524SHoward Hinnant} 24483e519524SHoward Hinnant 24493e519524SHoward Hinnanttemplate <class _ForwardIterator> 24503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24513e519524SHoward Hinnant_ForwardIterator 2452aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2453aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2454aca09de3SHoward Hinnant{ 2455aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2456aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2457aca09de3SHoward Hinnant { 2458aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2459aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2460aca09de3SHoward Hinnant } 2461aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2462aca09de3SHoward Hinnant} 2463aca09de3SHoward Hinnant 2464aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2465aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2466aca09de3SHoward Hinnant_BidirectionalIterator 2467aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2468aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2469aca09de3SHoward Hinnant{ 2470aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2471aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2472aca09de3SHoward Hinnant { 2473aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2474aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2475aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2476aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2477aca09de3SHoward Hinnant } 2478aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2479aca09de3SHoward Hinnant} 2480aca09de3SHoward Hinnant 2481aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2482aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2483aca09de3SHoward Hinnant_RandomAccessIterator 2484aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2485aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2486aca09de3SHoward Hinnant{ 2487aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2488aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2489aca09de3SHoward Hinnant { 2490aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2491aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2492aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2493aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2494aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2495aca09de3SHoward Hinnant } 2496aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2497aca09de3SHoward Hinnant} 2498aca09de3SHoward Hinnant 2499aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2500aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2501aca09de3SHoward Hinnant_ForwardIterator 25023e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25033e519524SHoward Hinnant{ 2504aca09de3SHoward Hinnant if (__first == __middle) 2505aca09de3SHoward Hinnant return __last; 2506aca09de3SHoward Hinnant if (__middle == __last) 2507aca09de3SHoward Hinnant return __first; 2508ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2509aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25103e519524SHoward Hinnant} 25113e519524SHoward Hinnant 25123e519524SHoward Hinnant// rotate_copy 25133e519524SHoward Hinnant 25143e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25163e519524SHoward Hinnant_OutputIterator 25173e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25183e519524SHoward Hinnant{ 2519ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25203e519524SHoward Hinnant} 25213e519524SHoward Hinnant 25223e519524SHoward Hinnant// min_element 25233e519524SHoward Hinnant 25243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25259d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25263e519524SHoward Hinnant_ForwardIterator 25279d67c6d5SMarshall Clow__min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25283e519524SHoward Hinnant{ 25293e519524SHoward Hinnant if (__first != __last) 25303e519524SHoward Hinnant { 25313e519524SHoward Hinnant _ForwardIterator __i = __first; 25323e519524SHoward Hinnant while (++__i != __last) 25333e519524SHoward Hinnant if (__comp(*__i, *__first)) 25343e519524SHoward Hinnant __first = __i; 25353e519524SHoward Hinnant } 25363e519524SHoward Hinnant return __first; 25373e519524SHoward Hinnant} 25383e519524SHoward Hinnant 25399d67c6d5SMarshall Clowtemplate <class _ForwardIterator, class _Compare> 25409d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 25419d67c6d5SMarshall Clow_ForwardIterator 25429d67c6d5SMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25439d67c6d5SMarshall Clow{ 25449d67c6d5SMarshall Clow return __min_element(__first, __last, __comp); 25459d67c6d5SMarshall Clow} 25469d67c6d5SMarshall Clow 25473e519524SHoward Hinnanttemplate <class _ForwardIterator> 25483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25493e519524SHoward Hinnant_ForwardIterator 25503e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25513e519524SHoward Hinnant{ 25529d67c6d5SMarshall Clow return __min_element(__first, __last, 25534eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25544eb27b79SHoward Hinnant} 25554eb27b79SHoward Hinnant 25564eb27b79SHoward Hinnant// min 25574eb27b79SHoward Hinnant 25584eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25599d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25604eb27b79SHoward Hinnantconst _Tp& 25614eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25624eb27b79SHoward Hinnant{ 25634eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25644eb27b79SHoward Hinnant} 25654eb27b79SHoward Hinnant 25664eb27b79SHoward Hinnanttemplate <class _Tp> 25679d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25684eb27b79SHoward Hinnantconst _Tp& 25694eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25704eb27b79SHoward Hinnant{ 2571ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25724eb27b79SHoward Hinnant} 25734eb27b79SHoward Hinnant 257454976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 257554976f26SHoward Hinnant 25764eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25779d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25784eb27b79SHoward Hinnant_Tp 25794eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25804eb27b79SHoward Hinnant{ 25819d67c6d5SMarshall Clow return *__min_element(__t.begin(), __t.end(), __comp); 25824eb27b79SHoward Hinnant} 25834eb27b79SHoward Hinnant 25844eb27b79SHoward Hinnanttemplate<class _Tp> 25859d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25864eb27b79SHoward Hinnant_Tp 25874eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25884eb27b79SHoward Hinnant{ 25899d67c6d5SMarshall Clow return *__min_element(__t.begin(), __t.end(), __less<_Tp>()); 25903e519524SHoward Hinnant} 25913e519524SHoward Hinnant 259254976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 259354976f26SHoward Hinnant 25943e519524SHoward Hinnant// max_element 25953e519524SHoward Hinnant 25963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25979d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25983e519524SHoward Hinnant_ForwardIterator 25999d67c6d5SMarshall Clow__max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26003e519524SHoward Hinnant{ 26013e519524SHoward Hinnant if (__first != __last) 26023e519524SHoward Hinnant { 26033e519524SHoward Hinnant _ForwardIterator __i = __first; 26043e519524SHoward Hinnant while (++__i != __last) 26053e519524SHoward Hinnant if (__comp(*__first, *__i)) 26063e519524SHoward Hinnant __first = __i; 26073e519524SHoward Hinnant } 26083e519524SHoward Hinnant return __first; 26093e519524SHoward Hinnant} 26103e519524SHoward Hinnant 26119d67c6d5SMarshall Clow 26129d67c6d5SMarshall Clowtemplate <class _ForwardIterator, class _Compare> 26139d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 26149d67c6d5SMarshall Clow_ForwardIterator 26159d67c6d5SMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26169d67c6d5SMarshall Clow{ 26179d67c6d5SMarshall Clow return __max_element(__first, __last, __comp); 26189d67c6d5SMarshall Clow} 26199d67c6d5SMarshall Clow 26203e519524SHoward Hinnanttemplate <class _ForwardIterator> 26213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26223e519524SHoward Hinnant_ForwardIterator 26233e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26243e519524SHoward Hinnant{ 26259d67c6d5SMarshall Clow return __max_element(__first, __last, 26264eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26274eb27b79SHoward Hinnant} 26284eb27b79SHoward Hinnant 26294eb27b79SHoward Hinnant// max 26304eb27b79SHoward Hinnant 26314eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26329d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26334eb27b79SHoward Hinnantconst _Tp& 26344eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26354eb27b79SHoward Hinnant{ 26364eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26374eb27b79SHoward Hinnant} 26384eb27b79SHoward Hinnant 26394eb27b79SHoward Hinnanttemplate <class _Tp> 26409d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26414eb27b79SHoward Hinnantconst _Tp& 26424eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26434eb27b79SHoward Hinnant{ 2644ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26454eb27b79SHoward Hinnant} 26464eb27b79SHoward Hinnant 264754976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 264854976f26SHoward Hinnant 26494eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26509d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26514eb27b79SHoward Hinnant_Tp 26524eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26534eb27b79SHoward Hinnant{ 26549d67c6d5SMarshall Clow return *__max_element(__t.begin(), __t.end(), __comp); 26554eb27b79SHoward Hinnant} 26564eb27b79SHoward Hinnant 26574eb27b79SHoward Hinnanttemplate<class _Tp> 26589d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26594eb27b79SHoward Hinnant_Tp 26604eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26614eb27b79SHoward Hinnant{ 26629d67c6d5SMarshall Clow return *__max_element(__t.begin(), __t.end(), __less<_Tp>()); 26633e519524SHoward Hinnant} 26643e519524SHoward Hinnant 266554976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 266654976f26SHoward Hinnant 26673e519524SHoward Hinnant// minmax_element 26683e519524SHoward Hinnant 26693e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26703e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26713e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26723e519524SHoward Hinnant{ 26733e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26743e519524SHoward Hinnant if (__first != __last) 26753e519524SHoward Hinnant { 26763e519524SHoward Hinnant if (++__first != __last) 26773e519524SHoward Hinnant { 26783e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26793e519524SHoward Hinnant __result.first = __first; 26803e519524SHoward Hinnant else 26813e519524SHoward Hinnant __result.second = __first; 26823e519524SHoward Hinnant while (++__first != __last) 26833e519524SHoward Hinnant { 26843e519524SHoward Hinnant _ForwardIterator __i = __first; 26853e519524SHoward Hinnant if (++__first == __last) 26863e519524SHoward Hinnant { 26873e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26883e519524SHoward Hinnant __result.first = __i; 26893e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26903e519524SHoward Hinnant __result.second = __i; 26913e519524SHoward Hinnant break; 26923e519524SHoward Hinnant } 26933e519524SHoward Hinnant else 26943e519524SHoward Hinnant { 26953e519524SHoward Hinnant if (__comp(*__first, *__i)) 26963e519524SHoward Hinnant { 26973e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26983e519524SHoward Hinnant __result.first = __first; 26993e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27003e519524SHoward Hinnant __result.second = __i; 27013e519524SHoward Hinnant } 27023e519524SHoward Hinnant else 27033e519524SHoward Hinnant { 27043e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27053e519524SHoward Hinnant __result.first = __i; 27063e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27073e519524SHoward Hinnant __result.second = __first; 27083e519524SHoward Hinnant } 27093e519524SHoward Hinnant } 27103e519524SHoward Hinnant } 27113e519524SHoward Hinnant } 27123e519524SHoward Hinnant } 27133e519524SHoward Hinnant return __result; 27143e519524SHoward Hinnant} 27153e519524SHoward Hinnant 27163e519524SHoward Hinnanttemplate <class _ForwardIterator> 27173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27183e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27193e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27203e519524SHoward Hinnant{ 27219d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27229d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27233e519524SHoward Hinnant} 27243e519524SHoward Hinnant 27254eb27b79SHoward Hinnant// minmax 27264eb27b79SHoward Hinnant 27274eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27289d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27294eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27304eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27314eb27b79SHoward Hinnant{ 27324eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27334eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27344eb27b79SHoward Hinnant} 27354eb27b79SHoward Hinnant 27364eb27b79SHoward Hinnanttemplate<class _Tp> 27379d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27384eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27394eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27404eb27b79SHoward Hinnant{ 2741ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27424eb27b79SHoward Hinnant} 27434eb27b79SHoward Hinnant 274454976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 274554976f26SHoward Hinnant 27464eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27479d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27484eb27b79SHoward Hinnantpair<_Tp, _Tp> 27494eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27504eb27b79SHoward Hinnant{ 27519d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27529d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27539d67c6d5SMarshall Clow _Iter __last = __t.end(); 27549d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result ( *__first, *__first ); 27559d67c6d5SMarshall Clow 27569d67c6d5SMarshall Clow ++__first; 27579d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27589d67c6d5SMarshall Clow { 27599d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27609d67c6d5SMarshall Clow __result.first = *__first; 27619d67c6d5SMarshall Clow else 27629d67c6d5SMarshall Clow __result.second = *__first; 27639d67c6d5SMarshall Clow ++__first; 27649d67c6d5SMarshall Clow } 27659d67c6d5SMarshall Clow 27669d67c6d5SMarshall Clow while (__first != __last) 27679d67c6d5SMarshall Clow { 27689d67c6d5SMarshall Clow _Tp __prev = *__first++; 27699d67c6d5SMarshall Clow if (__comp(__prev, *__first)) { 27709d67c6d5SMarshall Clow if (__comp(__prev, __result.first)) __result.first = __prev; 27719d67c6d5SMarshall Clow if (__comp(__result.second, *__first)) __result.second = *__first; 27729d67c6d5SMarshall Clow } 27739d67c6d5SMarshall Clow else { 27749d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) __result.first = *__first; 27759d67c6d5SMarshall Clow if (__comp(__result.second, __prev)) __result.second = __prev; 27769d67c6d5SMarshall Clow } 27779d67c6d5SMarshall Clow 27789d67c6d5SMarshall Clow __first++; 27799d67c6d5SMarshall Clow } 27809d67c6d5SMarshall Clow return __result; 27819d67c6d5SMarshall Clow} 27829d67c6d5SMarshall Clow 27839d67c6d5SMarshall Clowtemplate<class _Tp> 27849d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27859d67c6d5SMarshall Clowpair<_Tp, _Tp> 27869d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 27879d67c6d5SMarshall Clow{ 27889d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 27894eb27b79SHoward Hinnant} 27904eb27b79SHoward Hinnant 279154976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 279254976f26SHoward Hinnant 27933e519524SHoward Hinnant// random_shuffle 27943e519524SHoward Hinnant 2795f9d540b0SHoward Hinnant// __independent_bits_engine 2796f9d540b0SHoward Hinnant 2797c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2798f9d540b0SHoward Hinnantstruct __log2_imp 27993e519524SHoward Hinnant{ 2800c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2801c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28023e519524SHoward Hinnant}; 28033e519524SHoward Hinnant 2804c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2805c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28063e519524SHoward Hinnant{ 2807f9d540b0SHoward Hinnant static const size_t value = 0; 28083e519524SHoward Hinnant}; 28093e519524SHoward Hinnant 2810c003db1fSHoward Hinnanttemplate <size_t _Rp> 2811c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28123e519524SHoward Hinnant{ 2813c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28143e519524SHoward Hinnant}; 28153e519524SHoward Hinnant 2816c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2817f9d540b0SHoward Hinnantstruct __log2 28183e519524SHoward Hinnant{ 2819c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2820f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 28213e519524SHoward Hinnant}; 28223e519524SHoward Hinnant 2823f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2824f9d540b0SHoward Hinnantclass __independent_bits_engine 28253e519524SHoward Hinnant{ 2826f9d540b0SHoward Hinnantpublic: 2827f9d540b0SHoward Hinnant // types 2828f9d540b0SHoward Hinnant typedef _UIntType result_type; 2829f9d540b0SHoward Hinnant 2830f9d540b0SHoward Hinnantprivate: 2831f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2832f9d540b0SHoward Hinnant typedef typename conditional 2833f9d540b0SHoward Hinnant < 2834f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2835f9d540b0SHoward Hinnant result_type, 2836f9d540b0SHoward Hinnant _Engine_result_type 2837f9d540b0SHoward Hinnant >::type _Working_result_type; 2838f9d540b0SHoward Hinnant 2839f9d540b0SHoward Hinnant _Engine& __e_; 2840f9d540b0SHoward Hinnant size_t __w_; 2841f9d540b0SHoward Hinnant size_t __w0_; 2842f9d540b0SHoward Hinnant size_t __n_; 2843f9d540b0SHoward Hinnant size_t __n0_; 2844f9d540b0SHoward Hinnant _Working_result_type __y0_; 2845f9d540b0SHoward Hinnant _Working_result_type __y1_; 2846f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2847f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2848f9d540b0SHoward Hinnant 2849e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2850c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2851f9d540b0SHoward Hinnant + _Working_result_type(1); 2852e386b7b3SHoward Hinnant#else 2853e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2854e386b7b3SHoward Hinnant + _Working_result_type(1); 2855e386b7b3SHoward Hinnant#endif 2856e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2857e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2858e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2859f9d540b0SHoward Hinnant 2860f9d540b0SHoward Hinnantpublic: 2861f9d540b0SHoward Hinnant // constructors and seeding functions 2862f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2863f9d540b0SHoward Hinnant 2864f9d540b0SHoward Hinnant // generating functions 2865c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2866f9d540b0SHoward Hinnant 2867f9d540b0SHoward Hinnantprivate: 2868f9d540b0SHoward Hinnant result_type __eval(false_type); 2869f9d540b0SHoward Hinnant result_type __eval(true_type); 2870f9d540b0SHoward Hinnant}; 2871f9d540b0SHoward Hinnant 2872f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2873f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2874f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2875f9d540b0SHoward Hinnant : __e_(__e), 2876f9d540b0SHoward Hinnant __w_(__w) 2877f9d540b0SHoward Hinnant{ 2878f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2879f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2880c003db1fSHoward Hinnant if (_Rp == 0) 2881c003db1fSHoward Hinnant __y0_ = _Rp; 2882f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2883c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2884f9d540b0SHoward Hinnant else 2885f9d540b0SHoward Hinnant __y0_ = 0; 2886c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2887f9d540b0SHoward Hinnant { 2888f9d540b0SHoward Hinnant ++__n_; 2889f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2890f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2891c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2892f9d540b0SHoward Hinnant else 2893f9d540b0SHoward Hinnant __y0_ = 0; 2894f9d540b0SHoward Hinnant } 2895f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2896f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2897c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2898f9d540b0SHoward Hinnant else 2899f9d540b0SHoward Hinnant __y1_ = 0; 2900f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2901f9d540b0SHoward Hinnant _Engine_result_type(0); 2902f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2903f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2904f9d540b0SHoward Hinnant _Engine_result_type(~0); 29053e519524SHoward Hinnant} 29063e519524SHoward Hinnant 2907f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2908f9d540b0SHoward Hinnantinline 2909f9d540b0SHoward Hinnant_UIntType 2910f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29113e519524SHoward Hinnant{ 2912f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29133e519524SHoward Hinnant} 29143e519524SHoward Hinnant 2915f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2916f9d540b0SHoward Hinnant_UIntType 2917f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29183e519524SHoward Hinnant{ 2919c003db1fSHoward Hinnant result_type _Sp = 0; 2920f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2921f9d540b0SHoward Hinnant { 2922f9d540b0SHoward Hinnant _Engine_result_type __u; 29233e519524SHoward Hinnant do 2924f9d540b0SHoward Hinnant { 2925f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2926f9d540b0SHoward Hinnant } while (__u >= __y0_); 29270176bc6cSHoward Hinnant if (__w0_ < _WDt) 2928c003db1fSHoward Hinnant _Sp <<= __w0_; 2929f9d540b0SHoward Hinnant else 2930c003db1fSHoward Hinnant _Sp = 0; 2931c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2932f9d540b0SHoward Hinnant } 2933f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2934f9d540b0SHoward Hinnant { 2935f9d540b0SHoward Hinnant _Engine_result_type __u; 2936f9d540b0SHoward Hinnant do 2937f9d540b0SHoward Hinnant { 2938f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2939f9d540b0SHoward Hinnant } while (__u >= __y1_); 29400176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2941c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2942f9d540b0SHoward Hinnant else 2943c003db1fSHoward Hinnant _Sp = 0; 2944c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2945f9d540b0SHoward Hinnant } 2946c003db1fSHoward Hinnant return _Sp; 29473e519524SHoward Hinnant} 29483e519524SHoward Hinnant 2949f9d540b0SHoward Hinnant// uniform_int_distribution 29503e519524SHoward Hinnant 2951f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2952f9d540b0SHoward Hinnantclass uniform_int_distribution 29533e519524SHoward Hinnant{ 2954f9d540b0SHoward Hinnantpublic: 2955f9d540b0SHoward Hinnant // types 2956f9d540b0SHoward Hinnant typedef _IntType result_type; 2957f9d540b0SHoward Hinnant 2958f9d540b0SHoward Hinnant class param_type 2959f9d540b0SHoward Hinnant { 2960f9d540b0SHoward Hinnant result_type __a_; 2961f9d540b0SHoward Hinnant result_type __b_; 2962f9d540b0SHoward Hinnant public: 2963f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2964f9d540b0SHoward Hinnant 2965f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2966f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2967f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2968f9d540b0SHoward Hinnant 2969f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2970f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2971f9d540b0SHoward Hinnant 2972f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2973f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2974f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2975f9d540b0SHoward Hinnant {return !(__x == __y);} 29763e519524SHoward Hinnant }; 29773e519524SHoward Hinnant 2978f9d540b0SHoward Hinnantprivate: 2979f9d540b0SHoward Hinnant param_type __p_; 29803e519524SHoward Hinnant 2981f9d540b0SHoward Hinnantpublic: 2982f9d540b0SHoward Hinnant // constructors and reset functions 2983f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2984f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2985f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2986f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2987f9d540b0SHoward Hinnant void reset() {} 2988f9d540b0SHoward Hinnant 2989f9d540b0SHoward Hinnant // generating functions 2990f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2991f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2992f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2993f9d540b0SHoward Hinnant 2994f9d540b0SHoward Hinnant // property functions 2995f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2996f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2997f9d540b0SHoward Hinnant 2998f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2999f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3000f9d540b0SHoward Hinnant 3001f9d540b0SHoward Hinnant result_type min() const {return a();} 3002f9d540b0SHoward Hinnant result_type max() const {return b();} 3003f9d540b0SHoward Hinnant 3004f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3005f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3006f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3007f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3008f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3009f9d540b0SHoward Hinnant {return !(__x == __y);} 30103e519524SHoward Hinnant}; 30113e519524SHoward Hinnant 3012f9d540b0SHoward Hinnanttemplate<class _IntType> 3013f9d540b0SHoward Hinnanttemplate<class _URNG> 3014f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3015f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30163e519524SHoward Hinnant{ 3017f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3018f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3019c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3020c003db1fSHoward Hinnant if (_Rp == 1) 3021f9d540b0SHoward Hinnant return __p.a(); 3022f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3023f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3024c003db1fSHoward Hinnant if (_Rp == 0) 3025f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3026c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3027c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 3028f9d540b0SHoward Hinnant ++__w; 3029f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3030f9d540b0SHoward Hinnant _UIntType __u; 3031f9d540b0SHoward Hinnant do 30323e519524SHoward Hinnant { 3033f9d540b0SHoward Hinnant __u = __e(); 3034c003db1fSHoward Hinnant } while (__u >= _Rp); 3035f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30363e519524SHoward Hinnant} 3037f9d540b0SHoward Hinnant 3038f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3039f9d540b0SHoward Hinnant 3040f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3041f9d540b0SHoward Hinnant 3042f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30433e519524SHoward Hinnant{ 3044f9d540b0SHoward Hinnant static unsigned __c_; 3045f9d540b0SHoward Hinnant 3046f9d540b0SHoward Hinnant __rs_default(); 3047f9d540b0SHoward Hinnantpublic: 3048b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3049f9d540b0SHoward Hinnant 3050f9d540b0SHoward Hinnant static const result_type _Min = 0; 3051f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3052f9d540b0SHoward Hinnant 3053f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3054f9d540b0SHoward Hinnant ~__rs_default(); 3055f9d540b0SHoward Hinnant 3056f9d540b0SHoward Hinnant result_type operator()(); 3057f9d540b0SHoward Hinnant 3058788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3059788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3060f9d540b0SHoward Hinnant 3061f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3062f9d540b0SHoward Hinnant}; 3063f9d540b0SHoward Hinnant 3064f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30653e519524SHoward Hinnant 30663e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30673e519524SHoward Hinnantvoid 30683e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30693e519524SHoward Hinnant{ 30703e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3071c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3072c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30733e519524SHoward Hinnant difference_type __d = __last - __first; 30743e519524SHoward Hinnant if (__d > 1) 30753e519524SHoward Hinnant { 3076c003db1fSHoward Hinnant _Dp __uid; 3077f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3078f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3079007b26beSHoward Hinnant { 3080c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3081007b26beSHoward Hinnant if (__i != difference_type(0)) 3082007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3083007b26beSHoward Hinnant } 30843e519524SHoward Hinnant } 30853e519524SHoward Hinnant} 30863e519524SHoward Hinnant 30873e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 30883e519524SHoward Hinnantvoid 30893e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 30907609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 30913e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30923e519524SHoward Hinnant#else 30933e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30943e519524SHoward Hinnant#endif 30953e519524SHoward Hinnant{ 30963e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30973e519524SHoward Hinnant difference_type __d = __last - __first; 30983e519524SHoward Hinnant if (__d > 1) 30993e519524SHoward Hinnant { 31003e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3101007b26beSHoward Hinnant { 3102007b26beSHoward Hinnant difference_type __i = __rand(__d); 3103007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3104007b26beSHoward Hinnant } 31053e519524SHoward Hinnant } 31063e519524SHoward Hinnant} 31073e519524SHoward Hinnant 3108f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3109f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3110fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3111fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3112fb340102SHoward Hinnant#else 3113f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3114fb340102SHoward Hinnant#endif 3115f9d540b0SHoward Hinnant{ 3116f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3117c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3118c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3119f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3120f9d540b0SHoward Hinnant if (__d > 1) 3121f9d540b0SHoward Hinnant { 3122c003db1fSHoward Hinnant _Dp __uid; 3123f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3124007b26beSHoward Hinnant { 3125c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3126007b26beSHoward Hinnant if (__i != difference_type(0)) 3127007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3128007b26beSHoward Hinnant } 3129f9d540b0SHoward Hinnant } 3130f9d540b0SHoward Hinnant} 3131f9d540b0SHoward Hinnant 31323e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 31333e519524SHoward Hinnantbool 31343e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31353e519524SHoward Hinnant{ 31363e519524SHoward Hinnant for (; __first != __last; ++__first) 31373e519524SHoward Hinnant if (!__pred(*__first)) 31383e519524SHoward Hinnant break; 31393e519524SHoward Hinnant for (; __first != __last; ++__first) 31403e519524SHoward Hinnant if (__pred(*__first)) 31413e519524SHoward Hinnant return false; 31423e519524SHoward Hinnant return true; 31433e519524SHoward Hinnant} 31443e519524SHoward Hinnant 31453e519524SHoward Hinnant// partition 31463e519524SHoward Hinnant 31473e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31483e519524SHoward Hinnant_ForwardIterator 31493e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31503e519524SHoward Hinnant{ 31513e519524SHoward Hinnant while (true) 31523e519524SHoward Hinnant { 31533e519524SHoward Hinnant if (__first == __last) 31543e519524SHoward Hinnant return __first; 31553e519524SHoward Hinnant if (!__pred(*__first)) 31563e519524SHoward Hinnant break; 31573e519524SHoward Hinnant ++__first; 31583e519524SHoward Hinnant } 31593e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31603e519524SHoward Hinnant { 31613e519524SHoward Hinnant if (__pred(*__p)) 31623e519524SHoward Hinnant { 31633e519524SHoward Hinnant swap(*__first, *__p); 31643e519524SHoward Hinnant ++__first; 31653e519524SHoward Hinnant } 31663e519524SHoward Hinnant } 31673e519524SHoward Hinnant return __first; 31683e519524SHoward Hinnant} 31693e519524SHoward Hinnant 31703e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31713e519524SHoward Hinnant_BidirectionalIterator 31723e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31733e519524SHoward Hinnant bidirectional_iterator_tag) 31743e519524SHoward Hinnant{ 31753e519524SHoward Hinnant while (true) 31763e519524SHoward Hinnant { 31773e519524SHoward Hinnant while (true) 31783e519524SHoward Hinnant { 31793e519524SHoward Hinnant if (__first == __last) 31803e519524SHoward Hinnant return __first; 31813e519524SHoward Hinnant if (!__pred(*__first)) 31823e519524SHoward Hinnant break; 31833e519524SHoward Hinnant ++__first; 31843e519524SHoward Hinnant } 31853e519524SHoward Hinnant do 31863e519524SHoward Hinnant { 31873e519524SHoward Hinnant if (__first == --__last) 31883e519524SHoward Hinnant return __first; 31893e519524SHoward Hinnant } while (!__pred(*__last)); 31903e519524SHoward Hinnant swap(*__first, *__last); 31913e519524SHoward Hinnant ++__first; 31923e519524SHoward Hinnant } 31933e519524SHoward Hinnant} 31943e519524SHoward Hinnant 31953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31973e519524SHoward Hinnant_ForwardIterator 31983e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31993e519524SHoward Hinnant{ 3200ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32013e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32023e519524SHoward Hinnant} 32033e519524SHoward Hinnant 32043e519524SHoward Hinnant// partition_copy 32053e519524SHoward Hinnant 32063e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32073e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32083e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 32093e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32103e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32113e519524SHoward Hinnant _Predicate __pred) 32123e519524SHoward Hinnant{ 32133e519524SHoward Hinnant for (; __first != __last; ++__first) 32143e519524SHoward Hinnant { 32153e519524SHoward Hinnant if (__pred(*__first)) 32163e519524SHoward Hinnant { 32173e519524SHoward Hinnant *__out_true = *__first; 32183e519524SHoward Hinnant ++__out_true; 32193e519524SHoward Hinnant } 32203e519524SHoward Hinnant else 32213e519524SHoward Hinnant { 32223e519524SHoward Hinnant *__out_false = *__first; 32233e519524SHoward Hinnant ++__out_false; 32243e519524SHoward Hinnant } 32253e519524SHoward Hinnant } 32263e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32273e519524SHoward Hinnant} 32283e519524SHoward Hinnant 32293e519524SHoward Hinnant// partition_point 32303e519524SHoward Hinnant 32313e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 32323e519524SHoward Hinnant_ForwardIterator 32333e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32343e519524SHoward Hinnant{ 32353e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3236ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32373e519524SHoward Hinnant while (__len != 0) 32383e519524SHoward Hinnant { 32393e519524SHoward Hinnant difference_type __l2 = __len / 2; 32403e519524SHoward Hinnant _ForwardIterator __m = __first; 3241ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32423e519524SHoward Hinnant if (__pred(*__m)) 32433e519524SHoward Hinnant { 32443e519524SHoward Hinnant __first = ++__m; 32453e519524SHoward Hinnant __len -= __l2 + 1; 32463e519524SHoward Hinnant } 32473e519524SHoward Hinnant else 32483e519524SHoward Hinnant __len = __l2; 32493e519524SHoward Hinnant } 32503e519524SHoward Hinnant return __first; 32513e519524SHoward Hinnant} 32523e519524SHoward Hinnant 32533e519524SHoward Hinnant// stable_partition 32543e519524SHoward Hinnant 32553e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32563e519524SHoward Hinnant_ForwardIterator 32573e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32583e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32593e519524SHoward Hinnant{ 32603e519524SHoward Hinnant // *__first is known to be false 32613e519524SHoward Hinnant // __len >= 1 32623e519524SHoward Hinnant if (__len == 1) 32633e519524SHoward Hinnant return __first; 32643e519524SHoward Hinnant if (__len == 2) 32653e519524SHoward Hinnant { 32663e519524SHoward Hinnant _ForwardIterator __m = __first; 32673e519524SHoward Hinnant if (__pred(*++__m)) 32683e519524SHoward Hinnant { 32693e519524SHoward Hinnant swap(*__first, *__m); 32703e519524SHoward Hinnant return __m; 32713e519524SHoward Hinnant } 32723e519524SHoward Hinnant return __first; 32733e519524SHoward Hinnant } 32743e519524SHoward Hinnant if (__len <= __p.second) 32753e519524SHoward Hinnant { // The buffer is big enough to use 32763e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32773e519524SHoward Hinnant __destruct_n __d(0); 32783e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32793e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32803e519524SHoward Hinnant // Update __first to always point to the end of the trues 32813e519524SHoward Hinnant value_type* __t = __p.first; 3282ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32833e519524SHoward Hinnant __d.__incr((value_type*)0); 32843e519524SHoward Hinnant ++__t; 32853e519524SHoward Hinnant _ForwardIterator __i = __first; 32863e519524SHoward Hinnant while (++__i != __last) 32873e519524SHoward Hinnant { 32883e519524SHoward Hinnant if (__pred(*__i)) 32893e519524SHoward Hinnant { 3290ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32913e519524SHoward Hinnant ++__first; 32923e519524SHoward Hinnant } 32933e519524SHoward Hinnant else 32943e519524SHoward Hinnant { 3295ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32963e519524SHoward Hinnant __d.__incr((value_type*)0); 32973e519524SHoward Hinnant ++__t; 32983e519524SHoward Hinnant } 32993e519524SHoward Hinnant } 33003e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33013e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33023e519524SHoward Hinnant __i = __first; 33033e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3304ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33053e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33063e519524SHoward Hinnant return __first; 33073e519524SHoward Hinnant } 33083e519524SHoward Hinnant // Else not enough buffer, do in place 33093e519524SHoward Hinnant // __len >= 3 33103e519524SHoward Hinnant _ForwardIterator __m = __first; 33113e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3312ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33133e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33143e519524SHoward Hinnant // F????????????????? 33153e519524SHoward Hinnant // f m l 33163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33173e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33183e519524SHoward Hinnant // TTTFFFFF?????????? 33193e519524SHoward Hinnant // f ff m l 33203e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33213e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33223e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33233e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33243e519524SHoward Hinnant while (__pred(*__m1)) 33253e519524SHoward Hinnant { 33263e519524SHoward Hinnant if (++__m1 == __last) 33273e519524SHoward Hinnant goto __second_half_done; 33283e519524SHoward Hinnant --__len_half; 33293e519524SHoward Hinnant } 33303e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33313e519524SHoward Hinnant // f ff m m1 l 33323e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33333e519524SHoward Hinnant__second_half_done: 33343e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33353e519524SHoward Hinnant // f ff m sf l 3336ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33373e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33383e519524SHoward Hinnant // | 33393e519524SHoward Hinnant} 33403e519524SHoward Hinnant 33413e519524SHoward Hinnantstruct __return_temporary_buffer 33423e519524SHoward Hinnant{ 33433e519524SHoward Hinnant template <class _Tp> 3344ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33453e519524SHoward Hinnant}; 33463e519524SHoward Hinnant 33473e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33483e519524SHoward Hinnant_ForwardIterator 33493e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33503e519524SHoward Hinnant forward_iterator_tag) 33513e519524SHoward Hinnant{ 33523e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33533e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33543e519524SHoward Hinnant while (true) 33553e519524SHoward Hinnant { 33563e519524SHoward Hinnant if (__first == __last) 33573e519524SHoward Hinnant return __first; 33583e519524SHoward Hinnant if (!__pred(*__first)) 33593e519524SHoward Hinnant break; 33603e519524SHoward Hinnant ++__first; 33613e519524SHoward Hinnant } 33623e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33633e519524SHoward Hinnant // *__first is known to be false 33643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33653e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3366ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33673e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33683e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33693e519524SHoward Hinnant if (__len >= __alloc_limit) 33703e519524SHoward Hinnant { 3371ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33723e519524SHoward Hinnant __h.reset(__p.first); 33733e519524SHoward Hinnant } 33743e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33753e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33763e519524SHoward Hinnant} 33773e519524SHoward Hinnant 33783e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33793e519524SHoward Hinnant_BidirectionalIterator 33803e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33813e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33823e519524SHoward Hinnant{ 33833e519524SHoward Hinnant // *__first is known to be false 33843e519524SHoward Hinnant // *__last is known to be true 33853e519524SHoward Hinnant // __len >= 2 33863e519524SHoward Hinnant if (__len == 2) 33873e519524SHoward Hinnant { 33883e519524SHoward Hinnant swap(*__first, *__last); 33893e519524SHoward Hinnant return __last; 33903e519524SHoward Hinnant } 33913e519524SHoward Hinnant if (__len == 3) 33923e519524SHoward Hinnant { 33933e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33943e519524SHoward Hinnant if (__pred(*++__m)) 33953e519524SHoward Hinnant { 33963e519524SHoward Hinnant swap(*__first, *__m); 33973e519524SHoward Hinnant swap(*__m, *__last); 33983e519524SHoward Hinnant return __last; 33993e519524SHoward Hinnant } 34003e519524SHoward Hinnant swap(*__m, *__last); 34013e519524SHoward Hinnant swap(*__first, *__m); 34023e519524SHoward Hinnant return __m; 34033e519524SHoward Hinnant } 34043e519524SHoward Hinnant if (__len <= __p.second) 34053e519524SHoward Hinnant { // The buffer is big enough to use 34063e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34073e519524SHoward Hinnant __destruct_n __d(0); 34083e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34093e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34103e519524SHoward Hinnant // Update __first to always point to the end of the trues 34113e519524SHoward Hinnant value_type* __t = __p.first; 3412ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34133e519524SHoward Hinnant __d.__incr((value_type*)0); 34143e519524SHoward Hinnant ++__t; 34153e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34163e519524SHoward Hinnant while (++__i != __last) 34173e519524SHoward Hinnant { 34183e519524SHoward Hinnant if (__pred(*__i)) 34193e519524SHoward Hinnant { 3420ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34213e519524SHoward Hinnant ++__first; 34223e519524SHoward Hinnant } 34233e519524SHoward Hinnant else 34243e519524SHoward Hinnant { 3425ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34263e519524SHoward Hinnant __d.__incr((value_type*)0); 34273e519524SHoward Hinnant ++__t; 34283e519524SHoward Hinnant } 34293e519524SHoward Hinnant } 34303e519524SHoward Hinnant // move *__last, known to be true 3431ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34323e519524SHoward Hinnant __i = ++__first; 34333e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34343e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34353e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3436ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34373e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34383e519524SHoward Hinnant return __first; 34393e519524SHoward Hinnant } 34403e519524SHoward Hinnant // Else not enough buffer, do in place 34413e519524SHoward Hinnant // __len >= 4 34423e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34433e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3444ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34453e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34463e519524SHoward Hinnant // F????????????????T 34473e519524SHoward Hinnant // f m l 34483e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34493e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34503e519524SHoward Hinnant _Distance __len_half = __len2; 34513e519524SHoward Hinnant while (!__pred(*--__m1)) 34523e519524SHoward Hinnant { 34533e519524SHoward Hinnant if (__m1 == __first) 34543e519524SHoward Hinnant goto __first_half_done; 34553e519524SHoward Hinnant --__len_half; 34563e519524SHoward Hinnant } 34573e519524SHoward Hinnant // F???TFFF?????????T 34583e519524SHoward Hinnant // f m1 m l 34593e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34603e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34613e519524SHoward Hinnant__first_half_done: 34623e519524SHoward Hinnant // TTTFFFFF?????????T 34633e519524SHoward Hinnant // f ff m l 34643e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34653e519524SHoward Hinnant __m1 = __m; 34663e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34673e519524SHoward Hinnant ++__second_false; 34683e519524SHoward Hinnant __len_half = __len - __len2; 34693e519524SHoward Hinnant while (__pred(*__m1)) 34703e519524SHoward Hinnant { 34713e519524SHoward Hinnant if (++__m1 == __last) 34723e519524SHoward Hinnant goto __second_half_done; 34733e519524SHoward Hinnant --__len_half; 34743e519524SHoward Hinnant } 34753e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34763e519524SHoward Hinnant // f ff m m1 l 34773e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34783e519524SHoward Hinnant__second_half_done: 34793e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34803e519524SHoward Hinnant // f ff m sf l 3481ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34823e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34833e519524SHoward Hinnant // | 34843e519524SHoward Hinnant} 34853e519524SHoward Hinnant 34863e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34873e519524SHoward Hinnant_BidirectionalIterator 34883e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34893e519524SHoward Hinnant bidirectional_iterator_tag) 34903e519524SHoward Hinnant{ 34913e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34923e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34933e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34943e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34953e519524SHoward Hinnant while (true) 34963e519524SHoward Hinnant { 34973e519524SHoward Hinnant if (__first == __last) 34983e519524SHoward Hinnant return __first; 34993e519524SHoward Hinnant if (!__pred(*__first)) 35003e519524SHoward Hinnant break; 35013e519524SHoward Hinnant ++__first; 35023e519524SHoward Hinnant } 35033e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35043e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35053e519524SHoward Hinnant do 35063e519524SHoward Hinnant { 35073e519524SHoward Hinnant if (__first == --__last) 35083e519524SHoward Hinnant return __first; 35093e519524SHoward Hinnant } while (!__pred(*__last)); 35103e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35113e519524SHoward Hinnant // *__first is known to be false 35123e519524SHoward Hinnant // *__last is known to be true 35133e519524SHoward Hinnant // __len >= 2 3514ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35153e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35163e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35173e519524SHoward Hinnant if (__len >= __alloc_limit) 35183e519524SHoward Hinnant { 3519ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35203e519524SHoward Hinnant __h.reset(__p.first); 35213e519524SHoward Hinnant } 35223e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35233e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35243e519524SHoward Hinnant} 35253e519524SHoward Hinnant 35263e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35283e519524SHoward Hinnant_ForwardIterator 35293e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35303e519524SHoward Hinnant{ 35313e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35323e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35333e519524SHoward Hinnant} 35343e519524SHoward Hinnant 35353e519524SHoward Hinnant// is_sorted_until 35363e519524SHoward Hinnant 35373e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35383e519524SHoward Hinnant_ForwardIterator 35393e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35403e519524SHoward Hinnant{ 35413e519524SHoward Hinnant if (__first != __last) 35423e519524SHoward Hinnant { 35433e519524SHoward Hinnant _ForwardIterator __i = __first; 35443e519524SHoward Hinnant while (++__i != __last) 35453e519524SHoward Hinnant { 35463e519524SHoward Hinnant if (__comp(*__i, *__first)) 35473e519524SHoward Hinnant return __i; 35483e519524SHoward Hinnant __first = __i; 35493e519524SHoward Hinnant } 35503e519524SHoward Hinnant } 35513e519524SHoward Hinnant return __last; 35523e519524SHoward Hinnant} 35533e519524SHoward Hinnant 35543e519524SHoward Hinnanttemplate<class _ForwardIterator> 35553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35563e519524SHoward Hinnant_ForwardIterator 35573e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35583e519524SHoward Hinnant{ 3559ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35603e519524SHoward Hinnant} 35613e519524SHoward Hinnant 35623e519524SHoward Hinnant// is_sorted 35633e519524SHoward Hinnant 35643e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35663e519524SHoward Hinnantbool 35673e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35683e519524SHoward Hinnant{ 3569ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35703e519524SHoward Hinnant} 35713e519524SHoward Hinnant 35723e519524SHoward Hinnanttemplate<class _ForwardIterator> 35733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35743e519524SHoward Hinnantbool 35753e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35763e519524SHoward Hinnant{ 3577ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35783e519524SHoward Hinnant} 35793e519524SHoward Hinnant 35803e519524SHoward Hinnant// sort 35813e519524SHoward Hinnant 35823e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35833e519524SHoward Hinnant 35843e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35853e519524SHoward Hinnantunsigned 35863e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35873e519524SHoward Hinnant{ 35883e519524SHoward Hinnant unsigned __r = 0; 35893e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35903e519524SHoward Hinnant { 35913e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35923e519524SHoward Hinnant return __r; // x <= y && y <= z 35933e519524SHoward Hinnant // x <= y && y > z 35943e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35953e519524SHoward Hinnant __r = 1; 35963e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35973e519524SHoward Hinnant { 35983e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35993e519524SHoward Hinnant __r = 2; 36003e519524SHoward Hinnant } 36013e519524SHoward Hinnant return __r; // x <= y && y < z 36023e519524SHoward Hinnant } 36033e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36043e519524SHoward Hinnant { 36053e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36063e519524SHoward Hinnant __r = 1; 36073e519524SHoward Hinnant return __r; 36083e519524SHoward Hinnant } 36093e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36103e519524SHoward Hinnant __r = 1; // x < y && x <= z 36113e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36123e519524SHoward Hinnant { 36133e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36143e519524SHoward Hinnant __r = 2; 36153e519524SHoward Hinnant } 36163e519524SHoward Hinnant return __r; 36173e519524SHoward Hinnant} // x <= y && y <= z 36183e519524SHoward Hinnant 36193e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36203e519524SHoward Hinnant 36213e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36223e519524SHoward Hinnantunsigned 36233e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36243e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36253e519524SHoward Hinnant{ 36263e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36273e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36283e519524SHoward Hinnant { 36293e519524SHoward Hinnant swap(*__x3, *__x4); 36303e519524SHoward Hinnant ++__r; 36313e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36323e519524SHoward Hinnant { 36333e519524SHoward Hinnant swap(*__x2, *__x3); 36343e519524SHoward Hinnant ++__r; 36353e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36363e519524SHoward Hinnant { 36373e519524SHoward Hinnant swap(*__x1, *__x2); 36383e519524SHoward Hinnant ++__r; 36393e519524SHoward Hinnant } 36403e519524SHoward Hinnant } 36413e519524SHoward Hinnant } 36423e519524SHoward Hinnant return __r; 36433e519524SHoward Hinnant} 36443e519524SHoward Hinnant 36453e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36463e519524SHoward Hinnant 36473e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36483e519524SHoward Hinnantunsigned 36493e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36503e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36513e519524SHoward Hinnant{ 36523e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36533e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36543e519524SHoward Hinnant { 36553e519524SHoward Hinnant swap(*__x4, *__x5); 36563e519524SHoward Hinnant ++__r; 36573e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36583e519524SHoward Hinnant { 36593e519524SHoward Hinnant swap(*__x3, *__x4); 36603e519524SHoward Hinnant ++__r; 36613e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36623e519524SHoward Hinnant { 36633e519524SHoward Hinnant swap(*__x2, *__x3); 36643e519524SHoward Hinnant ++__r; 36653e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36663e519524SHoward Hinnant { 36673e519524SHoward Hinnant swap(*__x1, *__x2); 36683e519524SHoward Hinnant ++__r; 36693e519524SHoward Hinnant } 36703e519524SHoward Hinnant } 36713e519524SHoward Hinnant } 36723e519524SHoward Hinnant } 36733e519524SHoward Hinnant return __r; 36743e519524SHoward Hinnant} 36753e519524SHoward Hinnant 36763e519524SHoward Hinnant// Assumes size > 0 36773e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36783e519524SHoward Hinnantvoid 36793e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36803e519524SHoward Hinnant{ 36813e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36823e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36833e519524SHoward Hinnant { 3684ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36853e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36863e519524SHoward Hinnant (__first, __last, __comp); 36873e519524SHoward Hinnant if (__i != __first) 36883e519524SHoward Hinnant swap(*__first, *__i); 36893e519524SHoward Hinnant } 36903e519524SHoward Hinnant} 36913e519524SHoward Hinnant 36923e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36933e519524SHoward Hinnantvoid 36943e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36953e519524SHoward Hinnant{ 36963e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36973e519524SHoward Hinnant if (__first != __last) 36983e519524SHoward Hinnant { 36993e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37003e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37013e519524SHoward Hinnant { 37023e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3703ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37043e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3705ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3706ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37073e519524SHoward Hinnant } 37083e519524SHoward Hinnant } 37093e519524SHoward Hinnant} 37103e519524SHoward Hinnant 37113e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37123e519524SHoward Hinnantvoid 37133e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37143e519524SHoward Hinnant{ 37153e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37163e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37173e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37183e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37193e519524SHoward Hinnant { 37203e519524SHoward Hinnant if (__comp(*__i, *__j)) 37213e519524SHoward Hinnant { 3722ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37233e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37243e519524SHoward Hinnant __j = __i; 37253e519524SHoward Hinnant do 37263e519524SHoward Hinnant { 3727ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37283e519524SHoward Hinnant __j = __k; 37293e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3730ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37313e519524SHoward Hinnant } 37323e519524SHoward Hinnant __j = __i; 37333e519524SHoward Hinnant } 37343e519524SHoward Hinnant} 37353e519524SHoward Hinnant 37363e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37373e519524SHoward Hinnantbool 37383e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37393e519524SHoward Hinnant{ 37403e519524SHoward Hinnant switch (__last - __first) 37413e519524SHoward Hinnant { 37423e519524SHoward Hinnant case 0: 37433e519524SHoward Hinnant case 1: 37443e519524SHoward Hinnant return true; 37453e519524SHoward Hinnant case 2: 37463e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37473e519524SHoward Hinnant swap(*__first, *__last); 37483e519524SHoward Hinnant return true; 37493e519524SHoward Hinnant case 3: 3750ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37513e519524SHoward Hinnant return true; 37523e519524SHoward Hinnant case 4: 3753ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37543e519524SHoward Hinnant return true; 37553e519524SHoward Hinnant case 5: 3756ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37573e519524SHoward Hinnant return true; 37583e519524SHoward Hinnant } 37593e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37603e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37613e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37623e519524SHoward Hinnant const unsigned __limit = 8; 37633e519524SHoward Hinnant unsigned __count = 0; 37643e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37653e519524SHoward Hinnant { 37663e519524SHoward Hinnant if (__comp(*__i, *__j)) 37673e519524SHoward Hinnant { 3768ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37693e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37703e519524SHoward Hinnant __j = __i; 37713e519524SHoward Hinnant do 37723e519524SHoward Hinnant { 3773ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37743e519524SHoward Hinnant __j = __k; 37753e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3776ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37773e519524SHoward Hinnant if (++__count == __limit) 37783e519524SHoward Hinnant return ++__i == __last; 37793e519524SHoward Hinnant } 37803e519524SHoward Hinnant __j = __i; 37813e519524SHoward Hinnant } 37823e519524SHoward Hinnant return true; 37833e519524SHoward Hinnant} 37843e519524SHoward Hinnant 37853e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37863e519524SHoward Hinnantvoid 37873e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37883e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37893e519524SHoward Hinnant{ 37903e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37913e519524SHoward Hinnant if (__first1 != __last1) 37923e519524SHoward Hinnant { 37933e519524SHoward Hinnant __destruct_n __d(0); 37943e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37953e519524SHoward Hinnant value_type* __last2 = __first2; 3796ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37973e519524SHoward Hinnant __d.__incr((value_type*)0); 37983e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37993e519524SHoward Hinnant { 38003e519524SHoward Hinnant value_type* __j2 = __last2; 38013e519524SHoward Hinnant value_type* __i2 = __j2; 38023e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38033e519524SHoward Hinnant { 3804ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38053e519524SHoward Hinnant __d.__incr((value_type*)0); 38063e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3807ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3808ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38093e519524SHoward Hinnant } 38103e519524SHoward Hinnant else 38113e519524SHoward Hinnant { 3812ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38133e519524SHoward Hinnant __d.__incr((value_type*)0); 38143e519524SHoward Hinnant } 38153e519524SHoward Hinnant } 38163e519524SHoward Hinnant __h.release(); 38173e519524SHoward Hinnant } 38183e519524SHoward Hinnant} 38193e519524SHoward Hinnant 38203e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38213e519524SHoward Hinnantvoid 38223e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38233e519524SHoward Hinnant{ 38243e519524SHoward Hinnant // _Compare is known to be a reference type 38253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38263e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3827ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3828ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38293e519524SHoward Hinnant while (true) 38303e519524SHoward Hinnant { 38313e519524SHoward Hinnant __restart: 38323e519524SHoward Hinnant difference_type __len = __last - __first; 38333e519524SHoward Hinnant switch (__len) 38343e519524SHoward Hinnant { 38353e519524SHoward Hinnant case 0: 38363e519524SHoward Hinnant case 1: 38373e519524SHoward Hinnant return; 38383e519524SHoward Hinnant case 2: 38393e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38403e519524SHoward Hinnant swap(*__first, *__last); 38413e519524SHoward Hinnant return; 38423e519524SHoward Hinnant case 3: 3843ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38443e519524SHoward Hinnant return; 38453e519524SHoward Hinnant case 4: 3846ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38473e519524SHoward Hinnant return; 38483e519524SHoward Hinnant case 5: 3849ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38503e519524SHoward Hinnant return; 38513e519524SHoward Hinnant } 38523e519524SHoward Hinnant if (__len <= __limit) 38533e519524SHoward Hinnant { 3854ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38553e519524SHoward Hinnant return; 38563e519524SHoward Hinnant } 38573e519524SHoward Hinnant // __len > 5 38583e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38593e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38603e519524SHoward Hinnant --__lm1; 38613e519524SHoward Hinnant unsigned __n_swaps; 38623e519524SHoward Hinnant { 38633e519524SHoward Hinnant difference_type __delta; 38643e519524SHoward Hinnant if (__len >= 1000) 38653e519524SHoward Hinnant { 38663e519524SHoward Hinnant __delta = __len/2; 38673e519524SHoward Hinnant __m += __delta; 38683e519524SHoward Hinnant __delta /= 2; 3869ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38703e519524SHoward Hinnant } 38713e519524SHoward Hinnant else 38723e519524SHoward Hinnant { 38733e519524SHoward Hinnant __delta = __len/2; 38743e519524SHoward Hinnant __m += __delta; 3875ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38763e519524SHoward Hinnant } 38773e519524SHoward Hinnant } 38783e519524SHoward Hinnant // *__m is median 38793e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38803e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38813e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38823e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38833e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38843e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38853e519524SHoward Hinnant // Prime the downward search with a guard. 38863e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38873e519524SHoward Hinnant { 38883e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38893e519524SHoward Hinnant // manually guard downward moving __j against __i 38903e519524SHoward Hinnant while (true) 38913e519524SHoward Hinnant { 38923e519524SHoward Hinnant if (__i == --__j) 38933e519524SHoward Hinnant { 38943e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38953e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38963e519524SHoward Hinnant ++__i; // __first + 1 38973e519524SHoward Hinnant __j = __last; 38983e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38993e519524SHoward Hinnant { 39003e519524SHoward Hinnant while (true) 39013e519524SHoward Hinnant { 39023e519524SHoward Hinnant if (__i == __j) 39033e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39043e519524SHoward Hinnant if (__comp(*__first, *__i)) 39053e519524SHoward Hinnant { 39063e519524SHoward Hinnant swap(*__i, *__j); 39073e519524SHoward Hinnant ++__n_swaps; 39083e519524SHoward Hinnant ++__i; 39093e519524SHoward Hinnant break; 39103e519524SHoward Hinnant } 39113e519524SHoward Hinnant ++__i; 39123e519524SHoward Hinnant } 39133e519524SHoward Hinnant } 39143e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39153e519524SHoward Hinnant if (__i == __j) 39163e519524SHoward Hinnant return; 39173e519524SHoward Hinnant while (true) 39183e519524SHoward Hinnant { 39193e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39203e519524SHoward Hinnant ++__i; 39213e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39223e519524SHoward Hinnant ; 39233e519524SHoward Hinnant if (__i >= __j) 39243e519524SHoward Hinnant break; 39253e519524SHoward Hinnant swap(*__i, *__j); 39263e519524SHoward Hinnant ++__n_swaps; 39273e519524SHoward Hinnant ++__i; 39283e519524SHoward Hinnant } 39293e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39303e519524SHoward Hinnant // The first part is sorted, sort the secod part 3931ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39323e519524SHoward Hinnant __first = __i; 39333e519524SHoward Hinnant goto __restart; 39343e519524SHoward Hinnant } 39353e519524SHoward Hinnant if (__comp(*__j, *__m)) 39363e519524SHoward Hinnant { 39373e519524SHoward Hinnant swap(*__i, *__j); 39383e519524SHoward Hinnant ++__n_swaps; 39393e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39403e519524SHoward Hinnant } 39413e519524SHoward Hinnant } 39423e519524SHoward Hinnant } 39433e519524SHoward Hinnant // It is known that *__i < *__m 39443e519524SHoward Hinnant ++__i; 39453e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39463e519524SHoward Hinnant // if not yet partitioned... 39473e519524SHoward Hinnant if (__i < __j) 39483e519524SHoward Hinnant { 39493e519524SHoward Hinnant // known that *(__i - 1) < *__m 39503e519524SHoward Hinnant // known that __i <= __m 39513e519524SHoward Hinnant while (true) 39523e519524SHoward Hinnant { 39533e519524SHoward Hinnant // __m still guards upward moving __i 39543e519524SHoward Hinnant while (__comp(*__i, *__m)) 39553e519524SHoward Hinnant ++__i; 39563e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39573e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39583e519524SHoward Hinnant ; 39593e519524SHoward Hinnant if (__i > __j) 39603e519524SHoward Hinnant break; 39613e519524SHoward Hinnant swap(*__i, *__j); 39623e519524SHoward Hinnant ++__n_swaps; 39633e519524SHoward Hinnant // It is known that __m != __j 39643e519524SHoward Hinnant // If __m just moved, follow it 39653e519524SHoward Hinnant if (__m == __i) 39663e519524SHoward Hinnant __m = __j; 39673e519524SHoward Hinnant ++__i; 39683e519524SHoward Hinnant } 39693e519524SHoward Hinnant } 39703e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39713e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39723e519524SHoward Hinnant { 39733e519524SHoward Hinnant swap(*__i, *__m); 39743e519524SHoward Hinnant ++__n_swaps; 39753e519524SHoward Hinnant } 39763e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39773e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39783e519524SHoward Hinnant if (__n_swaps == 0) 39793e519524SHoward Hinnant { 3980ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3981ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39823e519524SHoward Hinnant { 39833e519524SHoward Hinnant if (__fs) 39843e519524SHoward Hinnant return; 39853e519524SHoward Hinnant __last = __i; 39863e519524SHoward Hinnant continue; 39873e519524SHoward Hinnant } 39883e519524SHoward Hinnant else 39893e519524SHoward Hinnant { 39903e519524SHoward Hinnant if (__fs) 39913e519524SHoward Hinnant { 39923e519524SHoward Hinnant __first = ++__i; 39933e519524SHoward Hinnant continue; 39943e519524SHoward Hinnant } 39953e519524SHoward Hinnant } 39963e519524SHoward Hinnant } 39973e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39983e519524SHoward Hinnant if (__i - __first < __last - __i) 39993e519524SHoward Hinnant { 4000ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4001ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40023e519524SHoward Hinnant __first = ++__i; 40033e519524SHoward Hinnant } 40043e519524SHoward Hinnant else 40053e519524SHoward Hinnant { 4006ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4007ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40083e519524SHoward Hinnant __last = __i; 40093e519524SHoward Hinnant } 40103e519524SHoward Hinnant } 40113e519524SHoward Hinnant} 40123e519524SHoward Hinnant 40133e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40143e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40163e519524SHoward Hinnantvoid 40173e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40183e519524SHoward Hinnant{ 4019145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40223e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4023145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40253e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4026145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40273e519524SHoward Hinnant} 40283e519524SHoward Hinnant 40293e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40313e519524SHoward Hinnantvoid 40323e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40333e519524SHoward Hinnant{ 4034ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40353e519524SHoward Hinnant} 40363e519524SHoward Hinnant 40373e519524SHoward Hinnanttemplate <class _Tp> 40383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40393e519524SHoward Hinnantvoid 40403e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40413e519524SHoward Hinnant{ 4042ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40433e519524SHoward Hinnant} 40443e519524SHoward Hinnant 40453e519524SHoward Hinnanttemplate <class _Tp> 40463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40473e519524SHoward Hinnantvoid 40483e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40493e519524SHoward Hinnant{ 4050ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40513e519524SHoward Hinnant} 40523e519524SHoward Hinnant 4053f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4054f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4055f554add5SHoward Hinnantvoid 4056f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4057f554add5SHoward Hinnant{ 4058f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4059f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4060f554add5SHoward Hinnant} 4061f554add5SHoward Hinnant 40620be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4063e4383379SHoward Hinnant#pragma warning( push ) 4064e4383379SHoward Hinnant#pragma warning( disable: 4231) 40650be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4066f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4067f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4068f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4069f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4070f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4071f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4072f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4073f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4074f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4075f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4076f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4077f0544c20SHoward 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>&)) 4078f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4079f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4080f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40813e519524SHoward Hinnant 4082f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4083f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4084f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4085f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4086f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4087f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4088f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4089f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4090f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4091f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4092f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4093f0544c20SHoward 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>&)) 4094f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4095f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4096f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40973e519524SHoward Hinnant 4098f0544c20SHoward 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>&)) 40990be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4100e4383379SHoward Hinnant#pragma warning( pop ) 41010be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 41023e519524SHoward Hinnant 41033e519524SHoward Hinnant// lower_bound 41043e519524SHoward Hinnant 41053e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41063e519524SHoward Hinnant_ForwardIterator 4107e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41083e519524SHoward Hinnant{ 41093e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4110ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41113e519524SHoward Hinnant while (__len != 0) 41123e519524SHoward Hinnant { 41133e519524SHoward Hinnant difference_type __l2 = __len / 2; 41143e519524SHoward Hinnant _ForwardIterator __m = __first; 4115ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4116e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41173e519524SHoward Hinnant { 41183e519524SHoward Hinnant __first = ++__m; 41193e519524SHoward Hinnant __len -= __l2 + 1; 41203e519524SHoward Hinnant } 41213e519524SHoward Hinnant else 41223e519524SHoward Hinnant __len = __l2; 41233e519524SHoward Hinnant } 41243e519524SHoward Hinnant return __first; 41253e519524SHoward Hinnant} 41263e519524SHoward Hinnant 41273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41293e519524SHoward Hinnant_ForwardIterator 4130e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41313e519524SHoward Hinnant{ 4132145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41333e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41343e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4135e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4136145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41373e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4138e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4139145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41403e519524SHoward Hinnant} 41413e519524SHoward Hinnant 41423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41443e519524SHoward Hinnant_ForwardIterator 4145e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41463e519524SHoward Hinnant{ 4147e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41483e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41493e519524SHoward Hinnant} 41503e519524SHoward Hinnant 41513e519524SHoward Hinnant// upper_bound 41523e519524SHoward Hinnant 41533e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41543e519524SHoward Hinnant_ForwardIterator 4155e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41563e519524SHoward Hinnant{ 41573e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4158ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41593e519524SHoward Hinnant while (__len != 0) 41603e519524SHoward Hinnant { 41613e519524SHoward Hinnant difference_type __l2 = __len / 2; 41623e519524SHoward Hinnant _ForwardIterator __m = __first; 4163ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4164e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41653e519524SHoward Hinnant __len = __l2; 41663e519524SHoward Hinnant else 41673e519524SHoward Hinnant { 41683e519524SHoward Hinnant __first = ++__m; 41693e519524SHoward Hinnant __len -= __l2 + 1; 41703e519524SHoward Hinnant } 41713e519524SHoward Hinnant } 41723e519524SHoward Hinnant return __first; 41733e519524SHoward Hinnant} 41743e519524SHoward Hinnant 41753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41773e519524SHoward Hinnant_ForwardIterator 4178e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41793e519524SHoward Hinnant{ 4180145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41813e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41823e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4183e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4184145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41853e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4186e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4187145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41883e519524SHoward Hinnant} 41893e519524SHoward Hinnant 41903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41923e519524SHoward Hinnant_ForwardIterator 4193e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41943e519524SHoward Hinnant{ 4195e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41963e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41973e519524SHoward Hinnant} 41983e519524SHoward Hinnant 41993e519524SHoward Hinnant// equal_range 42003e519524SHoward Hinnant 42013e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42023e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4203e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42043e519524SHoward Hinnant{ 42053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4206ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42073e519524SHoward Hinnant while (__len != 0) 42083e519524SHoward Hinnant { 42093e519524SHoward Hinnant difference_type __l2 = __len / 2; 42103e519524SHoward Hinnant _ForwardIterator __m = __first; 4211ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4212e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42133e519524SHoward Hinnant { 42143e519524SHoward Hinnant __first = ++__m; 42153e519524SHoward Hinnant __len -= __l2 + 1; 42163e519524SHoward Hinnant } 4217e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42183e519524SHoward Hinnant { 42193e519524SHoward Hinnant __last = __m; 42203e519524SHoward Hinnant __len = __l2; 42213e519524SHoward Hinnant } 42223e519524SHoward Hinnant else 42233e519524SHoward Hinnant { 42243e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42253e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42263e519524SHoward Hinnant ( 4227e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4228e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42293e519524SHoward Hinnant ); 42303e519524SHoward Hinnant } 42313e519524SHoward Hinnant } 42323e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42333e519524SHoward Hinnant} 42343e519524SHoward Hinnant 42353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42373e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4238e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42393e519524SHoward Hinnant{ 4240145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42413e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42423e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4243e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4244145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42453e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4246e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4247145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42483e519524SHoward Hinnant} 42493e519524SHoward Hinnant 42503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42523e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4253e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42543e519524SHoward Hinnant{ 4255e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42563e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42573e519524SHoward Hinnant} 42583e519524SHoward Hinnant 42593e519524SHoward Hinnant// binary_search 42603e519524SHoward Hinnant 42613e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42633e519524SHoward Hinnantbool 4264e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42653e519524SHoward Hinnant{ 4266e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4267e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42683e519524SHoward Hinnant} 42693e519524SHoward Hinnant 42703e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42723e519524SHoward Hinnantbool 4273e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42743e519524SHoward Hinnant{ 4275145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4278e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4279145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4281e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4282145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42833e519524SHoward Hinnant} 42843e519524SHoward Hinnant 42853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42873e519524SHoward Hinnantbool 4288e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42893e519524SHoward Hinnant{ 4290e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42913e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42923e519524SHoward Hinnant} 42933e519524SHoward Hinnant 42943e519524SHoward Hinnant// merge 42953e519524SHoward Hinnant 42963e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42973e519524SHoward Hinnant_OutputIterator 42983e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42993e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43003e519524SHoward Hinnant{ 43013e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43023e519524SHoward Hinnant { 43033e519524SHoward Hinnant if (__first2 == __last2) 4304ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43053e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43063e519524SHoward Hinnant { 43073e519524SHoward Hinnant *__result = *__first2; 43083e519524SHoward Hinnant ++__first2; 43093e519524SHoward Hinnant } 43103e519524SHoward Hinnant else 43113e519524SHoward Hinnant { 43123e519524SHoward Hinnant *__result = *__first1; 43133e519524SHoward Hinnant ++__first1; 43143e519524SHoward Hinnant } 43153e519524SHoward Hinnant } 4316ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43173e519524SHoward Hinnant} 43183e519524SHoward Hinnant 43193e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43213e519524SHoward Hinnant_OutputIterator 43223e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43233e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43243e519524SHoward Hinnant{ 4325145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43263e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43273e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4328ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4329145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43303e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4331ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4332145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43333e519524SHoward Hinnant} 43343e519524SHoward Hinnant 43353e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43373e519524SHoward Hinnant_OutputIterator 43383e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43403e519524SHoward Hinnant{ 43413e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43423e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43433e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43443e519524SHoward Hinnant} 43453e519524SHoward Hinnant 43463e519524SHoward Hinnant// inplace_merge 43473e519524SHoward Hinnant 43483e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43493e519524SHoward Hinnantvoid 43503e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43513e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43523e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43533e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 43543e519524SHoward Hinnant{ 43553e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43563e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43573e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 43583e519524SHoward Hinnant __destruct_n __d(0); 43593e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43603e519524SHoward Hinnant if (__len1 <= __len2) 43613e519524SHoward Hinnant { 43623e519524SHoward Hinnant value_type* __p = __buff; 43633e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 4364ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43653e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 43663e519524SHoward Hinnant move_iterator<value_type*>(__p), 43673e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 43683e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 43693e519524SHoward Hinnant __first, __comp); 43703e519524SHoward Hinnant } 43713e519524SHoward Hinnant else 43723e519524SHoward Hinnant { 43733e519524SHoward Hinnant value_type* __p = __buff; 43743e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 4375ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43763e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43773e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 43783e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 43793e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 43803e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 43813e519524SHoward Hinnant } 43823e519524SHoward Hinnant} 43833e519524SHoward Hinnant 43843e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43853e519524SHoward Hinnantvoid 43863e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43873e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43883e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43893e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43903e519524SHoward Hinnant{ 43913e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43923e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43933e519524SHoward Hinnant while (true) 43943e519524SHoward Hinnant { 43953e519524SHoward Hinnant // if __middle == __last, we're done 43963e519524SHoward Hinnant if (__len2 == 0) 43973e519524SHoward Hinnant return; 43983e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 43993e519524SHoward Hinnant for (; true; ++__first, --__len1) 44003e519524SHoward Hinnant { 44013e519524SHoward Hinnant if (__len1 == 0) 44023e519524SHoward Hinnant return; 44033e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44043e519524SHoward Hinnant break; 44053e519524SHoward Hinnant } 44063e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 44073e519524SHoward Hinnant { 44083e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 44093e519524SHoward Hinnant return; 44103e519524SHoward Hinnant } 44113e519524SHoward Hinnant // __first < __middle < __last 44123e519524SHoward Hinnant // *__first > *__middle 44133e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44143e519524SHoward Hinnant // all elements in: 44153e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44163e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44173e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44183e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44193e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44203e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44213e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44223e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44233e519524SHoward Hinnant // binary search smaller range 44243e519524SHoward Hinnant if (__len1 < __len2) 44253e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44263e519524SHoward Hinnant __len21 = __len2 / 2; 44273e519524SHoward Hinnant __m2 = __middle; 4428ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44293e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4430ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44313e519524SHoward Hinnant } 44323e519524SHoward Hinnant else 44333e519524SHoward Hinnant { 44343e519524SHoward Hinnant if (__len1 == 1) 44353e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44363e519524SHoward Hinnant // It is known *__first > *__middle 44373e519524SHoward Hinnant swap(*__first, *__middle); 44383e519524SHoward Hinnant return; 44393e519524SHoward Hinnant } 44403e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44413e519524SHoward Hinnant __len11 = __len1 / 2; 44423e519524SHoward Hinnant __m1 = __first; 4443ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44443e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4445ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44463e519524SHoward Hinnant } 44473e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44483e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44493e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44503e519524SHoward Hinnant // swap middle two partitions 4451ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44523e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44533e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44543e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 44553e519524SHoward Hinnant { 44563e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44573e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44583e519524SHoward Hinnant __first = __middle; 44593e519524SHoward Hinnant __middle = __m2; 44603e519524SHoward Hinnant __len1 = __len12; 44613e519524SHoward Hinnant __len2 = __len22; 44623e519524SHoward Hinnant } 44633e519524SHoward Hinnant else 44643e519524SHoward Hinnant { 44653e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44663e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44673e519524SHoward Hinnant __last = __middle; 44683e519524SHoward Hinnant __middle = __m1; 44693e519524SHoward Hinnant __len1 = __len11; 44703e519524SHoward Hinnant __len2 = __len21; 44713e519524SHoward Hinnant } 44723e519524SHoward Hinnant } 44733e519524SHoward Hinnant} 44743e519524SHoward Hinnant 44753e519524SHoward Hinnanttemplate <class _Tp> 44763e519524SHoward Hinnantstruct __inplace_merge_switch 44773e519524SHoward Hinnant{ 4478ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 44793e519524SHoward Hinnant}; 44803e519524SHoward Hinnant 44813e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44833e519524SHoward Hinnantvoid 44843e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44853e519524SHoward Hinnant _Compare __comp) 44863e519524SHoward Hinnant{ 44873e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44883e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4489ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4490ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4491ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44923e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 44933e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 44943e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 44953e519524SHoward Hinnant { 4496ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44973e519524SHoward Hinnant __h.reset(__buf.first); 44983e519524SHoward Hinnant } 4499145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 45003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4502ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 45033e519524SHoward Hinnant __buf.first, __buf.second); 4504145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45053e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4506ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45073e519524SHoward Hinnant __buf.first, __buf.second); 4508145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45093e519524SHoward Hinnant} 45103e519524SHoward Hinnant 45113e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45133e519524SHoward Hinnantvoid 45143e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45153e519524SHoward Hinnant{ 4516ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45173e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45183e519524SHoward Hinnant} 45193e519524SHoward Hinnant 45203e519524SHoward Hinnant// stable_sort 45213e519524SHoward Hinnant 45223e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45233e519524SHoward Hinnantvoid 45243e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45263e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45273e519524SHoward Hinnant{ 45283e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45293e519524SHoward Hinnant __destruct_n __d(0); 45303e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45313e519524SHoward Hinnant for (; true; ++__result) 45323e519524SHoward Hinnant { 45333e519524SHoward Hinnant if (__first1 == __last1) 45343e519524SHoward Hinnant { 45353e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4536ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45373e519524SHoward Hinnant __h.release(); 45383e519524SHoward Hinnant return; 45393e519524SHoward Hinnant } 45403e519524SHoward Hinnant if (__first2 == __last2) 45413e519524SHoward Hinnant { 45423e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4543ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45443e519524SHoward Hinnant __h.release(); 45453e519524SHoward Hinnant return; 45463e519524SHoward Hinnant } 45473e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45483e519524SHoward Hinnant { 4549ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45503e519524SHoward Hinnant __d.__incr((value_type*)0); 45513e519524SHoward Hinnant ++__first2; 45523e519524SHoward Hinnant } 45533e519524SHoward Hinnant else 45543e519524SHoward Hinnant { 4555ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45563e519524SHoward Hinnant __d.__incr((value_type*)0); 45573e519524SHoward Hinnant ++__first1; 45583e519524SHoward Hinnant } 45593e519524SHoward Hinnant } 45603e519524SHoward Hinnant} 45613e519524SHoward Hinnant 45623e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45633e519524SHoward Hinnantvoid 45643e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45663e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45673e519524SHoward Hinnant{ 45683e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45693e519524SHoward Hinnant { 45703e519524SHoward Hinnant if (__first2 == __last2) 45713e519524SHoward Hinnant { 45723e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4573ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45743e519524SHoward Hinnant return; 45753e519524SHoward Hinnant } 45763e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45773e519524SHoward Hinnant { 4578ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45793e519524SHoward Hinnant ++__first2; 45803e519524SHoward Hinnant } 45813e519524SHoward Hinnant else 45823e519524SHoward Hinnant { 4583ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45843e519524SHoward Hinnant ++__first1; 45853e519524SHoward Hinnant } 45863e519524SHoward Hinnant } 45873e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4588ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45893e519524SHoward Hinnant} 45903e519524SHoward Hinnant 45913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45923e519524SHoward Hinnantvoid 45933e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45943e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45953e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45963e519524SHoward Hinnant 45973e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45983e519524SHoward Hinnantvoid 45993e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46003e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46013e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46023e519524SHoward Hinnant{ 46033e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46043e519524SHoward Hinnant switch (__len) 46053e519524SHoward Hinnant { 46063e519524SHoward Hinnant case 0: 46073e519524SHoward Hinnant return; 46083e519524SHoward Hinnant case 1: 4609ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46103e519524SHoward Hinnant return; 46113e519524SHoward Hinnant case 2: 46123e519524SHoward Hinnant __destruct_n __d(0); 46133e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46143e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46153e519524SHoward Hinnant { 4616ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46173e519524SHoward Hinnant __d.__incr((value_type*)0); 46183e519524SHoward Hinnant ++__first2; 4619ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46203e519524SHoward Hinnant } 46213e519524SHoward Hinnant else 46223e519524SHoward Hinnant { 4623ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46243e519524SHoward Hinnant __d.__incr((value_type*)0); 46253e519524SHoward Hinnant ++__first2; 4626ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46273e519524SHoward Hinnant } 46283e519524SHoward Hinnant __h2.release(); 46293e519524SHoward Hinnant return; 46303e519524SHoward Hinnant } 46313e519524SHoward Hinnant if (__len <= 8) 46323e519524SHoward Hinnant { 46333e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46343e519524SHoward Hinnant return; 46353e519524SHoward Hinnant } 46363e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46373e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46383e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46393e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46403e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46413e519524SHoward Hinnant} 46423e519524SHoward Hinnant 46433e519524SHoward Hinnanttemplate <class _Tp> 46443e519524SHoward Hinnantstruct __stable_sort_switch 46453e519524SHoward Hinnant{ 4646ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46473e519524SHoward Hinnant}; 46483e519524SHoward Hinnant 46493e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46503e519524SHoward Hinnantvoid 46513e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46523e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46533e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46543e519524SHoward Hinnant{ 46553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46563e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46573e519524SHoward Hinnant switch (__len) 46583e519524SHoward Hinnant { 46593e519524SHoward Hinnant case 0: 46603e519524SHoward Hinnant case 1: 46613e519524SHoward Hinnant return; 46623e519524SHoward Hinnant case 2: 46633e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46643e519524SHoward Hinnant swap(*__first, *__last); 46653e519524SHoward Hinnant return; 46663e519524SHoward Hinnant } 46673e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46683e519524SHoward Hinnant { 46693e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46703e519524SHoward Hinnant return; 46713e519524SHoward Hinnant } 46723e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46733e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46743e519524SHoward Hinnant if (__len <= __buff_size) 46753e519524SHoward Hinnant { 46763e519524SHoward Hinnant __destruct_n __d(0); 46773e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46783e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46793e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46803e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46813e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46823e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46833e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46843e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46853e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46863e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46873e519524SHoward Hinnant// __first, __comp); 46883e519524SHoward Hinnant return; 46893e519524SHoward Hinnant } 46903e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46913e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46923e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46933e519524SHoward Hinnant} 46943e519524SHoward Hinnant 46953e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46973e519524SHoward Hinnantvoid 46983e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46993e519524SHoward Hinnant{ 47003e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47013e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47023e519524SHoward Hinnant difference_type __len = __last - __first; 47033e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47043e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47053e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47063e519524SHoward Hinnant { 4707ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47083e519524SHoward Hinnant __h.reset(__buf.first); 47093e519524SHoward Hinnant } 4710145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47113e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47123e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47133e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4714145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47163e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4717145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47183e519524SHoward Hinnant} 47193e519524SHoward Hinnant 47203e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47223e519524SHoward Hinnantvoid 47233e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47243e519524SHoward Hinnant{ 4725ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47263e519524SHoward Hinnant} 47273e519524SHoward Hinnant 47283e519524SHoward Hinnant// is_heap_until 47293e519524SHoward Hinnant 47303e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47313e519524SHoward Hinnant_RandomAccessIterator 47323e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47333e519524SHoward Hinnant{ 4734ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47353e519524SHoward Hinnant difference_type __len = __last - __first; 47363e519524SHoward Hinnant difference_type __p = 0; 47373e519524SHoward Hinnant difference_type __c = 1; 47383e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47393e519524SHoward Hinnant while (__c < __len) 47403e519524SHoward Hinnant { 47413e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47423e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47433e519524SHoward Hinnant return __cp; 47443e519524SHoward Hinnant ++__c; 47453e519524SHoward Hinnant ++__cp; 47463e519524SHoward Hinnant if (__c == __len) 47473e519524SHoward Hinnant return __last; 47483e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47493e519524SHoward Hinnant return __cp; 47503e519524SHoward Hinnant ++__p; 47513e519524SHoward Hinnant ++__pp; 47523e519524SHoward Hinnant __c = 2 * __p + 1; 47533e519524SHoward Hinnant } 47543e519524SHoward Hinnant return __last; 47553e519524SHoward Hinnant} 47563e519524SHoward Hinnant 47573e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47593e519524SHoward Hinnant_RandomAccessIterator 47603e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47613e519524SHoward Hinnant{ 4762ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47633e519524SHoward Hinnant} 47643e519524SHoward Hinnant 47653e519524SHoward Hinnant// is_heap 47663e519524SHoward Hinnant 47673e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47693e519524SHoward Hinnantbool 47703e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47713e519524SHoward Hinnant{ 4772ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47733e519524SHoward Hinnant} 47743e519524SHoward Hinnant 47753e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47773e519524SHoward Hinnantbool 47783e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47793e519524SHoward Hinnant{ 4780ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47813e519524SHoward Hinnant} 47823e519524SHoward Hinnant 47833e519524SHoward Hinnant// push_heap 47843e519524SHoward Hinnant 47853e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47863e519524SHoward Hinnantvoid 47873e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 47883e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47893e519524SHoward Hinnant{ 47903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47923e519524SHoward Hinnant if (__len > 1) 47933e519524SHoward Hinnant { 47943e519524SHoward Hinnant difference_type __p = 0; 47953e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47963e519524SHoward Hinnant difference_type __c = 2; 47973e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47983e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47993e519524SHoward Hinnant { 48003e519524SHoward Hinnant --__c; 48013e519524SHoward Hinnant --__cp; 48023e519524SHoward Hinnant } 48033e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48043e519524SHoward Hinnant { 4805ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__pp)); 48063e519524SHoward Hinnant do 48073e519524SHoward Hinnant { 4808ce48a113SHoward Hinnant *__pp = _VSTD::move(*__cp); 48093e519524SHoward Hinnant __pp = __cp; 48103e519524SHoward Hinnant __p = __c; 48113e519524SHoward Hinnant __c = (__p + 1) * 2; 48123e519524SHoward Hinnant if (__c > __len) 48133e519524SHoward Hinnant break; 48143e519524SHoward Hinnant __cp = __first + __c; 48153e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 48163e519524SHoward Hinnant { 48173e519524SHoward Hinnant --__c; 48183e519524SHoward Hinnant --__cp; 48193e519524SHoward Hinnant } 48203e519524SHoward Hinnant } while (__comp(__t, *__cp)); 4821ce48a113SHoward Hinnant *__pp = _VSTD::move(__t); 48223e519524SHoward Hinnant } 48233e519524SHoward Hinnant } 48243e519524SHoward Hinnant} 48253e519524SHoward Hinnant 48263e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48273e519524SHoward Hinnantvoid 48283e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48293e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48303e519524SHoward Hinnant{ 48313e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48323e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48333e519524SHoward Hinnant if (__len > 1) 48343e519524SHoward Hinnant { 48353e519524SHoward Hinnant __len = (__len - 2) / 2; 48363e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48373e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48383e519524SHoward Hinnant { 4839ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48403e519524SHoward Hinnant do 48413e519524SHoward Hinnant { 4842ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48433e519524SHoward Hinnant __last = __ptr; 48443e519524SHoward Hinnant if (__len == 0) 48453e519524SHoward Hinnant break; 48463e519524SHoward Hinnant __len = (__len - 1) / 2; 48473e519524SHoward Hinnant __ptr = __first + __len; 48483e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4849ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48503e519524SHoward Hinnant } 48513e519524SHoward Hinnant } 48523e519524SHoward Hinnant} 48533e519524SHoward Hinnant 48543e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48563e519524SHoward Hinnantvoid 48573e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48583e519524SHoward Hinnant{ 4859145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48603e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48613e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48623e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4863145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48653e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4866145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48673e519524SHoward Hinnant} 48683e519524SHoward Hinnant 48693e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48713e519524SHoward Hinnantvoid 48723e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48733e519524SHoward Hinnant{ 4874ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48753e519524SHoward Hinnant} 48763e519524SHoward Hinnant 48773e519524SHoward Hinnant// pop_heap 48783e519524SHoward Hinnant 48793e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48813e519524SHoward Hinnantvoid 48823e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48833e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48843e519524SHoward Hinnant{ 48853e519524SHoward Hinnant if (__len > 1) 48863e519524SHoward Hinnant { 48873e519524SHoward Hinnant swap(*__first, *--__last); 48883e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 48893e519524SHoward Hinnant } 48903e519524SHoward Hinnant} 48913e519524SHoward Hinnant 48923e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48943e519524SHoward Hinnantvoid 48953e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48963e519524SHoward Hinnant{ 4897145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48983e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48993e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49003e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4901145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49023e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49033e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4904145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49053e519524SHoward Hinnant} 49063e519524SHoward Hinnant 49073e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49093e519524SHoward Hinnantvoid 49103e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49113e519524SHoward Hinnant{ 4912ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49133e519524SHoward Hinnant} 49143e519524SHoward Hinnant 49153e519524SHoward Hinnant// make_heap 49163e519524SHoward Hinnant 49173e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49183e519524SHoward Hinnantvoid 49193e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49203e519524SHoward Hinnant{ 49213e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49223e519524SHoward Hinnant difference_type __n = __last - __first; 49233e519524SHoward Hinnant if (__n > 1) 49243e519524SHoward Hinnant { 49253e519524SHoward Hinnant __last = __first; 49263e519524SHoward Hinnant ++__last; 49273e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 49283e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 49293e519524SHoward Hinnant } 49303e519524SHoward Hinnant} 49313e519524SHoward Hinnant 49323e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49343e519524SHoward Hinnantvoid 49353e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49363e519524SHoward Hinnant{ 4937145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49403e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4941145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49433e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4944145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49453e519524SHoward Hinnant} 49463e519524SHoward Hinnant 49473e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49493e519524SHoward Hinnantvoid 49503e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49513e519524SHoward Hinnant{ 4952ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49533e519524SHoward Hinnant} 49543e519524SHoward Hinnant 49553e519524SHoward Hinnant// sort_heap 49563e519524SHoward Hinnant 49573e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49583e519524SHoward Hinnantvoid 49593e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49603e519524SHoward Hinnant{ 49613e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49623e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49633e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49643e519524SHoward Hinnant} 49653e519524SHoward Hinnant 49663e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49683e519524SHoward Hinnantvoid 49693e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49703e519524SHoward Hinnant{ 4971145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49723e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49733e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49743e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4975145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49763e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49773e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4978145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49793e519524SHoward Hinnant} 49803e519524SHoward Hinnant 49813e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49833e519524SHoward Hinnantvoid 49843e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49853e519524SHoward Hinnant{ 4986ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49873e519524SHoward Hinnant} 49883e519524SHoward Hinnant 49893e519524SHoward Hinnant// partial_sort 49903e519524SHoward Hinnant 49913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49923e519524SHoward Hinnantvoid 49933e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49943e519524SHoward Hinnant _Compare __comp) 49953e519524SHoward Hinnant{ 49963e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49973e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49983e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49993e519524SHoward Hinnant { 50003e519524SHoward Hinnant if (__comp(*__i, *__first)) 50013e519524SHoward Hinnant { 50023e519524SHoward Hinnant swap(*__i, *__first); 50033e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 50043e519524SHoward Hinnant } 50053e519524SHoward Hinnant } 50063e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50073e519524SHoward Hinnant} 50083e519524SHoward Hinnant 50093e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50113e519524SHoward Hinnantvoid 50123e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50133e519524SHoward Hinnant _Compare __comp) 50143e519524SHoward Hinnant{ 5015145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50163e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50173e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50183e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5019145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50203e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50213e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5022145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50233e519524SHoward Hinnant} 50243e519524SHoward Hinnant 50253e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50273e519524SHoward Hinnantvoid 50283e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50293e519524SHoward Hinnant{ 5030ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50313e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50323e519524SHoward Hinnant} 50333e519524SHoward Hinnant 50343e519524SHoward Hinnant// partial_sort_copy 50353e519524SHoward Hinnant 50363e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50373e519524SHoward Hinnant_RandomAccessIterator 50383e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50393e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50403e519524SHoward Hinnant{ 50413e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50423e519524SHoward Hinnant if (__r != __result_last) 50433e519524SHoward Hinnant { 50443e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 50453e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 50463e519524SHoward Hinnant *__r = *__first; 50473e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50483e519524SHoward Hinnant for (; __first != __last; ++__first) 50493e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50503e519524SHoward Hinnant { 50513e519524SHoward Hinnant *__result_first = *__first; 50523e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 50533e519524SHoward Hinnant } 50543e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50553e519524SHoward Hinnant } 50563e519524SHoward Hinnant return __r; 50573e519524SHoward Hinnant} 50583e519524SHoward Hinnant 50593e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50613e519524SHoward Hinnant_RandomAccessIterator 50623e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50633e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50643e519524SHoward Hinnant{ 5065145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50683e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5069145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50713e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5072145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50733e519524SHoward Hinnant} 50743e519524SHoward Hinnant 50753e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50773e519524SHoward Hinnant_RandomAccessIterator 50783e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50793e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50803e519524SHoward Hinnant{ 5081ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50823e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50833e519524SHoward Hinnant} 50843e519524SHoward Hinnant 50853e519524SHoward Hinnant// nth_element 50863e519524SHoward Hinnant 50873e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50883e519524SHoward Hinnantvoid 50893e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50903e519524SHoward Hinnant{ 50913e519524SHoward Hinnant // _Compare is known to be a reference type 50923e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50933e519524SHoward Hinnant const difference_type __limit = 7; 50943e519524SHoward Hinnant while (true) 50953e519524SHoward Hinnant { 50963e519524SHoward Hinnant __restart: 5097b34b4819SHoward Hinnant if (__nth == __last) 5098b34b4819SHoward Hinnant return; 50993e519524SHoward Hinnant difference_type __len = __last - __first; 51003e519524SHoward Hinnant switch (__len) 51013e519524SHoward Hinnant { 51023e519524SHoward Hinnant case 0: 51033e519524SHoward Hinnant case 1: 51043e519524SHoward Hinnant return; 51053e519524SHoward Hinnant case 2: 51063e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51073e519524SHoward Hinnant swap(*__first, *__last); 51083e519524SHoward Hinnant return; 51093e519524SHoward Hinnant case 3: 51103e519524SHoward Hinnant { 51113e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5112ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51133e519524SHoward Hinnant return; 51143e519524SHoward Hinnant } 51153e519524SHoward Hinnant } 51163e519524SHoward Hinnant if (__len <= __limit) 51173e519524SHoward Hinnant { 51183e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51193e519524SHoward Hinnant return; 51203e519524SHoward Hinnant } 51213e519524SHoward Hinnant // __len > __limit >= 3 51223e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51233e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5124ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51253e519524SHoward Hinnant // *__m is median 51263e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51273e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51283e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51293e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51303e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51313e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51323e519524SHoward Hinnant // Prime the downward search with a guard. 51333e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51343e519524SHoward Hinnant { 51353e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51363e519524SHoward Hinnant // manually guard downward moving __j against __i 51373e519524SHoward Hinnant while (true) 51383e519524SHoward Hinnant { 51393e519524SHoward Hinnant if (__i == --__j) 51403e519524SHoward Hinnant { 51413e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51423e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51433e519524SHoward Hinnant ++__i; // __first + 1 51443e519524SHoward Hinnant __j = __last; 51453e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51463e519524SHoward Hinnant { 51473e519524SHoward Hinnant while (true) 51483e519524SHoward Hinnant { 51493e519524SHoward Hinnant if (__i == __j) 51503e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51513e519524SHoward Hinnant if (__comp(*__first, *__i)) 51523e519524SHoward Hinnant { 51533e519524SHoward Hinnant swap(*__i, *__j); 51543e519524SHoward Hinnant ++__n_swaps; 51553e519524SHoward Hinnant ++__i; 51563e519524SHoward Hinnant break; 51573e519524SHoward Hinnant } 51583e519524SHoward Hinnant ++__i; 51593e519524SHoward Hinnant } 51603e519524SHoward Hinnant } 51613e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51623e519524SHoward Hinnant if (__i == __j) 51633e519524SHoward Hinnant return; 51643e519524SHoward Hinnant while (true) 51653e519524SHoward Hinnant { 51663e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51673e519524SHoward Hinnant ++__i; 51683e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51693e519524SHoward Hinnant ; 51703e519524SHoward Hinnant if (__i >= __j) 51713e519524SHoward Hinnant break; 51723e519524SHoward Hinnant swap(*__i, *__j); 51733e519524SHoward Hinnant ++__n_swaps; 51743e519524SHoward Hinnant ++__i; 51753e519524SHoward Hinnant } 51763e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51773e519524SHoward Hinnant // The first part is sorted, 51783e519524SHoward Hinnant if (__nth < __i) 51793e519524SHoward Hinnant return; 51803e519524SHoward Hinnant // __nth_element the secod part 51813e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51823e519524SHoward Hinnant __first = __i; 51833e519524SHoward Hinnant goto __restart; 51843e519524SHoward Hinnant } 51853e519524SHoward Hinnant if (__comp(*__j, *__m)) 51863e519524SHoward Hinnant { 51873e519524SHoward Hinnant swap(*__i, *__j); 51883e519524SHoward Hinnant ++__n_swaps; 51893e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51903e519524SHoward Hinnant } 51913e519524SHoward Hinnant } 51923e519524SHoward Hinnant } 51933e519524SHoward Hinnant ++__i; 51943e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51953e519524SHoward Hinnant // if not yet partitioned... 51963e519524SHoward Hinnant if (__i < __j) 51973e519524SHoward Hinnant { 51983e519524SHoward Hinnant // known that *(__i - 1) < *__m 51993e519524SHoward Hinnant while (true) 52003e519524SHoward Hinnant { 52013e519524SHoward Hinnant // __m still guards upward moving __i 52023e519524SHoward Hinnant while (__comp(*__i, *__m)) 52033e519524SHoward Hinnant ++__i; 52043e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52053e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52063e519524SHoward Hinnant ; 52073e519524SHoward Hinnant if (__i >= __j) 52083e519524SHoward Hinnant break; 52093e519524SHoward Hinnant swap(*__i, *__j); 52103e519524SHoward Hinnant ++__n_swaps; 52113e519524SHoward Hinnant // It is known that __m != __j 52123e519524SHoward Hinnant // If __m just moved, follow it 52133e519524SHoward Hinnant if (__m == __i) 52143e519524SHoward Hinnant __m = __j; 52153e519524SHoward Hinnant ++__i; 52163e519524SHoward Hinnant } 52173e519524SHoward Hinnant } 52183e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52193e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52203e519524SHoward Hinnant { 52213e519524SHoward Hinnant swap(*__i, *__m); 52223e519524SHoward Hinnant ++__n_swaps; 52233e519524SHoward Hinnant } 52243e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52253e519524SHoward Hinnant if (__nth == __i) 52263e519524SHoward Hinnant return; 52273e519524SHoward Hinnant if (__n_swaps == 0) 52283e519524SHoward Hinnant { 52293e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52303e519524SHoward Hinnant if (__nth < __i) 52313e519524SHoward Hinnant { 52323e519524SHoward Hinnant // Check for [__first, __i) already sorted 52333e519524SHoward Hinnant __j = __m = __first; 52343e519524SHoward Hinnant while (++__j != __i) 52353e519524SHoward Hinnant { 52363e519524SHoward Hinnant if (__comp(*__j, *__m)) 52373e519524SHoward Hinnant // not yet sorted, so sort 52383e519524SHoward Hinnant goto not_sorted; 52393e519524SHoward Hinnant __m = __j; 52403e519524SHoward Hinnant } 52413e519524SHoward Hinnant // [__first, __i) sorted 52423e519524SHoward Hinnant return; 52433e519524SHoward Hinnant } 52443e519524SHoward Hinnant else 52453e519524SHoward Hinnant { 52463e519524SHoward Hinnant // Check for [__i, __last) already sorted 52473e519524SHoward Hinnant __j = __m = __i; 52483e519524SHoward Hinnant while (++__j != __last) 52493e519524SHoward Hinnant { 52503e519524SHoward Hinnant if (__comp(*__j, *__m)) 52513e519524SHoward Hinnant // not yet sorted, so sort 52523e519524SHoward Hinnant goto not_sorted; 52533e519524SHoward Hinnant __m = __j; 52543e519524SHoward Hinnant } 52553e519524SHoward Hinnant // [__i, __last) sorted 52563e519524SHoward Hinnant return; 52573e519524SHoward Hinnant } 52583e519524SHoward Hinnant } 52593e519524SHoward Hinnantnot_sorted: 52603e519524SHoward Hinnant // __nth_element on range containing __nth 52613e519524SHoward Hinnant if (__nth < __i) 52623e519524SHoward Hinnant { 52633e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52643e519524SHoward Hinnant __last = __i; 52653e519524SHoward Hinnant } 52663e519524SHoward Hinnant else 52673e519524SHoward Hinnant { 52683e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52693e519524SHoward Hinnant __first = ++__i; 52703e519524SHoward Hinnant } 52713e519524SHoward Hinnant } 52723e519524SHoward Hinnant} 52733e519524SHoward Hinnant 52743e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52763e519524SHoward Hinnantvoid 52773e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52783e519524SHoward Hinnant{ 5279145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52803e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52813e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52823e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5283145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52843e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52853e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5286145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52873e519524SHoward Hinnant} 52883e519524SHoward Hinnant 52893e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52913e519524SHoward Hinnantvoid 52923e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52933e519524SHoward Hinnant{ 5294ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52953e519524SHoward Hinnant} 52963e519524SHoward Hinnant 52973e519524SHoward Hinnant// includes 52983e519524SHoward Hinnant 52993e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53003e519524SHoward Hinnantbool 53013e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53023e519524SHoward Hinnant _Compare __comp) 53033e519524SHoward Hinnant{ 53043e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53053e519524SHoward Hinnant { 53063e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53073e519524SHoward Hinnant return false; 53083e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53093e519524SHoward Hinnant ++__first2; 53103e519524SHoward Hinnant } 53113e519524SHoward Hinnant return true; 53123e519524SHoward Hinnant} 53133e519524SHoward Hinnant 53143e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53163e519524SHoward Hinnantbool 53173e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53183e519524SHoward Hinnant _Compare __comp) 53193e519524SHoward Hinnant{ 5320145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53213e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53223e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53233e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5324145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53253e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53263e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5327145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53283e519524SHoward Hinnant} 53293e519524SHoward Hinnant 53303e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53323e519524SHoward Hinnantbool 53333e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53343e519524SHoward Hinnant{ 5335ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53363e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53373e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53383e519524SHoward Hinnant} 53393e519524SHoward Hinnant 53403e519524SHoward Hinnant// set_union 53413e519524SHoward Hinnant 53423e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53433e519524SHoward Hinnant_OutputIterator 53443e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53453e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53463e519524SHoward Hinnant{ 53473e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53483e519524SHoward Hinnant { 53493e519524SHoward Hinnant if (__first2 == __last2) 5350ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53513e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53523e519524SHoward Hinnant { 53533e519524SHoward Hinnant *__result = *__first2; 53543e519524SHoward Hinnant ++__first2; 53553e519524SHoward Hinnant } 53563e519524SHoward Hinnant else 53573e519524SHoward Hinnant { 53583e519524SHoward Hinnant *__result = *__first1; 53593e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53603e519524SHoward Hinnant ++__first2; 53613e519524SHoward Hinnant ++__first1; 53623e519524SHoward Hinnant } 53633e519524SHoward Hinnant } 5364ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53653e519524SHoward Hinnant} 53663e519524SHoward Hinnant 53673e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53693e519524SHoward Hinnant_OutputIterator 53703e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53723e519524SHoward Hinnant{ 5373145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53743e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53753e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53763e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5377145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53783e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53793e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5380145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53813e519524SHoward Hinnant} 53823e519524SHoward Hinnant 53833e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53853e519524SHoward Hinnant_OutputIterator 53863e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53873e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53883e519524SHoward Hinnant{ 5389ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53903e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53913e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53923e519524SHoward Hinnant} 53933e519524SHoward Hinnant 53943e519524SHoward Hinnant// set_intersection 53953e519524SHoward Hinnant 53963e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53973e519524SHoward Hinnant_OutputIterator 53983e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53993e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54003e519524SHoward Hinnant{ 54013e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54023e519524SHoward Hinnant { 54033e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54043e519524SHoward Hinnant ++__first1; 54053e519524SHoward Hinnant else 54063e519524SHoward Hinnant { 54073e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54083e519524SHoward Hinnant { 54093e519524SHoward Hinnant *__result = *__first1; 54103e519524SHoward Hinnant ++__result; 54113e519524SHoward Hinnant ++__first1; 54123e519524SHoward Hinnant } 54133e519524SHoward Hinnant ++__first2; 54143e519524SHoward Hinnant } 54153e519524SHoward Hinnant } 54163e519524SHoward Hinnant return __result; 54173e519524SHoward Hinnant} 54183e519524SHoward Hinnant 54193e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54213e519524SHoward Hinnant_OutputIterator 54223e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54233e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54243e519524SHoward Hinnant{ 5425145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54263e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54273e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54283e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5429145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54303e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54313e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5432145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54333e519524SHoward Hinnant} 54343e519524SHoward Hinnant 54353e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54373e519524SHoward Hinnant_OutputIterator 54383e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54403e519524SHoward Hinnant{ 5441ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54423e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54433e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54443e519524SHoward Hinnant} 54453e519524SHoward Hinnant 54463e519524SHoward Hinnant// set_difference 54473e519524SHoward Hinnant 54483e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54493e519524SHoward Hinnant_OutputIterator 54503e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54513e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54523e519524SHoward Hinnant{ 54533e519524SHoward Hinnant while (__first1 != __last1) 54543e519524SHoward Hinnant { 54553e519524SHoward Hinnant if (__first2 == __last2) 5456ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54573e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54583e519524SHoward Hinnant { 54593e519524SHoward Hinnant *__result = *__first1; 54603e519524SHoward Hinnant ++__result; 54613e519524SHoward Hinnant ++__first1; 54623e519524SHoward Hinnant } 54633e519524SHoward Hinnant else 54643e519524SHoward Hinnant { 54653e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54663e519524SHoward Hinnant ++__first1; 54673e519524SHoward Hinnant ++__first2; 54683e519524SHoward Hinnant } 54693e519524SHoward Hinnant } 54703e519524SHoward Hinnant return __result; 54713e519524SHoward Hinnant} 54723e519524SHoward Hinnant 54733e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54753e519524SHoward Hinnant_OutputIterator 54763e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54773e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54783e519524SHoward Hinnant{ 5479145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54803e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54813e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54823e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5483145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54843e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54853e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5486145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54873e519524SHoward Hinnant} 54883e519524SHoward Hinnant 54893e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54913e519524SHoward Hinnant_OutputIterator 54923e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54933e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54943e519524SHoward Hinnant{ 5495ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54963e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54973e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54983e519524SHoward Hinnant} 54993e519524SHoward Hinnant 55003e519524SHoward Hinnant// set_symmetric_difference 55013e519524SHoward Hinnant 55023e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55033e519524SHoward Hinnant_OutputIterator 55043e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55053e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55063e519524SHoward Hinnant{ 55073e519524SHoward Hinnant while (__first1 != __last1) 55083e519524SHoward Hinnant { 55093e519524SHoward Hinnant if (__first2 == __last2) 5510ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55113e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55123e519524SHoward Hinnant { 55133e519524SHoward Hinnant *__result = *__first1; 55143e519524SHoward Hinnant ++__result; 55153e519524SHoward Hinnant ++__first1; 55163e519524SHoward Hinnant } 55173e519524SHoward Hinnant else 55183e519524SHoward Hinnant { 55193e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55203e519524SHoward Hinnant { 55213e519524SHoward Hinnant *__result = *__first2; 55223e519524SHoward Hinnant ++__result; 55233e519524SHoward Hinnant } 55243e519524SHoward Hinnant else 55253e519524SHoward Hinnant ++__first1; 55263e519524SHoward Hinnant ++__first2; 55273e519524SHoward Hinnant } 55283e519524SHoward Hinnant } 5529ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55303e519524SHoward Hinnant} 55313e519524SHoward Hinnant 55323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55343e519524SHoward Hinnant_OutputIterator 55353e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55373e519524SHoward Hinnant{ 5538145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55393e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55403e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55413e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5542145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55433e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55443e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5545145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55463e519524SHoward Hinnant} 55473e519524SHoward Hinnant 55483e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55503e519524SHoward Hinnant_OutputIterator 55513e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55523e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55533e519524SHoward Hinnant{ 5554ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55553e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55563e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55573e519524SHoward Hinnant} 55583e519524SHoward Hinnant 55593e519524SHoward Hinnant// lexicographical_compare 55603e519524SHoward Hinnant 55613e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55623e519524SHoward Hinnantbool 55633e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55643e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55653e519524SHoward Hinnant{ 55663e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 55673e519524SHoward Hinnant { 55683e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55693e519524SHoward Hinnant return true; 55703e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55713e519524SHoward Hinnant return false; 55723e519524SHoward Hinnant } 55733e519524SHoward Hinnant return false; 55743e519524SHoward Hinnant} 55753e519524SHoward Hinnant 55763e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55783e519524SHoward Hinnantbool 55793e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55803e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55813e519524SHoward Hinnant{ 5582145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55853e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5586145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55883e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5589145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55903e519524SHoward Hinnant} 55913e519524SHoward Hinnant 55923e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55943e519524SHoward Hinnantbool 55953e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55963e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55973e519524SHoward Hinnant{ 5598ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55993e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56003e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56013e519524SHoward Hinnant} 56023e519524SHoward Hinnant 56033e519524SHoward Hinnant// next_permutation 56043e519524SHoward Hinnant 56053e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56063e519524SHoward Hinnantbool 56073e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56083e519524SHoward Hinnant{ 56093e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56103e519524SHoward Hinnant if (__first == __last || __first == --__i) 56113e519524SHoward Hinnant return false; 56123e519524SHoward Hinnant while (true) 56133e519524SHoward Hinnant { 56143e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56153e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56163e519524SHoward Hinnant { 56173e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56183e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56193e519524SHoward Hinnant ; 56203e519524SHoward Hinnant swap(*__i, *__j); 5621ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56223e519524SHoward Hinnant return true; 56233e519524SHoward Hinnant } 56243e519524SHoward Hinnant if (__i == __first) 56253e519524SHoward Hinnant { 5626ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56273e519524SHoward Hinnant return false; 56283e519524SHoward Hinnant } 56293e519524SHoward Hinnant } 56303e519524SHoward Hinnant} 56313e519524SHoward Hinnant 56323e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56343e519524SHoward Hinnantbool 56353e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56363e519524SHoward Hinnant{ 5637145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56403e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5641145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56433e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5644145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56453e519524SHoward Hinnant} 56463e519524SHoward Hinnant 56473e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56493e519524SHoward Hinnantbool 56503e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56513e519524SHoward Hinnant{ 5652ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56533e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56543e519524SHoward Hinnant} 56553e519524SHoward Hinnant 56563e519524SHoward Hinnant// prev_permutation 56573e519524SHoward Hinnant 56583e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56593e519524SHoward Hinnantbool 56603e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56613e519524SHoward Hinnant{ 56623e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56633e519524SHoward Hinnant if (__first == __last || __first == --__i) 56643e519524SHoward Hinnant return false; 56653e519524SHoward Hinnant while (true) 56663e519524SHoward Hinnant { 56673e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56683e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56693e519524SHoward Hinnant { 56703e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56713e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56723e519524SHoward Hinnant ; 56733e519524SHoward Hinnant swap(*__i, *__j); 5674ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56753e519524SHoward Hinnant return true; 56763e519524SHoward Hinnant } 56773e519524SHoward Hinnant if (__i == __first) 56783e519524SHoward Hinnant { 5679ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56803e519524SHoward Hinnant return false; 56813e519524SHoward Hinnant } 56823e519524SHoward Hinnant } 56833e519524SHoward Hinnant} 56843e519524SHoward Hinnant 56853e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56873e519524SHoward Hinnantbool 56883e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56893e519524SHoward Hinnant{ 5690145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56933e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5694145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56963e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5697145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56983e519524SHoward Hinnant} 56993e519524SHoward Hinnant 57003e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57023e519524SHoward Hinnantbool 57033e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57043e519524SHoward Hinnant{ 5705ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57063e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57073e519524SHoward Hinnant} 57083e519524SHoward Hinnant 57093e519524SHoward Hinnanttemplate <class _Tp> 57103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57113e519524SHoward Hinnanttypename enable_if 57123e519524SHoward Hinnant< 57133e519524SHoward Hinnant is_integral<_Tp>::value, 57143e519524SHoward Hinnant _Tp 57153e519524SHoward Hinnant>::type 57163e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 57173e519524SHoward Hinnant{ 57183e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57193e519524SHoward Hinnant __n &= __bits; 57203e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 57213e519524SHoward Hinnant} 57223e519524SHoward Hinnant 57233e519524SHoward Hinnanttemplate <class _Tp> 57243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57253e519524SHoward Hinnanttypename enable_if 57263e519524SHoward Hinnant< 57273e519524SHoward Hinnant is_integral<_Tp>::value, 57283e519524SHoward Hinnant _Tp 57293e519524SHoward Hinnant>::type 57303e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 57313e519524SHoward Hinnant{ 57323e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57333e519524SHoward Hinnant __n &= __bits; 57343e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 57353e519524SHoward Hinnant} 57363e519524SHoward Hinnant 57373e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57383e519524SHoward Hinnant 57393e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5740