13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 45b08a8a4SHoward Hinnant// The LLVM Compiler Infrastructure 53e519524SHoward Hinnant// 6412dbebeSHoward Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 7412dbebeSHoward Hinnant// Source Licenses. See LICENSE.TXT for details. 83e519524SHoward Hinnant// 93e519524SHoward Hinnant//===----------------------------------------------------------------------===// 103e519524SHoward Hinnant 113e519524SHoward Hinnant#ifndef _LIBCPP_ALGORITHM 123e519524SHoward Hinnant#define _LIBCPP_ALGORITHM 133e519524SHoward Hinnant 143e519524SHoward Hinnant/* 153e519524SHoward Hinnant algorithm synopsis 163e519524SHoward Hinnant 173e519524SHoward Hinnant#include <initializer_list> 183e519524SHoward Hinnant 193e519524SHoward Hinnantnamespace std 203e519524SHoward Hinnant{ 213e519524SHoward Hinnant 223e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 233e519524SHoward Hinnant bool 243e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 253e519524SHoward Hinnant 263e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 273e519524SHoward Hinnant bool 283e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 293e519524SHoward Hinnant 303e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 313e519524SHoward Hinnant bool 323e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 333e519524SHoward Hinnant 343e519524SHoward Hinnanttemplate <class InputIterator, class Function> 353e519524SHoward Hinnant Function 363e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 373e519524SHoward Hinnant 383e519524SHoward Hinnanttemplate <class InputIterator, class T> 393e519524SHoward Hinnant InputIterator 403e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 413e519524SHoward Hinnant 423e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 433e519524SHoward Hinnant InputIterator 443e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 453e519524SHoward Hinnant 463e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 473e519524SHoward Hinnant InputIterator 483e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 493e519524SHoward Hinnant 503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 513e519524SHoward Hinnant ForwardIterator1 523e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 543e519524SHoward Hinnant 553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 563e519524SHoward Hinnant ForwardIterator1 573e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 593e519524SHoward Hinnant 603e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 613e519524SHoward Hinnant ForwardIterator1 623e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 633e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 643e519524SHoward Hinnant 653e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 663e519524SHoward Hinnant ForwardIterator1 673e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 683e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 693e519524SHoward Hinnant 703e519524SHoward Hinnanttemplate <class ForwardIterator> 713e519524SHoward Hinnant ForwardIterator 723e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 733e519524SHoward Hinnant 743e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 753e519524SHoward Hinnant ForwardIterator 763e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 773e519524SHoward Hinnant 783e519524SHoward Hinnanttemplate <class InputIterator, class T> 793e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 803e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 813e519524SHoward Hinnant 823e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 833e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 843e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 853e519524SHoward Hinnant 863e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 873e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 883e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 893e519524SHoward Hinnant 900b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 910b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 920b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 930b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 940b0bbd2fSMarshall Clow 953e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 963e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 973e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 983e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 993e519524SHoward Hinnant 1000b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1010b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 1020b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1030b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1040b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1050b0bbd2fSMarshall Clow 1063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1073e519524SHoward Hinnant bool 1083e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1093e519524SHoward Hinnant 1100b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1110b0bbd2fSMarshall Clow bool 1120b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1130b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1140b0bbd2fSMarshall Clow 1153e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1163e519524SHoward Hinnant bool 1173e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1183e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1193e519524SHoward Hinnant 1200b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1210b0bbd2fSMarshall Clow bool 1220b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1230b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1240b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1250b0bbd2fSMarshall Clow 1263e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 1273e519524SHoward Hinnant bool 1283e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1293e519524SHoward Hinnant ForwardIterator2 first2); 1303e519524SHoward Hinnant 1310b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 1320b0bbd2fSMarshall Clow bool 1330b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1340b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1350b0bbd2fSMarshall Clow 1363e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1373e519524SHoward Hinnant bool 1383e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1393e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1403e519524SHoward Hinnant 1410b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1420b0bbd2fSMarshall Clow bool 1430b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1440b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1450b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1460b0bbd2fSMarshall Clow 1473e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1483e519524SHoward Hinnant ForwardIterator1 1493e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1503e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1513e519524SHoward Hinnant 1523e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1533e519524SHoward Hinnant ForwardIterator1 1543e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1553e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1563e519524SHoward Hinnant 1573e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 1583e519524SHoward Hinnant ForwardIterator 1593e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1603e519524SHoward Hinnant 1613e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 1623e519524SHoward Hinnant ForwardIterator 1633e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1643e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1653e519524SHoward Hinnant 1663e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1673e519524SHoward Hinnant OutputIterator 1683e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1693e519524SHoward Hinnant 1703e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1713e519524SHoward Hinnant OutputIterator 1723e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1733e519524SHoward Hinnant OutputIterator result, Predicate pred); 1743e519524SHoward Hinnant 1753e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1763e519524SHoward Hinnant OutputIterator 1773e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1783e519524SHoward Hinnant 1793e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1803e519524SHoward Hinnant BidirectionalIterator2 1813e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1823e519524SHoward Hinnant BidirectionalIterator2 result); 1833e519524SHoward Hinnant 1843e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1853e519524SHoward Hinnant ForwardIterator2 1863e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1873e519524SHoward Hinnant 1883e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1893e519524SHoward Hinnant void 1903e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1913e519524SHoward Hinnant 1923e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 1933e519524SHoward Hinnant OutputIterator 1943e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1953e519524SHoward Hinnant 1963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 1973e519524SHoward Hinnant OutputIterator 1983e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 1993e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2023e519524SHoward Hinnant void 2033e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 2063e519524SHoward Hinnant void 2073e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2103e519524SHoward Hinnant OutputIterator 2113e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2123e519524SHoward Hinnant const T& old_value, const T& new_value); 2133e519524SHoward Hinnant 2143e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 2153e519524SHoward Hinnant OutputIterator 2163e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2173e519524SHoward Hinnant 2183e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2193e519524SHoward Hinnant void 2203e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2213e519524SHoward Hinnant 2223e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2233e519524SHoward Hinnant OutputIterator 2243e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2253e519524SHoward Hinnant 2263e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2273e519524SHoward Hinnant void 2283e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2293e519524SHoward Hinnant 2303e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2313e519524SHoward Hinnant OutputIterator 2323e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2333e519524SHoward Hinnant 2343e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2353e519524SHoward Hinnant ForwardIterator 2363e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2373e519524SHoward Hinnant 2383e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2393e519524SHoward Hinnant ForwardIterator 2403e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2413e519524SHoward Hinnant 2423e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2433e519524SHoward Hinnant OutputIterator 2443e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2453e519524SHoward Hinnant 2463e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 2473e519524SHoward Hinnant OutputIterator 2483e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2493e519524SHoward Hinnant 2503e519524SHoward Hinnanttemplate <class ForwardIterator> 2513e519524SHoward Hinnant ForwardIterator 2523e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2533e519524SHoward Hinnant 2543e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2553e519524SHoward Hinnant ForwardIterator 2563e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2573e519524SHoward Hinnant 2583e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2593e519524SHoward Hinnant OutputIterator 2603e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2613e519524SHoward Hinnant 2623e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2633e519524SHoward Hinnant OutputIterator 2643e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2653e519524SHoward Hinnant 2663e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2673e519524SHoward Hinnant void 2683e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2693e519524SHoward Hinnant 2703e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 2713e519524SHoward Hinnant OutputIterator 2723e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2733e519524SHoward Hinnant 2743e519524SHoward Hinnanttemplate <class ForwardIterator> 2753e519524SHoward Hinnant ForwardIterator 2763e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2773e519524SHoward Hinnant 2783e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2793e519524SHoward Hinnant OutputIterator 2803e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2813e519524SHoward Hinnant 2823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2833e519524SHoward Hinnant void 2843e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last); 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 2883e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator& rand); 2893e519524SHoward Hinnant 290f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 291f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 292fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 293f9d540b0SHoward Hinnant 2943e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2953e519524SHoward Hinnant bool 2963e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2973e519524SHoward Hinnant 2983e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2993e519524SHoward Hinnant ForwardIterator 3003e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3013e519524SHoward Hinnant 3023e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3033e519524SHoward Hinnant class OutputIterator2, class Predicate> 3043e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3053e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3063e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3073e519524SHoward Hinnant Predicate pred); 3083e519524SHoward Hinnant 3093e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3103e519524SHoward Hinnant ForwardIterator 3113e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3123e519524SHoward Hinnant 3133e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3143e519524SHoward Hinnant ForwardIterator 3153e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3163e519524SHoward Hinnant 3173e519524SHoward Hinnanttemplate <class ForwardIterator> 3183e519524SHoward Hinnant bool 3193e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3203e519524SHoward Hinnant 3213e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3223e519524SHoward Hinnant bool 3233e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3243e519524SHoward Hinnant 3253e519524SHoward Hinnanttemplate<class ForwardIterator> 3263e519524SHoward Hinnant ForwardIterator 3273e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3283e519524SHoward Hinnant 3293e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3303e519524SHoward Hinnant ForwardIterator 3313e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3323e519524SHoward Hinnant 3333e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3343e519524SHoward Hinnant void 3353e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3363e519524SHoward Hinnant 3373e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3383e519524SHoward Hinnant void 3393e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3403e519524SHoward Hinnant 3413e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3423e519524SHoward Hinnant void 3433e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3443e519524SHoward Hinnant 3453e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3463e519524SHoward Hinnant void 3473e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3483e519524SHoward Hinnant 3493e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3503e519524SHoward Hinnant void 3513e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3523e519524SHoward Hinnant 3533e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3543e519524SHoward Hinnant void 3553e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3563e519524SHoward Hinnant 3573e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3583e519524SHoward Hinnant RandomAccessIterator 3593e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3603e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3633e519524SHoward Hinnant RandomAccessIterator 3643e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3653e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3663e519524SHoward Hinnant 3673e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3683e519524SHoward Hinnant void 3693e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3703e519524SHoward Hinnant 3713e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3723e519524SHoward Hinnant void 3733e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3743e519524SHoward Hinnant 3753e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3763e519524SHoward Hinnant ForwardIterator 3773e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3803e519524SHoward Hinnant ForwardIterator 3813e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3823e519524SHoward Hinnant 3833e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3843e519524SHoward Hinnant ForwardIterator 3853e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3863e519524SHoward Hinnant 3873e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3883e519524SHoward Hinnant ForwardIterator 3893e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3903e519524SHoward Hinnant 3913e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3923e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3933e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3943e519524SHoward Hinnant 3953e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3963e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3973e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3983e519524SHoward Hinnant 3993e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4003e519524SHoward Hinnant bool 4013e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4023e519524SHoward Hinnant 4033e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4043e519524SHoward Hinnant bool 4053e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4063e519524SHoward Hinnant 4073e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4083e519524SHoward Hinnant OutputIterator 4093e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4103e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4113e519524SHoward Hinnant 4123e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4133e519524SHoward Hinnant OutputIterator 4143e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4153e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4163e519524SHoward Hinnant 4173e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4183e519524SHoward Hinnant void 4193e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4203e519524SHoward Hinnant 4213e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4223e519524SHoward Hinnant void 4233e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4243e519524SHoward Hinnant 4253e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4263e519524SHoward Hinnant bool 4273e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4283e519524SHoward Hinnant 4293e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4303e519524SHoward Hinnant bool 4313e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4323e519524SHoward Hinnant 4333e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4343e519524SHoward Hinnant OutputIterator 4353e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4363e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4373e519524SHoward Hinnant 4383e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4393e519524SHoward Hinnant OutputIterator 4403e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4413e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4423e519524SHoward Hinnant 4433e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4443e519524SHoward Hinnant OutputIterator 4453e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4463e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4493e519524SHoward Hinnant OutputIterator 4503e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4513e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4543e519524SHoward Hinnant OutputIterator 4553e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4563e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4593e519524SHoward Hinnant OutputIterator 4603e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4613e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4623e519524SHoward Hinnant 4633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4643e519524SHoward Hinnant OutputIterator 4653e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4663e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4693e519524SHoward Hinnant OutputIterator 4703e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4713e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4743e519524SHoward Hinnant void 4753e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4763e519524SHoward Hinnant 4773e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4783e519524SHoward Hinnant void 4793e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4803e519524SHoward Hinnant 4813e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4823e519524SHoward Hinnant void 4833e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4843e519524SHoward Hinnant 4853e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4863e519524SHoward Hinnant void 4873e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4883e519524SHoward Hinnant 4893e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4903e519524SHoward Hinnant void 4913e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4923e519524SHoward Hinnant 4933e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4943e519524SHoward Hinnant void 4953e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4963e519524SHoward Hinnant 4973e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4983e519524SHoward Hinnant void 4993e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5003e519524SHoward Hinnant 5013e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5023e519524SHoward Hinnant void 5033e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5043e519524SHoward Hinnant 5053e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5063e519524SHoward Hinnant bool 5073e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5083e519524SHoward Hinnant 5093e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5103e519524SHoward Hinnant bool 5113e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5123e519524SHoward Hinnant 5133e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5143e519524SHoward Hinnant RandomAccessIterator 5153e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5163e519524SHoward Hinnant 5173e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5183e519524SHoward Hinnant RandomAccessIterator 5193e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5203e519524SHoward Hinnant 5214eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5224eb27b79SHoward Hinnant ForwardIterator 5234eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 5244eb27b79SHoward Hinnant 5254eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5264eb27b79SHoward Hinnant ForwardIterator 5274eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 5284eb27b79SHoward Hinnant 5293e519524SHoward Hinnanttemplate <class T> 5303e519524SHoward Hinnant const T& 5313e519524SHoward Hinnant min(const T& a, const T& b); 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class T, class Compare> 5343e519524SHoward Hinnant const T& 5353e519524SHoward Hinnant min(const T& a, const T& b, Compare comp); 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate<class T> 5384eb27b79SHoward Hinnant T 5394eb27b79SHoward Hinnant min(initializer_list<T> t); 5403e519524SHoward Hinnant 5413e519524SHoward Hinnanttemplate<class T, class Compare> 5424eb27b79SHoward Hinnant T 5434eb27b79SHoward Hinnant min(initializer_list<T> t, Compare comp); 5443e519524SHoward Hinnant 5453e519524SHoward Hinnanttemplate <class ForwardIterator> 5463e519524SHoward Hinnant ForwardIterator 5473e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5483e519524SHoward Hinnant 5493e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5503e519524SHoward Hinnant ForwardIterator 5513e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5523e519524SHoward Hinnant 5534eb27b79SHoward Hinnanttemplate <class T> 5544eb27b79SHoward Hinnant const T& 5554eb27b79SHoward Hinnant max(const T& a, const T& b); 5564eb27b79SHoward Hinnant 5574eb27b79SHoward Hinnanttemplate <class T, class Compare> 5584eb27b79SHoward Hinnant const T& 5594eb27b79SHoward Hinnant max(const T& a, const T& b, Compare comp); 5604eb27b79SHoward Hinnant 5614eb27b79SHoward Hinnanttemplate<class T> 5624eb27b79SHoward Hinnant T 5634eb27b79SHoward Hinnant max(initializer_list<T> t); 5644eb27b79SHoward Hinnant 5654eb27b79SHoward Hinnanttemplate<class T, class Compare> 5664eb27b79SHoward Hinnant T 5674eb27b79SHoward Hinnant max(initializer_list<T> t, Compare comp); 5684eb27b79SHoward Hinnant 5694eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5704eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5714eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last); 5724eb27b79SHoward Hinnant 5734eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5744eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5754eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 5764eb27b79SHoward Hinnant 5774eb27b79SHoward Hinnanttemplate<class T> 5784eb27b79SHoward Hinnant pair<const T&, const T&> 5794eb27b79SHoward Hinnant minmax(const T& a, const T& b); 5804eb27b79SHoward Hinnant 5814eb27b79SHoward Hinnanttemplate<class T, class Compare> 5824eb27b79SHoward Hinnant pair<const T&, const T&> 5834eb27b79SHoward Hinnant minmax(const T& a, const T& b, Compare comp); 5844eb27b79SHoward Hinnant 5854eb27b79SHoward Hinnanttemplate<class T> 5864eb27b79SHoward Hinnant pair<T, T> 5874eb27b79SHoward Hinnant minmax(initializer_list<T> t); 5884eb27b79SHoward Hinnant 5894eb27b79SHoward Hinnanttemplate<class T, class Compare> 5904eb27b79SHoward Hinnant pair<T, T> 5914eb27b79SHoward Hinnant minmax(initializer_list<T> t, Compare comp); 5924eb27b79SHoward Hinnant 5933e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5943e519524SHoward Hinnant bool 5953e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5963e519524SHoward Hinnant 5973e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5983e519524SHoward Hinnant bool 5993e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6003e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6013e519524SHoward Hinnant 6023e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6033e519524SHoward Hinnant bool 6043e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6053e519524SHoward Hinnant 6063e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6073e519524SHoward Hinnant bool 6083e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6093e519524SHoward Hinnant 6103e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6113e519524SHoward Hinnant bool 6123e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6133e519524SHoward Hinnant 6143e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6153e519524SHoward Hinnant bool 6163e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6173e519524SHoward Hinnant 6183e519524SHoward Hinnant} // std 6193e519524SHoward Hinnant 6203e519524SHoward Hinnant*/ 6213e519524SHoward Hinnant 6223e519524SHoward Hinnant#include <__config> 6233e519524SHoward Hinnant#include <initializer_list> 6243e519524SHoward Hinnant#include <type_traits> 6253e519524SHoward Hinnant#include <cstring> 6263e519524SHoward Hinnant#include <utility> 6273e519524SHoward Hinnant#include <memory> 6283e519524SHoward Hinnant#include <iterator> 629a1d07d57SHoward Hinnant#include <cstddef> 6303e519524SHoward Hinnant 631ab4f4382SHoward Hinnant#include <__undef_min_max> 632ab4f4382SHoward Hinnant 633073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6343e519524SHoward Hinnant#pragma GCC system_header 635073458b1SHoward Hinnant#endif 6363e519524SHoward Hinnant 6373e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6383e519524SHoward Hinnant 6393e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6403e519524SHoward Hinnantstruct __equal_to 6413e519524SHoward Hinnant{ 6423e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6433e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6443e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6453e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6463e519524SHoward Hinnant}; 6473e519524SHoward Hinnant 6483e519524SHoward Hinnanttemplate <class _T1> 6493e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6503e519524SHoward Hinnant{ 6513e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6523e519524SHoward Hinnant}; 6533e519524SHoward Hinnant 6543e519524SHoward Hinnanttemplate <class _T1> 6553e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6563e519524SHoward Hinnant{ 6573e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6583e519524SHoward Hinnant}; 6593e519524SHoward Hinnant 6603e519524SHoward Hinnanttemplate <class _T1> 6613e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6623e519524SHoward Hinnant{ 6633e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6643e519524SHoward Hinnant}; 6653e519524SHoward Hinnant 6663e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6673e519524SHoward Hinnantstruct __less 6683e519524SHoward Hinnant{ 6693e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6703e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6713e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6723e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6733e519524SHoward Hinnant}; 6743e519524SHoward Hinnant 6753e519524SHoward Hinnanttemplate <class _T1> 6763e519524SHoward Hinnantstruct __less<_T1, _T1> 6773e519524SHoward Hinnant{ 6783e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6793e519524SHoward Hinnant}; 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class _T1> 6823e519524SHoward Hinnantstruct __less<const _T1, _T1> 6833e519524SHoward Hinnant{ 6843e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6853e519524SHoward Hinnant}; 6863e519524SHoward Hinnant 6873e519524SHoward Hinnanttemplate <class _T1> 6883e519524SHoward Hinnantstruct __less<_T1, const _T1> 6893e519524SHoward Hinnant{ 6903e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6913e519524SHoward Hinnant}; 6923e519524SHoward Hinnant 6933e519524SHoward Hinnanttemplate <class _Predicate> 6943e519524SHoward Hinnantclass __negate 6953e519524SHoward Hinnant{ 6963e519524SHoward Hinnantprivate: 6973e519524SHoward Hinnant _Predicate __p_; 6983e519524SHoward Hinnantpublic: 6993e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7003e519524SHoward Hinnant 7013e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7023e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7033e519524SHoward Hinnant 7043e519524SHoward Hinnant template <class _T1> 7053e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7063e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7073e519524SHoward Hinnant 7083e519524SHoward Hinnant template <class _T1, class _T2> 7093e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7103e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7113e519524SHoward Hinnant}; 7123e519524SHoward Hinnant 713f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 7143e519524SHoward Hinnant 7153e519524SHoward Hinnanttemplate <class _Compare> 7163e519524SHoward Hinnantstruct __debug_less 7173e519524SHoward Hinnant{ 7183e519524SHoward Hinnant _Compare __comp_; 7193e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 7203e519524SHoward Hinnant template <class _Tp, class _Up> 7213e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7223e519524SHoward Hinnant { 7233e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7243e519524SHoward Hinnant if (__r) 725f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 7263e519524SHoward Hinnant return __r; 7273e519524SHoward Hinnant } 7283e519524SHoward Hinnant}; 7293e519524SHoward Hinnant 730f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 7313e519524SHoward Hinnant 732c8edcb36SHoward Hinnant// Precondition: __x != 0 733c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 734c206366fSHoward Hinnantunsigned 735c206366fSHoward Hinnant__ctz(unsigned __x) 736c206366fSHoward Hinnant{ 737c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 738c206366fSHoward Hinnant} 739c206366fSHoward Hinnant 740c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 741c206366fSHoward Hinnantunsigned long 742c206366fSHoward Hinnant__ctz(unsigned long __x) 743c206366fSHoward Hinnant{ 744c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 745c206366fSHoward Hinnant} 746c206366fSHoward Hinnant 747c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 748c206366fSHoward Hinnantunsigned long long 749c206366fSHoward Hinnant__ctz(unsigned long long __x) 750c206366fSHoward Hinnant{ 751c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 752c206366fSHoward Hinnant} 753c8edcb36SHoward Hinnant 754c8edcb36SHoward Hinnant// Precondition: __x != 0 755c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 756c206366fSHoward Hinnantunsigned 757c206366fSHoward Hinnant__clz(unsigned __x) 758c206366fSHoward Hinnant{ 759c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 760c206366fSHoward Hinnant} 761c206366fSHoward Hinnant 762c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 763c206366fSHoward Hinnantunsigned long 764c206366fSHoward Hinnant__clz(unsigned long __x) 765c206366fSHoward Hinnant{ 766c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 767c206366fSHoward Hinnant} 768c206366fSHoward Hinnant 769c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 770c206366fSHoward Hinnantunsigned long long 771c206366fSHoward Hinnant__clz(unsigned long long __x) 772c206366fSHoward Hinnant{ 773c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 774c206366fSHoward Hinnant} 775c8edcb36SHoward Hinnant 776c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 777c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 778c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 779c8edcb36SHoward Hinnant 7803e519524SHoward Hinnant// all_of 7813e519524SHoward Hinnant 7823e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7843e519524SHoward Hinnantbool 7853e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7863e519524SHoward Hinnant{ 7873e519524SHoward Hinnant for (; __first != __last; ++__first) 7883e519524SHoward Hinnant if (!__pred(*__first)) 7893e519524SHoward Hinnant return false; 7903e519524SHoward Hinnant return true; 7913e519524SHoward Hinnant} 7923e519524SHoward Hinnant 7933e519524SHoward Hinnant// any_of 7943e519524SHoward Hinnant 7953e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7973e519524SHoward Hinnantbool 7983e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7993e519524SHoward Hinnant{ 8003e519524SHoward Hinnant for (; __first != __last; ++__first) 8013e519524SHoward Hinnant if (__pred(*__first)) 8023e519524SHoward Hinnant return true; 8033e519524SHoward Hinnant return false; 8043e519524SHoward Hinnant} 8053e519524SHoward Hinnant 8063e519524SHoward Hinnant// none_of 8073e519524SHoward Hinnant 8083e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8103e519524SHoward Hinnantbool 8113e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8123e519524SHoward Hinnant{ 8133e519524SHoward Hinnant for (; __first != __last; ++__first) 8143e519524SHoward Hinnant if (__pred(*__first)) 8153e519524SHoward Hinnant return false; 8163e519524SHoward Hinnant return true; 8173e519524SHoward Hinnant} 8183e519524SHoward Hinnant 8193e519524SHoward Hinnant// for_each 8203e519524SHoward Hinnant 8213e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8233e519524SHoward Hinnant_Function 8243e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8253e519524SHoward Hinnant{ 8263e519524SHoward Hinnant for (; __first != __last; ++__first) 8273e519524SHoward Hinnant __f(*__first); 828ce48a113SHoward Hinnant return _VSTD::move(__f); 8293e519524SHoward Hinnant} 8303e519524SHoward Hinnant 8313e519524SHoward Hinnant// find 8323e519524SHoward Hinnant 8333e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8353e519524SHoward Hinnant_InputIterator 836e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8373e519524SHoward Hinnant{ 8383e519524SHoward Hinnant for (; __first != __last; ++__first) 839e4383379SHoward Hinnant if (*__first == __value_) 8403e519524SHoward Hinnant break; 8413e519524SHoward Hinnant return __first; 8423e519524SHoward Hinnant} 8433e519524SHoward Hinnant 8443e519524SHoward Hinnant// find_if 8453e519524SHoward Hinnant 8463e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8483e519524SHoward Hinnant_InputIterator 8493e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8503e519524SHoward Hinnant{ 8513e519524SHoward Hinnant for (; __first != __last; ++__first) 8523e519524SHoward Hinnant if (__pred(*__first)) 8533e519524SHoward Hinnant break; 8543e519524SHoward Hinnant return __first; 8553e519524SHoward Hinnant} 8563e519524SHoward Hinnant 8573e519524SHoward Hinnant// find_if_not 8583e519524SHoward Hinnant 8593e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8613e519524SHoward Hinnant_InputIterator 8623e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8633e519524SHoward Hinnant{ 8643e519524SHoward Hinnant for (; __first != __last; ++__first) 8653e519524SHoward Hinnant if (!__pred(*__first)) 8663e519524SHoward Hinnant break; 8673e519524SHoward Hinnant return __first; 8683e519524SHoward Hinnant} 8693e519524SHoward Hinnant 8703e519524SHoward Hinnant// find_end 8713e519524SHoward Hinnant 8723e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8733e519524SHoward Hinnant_ForwardIterator1 8743e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8753e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 8763e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 8773e519524SHoward Hinnant{ 8783e519524SHoward Hinnant // modeled after search algorithm 8793e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 8803e519524SHoward Hinnant if (__first2 == __last2) 8813e519524SHoward Hinnant return __r; 8823e519524SHoward Hinnant while (true) 8833e519524SHoward Hinnant { 8843e519524SHoward Hinnant while (true) 8853e519524SHoward Hinnant { 8863e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 8873e519524SHoward Hinnant return __r; // (or __last1 if never found) 8883e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 8893e519524SHoward Hinnant break; 8903e519524SHoward Hinnant ++__first1; 8913e519524SHoward Hinnant } 8923e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 8933e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 8943e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 8953e519524SHoward Hinnant while (true) 8963e519524SHoward Hinnant { 8973e519524SHoward Hinnant if (++__m2 == __last2) 8983e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 8993e519524SHoward Hinnant __r = __first1; 9003e519524SHoward Hinnant ++__first1; 9013e519524SHoward Hinnant break; 9023e519524SHoward Hinnant } 9033e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9043e519524SHoward Hinnant return __r; 9053e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9063e519524SHoward Hinnant { 9073e519524SHoward Hinnant ++__first1; 9083e519524SHoward Hinnant break; 9093e519524SHoward Hinnant } // else there is a match, check next elements 9103e519524SHoward Hinnant } 9113e519524SHoward Hinnant } 9123e519524SHoward Hinnant} 9133e519524SHoward Hinnant 9143e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9153e519524SHoward Hinnant_BidirectionalIterator1 9163e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9173e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9183e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9193e519524SHoward Hinnant{ 9203e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9213e519524SHoward Hinnant if (__first2 == __last2) 9223e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9233e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9243e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9253e519524SHoward Hinnant --__l2; 9263e519524SHoward Hinnant while (true) 9273e519524SHoward Hinnant { 9283e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9293e519524SHoward Hinnant while (true) 9303e519524SHoward Hinnant { 9313e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9323e519524SHoward Hinnant return __last1; 9333e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9343e519524SHoward Hinnant break; 9353e519524SHoward Hinnant } 9363e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9373e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9383e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9393e519524SHoward Hinnant while (true) 9403e519524SHoward Hinnant { 9413e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9423e519524SHoward Hinnant return __m1; 9433e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9443e519524SHoward Hinnant return __last1; 9453e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9463e519524SHoward Hinnant { 9473e519524SHoward Hinnant break; 9483e519524SHoward Hinnant } // else there is a match, check next elements 9493e519524SHoward Hinnant } 9503e519524SHoward Hinnant } 9513e519524SHoward Hinnant} 9523e519524SHoward Hinnant 9533e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9543e519524SHoward Hinnant_RandomAccessIterator1 9553e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9563e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9573e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9583e519524SHoward Hinnant{ 9593e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9603e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9613e519524SHoward Hinnant if (__len2 == 0) 9623e519524SHoward Hinnant return __last1; 9633e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9643e519524SHoward Hinnant if (__len1 < __len2) 9653e519524SHoward Hinnant return __last1; 9663e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9673e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9683e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9693e519524SHoward Hinnant --__l2; 9703e519524SHoward Hinnant while (true) 9713e519524SHoward Hinnant { 9723e519524SHoward Hinnant while (true) 9733e519524SHoward Hinnant { 9743e519524SHoward Hinnant if (__s == __l1) 9753e519524SHoward Hinnant return __last1; 9763e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9773e519524SHoward Hinnant break; 9783e519524SHoward Hinnant } 9793e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 9803e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 9813e519524SHoward Hinnant while (true) 9823e519524SHoward Hinnant { 9833e519524SHoward Hinnant if (__m2 == __first2) 9843e519524SHoward Hinnant return __m1; 9853e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 9863e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 9873e519524SHoward Hinnant { 9883e519524SHoward Hinnant break; 9893e519524SHoward Hinnant } 9903e519524SHoward Hinnant } 9913e519524SHoward Hinnant } 9923e519524SHoward Hinnant} 9933e519524SHoward Hinnant 9943e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9963e519524SHoward Hinnant_ForwardIterator1 9973e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9983e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9993e519524SHoward Hinnant{ 1000ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10013e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10023e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10033e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10043e519524SHoward Hinnant} 10053e519524SHoward Hinnant 10063e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10083e519524SHoward Hinnant_ForwardIterator1 10093e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10103e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10113e519524SHoward Hinnant{ 10123e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10133e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1014ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10153e519524SHoward Hinnant} 10163e519524SHoward Hinnant 10173e519524SHoward Hinnant// find_first_of 10183e519524SHoward Hinnant 10193e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10203e519524SHoward Hinnant_ForwardIterator1 10213e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10223e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10233e519524SHoward Hinnant{ 10243e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10253e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10263e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10273e519524SHoward Hinnant return __first1; 10283e519524SHoward Hinnant return __last1; 10293e519524SHoward Hinnant} 10303e519524SHoward Hinnant 10313e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10333e519524SHoward Hinnant_ForwardIterator1 10343e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10353e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10363e519524SHoward Hinnant{ 10373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1039ce48a113SHoward Hinnant return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10403e519524SHoward Hinnant} 10413e519524SHoward Hinnant 10423e519524SHoward Hinnant// adjacent_find 10433e519524SHoward Hinnant 10443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10463e519524SHoward Hinnant_ForwardIterator 10473e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10483e519524SHoward Hinnant{ 10493e519524SHoward Hinnant if (__first != __last) 10503e519524SHoward Hinnant { 10513e519524SHoward Hinnant _ForwardIterator __i = __first; 10523e519524SHoward Hinnant while (++__i != __last) 10533e519524SHoward Hinnant { 10543e519524SHoward Hinnant if (__pred(*__first, *__i)) 10553e519524SHoward Hinnant return __first; 10563e519524SHoward Hinnant __first = __i; 10573e519524SHoward Hinnant } 10583e519524SHoward Hinnant } 10593e519524SHoward Hinnant return __last; 10603e519524SHoward Hinnant} 10613e519524SHoward Hinnant 10623e519524SHoward Hinnanttemplate <class _ForwardIterator> 10633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10643e519524SHoward Hinnant_ForwardIterator 10653e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 10663e519524SHoward Hinnant{ 10673e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1068ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 10693e519524SHoward Hinnant} 10703e519524SHoward Hinnant 10713e519524SHoward Hinnant// count 10723e519524SHoward Hinnant 10733e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10753e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1076e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 10773e519524SHoward Hinnant{ 10783e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10793e519524SHoward Hinnant for (; __first != __last; ++__first) 1080e4383379SHoward Hinnant if (*__first == __value_) 10813e519524SHoward Hinnant ++__r; 10823e519524SHoward Hinnant return __r; 10833e519524SHoward Hinnant} 10843e519524SHoward Hinnant 10853e519524SHoward Hinnant// count_if 10863e519524SHoward Hinnant 10873e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10893e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 10903e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10913e519524SHoward Hinnant{ 10923e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10933e519524SHoward Hinnant for (; __first != __last; ++__first) 10943e519524SHoward Hinnant if (__pred(*__first)) 10953e519524SHoward Hinnant ++__r; 10963e519524SHoward Hinnant return __r; 10973e519524SHoward Hinnant} 10983e519524SHoward Hinnant 10993e519524SHoward Hinnant// mismatch 11003e519524SHoward Hinnant 11013e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11033e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11043e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11053e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11063e519524SHoward Hinnant{ 11073e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11083e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11093e519524SHoward Hinnant break; 11103e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11113e519524SHoward Hinnant} 11123e519524SHoward Hinnant 11133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11153e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11163e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11173e519524SHoward Hinnant{ 11183e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11193e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1120ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11213e519524SHoward Hinnant} 11223e519524SHoward Hinnant 11230b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11240b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11250b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11260b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11270b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11280b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11290b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11300b0bbd2fSMarshall Clow{ 11310b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 11320b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11330b0bbd2fSMarshall Clow break; 11340b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11350b0bbd2fSMarshall Clow} 11360b0bbd2fSMarshall Clow 11370b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11380b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11390b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11400b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11410b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11420b0bbd2fSMarshall Clow{ 11430b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11440b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 11450b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11460b0bbd2fSMarshall Clow} 11470b0bbd2fSMarshall Clow#endif 11480b0bbd2fSMarshall Clow 11493e519524SHoward Hinnant// equal 11503e519524SHoward Hinnant 11513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11533e519524SHoward Hinnantbool 11543e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11553e519524SHoward Hinnant{ 11563e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11573e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11583e519524SHoward Hinnant return false; 11593e519524SHoward Hinnant return true; 11603e519524SHoward Hinnant} 11613e519524SHoward Hinnant 11623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11643e519524SHoward Hinnantbool 11653e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11663e519524SHoward Hinnant{ 11673e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11683e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1169ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11703e519524SHoward Hinnant} 11713e519524SHoward Hinnant 11720b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11730b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 11740b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11750b0bbd2fSMarshall Clowbool 11760b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 11770b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 11780b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 11790b0bbd2fSMarshall Clow{ 11800b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 11810b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11820b0bbd2fSMarshall Clow return false; 11830b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 11840b0bbd2fSMarshall Clow} 11850b0bbd2fSMarshall Clow 11860b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11870b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11880b0bbd2fSMarshall Clowbool 11890b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11900b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11910b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 11920b0bbd2fSMarshall Clow{ 11930b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 11940b0bbd2fSMarshall Clow return false; 11950b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 11960b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 11970b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 11980b0bbd2fSMarshall Clow} 11990b0bbd2fSMarshall Clow 12000b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12010b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12020b0bbd2fSMarshall Clowbool 12030b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12040b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12050b0bbd2fSMarshall Clow{ 12060b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12070b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12080b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12090b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12100b0bbd2fSMarshall Clow} 12110b0bbd2fSMarshall Clow 12120b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12130b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12140b0bbd2fSMarshall Clowbool 12150b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12160b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12170b0bbd2fSMarshall Clow{ 12180b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12190b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12200b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12210b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12220b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12230b0bbd2fSMarshall Clow} 12240b0bbd2fSMarshall Clow#endif 12250b0bbd2fSMarshall Clow 12263e519524SHoward Hinnant// is_permutation 12273e519524SHoward Hinnant 12283e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12293e519524SHoward Hinnantbool 12303e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12313e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12323e519524SHoward Hinnant{ 12333e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 12343e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 12353e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12363e519524SHoward Hinnant goto __not_done; 12373e519524SHoward Hinnant return true; 12383e519524SHoward Hinnant__not_done: 12393e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12403e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1241ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12423e519524SHoward Hinnant if (__l1 == _D1(1)) 12433e519524SHoward Hinnant return false; 1244ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12453e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12463e519524SHoward Hinnant // equal elements in [f2, l2) 12473e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12483e519524SHoward Hinnant { 12493e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 12503e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 12513e519524SHoward Hinnant if (__pred(*__j, *__i)) 12523e519524SHoward Hinnant goto __next_iter; 12533e519524SHoward Hinnant { 12543e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12553e519524SHoward Hinnant _D1 __c2 = 0; 12563e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12573e519524SHoward Hinnant if (__pred(*__i, *__j)) 12583e519524SHoward Hinnant ++__c2; 12593e519524SHoward Hinnant if (__c2 == 0) 12603e519524SHoward Hinnant return false; 12613e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 12623e519524SHoward Hinnant _D1 __c1 = 1; 1263ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 12643e519524SHoward Hinnant if (__pred(*__i, *__j)) 12653e519524SHoward Hinnant ++__c1; 12663e519524SHoward Hinnant if (__c1 != __c2) 12673e519524SHoward Hinnant return false; 12683e519524SHoward Hinnant } 12693e519524SHoward Hinnant__next_iter:; 12703e519524SHoward Hinnant } 12713e519524SHoward Hinnant return true; 12723e519524SHoward Hinnant} 12733e519524SHoward Hinnant 12743e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 12753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12763e519524SHoward Hinnantbool 12773e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12783e519524SHoward Hinnant _ForwardIterator2 __first2) 12793e519524SHoward Hinnant{ 12803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12813e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1282ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12833e519524SHoward Hinnant} 12843e519524SHoward Hinnant 12850b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12860b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 12870b0bbd2fSMarshall Clowbool 12880b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12890b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 12900b0bbd2fSMarshall Clow _BinaryPredicate __pred, 12910b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 12920b0bbd2fSMarshall Clow{ 12930b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 12940b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 12950b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12960b0bbd2fSMarshall Clow goto __not_done; 12970b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12980b0bbd2fSMarshall Clow__not_done: 12990b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13000b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13010b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13020b0bbd2fSMarshall Clow 13030b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1304fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13050b0bbd2fSMarshall Clow if (__l1 != __l2) 13060b0bbd2fSMarshall Clow return false; 13070b0bbd2fSMarshall Clow 13080b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13090b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13100b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13110b0bbd2fSMarshall Clow { 13120b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13130b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13140b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13150b0bbd2fSMarshall Clow goto __next_iter; 13160b0bbd2fSMarshall Clow { 13170b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13180b0bbd2fSMarshall Clow _D1 __c2 = 0; 13190b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13200b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13210b0bbd2fSMarshall Clow ++__c2; 13220b0bbd2fSMarshall Clow if (__c2 == 0) 13230b0bbd2fSMarshall Clow return false; 13240b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13250b0bbd2fSMarshall Clow _D1 __c1 = 1; 13260b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13270b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13280b0bbd2fSMarshall Clow ++__c1; 13290b0bbd2fSMarshall Clow if (__c1 != __c2) 13300b0bbd2fSMarshall Clow return false; 13310b0bbd2fSMarshall Clow } 13320b0bbd2fSMarshall Clow__next_iter:; 13330b0bbd2fSMarshall Clow } 13340b0bbd2fSMarshall Clow return true; 13350b0bbd2fSMarshall Clow} 13360b0bbd2fSMarshall Clow 13370b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13380b0bbd2fSMarshall Clowbool 13390b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13400b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13410b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13420b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13430b0bbd2fSMarshall Clow{ 13440b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13450b0bbd2fSMarshall Clow return false; 13460b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 13470b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13480b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13490b0bbd2fSMarshall Clow} 13500b0bbd2fSMarshall Clow 13510b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13520b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13530b0bbd2fSMarshall Clowbool 13540b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13550b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13560b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 13570b0bbd2fSMarshall Clow{ 13580b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 13590b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13600b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13610b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13620b0bbd2fSMarshall Clow} 13630b0bbd2fSMarshall Clow 13640b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 13650b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13660b0bbd2fSMarshall Clowbool 13670b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13680b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 13690b0bbd2fSMarshall Clow{ 13700b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13710b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 13720b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 13730b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 13740b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13750b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13760b0bbd2fSMarshall Clow} 13770b0bbd2fSMarshall Clow#endif 13780b0bbd2fSMarshall Clow 13793e519524SHoward Hinnant// search 13803e519524SHoward Hinnant 13813e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13823e519524SHoward Hinnant_ForwardIterator1 13833e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13843e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 13853e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 13863e519524SHoward Hinnant{ 13873e519524SHoward Hinnant if (__first2 == __last2) 13883e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 13893e519524SHoward Hinnant while (true) 13903e519524SHoward Hinnant { 13913e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 13923e519524SHoward Hinnant while (true) 13933e519524SHoward Hinnant { 13943e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 13953e519524SHoward Hinnant return __last1; 13963e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 13973e519524SHoward Hinnant break; 13983e519524SHoward Hinnant ++__first1; 13993e519524SHoward Hinnant } 14003e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14013e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14023e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14033e519524SHoward Hinnant while (true) 14043e519524SHoward Hinnant { 14053e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 14063e519524SHoward Hinnant return __first1; 14073e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 14083e519524SHoward Hinnant return __last1; 14093e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14103e519524SHoward Hinnant { 14113e519524SHoward Hinnant ++__first1; 14123e519524SHoward Hinnant break; 14133e519524SHoward Hinnant } // else there is a match, check next elements 14143e519524SHoward Hinnant } 14153e519524SHoward Hinnant } 14163e519524SHoward Hinnant} 14173e519524SHoward Hinnant 14183e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14193e519524SHoward Hinnant_RandomAccessIterator1 14203e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14213e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14223e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14233e519524SHoward Hinnant{ 14243e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 14253e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14263e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 14273e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 14283e519524SHoward Hinnant if (__len2 == 0) 14293e519524SHoward Hinnant return __first1; 14303e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 14313e519524SHoward Hinnant if (__len1 < __len2) 14323e519524SHoward Hinnant return __last1; 14333e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14343e519524SHoward Hinnant while (true) 14353e519524SHoward Hinnant { 14363e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14373e519524SHoward Hinnant while (true) 14383e519524SHoward Hinnant { 14393e519524SHoward Hinnant if (__first1 == __s) 14403e519524SHoward Hinnant return __last1; 14413e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14423e519524SHoward Hinnant break; 14433e519524SHoward Hinnant ++__first1; 14443e519524SHoward Hinnant } 1445b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14463e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 14473e519524SHoward Hinnant { 14483e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14493e519524SHoward Hinnant goto __phase2; 14503e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14513e519524SHoward Hinnant goto __phase2; 14523e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14533e519524SHoward Hinnant goto __phase2; 14543e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14553e519524SHoward Hinnant goto __phase2; 14563e519524SHoward Hinnant ++__first1; 14573e519524SHoward Hinnant } 14583e519524SHoward Hinnant switch (__s - __first1) 14593e519524SHoward Hinnant { 14603e519524SHoward Hinnant case 3: 14613e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14623e519524SHoward Hinnant break; 14633e519524SHoward Hinnant ++__first1; 14643e519524SHoward Hinnant case 2: 14653e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14663e519524SHoward Hinnant break; 14673e519524SHoward Hinnant ++__first1; 14683e519524SHoward Hinnant case 1: 14693e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14703e519524SHoward Hinnant break; 14713e519524SHoward Hinnant case 0: 14723e519524SHoward Hinnant return __last1; 14733e519524SHoward Hinnant } 14743e519524SHoward Hinnant __phase2: 1475b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 14763e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 14773e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 14783e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14793e519524SHoward Hinnant while (true) 14803e519524SHoward Hinnant { 14813e519524SHoward Hinnant if (++__m2 == __last2) 14823e519524SHoward Hinnant return __first1; 14833e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 14843e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 14853e519524SHoward Hinnant { 14863e519524SHoward Hinnant ++__first1; 14873e519524SHoward Hinnant break; 14883e519524SHoward Hinnant } 14893e519524SHoward Hinnant } 1490b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14913e519524SHoward Hinnant ++__m2; 14923e519524SHoward Hinnant ++__m1; 14933e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 14943e519524SHoward Hinnant { 14953e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 14963e519524SHoward Hinnant goto __continue; 14973e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 14983e519524SHoward Hinnant goto __continue; 14993e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15003e519524SHoward Hinnant goto __continue; 15013e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15023e519524SHoward Hinnant goto __continue; 15033e519524SHoward Hinnant ++__m1; 15043e519524SHoward Hinnant ++__m2; 15053e519524SHoward Hinnant } 15063e519524SHoward Hinnant switch (__last2 - __m2) 15073e519524SHoward Hinnant { 15083e519524SHoward Hinnant case 3: 15093e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15103e519524SHoward Hinnant break; 15113e519524SHoward Hinnant ++__m1; 15123e519524SHoward Hinnant ++__m2; 15133e519524SHoward Hinnant case 2: 15143e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15153e519524SHoward Hinnant break; 15163e519524SHoward Hinnant ++__m1; 15173e519524SHoward Hinnant ++__m2; 15183e519524SHoward Hinnant case 1: 15193e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15203e519524SHoward Hinnant break; 15213e519524SHoward Hinnant case 0: 15223e519524SHoward Hinnant return __first1; 15233e519524SHoward Hinnant } 15243e519524SHoward Hinnant __continue: 15253e519524SHoward Hinnant ++__first1; 1526b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15273e519524SHoward Hinnant } 15283e519524SHoward Hinnant} 15293e519524SHoward Hinnant 15303e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15323e519524SHoward Hinnant_ForwardIterator1 15333e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15343e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15353e519524SHoward Hinnant{ 1536ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15373e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 15383e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 15393e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 15403e519524SHoward Hinnant} 15413e519524SHoward Hinnant 15423e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15443e519524SHoward Hinnant_ForwardIterator1 15453e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15463e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15473e519524SHoward Hinnant{ 15483e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 15493e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1550ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15513e519524SHoward Hinnant} 15523e519524SHoward Hinnant 15533e519524SHoward Hinnant// search_n 15543e519524SHoward Hinnant 15553e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15563e519524SHoward Hinnant_ForwardIterator 15573e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1558e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15593e519524SHoward Hinnant{ 15603e519524SHoward Hinnant if (__count <= 0) 15613e519524SHoward Hinnant return __first; 15623e519524SHoward Hinnant while (true) 15633e519524SHoward Hinnant { 1564e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15653e519524SHoward Hinnant while (true) 15663e519524SHoward Hinnant { 1567e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15683e519524SHoward Hinnant return __last; 1569e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15703e519524SHoward Hinnant break; 15713e519524SHoward Hinnant ++__first; 15723e519524SHoward Hinnant } 1573e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15743e519524SHoward Hinnant _ForwardIterator __m = __first; 15753e519524SHoward Hinnant _Size __c(0); 15763e519524SHoward Hinnant while (true) 15773e519524SHoward Hinnant { 15783e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15793e519524SHoward Hinnant return __first; 15803e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15813e519524SHoward Hinnant return __last; 1582e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15833e519524SHoward Hinnant { 15843e519524SHoward Hinnant __first = __m; 15853e519524SHoward Hinnant ++__first; 15863e519524SHoward Hinnant break; 15873e519524SHoward Hinnant } // else there is a match, check next elements 15883e519524SHoward Hinnant } 15893e519524SHoward Hinnant } 15903e519524SHoward Hinnant} 15913e519524SHoward Hinnant 15923e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 15933e519524SHoward Hinnant_RandomAccessIterator 15943e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1595e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15963e519524SHoward Hinnant{ 15973e519524SHoward Hinnant if (__count <= 0) 15983e519524SHoward Hinnant return __first; 15993e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16003e519524SHoward Hinnant if (__len < __count) 16013e519524SHoward Hinnant return __last; 16023e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16033e519524SHoward Hinnant while (true) 16043e519524SHoward Hinnant { 1605e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16063e519524SHoward Hinnant while (true) 16073e519524SHoward Hinnant { 1608b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16093e519524SHoward Hinnant return __last; 1610e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16113e519524SHoward Hinnant break; 16123e519524SHoward Hinnant ++__first; 16133e519524SHoward Hinnant } 1614e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16153e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16163e519524SHoward Hinnant _Size __c(0); 16173e519524SHoward Hinnant while (true) 16183e519524SHoward Hinnant { 16193e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16203e519524SHoward Hinnant return __first; 16213e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1622e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16233e519524SHoward Hinnant { 16243e519524SHoward Hinnant __first = __m; 16253e519524SHoward Hinnant ++__first; 16263e519524SHoward Hinnant break; 16273e519524SHoward Hinnant } // else there is a match, check next elements 16283e519524SHoward Hinnant } 16293e519524SHoward Hinnant } 16303e519524SHoward Hinnant} 16313e519524SHoward Hinnant 16323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16343e519524SHoward Hinnant_ForwardIterator 16353e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1636e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16373e519524SHoward Hinnant{ 1638ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1639e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 16403e519524SHoward Hinnant} 16413e519524SHoward Hinnant 16423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16443e519524SHoward Hinnant_ForwardIterator 1645e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16463e519524SHoward Hinnant{ 16473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1648e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 16493e519524SHoward Hinnant} 16503e519524SHoward Hinnant 16513e519524SHoward Hinnant// copy 16523e519524SHoward Hinnant 16533e519524SHoward Hinnanttemplate <class _Iter> 16543e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 16553e519524SHoward Hinnant{ 16563e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16573e519524SHoward Hinnant}; 16583e519524SHoward Hinnant 16593e519524SHoward Hinnanttemplate <class _Iter> 16603e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 16613e519524SHoward Hinnant{ 16623e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16633e519524SHoward Hinnant}; 16643e519524SHoward Hinnant 16653e519524SHoward Hinnanttemplate <class _Iter> 16663e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 16673e519524SHoward Hinnant{ 16683e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16693e519524SHoward Hinnant}; 16703e519524SHoward Hinnant 16713e519524SHoward Hinnanttemplate <class _Iter> 16723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16733e519524SHoward Hinnant_Iter 16743e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16753e519524SHoward Hinnant{ 16763e519524SHoward Hinnant return __i; 16773e519524SHoward Hinnant} 16783e519524SHoward Hinnant 16793e519524SHoward Hinnanttemplate <class _Tp> 16803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16813e519524SHoward Hinnanttypename enable_if 16823e519524SHoward Hinnant< 1683ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16843e519524SHoward Hinnant _Tp* 16853e519524SHoward Hinnant>::type 16863e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16873e519524SHoward Hinnant{ 16883e519524SHoward Hinnant return __i.base(); 16893e519524SHoward Hinnant} 16903e519524SHoward Hinnant 16913e519524SHoward Hinnanttemplate <class _Tp> 16923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16933e519524SHoward Hinnanttypename enable_if 16943e519524SHoward Hinnant< 1695ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16963e519524SHoward Hinnant _Tp* 16973e519524SHoward Hinnant>::type 16983e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16993e519524SHoward Hinnant{ 17003e519524SHoward Hinnant return __i.base(); 17013e519524SHoward Hinnant} 17023e519524SHoward Hinnant 17033e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17053e519524SHoward Hinnant_OutputIterator 17063e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17073e519524SHoward Hinnant{ 17083e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17093e519524SHoward Hinnant *__result = *__first; 17103e519524SHoward Hinnant return __result; 17113e519524SHoward Hinnant} 17123e519524SHoward Hinnant 17133e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17153e519524SHoward Hinnanttypename enable_if 17163e519524SHoward Hinnant< 17173e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1718ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17193e519524SHoward Hinnant _Up* 17203e519524SHoward Hinnant>::type 17213e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17223e519524SHoward Hinnant{ 17233e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1724ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17253e519524SHoward Hinnant return __result + __n; 17263e519524SHoward Hinnant} 17273e519524SHoward Hinnant 17283e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17303e519524SHoward Hinnant_OutputIterator 17313e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17323e519524SHoward Hinnant{ 1733ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17343e519524SHoward Hinnant} 17353e519524SHoward Hinnant 17363e519524SHoward Hinnant// copy_backward 17373e519524SHoward Hinnant 1738d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17403e519524SHoward Hinnant_OutputIterator 1741d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17423e519524SHoward Hinnant{ 17433e519524SHoward Hinnant while (__first != __last) 17443e519524SHoward Hinnant *--__result = *--__last; 17453e519524SHoward Hinnant return __result; 17463e519524SHoward Hinnant} 17473e519524SHoward Hinnant 17483e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17503e519524SHoward Hinnanttypename enable_if 17513e519524SHoward Hinnant< 17523e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1753ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17543e519524SHoward Hinnant _Up* 17553e519524SHoward Hinnant>::type 17563e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17573e519524SHoward Hinnant{ 17583e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17593e519524SHoward Hinnant __result -= __n; 1760ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17613e519524SHoward Hinnant return __result; 17623e519524SHoward Hinnant} 17633e519524SHoward Hinnant 17643e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnant_BidirectionalIterator2 17673e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17683e519524SHoward Hinnant _BidirectionalIterator2 __result) 17693e519524SHoward Hinnant{ 1770ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17713e519524SHoward Hinnant} 17723e519524SHoward Hinnant 17733e519524SHoward Hinnant// copy_if 17743e519524SHoward Hinnant 17753e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17773e519524SHoward Hinnant_OutputIterator 17783e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17793e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17803e519524SHoward Hinnant{ 17813e519524SHoward Hinnant for (; __first != __last; ++__first) 17823e519524SHoward Hinnant { 17833e519524SHoward Hinnant if (__pred(*__first)) 17843e519524SHoward Hinnant { 17853e519524SHoward Hinnant *__result = *__first; 17863e519524SHoward Hinnant ++__result; 17873e519524SHoward Hinnant } 17883e519524SHoward Hinnant } 17893e519524SHoward Hinnant return __result; 17903e519524SHoward Hinnant} 17913e519524SHoward Hinnant 17923e519524SHoward Hinnant// copy_n 17933e519524SHoward Hinnant 17943e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17963e519524SHoward Hinnanttypename enable_if 17973e519524SHoward Hinnant< 17983e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 17993e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18003e519524SHoward Hinnant _OutputIterator 18013e519524SHoward Hinnant>::type 18023e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18033e519524SHoward Hinnant{ 180499847d2bSHoward Hinnant if (__n > 0) 180599847d2bSHoward Hinnant { 18063e519524SHoward Hinnant *__result = *__first; 180799847d2bSHoward Hinnant ++__result; 180899847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 180999847d2bSHoward Hinnant { 181099847d2bSHoward Hinnant ++__first; 181199847d2bSHoward Hinnant *__result = *__first; 181299847d2bSHoward Hinnant ++__result; 181399847d2bSHoward Hinnant } 181499847d2bSHoward Hinnant } 18153e519524SHoward Hinnant return __result; 18163e519524SHoward Hinnant} 18173e519524SHoward Hinnant 18183e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18203e519524SHoward Hinnanttypename enable_if 18213e519524SHoward Hinnant< 18223e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18233e519524SHoward Hinnant _OutputIterator 18243e519524SHoward Hinnant>::type 18253e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18263e519524SHoward Hinnant{ 1827ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18283e519524SHoward Hinnant} 18293e519524SHoward Hinnant 18303e519524SHoward Hinnant// move 18313e519524SHoward Hinnant 18323e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18343e519524SHoward Hinnant_OutputIterator 18353e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18363e519524SHoward Hinnant{ 18373e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 1838ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18393e519524SHoward Hinnant return __result; 18403e519524SHoward Hinnant} 18413e519524SHoward Hinnant 18423e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18443e519524SHoward Hinnanttypename enable_if 18453e519524SHoward Hinnant< 18463e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1847ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18483e519524SHoward Hinnant _Up* 18493e519524SHoward Hinnant>::type 18503e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18513e519524SHoward Hinnant{ 18523e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1853ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18543e519524SHoward Hinnant return __result + __n; 18553e519524SHoward Hinnant} 18563e519524SHoward Hinnant 18573e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18593e519524SHoward Hinnant_OutputIterator 18603e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18613e519524SHoward Hinnant{ 1862ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18633e519524SHoward Hinnant} 18643e519524SHoward Hinnant 18653e519524SHoward Hinnant// move_backward 18663e519524SHoward Hinnant 18673e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18693e519524SHoward Hinnant_OutputIterator 18703e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18713e519524SHoward Hinnant{ 18723e519524SHoward Hinnant while (__first != __last) 1873ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18743e519524SHoward Hinnant return __result; 18753e519524SHoward Hinnant} 18763e519524SHoward Hinnant 18773e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18793e519524SHoward Hinnanttypename enable_if 18803e519524SHoward Hinnant< 18813e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1882ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18833e519524SHoward Hinnant _Up* 18843e519524SHoward Hinnant>::type 18853e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18863e519524SHoward Hinnant{ 18873e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18883e519524SHoward Hinnant __result -= __n; 1889ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18903e519524SHoward Hinnant return __result; 18913e519524SHoward Hinnant} 18923e519524SHoward Hinnant 18933e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18953e519524SHoward Hinnant_BidirectionalIterator2 18963e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18973e519524SHoward Hinnant _BidirectionalIterator2 __result) 18983e519524SHoward Hinnant{ 1899ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19003e519524SHoward Hinnant} 19013e519524SHoward Hinnant 19023e519524SHoward Hinnant// iter_swap 19033e519524SHoward Hinnant 1904a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19053e519524SHoward Hinnant 19063e519524SHoward Hinnant// transform 19073e519524SHoward Hinnant 19083e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19103e519524SHoward Hinnant_OutputIterator 19113e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19123e519524SHoward Hinnant{ 19133e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19143e519524SHoward Hinnant *__result = __op(*__first); 19153e519524SHoward Hinnant return __result; 19163e519524SHoward Hinnant} 19173e519524SHoward Hinnant 19183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19203e519524SHoward Hinnant_OutputIterator 19213e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19223e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19233e519524SHoward Hinnant{ 19243e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 19253e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19263e519524SHoward Hinnant return __result; 19273e519524SHoward Hinnant} 19283e519524SHoward Hinnant 19293e519524SHoward Hinnant// replace 19303e519524SHoward Hinnant 19313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19333e519524SHoward Hinnantvoid 19343e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19353e519524SHoward Hinnant{ 19363e519524SHoward Hinnant for (; __first != __last; ++__first) 19373e519524SHoward Hinnant if (*__first == __old_value) 19383e519524SHoward Hinnant *__first = __new_value; 19393e519524SHoward Hinnant} 19403e519524SHoward Hinnant 19413e519524SHoward Hinnant// replace_if 19423e519524SHoward Hinnant 19433e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19453e519524SHoward Hinnantvoid 19463e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19473e519524SHoward Hinnant{ 19483e519524SHoward Hinnant for (; __first != __last; ++__first) 19493e519524SHoward Hinnant if (__pred(*__first)) 19503e519524SHoward Hinnant *__first = __new_value; 19513e519524SHoward Hinnant} 19523e519524SHoward Hinnant 19533e519524SHoward Hinnant// replace_copy 19543e519524SHoward Hinnant 19553e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19573e519524SHoward Hinnant_OutputIterator 19583e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19593e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19603e519524SHoward Hinnant{ 19613e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19623e519524SHoward Hinnant if (*__first == __old_value) 19633e519524SHoward Hinnant *__result = __new_value; 19643e519524SHoward Hinnant else 19653e519524SHoward Hinnant *__result = *__first; 19663e519524SHoward Hinnant return __result; 19673e519524SHoward Hinnant} 19683e519524SHoward Hinnant 19693e519524SHoward Hinnant// replace_copy_if 19703e519524SHoward Hinnant 19713e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 19723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19733e519524SHoward Hinnant_OutputIterator 19743e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19753e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19763e519524SHoward Hinnant{ 19773e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19783e519524SHoward Hinnant if (__pred(*__first)) 19793e519524SHoward Hinnant *__result = __new_value; 19803e519524SHoward Hinnant else 19813e519524SHoward Hinnant *__result = *__first; 19823e519524SHoward Hinnant return __result; 19833e519524SHoward Hinnant} 19843e519524SHoward Hinnant 19853e519524SHoward Hinnant// fill_n 19863e519524SHoward Hinnant 19873e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19893e519524SHoward Hinnant_OutputIterator 19900f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19913e519524SHoward Hinnant{ 19923e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 1993e4383379SHoward Hinnant *__first = __value_; 19943e519524SHoward Hinnant return __first; 19953e519524SHoward Hinnant} 19963e519524SHoward Hinnant 19970f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 19983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19990f242beaSHoward Hinnanttypename enable_if 20000f242beaSHoward Hinnant< 20010f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20020f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20030f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20040f242beaSHoward Hinnant _Tp* 20050f242beaSHoward Hinnant>::type 20060f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20073e519524SHoward Hinnant{ 20083e519524SHoward Hinnant if (__n > 0) 2009e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20103e519524SHoward Hinnant return __first + __n; 20113e519524SHoward Hinnant} 20123e519524SHoward Hinnant 20133e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20153e519524SHoward Hinnant_OutputIterator 2016e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20173e519524SHoward Hinnant{ 20180f242beaSHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_); 20193e519524SHoward Hinnant} 20203e519524SHoward Hinnant 20213e519524SHoward Hinnant// fill 20223e519524SHoward Hinnant 20233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20253e519524SHoward Hinnantvoid 2026e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20273e519524SHoward Hinnant{ 20283e519524SHoward Hinnant for (; __first != __last; ++__first) 2029e4383379SHoward Hinnant *__first = __value_; 20303e519524SHoward Hinnant} 20313e519524SHoward Hinnant 20323e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20343e519524SHoward Hinnantvoid 2035e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20363e519524SHoward Hinnant{ 2037e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20383e519524SHoward Hinnant} 20393e519524SHoward Hinnant 20403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20423e519524SHoward Hinnantvoid 2043e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20443e519524SHoward Hinnant{ 2045e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20463e519524SHoward Hinnant} 20473e519524SHoward Hinnant 20483e519524SHoward Hinnant// generate 20493e519524SHoward Hinnant 20503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20523e519524SHoward Hinnantvoid 20533e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20543e519524SHoward Hinnant{ 20553e519524SHoward Hinnant for (; __first != __last; ++__first) 20563e519524SHoward Hinnant *__first = __gen(); 20573e519524SHoward Hinnant} 20583e519524SHoward Hinnant 20593e519524SHoward Hinnant// generate_n 20603e519524SHoward Hinnant 20613e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20633e519524SHoward Hinnant_OutputIterator 20643e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 20653e519524SHoward Hinnant{ 20663e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 20673e519524SHoward Hinnant *__first = __gen(); 20683e519524SHoward Hinnant return __first; 20693e519524SHoward Hinnant} 20703e519524SHoward Hinnant 20713e519524SHoward Hinnant// remove 20723e519524SHoward Hinnant 20733e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20743e519524SHoward Hinnant_ForwardIterator 2075e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20763e519524SHoward Hinnant{ 2077e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20783e519524SHoward Hinnant if (__first != __last) 20793e519524SHoward Hinnant { 20803e519524SHoward Hinnant _ForwardIterator __i = __first; 20813e519524SHoward Hinnant while (++__i != __last) 20823e519524SHoward Hinnant { 2083e4383379SHoward Hinnant if (!(*__i == __value_)) 20843e519524SHoward Hinnant { 2085ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20863e519524SHoward Hinnant ++__first; 20873e519524SHoward Hinnant } 20883e519524SHoward Hinnant } 20893e519524SHoward Hinnant } 20903e519524SHoward Hinnant return __first; 20913e519524SHoward Hinnant} 20923e519524SHoward Hinnant 20933e519524SHoward Hinnant// remove_if 20943e519524SHoward Hinnant 20953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 20963e519524SHoward Hinnant_ForwardIterator 20973e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 20983e519524SHoward Hinnant{ 2099ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21003e519524SHoward Hinnant (__first, __last, __pred); 21013e519524SHoward Hinnant if (__first != __last) 21023e519524SHoward Hinnant { 21033e519524SHoward Hinnant _ForwardIterator __i = __first; 21043e519524SHoward Hinnant while (++__i != __last) 21053e519524SHoward Hinnant { 21063e519524SHoward Hinnant if (!__pred(*__i)) 21073e519524SHoward Hinnant { 2108ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21093e519524SHoward Hinnant ++__first; 21103e519524SHoward Hinnant } 21113e519524SHoward Hinnant } 21123e519524SHoward Hinnant } 21133e519524SHoward Hinnant return __first; 21143e519524SHoward Hinnant} 21153e519524SHoward Hinnant 21163e519524SHoward Hinnant// remove_copy 21173e519524SHoward Hinnant 21183e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21203e519524SHoward Hinnant_OutputIterator 2121e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21223e519524SHoward Hinnant{ 21233e519524SHoward Hinnant for (; __first != __last; ++__first) 21243e519524SHoward Hinnant { 2125e4383379SHoward Hinnant if (!(*__first == __value_)) 21263e519524SHoward Hinnant { 21273e519524SHoward Hinnant *__result = *__first; 21283e519524SHoward Hinnant ++__result; 21293e519524SHoward Hinnant } 21303e519524SHoward Hinnant } 21313e519524SHoward Hinnant return __result; 21323e519524SHoward Hinnant} 21333e519524SHoward Hinnant 21343e519524SHoward Hinnant// remove_copy_if 21353e519524SHoward Hinnant 21363e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21383e519524SHoward Hinnant_OutputIterator 21393e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21403e519524SHoward Hinnant{ 21413e519524SHoward Hinnant for (; __first != __last; ++__first) 21423e519524SHoward Hinnant { 21433e519524SHoward Hinnant if (!__pred(*__first)) 21443e519524SHoward Hinnant { 21453e519524SHoward Hinnant *__result = *__first; 21463e519524SHoward Hinnant ++__result; 21473e519524SHoward Hinnant } 21483e519524SHoward Hinnant } 21493e519524SHoward Hinnant return __result; 21503e519524SHoward Hinnant} 21513e519524SHoward Hinnant 21523e519524SHoward Hinnant// unique 21533e519524SHoward Hinnant 21543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21553e519524SHoward Hinnant_ForwardIterator 21563e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21573e519524SHoward Hinnant{ 2158ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21593e519524SHoward Hinnant (__first, __last, __pred); 21603e519524SHoward Hinnant if (__first != __last) 21613e519524SHoward Hinnant { 21623e519524SHoward Hinnant // ... a a ? ... 21633e519524SHoward Hinnant // f i 21643e519524SHoward Hinnant _ForwardIterator __i = __first; 21653e519524SHoward Hinnant for (++__i; ++__i != __last;) 21663e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2167ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21683e519524SHoward Hinnant ++__first; 21693e519524SHoward Hinnant } 21703e519524SHoward Hinnant return __first; 21713e519524SHoward Hinnant} 21723e519524SHoward Hinnant 21733e519524SHoward Hinnanttemplate <class _ForwardIterator> 21743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21753e519524SHoward Hinnant_ForwardIterator 21763e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21773e519524SHoward Hinnant{ 21783e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2179ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21803e519524SHoward Hinnant} 21813e519524SHoward Hinnant 21823e519524SHoward Hinnant// unique_copy 21833e519524SHoward Hinnant 21843e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21853e519524SHoward Hinnant_OutputIterator 21863e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21873e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21883e519524SHoward Hinnant{ 21893e519524SHoward Hinnant if (__first != __last) 21903e519524SHoward Hinnant { 21913e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 21923e519524SHoward Hinnant *__result = __t; 21933e519524SHoward Hinnant ++__result; 21943e519524SHoward Hinnant while (++__first != __last) 21953e519524SHoward Hinnant { 21963e519524SHoward Hinnant if (!__pred(__t, *__first)) 21973e519524SHoward Hinnant { 21983e519524SHoward Hinnant __t = *__first; 21993e519524SHoward Hinnant *__result = __t; 22003e519524SHoward Hinnant ++__result; 22013e519524SHoward Hinnant } 22023e519524SHoward Hinnant } 22033e519524SHoward Hinnant } 22043e519524SHoward Hinnant return __result; 22053e519524SHoward Hinnant} 22063e519524SHoward Hinnant 22073e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22083e519524SHoward Hinnant_OutputIterator 22093e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22103e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22113e519524SHoward Hinnant{ 22123e519524SHoward Hinnant if (__first != __last) 22133e519524SHoward Hinnant { 22143e519524SHoward Hinnant _ForwardIterator __i = __first; 22153e519524SHoward Hinnant *__result = *__i; 22163e519524SHoward Hinnant ++__result; 22173e519524SHoward Hinnant while (++__first != __last) 22183e519524SHoward Hinnant { 22193e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22203e519524SHoward Hinnant { 22213e519524SHoward Hinnant *__result = *__first; 22223e519524SHoward Hinnant ++__result; 22233e519524SHoward Hinnant __i = __first; 22243e519524SHoward Hinnant } 22253e519524SHoward Hinnant } 22263e519524SHoward Hinnant } 22273e519524SHoward Hinnant return __result; 22283e519524SHoward Hinnant} 22293e519524SHoward Hinnant 22303e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22313e519524SHoward Hinnant_ForwardIterator 22323e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22333e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22343e519524SHoward Hinnant{ 22353e519524SHoward Hinnant if (__first != __last) 22363e519524SHoward Hinnant { 22373e519524SHoward Hinnant *__result = *__first; 22383e519524SHoward Hinnant while (++__first != __last) 22393e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22403e519524SHoward Hinnant *++__result = *__first; 22413e519524SHoward Hinnant ++__result; 22423e519524SHoward Hinnant } 22433e519524SHoward Hinnant return __result; 22443e519524SHoward Hinnant} 22453e519524SHoward Hinnant 22463e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22483e519524SHoward Hinnant_OutputIterator 22493e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22503e519524SHoward Hinnant{ 2251ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22523e519524SHoward Hinnant (__first, __last, __result, __pred, 22533e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22543e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22553e519524SHoward Hinnant} 22563e519524SHoward Hinnant 22573e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22593e519524SHoward Hinnant_OutputIterator 22603e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22613e519524SHoward Hinnant{ 22623e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2263ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22643e519524SHoward Hinnant} 22653e519524SHoward Hinnant 22663e519524SHoward Hinnant// reverse 22673e519524SHoward Hinnant 22683e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22703e519524SHoward Hinnantvoid 22713e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22723e519524SHoward Hinnant{ 22733e519524SHoward Hinnant while (__first != __last) 22743e519524SHoward Hinnant { 22753e519524SHoward Hinnant if (__first == --__last) 22763e519524SHoward Hinnant break; 22773e519524SHoward Hinnant swap(*__first, *__last); 22783e519524SHoward Hinnant ++__first; 22793e519524SHoward Hinnant } 22803e519524SHoward Hinnant} 22813e519524SHoward Hinnant 22823e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22843e519524SHoward Hinnantvoid 22853e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22863e519524SHoward Hinnant{ 22873e519524SHoward Hinnant if (__first != __last) 22883e519524SHoward Hinnant for (; __first < --__last; ++__first) 22893e519524SHoward Hinnant swap(*__first, *__last); 22903e519524SHoward Hinnant} 22913e519524SHoward Hinnant 22923e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22943e519524SHoward Hinnantvoid 22953e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 22963e519524SHoward Hinnant{ 2297ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 22983e519524SHoward Hinnant} 22993e519524SHoward Hinnant 23003e519524SHoward Hinnant// reverse_copy 23013e519524SHoward Hinnant 23023e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23043e519524SHoward Hinnant_OutputIterator 23053e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23063e519524SHoward Hinnant{ 23073e519524SHoward Hinnant for (; __first != __last; ++__result) 23083e519524SHoward Hinnant *__result = *--__last; 23093e519524SHoward Hinnant return __result; 23103e519524SHoward Hinnant} 23113e519524SHoward Hinnant 23123e519524SHoward Hinnant// rotate 23133e519524SHoward Hinnant 23143e519524SHoward Hinnanttemplate <class _ForwardIterator> 23153e519524SHoward Hinnant_ForwardIterator 2316aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23173e519524SHoward Hinnant{ 2318aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2319aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2320aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2321aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2322aca09de3SHoward Hinnant return __lm1; 2323aca09de3SHoward Hinnant} 2324aca09de3SHoward Hinnant 2325aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2326aca09de3SHoward Hinnant_BidirectionalIterator 2327aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2328aca09de3SHoward Hinnant{ 2329aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2330aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2331aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2332aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2333aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2334aca09de3SHoward Hinnant return __fp1; 2335aca09de3SHoward Hinnant} 2336aca09de3SHoward Hinnant 2337aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2338aca09de3SHoward Hinnant_ForwardIterator 2339aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2340aca09de3SHoward Hinnant{ 23413e519524SHoward Hinnant _ForwardIterator __i = __middle; 23423e519524SHoward Hinnant while (true) 23433e519524SHoward Hinnant { 23443e519524SHoward Hinnant swap(*__first, *__i); 23453e519524SHoward Hinnant ++__first; 23463e519524SHoward Hinnant if (++__i == __last) 23473e519524SHoward Hinnant break; 23483e519524SHoward Hinnant if (__first == __middle) 23493e519524SHoward Hinnant __middle = __i; 23503e519524SHoward Hinnant } 23513e519524SHoward Hinnant _ForwardIterator __r = __first; 23523e519524SHoward Hinnant if (__first != __middle) 23533e519524SHoward Hinnant { 23543e519524SHoward Hinnant __i = __middle; 23553e519524SHoward Hinnant while (true) 23563e519524SHoward Hinnant { 23573e519524SHoward Hinnant swap(*__first, *__i); 23583e519524SHoward Hinnant ++__first; 23593e519524SHoward Hinnant if (++__i == __last) 23603e519524SHoward Hinnant { 23613e519524SHoward Hinnant if (__first == __middle) 23623e519524SHoward Hinnant break; 23633e519524SHoward Hinnant __i = __middle; 23643e519524SHoward Hinnant } 23653e519524SHoward Hinnant else if (__first == __middle) 23663e519524SHoward Hinnant __middle = __i; 23673e519524SHoward Hinnant } 23683e519524SHoward Hinnant } 23693e519524SHoward Hinnant return __r; 23703e519524SHoward Hinnant} 23713e519524SHoward Hinnant 23723e519524SHoward Hinnanttemplate<typename _Integral> 23733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23743e519524SHoward Hinnant_Integral 23753e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 23763e519524SHoward Hinnant{ 23773e519524SHoward Hinnant do 23783e519524SHoward Hinnant { 23793e519524SHoward Hinnant _Integral __t = __x % __y; 23803e519524SHoward Hinnant __x = __y; 23813e519524SHoward Hinnant __y = __t; 23823e519524SHoward Hinnant } while (__y); 23833e519524SHoward Hinnant return __x; 23843e519524SHoward Hinnant} 23853e519524SHoward Hinnant 23863e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23873e519524SHoward Hinnant_RandomAccessIterator 2388aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 23893e519524SHoward Hinnant{ 23903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 23913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 23923e519524SHoward Hinnant 23933e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 23943e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 23953e519524SHoward Hinnant if (__m1 == __m2) 23963e519524SHoward Hinnant { 2397ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 23983e519524SHoward Hinnant return __middle; 23993e519524SHoward Hinnant } 2400aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24013e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24023e519524SHoward Hinnant { 2403aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24043e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24053e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24063e519524SHoward Hinnant do 24073e519524SHoward Hinnant { 2408aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24093e519524SHoward Hinnant __p1 = __p2; 24103e519524SHoward Hinnant const difference_type __d = __last - __p2; 24113e519524SHoward Hinnant if (__m1 < __d) 24123e519524SHoward Hinnant __p2 += __m1; 24133e519524SHoward Hinnant else 24143e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24153e519524SHoward Hinnant } while (__p2 != __p); 2416aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24173e519524SHoward Hinnant } 24183e519524SHoward Hinnant return __first + __m2; 24193e519524SHoward Hinnant} 24203e519524SHoward Hinnant 24213e519524SHoward Hinnanttemplate <class _ForwardIterator> 24223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24233e519524SHoward Hinnant_ForwardIterator 2424aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2425aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2426aca09de3SHoward Hinnant{ 2427aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2428aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2429aca09de3SHoward Hinnant { 2430aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2431aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2432aca09de3SHoward Hinnant } 2433aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2434aca09de3SHoward Hinnant} 2435aca09de3SHoward Hinnant 2436aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2437aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2438aca09de3SHoward Hinnant_BidirectionalIterator 2439aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2440aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2441aca09de3SHoward Hinnant{ 2442aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2443aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2444aca09de3SHoward Hinnant { 2445aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2446aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2447aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2448aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2449aca09de3SHoward Hinnant } 2450aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2451aca09de3SHoward Hinnant} 2452aca09de3SHoward Hinnant 2453aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2454aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2455aca09de3SHoward Hinnant_RandomAccessIterator 2456aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2457aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2458aca09de3SHoward Hinnant{ 2459aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2460aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2461aca09de3SHoward Hinnant { 2462aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2463aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2464aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2465aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2466aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2467aca09de3SHoward Hinnant } 2468aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2469aca09de3SHoward Hinnant} 2470aca09de3SHoward Hinnant 2471aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2472aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2473aca09de3SHoward Hinnant_ForwardIterator 24743e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24753e519524SHoward Hinnant{ 2476aca09de3SHoward Hinnant if (__first == __middle) 2477aca09de3SHoward Hinnant return __last; 2478aca09de3SHoward Hinnant if (__middle == __last) 2479aca09de3SHoward Hinnant return __first; 2480ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2481aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24823e519524SHoward Hinnant} 24833e519524SHoward Hinnant 24843e519524SHoward Hinnant// rotate_copy 24853e519524SHoward Hinnant 24863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24883e519524SHoward Hinnant_OutputIterator 24893e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 24903e519524SHoward Hinnant{ 2491ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 24923e519524SHoward Hinnant} 24933e519524SHoward Hinnant 24943e519524SHoward Hinnant// min_element 24953e519524SHoward Hinnant 24963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24983e519524SHoward Hinnant_ForwardIterator 24993e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25003e519524SHoward Hinnant{ 25013e519524SHoward Hinnant if (__first != __last) 25023e519524SHoward Hinnant { 25033e519524SHoward Hinnant _ForwardIterator __i = __first; 25043e519524SHoward Hinnant while (++__i != __last) 25053e519524SHoward Hinnant if (__comp(*__i, *__first)) 25063e519524SHoward Hinnant __first = __i; 25073e519524SHoward Hinnant } 25083e519524SHoward Hinnant return __first; 25093e519524SHoward Hinnant} 25103e519524SHoward Hinnant 25113e519524SHoward Hinnanttemplate <class _ForwardIterator> 25123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25133e519524SHoward Hinnant_ForwardIterator 25143e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25153e519524SHoward Hinnant{ 2516ce48a113SHoward Hinnant return _VSTD::min_element(__first, __last, 25174eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25184eb27b79SHoward Hinnant} 25194eb27b79SHoward Hinnant 25204eb27b79SHoward Hinnant// min 25214eb27b79SHoward Hinnant 25224eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25234eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25244eb27b79SHoward Hinnantconst _Tp& 25254eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25264eb27b79SHoward Hinnant{ 25274eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25284eb27b79SHoward Hinnant} 25294eb27b79SHoward Hinnant 25304eb27b79SHoward Hinnanttemplate <class _Tp> 25314eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25324eb27b79SHoward Hinnantconst _Tp& 25334eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25344eb27b79SHoward Hinnant{ 2535ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25364eb27b79SHoward Hinnant} 25374eb27b79SHoward Hinnant 253854976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 253954976f26SHoward Hinnant 25404eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25414eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25424eb27b79SHoward Hinnant_Tp 25434eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25444eb27b79SHoward Hinnant{ 2545ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25464eb27b79SHoward Hinnant} 25474eb27b79SHoward Hinnant 25484eb27b79SHoward Hinnanttemplate<class _Tp> 25494eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25504eb27b79SHoward Hinnant_Tp 25514eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25524eb27b79SHoward Hinnant{ 2553ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end()); 25543e519524SHoward Hinnant} 25553e519524SHoward Hinnant 255654976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 255754976f26SHoward Hinnant 25583e519524SHoward Hinnant// max_element 25593e519524SHoward Hinnant 25603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25623e519524SHoward Hinnant_ForwardIterator 25633e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25643e519524SHoward Hinnant{ 25653e519524SHoward Hinnant if (__first != __last) 25663e519524SHoward Hinnant { 25673e519524SHoward Hinnant _ForwardIterator __i = __first; 25683e519524SHoward Hinnant while (++__i != __last) 25693e519524SHoward Hinnant if (__comp(*__first, *__i)) 25703e519524SHoward Hinnant __first = __i; 25713e519524SHoward Hinnant } 25723e519524SHoward Hinnant return __first; 25733e519524SHoward Hinnant} 25743e519524SHoward Hinnant 25753e519524SHoward Hinnanttemplate <class _ForwardIterator> 25763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25773e519524SHoward Hinnant_ForwardIterator 25783e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25793e519524SHoward Hinnant{ 2580ce48a113SHoward Hinnant return _VSTD::max_element(__first, __last, 25814eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25824eb27b79SHoward Hinnant} 25834eb27b79SHoward Hinnant 25844eb27b79SHoward Hinnant// max 25854eb27b79SHoward Hinnant 25864eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25874eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25884eb27b79SHoward Hinnantconst _Tp& 25894eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 25904eb27b79SHoward Hinnant{ 25914eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 25924eb27b79SHoward Hinnant} 25934eb27b79SHoward Hinnant 25944eb27b79SHoward Hinnanttemplate <class _Tp> 25954eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25964eb27b79SHoward Hinnantconst _Tp& 25974eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 25984eb27b79SHoward Hinnant{ 2599ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26004eb27b79SHoward Hinnant} 26014eb27b79SHoward Hinnant 260254976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 260354976f26SHoward Hinnant 26044eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26054eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26064eb27b79SHoward Hinnant_Tp 26074eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26084eb27b79SHoward Hinnant{ 2609ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26104eb27b79SHoward Hinnant} 26114eb27b79SHoward Hinnant 26124eb27b79SHoward Hinnanttemplate<class _Tp> 26134eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26144eb27b79SHoward Hinnant_Tp 26154eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26164eb27b79SHoward Hinnant{ 2617ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end()); 26183e519524SHoward Hinnant} 26193e519524SHoward Hinnant 262054976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 262154976f26SHoward Hinnant 26223e519524SHoward Hinnant// minmax_element 26233e519524SHoward Hinnant 26243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26253e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26263e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26273e519524SHoward Hinnant{ 26283e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26293e519524SHoward Hinnant if (__first != __last) 26303e519524SHoward Hinnant { 26313e519524SHoward Hinnant if (++__first != __last) 26323e519524SHoward Hinnant { 26333e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26343e519524SHoward Hinnant __result.first = __first; 26353e519524SHoward Hinnant else 26363e519524SHoward Hinnant __result.second = __first; 26373e519524SHoward Hinnant while (++__first != __last) 26383e519524SHoward Hinnant { 26393e519524SHoward Hinnant _ForwardIterator __i = __first; 26403e519524SHoward Hinnant if (++__first == __last) 26413e519524SHoward Hinnant { 26423e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26433e519524SHoward Hinnant __result.first = __i; 26443e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26453e519524SHoward Hinnant __result.second = __i; 26463e519524SHoward Hinnant break; 26473e519524SHoward Hinnant } 26483e519524SHoward Hinnant else 26493e519524SHoward Hinnant { 26503e519524SHoward Hinnant if (__comp(*__first, *__i)) 26513e519524SHoward Hinnant { 26523e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26533e519524SHoward Hinnant __result.first = __first; 26543e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26553e519524SHoward Hinnant __result.second = __i; 26563e519524SHoward Hinnant } 26573e519524SHoward Hinnant else 26583e519524SHoward Hinnant { 26593e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26603e519524SHoward Hinnant __result.first = __i; 26613e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26623e519524SHoward Hinnant __result.second = __first; 26633e519524SHoward Hinnant } 26643e519524SHoward Hinnant } 26653e519524SHoward Hinnant } 26663e519524SHoward Hinnant } 26673e519524SHoward Hinnant } 26683e519524SHoward Hinnant return __result; 26693e519524SHoward Hinnant} 26703e519524SHoward Hinnant 26713e519524SHoward Hinnanttemplate <class _ForwardIterator> 26723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26733e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26743e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26753e519524SHoward Hinnant{ 2676ce48a113SHoward Hinnant return _VSTD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26773e519524SHoward Hinnant} 26783e519524SHoward Hinnant 26794eb27b79SHoward Hinnant// minmax 26804eb27b79SHoward Hinnant 26814eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26824eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26834eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26844eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26854eb27b79SHoward Hinnant{ 26864eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 26874eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 26884eb27b79SHoward Hinnant} 26894eb27b79SHoward Hinnant 26904eb27b79SHoward Hinnanttemplate<class _Tp> 26914eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26924eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26934eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 26944eb27b79SHoward Hinnant{ 2695ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 26964eb27b79SHoward Hinnant} 26974eb27b79SHoward Hinnant 269854976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 269954976f26SHoward Hinnant 27004eb27b79SHoward Hinnanttemplate<class _Tp> 27014eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27024eb27b79SHoward Hinnantpair<_Tp, _Tp> 27034eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t) 27044eb27b79SHoward Hinnant{ 27054eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2706ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end()); 27074eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 27084eb27b79SHoward Hinnant} 27094eb27b79SHoward Hinnant 27104eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27114eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27124eb27b79SHoward Hinnantpair<_Tp, _Tp> 27134eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27144eb27b79SHoward Hinnant{ 27154eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2716ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end(), __comp); 27174eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 27184eb27b79SHoward Hinnant} 27194eb27b79SHoward Hinnant 272054976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 272154976f26SHoward Hinnant 27223e519524SHoward Hinnant// random_shuffle 27233e519524SHoward Hinnant 2724f9d540b0SHoward Hinnant// __independent_bits_engine 2725f9d540b0SHoward Hinnant 2726c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2727f9d540b0SHoward Hinnantstruct __log2_imp 27283e519524SHoward Hinnant{ 2729c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2730c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27313e519524SHoward Hinnant}; 27323e519524SHoward Hinnant 2733c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2734c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 27353e519524SHoward Hinnant{ 2736f9d540b0SHoward Hinnant static const size_t value = 0; 27373e519524SHoward Hinnant}; 27383e519524SHoward Hinnant 2739c003db1fSHoward Hinnanttemplate <size_t _Rp> 2740c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 27413e519524SHoward Hinnant{ 2742c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 27433e519524SHoward Hinnant}; 27443e519524SHoward Hinnant 2745c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2746f9d540b0SHoward Hinnantstruct __log2 27473e519524SHoward Hinnant{ 2748c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2749f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 27503e519524SHoward Hinnant}; 27513e519524SHoward Hinnant 2752f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2753f9d540b0SHoward Hinnantclass __independent_bits_engine 27543e519524SHoward Hinnant{ 2755f9d540b0SHoward Hinnantpublic: 2756f9d540b0SHoward Hinnant // types 2757f9d540b0SHoward Hinnant typedef _UIntType result_type; 2758f9d540b0SHoward Hinnant 2759f9d540b0SHoward Hinnantprivate: 2760f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2761f9d540b0SHoward Hinnant typedef typename conditional 2762f9d540b0SHoward Hinnant < 2763f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2764f9d540b0SHoward Hinnant result_type, 2765f9d540b0SHoward Hinnant _Engine_result_type 2766f9d540b0SHoward Hinnant >::type _Working_result_type; 2767f9d540b0SHoward Hinnant 2768f9d540b0SHoward Hinnant _Engine& __e_; 2769f9d540b0SHoward Hinnant size_t __w_; 2770f9d540b0SHoward Hinnant size_t __w0_; 2771f9d540b0SHoward Hinnant size_t __n_; 2772f9d540b0SHoward Hinnant size_t __n0_; 2773f9d540b0SHoward Hinnant _Working_result_type __y0_; 2774f9d540b0SHoward Hinnant _Working_result_type __y1_; 2775f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2776f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2777f9d540b0SHoward Hinnant 2778e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2779c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2780f9d540b0SHoward Hinnant + _Working_result_type(1); 2781e386b7b3SHoward Hinnant#else 2782e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2783e386b7b3SHoward Hinnant + _Working_result_type(1); 2784e386b7b3SHoward Hinnant#endif 2785e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2786e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2787e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2788f9d540b0SHoward Hinnant 2789f9d540b0SHoward Hinnantpublic: 2790f9d540b0SHoward Hinnant // constructors and seeding functions 2791f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2792f9d540b0SHoward Hinnant 2793f9d540b0SHoward Hinnant // generating functions 2794c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2795f9d540b0SHoward Hinnant 2796f9d540b0SHoward Hinnantprivate: 2797f9d540b0SHoward Hinnant result_type __eval(false_type); 2798f9d540b0SHoward Hinnant result_type __eval(true_type); 2799f9d540b0SHoward Hinnant}; 2800f9d540b0SHoward Hinnant 2801f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2802f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2803f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2804f9d540b0SHoward Hinnant : __e_(__e), 2805f9d540b0SHoward Hinnant __w_(__w) 2806f9d540b0SHoward Hinnant{ 2807f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2808f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2809c003db1fSHoward Hinnant if (_Rp == 0) 2810c003db1fSHoward Hinnant __y0_ = _Rp; 2811f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2812c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2813f9d540b0SHoward Hinnant else 2814f9d540b0SHoward Hinnant __y0_ = 0; 2815c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2816f9d540b0SHoward Hinnant { 2817f9d540b0SHoward Hinnant ++__n_; 2818f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2819f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2820c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2821f9d540b0SHoward Hinnant else 2822f9d540b0SHoward Hinnant __y0_ = 0; 2823f9d540b0SHoward Hinnant } 2824f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2825f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2826c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2827f9d540b0SHoward Hinnant else 2828f9d540b0SHoward Hinnant __y1_ = 0; 2829f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2830f9d540b0SHoward Hinnant _Engine_result_type(0); 2831f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2832f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2833f9d540b0SHoward Hinnant _Engine_result_type(~0); 28343e519524SHoward Hinnant} 28353e519524SHoward Hinnant 2836f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2837f9d540b0SHoward Hinnantinline 2838f9d540b0SHoward Hinnant_UIntType 2839f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 28403e519524SHoward Hinnant{ 2841f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 28423e519524SHoward Hinnant} 28433e519524SHoward Hinnant 2844f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2845f9d540b0SHoward Hinnant_UIntType 2846f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28473e519524SHoward Hinnant{ 2848c003db1fSHoward Hinnant result_type _Sp = 0; 2849f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2850f9d540b0SHoward Hinnant { 2851f9d540b0SHoward Hinnant _Engine_result_type __u; 28523e519524SHoward Hinnant do 2853f9d540b0SHoward Hinnant { 2854f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2855f9d540b0SHoward Hinnant } while (__u >= __y0_); 28560176bc6cSHoward Hinnant if (__w0_ < _WDt) 2857c003db1fSHoward Hinnant _Sp <<= __w0_; 2858f9d540b0SHoward Hinnant else 2859c003db1fSHoward Hinnant _Sp = 0; 2860c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2861f9d540b0SHoward Hinnant } 2862f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2863f9d540b0SHoward Hinnant { 2864f9d540b0SHoward Hinnant _Engine_result_type __u; 2865f9d540b0SHoward Hinnant do 2866f9d540b0SHoward Hinnant { 2867f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2868f9d540b0SHoward Hinnant } while (__u >= __y1_); 28690176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2870c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2871f9d540b0SHoward Hinnant else 2872c003db1fSHoward Hinnant _Sp = 0; 2873c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2874f9d540b0SHoward Hinnant } 2875c003db1fSHoward Hinnant return _Sp; 28763e519524SHoward Hinnant} 28773e519524SHoward Hinnant 2878f9d540b0SHoward Hinnant// uniform_int_distribution 28793e519524SHoward Hinnant 2880f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2881f9d540b0SHoward Hinnantclass uniform_int_distribution 28823e519524SHoward Hinnant{ 2883f9d540b0SHoward Hinnantpublic: 2884f9d540b0SHoward Hinnant // types 2885f9d540b0SHoward Hinnant typedef _IntType result_type; 2886f9d540b0SHoward Hinnant 2887f9d540b0SHoward Hinnant class param_type 2888f9d540b0SHoward Hinnant { 2889f9d540b0SHoward Hinnant result_type __a_; 2890f9d540b0SHoward Hinnant result_type __b_; 2891f9d540b0SHoward Hinnant public: 2892f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2893f9d540b0SHoward Hinnant 2894f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2895f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2896f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2897f9d540b0SHoward Hinnant 2898f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2899f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2900f9d540b0SHoward Hinnant 2901f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2902f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2903f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2904f9d540b0SHoward Hinnant {return !(__x == __y);} 29053e519524SHoward Hinnant }; 29063e519524SHoward Hinnant 2907f9d540b0SHoward Hinnantprivate: 2908f9d540b0SHoward Hinnant param_type __p_; 29093e519524SHoward Hinnant 2910f9d540b0SHoward Hinnantpublic: 2911f9d540b0SHoward Hinnant // constructors and reset functions 2912f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2913f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2914f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2915f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2916f9d540b0SHoward Hinnant void reset() {} 2917f9d540b0SHoward Hinnant 2918f9d540b0SHoward Hinnant // generating functions 2919f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2920f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2921f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2922f9d540b0SHoward Hinnant 2923f9d540b0SHoward Hinnant // property functions 2924f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2925f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2926f9d540b0SHoward Hinnant 2927f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2928f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2929f9d540b0SHoward Hinnant 2930f9d540b0SHoward Hinnant result_type min() const {return a();} 2931f9d540b0SHoward Hinnant result_type max() const {return b();} 2932f9d540b0SHoward Hinnant 2933f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2934f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2935f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2936f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2937f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2938f9d540b0SHoward Hinnant {return !(__x == __y);} 29393e519524SHoward Hinnant}; 29403e519524SHoward Hinnant 2941f9d540b0SHoward Hinnanttemplate<class _IntType> 2942f9d540b0SHoward Hinnanttemplate<class _URNG> 2943f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2944f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29453e519524SHoward Hinnant{ 2946f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2947f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2948c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 2949c003db1fSHoward Hinnant if (_Rp == 1) 2950f9d540b0SHoward Hinnant return __p.a(); 2951f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2952f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2953c003db1fSHoward Hinnant if (_Rp == 0) 2954f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2955c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2956c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 2957f9d540b0SHoward Hinnant ++__w; 2958f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2959f9d540b0SHoward Hinnant _UIntType __u; 2960f9d540b0SHoward Hinnant do 29613e519524SHoward Hinnant { 2962f9d540b0SHoward Hinnant __u = __e(); 2963c003db1fSHoward Hinnant } while (__u >= _Rp); 2964f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 29653e519524SHoward Hinnant} 2966f9d540b0SHoward Hinnant 2967f9d540b0SHoward Hinnantclass __rs_default; 2968f9d540b0SHoward Hinnant 2969f9d540b0SHoward Hinnant__rs_default __rs_get(); 2970f9d540b0SHoward Hinnant 2971f9d540b0SHoward Hinnantclass __rs_default 29723e519524SHoward Hinnant{ 2973f9d540b0SHoward Hinnant static unsigned __c_; 2974f9d540b0SHoward Hinnant 2975f9d540b0SHoward Hinnant __rs_default(); 2976f9d540b0SHoward Hinnantpublic: 2977b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 2978f9d540b0SHoward Hinnant 2979f9d540b0SHoward Hinnant static const result_type _Min = 0; 2980f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2981f9d540b0SHoward Hinnant 2982f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2983f9d540b0SHoward Hinnant ~__rs_default(); 2984f9d540b0SHoward Hinnant 2985f9d540b0SHoward Hinnant result_type operator()(); 2986f9d540b0SHoward Hinnant 2987788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2988788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 2989f9d540b0SHoward Hinnant 2990f9d540b0SHoward Hinnant friend __rs_default __rs_get(); 2991f9d540b0SHoward Hinnant}; 2992f9d540b0SHoward Hinnant 2993f9d540b0SHoward Hinnant__rs_default __rs_get(); 29943e519524SHoward Hinnant 29953e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 29963e519524SHoward Hinnantvoid 29973e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 29983e519524SHoward Hinnant{ 29993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3000c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3001c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30023e519524SHoward Hinnant difference_type __d = __last - __first; 30033e519524SHoward Hinnant if (__d > 1) 30043e519524SHoward Hinnant { 3005c003db1fSHoward Hinnant _Dp __uid; 3006f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3007f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3008007b26beSHoward Hinnant { 3009c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3010007b26beSHoward Hinnant if (__i != difference_type(0)) 3011007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3012007b26beSHoward Hinnant } 30133e519524SHoward Hinnant } 30143e519524SHoward Hinnant} 30153e519524SHoward Hinnant 30163e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 30173e519524SHoward Hinnantvoid 30183e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 30197609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 30203e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30213e519524SHoward Hinnant#else 30223e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30233e519524SHoward Hinnant#endif 30243e519524SHoward Hinnant{ 30253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30263e519524SHoward Hinnant difference_type __d = __last - __first; 30273e519524SHoward Hinnant if (__d > 1) 30283e519524SHoward Hinnant { 30293e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3030007b26beSHoward Hinnant { 3031007b26beSHoward Hinnant difference_type __i = __rand(__d); 3032007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3033007b26beSHoward Hinnant } 30343e519524SHoward Hinnant } 30353e519524SHoward Hinnant} 30363e519524SHoward Hinnant 3037f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3038f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3039fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3040fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3041fb340102SHoward Hinnant#else 3042f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3043fb340102SHoward Hinnant#endif 3044f9d540b0SHoward Hinnant{ 3045f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3046c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3047c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3048f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3049f9d540b0SHoward Hinnant if (__d > 1) 3050f9d540b0SHoward Hinnant { 3051c003db1fSHoward Hinnant _Dp __uid; 3052f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3053007b26beSHoward Hinnant { 3054c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3055007b26beSHoward Hinnant if (__i != difference_type(0)) 3056007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3057007b26beSHoward Hinnant } 3058f9d540b0SHoward Hinnant } 3059f9d540b0SHoward Hinnant} 3060f9d540b0SHoward Hinnant 30613e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 30623e519524SHoward Hinnantbool 30633e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 30643e519524SHoward Hinnant{ 30653e519524SHoward Hinnant for (; __first != __last; ++__first) 30663e519524SHoward Hinnant if (!__pred(*__first)) 30673e519524SHoward Hinnant break; 30683e519524SHoward Hinnant for (; __first != __last; ++__first) 30693e519524SHoward Hinnant if (__pred(*__first)) 30703e519524SHoward Hinnant return false; 30713e519524SHoward Hinnant return true; 30723e519524SHoward Hinnant} 30733e519524SHoward Hinnant 30743e519524SHoward Hinnant// partition 30753e519524SHoward Hinnant 30763e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 30773e519524SHoward Hinnant_ForwardIterator 30783e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 30793e519524SHoward Hinnant{ 30803e519524SHoward Hinnant while (true) 30813e519524SHoward Hinnant { 30823e519524SHoward Hinnant if (__first == __last) 30833e519524SHoward Hinnant return __first; 30843e519524SHoward Hinnant if (!__pred(*__first)) 30853e519524SHoward Hinnant break; 30863e519524SHoward Hinnant ++__first; 30873e519524SHoward Hinnant } 30883e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 30893e519524SHoward Hinnant { 30903e519524SHoward Hinnant if (__pred(*__p)) 30913e519524SHoward Hinnant { 30923e519524SHoward Hinnant swap(*__first, *__p); 30933e519524SHoward Hinnant ++__first; 30943e519524SHoward Hinnant } 30953e519524SHoward Hinnant } 30963e519524SHoward Hinnant return __first; 30973e519524SHoward Hinnant} 30983e519524SHoward Hinnant 30993e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31003e519524SHoward Hinnant_BidirectionalIterator 31013e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31023e519524SHoward Hinnant bidirectional_iterator_tag) 31033e519524SHoward Hinnant{ 31043e519524SHoward Hinnant while (true) 31053e519524SHoward Hinnant { 31063e519524SHoward Hinnant while (true) 31073e519524SHoward Hinnant { 31083e519524SHoward Hinnant if (__first == __last) 31093e519524SHoward Hinnant return __first; 31103e519524SHoward Hinnant if (!__pred(*__first)) 31113e519524SHoward Hinnant break; 31123e519524SHoward Hinnant ++__first; 31133e519524SHoward Hinnant } 31143e519524SHoward Hinnant do 31153e519524SHoward Hinnant { 31163e519524SHoward Hinnant if (__first == --__last) 31173e519524SHoward Hinnant return __first; 31183e519524SHoward Hinnant } while (!__pred(*__last)); 31193e519524SHoward Hinnant swap(*__first, *__last); 31203e519524SHoward Hinnant ++__first; 31213e519524SHoward Hinnant } 31223e519524SHoward Hinnant} 31233e519524SHoward Hinnant 31243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31263e519524SHoward Hinnant_ForwardIterator 31273e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31283e519524SHoward Hinnant{ 3129ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 31303e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31313e519524SHoward Hinnant} 31323e519524SHoward Hinnant 31333e519524SHoward Hinnant// partition_copy 31343e519524SHoward Hinnant 31353e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 31363e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 31373e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 31383e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 31393e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 31403e519524SHoward Hinnant _Predicate __pred) 31413e519524SHoward Hinnant{ 31423e519524SHoward Hinnant for (; __first != __last; ++__first) 31433e519524SHoward Hinnant { 31443e519524SHoward Hinnant if (__pred(*__first)) 31453e519524SHoward Hinnant { 31463e519524SHoward Hinnant *__out_true = *__first; 31473e519524SHoward Hinnant ++__out_true; 31483e519524SHoward Hinnant } 31493e519524SHoward Hinnant else 31503e519524SHoward Hinnant { 31513e519524SHoward Hinnant *__out_false = *__first; 31523e519524SHoward Hinnant ++__out_false; 31533e519524SHoward Hinnant } 31543e519524SHoward Hinnant } 31553e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 31563e519524SHoward Hinnant} 31573e519524SHoward Hinnant 31583e519524SHoward Hinnant// partition_point 31593e519524SHoward Hinnant 31603e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 31613e519524SHoward Hinnant_ForwardIterator 31623e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31633e519524SHoward Hinnant{ 31643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3165ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 31663e519524SHoward Hinnant while (__len != 0) 31673e519524SHoward Hinnant { 31683e519524SHoward Hinnant difference_type __l2 = __len / 2; 31693e519524SHoward Hinnant _ForwardIterator __m = __first; 3170ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 31713e519524SHoward Hinnant if (__pred(*__m)) 31723e519524SHoward Hinnant { 31733e519524SHoward Hinnant __first = ++__m; 31743e519524SHoward Hinnant __len -= __l2 + 1; 31753e519524SHoward Hinnant } 31763e519524SHoward Hinnant else 31773e519524SHoward Hinnant __len = __l2; 31783e519524SHoward Hinnant } 31793e519524SHoward Hinnant return __first; 31803e519524SHoward Hinnant} 31813e519524SHoward Hinnant 31823e519524SHoward Hinnant// stable_partition 31833e519524SHoward Hinnant 31843e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 31853e519524SHoward Hinnant_ForwardIterator 31863e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 31873e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 31883e519524SHoward Hinnant{ 31893e519524SHoward Hinnant // *__first is known to be false 31903e519524SHoward Hinnant // __len >= 1 31913e519524SHoward Hinnant if (__len == 1) 31923e519524SHoward Hinnant return __first; 31933e519524SHoward Hinnant if (__len == 2) 31943e519524SHoward Hinnant { 31953e519524SHoward Hinnant _ForwardIterator __m = __first; 31963e519524SHoward Hinnant if (__pred(*++__m)) 31973e519524SHoward Hinnant { 31983e519524SHoward Hinnant swap(*__first, *__m); 31993e519524SHoward Hinnant return __m; 32003e519524SHoward Hinnant } 32013e519524SHoward Hinnant return __first; 32023e519524SHoward Hinnant } 32033e519524SHoward Hinnant if (__len <= __p.second) 32043e519524SHoward Hinnant { // The buffer is big enough to use 32053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32063e519524SHoward Hinnant __destruct_n __d(0); 32073e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32083e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32093e519524SHoward Hinnant // Update __first to always point to the end of the trues 32103e519524SHoward Hinnant value_type* __t = __p.first; 3211ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32123e519524SHoward Hinnant __d.__incr((value_type*)0); 32133e519524SHoward Hinnant ++__t; 32143e519524SHoward Hinnant _ForwardIterator __i = __first; 32153e519524SHoward Hinnant while (++__i != __last) 32163e519524SHoward Hinnant { 32173e519524SHoward Hinnant if (__pred(*__i)) 32183e519524SHoward Hinnant { 3219ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32203e519524SHoward Hinnant ++__first; 32213e519524SHoward Hinnant } 32223e519524SHoward Hinnant else 32233e519524SHoward Hinnant { 3224ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32253e519524SHoward Hinnant __d.__incr((value_type*)0); 32263e519524SHoward Hinnant ++__t; 32273e519524SHoward Hinnant } 32283e519524SHoward Hinnant } 32293e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 32303e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 32313e519524SHoward Hinnant __i = __first; 32323e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3233ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 32343e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 32353e519524SHoward Hinnant return __first; 32363e519524SHoward Hinnant } 32373e519524SHoward Hinnant // Else not enough buffer, do in place 32383e519524SHoward Hinnant // __len >= 3 32393e519524SHoward Hinnant _ForwardIterator __m = __first; 32403e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3241ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 32423e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 32433e519524SHoward Hinnant // F????????????????? 32443e519524SHoward Hinnant // f m l 32453e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 32463e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 32473e519524SHoward Hinnant // TTTFFFFF?????????? 32483e519524SHoward Hinnant // f ff m l 32493e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 32503e519524SHoward Hinnant _ForwardIterator __m1 = __m; 32513e519524SHoward Hinnant _ForwardIterator __second_false = __last; 32523e519524SHoward Hinnant _Distance __len_half = __len - __len2; 32533e519524SHoward Hinnant while (__pred(*__m1)) 32543e519524SHoward Hinnant { 32553e519524SHoward Hinnant if (++__m1 == __last) 32563e519524SHoward Hinnant goto __second_half_done; 32573e519524SHoward Hinnant --__len_half; 32583e519524SHoward Hinnant } 32593e519524SHoward Hinnant // TTTFFFFFTTTF?????? 32603e519524SHoward Hinnant // f ff m m1 l 32613e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 32623e519524SHoward Hinnant__second_half_done: 32633e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 32643e519524SHoward Hinnant // f ff m sf l 3265ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 32663e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 32673e519524SHoward Hinnant // | 32683e519524SHoward Hinnant} 32693e519524SHoward Hinnant 32703e519524SHoward Hinnantstruct __return_temporary_buffer 32713e519524SHoward Hinnant{ 32723e519524SHoward Hinnant template <class _Tp> 3273ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 32743e519524SHoward Hinnant}; 32753e519524SHoward Hinnant 32763e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32773e519524SHoward Hinnant_ForwardIterator 32783e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32793e519524SHoward Hinnant forward_iterator_tag) 32803e519524SHoward Hinnant{ 32813e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 32823e519524SHoward Hinnant // Either prove all true and return __first or point to first false 32833e519524SHoward Hinnant while (true) 32843e519524SHoward Hinnant { 32853e519524SHoward Hinnant if (__first == __last) 32863e519524SHoward Hinnant return __first; 32873e519524SHoward Hinnant if (!__pred(*__first)) 32883e519524SHoward Hinnant break; 32893e519524SHoward Hinnant ++__first; 32903e519524SHoward Hinnant } 32913e519524SHoward Hinnant // We now have a reduced range [__first, __last) 32923e519524SHoward Hinnant // *__first is known to be false 32933e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 32943e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3295ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32963e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 32973e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 32983e519524SHoward Hinnant if (__len >= __alloc_limit) 32993e519524SHoward Hinnant { 3300ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33013e519524SHoward Hinnant __h.reset(__p.first); 33023e519524SHoward Hinnant } 33033e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33043e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33053e519524SHoward Hinnant} 33063e519524SHoward Hinnant 33073e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33083e519524SHoward Hinnant_BidirectionalIterator 33093e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33103e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33113e519524SHoward Hinnant{ 33123e519524SHoward Hinnant // *__first is known to be false 33133e519524SHoward Hinnant // *__last is known to be true 33143e519524SHoward Hinnant // __len >= 2 33153e519524SHoward Hinnant if (__len == 2) 33163e519524SHoward Hinnant { 33173e519524SHoward Hinnant swap(*__first, *__last); 33183e519524SHoward Hinnant return __last; 33193e519524SHoward Hinnant } 33203e519524SHoward Hinnant if (__len == 3) 33213e519524SHoward Hinnant { 33223e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33233e519524SHoward Hinnant if (__pred(*++__m)) 33243e519524SHoward Hinnant { 33253e519524SHoward Hinnant swap(*__first, *__m); 33263e519524SHoward Hinnant swap(*__m, *__last); 33273e519524SHoward Hinnant return __last; 33283e519524SHoward Hinnant } 33293e519524SHoward Hinnant swap(*__m, *__last); 33303e519524SHoward Hinnant swap(*__first, *__m); 33313e519524SHoward Hinnant return __m; 33323e519524SHoward Hinnant } 33333e519524SHoward Hinnant if (__len <= __p.second) 33343e519524SHoward Hinnant { // The buffer is big enough to use 33353e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 33363e519524SHoward Hinnant __destruct_n __d(0); 33373e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33383e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33393e519524SHoward Hinnant // Update __first to always point to the end of the trues 33403e519524SHoward Hinnant value_type* __t = __p.first; 3341ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33423e519524SHoward Hinnant __d.__incr((value_type*)0); 33433e519524SHoward Hinnant ++__t; 33443e519524SHoward Hinnant _BidirectionalIterator __i = __first; 33453e519524SHoward Hinnant while (++__i != __last) 33463e519524SHoward Hinnant { 33473e519524SHoward Hinnant if (__pred(*__i)) 33483e519524SHoward Hinnant { 3349ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33503e519524SHoward Hinnant ++__first; 33513e519524SHoward Hinnant } 33523e519524SHoward Hinnant else 33533e519524SHoward Hinnant { 3354ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33553e519524SHoward Hinnant __d.__incr((value_type*)0); 33563e519524SHoward Hinnant ++__t; 33573e519524SHoward Hinnant } 33583e519524SHoward Hinnant } 33593e519524SHoward Hinnant // move *__last, known to be true 3360ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33613e519524SHoward Hinnant __i = ++__first; 33623e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33633e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33643e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3365ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33663e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33673e519524SHoward Hinnant return __first; 33683e519524SHoward Hinnant } 33693e519524SHoward Hinnant // Else not enough buffer, do in place 33703e519524SHoward Hinnant // __len >= 4 33713e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33723e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3373ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33743e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 33753e519524SHoward Hinnant // F????????????????T 33763e519524SHoward Hinnant // f m l 33773e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 33783e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 33793e519524SHoward Hinnant _Distance __len_half = __len2; 33803e519524SHoward Hinnant while (!__pred(*--__m1)) 33813e519524SHoward Hinnant { 33823e519524SHoward Hinnant if (__m1 == __first) 33833e519524SHoward Hinnant goto __first_half_done; 33843e519524SHoward Hinnant --__len_half; 33853e519524SHoward Hinnant } 33863e519524SHoward Hinnant // F???TFFF?????????T 33873e519524SHoward Hinnant // f m1 m l 33883e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33893e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 33903e519524SHoward Hinnant__first_half_done: 33913e519524SHoward Hinnant // TTTFFFFF?????????T 33923e519524SHoward Hinnant // f ff m l 33933e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33943e519524SHoward Hinnant __m1 = __m; 33953e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 33963e519524SHoward Hinnant ++__second_false; 33973e519524SHoward Hinnant __len_half = __len - __len2; 33983e519524SHoward Hinnant while (__pred(*__m1)) 33993e519524SHoward Hinnant { 34003e519524SHoward Hinnant if (++__m1 == __last) 34013e519524SHoward Hinnant goto __second_half_done; 34023e519524SHoward Hinnant --__len_half; 34033e519524SHoward Hinnant } 34043e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34053e519524SHoward Hinnant // f ff m m1 l 34063e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34073e519524SHoward Hinnant__second_half_done: 34083e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34093e519524SHoward Hinnant // f ff m sf l 3410ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34113e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34123e519524SHoward Hinnant // | 34133e519524SHoward Hinnant} 34143e519524SHoward Hinnant 34153e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34163e519524SHoward Hinnant_BidirectionalIterator 34173e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34183e519524SHoward Hinnant bidirectional_iterator_tag) 34193e519524SHoward Hinnant{ 34203e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34213e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34223e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34233e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34243e519524SHoward Hinnant while (true) 34253e519524SHoward Hinnant { 34263e519524SHoward Hinnant if (__first == __last) 34273e519524SHoward Hinnant return __first; 34283e519524SHoward Hinnant if (!__pred(*__first)) 34293e519524SHoward Hinnant break; 34303e519524SHoward Hinnant ++__first; 34313e519524SHoward Hinnant } 34323e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 34333e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 34343e519524SHoward Hinnant do 34353e519524SHoward Hinnant { 34363e519524SHoward Hinnant if (__first == --__last) 34373e519524SHoward Hinnant return __first; 34383e519524SHoward Hinnant } while (!__pred(*__last)); 34393e519524SHoward Hinnant // We now have a reduced range [__first, __last] 34403e519524SHoward Hinnant // *__first is known to be false 34413e519524SHoward Hinnant // *__last is known to be true 34423e519524SHoward Hinnant // __len >= 2 3443ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 34443e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34453e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34463e519524SHoward Hinnant if (__len >= __alloc_limit) 34473e519524SHoward Hinnant { 3448ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34493e519524SHoward Hinnant __h.reset(__p.first); 34503e519524SHoward Hinnant } 34513e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34523e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 34533e519524SHoward Hinnant} 34543e519524SHoward Hinnant 34553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 34563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34573e519524SHoward Hinnant_ForwardIterator 34583e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34593e519524SHoward Hinnant{ 34603e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34613e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 34623e519524SHoward Hinnant} 34633e519524SHoward Hinnant 34643e519524SHoward Hinnant// is_sorted_until 34653e519524SHoward Hinnant 34663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 34673e519524SHoward Hinnant_ForwardIterator 34683e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 34693e519524SHoward Hinnant{ 34703e519524SHoward Hinnant if (__first != __last) 34713e519524SHoward Hinnant { 34723e519524SHoward Hinnant _ForwardIterator __i = __first; 34733e519524SHoward Hinnant while (++__i != __last) 34743e519524SHoward Hinnant { 34753e519524SHoward Hinnant if (__comp(*__i, *__first)) 34763e519524SHoward Hinnant return __i; 34773e519524SHoward Hinnant __first = __i; 34783e519524SHoward Hinnant } 34793e519524SHoward Hinnant } 34803e519524SHoward Hinnant return __last; 34813e519524SHoward Hinnant} 34823e519524SHoward Hinnant 34833e519524SHoward Hinnanttemplate<class _ForwardIterator> 34843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34853e519524SHoward Hinnant_ForwardIterator 34863e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 34873e519524SHoward Hinnant{ 3488ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 34893e519524SHoward Hinnant} 34903e519524SHoward Hinnant 34913e519524SHoward Hinnant// is_sorted 34923e519524SHoward Hinnant 34933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 34943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34953e519524SHoward Hinnantbool 34963e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 34973e519524SHoward Hinnant{ 3498ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 34993e519524SHoward Hinnant} 35003e519524SHoward Hinnant 35013e519524SHoward Hinnanttemplate<class _ForwardIterator> 35023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35033e519524SHoward Hinnantbool 35043e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35053e519524SHoward Hinnant{ 3506ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35073e519524SHoward Hinnant} 35083e519524SHoward Hinnant 35093e519524SHoward Hinnant// sort 35103e519524SHoward Hinnant 35113e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35123e519524SHoward Hinnant 35133e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35143e519524SHoward Hinnantunsigned 35153e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35163e519524SHoward Hinnant{ 35173e519524SHoward Hinnant unsigned __r = 0; 35183e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35193e519524SHoward Hinnant { 35203e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35213e519524SHoward Hinnant return __r; // x <= y && y <= z 35223e519524SHoward Hinnant // x <= y && y > z 35233e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35243e519524SHoward Hinnant __r = 1; 35253e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35263e519524SHoward Hinnant { 35273e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35283e519524SHoward Hinnant __r = 2; 35293e519524SHoward Hinnant } 35303e519524SHoward Hinnant return __r; // x <= y && y < z 35313e519524SHoward Hinnant } 35323e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 35333e519524SHoward Hinnant { 35343e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 35353e519524SHoward Hinnant __r = 1; 35363e519524SHoward Hinnant return __r; 35373e519524SHoward Hinnant } 35383e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 35393e519524SHoward Hinnant __r = 1; // x < y && x <= z 35403e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 35413e519524SHoward Hinnant { 35423e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 35433e519524SHoward Hinnant __r = 2; 35443e519524SHoward Hinnant } 35453e519524SHoward Hinnant return __r; 35463e519524SHoward Hinnant} // x <= y && y <= z 35473e519524SHoward Hinnant 35483e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 35493e519524SHoward Hinnant 35503e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35513e519524SHoward Hinnantunsigned 35523e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35533e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 35543e519524SHoward Hinnant{ 35553e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 35563e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35573e519524SHoward Hinnant { 35583e519524SHoward Hinnant swap(*__x3, *__x4); 35593e519524SHoward Hinnant ++__r; 35603e519524SHoward Hinnant if (__c(*__x3, *__x2)) 35613e519524SHoward Hinnant { 35623e519524SHoward Hinnant swap(*__x2, *__x3); 35633e519524SHoward Hinnant ++__r; 35643e519524SHoward Hinnant if (__c(*__x2, *__x1)) 35653e519524SHoward Hinnant { 35663e519524SHoward Hinnant swap(*__x1, *__x2); 35673e519524SHoward Hinnant ++__r; 35683e519524SHoward Hinnant } 35693e519524SHoward Hinnant } 35703e519524SHoward Hinnant } 35713e519524SHoward Hinnant return __r; 35723e519524SHoward Hinnant} 35733e519524SHoward Hinnant 35743e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 35753e519524SHoward Hinnant 35763e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35773e519524SHoward Hinnantunsigned 35783e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35793e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 35803e519524SHoward Hinnant{ 35813e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 35823e519524SHoward Hinnant if (__c(*__x5, *__x4)) 35833e519524SHoward Hinnant { 35843e519524SHoward Hinnant swap(*__x4, *__x5); 35853e519524SHoward Hinnant ++__r; 35863e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35873e519524SHoward Hinnant { 35883e519524SHoward Hinnant swap(*__x3, *__x4); 35893e519524SHoward Hinnant ++__r; 35903e519524SHoward Hinnant if (__c(*__x3, *__x2)) 35913e519524SHoward Hinnant { 35923e519524SHoward Hinnant swap(*__x2, *__x3); 35933e519524SHoward Hinnant ++__r; 35943e519524SHoward Hinnant if (__c(*__x2, *__x1)) 35953e519524SHoward Hinnant { 35963e519524SHoward Hinnant swap(*__x1, *__x2); 35973e519524SHoward Hinnant ++__r; 35983e519524SHoward Hinnant } 35993e519524SHoward Hinnant } 36003e519524SHoward Hinnant } 36013e519524SHoward Hinnant } 36023e519524SHoward Hinnant return __r; 36033e519524SHoward Hinnant} 36043e519524SHoward Hinnant 36053e519524SHoward Hinnant// Assumes size > 0 36063e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36073e519524SHoward Hinnantvoid 36083e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36093e519524SHoward Hinnant{ 36103e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36113e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36123e519524SHoward Hinnant { 3613ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36143e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36153e519524SHoward Hinnant (__first, __last, __comp); 36163e519524SHoward Hinnant if (__i != __first) 36173e519524SHoward Hinnant swap(*__first, *__i); 36183e519524SHoward Hinnant } 36193e519524SHoward Hinnant} 36203e519524SHoward Hinnant 36213e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36223e519524SHoward Hinnantvoid 36233e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36243e519524SHoward Hinnant{ 36253e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36263e519524SHoward Hinnant if (__first != __last) 36273e519524SHoward Hinnant { 36283e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 36293e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 36303e519524SHoward Hinnant { 36313e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3632ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 36333e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3634ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3635ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36363e519524SHoward Hinnant } 36373e519524SHoward Hinnant } 36383e519524SHoward Hinnant} 36393e519524SHoward Hinnant 36403e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36413e519524SHoward Hinnantvoid 36423e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36433e519524SHoward Hinnant{ 36443e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 36453e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 36463e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 36473e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 36483e519524SHoward Hinnant { 36493e519524SHoward Hinnant if (__comp(*__i, *__j)) 36503e519524SHoward Hinnant { 3651ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 36523e519524SHoward Hinnant _RandomAccessIterator __k = __j; 36533e519524SHoward Hinnant __j = __i; 36543e519524SHoward Hinnant do 36553e519524SHoward Hinnant { 3656ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 36573e519524SHoward Hinnant __j = __k; 36583e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3659ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36603e519524SHoward Hinnant } 36613e519524SHoward Hinnant __j = __i; 36623e519524SHoward Hinnant } 36633e519524SHoward Hinnant} 36643e519524SHoward Hinnant 36653e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36663e519524SHoward Hinnantbool 36673e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36683e519524SHoward Hinnant{ 36693e519524SHoward Hinnant switch (__last - __first) 36703e519524SHoward Hinnant { 36713e519524SHoward Hinnant case 0: 36723e519524SHoward Hinnant case 1: 36733e519524SHoward Hinnant return true; 36743e519524SHoward Hinnant case 2: 36753e519524SHoward Hinnant if (__comp(*--__last, *__first)) 36763e519524SHoward Hinnant swap(*__first, *__last); 36773e519524SHoward Hinnant return true; 36783e519524SHoward Hinnant case 3: 3679ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 36803e519524SHoward Hinnant return true; 36813e519524SHoward Hinnant case 4: 3682ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 36833e519524SHoward Hinnant return true; 36843e519524SHoward Hinnant case 5: 3685ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 36863e519524SHoward Hinnant return true; 36873e519524SHoward Hinnant } 36883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 36893e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 36903e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 36913e519524SHoward Hinnant const unsigned __limit = 8; 36923e519524SHoward Hinnant unsigned __count = 0; 36933e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 36943e519524SHoward Hinnant { 36953e519524SHoward Hinnant if (__comp(*__i, *__j)) 36963e519524SHoward Hinnant { 3697ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 36983e519524SHoward Hinnant _RandomAccessIterator __k = __j; 36993e519524SHoward Hinnant __j = __i; 37003e519524SHoward Hinnant do 37013e519524SHoward Hinnant { 3702ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37033e519524SHoward Hinnant __j = __k; 37043e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3705ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37063e519524SHoward Hinnant if (++__count == __limit) 37073e519524SHoward Hinnant return ++__i == __last; 37083e519524SHoward Hinnant } 37093e519524SHoward Hinnant __j = __i; 37103e519524SHoward Hinnant } 37113e519524SHoward Hinnant return true; 37123e519524SHoward Hinnant} 37133e519524SHoward Hinnant 37143e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37153e519524SHoward Hinnantvoid 37163e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37173e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37183e519524SHoward Hinnant{ 37193e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37203e519524SHoward Hinnant if (__first1 != __last1) 37213e519524SHoward Hinnant { 37223e519524SHoward Hinnant __destruct_n __d(0); 37233e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37243e519524SHoward Hinnant value_type* __last2 = __first2; 3725ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37263e519524SHoward Hinnant __d.__incr((value_type*)0); 37273e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37283e519524SHoward Hinnant { 37293e519524SHoward Hinnant value_type* __j2 = __last2; 37303e519524SHoward Hinnant value_type* __i2 = __j2; 37313e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 37323e519524SHoward Hinnant { 3733ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 37343e519524SHoward Hinnant __d.__incr((value_type*)0); 37353e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3736ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3737ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 37383e519524SHoward Hinnant } 37393e519524SHoward Hinnant else 37403e519524SHoward Hinnant { 3741ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 37423e519524SHoward Hinnant __d.__incr((value_type*)0); 37433e519524SHoward Hinnant } 37443e519524SHoward Hinnant } 37453e519524SHoward Hinnant __h.release(); 37463e519524SHoward Hinnant } 37473e519524SHoward Hinnant} 37483e519524SHoward Hinnant 37493e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37503e519524SHoward Hinnantvoid 37513e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37523e519524SHoward Hinnant{ 37533e519524SHoward Hinnant // _Compare is known to be a reference type 37543e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 37553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3756ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3757ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 37583e519524SHoward Hinnant while (true) 37593e519524SHoward Hinnant { 37603e519524SHoward Hinnant __restart: 37613e519524SHoward Hinnant difference_type __len = __last - __first; 37623e519524SHoward Hinnant switch (__len) 37633e519524SHoward Hinnant { 37643e519524SHoward Hinnant case 0: 37653e519524SHoward Hinnant case 1: 37663e519524SHoward Hinnant return; 37673e519524SHoward Hinnant case 2: 37683e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37693e519524SHoward Hinnant swap(*__first, *__last); 37703e519524SHoward Hinnant return; 37713e519524SHoward Hinnant case 3: 3772ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37733e519524SHoward Hinnant return; 37743e519524SHoward Hinnant case 4: 3775ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37763e519524SHoward Hinnant return; 37773e519524SHoward Hinnant case 5: 3778ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37793e519524SHoward Hinnant return; 37803e519524SHoward Hinnant } 37813e519524SHoward Hinnant if (__len <= __limit) 37823e519524SHoward Hinnant { 3783ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 37843e519524SHoward Hinnant return; 37853e519524SHoward Hinnant } 37863e519524SHoward Hinnant // __len > 5 37873e519524SHoward Hinnant _RandomAccessIterator __m = __first; 37883e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 37893e519524SHoward Hinnant --__lm1; 37903e519524SHoward Hinnant unsigned __n_swaps; 37913e519524SHoward Hinnant { 37923e519524SHoward Hinnant difference_type __delta; 37933e519524SHoward Hinnant if (__len >= 1000) 37943e519524SHoward Hinnant { 37953e519524SHoward Hinnant __delta = __len/2; 37963e519524SHoward Hinnant __m += __delta; 37973e519524SHoward Hinnant __delta /= 2; 3798ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 37993e519524SHoward Hinnant } 38003e519524SHoward Hinnant else 38013e519524SHoward Hinnant { 38023e519524SHoward Hinnant __delta = __len/2; 38033e519524SHoward Hinnant __m += __delta; 3804ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38053e519524SHoward Hinnant } 38063e519524SHoward Hinnant } 38073e519524SHoward Hinnant // *__m is median 38083e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38093e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38103e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38113e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38123e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38133e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38143e519524SHoward Hinnant // Prime the downward search with a guard. 38153e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38163e519524SHoward Hinnant { 38173e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38183e519524SHoward Hinnant // manually guard downward moving __j against __i 38193e519524SHoward Hinnant while (true) 38203e519524SHoward Hinnant { 38213e519524SHoward Hinnant if (__i == --__j) 38223e519524SHoward Hinnant { 38233e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38243e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38253e519524SHoward Hinnant ++__i; // __first + 1 38263e519524SHoward Hinnant __j = __last; 38273e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38283e519524SHoward Hinnant { 38293e519524SHoward Hinnant while (true) 38303e519524SHoward Hinnant { 38313e519524SHoward Hinnant if (__i == __j) 38323e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 38333e519524SHoward Hinnant if (__comp(*__first, *__i)) 38343e519524SHoward Hinnant { 38353e519524SHoward Hinnant swap(*__i, *__j); 38363e519524SHoward Hinnant ++__n_swaps; 38373e519524SHoward Hinnant ++__i; 38383e519524SHoward Hinnant break; 38393e519524SHoward Hinnant } 38403e519524SHoward Hinnant ++__i; 38413e519524SHoward Hinnant } 38423e519524SHoward Hinnant } 38433e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 38443e519524SHoward Hinnant if (__i == __j) 38453e519524SHoward Hinnant return; 38463e519524SHoward Hinnant while (true) 38473e519524SHoward Hinnant { 38483e519524SHoward Hinnant while (!__comp(*__first, *__i)) 38493e519524SHoward Hinnant ++__i; 38503e519524SHoward Hinnant while (__comp(*__first, *--__j)) 38513e519524SHoward Hinnant ; 38523e519524SHoward Hinnant if (__i >= __j) 38533e519524SHoward Hinnant break; 38543e519524SHoward Hinnant swap(*__i, *__j); 38553e519524SHoward Hinnant ++__n_swaps; 38563e519524SHoward Hinnant ++__i; 38573e519524SHoward Hinnant } 38583e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 38593e519524SHoward Hinnant // The first part is sorted, sort the secod part 3860ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 38613e519524SHoward Hinnant __first = __i; 38623e519524SHoward Hinnant goto __restart; 38633e519524SHoward Hinnant } 38643e519524SHoward Hinnant if (__comp(*__j, *__m)) 38653e519524SHoward Hinnant { 38663e519524SHoward Hinnant swap(*__i, *__j); 38673e519524SHoward Hinnant ++__n_swaps; 38683e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 38693e519524SHoward Hinnant } 38703e519524SHoward Hinnant } 38713e519524SHoward Hinnant } 38723e519524SHoward Hinnant // It is known that *__i < *__m 38733e519524SHoward Hinnant ++__i; 38743e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38753e519524SHoward Hinnant // if not yet partitioned... 38763e519524SHoward Hinnant if (__i < __j) 38773e519524SHoward Hinnant { 38783e519524SHoward Hinnant // known that *(__i - 1) < *__m 38793e519524SHoward Hinnant // known that __i <= __m 38803e519524SHoward Hinnant while (true) 38813e519524SHoward Hinnant { 38823e519524SHoward Hinnant // __m still guards upward moving __i 38833e519524SHoward Hinnant while (__comp(*__i, *__m)) 38843e519524SHoward Hinnant ++__i; 38853e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 38863e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 38873e519524SHoward Hinnant ; 38883e519524SHoward Hinnant if (__i > __j) 38893e519524SHoward Hinnant break; 38903e519524SHoward Hinnant swap(*__i, *__j); 38913e519524SHoward Hinnant ++__n_swaps; 38923e519524SHoward Hinnant // It is known that __m != __j 38933e519524SHoward Hinnant // If __m just moved, follow it 38943e519524SHoward Hinnant if (__m == __i) 38953e519524SHoward Hinnant __m = __j; 38963e519524SHoward Hinnant ++__i; 38973e519524SHoward Hinnant } 38983e519524SHoward Hinnant } 38993e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39003e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39013e519524SHoward Hinnant { 39023e519524SHoward Hinnant swap(*__i, *__m); 39033e519524SHoward Hinnant ++__n_swaps; 39043e519524SHoward Hinnant } 39053e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39063e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39073e519524SHoward Hinnant if (__n_swaps == 0) 39083e519524SHoward Hinnant { 3909ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3910ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39113e519524SHoward Hinnant { 39123e519524SHoward Hinnant if (__fs) 39133e519524SHoward Hinnant return; 39143e519524SHoward Hinnant __last = __i; 39153e519524SHoward Hinnant continue; 39163e519524SHoward Hinnant } 39173e519524SHoward Hinnant else 39183e519524SHoward Hinnant { 39193e519524SHoward Hinnant if (__fs) 39203e519524SHoward Hinnant { 39213e519524SHoward Hinnant __first = ++__i; 39223e519524SHoward Hinnant continue; 39233e519524SHoward Hinnant } 39243e519524SHoward Hinnant } 39253e519524SHoward Hinnant } 39263e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39273e519524SHoward Hinnant if (__i - __first < __last - __i) 39283e519524SHoward Hinnant { 3929ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3930ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 39313e519524SHoward Hinnant __first = ++__i; 39323e519524SHoward Hinnant } 39333e519524SHoward Hinnant else 39343e519524SHoward Hinnant { 3935ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 3936ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 39373e519524SHoward Hinnant __last = __i; 39383e519524SHoward Hinnant } 39393e519524SHoward Hinnant } 39403e519524SHoward Hinnant} 39413e519524SHoward Hinnant 39423e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 39433e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 39443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39453e519524SHoward Hinnantvoid 39463e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39473e519524SHoward Hinnant{ 3948f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 39493e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39503e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 39513e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 3952f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 39533e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 39543e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 3955f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 39563e519524SHoward Hinnant} 39573e519524SHoward Hinnant 39583e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 39593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39603e519524SHoward Hinnantvoid 39613e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 39623e519524SHoward Hinnant{ 3963ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 39643e519524SHoward Hinnant} 39653e519524SHoward Hinnant 39663e519524SHoward Hinnanttemplate <class _Tp> 39673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39683e519524SHoward Hinnantvoid 39693e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 39703e519524SHoward Hinnant{ 3971ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 39723e519524SHoward Hinnant} 39733e519524SHoward Hinnant 39743e519524SHoward Hinnanttemplate <class _Tp> 39753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39763e519524SHoward Hinnantvoid 39773e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 39783e519524SHoward Hinnant{ 3979ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 39803e519524SHoward Hinnant} 39813e519524SHoward Hinnant 3982f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 3983f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 3984f554add5SHoward Hinnantvoid 3985f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 3986f554add5SHoward Hinnant{ 3987f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3988f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 3989f554add5SHoward Hinnant} 3990f554add5SHoward Hinnant 3991*0be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 3992e4383379SHoward Hinnant#pragma warning( push ) 3993e4383379SHoward Hinnant#pragma warning( disable: 4231) 3994*0be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 3995cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 3996cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 3997cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 3998cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 3999cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4000cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4001cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4002cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4003cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4004cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4005cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4006cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4007cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4008cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4009cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40103e519524SHoward Hinnant 4011cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4012cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4013cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4014cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4015cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4016cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4017cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4018cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4019cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4020cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4021cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4022cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4023cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4024cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4025cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40263e519524SHoward Hinnant 4027cd47cbc7SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&)) 4028*0be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4029e4383379SHoward Hinnant#pragma warning( pop ) 4030*0be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 40313e519524SHoward Hinnant 40323e519524SHoward Hinnant// lower_bound 40333e519524SHoward Hinnant 40343e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 40353e519524SHoward Hinnant_ForwardIterator 4036e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40373e519524SHoward Hinnant{ 40383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4039ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40403e519524SHoward Hinnant while (__len != 0) 40413e519524SHoward Hinnant { 40423e519524SHoward Hinnant difference_type __l2 = __len / 2; 40433e519524SHoward Hinnant _ForwardIterator __m = __first; 4044ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4045e4383379SHoward Hinnant if (__comp(*__m, __value_)) 40463e519524SHoward Hinnant { 40473e519524SHoward Hinnant __first = ++__m; 40483e519524SHoward Hinnant __len -= __l2 + 1; 40493e519524SHoward Hinnant } 40503e519524SHoward Hinnant else 40513e519524SHoward Hinnant __len = __l2; 40523e519524SHoward Hinnant } 40533e519524SHoward Hinnant return __first; 40543e519524SHoward Hinnant} 40553e519524SHoward Hinnant 40563e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 40573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40583e519524SHoward Hinnant_ForwardIterator 4059e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40603e519524SHoward Hinnant{ 4061f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 40623e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40633e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4064e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4065f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 40663e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4067e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4068f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 40693e519524SHoward Hinnant} 40703e519524SHoward Hinnant 40713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 40723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40733e519524SHoward Hinnant_ForwardIterator 4074e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 40753e519524SHoward Hinnant{ 4076e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 40773e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 40783e519524SHoward Hinnant} 40793e519524SHoward Hinnant 40803e519524SHoward Hinnant// upper_bound 40813e519524SHoward Hinnant 40823e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 40833e519524SHoward Hinnant_ForwardIterator 4084e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40853e519524SHoward Hinnant{ 40863e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4087ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40883e519524SHoward Hinnant while (__len != 0) 40893e519524SHoward Hinnant { 40903e519524SHoward Hinnant difference_type __l2 = __len / 2; 40913e519524SHoward Hinnant _ForwardIterator __m = __first; 4092ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4093e4383379SHoward Hinnant if (__comp(__value_, *__m)) 40943e519524SHoward Hinnant __len = __l2; 40953e519524SHoward Hinnant else 40963e519524SHoward Hinnant { 40973e519524SHoward Hinnant __first = ++__m; 40983e519524SHoward Hinnant __len -= __l2 + 1; 40993e519524SHoward Hinnant } 41003e519524SHoward Hinnant } 41013e519524SHoward Hinnant return __first; 41023e519524SHoward Hinnant} 41033e519524SHoward Hinnant 41043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41063e519524SHoward Hinnant_ForwardIterator 4107e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41083e519524SHoward Hinnant{ 4109f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 41103e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41113e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4112e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4113f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 41143e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4115e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4116f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 41173e519524SHoward Hinnant} 41183e519524SHoward Hinnant 41193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41213e519524SHoward Hinnant_ForwardIterator 4122e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41233e519524SHoward Hinnant{ 4124e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41253e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41263e519524SHoward Hinnant} 41273e519524SHoward Hinnant 41283e519524SHoward Hinnant// equal_range 41293e519524SHoward Hinnant 41303e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41313e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4132e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41333e519524SHoward Hinnant{ 41343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4135ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41363e519524SHoward Hinnant while (__len != 0) 41373e519524SHoward Hinnant { 41383e519524SHoward Hinnant difference_type __l2 = __len / 2; 41393e519524SHoward Hinnant _ForwardIterator __m = __first; 4140ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4141e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41423e519524SHoward Hinnant { 41433e519524SHoward Hinnant __first = ++__m; 41443e519524SHoward Hinnant __len -= __l2 + 1; 41453e519524SHoward Hinnant } 4146e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 41473e519524SHoward Hinnant { 41483e519524SHoward Hinnant __last = __m; 41493e519524SHoward Hinnant __len = __l2; 41503e519524SHoward Hinnant } 41513e519524SHoward Hinnant else 41523e519524SHoward Hinnant { 41533e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 41543e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 41553e519524SHoward Hinnant ( 4156e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4157e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 41583e519524SHoward Hinnant ); 41593e519524SHoward Hinnant } 41603e519524SHoward Hinnant } 41613e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 41623e519524SHoward Hinnant} 41633e519524SHoward Hinnant 41643e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41663e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4167e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41683e519524SHoward Hinnant{ 4169f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 41703e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41713e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4172e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4173f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 41743e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4175e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4176f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 41773e519524SHoward Hinnant} 41783e519524SHoward Hinnant 41793e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41813e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4182e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41833e519524SHoward Hinnant{ 4184e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 41853e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41863e519524SHoward Hinnant} 41873e519524SHoward Hinnant 41883e519524SHoward Hinnant// binary_search 41893e519524SHoward Hinnant 41903e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41923e519524SHoward Hinnantbool 4193e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41943e519524SHoward Hinnant{ 4195e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4196e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 41973e519524SHoward Hinnant} 41983e519524SHoward Hinnant 41993e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42013e519524SHoward Hinnantbool 4202e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42033e519524SHoward Hinnant{ 4204f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 42053e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42063e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4207e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4208f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 42093e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4210e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4211f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 42123e519524SHoward Hinnant} 42133e519524SHoward Hinnant 42143e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42163e519524SHoward Hinnantbool 4217e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42183e519524SHoward Hinnant{ 4219e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42203e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42213e519524SHoward Hinnant} 42223e519524SHoward Hinnant 42233e519524SHoward Hinnant// merge 42243e519524SHoward Hinnant 42253e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42263e519524SHoward Hinnant_OutputIterator 42273e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42283e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42293e519524SHoward Hinnant{ 42303e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42313e519524SHoward Hinnant { 42323e519524SHoward Hinnant if (__first2 == __last2) 4233ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 42343e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42353e519524SHoward Hinnant { 42363e519524SHoward Hinnant *__result = *__first2; 42373e519524SHoward Hinnant ++__first2; 42383e519524SHoward Hinnant } 42393e519524SHoward Hinnant else 42403e519524SHoward Hinnant { 42413e519524SHoward Hinnant *__result = *__first1; 42423e519524SHoward Hinnant ++__first1; 42433e519524SHoward Hinnant } 42443e519524SHoward Hinnant } 4245ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 42463e519524SHoward Hinnant} 42473e519524SHoward Hinnant 42483e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 42493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42503e519524SHoward Hinnant_OutputIterator 42513e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42523e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42533e519524SHoward Hinnant{ 4254f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 42553e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42563e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4257ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4258f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 42593e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4260ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4261f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 42623e519524SHoward Hinnant} 42633e519524SHoward Hinnant 42643e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 42653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42663e519524SHoward Hinnant_OutputIterator 42673e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42683e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 42693e519524SHoward Hinnant{ 42703e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 42713e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 42723e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 42733e519524SHoward Hinnant} 42743e519524SHoward Hinnant 42753e519524SHoward Hinnant// inplace_merge 42763e519524SHoward Hinnant 42773e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 42783e519524SHoward Hinnantvoid 42793e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 42803e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 42813e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 42823e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 42833e519524SHoward Hinnant{ 42843e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 42853e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 42863e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 42873e519524SHoward Hinnant __destruct_n __d(0); 42883e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 42893e519524SHoward Hinnant if (__len1 <= __len2) 42903e519524SHoward Hinnant { 42913e519524SHoward Hinnant value_type* __p = __buff; 42923e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 4293ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 42943e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 42953e519524SHoward Hinnant move_iterator<value_type*>(__p), 42963e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 42973e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 42983e519524SHoward Hinnant __first, __comp); 42993e519524SHoward Hinnant } 43003e519524SHoward Hinnant else 43013e519524SHoward Hinnant { 43023e519524SHoward Hinnant value_type* __p = __buff; 43033e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 4304ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43053e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43063e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 43073e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 43083e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 43093e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 43103e519524SHoward Hinnant } 43113e519524SHoward Hinnant} 43123e519524SHoward Hinnant 43133e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43143e519524SHoward Hinnantvoid 43153e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43163e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43173e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43183e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43193e519524SHoward Hinnant{ 43203e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43213e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43223e519524SHoward Hinnant while (true) 43233e519524SHoward Hinnant { 43243e519524SHoward Hinnant // if __middle == __last, we're done 43253e519524SHoward Hinnant if (__len2 == 0) 43263e519524SHoward Hinnant return; 43273e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 43283e519524SHoward Hinnant for (; true; ++__first, --__len1) 43293e519524SHoward Hinnant { 43303e519524SHoward Hinnant if (__len1 == 0) 43313e519524SHoward Hinnant return; 43323e519524SHoward Hinnant if (__comp(*__middle, *__first)) 43333e519524SHoward Hinnant break; 43343e519524SHoward Hinnant } 43353e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 43363e519524SHoward Hinnant { 43373e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 43383e519524SHoward Hinnant return; 43393e519524SHoward Hinnant } 43403e519524SHoward Hinnant // __first < __middle < __last 43413e519524SHoward Hinnant // *__first > *__middle 43423e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 43433e519524SHoward Hinnant // all elements in: 43443e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 43453e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 43463e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 43473e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 43483e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 43493e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 43503e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 43513e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 43523e519524SHoward Hinnant // binary search smaller range 43533e519524SHoward Hinnant if (__len1 < __len2) 43543e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 43553e519524SHoward Hinnant __len21 = __len2 / 2; 43563e519524SHoward Hinnant __m2 = __middle; 4357ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 43583e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4359ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 43603e519524SHoward Hinnant } 43613e519524SHoward Hinnant else 43623e519524SHoward Hinnant { 43633e519524SHoward Hinnant if (__len1 == 1) 43643e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 43653e519524SHoward Hinnant // It is known *__first > *__middle 43663e519524SHoward Hinnant swap(*__first, *__middle); 43673e519524SHoward Hinnant return; 43683e519524SHoward Hinnant } 43693e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 43703e519524SHoward Hinnant __len11 = __len1 / 2; 43713e519524SHoward Hinnant __m1 = __first; 4372ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 43733e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4374ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 43753e519524SHoward Hinnant } 43763e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 43773e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 43783e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 43793e519524SHoward Hinnant // swap middle two partitions 4380ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 43813e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 43823e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 43833e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 43843e519524SHoward Hinnant { 43853e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 43863e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 43873e519524SHoward Hinnant __first = __middle; 43883e519524SHoward Hinnant __middle = __m2; 43893e519524SHoward Hinnant __len1 = __len12; 43903e519524SHoward Hinnant __len2 = __len22; 43913e519524SHoward Hinnant } 43923e519524SHoward Hinnant else 43933e519524SHoward Hinnant { 43943e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 43953e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 43963e519524SHoward Hinnant __last = __middle; 43973e519524SHoward Hinnant __middle = __m1; 43983e519524SHoward Hinnant __len1 = __len11; 43993e519524SHoward Hinnant __len2 = __len21; 44003e519524SHoward Hinnant } 44013e519524SHoward Hinnant } 44023e519524SHoward Hinnant} 44033e519524SHoward Hinnant 44043e519524SHoward Hinnanttemplate <class _Tp> 44053e519524SHoward Hinnantstruct __inplace_merge_switch 44063e519524SHoward Hinnant{ 4407ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 44083e519524SHoward Hinnant}; 44093e519524SHoward Hinnant 44103e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44123e519524SHoward Hinnantvoid 44133e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44143e519524SHoward Hinnant _Compare __comp) 44153e519524SHoward Hinnant{ 44163e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44173e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4418ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4419ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4420ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44213e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 44223e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 44233e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 44243e519524SHoward Hinnant { 4425ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44263e519524SHoward Hinnant __h.reset(__buf.first); 44273e519524SHoward Hinnant } 4428f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 44293e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44303e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4431ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 44323e519524SHoward Hinnant __buf.first, __buf.second); 4433f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 44343e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4435ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 44363e519524SHoward Hinnant __buf.first, __buf.second); 4437f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 44383e519524SHoward Hinnant} 44393e519524SHoward Hinnant 44403e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 44413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44423e519524SHoward Hinnantvoid 44433e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 44443e519524SHoward Hinnant{ 4445ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 44463e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 44473e519524SHoward Hinnant} 44483e519524SHoward Hinnant 44493e519524SHoward Hinnant// stable_sort 44503e519524SHoward Hinnant 44513e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 44523e519524SHoward Hinnantvoid 44533e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 44543e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 44553e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 44563e519524SHoward Hinnant{ 44573e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 44583e519524SHoward Hinnant __destruct_n __d(0); 44593e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 44603e519524SHoward Hinnant for (; true; ++__result) 44613e519524SHoward Hinnant { 44623e519524SHoward Hinnant if (__first1 == __last1) 44633e519524SHoward Hinnant { 44643e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4465ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 44663e519524SHoward Hinnant __h.release(); 44673e519524SHoward Hinnant return; 44683e519524SHoward Hinnant } 44693e519524SHoward Hinnant if (__first2 == __last2) 44703e519524SHoward Hinnant { 44713e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4472ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 44733e519524SHoward Hinnant __h.release(); 44743e519524SHoward Hinnant return; 44753e519524SHoward Hinnant } 44763e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44773e519524SHoward Hinnant { 4478ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 44793e519524SHoward Hinnant __d.__incr((value_type*)0); 44803e519524SHoward Hinnant ++__first2; 44813e519524SHoward Hinnant } 44823e519524SHoward Hinnant else 44833e519524SHoward Hinnant { 4484ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 44853e519524SHoward Hinnant __d.__incr((value_type*)0); 44863e519524SHoward Hinnant ++__first1; 44873e519524SHoward Hinnant } 44883e519524SHoward Hinnant } 44893e519524SHoward Hinnant} 44903e519524SHoward Hinnant 44913e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 44923e519524SHoward Hinnantvoid 44933e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 44943e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 44953e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 44963e519524SHoward Hinnant{ 44973e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 44983e519524SHoward Hinnant { 44993e519524SHoward Hinnant if (__first2 == __last2) 45003e519524SHoward Hinnant { 45013e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4502ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45033e519524SHoward Hinnant return; 45043e519524SHoward Hinnant } 45053e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45063e519524SHoward Hinnant { 4507ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45083e519524SHoward Hinnant ++__first2; 45093e519524SHoward Hinnant } 45103e519524SHoward Hinnant else 45113e519524SHoward Hinnant { 4512ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45133e519524SHoward Hinnant ++__first1; 45143e519524SHoward Hinnant } 45153e519524SHoward Hinnant } 45163e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4517ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45183e519524SHoward Hinnant} 45193e519524SHoward Hinnant 45203e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45213e519524SHoward Hinnantvoid 45223e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45233e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45243e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45253e519524SHoward Hinnant 45263e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45273e519524SHoward Hinnantvoid 45283e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45293e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45303e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 45313e519524SHoward Hinnant{ 45323e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45333e519524SHoward Hinnant switch (__len) 45343e519524SHoward Hinnant { 45353e519524SHoward Hinnant case 0: 45363e519524SHoward Hinnant return; 45373e519524SHoward Hinnant case 1: 4538ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45393e519524SHoward Hinnant return; 45403e519524SHoward Hinnant case 2: 45413e519524SHoward Hinnant __destruct_n __d(0); 45423e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 45433e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 45443e519524SHoward Hinnant { 4545ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45463e519524SHoward Hinnant __d.__incr((value_type*)0); 45473e519524SHoward Hinnant ++__first2; 4548ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45493e519524SHoward Hinnant } 45503e519524SHoward Hinnant else 45513e519524SHoward Hinnant { 4552ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45533e519524SHoward Hinnant __d.__incr((value_type*)0); 45543e519524SHoward Hinnant ++__first2; 4555ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45563e519524SHoward Hinnant } 45573e519524SHoward Hinnant __h2.release(); 45583e519524SHoward Hinnant return; 45593e519524SHoward Hinnant } 45603e519524SHoward Hinnant if (__len <= 8) 45613e519524SHoward Hinnant { 45623e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 45633e519524SHoward Hinnant return; 45643e519524SHoward Hinnant } 45653e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 45663e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 45673e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 45683e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 45693e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 45703e519524SHoward Hinnant} 45713e519524SHoward Hinnant 45723e519524SHoward Hinnanttemplate <class _Tp> 45733e519524SHoward Hinnantstruct __stable_sort_switch 45743e519524SHoward Hinnant{ 4575ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 45763e519524SHoward Hinnant}; 45773e519524SHoward Hinnant 45783e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45793e519524SHoward Hinnantvoid 45803e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45813e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45823e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 45833e519524SHoward Hinnant{ 45843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45853e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45863e519524SHoward Hinnant switch (__len) 45873e519524SHoward Hinnant { 45883e519524SHoward Hinnant case 0: 45893e519524SHoward Hinnant case 1: 45903e519524SHoward Hinnant return; 45913e519524SHoward Hinnant case 2: 45923e519524SHoward Hinnant if (__comp(*--__last, *__first)) 45933e519524SHoward Hinnant swap(*__first, *__last); 45943e519524SHoward Hinnant return; 45953e519524SHoward Hinnant } 45963e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 45973e519524SHoward Hinnant { 45983e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 45993e519524SHoward Hinnant return; 46003e519524SHoward Hinnant } 46013e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46023e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46033e519524SHoward Hinnant if (__len <= __buff_size) 46043e519524SHoward Hinnant { 46053e519524SHoward Hinnant __destruct_n __d(0); 46063e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46073e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46083e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46093e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46103e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46113e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46123e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46133e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46143e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46153e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46163e519524SHoward Hinnant// __first, __comp); 46173e519524SHoward Hinnant return; 46183e519524SHoward Hinnant } 46193e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46203e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46213e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46223e519524SHoward Hinnant} 46233e519524SHoward Hinnant 46243e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46263e519524SHoward Hinnantvoid 46273e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46283e519524SHoward Hinnant{ 46293e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46313e519524SHoward Hinnant difference_type __len = __last - __first; 46323e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 46333e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 46343e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46353e519524SHoward Hinnant { 4636ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 46373e519524SHoward Hinnant __h.reset(__buf.first); 46383e519524SHoward Hinnant } 4639f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 46403e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46413e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46423e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4643f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 46443e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46453e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4646f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46473e519524SHoward Hinnant} 46483e519524SHoward Hinnant 46493e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46513e519524SHoward Hinnantvoid 46523e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 46533e519524SHoward Hinnant{ 4654ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46553e519524SHoward Hinnant} 46563e519524SHoward Hinnant 46573e519524SHoward Hinnant// is_heap_until 46583e519524SHoward Hinnant 46593e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46603e519524SHoward Hinnant_RandomAccessIterator 46613e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46623e519524SHoward Hinnant{ 4663ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46643e519524SHoward Hinnant difference_type __len = __last - __first; 46653e519524SHoward Hinnant difference_type __p = 0; 46663e519524SHoward Hinnant difference_type __c = 1; 46673e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 46683e519524SHoward Hinnant while (__c < __len) 46693e519524SHoward Hinnant { 46703e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 46713e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 46723e519524SHoward Hinnant return __cp; 46733e519524SHoward Hinnant ++__c; 46743e519524SHoward Hinnant ++__cp; 46753e519524SHoward Hinnant if (__c == __len) 46763e519524SHoward Hinnant return __last; 46773e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 46783e519524SHoward Hinnant return __cp; 46793e519524SHoward Hinnant ++__p; 46803e519524SHoward Hinnant ++__pp; 46813e519524SHoward Hinnant __c = 2 * __p + 1; 46823e519524SHoward Hinnant } 46833e519524SHoward Hinnant return __last; 46843e519524SHoward Hinnant} 46853e519524SHoward Hinnant 46863e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 46873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46883e519524SHoward Hinnant_RandomAccessIterator 46893e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 46903e519524SHoward Hinnant{ 4691ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46923e519524SHoward Hinnant} 46933e519524SHoward Hinnant 46943e519524SHoward Hinnant// is_heap 46953e519524SHoward Hinnant 46963e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46983e519524SHoward Hinnantbool 46993e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47003e519524SHoward Hinnant{ 4701ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47023e519524SHoward Hinnant} 47033e519524SHoward Hinnant 47043e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47063e519524SHoward Hinnantbool 47073e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47083e519524SHoward Hinnant{ 4709ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47103e519524SHoward Hinnant} 47113e519524SHoward Hinnant 47123e519524SHoward Hinnant// push_heap 47133e519524SHoward Hinnant 47143e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47153e519524SHoward Hinnantvoid 47163e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 47173e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47183e519524SHoward Hinnant{ 47193e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47203e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47213e519524SHoward Hinnant if (__len > 1) 47223e519524SHoward Hinnant { 47233e519524SHoward Hinnant difference_type __p = 0; 47243e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47253e519524SHoward Hinnant difference_type __c = 2; 47263e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47273e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47283e519524SHoward Hinnant { 47293e519524SHoward Hinnant --__c; 47303e519524SHoward Hinnant --__cp; 47313e519524SHoward Hinnant } 47323e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47333e519524SHoward Hinnant { 4734ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__pp)); 47353e519524SHoward Hinnant do 47363e519524SHoward Hinnant { 4737ce48a113SHoward Hinnant *__pp = _VSTD::move(*__cp); 47383e519524SHoward Hinnant __pp = __cp; 47393e519524SHoward Hinnant __p = __c; 47403e519524SHoward Hinnant __c = (__p + 1) * 2; 47413e519524SHoward Hinnant if (__c > __len) 47423e519524SHoward Hinnant break; 47433e519524SHoward Hinnant __cp = __first + __c; 47443e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47453e519524SHoward Hinnant { 47463e519524SHoward Hinnant --__c; 47473e519524SHoward Hinnant --__cp; 47483e519524SHoward Hinnant } 47493e519524SHoward Hinnant } while (__comp(__t, *__cp)); 4750ce48a113SHoward Hinnant *__pp = _VSTD::move(__t); 47513e519524SHoward Hinnant } 47523e519524SHoward Hinnant } 47533e519524SHoward Hinnant} 47543e519524SHoward Hinnant 47553e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47563e519524SHoward Hinnantvoid 47573e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47583e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47593e519524SHoward Hinnant{ 47603e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47613e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47623e519524SHoward Hinnant if (__len > 1) 47633e519524SHoward Hinnant { 47643e519524SHoward Hinnant __len = (__len - 2) / 2; 47653e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 47663e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 47673e519524SHoward Hinnant { 4768ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 47693e519524SHoward Hinnant do 47703e519524SHoward Hinnant { 4771ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 47723e519524SHoward Hinnant __last = __ptr; 47733e519524SHoward Hinnant if (__len == 0) 47743e519524SHoward Hinnant break; 47753e519524SHoward Hinnant __len = (__len - 1) / 2; 47763e519524SHoward Hinnant __ptr = __first + __len; 47773e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4778ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 47793e519524SHoward Hinnant } 47803e519524SHoward Hinnant } 47813e519524SHoward Hinnant} 47823e519524SHoward Hinnant 47833e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47853e519524SHoward Hinnantvoid 47863e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47873e519524SHoward Hinnant{ 4788f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 47893e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47903e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47913e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4792f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 47933e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47943e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4795f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 47963e519524SHoward Hinnant} 47973e519524SHoward Hinnant 47983e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48003e519524SHoward Hinnantvoid 48013e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48023e519524SHoward Hinnant{ 4803ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48043e519524SHoward Hinnant} 48053e519524SHoward Hinnant 48063e519524SHoward Hinnant// pop_heap 48073e519524SHoward Hinnant 48083e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48103e519524SHoward Hinnantvoid 48113e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48123e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48133e519524SHoward Hinnant{ 48143e519524SHoward Hinnant if (__len > 1) 48153e519524SHoward Hinnant { 48163e519524SHoward Hinnant swap(*__first, *--__last); 48173e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 48183e519524SHoward Hinnant } 48193e519524SHoward Hinnant} 48203e519524SHoward Hinnant 48213e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48233e519524SHoward Hinnantvoid 48243e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48253e519524SHoward Hinnant{ 4826f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 48273e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48283e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48293e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4830f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 48313e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48323e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4833f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 48343e519524SHoward Hinnant} 48353e519524SHoward Hinnant 48363e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48383e519524SHoward Hinnantvoid 48393e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48403e519524SHoward Hinnant{ 4841ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48423e519524SHoward Hinnant} 48433e519524SHoward Hinnant 48443e519524SHoward Hinnant// make_heap 48453e519524SHoward Hinnant 48463e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48473e519524SHoward Hinnantvoid 48483e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48493e519524SHoward Hinnant{ 48503e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48513e519524SHoward Hinnant difference_type __n = __last - __first; 48523e519524SHoward Hinnant if (__n > 1) 48533e519524SHoward Hinnant { 48543e519524SHoward Hinnant __last = __first; 48553e519524SHoward Hinnant ++__last; 48563e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 48573e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 48583e519524SHoward Hinnant } 48593e519524SHoward Hinnant} 48603e519524SHoward Hinnant 48613e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48633e519524SHoward Hinnantvoid 48643e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48653e519524SHoward Hinnant{ 4866f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 48673e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48683e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48693e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4870f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 48713e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48723e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4873f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 48743e519524SHoward Hinnant} 48753e519524SHoward Hinnant 48763e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48783e519524SHoward Hinnantvoid 48793e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48803e519524SHoward Hinnant{ 4881ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48823e519524SHoward Hinnant} 48833e519524SHoward Hinnant 48843e519524SHoward Hinnant// sort_heap 48853e519524SHoward Hinnant 48863e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48873e519524SHoward Hinnantvoid 48883e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48893e519524SHoward Hinnant{ 48903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48913e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 48923e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 48933e519524SHoward Hinnant} 48943e519524SHoward Hinnant 48953e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48973e519524SHoward Hinnantvoid 48983e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48993e519524SHoward Hinnant{ 4900f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49013e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49023e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49033e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4904f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49053e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49063e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4907f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49083e519524SHoward Hinnant} 49093e519524SHoward Hinnant 49103e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49123e519524SHoward Hinnantvoid 49133e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49143e519524SHoward Hinnant{ 4915ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49163e519524SHoward Hinnant} 49173e519524SHoward Hinnant 49183e519524SHoward Hinnant// partial_sort 49193e519524SHoward Hinnant 49203e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49213e519524SHoward Hinnantvoid 49223e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49233e519524SHoward Hinnant _Compare __comp) 49243e519524SHoward Hinnant{ 49253e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49263e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49273e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49283e519524SHoward Hinnant { 49293e519524SHoward Hinnant if (__comp(*__i, *__first)) 49303e519524SHoward Hinnant { 49313e519524SHoward Hinnant swap(*__i, *__first); 49323e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 49333e519524SHoward Hinnant } 49343e519524SHoward Hinnant } 49353e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 49363e519524SHoward Hinnant} 49373e519524SHoward Hinnant 49383e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49403e519524SHoward Hinnantvoid 49413e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49423e519524SHoward Hinnant _Compare __comp) 49433e519524SHoward Hinnant{ 4944f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49473e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 4948f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49503e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 4951f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49523e519524SHoward Hinnant} 49533e519524SHoward Hinnant 49543e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49563e519524SHoward Hinnantvoid 49573e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 49583e519524SHoward Hinnant{ 4959ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 49603e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49613e519524SHoward Hinnant} 49623e519524SHoward Hinnant 49633e519524SHoward Hinnant// partial_sort_copy 49643e519524SHoward Hinnant 49653e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 49663e519524SHoward Hinnant_RandomAccessIterator 49673e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 49683e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 49693e519524SHoward Hinnant{ 49703e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 49713e519524SHoward Hinnant if (__r != __result_last) 49723e519524SHoward Hinnant { 49733e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 49743e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 49753e519524SHoward Hinnant *__r = *__first; 49763e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 49773e519524SHoward Hinnant for (; __first != __last; ++__first) 49783e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 49793e519524SHoward Hinnant { 49803e519524SHoward Hinnant *__result_first = *__first; 49813e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 49823e519524SHoward Hinnant } 49833e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 49843e519524SHoward Hinnant } 49853e519524SHoward Hinnant return __r; 49863e519524SHoward Hinnant} 49873e519524SHoward Hinnant 49883e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 49893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49903e519524SHoward Hinnant_RandomAccessIterator 49913e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 49923e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 49933e519524SHoward Hinnant{ 4994f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49953e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49963e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49973e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 4998f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50003e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5001f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 50023e519524SHoward Hinnant} 50033e519524SHoward Hinnant 50043e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50063e519524SHoward Hinnant_RandomAccessIterator 50073e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50083e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50093e519524SHoward Hinnant{ 5010ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50113e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50123e519524SHoward Hinnant} 50133e519524SHoward Hinnant 50143e519524SHoward Hinnant// nth_element 50153e519524SHoward Hinnant 50163e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50173e519524SHoward Hinnantvoid 50183e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50193e519524SHoward Hinnant{ 50203e519524SHoward Hinnant // _Compare is known to be a reference type 50213e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50223e519524SHoward Hinnant const difference_type __limit = 7; 50233e519524SHoward Hinnant while (true) 50243e519524SHoward Hinnant { 50253e519524SHoward Hinnant __restart: 5026b34b4819SHoward Hinnant if (__nth == __last) 5027b34b4819SHoward Hinnant return; 50283e519524SHoward Hinnant difference_type __len = __last - __first; 50293e519524SHoward Hinnant switch (__len) 50303e519524SHoward Hinnant { 50313e519524SHoward Hinnant case 0: 50323e519524SHoward Hinnant case 1: 50333e519524SHoward Hinnant return; 50343e519524SHoward Hinnant case 2: 50353e519524SHoward Hinnant if (__comp(*--__last, *__first)) 50363e519524SHoward Hinnant swap(*__first, *__last); 50373e519524SHoward Hinnant return; 50383e519524SHoward Hinnant case 3: 50393e519524SHoward Hinnant { 50403e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5041ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 50423e519524SHoward Hinnant return; 50433e519524SHoward Hinnant } 50443e519524SHoward Hinnant } 50453e519524SHoward Hinnant if (__len <= __limit) 50463e519524SHoward Hinnant { 50473e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 50483e519524SHoward Hinnant return; 50493e519524SHoward Hinnant } 50503e519524SHoward Hinnant // __len > __limit >= 3 50513e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 50523e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5053ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 50543e519524SHoward Hinnant // *__m is median 50553e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 50563e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 50573e519524SHoward Hinnant _RandomAccessIterator __i = __first; 50583e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 50593e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 50603e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 50613e519524SHoward Hinnant // Prime the downward search with a guard. 50623e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 50633e519524SHoward Hinnant { 50643e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 50653e519524SHoward Hinnant // manually guard downward moving __j against __i 50663e519524SHoward Hinnant while (true) 50673e519524SHoward Hinnant { 50683e519524SHoward Hinnant if (__i == --__j) 50693e519524SHoward Hinnant { 50703e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 50713e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 50723e519524SHoward Hinnant ++__i; // __first + 1 50733e519524SHoward Hinnant __j = __last; 50743e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 50753e519524SHoward Hinnant { 50763e519524SHoward Hinnant while (true) 50773e519524SHoward Hinnant { 50783e519524SHoward Hinnant if (__i == __j) 50793e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 50803e519524SHoward Hinnant if (__comp(*__first, *__i)) 50813e519524SHoward Hinnant { 50823e519524SHoward Hinnant swap(*__i, *__j); 50833e519524SHoward Hinnant ++__n_swaps; 50843e519524SHoward Hinnant ++__i; 50853e519524SHoward Hinnant break; 50863e519524SHoward Hinnant } 50873e519524SHoward Hinnant ++__i; 50883e519524SHoward Hinnant } 50893e519524SHoward Hinnant } 50903e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 50913e519524SHoward Hinnant if (__i == __j) 50923e519524SHoward Hinnant return; 50933e519524SHoward Hinnant while (true) 50943e519524SHoward Hinnant { 50953e519524SHoward Hinnant while (!__comp(*__first, *__i)) 50963e519524SHoward Hinnant ++__i; 50973e519524SHoward Hinnant while (__comp(*__first, *--__j)) 50983e519524SHoward Hinnant ; 50993e519524SHoward Hinnant if (__i >= __j) 51003e519524SHoward Hinnant break; 51013e519524SHoward Hinnant swap(*__i, *__j); 51023e519524SHoward Hinnant ++__n_swaps; 51033e519524SHoward Hinnant ++__i; 51043e519524SHoward Hinnant } 51053e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51063e519524SHoward Hinnant // The first part is sorted, 51073e519524SHoward Hinnant if (__nth < __i) 51083e519524SHoward Hinnant return; 51093e519524SHoward Hinnant // __nth_element the secod part 51103e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51113e519524SHoward Hinnant __first = __i; 51123e519524SHoward Hinnant goto __restart; 51133e519524SHoward Hinnant } 51143e519524SHoward Hinnant if (__comp(*__j, *__m)) 51153e519524SHoward Hinnant { 51163e519524SHoward Hinnant swap(*__i, *__j); 51173e519524SHoward Hinnant ++__n_swaps; 51183e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51193e519524SHoward Hinnant } 51203e519524SHoward Hinnant } 51213e519524SHoward Hinnant } 51223e519524SHoward Hinnant ++__i; 51233e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51243e519524SHoward Hinnant // if not yet partitioned... 51253e519524SHoward Hinnant if (__i < __j) 51263e519524SHoward Hinnant { 51273e519524SHoward Hinnant // known that *(__i - 1) < *__m 51283e519524SHoward Hinnant while (true) 51293e519524SHoward Hinnant { 51303e519524SHoward Hinnant // __m still guards upward moving __i 51313e519524SHoward Hinnant while (__comp(*__i, *__m)) 51323e519524SHoward Hinnant ++__i; 51333e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 51343e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 51353e519524SHoward Hinnant ; 51363e519524SHoward Hinnant if (__i >= __j) 51373e519524SHoward Hinnant break; 51383e519524SHoward Hinnant swap(*__i, *__j); 51393e519524SHoward Hinnant ++__n_swaps; 51403e519524SHoward Hinnant // It is known that __m != __j 51413e519524SHoward Hinnant // If __m just moved, follow it 51423e519524SHoward Hinnant if (__m == __i) 51433e519524SHoward Hinnant __m = __j; 51443e519524SHoward Hinnant ++__i; 51453e519524SHoward Hinnant } 51463e519524SHoward Hinnant } 51473e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 51483e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 51493e519524SHoward Hinnant { 51503e519524SHoward Hinnant swap(*__i, *__m); 51513e519524SHoward Hinnant ++__n_swaps; 51523e519524SHoward Hinnant } 51533e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 51543e519524SHoward Hinnant if (__nth == __i) 51553e519524SHoward Hinnant return; 51563e519524SHoward Hinnant if (__n_swaps == 0) 51573e519524SHoward Hinnant { 51583e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 51593e519524SHoward Hinnant if (__nth < __i) 51603e519524SHoward Hinnant { 51613e519524SHoward Hinnant // Check for [__first, __i) already sorted 51623e519524SHoward Hinnant __j = __m = __first; 51633e519524SHoward Hinnant while (++__j != __i) 51643e519524SHoward Hinnant { 51653e519524SHoward Hinnant if (__comp(*__j, *__m)) 51663e519524SHoward Hinnant // not yet sorted, so sort 51673e519524SHoward Hinnant goto not_sorted; 51683e519524SHoward Hinnant __m = __j; 51693e519524SHoward Hinnant } 51703e519524SHoward Hinnant // [__first, __i) sorted 51713e519524SHoward Hinnant return; 51723e519524SHoward Hinnant } 51733e519524SHoward Hinnant else 51743e519524SHoward Hinnant { 51753e519524SHoward Hinnant // Check for [__i, __last) already sorted 51763e519524SHoward Hinnant __j = __m = __i; 51773e519524SHoward Hinnant while (++__j != __last) 51783e519524SHoward Hinnant { 51793e519524SHoward Hinnant if (__comp(*__j, *__m)) 51803e519524SHoward Hinnant // not yet sorted, so sort 51813e519524SHoward Hinnant goto not_sorted; 51823e519524SHoward Hinnant __m = __j; 51833e519524SHoward Hinnant } 51843e519524SHoward Hinnant // [__i, __last) sorted 51853e519524SHoward Hinnant return; 51863e519524SHoward Hinnant } 51873e519524SHoward Hinnant } 51883e519524SHoward Hinnantnot_sorted: 51893e519524SHoward Hinnant // __nth_element on range containing __nth 51903e519524SHoward Hinnant if (__nth < __i) 51913e519524SHoward Hinnant { 51923e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 51933e519524SHoward Hinnant __last = __i; 51943e519524SHoward Hinnant } 51953e519524SHoward Hinnant else 51963e519524SHoward Hinnant { 51973e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 51983e519524SHoward Hinnant __first = ++__i; 51993e519524SHoward Hinnant } 52003e519524SHoward Hinnant } 52013e519524SHoward Hinnant} 52023e519524SHoward Hinnant 52033e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52053e519524SHoward Hinnantvoid 52063e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52073e519524SHoward Hinnant{ 5208f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52093e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52103e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52113e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5212f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52133e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52143e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5215f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52163e519524SHoward Hinnant} 52173e519524SHoward Hinnant 52183e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52203e519524SHoward Hinnantvoid 52213e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52223e519524SHoward Hinnant{ 5223ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52243e519524SHoward Hinnant} 52253e519524SHoward Hinnant 52263e519524SHoward Hinnant// includes 52273e519524SHoward Hinnant 52283e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52293e519524SHoward Hinnantbool 52303e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52313e519524SHoward Hinnant _Compare __comp) 52323e519524SHoward Hinnant{ 52333e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 52343e519524SHoward Hinnant { 52353e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 52363e519524SHoward Hinnant return false; 52373e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 52383e519524SHoward Hinnant ++__first2; 52393e519524SHoward Hinnant } 52403e519524SHoward Hinnant return true; 52413e519524SHoward Hinnant} 52423e519524SHoward Hinnant 52433e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 52443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52453e519524SHoward Hinnantbool 52463e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52473e519524SHoward Hinnant _Compare __comp) 52483e519524SHoward Hinnant{ 5249f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52503e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52513e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52523e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5253f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52543e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52553e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5256f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52573e519524SHoward Hinnant} 52583e519524SHoward Hinnant 52593e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 52603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52613e519524SHoward Hinnantbool 52623e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 52633e519524SHoward Hinnant{ 5264ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 52653e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 52663e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 52673e519524SHoward Hinnant} 52683e519524SHoward Hinnant 52693e519524SHoward Hinnant// set_union 52703e519524SHoward Hinnant 52713e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 52723e519524SHoward Hinnant_OutputIterator 52733e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 52743e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 52753e519524SHoward Hinnant{ 52763e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 52773e519524SHoward Hinnant { 52783e519524SHoward Hinnant if (__first2 == __last2) 5279ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 52803e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 52813e519524SHoward Hinnant { 52823e519524SHoward Hinnant *__result = *__first2; 52833e519524SHoward Hinnant ++__first2; 52843e519524SHoward Hinnant } 52853e519524SHoward Hinnant else 52863e519524SHoward Hinnant { 52873e519524SHoward Hinnant *__result = *__first1; 52883e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 52893e519524SHoward Hinnant ++__first2; 52903e519524SHoward Hinnant ++__first1; 52913e519524SHoward Hinnant } 52923e519524SHoward Hinnant } 5293ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 52943e519524SHoward Hinnant} 52953e519524SHoward Hinnant 52963e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 52973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52983e519524SHoward Hinnant_OutputIterator 52993e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53003e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53013e519524SHoward Hinnant{ 5302f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53033e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53043e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53053e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5306f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53073e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53083e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5309f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53103e519524SHoward Hinnant} 53113e519524SHoward Hinnant 53123e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53143e519524SHoward Hinnant_OutputIterator 53153e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53163e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53173e519524SHoward Hinnant{ 5318ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53193e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53203e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53213e519524SHoward Hinnant} 53223e519524SHoward Hinnant 53233e519524SHoward Hinnant// set_intersection 53243e519524SHoward Hinnant 53253e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53263e519524SHoward Hinnant_OutputIterator 53273e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53283e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53293e519524SHoward Hinnant{ 53303e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 53313e519524SHoward Hinnant { 53323e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53333e519524SHoward Hinnant ++__first1; 53343e519524SHoward Hinnant else 53353e519524SHoward Hinnant { 53363e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 53373e519524SHoward Hinnant { 53383e519524SHoward Hinnant *__result = *__first1; 53393e519524SHoward Hinnant ++__result; 53403e519524SHoward Hinnant ++__first1; 53413e519524SHoward Hinnant } 53423e519524SHoward Hinnant ++__first2; 53433e519524SHoward Hinnant } 53443e519524SHoward Hinnant } 53453e519524SHoward Hinnant return __result; 53463e519524SHoward Hinnant} 53473e519524SHoward Hinnant 53483e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53503e519524SHoward Hinnant_OutputIterator 53513e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53523e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53533e519524SHoward Hinnant{ 5354f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53553e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53563e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53573e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5358f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53593e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53603e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5361f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53623e519524SHoward Hinnant} 53633e519524SHoward Hinnant 53643e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53663e519524SHoward Hinnant_OutputIterator 53673e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53683e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53693e519524SHoward Hinnant{ 5370ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 53713e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53723e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53733e519524SHoward Hinnant} 53743e519524SHoward Hinnant 53753e519524SHoward Hinnant// set_difference 53763e519524SHoward Hinnant 53773e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53783e519524SHoward Hinnant_OutputIterator 53793e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 53803e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53813e519524SHoward Hinnant{ 53823e519524SHoward Hinnant while (__first1 != __last1) 53833e519524SHoward Hinnant { 53843e519524SHoward Hinnant if (__first2 == __last2) 5385ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53863e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53873e519524SHoward Hinnant { 53883e519524SHoward Hinnant *__result = *__first1; 53893e519524SHoward Hinnant ++__result; 53903e519524SHoward Hinnant ++__first1; 53913e519524SHoward Hinnant } 53923e519524SHoward Hinnant else 53933e519524SHoward Hinnant { 53943e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 53953e519524SHoward Hinnant ++__first1; 53963e519524SHoward Hinnant ++__first2; 53973e519524SHoward Hinnant } 53983e519524SHoward Hinnant } 53993e519524SHoward Hinnant return __result; 54003e519524SHoward Hinnant} 54013e519524SHoward Hinnant 54023e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54043e519524SHoward Hinnant_OutputIterator 54053e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54063e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54073e519524SHoward Hinnant{ 5408f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 54093e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54103e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54113e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5412f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 54133e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54143e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5415f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 54163e519524SHoward Hinnant} 54173e519524SHoward Hinnant 54183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54203e519524SHoward Hinnant_OutputIterator 54213e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54223e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54233e519524SHoward Hinnant{ 5424ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54253e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54263e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54273e519524SHoward Hinnant} 54283e519524SHoward Hinnant 54293e519524SHoward Hinnant// set_symmetric_difference 54303e519524SHoward Hinnant 54313e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54323e519524SHoward Hinnant_OutputIterator 54333e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54343e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54353e519524SHoward Hinnant{ 54363e519524SHoward Hinnant while (__first1 != __last1) 54373e519524SHoward Hinnant { 54383e519524SHoward Hinnant if (__first2 == __last2) 5439ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54403e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54413e519524SHoward Hinnant { 54423e519524SHoward Hinnant *__result = *__first1; 54433e519524SHoward Hinnant ++__result; 54443e519524SHoward Hinnant ++__first1; 54453e519524SHoward Hinnant } 54463e519524SHoward Hinnant else 54473e519524SHoward Hinnant { 54483e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54493e519524SHoward Hinnant { 54503e519524SHoward Hinnant *__result = *__first2; 54513e519524SHoward Hinnant ++__result; 54523e519524SHoward Hinnant } 54533e519524SHoward Hinnant else 54543e519524SHoward Hinnant ++__first1; 54553e519524SHoward Hinnant ++__first2; 54563e519524SHoward Hinnant } 54573e519524SHoward Hinnant } 5458ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54593e519524SHoward Hinnant} 54603e519524SHoward Hinnant 54613e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54633e519524SHoward Hinnant_OutputIterator 54643e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54663e519524SHoward Hinnant{ 5467f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 54683e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54693e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54703e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5471f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 54723e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54733e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5474f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 54753e519524SHoward Hinnant} 54763e519524SHoward Hinnant 54773e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54793e519524SHoward Hinnant_OutputIterator 54803e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54813e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54823e519524SHoward Hinnant{ 5483ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 54843e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54853e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54863e519524SHoward Hinnant} 54873e519524SHoward Hinnant 54883e519524SHoward Hinnant// lexicographical_compare 54893e519524SHoward Hinnant 54903e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54913e519524SHoward Hinnantbool 54923e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 54933e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 54943e519524SHoward Hinnant{ 54953e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 54963e519524SHoward Hinnant { 54973e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 54983e519524SHoward Hinnant return true; 54993e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55003e519524SHoward Hinnant return false; 55013e519524SHoward Hinnant } 55023e519524SHoward Hinnant return false; 55033e519524SHoward Hinnant} 55043e519524SHoward Hinnant 55053e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55073e519524SHoward Hinnantbool 55083e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55093e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55103e519524SHoward Hinnant{ 5511f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 55123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55143e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5515f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 55163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55173e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5518f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 55193e519524SHoward Hinnant} 55203e519524SHoward Hinnant 55213e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55233e519524SHoward Hinnantbool 55243e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55263e519524SHoward Hinnant{ 5527ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55283e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55293e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55303e519524SHoward Hinnant} 55313e519524SHoward Hinnant 55323e519524SHoward Hinnant// next_permutation 55333e519524SHoward Hinnant 55343e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55353e519524SHoward Hinnantbool 55363e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55373e519524SHoward Hinnant{ 55383e519524SHoward Hinnant _BidirectionalIterator __i = __last; 55393e519524SHoward Hinnant if (__first == __last || __first == --__i) 55403e519524SHoward Hinnant return false; 55413e519524SHoward Hinnant while (true) 55423e519524SHoward Hinnant { 55433e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 55443e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 55453e519524SHoward Hinnant { 55463e519524SHoward Hinnant _BidirectionalIterator __j = __last; 55473e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 55483e519524SHoward Hinnant ; 55493e519524SHoward Hinnant swap(*__i, *__j); 5550ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 55513e519524SHoward Hinnant return true; 55523e519524SHoward Hinnant } 55533e519524SHoward Hinnant if (__i == __first) 55543e519524SHoward Hinnant { 5555ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 55563e519524SHoward Hinnant return false; 55573e519524SHoward Hinnant } 55583e519524SHoward Hinnant } 55593e519524SHoward Hinnant} 55603e519524SHoward Hinnant 55613e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 55623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55633e519524SHoward Hinnantbool 55643e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55653e519524SHoward Hinnant{ 5566f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 55673e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55683e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55693e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5570f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 55713e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55723e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5573f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 55743e519524SHoward Hinnant} 55753e519524SHoward Hinnant 55763e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 55773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55783e519524SHoward Hinnantbool 55793e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 55803e519524SHoward Hinnant{ 5581ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 55823e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 55833e519524SHoward Hinnant} 55843e519524SHoward Hinnant 55853e519524SHoward Hinnant// prev_permutation 55863e519524SHoward Hinnant 55873e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55883e519524SHoward Hinnantbool 55893e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55903e519524SHoward Hinnant{ 55913e519524SHoward Hinnant _BidirectionalIterator __i = __last; 55923e519524SHoward Hinnant if (__first == __last || __first == --__i) 55933e519524SHoward Hinnant return false; 55943e519524SHoward Hinnant while (true) 55953e519524SHoward Hinnant { 55963e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 55973e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 55983e519524SHoward Hinnant { 55993e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56003e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56013e519524SHoward Hinnant ; 56023e519524SHoward Hinnant swap(*__i, *__j); 5603ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56043e519524SHoward Hinnant return true; 56053e519524SHoward Hinnant } 56063e519524SHoward Hinnant if (__i == __first) 56073e519524SHoward Hinnant { 5608ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56093e519524SHoward Hinnant return false; 56103e519524SHoward Hinnant } 56113e519524SHoward Hinnant } 56123e519524SHoward Hinnant} 56133e519524SHoward Hinnant 56143e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56163e519524SHoward Hinnantbool 56173e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56183e519524SHoward Hinnant{ 5619f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 56203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56223e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5623f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 56243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56253e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5626f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 56273e519524SHoward Hinnant} 56283e519524SHoward Hinnant 56293e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56313e519524SHoward Hinnantbool 56323e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56333e519524SHoward Hinnant{ 5634ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 56353e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56363e519524SHoward Hinnant} 56373e519524SHoward Hinnant 56383e519524SHoward Hinnanttemplate <class _Tp> 56393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56403e519524SHoward Hinnanttypename enable_if 56413e519524SHoward Hinnant< 56423e519524SHoward Hinnant is_integral<_Tp>::value, 56433e519524SHoward Hinnant _Tp 56443e519524SHoward Hinnant>::type 56453e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 56463e519524SHoward Hinnant{ 56473e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 56483e519524SHoward Hinnant __n &= __bits; 56493e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 56503e519524SHoward Hinnant} 56513e519524SHoward Hinnant 56523e519524SHoward Hinnanttemplate <class _Tp> 56533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56543e519524SHoward Hinnanttypename enable_if 56553e519524SHoward Hinnant< 56563e519524SHoward Hinnant is_integral<_Tp>::value, 56573e519524SHoward Hinnant _Tp 56583e519524SHoward Hinnant>::type 56593e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 56603e519524SHoward Hinnant{ 56613e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 56623e519524SHoward Hinnant __n &= __bits; 56633e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 56643e519524SHoward Hinnant} 56653e519524SHoward Hinnant 56663e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 56673e519524SHoward Hinnant 56683e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5669