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 700c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 701c206366fSHoward Hinnantunsigned 702c206366fSHoward Hinnant__ctz(unsigned __x) 703c206366fSHoward Hinnant{ 704c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 705c206366fSHoward Hinnant} 706c206366fSHoward Hinnant 707c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 708c206366fSHoward Hinnantunsigned long 709c206366fSHoward Hinnant__ctz(unsigned long __x) 710c206366fSHoward Hinnant{ 711c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 712c206366fSHoward Hinnant} 713c206366fSHoward Hinnant 714c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 715c206366fSHoward Hinnantunsigned long long 716c206366fSHoward Hinnant__ctz(unsigned long long __x) 717c206366fSHoward Hinnant{ 718c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 719c206366fSHoward Hinnant} 720c8edcb36SHoward Hinnant 721c8edcb36SHoward Hinnant// Precondition: __x != 0 722c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 723c206366fSHoward Hinnantunsigned 724c206366fSHoward Hinnant__clz(unsigned __x) 725c206366fSHoward Hinnant{ 726c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 727c206366fSHoward Hinnant} 728c206366fSHoward Hinnant 729c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 730c206366fSHoward Hinnantunsigned long 731c206366fSHoward Hinnant__clz(unsigned long __x) 732c206366fSHoward Hinnant{ 733c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 734c206366fSHoward Hinnant} 735c206366fSHoward Hinnant 736c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 737c206366fSHoward Hinnantunsigned long long 738c206366fSHoward Hinnant__clz(unsigned long long __x) 739c206366fSHoward Hinnant{ 740c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 741c206366fSHoward Hinnant} 742c8edcb36SHoward Hinnant 743c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 744c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 745c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 746c8edcb36SHoward Hinnant 7473e519524SHoward Hinnant// all_of 7483e519524SHoward Hinnant 7493e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7513e519524SHoward Hinnantbool 7523e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7533e519524SHoward Hinnant{ 7543e519524SHoward Hinnant for (; __first != __last; ++__first) 7553e519524SHoward Hinnant if (!__pred(*__first)) 7563e519524SHoward Hinnant return false; 7573e519524SHoward Hinnant return true; 7583e519524SHoward Hinnant} 7593e519524SHoward Hinnant 7603e519524SHoward Hinnant// any_of 7613e519524SHoward Hinnant 7623e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7643e519524SHoward Hinnantbool 7653e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7663e519524SHoward Hinnant{ 7673e519524SHoward Hinnant for (; __first != __last; ++__first) 7683e519524SHoward Hinnant if (__pred(*__first)) 7693e519524SHoward Hinnant return true; 7703e519524SHoward Hinnant return false; 7713e519524SHoward Hinnant} 7723e519524SHoward Hinnant 7733e519524SHoward Hinnant// none_of 7743e519524SHoward Hinnant 7753e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7773e519524SHoward Hinnantbool 7783e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7793e519524SHoward Hinnant{ 7803e519524SHoward Hinnant for (; __first != __last; ++__first) 7813e519524SHoward Hinnant if (__pred(*__first)) 7823e519524SHoward Hinnant return false; 7833e519524SHoward Hinnant return true; 7843e519524SHoward Hinnant} 7853e519524SHoward Hinnant 7863e519524SHoward Hinnant// for_each 7873e519524SHoward Hinnant 7883e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 7893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7903e519524SHoward Hinnant_Function 7913e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 7923e519524SHoward Hinnant{ 7933e519524SHoward Hinnant for (; __first != __last; ++__first) 7943e519524SHoward Hinnant __f(*__first); 795ce48a113SHoward Hinnant return _VSTD::move(__f); 7963e519524SHoward Hinnant} 7973e519524SHoward Hinnant 7983e519524SHoward Hinnant// find 7993e519524SHoward Hinnant 8003e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8023e519524SHoward Hinnant_InputIterator 803e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8043e519524SHoward Hinnant{ 8053e519524SHoward Hinnant for (; __first != __last; ++__first) 806e4383379SHoward Hinnant if (*__first == __value_) 8073e519524SHoward Hinnant break; 8083e519524SHoward Hinnant return __first; 8093e519524SHoward Hinnant} 8103e519524SHoward Hinnant 8113e519524SHoward Hinnant// find_if 8123e519524SHoward Hinnant 8133e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8153e519524SHoward Hinnant_InputIterator 8163e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8173e519524SHoward Hinnant{ 8183e519524SHoward Hinnant for (; __first != __last; ++__first) 8193e519524SHoward Hinnant if (__pred(*__first)) 8203e519524SHoward Hinnant break; 8213e519524SHoward Hinnant return __first; 8223e519524SHoward Hinnant} 8233e519524SHoward Hinnant 8243e519524SHoward Hinnant// find_if_not 8253e519524SHoward Hinnant 8263e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8283e519524SHoward Hinnant_InputIterator 8293e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8303e519524SHoward Hinnant{ 8313e519524SHoward Hinnant for (; __first != __last; ++__first) 8323e519524SHoward Hinnant if (!__pred(*__first)) 8333e519524SHoward Hinnant break; 8343e519524SHoward Hinnant return __first; 8353e519524SHoward Hinnant} 8363e519524SHoward Hinnant 8373e519524SHoward Hinnant// find_end 8383e519524SHoward Hinnant 8393e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8403e519524SHoward Hinnant_ForwardIterator1 8413e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8423e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 8433e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 8443e519524SHoward Hinnant{ 8453e519524SHoward Hinnant // modeled after search algorithm 8463e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 8473e519524SHoward Hinnant if (__first2 == __last2) 8483e519524SHoward Hinnant return __r; 8493e519524SHoward Hinnant while (true) 8503e519524SHoward Hinnant { 8513e519524SHoward Hinnant while (true) 8523e519524SHoward Hinnant { 8533e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 8543e519524SHoward Hinnant return __r; // (or __last1 if never found) 8553e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 8563e519524SHoward Hinnant break; 8573e519524SHoward Hinnant ++__first1; 8583e519524SHoward Hinnant } 8593e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 8603e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 8613e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 8623e519524SHoward Hinnant while (true) 8633e519524SHoward Hinnant { 8643e519524SHoward Hinnant if (++__m2 == __last2) 8653e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 8663e519524SHoward Hinnant __r = __first1; 8673e519524SHoward Hinnant ++__first1; 8683e519524SHoward Hinnant break; 8693e519524SHoward Hinnant } 8703e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 8713e519524SHoward Hinnant return __r; 8723e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 8733e519524SHoward Hinnant { 8743e519524SHoward Hinnant ++__first1; 8753e519524SHoward Hinnant break; 8763e519524SHoward Hinnant } // else there is a match, check next elements 8773e519524SHoward Hinnant } 8783e519524SHoward Hinnant } 8793e519524SHoward Hinnant} 8803e519524SHoward Hinnant 8813e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 8823e519524SHoward Hinnant_BidirectionalIterator1 8833e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 8843e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 8853e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 8863e519524SHoward Hinnant{ 8873e519524SHoward Hinnant // modeled after search algorithm (in reverse) 8883e519524SHoward Hinnant if (__first2 == __last2) 8893e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 8903e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 8913e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 8923e519524SHoward Hinnant --__l2; 8933e519524SHoward Hinnant while (true) 8943e519524SHoward Hinnant { 8953e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 8963e519524SHoward Hinnant while (true) 8973e519524SHoward Hinnant { 8983e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 8993e519524SHoward Hinnant return __last1; 9003e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9013e519524SHoward Hinnant break; 9023e519524SHoward Hinnant } 9033e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9043e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9053e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9063e519524SHoward Hinnant while (true) 9073e519524SHoward Hinnant { 9083e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9093e519524SHoward Hinnant return __m1; 9103e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9113e519524SHoward Hinnant return __last1; 9123e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9133e519524SHoward Hinnant { 9143e519524SHoward Hinnant break; 9153e519524SHoward Hinnant } // else there is a match, check next elements 9163e519524SHoward Hinnant } 9173e519524SHoward Hinnant } 9183e519524SHoward Hinnant} 9193e519524SHoward Hinnant 9203e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9213e519524SHoward Hinnant_RandomAccessIterator1 9223e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9233e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9243e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9253e519524SHoward Hinnant{ 9263e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9273e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9283e519524SHoward Hinnant if (__len2 == 0) 9293e519524SHoward Hinnant return __last1; 9303e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9313e519524SHoward Hinnant if (__len1 < __len2) 9323e519524SHoward Hinnant return __last1; 9333e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9343e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9353e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9363e519524SHoward Hinnant --__l2; 9373e519524SHoward Hinnant while (true) 9383e519524SHoward Hinnant { 9393e519524SHoward Hinnant while (true) 9403e519524SHoward Hinnant { 9413e519524SHoward Hinnant if (__s == __l1) 9423e519524SHoward Hinnant return __last1; 9433e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9443e519524SHoward Hinnant break; 9453e519524SHoward Hinnant } 9463e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 9473e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 9483e519524SHoward Hinnant while (true) 9493e519524SHoward Hinnant { 9503e519524SHoward Hinnant if (__m2 == __first2) 9513e519524SHoward Hinnant return __m1; 9523e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 9533e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 9543e519524SHoward Hinnant { 9553e519524SHoward Hinnant break; 9563e519524SHoward Hinnant } 9573e519524SHoward Hinnant } 9583e519524SHoward Hinnant } 9593e519524SHoward Hinnant} 9603e519524SHoward Hinnant 9613e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9633e519524SHoward Hinnant_ForwardIterator1 9643e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9653e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9663e519524SHoward Hinnant{ 967ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 9683e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 9693e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 9703e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 9713e519524SHoward Hinnant} 9723e519524SHoward Hinnant 9733e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 9743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9753e519524SHoward Hinnant_ForwardIterator1 9763e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9773e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 9783e519524SHoward Hinnant{ 9793e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 9803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 981ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 9823e519524SHoward Hinnant} 9833e519524SHoward Hinnant 9843e519524SHoward Hinnant// find_first_of 9853e519524SHoward Hinnant 9863e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9873e519524SHoward Hinnant_ForwardIterator1 9883e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9893e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9903e519524SHoward Hinnant{ 9913e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 9923e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 9933e519524SHoward Hinnant if (__pred(*__first1, *__j)) 9943e519524SHoward Hinnant return __first1; 9953e519524SHoward Hinnant return __last1; 9963e519524SHoward Hinnant} 9973e519524SHoward Hinnant 9983e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 9993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10003e519524SHoward Hinnant_ForwardIterator1 10013e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10023e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10033e519524SHoward Hinnant{ 10043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1006ce48a113SHoward Hinnant return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10073e519524SHoward Hinnant} 10083e519524SHoward Hinnant 10093e519524SHoward Hinnant// adjacent_find 10103e519524SHoward Hinnant 10113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10133e519524SHoward Hinnant_ForwardIterator 10143e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10153e519524SHoward Hinnant{ 10163e519524SHoward Hinnant if (__first != __last) 10173e519524SHoward Hinnant { 10183e519524SHoward Hinnant _ForwardIterator __i = __first; 10193e519524SHoward Hinnant while (++__i != __last) 10203e519524SHoward Hinnant { 10213e519524SHoward Hinnant if (__pred(*__first, *__i)) 10223e519524SHoward Hinnant return __first; 10233e519524SHoward Hinnant __first = __i; 10243e519524SHoward Hinnant } 10253e519524SHoward Hinnant } 10263e519524SHoward Hinnant return __last; 10273e519524SHoward Hinnant} 10283e519524SHoward Hinnant 10293e519524SHoward Hinnanttemplate <class _ForwardIterator> 10303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10313e519524SHoward Hinnant_ForwardIterator 10323e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 10333e519524SHoward Hinnant{ 10343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1035ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 10363e519524SHoward Hinnant} 10373e519524SHoward Hinnant 10383e519524SHoward Hinnant// count 10393e519524SHoward Hinnant 10403e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10423e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1043e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 10443e519524SHoward Hinnant{ 10453e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10463e519524SHoward Hinnant for (; __first != __last; ++__first) 1047e4383379SHoward Hinnant if (*__first == __value_) 10483e519524SHoward Hinnant ++__r; 10493e519524SHoward Hinnant return __r; 10503e519524SHoward Hinnant} 10513e519524SHoward Hinnant 10523e519524SHoward Hinnant// count_if 10533e519524SHoward Hinnant 10543e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10563e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 10573e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10583e519524SHoward Hinnant{ 10593e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10603e519524SHoward Hinnant for (; __first != __last; ++__first) 10613e519524SHoward Hinnant if (__pred(*__first)) 10623e519524SHoward Hinnant ++__r; 10633e519524SHoward Hinnant return __r; 10643e519524SHoward Hinnant} 10653e519524SHoward Hinnant 10663e519524SHoward Hinnant// mismatch 10673e519524SHoward Hinnant 10683e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 10693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10703e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 10713e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 10723e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 10733e519524SHoward Hinnant{ 10743e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10753e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10763e519524SHoward Hinnant break; 10773e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 10783e519524SHoward Hinnant} 10793e519524SHoward Hinnant 10803e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 10813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10823e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 10833e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 10843e519524SHoward Hinnant{ 10853e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 10863e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1087ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10883e519524SHoward Hinnant} 10893e519524SHoward Hinnant 10903e519524SHoward Hinnant// equal 10913e519524SHoward Hinnant 10923e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 10933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10943e519524SHoward Hinnantbool 10953e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 10963e519524SHoward Hinnant{ 10973e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10983e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10993e519524SHoward Hinnant return false; 11003e519524SHoward Hinnant return true; 11013e519524SHoward Hinnant} 11023e519524SHoward Hinnant 11033e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11053e519524SHoward Hinnantbool 11063e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11073e519524SHoward Hinnant{ 11083e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11093e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1110ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11113e519524SHoward Hinnant} 11123e519524SHoward Hinnant 11133e519524SHoward Hinnant// is_permutation 11143e519524SHoward Hinnant 11153e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11163e519524SHoward Hinnantbool 11173e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11183e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 11193e519524SHoward Hinnant{ 11203e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 11213e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11223e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11233e519524SHoward Hinnant goto __not_done; 11243e519524SHoward Hinnant return true; 11253e519524SHoward Hinnant__not_done: 11263e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 11273e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1128ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 11293e519524SHoward Hinnant if (__l1 == _D1(1)) 11303e519524SHoward Hinnant return false; 1131ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 11323e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 11333e519524SHoward Hinnant // equal elements in [f2, l2) 11343e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 11353e519524SHoward Hinnant { 11363e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 11373e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 11383e519524SHoward Hinnant if (__pred(*__j, *__i)) 11393e519524SHoward Hinnant goto __next_iter; 11403e519524SHoward Hinnant { 11413e519524SHoward Hinnant // Count number of *__i in [f2, l2) 11423e519524SHoward Hinnant _D1 __c2 = 0; 11433e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11443e519524SHoward Hinnant if (__pred(*__i, *__j)) 11453e519524SHoward Hinnant ++__c2; 11463e519524SHoward Hinnant if (__c2 == 0) 11473e519524SHoward Hinnant return false; 11483e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 11493e519524SHoward Hinnant _D1 __c1 = 1; 1150ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 11513e519524SHoward Hinnant if (__pred(*__i, *__j)) 11523e519524SHoward Hinnant ++__c1; 11533e519524SHoward Hinnant if (__c1 != __c2) 11543e519524SHoward Hinnant return false; 11553e519524SHoward Hinnant } 11563e519524SHoward Hinnant__next_iter:; 11573e519524SHoward Hinnant } 11583e519524SHoward Hinnant return true; 11593e519524SHoward Hinnant} 11603e519524SHoward Hinnant 11613e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 11623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11633e519524SHoward Hinnantbool 11643e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11653e519524SHoward Hinnant _ForwardIterator2 __first2) 11663e519524SHoward Hinnant{ 11673e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11683e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1169ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11703e519524SHoward Hinnant} 11713e519524SHoward Hinnant 11723e519524SHoward Hinnant// search 11733e519524SHoward Hinnant 11743e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 11753e519524SHoward Hinnant_ForwardIterator1 11763e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11773e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 11783e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 11793e519524SHoward Hinnant{ 11803e519524SHoward Hinnant if (__first2 == __last2) 11813e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 11823e519524SHoward Hinnant while (true) 11833e519524SHoward Hinnant { 11843e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 11853e519524SHoward Hinnant while (true) 11863e519524SHoward Hinnant { 11873e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 11883e519524SHoward Hinnant return __last1; 11893e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11903e519524SHoward Hinnant break; 11913e519524SHoward Hinnant ++__first1; 11923e519524SHoward Hinnant } 11933e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 11943e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 11953e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 11963e519524SHoward Hinnant while (true) 11973e519524SHoward Hinnant { 11983e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 11993e519524SHoward Hinnant return __first1; 12003e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 12013e519524SHoward Hinnant return __last1; 12023e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 12033e519524SHoward Hinnant { 12043e519524SHoward Hinnant ++__first1; 12053e519524SHoward Hinnant break; 12063e519524SHoward Hinnant } // else there is a match, check next elements 12073e519524SHoward Hinnant } 12083e519524SHoward Hinnant } 12093e519524SHoward Hinnant} 12103e519524SHoward Hinnant 12113e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12123e519524SHoward Hinnant_RandomAccessIterator1 12133e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12143e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12153e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 12163e519524SHoward Hinnant{ 12173e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 12183e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 12193e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 12203e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 12213e519524SHoward Hinnant if (__len2 == 0) 12223e519524SHoward Hinnant return __first1; 12233e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 12243e519524SHoward Hinnant if (__len1 < __len2) 12253e519524SHoward Hinnant return __last1; 12263e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 12273e519524SHoward Hinnant while (true) 12283e519524SHoward Hinnant { 12293e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 12303e519524SHoward Hinnant while (true) 12313e519524SHoward Hinnant { 12323e519524SHoward Hinnant if (__first1 == __s) 12333e519524SHoward Hinnant return __last1; 12343e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12353e519524SHoward Hinnant break; 12363e519524SHoward Hinnant ++__first1; 12373e519524SHoward Hinnant } 1238b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 12393e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 12403e519524SHoward Hinnant { 12413e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12423e519524SHoward Hinnant goto __phase2; 12433e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12443e519524SHoward Hinnant goto __phase2; 12453e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12463e519524SHoward Hinnant goto __phase2; 12473e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12483e519524SHoward Hinnant goto __phase2; 12493e519524SHoward Hinnant ++__first1; 12503e519524SHoward Hinnant } 12513e519524SHoward Hinnant switch (__s - __first1) 12523e519524SHoward Hinnant { 12533e519524SHoward Hinnant case 3: 12543e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12553e519524SHoward Hinnant break; 12563e519524SHoward Hinnant ++__first1; 12573e519524SHoward Hinnant case 2: 12583e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12593e519524SHoward Hinnant break; 12603e519524SHoward Hinnant ++__first1; 12613e519524SHoward Hinnant case 1: 12623e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12633e519524SHoward Hinnant break; 12643e519524SHoward Hinnant case 0: 12653e519524SHoward Hinnant return __last1; 12663e519524SHoward Hinnant } 12673e519524SHoward Hinnant __phase2: 1268b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 12693e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 12703e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 12713e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 12723e519524SHoward Hinnant while (true) 12733e519524SHoward Hinnant { 12743e519524SHoward Hinnant if (++__m2 == __last2) 12753e519524SHoward Hinnant return __first1; 12763e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 12773e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12783e519524SHoward Hinnant { 12793e519524SHoward Hinnant ++__first1; 12803e519524SHoward Hinnant break; 12813e519524SHoward Hinnant } 12823e519524SHoward Hinnant } 1283b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 12843e519524SHoward Hinnant ++__m2; 12853e519524SHoward Hinnant ++__m1; 12863e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 12873e519524SHoward Hinnant { 12883e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12893e519524SHoward Hinnant goto __continue; 12903e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12913e519524SHoward Hinnant goto __continue; 12923e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12933e519524SHoward Hinnant goto __continue; 12943e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12953e519524SHoward Hinnant goto __continue; 12963e519524SHoward Hinnant ++__m1; 12973e519524SHoward Hinnant ++__m2; 12983e519524SHoward Hinnant } 12993e519524SHoward Hinnant switch (__last2 - __m2) 13003e519524SHoward Hinnant { 13013e519524SHoward Hinnant case 3: 13023e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 13033e519524SHoward Hinnant break; 13043e519524SHoward Hinnant ++__m1; 13053e519524SHoward Hinnant ++__m2; 13063e519524SHoward Hinnant case 2: 13073e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 13083e519524SHoward Hinnant break; 13093e519524SHoward Hinnant ++__m1; 13103e519524SHoward Hinnant ++__m2; 13113e519524SHoward Hinnant case 1: 13123e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 13133e519524SHoward Hinnant break; 13143e519524SHoward Hinnant case 0: 13153e519524SHoward Hinnant return __first1; 13163e519524SHoward Hinnant } 13173e519524SHoward Hinnant __continue: 13183e519524SHoward Hinnant ++__first1; 1319b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 13203e519524SHoward Hinnant } 13213e519524SHoward Hinnant} 13223e519524SHoward Hinnant 13233e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13253e519524SHoward Hinnant_ForwardIterator1 13263e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13273e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 13283e519524SHoward Hinnant{ 1329ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 13303e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 13313e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 13323e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 13333e519524SHoward Hinnant} 13343e519524SHoward Hinnant 13353e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 13363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13373e519524SHoward Hinnant_ForwardIterator1 13383e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13393e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 13403e519524SHoward Hinnant{ 13413e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 13423e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1343ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13443e519524SHoward Hinnant} 13453e519524SHoward Hinnant 13463e519524SHoward Hinnant// search_n 13473e519524SHoward Hinnant 13483e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 13493e519524SHoward Hinnant_ForwardIterator 13503e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1351e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 13523e519524SHoward Hinnant{ 13533e519524SHoward Hinnant if (__count <= 0) 13543e519524SHoward Hinnant return __first; 13553e519524SHoward Hinnant while (true) 13563e519524SHoward Hinnant { 1357e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 13583e519524SHoward Hinnant while (true) 13593e519524SHoward Hinnant { 1360e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 13613e519524SHoward Hinnant return __last; 1362e4383379SHoward Hinnant if (__pred(*__first, __value_)) 13633e519524SHoward Hinnant break; 13643e519524SHoward Hinnant ++__first; 13653e519524SHoward Hinnant } 1366e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 13673e519524SHoward Hinnant _ForwardIterator __m = __first; 13683e519524SHoward Hinnant _Size __c(0); 13693e519524SHoward Hinnant while (true) 13703e519524SHoward Hinnant { 13713e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 13723e519524SHoward Hinnant return __first; 13733e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 13743e519524SHoward Hinnant return __last; 1375e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 13763e519524SHoward Hinnant { 13773e519524SHoward Hinnant __first = __m; 13783e519524SHoward Hinnant ++__first; 13793e519524SHoward Hinnant break; 13803e519524SHoward Hinnant } // else there is a match, check next elements 13813e519524SHoward Hinnant } 13823e519524SHoward Hinnant } 13833e519524SHoward Hinnant} 13843e519524SHoward Hinnant 13853e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 13863e519524SHoward Hinnant_RandomAccessIterator 13873e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1388e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 13893e519524SHoward Hinnant{ 13903e519524SHoward Hinnant if (__count <= 0) 13913e519524SHoward Hinnant return __first; 13923e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 13933e519524SHoward Hinnant if (__len < __count) 13943e519524SHoward Hinnant return __last; 13953e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 13963e519524SHoward Hinnant while (true) 13973e519524SHoward Hinnant { 1398e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 13993e519524SHoward Hinnant while (true) 14003e519524SHoward Hinnant { 1401e4383379SHoward Hinnant if (__first == __s) // return __last if no element matches __value_ 14023e519524SHoward Hinnant return __last; 1403e4383379SHoward Hinnant if (__pred(*__first, __value_)) 14043e519524SHoward Hinnant break; 14053e519524SHoward Hinnant ++__first; 14063e519524SHoward Hinnant } 1407e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 14083e519524SHoward Hinnant _RandomAccessIterator __m = __first; 14093e519524SHoward Hinnant _Size __c(0); 14103e519524SHoward Hinnant while (true) 14113e519524SHoward Hinnant { 14123e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 14133e519524SHoward Hinnant return __first; 14143e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1415e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 14163e519524SHoward Hinnant { 14173e519524SHoward Hinnant __first = __m; 14183e519524SHoward Hinnant ++__first; 14193e519524SHoward Hinnant break; 14203e519524SHoward Hinnant } // else there is a match, check next elements 14213e519524SHoward Hinnant } 14223e519524SHoward Hinnant } 14233e519524SHoward Hinnant} 14243e519524SHoward Hinnant 14253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 14263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14273e519524SHoward Hinnant_ForwardIterator 14283e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1429e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 14303e519524SHoward Hinnant{ 1431ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1432e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 14333e519524SHoward Hinnant} 14343e519524SHoward Hinnant 14353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 14363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14373e519524SHoward Hinnant_ForwardIterator 1438e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 14393e519524SHoward Hinnant{ 14403e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1441e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 14423e519524SHoward Hinnant} 14433e519524SHoward Hinnant 14443e519524SHoward Hinnant// copy 14453e519524SHoward Hinnant 14463e519524SHoward Hinnanttemplate <class _Iter> 14473e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 14483e519524SHoward Hinnant{ 14493e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14503e519524SHoward Hinnant}; 14513e519524SHoward Hinnant 14523e519524SHoward Hinnanttemplate <class _Iter> 14533e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 14543e519524SHoward Hinnant{ 14553e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14563e519524SHoward Hinnant}; 14573e519524SHoward Hinnant 14583e519524SHoward Hinnanttemplate <class _Iter> 14593e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 14603e519524SHoward Hinnant{ 14613e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14623e519524SHoward Hinnant}; 14633e519524SHoward Hinnant 14643e519524SHoward Hinnanttemplate <class _Iter> 14653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14663e519524SHoward Hinnant_Iter 14673e519524SHoward Hinnant__unwrap_iter(_Iter __i) 14683e519524SHoward Hinnant{ 14693e519524SHoward Hinnant return __i; 14703e519524SHoward Hinnant} 14713e519524SHoward Hinnant 14723e519524SHoward Hinnanttemplate <class _Tp> 14733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14743e519524SHoward Hinnanttypename enable_if 14753e519524SHoward Hinnant< 1476ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 14773e519524SHoward Hinnant _Tp* 14783e519524SHoward Hinnant>::type 14793e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 14803e519524SHoward Hinnant{ 14813e519524SHoward Hinnant return __i.base(); 14823e519524SHoward Hinnant} 14833e519524SHoward Hinnant 14843e519524SHoward Hinnanttemplate <class _Tp> 14853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14863e519524SHoward Hinnanttypename enable_if 14873e519524SHoward Hinnant< 1488ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 14893e519524SHoward Hinnant _Tp* 14903e519524SHoward Hinnant>::type 14913e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 14923e519524SHoward Hinnant{ 14933e519524SHoward Hinnant return __i.base(); 14943e519524SHoward Hinnant} 14953e519524SHoward Hinnant 14963e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14983e519524SHoward Hinnant_OutputIterator 14993e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15003e519524SHoward Hinnant{ 15013e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 15023e519524SHoward Hinnant *__result = *__first; 15033e519524SHoward Hinnant return __result; 15043e519524SHoward Hinnant} 15053e519524SHoward Hinnant 15063e519524SHoward Hinnanttemplate <class _Tp, class _Up> 15073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15083e519524SHoward Hinnanttypename enable_if 15093e519524SHoward Hinnant< 15103e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1511ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 15123e519524SHoward Hinnant _Up* 15133e519524SHoward Hinnant>::type 15143e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 15153e519524SHoward Hinnant{ 15163e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1517ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 15183e519524SHoward Hinnant return __result + __n; 15193e519524SHoward Hinnant} 15203e519524SHoward Hinnant 15213e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15233e519524SHoward Hinnant_OutputIterator 15243e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15253e519524SHoward Hinnant{ 1526ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 15273e519524SHoward Hinnant} 15283e519524SHoward Hinnant 15293e519524SHoward Hinnant// copy_backward 15303e519524SHoward Hinnant 15313e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15333e519524SHoward Hinnant_OutputIterator 15343e519524SHoward Hinnant__copy_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15353e519524SHoward Hinnant{ 15363e519524SHoward Hinnant while (__first != __last) 15373e519524SHoward Hinnant *--__result = *--__last; 15383e519524SHoward Hinnant return __result; 15393e519524SHoward Hinnant} 15403e519524SHoward Hinnant 15413e519524SHoward Hinnanttemplate <class _Tp, class _Up> 15423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15433e519524SHoward Hinnanttypename enable_if 15443e519524SHoward Hinnant< 15453e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1546ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 15473e519524SHoward Hinnant _Up* 15483e519524SHoward Hinnant>::type 15493e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 15503e519524SHoward Hinnant{ 15513e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 15523e519524SHoward Hinnant __result -= __n; 1553ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 15543e519524SHoward Hinnant return __result; 15553e519524SHoward Hinnant} 15563e519524SHoward Hinnant 15573e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 15583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15593e519524SHoward Hinnant_BidirectionalIterator2 15603e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 15613e519524SHoward Hinnant _BidirectionalIterator2 __result) 15623e519524SHoward Hinnant{ 1563ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 15643e519524SHoward Hinnant} 15653e519524SHoward Hinnant 15663e519524SHoward Hinnant// copy_if 15673e519524SHoward Hinnant 15683e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 15693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15703e519524SHoward Hinnant_OutputIterator 15713e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 15723e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 15733e519524SHoward Hinnant{ 15743e519524SHoward Hinnant for (; __first != __last; ++__first) 15753e519524SHoward Hinnant { 15763e519524SHoward Hinnant if (__pred(*__first)) 15773e519524SHoward Hinnant { 15783e519524SHoward Hinnant *__result = *__first; 15793e519524SHoward Hinnant ++__result; 15803e519524SHoward Hinnant } 15813e519524SHoward Hinnant } 15823e519524SHoward Hinnant return __result; 15833e519524SHoward Hinnant} 15843e519524SHoward Hinnant 15853e519524SHoward Hinnant// copy_n 15863e519524SHoward Hinnant 15873e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 15883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15893e519524SHoward Hinnanttypename enable_if 15903e519524SHoward Hinnant< 15913e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 15923e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 15933e519524SHoward Hinnant _OutputIterator 15943e519524SHoward Hinnant>::type 15953e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15963e519524SHoward Hinnant{ 159799847d2bSHoward Hinnant if (__n > 0) 159899847d2bSHoward Hinnant { 15993e519524SHoward Hinnant *__result = *__first; 160099847d2bSHoward Hinnant ++__result; 160199847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 160299847d2bSHoward Hinnant { 160399847d2bSHoward Hinnant ++__first; 160499847d2bSHoward Hinnant *__result = *__first; 160599847d2bSHoward Hinnant ++__result; 160699847d2bSHoward Hinnant } 160799847d2bSHoward Hinnant } 16083e519524SHoward Hinnant return __result; 16093e519524SHoward Hinnant} 16103e519524SHoward Hinnant 16113e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 16123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16133e519524SHoward Hinnanttypename enable_if 16143e519524SHoward Hinnant< 16153e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 16163e519524SHoward Hinnant _OutputIterator 16173e519524SHoward Hinnant>::type 16183e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 16193e519524SHoward Hinnant{ 1620ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 16213e519524SHoward Hinnant} 16223e519524SHoward Hinnant 16233e519524SHoward Hinnant// move 16243e519524SHoward Hinnant 16253e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16273e519524SHoward Hinnant_OutputIterator 16283e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16293e519524SHoward Hinnant{ 16303e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 1631ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 16323e519524SHoward Hinnant return __result; 16333e519524SHoward Hinnant} 16343e519524SHoward Hinnant 16353e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16373e519524SHoward Hinnanttypename enable_if 16383e519524SHoward Hinnant< 16393e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1640ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16413e519524SHoward Hinnant _Up* 16423e519524SHoward Hinnant>::type 16433e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 16443e519524SHoward Hinnant{ 16453e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1646ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16473e519524SHoward Hinnant return __result + __n; 16483e519524SHoward Hinnant} 16493e519524SHoward Hinnant 16503e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16523e519524SHoward Hinnant_OutputIterator 16533e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16543e519524SHoward Hinnant{ 1655ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16563e519524SHoward Hinnant} 16573e519524SHoward Hinnant 16583e519524SHoward Hinnant// move_backward 16593e519524SHoward Hinnant 16603e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16623e519524SHoward Hinnant_OutputIterator 16633e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16643e519524SHoward Hinnant{ 16653e519524SHoward Hinnant while (__first != __last) 1666ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 16673e519524SHoward Hinnant return __result; 16683e519524SHoward Hinnant} 16693e519524SHoward Hinnant 16703e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16723e519524SHoward Hinnanttypename enable_if 16733e519524SHoward Hinnant< 16743e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1675ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16763e519524SHoward Hinnant _Up* 16773e519524SHoward Hinnant>::type 16783e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 16793e519524SHoward Hinnant{ 16803e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16813e519524SHoward Hinnant __result -= __n; 1682ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16833e519524SHoward Hinnant return __result; 16843e519524SHoward Hinnant} 16853e519524SHoward Hinnant 16863e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 16873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16883e519524SHoward Hinnant_BidirectionalIterator2 16893e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 16903e519524SHoward Hinnant _BidirectionalIterator2 __result) 16913e519524SHoward Hinnant{ 1692ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16933e519524SHoward Hinnant} 16943e519524SHoward Hinnant 16953e519524SHoward Hinnant// iter_swap 16963e519524SHoward Hinnant 1697a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 16983e519524SHoward Hinnant 16993e519524SHoward Hinnant// transform 17003e519524SHoward Hinnant 17013e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 17023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17033e519524SHoward Hinnant_OutputIterator 17043e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 17053e519524SHoward Hinnant{ 17063e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17073e519524SHoward Hinnant *__result = __op(*__first); 17083e519524SHoward Hinnant return __result; 17093e519524SHoward Hinnant} 17103e519524SHoward Hinnant 17113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 17123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17133e519524SHoward Hinnant_OutputIterator 17143e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 17153e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 17163e519524SHoward Hinnant{ 17173e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 17183e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 17193e519524SHoward Hinnant return __result; 17203e519524SHoward Hinnant} 17213e519524SHoward Hinnant 17223e519524SHoward Hinnant// replace 17233e519524SHoward Hinnant 17243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17263e519524SHoward Hinnantvoid 17273e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 17283e519524SHoward Hinnant{ 17293e519524SHoward Hinnant for (; __first != __last; ++__first) 17303e519524SHoward Hinnant if (*__first == __old_value) 17313e519524SHoward Hinnant *__first = __new_value; 17323e519524SHoward Hinnant} 17333e519524SHoward Hinnant 17343e519524SHoward Hinnant// replace_if 17353e519524SHoward Hinnant 17363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 17373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17383e519524SHoward Hinnantvoid 17393e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 17403e519524SHoward Hinnant{ 17413e519524SHoward Hinnant for (; __first != __last; ++__first) 17423e519524SHoward Hinnant if (__pred(*__first)) 17433e519524SHoward Hinnant *__first = __new_value; 17443e519524SHoward Hinnant} 17453e519524SHoward Hinnant 17463e519524SHoward Hinnant// replace_copy 17473e519524SHoward Hinnant 17483e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 17493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17503e519524SHoward Hinnant_OutputIterator 17513e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 17523e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 17533e519524SHoward Hinnant{ 17543e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17553e519524SHoward Hinnant if (*__first == __old_value) 17563e519524SHoward Hinnant *__result = __new_value; 17573e519524SHoward Hinnant else 17583e519524SHoward Hinnant *__result = *__first; 17593e519524SHoward Hinnant return __result; 17603e519524SHoward Hinnant} 17613e519524SHoward Hinnant 17623e519524SHoward Hinnant// replace_copy_if 17633e519524SHoward Hinnant 17643e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 17653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnant_OutputIterator 17673e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 17683e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 17693e519524SHoward Hinnant{ 17703e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17713e519524SHoward Hinnant if (__pred(*__first)) 17723e519524SHoward Hinnant *__result = __new_value; 17733e519524SHoward Hinnant else 17743e519524SHoward Hinnant *__result = *__first; 17753e519524SHoward Hinnant return __result; 17763e519524SHoward Hinnant} 17773e519524SHoward Hinnant 17783e519524SHoward Hinnant// fill_n 17793e519524SHoward Hinnant 17803e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17823e519524SHoward Hinnant_OutputIterator 1783e4383379SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_, false_type) 17843e519524SHoward Hinnant{ 17853e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 1786e4383379SHoward Hinnant *__first = __value_; 17873e519524SHoward Hinnant return __first; 17883e519524SHoward Hinnant} 17893e519524SHoward Hinnant 17903e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17923e519524SHoward Hinnant_OutputIterator 1793e4383379SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_, true_type) 17943e519524SHoward Hinnant{ 17953e519524SHoward Hinnant if (__n > 0) 1796e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 17973e519524SHoward Hinnant return __first + __n; 17983e519524SHoward Hinnant} 17993e519524SHoward Hinnant 18003e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 18013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18023e519524SHoward Hinnant_OutputIterator 1803e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 18043e519524SHoward Hinnant{ 1805e4383379SHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_, integral_constant<bool, 18063e519524SHoward Hinnant is_pointer<_OutputIterator>::value && 1807ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value && 18083e519524SHoward Hinnant sizeof(_Tp) == 1>()); 18093e519524SHoward Hinnant} 18103e519524SHoward Hinnant 18113e519524SHoward Hinnant// fill 18123e519524SHoward Hinnant 18133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 18143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18153e519524SHoward Hinnantvoid 1816e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 18173e519524SHoward Hinnant{ 18183e519524SHoward Hinnant for (; __first != __last; ++__first) 1819e4383379SHoward Hinnant *__first = __value_; 18203e519524SHoward Hinnant} 18213e519524SHoward Hinnant 18223e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 18233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18243e519524SHoward Hinnantvoid 1825e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 18263e519524SHoward Hinnant{ 1827e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 18283e519524SHoward Hinnant} 18293e519524SHoward Hinnant 18303e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 18313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18323e519524SHoward Hinnantvoid 1833e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 18343e519524SHoward Hinnant{ 1835e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 18363e519524SHoward Hinnant} 18373e519524SHoward Hinnant 18383e519524SHoward Hinnant// generate 18393e519524SHoward Hinnant 18403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 18413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18423e519524SHoward Hinnantvoid 18433e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 18443e519524SHoward Hinnant{ 18453e519524SHoward Hinnant for (; __first != __last; ++__first) 18463e519524SHoward Hinnant *__first = __gen(); 18473e519524SHoward Hinnant} 18483e519524SHoward Hinnant 18493e519524SHoward Hinnant// generate_n 18503e519524SHoward Hinnant 18513e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 18523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18533e519524SHoward Hinnant_OutputIterator 18543e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 18553e519524SHoward Hinnant{ 18563e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 18573e519524SHoward Hinnant *__first = __gen(); 18583e519524SHoward Hinnant return __first; 18593e519524SHoward Hinnant} 18603e519524SHoward Hinnant 18613e519524SHoward Hinnant// remove 18623e519524SHoward Hinnant 18633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 18643e519524SHoward Hinnant_ForwardIterator 1865e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 18663e519524SHoward Hinnant{ 1867e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 18683e519524SHoward Hinnant if (__first != __last) 18693e519524SHoward Hinnant { 18703e519524SHoward Hinnant _ForwardIterator __i = __first; 18713e519524SHoward Hinnant while (++__i != __last) 18723e519524SHoward Hinnant { 1873e4383379SHoward Hinnant if (!(*__i == __value_)) 18743e519524SHoward Hinnant { 1875ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 18763e519524SHoward Hinnant ++__first; 18773e519524SHoward Hinnant } 18783e519524SHoward Hinnant } 18793e519524SHoward Hinnant } 18803e519524SHoward Hinnant return __first; 18813e519524SHoward Hinnant} 18823e519524SHoward Hinnant 18833e519524SHoward Hinnant// remove_if 18843e519524SHoward Hinnant 18853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 18863e519524SHoward Hinnant_ForwardIterator 18873e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 18883e519524SHoward Hinnant{ 1889ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 18903e519524SHoward Hinnant (__first, __last, __pred); 18913e519524SHoward Hinnant if (__first != __last) 18923e519524SHoward Hinnant { 18933e519524SHoward Hinnant _ForwardIterator __i = __first; 18943e519524SHoward Hinnant while (++__i != __last) 18953e519524SHoward Hinnant { 18963e519524SHoward Hinnant if (!__pred(*__i)) 18973e519524SHoward Hinnant { 1898ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 18993e519524SHoward Hinnant ++__first; 19003e519524SHoward Hinnant } 19013e519524SHoward Hinnant } 19023e519524SHoward Hinnant } 19033e519524SHoward Hinnant return __first; 19043e519524SHoward Hinnant} 19053e519524SHoward Hinnant 19063e519524SHoward Hinnant// remove_copy 19073e519524SHoward Hinnant 19083e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19103e519524SHoward Hinnant_OutputIterator 1911e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 19123e519524SHoward Hinnant{ 19133e519524SHoward Hinnant for (; __first != __last; ++__first) 19143e519524SHoward Hinnant { 1915e4383379SHoward Hinnant if (!(*__first == __value_)) 19163e519524SHoward Hinnant { 19173e519524SHoward Hinnant *__result = *__first; 19183e519524SHoward Hinnant ++__result; 19193e519524SHoward Hinnant } 19203e519524SHoward Hinnant } 19213e519524SHoward Hinnant return __result; 19223e519524SHoward Hinnant} 19233e519524SHoward Hinnant 19243e519524SHoward Hinnant// remove_copy_if 19253e519524SHoward Hinnant 19263e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 19273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19283e519524SHoward Hinnant_OutputIterator 19293e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 19303e519524SHoward Hinnant{ 19313e519524SHoward Hinnant for (; __first != __last; ++__first) 19323e519524SHoward Hinnant { 19333e519524SHoward Hinnant if (!__pred(*__first)) 19343e519524SHoward Hinnant { 19353e519524SHoward Hinnant *__result = *__first; 19363e519524SHoward Hinnant ++__result; 19373e519524SHoward Hinnant } 19383e519524SHoward Hinnant } 19393e519524SHoward Hinnant return __result; 19403e519524SHoward Hinnant} 19413e519524SHoward Hinnant 19423e519524SHoward Hinnant// unique 19433e519524SHoward Hinnant 19443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 19453e519524SHoward Hinnant_ForwardIterator 19463e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 19473e519524SHoward Hinnant{ 1948ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 19493e519524SHoward Hinnant (__first, __last, __pred); 19503e519524SHoward Hinnant if (__first != __last) 19513e519524SHoward Hinnant { 19523e519524SHoward Hinnant // ... a a ? ... 19533e519524SHoward Hinnant // f i 19543e519524SHoward Hinnant _ForwardIterator __i = __first; 19553e519524SHoward Hinnant for (++__i; ++__i != __last;) 19563e519524SHoward Hinnant if (!__pred(*__first, *__i)) 1957ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 19583e519524SHoward Hinnant ++__first; 19593e519524SHoward Hinnant } 19603e519524SHoward Hinnant return __first; 19613e519524SHoward Hinnant} 19623e519524SHoward Hinnant 19633e519524SHoward Hinnanttemplate <class _ForwardIterator> 19643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19653e519524SHoward Hinnant_ForwardIterator 19663e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 19673e519524SHoward Hinnant{ 19683e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1969ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 19703e519524SHoward Hinnant} 19713e519524SHoward Hinnant 19723e519524SHoward Hinnant// unique_copy 19733e519524SHoward Hinnant 19743e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 19753e519524SHoward Hinnant_OutputIterator 19763e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 19773e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 19783e519524SHoward Hinnant{ 19793e519524SHoward Hinnant if (__first != __last) 19803e519524SHoward Hinnant { 19813e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 19823e519524SHoward Hinnant *__result = __t; 19833e519524SHoward Hinnant ++__result; 19843e519524SHoward Hinnant while (++__first != __last) 19853e519524SHoward Hinnant { 19863e519524SHoward Hinnant if (!__pred(__t, *__first)) 19873e519524SHoward Hinnant { 19883e519524SHoward Hinnant __t = *__first; 19893e519524SHoward Hinnant *__result = __t; 19903e519524SHoward Hinnant ++__result; 19913e519524SHoward Hinnant } 19923e519524SHoward Hinnant } 19933e519524SHoward Hinnant } 19943e519524SHoward Hinnant return __result; 19953e519524SHoward Hinnant} 19963e519524SHoward Hinnant 19973e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 19983e519524SHoward Hinnant_OutputIterator 19993e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 20003e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 20013e519524SHoward Hinnant{ 20023e519524SHoward Hinnant if (__first != __last) 20033e519524SHoward Hinnant { 20043e519524SHoward Hinnant _ForwardIterator __i = __first; 20053e519524SHoward Hinnant *__result = *__i; 20063e519524SHoward Hinnant ++__result; 20073e519524SHoward Hinnant while (++__first != __last) 20083e519524SHoward Hinnant { 20093e519524SHoward Hinnant if (!__pred(*__i, *__first)) 20103e519524SHoward Hinnant { 20113e519524SHoward Hinnant *__result = *__first; 20123e519524SHoward Hinnant ++__result; 20133e519524SHoward Hinnant __i = __first; 20143e519524SHoward Hinnant } 20153e519524SHoward Hinnant } 20163e519524SHoward Hinnant } 20173e519524SHoward Hinnant return __result; 20183e519524SHoward Hinnant} 20193e519524SHoward Hinnant 20203e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 20213e519524SHoward Hinnant_ForwardIterator 20223e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 20233e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 20243e519524SHoward Hinnant{ 20253e519524SHoward Hinnant if (__first != __last) 20263e519524SHoward Hinnant { 20273e519524SHoward Hinnant *__result = *__first; 20283e519524SHoward Hinnant while (++__first != __last) 20293e519524SHoward Hinnant if (!__pred(*__result, *__first)) 20303e519524SHoward Hinnant *++__result = *__first; 20313e519524SHoward Hinnant ++__result; 20323e519524SHoward Hinnant } 20333e519524SHoward Hinnant return __result; 20343e519524SHoward Hinnant} 20353e519524SHoward Hinnant 20363e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 20373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20383e519524SHoward Hinnant_OutputIterator 20393e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 20403e519524SHoward Hinnant{ 2041ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 20423e519524SHoward Hinnant (__first, __last, __result, __pred, 20433e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 20443e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 20453e519524SHoward Hinnant} 20463e519524SHoward Hinnant 20473e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 20483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20493e519524SHoward Hinnant_OutputIterator 20503e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 20513e519524SHoward Hinnant{ 20523e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2053ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 20543e519524SHoward Hinnant} 20553e519524SHoward Hinnant 20563e519524SHoward Hinnant// reverse 20573e519524SHoward Hinnant 20583e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 20593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20603e519524SHoward Hinnantvoid 20613e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 20623e519524SHoward Hinnant{ 20633e519524SHoward Hinnant while (__first != __last) 20643e519524SHoward Hinnant { 20653e519524SHoward Hinnant if (__first == --__last) 20663e519524SHoward Hinnant break; 20673e519524SHoward Hinnant swap(*__first, *__last); 20683e519524SHoward Hinnant ++__first; 20693e519524SHoward Hinnant } 20703e519524SHoward Hinnant} 20713e519524SHoward Hinnant 20723e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 20733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20743e519524SHoward Hinnantvoid 20753e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 20763e519524SHoward Hinnant{ 20773e519524SHoward Hinnant if (__first != __last) 20783e519524SHoward Hinnant for (; __first < --__last; ++__first) 20793e519524SHoward Hinnant swap(*__first, *__last); 20803e519524SHoward Hinnant} 20813e519524SHoward Hinnant 20823e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 20833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20843e519524SHoward Hinnantvoid 20853e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 20863e519524SHoward Hinnant{ 2087ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 20883e519524SHoward Hinnant} 20893e519524SHoward Hinnant 20903e519524SHoward Hinnant// reverse_copy 20913e519524SHoward Hinnant 20923e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 20933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20943e519524SHoward Hinnant_OutputIterator 20953e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 20963e519524SHoward Hinnant{ 20973e519524SHoward Hinnant for (; __first != __last; ++__result) 20983e519524SHoward Hinnant *__result = *--__last; 20993e519524SHoward Hinnant return __result; 21003e519524SHoward Hinnant} 21013e519524SHoward Hinnant 21023e519524SHoward Hinnant// rotate 21033e519524SHoward Hinnant 21043e519524SHoward Hinnanttemplate <class _ForwardIterator> 21053e519524SHoward Hinnant_ForwardIterator 21063e519524SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, false_type) 21073e519524SHoward Hinnant{ 21083e519524SHoward Hinnant if (__first == __middle) 21093e519524SHoward Hinnant return __last; 21103e519524SHoward Hinnant if (__middle == __last) 21113e519524SHoward Hinnant return __first; 21123e519524SHoward Hinnant _ForwardIterator __i = __middle; 21133e519524SHoward Hinnant while (true) 21143e519524SHoward Hinnant { 21153e519524SHoward Hinnant swap(*__first, *__i); 21163e519524SHoward Hinnant ++__first; 21173e519524SHoward Hinnant if (++__i == __last) 21183e519524SHoward Hinnant break; 21193e519524SHoward Hinnant if (__first == __middle) 21203e519524SHoward Hinnant __middle = __i; 21213e519524SHoward Hinnant } 21223e519524SHoward Hinnant _ForwardIterator __r = __first; 21233e519524SHoward Hinnant if (__first != __middle) 21243e519524SHoward Hinnant { 21253e519524SHoward Hinnant __i = __middle; 21263e519524SHoward Hinnant while (true) 21273e519524SHoward Hinnant { 21283e519524SHoward Hinnant swap(*__first, *__i); 21293e519524SHoward Hinnant ++__first; 21303e519524SHoward Hinnant if (++__i == __last) 21313e519524SHoward Hinnant { 21323e519524SHoward Hinnant if (__first == __middle) 21333e519524SHoward Hinnant break; 21343e519524SHoward Hinnant __i = __middle; 21353e519524SHoward Hinnant } 21363e519524SHoward Hinnant else if (__first == __middle) 21373e519524SHoward Hinnant __middle = __i; 21383e519524SHoward Hinnant } 21393e519524SHoward Hinnant } 21403e519524SHoward Hinnant return __r; 21413e519524SHoward Hinnant} 21423e519524SHoward Hinnant 21433e519524SHoward Hinnanttemplate<typename _Integral> 21443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21453e519524SHoward Hinnant_Integral 21463e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 21473e519524SHoward Hinnant{ 21483e519524SHoward Hinnant do 21493e519524SHoward Hinnant { 21503e519524SHoward Hinnant _Integral __t = __x % __y; 21513e519524SHoward Hinnant __x = __y; 21523e519524SHoward Hinnant __y = __t; 21533e519524SHoward Hinnant } while (__y); 21543e519524SHoward Hinnant return __x; 21553e519524SHoward Hinnant} 21563e519524SHoward Hinnant 21573e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 21583e519524SHoward Hinnant_RandomAccessIterator 21593e519524SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, true_type) 21603e519524SHoward Hinnant{ 21613e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 21623e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 21633e519524SHoward Hinnant 21643e519524SHoward Hinnant if (__first == __middle) 21653e519524SHoward Hinnant return __last; 21663e519524SHoward Hinnant if (__middle == __last) 21673e519524SHoward Hinnant return __first; 21683e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 21693e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 21703e519524SHoward Hinnant if (__m1 == __m2) 21713e519524SHoward Hinnant { 2172ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 21733e519524SHoward Hinnant return __middle; 21743e519524SHoward Hinnant } 21753e519524SHoward Hinnant const difference_type __g = __gcd(__m1, __m2); 21763e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 21773e519524SHoward Hinnant { 21783e519524SHoward Hinnant value_type __t(*--__p); 21793e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 21803e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 21813e519524SHoward Hinnant do 21823e519524SHoward Hinnant { 21833e519524SHoward Hinnant *__p1 = *__p2; 21843e519524SHoward Hinnant __p1 = __p2; 21853e519524SHoward Hinnant const difference_type __d = __last - __p2; 21863e519524SHoward Hinnant if (__m1 < __d) 21873e519524SHoward Hinnant __p2 += __m1; 21883e519524SHoward Hinnant else 21893e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 21903e519524SHoward Hinnant } while (__p2 != __p); 21913e519524SHoward Hinnant *__p1 = __t; 21923e519524SHoward Hinnant } 21933e519524SHoward Hinnant return __first + __m2; 21943e519524SHoward Hinnant} 21953e519524SHoward Hinnant 21963e519524SHoward Hinnanttemplate <class _ForwardIterator> 21973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21983e519524SHoward Hinnant_ForwardIterator 21993e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 22003e519524SHoward Hinnant{ 2201ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 22023e519524SHoward Hinnant integral_constant 22033e519524SHoward Hinnant < 22043e519524SHoward Hinnant bool, 22053e519524SHoward Hinnant is_convertible 22063e519524SHoward Hinnant < 22073e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::iterator_category, 22083e519524SHoward Hinnant random_access_iterator_tag 22093e519524SHoward Hinnant >::value && 2210ca740483SHoward Hinnant is_trivially_copy_assignable 22113e519524SHoward Hinnant < 22123e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::value_type 22133e519524SHoward Hinnant >::value 22143e519524SHoward Hinnant >()); 22153e519524SHoward Hinnant} 22163e519524SHoward Hinnant 22173e519524SHoward Hinnant// rotate_copy 22183e519524SHoward Hinnant 22193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 22203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22213e519524SHoward Hinnant_OutputIterator 22223e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 22233e519524SHoward Hinnant{ 2224ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 22253e519524SHoward Hinnant} 22263e519524SHoward Hinnant 22273e519524SHoward Hinnant// min_element 22283e519524SHoward Hinnant 22293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 22303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22313e519524SHoward Hinnant_ForwardIterator 22323e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 22333e519524SHoward Hinnant{ 22343e519524SHoward Hinnant if (__first != __last) 22353e519524SHoward Hinnant { 22363e519524SHoward Hinnant _ForwardIterator __i = __first; 22373e519524SHoward Hinnant while (++__i != __last) 22383e519524SHoward Hinnant if (__comp(*__i, *__first)) 22393e519524SHoward Hinnant __first = __i; 22403e519524SHoward Hinnant } 22413e519524SHoward Hinnant return __first; 22423e519524SHoward Hinnant} 22433e519524SHoward Hinnant 22443e519524SHoward Hinnanttemplate <class _ForwardIterator> 22453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22463e519524SHoward Hinnant_ForwardIterator 22473e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 22483e519524SHoward Hinnant{ 2249ce48a113SHoward Hinnant return _VSTD::min_element(__first, __last, 22504eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22514eb27b79SHoward Hinnant} 22524eb27b79SHoward Hinnant 22534eb27b79SHoward Hinnant// min 22544eb27b79SHoward Hinnant 22554eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 22564eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22574eb27b79SHoward Hinnantconst _Tp& 22584eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 22594eb27b79SHoward Hinnant{ 22604eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 22614eb27b79SHoward Hinnant} 22624eb27b79SHoward Hinnant 22634eb27b79SHoward Hinnanttemplate <class _Tp> 22644eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22654eb27b79SHoward Hinnantconst _Tp& 22664eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 22674eb27b79SHoward Hinnant{ 2268ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 22694eb27b79SHoward Hinnant} 22704eb27b79SHoward Hinnant 227154976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 227254976f26SHoward Hinnant 22734eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 22744eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22754eb27b79SHoward Hinnant_Tp 22764eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 22774eb27b79SHoward Hinnant{ 2278ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 22794eb27b79SHoward Hinnant} 22804eb27b79SHoward Hinnant 22814eb27b79SHoward Hinnanttemplate<class _Tp> 22824eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22834eb27b79SHoward Hinnant_Tp 22844eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 22854eb27b79SHoward Hinnant{ 2286ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end()); 22873e519524SHoward Hinnant} 22883e519524SHoward Hinnant 228954976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 229054976f26SHoward Hinnant 22913e519524SHoward Hinnant// max_element 22923e519524SHoward Hinnant 22933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 22943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22953e519524SHoward Hinnant_ForwardIterator 22963e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 22973e519524SHoward Hinnant{ 22983e519524SHoward Hinnant if (__first != __last) 22993e519524SHoward Hinnant { 23003e519524SHoward Hinnant _ForwardIterator __i = __first; 23013e519524SHoward Hinnant while (++__i != __last) 23023e519524SHoward Hinnant if (__comp(*__first, *__i)) 23033e519524SHoward Hinnant __first = __i; 23043e519524SHoward Hinnant } 23053e519524SHoward Hinnant return __first; 23063e519524SHoward Hinnant} 23073e519524SHoward Hinnant 23083e519524SHoward Hinnanttemplate <class _ForwardIterator> 23093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23103e519524SHoward Hinnant_ForwardIterator 23113e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 23123e519524SHoward Hinnant{ 2313ce48a113SHoward Hinnant return _VSTD::max_element(__first, __last, 23144eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 23154eb27b79SHoward Hinnant} 23164eb27b79SHoward Hinnant 23174eb27b79SHoward Hinnant// max 23184eb27b79SHoward Hinnant 23194eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 23204eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23214eb27b79SHoward Hinnantconst _Tp& 23224eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 23234eb27b79SHoward Hinnant{ 23244eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 23254eb27b79SHoward Hinnant} 23264eb27b79SHoward Hinnant 23274eb27b79SHoward Hinnanttemplate <class _Tp> 23284eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23294eb27b79SHoward Hinnantconst _Tp& 23304eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 23314eb27b79SHoward Hinnant{ 2332ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 23334eb27b79SHoward Hinnant} 23344eb27b79SHoward Hinnant 233554976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 233654976f26SHoward Hinnant 23374eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 23384eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23394eb27b79SHoward Hinnant_Tp 23404eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 23414eb27b79SHoward Hinnant{ 2342ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 23434eb27b79SHoward Hinnant} 23444eb27b79SHoward Hinnant 23454eb27b79SHoward Hinnanttemplate<class _Tp> 23464eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23474eb27b79SHoward Hinnant_Tp 23484eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 23494eb27b79SHoward Hinnant{ 2350ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end()); 23513e519524SHoward Hinnant} 23523e519524SHoward Hinnant 235354976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 235454976f26SHoward Hinnant 23553e519524SHoward Hinnant// minmax_element 23563e519524SHoward Hinnant 23573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 23583e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 23593e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 23603e519524SHoward Hinnant{ 23613e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 23623e519524SHoward Hinnant if (__first != __last) 23633e519524SHoward Hinnant { 23643e519524SHoward Hinnant if (++__first != __last) 23653e519524SHoward Hinnant { 23663e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 23673e519524SHoward Hinnant __result.first = __first; 23683e519524SHoward Hinnant else 23693e519524SHoward Hinnant __result.second = __first; 23703e519524SHoward Hinnant while (++__first != __last) 23713e519524SHoward Hinnant { 23723e519524SHoward Hinnant _ForwardIterator __i = __first; 23733e519524SHoward Hinnant if (++__first == __last) 23743e519524SHoward Hinnant { 23753e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 23763e519524SHoward Hinnant __result.first = __i; 23773e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 23783e519524SHoward Hinnant __result.second = __i; 23793e519524SHoward Hinnant break; 23803e519524SHoward Hinnant } 23813e519524SHoward Hinnant else 23823e519524SHoward Hinnant { 23833e519524SHoward Hinnant if (__comp(*__first, *__i)) 23843e519524SHoward Hinnant { 23853e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 23863e519524SHoward Hinnant __result.first = __first; 23873e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 23883e519524SHoward Hinnant __result.second = __i; 23893e519524SHoward Hinnant } 23903e519524SHoward Hinnant else 23913e519524SHoward Hinnant { 23923e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 23933e519524SHoward Hinnant __result.first = __i; 23943e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 23953e519524SHoward Hinnant __result.second = __first; 23963e519524SHoward Hinnant } 23973e519524SHoward Hinnant } 23983e519524SHoward Hinnant } 23993e519524SHoward Hinnant } 24003e519524SHoward Hinnant } 24013e519524SHoward Hinnant return __result; 24023e519524SHoward Hinnant} 24033e519524SHoward Hinnant 24043e519524SHoward Hinnanttemplate <class _ForwardIterator> 24053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24063e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 24073e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 24083e519524SHoward Hinnant{ 2409ce48a113SHoward Hinnant return _VSTD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 24103e519524SHoward Hinnant} 24113e519524SHoward Hinnant 24124eb27b79SHoward Hinnant// minmax 24134eb27b79SHoward Hinnant 24144eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 24154eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24164eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 24174eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 24184eb27b79SHoward Hinnant{ 24194eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 24204eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 24214eb27b79SHoward Hinnant} 24224eb27b79SHoward Hinnant 24234eb27b79SHoward Hinnanttemplate<class _Tp> 24244eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24254eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 24264eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 24274eb27b79SHoward Hinnant{ 2428ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 24294eb27b79SHoward Hinnant} 24304eb27b79SHoward Hinnant 243154976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 243254976f26SHoward Hinnant 24334eb27b79SHoward Hinnanttemplate<class _Tp> 24344eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24354eb27b79SHoward Hinnantpair<_Tp, _Tp> 24364eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t) 24374eb27b79SHoward Hinnant{ 24384eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2439ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end()); 24404eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 24414eb27b79SHoward Hinnant} 24424eb27b79SHoward Hinnant 24434eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 24444eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24454eb27b79SHoward Hinnantpair<_Tp, _Tp> 24464eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 24474eb27b79SHoward Hinnant{ 24484eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2449ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end(), __comp); 24504eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 24514eb27b79SHoward Hinnant} 24524eb27b79SHoward Hinnant 245354976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 245454976f26SHoward Hinnant 24553e519524SHoward Hinnant// random_shuffle 24563e519524SHoward Hinnant 2457f9d540b0SHoward Hinnant// __independent_bits_engine 2458f9d540b0SHoward Hinnant 2459c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2460f9d540b0SHoward Hinnantstruct __log2_imp 24613e519524SHoward Hinnant{ 2462c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2463c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 24643e519524SHoward Hinnant}; 24653e519524SHoward Hinnant 2466c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2467c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 24683e519524SHoward Hinnant{ 2469f9d540b0SHoward Hinnant static const size_t value = 0; 24703e519524SHoward Hinnant}; 24713e519524SHoward Hinnant 2472c003db1fSHoward Hinnanttemplate <size_t _Rp> 2473c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 24743e519524SHoward Hinnant{ 2475c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 24763e519524SHoward Hinnant}; 24773e519524SHoward Hinnant 2478c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2479f9d540b0SHoward Hinnantstruct __log2 24803e519524SHoward Hinnant{ 2481c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2482f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 24833e519524SHoward Hinnant}; 24843e519524SHoward Hinnant 2485f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2486f9d540b0SHoward Hinnantclass __independent_bits_engine 24873e519524SHoward Hinnant{ 2488f9d540b0SHoward Hinnantpublic: 2489f9d540b0SHoward Hinnant // types 2490f9d540b0SHoward Hinnant typedef _UIntType result_type; 2491f9d540b0SHoward Hinnant 2492f9d540b0SHoward Hinnantprivate: 2493f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2494f9d540b0SHoward Hinnant typedef typename conditional 2495f9d540b0SHoward Hinnant < 2496f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2497f9d540b0SHoward Hinnant result_type, 2498f9d540b0SHoward Hinnant _Engine_result_type 2499f9d540b0SHoward Hinnant >::type _Working_result_type; 2500f9d540b0SHoward Hinnant 2501f9d540b0SHoward Hinnant _Engine& __e_; 2502f9d540b0SHoward Hinnant size_t __w_; 2503f9d540b0SHoward Hinnant size_t __w0_; 2504f9d540b0SHoward Hinnant size_t __n_; 2505f9d540b0SHoward Hinnant size_t __n0_; 2506f9d540b0SHoward Hinnant _Working_result_type __y0_; 2507f9d540b0SHoward Hinnant _Working_result_type __y1_; 2508f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2509f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2510f9d540b0SHoward Hinnant 2511*e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2512c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2513f9d540b0SHoward Hinnant + _Working_result_type(1); 2514*e386b7b3SHoward Hinnant#else 2515*e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2516*e386b7b3SHoward Hinnant + _Working_result_type(1); 2517*e386b7b3SHoward Hinnant#endif 2518*e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2519*e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2520*e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2521f9d540b0SHoward Hinnant 2522f9d540b0SHoward Hinnantpublic: 2523f9d540b0SHoward Hinnant // constructors and seeding functions 2524f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2525f9d540b0SHoward Hinnant 2526f9d540b0SHoward Hinnant // generating functions 2527c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2528f9d540b0SHoward Hinnant 2529f9d540b0SHoward Hinnantprivate: 2530f9d540b0SHoward Hinnant result_type __eval(false_type); 2531f9d540b0SHoward Hinnant result_type __eval(true_type); 2532f9d540b0SHoward Hinnant}; 2533f9d540b0SHoward Hinnant 2534f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2535f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2536f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2537f9d540b0SHoward Hinnant : __e_(__e), 2538f9d540b0SHoward Hinnant __w_(__w) 2539f9d540b0SHoward Hinnant{ 2540f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2541f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2542c003db1fSHoward Hinnant if (_Rp == 0) 2543c003db1fSHoward Hinnant __y0_ = _Rp; 2544f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2545c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2546f9d540b0SHoward Hinnant else 2547f9d540b0SHoward Hinnant __y0_ = 0; 2548c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2549f9d540b0SHoward Hinnant { 2550f9d540b0SHoward Hinnant ++__n_; 2551f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2552f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2553c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2554f9d540b0SHoward Hinnant else 2555f9d540b0SHoward Hinnant __y0_ = 0; 2556f9d540b0SHoward Hinnant } 2557f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2558f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2559c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2560f9d540b0SHoward Hinnant else 2561f9d540b0SHoward Hinnant __y1_ = 0; 2562f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2563f9d540b0SHoward Hinnant _Engine_result_type(0); 2564f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2565f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2566f9d540b0SHoward Hinnant _Engine_result_type(~0); 25673e519524SHoward Hinnant} 25683e519524SHoward Hinnant 2569f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2570f9d540b0SHoward Hinnantinline 2571f9d540b0SHoward Hinnant_UIntType 2572f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 25733e519524SHoward Hinnant{ 2574f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 25753e519524SHoward Hinnant} 25763e519524SHoward Hinnant 2577f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2578f9d540b0SHoward Hinnant_UIntType 2579f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 25803e519524SHoward Hinnant{ 2581c003db1fSHoward Hinnant result_type _Sp = 0; 2582f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2583f9d540b0SHoward Hinnant { 2584f9d540b0SHoward Hinnant _Engine_result_type __u; 25853e519524SHoward Hinnant do 2586f9d540b0SHoward Hinnant { 2587f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2588f9d540b0SHoward Hinnant } while (__u >= __y0_); 25890176bc6cSHoward Hinnant if (__w0_ < _WDt) 2590c003db1fSHoward Hinnant _Sp <<= __w0_; 2591f9d540b0SHoward Hinnant else 2592c003db1fSHoward Hinnant _Sp = 0; 2593c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2594f9d540b0SHoward Hinnant } 2595f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2596f9d540b0SHoward Hinnant { 2597f9d540b0SHoward Hinnant _Engine_result_type __u; 2598f9d540b0SHoward Hinnant do 2599f9d540b0SHoward Hinnant { 2600f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2601f9d540b0SHoward Hinnant } while (__u >= __y1_); 26020176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2603c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2604f9d540b0SHoward Hinnant else 2605c003db1fSHoward Hinnant _Sp = 0; 2606c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2607f9d540b0SHoward Hinnant } 2608c003db1fSHoward Hinnant return _Sp; 26093e519524SHoward Hinnant} 26103e519524SHoward Hinnant 2611f9d540b0SHoward Hinnant// uniform_int_distribution 26123e519524SHoward Hinnant 2613f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2614f9d540b0SHoward Hinnantclass uniform_int_distribution 26153e519524SHoward Hinnant{ 2616f9d540b0SHoward Hinnantpublic: 2617f9d540b0SHoward Hinnant // types 2618f9d540b0SHoward Hinnant typedef _IntType result_type; 2619f9d540b0SHoward Hinnant 2620f9d540b0SHoward Hinnant class param_type 2621f9d540b0SHoward Hinnant { 2622f9d540b0SHoward Hinnant result_type __a_; 2623f9d540b0SHoward Hinnant result_type __b_; 2624f9d540b0SHoward Hinnant public: 2625f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2626f9d540b0SHoward Hinnant 2627f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2628f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2629f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2630f9d540b0SHoward Hinnant 2631f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2632f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2633f9d540b0SHoward Hinnant 2634f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2635f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2636f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2637f9d540b0SHoward Hinnant {return !(__x == __y);} 26383e519524SHoward Hinnant }; 26393e519524SHoward Hinnant 2640f9d540b0SHoward Hinnantprivate: 2641f9d540b0SHoward Hinnant param_type __p_; 26423e519524SHoward Hinnant 2643f9d540b0SHoward Hinnantpublic: 2644f9d540b0SHoward Hinnant // constructors and reset functions 2645f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2646f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2647f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2648f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2649f9d540b0SHoward Hinnant void reset() {} 2650f9d540b0SHoward Hinnant 2651f9d540b0SHoward Hinnant // generating functions 2652f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2653f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2654f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2655f9d540b0SHoward Hinnant 2656f9d540b0SHoward Hinnant // property functions 2657f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2658f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2659f9d540b0SHoward Hinnant 2660f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2661f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2662f9d540b0SHoward Hinnant 2663f9d540b0SHoward Hinnant result_type min() const {return a();} 2664f9d540b0SHoward Hinnant result_type max() const {return b();} 2665f9d540b0SHoward Hinnant 2666f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2667f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2668f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2669f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2670f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2671f9d540b0SHoward Hinnant {return !(__x == __y);} 26723e519524SHoward Hinnant}; 26733e519524SHoward Hinnant 2674f9d540b0SHoward Hinnanttemplate<class _IntType> 2675f9d540b0SHoward Hinnanttemplate<class _URNG> 2676f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2677f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 26783e519524SHoward Hinnant{ 2679f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2680f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2681c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 2682c003db1fSHoward Hinnant if (_Rp == 1) 2683f9d540b0SHoward Hinnant return __p.a(); 2684f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2685f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2686c003db1fSHoward Hinnant if (_Rp == 0) 2687f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2688c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2689c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 2690f9d540b0SHoward Hinnant ++__w; 2691f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2692f9d540b0SHoward Hinnant _UIntType __u; 2693f9d540b0SHoward Hinnant do 26943e519524SHoward Hinnant { 2695f9d540b0SHoward Hinnant __u = __e(); 2696c003db1fSHoward Hinnant } while (__u >= _Rp); 2697f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 26983e519524SHoward Hinnant} 2699f9d540b0SHoward Hinnant 2700f9d540b0SHoward Hinnantclass __rs_default; 2701f9d540b0SHoward Hinnant 2702f9d540b0SHoward Hinnant__rs_default __rs_get(); 2703f9d540b0SHoward Hinnant 2704f9d540b0SHoward Hinnantclass __rs_default 27053e519524SHoward Hinnant{ 2706f9d540b0SHoward Hinnant static unsigned __c_; 2707f9d540b0SHoward Hinnant 2708f9d540b0SHoward Hinnant __rs_default(); 2709f9d540b0SHoward Hinnantpublic: 2710f9d540b0SHoward Hinnant typedef unsigned result_type; 2711f9d540b0SHoward Hinnant 2712f9d540b0SHoward Hinnant static const result_type _Min = 0; 2713f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2714f9d540b0SHoward Hinnant 2715f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2716f9d540b0SHoward Hinnant ~__rs_default(); 2717f9d540b0SHoward Hinnant 2718f9d540b0SHoward Hinnant result_type operator()(); 2719f9d540b0SHoward Hinnant 2720788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2721788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 2722f9d540b0SHoward Hinnant 2723f9d540b0SHoward Hinnant friend __rs_default __rs_get(); 2724f9d540b0SHoward Hinnant}; 2725f9d540b0SHoward Hinnant 2726f9d540b0SHoward Hinnant__rs_default __rs_get(); 27273e519524SHoward Hinnant 27283e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 27293e519524SHoward Hinnantvoid 27303e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 27313e519524SHoward Hinnant{ 27323e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2733c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2734c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 27353e519524SHoward Hinnant difference_type __d = __last - __first; 27363e519524SHoward Hinnant if (__d > 1) 27373e519524SHoward Hinnant { 2738c003db1fSHoward Hinnant _Dp __uid; 2739f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 2740f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2741007b26beSHoward Hinnant { 2742c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 2743007b26beSHoward Hinnant if (__i != difference_type(0)) 2744007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2745007b26beSHoward Hinnant } 27463e519524SHoward Hinnant } 27473e519524SHoward Hinnant} 27483e519524SHoward Hinnant 27493e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 27503e519524SHoward Hinnantvoid 27513e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 27527609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 27533e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 27543e519524SHoward Hinnant#else 27553e519524SHoward Hinnant _RandomNumberGenerator& __rand) 27563e519524SHoward Hinnant#endif 27573e519524SHoward Hinnant{ 27583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 27593e519524SHoward Hinnant difference_type __d = __last - __first; 27603e519524SHoward Hinnant if (__d > 1) 27613e519524SHoward Hinnant { 27623e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 2763007b26beSHoward Hinnant { 2764007b26beSHoward Hinnant difference_type __i = __rand(__d); 2765007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2766007b26beSHoward Hinnant } 27673e519524SHoward Hinnant } 27683e519524SHoward Hinnant} 27693e519524SHoward Hinnant 2770f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 2771f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 2772fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 2773fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 2774fb340102SHoward Hinnant#else 2775f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 2776fb340102SHoward Hinnant#endif 2777f9d540b0SHoward Hinnant{ 2778f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2779c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2780c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 2781f9d540b0SHoward Hinnant difference_type __d = __last - __first; 2782f9d540b0SHoward Hinnant if (__d > 1) 2783f9d540b0SHoward Hinnant { 2784c003db1fSHoward Hinnant _Dp __uid; 2785f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2786007b26beSHoward Hinnant { 2787c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 2788007b26beSHoward Hinnant if (__i != difference_type(0)) 2789007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2790007b26beSHoward Hinnant } 2791f9d540b0SHoward Hinnant } 2792f9d540b0SHoward Hinnant} 2793f9d540b0SHoward Hinnant 27943e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 27953e519524SHoward Hinnantbool 27963e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 27973e519524SHoward Hinnant{ 27983e519524SHoward Hinnant for (; __first != __last; ++__first) 27993e519524SHoward Hinnant if (!__pred(*__first)) 28003e519524SHoward Hinnant break; 28013e519524SHoward Hinnant for (; __first != __last; ++__first) 28023e519524SHoward Hinnant if (__pred(*__first)) 28033e519524SHoward Hinnant return false; 28043e519524SHoward Hinnant return true; 28053e519524SHoward Hinnant} 28063e519524SHoward Hinnant 28073e519524SHoward Hinnant// partition 28083e519524SHoward Hinnant 28093e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 28103e519524SHoward Hinnant_ForwardIterator 28113e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 28123e519524SHoward Hinnant{ 28133e519524SHoward Hinnant while (true) 28143e519524SHoward Hinnant { 28153e519524SHoward Hinnant if (__first == __last) 28163e519524SHoward Hinnant return __first; 28173e519524SHoward Hinnant if (!__pred(*__first)) 28183e519524SHoward Hinnant break; 28193e519524SHoward Hinnant ++__first; 28203e519524SHoward Hinnant } 28213e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 28223e519524SHoward Hinnant { 28233e519524SHoward Hinnant if (__pred(*__p)) 28243e519524SHoward Hinnant { 28253e519524SHoward Hinnant swap(*__first, *__p); 28263e519524SHoward Hinnant ++__first; 28273e519524SHoward Hinnant } 28283e519524SHoward Hinnant } 28293e519524SHoward Hinnant return __first; 28303e519524SHoward Hinnant} 28313e519524SHoward Hinnant 28323e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 28333e519524SHoward Hinnant_BidirectionalIterator 28343e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 28353e519524SHoward Hinnant bidirectional_iterator_tag) 28363e519524SHoward Hinnant{ 28373e519524SHoward Hinnant while (true) 28383e519524SHoward Hinnant { 28393e519524SHoward Hinnant while (true) 28403e519524SHoward Hinnant { 28413e519524SHoward Hinnant if (__first == __last) 28423e519524SHoward Hinnant return __first; 28433e519524SHoward Hinnant if (!__pred(*__first)) 28443e519524SHoward Hinnant break; 28453e519524SHoward Hinnant ++__first; 28463e519524SHoward Hinnant } 28473e519524SHoward Hinnant do 28483e519524SHoward Hinnant { 28493e519524SHoward Hinnant if (__first == --__last) 28503e519524SHoward Hinnant return __first; 28513e519524SHoward Hinnant } while (!__pred(*__last)); 28523e519524SHoward Hinnant swap(*__first, *__last); 28533e519524SHoward Hinnant ++__first; 28543e519524SHoward Hinnant } 28553e519524SHoward Hinnant} 28563e519524SHoward Hinnant 28573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 28583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 28593e519524SHoward Hinnant_ForwardIterator 28603e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 28613e519524SHoward Hinnant{ 2862ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 28633e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 28643e519524SHoward Hinnant} 28653e519524SHoward Hinnant 28663e519524SHoward Hinnant// partition_copy 28673e519524SHoward Hinnant 28683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 28693e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 28703e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 28713e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 28723e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 28733e519524SHoward Hinnant _Predicate __pred) 28743e519524SHoward Hinnant{ 28753e519524SHoward Hinnant for (; __first != __last; ++__first) 28763e519524SHoward Hinnant { 28773e519524SHoward Hinnant if (__pred(*__first)) 28783e519524SHoward Hinnant { 28793e519524SHoward Hinnant *__out_true = *__first; 28803e519524SHoward Hinnant ++__out_true; 28813e519524SHoward Hinnant } 28823e519524SHoward Hinnant else 28833e519524SHoward Hinnant { 28843e519524SHoward Hinnant *__out_false = *__first; 28853e519524SHoward Hinnant ++__out_false; 28863e519524SHoward Hinnant } 28873e519524SHoward Hinnant } 28883e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 28893e519524SHoward Hinnant} 28903e519524SHoward Hinnant 28913e519524SHoward Hinnant// partition_point 28923e519524SHoward Hinnant 28933e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 28943e519524SHoward Hinnant_ForwardIterator 28953e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 28963e519524SHoward Hinnant{ 28973e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 2898ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 28993e519524SHoward Hinnant while (__len != 0) 29003e519524SHoward Hinnant { 29013e519524SHoward Hinnant difference_type __l2 = __len / 2; 29023e519524SHoward Hinnant _ForwardIterator __m = __first; 2903ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 29043e519524SHoward Hinnant if (__pred(*__m)) 29053e519524SHoward Hinnant { 29063e519524SHoward Hinnant __first = ++__m; 29073e519524SHoward Hinnant __len -= __l2 + 1; 29083e519524SHoward Hinnant } 29093e519524SHoward Hinnant else 29103e519524SHoward Hinnant __len = __l2; 29113e519524SHoward Hinnant } 29123e519524SHoward Hinnant return __first; 29133e519524SHoward Hinnant} 29143e519524SHoward Hinnant 29153e519524SHoward Hinnant// stable_partition 29163e519524SHoward Hinnant 29173e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 29183e519524SHoward Hinnant_ForwardIterator 29193e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 29203e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 29213e519524SHoward Hinnant{ 29223e519524SHoward Hinnant // *__first is known to be false 29233e519524SHoward Hinnant // __len >= 1 29243e519524SHoward Hinnant if (__len == 1) 29253e519524SHoward Hinnant return __first; 29263e519524SHoward Hinnant if (__len == 2) 29273e519524SHoward Hinnant { 29283e519524SHoward Hinnant _ForwardIterator __m = __first; 29293e519524SHoward Hinnant if (__pred(*++__m)) 29303e519524SHoward Hinnant { 29313e519524SHoward Hinnant swap(*__first, *__m); 29323e519524SHoward Hinnant return __m; 29333e519524SHoward Hinnant } 29343e519524SHoward Hinnant return __first; 29353e519524SHoward Hinnant } 29363e519524SHoward Hinnant if (__len <= __p.second) 29373e519524SHoward Hinnant { // The buffer is big enough to use 29383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 29393e519524SHoward Hinnant __destruct_n __d(0); 29403e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 29413e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 29423e519524SHoward Hinnant // Update __first to always point to the end of the trues 29433e519524SHoward Hinnant value_type* __t = __p.first; 2944ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 29453e519524SHoward Hinnant __d.__incr((value_type*)0); 29463e519524SHoward Hinnant ++__t; 29473e519524SHoward Hinnant _ForwardIterator __i = __first; 29483e519524SHoward Hinnant while (++__i != __last) 29493e519524SHoward Hinnant { 29503e519524SHoward Hinnant if (__pred(*__i)) 29513e519524SHoward Hinnant { 2952ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 29533e519524SHoward Hinnant ++__first; 29543e519524SHoward Hinnant } 29553e519524SHoward Hinnant else 29563e519524SHoward Hinnant { 2957ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 29583e519524SHoward Hinnant __d.__incr((value_type*)0); 29593e519524SHoward Hinnant ++__t; 29603e519524SHoward Hinnant } 29613e519524SHoward Hinnant } 29623e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 29633e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 29643e519524SHoward Hinnant __i = __first; 29653e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 2966ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 29673e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 29683e519524SHoward Hinnant return __first; 29693e519524SHoward Hinnant } 29703e519524SHoward Hinnant // Else not enough buffer, do in place 29713e519524SHoward Hinnant // __len >= 3 29723e519524SHoward Hinnant _ForwardIterator __m = __first; 29733e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 2974ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 29753e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 29763e519524SHoward Hinnant // F????????????????? 29773e519524SHoward Hinnant // f m l 29783e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 29793e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 29803e519524SHoward Hinnant // TTTFFFFF?????????? 29813e519524SHoward Hinnant // f ff m l 29823e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 29833e519524SHoward Hinnant _ForwardIterator __m1 = __m; 29843e519524SHoward Hinnant _ForwardIterator __second_false = __last; 29853e519524SHoward Hinnant _Distance __len_half = __len - __len2; 29863e519524SHoward Hinnant while (__pred(*__m1)) 29873e519524SHoward Hinnant { 29883e519524SHoward Hinnant if (++__m1 == __last) 29893e519524SHoward Hinnant goto __second_half_done; 29903e519524SHoward Hinnant --__len_half; 29913e519524SHoward Hinnant } 29923e519524SHoward Hinnant // TTTFFFFFTTTF?????? 29933e519524SHoward Hinnant // f ff m m1 l 29943e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 29953e519524SHoward Hinnant__second_half_done: 29963e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 29973e519524SHoward Hinnant // f ff m sf l 2998ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 29993e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 30003e519524SHoward Hinnant // | 30013e519524SHoward Hinnant} 30023e519524SHoward Hinnant 30033e519524SHoward Hinnantstruct __return_temporary_buffer 30043e519524SHoward Hinnant{ 30053e519524SHoward Hinnant template <class _Tp> 3006ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 30073e519524SHoward Hinnant}; 30083e519524SHoward Hinnant 30093e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 30103e519524SHoward Hinnant_ForwardIterator 30113e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 30123e519524SHoward Hinnant forward_iterator_tag) 30133e519524SHoward Hinnant{ 30143e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 30153e519524SHoward Hinnant // Either prove all true and return __first or point to first false 30163e519524SHoward Hinnant while (true) 30173e519524SHoward Hinnant { 30183e519524SHoward Hinnant if (__first == __last) 30193e519524SHoward Hinnant return __first; 30203e519524SHoward Hinnant if (!__pred(*__first)) 30213e519524SHoward Hinnant break; 30223e519524SHoward Hinnant ++__first; 30233e519524SHoward Hinnant } 30243e519524SHoward Hinnant // We now have a reduced range [__first, __last) 30253e519524SHoward Hinnant // *__first is known to be false 30263e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 30273e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3028ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 30293e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 30303e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 30313e519524SHoward Hinnant if (__len >= __alloc_limit) 30323e519524SHoward Hinnant { 3033ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 30343e519524SHoward Hinnant __h.reset(__p.first); 30353e519524SHoward Hinnant } 30363e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 30373e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 30383e519524SHoward Hinnant} 30393e519524SHoward Hinnant 30403e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 30413e519524SHoward Hinnant_BidirectionalIterator 30423e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 30433e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 30443e519524SHoward Hinnant{ 30453e519524SHoward Hinnant // *__first is known to be false 30463e519524SHoward Hinnant // *__last is known to be true 30473e519524SHoward Hinnant // __len >= 2 30483e519524SHoward Hinnant if (__len == 2) 30493e519524SHoward Hinnant { 30503e519524SHoward Hinnant swap(*__first, *__last); 30513e519524SHoward Hinnant return __last; 30523e519524SHoward Hinnant } 30533e519524SHoward Hinnant if (__len == 3) 30543e519524SHoward Hinnant { 30553e519524SHoward Hinnant _BidirectionalIterator __m = __first; 30563e519524SHoward Hinnant if (__pred(*++__m)) 30573e519524SHoward Hinnant { 30583e519524SHoward Hinnant swap(*__first, *__m); 30593e519524SHoward Hinnant swap(*__m, *__last); 30603e519524SHoward Hinnant return __last; 30613e519524SHoward Hinnant } 30623e519524SHoward Hinnant swap(*__m, *__last); 30633e519524SHoward Hinnant swap(*__first, *__m); 30643e519524SHoward Hinnant return __m; 30653e519524SHoward Hinnant } 30663e519524SHoward Hinnant if (__len <= __p.second) 30673e519524SHoward Hinnant { // The buffer is big enough to use 30683e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 30693e519524SHoward Hinnant __destruct_n __d(0); 30703e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 30713e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 30723e519524SHoward Hinnant // Update __first to always point to the end of the trues 30733e519524SHoward Hinnant value_type* __t = __p.first; 3074ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 30753e519524SHoward Hinnant __d.__incr((value_type*)0); 30763e519524SHoward Hinnant ++__t; 30773e519524SHoward Hinnant _BidirectionalIterator __i = __first; 30783e519524SHoward Hinnant while (++__i != __last) 30793e519524SHoward Hinnant { 30803e519524SHoward Hinnant if (__pred(*__i)) 30813e519524SHoward Hinnant { 3082ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 30833e519524SHoward Hinnant ++__first; 30843e519524SHoward Hinnant } 30853e519524SHoward Hinnant else 30863e519524SHoward Hinnant { 3087ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 30883e519524SHoward Hinnant __d.__incr((value_type*)0); 30893e519524SHoward Hinnant ++__t; 30903e519524SHoward Hinnant } 30913e519524SHoward Hinnant } 30923e519524SHoward Hinnant // move *__last, known to be true 3093ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 30943e519524SHoward Hinnant __i = ++__first; 30953e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 30963e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 30973e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3098ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 30993e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 31003e519524SHoward Hinnant return __first; 31013e519524SHoward Hinnant } 31023e519524SHoward Hinnant // Else not enough buffer, do in place 31033e519524SHoward Hinnant // __len >= 4 31043e519524SHoward Hinnant _BidirectionalIterator __m = __first; 31053e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3106ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 31073e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 31083e519524SHoward Hinnant // F????????????????T 31093e519524SHoward Hinnant // f m l 31103e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 31113e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 31123e519524SHoward Hinnant _Distance __len_half = __len2; 31133e519524SHoward Hinnant while (!__pred(*--__m1)) 31143e519524SHoward Hinnant { 31153e519524SHoward Hinnant if (__m1 == __first) 31163e519524SHoward Hinnant goto __first_half_done; 31173e519524SHoward Hinnant --__len_half; 31183e519524SHoward Hinnant } 31193e519524SHoward Hinnant // F???TFFF?????????T 31203e519524SHoward Hinnant // f m1 m l 31213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 31223e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 31233e519524SHoward Hinnant__first_half_done: 31243e519524SHoward Hinnant // TTTFFFFF?????????T 31253e519524SHoward Hinnant // f ff m l 31263e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 31273e519524SHoward Hinnant __m1 = __m; 31283e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 31293e519524SHoward Hinnant ++__second_false; 31303e519524SHoward Hinnant __len_half = __len - __len2; 31313e519524SHoward Hinnant while (__pred(*__m1)) 31323e519524SHoward Hinnant { 31333e519524SHoward Hinnant if (++__m1 == __last) 31343e519524SHoward Hinnant goto __second_half_done; 31353e519524SHoward Hinnant --__len_half; 31363e519524SHoward Hinnant } 31373e519524SHoward Hinnant // TTTFFFFFTTTF?????T 31383e519524SHoward Hinnant // f ff m m1 l 31393e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 31403e519524SHoward Hinnant__second_half_done: 31413e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 31423e519524SHoward Hinnant // f ff m sf l 3143ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 31443e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 31453e519524SHoward Hinnant // | 31463e519524SHoward Hinnant} 31473e519524SHoward Hinnant 31483e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31493e519524SHoward Hinnant_BidirectionalIterator 31503e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31513e519524SHoward Hinnant bidirectional_iterator_tag) 31523e519524SHoward Hinnant{ 31533e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 31543e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 31553e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 31563e519524SHoward Hinnant // Either prove all true and return __first or point to first false 31573e519524SHoward Hinnant while (true) 31583e519524SHoward Hinnant { 31593e519524SHoward Hinnant if (__first == __last) 31603e519524SHoward Hinnant return __first; 31613e519524SHoward Hinnant if (!__pred(*__first)) 31623e519524SHoward Hinnant break; 31633e519524SHoward Hinnant ++__first; 31643e519524SHoward Hinnant } 31653e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 31663e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 31673e519524SHoward Hinnant do 31683e519524SHoward Hinnant { 31693e519524SHoward Hinnant if (__first == --__last) 31703e519524SHoward Hinnant return __first; 31713e519524SHoward Hinnant } while (!__pred(*__last)); 31723e519524SHoward Hinnant // We now have a reduced range [__first, __last] 31733e519524SHoward Hinnant // *__first is known to be false 31743e519524SHoward Hinnant // *__last is known to be true 31753e519524SHoward Hinnant // __len >= 2 3176ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 31773e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 31783e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 31793e519524SHoward Hinnant if (__len >= __alloc_limit) 31803e519524SHoward Hinnant { 3181ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 31823e519524SHoward Hinnant __h.reset(__p.first); 31833e519524SHoward Hinnant } 31843e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 31853e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 31863e519524SHoward Hinnant} 31873e519524SHoward Hinnant 31883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31903e519524SHoward Hinnant_ForwardIterator 31913e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31923e519524SHoward Hinnant{ 31933e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 31943e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31953e519524SHoward Hinnant} 31963e519524SHoward Hinnant 31973e519524SHoward Hinnant// is_sorted_until 31983e519524SHoward Hinnant 31993e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 32003e519524SHoward Hinnant_ForwardIterator 32013e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 32023e519524SHoward Hinnant{ 32033e519524SHoward Hinnant if (__first != __last) 32043e519524SHoward Hinnant { 32053e519524SHoward Hinnant _ForwardIterator __i = __first; 32063e519524SHoward Hinnant while (++__i != __last) 32073e519524SHoward Hinnant { 32083e519524SHoward Hinnant if (__comp(*__i, *__first)) 32093e519524SHoward Hinnant return __i; 32103e519524SHoward Hinnant __first = __i; 32113e519524SHoward Hinnant } 32123e519524SHoward Hinnant } 32133e519524SHoward Hinnant return __last; 32143e519524SHoward Hinnant} 32153e519524SHoward Hinnant 32163e519524SHoward Hinnanttemplate<class _ForwardIterator> 32173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32183e519524SHoward Hinnant_ForwardIterator 32193e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 32203e519524SHoward Hinnant{ 3221ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 32223e519524SHoward Hinnant} 32233e519524SHoward Hinnant 32243e519524SHoward Hinnant// is_sorted 32253e519524SHoward Hinnant 32263e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 32273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32283e519524SHoward Hinnantbool 32293e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 32303e519524SHoward Hinnant{ 3231ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 32323e519524SHoward Hinnant} 32333e519524SHoward Hinnant 32343e519524SHoward Hinnanttemplate<class _ForwardIterator> 32353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32363e519524SHoward Hinnantbool 32373e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 32383e519524SHoward Hinnant{ 3239ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 32403e519524SHoward Hinnant} 32413e519524SHoward Hinnant 32423e519524SHoward Hinnant// sort 32433e519524SHoward Hinnant 32443e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 32453e519524SHoward Hinnant 32463e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 32473e519524SHoward Hinnantunsigned 32483e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 32493e519524SHoward Hinnant{ 32503e519524SHoward Hinnant unsigned __r = 0; 32513e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 32523e519524SHoward Hinnant { 32533e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 32543e519524SHoward Hinnant return __r; // x <= y && y <= z 32553e519524SHoward Hinnant // x <= y && y > z 32563e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 32573e519524SHoward Hinnant __r = 1; 32583e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 32593e519524SHoward Hinnant { 32603e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 32613e519524SHoward Hinnant __r = 2; 32623e519524SHoward Hinnant } 32633e519524SHoward Hinnant return __r; // x <= y && y < z 32643e519524SHoward Hinnant } 32653e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 32663e519524SHoward Hinnant { 32673e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 32683e519524SHoward Hinnant __r = 1; 32693e519524SHoward Hinnant return __r; 32703e519524SHoward Hinnant } 32713e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 32723e519524SHoward Hinnant __r = 1; // x < y && x <= z 32733e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 32743e519524SHoward Hinnant { 32753e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 32763e519524SHoward Hinnant __r = 2; 32773e519524SHoward Hinnant } 32783e519524SHoward Hinnant return __r; 32793e519524SHoward Hinnant} // x <= y && y <= z 32803e519524SHoward Hinnant 32813e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 32823e519524SHoward Hinnant 32833e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 32843e519524SHoward Hinnantunsigned 32853e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 32863e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 32873e519524SHoward Hinnant{ 32883e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 32893e519524SHoward Hinnant if (__c(*__x4, *__x3)) 32903e519524SHoward Hinnant { 32913e519524SHoward Hinnant swap(*__x3, *__x4); 32923e519524SHoward Hinnant ++__r; 32933e519524SHoward Hinnant if (__c(*__x3, *__x2)) 32943e519524SHoward Hinnant { 32953e519524SHoward Hinnant swap(*__x2, *__x3); 32963e519524SHoward Hinnant ++__r; 32973e519524SHoward Hinnant if (__c(*__x2, *__x1)) 32983e519524SHoward Hinnant { 32993e519524SHoward Hinnant swap(*__x1, *__x2); 33003e519524SHoward Hinnant ++__r; 33013e519524SHoward Hinnant } 33023e519524SHoward Hinnant } 33033e519524SHoward Hinnant } 33043e519524SHoward Hinnant return __r; 33053e519524SHoward Hinnant} 33063e519524SHoward Hinnant 33073e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 33083e519524SHoward Hinnant 33093e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 33103e519524SHoward Hinnantunsigned 33113e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 33123e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 33133e519524SHoward Hinnant{ 33143e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 33153e519524SHoward Hinnant if (__c(*__x5, *__x4)) 33163e519524SHoward Hinnant { 33173e519524SHoward Hinnant swap(*__x4, *__x5); 33183e519524SHoward Hinnant ++__r; 33193e519524SHoward Hinnant if (__c(*__x4, *__x3)) 33203e519524SHoward Hinnant { 33213e519524SHoward Hinnant swap(*__x3, *__x4); 33223e519524SHoward Hinnant ++__r; 33233e519524SHoward Hinnant if (__c(*__x3, *__x2)) 33243e519524SHoward Hinnant { 33253e519524SHoward Hinnant swap(*__x2, *__x3); 33263e519524SHoward Hinnant ++__r; 33273e519524SHoward Hinnant if (__c(*__x2, *__x1)) 33283e519524SHoward Hinnant { 33293e519524SHoward Hinnant swap(*__x1, *__x2); 33303e519524SHoward Hinnant ++__r; 33313e519524SHoward Hinnant } 33323e519524SHoward Hinnant } 33333e519524SHoward Hinnant } 33343e519524SHoward Hinnant } 33353e519524SHoward Hinnant return __r; 33363e519524SHoward Hinnant} 33373e519524SHoward Hinnant 33383e519524SHoward Hinnant// Assumes size > 0 33393e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 33403e519524SHoward Hinnantvoid 33413e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 33423e519524SHoward Hinnant{ 33433e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 33443e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 33453e519524SHoward Hinnant { 3346ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 33473e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 33483e519524SHoward Hinnant (__first, __last, __comp); 33493e519524SHoward Hinnant if (__i != __first) 33503e519524SHoward Hinnant swap(*__first, *__i); 33513e519524SHoward Hinnant } 33523e519524SHoward Hinnant} 33533e519524SHoward Hinnant 33543e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 33553e519524SHoward Hinnantvoid 33563e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 33573e519524SHoward Hinnant{ 33583e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 33593e519524SHoward Hinnant if (__first != __last) 33603e519524SHoward Hinnant { 33613e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 33623e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 33633e519524SHoward Hinnant { 33643e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3365ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 33663e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3367ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3368ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 33693e519524SHoward Hinnant } 33703e519524SHoward Hinnant } 33713e519524SHoward Hinnant} 33723e519524SHoward Hinnant 33733e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 33743e519524SHoward Hinnantvoid 33753e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 33763e519524SHoward Hinnant{ 33773e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 33783e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 33793e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 33803e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 33813e519524SHoward Hinnant { 33823e519524SHoward Hinnant if (__comp(*__i, *__j)) 33833e519524SHoward Hinnant { 3384ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 33853e519524SHoward Hinnant _RandomAccessIterator __k = __j; 33863e519524SHoward Hinnant __j = __i; 33873e519524SHoward Hinnant do 33883e519524SHoward Hinnant { 3389ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 33903e519524SHoward Hinnant __j = __k; 33913e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3392ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 33933e519524SHoward Hinnant } 33943e519524SHoward Hinnant __j = __i; 33953e519524SHoward Hinnant } 33963e519524SHoward Hinnant} 33973e519524SHoward Hinnant 33983e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 33993e519524SHoward Hinnantbool 34003e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 34013e519524SHoward Hinnant{ 34023e519524SHoward Hinnant switch (__last - __first) 34033e519524SHoward Hinnant { 34043e519524SHoward Hinnant case 0: 34053e519524SHoward Hinnant case 1: 34063e519524SHoward Hinnant return true; 34073e519524SHoward Hinnant case 2: 34083e519524SHoward Hinnant if (__comp(*--__last, *__first)) 34093e519524SHoward Hinnant swap(*__first, *__last); 34103e519524SHoward Hinnant return true; 34113e519524SHoward Hinnant case 3: 3412ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 34133e519524SHoward Hinnant return true; 34143e519524SHoward Hinnant case 4: 3415ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 34163e519524SHoward Hinnant return true; 34173e519524SHoward Hinnant case 5: 3418ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 34193e519524SHoward Hinnant return true; 34203e519524SHoward Hinnant } 34213e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 34223e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 34233e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 34243e519524SHoward Hinnant const unsigned __limit = 8; 34253e519524SHoward Hinnant unsigned __count = 0; 34263e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 34273e519524SHoward Hinnant { 34283e519524SHoward Hinnant if (__comp(*__i, *__j)) 34293e519524SHoward Hinnant { 3430ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 34313e519524SHoward Hinnant _RandomAccessIterator __k = __j; 34323e519524SHoward Hinnant __j = __i; 34333e519524SHoward Hinnant do 34343e519524SHoward Hinnant { 3435ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 34363e519524SHoward Hinnant __j = __k; 34373e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3438ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 34393e519524SHoward Hinnant if (++__count == __limit) 34403e519524SHoward Hinnant return ++__i == __last; 34413e519524SHoward Hinnant } 34423e519524SHoward Hinnant __j = __i; 34433e519524SHoward Hinnant } 34443e519524SHoward Hinnant return true; 34453e519524SHoward Hinnant} 34463e519524SHoward Hinnant 34473e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 34483e519524SHoward Hinnantvoid 34493e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 34503e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 34513e519524SHoward Hinnant{ 34523e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 34533e519524SHoward Hinnant if (__first1 != __last1) 34543e519524SHoward Hinnant { 34553e519524SHoward Hinnant __destruct_n __d(0); 34563e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 34573e519524SHoward Hinnant value_type* __last2 = __first2; 3458ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 34593e519524SHoward Hinnant __d.__incr((value_type*)0); 34603e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 34613e519524SHoward Hinnant { 34623e519524SHoward Hinnant value_type* __j2 = __last2; 34633e519524SHoward Hinnant value_type* __i2 = __j2; 34643e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 34653e519524SHoward Hinnant { 3466ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 34673e519524SHoward Hinnant __d.__incr((value_type*)0); 34683e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3469ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3470ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 34713e519524SHoward Hinnant } 34723e519524SHoward Hinnant else 34733e519524SHoward Hinnant { 3474ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 34753e519524SHoward Hinnant __d.__incr((value_type*)0); 34763e519524SHoward Hinnant } 34773e519524SHoward Hinnant } 34783e519524SHoward Hinnant __h.release(); 34793e519524SHoward Hinnant } 34803e519524SHoward Hinnant} 34813e519524SHoward Hinnant 34823e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 34833e519524SHoward Hinnantvoid 34843e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 34853e519524SHoward Hinnant{ 34863e519524SHoward Hinnant // _Compare is known to be a reference type 34873e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 34883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3489ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3490ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 34913e519524SHoward Hinnant while (true) 34923e519524SHoward Hinnant { 34933e519524SHoward Hinnant __restart: 34943e519524SHoward Hinnant difference_type __len = __last - __first; 34953e519524SHoward Hinnant switch (__len) 34963e519524SHoward Hinnant { 34973e519524SHoward Hinnant case 0: 34983e519524SHoward Hinnant case 1: 34993e519524SHoward Hinnant return; 35003e519524SHoward Hinnant case 2: 35013e519524SHoward Hinnant if (__comp(*--__last, *__first)) 35023e519524SHoward Hinnant swap(*__first, *__last); 35033e519524SHoward Hinnant return; 35043e519524SHoward Hinnant case 3: 3505ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 35063e519524SHoward Hinnant return; 35073e519524SHoward Hinnant case 4: 3508ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 35093e519524SHoward Hinnant return; 35103e519524SHoward Hinnant case 5: 3511ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 35123e519524SHoward Hinnant return; 35133e519524SHoward Hinnant } 35143e519524SHoward Hinnant if (__len <= __limit) 35153e519524SHoward Hinnant { 3516ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 35173e519524SHoward Hinnant return; 35183e519524SHoward Hinnant } 35193e519524SHoward Hinnant // __len > 5 35203e519524SHoward Hinnant _RandomAccessIterator __m = __first; 35213e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 35223e519524SHoward Hinnant --__lm1; 35233e519524SHoward Hinnant unsigned __n_swaps; 35243e519524SHoward Hinnant { 35253e519524SHoward Hinnant difference_type __delta; 35263e519524SHoward Hinnant if (__len >= 1000) 35273e519524SHoward Hinnant { 35283e519524SHoward Hinnant __delta = __len/2; 35293e519524SHoward Hinnant __m += __delta; 35303e519524SHoward Hinnant __delta /= 2; 3531ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 35323e519524SHoward Hinnant } 35333e519524SHoward Hinnant else 35343e519524SHoward Hinnant { 35353e519524SHoward Hinnant __delta = __len/2; 35363e519524SHoward Hinnant __m += __delta; 3537ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 35383e519524SHoward Hinnant } 35393e519524SHoward Hinnant } 35403e519524SHoward Hinnant // *__m is median 35413e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 35423e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 35433e519524SHoward Hinnant _RandomAccessIterator __i = __first; 35443e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 35453e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 35463e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 35473e519524SHoward Hinnant // Prime the downward search with a guard. 35483e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 35493e519524SHoward Hinnant { 35503e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 35513e519524SHoward Hinnant // manually guard downward moving __j against __i 35523e519524SHoward Hinnant while (true) 35533e519524SHoward Hinnant { 35543e519524SHoward Hinnant if (__i == --__j) 35553e519524SHoward Hinnant { 35563e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 35573e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 35583e519524SHoward Hinnant ++__i; // __first + 1 35593e519524SHoward Hinnant __j = __last; 35603e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 35613e519524SHoward Hinnant { 35623e519524SHoward Hinnant while (true) 35633e519524SHoward Hinnant { 35643e519524SHoward Hinnant if (__i == __j) 35653e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 35663e519524SHoward Hinnant if (__comp(*__first, *__i)) 35673e519524SHoward Hinnant { 35683e519524SHoward Hinnant swap(*__i, *__j); 35693e519524SHoward Hinnant ++__n_swaps; 35703e519524SHoward Hinnant ++__i; 35713e519524SHoward Hinnant break; 35723e519524SHoward Hinnant } 35733e519524SHoward Hinnant ++__i; 35743e519524SHoward Hinnant } 35753e519524SHoward Hinnant } 35763e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 35773e519524SHoward Hinnant if (__i == __j) 35783e519524SHoward Hinnant return; 35793e519524SHoward Hinnant while (true) 35803e519524SHoward Hinnant { 35813e519524SHoward Hinnant while (!__comp(*__first, *__i)) 35823e519524SHoward Hinnant ++__i; 35833e519524SHoward Hinnant while (__comp(*__first, *--__j)) 35843e519524SHoward Hinnant ; 35853e519524SHoward Hinnant if (__i >= __j) 35863e519524SHoward Hinnant break; 35873e519524SHoward Hinnant swap(*__i, *__j); 35883e519524SHoward Hinnant ++__n_swaps; 35893e519524SHoward Hinnant ++__i; 35903e519524SHoward Hinnant } 35913e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 35923e519524SHoward Hinnant // The first part is sorted, sort the secod part 3593ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 35943e519524SHoward Hinnant __first = __i; 35953e519524SHoward Hinnant goto __restart; 35963e519524SHoward Hinnant } 35973e519524SHoward Hinnant if (__comp(*__j, *__m)) 35983e519524SHoward Hinnant { 35993e519524SHoward Hinnant swap(*__i, *__j); 36003e519524SHoward Hinnant ++__n_swaps; 36013e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 36023e519524SHoward Hinnant } 36033e519524SHoward Hinnant } 36043e519524SHoward Hinnant } 36053e519524SHoward Hinnant // It is known that *__i < *__m 36063e519524SHoward Hinnant ++__i; 36073e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 36083e519524SHoward Hinnant // if not yet partitioned... 36093e519524SHoward Hinnant if (__i < __j) 36103e519524SHoward Hinnant { 36113e519524SHoward Hinnant // known that *(__i - 1) < *__m 36123e519524SHoward Hinnant // known that __i <= __m 36133e519524SHoward Hinnant while (true) 36143e519524SHoward Hinnant { 36153e519524SHoward Hinnant // __m still guards upward moving __i 36163e519524SHoward Hinnant while (__comp(*__i, *__m)) 36173e519524SHoward Hinnant ++__i; 36183e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 36193e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 36203e519524SHoward Hinnant ; 36213e519524SHoward Hinnant if (__i > __j) 36223e519524SHoward Hinnant break; 36233e519524SHoward Hinnant swap(*__i, *__j); 36243e519524SHoward Hinnant ++__n_swaps; 36253e519524SHoward Hinnant // It is known that __m != __j 36263e519524SHoward Hinnant // If __m just moved, follow it 36273e519524SHoward Hinnant if (__m == __i) 36283e519524SHoward Hinnant __m = __j; 36293e519524SHoward Hinnant ++__i; 36303e519524SHoward Hinnant } 36313e519524SHoward Hinnant } 36323e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 36333e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 36343e519524SHoward Hinnant { 36353e519524SHoward Hinnant swap(*__i, *__m); 36363e519524SHoward Hinnant ++__n_swaps; 36373e519524SHoward Hinnant } 36383e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 36393e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 36403e519524SHoward Hinnant if (__n_swaps == 0) 36413e519524SHoward Hinnant { 3642ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3643ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 36443e519524SHoward Hinnant { 36453e519524SHoward Hinnant if (__fs) 36463e519524SHoward Hinnant return; 36473e519524SHoward Hinnant __last = __i; 36483e519524SHoward Hinnant continue; 36493e519524SHoward Hinnant } 36503e519524SHoward Hinnant else 36513e519524SHoward Hinnant { 36523e519524SHoward Hinnant if (__fs) 36533e519524SHoward Hinnant { 36543e519524SHoward Hinnant __first = ++__i; 36553e519524SHoward Hinnant continue; 36563e519524SHoward Hinnant } 36573e519524SHoward Hinnant } 36583e519524SHoward Hinnant } 36593e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 36603e519524SHoward Hinnant if (__i - __first < __last - __i) 36613e519524SHoward Hinnant { 3662ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3663ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 36643e519524SHoward Hinnant __first = ++__i; 36653e519524SHoward Hinnant } 36663e519524SHoward Hinnant else 36673e519524SHoward Hinnant { 3668ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 3669ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 36703e519524SHoward Hinnant __last = __i; 36713e519524SHoward Hinnant } 36723e519524SHoward Hinnant } 36733e519524SHoward Hinnant} 36743e519524SHoward Hinnant 36753e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 36763e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 36773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36783e519524SHoward Hinnantvoid 36793e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36803e519524SHoward Hinnant{ 3681f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 36823e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 36833e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 36843e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 3685f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 36863e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 36873e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 3688f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 36893e519524SHoward Hinnant} 36903e519524SHoward Hinnant 36913e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 36923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36933e519524SHoward Hinnantvoid 36943e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 36953e519524SHoward Hinnant{ 3696ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 36973e519524SHoward Hinnant} 36983e519524SHoward Hinnant 36993e519524SHoward Hinnanttemplate <class _Tp> 37003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37013e519524SHoward Hinnantvoid 37023e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 37033e519524SHoward Hinnant{ 3704ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 37053e519524SHoward Hinnant} 37063e519524SHoward Hinnant 37073e519524SHoward Hinnanttemplate <class _Tp> 37083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37093e519524SHoward Hinnantvoid 37103e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 37113e519524SHoward Hinnant{ 3712ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 37133e519524SHoward Hinnant} 37143e519524SHoward Hinnant 3715f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 3716f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 3717f554add5SHoward Hinnantvoid 3718f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 3719f554add5SHoward Hinnant{ 3720f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3721f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 3722f554add5SHoward Hinnant} 3723f554add5SHoward Hinnant 3724e4383379SHoward Hinnant#ifdef _MSC_VER 3725e4383379SHoward Hinnant#pragma warning( push ) 3726e4383379SHoward Hinnant#pragma warning( disable: 4231) 3727e4383379SHoward Hinnant#endif // _MSC_VER 37283e519524SHoward Hinnantextern template void __sort<__less<char>&, char*>(char*, char*, __less<char>&); 37293e519524SHoward Hinnantextern template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 37303e519524SHoward Hinnantextern template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 37313e519524SHoward Hinnantextern template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 37323e519524SHoward Hinnantextern template void __sort<__less<short>&, short*>(short*, short*, __less<short>&); 37333e519524SHoward Hinnantextern template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 37343e519524SHoward Hinnantextern template void __sort<__less<int>&, int*>(int*, int*, __less<int>&); 37353e519524SHoward Hinnantextern template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 37363e519524SHoward Hinnantextern template void __sort<__less<long>&, long*>(long*, long*, __less<long>&); 37373e519524SHoward Hinnantextern template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 37383e519524SHoward Hinnantextern template void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 37393e519524SHoward Hinnantextern template void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 37403e519524SHoward Hinnantextern template void __sort<__less<float>&, float*>(float*, float*, __less<float>&); 37413e519524SHoward Hinnantextern template void __sort<__less<double>&, double*>(double*, double*, __less<double>&); 37423e519524SHoward Hinnantextern template void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 37433e519524SHoward Hinnant 37443e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&); 37453e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 37463e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 37473e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 37483e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&); 37493e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 37503e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&); 37513e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 37523e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&); 37533e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 37543e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 37553e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 37563e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&); 37573e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&); 37583e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 37593e519524SHoward Hinnant 37603e519524SHoward Hinnantextern template unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&); 3761e4383379SHoward Hinnant#ifdef _MSC_VER 3762e4383379SHoward Hinnant#pragma warning( pop ) 3763c206366fSHoward Hinnant#endif // _MSC_VER 37643e519524SHoward Hinnant 37653e519524SHoward Hinnant// lower_bound 37663e519524SHoward Hinnant 37673e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 37683e519524SHoward Hinnant_ForwardIterator 3769e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 37703e519524SHoward Hinnant{ 37713e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3772ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 37733e519524SHoward Hinnant while (__len != 0) 37743e519524SHoward Hinnant { 37753e519524SHoward Hinnant difference_type __l2 = __len / 2; 37763e519524SHoward Hinnant _ForwardIterator __m = __first; 3777ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 3778e4383379SHoward Hinnant if (__comp(*__m, __value_)) 37793e519524SHoward Hinnant { 37803e519524SHoward Hinnant __first = ++__m; 37813e519524SHoward Hinnant __len -= __l2 + 1; 37823e519524SHoward Hinnant } 37833e519524SHoward Hinnant else 37843e519524SHoward Hinnant __len = __l2; 37853e519524SHoward Hinnant } 37863e519524SHoward Hinnant return __first; 37873e519524SHoward Hinnant} 37883e519524SHoward Hinnant 37893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 37903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37913e519524SHoward Hinnant_ForwardIterator 3792e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 37933e519524SHoward Hinnant{ 3794f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 37953e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 37963e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3797e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 3798f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 37993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3800e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 3801f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 38023e519524SHoward Hinnant} 38033e519524SHoward Hinnant 38043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 38053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38063e519524SHoward Hinnant_ForwardIterator 3807e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 38083e519524SHoward Hinnant{ 3809e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 38103e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 38113e519524SHoward Hinnant} 38123e519524SHoward Hinnant 38133e519524SHoward Hinnant// upper_bound 38143e519524SHoward Hinnant 38153e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 38163e519524SHoward Hinnant_ForwardIterator 3817e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 38183e519524SHoward Hinnant{ 38193e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3820ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 38213e519524SHoward Hinnant while (__len != 0) 38223e519524SHoward Hinnant { 38233e519524SHoward Hinnant difference_type __l2 = __len / 2; 38243e519524SHoward Hinnant _ForwardIterator __m = __first; 3825ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 3826e4383379SHoward Hinnant if (__comp(__value_, *__m)) 38273e519524SHoward Hinnant __len = __l2; 38283e519524SHoward Hinnant else 38293e519524SHoward Hinnant { 38303e519524SHoward Hinnant __first = ++__m; 38313e519524SHoward Hinnant __len -= __l2 + 1; 38323e519524SHoward Hinnant } 38333e519524SHoward Hinnant } 38343e519524SHoward Hinnant return __first; 38353e519524SHoward Hinnant} 38363e519524SHoward Hinnant 38373e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 38383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38393e519524SHoward Hinnant_ForwardIterator 3840e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 38413e519524SHoward Hinnant{ 3842f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 38433e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 38443e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3845e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 3846f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 38473e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3848e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 3849f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 38503e519524SHoward Hinnant} 38513e519524SHoward Hinnant 38523e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 38533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38543e519524SHoward Hinnant_ForwardIterator 3855e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 38563e519524SHoward Hinnant{ 3857e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 38583e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 38593e519524SHoward Hinnant} 38603e519524SHoward Hinnant 38613e519524SHoward Hinnant// equal_range 38623e519524SHoward Hinnant 38633e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 38643e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 3865e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 38663e519524SHoward Hinnant{ 38673e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3868ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 38693e519524SHoward Hinnant while (__len != 0) 38703e519524SHoward Hinnant { 38713e519524SHoward Hinnant difference_type __l2 = __len / 2; 38723e519524SHoward Hinnant _ForwardIterator __m = __first; 3873ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 3874e4383379SHoward Hinnant if (__comp(*__m, __value_)) 38753e519524SHoward Hinnant { 38763e519524SHoward Hinnant __first = ++__m; 38773e519524SHoward Hinnant __len -= __l2 + 1; 38783e519524SHoward Hinnant } 3879e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 38803e519524SHoward Hinnant { 38813e519524SHoward Hinnant __last = __m; 38823e519524SHoward Hinnant __len = __l2; 38833e519524SHoward Hinnant } 38843e519524SHoward Hinnant else 38853e519524SHoward Hinnant { 38863e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 38873e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 38883e519524SHoward Hinnant ( 3889e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 3890e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 38913e519524SHoward Hinnant ); 38923e519524SHoward Hinnant } 38933e519524SHoward Hinnant } 38943e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 38953e519524SHoward Hinnant} 38963e519524SHoward Hinnant 38973e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 38983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38993e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 3900e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 39013e519524SHoward Hinnant{ 3902f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 39033e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39043e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3905e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 3906f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 39073e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3908e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 3909f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 39103e519524SHoward Hinnant} 39113e519524SHoward Hinnant 39123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 39133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39143e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 3915e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 39163e519524SHoward Hinnant{ 3917e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 39183e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 39193e519524SHoward Hinnant} 39203e519524SHoward Hinnant 39213e519524SHoward Hinnant// binary_search 39223e519524SHoward Hinnant 39233e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 39243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39253e519524SHoward Hinnantbool 3926e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 39273e519524SHoward Hinnant{ 3928e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 3929e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 39303e519524SHoward Hinnant} 39313e519524SHoward Hinnant 39323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 39333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39343e519524SHoward Hinnantbool 3935e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 39363e519524SHoward Hinnant{ 3937f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 39383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3940e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 3941f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 39423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3943e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 3944f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 39453e519524SHoward Hinnant} 39463e519524SHoward Hinnant 39473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 39483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39493e519524SHoward Hinnantbool 3950e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 39513e519524SHoward Hinnant{ 3952e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 39533e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 39543e519524SHoward Hinnant} 39553e519524SHoward Hinnant 39563e519524SHoward Hinnant// merge 39573e519524SHoward Hinnant 39583e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 39593e519524SHoward Hinnant_OutputIterator 39603e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 39613e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 39623e519524SHoward Hinnant{ 39633e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 39643e519524SHoward Hinnant { 39653e519524SHoward Hinnant if (__first2 == __last2) 3966ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 39673e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 39683e519524SHoward Hinnant { 39693e519524SHoward Hinnant *__result = *__first2; 39703e519524SHoward Hinnant ++__first2; 39713e519524SHoward Hinnant } 39723e519524SHoward Hinnant else 39733e519524SHoward Hinnant { 39743e519524SHoward Hinnant *__result = *__first1; 39753e519524SHoward Hinnant ++__first1; 39763e519524SHoward Hinnant } 39773e519524SHoward Hinnant } 3978ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 39793e519524SHoward Hinnant} 39803e519524SHoward Hinnant 39813e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 39823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39833e519524SHoward Hinnant_OutputIterator 39843e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 39853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 39863e519524SHoward Hinnant{ 3987f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 39883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 3990ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 3991f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 39923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3993ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 3994f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 39953e519524SHoward Hinnant} 39963e519524SHoward Hinnant 39973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 39983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39993e519524SHoward Hinnant_OutputIterator 40003e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 40013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 40023e519524SHoward Hinnant{ 40033e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 40043e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 40053e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 40063e519524SHoward Hinnant} 40073e519524SHoward Hinnant 40083e519524SHoward Hinnant// inplace_merge 40093e519524SHoward Hinnant 40103e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 40113e519524SHoward Hinnantvoid 40123e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 40133e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 40143e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 40153e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 40163e519524SHoward Hinnant{ 40173e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 40183e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 40193e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 40203e519524SHoward Hinnant __destruct_n __d(0); 40213e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 40223e519524SHoward Hinnant if (__len1 <= __len2) 40233e519524SHoward Hinnant { 40243e519524SHoward Hinnant value_type* __p = __buff; 40253e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 4026ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 40273e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 40283e519524SHoward Hinnant move_iterator<value_type*>(__p), 40293e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 40303e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 40313e519524SHoward Hinnant __first, __comp); 40323e519524SHoward Hinnant } 40333e519524SHoward Hinnant else 40343e519524SHoward Hinnant { 40353e519524SHoward Hinnant value_type* __p = __buff; 40363e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 4037ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 40383e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 40393e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 40403e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 40413e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 40423e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 40433e519524SHoward Hinnant } 40443e519524SHoward Hinnant} 40453e519524SHoward Hinnant 40463e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 40473e519524SHoward Hinnantvoid 40483e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 40493e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 40503e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 40513e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 40523e519524SHoward Hinnant{ 40533e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 40543e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 40553e519524SHoward Hinnant while (true) 40563e519524SHoward Hinnant { 40573e519524SHoward Hinnant // if __middle == __last, we're done 40583e519524SHoward Hinnant if (__len2 == 0) 40593e519524SHoward Hinnant return; 40603e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 40613e519524SHoward Hinnant for (; true; ++__first, --__len1) 40623e519524SHoward Hinnant { 40633e519524SHoward Hinnant if (__len1 == 0) 40643e519524SHoward Hinnant return; 40653e519524SHoward Hinnant if (__comp(*__middle, *__first)) 40663e519524SHoward Hinnant break; 40673e519524SHoward Hinnant } 40683e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 40693e519524SHoward Hinnant { 40703e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 40713e519524SHoward Hinnant return; 40723e519524SHoward Hinnant } 40733e519524SHoward Hinnant // __first < __middle < __last 40743e519524SHoward Hinnant // *__first > *__middle 40753e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 40763e519524SHoward Hinnant // all elements in: 40773e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 40783e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 40793e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 40803e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 40813e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 40823e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 40833e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 40843e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 40853e519524SHoward Hinnant // binary search smaller range 40863e519524SHoward Hinnant if (__len1 < __len2) 40873e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 40883e519524SHoward Hinnant __len21 = __len2 / 2; 40893e519524SHoward Hinnant __m2 = __middle; 4090ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 40913e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4092ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 40933e519524SHoward Hinnant } 40943e519524SHoward Hinnant else 40953e519524SHoward Hinnant { 40963e519524SHoward Hinnant if (__len1 == 1) 40973e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 40983e519524SHoward Hinnant // It is known *__first > *__middle 40993e519524SHoward Hinnant swap(*__first, *__middle); 41003e519524SHoward Hinnant return; 41013e519524SHoward Hinnant } 41023e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 41033e519524SHoward Hinnant __len11 = __len1 / 2; 41043e519524SHoward Hinnant __m1 = __first; 4105ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 41063e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4107ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 41083e519524SHoward Hinnant } 41093e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 41103e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 41113e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 41123e519524SHoward Hinnant // swap middle two partitions 4113ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 41143e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 41153e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 41163e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 41173e519524SHoward Hinnant { 41183e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 41193e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 41203e519524SHoward Hinnant __first = __middle; 41213e519524SHoward Hinnant __middle = __m2; 41223e519524SHoward Hinnant __len1 = __len12; 41233e519524SHoward Hinnant __len2 = __len22; 41243e519524SHoward Hinnant } 41253e519524SHoward Hinnant else 41263e519524SHoward Hinnant { 41273e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 41283e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 41293e519524SHoward Hinnant __last = __middle; 41303e519524SHoward Hinnant __middle = __m1; 41313e519524SHoward Hinnant __len1 = __len11; 41323e519524SHoward Hinnant __len2 = __len21; 41333e519524SHoward Hinnant } 41343e519524SHoward Hinnant } 41353e519524SHoward Hinnant} 41363e519524SHoward Hinnant 41373e519524SHoward Hinnanttemplate <class _Tp> 41383e519524SHoward Hinnantstruct __inplace_merge_switch 41393e519524SHoward Hinnant{ 4140ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 41413e519524SHoward Hinnant}; 41423e519524SHoward Hinnant 41433e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 41443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41453e519524SHoward Hinnantvoid 41463e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 41473e519524SHoward Hinnant _Compare __comp) 41483e519524SHoward Hinnant{ 41493e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 41503e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4151ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4152ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4153ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 41543e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 41553e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 41563e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 41573e519524SHoward Hinnant { 4158ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 41593e519524SHoward Hinnant __h.reset(__buf.first); 41603e519524SHoward Hinnant } 4161f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 41623e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41633e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4164ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 41653e519524SHoward Hinnant __buf.first, __buf.second); 4166f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 41673e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4168ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 41693e519524SHoward Hinnant __buf.first, __buf.second); 4170f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 41713e519524SHoward Hinnant} 41723e519524SHoward Hinnant 41733e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 41743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41753e519524SHoward Hinnantvoid 41763e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 41773e519524SHoward Hinnant{ 4178ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 41793e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 41803e519524SHoward Hinnant} 41813e519524SHoward Hinnant 41823e519524SHoward Hinnant// stable_sort 41833e519524SHoward Hinnant 41843e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 41853e519524SHoward Hinnantvoid 41863e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 41873e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 41883e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 41893e519524SHoward Hinnant{ 41903e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 41913e519524SHoward Hinnant __destruct_n __d(0); 41923e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 41933e519524SHoward Hinnant for (; true; ++__result) 41943e519524SHoward Hinnant { 41953e519524SHoward Hinnant if (__first1 == __last1) 41963e519524SHoward Hinnant { 41973e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4198ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 41993e519524SHoward Hinnant __h.release(); 42003e519524SHoward Hinnant return; 42013e519524SHoward Hinnant } 42023e519524SHoward Hinnant if (__first2 == __last2) 42033e519524SHoward Hinnant { 42043e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4205ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 42063e519524SHoward Hinnant __h.release(); 42073e519524SHoward Hinnant return; 42083e519524SHoward Hinnant } 42093e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42103e519524SHoward Hinnant { 4211ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 42123e519524SHoward Hinnant __d.__incr((value_type*)0); 42133e519524SHoward Hinnant ++__first2; 42143e519524SHoward Hinnant } 42153e519524SHoward Hinnant else 42163e519524SHoward Hinnant { 4217ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 42183e519524SHoward Hinnant __d.__incr((value_type*)0); 42193e519524SHoward Hinnant ++__first1; 42203e519524SHoward Hinnant } 42213e519524SHoward Hinnant } 42223e519524SHoward Hinnant} 42233e519524SHoward Hinnant 42243e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42253e519524SHoward Hinnantvoid 42263e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 42273e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 42283e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 42293e519524SHoward Hinnant{ 42303e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42313e519524SHoward Hinnant { 42323e519524SHoward Hinnant if (__first2 == __last2) 42333e519524SHoward Hinnant { 42343e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4235ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 42363e519524SHoward Hinnant return; 42373e519524SHoward Hinnant } 42383e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42393e519524SHoward Hinnant { 4240ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 42413e519524SHoward Hinnant ++__first2; 42423e519524SHoward Hinnant } 42433e519524SHoward Hinnant else 42443e519524SHoward Hinnant { 4245ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 42463e519524SHoward Hinnant ++__first1; 42473e519524SHoward Hinnant } 42483e519524SHoward Hinnant } 42493e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4250ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 42513e519524SHoward Hinnant} 42523e519524SHoward Hinnant 42533e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42543e519524SHoward Hinnantvoid 42553e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 42563e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 42573e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 42583e519524SHoward Hinnant 42593e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42603e519524SHoward Hinnantvoid 42613e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 42623e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 42633e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 42643e519524SHoward Hinnant{ 42653e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 42663e519524SHoward Hinnant switch (__len) 42673e519524SHoward Hinnant { 42683e519524SHoward Hinnant case 0: 42693e519524SHoward Hinnant return; 42703e519524SHoward Hinnant case 1: 4271ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 42723e519524SHoward Hinnant return; 42733e519524SHoward Hinnant case 2: 42743e519524SHoward Hinnant __destruct_n __d(0); 42753e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 42763e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 42773e519524SHoward Hinnant { 4278ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 42793e519524SHoward Hinnant __d.__incr((value_type*)0); 42803e519524SHoward Hinnant ++__first2; 4281ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 42823e519524SHoward Hinnant } 42833e519524SHoward Hinnant else 42843e519524SHoward Hinnant { 4285ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 42863e519524SHoward Hinnant __d.__incr((value_type*)0); 42873e519524SHoward Hinnant ++__first2; 4288ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 42893e519524SHoward Hinnant } 42903e519524SHoward Hinnant __h2.release(); 42913e519524SHoward Hinnant return; 42923e519524SHoward Hinnant } 42933e519524SHoward Hinnant if (__len <= 8) 42943e519524SHoward Hinnant { 42953e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 42963e519524SHoward Hinnant return; 42973e519524SHoward Hinnant } 42983e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 42993e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 43003e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 43013e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 43023e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 43033e519524SHoward Hinnant} 43043e519524SHoward Hinnant 43053e519524SHoward Hinnanttemplate <class _Tp> 43063e519524SHoward Hinnantstruct __stable_sort_switch 43073e519524SHoward Hinnant{ 4308ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 43093e519524SHoward Hinnant}; 43103e519524SHoward Hinnant 43113e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 43123e519524SHoward Hinnantvoid 43133e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 43143e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 43153e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 43163e519524SHoward Hinnant{ 43173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 43183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43193e519524SHoward Hinnant switch (__len) 43203e519524SHoward Hinnant { 43213e519524SHoward Hinnant case 0: 43223e519524SHoward Hinnant case 1: 43233e519524SHoward Hinnant return; 43243e519524SHoward Hinnant case 2: 43253e519524SHoward Hinnant if (__comp(*--__last, *__first)) 43263e519524SHoward Hinnant swap(*__first, *__last); 43273e519524SHoward Hinnant return; 43283e519524SHoward Hinnant } 43293e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 43303e519524SHoward Hinnant { 43313e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 43323e519524SHoward Hinnant return; 43333e519524SHoward Hinnant } 43343e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 43353e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 43363e519524SHoward Hinnant if (__len <= __buff_size) 43373e519524SHoward Hinnant { 43383e519524SHoward Hinnant __destruct_n __d(0); 43393e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43403e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 43413e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 43423e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 43433e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 43443e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 43453e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 43463e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 43473e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 43483e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 43493e519524SHoward Hinnant// __first, __comp); 43503e519524SHoward Hinnant return; 43513e519524SHoward Hinnant } 43523e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 43533e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 43543e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 43553e519524SHoward Hinnant} 43563e519524SHoward Hinnant 43573e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43593e519524SHoward Hinnantvoid 43603e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43613e519524SHoward Hinnant{ 43623e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 43633e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43643e519524SHoward Hinnant difference_type __len = __last - __first; 43653e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 43663e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 43673e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 43683e519524SHoward Hinnant { 4369ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 43703e519524SHoward Hinnant __h.reset(__buf.first); 43713e519524SHoward Hinnant } 4372f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 43733e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43743e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 43753e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4376f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 43773e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43783e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4379f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 43803e519524SHoward Hinnant} 43813e519524SHoward Hinnant 43823e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 43833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43843e519524SHoward Hinnantvoid 43853e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 43863e519524SHoward Hinnant{ 4387ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43883e519524SHoward Hinnant} 43893e519524SHoward Hinnant 43903e519524SHoward Hinnant// is_heap_until 43913e519524SHoward Hinnant 43923e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43933e519524SHoward Hinnant_RandomAccessIterator 43943e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43953e519524SHoward Hinnant{ 4396ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43973e519524SHoward Hinnant difference_type __len = __last - __first; 43983e519524SHoward Hinnant difference_type __p = 0; 43993e519524SHoward Hinnant difference_type __c = 1; 44003e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 44013e519524SHoward Hinnant while (__c < __len) 44023e519524SHoward Hinnant { 44033e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 44043e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 44053e519524SHoward Hinnant return __cp; 44063e519524SHoward Hinnant ++__c; 44073e519524SHoward Hinnant ++__cp; 44083e519524SHoward Hinnant if (__c == __len) 44093e519524SHoward Hinnant return __last; 44103e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 44113e519524SHoward Hinnant return __cp; 44123e519524SHoward Hinnant ++__p; 44133e519524SHoward Hinnant ++__pp; 44143e519524SHoward Hinnant __c = 2 * __p + 1; 44153e519524SHoward Hinnant } 44163e519524SHoward Hinnant return __last; 44173e519524SHoward Hinnant} 44183e519524SHoward Hinnant 44193e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 44203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44213e519524SHoward Hinnant_RandomAccessIterator 44223e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 44233e519524SHoward Hinnant{ 4424ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 44253e519524SHoward Hinnant} 44263e519524SHoward Hinnant 44273e519524SHoward Hinnant// is_heap 44283e519524SHoward Hinnant 44293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 44303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44313e519524SHoward Hinnantbool 44323e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 44333e519524SHoward Hinnant{ 4434ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 44353e519524SHoward Hinnant} 44363e519524SHoward Hinnant 44373e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 44383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44393e519524SHoward Hinnantbool 44403e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 44413e519524SHoward Hinnant{ 4442ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 44433e519524SHoward Hinnant} 44443e519524SHoward Hinnant 44453e519524SHoward Hinnant// push_heap 44463e519524SHoward Hinnant 44473e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 44483e519524SHoward Hinnantvoid 44493e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 44503e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 44513e519524SHoward Hinnant{ 44523e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 44533e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 44543e519524SHoward Hinnant if (__len > 1) 44553e519524SHoward Hinnant { 44563e519524SHoward Hinnant difference_type __p = 0; 44573e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 44583e519524SHoward Hinnant difference_type __c = 2; 44593e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 44603e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 44613e519524SHoward Hinnant { 44623e519524SHoward Hinnant --__c; 44633e519524SHoward Hinnant --__cp; 44643e519524SHoward Hinnant } 44653e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 44663e519524SHoward Hinnant { 4467ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__pp)); 44683e519524SHoward Hinnant do 44693e519524SHoward Hinnant { 4470ce48a113SHoward Hinnant *__pp = _VSTD::move(*__cp); 44713e519524SHoward Hinnant __pp = __cp; 44723e519524SHoward Hinnant __p = __c; 44733e519524SHoward Hinnant __c = (__p + 1) * 2; 44743e519524SHoward Hinnant if (__c > __len) 44753e519524SHoward Hinnant break; 44763e519524SHoward Hinnant __cp = __first + __c; 44773e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 44783e519524SHoward Hinnant { 44793e519524SHoward Hinnant --__c; 44803e519524SHoward Hinnant --__cp; 44813e519524SHoward Hinnant } 44823e519524SHoward Hinnant } while (__comp(__t, *__cp)); 4483ce48a113SHoward Hinnant *__pp = _VSTD::move(__t); 44843e519524SHoward Hinnant } 44853e519524SHoward Hinnant } 44863e519524SHoward Hinnant} 44873e519524SHoward Hinnant 44883e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 44893e519524SHoward Hinnantvoid 44903e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 44913e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 44923e519524SHoward Hinnant{ 44933e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 44943e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 44953e519524SHoward Hinnant if (__len > 1) 44963e519524SHoward Hinnant { 44973e519524SHoward Hinnant __len = (__len - 2) / 2; 44983e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 44993e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 45003e519524SHoward Hinnant { 4501ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 45023e519524SHoward Hinnant do 45033e519524SHoward Hinnant { 4504ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 45053e519524SHoward Hinnant __last = __ptr; 45063e519524SHoward Hinnant if (__len == 0) 45073e519524SHoward Hinnant break; 45083e519524SHoward Hinnant __len = (__len - 1) / 2; 45093e519524SHoward Hinnant __ptr = __first + __len; 45103e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4511ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 45123e519524SHoward Hinnant } 45133e519524SHoward Hinnant } 45143e519524SHoward Hinnant} 45153e519524SHoward Hinnant 45163e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45183e519524SHoward Hinnantvoid 45193e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45203e519524SHoward Hinnant{ 4521f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 45223e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45233e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45243e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4525f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 45263e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45273e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4528f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 45293e519524SHoward Hinnant} 45303e519524SHoward Hinnant 45313e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 45323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45333e519524SHoward Hinnantvoid 45343e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 45353e519524SHoward Hinnant{ 4536ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45373e519524SHoward Hinnant} 45383e519524SHoward Hinnant 45393e519524SHoward Hinnant// pop_heap 45403e519524SHoward Hinnant 45413e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45433e519524SHoward Hinnantvoid 45443e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45453e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 45463e519524SHoward Hinnant{ 45473e519524SHoward Hinnant if (__len > 1) 45483e519524SHoward Hinnant { 45493e519524SHoward Hinnant swap(*__first, *--__last); 45503e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 45513e519524SHoward Hinnant } 45523e519524SHoward Hinnant} 45533e519524SHoward Hinnant 45543e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45563e519524SHoward Hinnantvoid 45573e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45583e519524SHoward Hinnant{ 4559f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 45603e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45613e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45623e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4563f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 45643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45653e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4566f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 45673e519524SHoward Hinnant} 45683e519524SHoward Hinnant 45693e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 45703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45713e519524SHoward Hinnantvoid 45723e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 45733e519524SHoward Hinnant{ 4574ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45753e519524SHoward Hinnant} 45763e519524SHoward Hinnant 45773e519524SHoward Hinnant// make_heap 45783e519524SHoward Hinnant 45793e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45803e519524SHoward Hinnantvoid 45813e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45823e519524SHoward Hinnant{ 45833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45843e519524SHoward Hinnant difference_type __n = __last - __first; 45853e519524SHoward Hinnant if (__n > 1) 45863e519524SHoward Hinnant { 45873e519524SHoward Hinnant __last = __first; 45883e519524SHoward Hinnant ++__last; 45893e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 45903e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 45913e519524SHoward Hinnant } 45923e519524SHoward Hinnant} 45933e519524SHoward Hinnant 45943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45963e519524SHoward Hinnantvoid 45973e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45983e519524SHoward Hinnant{ 4599f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 46003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46023e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4603f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 46043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46053e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4606f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46073e519524SHoward Hinnant} 46083e519524SHoward Hinnant 46093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46113e519524SHoward Hinnantvoid 46123e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 46133e519524SHoward Hinnant{ 4614ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46153e519524SHoward Hinnant} 46163e519524SHoward Hinnant 46173e519524SHoward Hinnant// sort_heap 46183e519524SHoward Hinnant 46193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46203e519524SHoward Hinnantvoid 46213e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46223e519524SHoward Hinnant{ 46233e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46243e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 46253e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 46263e519524SHoward Hinnant} 46273e519524SHoward Hinnant 46283e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46303e519524SHoward Hinnantvoid 46313e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46323e519524SHoward Hinnant{ 4633f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 46343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46363e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4637f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 46383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46393e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4640f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46413e519524SHoward Hinnant} 46423e519524SHoward Hinnant 46433e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46453e519524SHoward Hinnantvoid 46463e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 46473e519524SHoward Hinnant{ 4648ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46493e519524SHoward Hinnant} 46503e519524SHoward Hinnant 46513e519524SHoward Hinnant// partial_sort 46523e519524SHoward Hinnant 46533e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46543e519524SHoward Hinnantvoid 46553e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 46563e519524SHoward Hinnant _Compare __comp) 46573e519524SHoward Hinnant{ 46583e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 46593e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 46603e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 46613e519524SHoward Hinnant { 46623e519524SHoward Hinnant if (__comp(*__i, *__first)) 46633e519524SHoward Hinnant { 46643e519524SHoward Hinnant swap(*__i, *__first); 46653e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 46663e519524SHoward Hinnant } 46673e519524SHoward Hinnant } 46683e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 46693e519524SHoward Hinnant} 46703e519524SHoward Hinnant 46713e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46733e519524SHoward Hinnantvoid 46743e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 46753e519524SHoward Hinnant _Compare __comp) 46763e519524SHoward Hinnant{ 4677f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 46783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46803e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 4681f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 46823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46833e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 4684f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46853e519524SHoward Hinnant} 46863e519524SHoward Hinnant 46873e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46893e519524SHoward Hinnantvoid 46903e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 46913e519524SHoward Hinnant{ 4692ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 46933e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46943e519524SHoward Hinnant} 46953e519524SHoward Hinnant 46963e519524SHoward Hinnant// partial_sort_copy 46973e519524SHoward Hinnant 46983e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 46993e519524SHoward Hinnant_RandomAccessIterator 47003e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 47013e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 47023e519524SHoward Hinnant{ 47033e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 47043e519524SHoward Hinnant if (__r != __result_last) 47053e519524SHoward Hinnant { 47063e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 47073e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 47083e519524SHoward Hinnant *__r = *__first; 47093e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 47103e519524SHoward Hinnant for (; __first != __last; ++__first) 47113e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 47123e519524SHoward Hinnant { 47133e519524SHoward Hinnant *__result_first = *__first; 47143e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 47153e519524SHoward Hinnant } 47163e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 47173e519524SHoward Hinnant } 47183e519524SHoward Hinnant return __r; 47193e519524SHoward Hinnant} 47203e519524SHoward Hinnant 47213e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 47223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47233e519524SHoward Hinnant_RandomAccessIterator 47243e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 47253e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 47263e519524SHoward Hinnant{ 4727f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 47283e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47293e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47303e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 4731f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 47323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47333e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 4734f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 47353e519524SHoward Hinnant} 47363e519524SHoward Hinnant 47373e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 47383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47393e519524SHoward Hinnant_RandomAccessIterator 47403e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 47413e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 47423e519524SHoward Hinnant{ 4743ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 47443e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47453e519524SHoward Hinnant} 47463e519524SHoward Hinnant 47473e519524SHoward Hinnant// nth_element 47483e519524SHoward Hinnant 47493e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47503e519524SHoward Hinnantvoid 47513e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 47523e519524SHoward Hinnant{ 47533e519524SHoward Hinnant // _Compare is known to be a reference type 47543e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47553e519524SHoward Hinnant const difference_type __limit = 7; 47563e519524SHoward Hinnant while (true) 47573e519524SHoward Hinnant { 47583e519524SHoward Hinnant __restart: 4759b34b4819SHoward Hinnant if (__nth == __last) 4760b34b4819SHoward Hinnant return; 47613e519524SHoward Hinnant difference_type __len = __last - __first; 47623e519524SHoward Hinnant switch (__len) 47633e519524SHoward Hinnant { 47643e519524SHoward Hinnant case 0: 47653e519524SHoward Hinnant case 1: 47663e519524SHoward Hinnant return; 47673e519524SHoward Hinnant case 2: 47683e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47693e519524SHoward Hinnant swap(*__first, *__last); 47703e519524SHoward Hinnant return; 47713e519524SHoward Hinnant case 3: 47723e519524SHoward Hinnant { 47733e519524SHoward Hinnant _RandomAccessIterator __m = __first; 4774ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 47753e519524SHoward Hinnant return; 47763e519524SHoward Hinnant } 47773e519524SHoward Hinnant } 47783e519524SHoward Hinnant if (__len <= __limit) 47793e519524SHoward Hinnant { 47803e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 47813e519524SHoward Hinnant return; 47823e519524SHoward Hinnant } 47833e519524SHoward Hinnant // __len > __limit >= 3 47843e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 47853e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 4786ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 47873e519524SHoward Hinnant // *__m is median 47883e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 47893e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 47903e519524SHoward Hinnant _RandomAccessIterator __i = __first; 47913e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 47923e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 47933e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 47943e519524SHoward Hinnant // Prime the downward search with a guard. 47953e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 47963e519524SHoward Hinnant { 47973e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 47983e519524SHoward Hinnant // manually guard downward moving __j against __i 47993e519524SHoward Hinnant while (true) 48003e519524SHoward Hinnant { 48013e519524SHoward Hinnant if (__i == --__j) 48023e519524SHoward Hinnant { 48033e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 48043e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 48053e519524SHoward Hinnant ++__i; // __first + 1 48063e519524SHoward Hinnant __j = __last; 48073e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 48083e519524SHoward Hinnant { 48093e519524SHoward Hinnant while (true) 48103e519524SHoward Hinnant { 48113e519524SHoward Hinnant if (__i == __j) 48123e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 48133e519524SHoward Hinnant if (__comp(*__first, *__i)) 48143e519524SHoward Hinnant { 48153e519524SHoward Hinnant swap(*__i, *__j); 48163e519524SHoward Hinnant ++__n_swaps; 48173e519524SHoward Hinnant ++__i; 48183e519524SHoward Hinnant break; 48193e519524SHoward Hinnant } 48203e519524SHoward Hinnant ++__i; 48213e519524SHoward Hinnant } 48223e519524SHoward Hinnant } 48233e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 48243e519524SHoward Hinnant if (__i == __j) 48253e519524SHoward Hinnant return; 48263e519524SHoward Hinnant while (true) 48273e519524SHoward Hinnant { 48283e519524SHoward Hinnant while (!__comp(*__first, *__i)) 48293e519524SHoward Hinnant ++__i; 48303e519524SHoward Hinnant while (__comp(*__first, *--__j)) 48313e519524SHoward Hinnant ; 48323e519524SHoward Hinnant if (__i >= __j) 48333e519524SHoward Hinnant break; 48343e519524SHoward Hinnant swap(*__i, *__j); 48353e519524SHoward Hinnant ++__n_swaps; 48363e519524SHoward Hinnant ++__i; 48373e519524SHoward Hinnant } 48383e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 48393e519524SHoward Hinnant // The first part is sorted, 48403e519524SHoward Hinnant if (__nth < __i) 48413e519524SHoward Hinnant return; 48423e519524SHoward Hinnant // __nth_element the secod part 48433e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 48443e519524SHoward Hinnant __first = __i; 48453e519524SHoward Hinnant goto __restart; 48463e519524SHoward Hinnant } 48473e519524SHoward Hinnant if (__comp(*__j, *__m)) 48483e519524SHoward Hinnant { 48493e519524SHoward Hinnant swap(*__i, *__j); 48503e519524SHoward Hinnant ++__n_swaps; 48513e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 48523e519524SHoward Hinnant } 48533e519524SHoward Hinnant } 48543e519524SHoward Hinnant } 48553e519524SHoward Hinnant ++__i; 48563e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 48573e519524SHoward Hinnant // if not yet partitioned... 48583e519524SHoward Hinnant if (__i < __j) 48593e519524SHoward Hinnant { 48603e519524SHoward Hinnant // known that *(__i - 1) < *__m 48613e519524SHoward Hinnant while (true) 48623e519524SHoward Hinnant { 48633e519524SHoward Hinnant // __m still guards upward moving __i 48643e519524SHoward Hinnant while (__comp(*__i, *__m)) 48653e519524SHoward Hinnant ++__i; 48663e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 48673e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 48683e519524SHoward Hinnant ; 48693e519524SHoward Hinnant if (__i >= __j) 48703e519524SHoward Hinnant break; 48713e519524SHoward Hinnant swap(*__i, *__j); 48723e519524SHoward Hinnant ++__n_swaps; 48733e519524SHoward Hinnant // It is known that __m != __j 48743e519524SHoward Hinnant // If __m just moved, follow it 48753e519524SHoward Hinnant if (__m == __i) 48763e519524SHoward Hinnant __m = __j; 48773e519524SHoward Hinnant ++__i; 48783e519524SHoward Hinnant } 48793e519524SHoward Hinnant } 48803e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 48813e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 48823e519524SHoward Hinnant { 48833e519524SHoward Hinnant swap(*__i, *__m); 48843e519524SHoward Hinnant ++__n_swaps; 48853e519524SHoward Hinnant } 48863e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 48873e519524SHoward Hinnant if (__nth == __i) 48883e519524SHoward Hinnant return; 48893e519524SHoward Hinnant if (__n_swaps == 0) 48903e519524SHoward Hinnant { 48913e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 48923e519524SHoward Hinnant if (__nth < __i) 48933e519524SHoward Hinnant { 48943e519524SHoward Hinnant // Check for [__first, __i) already sorted 48953e519524SHoward Hinnant __j = __m = __first; 48963e519524SHoward Hinnant while (++__j != __i) 48973e519524SHoward Hinnant { 48983e519524SHoward Hinnant if (__comp(*__j, *__m)) 48993e519524SHoward Hinnant // not yet sorted, so sort 49003e519524SHoward Hinnant goto not_sorted; 49013e519524SHoward Hinnant __m = __j; 49023e519524SHoward Hinnant } 49033e519524SHoward Hinnant // [__first, __i) sorted 49043e519524SHoward Hinnant return; 49053e519524SHoward Hinnant } 49063e519524SHoward Hinnant else 49073e519524SHoward Hinnant { 49083e519524SHoward Hinnant // Check for [__i, __last) already sorted 49093e519524SHoward Hinnant __j = __m = __i; 49103e519524SHoward Hinnant while (++__j != __last) 49113e519524SHoward Hinnant { 49123e519524SHoward Hinnant if (__comp(*__j, *__m)) 49133e519524SHoward Hinnant // not yet sorted, so sort 49143e519524SHoward Hinnant goto not_sorted; 49153e519524SHoward Hinnant __m = __j; 49163e519524SHoward Hinnant } 49173e519524SHoward Hinnant // [__i, __last) sorted 49183e519524SHoward Hinnant return; 49193e519524SHoward Hinnant } 49203e519524SHoward Hinnant } 49213e519524SHoward Hinnantnot_sorted: 49223e519524SHoward Hinnant // __nth_element on range containing __nth 49233e519524SHoward Hinnant if (__nth < __i) 49243e519524SHoward Hinnant { 49253e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 49263e519524SHoward Hinnant __last = __i; 49273e519524SHoward Hinnant } 49283e519524SHoward Hinnant else 49293e519524SHoward Hinnant { 49303e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 49313e519524SHoward Hinnant __first = ++__i; 49323e519524SHoward Hinnant } 49333e519524SHoward Hinnant } 49343e519524SHoward Hinnant} 49353e519524SHoward Hinnant 49363e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49383e519524SHoward Hinnantvoid 49393e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _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 __nth_element<_Comp_ref>(__first, __nth, __last, __c); 4945f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49463e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49473e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 4948f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49493e519524SHoward Hinnant} 49503e519524SHoward Hinnant 49513e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49533e519524SHoward Hinnantvoid 49543e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 49553e519524SHoward Hinnant{ 4956ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49573e519524SHoward Hinnant} 49583e519524SHoward Hinnant 49593e519524SHoward Hinnant// includes 49603e519524SHoward Hinnant 49613e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 49623e519524SHoward Hinnantbool 49633e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 49643e519524SHoward Hinnant _Compare __comp) 49653e519524SHoward Hinnant{ 49663e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 49673e519524SHoward Hinnant { 49683e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 49693e519524SHoward Hinnant return false; 49703e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 49713e519524SHoward Hinnant ++__first2; 49723e519524SHoward Hinnant } 49733e519524SHoward Hinnant return true; 49743e519524SHoward Hinnant} 49753e519524SHoward Hinnant 49763e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 49773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49783e519524SHoward Hinnantbool 49793e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 49803e519524SHoward Hinnant _Compare __comp) 49813e519524SHoward Hinnant{ 4982f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49853e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 4986f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49883e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 4989f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49903e519524SHoward Hinnant} 49913e519524SHoward Hinnant 49923e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 49933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49943e519524SHoward Hinnantbool 49953e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 49963e519524SHoward Hinnant{ 4997ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 49983e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 49993e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 50003e519524SHoward Hinnant} 50013e519524SHoward Hinnant 50023e519524SHoward Hinnant// set_union 50033e519524SHoward Hinnant 50043e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 50053e519524SHoward Hinnant_OutputIterator 50063e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 50073e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50083e519524SHoward Hinnant{ 50093e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 50103e519524SHoward Hinnant { 50113e519524SHoward Hinnant if (__first2 == __last2) 5012ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 50133e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 50143e519524SHoward Hinnant { 50153e519524SHoward Hinnant *__result = *__first2; 50163e519524SHoward Hinnant ++__first2; 50173e519524SHoward Hinnant } 50183e519524SHoward Hinnant else 50193e519524SHoward Hinnant { 50203e519524SHoward Hinnant *__result = *__first1; 50213e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 50223e519524SHoward Hinnant ++__first2; 50233e519524SHoward Hinnant ++__first1; 50243e519524SHoward Hinnant } 50253e519524SHoward Hinnant } 5026ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 50273e519524SHoward Hinnant} 50283e519524SHoward Hinnant 50293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 50303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50313e519524SHoward Hinnant_OutputIterator 50323e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 50333e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50343e519524SHoward Hinnant{ 5035f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 50363e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50373e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50383e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5039f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 50403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50413e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5042f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 50433e519524SHoward Hinnant} 50443e519524SHoward Hinnant 50453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 50463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50473e519524SHoward Hinnant_OutputIterator 50483e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 50493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 50503e519524SHoward Hinnant{ 5051ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 50523e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 50533e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 50543e519524SHoward Hinnant} 50553e519524SHoward Hinnant 50563e519524SHoward Hinnant// set_intersection 50573e519524SHoward Hinnant 50583e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 50593e519524SHoward Hinnant_OutputIterator 50603e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 50613e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50623e519524SHoward Hinnant{ 50633e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 50643e519524SHoward Hinnant { 50653e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 50663e519524SHoward Hinnant ++__first1; 50673e519524SHoward Hinnant else 50683e519524SHoward Hinnant { 50693e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 50703e519524SHoward Hinnant { 50713e519524SHoward Hinnant *__result = *__first1; 50723e519524SHoward Hinnant ++__result; 50733e519524SHoward Hinnant ++__first1; 50743e519524SHoward Hinnant } 50753e519524SHoward Hinnant ++__first2; 50763e519524SHoward Hinnant } 50773e519524SHoward Hinnant } 50783e519524SHoward Hinnant return __result; 50793e519524SHoward Hinnant} 50803e519524SHoward Hinnant 50813e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 50823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50833e519524SHoward Hinnant_OutputIterator 50843e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 50853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50863e519524SHoward Hinnant{ 5087f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 50883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50903e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5091f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 50923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50933e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5094f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 50953e519524SHoward Hinnant} 50963e519524SHoward Hinnant 50973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 50983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50993e519524SHoward Hinnant_OutputIterator 51003e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 51013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 51023e519524SHoward Hinnant{ 5103ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 51043e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 51053e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 51063e519524SHoward Hinnant} 51073e519524SHoward Hinnant 51083e519524SHoward Hinnant// set_difference 51093e519524SHoward Hinnant 51103e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 51113e519524SHoward Hinnant_OutputIterator 51123e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 51143e519524SHoward Hinnant{ 51153e519524SHoward Hinnant while (__first1 != __last1) 51163e519524SHoward Hinnant { 51173e519524SHoward Hinnant if (__first2 == __last2) 5118ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 51193e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 51203e519524SHoward Hinnant { 51213e519524SHoward Hinnant *__result = *__first1; 51223e519524SHoward Hinnant ++__result; 51233e519524SHoward Hinnant ++__first1; 51243e519524SHoward Hinnant } 51253e519524SHoward Hinnant else 51263e519524SHoward Hinnant { 51273e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 51283e519524SHoward Hinnant ++__first1; 51293e519524SHoward Hinnant ++__first2; 51303e519524SHoward Hinnant } 51313e519524SHoward Hinnant } 51323e519524SHoward Hinnant return __result; 51333e519524SHoward Hinnant} 51343e519524SHoward Hinnant 51353e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 51363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51373e519524SHoward Hinnant_OutputIterator 51383e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 51403e519524SHoward Hinnant{ 5141f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 51423e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51433e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51443e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5145f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 51463e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51473e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5148f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 51493e519524SHoward Hinnant} 51503e519524SHoward Hinnant 51513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 51523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51533e519524SHoward Hinnant_OutputIterator 51543e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51553e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 51563e519524SHoward Hinnant{ 5157ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 51583e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 51593e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 51603e519524SHoward Hinnant} 51613e519524SHoward Hinnant 51623e519524SHoward Hinnant// set_symmetric_difference 51633e519524SHoward Hinnant 51643e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 51653e519524SHoward Hinnant_OutputIterator 51663e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51673e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 51683e519524SHoward Hinnant{ 51693e519524SHoward Hinnant while (__first1 != __last1) 51703e519524SHoward Hinnant { 51713e519524SHoward Hinnant if (__first2 == __last2) 5172ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 51733e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 51743e519524SHoward Hinnant { 51753e519524SHoward Hinnant *__result = *__first1; 51763e519524SHoward Hinnant ++__result; 51773e519524SHoward Hinnant ++__first1; 51783e519524SHoward Hinnant } 51793e519524SHoward Hinnant else 51803e519524SHoward Hinnant { 51813e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 51823e519524SHoward Hinnant { 51833e519524SHoward Hinnant *__result = *__first2; 51843e519524SHoward Hinnant ++__result; 51853e519524SHoward Hinnant } 51863e519524SHoward Hinnant else 51873e519524SHoward Hinnant ++__first1; 51883e519524SHoward Hinnant ++__first2; 51893e519524SHoward Hinnant } 51903e519524SHoward Hinnant } 5191ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 51923e519524SHoward Hinnant} 51933e519524SHoward Hinnant 51943e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 51953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51963e519524SHoward Hinnant_OutputIterator 51973e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51983e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 51993e519524SHoward Hinnant{ 5200f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52013e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52023e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52033e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5204f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52053e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52063e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5207f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52083e519524SHoward Hinnant} 52093e519524SHoward Hinnant 52103e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 52113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52123e519524SHoward Hinnant_OutputIterator 52133e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 52143e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 52153e519524SHoward Hinnant{ 5216ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 52173e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 52183e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 52193e519524SHoward Hinnant} 52203e519524SHoward Hinnant 52213e519524SHoward Hinnant// lexicographical_compare 52223e519524SHoward Hinnant 52233e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52243e519524SHoward Hinnantbool 52253e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 52263e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 52273e519524SHoward Hinnant{ 52283e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 52293e519524SHoward Hinnant { 52303e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 52313e519524SHoward Hinnant return true; 52323e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 52333e519524SHoward Hinnant return false; 52343e519524SHoward Hinnant } 52353e519524SHoward Hinnant return false; 52363e519524SHoward Hinnant} 52373e519524SHoward Hinnant 52383e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 52393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52403e519524SHoward Hinnantbool 52413e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 52423e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 52433e519524SHoward Hinnant{ 5244f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52473e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5248f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52503e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5251f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52523e519524SHoward Hinnant} 52533e519524SHoward Hinnant 52543e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 52553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52563e519524SHoward Hinnantbool 52573e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 52583e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 52593e519524SHoward Hinnant{ 5260ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 52613e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 52623e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 52633e519524SHoward Hinnant} 52643e519524SHoward Hinnant 52653e519524SHoward Hinnant// next_permutation 52663e519524SHoward Hinnant 52673e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 52683e519524SHoward Hinnantbool 52693e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52703e519524SHoward Hinnant{ 52713e519524SHoward Hinnant _BidirectionalIterator __i = __last; 52723e519524SHoward Hinnant if (__first == __last || __first == --__i) 52733e519524SHoward Hinnant return false; 52743e519524SHoward Hinnant while (true) 52753e519524SHoward Hinnant { 52763e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 52773e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 52783e519524SHoward Hinnant { 52793e519524SHoward Hinnant _BidirectionalIterator __j = __last; 52803e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 52813e519524SHoward Hinnant ; 52823e519524SHoward Hinnant swap(*__i, *__j); 5283ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 52843e519524SHoward Hinnant return true; 52853e519524SHoward Hinnant } 52863e519524SHoward Hinnant if (__i == __first) 52873e519524SHoward Hinnant { 5288ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 52893e519524SHoward Hinnant return false; 52903e519524SHoward Hinnant } 52913e519524SHoward Hinnant } 52923e519524SHoward Hinnant} 52933e519524SHoward Hinnant 52943e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 52953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52963e519524SHoward Hinnantbool 52973e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52983e519524SHoward Hinnant{ 5299f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53023e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5303f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53053e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5306f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53073e519524SHoward Hinnant} 53083e519524SHoward Hinnant 53093e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 53103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53113e519524SHoward Hinnantbool 53123e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 53133e519524SHoward Hinnant{ 5314ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 53153e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 53163e519524SHoward Hinnant} 53173e519524SHoward Hinnant 53183e519524SHoward Hinnant// prev_permutation 53193e519524SHoward Hinnant 53203e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 53213e519524SHoward Hinnantbool 53223e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 53233e519524SHoward Hinnant{ 53243e519524SHoward Hinnant _BidirectionalIterator __i = __last; 53253e519524SHoward Hinnant if (__first == __last || __first == --__i) 53263e519524SHoward Hinnant return false; 53273e519524SHoward Hinnant while (true) 53283e519524SHoward Hinnant { 53293e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 53303e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 53313e519524SHoward Hinnant { 53323e519524SHoward Hinnant _BidirectionalIterator __j = __last; 53333e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 53343e519524SHoward Hinnant ; 53353e519524SHoward Hinnant swap(*__i, *__j); 5336ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 53373e519524SHoward Hinnant return true; 53383e519524SHoward Hinnant } 53393e519524SHoward Hinnant if (__i == __first) 53403e519524SHoward Hinnant { 5341ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 53423e519524SHoward Hinnant return false; 53433e519524SHoward Hinnant } 53443e519524SHoward Hinnant } 53453e519524SHoward Hinnant} 53463e519524SHoward Hinnant 53473e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 53483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53493e519524SHoward Hinnantbool 53503e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 53513e519524SHoward Hinnant{ 5352f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53553e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5356f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53583e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5359f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53603e519524SHoward Hinnant} 53613e519524SHoward Hinnant 53623e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 53633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53643e519524SHoward Hinnantbool 53653e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 53663e519524SHoward Hinnant{ 5367ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 53683e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 53693e519524SHoward Hinnant} 53703e519524SHoward Hinnant 53713e519524SHoward Hinnanttemplate <class _Tp> 53723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53733e519524SHoward Hinnanttypename enable_if 53743e519524SHoward Hinnant< 53753e519524SHoward Hinnant is_integral<_Tp>::value, 53763e519524SHoward Hinnant _Tp 53773e519524SHoward Hinnant>::type 53783e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 53793e519524SHoward Hinnant{ 53803e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 53813e519524SHoward Hinnant __n &= __bits; 53823e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 53833e519524SHoward Hinnant} 53843e519524SHoward Hinnant 53853e519524SHoward Hinnanttemplate <class _Tp> 53863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53873e519524SHoward Hinnanttypename enable_if 53883e519524SHoward Hinnant< 53893e519524SHoward Hinnant is_integral<_Tp>::value, 53903e519524SHoward Hinnant _Tp 53913e519524SHoward Hinnant>::type 53923e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 53933e519524SHoward Hinnant{ 53943e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 53953e519524SHoward Hinnant __n &= __bits; 53963e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 53973e519524SHoward Hinnant} 53983e519524SHoward Hinnant 53993e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 54003e519524SHoward Hinnant 54013e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5402