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 903e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 913e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 923e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 933e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 943e519524SHoward Hinnant 953e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 963e519524SHoward Hinnant bool 973e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 983e519524SHoward Hinnant 993e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1003e519524SHoward Hinnant bool 1013e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1023e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1033e519524SHoward Hinnant 1043e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 1053e519524SHoward Hinnant bool 1063e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1073e519524SHoward Hinnant ForwardIterator2 first2); 1083e519524SHoward Hinnant 1093e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1103e519524SHoward Hinnant bool 1113e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1123e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1133e519524SHoward Hinnant 1143e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1153e519524SHoward Hinnant ForwardIterator1 1163e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1173e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1183e519524SHoward Hinnant 1193e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1203e519524SHoward Hinnant ForwardIterator1 1213e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1223e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1233e519524SHoward Hinnant 1243e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 1253e519524SHoward Hinnant ForwardIterator 1263e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1273e519524SHoward Hinnant 1283e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 1293e519524SHoward Hinnant ForwardIterator 1303e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1313e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1323e519524SHoward Hinnant 1333e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1343e519524SHoward Hinnant OutputIterator 1353e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1363e519524SHoward Hinnant 1373e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1383e519524SHoward Hinnant OutputIterator 1393e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1403e519524SHoward Hinnant OutputIterator result, Predicate pred); 1413e519524SHoward Hinnant 1423e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1433e519524SHoward Hinnant OutputIterator 1443e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1453e519524SHoward Hinnant 1463e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1473e519524SHoward Hinnant BidirectionalIterator2 1483e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1493e519524SHoward Hinnant BidirectionalIterator2 result); 1503e519524SHoward Hinnant 1513e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1523e519524SHoward Hinnant ForwardIterator2 1533e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1543e519524SHoward Hinnant 1553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1563e519524SHoward Hinnant void 1573e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1583e519524SHoward Hinnant 1593e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 1603e519524SHoward Hinnant OutputIterator 1613e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1623e519524SHoward Hinnant 1633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 1643e519524SHoward Hinnant OutputIterator 1653e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 1663e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 1673e519524SHoward Hinnant 1683e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 1693e519524SHoward Hinnant void 1703e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 1713e519524SHoward Hinnant 1723e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 1733e519524SHoward Hinnant void 1743e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 1753e519524SHoward Hinnant 1763e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 1773e519524SHoward Hinnant OutputIterator 1783e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 1793e519524SHoward Hinnant const T& old_value, const T& new_value); 1803e519524SHoward Hinnant 1813e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 1823e519524SHoward Hinnant OutputIterator 1833e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 1843e519524SHoward Hinnant 1853e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 1863e519524SHoward Hinnant void 1873e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 1883e519524SHoward Hinnant 1893e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 1903e519524SHoward Hinnant OutputIterator 1913e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 1923e519524SHoward Hinnant 1933e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 1943e519524SHoward Hinnant void 1953e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 1963e519524SHoward Hinnant 1973e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 1983e519524SHoward Hinnant OutputIterator 1993e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2023e519524SHoward Hinnant ForwardIterator 2033e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2063e519524SHoward Hinnant ForwardIterator 2073e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2103e519524SHoward Hinnant OutputIterator 2113e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2123e519524SHoward Hinnant 2133e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 2143e519524SHoward Hinnant OutputIterator 2153e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2163e519524SHoward Hinnant 2173e519524SHoward Hinnanttemplate <class ForwardIterator> 2183e519524SHoward Hinnant ForwardIterator 2193e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2203e519524SHoward Hinnant 2213e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2223e519524SHoward Hinnant ForwardIterator 2233e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2243e519524SHoward Hinnant 2253e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2263e519524SHoward Hinnant OutputIterator 2273e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2283e519524SHoward Hinnant 2293e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2303e519524SHoward Hinnant OutputIterator 2313e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2323e519524SHoward Hinnant 2333e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2343e519524SHoward Hinnant void 2353e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2363e519524SHoward Hinnant 2373e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 2383e519524SHoward Hinnant OutputIterator 2393e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2403e519524SHoward Hinnant 2413e519524SHoward Hinnanttemplate <class ForwardIterator> 2423e519524SHoward Hinnant ForwardIterator 2433e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2443e519524SHoward Hinnant 2453e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2463e519524SHoward Hinnant OutputIterator 2473e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2483e519524SHoward Hinnant 2493e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2503e519524SHoward Hinnant void 2513e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last); 2523e519524SHoward Hinnant 2533e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2543e519524SHoward Hinnant void 2553e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator& rand); 2563e519524SHoward Hinnant 257f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 258f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 259fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 260f9d540b0SHoward Hinnant 2613e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2623e519524SHoward Hinnant bool 2633e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2643e519524SHoward Hinnant 2653e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2663e519524SHoward Hinnant ForwardIterator 2673e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 2683e519524SHoward Hinnant 2693e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 2703e519524SHoward Hinnant class OutputIterator2, class Predicate> 2713e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 2723e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 2733e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 2743e519524SHoward Hinnant Predicate pred); 2753e519524SHoward Hinnant 2763e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2773e519524SHoward Hinnant ForwardIterator 2783e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 2793e519524SHoward Hinnant 2803e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 2813e519524SHoward Hinnant ForwardIterator 2823e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 2833e519524SHoward Hinnant 2843e519524SHoward Hinnanttemplate <class ForwardIterator> 2853e519524SHoward Hinnant bool 2863e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 2873e519524SHoward Hinnant 2883e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 2893e519524SHoward Hinnant bool 2903e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 2913e519524SHoward Hinnant 2923e519524SHoward Hinnanttemplate<class ForwardIterator> 2933e519524SHoward Hinnant ForwardIterator 2943e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 2953e519524SHoward Hinnant 2963e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 2973e519524SHoward Hinnant ForwardIterator 2983e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 2993e519524SHoward Hinnant 3003e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3013e519524SHoward Hinnant void 3023e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3033e519524SHoward Hinnant 3043e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3053e519524SHoward Hinnant void 3063e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3073e519524SHoward Hinnant 3083e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3093e519524SHoward Hinnant void 3103e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3113e519524SHoward Hinnant 3123e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3133e519524SHoward Hinnant void 3143e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3153e519524SHoward Hinnant 3163e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3173e519524SHoward Hinnant void 3183e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3193e519524SHoward Hinnant 3203e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3213e519524SHoward Hinnant void 3223e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3233e519524SHoward Hinnant 3243e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3253e519524SHoward Hinnant RandomAccessIterator 3263e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3273e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3283e519524SHoward Hinnant 3293e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3303e519524SHoward Hinnant RandomAccessIterator 3313e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3323e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3353e519524SHoward Hinnant void 3363e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3393e519524SHoward Hinnant void 3403e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3433e519524SHoward Hinnant ForwardIterator 3443e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3473e519524SHoward Hinnant ForwardIterator 3483e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3513e519524SHoward Hinnant ForwardIterator 3523e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3533e519524SHoward Hinnant 3543e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3553e519524SHoward Hinnant ForwardIterator 3563e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3573e519524SHoward Hinnant 3583e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3593e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3603e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3633e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3643e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3653e519524SHoward Hinnant 3663e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3673e519524SHoward Hinnant bool 3683e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 3693e519524SHoward Hinnant 3703e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3713e519524SHoward Hinnant bool 3723e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3733e519524SHoward Hinnant 3743e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 3753e519524SHoward Hinnant OutputIterator 3763e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 3773e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 3803e519524SHoward Hinnant OutputIterator 3813e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 3823e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 3833e519524SHoward Hinnant 3843e519524SHoward Hinnanttemplate <class BidirectionalIterator> 3853e519524SHoward Hinnant void 3863e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 3873e519524SHoward Hinnant 3883e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 3893e519524SHoward Hinnant void 3903e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 3913e519524SHoward Hinnant 3923e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 3933e519524SHoward Hinnant bool 3943e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 3953e519524SHoward Hinnant 3963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 3973e519524SHoward Hinnant bool 3983e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 3993e519524SHoward Hinnant 4003e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4013e519524SHoward Hinnant OutputIterator 4023e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4033e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4043e519524SHoward Hinnant 4053e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4063e519524SHoward Hinnant OutputIterator 4073e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4083e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4093e519524SHoward Hinnant 4103e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4113e519524SHoward Hinnant OutputIterator 4123e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4133e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4143e519524SHoward Hinnant 4153e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4163e519524SHoward Hinnant OutputIterator 4173e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4183e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4193e519524SHoward Hinnant 4203e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4213e519524SHoward Hinnant OutputIterator 4223e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4233e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4243e519524SHoward Hinnant 4253e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4263e519524SHoward Hinnant OutputIterator 4273e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4283e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4293e519524SHoward Hinnant 4303e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4313e519524SHoward Hinnant OutputIterator 4323e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4333e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4343e519524SHoward Hinnant 4353e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4363e519524SHoward Hinnant OutputIterator 4373e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4383e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4393e519524SHoward Hinnant 4403e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4413e519524SHoward Hinnant void 4423e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4433e519524SHoward Hinnant 4443e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4453e519524SHoward Hinnant void 4463e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4493e519524SHoward Hinnant void 4503e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4513e519524SHoward Hinnant 4523e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4533e519524SHoward Hinnant void 4543e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4553e519524SHoward Hinnant 4563e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4573e519524SHoward Hinnant void 4583e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4593e519524SHoward Hinnant 4603e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4613e519524SHoward Hinnant void 4623e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4633e519524SHoward Hinnant 4643e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4653e519524SHoward Hinnant void 4663e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4693e519524SHoward Hinnant void 4703e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4713e519524SHoward Hinnant 4723e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4733e519524SHoward Hinnant bool 4743e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 4753e519524SHoward Hinnant 4763e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4773e519524SHoward Hinnant bool 4783e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 4793e519524SHoward Hinnant 4803e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4813e519524SHoward Hinnant RandomAccessIterator 4823e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 4833e519524SHoward Hinnant 4843e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4853e519524SHoward Hinnant RandomAccessIterator 4863e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 4873e519524SHoward Hinnant 4884eb27b79SHoward Hinnanttemplate <class ForwardIterator> 4894eb27b79SHoward Hinnant ForwardIterator 4904eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 4914eb27b79SHoward Hinnant 4924eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 4934eb27b79SHoward Hinnant ForwardIterator 4944eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 4954eb27b79SHoward Hinnant 4963e519524SHoward Hinnanttemplate <class T> 4973e519524SHoward Hinnant const T& 4983e519524SHoward Hinnant min(const T& a, const T& b); 4993e519524SHoward Hinnant 5003e519524SHoward Hinnanttemplate <class T, class Compare> 5013e519524SHoward Hinnant const T& 5023e519524SHoward Hinnant min(const T& a, const T& b, Compare comp); 5033e519524SHoward Hinnant 5043e519524SHoward Hinnanttemplate<class T> 5054eb27b79SHoward Hinnant T 5064eb27b79SHoward Hinnant min(initializer_list<T> t); 5073e519524SHoward Hinnant 5083e519524SHoward Hinnanttemplate<class T, class Compare> 5094eb27b79SHoward Hinnant T 5104eb27b79SHoward Hinnant min(initializer_list<T> t, Compare comp); 5113e519524SHoward Hinnant 5123e519524SHoward Hinnanttemplate <class ForwardIterator> 5133e519524SHoward Hinnant ForwardIterator 5143e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5153e519524SHoward Hinnant 5163e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5173e519524SHoward Hinnant ForwardIterator 5183e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5193e519524SHoward Hinnant 5204eb27b79SHoward Hinnanttemplate <class T> 5214eb27b79SHoward Hinnant const T& 5224eb27b79SHoward Hinnant max(const T& a, const T& b); 5234eb27b79SHoward Hinnant 5244eb27b79SHoward Hinnanttemplate <class T, class Compare> 5254eb27b79SHoward Hinnant const T& 5264eb27b79SHoward Hinnant max(const T& a, const T& b, Compare comp); 5274eb27b79SHoward Hinnant 5284eb27b79SHoward Hinnanttemplate<class T> 5294eb27b79SHoward Hinnant T 5304eb27b79SHoward Hinnant max(initializer_list<T> t); 5314eb27b79SHoward Hinnant 5324eb27b79SHoward Hinnanttemplate<class T, class Compare> 5334eb27b79SHoward Hinnant T 5344eb27b79SHoward Hinnant max(initializer_list<T> t, Compare comp); 5354eb27b79SHoward Hinnant 5364eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5374eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5384eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last); 5394eb27b79SHoward Hinnant 5404eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5414eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5424eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 5434eb27b79SHoward Hinnant 5444eb27b79SHoward Hinnanttemplate<class T> 5454eb27b79SHoward Hinnant pair<const T&, const T&> 5464eb27b79SHoward Hinnant minmax(const T& a, const T& b); 5474eb27b79SHoward Hinnant 5484eb27b79SHoward Hinnanttemplate<class T, class Compare> 5494eb27b79SHoward Hinnant pair<const T&, const T&> 5504eb27b79SHoward Hinnant minmax(const T& a, const T& b, Compare comp); 5514eb27b79SHoward Hinnant 5524eb27b79SHoward Hinnanttemplate<class T> 5534eb27b79SHoward Hinnant pair<T, T> 5544eb27b79SHoward Hinnant minmax(initializer_list<T> t); 5554eb27b79SHoward Hinnant 5564eb27b79SHoward Hinnanttemplate<class T, class Compare> 5574eb27b79SHoward Hinnant pair<T, T> 5584eb27b79SHoward Hinnant minmax(initializer_list<T> t, Compare comp); 5594eb27b79SHoward Hinnant 5603e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5613e519524SHoward Hinnant bool 5623e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5633e519524SHoward Hinnant 5643e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5653e519524SHoward Hinnant bool 5663e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 5673e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 5683e519524SHoward Hinnant 5693e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5703e519524SHoward Hinnant bool 5713e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 5723e519524SHoward Hinnant 5733e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5743e519524SHoward Hinnant bool 5753e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 5763e519524SHoward Hinnant 5773e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5783e519524SHoward Hinnant bool 5793e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 5803e519524SHoward Hinnant 5813e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5823e519524SHoward Hinnant bool 5833e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 5843e519524SHoward Hinnant 5853e519524SHoward Hinnant} // std 5863e519524SHoward Hinnant 5873e519524SHoward Hinnant*/ 5883e519524SHoward Hinnant 5893e519524SHoward Hinnant#include <__config> 5903e519524SHoward Hinnant#include <initializer_list> 5913e519524SHoward Hinnant#include <type_traits> 5923e519524SHoward Hinnant#include <cstring> 5933e519524SHoward Hinnant#include <utility> 5943e519524SHoward Hinnant#include <memory> 5953e519524SHoward Hinnant#include <iterator> 596128ba719SHoward Hinnant#include <cstdlib> 5973e519524SHoward Hinnant 598ab4f4382SHoward Hinnant#include <__undef_min_max> 599ab4f4382SHoward Hinnant 600073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6013e519524SHoward Hinnant#pragma GCC system_header 602073458b1SHoward Hinnant#endif 6033e519524SHoward Hinnant 6043e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6053e519524SHoward Hinnant 6063e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6073e519524SHoward Hinnantstruct __equal_to 6083e519524SHoward Hinnant{ 6093e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6103e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6113e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6123e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6133e519524SHoward Hinnant}; 6143e519524SHoward Hinnant 6153e519524SHoward Hinnanttemplate <class _T1> 6163e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6173e519524SHoward Hinnant{ 6183e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6193e519524SHoward Hinnant}; 6203e519524SHoward Hinnant 6213e519524SHoward Hinnanttemplate <class _T1> 6223e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6233e519524SHoward Hinnant{ 6243e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6253e519524SHoward Hinnant}; 6263e519524SHoward Hinnant 6273e519524SHoward Hinnanttemplate <class _T1> 6283e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6293e519524SHoward Hinnant{ 6303e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6313e519524SHoward Hinnant}; 6323e519524SHoward Hinnant 6333e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6343e519524SHoward Hinnantstruct __less 6353e519524SHoward Hinnant{ 6363e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6373e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6383e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6393e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6403e519524SHoward Hinnant}; 6413e519524SHoward Hinnant 6423e519524SHoward Hinnanttemplate <class _T1> 6433e519524SHoward Hinnantstruct __less<_T1, _T1> 6443e519524SHoward Hinnant{ 6453e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6463e519524SHoward Hinnant}; 6473e519524SHoward Hinnant 6483e519524SHoward Hinnanttemplate <class _T1> 6493e519524SHoward Hinnantstruct __less<const _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 __less<_T1, const _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 _Predicate> 6613e519524SHoward Hinnantclass __negate 6623e519524SHoward Hinnant{ 6633e519524SHoward Hinnantprivate: 6643e519524SHoward Hinnant _Predicate __p_; 6653e519524SHoward Hinnantpublic: 6663e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 6673e519524SHoward Hinnant 6683e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6693e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 6703e519524SHoward Hinnant 6713e519524SHoward Hinnant template <class _T1> 6723e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6733e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 6743e519524SHoward Hinnant 6753e519524SHoward Hinnant template <class _T1, class _T2> 6763e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6773e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 6783e519524SHoward Hinnant}; 6793e519524SHoward Hinnant 680f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 6813e519524SHoward Hinnant 6823e519524SHoward Hinnanttemplate <class _Compare> 6833e519524SHoward Hinnantstruct __debug_less 6843e519524SHoward Hinnant{ 6853e519524SHoward Hinnant _Compare __comp_; 6863e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 6873e519524SHoward Hinnant template <class _Tp, class _Up> 6883e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 6893e519524SHoward Hinnant { 6903e519524SHoward Hinnant bool __r = __comp_(__x, __y); 6913e519524SHoward Hinnant if (__r) 692f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 6933e519524SHoward Hinnant return __r; 6943e519524SHoward Hinnant } 6953e519524SHoward Hinnant}; 6963e519524SHoward Hinnant 697f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 6983e519524SHoward Hinnant 699c8edcb36SHoward Hinnant// Precondition: __x != 0 700c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned __ctz(unsigned __x) {return __builtin_ctz (__x);} 701c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long __ctz(unsigned long __x) {return __builtin_ctzl (__x);} 702c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long long __ctz(unsigned long long __x) {return __builtin_ctzll(__x);} 703c8edcb36SHoward Hinnant 704c8edcb36SHoward Hinnant// Precondition: __x != 0 705c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned __clz(unsigned __x) {return __builtin_clz (__x);} 706c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long __clz(unsigned long __x) {return __builtin_clzl (__x);} 707c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long long __clz(unsigned long long __x) {return __builtin_clzll(__x);} 708c8edcb36SHoward Hinnant 709c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 710c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 711c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 712c8edcb36SHoward Hinnant 7133e519524SHoward Hinnant// all_of 7143e519524SHoward Hinnant 7153e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7173e519524SHoward Hinnantbool 7183e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7193e519524SHoward Hinnant{ 7203e519524SHoward Hinnant for (; __first != __last; ++__first) 7213e519524SHoward Hinnant if (!__pred(*__first)) 7223e519524SHoward Hinnant return false; 7233e519524SHoward Hinnant return true; 7243e519524SHoward Hinnant} 7253e519524SHoward Hinnant 7263e519524SHoward Hinnant// any_of 7273e519524SHoward Hinnant 7283e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7303e519524SHoward Hinnantbool 7313e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7323e519524SHoward Hinnant{ 7333e519524SHoward Hinnant for (; __first != __last; ++__first) 7343e519524SHoward Hinnant if (__pred(*__first)) 7353e519524SHoward Hinnant return true; 7363e519524SHoward Hinnant return false; 7373e519524SHoward Hinnant} 7383e519524SHoward Hinnant 7393e519524SHoward Hinnant// none_of 7403e519524SHoward Hinnant 7413e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7433e519524SHoward Hinnantbool 7443e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7453e519524SHoward Hinnant{ 7463e519524SHoward Hinnant for (; __first != __last; ++__first) 7473e519524SHoward Hinnant if (__pred(*__first)) 7483e519524SHoward Hinnant return false; 7493e519524SHoward Hinnant return true; 7503e519524SHoward Hinnant} 7513e519524SHoward Hinnant 7523e519524SHoward Hinnant// for_each 7533e519524SHoward Hinnant 7543e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 7553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7563e519524SHoward Hinnant_Function 7573e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 7583e519524SHoward Hinnant{ 7593e519524SHoward Hinnant for (; __first != __last; ++__first) 7603e519524SHoward Hinnant __f(*__first); 761ce48a113SHoward Hinnant return _VSTD::move(__f); 7623e519524SHoward Hinnant} 7633e519524SHoward Hinnant 7643e519524SHoward Hinnant// find 7653e519524SHoward Hinnant 7663e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 7673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7683e519524SHoward Hinnant_InputIterator 769e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 7703e519524SHoward Hinnant{ 7713e519524SHoward Hinnant for (; __first != __last; ++__first) 772e4383379SHoward Hinnant if (*__first == __value_) 7733e519524SHoward Hinnant break; 7743e519524SHoward Hinnant return __first; 7753e519524SHoward Hinnant} 7763e519524SHoward Hinnant 7773e519524SHoward Hinnant// find_if 7783e519524SHoward Hinnant 7793e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7813e519524SHoward Hinnant_InputIterator 7823e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7833e519524SHoward Hinnant{ 7843e519524SHoward Hinnant for (; __first != __last; ++__first) 7853e519524SHoward Hinnant if (__pred(*__first)) 7863e519524SHoward Hinnant break; 7873e519524SHoward Hinnant return __first; 7883e519524SHoward Hinnant} 7893e519524SHoward Hinnant 7903e519524SHoward Hinnant// find_if_not 7913e519524SHoward Hinnant 7923e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 7933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7943e519524SHoward Hinnant_InputIterator 7953e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7963e519524SHoward Hinnant{ 7973e519524SHoward Hinnant for (; __first != __last; ++__first) 7983e519524SHoward Hinnant if (!__pred(*__first)) 7993e519524SHoward Hinnant break; 8003e519524SHoward Hinnant return __first; 8013e519524SHoward Hinnant} 8023e519524SHoward Hinnant 8033e519524SHoward Hinnant// find_end 8043e519524SHoward Hinnant 8053e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8063e519524SHoward Hinnant_ForwardIterator1 8073e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8083e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 8093e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 8103e519524SHoward Hinnant{ 8113e519524SHoward Hinnant // modeled after search algorithm 8123e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 8133e519524SHoward Hinnant if (__first2 == __last2) 8143e519524SHoward Hinnant return __r; 8153e519524SHoward Hinnant while (true) 8163e519524SHoward Hinnant { 8173e519524SHoward Hinnant while (true) 8183e519524SHoward Hinnant { 8193e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 8203e519524SHoward Hinnant return __r; // (or __last1 if never found) 8213e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 8223e519524SHoward Hinnant break; 8233e519524SHoward Hinnant ++__first1; 8243e519524SHoward Hinnant } 8253e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 8263e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 8273e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 8283e519524SHoward Hinnant while (true) 8293e519524SHoward Hinnant { 8303e519524SHoward Hinnant if (++__m2 == __last2) 8313e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 8323e519524SHoward Hinnant __r = __first1; 8333e519524SHoward Hinnant ++__first1; 8343e519524SHoward Hinnant break; 8353e519524SHoward Hinnant } 8363e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 8373e519524SHoward Hinnant return __r; 8383e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 8393e519524SHoward Hinnant { 8403e519524SHoward Hinnant ++__first1; 8413e519524SHoward Hinnant break; 8423e519524SHoward Hinnant } // else there is a match, check next elements 8433e519524SHoward Hinnant } 8443e519524SHoward Hinnant } 8453e519524SHoward Hinnant} 8463e519524SHoward Hinnant 8473e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 8483e519524SHoward Hinnant_BidirectionalIterator1 8493e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 8503e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 8513e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 8523e519524SHoward Hinnant{ 8533e519524SHoward Hinnant // modeled after search algorithm (in reverse) 8543e519524SHoward Hinnant if (__first2 == __last2) 8553e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 8563e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 8573e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 8583e519524SHoward Hinnant --__l2; 8593e519524SHoward Hinnant while (true) 8603e519524SHoward Hinnant { 8613e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 8623e519524SHoward Hinnant while (true) 8633e519524SHoward Hinnant { 8643e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 8653e519524SHoward Hinnant return __last1; 8663e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 8673e519524SHoward Hinnant break; 8683e519524SHoward Hinnant } 8693e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 8703e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 8713e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 8723e519524SHoward Hinnant while (true) 8733e519524SHoward Hinnant { 8743e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 8753e519524SHoward Hinnant return __m1; 8763e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 8773e519524SHoward Hinnant return __last1; 8783e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 8793e519524SHoward Hinnant { 8803e519524SHoward Hinnant break; 8813e519524SHoward Hinnant } // else there is a match, check next elements 8823e519524SHoward Hinnant } 8833e519524SHoward Hinnant } 8843e519524SHoward Hinnant} 8853e519524SHoward Hinnant 8863e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 8873e519524SHoward Hinnant_RandomAccessIterator1 8883e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 8893e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 8903e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 8913e519524SHoward Hinnant{ 8923e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 8933e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 8943e519524SHoward Hinnant if (__len2 == 0) 8953e519524SHoward Hinnant return __last1; 8963e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 8973e519524SHoward Hinnant if (__len1 < __len2) 8983e519524SHoward Hinnant return __last1; 8993e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9003e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9013e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9023e519524SHoward Hinnant --__l2; 9033e519524SHoward Hinnant while (true) 9043e519524SHoward Hinnant { 9053e519524SHoward Hinnant while (true) 9063e519524SHoward Hinnant { 9073e519524SHoward Hinnant if (__s == __l1) 9083e519524SHoward Hinnant return __last1; 9093e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9103e519524SHoward Hinnant break; 9113e519524SHoward Hinnant } 9123e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 9133e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 9143e519524SHoward Hinnant while (true) 9153e519524SHoward Hinnant { 9163e519524SHoward Hinnant if (__m2 == __first2) 9173e519524SHoward Hinnant return __m1; 9183e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 9193e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 9203e519524SHoward Hinnant { 9213e519524SHoward Hinnant break; 9223e519524SHoward Hinnant } 9233e519524SHoward Hinnant } 9243e519524SHoward Hinnant } 9253e519524SHoward Hinnant} 9263e519524SHoward Hinnant 9273e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9293e519524SHoward Hinnant_ForwardIterator1 9303e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9313e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9323e519524SHoward Hinnant{ 933ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 9343e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 9353e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 9363e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 9373e519524SHoward Hinnant} 9383e519524SHoward Hinnant 9393e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 9403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9413e519524SHoward Hinnant_ForwardIterator1 9423e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9433e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 9443e519524SHoward Hinnant{ 9453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 9463e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 947ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 9483e519524SHoward Hinnant} 9493e519524SHoward Hinnant 9503e519524SHoward Hinnant// find_first_of 9513e519524SHoward Hinnant 9523e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9533e519524SHoward Hinnant_ForwardIterator1 9543e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9553e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9563e519524SHoward Hinnant{ 9573e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 9583e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 9593e519524SHoward Hinnant if (__pred(*__first1, *__j)) 9603e519524SHoward Hinnant return __first1; 9613e519524SHoward Hinnant return __last1; 9623e519524SHoward Hinnant} 9633e519524SHoward Hinnant 9643e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 9653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9663e519524SHoward Hinnant_ForwardIterator1 9673e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9683e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 9693e519524SHoward Hinnant{ 9703e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 9713e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 972ce48a113SHoward Hinnant return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 9733e519524SHoward Hinnant} 9743e519524SHoward Hinnant 9753e519524SHoward Hinnant// adjacent_find 9763e519524SHoward Hinnant 9773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 9783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9793e519524SHoward Hinnant_ForwardIterator 9803e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 9813e519524SHoward Hinnant{ 9823e519524SHoward Hinnant if (__first != __last) 9833e519524SHoward Hinnant { 9843e519524SHoward Hinnant _ForwardIterator __i = __first; 9853e519524SHoward Hinnant while (++__i != __last) 9863e519524SHoward Hinnant { 9873e519524SHoward Hinnant if (__pred(*__first, *__i)) 9883e519524SHoward Hinnant return __first; 9893e519524SHoward Hinnant __first = __i; 9903e519524SHoward Hinnant } 9913e519524SHoward Hinnant } 9923e519524SHoward Hinnant return __last; 9933e519524SHoward Hinnant} 9943e519524SHoward Hinnant 9953e519524SHoward Hinnanttemplate <class _ForwardIterator> 9963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9973e519524SHoward Hinnant_ForwardIterator 9983e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 9993e519524SHoward Hinnant{ 10003e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1001ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 10023e519524SHoward Hinnant} 10033e519524SHoward Hinnant 10043e519524SHoward Hinnant// count 10053e519524SHoward Hinnant 10063e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10083e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1009e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 10103e519524SHoward Hinnant{ 10113e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10123e519524SHoward Hinnant for (; __first != __last; ++__first) 1013e4383379SHoward Hinnant if (*__first == __value_) 10143e519524SHoward Hinnant ++__r; 10153e519524SHoward Hinnant return __r; 10163e519524SHoward Hinnant} 10173e519524SHoward Hinnant 10183e519524SHoward Hinnant// count_if 10193e519524SHoward Hinnant 10203e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10223e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 10233e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10243e519524SHoward Hinnant{ 10253e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10263e519524SHoward Hinnant for (; __first != __last; ++__first) 10273e519524SHoward Hinnant if (__pred(*__first)) 10283e519524SHoward Hinnant ++__r; 10293e519524SHoward Hinnant return __r; 10303e519524SHoward Hinnant} 10313e519524SHoward Hinnant 10323e519524SHoward Hinnant// mismatch 10333e519524SHoward Hinnant 10343e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 10353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10363e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 10373e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 10383e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 10393e519524SHoward Hinnant{ 10403e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10413e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10423e519524SHoward Hinnant break; 10433e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 10443e519524SHoward Hinnant} 10453e519524SHoward Hinnant 10463e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 10473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10483e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 10493e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 10503e519524SHoward Hinnant{ 10513e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 10523e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1053ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10543e519524SHoward Hinnant} 10553e519524SHoward Hinnant 10563e519524SHoward Hinnant// equal 10573e519524SHoward Hinnant 10583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 10593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10603e519524SHoward Hinnantbool 10613e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 10623e519524SHoward Hinnant{ 10633e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10643e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10653e519524SHoward Hinnant return false; 10663e519524SHoward Hinnant return true; 10673e519524SHoward Hinnant} 10683e519524SHoward Hinnant 10693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 10703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10713e519524SHoward Hinnantbool 10723e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 10733e519524SHoward Hinnant{ 10743e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 10753e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1076ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10773e519524SHoward Hinnant} 10783e519524SHoward Hinnant 10793e519524SHoward Hinnant// is_permutation 10803e519524SHoward Hinnant 10813e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10823e519524SHoward Hinnantbool 10833e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10843e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 10853e519524SHoward Hinnant{ 10863e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 10873e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10883e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10893e519524SHoward Hinnant goto __not_done; 10903e519524SHoward Hinnant return true; 10913e519524SHoward Hinnant__not_done: 10923e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 10933e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1094ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 10953e519524SHoward Hinnant if (__l1 == _D1(1)) 10963e519524SHoward Hinnant return false; 1097ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 10983e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 10993e519524SHoward Hinnant // equal elements in [f2, l2) 11003e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 11013e519524SHoward Hinnant { 11023e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 11033e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 11043e519524SHoward Hinnant if (__pred(*__j, *__i)) 11053e519524SHoward Hinnant goto __next_iter; 11063e519524SHoward Hinnant { 11073e519524SHoward Hinnant // Count number of *__i in [f2, l2) 11083e519524SHoward Hinnant _D1 __c2 = 0; 11093e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11103e519524SHoward Hinnant if (__pred(*__i, *__j)) 11113e519524SHoward Hinnant ++__c2; 11123e519524SHoward Hinnant if (__c2 == 0) 11133e519524SHoward Hinnant return false; 11143e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 11153e519524SHoward Hinnant _D1 __c1 = 1; 1116ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 11173e519524SHoward Hinnant if (__pred(*__i, *__j)) 11183e519524SHoward Hinnant ++__c1; 11193e519524SHoward Hinnant if (__c1 != __c2) 11203e519524SHoward Hinnant return false; 11213e519524SHoward Hinnant } 11223e519524SHoward Hinnant__next_iter:; 11233e519524SHoward Hinnant } 11243e519524SHoward Hinnant return true; 11253e519524SHoward Hinnant} 11263e519524SHoward Hinnant 11273e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 11283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11293e519524SHoward Hinnantbool 11303e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11313e519524SHoward Hinnant _ForwardIterator2 __first2) 11323e519524SHoward Hinnant{ 11333e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1135ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11363e519524SHoward Hinnant} 11373e519524SHoward Hinnant 11383e519524SHoward Hinnant// search 11393e519524SHoward Hinnant 11403e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 11413e519524SHoward Hinnant_ForwardIterator1 11423e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11433e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 11443e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 11453e519524SHoward Hinnant{ 11463e519524SHoward Hinnant if (__first2 == __last2) 11473e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 11483e519524SHoward Hinnant while (true) 11493e519524SHoward Hinnant { 11503e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 11513e519524SHoward Hinnant while (true) 11523e519524SHoward Hinnant { 11533e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 11543e519524SHoward Hinnant return __last1; 11553e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11563e519524SHoward Hinnant break; 11573e519524SHoward Hinnant ++__first1; 11583e519524SHoward Hinnant } 11593e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 11603e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 11613e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 11623e519524SHoward Hinnant while (true) 11633e519524SHoward Hinnant { 11643e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 11653e519524SHoward Hinnant return __first1; 11663e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 11673e519524SHoward Hinnant return __last1; 11683e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 11693e519524SHoward Hinnant { 11703e519524SHoward Hinnant ++__first1; 11713e519524SHoward Hinnant break; 11723e519524SHoward Hinnant } // else there is a match, check next elements 11733e519524SHoward Hinnant } 11743e519524SHoward Hinnant } 11753e519524SHoward Hinnant} 11763e519524SHoward Hinnant 11773e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11783e519524SHoward Hinnant_RandomAccessIterator1 11793e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11803e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11813e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11823e519524SHoward Hinnant{ 11833e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 11843e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 11853e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11863e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 11873e519524SHoward Hinnant if (__len2 == 0) 11883e519524SHoward Hinnant return __first1; 11893e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 11903e519524SHoward Hinnant if (__len1 < __len2) 11913e519524SHoward Hinnant return __last1; 11923e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 11933e519524SHoward Hinnant while (true) 11943e519524SHoward Hinnant { 11953e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 11963e519524SHoward Hinnant while (true) 11973e519524SHoward Hinnant { 11983e519524SHoward Hinnant if (__first1 == __s) 11993e519524SHoward Hinnant return __last1; 12003e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12013e519524SHoward Hinnant break; 12023e519524SHoward Hinnant ++__first1; 12033e519524SHoward Hinnant } 1204b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 12053e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 12063e519524SHoward Hinnant { 12073e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12083e519524SHoward Hinnant goto __phase2; 12093e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12103e519524SHoward Hinnant goto __phase2; 12113e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12123e519524SHoward Hinnant goto __phase2; 12133e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12143e519524SHoward Hinnant goto __phase2; 12153e519524SHoward Hinnant ++__first1; 12163e519524SHoward Hinnant } 12173e519524SHoward Hinnant switch (__s - __first1) 12183e519524SHoward Hinnant { 12193e519524SHoward Hinnant case 3: 12203e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12213e519524SHoward Hinnant break; 12223e519524SHoward Hinnant ++__first1; 12233e519524SHoward Hinnant case 2: 12243e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12253e519524SHoward Hinnant break; 12263e519524SHoward Hinnant ++__first1; 12273e519524SHoward Hinnant case 1: 12283e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12293e519524SHoward Hinnant break; 12303e519524SHoward Hinnant case 0: 12313e519524SHoward Hinnant return __last1; 12323e519524SHoward Hinnant } 12333e519524SHoward Hinnant __phase2: 1234b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 12353e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 12363e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 12373e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 12383e519524SHoward Hinnant while (true) 12393e519524SHoward Hinnant { 12403e519524SHoward Hinnant if (++__m2 == __last2) 12413e519524SHoward Hinnant return __first1; 12423e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 12433e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12443e519524SHoward Hinnant { 12453e519524SHoward Hinnant ++__first1; 12463e519524SHoward Hinnant break; 12473e519524SHoward Hinnant } 12483e519524SHoward Hinnant } 1249b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 12503e519524SHoward Hinnant ++__m2; 12513e519524SHoward Hinnant ++__m1; 12523e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 12533e519524SHoward Hinnant { 12543e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12553e519524SHoward Hinnant goto __continue; 12563e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12573e519524SHoward Hinnant goto __continue; 12583e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12593e519524SHoward Hinnant goto __continue; 12603e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12613e519524SHoward Hinnant goto __continue; 12623e519524SHoward Hinnant ++__m1; 12633e519524SHoward Hinnant ++__m2; 12643e519524SHoward Hinnant } 12653e519524SHoward Hinnant switch (__last2 - __m2) 12663e519524SHoward Hinnant { 12673e519524SHoward Hinnant case 3: 12683e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12693e519524SHoward Hinnant break; 12703e519524SHoward Hinnant ++__m1; 12713e519524SHoward Hinnant ++__m2; 12723e519524SHoward Hinnant case 2: 12733e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12743e519524SHoward Hinnant break; 12753e519524SHoward Hinnant ++__m1; 12763e519524SHoward Hinnant ++__m2; 12773e519524SHoward Hinnant case 1: 12783e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12793e519524SHoward Hinnant break; 12803e519524SHoward Hinnant case 0: 12813e519524SHoward Hinnant return __first1; 12823e519524SHoward Hinnant } 12833e519524SHoward Hinnant __continue: 12843e519524SHoward Hinnant ++__first1; 1285b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 12863e519524SHoward Hinnant } 12873e519524SHoward Hinnant} 12883e519524SHoward Hinnant 12893e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12913e519524SHoward Hinnant_ForwardIterator1 12923e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12933e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 12943e519524SHoward Hinnant{ 1295ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 12963e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 12973e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 12983e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 12993e519524SHoward Hinnant} 13003e519524SHoward Hinnant 13013e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 13023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13033e519524SHoward Hinnant_ForwardIterator1 13043e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13053e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 13063e519524SHoward Hinnant{ 13073e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 13083e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1309ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13103e519524SHoward Hinnant} 13113e519524SHoward Hinnant 13123e519524SHoward Hinnant// search_n 13133e519524SHoward Hinnant 13143e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 13153e519524SHoward Hinnant_ForwardIterator 13163e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1317e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 13183e519524SHoward Hinnant{ 13193e519524SHoward Hinnant if (__count <= 0) 13203e519524SHoward Hinnant return __first; 13213e519524SHoward Hinnant while (true) 13223e519524SHoward Hinnant { 1323e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 13243e519524SHoward Hinnant while (true) 13253e519524SHoward Hinnant { 1326e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 13273e519524SHoward Hinnant return __last; 1328e4383379SHoward Hinnant if (__pred(*__first, __value_)) 13293e519524SHoward Hinnant break; 13303e519524SHoward Hinnant ++__first; 13313e519524SHoward Hinnant } 1332e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 13333e519524SHoward Hinnant _ForwardIterator __m = __first; 13343e519524SHoward Hinnant _Size __c(0); 13353e519524SHoward Hinnant while (true) 13363e519524SHoward Hinnant { 13373e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 13383e519524SHoward Hinnant return __first; 13393e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 13403e519524SHoward Hinnant return __last; 1341e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 13423e519524SHoward Hinnant { 13433e519524SHoward Hinnant __first = __m; 13443e519524SHoward Hinnant ++__first; 13453e519524SHoward Hinnant break; 13463e519524SHoward Hinnant } // else there is a match, check next elements 13473e519524SHoward Hinnant } 13483e519524SHoward Hinnant } 13493e519524SHoward Hinnant} 13503e519524SHoward Hinnant 13513e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 13523e519524SHoward Hinnant_RandomAccessIterator 13533e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1354e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 13553e519524SHoward Hinnant{ 13563e519524SHoward Hinnant if (__count <= 0) 13573e519524SHoward Hinnant return __first; 13583e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 13593e519524SHoward Hinnant if (__len < __count) 13603e519524SHoward Hinnant return __last; 13613e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 13623e519524SHoward Hinnant while (true) 13633e519524SHoward Hinnant { 1364e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 13653e519524SHoward Hinnant while (true) 13663e519524SHoward Hinnant { 1367e4383379SHoward Hinnant if (__first == __s) // return __last if no element matches __value_ 13683e519524SHoward Hinnant return __last; 1369e4383379SHoward Hinnant if (__pred(*__first, __value_)) 13703e519524SHoward Hinnant break; 13713e519524SHoward Hinnant ++__first; 13723e519524SHoward Hinnant } 1373e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 13743e519524SHoward Hinnant _RandomAccessIterator __m = __first; 13753e519524SHoward Hinnant _Size __c(0); 13763e519524SHoward Hinnant while (true) 13773e519524SHoward Hinnant { 13783e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 13793e519524SHoward Hinnant return __first; 13803e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1381e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 13823e519524SHoward Hinnant { 13833e519524SHoward Hinnant __first = __m; 13843e519524SHoward Hinnant ++__first; 13853e519524SHoward Hinnant break; 13863e519524SHoward Hinnant } // else there is a match, check next elements 13873e519524SHoward Hinnant } 13883e519524SHoward Hinnant } 13893e519524SHoward Hinnant} 13903e519524SHoward Hinnant 13913e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 13923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13933e519524SHoward Hinnant_ForwardIterator 13943e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1395e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 13963e519524SHoward Hinnant{ 1397ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1398e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 13993e519524SHoward Hinnant} 14003e519524SHoward Hinnant 14013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 14023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14033e519524SHoward Hinnant_ForwardIterator 1404e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 14053e519524SHoward Hinnant{ 14063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1407e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 14083e519524SHoward Hinnant} 14093e519524SHoward Hinnant 14103e519524SHoward Hinnant// copy 14113e519524SHoward Hinnant 14123e519524SHoward Hinnanttemplate <class _Iter> 14133e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 14143e519524SHoward Hinnant{ 14153e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14163e519524SHoward Hinnant}; 14173e519524SHoward Hinnant 14183e519524SHoward Hinnanttemplate <class _Iter> 14193e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 14203e519524SHoward Hinnant{ 14213e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14223e519524SHoward Hinnant}; 14233e519524SHoward Hinnant 14243e519524SHoward Hinnanttemplate <class _Iter> 14253e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 14263e519524SHoward Hinnant{ 14273e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14283e519524SHoward Hinnant}; 14293e519524SHoward Hinnant 14303e519524SHoward Hinnanttemplate <class _Iter> 14313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14323e519524SHoward Hinnant_Iter 14333e519524SHoward Hinnant__unwrap_iter(_Iter __i) 14343e519524SHoward Hinnant{ 14353e519524SHoward Hinnant return __i; 14363e519524SHoward Hinnant} 14373e519524SHoward Hinnant 14383e519524SHoward Hinnanttemplate <class _Tp> 14393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14403e519524SHoward Hinnanttypename enable_if 14413e519524SHoward Hinnant< 1442ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 14433e519524SHoward Hinnant _Tp* 14443e519524SHoward Hinnant>::type 14453e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 14463e519524SHoward Hinnant{ 14473e519524SHoward Hinnant return __i.base(); 14483e519524SHoward Hinnant} 14493e519524SHoward Hinnant 14503e519524SHoward Hinnanttemplate <class _Tp> 14513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14523e519524SHoward Hinnanttypename enable_if 14533e519524SHoward Hinnant< 1454ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 14553e519524SHoward Hinnant _Tp* 14563e519524SHoward Hinnant>::type 14573e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 14583e519524SHoward Hinnant{ 14593e519524SHoward Hinnant return __i.base(); 14603e519524SHoward Hinnant} 14613e519524SHoward Hinnant 14623e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14643e519524SHoward Hinnant_OutputIterator 14653e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14663e519524SHoward Hinnant{ 14673e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 14683e519524SHoward Hinnant *__result = *__first; 14693e519524SHoward Hinnant return __result; 14703e519524SHoward Hinnant} 14713e519524SHoward Hinnant 14723e519524SHoward Hinnanttemplate <class _Tp, class _Up> 14733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14743e519524SHoward Hinnanttypename enable_if 14753e519524SHoward Hinnant< 14763e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1477ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 14783e519524SHoward Hinnant _Up* 14793e519524SHoward Hinnant>::type 14803e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 14813e519524SHoward Hinnant{ 14823e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1483ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 14843e519524SHoward Hinnant return __result + __n; 14853e519524SHoward Hinnant} 14863e519524SHoward Hinnant 14873e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14893e519524SHoward Hinnant_OutputIterator 14903e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14913e519524SHoward Hinnant{ 1492ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 14933e519524SHoward Hinnant} 14943e519524SHoward Hinnant 14953e519524SHoward Hinnant// copy_backward 14963e519524SHoward Hinnant 14973e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14993e519524SHoward Hinnant_OutputIterator 15003e519524SHoward Hinnant__copy_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15013e519524SHoward Hinnant{ 15023e519524SHoward Hinnant while (__first != __last) 15033e519524SHoward Hinnant *--__result = *--__last; 15043e519524SHoward Hinnant return __result; 15053e519524SHoward Hinnant} 15063e519524SHoward Hinnant 15073e519524SHoward Hinnanttemplate <class _Tp, class _Up> 15083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15093e519524SHoward Hinnanttypename enable_if 15103e519524SHoward Hinnant< 15113e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1512ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 15133e519524SHoward Hinnant _Up* 15143e519524SHoward Hinnant>::type 15153e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 15163e519524SHoward Hinnant{ 15173e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 15183e519524SHoward Hinnant __result -= __n; 1519ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 15203e519524SHoward Hinnant return __result; 15213e519524SHoward Hinnant} 15223e519524SHoward Hinnant 15233e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 15243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15253e519524SHoward Hinnant_BidirectionalIterator2 15263e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 15273e519524SHoward Hinnant _BidirectionalIterator2 __result) 15283e519524SHoward Hinnant{ 1529ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 15303e519524SHoward Hinnant} 15313e519524SHoward Hinnant 15323e519524SHoward Hinnant// copy_if 15333e519524SHoward Hinnant 15343e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 15353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15363e519524SHoward Hinnant_OutputIterator 15373e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 15383e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 15393e519524SHoward Hinnant{ 15403e519524SHoward Hinnant for (; __first != __last; ++__first) 15413e519524SHoward Hinnant { 15423e519524SHoward Hinnant if (__pred(*__first)) 15433e519524SHoward Hinnant { 15443e519524SHoward Hinnant *__result = *__first; 15453e519524SHoward Hinnant ++__result; 15463e519524SHoward Hinnant } 15473e519524SHoward Hinnant } 15483e519524SHoward Hinnant return __result; 15493e519524SHoward Hinnant} 15503e519524SHoward Hinnant 15513e519524SHoward Hinnant// copy_n 15523e519524SHoward Hinnant 15533e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 15543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15553e519524SHoward Hinnanttypename enable_if 15563e519524SHoward Hinnant< 15573e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 15583e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 15593e519524SHoward Hinnant _OutputIterator 15603e519524SHoward Hinnant>::type 15613e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15623e519524SHoward Hinnant{ 156399847d2bSHoward Hinnant if (__n > 0) 156499847d2bSHoward Hinnant { 15653e519524SHoward Hinnant *__result = *__first; 156699847d2bSHoward Hinnant ++__result; 156799847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 156899847d2bSHoward Hinnant { 156999847d2bSHoward Hinnant ++__first; 157099847d2bSHoward Hinnant *__result = *__first; 157199847d2bSHoward Hinnant ++__result; 157299847d2bSHoward Hinnant } 157399847d2bSHoward Hinnant } 15743e519524SHoward Hinnant return __result; 15753e519524SHoward Hinnant} 15763e519524SHoward Hinnant 15773e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 15783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15793e519524SHoward Hinnanttypename enable_if 15803e519524SHoward Hinnant< 15813e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 15823e519524SHoward Hinnant _OutputIterator 15833e519524SHoward Hinnant>::type 15843e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15853e519524SHoward Hinnant{ 1586ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 15873e519524SHoward Hinnant} 15883e519524SHoward Hinnant 15893e519524SHoward Hinnant// move 15903e519524SHoward Hinnant 15913e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15933e519524SHoward Hinnant_OutputIterator 15943e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15953e519524SHoward Hinnant{ 15963e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 1597ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 15983e519524SHoward Hinnant return __result; 15993e519524SHoward Hinnant} 16003e519524SHoward Hinnant 16013e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16033e519524SHoward Hinnanttypename enable_if 16043e519524SHoward Hinnant< 16053e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1606ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16073e519524SHoward Hinnant _Up* 16083e519524SHoward Hinnant>::type 16093e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 16103e519524SHoward Hinnant{ 16113e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1612ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16133e519524SHoward Hinnant return __result + __n; 16143e519524SHoward Hinnant} 16153e519524SHoward Hinnant 16163e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16183e519524SHoward Hinnant_OutputIterator 16193e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16203e519524SHoward Hinnant{ 1621ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16223e519524SHoward Hinnant} 16233e519524SHoward Hinnant 16243e519524SHoward Hinnant// move_backward 16253e519524SHoward Hinnant 16263e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16283e519524SHoward Hinnant_OutputIterator 16293e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16303e519524SHoward Hinnant{ 16313e519524SHoward Hinnant while (__first != __last) 1632ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 16333e519524SHoward Hinnant return __result; 16343e519524SHoward Hinnant} 16353e519524SHoward Hinnant 16363e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16383e519524SHoward Hinnanttypename enable_if 16393e519524SHoward Hinnant< 16403e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1641ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16423e519524SHoward Hinnant _Up* 16433e519524SHoward Hinnant>::type 16443e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 16453e519524SHoward Hinnant{ 16463e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16473e519524SHoward Hinnant __result -= __n; 1648ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16493e519524SHoward Hinnant return __result; 16503e519524SHoward Hinnant} 16513e519524SHoward Hinnant 16523e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 16533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16543e519524SHoward Hinnant_BidirectionalIterator2 16553e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 16563e519524SHoward Hinnant _BidirectionalIterator2 __result) 16573e519524SHoward Hinnant{ 1658ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16593e519524SHoward Hinnant} 16603e519524SHoward Hinnant 16613e519524SHoward Hinnant// iter_swap 16623e519524SHoward Hinnant 1663a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 16643e519524SHoward Hinnant 16653e519524SHoward Hinnant// transform 16663e519524SHoward Hinnant 16673e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 16683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16693e519524SHoward Hinnant_OutputIterator 16703e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 16713e519524SHoward Hinnant{ 16723e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 16733e519524SHoward Hinnant *__result = __op(*__first); 16743e519524SHoward Hinnant return __result; 16753e519524SHoward Hinnant} 16763e519524SHoward Hinnant 16773e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 16783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16793e519524SHoward Hinnant_OutputIterator 16803e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 16813e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 16823e519524SHoward Hinnant{ 16833e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 16843e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 16853e519524SHoward Hinnant return __result; 16863e519524SHoward Hinnant} 16873e519524SHoward Hinnant 16883e519524SHoward Hinnant// replace 16893e519524SHoward Hinnant 16903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 16913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16923e519524SHoward Hinnantvoid 16933e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 16943e519524SHoward Hinnant{ 16953e519524SHoward Hinnant for (; __first != __last; ++__first) 16963e519524SHoward Hinnant if (*__first == __old_value) 16973e519524SHoward Hinnant *__first = __new_value; 16983e519524SHoward Hinnant} 16993e519524SHoward Hinnant 17003e519524SHoward Hinnant// replace_if 17013e519524SHoward Hinnant 17023e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 17033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17043e519524SHoward Hinnantvoid 17053e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 17063e519524SHoward Hinnant{ 17073e519524SHoward Hinnant for (; __first != __last; ++__first) 17083e519524SHoward Hinnant if (__pred(*__first)) 17093e519524SHoward Hinnant *__first = __new_value; 17103e519524SHoward Hinnant} 17113e519524SHoward Hinnant 17123e519524SHoward Hinnant// replace_copy 17133e519524SHoward Hinnant 17143e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 17153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17163e519524SHoward Hinnant_OutputIterator 17173e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 17183e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 17193e519524SHoward Hinnant{ 17203e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17213e519524SHoward Hinnant if (*__first == __old_value) 17223e519524SHoward Hinnant *__result = __new_value; 17233e519524SHoward Hinnant else 17243e519524SHoward Hinnant *__result = *__first; 17253e519524SHoward Hinnant return __result; 17263e519524SHoward Hinnant} 17273e519524SHoward Hinnant 17283e519524SHoward Hinnant// replace_copy_if 17293e519524SHoward Hinnant 17303e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 17313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17323e519524SHoward Hinnant_OutputIterator 17333e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 17343e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 17353e519524SHoward Hinnant{ 17363e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17373e519524SHoward Hinnant if (__pred(*__first)) 17383e519524SHoward Hinnant *__result = __new_value; 17393e519524SHoward Hinnant else 17403e519524SHoward Hinnant *__result = *__first; 17413e519524SHoward Hinnant return __result; 17423e519524SHoward Hinnant} 17433e519524SHoward Hinnant 17443e519524SHoward Hinnant// fill_n 17453e519524SHoward Hinnant 17463e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17483e519524SHoward Hinnant_OutputIterator 1749e4383379SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_, false_type) 17503e519524SHoward Hinnant{ 17513e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 1752e4383379SHoward Hinnant *__first = __value_; 17533e519524SHoward Hinnant return __first; 17543e519524SHoward Hinnant} 17553e519524SHoward Hinnant 17563e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17583e519524SHoward Hinnant_OutputIterator 1759e4383379SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_, true_type) 17603e519524SHoward Hinnant{ 17613e519524SHoward Hinnant if (__n > 0) 1762e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 17633e519524SHoward Hinnant return __first + __n; 17643e519524SHoward Hinnant} 17653e519524SHoward Hinnant 17663e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17683e519524SHoward Hinnant_OutputIterator 1769e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 17703e519524SHoward Hinnant{ 1771e4383379SHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_, integral_constant<bool, 17723e519524SHoward Hinnant is_pointer<_OutputIterator>::value && 1773ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value && 17743e519524SHoward Hinnant sizeof(_Tp) == 1>()); 17753e519524SHoward Hinnant} 17763e519524SHoward Hinnant 17773e519524SHoward Hinnant// fill 17783e519524SHoward Hinnant 17793e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17813e519524SHoward Hinnantvoid 1782e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 17833e519524SHoward Hinnant{ 17843e519524SHoward Hinnant for (; __first != __last; ++__first) 1785e4383379SHoward Hinnant *__first = __value_; 17863e519524SHoward Hinnant} 17873e519524SHoward Hinnant 17883e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 17893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17903e519524SHoward Hinnantvoid 1791e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 17923e519524SHoward Hinnant{ 1793e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 17943e519524SHoward Hinnant} 17953e519524SHoward Hinnant 17963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17983e519524SHoward Hinnantvoid 1799e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 18003e519524SHoward Hinnant{ 1801e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 18023e519524SHoward Hinnant} 18033e519524SHoward Hinnant 18043e519524SHoward Hinnant// generate 18053e519524SHoward Hinnant 18063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 18073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18083e519524SHoward Hinnantvoid 18093e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 18103e519524SHoward Hinnant{ 18113e519524SHoward Hinnant for (; __first != __last; ++__first) 18123e519524SHoward Hinnant *__first = __gen(); 18133e519524SHoward Hinnant} 18143e519524SHoward Hinnant 18153e519524SHoward Hinnant// generate_n 18163e519524SHoward Hinnant 18173e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 18183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18193e519524SHoward Hinnant_OutputIterator 18203e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 18213e519524SHoward Hinnant{ 18223e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 18233e519524SHoward Hinnant *__first = __gen(); 18243e519524SHoward Hinnant return __first; 18253e519524SHoward Hinnant} 18263e519524SHoward Hinnant 18273e519524SHoward Hinnant// remove 18283e519524SHoward Hinnant 18293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 18303e519524SHoward Hinnant_ForwardIterator 1831e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 18323e519524SHoward Hinnant{ 1833e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 18343e519524SHoward Hinnant if (__first != __last) 18353e519524SHoward Hinnant { 18363e519524SHoward Hinnant _ForwardIterator __i = __first; 18373e519524SHoward Hinnant while (++__i != __last) 18383e519524SHoward Hinnant { 1839e4383379SHoward Hinnant if (!(*__i == __value_)) 18403e519524SHoward Hinnant { 1841ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 18423e519524SHoward Hinnant ++__first; 18433e519524SHoward Hinnant } 18443e519524SHoward Hinnant } 18453e519524SHoward Hinnant } 18463e519524SHoward Hinnant return __first; 18473e519524SHoward Hinnant} 18483e519524SHoward Hinnant 18493e519524SHoward Hinnant// remove_if 18503e519524SHoward Hinnant 18513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 18523e519524SHoward Hinnant_ForwardIterator 18533e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 18543e519524SHoward Hinnant{ 1855ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 18563e519524SHoward Hinnant (__first, __last, __pred); 18573e519524SHoward Hinnant if (__first != __last) 18583e519524SHoward Hinnant { 18593e519524SHoward Hinnant _ForwardIterator __i = __first; 18603e519524SHoward Hinnant while (++__i != __last) 18613e519524SHoward Hinnant { 18623e519524SHoward Hinnant if (!__pred(*__i)) 18633e519524SHoward Hinnant { 1864ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 18653e519524SHoward Hinnant ++__first; 18663e519524SHoward Hinnant } 18673e519524SHoward Hinnant } 18683e519524SHoward Hinnant } 18693e519524SHoward Hinnant return __first; 18703e519524SHoward Hinnant} 18713e519524SHoward Hinnant 18723e519524SHoward Hinnant// remove_copy 18733e519524SHoward Hinnant 18743e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 18753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18763e519524SHoward Hinnant_OutputIterator 1877e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 18783e519524SHoward Hinnant{ 18793e519524SHoward Hinnant for (; __first != __last; ++__first) 18803e519524SHoward Hinnant { 1881e4383379SHoward Hinnant if (!(*__first == __value_)) 18823e519524SHoward Hinnant { 18833e519524SHoward Hinnant *__result = *__first; 18843e519524SHoward Hinnant ++__result; 18853e519524SHoward Hinnant } 18863e519524SHoward Hinnant } 18873e519524SHoward Hinnant return __result; 18883e519524SHoward Hinnant} 18893e519524SHoward Hinnant 18903e519524SHoward Hinnant// remove_copy_if 18913e519524SHoward Hinnant 18923e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 18933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18943e519524SHoward Hinnant_OutputIterator 18953e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 18963e519524SHoward Hinnant{ 18973e519524SHoward Hinnant for (; __first != __last; ++__first) 18983e519524SHoward Hinnant { 18993e519524SHoward Hinnant if (!__pred(*__first)) 19003e519524SHoward Hinnant { 19013e519524SHoward Hinnant *__result = *__first; 19023e519524SHoward Hinnant ++__result; 19033e519524SHoward Hinnant } 19043e519524SHoward Hinnant } 19053e519524SHoward Hinnant return __result; 19063e519524SHoward Hinnant} 19073e519524SHoward Hinnant 19083e519524SHoward Hinnant// unique 19093e519524SHoward Hinnant 19103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 19113e519524SHoward Hinnant_ForwardIterator 19123e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 19133e519524SHoward Hinnant{ 1914ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 19153e519524SHoward Hinnant (__first, __last, __pred); 19163e519524SHoward Hinnant if (__first != __last) 19173e519524SHoward Hinnant { 19183e519524SHoward Hinnant // ... a a ? ... 19193e519524SHoward Hinnant // f i 19203e519524SHoward Hinnant _ForwardIterator __i = __first; 19213e519524SHoward Hinnant for (++__i; ++__i != __last;) 19223e519524SHoward Hinnant if (!__pred(*__first, *__i)) 1923ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 19243e519524SHoward Hinnant ++__first; 19253e519524SHoward Hinnant } 19263e519524SHoward Hinnant return __first; 19273e519524SHoward Hinnant} 19283e519524SHoward Hinnant 19293e519524SHoward Hinnanttemplate <class _ForwardIterator> 19303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19313e519524SHoward Hinnant_ForwardIterator 19323e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 19333e519524SHoward Hinnant{ 19343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1935ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 19363e519524SHoward Hinnant} 19373e519524SHoward Hinnant 19383e519524SHoward Hinnant// unique_copy 19393e519524SHoward Hinnant 19403e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 19413e519524SHoward Hinnant_OutputIterator 19423e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 19433e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 19443e519524SHoward Hinnant{ 19453e519524SHoward Hinnant if (__first != __last) 19463e519524SHoward Hinnant { 19473e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 19483e519524SHoward Hinnant *__result = __t; 19493e519524SHoward Hinnant ++__result; 19503e519524SHoward Hinnant while (++__first != __last) 19513e519524SHoward Hinnant { 19523e519524SHoward Hinnant if (!__pred(__t, *__first)) 19533e519524SHoward Hinnant { 19543e519524SHoward Hinnant __t = *__first; 19553e519524SHoward Hinnant *__result = __t; 19563e519524SHoward Hinnant ++__result; 19573e519524SHoward Hinnant } 19583e519524SHoward Hinnant } 19593e519524SHoward Hinnant } 19603e519524SHoward Hinnant return __result; 19613e519524SHoward Hinnant} 19623e519524SHoward Hinnant 19633e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 19643e519524SHoward Hinnant_OutputIterator 19653e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 19663e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 19673e519524SHoward Hinnant{ 19683e519524SHoward Hinnant if (__first != __last) 19693e519524SHoward Hinnant { 19703e519524SHoward Hinnant _ForwardIterator __i = __first; 19713e519524SHoward Hinnant *__result = *__i; 19723e519524SHoward Hinnant ++__result; 19733e519524SHoward Hinnant while (++__first != __last) 19743e519524SHoward Hinnant { 19753e519524SHoward Hinnant if (!__pred(*__i, *__first)) 19763e519524SHoward Hinnant { 19773e519524SHoward Hinnant *__result = *__first; 19783e519524SHoward Hinnant ++__result; 19793e519524SHoward Hinnant __i = __first; 19803e519524SHoward Hinnant } 19813e519524SHoward Hinnant } 19823e519524SHoward Hinnant } 19833e519524SHoward Hinnant return __result; 19843e519524SHoward Hinnant} 19853e519524SHoward Hinnant 19863e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 19873e519524SHoward Hinnant_ForwardIterator 19883e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 19893e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 19903e519524SHoward Hinnant{ 19913e519524SHoward Hinnant if (__first != __last) 19923e519524SHoward Hinnant { 19933e519524SHoward Hinnant *__result = *__first; 19943e519524SHoward Hinnant while (++__first != __last) 19953e519524SHoward Hinnant if (!__pred(*__result, *__first)) 19963e519524SHoward Hinnant *++__result = *__first; 19973e519524SHoward Hinnant ++__result; 19983e519524SHoward Hinnant } 19993e519524SHoward Hinnant return __result; 20003e519524SHoward Hinnant} 20013e519524SHoward Hinnant 20023e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 20033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20043e519524SHoward Hinnant_OutputIterator 20053e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 20063e519524SHoward Hinnant{ 2007ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 20083e519524SHoward Hinnant (__first, __last, __result, __pred, 20093e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 20103e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 20113e519524SHoward Hinnant} 20123e519524SHoward Hinnant 20133e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 20143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20153e519524SHoward Hinnant_OutputIterator 20163e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 20173e519524SHoward Hinnant{ 20183e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2019ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 20203e519524SHoward Hinnant} 20213e519524SHoward Hinnant 20223e519524SHoward Hinnant// reverse 20233e519524SHoward Hinnant 20243e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 20253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20263e519524SHoward Hinnantvoid 20273e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 20283e519524SHoward Hinnant{ 20293e519524SHoward Hinnant while (__first != __last) 20303e519524SHoward Hinnant { 20313e519524SHoward Hinnant if (__first == --__last) 20323e519524SHoward Hinnant break; 20333e519524SHoward Hinnant swap(*__first, *__last); 20343e519524SHoward Hinnant ++__first; 20353e519524SHoward Hinnant } 20363e519524SHoward Hinnant} 20373e519524SHoward Hinnant 20383e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 20393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20403e519524SHoward Hinnantvoid 20413e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 20423e519524SHoward Hinnant{ 20433e519524SHoward Hinnant if (__first != __last) 20443e519524SHoward Hinnant for (; __first < --__last; ++__first) 20453e519524SHoward Hinnant swap(*__first, *__last); 20463e519524SHoward Hinnant} 20473e519524SHoward Hinnant 20483e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 20493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20503e519524SHoward Hinnantvoid 20513e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 20523e519524SHoward Hinnant{ 2053ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 20543e519524SHoward Hinnant} 20553e519524SHoward Hinnant 20563e519524SHoward Hinnant// reverse_copy 20573e519524SHoward Hinnant 20583e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 20593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20603e519524SHoward Hinnant_OutputIterator 20613e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 20623e519524SHoward Hinnant{ 20633e519524SHoward Hinnant for (; __first != __last; ++__result) 20643e519524SHoward Hinnant *__result = *--__last; 20653e519524SHoward Hinnant return __result; 20663e519524SHoward Hinnant} 20673e519524SHoward Hinnant 20683e519524SHoward Hinnant// rotate 20693e519524SHoward Hinnant 20703e519524SHoward Hinnanttemplate <class _ForwardIterator> 20713e519524SHoward Hinnant_ForwardIterator 20723e519524SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, false_type) 20733e519524SHoward Hinnant{ 20743e519524SHoward Hinnant if (__first == __middle) 20753e519524SHoward Hinnant return __last; 20763e519524SHoward Hinnant if (__middle == __last) 20773e519524SHoward Hinnant return __first; 20783e519524SHoward Hinnant _ForwardIterator __i = __middle; 20793e519524SHoward Hinnant while (true) 20803e519524SHoward Hinnant { 20813e519524SHoward Hinnant swap(*__first, *__i); 20823e519524SHoward Hinnant ++__first; 20833e519524SHoward Hinnant if (++__i == __last) 20843e519524SHoward Hinnant break; 20853e519524SHoward Hinnant if (__first == __middle) 20863e519524SHoward Hinnant __middle = __i; 20873e519524SHoward Hinnant } 20883e519524SHoward Hinnant _ForwardIterator __r = __first; 20893e519524SHoward Hinnant if (__first != __middle) 20903e519524SHoward Hinnant { 20913e519524SHoward Hinnant __i = __middle; 20923e519524SHoward Hinnant while (true) 20933e519524SHoward Hinnant { 20943e519524SHoward Hinnant swap(*__first, *__i); 20953e519524SHoward Hinnant ++__first; 20963e519524SHoward Hinnant if (++__i == __last) 20973e519524SHoward Hinnant { 20983e519524SHoward Hinnant if (__first == __middle) 20993e519524SHoward Hinnant break; 21003e519524SHoward Hinnant __i = __middle; 21013e519524SHoward Hinnant } 21023e519524SHoward Hinnant else if (__first == __middle) 21033e519524SHoward Hinnant __middle = __i; 21043e519524SHoward Hinnant } 21053e519524SHoward Hinnant } 21063e519524SHoward Hinnant return __r; 21073e519524SHoward Hinnant} 21083e519524SHoward Hinnant 21093e519524SHoward Hinnanttemplate<typename _Integral> 21103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21113e519524SHoward Hinnant_Integral 21123e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 21133e519524SHoward Hinnant{ 21143e519524SHoward Hinnant do 21153e519524SHoward Hinnant { 21163e519524SHoward Hinnant _Integral __t = __x % __y; 21173e519524SHoward Hinnant __x = __y; 21183e519524SHoward Hinnant __y = __t; 21193e519524SHoward Hinnant } while (__y); 21203e519524SHoward Hinnant return __x; 21213e519524SHoward Hinnant} 21223e519524SHoward Hinnant 21233e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 21243e519524SHoward Hinnant_RandomAccessIterator 21253e519524SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, true_type) 21263e519524SHoward Hinnant{ 21273e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 21283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 21293e519524SHoward Hinnant 21303e519524SHoward Hinnant if (__first == __middle) 21313e519524SHoward Hinnant return __last; 21323e519524SHoward Hinnant if (__middle == __last) 21333e519524SHoward Hinnant return __first; 21343e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 21353e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 21363e519524SHoward Hinnant if (__m1 == __m2) 21373e519524SHoward Hinnant { 2138ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 21393e519524SHoward Hinnant return __middle; 21403e519524SHoward Hinnant } 21413e519524SHoward Hinnant const difference_type __g = __gcd(__m1, __m2); 21423e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 21433e519524SHoward Hinnant { 21443e519524SHoward Hinnant value_type __t(*--__p); 21453e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 21463e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 21473e519524SHoward Hinnant do 21483e519524SHoward Hinnant { 21493e519524SHoward Hinnant *__p1 = *__p2; 21503e519524SHoward Hinnant __p1 = __p2; 21513e519524SHoward Hinnant const difference_type __d = __last - __p2; 21523e519524SHoward Hinnant if (__m1 < __d) 21533e519524SHoward Hinnant __p2 += __m1; 21543e519524SHoward Hinnant else 21553e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 21563e519524SHoward Hinnant } while (__p2 != __p); 21573e519524SHoward Hinnant *__p1 = __t; 21583e519524SHoward Hinnant } 21593e519524SHoward Hinnant return __first + __m2; 21603e519524SHoward Hinnant} 21613e519524SHoward Hinnant 21623e519524SHoward Hinnanttemplate <class _ForwardIterator> 21633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21643e519524SHoward Hinnant_ForwardIterator 21653e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 21663e519524SHoward Hinnant{ 2167ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 21683e519524SHoward Hinnant integral_constant 21693e519524SHoward Hinnant < 21703e519524SHoward Hinnant bool, 21713e519524SHoward Hinnant is_convertible 21723e519524SHoward Hinnant < 21733e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::iterator_category, 21743e519524SHoward Hinnant random_access_iterator_tag 21753e519524SHoward Hinnant >::value && 2176ca740483SHoward Hinnant is_trivially_copy_assignable 21773e519524SHoward Hinnant < 21783e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::value_type 21793e519524SHoward Hinnant >::value 21803e519524SHoward Hinnant >()); 21813e519524SHoward Hinnant} 21823e519524SHoward Hinnant 21833e519524SHoward Hinnant// rotate_copy 21843e519524SHoward Hinnant 21853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 21863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21873e519524SHoward Hinnant_OutputIterator 21883e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 21893e519524SHoward Hinnant{ 2190ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 21913e519524SHoward Hinnant} 21923e519524SHoward Hinnant 21933e519524SHoward Hinnant// min_element 21943e519524SHoward Hinnant 21953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 21963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21973e519524SHoward Hinnant_ForwardIterator 21983e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 21993e519524SHoward Hinnant{ 22003e519524SHoward Hinnant if (__first != __last) 22013e519524SHoward Hinnant { 22023e519524SHoward Hinnant _ForwardIterator __i = __first; 22033e519524SHoward Hinnant while (++__i != __last) 22043e519524SHoward Hinnant if (__comp(*__i, *__first)) 22053e519524SHoward Hinnant __first = __i; 22063e519524SHoward Hinnant } 22073e519524SHoward Hinnant return __first; 22083e519524SHoward Hinnant} 22093e519524SHoward Hinnant 22103e519524SHoward Hinnanttemplate <class _ForwardIterator> 22113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22123e519524SHoward Hinnant_ForwardIterator 22133e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 22143e519524SHoward Hinnant{ 2215ce48a113SHoward Hinnant return _VSTD::min_element(__first, __last, 22164eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22174eb27b79SHoward Hinnant} 22184eb27b79SHoward Hinnant 22194eb27b79SHoward Hinnant// min 22204eb27b79SHoward Hinnant 22214eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 22224eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22234eb27b79SHoward Hinnantconst _Tp& 22244eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 22254eb27b79SHoward Hinnant{ 22264eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 22274eb27b79SHoward Hinnant} 22284eb27b79SHoward Hinnant 22294eb27b79SHoward Hinnanttemplate <class _Tp> 22304eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22314eb27b79SHoward Hinnantconst _Tp& 22324eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 22334eb27b79SHoward Hinnant{ 2234ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 22354eb27b79SHoward Hinnant} 22364eb27b79SHoward Hinnant 223754976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 223854976f26SHoward Hinnant 22394eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 22404eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22414eb27b79SHoward Hinnant_Tp 22424eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 22434eb27b79SHoward Hinnant{ 2244ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 22454eb27b79SHoward Hinnant} 22464eb27b79SHoward Hinnant 22474eb27b79SHoward Hinnanttemplate<class _Tp> 22484eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22494eb27b79SHoward Hinnant_Tp 22504eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 22514eb27b79SHoward Hinnant{ 2252ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end()); 22533e519524SHoward Hinnant} 22543e519524SHoward Hinnant 225554976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 225654976f26SHoward Hinnant 22573e519524SHoward Hinnant// max_element 22583e519524SHoward Hinnant 22593e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 22603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22613e519524SHoward Hinnant_ForwardIterator 22623e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 22633e519524SHoward Hinnant{ 22643e519524SHoward Hinnant if (__first != __last) 22653e519524SHoward Hinnant { 22663e519524SHoward Hinnant _ForwardIterator __i = __first; 22673e519524SHoward Hinnant while (++__i != __last) 22683e519524SHoward Hinnant if (__comp(*__first, *__i)) 22693e519524SHoward Hinnant __first = __i; 22703e519524SHoward Hinnant } 22713e519524SHoward Hinnant return __first; 22723e519524SHoward Hinnant} 22733e519524SHoward Hinnant 22743e519524SHoward Hinnanttemplate <class _ForwardIterator> 22753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22763e519524SHoward Hinnant_ForwardIterator 22773e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 22783e519524SHoward Hinnant{ 2279ce48a113SHoward Hinnant return _VSTD::max_element(__first, __last, 22804eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22814eb27b79SHoward Hinnant} 22824eb27b79SHoward Hinnant 22834eb27b79SHoward Hinnant// max 22844eb27b79SHoward Hinnant 22854eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 22864eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22874eb27b79SHoward Hinnantconst _Tp& 22884eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 22894eb27b79SHoward Hinnant{ 22904eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 22914eb27b79SHoward Hinnant} 22924eb27b79SHoward Hinnant 22934eb27b79SHoward Hinnanttemplate <class _Tp> 22944eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22954eb27b79SHoward Hinnantconst _Tp& 22964eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 22974eb27b79SHoward Hinnant{ 2298ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 22994eb27b79SHoward Hinnant} 23004eb27b79SHoward Hinnant 230154976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 230254976f26SHoward Hinnant 23034eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 23044eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23054eb27b79SHoward Hinnant_Tp 23064eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 23074eb27b79SHoward Hinnant{ 2308ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 23094eb27b79SHoward Hinnant} 23104eb27b79SHoward Hinnant 23114eb27b79SHoward Hinnanttemplate<class _Tp> 23124eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23134eb27b79SHoward Hinnant_Tp 23144eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 23154eb27b79SHoward Hinnant{ 2316ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end()); 23173e519524SHoward Hinnant} 23183e519524SHoward Hinnant 231954976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 232054976f26SHoward Hinnant 23213e519524SHoward Hinnant// minmax_element 23223e519524SHoward Hinnant 23233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 23243e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 23253e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 23263e519524SHoward Hinnant{ 23273e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 23283e519524SHoward Hinnant if (__first != __last) 23293e519524SHoward Hinnant { 23303e519524SHoward Hinnant if (++__first != __last) 23313e519524SHoward Hinnant { 23323e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 23333e519524SHoward Hinnant __result.first = __first; 23343e519524SHoward Hinnant else 23353e519524SHoward Hinnant __result.second = __first; 23363e519524SHoward Hinnant while (++__first != __last) 23373e519524SHoward Hinnant { 23383e519524SHoward Hinnant _ForwardIterator __i = __first; 23393e519524SHoward Hinnant if (++__first == __last) 23403e519524SHoward Hinnant { 23413e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 23423e519524SHoward Hinnant __result.first = __i; 23433e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 23443e519524SHoward Hinnant __result.second = __i; 23453e519524SHoward Hinnant break; 23463e519524SHoward Hinnant } 23473e519524SHoward Hinnant else 23483e519524SHoward Hinnant { 23493e519524SHoward Hinnant if (__comp(*__first, *__i)) 23503e519524SHoward Hinnant { 23513e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 23523e519524SHoward Hinnant __result.first = __first; 23533e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 23543e519524SHoward Hinnant __result.second = __i; 23553e519524SHoward Hinnant } 23563e519524SHoward Hinnant else 23573e519524SHoward Hinnant { 23583e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 23593e519524SHoward Hinnant __result.first = __i; 23603e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 23613e519524SHoward Hinnant __result.second = __first; 23623e519524SHoward Hinnant } 23633e519524SHoward Hinnant } 23643e519524SHoward Hinnant } 23653e519524SHoward Hinnant } 23663e519524SHoward Hinnant } 23673e519524SHoward Hinnant return __result; 23683e519524SHoward Hinnant} 23693e519524SHoward Hinnant 23703e519524SHoward Hinnanttemplate <class _ForwardIterator> 23713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23723e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 23733e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 23743e519524SHoward Hinnant{ 2375ce48a113SHoward Hinnant return _VSTD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 23763e519524SHoward Hinnant} 23773e519524SHoward Hinnant 23784eb27b79SHoward Hinnant// minmax 23794eb27b79SHoward Hinnant 23804eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 23814eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23824eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 23834eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 23844eb27b79SHoward Hinnant{ 23854eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 23864eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 23874eb27b79SHoward Hinnant} 23884eb27b79SHoward Hinnant 23894eb27b79SHoward Hinnanttemplate<class _Tp> 23904eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23914eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 23924eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 23934eb27b79SHoward Hinnant{ 2394ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 23954eb27b79SHoward Hinnant} 23964eb27b79SHoward Hinnant 239754976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 239854976f26SHoward Hinnant 23994eb27b79SHoward Hinnanttemplate<class _Tp> 24004eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24014eb27b79SHoward Hinnantpair<_Tp, _Tp> 24024eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t) 24034eb27b79SHoward Hinnant{ 24044eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2405ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end()); 24064eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 24074eb27b79SHoward Hinnant} 24084eb27b79SHoward Hinnant 24094eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 24104eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24114eb27b79SHoward Hinnantpair<_Tp, _Tp> 24124eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 24134eb27b79SHoward Hinnant{ 24144eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2415ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end(), __comp); 24164eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 24174eb27b79SHoward Hinnant} 24184eb27b79SHoward Hinnant 241954976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 242054976f26SHoward Hinnant 24213e519524SHoward Hinnant// random_shuffle 24223e519524SHoward Hinnant 2423f9d540b0SHoward Hinnant// __independent_bits_engine 2424f9d540b0SHoward Hinnant 2425*c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2426f9d540b0SHoward Hinnantstruct __log2_imp 24273e519524SHoward Hinnant{ 2428*c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2429*c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 24303e519524SHoward Hinnant}; 24313e519524SHoward Hinnant 2432*c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2433*c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 24343e519524SHoward Hinnant{ 2435f9d540b0SHoward Hinnant static const size_t value = 0; 24363e519524SHoward Hinnant}; 24373e519524SHoward Hinnant 2438*c003db1fSHoward Hinnanttemplate <size_t _Rp> 2439*c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 24403e519524SHoward Hinnant{ 2441*c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 24423e519524SHoward Hinnant}; 24433e519524SHoward Hinnant 2444*c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2445f9d540b0SHoward Hinnantstruct __log2 24463e519524SHoward Hinnant{ 2447*c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2448f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 24493e519524SHoward Hinnant}; 24503e519524SHoward Hinnant 2451f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2452f9d540b0SHoward Hinnantclass __independent_bits_engine 24533e519524SHoward Hinnant{ 2454f9d540b0SHoward Hinnantpublic: 2455f9d540b0SHoward Hinnant // types 2456f9d540b0SHoward Hinnant typedef _UIntType result_type; 2457f9d540b0SHoward Hinnant 2458f9d540b0SHoward Hinnantprivate: 2459f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2460f9d540b0SHoward Hinnant typedef typename conditional 2461f9d540b0SHoward Hinnant < 2462f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2463f9d540b0SHoward Hinnant result_type, 2464f9d540b0SHoward Hinnant _Engine_result_type 2465f9d540b0SHoward Hinnant >::type _Working_result_type; 2466f9d540b0SHoward Hinnant 2467f9d540b0SHoward Hinnant _Engine& __e_; 2468f9d540b0SHoward Hinnant size_t __w_; 2469f9d540b0SHoward Hinnant size_t __w0_; 2470f9d540b0SHoward Hinnant size_t __n_; 2471f9d540b0SHoward Hinnant size_t __n0_; 2472f9d540b0SHoward Hinnant _Working_result_type __y0_; 2473f9d540b0SHoward Hinnant _Working_result_type __y1_; 2474f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2475f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2476f9d540b0SHoward Hinnant 2477*c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2478f9d540b0SHoward Hinnant + _Working_result_type(1); 2479*c003db1fSHoward Hinnant static const size_t __m = __log2<_Working_result_type, _Rp>::value; 2480f9d540b0SHoward Hinnant static const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2481f9d540b0SHoward Hinnant static const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2482f9d540b0SHoward Hinnant 2483f9d540b0SHoward Hinnantpublic: 2484f9d540b0SHoward Hinnant // constructors and seeding functions 2485f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2486f9d540b0SHoward Hinnant 2487f9d540b0SHoward Hinnant // generating functions 2488*c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2489f9d540b0SHoward Hinnant 2490f9d540b0SHoward Hinnantprivate: 2491f9d540b0SHoward Hinnant result_type __eval(false_type); 2492f9d540b0SHoward Hinnant result_type __eval(true_type); 2493f9d540b0SHoward Hinnant}; 2494f9d540b0SHoward Hinnant 2495f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2496f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2497f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2498f9d540b0SHoward Hinnant : __e_(__e), 2499f9d540b0SHoward Hinnant __w_(__w) 2500f9d540b0SHoward Hinnant{ 2501f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2502f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2503*c003db1fSHoward Hinnant if (_Rp == 0) 2504*c003db1fSHoward Hinnant __y0_ = _Rp; 2505f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2506*c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2507f9d540b0SHoward Hinnant else 2508f9d540b0SHoward Hinnant __y0_ = 0; 2509*c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2510f9d540b0SHoward Hinnant { 2511f9d540b0SHoward Hinnant ++__n_; 2512f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2513f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2514*c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2515f9d540b0SHoward Hinnant else 2516f9d540b0SHoward Hinnant __y0_ = 0; 2517f9d540b0SHoward Hinnant } 2518f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2519f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2520*c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2521f9d540b0SHoward Hinnant else 2522f9d540b0SHoward Hinnant __y1_ = 0; 2523f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2524f9d540b0SHoward Hinnant _Engine_result_type(0); 2525f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2526f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2527f9d540b0SHoward Hinnant _Engine_result_type(~0); 25283e519524SHoward Hinnant} 25293e519524SHoward Hinnant 2530f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2531f9d540b0SHoward Hinnantinline 2532f9d540b0SHoward Hinnant_UIntType 2533f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 25343e519524SHoward Hinnant{ 2535f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 25363e519524SHoward Hinnant} 25373e519524SHoward Hinnant 2538f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2539f9d540b0SHoward Hinnant_UIntType 2540f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 25413e519524SHoward Hinnant{ 2542*c003db1fSHoward Hinnant result_type _Sp = 0; 2543f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2544f9d540b0SHoward Hinnant { 2545f9d540b0SHoward Hinnant _Engine_result_type __u; 25463e519524SHoward Hinnant do 2547f9d540b0SHoward Hinnant { 2548f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2549f9d540b0SHoward Hinnant } while (__u >= __y0_); 25500176bc6cSHoward Hinnant if (__w0_ < _WDt) 2551*c003db1fSHoward Hinnant _Sp <<= __w0_; 2552f9d540b0SHoward Hinnant else 2553*c003db1fSHoward Hinnant _Sp = 0; 2554*c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2555f9d540b0SHoward Hinnant } 2556f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2557f9d540b0SHoward Hinnant { 2558f9d540b0SHoward Hinnant _Engine_result_type __u; 2559f9d540b0SHoward Hinnant do 2560f9d540b0SHoward Hinnant { 2561f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2562f9d540b0SHoward Hinnant } while (__u >= __y1_); 25630176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2564*c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2565f9d540b0SHoward Hinnant else 2566*c003db1fSHoward Hinnant _Sp = 0; 2567*c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2568f9d540b0SHoward Hinnant } 2569*c003db1fSHoward Hinnant return _Sp; 25703e519524SHoward Hinnant} 25713e519524SHoward Hinnant 2572f9d540b0SHoward Hinnant// uniform_int_distribution 25733e519524SHoward Hinnant 2574f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2575f9d540b0SHoward Hinnantclass uniform_int_distribution 25763e519524SHoward Hinnant{ 2577f9d540b0SHoward Hinnantpublic: 2578f9d540b0SHoward Hinnant // types 2579f9d540b0SHoward Hinnant typedef _IntType result_type; 2580f9d540b0SHoward Hinnant 2581f9d540b0SHoward Hinnant class param_type 2582f9d540b0SHoward Hinnant { 2583f9d540b0SHoward Hinnant result_type __a_; 2584f9d540b0SHoward Hinnant result_type __b_; 2585f9d540b0SHoward Hinnant public: 2586f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2587f9d540b0SHoward Hinnant 2588f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2589f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2590f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2591f9d540b0SHoward Hinnant 2592f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2593f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2594f9d540b0SHoward Hinnant 2595f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2596f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2597f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2598f9d540b0SHoward Hinnant {return !(__x == __y);} 25993e519524SHoward Hinnant }; 26003e519524SHoward Hinnant 2601f9d540b0SHoward Hinnantprivate: 2602f9d540b0SHoward Hinnant param_type __p_; 26033e519524SHoward Hinnant 2604f9d540b0SHoward Hinnantpublic: 2605f9d540b0SHoward Hinnant // constructors and reset functions 2606f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2607f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2608f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2609f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2610f9d540b0SHoward Hinnant void reset() {} 2611f9d540b0SHoward Hinnant 2612f9d540b0SHoward Hinnant // generating functions 2613f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2614f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2615f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2616f9d540b0SHoward Hinnant 2617f9d540b0SHoward Hinnant // property functions 2618f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2619f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2620f9d540b0SHoward Hinnant 2621f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2622f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2623f9d540b0SHoward Hinnant 2624f9d540b0SHoward Hinnant result_type min() const {return a();} 2625f9d540b0SHoward Hinnant result_type max() const {return b();} 2626f9d540b0SHoward Hinnant 2627f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2628f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2629f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2630f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2631f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2632f9d540b0SHoward Hinnant {return !(__x == __y);} 26333e519524SHoward Hinnant}; 26343e519524SHoward Hinnant 2635f9d540b0SHoward Hinnanttemplate<class _IntType> 2636f9d540b0SHoward Hinnanttemplate<class _URNG> 2637f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2638f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 26393e519524SHoward Hinnant{ 2640f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2641f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2642*c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 2643*c003db1fSHoward Hinnant if (_Rp == 1) 2644f9d540b0SHoward Hinnant return __p.a(); 2645f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2646f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2647*c003db1fSHoward Hinnant if (_Rp == 0) 2648f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2649*c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2650*c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 2651f9d540b0SHoward Hinnant ++__w; 2652f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2653f9d540b0SHoward Hinnant _UIntType __u; 2654f9d540b0SHoward Hinnant do 26553e519524SHoward Hinnant { 2656f9d540b0SHoward Hinnant __u = __e(); 2657*c003db1fSHoward Hinnant } while (__u >= _Rp); 2658f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 26593e519524SHoward Hinnant} 2660f9d540b0SHoward Hinnant 2661f9d540b0SHoward Hinnantclass __rs_default; 2662f9d540b0SHoward Hinnant 2663f9d540b0SHoward Hinnant__rs_default __rs_get(); 2664f9d540b0SHoward Hinnant 2665f9d540b0SHoward Hinnantclass __rs_default 26663e519524SHoward Hinnant{ 2667f9d540b0SHoward Hinnant static unsigned __c_; 2668f9d540b0SHoward Hinnant 2669f9d540b0SHoward Hinnant __rs_default(); 2670f9d540b0SHoward Hinnantpublic: 2671f9d540b0SHoward Hinnant typedef unsigned result_type; 2672f9d540b0SHoward Hinnant 2673f9d540b0SHoward Hinnant static const result_type _Min = 0; 2674f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2675f9d540b0SHoward Hinnant 2676f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2677f9d540b0SHoward Hinnant ~__rs_default(); 2678f9d540b0SHoward Hinnant 2679f9d540b0SHoward Hinnant result_type operator()(); 2680f9d540b0SHoward Hinnant 2681f9d540b0SHoward Hinnant static const/*expr*/ result_type min() {return _Min;} 2682f9d540b0SHoward Hinnant static const/*expr*/ result_type max() {return _Max;} 2683f9d540b0SHoward Hinnant 2684f9d540b0SHoward Hinnant friend __rs_default __rs_get(); 2685f9d540b0SHoward Hinnant}; 2686f9d540b0SHoward Hinnant 2687f9d540b0SHoward Hinnant__rs_default __rs_get(); 26883e519524SHoward Hinnant 26893e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 26903e519524SHoward Hinnantvoid 26913e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 26923e519524SHoward Hinnant{ 26933e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2694*c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2695*c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 26963e519524SHoward Hinnant difference_type __d = __last - __first; 26973e519524SHoward Hinnant if (__d > 1) 26983e519524SHoward Hinnant { 2699*c003db1fSHoward Hinnant _Dp __uid; 2700f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 2701f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2702007b26beSHoward Hinnant { 2703*c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 2704007b26beSHoward Hinnant if (__i != difference_type(0)) 2705007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2706007b26beSHoward Hinnant } 27073e519524SHoward Hinnant } 27083e519524SHoward Hinnant} 27093e519524SHoward Hinnant 27103e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 27113e519524SHoward Hinnantvoid 27123e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 27137609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 27143e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 27153e519524SHoward Hinnant#else 27163e519524SHoward Hinnant _RandomNumberGenerator& __rand) 27173e519524SHoward Hinnant#endif 27183e519524SHoward Hinnant{ 27193e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 27203e519524SHoward Hinnant difference_type __d = __last - __first; 27213e519524SHoward Hinnant if (__d > 1) 27223e519524SHoward Hinnant { 27233e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 2724007b26beSHoward Hinnant { 2725007b26beSHoward Hinnant difference_type __i = __rand(__d); 2726007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2727007b26beSHoward Hinnant } 27283e519524SHoward Hinnant } 27293e519524SHoward Hinnant} 27303e519524SHoward Hinnant 2731f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 2732f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 2733fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 2734fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 2735fb340102SHoward Hinnant#else 2736f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 2737fb340102SHoward Hinnant#endif 2738f9d540b0SHoward Hinnant{ 2739f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2740*c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2741*c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 2742f9d540b0SHoward Hinnant difference_type __d = __last - __first; 2743f9d540b0SHoward Hinnant if (__d > 1) 2744f9d540b0SHoward Hinnant { 2745*c003db1fSHoward Hinnant _Dp __uid; 2746f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2747007b26beSHoward Hinnant { 2748*c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 2749007b26beSHoward Hinnant if (__i != difference_type(0)) 2750007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2751007b26beSHoward Hinnant } 2752f9d540b0SHoward Hinnant } 2753f9d540b0SHoward Hinnant} 2754f9d540b0SHoward Hinnant 27553e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 27563e519524SHoward Hinnantbool 27573e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 27583e519524SHoward Hinnant{ 27593e519524SHoward Hinnant for (; __first != __last; ++__first) 27603e519524SHoward Hinnant if (!__pred(*__first)) 27613e519524SHoward Hinnant break; 27623e519524SHoward Hinnant for (; __first != __last; ++__first) 27633e519524SHoward Hinnant if (__pred(*__first)) 27643e519524SHoward Hinnant return false; 27653e519524SHoward Hinnant return true; 27663e519524SHoward Hinnant} 27673e519524SHoward Hinnant 27683e519524SHoward Hinnant// partition 27693e519524SHoward Hinnant 27703e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 27713e519524SHoward Hinnant_ForwardIterator 27723e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 27733e519524SHoward Hinnant{ 27743e519524SHoward Hinnant while (true) 27753e519524SHoward Hinnant { 27763e519524SHoward Hinnant if (__first == __last) 27773e519524SHoward Hinnant return __first; 27783e519524SHoward Hinnant if (!__pred(*__first)) 27793e519524SHoward Hinnant break; 27803e519524SHoward Hinnant ++__first; 27813e519524SHoward Hinnant } 27823e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 27833e519524SHoward Hinnant { 27843e519524SHoward Hinnant if (__pred(*__p)) 27853e519524SHoward Hinnant { 27863e519524SHoward Hinnant swap(*__first, *__p); 27873e519524SHoward Hinnant ++__first; 27883e519524SHoward Hinnant } 27893e519524SHoward Hinnant } 27903e519524SHoward Hinnant return __first; 27913e519524SHoward Hinnant} 27923e519524SHoward Hinnant 27933e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 27943e519524SHoward Hinnant_BidirectionalIterator 27953e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 27963e519524SHoward Hinnant bidirectional_iterator_tag) 27973e519524SHoward Hinnant{ 27983e519524SHoward Hinnant while (true) 27993e519524SHoward Hinnant { 28003e519524SHoward Hinnant while (true) 28013e519524SHoward Hinnant { 28023e519524SHoward Hinnant if (__first == __last) 28033e519524SHoward Hinnant return __first; 28043e519524SHoward Hinnant if (!__pred(*__first)) 28053e519524SHoward Hinnant break; 28063e519524SHoward Hinnant ++__first; 28073e519524SHoward Hinnant } 28083e519524SHoward Hinnant do 28093e519524SHoward Hinnant { 28103e519524SHoward Hinnant if (__first == --__last) 28113e519524SHoward Hinnant return __first; 28123e519524SHoward Hinnant } while (!__pred(*__last)); 28133e519524SHoward Hinnant swap(*__first, *__last); 28143e519524SHoward Hinnant ++__first; 28153e519524SHoward Hinnant } 28163e519524SHoward Hinnant} 28173e519524SHoward Hinnant 28183e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 28193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 28203e519524SHoward Hinnant_ForwardIterator 28213e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 28223e519524SHoward Hinnant{ 2823ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 28243e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 28253e519524SHoward Hinnant} 28263e519524SHoward Hinnant 28273e519524SHoward Hinnant// partition_copy 28283e519524SHoward Hinnant 28293e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 28303e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 28313e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 28323e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 28333e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 28343e519524SHoward Hinnant _Predicate __pred) 28353e519524SHoward Hinnant{ 28363e519524SHoward Hinnant for (; __first != __last; ++__first) 28373e519524SHoward Hinnant { 28383e519524SHoward Hinnant if (__pred(*__first)) 28393e519524SHoward Hinnant { 28403e519524SHoward Hinnant *__out_true = *__first; 28413e519524SHoward Hinnant ++__out_true; 28423e519524SHoward Hinnant } 28433e519524SHoward Hinnant else 28443e519524SHoward Hinnant { 28453e519524SHoward Hinnant *__out_false = *__first; 28463e519524SHoward Hinnant ++__out_false; 28473e519524SHoward Hinnant } 28483e519524SHoward Hinnant } 28493e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 28503e519524SHoward Hinnant} 28513e519524SHoward Hinnant 28523e519524SHoward Hinnant// partition_point 28533e519524SHoward Hinnant 28543e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 28553e519524SHoward Hinnant_ForwardIterator 28563e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 28573e519524SHoward Hinnant{ 28583e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 2859ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 28603e519524SHoward Hinnant while (__len != 0) 28613e519524SHoward Hinnant { 28623e519524SHoward Hinnant difference_type __l2 = __len / 2; 28633e519524SHoward Hinnant _ForwardIterator __m = __first; 2864ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 28653e519524SHoward Hinnant if (__pred(*__m)) 28663e519524SHoward Hinnant { 28673e519524SHoward Hinnant __first = ++__m; 28683e519524SHoward Hinnant __len -= __l2 + 1; 28693e519524SHoward Hinnant } 28703e519524SHoward Hinnant else 28713e519524SHoward Hinnant __len = __l2; 28723e519524SHoward Hinnant } 28733e519524SHoward Hinnant return __first; 28743e519524SHoward Hinnant} 28753e519524SHoward Hinnant 28763e519524SHoward Hinnant// stable_partition 28773e519524SHoward Hinnant 28783e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 28793e519524SHoward Hinnant_ForwardIterator 28803e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 28813e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 28823e519524SHoward Hinnant{ 28833e519524SHoward Hinnant // *__first is known to be false 28843e519524SHoward Hinnant // __len >= 1 28853e519524SHoward Hinnant if (__len == 1) 28863e519524SHoward Hinnant return __first; 28873e519524SHoward Hinnant if (__len == 2) 28883e519524SHoward Hinnant { 28893e519524SHoward Hinnant _ForwardIterator __m = __first; 28903e519524SHoward Hinnant if (__pred(*++__m)) 28913e519524SHoward Hinnant { 28923e519524SHoward Hinnant swap(*__first, *__m); 28933e519524SHoward Hinnant return __m; 28943e519524SHoward Hinnant } 28953e519524SHoward Hinnant return __first; 28963e519524SHoward Hinnant } 28973e519524SHoward Hinnant if (__len <= __p.second) 28983e519524SHoward Hinnant { // The buffer is big enough to use 28993e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 29003e519524SHoward Hinnant __destruct_n __d(0); 29013e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 29023e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 29033e519524SHoward Hinnant // Update __first to always point to the end of the trues 29043e519524SHoward Hinnant value_type* __t = __p.first; 2905ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 29063e519524SHoward Hinnant __d.__incr((value_type*)0); 29073e519524SHoward Hinnant ++__t; 29083e519524SHoward Hinnant _ForwardIterator __i = __first; 29093e519524SHoward Hinnant while (++__i != __last) 29103e519524SHoward Hinnant { 29113e519524SHoward Hinnant if (__pred(*__i)) 29123e519524SHoward Hinnant { 2913ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 29143e519524SHoward Hinnant ++__first; 29153e519524SHoward Hinnant } 29163e519524SHoward Hinnant else 29173e519524SHoward Hinnant { 2918ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 29193e519524SHoward Hinnant __d.__incr((value_type*)0); 29203e519524SHoward Hinnant ++__t; 29213e519524SHoward Hinnant } 29223e519524SHoward Hinnant } 29233e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 29243e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 29253e519524SHoward Hinnant __i = __first; 29263e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 2927ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 29283e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 29293e519524SHoward Hinnant return __first; 29303e519524SHoward Hinnant } 29313e519524SHoward Hinnant // Else not enough buffer, do in place 29323e519524SHoward Hinnant // __len >= 3 29333e519524SHoward Hinnant _ForwardIterator __m = __first; 29343e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 2935ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 29363e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 29373e519524SHoward Hinnant // F????????????????? 29383e519524SHoward Hinnant // f m l 29393e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 29403e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 29413e519524SHoward Hinnant // TTTFFFFF?????????? 29423e519524SHoward Hinnant // f ff m l 29433e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 29443e519524SHoward Hinnant _ForwardIterator __m1 = __m; 29453e519524SHoward Hinnant _ForwardIterator __second_false = __last; 29463e519524SHoward Hinnant _Distance __len_half = __len - __len2; 29473e519524SHoward Hinnant while (__pred(*__m1)) 29483e519524SHoward Hinnant { 29493e519524SHoward Hinnant if (++__m1 == __last) 29503e519524SHoward Hinnant goto __second_half_done; 29513e519524SHoward Hinnant --__len_half; 29523e519524SHoward Hinnant } 29533e519524SHoward Hinnant // TTTFFFFFTTTF?????? 29543e519524SHoward Hinnant // f ff m m1 l 29553e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 29563e519524SHoward Hinnant__second_half_done: 29573e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 29583e519524SHoward Hinnant // f ff m sf l 2959ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 29603e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 29613e519524SHoward Hinnant // | 29623e519524SHoward Hinnant} 29633e519524SHoward Hinnant 29643e519524SHoward Hinnantstruct __return_temporary_buffer 29653e519524SHoward Hinnant{ 29663e519524SHoward Hinnant template <class _Tp> 2967ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 29683e519524SHoward Hinnant}; 29693e519524SHoward Hinnant 29703e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 29713e519524SHoward Hinnant_ForwardIterator 29723e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 29733e519524SHoward Hinnant forward_iterator_tag) 29743e519524SHoward Hinnant{ 29753e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 29763e519524SHoward Hinnant // Either prove all true and return __first or point to first false 29773e519524SHoward Hinnant while (true) 29783e519524SHoward Hinnant { 29793e519524SHoward Hinnant if (__first == __last) 29803e519524SHoward Hinnant return __first; 29813e519524SHoward Hinnant if (!__pred(*__first)) 29823e519524SHoward Hinnant break; 29833e519524SHoward Hinnant ++__first; 29843e519524SHoward Hinnant } 29853e519524SHoward Hinnant // We now have a reduced range [__first, __last) 29863e519524SHoward Hinnant // *__first is known to be false 29873e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 29883e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2989ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 29903e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 29913e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 29923e519524SHoward Hinnant if (__len >= __alloc_limit) 29933e519524SHoward Hinnant { 2994ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 29953e519524SHoward Hinnant __h.reset(__p.first); 29963e519524SHoward Hinnant } 29973e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 29983e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 29993e519524SHoward Hinnant} 30003e519524SHoward Hinnant 30013e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 30023e519524SHoward Hinnant_BidirectionalIterator 30033e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 30043e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 30053e519524SHoward Hinnant{ 30063e519524SHoward Hinnant // *__first is known to be false 30073e519524SHoward Hinnant // *__last is known to be true 30083e519524SHoward Hinnant // __len >= 2 30093e519524SHoward Hinnant if (__len == 2) 30103e519524SHoward Hinnant { 30113e519524SHoward Hinnant swap(*__first, *__last); 30123e519524SHoward Hinnant return __last; 30133e519524SHoward Hinnant } 30143e519524SHoward Hinnant if (__len == 3) 30153e519524SHoward Hinnant { 30163e519524SHoward Hinnant _BidirectionalIterator __m = __first; 30173e519524SHoward Hinnant if (__pred(*++__m)) 30183e519524SHoward Hinnant { 30193e519524SHoward Hinnant swap(*__first, *__m); 30203e519524SHoward Hinnant swap(*__m, *__last); 30213e519524SHoward Hinnant return __last; 30223e519524SHoward Hinnant } 30233e519524SHoward Hinnant swap(*__m, *__last); 30243e519524SHoward Hinnant swap(*__first, *__m); 30253e519524SHoward Hinnant return __m; 30263e519524SHoward Hinnant } 30273e519524SHoward Hinnant if (__len <= __p.second) 30283e519524SHoward Hinnant { // The buffer is big enough to use 30293e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 30303e519524SHoward Hinnant __destruct_n __d(0); 30313e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 30323e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 30333e519524SHoward Hinnant // Update __first to always point to the end of the trues 30343e519524SHoward Hinnant value_type* __t = __p.first; 3035ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 30363e519524SHoward Hinnant __d.__incr((value_type*)0); 30373e519524SHoward Hinnant ++__t; 30383e519524SHoward Hinnant _BidirectionalIterator __i = __first; 30393e519524SHoward Hinnant while (++__i != __last) 30403e519524SHoward Hinnant { 30413e519524SHoward Hinnant if (__pred(*__i)) 30423e519524SHoward Hinnant { 3043ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 30443e519524SHoward Hinnant ++__first; 30453e519524SHoward Hinnant } 30463e519524SHoward Hinnant else 30473e519524SHoward Hinnant { 3048ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 30493e519524SHoward Hinnant __d.__incr((value_type*)0); 30503e519524SHoward Hinnant ++__t; 30513e519524SHoward Hinnant } 30523e519524SHoward Hinnant } 30533e519524SHoward Hinnant // move *__last, known to be true 3054ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 30553e519524SHoward Hinnant __i = ++__first; 30563e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 30573e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 30583e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3059ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 30603e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 30613e519524SHoward Hinnant return __first; 30623e519524SHoward Hinnant } 30633e519524SHoward Hinnant // Else not enough buffer, do in place 30643e519524SHoward Hinnant // __len >= 4 30653e519524SHoward Hinnant _BidirectionalIterator __m = __first; 30663e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3067ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 30683e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 30693e519524SHoward Hinnant // F????????????????T 30703e519524SHoward Hinnant // f m l 30713e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 30723e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 30733e519524SHoward Hinnant _Distance __len_half = __len2; 30743e519524SHoward Hinnant while (!__pred(*--__m1)) 30753e519524SHoward Hinnant { 30763e519524SHoward Hinnant if (__m1 == __first) 30773e519524SHoward Hinnant goto __first_half_done; 30783e519524SHoward Hinnant --__len_half; 30793e519524SHoward Hinnant } 30803e519524SHoward Hinnant // F???TFFF?????????T 30813e519524SHoward Hinnant // f m1 m l 30823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 30833e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 30843e519524SHoward Hinnant__first_half_done: 30853e519524SHoward Hinnant // TTTFFFFF?????????T 30863e519524SHoward Hinnant // f ff m l 30873e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 30883e519524SHoward Hinnant __m1 = __m; 30893e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 30903e519524SHoward Hinnant ++__second_false; 30913e519524SHoward Hinnant __len_half = __len - __len2; 30923e519524SHoward Hinnant while (__pred(*__m1)) 30933e519524SHoward Hinnant { 30943e519524SHoward Hinnant if (++__m1 == __last) 30953e519524SHoward Hinnant goto __second_half_done; 30963e519524SHoward Hinnant --__len_half; 30973e519524SHoward Hinnant } 30983e519524SHoward Hinnant // TTTFFFFFTTTF?????T 30993e519524SHoward Hinnant // f ff m m1 l 31003e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 31013e519524SHoward Hinnant__second_half_done: 31023e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 31033e519524SHoward Hinnant // f ff m sf l 3104ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 31053e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 31063e519524SHoward Hinnant // | 31073e519524SHoward Hinnant} 31083e519524SHoward Hinnant 31093e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31103e519524SHoward Hinnant_BidirectionalIterator 31113e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31123e519524SHoward Hinnant bidirectional_iterator_tag) 31133e519524SHoward Hinnant{ 31143e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 31153e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 31163e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 31173e519524SHoward Hinnant // Either prove all true and return __first or point to first false 31183e519524SHoward Hinnant while (true) 31193e519524SHoward Hinnant { 31203e519524SHoward Hinnant if (__first == __last) 31213e519524SHoward Hinnant return __first; 31223e519524SHoward Hinnant if (!__pred(*__first)) 31233e519524SHoward Hinnant break; 31243e519524SHoward Hinnant ++__first; 31253e519524SHoward Hinnant } 31263e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 31273e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 31283e519524SHoward Hinnant do 31293e519524SHoward Hinnant { 31303e519524SHoward Hinnant if (__first == --__last) 31313e519524SHoward Hinnant return __first; 31323e519524SHoward Hinnant } while (!__pred(*__last)); 31333e519524SHoward Hinnant // We now have a reduced range [__first, __last] 31343e519524SHoward Hinnant // *__first is known to be false 31353e519524SHoward Hinnant // *__last is known to be true 31363e519524SHoward Hinnant // __len >= 2 3137ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 31383e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 31393e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 31403e519524SHoward Hinnant if (__len >= __alloc_limit) 31413e519524SHoward Hinnant { 3142ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 31433e519524SHoward Hinnant __h.reset(__p.first); 31443e519524SHoward Hinnant } 31453e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 31463e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 31473e519524SHoward Hinnant} 31483e519524SHoward Hinnant 31493e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31513e519524SHoward Hinnant_ForwardIterator 31523e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31533e519524SHoward Hinnant{ 31543e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 31553e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31563e519524SHoward Hinnant} 31573e519524SHoward Hinnant 31583e519524SHoward Hinnant// is_sorted_until 31593e519524SHoward Hinnant 31603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 31613e519524SHoward Hinnant_ForwardIterator 31623e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 31633e519524SHoward Hinnant{ 31643e519524SHoward Hinnant if (__first != __last) 31653e519524SHoward Hinnant { 31663e519524SHoward Hinnant _ForwardIterator __i = __first; 31673e519524SHoward Hinnant while (++__i != __last) 31683e519524SHoward Hinnant { 31693e519524SHoward Hinnant if (__comp(*__i, *__first)) 31703e519524SHoward Hinnant return __i; 31713e519524SHoward Hinnant __first = __i; 31723e519524SHoward Hinnant } 31733e519524SHoward Hinnant } 31743e519524SHoward Hinnant return __last; 31753e519524SHoward Hinnant} 31763e519524SHoward Hinnant 31773e519524SHoward Hinnanttemplate<class _ForwardIterator> 31783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31793e519524SHoward Hinnant_ForwardIterator 31803e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 31813e519524SHoward Hinnant{ 3182ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 31833e519524SHoward Hinnant} 31843e519524SHoward Hinnant 31853e519524SHoward Hinnant// is_sorted 31863e519524SHoward Hinnant 31873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 31883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31893e519524SHoward Hinnantbool 31903e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 31913e519524SHoward Hinnant{ 3192ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 31933e519524SHoward Hinnant} 31943e519524SHoward Hinnant 31953e519524SHoward Hinnanttemplate<class _ForwardIterator> 31963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31973e519524SHoward Hinnantbool 31983e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 31993e519524SHoward Hinnant{ 3200ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 32013e519524SHoward Hinnant} 32023e519524SHoward Hinnant 32033e519524SHoward Hinnant// sort 32043e519524SHoward Hinnant 32053e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 32063e519524SHoward Hinnant 32073e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 32083e519524SHoward Hinnantunsigned 32093e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 32103e519524SHoward Hinnant{ 32113e519524SHoward Hinnant unsigned __r = 0; 32123e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 32133e519524SHoward Hinnant { 32143e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 32153e519524SHoward Hinnant return __r; // x <= y && y <= z 32163e519524SHoward Hinnant // x <= y && y > z 32173e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 32183e519524SHoward Hinnant __r = 1; 32193e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 32203e519524SHoward Hinnant { 32213e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 32223e519524SHoward Hinnant __r = 2; 32233e519524SHoward Hinnant } 32243e519524SHoward Hinnant return __r; // x <= y && y < z 32253e519524SHoward Hinnant } 32263e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 32273e519524SHoward Hinnant { 32283e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 32293e519524SHoward Hinnant __r = 1; 32303e519524SHoward Hinnant return __r; 32313e519524SHoward Hinnant } 32323e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 32333e519524SHoward Hinnant __r = 1; // x < y && x <= z 32343e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 32353e519524SHoward Hinnant { 32363e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 32373e519524SHoward Hinnant __r = 2; 32383e519524SHoward Hinnant } 32393e519524SHoward Hinnant return __r; 32403e519524SHoward Hinnant} // x <= y && y <= z 32413e519524SHoward Hinnant 32423e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 32433e519524SHoward Hinnant 32443e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 32453e519524SHoward Hinnantunsigned 32463e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 32473e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 32483e519524SHoward Hinnant{ 32493e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 32503e519524SHoward Hinnant if (__c(*__x4, *__x3)) 32513e519524SHoward Hinnant { 32523e519524SHoward Hinnant swap(*__x3, *__x4); 32533e519524SHoward Hinnant ++__r; 32543e519524SHoward Hinnant if (__c(*__x3, *__x2)) 32553e519524SHoward Hinnant { 32563e519524SHoward Hinnant swap(*__x2, *__x3); 32573e519524SHoward Hinnant ++__r; 32583e519524SHoward Hinnant if (__c(*__x2, *__x1)) 32593e519524SHoward Hinnant { 32603e519524SHoward Hinnant swap(*__x1, *__x2); 32613e519524SHoward Hinnant ++__r; 32623e519524SHoward Hinnant } 32633e519524SHoward Hinnant } 32643e519524SHoward Hinnant } 32653e519524SHoward Hinnant return __r; 32663e519524SHoward Hinnant} 32673e519524SHoward Hinnant 32683e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 32693e519524SHoward Hinnant 32703e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 32713e519524SHoward Hinnantunsigned 32723e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 32733e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 32743e519524SHoward Hinnant{ 32753e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 32763e519524SHoward Hinnant if (__c(*__x5, *__x4)) 32773e519524SHoward Hinnant { 32783e519524SHoward Hinnant swap(*__x4, *__x5); 32793e519524SHoward Hinnant ++__r; 32803e519524SHoward Hinnant if (__c(*__x4, *__x3)) 32813e519524SHoward Hinnant { 32823e519524SHoward Hinnant swap(*__x3, *__x4); 32833e519524SHoward Hinnant ++__r; 32843e519524SHoward Hinnant if (__c(*__x3, *__x2)) 32853e519524SHoward Hinnant { 32863e519524SHoward Hinnant swap(*__x2, *__x3); 32873e519524SHoward Hinnant ++__r; 32883e519524SHoward Hinnant if (__c(*__x2, *__x1)) 32893e519524SHoward Hinnant { 32903e519524SHoward Hinnant swap(*__x1, *__x2); 32913e519524SHoward Hinnant ++__r; 32923e519524SHoward Hinnant } 32933e519524SHoward Hinnant } 32943e519524SHoward Hinnant } 32953e519524SHoward Hinnant } 32963e519524SHoward Hinnant return __r; 32973e519524SHoward Hinnant} 32983e519524SHoward Hinnant 32993e519524SHoward Hinnant// Assumes size > 0 33003e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 33013e519524SHoward Hinnantvoid 33023e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 33033e519524SHoward Hinnant{ 33043e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 33053e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 33063e519524SHoward Hinnant { 3307ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 33083e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 33093e519524SHoward Hinnant (__first, __last, __comp); 33103e519524SHoward Hinnant if (__i != __first) 33113e519524SHoward Hinnant swap(*__first, *__i); 33123e519524SHoward Hinnant } 33133e519524SHoward Hinnant} 33143e519524SHoward Hinnant 33153e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 33163e519524SHoward Hinnantvoid 33173e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 33183e519524SHoward Hinnant{ 33193e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 33203e519524SHoward Hinnant if (__first != __last) 33213e519524SHoward Hinnant { 33223e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 33233e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 33243e519524SHoward Hinnant { 33253e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3326ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 33273e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3328ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3329ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 33303e519524SHoward Hinnant } 33313e519524SHoward Hinnant } 33323e519524SHoward Hinnant} 33333e519524SHoward Hinnant 33343e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 33353e519524SHoward Hinnantvoid 33363e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 33373e519524SHoward Hinnant{ 33383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 33393e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 33403e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 33413e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 33423e519524SHoward Hinnant { 33433e519524SHoward Hinnant if (__comp(*__i, *__j)) 33443e519524SHoward Hinnant { 3345ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 33463e519524SHoward Hinnant _RandomAccessIterator __k = __j; 33473e519524SHoward Hinnant __j = __i; 33483e519524SHoward Hinnant do 33493e519524SHoward Hinnant { 3350ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 33513e519524SHoward Hinnant __j = __k; 33523e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3353ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 33543e519524SHoward Hinnant } 33553e519524SHoward Hinnant __j = __i; 33563e519524SHoward Hinnant } 33573e519524SHoward Hinnant} 33583e519524SHoward Hinnant 33593e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 33603e519524SHoward Hinnantbool 33613e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 33623e519524SHoward Hinnant{ 33633e519524SHoward Hinnant switch (__last - __first) 33643e519524SHoward Hinnant { 33653e519524SHoward Hinnant case 0: 33663e519524SHoward Hinnant case 1: 33673e519524SHoward Hinnant return true; 33683e519524SHoward Hinnant case 2: 33693e519524SHoward Hinnant if (__comp(*--__last, *__first)) 33703e519524SHoward Hinnant swap(*__first, *__last); 33713e519524SHoward Hinnant return true; 33723e519524SHoward Hinnant case 3: 3373ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 33743e519524SHoward Hinnant return true; 33753e519524SHoward Hinnant case 4: 3376ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 33773e519524SHoward Hinnant return true; 33783e519524SHoward Hinnant case 5: 3379ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 33803e519524SHoward Hinnant return true; 33813e519524SHoward Hinnant } 33823e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 33833e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 33843e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 33853e519524SHoward Hinnant const unsigned __limit = 8; 33863e519524SHoward Hinnant unsigned __count = 0; 33873e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 33883e519524SHoward Hinnant { 33893e519524SHoward Hinnant if (__comp(*__i, *__j)) 33903e519524SHoward Hinnant { 3391ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 33923e519524SHoward Hinnant _RandomAccessIterator __k = __j; 33933e519524SHoward Hinnant __j = __i; 33943e519524SHoward Hinnant do 33953e519524SHoward Hinnant { 3396ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 33973e519524SHoward Hinnant __j = __k; 33983e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3399ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 34003e519524SHoward Hinnant if (++__count == __limit) 34013e519524SHoward Hinnant return ++__i == __last; 34023e519524SHoward Hinnant } 34033e519524SHoward Hinnant __j = __i; 34043e519524SHoward Hinnant } 34053e519524SHoward Hinnant return true; 34063e519524SHoward Hinnant} 34073e519524SHoward Hinnant 34083e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 34093e519524SHoward Hinnantvoid 34103e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 34113e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 34123e519524SHoward Hinnant{ 34133e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 34143e519524SHoward Hinnant if (__first1 != __last1) 34153e519524SHoward Hinnant { 34163e519524SHoward Hinnant __destruct_n __d(0); 34173e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 34183e519524SHoward Hinnant value_type* __last2 = __first2; 3419ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 34203e519524SHoward Hinnant __d.__incr((value_type*)0); 34213e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 34223e519524SHoward Hinnant { 34233e519524SHoward Hinnant value_type* __j2 = __last2; 34243e519524SHoward Hinnant value_type* __i2 = __j2; 34253e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 34263e519524SHoward Hinnant { 3427ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 34283e519524SHoward Hinnant __d.__incr((value_type*)0); 34293e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3430ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3431ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 34323e519524SHoward Hinnant } 34333e519524SHoward Hinnant else 34343e519524SHoward Hinnant { 3435ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 34363e519524SHoward Hinnant __d.__incr((value_type*)0); 34373e519524SHoward Hinnant } 34383e519524SHoward Hinnant } 34393e519524SHoward Hinnant __h.release(); 34403e519524SHoward Hinnant } 34413e519524SHoward Hinnant} 34423e519524SHoward Hinnant 34433e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 34443e519524SHoward Hinnantvoid 34453e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 34463e519524SHoward Hinnant{ 34473e519524SHoward Hinnant // _Compare is known to be a reference type 34483e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 34493e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3450ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3451ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 34523e519524SHoward Hinnant while (true) 34533e519524SHoward Hinnant { 34543e519524SHoward Hinnant __restart: 34553e519524SHoward Hinnant difference_type __len = __last - __first; 34563e519524SHoward Hinnant switch (__len) 34573e519524SHoward Hinnant { 34583e519524SHoward Hinnant case 0: 34593e519524SHoward Hinnant case 1: 34603e519524SHoward Hinnant return; 34613e519524SHoward Hinnant case 2: 34623e519524SHoward Hinnant if (__comp(*--__last, *__first)) 34633e519524SHoward Hinnant swap(*__first, *__last); 34643e519524SHoward Hinnant return; 34653e519524SHoward Hinnant case 3: 3466ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 34673e519524SHoward Hinnant return; 34683e519524SHoward Hinnant case 4: 3469ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 34703e519524SHoward Hinnant return; 34713e519524SHoward Hinnant case 5: 3472ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 34733e519524SHoward Hinnant return; 34743e519524SHoward Hinnant } 34753e519524SHoward Hinnant if (__len <= __limit) 34763e519524SHoward Hinnant { 3477ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 34783e519524SHoward Hinnant return; 34793e519524SHoward Hinnant } 34803e519524SHoward Hinnant // __len > 5 34813e519524SHoward Hinnant _RandomAccessIterator __m = __first; 34823e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 34833e519524SHoward Hinnant --__lm1; 34843e519524SHoward Hinnant unsigned __n_swaps; 34853e519524SHoward Hinnant { 34863e519524SHoward Hinnant difference_type __delta; 34873e519524SHoward Hinnant if (__len >= 1000) 34883e519524SHoward Hinnant { 34893e519524SHoward Hinnant __delta = __len/2; 34903e519524SHoward Hinnant __m += __delta; 34913e519524SHoward Hinnant __delta /= 2; 3492ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 34933e519524SHoward Hinnant } 34943e519524SHoward Hinnant else 34953e519524SHoward Hinnant { 34963e519524SHoward Hinnant __delta = __len/2; 34973e519524SHoward Hinnant __m += __delta; 3498ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 34993e519524SHoward Hinnant } 35003e519524SHoward Hinnant } 35013e519524SHoward Hinnant // *__m is median 35023e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 35033e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 35043e519524SHoward Hinnant _RandomAccessIterator __i = __first; 35053e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 35063e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 35073e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 35083e519524SHoward Hinnant // Prime the downward search with a guard. 35093e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 35103e519524SHoward Hinnant { 35113e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 35123e519524SHoward Hinnant // manually guard downward moving __j against __i 35133e519524SHoward Hinnant while (true) 35143e519524SHoward Hinnant { 35153e519524SHoward Hinnant if (__i == --__j) 35163e519524SHoward Hinnant { 35173e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 35183e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 35193e519524SHoward Hinnant ++__i; // __first + 1 35203e519524SHoward Hinnant __j = __last; 35213e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 35223e519524SHoward Hinnant { 35233e519524SHoward Hinnant while (true) 35243e519524SHoward Hinnant { 35253e519524SHoward Hinnant if (__i == __j) 35263e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 35273e519524SHoward Hinnant if (__comp(*__first, *__i)) 35283e519524SHoward Hinnant { 35293e519524SHoward Hinnant swap(*__i, *__j); 35303e519524SHoward Hinnant ++__n_swaps; 35313e519524SHoward Hinnant ++__i; 35323e519524SHoward Hinnant break; 35333e519524SHoward Hinnant } 35343e519524SHoward Hinnant ++__i; 35353e519524SHoward Hinnant } 35363e519524SHoward Hinnant } 35373e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 35383e519524SHoward Hinnant if (__i == __j) 35393e519524SHoward Hinnant return; 35403e519524SHoward Hinnant while (true) 35413e519524SHoward Hinnant { 35423e519524SHoward Hinnant while (!__comp(*__first, *__i)) 35433e519524SHoward Hinnant ++__i; 35443e519524SHoward Hinnant while (__comp(*__first, *--__j)) 35453e519524SHoward Hinnant ; 35463e519524SHoward Hinnant if (__i >= __j) 35473e519524SHoward Hinnant break; 35483e519524SHoward Hinnant swap(*__i, *__j); 35493e519524SHoward Hinnant ++__n_swaps; 35503e519524SHoward Hinnant ++__i; 35513e519524SHoward Hinnant } 35523e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 35533e519524SHoward Hinnant // The first part is sorted, sort the secod part 3554ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 35553e519524SHoward Hinnant __first = __i; 35563e519524SHoward Hinnant goto __restart; 35573e519524SHoward Hinnant } 35583e519524SHoward Hinnant if (__comp(*__j, *__m)) 35593e519524SHoward Hinnant { 35603e519524SHoward Hinnant swap(*__i, *__j); 35613e519524SHoward Hinnant ++__n_swaps; 35623e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 35633e519524SHoward Hinnant } 35643e519524SHoward Hinnant } 35653e519524SHoward Hinnant } 35663e519524SHoward Hinnant // It is known that *__i < *__m 35673e519524SHoward Hinnant ++__i; 35683e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 35693e519524SHoward Hinnant // if not yet partitioned... 35703e519524SHoward Hinnant if (__i < __j) 35713e519524SHoward Hinnant { 35723e519524SHoward Hinnant // known that *(__i - 1) < *__m 35733e519524SHoward Hinnant // known that __i <= __m 35743e519524SHoward Hinnant while (true) 35753e519524SHoward Hinnant { 35763e519524SHoward Hinnant // __m still guards upward moving __i 35773e519524SHoward Hinnant while (__comp(*__i, *__m)) 35783e519524SHoward Hinnant ++__i; 35793e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 35803e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 35813e519524SHoward Hinnant ; 35823e519524SHoward Hinnant if (__i > __j) 35833e519524SHoward Hinnant break; 35843e519524SHoward Hinnant swap(*__i, *__j); 35853e519524SHoward Hinnant ++__n_swaps; 35863e519524SHoward Hinnant // It is known that __m != __j 35873e519524SHoward Hinnant // If __m just moved, follow it 35883e519524SHoward Hinnant if (__m == __i) 35893e519524SHoward Hinnant __m = __j; 35903e519524SHoward Hinnant ++__i; 35913e519524SHoward Hinnant } 35923e519524SHoward Hinnant } 35933e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 35943e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 35953e519524SHoward Hinnant { 35963e519524SHoward Hinnant swap(*__i, *__m); 35973e519524SHoward Hinnant ++__n_swaps; 35983e519524SHoward Hinnant } 35993e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 36003e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 36013e519524SHoward Hinnant if (__n_swaps == 0) 36023e519524SHoward Hinnant { 3603ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3604ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 36053e519524SHoward Hinnant { 36063e519524SHoward Hinnant if (__fs) 36073e519524SHoward Hinnant return; 36083e519524SHoward Hinnant __last = __i; 36093e519524SHoward Hinnant continue; 36103e519524SHoward Hinnant } 36113e519524SHoward Hinnant else 36123e519524SHoward Hinnant { 36133e519524SHoward Hinnant if (__fs) 36143e519524SHoward Hinnant { 36153e519524SHoward Hinnant __first = ++__i; 36163e519524SHoward Hinnant continue; 36173e519524SHoward Hinnant } 36183e519524SHoward Hinnant } 36193e519524SHoward Hinnant } 36203e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 36213e519524SHoward Hinnant if (__i - __first < __last - __i) 36223e519524SHoward Hinnant { 3623ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3624ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 36253e519524SHoward Hinnant __first = ++__i; 36263e519524SHoward Hinnant } 36273e519524SHoward Hinnant else 36283e519524SHoward Hinnant { 3629ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 3630ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 36313e519524SHoward Hinnant __last = __i; 36323e519524SHoward Hinnant } 36333e519524SHoward Hinnant } 36343e519524SHoward Hinnant} 36353e519524SHoward Hinnant 36363e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 36373e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 36383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36393e519524SHoward Hinnantvoid 36403e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36413e519524SHoward Hinnant{ 3642f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 36433e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 36443e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 36453e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 3646f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 36473e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 36483e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 3649f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 36503e519524SHoward Hinnant} 36513e519524SHoward Hinnant 36523e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 36533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36543e519524SHoward Hinnantvoid 36553e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 36563e519524SHoward Hinnant{ 3657ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 36583e519524SHoward Hinnant} 36593e519524SHoward Hinnant 36603e519524SHoward Hinnanttemplate <class _Tp> 36613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36623e519524SHoward Hinnantvoid 36633e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 36643e519524SHoward Hinnant{ 3665ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 36663e519524SHoward Hinnant} 36673e519524SHoward Hinnant 36683e519524SHoward Hinnanttemplate <class _Tp> 36693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36703e519524SHoward Hinnantvoid 36713e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 36723e519524SHoward Hinnant{ 3673ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 36743e519524SHoward Hinnant} 36753e519524SHoward Hinnant 3676f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 3677f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 3678f554add5SHoward Hinnantvoid 3679f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 3680f554add5SHoward Hinnant{ 3681f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3682f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 3683f554add5SHoward Hinnant} 3684f554add5SHoward Hinnant 3685e4383379SHoward Hinnant#ifdef _MSC_VER 3686e4383379SHoward Hinnant#pragma warning( push ) 3687e4383379SHoward Hinnant#pragma warning( disable: 4231) 3688e4383379SHoward Hinnant#endif // _MSC_VER 36893e519524SHoward Hinnantextern template void __sort<__less<char>&, char*>(char*, char*, __less<char>&); 36903e519524SHoward Hinnantextern template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 36913e519524SHoward Hinnantextern template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 36923e519524SHoward Hinnantextern template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 36933e519524SHoward Hinnantextern template void __sort<__less<short>&, short*>(short*, short*, __less<short>&); 36943e519524SHoward Hinnantextern template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 36953e519524SHoward Hinnantextern template void __sort<__less<int>&, int*>(int*, int*, __less<int>&); 36963e519524SHoward Hinnantextern template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 36973e519524SHoward Hinnantextern template void __sort<__less<long>&, long*>(long*, long*, __less<long>&); 36983e519524SHoward Hinnantextern template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 36993e519524SHoward Hinnantextern template void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 37003e519524SHoward Hinnantextern template void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 37013e519524SHoward Hinnantextern template void __sort<__less<float>&, float*>(float*, float*, __less<float>&); 37023e519524SHoward Hinnantextern template void __sort<__less<double>&, double*>(double*, double*, __less<double>&); 37033e519524SHoward Hinnantextern template void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 37043e519524SHoward Hinnant 37053e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&); 37063e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 37073e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 37083e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 37093e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&); 37103e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 37113e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&); 37123e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 37133e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&); 37143e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 37153e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 37163e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 37173e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&); 37183e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&); 37193e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 37203e519524SHoward Hinnant 37213e519524SHoward Hinnantextern template unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&); 3722e4383379SHoward Hinnant#ifdef _MSC_VER 3723e4383379SHoward Hinnant#pragma warning( pop ) 3724e4383379SHoward Hinnant#endif _MSC_VER 37253e519524SHoward Hinnant 37263e519524SHoward Hinnant// lower_bound 37273e519524SHoward Hinnant 37283e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 37293e519524SHoward Hinnant_ForwardIterator 3730e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 37313e519524SHoward Hinnant{ 37323e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3733ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 37343e519524SHoward Hinnant while (__len != 0) 37353e519524SHoward Hinnant { 37363e519524SHoward Hinnant difference_type __l2 = __len / 2; 37373e519524SHoward Hinnant _ForwardIterator __m = __first; 3738ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 3739e4383379SHoward Hinnant if (__comp(*__m, __value_)) 37403e519524SHoward Hinnant { 37413e519524SHoward Hinnant __first = ++__m; 37423e519524SHoward Hinnant __len -= __l2 + 1; 37433e519524SHoward Hinnant } 37443e519524SHoward Hinnant else 37453e519524SHoward Hinnant __len = __l2; 37463e519524SHoward Hinnant } 37473e519524SHoward Hinnant return __first; 37483e519524SHoward Hinnant} 37493e519524SHoward Hinnant 37503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 37513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37523e519524SHoward Hinnant_ForwardIterator 3753e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 37543e519524SHoward Hinnant{ 3755f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 37563e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 37573e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3758e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 3759f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 37603e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3761e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 3762f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 37633e519524SHoward Hinnant} 37643e519524SHoward Hinnant 37653e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 37663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37673e519524SHoward Hinnant_ForwardIterator 3768e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 37693e519524SHoward Hinnant{ 3770e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 37713e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 37723e519524SHoward Hinnant} 37733e519524SHoward Hinnant 37743e519524SHoward Hinnant// upper_bound 37753e519524SHoward Hinnant 37763e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 37773e519524SHoward Hinnant_ForwardIterator 3778e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 37793e519524SHoward Hinnant{ 37803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3781ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 37823e519524SHoward Hinnant while (__len != 0) 37833e519524SHoward Hinnant { 37843e519524SHoward Hinnant difference_type __l2 = __len / 2; 37853e519524SHoward Hinnant _ForwardIterator __m = __first; 3786ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 3787e4383379SHoward Hinnant if (__comp(__value_, *__m)) 37883e519524SHoward Hinnant __len = __l2; 37893e519524SHoward Hinnant else 37903e519524SHoward Hinnant { 37913e519524SHoward Hinnant __first = ++__m; 37923e519524SHoward Hinnant __len -= __l2 + 1; 37933e519524SHoward Hinnant } 37943e519524SHoward Hinnant } 37953e519524SHoward Hinnant return __first; 37963e519524SHoward Hinnant} 37973e519524SHoward Hinnant 37983e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 37993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38003e519524SHoward Hinnant_ForwardIterator 3801e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 38023e519524SHoward Hinnant{ 3803f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 38043e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 38053e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3806e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 3807f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 38083e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3809e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 3810f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 38113e519524SHoward Hinnant} 38123e519524SHoward Hinnant 38133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 38143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38153e519524SHoward Hinnant_ForwardIterator 3816e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 38173e519524SHoward Hinnant{ 3818e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 38193e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 38203e519524SHoward Hinnant} 38213e519524SHoward Hinnant 38223e519524SHoward Hinnant// equal_range 38233e519524SHoward Hinnant 38243e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 38253e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 3826e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 38273e519524SHoward Hinnant{ 38283e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3829ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 38303e519524SHoward Hinnant while (__len != 0) 38313e519524SHoward Hinnant { 38323e519524SHoward Hinnant difference_type __l2 = __len / 2; 38333e519524SHoward Hinnant _ForwardIterator __m = __first; 3834ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 3835e4383379SHoward Hinnant if (__comp(*__m, __value_)) 38363e519524SHoward Hinnant { 38373e519524SHoward Hinnant __first = ++__m; 38383e519524SHoward Hinnant __len -= __l2 + 1; 38393e519524SHoward Hinnant } 3840e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 38413e519524SHoward Hinnant { 38423e519524SHoward Hinnant __last = __m; 38433e519524SHoward Hinnant __len = __l2; 38443e519524SHoward Hinnant } 38453e519524SHoward Hinnant else 38463e519524SHoward Hinnant { 38473e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 38483e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 38493e519524SHoward Hinnant ( 3850e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 3851e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 38523e519524SHoward Hinnant ); 38533e519524SHoward Hinnant } 38543e519524SHoward Hinnant } 38553e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 38563e519524SHoward Hinnant} 38573e519524SHoward Hinnant 38583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 38593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38603e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 3861e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 38623e519524SHoward Hinnant{ 3863f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 38643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 38653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3866e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 3867f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 38683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3869e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 3870f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 38713e519524SHoward Hinnant} 38723e519524SHoward Hinnant 38733e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 38743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38753e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 3876e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 38773e519524SHoward Hinnant{ 3878e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 38793e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 38803e519524SHoward Hinnant} 38813e519524SHoward Hinnant 38823e519524SHoward Hinnant// binary_search 38833e519524SHoward Hinnant 38843e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 38853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38863e519524SHoward Hinnantbool 3887e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 38883e519524SHoward Hinnant{ 3889e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 3890e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 38913e519524SHoward Hinnant} 38923e519524SHoward Hinnant 38933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 38943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38953e519524SHoward Hinnantbool 3896e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 38973e519524SHoward Hinnant{ 3898f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 38993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3901e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 3902f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 39033e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3904e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 3905f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 39063e519524SHoward Hinnant} 39073e519524SHoward Hinnant 39083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 39093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39103e519524SHoward Hinnantbool 3911e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 39123e519524SHoward Hinnant{ 3913e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 39143e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 39153e519524SHoward Hinnant} 39163e519524SHoward Hinnant 39173e519524SHoward Hinnant// merge 39183e519524SHoward Hinnant 39193e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 39203e519524SHoward Hinnant_OutputIterator 39213e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 39223e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 39233e519524SHoward Hinnant{ 39243e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 39253e519524SHoward Hinnant { 39263e519524SHoward Hinnant if (__first2 == __last2) 3927ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 39283e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 39293e519524SHoward Hinnant { 39303e519524SHoward Hinnant *__result = *__first2; 39313e519524SHoward Hinnant ++__first2; 39323e519524SHoward Hinnant } 39333e519524SHoward Hinnant else 39343e519524SHoward Hinnant { 39353e519524SHoward Hinnant *__result = *__first1; 39363e519524SHoward Hinnant ++__first1; 39373e519524SHoward Hinnant } 39383e519524SHoward Hinnant } 3939ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 39403e519524SHoward Hinnant} 39413e519524SHoward Hinnant 39423e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 39433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39443e519524SHoward Hinnant_OutputIterator 39453e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 39463e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _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); 3951ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 3952f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 39533e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3954ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 3955f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 39563e519524SHoward Hinnant} 39573e519524SHoward Hinnant 39583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 39593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39603e519524SHoward Hinnant_OutputIterator 39613e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 39623e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 39633e519524SHoward Hinnant{ 39643e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 39653e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 39663e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 39673e519524SHoward Hinnant} 39683e519524SHoward Hinnant 39693e519524SHoward Hinnant// inplace_merge 39703e519524SHoward Hinnant 39713e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 39723e519524SHoward Hinnantvoid 39733e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 39743e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 39753e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 39763e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 39773e519524SHoward Hinnant{ 39783e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 39793e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 39803e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 39813e519524SHoward Hinnant __destruct_n __d(0); 39823e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 39833e519524SHoward Hinnant if (__len1 <= __len2) 39843e519524SHoward Hinnant { 39853e519524SHoward Hinnant value_type* __p = __buff; 39863e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 3987ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 39883e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 39893e519524SHoward Hinnant move_iterator<value_type*>(__p), 39903e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 39913e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 39923e519524SHoward Hinnant __first, __comp); 39933e519524SHoward Hinnant } 39943e519524SHoward Hinnant else 39953e519524SHoward Hinnant { 39963e519524SHoward Hinnant value_type* __p = __buff; 39973e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 3998ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 39993e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 40003e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 40013e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 40023e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 40033e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 40043e519524SHoward Hinnant } 40053e519524SHoward Hinnant} 40063e519524SHoward Hinnant 40073e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 40083e519524SHoward Hinnantvoid 40093e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 40103e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 40113e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 40123e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 40133e519524SHoward Hinnant{ 40143e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 40153e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 40163e519524SHoward Hinnant while (true) 40173e519524SHoward Hinnant { 40183e519524SHoward Hinnant // if __middle == __last, we're done 40193e519524SHoward Hinnant if (__len2 == 0) 40203e519524SHoward Hinnant return; 40213e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 40223e519524SHoward Hinnant for (; true; ++__first, --__len1) 40233e519524SHoward Hinnant { 40243e519524SHoward Hinnant if (__len1 == 0) 40253e519524SHoward Hinnant return; 40263e519524SHoward Hinnant if (__comp(*__middle, *__first)) 40273e519524SHoward Hinnant break; 40283e519524SHoward Hinnant } 40293e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 40303e519524SHoward Hinnant { 40313e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 40323e519524SHoward Hinnant return; 40333e519524SHoward Hinnant } 40343e519524SHoward Hinnant // __first < __middle < __last 40353e519524SHoward Hinnant // *__first > *__middle 40363e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 40373e519524SHoward Hinnant // all elements in: 40383e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 40393e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 40403e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 40413e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 40423e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 40433e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 40443e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 40453e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 40463e519524SHoward Hinnant // binary search smaller range 40473e519524SHoward Hinnant if (__len1 < __len2) 40483e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 40493e519524SHoward Hinnant __len21 = __len2 / 2; 40503e519524SHoward Hinnant __m2 = __middle; 4051ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 40523e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4053ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 40543e519524SHoward Hinnant } 40553e519524SHoward Hinnant else 40563e519524SHoward Hinnant { 40573e519524SHoward Hinnant if (__len1 == 1) 40583e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 40593e519524SHoward Hinnant // It is known *__first > *__middle 40603e519524SHoward Hinnant swap(*__first, *__middle); 40613e519524SHoward Hinnant return; 40623e519524SHoward Hinnant } 40633e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 40643e519524SHoward Hinnant __len11 = __len1 / 2; 40653e519524SHoward Hinnant __m1 = __first; 4066ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 40673e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4068ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 40693e519524SHoward Hinnant } 40703e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 40713e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 40723e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 40733e519524SHoward Hinnant // swap middle two partitions 4074ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 40753e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 40763e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 40773e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 40783e519524SHoward Hinnant { 40793e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 40803e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 40813e519524SHoward Hinnant __first = __middle; 40823e519524SHoward Hinnant __middle = __m2; 40833e519524SHoward Hinnant __len1 = __len12; 40843e519524SHoward Hinnant __len2 = __len22; 40853e519524SHoward Hinnant } 40863e519524SHoward Hinnant else 40873e519524SHoward Hinnant { 40883e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 40893e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 40903e519524SHoward Hinnant __last = __middle; 40913e519524SHoward Hinnant __middle = __m1; 40923e519524SHoward Hinnant __len1 = __len11; 40933e519524SHoward Hinnant __len2 = __len21; 40943e519524SHoward Hinnant } 40953e519524SHoward Hinnant } 40963e519524SHoward Hinnant} 40973e519524SHoward Hinnant 40983e519524SHoward Hinnanttemplate <class _Tp> 40993e519524SHoward Hinnantstruct __inplace_merge_switch 41003e519524SHoward Hinnant{ 4101ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 41023e519524SHoward Hinnant}; 41033e519524SHoward Hinnant 41043e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 41053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41063e519524SHoward Hinnantvoid 41073e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 41083e519524SHoward Hinnant _Compare __comp) 41093e519524SHoward Hinnant{ 41103e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 41113e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4112ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4113ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4114ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 41153e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 41163e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 41173e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 41183e519524SHoward Hinnant { 4119ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 41203e519524SHoward Hinnant __h.reset(__buf.first); 41213e519524SHoward Hinnant } 4122f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 41233e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41243e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4125ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 41263e519524SHoward Hinnant __buf.first, __buf.second); 4127f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 41283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4129ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 41303e519524SHoward Hinnant __buf.first, __buf.second); 4131f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 41323e519524SHoward Hinnant} 41333e519524SHoward Hinnant 41343e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 41353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41363e519524SHoward Hinnantvoid 41373e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 41383e519524SHoward Hinnant{ 4139ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 41403e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 41413e519524SHoward Hinnant} 41423e519524SHoward Hinnant 41433e519524SHoward Hinnant// stable_sort 41443e519524SHoward Hinnant 41453e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 41463e519524SHoward Hinnantvoid 41473e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 41483e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 41493e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 41503e519524SHoward Hinnant{ 41513e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 41523e519524SHoward Hinnant __destruct_n __d(0); 41533e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 41543e519524SHoward Hinnant for (; true; ++__result) 41553e519524SHoward Hinnant { 41563e519524SHoward Hinnant if (__first1 == __last1) 41573e519524SHoward Hinnant { 41583e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4159ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 41603e519524SHoward Hinnant __h.release(); 41613e519524SHoward Hinnant return; 41623e519524SHoward Hinnant } 41633e519524SHoward Hinnant if (__first2 == __last2) 41643e519524SHoward Hinnant { 41653e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4166ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 41673e519524SHoward Hinnant __h.release(); 41683e519524SHoward Hinnant return; 41693e519524SHoward Hinnant } 41703e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 41713e519524SHoward Hinnant { 4172ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 41733e519524SHoward Hinnant __d.__incr((value_type*)0); 41743e519524SHoward Hinnant ++__first2; 41753e519524SHoward Hinnant } 41763e519524SHoward Hinnant else 41773e519524SHoward Hinnant { 4178ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 41793e519524SHoward Hinnant __d.__incr((value_type*)0); 41803e519524SHoward Hinnant ++__first1; 41813e519524SHoward Hinnant } 41823e519524SHoward Hinnant } 41833e519524SHoward Hinnant} 41843e519524SHoward Hinnant 41853e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 41863e519524SHoward Hinnantvoid 41873e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 41883e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 41893e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 41903e519524SHoward Hinnant{ 41913e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 41923e519524SHoward Hinnant { 41933e519524SHoward Hinnant if (__first2 == __last2) 41943e519524SHoward Hinnant { 41953e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4196ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 41973e519524SHoward Hinnant return; 41983e519524SHoward Hinnant } 41993e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42003e519524SHoward Hinnant { 4201ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 42023e519524SHoward Hinnant ++__first2; 42033e519524SHoward Hinnant } 42043e519524SHoward Hinnant else 42053e519524SHoward Hinnant { 4206ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 42073e519524SHoward Hinnant ++__first1; 42083e519524SHoward Hinnant } 42093e519524SHoward Hinnant } 42103e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4211ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 42123e519524SHoward Hinnant} 42133e519524SHoward Hinnant 42143e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42153e519524SHoward Hinnantvoid 42163e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 42173e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 42183e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 42193e519524SHoward Hinnant 42203e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42213e519524SHoward Hinnantvoid 42223e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 42233e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 42243e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 42253e519524SHoward Hinnant{ 42263e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 42273e519524SHoward Hinnant switch (__len) 42283e519524SHoward Hinnant { 42293e519524SHoward Hinnant case 0: 42303e519524SHoward Hinnant return; 42313e519524SHoward Hinnant case 1: 4232ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 42333e519524SHoward Hinnant return; 42343e519524SHoward Hinnant case 2: 42353e519524SHoward Hinnant __destruct_n __d(0); 42363e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 42373e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 42383e519524SHoward Hinnant { 4239ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 42403e519524SHoward Hinnant __d.__incr((value_type*)0); 42413e519524SHoward Hinnant ++__first2; 4242ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 42433e519524SHoward Hinnant } 42443e519524SHoward Hinnant else 42453e519524SHoward Hinnant { 4246ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 42473e519524SHoward Hinnant __d.__incr((value_type*)0); 42483e519524SHoward Hinnant ++__first2; 4249ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 42503e519524SHoward Hinnant } 42513e519524SHoward Hinnant __h2.release(); 42523e519524SHoward Hinnant return; 42533e519524SHoward Hinnant } 42543e519524SHoward Hinnant if (__len <= 8) 42553e519524SHoward Hinnant { 42563e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 42573e519524SHoward Hinnant return; 42583e519524SHoward Hinnant } 42593e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 42603e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 42613e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 42623e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 42633e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 42643e519524SHoward Hinnant} 42653e519524SHoward Hinnant 42663e519524SHoward Hinnanttemplate <class _Tp> 42673e519524SHoward Hinnantstruct __stable_sort_switch 42683e519524SHoward Hinnant{ 4269ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 42703e519524SHoward Hinnant}; 42713e519524SHoward Hinnant 42723e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42733e519524SHoward Hinnantvoid 42743e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 42753e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 42763e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 42773e519524SHoward Hinnant{ 42783e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 42793e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 42803e519524SHoward Hinnant switch (__len) 42813e519524SHoward Hinnant { 42823e519524SHoward Hinnant case 0: 42833e519524SHoward Hinnant case 1: 42843e519524SHoward Hinnant return; 42853e519524SHoward Hinnant case 2: 42863e519524SHoward Hinnant if (__comp(*--__last, *__first)) 42873e519524SHoward Hinnant swap(*__first, *__last); 42883e519524SHoward Hinnant return; 42893e519524SHoward Hinnant } 42903e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 42913e519524SHoward Hinnant { 42923e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 42933e519524SHoward Hinnant return; 42943e519524SHoward Hinnant } 42953e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 42963e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 42973e519524SHoward Hinnant if (__len <= __buff_size) 42983e519524SHoward Hinnant { 42993e519524SHoward Hinnant __destruct_n __d(0); 43003e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43013e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 43023e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 43033e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 43043e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 43053e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 43063e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 43073e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 43083e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 43093e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 43103e519524SHoward Hinnant// __first, __comp); 43113e519524SHoward Hinnant return; 43123e519524SHoward Hinnant } 43133e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 43143e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 43153e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 43163e519524SHoward Hinnant} 43173e519524SHoward Hinnant 43183e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43203e519524SHoward Hinnantvoid 43213e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43223e519524SHoward Hinnant{ 43233e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 43243e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43253e519524SHoward Hinnant difference_type __len = __last - __first; 43263e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 43273e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 43283e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 43293e519524SHoward Hinnant { 4330ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 43313e519524SHoward Hinnant __h.reset(__buf.first); 43323e519524SHoward Hinnant } 4333f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 43343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 43363e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4337f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 43383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43393e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4340f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 43413e519524SHoward Hinnant} 43423e519524SHoward Hinnant 43433e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 43443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43453e519524SHoward Hinnantvoid 43463e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 43473e519524SHoward Hinnant{ 4348ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43493e519524SHoward Hinnant} 43503e519524SHoward Hinnant 43513e519524SHoward Hinnant// is_heap_until 43523e519524SHoward Hinnant 43533e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43543e519524SHoward Hinnant_RandomAccessIterator 43553e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43563e519524SHoward Hinnant{ 4357ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43583e519524SHoward Hinnant difference_type __len = __last - __first; 43593e519524SHoward Hinnant difference_type __p = 0; 43603e519524SHoward Hinnant difference_type __c = 1; 43613e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 43623e519524SHoward Hinnant while (__c < __len) 43633e519524SHoward Hinnant { 43643e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 43653e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 43663e519524SHoward Hinnant return __cp; 43673e519524SHoward Hinnant ++__c; 43683e519524SHoward Hinnant ++__cp; 43693e519524SHoward Hinnant if (__c == __len) 43703e519524SHoward Hinnant return __last; 43713e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 43723e519524SHoward Hinnant return __cp; 43733e519524SHoward Hinnant ++__p; 43743e519524SHoward Hinnant ++__pp; 43753e519524SHoward Hinnant __c = 2 * __p + 1; 43763e519524SHoward Hinnant } 43773e519524SHoward Hinnant return __last; 43783e519524SHoward Hinnant} 43793e519524SHoward Hinnant 43803e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 43813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43823e519524SHoward Hinnant_RandomAccessIterator 43833e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 43843e519524SHoward Hinnant{ 4385ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43863e519524SHoward Hinnant} 43873e519524SHoward Hinnant 43883e519524SHoward Hinnant// is_heap 43893e519524SHoward Hinnant 43903e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43923e519524SHoward Hinnantbool 43933e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43943e519524SHoward Hinnant{ 4395ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 43963e519524SHoward Hinnant} 43973e519524SHoward Hinnant 43983e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 43993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44003e519524SHoward Hinnantbool 44013e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 44023e519524SHoward Hinnant{ 4403ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 44043e519524SHoward Hinnant} 44053e519524SHoward Hinnant 44063e519524SHoward Hinnant// push_heap 44073e519524SHoward Hinnant 44083e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 44093e519524SHoward Hinnantvoid 44103e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 44113e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 44123e519524SHoward Hinnant{ 44133e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 44143e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 44153e519524SHoward Hinnant if (__len > 1) 44163e519524SHoward Hinnant { 44173e519524SHoward Hinnant difference_type __p = 0; 44183e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 44193e519524SHoward Hinnant difference_type __c = 2; 44203e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 44213e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 44223e519524SHoward Hinnant { 44233e519524SHoward Hinnant --__c; 44243e519524SHoward Hinnant --__cp; 44253e519524SHoward Hinnant } 44263e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 44273e519524SHoward Hinnant { 4428ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__pp)); 44293e519524SHoward Hinnant do 44303e519524SHoward Hinnant { 4431ce48a113SHoward Hinnant *__pp = _VSTD::move(*__cp); 44323e519524SHoward Hinnant __pp = __cp; 44333e519524SHoward Hinnant __p = __c; 44343e519524SHoward Hinnant __c = (__p + 1) * 2; 44353e519524SHoward Hinnant if (__c > __len) 44363e519524SHoward Hinnant break; 44373e519524SHoward Hinnant __cp = __first + __c; 44383e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 44393e519524SHoward Hinnant { 44403e519524SHoward Hinnant --__c; 44413e519524SHoward Hinnant --__cp; 44423e519524SHoward Hinnant } 44433e519524SHoward Hinnant } while (__comp(__t, *__cp)); 4444ce48a113SHoward Hinnant *__pp = _VSTD::move(__t); 44453e519524SHoward Hinnant } 44463e519524SHoward Hinnant } 44473e519524SHoward Hinnant} 44483e519524SHoward Hinnant 44493e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 44503e519524SHoward Hinnantvoid 44513e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 44523e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 44533e519524SHoward Hinnant{ 44543e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 44553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 44563e519524SHoward Hinnant if (__len > 1) 44573e519524SHoward Hinnant { 44583e519524SHoward Hinnant __len = (__len - 2) / 2; 44593e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 44603e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 44613e519524SHoward Hinnant { 4462ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 44633e519524SHoward Hinnant do 44643e519524SHoward Hinnant { 4465ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 44663e519524SHoward Hinnant __last = __ptr; 44673e519524SHoward Hinnant if (__len == 0) 44683e519524SHoward Hinnant break; 44693e519524SHoward Hinnant __len = (__len - 1) / 2; 44703e519524SHoward Hinnant __ptr = __first + __len; 44713e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4472ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 44733e519524SHoward Hinnant } 44743e519524SHoward Hinnant } 44753e519524SHoward Hinnant} 44763e519524SHoward Hinnant 44773e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 44783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44793e519524SHoward Hinnantvoid 44803e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 44813e519524SHoward Hinnant{ 4482f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 44833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 44853e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4486f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 44873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 44883e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4489f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 44903e519524SHoward Hinnant} 44913e519524SHoward Hinnant 44923e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 44933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44943e519524SHoward Hinnantvoid 44953e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 44963e519524SHoward Hinnant{ 4497ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 44983e519524SHoward Hinnant} 44993e519524SHoward Hinnant 45003e519524SHoward Hinnant// pop_heap 45013e519524SHoward Hinnant 45023e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45043e519524SHoward Hinnantvoid 45053e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45063e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 45073e519524SHoward Hinnant{ 45083e519524SHoward Hinnant if (__len > 1) 45093e519524SHoward Hinnant { 45103e519524SHoward Hinnant swap(*__first, *--__last); 45113e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 45123e519524SHoward Hinnant } 45133e519524SHoward Hinnant} 45143e519524SHoward Hinnant 45153e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45173e519524SHoward Hinnantvoid 45183e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45193e519524SHoward Hinnant{ 4520f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 45213e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45223e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45233e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4524f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 45253e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45263e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4527f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 45283e519524SHoward Hinnant} 45293e519524SHoward Hinnant 45303e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 45313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45323e519524SHoward Hinnantvoid 45333e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 45343e519524SHoward Hinnant{ 4535ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45363e519524SHoward Hinnant} 45373e519524SHoward Hinnant 45383e519524SHoward Hinnant// make_heap 45393e519524SHoward Hinnant 45403e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45413e519524SHoward Hinnantvoid 45423e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45433e519524SHoward Hinnant{ 45443e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45453e519524SHoward Hinnant difference_type __n = __last - __first; 45463e519524SHoward Hinnant if (__n > 1) 45473e519524SHoward Hinnant { 45483e519524SHoward Hinnant __last = __first; 45493e519524SHoward Hinnant ++__last; 45503e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 45513e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 45523e519524SHoward Hinnant } 45533e519524SHoward Hinnant} 45543e519524SHoward Hinnant 45553e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45573e519524SHoward Hinnantvoid 45583e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45593e519524SHoward Hinnant{ 4560f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 45613e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45623e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45633e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4564f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 45653e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45663e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4567f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 45683e519524SHoward Hinnant} 45693e519524SHoward Hinnant 45703e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 45713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45723e519524SHoward Hinnantvoid 45733e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 45743e519524SHoward Hinnant{ 4575ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45763e519524SHoward Hinnant} 45773e519524SHoward Hinnant 45783e519524SHoward Hinnant// sort_heap 45793e519524SHoward Hinnant 45803e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45813e519524SHoward Hinnantvoid 45823e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45833e519524SHoward Hinnant{ 45843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45853e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 45863e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 45873e519524SHoward Hinnant} 45883e519524SHoward Hinnant 45893e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45913e519524SHoward Hinnantvoid 45923e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45933e519524SHoward Hinnant{ 4594f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 45953e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45963e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45973e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4598f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 45993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46003e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4601f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46023e519524SHoward Hinnant} 46033e519524SHoward Hinnant 46043e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46063e519524SHoward Hinnantvoid 46073e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 46083e519524SHoward Hinnant{ 4609ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46103e519524SHoward Hinnant} 46113e519524SHoward Hinnant 46123e519524SHoward Hinnant// partial_sort 46133e519524SHoward Hinnant 46143e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46153e519524SHoward Hinnantvoid 46163e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 46173e519524SHoward Hinnant _Compare __comp) 46183e519524SHoward Hinnant{ 46193e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 46203e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 46213e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 46223e519524SHoward Hinnant { 46233e519524SHoward Hinnant if (__comp(*__i, *__first)) 46243e519524SHoward Hinnant { 46253e519524SHoward Hinnant swap(*__i, *__first); 46263e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 46273e519524SHoward Hinnant } 46283e519524SHoward Hinnant } 46293e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 46303e519524SHoward Hinnant} 46313e519524SHoward Hinnant 46323e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46343e519524SHoward Hinnantvoid 46353e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 46363e519524SHoward Hinnant _Compare __comp) 46373e519524SHoward Hinnant{ 4638f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 46393e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46403e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46413e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 4642f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 46433e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46443e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 4645f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46463e519524SHoward Hinnant} 46473e519524SHoward Hinnant 46483e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46503e519524SHoward Hinnantvoid 46513e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 46523e519524SHoward Hinnant{ 4653ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 46543e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46553e519524SHoward Hinnant} 46563e519524SHoward Hinnant 46573e519524SHoward Hinnant// partial_sort_copy 46583e519524SHoward Hinnant 46593e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 46603e519524SHoward Hinnant_RandomAccessIterator 46613e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 46623e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 46633e519524SHoward Hinnant{ 46643e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 46653e519524SHoward Hinnant if (__r != __result_last) 46663e519524SHoward Hinnant { 46673e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 46683e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 46693e519524SHoward Hinnant *__r = *__first; 46703e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 46713e519524SHoward Hinnant for (; __first != __last; ++__first) 46723e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 46733e519524SHoward Hinnant { 46743e519524SHoward Hinnant *__result_first = *__first; 46753e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 46763e519524SHoward Hinnant } 46773e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 46783e519524SHoward Hinnant } 46793e519524SHoward Hinnant return __r; 46803e519524SHoward Hinnant} 46813e519524SHoward Hinnant 46823e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 46833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46843e519524SHoward Hinnant_RandomAccessIterator 46853e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 46863e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 46873e519524SHoward Hinnant{ 4688f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 46893e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46903e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46913e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 4692f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 46933e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46943e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 4695f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46963e519524SHoward Hinnant} 46973e519524SHoward Hinnant 46983e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 46993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47003e519524SHoward Hinnant_RandomAccessIterator 47013e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 47023e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 47033e519524SHoward Hinnant{ 4704ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 47053e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47063e519524SHoward Hinnant} 47073e519524SHoward Hinnant 47083e519524SHoward Hinnant// nth_element 47093e519524SHoward Hinnant 47103e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47113e519524SHoward Hinnantvoid 47123e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 47133e519524SHoward Hinnant{ 47143e519524SHoward Hinnant // _Compare is known to be a reference type 47153e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47163e519524SHoward Hinnant const difference_type __limit = 7; 47173e519524SHoward Hinnant while (true) 47183e519524SHoward Hinnant { 47193e519524SHoward Hinnant __restart: 47203e519524SHoward Hinnant difference_type __len = __last - __first; 47213e519524SHoward Hinnant switch (__len) 47223e519524SHoward Hinnant { 47233e519524SHoward Hinnant case 0: 47243e519524SHoward Hinnant case 1: 47253e519524SHoward Hinnant return; 47263e519524SHoward Hinnant case 2: 47273e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47283e519524SHoward Hinnant swap(*__first, *__last); 47293e519524SHoward Hinnant return; 47303e519524SHoward Hinnant case 3: 47313e519524SHoward Hinnant { 47323e519524SHoward Hinnant _RandomAccessIterator __m = __first; 4733ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 47343e519524SHoward Hinnant return; 47353e519524SHoward Hinnant } 47363e519524SHoward Hinnant } 47373e519524SHoward Hinnant if (__len <= __limit) 47383e519524SHoward Hinnant { 47393e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 47403e519524SHoward Hinnant return; 47413e519524SHoward Hinnant } 47423e519524SHoward Hinnant // __len > __limit >= 3 47433e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 47443e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 4745ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 47463e519524SHoward Hinnant // *__m is median 47473e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 47483e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 47493e519524SHoward Hinnant _RandomAccessIterator __i = __first; 47503e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 47513e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 47523e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 47533e519524SHoward Hinnant // Prime the downward search with a guard. 47543e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 47553e519524SHoward Hinnant { 47563e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 47573e519524SHoward Hinnant // manually guard downward moving __j against __i 47583e519524SHoward Hinnant while (true) 47593e519524SHoward Hinnant { 47603e519524SHoward Hinnant if (__i == --__j) 47613e519524SHoward Hinnant { 47623e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 47633e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 47643e519524SHoward Hinnant ++__i; // __first + 1 47653e519524SHoward Hinnant __j = __last; 47663e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 47673e519524SHoward Hinnant { 47683e519524SHoward Hinnant while (true) 47693e519524SHoward Hinnant { 47703e519524SHoward Hinnant if (__i == __j) 47713e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 47723e519524SHoward Hinnant if (__comp(*__first, *__i)) 47733e519524SHoward Hinnant { 47743e519524SHoward Hinnant swap(*__i, *__j); 47753e519524SHoward Hinnant ++__n_swaps; 47763e519524SHoward Hinnant ++__i; 47773e519524SHoward Hinnant break; 47783e519524SHoward Hinnant } 47793e519524SHoward Hinnant ++__i; 47803e519524SHoward Hinnant } 47813e519524SHoward Hinnant } 47823e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 47833e519524SHoward Hinnant if (__i == __j) 47843e519524SHoward Hinnant return; 47853e519524SHoward Hinnant while (true) 47863e519524SHoward Hinnant { 47873e519524SHoward Hinnant while (!__comp(*__first, *__i)) 47883e519524SHoward Hinnant ++__i; 47893e519524SHoward Hinnant while (__comp(*__first, *--__j)) 47903e519524SHoward Hinnant ; 47913e519524SHoward Hinnant if (__i >= __j) 47923e519524SHoward Hinnant break; 47933e519524SHoward Hinnant swap(*__i, *__j); 47943e519524SHoward Hinnant ++__n_swaps; 47953e519524SHoward Hinnant ++__i; 47963e519524SHoward Hinnant } 47973e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 47983e519524SHoward Hinnant // The first part is sorted, 47993e519524SHoward Hinnant if (__nth < __i) 48003e519524SHoward Hinnant return; 48013e519524SHoward Hinnant // __nth_element the secod part 48023e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 48033e519524SHoward Hinnant __first = __i; 48043e519524SHoward Hinnant goto __restart; 48053e519524SHoward Hinnant } 48063e519524SHoward Hinnant if (__comp(*__j, *__m)) 48073e519524SHoward Hinnant { 48083e519524SHoward Hinnant swap(*__i, *__j); 48093e519524SHoward Hinnant ++__n_swaps; 48103e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 48113e519524SHoward Hinnant } 48123e519524SHoward Hinnant } 48133e519524SHoward Hinnant } 48143e519524SHoward Hinnant ++__i; 48153e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 48163e519524SHoward Hinnant // if not yet partitioned... 48173e519524SHoward Hinnant if (__i < __j) 48183e519524SHoward Hinnant { 48193e519524SHoward Hinnant // known that *(__i - 1) < *__m 48203e519524SHoward Hinnant while (true) 48213e519524SHoward Hinnant { 48223e519524SHoward Hinnant // __m still guards upward moving __i 48233e519524SHoward Hinnant while (__comp(*__i, *__m)) 48243e519524SHoward Hinnant ++__i; 48253e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 48263e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 48273e519524SHoward Hinnant ; 48283e519524SHoward Hinnant if (__i >= __j) 48293e519524SHoward Hinnant break; 48303e519524SHoward Hinnant swap(*__i, *__j); 48313e519524SHoward Hinnant ++__n_swaps; 48323e519524SHoward Hinnant // It is known that __m != __j 48333e519524SHoward Hinnant // If __m just moved, follow it 48343e519524SHoward Hinnant if (__m == __i) 48353e519524SHoward Hinnant __m = __j; 48363e519524SHoward Hinnant ++__i; 48373e519524SHoward Hinnant } 48383e519524SHoward Hinnant } 48393e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 48403e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 48413e519524SHoward Hinnant { 48423e519524SHoward Hinnant swap(*__i, *__m); 48433e519524SHoward Hinnant ++__n_swaps; 48443e519524SHoward Hinnant } 48453e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 48463e519524SHoward Hinnant if (__nth == __i) 48473e519524SHoward Hinnant return; 48483e519524SHoward Hinnant if (__n_swaps == 0) 48493e519524SHoward Hinnant { 48503e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 48513e519524SHoward Hinnant if (__nth < __i) 48523e519524SHoward Hinnant { 48533e519524SHoward Hinnant // Check for [__first, __i) already sorted 48543e519524SHoward Hinnant __j = __m = __first; 48553e519524SHoward Hinnant while (++__j != __i) 48563e519524SHoward Hinnant { 48573e519524SHoward Hinnant if (__comp(*__j, *__m)) 48583e519524SHoward Hinnant // not yet sorted, so sort 48593e519524SHoward Hinnant goto not_sorted; 48603e519524SHoward Hinnant __m = __j; 48613e519524SHoward Hinnant } 48623e519524SHoward Hinnant // [__first, __i) sorted 48633e519524SHoward Hinnant return; 48643e519524SHoward Hinnant } 48653e519524SHoward Hinnant else 48663e519524SHoward Hinnant { 48673e519524SHoward Hinnant // Check for [__i, __last) already sorted 48683e519524SHoward Hinnant __j = __m = __i; 48693e519524SHoward Hinnant while (++__j != __last) 48703e519524SHoward Hinnant { 48713e519524SHoward Hinnant if (__comp(*__j, *__m)) 48723e519524SHoward Hinnant // not yet sorted, so sort 48733e519524SHoward Hinnant goto not_sorted; 48743e519524SHoward Hinnant __m = __j; 48753e519524SHoward Hinnant } 48763e519524SHoward Hinnant // [__i, __last) sorted 48773e519524SHoward Hinnant return; 48783e519524SHoward Hinnant } 48793e519524SHoward Hinnant } 48803e519524SHoward Hinnantnot_sorted: 48813e519524SHoward Hinnant // __nth_element on range containing __nth 48823e519524SHoward Hinnant if (__nth < __i) 48833e519524SHoward Hinnant { 48843e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 48853e519524SHoward Hinnant __last = __i; 48863e519524SHoward Hinnant } 48873e519524SHoward Hinnant else 48883e519524SHoward Hinnant { 48893e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 48903e519524SHoward Hinnant __first = ++__i; 48913e519524SHoward Hinnant } 48923e519524SHoward Hinnant } 48933e519524SHoward Hinnant} 48943e519524SHoward Hinnant 48953e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48973e519524SHoward Hinnantvoid 48983e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _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 __nth_element<_Comp_ref>(__first, __nth, __last, __c); 4904f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49053e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49063e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 4907f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49083e519524SHoward Hinnant} 49093e519524SHoward Hinnant 49103e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49123e519524SHoward Hinnantvoid 49133e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 49143e519524SHoward Hinnant{ 4915ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49163e519524SHoward Hinnant} 49173e519524SHoward Hinnant 49183e519524SHoward Hinnant// includes 49193e519524SHoward Hinnant 49203e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 49213e519524SHoward Hinnantbool 49223e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 49233e519524SHoward Hinnant _Compare __comp) 49243e519524SHoward Hinnant{ 49253e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 49263e519524SHoward Hinnant { 49273e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 49283e519524SHoward Hinnant return false; 49293e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 49303e519524SHoward Hinnant ++__first2; 49313e519524SHoward Hinnant } 49323e519524SHoward Hinnant return true; 49333e519524SHoward Hinnant} 49343e519524SHoward Hinnant 49353e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 49363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49373e519524SHoward Hinnantbool 49383e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 49393e519524SHoward Hinnant _Compare __comp) 49403e519524SHoward Hinnant{ 4941f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49423e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49433e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49443e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 4945f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49463e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49473e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 4948f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49493e519524SHoward Hinnant} 49503e519524SHoward Hinnant 49513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 49523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49533e519524SHoward Hinnantbool 49543e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 49553e519524SHoward Hinnant{ 4956ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 49573e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 49583e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 49593e519524SHoward Hinnant} 49603e519524SHoward Hinnant 49613e519524SHoward Hinnant// set_union 49623e519524SHoward Hinnant 49633e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 49643e519524SHoward Hinnant_OutputIterator 49653e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 49663e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 49673e519524SHoward Hinnant{ 49683e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 49693e519524SHoward Hinnant { 49703e519524SHoward Hinnant if (__first2 == __last2) 4971ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 49723e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 49733e519524SHoward Hinnant { 49743e519524SHoward Hinnant *__result = *__first2; 49753e519524SHoward Hinnant ++__first2; 49763e519524SHoward Hinnant } 49773e519524SHoward Hinnant else 49783e519524SHoward Hinnant { 49793e519524SHoward Hinnant *__result = *__first1; 49803e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 49813e519524SHoward Hinnant ++__first2; 49823e519524SHoward Hinnant ++__first1; 49833e519524SHoward Hinnant } 49843e519524SHoward Hinnant } 4985ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 49863e519524SHoward Hinnant} 49873e519524SHoward Hinnant 49883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 49893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49903e519524SHoward Hinnant_OutputIterator 49913e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 49923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _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 __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4998f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50003e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5001f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 50023e519524SHoward Hinnant} 50033e519524SHoward Hinnant 50043e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 50053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50063e519524SHoward Hinnant_OutputIterator 50073e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 50083e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 50093e519524SHoward Hinnant{ 5010ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 50113e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 50123e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 50133e519524SHoward Hinnant} 50143e519524SHoward Hinnant 50153e519524SHoward Hinnant// set_intersection 50163e519524SHoward Hinnant 50173e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 50183e519524SHoward Hinnant_OutputIterator 50193e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 50203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50213e519524SHoward Hinnant{ 50223e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 50233e519524SHoward Hinnant { 50243e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 50253e519524SHoward Hinnant ++__first1; 50263e519524SHoward Hinnant else 50273e519524SHoward Hinnant { 50283e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 50293e519524SHoward Hinnant { 50303e519524SHoward Hinnant *__result = *__first1; 50313e519524SHoward Hinnant ++__result; 50323e519524SHoward Hinnant ++__first1; 50333e519524SHoward Hinnant } 50343e519524SHoward Hinnant ++__first2; 50353e519524SHoward Hinnant } 50363e519524SHoward Hinnant } 50373e519524SHoward Hinnant return __result; 50383e519524SHoward Hinnant} 50393e519524SHoward Hinnant 50403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 50413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50423e519524SHoward Hinnant_OutputIterator 50433e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 50443e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50453e519524SHoward Hinnant{ 5046f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 50473e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50483e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50493e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5050f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 50513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50523e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5053f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 50543e519524SHoward Hinnant} 50553e519524SHoward Hinnant 50563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 50573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50583e519524SHoward Hinnant_OutputIterator 50593e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 50603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 50613e519524SHoward Hinnant{ 5062ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 50633e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 50643e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 50653e519524SHoward Hinnant} 50663e519524SHoward Hinnant 50673e519524SHoward Hinnant// set_difference 50683e519524SHoward Hinnant 50693e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 50703e519524SHoward Hinnant_OutputIterator 50713e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 50723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50733e519524SHoward Hinnant{ 50743e519524SHoward Hinnant while (__first1 != __last1) 50753e519524SHoward Hinnant { 50763e519524SHoward Hinnant if (__first2 == __last2) 5077ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 50783e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 50793e519524SHoward Hinnant { 50803e519524SHoward Hinnant *__result = *__first1; 50813e519524SHoward Hinnant ++__result; 50823e519524SHoward Hinnant ++__first1; 50833e519524SHoward Hinnant } 50843e519524SHoward Hinnant else 50853e519524SHoward Hinnant { 50863e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 50873e519524SHoward Hinnant ++__first1; 50883e519524SHoward Hinnant ++__first2; 50893e519524SHoward Hinnant } 50903e519524SHoward Hinnant } 50913e519524SHoward Hinnant return __result; 50923e519524SHoward Hinnant} 50933e519524SHoward Hinnant 50943e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 50953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50963e519524SHoward Hinnant_OutputIterator 50973e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 50983e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50993e519524SHoward Hinnant{ 5100f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 51013e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51023e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51033e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5104f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 51053e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51063e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5107f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 51083e519524SHoward Hinnant} 51093e519524SHoward Hinnant 51103e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 51113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51123e519524SHoward Hinnant_OutputIterator 51133e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51143e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 51153e519524SHoward Hinnant{ 5116ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 51173e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 51183e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 51193e519524SHoward Hinnant} 51203e519524SHoward Hinnant 51213e519524SHoward Hinnant// set_symmetric_difference 51223e519524SHoward Hinnant 51233e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 51243e519524SHoward Hinnant_OutputIterator 51253e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51263e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 51273e519524SHoward Hinnant{ 51283e519524SHoward Hinnant while (__first1 != __last1) 51293e519524SHoward Hinnant { 51303e519524SHoward Hinnant if (__first2 == __last2) 5131ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 51323e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 51333e519524SHoward Hinnant { 51343e519524SHoward Hinnant *__result = *__first1; 51353e519524SHoward Hinnant ++__result; 51363e519524SHoward Hinnant ++__first1; 51373e519524SHoward Hinnant } 51383e519524SHoward Hinnant else 51393e519524SHoward Hinnant { 51403e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 51413e519524SHoward Hinnant { 51423e519524SHoward Hinnant *__result = *__first2; 51433e519524SHoward Hinnant ++__result; 51443e519524SHoward Hinnant } 51453e519524SHoward Hinnant else 51463e519524SHoward Hinnant ++__first1; 51473e519524SHoward Hinnant ++__first2; 51483e519524SHoward Hinnant } 51493e519524SHoward Hinnant } 5150ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 51513e519524SHoward Hinnant} 51523e519524SHoward Hinnant 51533e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 51543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51553e519524SHoward Hinnant_OutputIterator 51563e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51573e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 51583e519524SHoward Hinnant{ 5159f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 51603e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51613e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51623e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5163f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 51643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51653e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5166f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 51673e519524SHoward Hinnant} 51683e519524SHoward Hinnant 51693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 51703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51713e519524SHoward Hinnant_OutputIterator 51723e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51733e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 51743e519524SHoward Hinnant{ 5175ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 51763e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 51773e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 51783e519524SHoward Hinnant} 51793e519524SHoward Hinnant 51803e519524SHoward Hinnant// lexicographical_compare 51813e519524SHoward Hinnant 51823e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 51833e519524SHoward Hinnantbool 51843e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 51853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 51863e519524SHoward Hinnant{ 51873e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 51883e519524SHoward Hinnant { 51893e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 51903e519524SHoward Hinnant return true; 51913e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 51923e519524SHoward Hinnant return false; 51933e519524SHoward Hinnant } 51943e519524SHoward Hinnant return false; 51953e519524SHoward Hinnant} 51963e519524SHoward Hinnant 51973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 51983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51993e519524SHoward Hinnantbool 52003e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 52013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 52023e519524SHoward Hinnant{ 5203f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52043e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52053e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52063e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5207f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52083e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52093e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5210f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52113e519524SHoward Hinnant} 52123e519524SHoward Hinnant 52133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 52143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52153e519524SHoward Hinnantbool 52163e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 52173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 52183e519524SHoward Hinnant{ 5219ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 52203e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 52213e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 52223e519524SHoward Hinnant} 52233e519524SHoward Hinnant 52243e519524SHoward Hinnant// next_permutation 52253e519524SHoward Hinnant 52263e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 52273e519524SHoward Hinnantbool 52283e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52293e519524SHoward Hinnant{ 52303e519524SHoward Hinnant _BidirectionalIterator __i = __last; 52313e519524SHoward Hinnant if (__first == __last || __first == --__i) 52323e519524SHoward Hinnant return false; 52333e519524SHoward Hinnant while (true) 52343e519524SHoward Hinnant { 52353e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 52363e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 52373e519524SHoward Hinnant { 52383e519524SHoward Hinnant _BidirectionalIterator __j = __last; 52393e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 52403e519524SHoward Hinnant ; 52413e519524SHoward Hinnant swap(*__i, *__j); 5242ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 52433e519524SHoward Hinnant return true; 52443e519524SHoward Hinnant } 52453e519524SHoward Hinnant if (__i == __first) 52463e519524SHoward Hinnant { 5247ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 52483e519524SHoward Hinnant return false; 52493e519524SHoward Hinnant } 52503e519524SHoward Hinnant } 52513e519524SHoward Hinnant} 52523e519524SHoward Hinnant 52533e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 52543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52553e519524SHoward Hinnantbool 52563e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52573e519524SHoward Hinnant{ 5258f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52613e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5262f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52643e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5265f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52663e519524SHoward Hinnant} 52673e519524SHoward Hinnant 52683e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 52693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52703e519524SHoward Hinnantbool 52713e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 52723e519524SHoward Hinnant{ 5273ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 52743e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 52753e519524SHoward Hinnant} 52763e519524SHoward Hinnant 52773e519524SHoward Hinnant// prev_permutation 52783e519524SHoward Hinnant 52793e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 52803e519524SHoward Hinnantbool 52813e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52823e519524SHoward Hinnant{ 52833e519524SHoward Hinnant _BidirectionalIterator __i = __last; 52843e519524SHoward Hinnant if (__first == __last || __first == --__i) 52853e519524SHoward Hinnant return false; 52863e519524SHoward Hinnant while (true) 52873e519524SHoward Hinnant { 52883e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 52893e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 52903e519524SHoward Hinnant { 52913e519524SHoward Hinnant _BidirectionalIterator __j = __last; 52923e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 52933e519524SHoward Hinnant ; 52943e519524SHoward Hinnant swap(*__i, *__j); 5295ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 52963e519524SHoward Hinnant return true; 52973e519524SHoward Hinnant } 52983e519524SHoward Hinnant if (__i == __first) 52993e519524SHoward Hinnant { 5300ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 53013e519524SHoward Hinnant return false; 53023e519524SHoward Hinnant } 53033e519524SHoward Hinnant } 53043e519524SHoward Hinnant} 53053e519524SHoward Hinnant 53063e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 53073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53083e519524SHoward Hinnantbool 53093e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 53103e519524SHoward Hinnant{ 5311f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53143e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5315f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53173e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5318f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53193e519524SHoward Hinnant} 53203e519524SHoward Hinnant 53213e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 53223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53233e519524SHoward Hinnantbool 53243e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 53253e519524SHoward Hinnant{ 5326ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 53273e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 53283e519524SHoward Hinnant} 53293e519524SHoward Hinnant 53303e519524SHoward Hinnanttemplate <class _Tp> 53313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53323e519524SHoward Hinnanttypename enable_if 53333e519524SHoward Hinnant< 53343e519524SHoward Hinnant is_integral<_Tp>::value, 53353e519524SHoward Hinnant _Tp 53363e519524SHoward Hinnant>::type 53373e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 53383e519524SHoward Hinnant{ 53393e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 53403e519524SHoward Hinnant __n &= __bits; 53413e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 53423e519524SHoward Hinnant} 53433e519524SHoward Hinnant 53443e519524SHoward Hinnanttemplate <class _Tp> 53453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53463e519524SHoward Hinnanttypename enable_if 53473e519524SHoward Hinnant< 53483e519524SHoward Hinnant is_integral<_Tp>::value, 53493e519524SHoward Hinnant _Tp 53503e519524SHoward Hinnant>::type 53513e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 53523e519524SHoward Hinnant{ 53533e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 53543e519524SHoward Hinnant __n &= __bits; 53553e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 53563e519524SHoward Hinnant} 53573e519524SHoward Hinnant 53583e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 53593e519524SHoward Hinnant 53603e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5361