13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 45b08a8a4SHoward Hinnant// The LLVM Compiler Infrastructure 53e519524SHoward Hinnant// 63e519524SHoward Hinnant// This file is distributed under the University of Illinois Open Source 73e519524SHoward Hinnant// License. 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, 259f9d540b0SHoward 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 4883e519524SHoward Hinnanttemplate <class T> 4893e519524SHoward Hinnant const T& 4903e519524SHoward Hinnant min(const T& a, const T& b); 4913e519524SHoward Hinnant 4923e519524SHoward Hinnanttemplate <class T, class Compare> 4933e519524SHoward Hinnant const T& 4943e519524SHoward Hinnant min(const T& a, const T& b, Compare comp); 4953e519524SHoward Hinnant 4963e519524SHoward Hinnanttemplate <class T> 4973e519524SHoward Hinnant const T& 4983e519524SHoward Hinnant max(const T& a, const T& b); 4993e519524SHoward Hinnant 5003e519524SHoward Hinnanttemplate <class T, class Compare> 5013e519524SHoward Hinnant const T& 5023e519524SHoward Hinnant max(const T& a, const T& b, Compare comp); 5033e519524SHoward Hinnant 5043e519524SHoward Hinnanttemplate <class ForwardIterator> 5053e519524SHoward Hinnant ForwardIterator 5063e519524SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 5073e519524SHoward Hinnant 5083e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5093e519524SHoward Hinnant ForwardIterator 5103e519524SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, 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 5203e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5213e519524SHoward Hinnant bool 5223e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5233e519524SHoward Hinnant 5243e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5253e519524SHoward Hinnant bool 5263e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 5273e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 5283e519524SHoward Hinnant 5293e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5303e519524SHoward Hinnant bool 5313e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5343e519524SHoward Hinnant bool 5353e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5383e519524SHoward Hinnant bool 5393e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 5403e519524SHoward Hinnant 5413e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5423e519524SHoward Hinnant bool 5433e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 5443e519524SHoward Hinnant 5453e519524SHoward Hinnant} // std 5463e519524SHoward Hinnant 5473e519524SHoward Hinnant*/ 5483e519524SHoward Hinnant 5493e519524SHoward Hinnant#include <__config> 5503e519524SHoward Hinnant#include <initializer_list> 5513e519524SHoward Hinnant#include <type_traits> 5523e519524SHoward Hinnant#include <cstring> 5533e519524SHoward Hinnant#include <utility> 5543e519524SHoward Hinnant#include <memory> 5553e519524SHoward Hinnant#include <iterator> 5563e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 5573e519524SHoward Hinnant#include <cassert> 5583e519524SHoward Hinnant#endif 559128ba719SHoward Hinnant#include <cstdlib> 5603e519524SHoward Hinnant 5613e519524SHoward Hinnant#pragma GCC system_header 5623e519524SHoward Hinnant 5633e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 5643e519524SHoward Hinnant 5653e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 5663e519524SHoward Hinnantstruct __equal_to 5673e519524SHoward Hinnant{ 5683e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 5693e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 5703e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 5713e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 5723e519524SHoward Hinnant}; 5733e519524SHoward Hinnant 5743e519524SHoward Hinnanttemplate <class _T1> 5753e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 5763e519524SHoward Hinnant{ 5773e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 5783e519524SHoward Hinnant}; 5793e519524SHoward Hinnant 5803e519524SHoward Hinnanttemplate <class _T1> 5813e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 5823e519524SHoward Hinnant{ 5833e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 5843e519524SHoward Hinnant}; 5853e519524SHoward Hinnant 5863e519524SHoward Hinnanttemplate <class _T1> 5873e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 5883e519524SHoward Hinnant{ 5893e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 5903e519524SHoward Hinnant}; 5913e519524SHoward Hinnant 5923e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 5933e519524SHoward Hinnantstruct __less 5943e519524SHoward Hinnant{ 5953e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 5963e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 5973e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 5983e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 5993e519524SHoward Hinnant}; 6003e519524SHoward Hinnant 6013e519524SHoward Hinnanttemplate <class _T1> 6023e519524SHoward Hinnantstruct __less<_T1, _T1> 6033e519524SHoward Hinnant{ 6043e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6053e519524SHoward Hinnant}; 6063e519524SHoward Hinnant 6073e519524SHoward Hinnanttemplate <class _T1> 6083e519524SHoward Hinnantstruct __less<const _T1, _T1> 6093e519524SHoward Hinnant{ 6103e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6113e519524SHoward Hinnant}; 6123e519524SHoward Hinnant 6133e519524SHoward Hinnanttemplate <class _T1> 6143e519524SHoward Hinnantstruct __less<_T1, const _T1> 6153e519524SHoward Hinnant{ 6163e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6173e519524SHoward Hinnant}; 6183e519524SHoward Hinnant 6193e519524SHoward Hinnanttemplate <class _Predicate> 6203e519524SHoward Hinnantclass __negate 6213e519524SHoward Hinnant{ 6223e519524SHoward Hinnantprivate: 6233e519524SHoward Hinnant _Predicate __p_; 6243e519524SHoward Hinnantpublic: 6253e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 6263e519524SHoward Hinnant 6273e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6283e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 6293e519524SHoward Hinnant 6303e519524SHoward Hinnant template <class _T1> 6313e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6323e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 6333e519524SHoward Hinnant 6343e519524SHoward Hinnant template <class _T1, class _T2> 6353e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6363e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 6373e519524SHoward Hinnant}; 6383e519524SHoward Hinnant 6393e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 6403e519524SHoward Hinnant 6413e519524SHoward Hinnanttemplate <class _Compare> 6423e519524SHoward Hinnantstruct __debug_less 6433e519524SHoward Hinnant{ 6443e519524SHoward Hinnant _Compare __comp_; 6453e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 6463e519524SHoward Hinnant template <class _Tp, class _Up> 6473e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 6483e519524SHoward Hinnant { 6493e519524SHoward Hinnant bool __r = __comp_(__x, __y); 6503e519524SHoward Hinnant if (__r) 6513e519524SHoward Hinnant assert(!__comp_(__y, __x)); 6523e519524SHoward Hinnant return __r; 6533e519524SHoward Hinnant } 6543e519524SHoward Hinnant}; 6553e519524SHoward Hinnant 6563e519524SHoward Hinnant#endif // _LIBCPP_DEBUG 6573e519524SHoward Hinnant 658*c8edcb36SHoward Hinnant// Precondition: __x != 0 659*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned __ctz(unsigned __x) {return __builtin_ctz (__x);} 660*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long __ctz(unsigned long __x) {return __builtin_ctzl (__x);} 661*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long long __ctz(unsigned long long __x) {return __builtin_ctzll(__x);} 662*c8edcb36SHoward Hinnant 663*c8edcb36SHoward Hinnant// Precondition: __x != 0 664*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned __clz(unsigned __x) {return __builtin_clz (__x);} 665*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long __clz(unsigned long __x) {return __builtin_clzl (__x);} 666*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long long __clz(unsigned long long __x) {return __builtin_clzll(__x);} 667*c8edcb36SHoward Hinnant 668*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 669*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 670*c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 671*c8edcb36SHoward Hinnant 6723e519524SHoward Hinnant// all_of 6733e519524SHoward Hinnant 6743e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 6753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 6763e519524SHoward Hinnantbool 6773e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 6783e519524SHoward Hinnant{ 6793e519524SHoward Hinnant for (; __first != __last; ++__first) 6803e519524SHoward Hinnant if (!__pred(*__first)) 6813e519524SHoward Hinnant return false; 6823e519524SHoward Hinnant return true; 6833e519524SHoward Hinnant} 6843e519524SHoward Hinnant 6853e519524SHoward Hinnant// any_of 6863e519524SHoward Hinnant 6873e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 6883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 6893e519524SHoward Hinnantbool 6903e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 6913e519524SHoward Hinnant{ 6923e519524SHoward Hinnant for (; __first != __last; ++__first) 6933e519524SHoward Hinnant if (__pred(*__first)) 6943e519524SHoward Hinnant return true; 6953e519524SHoward Hinnant return false; 6963e519524SHoward Hinnant} 6973e519524SHoward Hinnant 6983e519524SHoward Hinnant// none_of 6993e519524SHoward Hinnant 7003e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7023e519524SHoward Hinnantbool 7033e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7043e519524SHoward Hinnant{ 7053e519524SHoward Hinnant for (; __first != __last; ++__first) 7063e519524SHoward Hinnant if (__pred(*__first)) 7073e519524SHoward Hinnant return false; 7083e519524SHoward Hinnant return true; 7093e519524SHoward Hinnant} 7103e519524SHoward Hinnant 7113e519524SHoward Hinnant// for_each 7123e519524SHoward Hinnant 7133e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 7143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7153e519524SHoward Hinnant_Function 7163e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 7173e519524SHoward Hinnant{ 7183e519524SHoward Hinnant for (; __first != __last; ++__first) 7193e519524SHoward Hinnant __f(*__first); 7203e519524SHoward Hinnant return _STD::move(__f); 7213e519524SHoward Hinnant} 7223e519524SHoward Hinnant 7233e519524SHoward Hinnant// find 7243e519524SHoward Hinnant 7253e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 7263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7273e519524SHoward Hinnant_InputIterator 7283e519524SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value) 7293e519524SHoward Hinnant{ 7303e519524SHoward Hinnant for (; __first != __last; ++__first) 7313e519524SHoward Hinnant if (*__first == __value) 7323e519524SHoward Hinnant break; 7333e519524SHoward Hinnant return __first; 7343e519524SHoward Hinnant} 7353e519524SHoward Hinnant 7363e519524SHoward Hinnant// find_if 7373e519524SHoward Hinnant 7383e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7403e519524SHoward Hinnant_InputIterator 7413e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7423e519524SHoward Hinnant{ 7433e519524SHoward Hinnant for (; __first != __last; ++__first) 7443e519524SHoward Hinnant if (__pred(*__first)) 7453e519524SHoward Hinnant break; 7463e519524SHoward Hinnant return __first; 7473e519524SHoward Hinnant} 7483e519524SHoward Hinnant 7493e519524SHoward Hinnant// find_if_not 7503e519524SHoward Hinnant 7513e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 7523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7533e519524SHoward Hinnant_InputIterator 7543e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7553e519524SHoward Hinnant{ 7563e519524SHoward Hinnant for (; __first != __last; ++__first) 7573e519524SHoward Hinnant if (!__pred(*__first)) 7583e519524SHoward Hinnant break; 7593e519524SHoward Hinnant return __first; 7603e519524SHoward Hinnant} 7613e519524SHoward Hinnant 7623e519524SHoward Hinnant// find_end 7633e519524SHoward Hinnant 7643e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 7653e519524SHoward Hinnant_ForwardIterator1 7663e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 7673e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 7683e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 7693e519524SHoward Hinnant{ 7703e519524SHoward Hinnant // modeled after search algorithm 7713e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 7723e519524SHoward Hinnant if (__first2 == __last2) 7733e519524SHoward Hinnant return __r; 7743e519524SHoward Hinnant while (true) 7753e519524SHoward Hinnant { 7763e519524SHoward Hinnant while (true) 7773e519524SHoward Hinnant { 7783e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 7793e519524SHoward Hinnant return __r; // (or __last1 if never found) 7803e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 7813e519524SHoward Hinnant break; 7823e519524SHoward Hinnant ++__first1; 7833e519524SHoward Hinnant } 7843e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 7853e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 7863e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 7873e519524SHoward Hinnant while (true) 7883e519524SHoward Hinnant { 7893e519524SHoward Hinnant if (++__m2 == __last2) 7903e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 7913e519524SHoward Hinnant __r = __first1; 7923e519524SHoward Hinnant ++__first1; 7933e519524SHoward Hinnant break; 7943e519524SHoward Hinnant } 7953e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 7963e519524SHoward Hinnant return __r; 7973e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 7983e519524SHoward Hinnant { 7993e519524SHoward Hinnant ++__first1; 8003e519524SHoward Hinnant break; 8013e519524SHoward Hinnant } // else there is a match, check next elements 8023e519524SHoward Hinnant } 8033e519524SHoward Hinnant } 8043e519524SHoward Hinnant} 8053e519524SHoward Hinnant 8063e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 8073e519524SHoward Hinnant_BidirectionalIterator1 8083e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 8093e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 8103e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 8113e519524SHoward Hinnant{ 8123e519524SHoward Hinnant // modeled after search algorithm (in reverse) 8133e519524SHoward Hinnant if (__first2 == __last2) 8143e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 8153e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 8163e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 8173e519524SHoward Hinnant --__l2; 8183e519524SHoward Hinnant while (true) 8193e519524SHoward Hinnant { 8203e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 8213e519524SHoward Hinnant while (true) 8223e519524SHoward Hinnant { 8233e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 8243e519524SHoward Hinnant return __last1; 8253e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 8263e519524SHoward Hinnant break; 8273e519524SHoward Hinnant } 8283e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 8293e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 8303e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 8313e519524SHoward Hinnant while (true) 8323e519524SHoward Hinnant { 8333e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 8343e519524SHoward Hinnant return __m1; 8353e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 8363e519524SHoward Hinnant return __last1; 8373e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 8383e519524SHoward Hinnant { 8393e519524SHoward Hinnant break; 8403e519524SHoward Hinnant } // else there is a match, check next elements 8413e519524SHoward Hinnant } 8423e519524SHoward Hinnant } 8433e519524SHoward Hinnant} 8443e519524SHoward Hinnant 8453e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 8463e519524SHoward Hinnant_RandomAccessIterator1 8473e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 8483e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 8493e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 8503e519524SHoward Hinnant{ 8513e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 8523e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 8533e519524SHoward Hinnant if (__len2 == 0) 8543e519524SHoward Hinnant return __last1; 8553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 8563e519524SHoward Hinnant if (__len1 < __len2) 8573e519524SHoward Hinnant return __last1; 8583e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 8593e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 8603e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 8613e519524SHoward Hinnant --__l2; 8623e519524SHoward Hinnant while (true) 8633e519524SHoward Hinnant { 8643e519524SHoward Hinnant while (true) 8653e519524SHoward Hinnant { 8663e519524SHoward Hinnant if (__s == __l1) 8673e519524SHoward Hinnant return __last1; 8683e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 8693e519524SHoward Hinnant break; 8703e519524SHoward Hinnant } 8713e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 8723e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 8733e519524SHoward Hinnant while (true) 8743e519524SHoward Hinnant { 8753e519524SHoward Hinnant if (__m2 == __first2) 8763e519524SHoward Hinnant return __m1; 8773e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 8783e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 8793e519524SHoward Hinnant { 8803e519524SHoward Hinnant break; 8813e519524SHoward Hinnant } 8823e519524SHoward Hinnant } 8833e519524SHoward Hinnant } 8843e519524SHoward Hinnant} 8853e519524SHoward Hinnant 8863e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 8873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8883e519524SHoward Hinnant_ForwardIterator1 8893e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8903e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 8913e519524SHoward Hinnant{ 8923e519524SHoward Hinnant return _STD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 8933e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 8943e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 8953e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 8963e519524SHoward Hinnant} 8973e519524SHoward Hinnant 8983e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 8993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9003e519524SHoward Hinnant_ForwardIterator1 9013e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9023e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 9033e519524SHoward Hinnant{ 9043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 9053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 9063e519524SHoward Hinnant return _STD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 9073e519524SHoward Hinnant} 9083e519524SHoward Hinnant 9093e519524SHoward Hinnant// find_first_of 9103e519524SHoward Hinnant 9113e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9123e519524SHoward Hinnant_ForwardIterator1 9133e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9143e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9153e519524SHoward Hinnant{ 9163e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 9173e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 9183e519524SHoward Hinnant if (__pred(*__first1, *__j)) 9193e519524SHoward Hinnant return __first1; 9203e519524SHoward Hinnant return __last1; 9213e519524SHoward Hinnant} 9223e519524SHoward Hinnant 9233e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 9243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9253e519524SHoward Hinnant_ForwardIterator1 9263e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9273e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 9283e519524SHoward Hinnant{ 9293e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 9303e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 9313e519524SHoward Hinnant return _STD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 9323e519524SHoward Hinnant} 9333e519524SHoward Hinnant 9343e519524SHoward Hinnant// adjacent_find 9353e519524SHoward Hinnant 9363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 9373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9383e519524SHoward Hinnant_ForwardIterator 9393e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 9403e519524SHoward Hinnant{ 9413e519524SHoward Hinnant if (__first != __last) 9423e519524SHoward Hinnant { 9433e519524SHoward Hinnant _ForwardIterator __i = __first; 9443e519524SHoward Hinnant while (++__i != __last) 9453e519524SHoward Hinnant { 9463e519524SHoward Hinnant if (__pred(*__first, *__i)) 9473e519524SHoward Hinnant return __first; 9483e519524SHoward Hinnant __first = __i; 9493e519524SHoward Hinnant } 9503e519524SHoward Hinnant } 9513e519524SHoward Hinnant return __last; 9523e519524SHoward Hinnant} 9533e519524SHoward Hinnant 9543e519524SHoward Hinnanttemplate <class _ForwardIterator> 9553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9563e519524SHoward Hinnant_ForwardIterator 9573e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 9583e519524SHoward Hinnant{ 9593e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 9603e519524SHoward Hinnant return _STD::adjacent_find(__first, __last, __equal_to<__v>()); 9613e519524SHoward Hinnant} 9623e519524SHoward Hinnant 9633e519524SHoward Hinnant// count 9643e519524SHoward Hinnant 9653e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9673e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 9683e519524SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value) 9693e519524SHoward Hinnant{ 9703e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 9713e519524SHoward Hinnant for (; __first != __last; ++__first) 9723e519524SHoward Hinnant if (*__first == __value) 9733e519524SHoward Hinnant ++__r; 9743e519524SHoward Hinnant return __r; 9753e519524SHoward Hinnant} 9763e519524SHoward Hinnant 9773e519524SHoward Hinnant// count_if 9783e519524SHoward Hinnant 9793e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9813e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 9823e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9833e519524SHoward Hinnant{ 9843e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 9853e519524SHoward Hinnant for (; __first != __last; ++__first) 9863e519524SHoward Hinnant if (__pred(*__first)) 9873e519524SHoward Hinnant ++__r; 9883e519524SHoward Hinnant return __r; 9893e519524SHoward Hinnant} 9903e519524SHoward Hinnant 9913e519524SHoward Hinnant// mismatch 9923e519524SHoward Hinnant 9933e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 9943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9953e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 9963e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 9973e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 9983e519524SHoward Hinnant{ 9993e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10003e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10013e519524SHoward Hinnant break; 10023e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 10033e519524SHoward Hinnant} 10043e519524SHoward Hinnant 10053e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 10063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10073e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 10083e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 10093e519524SHoward Hinnant{ 10103e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 10113e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 10123e519524SHoward Hinnant return _STD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10133e519524SHoward Hinnant} 10143e519524SHoward Hinnant 10153e519524SHoward Hinnant// equal 10163e519524SHoward Hinnant 10173e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 10183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10193e519524SHoward Hinnantbool 10203e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 10213e519524SHoward Hinnant{ 10223e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10233e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10243e519524SHoward Hinnant return false; 10253e519524SHoward Hinnant return true; 10263e519524SHoward Hinnant} 10273e519524SHoward Hinnant 10283e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 10293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10303e519524SHoward Hinnantbool 10313e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 10323e519524SHoward Hinnant{ 10333e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 10343e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 10353e519524SHoward Hinnant return _STD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10363e519524SHoward Hinnant} 10373e519524SHoward Hinnant 10383e519524SHoward Hinnant// is_permutation 10393e519524SHoward Hinnant 10403e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10413e519524SHoward Hinnantbool 10423e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10433e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 10443e519524SHoward Hinnant{ 10453e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 10463e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10473e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10483e519524SHoward Hinnant goto __not_done; 10493e519524SHoward Hinnant return true; 10503e519524SHoward Hinnant__not_done: 10513e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 10523e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 10533e519524SHoward Hinnant _D1 __l1 = _STD::distance(__first1, __last1); 10543e519524SHoward Hinnant if (__l1 == _D1(1)) 10553e519524SHoward Hinnant return false; 10563e519524SHoward Hinnant _ForwardIterator2 __last2 = _STD::next(__first2, __l1); 10573e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 10583e519524SHoward Hinnant // equal elements in [f2, l2) 10593e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 10603e519524SHoward Hinnant { 10613e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 10623e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 10633e519524SHoward Hinnant if (__pred(*__j, *__i)) 10643e519524SHoward Hinnant goto __next_iter; 10653e519524SHoward Hinnant { 10663e519524SHoward Hinnant // Count number of *__i in [f2, l2) 10673e519524SHoward Hinnant _D1 __c2 = 0; 10683e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10693e519524SHoward Hinnant if (__pred(*__i, *__j)) 10703e519524SHoward Hinnant ++__c2; 10713e519524SHoward Hinnant if (__c2 == 0) 10723e519524SHoward Hinnant return false; 10733e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 10743e519524SHoward Hinnant _D1 __c1 = 1; 10753e519524SHoward Hinnant for (_ForwardIterator1 __j = _STD::next(__i); __j != __last1; ++__j) 10763e519524SHoward Hinnant if (__pred(*__i, *__j)) 10773e519524SHoward Hinnant ++__c1; 10783e519524SHoward Hinnant if (__c1 != __c2) 10793e519524SHoward Hinnant return false; 10803e519524SHoward Hinnant } 10813e519524SHoward Hinnant__next_iter:; 10823e519524SHoward Hinnant } 10833e519524SHoward Hinnant return true; 10843e519524SHoward Hinnant} 10853e519524SHoward Hinnant 10863e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 10873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10883e519524SHoward Hinnantbool 10893e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10903e519524SHoward Hinnant _ForwardIterator2 __first2) 10913e519524SHoward Hinnant{ 10923e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10933e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 10943e519524SHoward Hinnant return _STD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10953e519524SHoward Hinnant} 10963e519524SHoward Hinnant 10973e519524SHoward Hinnant// search 10983e519524SHoward Hinnant 10993e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 11003e519524SHoward Hinnant_ForwardIterator1 11013e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11023e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 11033e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 11043e519524SHoward Hinnant{ 11053e519524SHoward Hinnant if (__first2 == __last2) 11063e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 11073e519524SHoward Hinnant while (true) 11083e519524SHoward Hinnant { 11093e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 11103e519524SHoward Hinnant while (true) 11113e519524SHoward Hinnant { 11123e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 11133e519524SHoward Hinnant return __last1; 11143e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11153e519524SHoward Hinnant break; 11163e519524SHoward Hinnant ++__first1; 11173e519524SHoward Hinnant } 11183e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 11193e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 11203e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 11213e519524SHoward Hinnant while (true) 11223e519524SHoward Hinnant { 11233e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 11243e519524SHoward Hinnant return __first1; 11253e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 11263e519524SHoward Hinnant return __last1; 11273e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 11283e519524SHoward Hinnant { 11293e519524SHoward Hinnant ++__first1; 11303e519524SHoward Hinnant break; 11313e519524SHoward Hinnant } // else there is a match, check next elements 11323e519524SHoward Hinnant } 11333e519524SHoward Hinnant } 11343e519524SHoward Hinnant} 11353e519524SHoward Hinnant 11363e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11373e519524SHoward Hinnant_RandomAccessIterator1 11383e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11393e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11403e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11413e519524SHoward Hinnant{ 11423e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 11433e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 11443e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11453e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 11463e519524SHoward Hinnant if (__len2 == 0) 11473e519524SHoward Hinnant return __first1; 11483e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 11493e519524SHoward Hinnant if (__len1 < __len2) 11503e519524SHoward Hinnant return __last1; 11513e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 11523e519524SHoward Hinnant while (true) 11533e519524SHoward Hinnant { 11543e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 11553e519524SHoward Hinnant while (true) 11563e519524SHoward Hinnant { 11573e519524SHoward Hinnant if (__first1 == __s) 11583e519524SHoward Hinnant return __last1; 11593e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11603e519524SHoward Hinnant break; 11613e519524SHoward Hinnant ++__first1; 11623e519524SHoward Hinnant } 11633e519524SHoward Hinnant#else // _LIBCPP_UNROLL_LOOPS 11643e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 11653e519524SHoward Hinnant { 11663e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11673e519524SHoward Hinnant goto __phase2; 11683e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 11693e519524SHoward Hinnant goto __phase2; 11703e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 11713e519524SHoward Hinnant goto __phase2; 11723e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 11733e519524SHoward Hinnant goto __phase2; 11743e519524SHoward Hinnant ++__first1; 11753e519524SHoward Hinnant } 11763e519524SHoward Hinnant switch (__s - __first1) 11773e519524SHoward Hinnant { 11783e519524SHoward Hinnant case 3: 11793e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11803e519524SHoward Hinnant break; 11813e519524SHoward Hinnant ++__first1; 11823e519524SHoward Hinnant case 2: 11833e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11843e519524SHoward Hinnant break; 11853e519524SHoward Hinnant ++__first1; 11863e519524SHoward Hinnant case 1: 11873e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11883e519524SHoward Hinnant break; 11893e519524SHoward Hinnant case 0: 11903e519524SHoward Hinnant return __last1; 11913e519524SHoward Hinnant } 11923e519524SHoward Hinnant __phase2: 11933e519524SHoward Hinnant#endif // _LIBCPP_UNROLL_LOOPS 11943e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 11953e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 11963e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 11973e519524SHoward Hinnant while (true) 11983e519524SHoward Hinnant { 11993e519524SHoward Hinnant if (++__m2 == __last2) 12003e519524SHoward Hinnant return __first1; 12013e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 12023e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12033e519524SHoward Hinnant { 12043e519524SHoward Hinnant ++__first1; 12053e519524SHoward Hinnant break; 12063e519524SHoward Hinnant } 12073e519524SHoward Hinnant } 12083e519524SHoward Hinnant#else // _LIBCPP_UNROLL_LOOPS 12093e519524SHoward Hinnant ++__m2; 12103e519524SHoward Hinnant ++__m1; 12113e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 12123e519524SHoward Hinnant { 12133e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12143e519524SHoward Hinnant goto __continue; 12153e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12163e519524SHoward Hinnant goto __continue; 12173e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12183e519524SHoward Hinnant goto __continue; 12193e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12203e519524SHoward Hinnant goto __continue; 12213e519524SHoward Hinnant ++__m1; 12223e519524SHoward Hinnant ++__m2; 12233e519524SHoward Hinnant } 12243e519524SHoward Hinnant switch (__last2 - __m2) 12253e519524SHoward Hinnant { 12263e519524SHoward Hinnant case 3: 12273e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12283e519524SHoward Hinnant break; 12293e519524SHoward Hinnant ++__m1; 12303e519524SHoward Hinnant ++__m2; 12313e519524SHoward Hinnant case 2: 12323e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12333e519524SHoward Hinnant break; 12343e519524SHoward Hinnant ++__m1; 12353e519524SHoward Hinnant ++__m2; 12363e519524SHoward Hinnant case 1: 12373e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12383e519524SHoward Hinnant break; 12393e519524SHoward Hinnant case 0: 12403e519524SHoward Hinnant return __first1; 12413e519524SHoward Hinnant } 12423e519524SHoward Hinnant __continue: 12433e519524SHoward Hinnant ++__first1; 12443e519524SHoward Hinnant#endif // _LIBCPP_UNROLL_LOOPS 12453e519524SHoward Hinnant } 12463e519524SHoward Hinnant} 12473e519524SHoward Hinnant 12483e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12503e519524SHoward Hinnant_ForwardIterator1 12513e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12523e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 12533e519524SHoward Hinnant{ 12543e519524SHoward Hinnant return _STD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 12553e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 12563e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 12573e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 12583e519524SHoward Hinnant} 12593e519524SHoward Hinnant 12603e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 12613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12623e519524SHoward Hinnant_ForwardIterator1 12633e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12643e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 12653e519524SHoward Hinnant{ 12663e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 12673e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 12683e519524SHoward Hinnant return _STD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12693e519524SHoward Hinnant} 12703e519524SHoward Hinnant 12713e519524SHoward Hinnant// search_n 12723e519524SHoward Hinnant 12733e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 12743e519524SHoward Hinnant_ForwardIterator 12753e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 12763e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred, forward_iterator_tag) 12773e519524SHoward Hinnant{ 12783e519524SHoward Hinnant if (__count <= 0) 12793e519524SHoward Hinnant return __first; 12803e519524SHoward Hinnant while (true) 12813e519524SHoward Hinnant { 12823e519524SHoward Hinnant // Find first element in sequence that matchs __value, with a mininum of loop checks 12833e519524SHoward Hinnant while (true) 12843e519524SHoward Hinnant { 12853e519524SHoward Hinnant if (__first == __last) // return __last if no element matches __value 12863e519524SHoward Hinnant return __last; 12873e519524SHoward Hinnant if (__pred(*__first, __value)) 12883e519524SHoward Hinnant break; 12893e519524SHoward Hinnant ++__first; 12903e519524SHoward Hinnant } 12913e519524SHoward Hinnant // *__first matches __value, now match elements after here 12923e519524SHoward Hinnant _ForwardIterator __m = __first; 12933e519524SHoward Hinnant _Size __c(0); 12943e519524SHoward Hinnant while (true) 12953e519524SHoward Hinnant { 12963e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 12973e519524SHoward Hinnant return __first; 12983e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 12993e519524SHoward Hinnant return __last; 13003e519524SHoward Hinnant if (!__pred(*__m, __value)) // if there is a mismatch, restart with a new __first 13013e519524SHoward Hinnant { 13023e519524SHoward Hinnant __first = __m; 13033e519524SHoward Hinnant ++__first; 13043e519524SHoward Hinnant break; 13053e519524SHoward Hinnant } // else there is a match, check next elements 13063e519524SHoward Hinnant } 13073e519524SHoward Hinnant } 13083e519524SHoward Hinnant} 13093e519524SHoward Hinnant 13103e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 13113e519524SHoward Hinnant_RandomAccessIterator 13123e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 13133e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred, random_access_iterator_tag) 13143e519524SHoward Hinnant{ 13153e519524SHoward Hinnant if (__count <= 0) 13163e519524SHoward Hinnant return __first; 13173e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 13183e519524SHoward Hinnant if (__len < __count) 13193e519524SHoward Hinnant return __last; 13203e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 13213e519524SHoward Hinnant while (true) 13223e519524SHoward Hinnant { 13233e519524SHoward Hinnant // Find first element in sequence that matchs __value, with a mininum of loop checks 13243e519524SHoward Hinnant while (true) 13253e519524SHoward Hinnant { 13263e519524SHoward Hinnant if (__first == __s) // return __last if no element matches __value 13273e519524SHoward Hinnant return __last; 13283e519524SHoward Hinnant if (__pred(*__first, __value)) 13293e519524SHoward Hinnant break; 13303e519524SHoward Hinnant ++__first; 13313e519524SHoward Hinnant } 13323e519524SHoward Hinnant // *__first matches __value, now match elements after here 13333e519524SHoward Hinnant _RandomAccessIterator __m = __first; 13343e519524SHoward Hinnant _Size __c(0); 13353e519524SHoward Hinnant while (true) 13363e519524SHoward Hinnant { 13373e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 13383e519524SHoward Hinnant return __first; 13393e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 13403e519524SHoward Hinnant if (!__pred(*__m, __value)) // if there is a mismatch, restart with a new __first 13413e519524SHoward Hinnant { 13423e519524SHoward Hinnant __first = __m; 13433e519524SHoward Hinnant ++__first; 13443e519524SHoward Hinnant break; 13453e519524SHoward Hinnant } // else there is a match, check next elements 13463e519524SHoward Hinnant } 13473e519524SHoward Hinnant } 13483e519524SHoward Hinnant} 13493e519524SHoward Hinnant 13503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 13513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13523e519524SHoward Hinnant_ForwardIterator 13533e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 13543e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred) 13553e519524SHoward Hinnant{ 13563e519524SHoward Hinnant return _STD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 13573e519524SHoward Hinnant (__first, __last, __count, __value, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 13583e519524SHoward Hinnant} 13593e519524SHoward Hinnant 13603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 13613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13623e519524SHoward Hinnant_ForwardIterator 13633e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value) 13643e519524SHoward Hinnant{ 13653e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 13663e519524SHoward Hinnant return _STD::search_n(__first, __last, __count, __value, __equal_to<__v, _Tp>()); 13673e519524SHoward Hinnant} 13683e519524SHoward Hinnant 13693e519524SHoward Hinnant// copy 13703e519524SHoward Hinnant 13713e519524SHoward Hinnanttemplate <class _Iter> 13723e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 13733e519524SHoward Hinnant{ 13743e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 13753e519524SHoward Hinnant}; 13763e519524SHoward Hinnant 13773e519524SHoward Hinnanttemplate <class _Iter> 13783e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 13793e519524SHoward Hinnant{ 13803e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 13813e519524SHoward Hinnant}; 13823e519524SHoward Hinnant 13833e519524SHoward Hinnanttemplate <class _Iter> 13843e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 13853e519524SHoward Hinnant{ 13863e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 13873e519524SHoward Hinnant}; 13883e519524SHoward Hinnant 13893e519524SHoward Hinnanttemplate <class _Iter> 13903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13913e519524SHoward Hinnant_Iter 13923e519524SHoward Hinnant__unwrap_iter(_Iter __i) 13933e519524SHoward Hinnant{ 13943e519524SHoward Hinnant return __i; 13953e519524SHoward Hinnant} 13963e519524SHoward Hinnant 13973e519524SHoward Hinnanttemplate <class _Tp> 13983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13993e519524SHoward Hinnanttypename enable_if 14003e519524SHoward Hinnant< 14013e519524SHoward Hinnant has_trivial_copy_assign<_Tp>::value, 14023e519524SHoward Hinnant _Tp* 14033e519524SHoward Hinnant>::type 14043e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 14053e519524SHoward Hinnant{ 14063e519524SHoward Hinnant return __i.base(); 14073e519524SHoward Hinnant} 14083e519524SHoward Hinnant 14093e519524SHoward Hinnanttemplate <class _Tp> 14103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14113e519524SHoward Hinnanttypename enable_if 14123e519524SHoward Hinnant< 14133e519524SHoward Hinnant has_trivial_copy_assign<_Tp>::value, 14143e519524SHoward Hinnant _Tp* 14153e519524SHoward Hinnant>::type 14163e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 14173e519524SHoward Hinnant{ 14183e519524SHoward Hinnant return __i.base(); 14193e519524SHoward Hinnant} 14203e519524SHoward Hinnant 14213e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14233e519524SHoward Hinnant_OutputIterator 14243e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14253e519524SHoward Hinnant{ 14263e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 14273e519524SHoward Hinnant *__result = *__first; 14283e519524SHoward Hinnant return __result; 14293e519524SHoward Hinnant} 14303e519524SHoward Hinnant 14313e519524SHoward Hinnanttemplate <class _Tp, class _Up> 14323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14333e519524SHoward Hinnanttypename enable_if 14343e519524SHoward Hinnant< 14353e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 14363e519524SHoward Hinnant has_trivial_copy_assign<_Up>::value, 14373e519524SHoward Hinnant _Up* 14383e519524SHoward Hinnant>::type 14393e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 14403e519524SHoward Hinnant{ 14413e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 14423e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 14433e519524SHoward Hinnant return __result + __n; 14443e519524SHoward Hinnant} 14453e519524SHoward Hinnant 14463e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14483e519524SHoward Hinnant_OutputIterator 14493e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14503e519524SHoward Hinnant{ 14513e519524SHoward Hinnant return _STD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 14523e519524SHoward Hinnant} 14533e519524SHoward Hinnant 14543e519524SHoward Hinnant// copy_backward 14553e519524SHoward Hinnant 14563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14583e519524SHoward Hinnant_OutputIterator 14593e519524SHoward Hinnant__copy_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14603e519524SHoward Hinnant{ 14613e519524SHoward Hinnant while (__first != __last) 14623e519524SHoward Hinnant *--__result = *--__last; 14633e519524SHoward Hinnant return __result; 14643e519524SHoward Hinnant} 14653e519524SHoward Hinnant 14663e519524SHoward Hinnanttemplate <class _Tp, class _Up> 14673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14683e519524SHoward Hinnanttypename enable_if 14693e519524SHoward Hinnant< 14703e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 14713e519524SHoward Hinnant has_trivial_copy_assign<_Up>::value, 14723e519524SHoward Hinnant _Up* 14733e519524SHoward Hinnant>::type 14743e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 14753e519524SHoward Hinnant{ 14763e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 14773e519524SHoward Hinnant __result -= __n; 14783e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 14793e519524SHoward Hinnant return __result; 14803e519524SHoward Hinnant} 14813e519524SHoward Hinnant 14823e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 14833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14843e519524SHoward Hinnant_BidirectionalIterator2 14853e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 14863e519524SHoward Hinnant _BidirectionalIterator2 __result) 14873e519524SHoward Hinnant{ 14883e519524SHoward Hinnant return _STD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 14893e519524SHoward Hinnant} 14903e519524SHoward Hinnant 14913e519524SHoward Hinnant// copy_if 14923e519524SHoward Hinnant 14933e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 14943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14953e519524SHoward Hinnant_OutputIterator 14963e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 14973e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 14983e519524SHoward Hinnant{ 14993e519524SHoward Hinnant for (; __first != __last; ++__first) 15003e519524SHoward Hinnant { 15013e519524SHoward Hinnant if (__pred(*__first)) 15023e519524SHoward Hinnant { 15033e519524SHoward Hinnant *__result = *__first; 15043e519524SHoward Hinnant ++__result; 15053e519524SHoward Hinnant } 15063e519524SHoward Hinnant } 15073e519524SHoward Hinnant return __result; 15083e519524SHoward Hinnant} 15093e519524SHoward Hinnant 15103e519524SHoward Hinnant// copy_n 15113e519524SHoward Hinnant 15123e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 15133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15143e519524SHoward Hinnanttypename enable_if 15153e519524SHoward Hinnant< 15163e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 15173e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 15183e519524SHoward Hinnant _OutputIterator 15193e519524SHoward Hinnant>::type 15203e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15213e519524SHoward Hinnant{ 15223e519524SHoward Hinnant for (; __n > 0; --__n, ++__first, ++__result) 15233e519524SHoward Hinnant *__result = *__first; 15243e519524SHoward Hinnant return __result; 15253e519524SHoward Hinnant} 15263e519524SHoward Hinnant 15273e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 15283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15293e519524SHoward Hinnanttypename enable_if 15303e519524SHoward Hinnant< 15313e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 15323e519524SHoward Hinnant _OutputIterator 15333e519524SHoward Hinnant>::type 15343e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15353e519524SHoward Hinnant{ 15363e519524SHoward Hinnant return copy(__first, __first + __n, __result); 15373e519524SHoward Hinnant} 15383e519524SHoward Hinnant 15393e519524SHoward Hinnant// move 15403e519524SHoward Hinnant 15413e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15433e519524SHoward Hinnant_OutputIterator 15443e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15453e519524SHoward Hinnant{ 15463e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 15473e519524SHoward Hinnant *__result = _STD::move(*__first); 15483e519524SHoward Hinnant return __result; 15493e519524SHoward Hinnant} 15503e519524SHoward Hinnant 15513e519524SHoward Hinnanttemplate <class _Tp, class _Up> 15523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15533e519524SHoward Hinnanttypename enable_if 15543e519524SHoward Hinnant< 15553e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 15563e519524SHoward Hinnant has_trivial_copy_assign<_Up>::value, 15573e519524SHoward Hinnant _Up* 15583e519524SHoward Hinnant>::type 15593e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 15603e519524SHoward Hinnant{ 15613e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 15623e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 15633e519524SHoward Hinnant return __result + __n; 15643e519524SHoward Hinnant} 15653e519524SHoward Hinnant 15663e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15683e519524SHoward Hinnant_OutputIterator 15693e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15703e519524SHoward Hinnant{ 15713e519524SHoward Hinnant return _STD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 15723e519524SHoward Hinnant} 15733e519524SHoward Hinnant 15743e519524SHoward Hinnant// move_backward 15753e519524SHoward Hinnant 15763e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15783e519524SHoward Hinnant_OutputIterator 15793e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15803e519524SHoward Hinnant{ 15813e519524SHoward Hinnant while (__first != __last) 15823e519524SHoward Hinnant *--__result = _STD::move(*--__last); 15833e519524SHoward Hinnant return __result; 15843e519524SHoward Hinnant} 15853e519524SHoward Hinnant 15863e519524SHoward Hinnanttemplate <class _Tp, class _Up> 15873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15883e519524SHoward Hinnanttypename enable_if 15893e519524SHoward Hinnant< 15903e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 15913e519524SHoward Hinnant has_trivial_copy_assign<_Up>::value, 15923e519524SHoward Hinnant _Up* 15933e519524SHoward Hinnant>::type 15943e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 15953e519524SHoward Hinnant{ 15963e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 15973e519524SHoward Hinnant __result -= __n; 15983e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 15993e519524SHoward Hinnant return __result; 16003e519524SHoward Hinnant} 16013e519524SHoward Hinnant 16023e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 16033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16043e519524SHoward Hinnant_BidirectionalIterator2 16053e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 16063e519524SHoward Hinnant _BidirectionalIterator2 __result) 16073e519524SHoward Hinnant{ 16083e519524SHoward Hinnant return _STD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16093e519524SHoward Hinnant} 16103e519524SHoward Hinnant 16113e519524SHoward Hinnant// iter_swap 16123e519524SHoward Hinnant 16133e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 16143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16153e519524SHoward Hinnantvoid 16163e519524SHoward Hinnantiter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) 16173e519524SHoward Hinnant{ 16183e519524SHoward Hinnant swap(*__a, *__b); 16193e519524SHoward Hinnant} 16203e519524SHoward Hinnant 16213e519524SHoward Hinnant// transform 16223e519524SHoward Hinnant 16233e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 16243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16253e519524SHoward Hinnant_OutputIterator 16263e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 16273e519524SHoward Hinnant{ 16283e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 16293e519524SHoward Hinnant *__result = __op(*__first); 16303e519524SHoward Hinnant return __result; 16313e519524SHoward Hinnant} 16323e519524SHoward Hinnant 16333e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 16343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16353e519524SHoward Hinnant_OutputIterator 16363e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 16373e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 16383e519524SHoward Hinnant{ 16393e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 16403e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 16413e519524SHoward Hinnant return __result; 16423e519524SHoward Hinnant} 16433e519524SHoward Hinnant 16443e519524SHoward Hinnant// replace 16453e519524SHoward Hinnant 16463e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 16473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16483e519524SHoward Hinnantvoid 16493e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 16503e519524SHoward Hinnant{ 16513e519524SHoward Hinnant for (; __first != __last; ++__first) 16523e519524SHoward Hinnant if (*__first == __old_value) 16533e519524SHoward Hinnant *__first = __new_value; 16543e519524SHoward Hinnant} 16553e519524SHoward Hinnant 16563e519524SHoward Hinnant// replace_if 16573e519524SHoward Hinnant 16583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 16593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16603e519524SHoward Hinnantvoid 16613e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 16623e519524SHoward Hinnant{ 16633e519524SHoward Hinnant for (; __first != __last; ++__first) 16643e519524SHoward Hinnant if (__pred(*__first)) 16653e519524SHoward Hinnant *__first = __new_value; 16663e519524SHoward Hinnant} 16673e519524SHoward Hinnant 16683e519524SHoward Hinnant// replace_copy 16693e519524SHoward Hinnant 16703e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 16713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16723e519524SHoward Hinnant_OutputIterator 16733e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 16743e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 16753e519524SHoward Hinnant{ 16763e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 16773e519524SHoward Hinnant if (*__first == __old_value) 16783e519524SHoward Hinnant *__result = __new_value; 16793e519524SHoward Hinnant else 16803e519524SHoward Hinnant *__result = *__first; 16813e519524SHoward Hinnant return __result; 16823e519524SHoward Hinnant} 16833e519524SHoward Hinnant 16843e519524SHoward Hinnant// replace_copy_if 16853e519524SHoward Hinnant 16863e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 16873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16883e519524SHoward Hinnant_OutputIterator 16893e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 16903e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 16913e519524SHoward Hinnant{ 16923e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 16933e519524SHoward Hinnant if (__pred(*__first)) 16943e519524SHoward Hinnant *__result = __new_value; 16953e519524SHoward Hinnant else 16963e519524SHoward Hinnant *__result = *__first; 16973e519524SHoward Hinnant return __result; 16983e519524SHoward Hinnant} 16993e519524SHoward Hinnant 17003e519524SHoward Hinnant// fill_n 17013e519524SHoward Hinnant 17023e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17043e519524SHoward Hinnant_OutputIterator 17053e519524SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value, false_type) 17063e519524SHoward Hinnant{ 17073e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 17083e519524SHoward Hinnant *__first = __value; 17093e519524SHoward Hinnant return __first; 17103e519524SHoward Hinnant} 17113e519524SHoward Hinnant 17123e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17143e519524SHoward Hinnant_OutputIterator 17153e519524SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value, true_type) 17163e519524SHoward Hinnant{ 17173e519524SHoward Hinnant if (__n > 0) 17183e519524SHoward Hinnant _STD::memset(__first, (unsigned char)__value, (size_t)(__n)); 17193e519524SHoward Hinnant return __first + __n; 17203e519524SHoward Hinnant} 17213e519524SHoward Hinnant 17223e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17243e519524SHoward Hinnant_OutputIterator 17253e519524SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value) 17263e519524SHoward Hinnant{ 17273e519524SHoward Hinnant return _STD::__fill_n(__first, __n, __value, integral_constant<bool, 17283e519524SHoward Hinnant is_pointer<_OutputIterator>::value && 17293e519524SHoward Hinnant has_trivial_copy_assign<_Tp>::value && 17303e519524SHoward Hinnant sizeof(_Tp) == 1>()); 17313e519524SHoward Hinnant} 17323e519524SHoward Hinnant 17333e519524SHoward Hinnant// fill 17343e519524SHoward Hinnant 17353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17373e519524SHoward Hinnantvoid 17383e519524SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, forward_iterator_tag) 17393e519524SHoward Hinnant{ 17403e519524SHoward Hinnant for (; __first != __last; ++__first) 17413e519524SHoward Hinnant *__first = __value; 17423e519524SHoward Hinnant} 17433e519524SHoward Hinnant 17443e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 17453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17463e519524SHoward Hinnantvoid 17473e519524SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value, random_access_iterator_tag) 17483e519524SHoward Hinnant{ 17493e519524SHoward Hinnant _STD::fill_n(__first, __last - __first, __value); 17503e519524SHoward Hinnant} 17513e519524SHoward Hinnant 17523e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17543e519524SHoward Hinnantvoid 17553e519524SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 17563e519524SHoward Hinnant{ 17573e519524SHoward Hinnant _STD::__fill(__first, __last, __value, typename iterator_traits<_ForwardIterator>::iterator_category()); 17583e519524SHoward Hinnant} 17593e519524SHoward Hinnant 17603e519524SHoward Hinnant// generate 17613e519524SHoward Hinnant 17623e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 17633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17643e519524SHoward Hinnantvoid 17653e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 17663e519524SHoward Hinnant{ 17673e519524SHoward Hinnant for (; __first != __last; ++__first) 17683e519524SHoward Hinnant *__first = __gen(); 17693e519524SHoward Hinnant} 17703e519524SHoward Hinnant 17713e519524SHoward Hinnant// generate_n 17723e519524SHoward Hinnant 17733e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 17743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17753e519524SHoward Hinnant_OutputIterator 17763e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 17773e519524SHoward Hinnant{ 17783e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 17793e519524SHoward Hinnant *__first = __gen(); 17803e519524SHoward Hinnant return __first; 17813e519524SHoward Hinnant} 17823e519524SHoward Hinnant 17833e519524SHoward Hinnant// remove 17843e519524SHoward Hinnant 17853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17863e519524SHoward Hinnant_ForwardIterator 17873e519524SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 17883e519524SHoward Hinnant{ 17893e519524SHoward Hinnant __first = _STD::find(__first, __last, __value); 17903e519524SHoward Hinnant if (__first != __last) 17913e519524SHoward Hinnant { 17923e519524SHoward Hinnant _ForwardIterator __i = __first; 17933e519524SHoward Hinnant while (++__i != __last) 17943e519524SHoward Hinnant { 17953e519524SHoward Hinnant if (!(*__i == __value)) 17963e519524SHoward Hinnant { 17973e519524SHoward Hinnant *__first = _STD::move(*__i); 17983e519524SHoward Hinnant ++__first; 17993e519524SHoward Hinnant } 18003e519524SHoward Hinnant } 18013e519524SHoward Hinnant } 18023e519524SHoward Hinnant return __first; 18033e519524SHoward Hinnant} 18043e519524SHoward Hinnant 18053e519524SHoward Hinnant// remove_if 18063e519524SHoward Hinnant 18073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 18083e519524SHoward Hinnant_ForwardIterator 18093e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 18103e519524SHoward Hinnant{ 18113e519524SHoward Hinnant __first = _STD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 18123e519524SHoward Hinnant (__first, __last, __pred); 18133e519524SHoward Hinnant if (__first != __last) 18143e519524SHoward Hinnant { 18153e519524SHoward Hinnant _ForwardIterator __i = __first; 18163e519524SHoward Hinnant while (++__i != __last) 18173e519524SHoward Hinnant { 18183e519524SHoward Hinnant if (!__pred(*__i)) 18193e519524SHoward Hinnant { 18203e519524SHoward Hinnant *__first = _STD::move(*__i); 18213e519524SHoward Hinnant ++__first; 18223e519524SHoward Hinnant } 18233e519524SHoward Hinnant } 18243e519524SHoward Hinnant } 18253e519524SHoward Hinnant return __first; 18263e519524SHoward Hinnant} 18273e519524SHoward Hinnant 18283e519524SHoward Hinnant// remove_copy 18293e519524SHoward Hinnant 18303e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 18313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18323e519524SHoward Hinnant_OutputIterator 18333e519524SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value) 18343e519524SHoward Hinnant{ 18353e519524SHoward Hinnant for (; __first != __last; ++__first) 18363e519524SHoward Hinnant { 18373e519524SHoward Hinnant if (!(*__first == __value)) 18383e519524SHoward Hinnant { 18393e519524SHoward Hinnant *__result = *__first; 18403e519524SHoward Hinnant ++__result; 18413e519524SHoward Hinnant } 18423e519524SHoward Hinnant } 18433e519524SHoward Hinnant return __result; 18443e519524SHoward Hinnant} 18453e519524SHoward Hinnant 18463e519524SHoward Hinnant// remove_copy_if 18473e519524SHoward Hinnant 18483e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 18493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18503e519524SHoward Hinnant_OutputIterator 18513e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 18523e519524SHoward Hinnant{ 18533e519524SHoward Hinnant for (; __first != __last; ++__first) 18543e519524SHoward Hinnant { 18553e519524SHoward Hinnant if (!__pred(*__first)) 18563e519524SHoward Hinnant { 18573e519524SHoward Hinnant *__result = *__first; 18583e519524SHoward Hinnant ++__result; 18593e519524SHoward Hinnant } 18603e519524SHoward Hinnant } 18613e519524SHoward Hinnant return __result; 18623e519524SHoward Hinnant} 18633e519524SHoward Hinnant 18643e519524SHoward Hinnant// unique 18653e519524SHoward Hinnant 18663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 18673e519524SHoward Hinnant_ForwardIterator 18683e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 18693e519524SHoward Hinnant{ 18703e519524SHoward Hinnant __first = _STD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 18713e519524SHoward Hinnant (__first, __last, __pred); 18723e519524SHoward Hinnant if (__first != __last) 18733e519524SHoward Hinnant { 18743e519524SHoward Hinnant // ... a a ? ... 18753e519524SHoward Hinnant // f i 18763e519524SHoward Hinnant _ForwardIterator __i = __first; 18773e519524SHoward Hinnant for (++__i; ++__i != __last;) 18783e519524SHoward Hinnant if (!__pred(*__first, *__i)) 18793e519524SHoward Hinnant *++__first = _STD::move(*__i); 18803e519524SHoward Hinnant ++__first; 18813e519524SHoward Hinnant } 18823e519524SHoward Hinnant return __first; 18833e519524SHoward Hinnant} 18843e519524SHoward Hinnant 18853e519524SHoward Hinnanttemplate <class _ForwardIterator> 18863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18873e519524SHoward Hinnant_ForwardIterator 18883e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 18893e519524SHoward Hinnant{ 18903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 18913e519524SHoward Hinnant return _STD::unique(__first, __last, __equal_to<__v>()); 18923e519524SHoward Hinnant} 18933e519524SHoward Hinnant 18943e519524SHoward Hinnant// unique_copy 18953e519524SHoward Hinnant 18963e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 18973e519524SHoward Hinnant_OutputIterator 18983e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 18993e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 19003e519524SHoward Hinnant{ 19013e519524SHoward Hinnant if (__first != __last) 19023e519524SHoward Hinnant { 19033e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 19043e519524SHoward Hinnant *__result = __t; 19053e519524SHoward Hinnant ++__result; 19063e519524SHoward Hinnant while (++__first != __last) 19073e519524SHoward Hinnant { 19083e519524SHoward Hinnant if (!__pred(__t, *__first)) 19093e519524SHoward Hinnant { 19103e519524SHoward Hinnant __t = *__first; 19113e519524SHoward Hinnant *__result = __t; 19123e519524SHoward Hinnant ++__result; 19133e519524SHoward Hinnant } 19143e519524SHoward Hinnant } 19153e519524SHoward Hinnant } 19163e519524SHoward Hinnant return __result; 19173e519524SHoward Hinnant} 19183e519524SHoward Hinnant 19193e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 19203e519524SHoward Hinnant_OutputIterator 19213e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 19223e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 19233e519524SHoward Hinnant{ 19243e519524SHoward Hinnant if (__first != __last) 19253e519524SHoward Hinnant { 19263e519524SHoward Hinnant _ForwardIterator __i = __first; 19273e519524SHoward Hinnant *__result = *__i; 19283e519524SHoward Hinnant ++__result; 19293e519524SHoward Hinnant while (++__first != __last) 19303e519524SHoward Hinnant { 19313e519524SHoward Hinnant if (!__pred(*__i, *__first)) 19323e519524SHoward Hinnant { 19333e519524SHoward Hinnant *__result = *__first; 19343e519524SHoward Hinnant ++__result; 19353e519524SHoward Hinnant __i = __first; 19363e519524SHoward Hinnant } 19373e519524SHoward Hinnant } 19383e519524SHoward Hinnant } 19393e519524SHoward Hinnant return __result; 19403e519524SHoward Hinnant} 19413e519524SHoward Hinnant 19423e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 19433e519524SHoward Hinnant_ForwardIterator 19443e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 19453e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 19463e519524SHoward Hinnant{ 19473e519524SHoward Hinnant if (__first != __last) 19483e519524SHoward Hinnant { 19493e519524SHoward Hinnant *__result = *__first; 19503e519524SHoward Hinnant while (++__first != __last) 19513e519524SHoward Hinnant if (!__pred(*__result, *__first)) 19523e519524SHoward Hinnant *++__result = *__first; 19533e519524SHoward Hinnant ++__result; 19543e519524SHoward Hinnant } 19553e519524SHoward Hinnant return __result; 19563e519524SHoward Hinnant} 19573e519524SHoward Hinnant 19583e519524SHoward Hinnant 19593e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 19603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19613e519524SHoward Hinnant_OutputIterator 19623e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 19633e519524SHoward Hinnant{ 19643e519524SHoward Hinnant return _STD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 19653e519524SHoward Hinnant (__first, __last, __result, __pred, 19663e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 19673e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 19683e519524SHoward Hinnant} 19693e519524SHoward Hinnant 19703e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19723e519524SHoward Hinnant_OutputIterator 19733e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19743e519524SHoward Hinnant{ 19753e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 19763e519524SHoward Hinnant return _STD::unique_copy(__first, __last, __result, __equal_to<__v>()); 19773e519524SHoward Hinnant} 19783e519524SHoward Hinnant 19793e519524SHoward Hinnant// reverse 19803e519524SHoward Hinnant 19813e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 19823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19833e519524SHoward Hinnantvoid 19843e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 19853e519524SHoward Hinnant{ 19863e519524SHoward Hinnant while (__first != __last) 19873e519524SHoward Hinnant { 19883e519524SHoward Hinnant if (__first == --__last) 19893e519524SHoward Hinnant break; 19903e519524SHoward Hinnant swap(*__first, *__last); 19913e519524SHoward Hinnant ++__first; 19923e519524SHoward Hinnant } 19933e519524SHoward Hinnant} 19943e519524SHoward Hinnant 19953e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 19963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19973e519524SHoward Hinnantvoid 19983e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 19993e519524SHoward Hinnant{ 20003e519524SHoward Hinnant if (__first != __last) 20013e519524SHoward Hinnant for (; __first < --__last; ++__first) 20023e519524SHoward Hinnant swap(*__first, *__last); 20033e519524SHoward Hinnant} 20043e519524SHoward Hinnant 20053e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 20063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20073e519524SHoward Hinnantvoid 20083e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 20093e519524SHoward Hinnant{ 20103e519524SHoward Hinnant _STD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 20113e519524SHoward Hinnant} 20123e519524SHoward Hinnant 20133e519524SHoward Hinnant// reverse_copy 20143e519524SHoward Hinnant 20153e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 20163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20173e519524SHoward Hinnant_OutputIterator 20183e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 20193e519524SHoward Hinnant{ 20203e519524SHoward Hinnant for (; __first != __last; ++__result) 20213e519524SHoward Hinnant *__result = *--__last; 20223e519524SHoward Hinnant return __result; 20233e519524SHoward Hinnant} 20243e519524SHoward Hinnant 20253e519524SHoward Hinnant// rotate 20263e519524SHoward Hinnant 20273e519524SHoward Hinnanttemplate <class _ForwardIterator> 20283e519524SHoward Hinnant_ForwardIterator 20293e519524SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, false_type) 20303e519524SHoward Hinnant{ 20313e519524SHoward Hinnant if (__first == __middle) 20323e519524SHoward Hinnant return __last; 20333e519524SHoward Hinnant if (__middle == __last) 20343e519524SHoward Hinnant return __first; 20353e519524SHoward Hinnant _ForwardIterator __i = __middle; 20363e519524SHoward Hinnant while (true) 20373e519524SHoward Hinnant { 20383e519524SHoward Hinnant swap(*__first, *__i); 20393e519524SHoward Hinnant ++__first; 20403e519524SHoward Hinnant if (++__i == __last) 20413e519524SHoward Hinnant break; 20423e519524SHoward Hinnant if (__first == __middle) 20433e519524SHoward Hinnant __middle = __i; 20443e519524SHoward Hinnant } 20453e519524SHoward Hinnant _ForwardIterator __r = __first; 20463e519524SHoward Hinnant if (__first != __middle) 20473e519524SHoward Hinnant { 20483e519524SHoward Hinnant __i = __middle; 20493e519524SHoward Hinnant while (true) 20503e519524SHoward Hinnant { 20513e519524SHoward Hinnant swap(*__first, *__i); 20523e519524SHoward Hinnant ++__first; 20533e519524SHoward Hinnant if (++__i == __last) 20543e519524SHoward Hinnant { 20553e519524SHoward Hinnant if (__first == __middle) 20563e519524SHoward Hinnant break; 20573e519524SHoward Hinnant __i = __middle; 20583e519524SHoward Hinnant } 20593e519524SHoward Hinnant else if (__first == __middle) 20603e519524SHoward Hinnant __middle = __i; 20613e519524SHoward Hinnant } 20623e519524SHoward Hinnant } 20633e519524SHoward Hinnant return __r; 20643e519524SHoward Hinnant} 20653e519524SHoward Hinnant 20663e519524SHoward Hinnanttemplate<typename _Integral> 20673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20683e519524SHoward Hinnant_Integral 20693e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 20703e519524SHoward Hinnant{ 20713e519524SHoward Hinnant do 20723e519524SHoward Hinnant { 20733e519524SHoward Hinnant _Integral __t = __x % __y; 20743e519524SHoward Hinnant __x = __y; 20753e519524SHoward Hinnant __y = __t; 20763e519524SHoward Hinnant } while (__y); 20773e519524SHoward Hinnant return __x; 20783e519524SHoward Hinnant} 20793e519524SHoward Hinnant 20803e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 20813e519524SHoward Hinnant_RandomAccessIterator 20823e519524SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, true_type) 20833e519524SHoward Hinnant{ 20843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 20853e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 20863e519524SHoward Hinnant 20873e519524SHoward Hinnant if (__first == __middle) 20883e519524SHoward Hinnant return __last; 20893e519524SHoward Hinnant if (__middle == __last) 20903e519524SHoward Hinnant return __first; 20913e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 20923e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 20933e519524SHoward Hinnant if (__m1 == __m2) 20943e519524SHoward Hinnant { 20953e519524SHoward Hinnant _STD::swap_ranges(__first, __middle, __middle); 20963e519524SHoward Hinnant return __middle; 20973e519524SHoward Hinnant } 20983e519524SHoward Hinnant const difference_type __g = __gcd(__m1, __m2); 20993e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 21003e519524SHoward Hinnant { 21013e519524SHoward Hinnant value_type __t(*--__p); 21023e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 21033e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 21043e519524SHoward Hinnant do 21053e519524SHoward Hinnant { 21063e519524SHoward Hinnant *__p1 = *__p2; 21073e519524SHoward Hinnant __p1 = __p2; 21083e519524SHoward Hinnant const difference_type __d = __last - __p2; 21093e519524SHoward Hinnant if (__m1 < __d) 21103e519524SHoward Hinnant __p2 += __m1; 21113e519524SHoward Hinnant else 21123e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 21133e519524SHoward Hinnant } while (__p2 != __p); 21143e519524SHoward Hinnant *__p1 = __t; 21153e519524SHoward Hinnant } 21163e519524SHoward Hinnant return __first + __m2; 21173e519524SHoward Hinnant} 21183e519524SHoward Hinnant 21193e519524SHoward Hinnanttemplate <class _ForwardIterator> 21203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21213e519524SHoward Hinnant_ForwardIterator 21223e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 21233e519524SHoward Hinnant{ 21243e519524SHoward Hinnant return _STD::__rotate(__first, __middle, __last, 21253e519524SHoward Hinnant integral_constant 21263e519524SHoward Hinnant < 21273e519524SHoward Hinnant bool, 21283e519524SHoward Hinnant is_convertible 21293e519524SHoward Hinnant < 21303e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::iterator_category, 21313e519524SHoward Hinnant random_access_iterator_tag 21323e519524SHoward Hinnant >::value && 21333e519524SHoward Hinnant has_trivial_copy_assign 21343e519524SHoward Hinnant < 21353e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::value_type 21363e519524SHoward Hinnant >::value 21373e519524SHoward Hinnant >()); 21383e519524SHoward Hinnant} 21393e519524SHoward Hinnant 21403e519524SHoward Hinnant// rotate_copy 21413e519524SHoward Hinnant 21423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 21433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21443e519524SHoward Hinnant_OutputIterator 21453e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 21463e519524SHoward Hinnant{ 21473e519524SHoward Hinnant return _STD::copy(__first, __middle, _STD::copy(__middle, __last, __result)); 21483e519524SHoward Hinnant} 21493e519524SHoward Hinnant 21503e519524SHoward Hinnant// min 21513e519524SHoward Hinnant 21523e519524SHoward Hinnanttemplate <class _Tp, class _Compare> 21533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21543e519524SHoward Hinnantconst _Tp& 21553e519524SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 21563e519524SHoward Hinnant{ 21573e519524SHoward Hinnant return __comp(__b, __a) ? __b : __a; 21583e519524SHoward Hinnant} 21593e519524SHoward Hinnant 21603e519524SHoward Hinnanttemplate <class _Tp> 21613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21623e519524SHoward Hinnantconst _Tp& 21633e519524SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 21643e519524SHoward Hinnant{ 21653e519524SHoward Hinnant return _STD::min(__a, __b, __less<_Tp>()); 21663e519524SHoward Hinnant} 21673e519524SHoward Hinnant 21683e519524SHoward Hinnant// max 21693e519524SHoward Hinnant 21703e519524SHoward Hinnanttemplate <class _Tp, class _Compare> 21713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21723e519524SHoward Hinnantconst _Tp& 21733e519524SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 21743e519524SHoward Hinnant{ 21753e519524SHoward Hinnant return __comp(__a, __b) ? __b : __a; 21763e519524SHoward Hinnant} 21773e519524SHoward Hinnant 21783e519524SHoward Hinnanttemplate <class _Tp> 21793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21803e519524SHoward Hinnantconst _Tp& 21813e519524SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 21823e519524SHoward Hinnant{ 21833e519524SHoward Hinnant return _STD::max(__a, __b, __less<_Tp>()); 21843e519524SHoward Hinnant} 21853e519524SHoward Hinnant 21863e519524SHoward Hinnant// min_element 21873e519524SHoward Hinnant 21883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 21893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21903e519524SHoward Hinnant_ForwardIterator 21913e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 21923e519524SHoward Hinnant{ 21933e519524SHoward Hinnant if (__first != __last) 21943e519524SHoward Hinnant { 21953e519524SHoward Hinnant _ForwardIterator __i = __first; 21963e519524SHoward Hinnant while (++__i != __last) 21973e519524SHoward Hinnant if (__comp(*__i, *__first)) 21983e519524SHoward Hinnant __first = __i; 21993e519524SHoward Hinnant } 22003e519524SHoward Hinnant return __first; 22013e519524SHoward Hinnant} 22023e519524SHoward Hinnant 22033e519524SHoward Hinnanttemplate <class _ForwardIterator> 22043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22053e519524SHoward Hinnant_ForwardIterator 22063e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 22073e519524SHoward Hinnant{ 22083e519524SHoward Hinnant return _STD::min_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22093e519524SHoward Hinnant} 22103e519524SHoward Hinnant 22113e519524SHoward Hinnant// max_element 22123e519524SHoward Hinnant 22133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 22143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22153e519524SHoward Hinnant_ForwardIterator 22163e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 22173e519524SHoward Hinnant{ 22183e519524SHoward Hinnant if (__first != __last) 22193e519524SHoward Hinnant { 22203e519524SHoward Hinnant _ForwardIterator __i = __first; 22213e519524SHoward Hinnant while (++__i != __last) 22223e519524SHoward Hinnant if (__comp(*__first, *__i)) 22233e519524SHoward Hinnant __first = __i; 22243e519524SHoward Hinnant } 22253e519524SHoward Hinnant return __first; 22263e519524SHoward Hinnant} 22273e519524SHoward Hinnant 22283e519524SHoward Hinnanttemplate <class _ForwardIterator> 22293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22303e519524SHoward Hinnant_ForwardIterator 22313e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 22323e519524SHoward Hinnant{ 22333e519524SHoward Hinnant return _STD::max_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22343e519524SHoward Hinnant} 22353e519524SHoward Hinnant 22363e519524SHoward Hinnant// minmax_element 22373e519524SHoward Hinnant 22383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 22393e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 22403e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 22413e519524SHoward Hinnant{ 22423e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 22433e519524SHoward Hinnant if (__first != __last) 22443e519524SHoward Hinnant { 22453e519524SHoward Hinnant if (++__first != __last) 22463e519524SHoward Hinnant { 22473e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 22483e519524SHoward Hinnant { 22493e519524SHoward Hinnant __result.second = __result.first; 22503e519524SHoward Hinnant __result.first = __first; 22513e519524SHoward Hinnant } 22523e519524SHoward Hinnant else 22533e519524SHoward Hinnant __result.second = __first; 22543e519524SHoward Hinnant while (++__first != __last) 22553e519524SHoward Hinnant { 22563e519524SHoward Hinnant _ForwardIterator __i = __first; 22573e519524SHoward Hinnant if (++__first == __last) 22583e519524SHoward Hinnant { 22593e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 22603e519524SHoward Hinnant __result.first = __i; 22613e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 22623e519524SHoward Hinnant __result.second = __i; 22633e519524SHoward Hinnant break; 22643e519524SHoward Hinnant } 22653e519524SHoward Hinnant else 22663e519524SHoward Hinnant { 22673e519524SHoward Hinnant if (__comp(*__first, *__i)) 22683e519524SHoward Hinnant { 22693e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 22703e519524SHoward Hinnant __result.first = __first; 22713e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 22723e519524SHoward Hinnant __result.second = __i; 22733e519524SHoward Hinnant } 22743e519524SHoward Hinnant else 22753e519524SHoward Hinnant { 22763e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 22773e519524SHoward Hinnant __result.first = __i; 22783e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 22793e519524SHoward Hinnant __result.second = __first; 22803e519524SHoward Hinnant } 22813e519524SHoward Hinnant } 22823e519524SHoward Hinnant } 22833e519524SHoward Hinnant } 22843e519524SHoward Hinnant } 22853e519524SHoward Hinnant return __result; 22863e519524SHoward Hinnant} 22873e519524SHoward Hinnant 22883e519524SHoward Hinnanttemplate <class _ForwardIterator> 22893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22903e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 22913e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 22923e519524SHoward Hinnant{ 22933e519524SHoward Hinnant return _STD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22943e519524SHoward Hinnant} 22953e519524SHoward Hinnant 22963e519524SHoward Hinnant// random_shuffle 22973e519524SHoward Hinnant 2298f9d540b0SHoward Hinnant// __independent_bits_engine 2299f9d540b0SHoward Hinnant 2300f9d540b0SHoward Hinnanttemplate <unsigned long long _X, size_t _R> 2301f9d540b0SHoward Hinnantstruct __log2_imp 23023e519524SHoward Hinnant{ 2303f9d540b0SHoward Hinnant static const size_t value = _X & ((unsigned long long)(1) << _R) ? _R 2304f9d540b0SHoward Hinnant : __log2_imp<_X, _R - 1>::value; 23053e519524SHoward Hinnant}; 23063e519524SHoward Hinnant 2307f9d540b0SHoward Hinnanttemplate <unsigned long long _X> 2308f9d540b0SHoward Hinnantstruct __log2_imp<_X, 0> 23093e519524SHoward Hinnant{ 2310f9d540b0SHoward Hinnant static const size_t value = 0; 23113e519524SHoward Hinnant}; 23123e519524SHoward Hinnant 2313f9d540b0SHoward Hinnanttemplate <size_t _R> 2314f9d540b0SHoward Hinnantstruct __log2_imp<0, _R> 23153e519524SHoward Hinnant{ 2316f9d540b0SHoward Hinnant static const size_t value = _R + 1; 23173e519524SHoward Hinnant}; 23183e519524SHoward Hinnant 2319f9d540b0SHoward Hinnanttemplate <class _UI, _UI _X> 2320f9d540b0SHoward Hinnantstruct __log2 23213e519524SHoward Hinnant{ 2322f9d540b0SHoward Hinnant static const size_t value = __log2_imp<_X, 2323f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 23243e519524SHoward Hinnant}; 23253e519524SHoward Hinnant 2326f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2327f9d540b0SHoward Hinnantclass __independent_bits_engine 23283e519524SHoward Hinnant{ 2329f9d540b0SHoward Hinnantpublic: 2330f9d540b0SHoward Hinnant // types 2331f9d540b0SHoward Hinnant typedef _UIntType result_type; 2332f9d540b0SHoward Hinnant 2333f9d540b0SHoward Hinnantprivate: 2334f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2335f9d540b0SHoward Hinnant typedef typename conditional 2336f9d540b0SHoward Hinnant < 2337f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2338f9d540b0SHoward Hinnant result_type, 2339f9d540b0SHoward Hinnant _Engine_result_type 2340f9d540b0SHoward Hinnant >::type _Working_result_type; 2341f9d540b0SHoward Hinnant 2342f9d540b0SHoward Hinnant _Engine& __e_; 2343f9d540b0SHoward Hinnant size_t __w_; 2344f9d540b0SHoward Hinnant size_t __w0_; 2345f9d540b0SHoward Hinnant size_t __n_; 2346f9d540b0SHoward Hinnant size_t __n0_; 2347f9d540b0SHoward Hinnant _Working_result_type __y0_; 2348f9d540b0SHoward Hinnant _Working_result_type __y1_; 2349f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2350f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2351f9d540b0SHoward Hinnant 2352f9d540b0SHoward Hinnant static const _Working_result_type _R = _Engine::_Max - _Engine::_Min 2353f9d540b0SHoward Hinnant + _Working_result_type(1); 2354f9d540b0SHoward Hinnant static const size_t __m = __log2<_Working_result_type, _R>::value; 2355f9d540b0SHoward Hinnant static const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2356f9d540b0SHoward Hinnant static const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2357f9d540b0SHoward Hinnant 2358f9d540b0SHoward Hinnantpublic: 2359f9d540b0SHoward Hinnant // constructors and seeding functions 2360f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2361f9d540b0SHoward Hinnant 2362f9d540b0SHoward Hinnant // generating functions 2363f9d540b0SHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _R != 0>());} 2364f9d540b0SHoward Hinnant 2365f9d540b0SHoward Hinnantprivate: 2366f9d540b0SHoward Hinnant result_type __eval(false_type); 2367f9d540b0SHoward Hinnant result_type __eval(true_type); 2368f9d540b0SHoward Hinnant}; 2369f9d540b0SHoward Hinnant 2370f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2371f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2372f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2373f9d540b0SHoward Hinnant : __e_(__e), 2374f9d540b0SHoward Hinnant __w_(__w) 2375f9d540b0SHoward Hinnant{ 2376f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2377f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2378f9d540b0SHoward Hinnant if (_R == 0) 2379f9d540b0SHoward Hinnant __y0_ = _R; 2380f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2381f9d540b0SHoward Hinnant __y0_ = (_R >> __w0_) << __w0_; 2382f9d540b0SHoward Hinnant else 2383f9d540b0SHoward Hinnant __y0_ = 0; 2384f9d540b0SHoward Hinnant if (_R - __y0_ > __y0_ / __n_) 2385f9d540b0SHoward Hinnant { 2386f9d540b0SHoward Hinnant ++__n_; 2387f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2388f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2389f9d540b0SHoward Hinnant __y0_ = (_R >> __w0_) << __w0_; 2390f9d540b0SHoward Hinnant else 2391f9d540b0SHoward Hinnant __y0_ = 0; 2392f9d540b0SHoward Hinnant } 2393f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2394f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2395f9d540b0SHoward Hinnant __y1_ = (_R >> (__w0_ + 1)) << (__w0_ + 1); 2396f9d540b0SHoward Hinnant else 2397f9d540b0SHoward Hinnant __y1_ = 0; 2398f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2399f9d540b0SHoward Hinnant _Engine_result_type(0); 2400f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2401f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2402f9d540b0SHoward Hinnant _Engine_result_type(~0); 24033e519524SHoward Hinnant} 24043e519524SHoward Hinnant 2405f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2406f9d540b0SHoward Hinnantinline 2407f9d540b0SHoward Hinnant_UIntType 2408f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 24093e519524SHoward Hinnant{ 2410f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 24113e519524SHoward Hinnant} 24123e519524SHoward Hinnant 2413f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2414f9d540b0SHoward Hinnant_UIntType 2415f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 24163e519524SHoward Hinnant{ 2417f9d540b0SHoward Hinnant result_type _S = 0; 2418f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2419f9d540b0SHoward Hinnant { 2420f9d540b0SHoward Hinnant _Engine_result_type __u; 24213e519524SHoward Hinnant do 2422f9d540b0SHoward Hinnant { 2423f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2424f9d540b0SHoward Hinnant } while (__u >= __y0_); 2425f9d540b0SHoward Hinnant if (__w0_ < _EDt) 2426f9d540b0SHoward Hinnant _S <<= __w0_; 2427f9d540b0SHoward Hinnant else 2428f9d540b0SHoward Hinnant _S = 0; 2429f9d540b0SHoward Hinnant _S += __u & __mask0_; 2430f9d540b0SHoward Hinnant } 2431f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2432f9d540b0SHoward Hinnant { 2433f9d540b0SHoward Hinnant _Engine_result_type __u; 2434f9d540b0SHoward Hinnant do 2435f9d540b0SHoward Hinnant { 2436f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2437f9d540b0SHoward Hinnant } while (__u >= __y1_); 2438f9d540b0SHoward Hinnant if (__w0_ < _EDt - 1) 2439f9d540b0SHoward Hinnant _S <<= __w0_ + 1; 2440f9d540b0SHoward Hinnant else 2441f9d540b0SHoward Hinnant _S = 0; 2442f9d540b0SHoward Hinnant _S += __u & __mask1_; 2443f9d540b0SHoward Hinnant } 2444f9d540b0SHoward Hinnant return _S; 24453e519524SHoward Hinnant} 24463e519524SHoward Hinnant 2447f9d540b0SHoward Hinnant// uniform_int_distribution 24483e519524SHoward Hinnant 2449f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2450f9d540b0SHoward Hinnantclass uniform_int_distribution 24513e519524SHoward Hinnant{ 2452f9d540b0SHoward Hinnantpublic: 2453f9d540b0SHoward Hinnant // types 2454f9d540b0SHoward Hinnant typedef _IntType result_type; 2455f9d540b0SHoward Hinnant 2456f9d540b0SHoward Hinnant class param_type 2457f9d540b0SHoward Hinnant { 2458f9d540b0SHoward Hinnant result_type __a_; 2459f9d540b0SHoward Hinnant result_type __b_; 2460f9d540b0SHoward Hinnant public: 2461f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2462f9d540b0SHoward Hinnant 2463f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2464f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2465f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2466f9d540b0SHoward Hinnant 2467f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2468f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2469f9d540b0SHoward Hinnant 2470f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2471f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2472f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2473f9d540b0SHoward Hinnant {return !(__x == __y);} 24743e519524SHoward Hinnant }; 24753e519524SHoward Hinnant 2476f9d540b0SHoward Hinnantprivate: 2477f9d540b0SHoward Hinnant param_type __p_; 24783e519524SHoward Hinnant 2479f9d540b0SHoward Hinnantpublic: 2480f9d540b0SHoward Hinnant // constructors and reset functions 2481f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2482f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2483f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2484f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2485f9d540b0SHoward Hinnant void reset() {} 2486f9d540b0SHoward Hinnant 2487f9d540b0SHoward Hinnant // generating functions 2488f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2489f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2490f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2491f9d540b0SHoward Hinnant 2492f9d540b0SHoward Hinnant // property functions 2493f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2494f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2495f9d540b0SHoward Hinnant 2496f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2497f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2498f9d540b0SHoward Hinnant 2499f9d540b0SHoward Hinnant result_type min() const {return a();} 2500f9d540b0SHoward Hinnant result_type max() const {return b();} 2501f9d540b0SHoward Hinnant 2502f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2503f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2504f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2505f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2506f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2507f9d540b0SHoward Hinnant {return !(__x == __y);} 25083e519524SHoward Hinnant}; 25093e519524SHoward Hinnant 2510f9d540b0SHoward Hinnanttemplate<class _IntType> 2511f9d540b0SHoward Hinnanttemplate<class _URNG> 2512f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2513f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 25143e519524SHoward Hinnant{ 2515f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2516f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2517f9d540b0SHoward Hinnant const _UIntType _R = __p.b() - __p.a() + _UIntType(1); 2518f9d540b0SHoward Hinnant if (_R == 1) 2519f9d540b0SHoward Hinnant return __p.a(); 2520f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2521f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2522f9d540b0SHoward Hinnant if (_R == 0) 2523f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2524f9d540b0SHoward Hinnant size_t __w = _Dt - __clz(_R) - 1; 2525f9d540b0SHoward Hinnant if ((_R & (_UIntType(~0) >> (_Dt - __w))) != 0) 2526f9d540b0SHoward Hinnant ++__w; 2527f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2528f9d540b0SHoward Hinnant _UIntType __u; 2529f9d540b0SHoward Hinnant do 25303e519524SHoward Hinnant { 2531f9d540b0SHoward Hinnant __u = __e(); 2532f9d540b0SHoward Hinnant } while (__u >= _R); 2533f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 25343e519524SHoward Hinnant} 2535f9d540b0SHoward Hinnant 2536f9d540b0SHoward Hinnantclass __rs_default; 2537f9d540b0SHoward Hinnant 2538f9d540b0SHoward Hinnant__rs_default __rs_get(); 2539f9d540b0SHoward Hinnant 2540f9d540b0SHoward Hinnantclass __rs_default 25413e519524SHoward Hinnant{ 2542f9d540b0SHoward Hinnant static unsigned __c_; 2543f9d540b0SHoward Hinnant 2544f9d540b0SHoward Hinnant __rs_default(); 2545f9d540b0SHoward Hinnantpublic: 2546f9d540b0SHoward Hinnant typedef unsigned result_type; 2547f9d540b0SHoward Hinnant 2548f9d540b0SHoward Hinnant static const result_type _Min = 0; 2549f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2550f9d540b0SHoward Hinnant 2551f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2552f9d540b0SHoward Hinnant ~__rs_default(); 2553f9d540b0SHoward Hinnant 2554f9d540b0SHoward Hinnant result_type operator()(); 2555f9d540b0SHoward Hinnant 2556f9d540b0SHoward Hinnant static const/*expr*/ result_type min() {return _Min;} 2557f9d540b0SHoward Hinnant static const/*expr*/ result_type max() {return _Max;} 2558f9d540b0SHoward Hinnant 2559f9d540b0SHoward Hinnant friend __rs_default __rs_get(); 2560f9d540b0SHoward Hinnant}; 2561f9d540b0SHoward Hinnant 2562f9d540b0SHoward Hinnant__rs_default __rs_get(); 25633e519524SHoward Hinnant 25643e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 25653e519524SHoward Hinnantvoid 25663e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 25673e519524SHoward Hinnant{ 25683e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2569f9d540b0SHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _D; 2570f9d540b0SHoward Hinnant typedef typename _D::param_type _P; 25713e519524SHoward Hinnant difference_type __d = __last - __first; 25723e519524SHoward Hinnant if (__d > 1) 25733e519524SHoward Hinnant { 2574f9d540b0SHoward Hinnant _D __uid; 2575f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 2576f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2577f9d540b0SHoward Hinnant swap(*__first, *(__first + __uid(__g, _P(0, __d)))); 25783e519524SHoward Hinnant } 25793e519524SHoward Hinnant} 25803e519524SHoward Hinnant 25813e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 25823e519524SHoward Hinnantvoid 25833e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 25843e519524SHoward Hinnant#ifdef _LIBCPP_MOVE 25853e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 25863e519524SHoward Hinnant#else 25873e519524SHoward Hinnant _RandomNumberGenerator& __rand) 25883e519524SHoward Hinnant#endif 25893e519524SHoward Hinnant{ 25903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 25913e519524SHoward Hinnant difference_type __d = __last - __first; 25923e519524SHoward Hinnant if (__d > 1) 25933e519524SHoward Hinnant { 25943e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 25953e519524SHoward Hinnant swap(*__first, *(__first + __rand(__d))); 25963e519524SHoward Hinnant } 25973e519524SHoward Hinnant} 25983e519524SHoward Hinnant 2599f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 2600f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 2601f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 2602f9d540b0SHoward Hinnant{ 2603f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2604f9d540b0SHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _D; 2605f9d540b0SHoward Hinnant typedef typename _D::param_type _P; 2606f9d540b0SHoward Hinnant difference_type __d = __last - __first; 2607f9d540b0SHoward Hinnant if (__d > 1) 2608f9d540b0SHoward Hinnant { 2609f9d540b0SHoward Hinnant _D __uid; 2610f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2611f9d540b0SHoward Hinnant swap(*__first, *(__first + __uid(__g, _P(0, __d)))); 2612f9d540b0SHoward Hinnant } 2613f9d540b0SHoward Hinnant} 2614f9d540b0SHoward Hinnant 26153e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 26163e519524SHoward Hinnantbool 26173e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 26183e519524SHoward Hinnant{ 26193e519524SHoward Hinnant for (; __first != __last; ++__first) 26203e519524SHoward Hinnant if (!__pred(*__first)) 26213e519524SHoward Hinnant break; 26223e519524SHoward Hinnant for (; __first != __last; ++__first) 26233e519524SHoward Hinnant if (__pred(*__first)) 26243e519524SHoward Hinnant return false; 26253e519524SHoward Hinnant return true; 26263e519524SHoward Hinnant} 26273e519524SHoward Hinnant 26283e519524SHoward Hinnant// partition 26293e519524SHoward Hinnant 26303e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 26313e519524SHoward Hinnant_ForwardIterator 26323e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 26333e519524SHoward Hinnant{ 26343e519524SHoward Hinnant while (true) 26353e519524SHoward Hinnant { 26363e519524SHoward Hinnant if (__first == __last) 26373e519524SHoward Hinnant return __first; 26383e519524SHoward Hinnant if (!__pred(*__first)) 26393e519524SHoward Hinnant break; 26403e519524SHoward Hinnant ++__first; 26413e519524SHoward Hinnant } 26423e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 26433e519524SHoward Hinnant { 26443e519524SHoward Hinnant if (__pred(*__p)) 26453e519524SHoward Hinnant { 26463e519524SHoward Hinnant swap(*__first, *__p); 26473e519524SHoward Hinnant ++__first; 26483e519524SHoward Hinnant } 26493e519524SHoward Hinnant } 26503e519524SHoward Hinnant return __first; 26513e519524SHoward Hinnant} 26523e519524SHoward Hinnant 26533e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 26543e519524SHoward Hinnant_BidirectionalIterator 26553e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 26563e519524SHoward Hinnant bidirectional_iterator_tag) 26573e519524SHoward Hinnant{ 26583e519524SHoward Hinnant while (true) 26593e519524SHoward Hinnant { 26603e519524SHoward Hinnant while (true) 26613e519524SHoward Hinnant { 26623e519524SHoward Hinnant if (__first == __last) 26633e519524SHoward Hinnant return __first; 26643e519524SHoward Hinnant if (!__pred(*__first)) 26653e519524SHoward Hinnant break; 26663e519524SHoward Hinnant ++__first; 26673e519524SHoward Hinnant } 26683e519524SHoward Hinnant do 26693e519524SHoward Hinnant { 26703e519524SHoward Hinnant if (__first == --__last) 26713e519524SHoward Hinnant return __first; 26723e519524SHoward Hinnant } while (!__pred(*__last)); 26733e519524SHoward Hinnant swap(*__first, *__last); 26743e519524SHoward Hinnant ++__first; 26753e519524SHoward Hinnant } 26763e519524SHoward Hinnant} 26773e519524SHoward Hinnant 26783e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 26793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26803e519524SHoward Hinnant_ForwardIterator 26813e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 26823e519524SHoward Hinnant{ 26833e519524SHoward Hinnant return _STD::__partition<typename add_lvalue_reference<_Predicate>::type> 26843e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 26853e519524SHoward Hinnant} 26863e519524SHoward Hinnant 26873e519524SHoward Hinnant// partition_copy 26883e519524SHoward Hinnant 26893e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 26903e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 26913e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 26923e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 26933e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 26943e519524SHoward Hinnant _Predicate __pred) 26953e519524SHoward Hinnant{ 26963e519524SHoward Hinnant for (; __first != __last; ++__first) 26973e519524SHoward Hinnant { 26983e519524SHoward Hinnant if (__pred(*__first)) 26993e519524SHoward Hinnant { 27003e519524SHoward Hinnant *__out_true = *__first; 27013e519524SHoward Hinnant ++__out_true; 27023e519524SHoward Hinnant } 27033e519524SHoward Hinnant else 27043e519524SHoward Hinnant { 27053e519524SHoward Hinnant *__out_false = *__first; 27063e519524SHoward Hinnant ++__out_false; 27073e519524SHoward Hinnant } 27083e519524SHoward Hinnant } 27093e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 27103e519524SHoward Hinnant} 27113e519524SHoward Hinnant 27123e519524SHoward Hinnant// partition_point 27133e519524SHoward Hinnant 27143e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 27153e519524SHoward Hinnant_ForwardIterator 27163e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 27173e519524SHoward Hinnant{ 27183e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 27193e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 27203e519524SHoward Hinnant while (__len != 0) 27213e519524SHoward Hinnant { 27223e519524SHoward Hinnant difference_type __l2 = __len / 2; 27233e519524SHoward Hinnant _ForwardIterator __m = __first; 27243e519524SHoward Hinnant _STD::advance(__m, __l2); 27253e519524SHoward Hinnant if (__pred(*__m)) 27263e519524SHoward Hinnant { 27273e519524SHoward Hinnant __first = ++__m; 27283e519524SHoward Hinnant __len -= __l2 + 1; 27293e519524SHoward Hinnant } 27303e519524SHoward Hinnant else 27313e519524SHoward Hinnant __len = __l2; 27323e519524SHoward Hinnant } 27333e519524SHoward Hinnant return __first; 27343e519524SHoward Hinnant} 27353e519524SHoward Hinnant 27363e519524SHoward Hinnant// stable_partition 27373e519524SHoward Hinnant 27383e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 27393e519524SHoward Hinnant_ForwardIterator 27403e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 27413e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 27423e519524SHoward Hinnant{ 27433e519524SHoward Hinnant // *__first is known to be false 27443e519524SHoward Hinnant // __len >= 1 27453e519524SHoward Hinnant if (__len == 1) 27463e519524SHoward Hinnant return __first; 27473e519524SHoward Hinnant if (__len == 2) 27483e519524SHoward Hinnant { 27493e519524SHoward Hinnant _ForwardIterator __m = __first; 27503e519524SHoward Hinnant if (__pred(*++__m)) 27513e519524SHoward Hinnant { 27523e519524SHoward Hinnant swap(*__first, *__m); 27533e519524SHoward Hinnant return __m; 27543e519524SHoward Hinnant } 27553e519524SHoward Hinnant return __first; 27563e519524SHoward Hinnant } 27573e519524SHoward Hinnant if (__len <= __p.second) 27583e519524SHoward Hinnant { // The buffer is big enough to use 27593e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 27603e519524SHoward Hinnant __destruct_n __d(0); 27613e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 27623e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 27633e519524SHoward Hinnant // Update __first to always point to the end of the trues 27643e519524SHoward Hinnant value_type* __t = __p.first; 27653e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__first)); 27663e519524SHoward Hinnant __d.__incr((value_type*)0); 27673e519524SHoward Hinnant ++__t; 27683e519524SHoward Hinnant _ForwardIterator __i = __first; 27693e519524SHoward Hinnant while (++__i != __last) 27703e519524SHoward Hinnant { 27713e519524SHoward Hinnant if (__pred(*__i)) 27723e519524SHoward Hinnant { 27733e519524SHoward Hinnant *__first = _STD::move(*__i); 27743e519524SHoward Hinnant ++__first; 27753e519524SHoward Hinnant } 27763e519524SHoward Hinnant else 27773e519524SHoward Hinnant { 27783e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__i)); 27793e519524SHoward Hinnant __d.__incr((value_type*)0); 27803e519524SHoward Hinnant ++__t; 27813e519524SHoward Hinnant } 27823e519524SHoward Hinnant } 27833e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 27843e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 27853e519524SHoward Hinnant __i = __first; 27863e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 27873e519524SHoward Hinnant *__i = _STD::move(*__t2); 27883e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 27893e519524SHoward Hinnant return __first; 27903e519524SHoward Hinnant } 27913e519524SHoward Hinnant // Else not enough buffer, do in place 27923e519524SHoward Hinnant // __len >= 3 27933e519524SHoward Hinnant _ForwardIterator __m = __first; 27943e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 27953e519524SHoward Hinnant _STD::advance(__m, __len2); 27963e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 27973e519524SHoward Hinnant // F????????????????? 27983e519524SHoward Hinnant // f m l 27993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 28003e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 28013e519524SHoward Hinnant // TTTFFFFF?????????? 28023e519524SHoward Hinnant // f ff m l 28033e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 28043e519524SHoward Hinnant _ForwardIterator __m1 = __m; 28053e519524SHoward Hinnant _ForwardIterator __second_false = __last; 28063e519524SHoward Hinnant _Distance __len_half = __len - __len2; 28073e519524SHoward Hinnant while (__pred(*__m1)) 28083e519524SHoward Hinnant { 28093e519524SHoward Hinnant if (++__m1 == __last) 28103e519524SHoward Hinnant goto __second_half_done; 28113e519524SHoward Hinnant --__len_half; 28123e519524SHoward Hinnant } 28133e519524SHoward Hinnant // TTTFFFFFTTTF?????? 28143e519524SHoward Hinnant // f ff m m1 l 28153e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 28163e519524SHoward Hinnant__second_half_done: 28173e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 28183e519524SHoward Hinnant // f ff m sf l 28193e519524SHoward Hinnant return _STD::rotate(__first_false, __m, __second_false); 28203e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 28213e519524SHoward Hinnant // | 28223e519524SHoward Hinnant} 28233e519524SHoward Hinnant 28243e519524SHoward Hinnantstruct __return_temporary_buffer 28253e519524SHoward Hinnant{ 28263e519524SHoward Hinnant template <class _Tp> 28273e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_STD::return_temporary_buffer(__p);} 28283e519524SHoward Hinnant}; 28293e519524SHoward Hinnant 28303e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 28313e519524SHoward Hinnant_ForwardIterator 28323e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 28333e519524SHoward Hinnant forward_iterator_tag) 28343e519524SHoward Hinnant{ 28353e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 28363e519524SHoward Hinnant // Either prove all true and return __first or point to first false 28373e519524SHoward Hinnant while (true) 28383e519524SHoward Hinnant { 28393e519524SHoward Hinnant if (__first == __last) 28403e519524SHoward Hinnant return __first; 28413e519524SHoward Hinnant if (!__pred(*__first)) 28423e519524SHoward Hinnant break; 28433e519524SHoward Hinnant ++__first; 28443e519524SHoward Hinnant } 28453e519524SHoward Hinnant // We now have a reduced range [__first, __last) 28463e519524SHoward Hinnant // *__first is known to be false 28473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 28483e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 28493e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 28503e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 28513e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 28523e519524SHoward Hinnant if (__len >= __alloc_limit) 28533e519524SHoward Hinnant { 28543e519524SHoward Hinnant __p = _STD::get_temporary_buffer<value_type>(__len); 28553e519524SHoward Hinnant __h.reset(__p.first); 28563e519524SHoward Hinnant } 28573e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 28583e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 28593e519524SHoward Hinnant} 28603e519524SHoward Hinnant 28613e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 28623e519524SHoward Hinnant_BidirectionalIterator 28633e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 28643e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 28653e519524SHoward Hinnant{ 28663e519524SHoward Hinnant // *__first is known to be false 28673e519524SHoward Hinnant // *__last is known to be true 28683e519524SHoward Hinnant // __len >= 2 28693e519524SHoward Hinnant if (__len == 2) 28703e519524SHoward Hinnant { 28713e519524SHoward Hinnant swap(*__first, *__last); 28723e519524SHoward Hinnant return __last; 28733e519524SHoward Hinnant } 28743e519524SHoward Hinnant if (__len == 3) 28753e519524SHoward Hinnant { 28763e519524SHoward Hinnant _BidirectionalIterator __m = __first; 28773e519524SHoward Hinnant if (__pred(*++__m)) 28783e519524SHoward Hinnant { 28793e519524SHoward Hinnant swap(*__first, *__m); 28803e519524SHoward Hinnant swap(*__m, *__last); 28813e519524SHoward Hinnant return __last; 28823e519524SHoward Hinnant } 28833e519524SHoward Hinnant swap(*__m, *__last); 28843e519524SHoward Hinnant swap(*__first, *__m); 28853e519524SHoward Hinnant return __m; 28863e519524SHoward Hinnant } 28873e519524SHoward Hinnant if (__len <= __p.second) 28883e519524SHoward Hinnant { // The buffer is big enough to use 28893e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 28903e519524SHoward Hinnant __destruct_n __d(0); 28913e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 28923e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 28933e519524SHoward Hinnant // Update __first to always point to the end of the trues 28943e519524SHoward Hinnant value_type* __t = __p.first; 28953e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__first)); 28963e519524SHoward Hinnant __d.__incr((value_type*)0); 28973e519524SHoward Hinnant ++__t; 28983e519524SHoward Hinnant _BidirectionalIterator __i = __first; 28993e519524SHoward Hinnant while (++__i != __last) 29003e519524SHoward Hinnant { 29013e519524SHoward Hinnant if (__pred(*__i)) 29023e519524SHoward Hinnant { 29033e519524SHoward Hinnant *__first = _STD::move(*__i); 29043e519524SHoward Hinnant ++__first; 29053e519524SHoward Hinnant } 29063e519524SHoward Hinnant else 29073e519524SHoward Hinnant { 29083e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__i)); 29093e519524SHoward Hinnant __d.__incr((value_type*)0); 29103e519524SHoward Hinnant ++__t; 29113e519524SHoward Hinnant } 29123e519524SHoward Hinnant } 29133e519524SHoward Hinnant // move *__last, known to be true 29143e519524SHoward Hinnant *__first = _STD::move(*__i); 29153e519524SHoward Hinnant __i = ++__first; 29163e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 29173e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 29183e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 29193e519524SHoward Hinnant *__i = _STD::move(*__t2); 29203e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 29213e519524SHoward Hinnant return __first; 29223e519524SHoward Hinnant } 29233e519524SHoward Hinnant // Else not enough buffer, do in place 29243e519524SHoward Hinnant // __len >= 4 29253e519524SHoward Hinnant _BidirectionalIterator __m = __first; 29263e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 29273e519524SHoward Hinnant _STD::advance(__m, __len2); 29283e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 29293e519524SHoward Hinnant // F????????????????T 29303e519524SHoward Hinnant // f m l 29313e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 29323e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 29333e519524SHoward Hinnant _Distance __len_half = __len2; 29343e519524SHoward Hinnant while (!__pred(*--__m1)) 29353e519524SHoward Hinnant { 29363e519524SHoward Hinnant if (__m1 == __first) 29373e519524SHoward Hinnant goto __first_half_done; 29383e519524SHoward Hinnant --__len_half; 29393e519524SHoward Hinnant } 29403e519524SHoward Hinnant // F???TFFF?????????T 29413e519524SHoward Hinnant // f m1 m l 29423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 29433e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 29443e519524SHoward Hinnant__first_half_done: 29453e519524SHoward Hinnant // TTTFFFFF?????????T 29463e519524SHoward Hinnant // f ff m l 29473e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 29483e519524SHoward Hinnant __m1 = __m; 29493e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 29503e519524SHoward Hinnant ++__second_false; 29513e519524SHoward Hinnant __len_half = __len - __len2; 29523e519524SHoward Hinnant while (__pred(*__m1)) 29533e519524SHoward Hinnant { 29543e519524SHoward Hinnant if (++__m1 == __last) 29553e519524SHoward Hinnant goto __second_half_done; 29563e519524SHoward Hinnant --__len_half; 29573e519524SHoward Hinnant } 29583e519524SHoward Hinnant // TTTFFFFFTTTF?????T 29593e519524SHoward Hinnant // f ff m m1 l 29603e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 29613e519524SHoward Hinnant__second_half_done: 29623e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 29633e519524SHoward Hinnant // f ff m sf l 29643e519524SHoward Hinnant return _STD::rotate(__first_false, __m, __second_false); 29653e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 29663e519524SHoward Hinnant // | 29673e519524SHoward Hinnant} 29683e519524SHoward Hinnant 29693e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 29703e519524SHoward Hinnant_BidirectionalIterator 29713e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 29723e519524SHoward Hinnant bidirectional_iterator_tag) 29733e519524SHoward Hinnant{ 29743e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 29753e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 29763e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 29773e519524SHoward Hinnant // Either prove all true and return __first or point to first false 29783e519524SHoward Hinnant while (true) 29793e519524SHoward Hinnant { 29803e519524SHoward Hinnant if (__first == __last) 29813e519524SHoward Hinnant return __first; 29823e519524SHoward Hinnant if (!__pred(*__first)) 29833e519524SHoward Hinnant break; 29843e519524SHoward Hinnant ++__first; 29853e519524SHoward Hinnant } 29863e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 29873e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 29883e519524SHoward Hinnant do 29893e519524SHoward Hinnant { 29903e519524SHoward Hinnant if (__first == --__last) 29913e519524SHoward Hinnant return __first; 29923e519524SHoward Hinnant } while (!__pred(*__last)); 29933e519524SHoward Hinnant // We now have a reduced range [__first, __last] 29943e519524SHoward Hinnant // *__first is known to be false 29953e519524SHoward Hinnant // *__last is known to be true 29963e519524SHoward Hinnant // __len >= 2 29973e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last) + 1; 29983e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 29993e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 30003e519524SHoward Hinnant if (__len >= __alloc_limit) 30013e519524SHoward Hinnant { 30023e519524SHoward Hinnant __p = _STD::get_temporary_buffer<value_type>(__len); 30033e519524SHoward Hinnant __h.reset(__p.first); 30043e519524SHoward Hinnant } 30053e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 30063e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 30073e519524SHoward Hinnant} 30083e519524SHoward Hinnant 30093e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 30103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 30113e519524SHoward Hinnant_ForwardIterator 30123e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 30133e519524SHoward Hinnant{ 30143e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 30153e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 30163e519524SHoward Hinnant} 30173e519524SHoward Hinnant 30183e519524SHoward Hinnant// is_sorted_until 30193e519524SHoward Hinnant 30203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 30213e519524SHoward Hinnant_ForwardIterator 30223e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 30233e519524SHoward Hinnant{ 30243e519524SHoward Hinnant if (__first != __last) 30253e519524SHoward Hinnant { 30263e519524SHoward Hinnant _ForwardIterator __i = __first; 30273e519524SHoward Hinnant while (++__i != __last) 30283e519524SHoward Hinnant { 30293e519524SHoward Hinnant if (__comp(*__i, *__first)) 30303e519524SHoward Hinnant return __i; 30313e519524SHoward Hinnant __first = __i; 30323e519524SHoward Hinnant } 30333e519524SHoward Hinnant } 30343e519524SHoward Hinnant return __last; 30353e519524SHoward Hinnant} 30363e519524SHoward Hinnant 30373e519524SHoward Hinnanttemplate<class _ForwardIterator> 30383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 30393e519524SHoward Hinnant_ForwardIterator 30403e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 30413e519524SHoward Hinnant{ 30423e519524SHoward Hinnant return _STD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 30433e519524SHoward Hinnant} 30443e519524SHoward Hinnant 30453e519524SHoward Hinnant// is_sorted 30463e519524SHoward Hinnant 30473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 30483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 30493e519524SHoward Hinnantbool 30503e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 30513e519524SHoward Hinnant{ 30523e519524SHoward Hinnant return _STD::is_sorted_until(__first, __last, __comp) == __last; 30533e519524SHoward Hinnant} 30543e519524SHoward Hinnant 30553e519524SHoward Hinnanttemplate<class _ForwardIterator> 30563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 30573e519524SHoward Hinnantbool 30583e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 30593e519524SHoward Hinnant{ 30603e519524SHoward Hinnant return _STD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 30613e519524SHoward Hinnant} 30623e519524SHoward Hinnant 30633e519524SHoward Hinnant// sort 30643e519524SHoward Hinnant 30653e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 30663e519524SHoward Hinnant 30673e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 30683e519524SHoward Hinnantunsigned 30693e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 30703e519524SHoward Hinnant{ 30713e519524SHoward Hinnant unsigned __r = 0; 30723e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 30733e519524SHoward Hinnant { 30743e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 30753e519524SHoward Hinnant return __r; // x <= y && y <= z 30763e519524SHoward Hinnant // x <= y && y > z 30773e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 30783e519524SHoward Hinnant __r = 1; 30793e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 30803e519524SHoward Hinnant { 30813e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 30823e519524SHoward Hinnant __r = 2; 30833e519524SHoward Hinnant } 30843e519524SHoward Hinnant return __r; // x <= y && y < z 30853e519524SHoward Hinnant } 30863e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 30873e519524SHoward Hinnant { 30883e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 30893e519524SHoward Hinnant __r = 1; 30903e519524SHoward Hinnant return __r; 30913e519524SHoward Hinnant } 30923e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 30933e519524SHoward Hinnant __r = 1; // x < y && x <= z 30943e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 30953e519524SHoward Hinnant { 30963e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 30973e519524SHoward Hinnant __r = 2; 30983e519524SHoward Hinnant } 30993e519524SHoward Hinnant return __r; 31003e519524SHoward Hinnant} // x <= y && y <= z 31013e519524SHoward Hinnant 31023e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 31033e519524SHoward Hinnant 31043e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 31053e519524SHoward Hinnantunsigned 31063e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 31073e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 31083e519524SHoward Hinnant{ 31093e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 31103e519524SHoward Hinnant if (__c(*__x4, *__x3)) 31113e519524SHoward Hinnant { 31123e519524SHoward Hinnant swap(*__x3, *__x4); 31133e519524SHoward Hinnant ++__r; 31143e519524SHoward Hinnant if (__c(*__x3, *__x2)) 31153e519524SHoward Hinnant { 31163e519524SHoward Hinnant swap(*__x2, *__x3); 31173e519524SHoward Hinnant ++__r; 31183e519524SHoward Hinnant if (__c(*__x2, *__x1)) 31193e519524SHoward Hinnant { 31203e519524SHoward Hinnant swap(*__x1, *__x2); 31213e519524SHoward Hinnant ++__r; 31223e519524SHoward Hinnant } 31233e519524SHoward Hinnant } 31243e519524SHoward Hinnant } 31253e519524SHoward Hinnant return __r; 31263e519524SHoward Hinnant} 31273e519524SHoward Hinnant 31283e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 31293e519524SHoward Hinnant 31303e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 31313e519524SHoward Hinnantunsigned 31323e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 31333e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 31343e519524SHoward Hinnant{ 31353e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 31363e519524SHoward Hinnant if (__c(*__x5, *__x4)) 31373e519524SHoward Hinnant { 31383e519524SHoward Hinnant swap(*__x4, *__x5); 31393e519524SHoward Hinnant ++__r; 31403e519524SHoward Hinnant if (__c(*__x4, *__x3)) 31413e519524SHoward Hinnant { 31423e519524SHoward Hinnant swap(*__x3, *__x4); 31433e519524SHoward Hinnant ++__r; 31443e519524SHoward Hinnant if (__c(*__x3, *__x2)) 31453e519524SHoward Hinnant { 31463e519524SHoward Hinnant swap(*__x2, *__x3); 31473e519524SHoward Hinnant ++__r; 31483e519524SHoward Hinnant if (__c(*__x2, *__x1)) 31493e519524SHoward Hinnant { 31503e519524SHoward Hinnant swap(*__x1, *__x2); 31513e519524SHoward Hinnant ++__r; 31523e519524SHoward Hinnant } 31533e519524SHoward Hinnant } 31543e519524SHoward Hinnant } 31553e519524SHoward Hinnant } 31563e519524SHoward Hinnant return __r; 31573e519524SHoward Hinnant} 31583e519524SHoward Hinnant 31593e519524SHoward Hinnant// Assumes size > 0 31603e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 31613e519524SHoward Hinnantvoid 31623e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 31633e519524SHoward Hinnant{ 31643e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 31653e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 31663e519524SHoward Hinnant { 31673e519524SHoward Hinnant _BirdirectionalIterator __i = _STD::min_element<_BirdirectionalIterator, 31683e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 31693e519524SHoward Hinnant (__first, __last, __comp); 31703e519524SHoward Hinnant if (__i != __first) 31713e519524SHoward Hinnant swap(*__first, *__i); 31723e519524SHoward Hinnant } 31733e519524SHoward Hinnant} 31743e519524SHoward Hinnant 31753e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 31763e519524SHoward Hinnantvoid 31773e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 31783e519524SHoward Hinnant{ 31793e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 31803e519524SHoward Hinnant if (__first != __last) 31813e519524SHoward Hinnant { 31823e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 31833e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 31843e519524SHoward Hinnant { 31853e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 31863e519524SHoward Hinnant value_type __t(_STD::move(*__j)); 31873e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 31883e519524SHoward Hinnant *__j = _STD::move(*__k); 31893e519524SHoward Hinnant *__j = _STD::move(__t); 31903e519524SHoward Hinnant } 31913e519524SHoward Hinnant } 31923e519524SHoward Hinnant} 31933e519524SHoward Hinnant 31943e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 31953e519524SHoward Hinnantvoid 31963e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 31973e519524SHoward Hinnant{ 31983e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 31993e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 32003e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 32013e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 32023e519524SHoward Hinnant { 32033e519524SHoward Hinnant if (__comp(*__i, *__j)) 32043e519524SHoward Hinnant { 32053e519524SHoward Hinnant value_type __t(_STD::move(*__i)); 32063e519524SHoward Hinnant _RandomAccessIterator __k = __j; 32073e519524SHoward Hinnant __j = __i; 32083e519524SHoward Hinnant do 32093e519524SHoward Hinnant { 32103e519524SHoward Hinnant *__j = _STD::move(*__k); 32113e519524SHoward Hinnant __j = __k; 32123e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 32133e519524SHoward Hinnant *__j = _STD::move(__t); 32143e519524SHoward Hinnant } 32153e519524SHoward Hinnant __j = __i; 32163e519524SHoward Hinnant } 32173e519524SHoward Hinnant} 32183e519524SHoward Hinnant 32193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 32203e519524SHoward Hinnantbool 32213e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 32223e519524SHoward Hinnant{ 32233e519524SHoward Hinnant switch (__last - __first) 32243e519524SHoward Hinnant { 32253e519524SHoward Hinnant case 0: 32263e519524SHoward Hinnant case 1: 32273e519524SHoward Hinnant return true; 32283e519524SHoward Hinnant case 2: 32293e519524SHoward Hinnant if (__comp(*--__last, *__first)) 32303e519524SHoward Hinnant swap(*__first, *__last); 32313e519524SHoward Hinnant return true; 32323e519524SHoward Hinnant case 3: 32333e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 32343e519524SHoward Hinnant return true; 32353e519524SHoward Hinnant case 4: 32363e519524SHoward Hinnant _STD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 32373e519524SHoward Hinnant return true; 32383e519524SHoward Hinnant case 5: 32393e519524SHoward Hinnant _STD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 32403e519524SHoward Hinnant return true; 32413e519524SHoward Hinnant } 32423e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 32433e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 32443e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 32453e519524SHoward Hinnant const unsigned __limit = 8; 32463e519524SHoward Hinnant unsigned __count = 0; 32473e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 32483e519524SHoward Hinnant { 32493e519524SHoward Hinnant if (__comp(*__i, *__j)) 32503e519524SHoward Hinnant { 32513e519524SHoward Hinnant value_type __t(_STD::move(*__i)); 32523e519524SHoward Hinnant _RandomAccessIterator __k = __j; 32533e519524SHoward Hinnant __j = __i; 32543e519524SHoward Hinnant do 32553e519524SHoward Hinnant { 32563e519524SHoward Hinnant *__j = _STD::move(*__k); 32573e519524SHoward Hinnant __j = __k; 32583e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 32593e519524SHoward Hinnant *__j = _STD::move(__t); 32603e519524SHoward Hinnant if (++__count == __limit) 32613e519524SHoward Hinnant return ++__i == __last; 32623e519524SHoward Hinnant } 32633e519524SHoward Hinnant __j = __i; 32643e519524SHoward Hinnant } 32653e519524SHoward Hinnant return true; 32663e519524SHoward Hinnant} 32673e519524SHoward Hinnant 32683e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 32693e519524SHoward Hinnantvoid 32703e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 32713e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 32723e519524SHoward Hinnant{ 32733e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 32743e519524SHoward Hinnant if (__first1 != __last1) 32753e519524SHoward Hinnant { 32763e519524SHoward Hinnant __destruct_n __d(0); 32773e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 32783e519524SHoward Hinnant value_type* __last2 = __first2; 32793e519524SHoward Hinnant ::new(__last2) value_type(_STD::move(*__first1)); 32803e519524SHoward Hinnant __d.__incr((value_type*)0); 32813e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 32823e519524SHoward Hinnant { 32833e519524SHoward Hinnant value_type* __j2 = __last2; 32843e519524SHoward Hinnant value_type* __i2 = __j2; 32853e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 32863e519524SHoward Hinnant { 32873e519524SHoward Hinnant ::new(__j2) value_type(_STD::move(*__i2)); 32883e519524SHoward Hinnant __d.__incr((value_type*)0); 32893e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 32903e519524SHoward Hinnant *__j2 = _STD::move(*__i2); 32913e519524SHoward Hinnant *__j2 = _STD::move(*__first1); 32923e519524SHoward Hinnant } 32933e519524SHoward Hinnant else 32943e519524SHoward Hinnant { 32953e519524SHoward Hinnant ::new(__j2) value_type(_STD::move(*__first1)); 32963e519524SHoward Hinnant __d.__incr((value_type*)0); 32973e519524SHoward Hinnant } 32983e519524SHoward Hinnant } 32993e519524SHoward Hinnant __h.release(); 33003e519524SHoward Hinnant } 33013e519524SHoward Hinnant} 33023e519524SHoward Hinnant 33033e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 33043e519524SHoward Hinnantvoid 33053e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 33063e519524SHoward Hinnant{ 33073e519524SHoward Hinnant // _Compare is known to be a reference type 33083e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 33093e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 33103e519524SHoward Hinnant const difference_type __limit = has_trivial_copy_constructor<value_type>::value && 33113e519524SHoward Hinnant has_trivial_copy_assign<value_type>::value ? 30 : 6; 33123e519524SHoward Hinnant while (true) 33133e519524SHoward Hinnant { 33143e519524SHoward Hinnant __restart: 33153e519524SHoward Hinnant difference_type __len = __last - __first; 33163e519524SHoward Hinnant switch (__len) 33173e519524SHoward Hinnant { 33183e519524SHoward Hinnant case 0: 33193e519524SHoward Hinnant case 1: 33203e519524SHoward Hinnant return; 33213e519524SHoward Hinnant case 2: 33223e519524SHoward Hinnant if (__comp(*--__last, *__first)) 33233e519524SHoward Hinnant swap(*__first, *__last); 33243e519524SHoward Hinnant return; 33253e519524SHoward Hinnant case 3: 33263e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 33273e519524SHoward Hinnant return; 33283e519524SHoward Hinnant case 4: 33293e519524SHoward Hinnant _STD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 33303e519524SHoward Hinnant return; 33313e519524SHoward Hinnant case 5: 33323e519524SHoward Hinnant _STD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 33333e519524SHoward Hinnant return; 33343e519524SHoward Hinnant } 33353e519524SHoward Hinnant if (__len <= __limit) 33363e519524SHoward Hinnant { 33373e519524SHoward Hinnant _STD::__insertion_sort_3<_Compare>(__first, __last, __comp); 33383e519524SHoward Hinnant return; 33393e519524SHoward Hinnant } 33403e519524SHoward Hinnant // __len > 5 33413e519524SHoward Hinnant _RandomAccessIterator __m = __first; 33423e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 33433e519524SHoward Hinnant --__lm1; 33443e519524SHoward Hinnant unsigned __n_swaps; 33453e519524SHoward Hinnant { 33463e519524SHoward Hinnant difference_type __delta; 33473e519524SHoward Hinnant if (__len >= 1000) 33483e519524SHoward Hinnant { 33493e519524SHoward Hinnant __delta = __len/2; 33503e519524SHoward Hinnant __m += __delta; 33513e519524SHoward Hinnant __delta /= 2; 33523e519524SHoward Hinnant __n_swaps = _STD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 33533e519524SHoward Hinnant } 33543e519524SHoward Hinnant else 33553e519524SHoward Hinnant { 33563e519524SHoward Hinnant __delta = __len/2; 33573e519524SHoward Hinnant __m += __delta; 33583e519524SHoward Hinnant __n_swaps = _STD::__sort3<_Compare>(__first, __m, __lm1, __comp); 33593e519524SHoward Hinnant } 33603e519524SHoward Hinnant } 33613e519524SHoward Hinnant // *__m is median 33623e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 33633e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 33643e519524SHoward Hinnant _RandomAccessIterator __i = __first; 33653e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 33663e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 33673e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 33683e519524SHoward Hinnant // Prime the downward search with a guard. 33693e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 33703e519524SHoward Hinnant { 33713e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 33723e519524SHoward Hinnant // manually guard downward moving __j against __i 33733e519524SHoward Hinnant while (true) 33743e519524SHoward Hinnant { 33753e519524SHoward Hinnant if (__i == --__j) 33763e519524SHoward Hinnant { 33773e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 33783e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 33793e519524SHoward Hinnant ++__i; // __first + 1 33803e519524SHoward Hinnant __j = __last; 33813e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 33823e519524SHoward Hinnant { 33833e519524SHoward Hinnant while (true) 33843e519524SHoward Hinnant { 33853e519524SHoward Hinnant if (__i == __j) 33863e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 33873e519524SHoward Hinnant if (__comp(*__first, *__i)) 33883e519524SHoward Hinnant { 33893e519524SHoward Hinnant swap(*__i, *__j); 33903e519524SHoward Hinnant ++__n_swaps; 33913e519524SHoward Hinnant ++__i; 33923e519524SHoward Hinnant break; 33933e519524SHoward Hinnant } 33943e519524SHoward Hinnant ++__i; 33953e519524SHoward Hinnant } 33963e519524SHoward Hinnant } 33973e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 33983e519524SHoward Hinnant if (__i == __j) 33993e519524SHoward Hinnant return; 34003e519524SHoward Hinnant while (true) 34013e519524SHoward Hinnant { 34023e519524SHoward Hinnant while (!__comp(*__first, *__i)) 34033e519524SHoward Hinnant ++__i; 34043e519524SHoward Hinnant while (__comp(*__first, *--__j)) 34053e519524SHoward Hinnant ; 34063e519524SHoward Hinnant if (__i >= __j) 34073e519524SHoward Hinnant break; 34083e519524SHoward Hinnant swap(*__i, *__j); 34093e519524SHoward Hinnant ++__n_swaps; 34103e519524SHoward Hinnant ++__i; 34113e519524SHoward Hinnant } 34123e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 34133e519524SHoward Hinnant // The first part is sorted, sort the secod part 34143e519524SHoward Hinnant // _STD::__sort<_Compare>(__i, __last, __comp); 34153e519524SHoward Hinnant __first = __i; 34163e519524SHoward Hinnant goto __restart; 34173e519524SHoward Hinnant } 34183e519524SHoward Hinnant if (__comp(*__j, *__m)) 34193e519524SHoward Hinnant { 34203e519524SHoward Hinnant swap(*__i, *__j); 34213e519524SHoward Hinnant ++__n_swaps; 34223e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 34233e519524SHoward Hinnant } 34243e519524SHoward Hinnant } 34253e519524SHoward Hinnant } 34263e519524SHoward Hinnant // It is known that *__i < *__m 34273e519524SHoward Hinnant ++__i; 34283e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 34293e519524SHoward Hinnant // if not yet partitioned... 34303e519524SHoward Hinnant if (__i < __j) 34313e519524SHoward Hinnant { 34323e519524SHoward Hinnant // known that *(__i - 1) < *__m 34333e519524SHoward Hinnant // known that __i <= __m 34343e519524SHoward Hinnant while (true) 34353e519524SHoward Hinnant { 34363e519524SHoward Hinnant // __m still guards upward moving __i 34373e519524SHoward Hinnant while (__comp(*__i, *__m)) 34383e519524SHoward Hinnant ++__i; 34393e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 34403e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 34413e519524SHoward Hinnant ; 34423e519524SHoward Hinnant if (__i > __j) 34433e519524SHoward Hinnant break; 34443e519524SHoward Hinnant swap(*__i, *__j); 34453e519524SHoward Hinnant ++__n_swaps; 34463e519524SHoward Hinnant // It is known that __m != __j 34473e519524SHoward Hinnant // If __m just moved, follow it 34483e519524SHoward Hinnant if (__m == __i) 34493e519524SHoward Hinnant __m = __j; 34503e519524SHoward Hinnant ++__i; 34513e519524SHoward Hinnant } 34523e519524SHoward Hinnant } 34533e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 34543e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 34553e519524SHoward Hinnant { 34563e519524SHoward Hinnant swap(*__i, *__m); 34573e519524SHoward Hinnant ++__n_swaps; 34583e519524SHoward Hinnant } 34593e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 34603e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 34613e519524SHoward Hinnant if (__n_swaps == 0) 34623e519524SHoward Hinnant { 34633e519524SHoward Hinnant bool __fs = _STD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 34643e519524SHoward Hinnant if (_STD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 34653e519524SHoward Hinnant { 34663e519524SHoward Hinnant if (__fs) 34673e519524SHoward Hinnant return; 34683e519524SHoward Hinnant __last = __i; 34693e519524SHoward Hinnant continue; 34703e519524SHoward Hinnant } 34713e519524SHoward Hinnant else 34723e519524SHoward Hinnant { 34733e519524SHoward Hinnant if (__fs) 34743e519524SHoward Hinnant { 34753e519524SHoward Hinnant __first = ++__i; 34763e519524SHoward Hinnant continue; 34773e519524SHoward Hinnant } 34783e519524SHoward Hinnant } 34793e519524SHoward Hinnant } 34803e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 34813e519524SHoward Hinnant if (__i - __first < __last - __i) 34823e519524SHoward Hinnant { 34833e519524SHoward Hinnant _STD::__sort<_Compare>(__first, __i, __comp); 34843e519524SHoward Hinnant // _STD::__sort<_Compare>(__i+1, __last, __comp); 34853e519524SHoward Hinnant __first = ++__i; 34863e519524SHoward Hinnant } 34873e519524SHoward Hinnant else 34883e519524SHoward Hinnant { 34893e519524SHoward Hinnant _STD::__sort<_Compare>(__i+1, __last, __comp); 34903e519524SHoward Hinnant // _STD::__sort<_Compare>(__first, __i, __comp); 34913e519524SHoward Hinnant __last = __i; 34923e519524SHoward Hinnant } 34933e519524SHoward Hinnant } 34943e519524SHoward Hinnant} 34953e519524SHoward Hinnant 34963e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 34973e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 34983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34993e519524SHoward Hinnantvoid 35003e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 35013e519524SHoward Hinnant{ 35023e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 35033e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 35043e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 35053e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 35063e519524SHoward Hinnant#else 35073e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 35083e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 35093e519524SHoward Hinnant#endif 35103e519524SHoward Hinnant} 35113e519524SHoward Hinnant 35123e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 35133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35143e519524SHoward Hinnantvoid 35153e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 35163e519524SHoward Hinnant{ 35173e519524SHoward Hinnant _STD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 35183e519524SHoward Hinnant} 35193e519524SHoward Hinnant 35203e519524SHoward Hinnanttemplate <class _Tp> 35213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35223e519524SHoward Hinnantvoid 35233e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 35243e519524SHoward Hinnant{ 35253e519524SHoward Hinnant _STD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 35263e519524SHoward Hinnant} 35273e519524SHoward Hinnant 35283e519524SHoward Hinnanttemplate <class _Tp> 35293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35303e519524SHoward Hinnantvoid 35313e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 35323e519524SHoward Hinnant{ 35333e519524SHoward Hinnant _STD::sort(__first.base(), __last.base()); 35343e519524SHoward Hinnant} 35353e519524SHoward Hinnant 35363e519524SHoward Hinnantextern template void __sort<__less<char>&, char*>(char*, char*, __less<char>&); 35373e519524SHoward Hinnantextern template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 35383e519524SHoward Hinnantextern template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 35393e519524SHoward Hinnantextern template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 35403e519524SHoward Hinnantextern template void __sort<__less<short>&, short*>(short*, short*, __less<short>&); 35413e519524SHoward Hinnantextern template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 35423e519524SHoward Hinnantextern template void __sort<__less<int>&, int*>(int*, int*, __less<int>&); 35433e519524SHoward Hinnantextern template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 35443e519524SHoward Hinnantextern template void __sort<__less<long>&, long*>(long*, long*, __less<long>&); 35453e519524SHoward Hinnantextern template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 35463e519524SHoward Hinnantextern template void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 35473e519524SHoward Hinnantextern template void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 35483e519524SHoward Hinnantextern template void __sort<__less<float>&, float*>(float*, float*, __less<float>&); 35493e519524SHoward Hinnantextern template void __sort<__less<double>&, double*>(double*, double*, __less<double>&); 35503e519524SHoward Hinnantextern template void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 35513e519524SHoward Hinnant 35523e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&); 35533e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 35543e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 35553e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 35563e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&); 35573e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 35583e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&); 35593e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 35603e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&); 35613e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 35623e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 35633e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 35643e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&); 35653e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&); 35663e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 35673e519524SHoward Hinnant 35683e519524SHoward Hinnantextern template unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&); 35693e519524SHoward Hinnant 35703e519524SHoward Hinnant// lower_bound 35713e519524SHoward Hinnant 35723e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 35733e519524SHoward Hinnant_ForwardIterator 35743e519524SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 35753e519524SHoward Hinnant{ 35763e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 35773e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 35783e519524SHoward Hinnant while (__len != 0) 35793e519524SHoward Hinnant { 35803e519524SHoward Hinnant difference_type __l2 = __len / 2; 35813e519524SHoward Hinnant _ForwardIterator __m = __first; 35823e519524SHoward Hinnant _STD::advance(__m, __l2); 35833e519524SHoward Hinnant if (__comp(*__m, __value)) 35843e519524SHoward Hinnant { 35853e519524SHoward Hinnant __first = ++__m; 35863e519524SHoward Hinnant __len -= __l2 + 1; 35873e519524SHoward Hinnant } 35883e519524SHoward Hinnant else 35893e519524SHoward Hinnant __len = __l2; 35903e519524SHoward Hinnant } 35913e519524SHoward Hinnant return __first; 35923e519524SHoward Hinnant} 35933e519524SHoward Hinnant 35943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 35953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35963e519524SHoward Hinnant_ForwardIterator 35973e519524SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 35983e519524SHoward Hinnant{ 35993e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 36003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 36013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 36023e519524SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value, __c); 36033e519524SHoward Hinnant#else 36043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 36053e519524SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value, __comp); 36063e519524SHoward Hinnant#endif 36073e519524SHoward Hinnant} 36083e519524SHoward Hinnant 36093e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 36103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36113e519524SHoward Hinnant_ForwardIterator 36123e519524SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 36133e519524SHoward Hinnant{ 36143e519524SHoward Hinnant return _STD::lower_bound(__first, __last, __value, 36153e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 36163e519524SHoward Hinnant} 36173e519524SHoward Hinnant 36183e519524SHoward Hinnant// upper_bound 36193e519524SHoward Hinnant 36203e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 36213e519524SHoward Hinnant_ForwardIterator 36223e519524SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 36233e519524SHoward Hinnant{ 36243e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 36253e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 36263e519524SHoward Hinnant while (__len != 0) 36273e519524SHoward Hinnant { 36283e519524SHoward Hinnant difference_type __l2 = __len / 2; 36293e519524SHoward Hinnant _ForwardIterator __m = __first; 36303e519524SHoward Hinnant _STD::advance(__m, __l2); 36313e519524SHoward Hinnant if (__comp(__value, *__m)) 36323e519524SHoward Hinnant __len = __l2; 36333e519524SHoward Hinnant else 36343e519524SHoward Hinnant { 36353e519524SHoward Hinnant __first = ++__m; 36363e519524SHoward Hinnant __len -= __l2 + 1; 36373e519524SHoward Hinnant } 36383e519524SHoward Hinnant } 36393e519524SHoward Hinnant return __first; 36403e519524SHoward Hinnant} 36413e519524SHoward Hinnant 36423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 36433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36443e519524SHoward Hinnant_ForwardIterator 36453e519524SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 36463e519524SHoward Hinnant{ 36473e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 36483e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 36493e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 36503e519524SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value, __c); 36513e519524SHoward Hinnant#else 36523e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 36533e519524SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value, __comp); 36543e519524SHoward Hinnant#endif 36553e519524SHoward Hinnant} 36563e519524SHoward Hinnant 36573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 36583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36593e519524SHoward Hinnant_ForwardIterator 36603e519524SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 36613e519524SHoward Hinnant{ 36623e519524SHoward Hinnant return _STD::upper_bound(__first, __last, __value, 36633e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 36643e519524SHoward Hinnant} 36653e519524SHoward Hinnant 36663e519524SHoward Hinnant// equal_range 36673e519524SHoward Hinnant 36683e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 36693e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 36703e519524SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 36713e519524SHoward Hinnant{ 36723e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 36733e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 36743e519524SHoward Hinnant while (__len != 0) 36753e519524SHoward Hinnant { 36763e519524SHoward Hinnant difference_type __l2 = __len / 2; 36773e519524SHoward Hinnant _ForwardIterator __m = __first; 36783e519524SHoward Hinnant _STD::advance(__m, __l2); 36793e519524SHoward Hinnant if (__comp(*__m, __value)) 36803e519524SHoward Hinnant { 36813e519524SHoward Hinnant __first = ++__m; 36823e519524SHoward Hinnant __len -= __l2 + 1; 36833e519524SHoward Hinnant } 36843e519524SHoward Hinnant else if (__comp(__value, *__m)) 36853e519524SHoward Hinnant { 36863e519524SHoward Hinnant __last = __m; 36873e519524SHoward Hinnant __len = __l2; 36883e519524SHoward Hinnant } 36893e519524SHoward Hinnant else 36903e519524SHoward Hinnant { 36913e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 36923e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 36933e519524SHoward Hinnant ( 36943e519524SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value, __comp), 36953e519524SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value, __comp) 36963e519524SHoward Hinnant ); 36973e519524SHoward Hinnant } 36983e519524SHoward Hinnant } 36993e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 37003e519524SHoward Hinnant} 37013e519524SHoward Hinnant 37023e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 37033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37043e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 37053e519524SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 37063e519524SHoward Hinnant{ 37073e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 37083e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 37093e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 37103e519524SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value, __c); 37113e519524SHoward Hinnant#else 37123e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 37133e519524SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value, __comp); 37143e519524SHoward Hinnant#endif 37153e519524SHoward Hinnant} 37163e519524SHoward Hinnant 37173e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 37183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37193e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 37203e519524SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 37213e519524SHoward Hinnant{ 37223e519524SHoward Hinnant return _STD::equal_range(__first, __last, __value, 37233e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 37243e519524SHoward Hinnant} 37253e519524SHoward Hinnant 37263e519524SHoward Hinnant// binary_search 37273e519524SHoward Hinnant 37283e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 37293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37303e519524SHoward Hinnantbool 37313e519524SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 37323e519524SHoward Hinnant{ 37333e519524SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value, __comp); 37343e519524SHoward Hinnant return __first != __last && !__comp(__value, *__first); 37353e519524SHoward Hinnant} 37363e519524SHoward Hinnant 37373e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 37383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37393e519524SHoward Hinnantbool 37403e519524SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 37413e519524SHoward Hinnant{ 37423e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 37433e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 37443e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 37453e519524SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value, __c); 37463e519524SHoward Hinnant#else 37473e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 37483e519524SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value, __comp); 37493e519524SHoward Hinnant#endif 37503e519524SHoward Hinnant} 37513e519524SHoward Hinnant 37523e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 37533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37543e519524SHoward Hinnantbool 37553e519524SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 37563e519524SHoward Hinnant{ 37573e519524SHoward Hinnant return _STD::binary_search(__first, __last, __value, 37583e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 37593e519524SHoward Hinnant} 37603e519524SHoward Hinnant 37613e519524SHoward Hinnant// merge 37623e519524SHoward Hinnant 37633e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 37643e519524SHoward Hinnant_OutputIterator 37653e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 37663e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 37673e519524SHoward Hinnant{ 37683e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 37693e519524SHoward Hinnant { 37703e519524SHoward Hinnant if (__first2 == __last2) 37713e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 37723e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 37733e519524SHoward Hinnant { 37743e519524SHoward Hinnant *__result = *__first2; 37753e519524SHoward Hinnant ++__first2; 37763e519524SHoward Hinnant } 37773e519524SHoward Hinnant else 37783e519524SHoward Hinnant { 37793e519524SHoward Hinnant *__result = *__first1; 37803e519524SHoward Hinnant ++__first1; 37813e519524SHoward Hinnant } 37823e519524SHoward Hinnant } 37833e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 37843e519524SHoward Hinnant} 37853e519524SHoward Hinnant 37863e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 37873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37883e519524SHoward Hinnant_OutputIterator 37893e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 37903e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 37913e519524SHoward Hinnant{ 37923e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 37933e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 37943e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 37953e519524SHoward Hinnant return _STD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 37963e519524SHoward Hinnant#else 37973e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 37983e519524SHoward Hinnant return _STD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 37993e519524SHoward Hinnant#endif 38003e519524SHoward Hinnant} 38013e519524SHoward Hinnant 38023e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 38033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38043e519524SHoward Hinnant_OutputIterator 38053e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 38063e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 38073e519524SHoward Hinnant{ 38083e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 38093e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 38103e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 38113e519524SHoward Hinnant} 38123e519524SHoward Hinnant 38133e519524SHoward Hinnant// inplace_merge 38143e519524SHoward Hinnant 38153e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 38163e519524SHoward Hinnantvoid 38173e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 38183e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 38193e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 38203e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 38213e519524SHoward Hinnant{ 38223e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 38233e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 38243e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 38253e519524SHoward Hinnant __destruct_n __d(0); 38263e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 38273e519524SHoward Hinnant if (__len1 <= __len2) 38283e519524SHoward Hinnant { 38293e519524SHoward Hinnant value_type* __p = __buff; 38303e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 38313e519524SHoward Hinnant ::new(__p) value_type(_STD::move(*__i)); 38323e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 38333e519524SHoward Hinnant move_iterator<value_type*>(__p), 38343e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 38353e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 38363e519524SHoward Hinnant __first, __comp); 38373e519524SHoward Hinnant } 38383e519524SHoward Hinnant else 38393e519524SHoward Hinnant { 38403e519524SHoward Hinnant value_type* __p = __buff; 38413e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 38423e519524SHoward Hinnant ::new(__p) value_type(_STD::move(*__i)); 38433e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 38443e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 38453e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 38463e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 38473e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 38483e519524SHoward Hinnant } 38493e519524SHoward Hinnant} 38503e519524SHoward Hinnant 38513e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 38523e519524SHoward Hinnantvoid 38533e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 38543e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 38553e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 38563e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 38573e519524SHoward Hinnant{ 38583e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 38593e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 38603e519524SHoward Hinnant while (true) 38613e519524SHoward Hinnant { 38623e519524SHoward Hinnant // if __middle == __last, we're done 38633e519524SHoward Hinnant if (__len2 == 0) 38643e519524SHoward Hinnant return; 38653e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 38663e519524SHoward Hinnant for (; true; ++__first, --__len1) 38673e519524SHoward Hinnant { 38683e519524SHoward Hinnant if (__len1 == 0) 38693e519524SHoward Hinnant return; 38703e519524SHoward Hinnant if (__comp(*__middle, *__first)) 38713e519524SHoward Hinnant break; 38723e519524SHoward Hinnant } 38733e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 38743e519524SHoward Hinnant { 38753e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 38763e519524SHoward Hinnant return; 38773e519524SHoward Hinnant } 38783e519524SHoward Hinnant // __first < __middle < __last 38793e519524SHoward Hinnant // *__first > *__middle 38803e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 38813e519524SHoward Hinnant // all elements in: 38823e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 38833e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 38843e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 38853e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 38863e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 38873e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 38883e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 38893e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 38903e519524SHoward Hinnant // binary search smaller range 38913e519524SHoward Hinnant if (__len1 < __len2) 38923e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 38933e519524SHoward Hinnant __len21 = __len2 / 2; 38943e519524SHoward Hinnant __m2 = __middle; 38953e519524SHoward Hinnant _STD::advance(__m2, __len21); 38963e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 38973e519524SHoward Hinnant __len11 = _STD::distance(__first, __m1); 38983e519524SHoward Hinnant } 38993e519524SHoward Hinnant else 39003e519524SHoward Hinnant { 39013e519524SHoward Hinnant if (__len1 == 1) 39023e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 39033e519524SHoward Hinnant // It is known *__first > *__middle 39043e519524SHoward Hinnant swap(*__first, *__middle); 39053e519524SHoward Hinnant return; 39063e519524SHoward Hinnant } 39073e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 39083e519524SHoward Hinnant __len11 = __len1 / 2; 39093e519524SHoward Hinnant __m1 = __first; 39103e519524SHoward Hinnant _STD::advance(__m1, __len11); 39113e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 39123e519524SHoward Hinnant __len21 = _STD::distance(__middle, __m2); 39133e519524SHoward Hinnant } 39143e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 39153e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 39163e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 39173e519524SHoward Hinnant // swap middle two partitions 39183e519524SHoward Hinnant __middle = _STD::rotate(__m1, __middle, __m2); 39193e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 39203e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 39213e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 39223e519524SHoward Hinnant { 39233e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 39243e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 39253e519524SHoward Hinnant __first = __middle; 39263e519524SHoward Hinnant __middle = __m2; 39273e519524SHoward Hinnant __len1 = __len12; 39283e519524SHoward Hinnant __len2 = __len22; 39293e519524SHoward Hinnant } 39303e519524SHoward Hinnant else 39313e519524SHoward Hinnant { 39323e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 39333e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 39343e519524SHoward Hinnant __last = __middle; 39353e519524SHoward Hinnant __middle = __m1; 39363e519524SHoward Hinnant __len1 = __len11; 39373e519524SHoward Hinnant __len2 = __len21; 39383e519524SHoward Hinnant } 39393e519524SHoward Hinnant } 39403e519524SHoward Hinnant} 39413e519524SHoward Hinnant 39423e519524SHoward Hinnanttemplate <class _Tp> 39433e519524SHoward Hinnantstruct __inplace_merge_switch 39443e519524SHoward Hinnant{ 39453e519524SHoward Hinnant static const unsigned value = has_trivial_copy_assign<_Tp>::value; 39463e519524SHoward Hinnant}; 39473e519524SHoward Hinnant 39483e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 39493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39503e519524SHoward Hinnantvoid 39513e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 39523e519524SHoward Hinnant _Compare __comp) 39533e519524SHoward Hinnant{ 39543e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 39553e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 39563e519524SHoward Hinnant difference_type __len1 = _STD::distance(__first, __middle); 39573e519524SHoward Hinnant difference_type __len2 = _STD::distance(__middle, __last); 39583e519524SHoward Hinnant difference_type __buf_size = _STD::min(__len1, __len2); 39593e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 39603e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 39613e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 39623e519524SHoward Hinnant { 39633e519524SHoward Hinnant __buf = _STD::get_temporary_buffer<value_type>(__buf_size); 39643e519524SHoward Hinnant __h.reset(__buf.first); 39653e519524SHoward Hinnant } 39663e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 39673e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39683e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 39693e519524SHoward Hinnant return _STD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 39703e519524SHoward Hinnant __buf.first, __buf.second); 39713e519524SHoward Hinnant#else 39723e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 39733e519524SHoward Hinnant return _STD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 39743e519524SHoward Hinnant __buf.first, __buf.second); 39753e519524SHoward Hinnant#endif 39763e519524SHoward Hinnant} 39773e519524SHoward Hinnant 39783e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 39793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39803e519524SHoward Hinnantvoid 39813e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 39823e519524SHoward Hinnant{ 39833e519524SHoward Hinnant _STD::inplace_merge(__first, __middle, __last, 39843e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 39853e519524SHoward Hinnant} 39863e519524SHoward Hinnant 39873e519524SHoward Hinnant// stable_sort 39883e519524SHoward Hinnant 39893e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 39903e519524SHoward Hinnantvoid 39913e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 39923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 39933e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 39943e519524SHoward Hinnant{ 39953e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 39963e519524SHoward Hinnant __destruct_n __d(0); 39973e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 39983e519524SHoward Hinnant for (; true; ++__result) 39993e519524SHoward Hinnant { 40003e519524SHoward Hinnant if (__first1 == __last1) 40013e519524SHoward Hinnant { 40023e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 40033e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first2)); 40043e519524SHoward Hinnant __h.release(); 40053e519524SHoward Hinnant return; 40063e519524SHoward Hinnant } 40073e519524SHoward Hinnant if (__first2 == __last2) 40083e519524SHoward Hinnant { 40093e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 40103e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first1)); 40113e519524SHoward Hinnant __h.release(); 40123e519524SHoward Hinnant return; 40133e519524SHoward Hinnant } 40143e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 40153e519524SHoward Hinnant { 40163e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first2)); 40173e519524SHoward Hinnant __d.__incr((value_type*)0); 40183e519524SHoward Hinnant ++__first2; 40193e519524SHoward Hinnant } 40203e519524SHoward Hinnant else 40213e519524SHoward Hinnant { 40223e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first1)); 40233e519524SHoward Hinnant __d.__incr((value_type*)0); 40243e519524SHoward Hinnant ++__first1; 40253e519524SHoward Hinnant } 40263e519524SHoward Hinnant } 40273e519524SHoward Hinnant} 40283e519524SHoward Hinnant 40293e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 40303e519524SHoward Hinnantvoid 40313e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 40323e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 40333e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 40343e519524SHoward Hinnant{ 40353e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 40363e519524SHoward Hinnant { 40373e519524SHoward Hinnant if (__first2 == __last2) 40383e519524SHoward Hinnant { 40393e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 40403e519524SHoward Hinnant *__result = _STD::move(*__first1); 40413e519524SHoward Hinnant return; 40423e519524SHoward Hinnant } 40433e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 40443e519524SHoward Hinnant { 40453e519524SHoward Hinnant *__result = _STD::move(*__first2); 40463e519524SHoward Hinnant ++__first2; 40473e519524SHoward Hinnant } 40483e519524SHoward Hinnant else 40493e519524SHoward Hinnant { 40503e519524SHoward Hinnant *__result = _STD::move(*__first1); 40513e519524SHoward Hinnant ++__first1; 40523e519524SHoward Hinnant } 40533e519524SHoward Hinnant } 40543e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 40553e519524SHoward Hinnant *__result = _STD::move(*__first2); 40563e519524SHoward Hinnant} 40573e519524SHoward Hinnant 40583e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 40593e519524SHoward Hinnantvoid 40603e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 40613e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 40623e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 40633e519524SHoward Hinnant 40643e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 40653e519524SHoward Hinnantvoid 40663e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 40673e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 40683e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 40693e519524SHoward Hinnant{ 40703e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 40713e519524SHoward Hinnant switch (__len) 40723e519524SHoward Hinnant { 40733e519524SHoward Hinnant case 0: 40743e519524SHoward Hinnant return; 40753e519524SHoward Hinnant case 1: 40763e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 40773e519524SHoward Hinnant return; 40783e519524SHoward Hinnant case 2: 40793e519524SHoward Hinnant __destruct_n __d(0); 40803e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 40813e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 40823e519524SHoward Hinnant { 40833e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__last1)); 40843e519524SHoward Hinnant __d.__incr((value_type*)0); 40853e519524SHoward Hinnant ++__first2; 40863e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 40873e519524SHoward Hinnant } 40883e519524SHoward Hinnant else 40893e519524SHoward Hinnant { 40903e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 40913e519524SHoward Hinnant __d.__incr((value_type*)0); 40923e519524SHoward Hinnant ++__first2; 40933e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__last1)); 40943e519524SHoward Hinnant } 40953e519524SHoward Hinnant __h2.release(); 40963e519524SHoward Hinnant return; 40973e519524SHoward Hinnant } 40983e519524SHoward Hinnant if (__len <= 8) 40993e519524SHoward Hinnant { 41003e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 41013e519524SHoward Hinnant return; 41023e519524SHoward Hinnant } 41033e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 41043e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 41053e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 41063e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 41073e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 41083e519524SHoward Hinnant} 41093e519524SHoward Hinnant 41103e519524SHoward Hinnanttemplate <class _Tp> 41113e519524SHoward Hinnantstruct __stable_sort_switch 41123e519524SHoward Hinnant{ 41133e519524SHoward Hinnant static const unsigned value = 128*has_trivial_copy_assign<_Tp>::value; 41143e519524SHoward Hinnant}; 41153e519524SHoward Hinnant 41163e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 41173e519524SHoward Hinnantvoid 41183e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 41193e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 41203e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 41213e519524SHoward Hinnant{ 41223e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 41233e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 41243e519524SHoward Hinnant switch (__len) 41253e519524SHoward Hinnant { 41263e519524SHoward Hinnant case 0: 41273e519524SHoward Hinnant case 1: 41283e519524SHoward Hinnant return; 41293e519524SHoward Hinnant case 2: 41303e519524SHoward Hinnant if (__comp(*--__last, *__first)) 41313e519524SHoward Hinnant swap(*__first, *__last); 41323e519524SHoward Hinnant return; 41333e519524SHoward Hinnant } 41343e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 41353e519524SHoward Hinnant { 41363e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 41373e519524SHoward Hinnant return; 41383e519524SHoward Hinnant } 41393e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 41403e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 41413e519524SHoward Hinnant if (__len <= __buff_size) 41423e519524SHoward Hinnant { 41433e519524SHoward Hinnant __destruct_n __d(0); 41443e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 41453e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 41463e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 41473e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 41483e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 41493e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 41503e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 41513e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 41523e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 41533e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 41543e519524SHoward Hinnant// __first, __comp); 41553e519524SHoward Hinnant return; 41563e519524SHoward Hinnant } 41573e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 41583e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 41593e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 41603e519524SHoward Hinnant} 41613e519524SHoward Hinnant 41623e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41643e519524SHoward Hinnantvoid 41653e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41663e519524SHoward Hinnant{ 41673e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 41683e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 41693e519524SHoward Hinnant difference_type __len = __last - __first; 41703e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 41713e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 41723e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 41733e519524SHoward Hinnant { 41743e519524SHoward Hinnant __buf = _STD::get_temporary_buffer<value_type>(__len); 41753e519524SHoward Hinnant __h.reset(__buf.first); 41763e519524SHoward Hinnant } 41773e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 41783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41803e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 41813e519524SHoward Hinnant#else 41823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41833e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 41843e519524SHoward Hinnant#endif 41853e519524SHoward Hinnant} 41863e519524SHoward Hinnant 41873e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41893e519524SHoward Hinnantvoid 41903e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 41913e519524SHoward Hinnant{ 41923e519524SHoward Hinnant _STD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41933e519524SHoward Hinnant} 41943e519524SHoward Hinnant 41953e519524SHoward Hinnant// is_heap_until 41963e519524SHoward Hinnant 41973e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41983e519524SHoward Hinnant_RandomAccessIterator 41993e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 42003e519524SHoward Hinnant{ 42013e519524SHoward Hinnant typedef typename _STD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 42023e519524SHoward Hinnant difference_type __len = __last - __first; 42033e519524SHoward Hinnant difference_type __p = 0; 42043e519524SHoward Hinnant difference_type __c = 1; 42053e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 42063e519524SHoward Hinnant while (__c < __len) 42073e519524SHoward Hinnant { 42083e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 42093e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 42103e519524SHoward Hinnant return __cp; 42113e519524SHoward Hinnant ++__c; 42123e519524SHoward Hinnant ++__cp; 42133e519524SHoward Hinnant if (__c == __len) 42143e519524SHoward Hinnant return __last; 42153e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 42163e519524SHoward Hinnant return __cp; 42173e519524SHoward Hinnant ++__p; 42183e519524SHoward Hinnant ++__pp; 42193e519524SHoward Hinnant __c = 2 * __p + 1; 42203e519524SHoward Hinnant } 42213e519524SHoward Hinnant return __last; 42223e519524SHoward Hinnant} 42233e519524SHoward Hinnant 42243e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 42253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42263e519524SHoward Hinnant_RandomAccessIterator 42273e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 42283e519524SHoward Hinnant{ 42293e519524SHoward Hinnant return _STD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 42303e519524SHoward Hinnant} 42313e519524SHoward Hinnant 42323e519524SHoward Hinnant// is_heap 42333e519524SHoward Hinnant 42343e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 42353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42363e519524SHoward Hinnantbool 42373e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 42383e519524SHoward Hinnant{ 42393e519524SHoward Hinnant return _STD::is_heap_until(__first, __last, __comp) == __last; 42403e519524SHoward Hinnant} 42413e519524SHoward Hinnant 42423e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 42433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42443e519524SHoward Hinnantbool 42453e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 42463e519524SHoward Hinnant{ 42473e519524SHoward Hinnant return _STD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 42483e519524SHoward Hinnant} 42493e519524SHoward Hinnant 42503e519524SHoward Hinnant// push_heap 42513e519524SHoward Hinnant 42523e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42533e519524SHoward Hinnantvoid 42543e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 42553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 42563e519524SHoward Hinnant{ 42573e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 42583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 42593e519524SHoward Hinnant if (__len > 1) 42603e519524SHoward Hinnant { 42613e519524SHoward Hinnant difference_type __p = 0; 42623e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 42633e519524SHoward Hinnant difference_type __c = 2; 42643e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 42653e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 42663e519524SHoward Hinnant { 42673e519524SHoward Hinnant --__c; 42683e519524SHoward Hinnant --__cp; 42693e519524SHoward Hinnant } 42703e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 42713e519524SHoward Hinnant { 42723e519524SHoward Hinnant value_type __t(_STD::move(*__pp)); 42733e519524SHoward Hinnant do 42743e519524SHoward Hinnant { 42753e519524SHoward Hinnant *__pp = _STD::move(*__cp); 42763e519524SHoward Hinnant __pp = __cp; 42773e519524SHoward Hinnant __p = __c; 42783e519524SHoward Hinnant __c = (__p + 1) * 2; 42793e519524SHoward Hinnant if (__c > __len) 42803e519524SHoward Hinnant break; 42813e519524SHoward Hinnant __cp = __first + __c; 42823e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 42833e519524SHoward Hinnant { 42843e519524SHoward Hinnant --__c; 42853e519524SHoward Hinnant --__cp; 42863e519524SHoward Hinnant } 42873e519524SHoward Hinnant } while (__comp(__t, *__cp)); 42883e519524SHoward Hinnant *__pp = _STD::move(__t); 42893e519524SHoward Hinnant } 42903e519524SHoward Hinnant } 42913e519524SHoward Hinnant} 42923e519524SHoward Hinnant 42933e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42943e519524SHoward Hinnantvoid 42953e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 42963e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 42973e519524SHoward Hinnant{ 42983e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 42993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 43003e519524SHoward Hinnant if (__len > 1) 43013e519524SHoward Hinnant { 43023e519524SHoward Hinnant __len = (__len - 2) / 2; 43033e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 43043e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 43053e519524SHoward Hinnant { 43063e519524SHoward Hinnant value_type __t(_STD::move(*__last)); 43073e519524SHoward Hinnant do 43083e519524SHoward Hinnant { 43093e519524SHoward Hinnant *__last = _STD::move(*__ptr); 43103e519524SHoward Hinnant __last = __ptr; 43113e519524SHoward Hinnant if (__len == 0) 43123e519524SHoward Hinnant break; 43133e519524SHoward Hinnant __len = (__len - 1) / 2; 43143e519524SHoward Hinnant __ptr = __first + __len; 43153e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 43163e519524SHoward Hinnant *__last = _STD::move(__t); 43173e519524SHoward Hinnant } 43183e519524SHoward Hinnant } 43193e519524SHoward Hinnant} 43203e519524SHoward Hinnant 43213e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43233e519524SHoward Hinnantvoid 43243e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43253e519524SHoward Hinnant{ 43263e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 43273e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43283e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 43293e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 43303e519524SHoward Hinnant#else 43313e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43323e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 43333e519524SHoward Hinnant#endif 43343e519524SHoward Hinnant} 43353e519524SHoward Hinnant 43363e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 43373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43383e519524SHoward Hinnantvoid 43393e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 43403e519524SHoward Hinnant{ 43413e519524SHoward Hinnant _STD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43423e519524SHoward Hinnant} 43433e519524SHoward Hinnant 43443e519524SHoward Hinnant// pop_heap 43453e519524SHoward Hinnant 43463e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 43473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43483e519524SHoward Hinnantvoid 43493e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 43503e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 43513e519524SHoward Hinnant{ 43523e519524SHoward Hinnant if (__len > 1) 43533e519524SHoward Hinnant { 43543e519524SHoward Hinnant swap(*__first, *--__last); 43553e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 43563e519524SHoward Hinnant } 43573e519524SHoward Hinnant} 43583e519524SHoward Hinnant 43593e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43613e519524SHoward Hinnantvoid 43623e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43633e519524SHoward Hinnant{ 43643e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 43653e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43663e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 43673e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 43683e519524SHoward Hinnant#else 43693e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43703e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 43713e519524SHoward Hinnant#endif 43723e519524SHoward Hinnant} 43733e519524SHoward Hinnant 43743e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 43753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43763e519524SHoward Hinnantvoid 43773e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 43783e519524SHoward Hinnant{ 43793e519524SHoward Hinnant _STD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43803e519524SHoward Hinnant} 43813e519524SHoward Hinnant 43823e519524SHoward Hinnant// make_heap 43833e519524SHoward Hinnant 43843e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 43853e519524SHoward Hinnantvoid 43863e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43873e519524SHoward Hinnant{ 43883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43893e519524SHoward Hinnant difference_type __n = __last - __first; 43903e519524SHoward Hinnant if (__n > 1) 43913e519524SHoward Hinnant { 43923e519524SHoward Hinnant __last = __first; 43933e519524SHoward Hinnant ++__last; 43943e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 43953e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 43963e519524SHoward Hinnant } 43973e519524SHoward Hinnant} 43983e519524SHoward Hinnant 43993e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 44003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44013e519524SHoward Hinnantvoid 44023e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 44033e519524SHoward Hinnant{ 44043e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 44053e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44063e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 44073e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 44083e519524SHoward Hinnant#else 44093e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 44103e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 44113e519524SHoward Hinnant#endif 44123e519524SHoward Hinnant} 44133e519524SHoward Hinnant 44143e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 44153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44163e519524SHoward Hinnantvoid 44173e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 44183e519524SHoward Hinnant{ 44193e519524SHoward Hinnant _STD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 44203e519524SHoward Hinnant} 44213e519524SHoward Hinnant 44223e519524SHoward Hinnant// sort_heap 44233e519524SHoward Hinnant 44243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 44253e519524SHoward Hinnantvoid 44263e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 44273e519524SHoward Hinnant{ 44283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 44293e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 44303e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 44313e519524SHoward Hinnant} 44323e519524SHoward Hinnant 44333e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 44343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44353e519524SHoward Hinnantvoid 44363e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 44373e519524SHoward Hinnant{ 44383e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 44393e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44403e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 44413e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 44423e519524SHoward Hinnant#else 44433e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 44443e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 44453e519524SHoward Hinnant#endif 44463e519524SHoward Hinnant} 44473e519524SHoward Hinnant 44483e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 44493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44503e519524SHoward Hinnantvoid 44513e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 44523e519524SHoward Hinnant{ 44533e519524SHoward Hinnant _STD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 44543e519524SHoward Hinnant} 44553e519524SHoward Hinnant 44563e519524SHoward Hinnant// partial_sort 44573e519524SHoward Hinnant 44583e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 44593e519524SHoward Hinnantvoid 44603e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 44613e519524SHoward Hinnant _Compare __comp) 44623e519524SHoward Hinnant{ 44633e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 44643e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 44653e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 44663e519524SHoward Hinnant { 44673e519524SHoward Hinnant if (__comp(*__i, *__first)) 44683e519524SHoward Hinnant { 44693e519524SHoward Hinnant swap(*__i, *__first); 44703e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 44713e519524SHoward Hinnant } 44723e519524SHoward Hinnant } 44733e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 44743e519524SHoward Hinnant} 44753e519524SHoward Hinnant 44763e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 44773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44783e519524SHoward Hinnantvoid 44793e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 44803e519524SHoward Hinnant _Compare __comp) 44813e519524SHoward Hinnant{ 44823e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 44833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 44853e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 44863e519524SHoward Hinnant#else 44873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 44883e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 44893e519524SHoward Hinnant#endif 44903e519524SHoward Hinnant} 44913e519524SHoward Hinnant 44923e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 44933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44943e519524SHoward Hinnantvoid 44953e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 44963e519524SHoward Hinnant{ 44973e519524SHoward Hinnant _STD::partial_sort(__first, __middle, __last, 44983e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 44993e519524SHoward Hinnant} 45003e519524SHoward Hinnant 45013e519524SHoward Hinnant// partial_sort_copy 45023e519524SHoward Hinnant 45033e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 45043e519524SHoward Hinnant_RandomAccessIterator 45053e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 45063e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 45073e519524SHoward Hinnant{ 45083e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 45093e519524SHoward Hinnant if (__r != __result_last) 45103e519524SHoward Hinnant { 45113e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 45123e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 45133e519524SHoward Hinnant *__r = *__first; 45143e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 45153e519524SHoward Hinnant for (; __first != __last; ++__first) 45163e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 45173e519524SHoward Hinnant { 45183e519524SHoward Hinnant *__result_first = *__first; 45193e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 45203e519524SHoward Hinnant } 45213e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 45223e519524SHoward Hinnant } 45233e519524SHoward Hinnant return __r; 45243e519524SHoward Hinnant} 45253e519524SHoward Hinnant 45263e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 45273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45283e519524SHoward Hinnant_RandomAccessIterator 45293e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 45303e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 45313e519524SHoward Hinnant{ 45323e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 45333e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45343e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45353e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 45363e519524SHoward Hinnant#else 45373e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45383e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 45393e519524SHoward Hinnant#endif 45403e519524SHoward Hinnant} 45413e519524SHoward Hinnant 45423e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 45433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45443e519524SHoward Hinnant_RandomAccessIterator 45453e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 45463e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 45473e519524SHoward Hinnant{ 45483e519524SHoward Hinnant return _STD::partial_sort_copy(__first, __last, __result_first, __result_last, 45493e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45503e519524SHoward Hinnant} 45513e519524SHoward Hinnant 45523e519524SHoward Hinnant// nth_element 45533e519524SHoward Hinnant 45543e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45553e519524SHoward Hinnantvoid 45563e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 45573e519524SHoward Hinnant{ 45583e519524SHoward Hinnant // _Compare is known to be a reference type 45593e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45603e519524SHoward Hinnant const difference_type __limit = 7; 45613e519524SHoward Hinnant while (true) 45623e519524SHoward Hinnant { 45633e519524SHoward Hinnant __restart: 45643e519524SHoward Hinnant difference_type __len = __last - __first; 45653e519524SHoward Hinnant switch (__len) 45663e519524SHoward Hinnant { 45673e519524SHoward Hinnant case 0: 45683e519524SHoward Hinnant case 1: 45693e519524SHoward Hinnant return; 45703e519524SHoward Hinnant case 2: 45713e519524SHoward Hinnant if (__comp(*--__last, *__first)) 45723e519524SHoward Hinnant swap(*__first, *__last); 45733e519524SHoward Hinnant return; 45743e519524SHoward Hinnant case 3: 45753e519524SHoward Hinnant { 45763e519524SHoward Hinnant _RandomAccessIterator __m = __first; 45773e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 45783e519524SHoward Hinnant return; 45793e519524SHoward Hinnant } 45803e519524SHoward Hinnant } 45813e519524SHoward Hinnant if (__len <= __limit) 45823e519524SHoward Hinnant { 45833e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 45843e519524SHoward Hinnant return; 45853e519524SHoward Hinnant } 45863e519524SHoward Hinnant // __len > __limit >= 3 45873e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 45883e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 45893e519524SHoward Hinnant unsigned __n_swaps = _STD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 45903e519524SHoward Hinnant // *__m is median 45913e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 45923e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 45933e519524SHoward Hinnant _RandomAccessIterator __i = __first; 45943e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 45953e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 45963e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 45973e519524SHoward Hinnant // Prime the downward search with a guard. 45983e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 45993e519524SHoward Hinnant { 46003e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 46013e519524SHoward Hinnant // manually guard downward moving __j against __i 46023e519524SHoward Hinnant while (true) 46033e519524SHoward Hinnant { 46043e519524SHoward Hinnant if (__i == --__j) 46053e519524SHoward Hinnant { 46063e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 46073e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 46083e519524SHoward Hinnant ++__i; // __first + 1 46093e519524SHoward Hinnant __j = __last; 46103e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 46113e519524SHoward Hinnant { 46123e519524SHoward Hinnant while (true) 46133e519524SHoward Hinnant { 46143e519524SHoward Hinnant if (__i == __j) 46153e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 46163e519524SHoward Hinnant if (__comp(*__first, *__i)) 46173e519524SHoward Hinnant { 46183e519524SHoward Hinnant swap(*__i, *__j); 46193e519524SHoward Hinnant ++__n_swaps; 46203e519524SHoward Hinnant ++__i; 46213e519524SHoward Hinnant break; 46223e519524SHoward Hinnant } 46233e519524SHoward Hinnant ++__i; 46243e519524SHoward Hinnant } 46253e519524SHoward Hinnant } 46263e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 46273e519524SHoward Hinnant if (__i == __j) 46283e519524SHoward Hinnant return; 46293e519524SHoward Hinnant while (true) 46303e519524SHoward Hinnant { 46313e519524SHoward Hinnant while (!__comp(*__first, *__i)) 46323e519524SHoward Hinnant ++__i; 46333e519524SHoward Hinnant while (__comp(*__first, *--__j)) 46343e519524SHoward Hinnant ; 46353e519524SHoward Hinnant if (__i >= __j) 46363e519524SHoward Hinnant break; 46373e519524SHoward Hinnant swap(*__i, *__j); 46383e519524SHoward Hinnant ++__n_swaps; 46393e519524SHoward Hinnant ++__i; 46403e519524SHoward Hinnant } 46413e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 46423e519524SHoward Hinnant // The first part is sorted, 46433e519524SHoward Hinnant if (__nth < __i) 46443e519524SHoward Hinnant return; 46453e519524SHoward Hinnant // __nth_element the secod part 46463e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 46473e519524SHoward Hinnant __first = __i; 46483e519524SHoward Hinnant goto __restart; 46493e519524SHoward Hinnant } 46503e519524SHoward Hinnant if (__comp(*__j, *__m)) 46513e519524SHoward Hinnant { 46523e519524SHoward Hinnant swap(*__i, *__j); 46533e519524SHoward Hinnant ++__n_swaps; 46543e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 46553e519524SHoward Hinnant } 46563e519524SHoward Hinnant } 46573e519524SHoward Hinnant } 46583e519524SHoward Hinnant ++__i; 46593e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 46603e519524SHoward Hinnant // if not yet partitioned... 46613e519524SHoward Hinnant if (__i < __j) 46623e519524SHoward Hinnant { 46633e519524SHoward Hinnant // known that *(__i - 1) < *__m 46643e519524SHoward Hinnant while (true) 46653e519524SHoward Hinnant { 46663e519524SHoward Hinnant // __m still guards upward moving __i 46673e519524SHoward Hinnant while (__comp(*__i, *__m)) 46683e519524SHoward Hinnant ++__i; 46693e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 46703e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 46713e519524SHoward Hinnant ; 46723e519524SHoward Hinnant if (__i >= __j) 46733e519524SHoward Hinnant break; 46743e519524SHoward Hinnant swap(*__i, *__j); 46753e519524SHoward Hinnant ++__n_swaps; 46763e519524SHoward Hinnant // It is known that __m != __j 46773e519524SHoward Hinnant // If __m just moved, follow it 46783e519524SHoward Hinnant if (__m == __i) 46793e519524SHoward Hinnant __m = __j; 46803e519524SHoward Hinnant ++__i; 46813e519524SHoward Hinnant } 46823e519524SHoward Hinnant } 46833e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 46843e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 46853e519524SHoward Hinnant { 46863e519524SHoward Hinnant swap(*__i, *__m); 46873e519524SHoward Hinnant ++__n_swaps; 46883e519524SHoward Hinnant } 46893e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 46903e519524SHoward Hinnant if (__nth == __i) 46913e519524SHoward Hinnant return; 46923e519524SHoward Hinnant if (__n_swaps == 0) 46933e519524SHoward Hinnant { 46943e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 46953e519524SHoward Hinnant if (__nth < __i) 46963e519524SHoward Hinnant { 46973e519524SHoward Hinnant // Check for [__first, __i) already sorted 46983e519524SHoward Hinnant __j = __m = __first; 46993e519524SHoward Hinnant while (++__j != __i) 47003e519524SHoward Hinnant { 47013e519524SHoward Hinnant if (__comp(*__j, *__m)) 47023e519524SHoward Hinnant // not yet sorted, so sort 47033e519524SHoward Hinnant goto not_sorted; 47043e519524SHoward Hinnant __m = __j; 47053e519524SHoward Hinnant } 47063e519524SHoward Hinnant // [__first, __i) sorted 47073e519524SHoward Hinnant return; 47083e519524SHoward Hinnant } 47093e519524SHoward Hinnant else 47103e519524SHoward Hinnant { 47113e519524SHoward Hinnant // Check for [__i, __last) already sorted 47123e519524SHoward Hinnant __j = __m = __i; 47133e519524SHoward Hinnant while (++__j != __last) 47143e519524SHoward Hinnant { 47153e519524SHoward Hinnant if (__comp(*__j, *__m)) 47163e519524SHoward Hinnant // not yet sorted, so sort 47173e519524SHoward Hinnant goto not_sorted; 47183e519524SHoward Hinnant __m = __j; 47193e519524SHoward Hinnant } 47203e519524SHoward Hinnant // [__i, __last) sorted 47213e519524SHoward Hinnant return; 47223e519524SHoward Hinnant } 47233e519524SHoward Hinnant } 47243e519524SHoward Hinnantnot_sorted: 47253e519524SHoward Hinnant // __nth_element on range containing __nth 47263e519524SHoward Hinnant if (__nth < __i) 47273e519524SHoward Hinnant { 47283e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 47293e519524SHoward Hinnant __last = __i; 47303e519524SHoward Hinnant } 47313e519524SHoward Hinnant else 47323e519524SHoward Hinnant { 47333e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 47343e519524SHoward Hinnant __first = ++__i; 47353e519524SHoward Hinnant } 47363e519524SHoward Hinnant } 47373e519524SHoward Hinnant} 47383e519524SHoward Hinnant 47393e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47413e519524SHoward Hinnantvoid 47423e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 47433e519524SHoward Hinnant{ 47443e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 47453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47473e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 47483e519524SHoward Hinnant#else 47493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47503e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 47513e519524SHoward Hinnant#endif 47523e519524SHoward Hinnant} 47533e519524SHoward Hinnant 47543e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47563e519524SHoward Hinnantvoid 47573e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 47583e519524SHoward Hinnant{ 47593e519524SHoward Hinnant _STD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47603e519524SHoward Hinnant} 47613e519524SHoward Hinnant 47623e519524SHoward Hinnant// includes 47633e519524SHoward Hinnant 47643e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 47653e519524SHoward Hinnantbool 47663e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 47673e519524SHoward Hinnant _Compare __comp) 47683e519524SHoward Hinnant{ 47693e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 47703e519524SHoward Hinnant { 47713e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 47723e519524SHoward Hinnant return false; 47733e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 47743e519524SHoward Hinnant ++__first2; 47753e519524SHoward Hinnant } 47763e519524SHoward Hinnant return true; 47773e519524SHoward Hinnant} 47783e519524SHoward Hinnant 47793e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 47803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47813e519524SHoward Hinnantbool 47823e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 47833e519524SHoward Hinnant _Compare __comp) 47843e519524SHoward Hinnant{ 47853e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 47863e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47873e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47883e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 47893e519524SHoward Hinnant#else 47903e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47913e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 47923e519524SHoward Hinnant#endif 47933e519524SHoward Hinnant} 47943e519524SHoward Hinnant 47953e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 47963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47973e519524SHoward Hinnantbool 47983e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 47993e519524SHoward Hinnant{ 48003e519524SHoward Hinnant return _STD::includes(__first1, __last1, __first2, __last2, 48013e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 48023e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 48033e519524SHoward Hinnant} 48043e519524SHoward Hinnant 48053e519524SHoward Hinnant// set_union 48063e519524SHoward Hinnant 48073e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 48083e519524SHoward Hinnant_OutputIterator 48093e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 48103e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 48113e519524SHoward Hinnant{ 48123e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 48133e519524SHoward Hinnant { 48143e519524SHoward Hinnant if (__first2 == __last2) 48153e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 48163e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 48173e519524SHoward Hinnant { 48183e519524SHoward Hinnant *__result = *__first2; 48193e519524SHoward Hinnant ++__first2; 48203e519524SHoward Hinnant } 48213e519524SHoward Hinnant else 48223e519524SHoward Hinnant { 48233e519524SHoward Hinnant *__result = *__first1; 48243e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 48253e519524SHoward Hinnant ++__first2; 48263e519524SHoward Hinnant ++__first1; 48273e519524SHoward Hinnant } 48283e519524SHoward Hinnant } 48293e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 48303e519524SHoward Hinnant} 48313e519524SHoward Hinnant 48323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 48333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48343e519524SHoward Hinnant_OutputIterator 48353e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 48363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 48373e519524SHoward Hinnant{ 48383e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 48393e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48403e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48413e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 48423e519524SHoward Hinnant#else 48433e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48443e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 48453e519524SHoward Hinnant#endif 48463e519524SHoward Hinnant} 48473e519524SHoward Hinnant 48483e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 48493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48503e519524SHoward Hinnant_OutputIterator 48513e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 48523e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 48533e519524SHoward Hinnant{ 48543e519524SHoward Hinnant return _STD::set_union(__first1, __last1, __first2, __last2, __result, 48553e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 48563e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 48573e519524SHoward Hinnant} 48583e519524SHoward Hinnant 48593e519524SHoward Hinnant// set_intersection 48603e519524SHoward Hinnant 48613e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 48623e519524SHoward Hinnant_OutputIterator 48633e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 48643e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 48653e519524SHoward Hinnant{ 48663e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 48673e519524SHoward Hinnant { 48683e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 48693e519524SHoward Hinnant ++__first1; 48703e519524SHoward Hinnant else 48713e519524SHoward Hinnant { 48723e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 48733e519524SHoward Hinnant { 48743e519524SHoward Hinnant *__result = *__first1; 48753e519524SHoward Hinnant ++__result; 48763e519524SHoward Hinnant ++__first1; 48773e519524SHoward Hinnant } 48783e519524SHoward Hinnant ++__first2; 48793e519524SHoward Hinnant } 48803e519524SHoward Hinnant } 48813e519524SHoward Hinnant return __result; 48823e519524SHoward Hinnant} 48833e519524SHoward Hinnant 48843e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 48853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48863e519524SHoward Hinnant_OutputIterator 48873e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 48883e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 48893e519524SHoward Hinnant{ 48903e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 48913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48933e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 48943e519524SHoward Hinnant#else 48953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48963e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 48973e519524SHoward Hinnant#endif 48983e519524SHoward Hinnant} 48993e519524SHoward Hinnant 49003e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 49013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49023e519524SHoward Hinnant_OutputIterator 49033e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 49043e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 49053e519524SHoward Hinnant{ 49063e519524SHoward Hinnant return _STD::set_intersection(__first1, __last1, __first2, __last2, __result, 49073e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 49083e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 49093e519524SHoward Hinnant} 49103e519524SHoward Hinnant 49113e519524SHoward Hinnant// set_difference 49123e519524SHoward Hinnant 49133e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 49143e519524SHoward Hinnant_OutputIterator 49153e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 49163e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 49173e519524SHoward Hinnant{ 49183e519524SHoward Hinnant while (__first1 != __last1) 49193e519524SHoward Hinnant { 49203e519524SHoward Hinnant if (__first2 == __last2) 49213e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 49223e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 49233e519524SHoward Hinnant { 49243e519524SHoward Hinnant *__result = *__first1; 49253e519524SHoward Hinnant ++__result; 49263e519524SHoward Hinnant ++__first1; 49273e519524SHoward Hinnant } 49283e519524SHoward Hinnant else 49293e519524SHoward Hinnant { 49303e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 49313e519524SHoward Hinnant ++__first1; 49323e519524SHoward Hinnant ++__first2; 49333e519524SHoward Hinnant } 49343e519524SHoward Hinnant } 49353e519524SHoward Hinnant return __result; 49363e519524SHoward Hinnant} 49373e519524SHoward Hinnant 49383e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 49393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49403e519524SHoward Hinnant_OutputIterator 49413e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 49423e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 49433e519524SHoward Hinnant{ 49443e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 49453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49473e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 49483e519524SHoward Hinnant#else 49493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49503e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 49513e519524SHoward Hinnant#endif 49523e519524SHoward Hinnant} 49533e519524SHoward Hinnant 49543e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 49553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49563e519524SHoward Hinnant_OutputIterator 49573e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 49583e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 49593e519524SHoward Hinnant{ 49603e519524SHoward Hinnant return _STD::set_difference(__first1, __last1, __first2, __last2, __result, 49613e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 49623e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 49633e519524SHoward Hinnant} 49643e519524SHoward Hinnant 49653e519524SHoward Hinnant// set_symmetric_difference 49663e519524SHoward Hinnant 49673e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 49683e519524SHoward Hinnant_OutputIterator 49693e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 49703e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 49713e519524SHoward Hinnant{ 49723e519524SHoward Hinnant while (__first1 != __last1) 49733e519524SHoward Hinnant { 49743e519524SHoward Hinnant if (__first2 == __last2) 49753e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 49763e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 49773e519524SHoward Hinnant { 49783e519524SHoward Hinnant *__result = *__first1; 49793e519524SHoward Hinnant ++__result; 49803e519524SHoward Hinnant ++__first1; 49813e519524SHoward Hinnant } 49823e519524SHoward Hinnant else 49833e519524SHoward Hinnant { 49843e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 49853e519524SHoward Hinnant { 49863e519524SHoward Hinnant *__result = *__first2; 49873e519524SHoward Hinnant ++__result; 49883e519524SHoward Hinnant } 49893e519524SHoward Hinnant else 49903e519524SHoward Hinnant ++__first1; 49913e519524SHoward Hinnant ++__first2; 49923e519524SHoward Hinnant } 49933e519524SHoward Hinnant } 49943e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 49953e519524SHoward Hinnant} 49963e519524SHoward Hinnant 49973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 49983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49993e519524SHoward Hinnant_OutputIterator 50003e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 50013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50023e519524SHoward Hinnant{ 50033e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 50043e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50053e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50063e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 50073e519524SHoward Hinnant#else 50083e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50093e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 50103e519524SHoward Hinnant#endif 50113e519524SHoward Hinnant} 50123e519524SHoward Hinnant 50133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 50143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50153e519524SHoward Hinnant_OutputIterator 50163e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 50173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 50183e519524SHoward Hinnant{ 50193e519524SHoward Hinnant return _STD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 50203e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 50213e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 50223e519524SHoward Hinnant} 50233e519524SHoward Hinnant 50243e519524SHoward Hinnant// lexicographical_compare 50253e519524SHoward Hinnant 50263e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 50273e519524SHoward Hinnantbool 50283e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 50293e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 50303e519524SHoward Hinnant{ 50313e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 50323e519524SHoward Hinnant { 50333e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 50343e519524SHoward Hinnant return true; 50353e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 50363e519524SHoward Hinnant return false; 50373e519524SHoward Hinnant } 50383e519524SHoward Hinnant return false; 50393e519524SHoward Hinnant} 50403e519524SHoward Hinnant 50413e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 50423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50433e519524SHoward Hinnantbool 50443e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 50453e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 50463e519524SHoward Hinnant{ 50473e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 50483e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50493e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50503e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 50513e519524SHoward Hinnant#else 50523e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50533e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 50543e519524SHoward Hinnant#endif 50553e519524SHoward Hinnant} 50563e519524SHoward Hinnant 50573e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 50583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50593e519524SHoward Hinnantbool 50603e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 50613e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 50623e519524SHoward Hinnant{ 50633e519524SHoward Hinnant return _STD::lexicographical_compare(__first1, __last1, __first2, __last2, 50643e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 50653e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 50663e519524SHoward Hinnant} 50673e519524SHoward Hinnant 50683e519524SHoward Hinnant// next_permutation 50693e519524SHoward Hinnant 50703e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 50713e519524SHoward Hinnantbool 50723e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 50733e519524SHoward Hinnant{ 50743e519524SHoward Hinnant _BidirectionalIterator __i = __last; 50753e519524SHoward Hinnant if (__first == __last || __first == --__i) 50763e519524SHoward Hinnant return false; 50773e519524SHoward Hinnant while (true) 50783e519524SHoward Hinnant { 50793e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 50803e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 50813e519524SHoward Hinnant { 50823e519524SHoward Hinnant _BidirectionalIterator __j = __last; 50833e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 50843e519524SHoward Hinnant ; 50853e519524SHoward Hinnant swap(*__i, *__j); 50863e519524SHoward Hinnant _STD::reverse(__ip1, __last); 50873e519524SHoward Hinnant return true; 50883e519524SHoward Hinnant } 50893e519524SHoward Hinnant if (__i == __first) 50903e519524SHoward Hinnant { 50913e519524SHoward Hinnant _STD::reverse(__first, __last); 50923e519524SHoward Hinnant return false; 50933e519524SHoward Hinnant } 50943e519524SHoward Hinnant } 50953e519524SHoward Hinnant} 50963e519524SHoward Hinnant 50973e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 50983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50993e519524SHoward Hinnantbool 51003e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 51013e519524SHoward Hinnant{ 51023e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 51033e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51043e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51053e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 51063e519524SHoward Hinnant#else 51073e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51083e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 51093e519524SHoward Hinnant#endif 51103e519524SHoward Hinnant} 51113e519524SHoward Hinnant 51123e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 51133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51143e519524SHoward Hinnantbool 51153e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 51163e519524SHoward Hinnant{ 51173e519524SHoward Hinnant return _STD::next_permutation(__first, __last, 51183e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 51193e519524SHoward Hinnant} 51203e519524SHoward Hinnant 51213e519524SHoward Hinnant// prev_permutation 51223e519524SHoward Hinnant 51233e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 51243e519524SHoward Hinnantbool 51253e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 51263e519524SHoward Hinnant{ 51273e519524SHoward Hinnant _BidirectionalIterator __i = __last; 51283e519524SHoward Hinnant if (__first == __last || __first == --__i) 51293e519524SHoward Hinnant return false; 51303e519524SHoward Hinnant while (true) 51313e519524SHoward Hinnant { 51323e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 51333e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 51343e519524SHoward Hinnant { 51353e519524SHoward Hinnant _BidirectionalIterator __j = __last; 51363e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 51373e519524SHoward Hinnant ; 51383e519524SHoward Hinnant swap(*__i, *__j); 51393e519524SHoward Hinnant _STD::reverse(__ip1, __last); 51403e519524SHoward Hinnant return true; 51413e519524SHoward Hinnant } 51423e519524SHoward Hinnant if (__i == __first) 51433e519524SHoward Hinnant { 51443e519524SHoward Hinnant _STD::reverse(__first, __last); 51453e519524SHoward Hinnant return false; 51463e519524SHoward Hinnant } 51473e519524SHoward Hinnant } 51483e519524SHoward Hinnant} 51493e519524SHoward Hinnant 51503e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 51513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51523e519524SHoward Hinnantbool 51533e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 51543e519524SHoward Hinnant{ 51553e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 51563e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51573e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51583e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 51593e519524SHoward Hinnant#else 51603e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51613e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 51623e519524SHoward Hinnant#endif 51633e519524SHoward Hinnant} 51643e519524SHoward Hinnant 51653e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 51663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51673e519524SHoward Hinnantbool 51683e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 51693e519524SHoward Hinnant{ 51703e519524SHoward Hinnant return _STD::prev_permutation(__first, __last, 51713e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 51723e519524SHoward Hinnant} 51733e519524SHoward Hinnant 51743e519524SHoward Hinnanttemplate <class _Tp> 51753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51763e519524SHoward Hinnanttypename enable_if 51773e519524SHoward Hinnant< 51783e519524SHoward Hinnant is_integral<_Tp>::value, 51793e519524SHoward Hinnant _Tp 51803e519524SHoward Hinnant>::type 51813e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 51823e519524SHoward Hinnant{ 51833e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 51843e519524SHoward Hinnant __n &= __bits; 51853e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 51863e519524SHoward Hinnant} 51873e519524SHoward Hinnant 51883e519524SHoward Hinnanttemplate <class _Tp> 51893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51903e519524SHoward Hinnanttypename enable_if 51913e519524SHoward Hinnant< 51923e519524SHoward Hinnant is_integral<_Tp>::value, 51933e519524SHoward Hinnant _Tp 51943e519524SHoward Hinnant>::type 51953e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 51963e519524SHoward Hinnant{ 51973e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 51983e519524SHoward Hinnant __n &= __bits; 51993e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 52003e519524SHoward Hinnant} 52013e519524SHoward Hinnant 52023e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 52033e519524SHoward Hinnant 52043e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5205