13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 4*57b08b09SChandler Carruth// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5*57b08b09SChandler Carruth// See https://llvm.org/LICENSE.txt for license information. 6*57b08b09SChandler Carruth// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 73e519524SHoward Hinnant// 83e519524SHoward Hinnant//===----------------------------------------------------------------------===// 93e519524SHoward Hinnant 103e519524SHoward Hinnant#ifndef _LIBCPP_ALGORITHM 113e519524SHoward Hinnant#define _LIBCPP_ALGORITHM 123e519524SHoward Hinnant 133e519524SHoward Hinnant/* 143e519524SHoward Hinnant algorithm synopsis 153e519524SHoward Hinnant 163e519524SHoward Hinnant#include <initializer_list> 173e519524SHoward Hinnant 183e519524SHoward Hinnantnamespace std 193e519524SHoward Hinnant{ 203e519524SHoward Hinnant 213e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 22706ffef7SMarshall Clow constexpr bool // constexpr in C++20 233e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 243e519524SHoward Hinnant 253e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 26706ffef7SMarshall Clow constexpr bool // constexpr in C++20 273e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 283e519524SHoward Hinnant 293e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 30706ffef7SMarshall Clow constexpr bool // constexpr in C++20 313e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 323e519524SHoward Hinnant 333e519524SHoward Hinnanttemplate <class InputIterator, class Function> 341b9a4ffdSMarshall Clow constexpr Function // constexpr in C++20 353e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 363e519524SHoward Hinnant 37d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 381b9a4ffdSMarshall Clow constexpr InputIterator // constexpr in C++20 391b9a4ffdSMarshall Clow for_each_n(InputIterator first, Size n, Function f); // C++17 40d5c65ffaSMarshall Clow 413e519524SHoward Hinnanttemplate <class InputIterator, class T> 4249c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 433e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 443e519524SHoward Hinnant 453e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 4649c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 473e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 483e519524SHoward Hinnant 493e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 508694428eSMarshall Clow InputIterator // constexpr in C++20 513e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 523e519524SHoward Hinnant 533e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 548694428eSMarshall Clow ForwardIterator1 // constexpr in C++20 553e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 563e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 573e519524SHoward Hinnant 583e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 598694428eSMarshall Clow ForwardIterator1 // constexpr in C++20 603e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 613e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 623e519524SHoward Hinnant 633e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 648694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 653e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 663e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 673e519524SHoward Hinnant 683e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 698694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 703e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 713e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 723e519524SHoward Hinnant 733e519524SHoward Hinnanttemplate <class ForwardIterator> 748694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 753e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 763e519524SHoward Hinnant 773e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 788694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 793e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 803e519524SHoward Hinnant 813e519524SHoward Hinnanttemplate <class InputIterator, class T> 82056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 833e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 843e519524SHoward Hinnant 853e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 86056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 873e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 883e519524SHoward Hinnant 893e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 906538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 913e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 923e519524SHoward Hinnant 930b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 946538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 950b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 960b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 970b0bbd2fSMarshall Clow 983e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 996538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1003e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 1013e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1023e519524SHoward Hinnant 1030b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1046538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1050b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1060b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1070b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1080b0bbd2fSMarshall Clow 1093e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1106538e28dSMarshall Clow constexpr bool // constexpr in C++20 1113e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1123e519524SHoward Hinnant 1130b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1146538e28dSMarshall Clow constexpr bool // constexpr in C++20 1150b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1160b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1170b0bbd2fSMarshall Clow 1183e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1196538e28dSMarshall Clow constexpr bool // constexpr in C++20 1203e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1213e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1223e519524SHoward Hinnant 1230b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1246538e28dSMarshall Clow constexpr bool // constexpr in C++20 1250b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1260b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1270b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1280b0bbd2fSMarshall Clow 1293e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 13049c7643cSMarshall Clow constexpr bool // constexpr in C++20 1313e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1323e519524SHoward Hinnant ForwardIterator2 first2); 1333e519524SHoward Hinnant 1340b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 13549c7643cSMarshall Clow constexpr bool // constexpr in C++20 1360b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1370b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1380b0bbd2fSMarshall Clow 1393e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14049c7643cSMarshall Clow constexpr bool // constexpr in C++20 1413e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1423e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1433e519524SHoward Hinnant 1440b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14549c7643cSMarshall Clow constexpr bool // constexpr in C++20 1460b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1470b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1480b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1490b0bbd2fSMarshall Clow 1503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 15112f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1523e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1543e519524SHoward Hinnant 1553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 15612f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1573e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1593e519524SHoward Hinnant 1603e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 16112f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 1623e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1633e519524SHoward Hinnant 1643e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 16512f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 1663e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1673e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1683e519524SHoward Hinnant 1693e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1703e519524SHoward Hinnant OutputIterator 1713e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1723e519524SHoward Hinnant 1733e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1743e519524SHoward Hinnant OutputIterator 1753e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1763e519524SHoward Hinnant OutputIterator result, Predicate pred); 1773e519524SHoward Hinnant 1783e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1793e519524SHoward Hinnant OutputIterator 1803e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1813e519524SHoward Hinnant 1823e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1833e519524SHoward Hinnant BidirectionalIterator2 1843e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1853e519524SHoward Hinnant BidirectionalIterator2 result); 1863e519524SHoward Hinnant 1873e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1883e519524SHoward Hinnant ForwardIterator2 1893e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1903e519524SHoward Hinnant 1913e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1923e519524SHoward Hinnant void 1933e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1943e519524SHoward Hinnant 1953e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 19699894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 1973e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1983e519524SHoward Hinnant 1993e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 20099894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 2013e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 2023e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2033e519524SHoward Hinnant 2043e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 20512c7423fSMarshall Clow constexpr void // constexpr in C++20 2063e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2073e519524SHoward Hinnant 2083e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 20912c7423fSMarshall Clow constexpr void // constexpr in C++20 2103e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2113e519524SHoward Hinnant 2123e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 21312c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 2143e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2153e519524SHoward Hinnant const T& old_value, const T& new_value); 2163e519524SHoward Hinnant 2173e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 21812c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 2193e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2203e519524SHoward Hinnant 2213e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2224bfb9313SMarshall Clow constexpr void // constexpr in C++20 2233e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2243e519524SHoward Hinnant 2253e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2264bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 2273e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2283e519524SHoward Hinnant 2293e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2304bfb9313SMarshall Clow constexpr void // constexpr in C++20 2313e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2323e519524SHoward Hinnant 2333e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2344bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 2353e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2363e519524SHoward Hinnant 2373e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 238e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2393e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2403e519524SHoward Hinnant 2413e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 242e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2433e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2443e519524SHoward Hinnant 2453e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 246e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2473e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2483e519524SHoward Hinnant 2493e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 250e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2513e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2523e519524SHoward Hinnant 2533e519524SHoward Hinnanttemplate <class ForwardIterator> 2543e519524SHoward Hinnant ForwardIterator 2553e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2563e519524SHoward Hinnant 2573e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2583e519524SHoward Hinnant ForwardIterator 2593e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2603e519524SHoward Hinnant 2613e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2623e519524SHoward Hinnant OutputIterator 2633e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2643e519524SHoward Hinnant 2653e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2663e519524SHoward Hinnant OutputIterator 2673e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2683e519524SHoward Hinnant 2693e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2703e519524SHoward Hinnant void 2713e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2723e519524SHoward Hinnant 2733e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 274e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2753e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2763e519524SHoward Hinnant 2773e519524SHoward Hinnanttemplate <class ForwardIterator> 2783e519524SHoward Hinnant ForwardIterator 2793e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2803e519524SHoward Hinnant 2813e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2823e519524SHoward Hinnant OutputIterator 2833e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2843e519524SHoward Hinnant 2853e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2863e519524SHoward Hinnant void 2870f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 2883e519524SHoward Hinnant 2893e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2903e519524SHoward Hinnant void 29106965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 2920f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 2933e519524SHoward Hinnant 294e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 295e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 296e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 297e7154709SEric Fiselier SampleIterator out, Distance n, 298e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 299e7154709SEric Fiselier 300f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 301f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 302fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 303f9d540b0SHoward Hinnant 3043e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 30549c7643cSMarshall Clow constexpr bool // constexpr in C++20 3063e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 3073e519524SHoward Hinnant 3083e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3093e519524SHoward Hinnant ForwardIterator 3103e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3113e519524SHoward Hinnant 3123e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3133e519524SHoward Hinnant class OutputIterator2, class Predicate> 3141b9a4ffdSMarshall Clow constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 3153e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3163e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3173e519524SHoward Hinnant Predicate pred); 3183e519524SHoward Hinnant 3193e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3203e519524SHoward Hinnant ForwardIterator 3213e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3223e519524SHoward Hinnant 3233e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 324d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3253e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3263e519524SHoward Hinnant 3273e519524SHoward Hinnanttemplate <class ForwardIterator> 32849c7643cSMarshall Clow constexpr bool // constexpr in C++20 3293e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3303e519524SHoward Hinnant 3313e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3323e519524SHoward Hinnant bool 3333e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3343e519524SHoward Hinnant 3353e519524SHoward Hinnanttemplate<class ForwardIterator> 336056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3373e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3383e519524SHoward Hinnant 3393e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 340056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3413e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3423e519524SHoward Hinnant 3433e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3443e519524SHoward Hinnant void 3453e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3463e519524SHoward Hinnant 3473e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3483e519524SHoward Hinnant void 3493e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3503e519524SHoward Hinnant 3513e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3523e519524SHoward Hinnant void 3533e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3543e519524SHoward Hinnant 3553e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3563e519524SHoward Hinnant void 3573e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3583e519524SHoward Hinnant 3593e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3603e519524SHoward Hinnant void 3613e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3623e519524SHoward Hinnant 3633e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3643e519524SHoward Hinnant void 3653e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3663e519524SHoward Hinnant 3673e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3683e519524SHoward Hinnant RandomAccessIterator 3693e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3703e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3713e519524SHoward Hinnant 3723e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3733e519524SHoward Hinnant RandomAccessIterator 3743e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3753e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3763e519524SHoward Hinnant 3773e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3783e519524SHoward Hinnant void 3793e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3803e519524SHoward Hinnant 3813e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3823e519524SHoward Hinnant void 3833e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3843e519524SHoward Hinnant 3853e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 386d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3873e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3883e519524SHoward Hinnant 3893e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 390d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3913e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3923e519524SHoward Hinnant 3933e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 394d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3953e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3963e519524SHoward Hinnant 3973e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 398d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3993e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4003e519524SHoward Hinnant 4013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 402d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 4033e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 4043e519524SHoward Hinnant 4053e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 406d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 4073e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4083e519524SHoward Hinnant 4093e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 410d57c03ddSMarshall Clow constexpr bool // constexpr in C++20 4113e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4123e519524SHoward Hinnant 4133e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4148da1a487SMarshall Clow constexpr bool // constexpr in C++20 4153e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4163e519524SHoward Hinnant 4173e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4183e519524SHoward Hinnant OutputIterator 4193e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4203e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4213e519524SHoward Hinnant 4223e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4233e519524SHoward Hinnant OutputIterator 4243e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4253e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4263e519524SHoward Hinnant 4273e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4283e519524SHoward Hinnant void 4293e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4303e519524SHoward Hinnant 4313e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4323e519524SHoward Hinnant void 4333e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4343e519524SHoward Hinnant 4353e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4368da1a487SMarshall Clow constexpr bool // constexpr in C++20 4373e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4383e519524SHoward Hinnant 4393e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4408da1a487SMarshall Clow constexpr bool // constexpr in C++20 4413e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4423e519524SHoward Hinnant 4433e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4443e519524SHoward Hinnant OutputIterator 4453e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4463e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4493e519524SHoward Hinnant OutputIterator 4503e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4513e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4548da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 4553e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4563e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4598da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 4603e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4613e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4623e519524SHoward Hinnant 4633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4643e519524SHoward Hinnant OutputIterator 4653e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4663e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4693e519524SHoward Hinnant OutputIterator 4703e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4713e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4743e519524SHoward Hinnant OutputIterator 4753e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4763e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4773e519524SHoward Hinnant 4783e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4793e519524SHoward Hinnant OutputIterator 4803e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4813e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4823e519524SHoward Hinnant 4833e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4843e519524SHoward Hinnant void 4853e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4863e519524SHoward Hinnant 4873e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4883e519524SHoward Hinnant void 4893e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4903e519524SHoward Hinnant 4913e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4923e519524SHoward Hinnant void 4933e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4943e519524SHoward Hinnant 4953e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4963e519524SHoward Hinnant void 4973e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4983e519524SHoward Hinnant 4993e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5003e519524SHoward Hinnant void 5013e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 5023e519524SHoward Hinnant 5033e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5043e519524SHoward Hinnant void 5053e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5063e519524SHoward Hinnant 5073e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5083e519524SHoward Hinnant void 5093e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5103e519524SHoward Hinnant 5113e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5123e519524SHoward Hinnant void 5133e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5143e519524SHoward Hinnant 5153e519524SHoward Hinnanttemplate <class RandomAccessIterator> 51649c7643cSMarshall Clow constexpr bool // constexpr in C++20 5173e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5183e519524SHoward Hinnant 5193e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 52049c7643cSMarshall Clow constexpr bool // constexpr in C++20 5213e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5223e519524SHoward Hinnant 5233e519524SHoward Hinnanttemplate <class RandomAccessIterator> 52449c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5253e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5263e519524SHoward Hinnant 5273e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 52849c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5293e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5303e519524SHoward Hinnant 5314eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5324eb27b79SHoward Hinnant ForwardIterator 5330b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5344eb27b79SHoward Hinnant 5354eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5364eb27b79SHoward Hinnant ForwardIterator 5370b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5384eb27b79SHoward Hinnant 5393e519524SHoward Hinnanttemplate <class T> 5403e519524SHoward Hinnant const T& 5419d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5423e519524SHoward Hinnant 5433e519524SHoward Hinnanttemplate <class T, class Compare> 5443e519524SHoward Hinnant const T& 5459d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5463e519524SHoward Hinnant 5473e519524SHoward Hinnanttemplate<class T> 5484eb27b79SHoward Hinnant T 5499d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5503e519524SHoward Hinnant 5513e519524SHoward Hinnanttemplate<class T, class Compare> 5524eb27b79SHoward Hinnant T 5539d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5543e519524SHoward Hinnant 555146c14acSMarshall Clowtemplate<class T> 556146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17 557146c14acSMarshall Clow 558146c14acSMarshall Clowtemplate<class T, class Compare> 559146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17 560146c14acSMarshall Clow 5613e519524SHoward Hinnanttemplate <class ForwardIterator> 5623e519524SHoward Hinnant ForwardIterator 5630b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5643e519524SHoward Hinnant 5653e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5663e519524SHoward Hinnant ForwardIterator 5670b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5683e519524SHoward Hinnant 5694eb27b79SHoward Hinnanttemplate <class T> 5704eb27b79SHoward Hinnant const T& 5719d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5724eb27b79SHoward Hinnant 5734eb27b79SHoward Hinnanttemplate <class T, class Compare> 5744eb27b79SHoward Hinnant const T& 5759d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5764eb27b79SHoward Hinnant 5774eb27b79SHoward Hinnanttemplate<class T> 5784eb27b79SHoward Hinnant T 5799d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5804eb27b79SHoward Hinnant 5814eb27b79SHoward Hinnanttemplate<class T, class Compare> 5824eb27b79SHoward Hinnant T 5839d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5844eb27b79SHoward Hinnant 5854eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5864eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5870b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5884eb27b79SHoward Hinnant 5894eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5904eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5910b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5924eb27b79SHoward Hinnant 5934eb27b79SHoward Hinnanttemplate<class T> 5944eb27b79SHoward Hinnant pair<const T&, const T&> 5959d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5964eb27b79SHoward Hinnant 5974eb27b79SHoward Hinnanttemplate<class T, class Compare> 5984eb27b79SHoward Hinnant pair<const T&, const T&> 5999d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 6004eb27b79SHoward Hinnant 6014eb27b79SHoward Hinnanttemplate<class T> 6024eb27b79SHoward Hinnant pair<T, T> 6039d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 6044eb27b79SHoward Hinnant 6054eb27b79SHoward Hinnanttemplate<class T, class Compare> 6064eb27b79SHoward Hinnant pair<T, T> 6079d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 6084eb27b79SHoward Hinnant 6093e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6101b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 6113e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6123e519524SHoward Hinnant 6133e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6141b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 6153e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6163e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6173e519524SHoward Hinnant 6183e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6193e519524SHoward Hinnant bool 6203e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6213e519524SHoward Hinnant 6223e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6233e519524SHoward Hinnant bool 6243e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6253e519524SHoward Hinnant 6263e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6273e519524SHoward Hinnant bool 6283e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6293e519524SHoward Hinnant 6303e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6313e519524SHoward Hinnant bool 6323e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6333e519524SHoward Hinnant 6343e519524SHoward Hinnant} // std 6353e519524SHoward Hinnant 6363e519524SHoward Hinnant*/ 6373e519524SHoward Hinnant 6383e519524SHoward Hinnant#include <__config> 6393e519524SHoward Hinnant#include <initializer_list> 6403e519524SHoward Hinnant#include <type_traits> 6413e519524SHoward Hinnant#include <cstring> 642f07dd8d0SEric Fiselier#include <utility> // needed to provide swap_ranges. 6433e519524SHoward Hinnant#include <memory> 644d835e592SMarshall Clow#include <functional> 6453e519524SHoward Hinnant#include <iterator> 646a1d07d57SHoward Hinnant#include <cstddef> 647e02ee4f0SMarshall Clow#include <bit> 648f56972e2SMarshall Clow#include <version> 6495d1a701dSHoward Hinnant 650c1bd9197SEric Fiselier#include <__debug> 651c1bd9197SEric Fiselier 652073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6533e519524SHoward Hinnant#pragma GCC system_header 654073458b1SHoward Hinnant#endif 6553e519524SHoward Hinnant 656a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 657a016efb1SEric Fiselier#include <__undef_macros> 658a016efb1SEric Fiselier 659a016efb1SEric Fiselier 6603e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6613e519524SHoward Hinnant 6629d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6639d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6649d67c6d5SMarshall Clow// * We haven't included <functional> here. 6653e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6663e519524SHoward Hinnantstruct __equal_to 6673e519524SHoward Hinnant{ 668d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 669d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 670d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 671d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6723e519524SHoward Hinnant}; 6733e519524SHoward Hinnant 6743e519524SHoward Hinnanttemplate <class _T1> 6753e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6763e519524SHoward Hinnant{ 6779d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6789d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6793e519524SHoward Hinnant}; 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class _T1> 6823e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6833e519524SHoward Hinnant{ 6849d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6859d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6863e519524SHoward Hinnant}; 6873e519524SHoward Hinnant 6883e519524SHoward Hinnanttemplate <class _T1> 6893e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6903e519524SHoward Hinnant{ 6919d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6929d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6933e519524SHoward Hinnant}; 6943e519524SHoward Hinnant 6953e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6963e519524SHoward Hinnantstruct __less 6973e519524SHoward Hinnant{ 6989d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6999d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7009d67c6d5SMarshall Clow 7019d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7029d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7039d67c6d5SMarshall Clow 7049d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7059d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7069d67c6d5SMarshall Clow 7079d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7089d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7093e519524SHoward Hinnant}; 7103e519524SHoward Hinnant 7113e519524SHoward Hinnanttemplate <class _T1> 7123e519524SHoward Hinnantstruct __less<_T1, _T1> 7133e519524SHoward Hinnant{ 7149d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7159d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7163e519524SHoward Hinnant}; 7173e519524SHoward Hinnant 7183e519524SHoward Hinnanttemplate <class _T1> 7193e519524SHoward Hinnantstruct __less<const _T1, _T1> 7203e519524SHoward Hinnant{ 7219d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7229d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7233e519524SHoward Hinnant}; 7243e519524SHoward Hinnant 7253e519524SHoward Hinnanttemplate <class _T1> 7263e519524SHoward Hinnantstruct __less<_T1, const _T1> 7273e519524SHoward Hinnant{ 7289d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7299d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7303e519524SHoward Hinnant}; 7313e519524SHoward Hinnant 7323e519524SHoward Hinnanttemplate <class _Predicate> 733a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7343e519524SHoward Hinnant{ 7353e519524SHoward Hinnantprivate: 7363e519524SHoward Hinnant _Predicate __p_; 7373e519524SHoward Hinnantpublic: 738a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7393e519524SHoward Hinnant 7403e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 741a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7423e519524SHoward Hinnant 7433e519524SHoward Hinnant template <class _T1> 7443e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7453e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7463e519524SHoward Hinnant 7473e519524SHoward Hinnant template <class _T1, class _T2> 7483e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 749a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7503e519524SHoward Hinnant}; 7513e519524SHoward Hinnant 75204695a75SLouis Dionne// Perform division by two quickly for positive integers (llvm.org/PR39129) 75304695a75SLouis Dionne 75404695a75SLouis Dionnetemplate <typename _Integral> 75504695a75SLouis Dionne_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 75604695a75SLouis Dionnetypename enable_if 75704695a75SLouis Dionne< 75804695a75SLouis Dionne is_integral<_Integral>::value, 75904695a75SLouis Dionne _Integral 76004695a75SLouis Dionne>::type 76104695a75SLouis Dionne__half_positive(_Integral __value) 76204695a75SLouis Dionne{ 76304695a75SLouis Dionne return static_cast<_Integral>(static_cast<typename make_unsigned<_Integral>::type>(__value) / 2); 76404695a75SLouis Dionne} 76504695a75SLouis Dionne 76604695a75SLouis Dionnetemplate <typename _Tp> 76704695a75SLouis Dionne_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 76804695a75SLouis Dionnetypename enable_if 76904695a75SLouis Dionne< 77004695a75SLouis Dionne !is_integral<_Tp>::value, 77104695a75SLouis Dionne _Tp 77204695a75SLouis Dionne>::type 77304695a75SLouis Dionne__half_positive(_Tp __value) 77404695a75SLouis Dionne{ 77504695a75SLouis Dionne return __value / 2; 77604695a75SLouis Dionne} 77704695a75SLouis Dionne 778145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7793e519524SHoward Hinnant 7803e519524SHoward Hinnanttemplate <class _Compare> 7813e519524SHoward Hinnantstruct __debug_less 7823e519524SHoward Hinnant{ 7833e519524SHoward Hinnant _Compare __comp_; 7843e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 785331d2159SEric Fiselier 7863e519524SHoward Hinnant template <class _Tp, class _Up> 7873e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7883e519524SHoward Hinnant { 7893e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7903e519524SHoward Hinnant if (__r) 791331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7923e519524SHoward Hinnant return __r; 7933e519524SHoward Hinnant } 794331d2159SEric Fiselier 795331d2159SEric Fiselier template <class _LHS, class _RHS> 796331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 797331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 798331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 799331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 800331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 801331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 802331d2159SEric Fiselier } 803331d2159SEric Fiselier 804331d2159SEric Fiselier template <class _LHS, class _RHS> 805331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 806331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 8073e519524SHoward Hinnant}; 8083e519524SHoward Hinnant 809145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 8103e519524SHoward Hinnant 8113e519524SHoward Hinnant// all_of 8123e519524SHoward Hinnant 8133e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 814706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8153e519524SHoward Hinnantbool 8163e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8173e519524SHoward Hinnant{ 8183e519524SHoward Hinnant for (; __first != __last; ++__first) 8193e519524SHoward Hinnant if (!__pred(*__first)) 8203e519524SHoward Hinnant return false; 8213e519524SHoward Hinnant return true; 8223e519524SHoward Hinnant} 8233e519524SHoward Hinnant 8243e519524SHoward Hinnant// any_of 8253e519524SHoward Hinnant 8263e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 827706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8283e519524SHoward Hinnantbool 8293e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8303e519524SHoward Hinnant{ 8313e519524SHoward Hinnant for (; __first != __last; ++__first) 8323e519524SHoward Hinnant if (__pred(*__first)) 8333e519524SHoward Hinnant return true; 8343e519524SHoward Hinnant return false; 8353e519524SHoward Hinnant} 8363e519524SHoward Hinnant 8373e519524SHoward Hinnant// none_of 8383e519524SHoward Hinnant 8393e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 840706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8413e519524SHoward Hinnantbool 8423e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8433e519524SHoward Hinnant{ 8443e519524SHoward Hinnant for (; __first != __last; ++__first) 8453e519524SHoward Hinnant if (__pred(*__first)) 8463e519524SHoward Hinnant return false; 8473e519524SHoward Hinnant return true; 8483e519524SHoward Hinnant} 8493e519524SHoward Hinnant 8503e519524SHoward Hinnant// for_each 8513e519524SHoward Hinnant 8523e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8531b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8543e519524SHoward Hinnant_Function 8553e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8563e519524SHoward Hinnant{ 8573e519524SHoward Hinnant for (; __first != __last; ++__first) 8583e519524SHoward Hinnant __f(*__first); 8591c7fe126SMarshall Clow return __f; 8603e519524SHoward Hinnant} 8613e519524SHoward Hinnant 8621d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 863d5c65ffaSMarshall Clow// for_each_n 864d5c65ffaSMarshall Clow 865d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 8661b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 867d5c65ffaSMarshall Clow_InputIterator 868d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 869d5c65ffaSMarshall Clow{ 870d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 871d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 872d5c65ffaSMarshall Clow while (__n > 0) 873d5c65ffaSMarshall Clow { 874d5c65ffaSMarshall Clow __f(*__first); 875d5c65ffaSMarshall Clow ++__first; 876d5c65ffaSMarshall Clow --__n; 877d5c65ffaSMarshall Clow } 878d5c65ffaSMarshall Clow return __first; 879d5c65ffaSMarshall Clow} 8801d02996dSMarshall Clow#endif 881d5c65ffaSMarshall Clow 8823e519524SHoward Hinnant// find 8833e519524SHoward Hinnant 8843e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 88549c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8863e519524SHoward Hinnant_InputIterator 887e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8883e519524SHoward Hinnant{ 8893e519524SHoward Hinnant for (; __first != __last; ++__first) 890e4383379SHoward Hinnant if (*__first == __value_) 8913e519524SHoward Hinnant break; 8923e519524SHoward Hinnant return __first; 8933e519524SHoward Hinnant} 8943e519524SHoward Hinnant 8953e519524SHoward Hinnant// find_if 8963e519524SHoward Hinnant 8973e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 89849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8993e519524SHoward Hinnant_InputIterator 9003e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9013e519524SHoward Hinnant{ 9023e519524SHoward Hinnant for (; __first != __last; ++__first) 9033e519524SHoward Hinnant if (__pred(*__first)) 9043e519524SHoward Hinnant break; 9053e519524SHoward Hinnant return __first; 9063e519524SHoward Hinnant} 9073e519524SHoward Hinnant 9083e519524SHoward Hinnant// find_if_not 9093e519524SHoward Hinnant 9103e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9118694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9123e519524SHoward Hinnant_InputIterator 9133e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9143e519524SHoward Hinnant{ 9153e519524SHoward Hinnant for (; __first != __last; ++__first) 9163e519524SHoward Hinnant if (!__pred(*__first)) 9173e519524SHoward Hinnant break; 9183e519524SHoward Hinnant return __first; 9193e519524SHoward Hinnant} 9203e519524SHoward Hinnant 9213e519524SHoward Hinnant// find_end 9223e519524SHoward Hinnant 9233e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9248694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 9253e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9263e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9273e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9283e519524SHoward Hinnant{ 9293e519524SHoward Hinnant // modeled after search algorithm 9303e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9313e519524SHoward Hinnant if (__first2 == __last2) 9323e519524SHoward Hinnant return __r; 9333e519524SHoward Hinnant while (true) 9343e519524SHoward Hinnant { 9353e519524SHoward Hinnant while (true) 9363e519524SHoward Hinnant { 9373e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9383e519524SHoward Hinnant return __r; // (or __last1 if never found) 9393e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9403e519524SHoward Hinnant break; 9413e519524SHoward Hinnant ++__first1; 9423e519524SHoward Hinnant } 9433e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9443e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9453e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9463e519524SHoward Hinnant while (true) 9473e519524SHoward Hinnant { 9483e519524SHoward Hinnant if (++__m2 == __last2) 9493e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9503e519524SHoward Hinnant __r = __first1; 9513e519524SHoward Hinnant ++__first1; 9523e519524SHoward Hinnant break; 9533e519524SHoward Hinnant } 9543e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9553e519524SHoward Hinnant return __r; 9563e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9573e519524SHoward Hinnant { 9583e519524SHoward Hinnant ++__first1; 9593e519524SHoward Hinnant break; 9603e519524SHoward Hinnant } // else there is a match, check next elements 9613e519524SHoward Hinnant } 9623e519524SHoward Hinnant } 9633e519524SHoward Hinnant} 9643e519524SHoward Hinnant 9653e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9668694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 9673e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9683e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9693e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9703e519524SHoward Hinnant{ 9713e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9723e519524SHoward Hinnant if (__first2 == __last2) 9733e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9743e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9753e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9763e519524SHoward Hinnant --__l2; 9773e519524SHoward Hinnant while (true) 9783e519524SHoward Hinnant { 9793e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9803e519524SHoward Hinnant while (true) 9813e519524SHoward Hinnant { 9823e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9833e519524SHoward Hinnant return __last1; 9843e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9853e519524SHoward Hinnant break; 9863e519524SHoward Hinnant } 9873e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9883e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9893e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9903e519524SHoward Hinnant while (true) 9913e519524SHoward Hinnant { 9923e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9933e519524SHoward Hinnant return __m1; 9943e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9953e519524SHoward Hinnant return __last1; 9963e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9973e519524SHoward Hinnant { 9983e519524SHoward Hinnant break; 9993e519524SHoward Hinnant } // else there is a match, check next elements 10003e519524SHoward Hinnant } 10013e519524SHoward Hinnant } 10023e519524SHoward Hinnant} 10033e519524SHoward Hinnant 10043e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10059b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10063e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10073e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10083e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10093e519524SHoward Hinnant{ 10103e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10113e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10123e519524SHoward Hinnant if (__len2 == 0) 10133e519524SHoward Hinnant return __last1; 10143e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10153e519524SHoward Hinnant if (__len1 < __len2) 10163e519524SHoward Hinnant return __last1; 10173e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 10183e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10193e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10203e519524SHoward Hinnant --__l2; 10213e519524SHoward Hinnant while (true) 10223e519524SHoward Hinnant { 10233e519524SHoward Hinnant while (true) 10243e519524SHoward Hinnant { 10253e519524SHoward Hinnant if (__s == __l1) 10263e519524SHoward Hinnant return __last1; 10273e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10283e519524SHoward Hinnant break; 10293e519524SHoward Hinnant } 10303e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10313e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10323e519524SHoward Hinnant while (true) 10333e519524SHoward Hinnant { 10343e519524SHoward Hinnant if (__m2 == __first2) 10353e519524SHoward Hinnant return __m1; 10363e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10373e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10383e519524SHoward Hinnant { 10393e519524SHoward Hinnant break; 10403e519524SHoward Hinnant } 10413e519524SHoward Hinnant } 10423e519524SHoward Hinnant } 10433e519524SHoward Hinnant} 10443e519524SHoward Hinnant 10453e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10468694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10473e519524SHoward Hinnant_ForwardIterator1 10483e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10493e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10503e519524SHoward Hinnant{ 1051ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10523e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10533e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10543e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10553e519524SHoward Hinnant} 10563e519524SHoward Hinnant 10573e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10588694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10593e519524SHoward Hinnant_ForwardIterator1 10603e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10613e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10623e519524SHoward Hinnant{ 10633e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1065ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10663e519524SHoward Hinnant} 10673e519524SHoward Hinnant 10683e519524SHoward Hinnant// find_first_of 10693e519524SHoward Hinnant 10703e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10719b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 10729b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10733e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10743e519524SHoward Hinnant{ 10753e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10763e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10773e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10783e519524SHoward Hinnant return __first1; 10793e519524SHoward Hinnant return __last1; 10803e519524SHoward Hinnant} 10813e519524SHoward Hinnant 10829b0af34dSMarshall Clow 10839b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10848694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10859b0af34dSMarshall Clow_ForwardIterator1 10869b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10879b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10889b0af34dSMarshall Clow{ 10899b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 10909b0af34dSMarshall Clow} 10919b0af34dSMarshall Clow 10923e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10938694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10943e519524SHoward Hinnant_ForwardIterator1 10953e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10963e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10973e519524SHoward Hinnant{ 10983e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10993e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11009b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11013e519524SHoward Hinnant} 11023e519524SHoward Hinnant 11033e519524SHoward Hinnant// adjacent_find 11043e519524SHoward Hinnant 11053e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11068694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11073e519524SHoward Hinnant_ForwardIterator 11083e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11093e519524SHoward Hinnant{ 11103e519524SHoward Hinnant if (__first != __last) 11113e519524SHoward Hinnant { 11123e519524SHoward Hinnant _ForwardIterator __i = __first; 11133e519524SHoward Hinnant while (++__i != __last) 11143e519524SHoward Hinnant { 11153e519524SHoward Hinnant if (__pred(*__first, *__i)) 11163e519524SHoward Hinnant return __first; 11173e519524SHoward Hinnant __first = __i; 11183e519524SHoward Hinnant } 11193e519524SHoward Hinnant } 11203e519524SHoward Hinnant return __last; 11213e519524SHoward Hinnant} 11223e519524SHoward Hinnant 11233e519524SHoward Hinnanttemplate <class _ForwardIterator> 11248694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11253e519524SHoward Hinnant_ForwardIterator 11263e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11273e519524SHoward Hinnant{ 11283e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1129ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11303e519524SHoward Hinnant} 11313e519524SHoward Hinnant 11323e519524SHoward Hinnant// count 11333e519524SHoward Hinnant 11343e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 1135056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11363e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1137e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11383e519524SHoward Hinnant{ 11393e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11403e519524SHoward Hinnant for (; __first != __last; ++__first) 1141e4383379SHoward Hinnant if (*__first == __value_) 11423e519524SHoward Hinnant ++__r; 11433e519524SHoward Hinnant return __r; 11443e519524SHoward Hinnant} 11453e519524SHoward Hinnant 11463e519524SHoward Hinnant// count_if 11473e519524SHoward Hinnant 11483e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 1149056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11503e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11513e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11523e519524SHoward Hinnant{ 11533e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11543e519524SHoward Hinnant for (; __first != __last; ++__first) 11553e519524SHoward Hinnant if (__pred(*__first)) 11563e519524SHoward Hinnant ++__r; 11573e519524SHoward Hinnant return __r; 11583e519524SHoward Hinnant} 11593e519524SHoward Hinnant 11603e519524SHoward Hinnant// mismatch 11613e519524SHoward Hinnant 11623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11636538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11643e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11653e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11663e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11673e519524SHoward Hinnant{ 1168bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 11693e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11703e519524SHoward Hinnant break; 11713e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11723e519524SHoward Hinnant} 11733e519524SHoward Hinnant 11743e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11756538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11763e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11773e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11783e519524SHoward Hinnant{ 11793e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11803e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1181ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11823e519524SHoward Hinnant} 11833e519524SHoward Hinnant 11840b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11850b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11866538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11870b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11880b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11890b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11900b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11910b0bbd2fSMarshall Clow{ 1192bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 11930b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11940b0bbd2fSMarshall Clow break; 11950b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11960b0bbd2fSMarshall Clow} 11970b0bbd2fSMarshall Clow 11980b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11996538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12000b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12010b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12020b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12030b0bbd2fSMarshall Clow{ 12040b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12050b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12060b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12070b0bbd2fSMarshall Clow} 12080b0bbd2fSMarshall Clow#endif 12090b0bbd2fSMarshall Clow 12103e519524SHoward Hinnant// equal 12113e519524SHoward Hinnant 12123e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12136538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12143e519524SHoward Hinnantbool 12153e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12163e519524SHoward Hinnant{ 1217910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12183e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12193e519524SHoward Hinnant return false; 12203e519524SHoward Hinnant return true; 12213e519524SHoward Hinnant} 12223e519524SHoward Hinnant 12233e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12246538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12253e519524SHoward Hinnantbool 12263e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12273e519524SHoward Hinnant{ 12283e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12293e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1230ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12313e519524SHoward Hinnant} 12323e519524SHoward Hinnant 12330b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12340b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12356538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12360b0bbd2fSMarshall Clowbool 12370b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12380b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12390b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12400b0bbd2fSMarshall Clow{ 1241910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12420b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12430b0bbd2fSMarshall Clow return false; 12440b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12450b0bbd2fSMarshall Clow} 12460b0bbd2fSMarshall Clow 12470b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12486538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12490b0bbd2fSMarshall Clowbool 12500b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12510b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12520b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12530b0bbd2fSMarshall Clow{ 12540b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12550b0bbd2fSMarshall Clow return false; 12560b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12570b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12580b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12590b0bbd2fSMarshall Clow} 12600b0bbd2fSMarshall Clow 12610b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12626538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12630b0bbd2fSMarshall Clowbool 12640b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12650b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12660b0bbd2fSMarshall Clow{ 12670b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12680b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12690b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12700b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12710b0bbd2fSMarshall Clow} 12720b0bbd2fSMarshall Clow 12730b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12746538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12750b0bbd2fSMarshall Clowbool 12760b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12770b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12780b0bbd2fSMarshall Clow{ 12790b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12800b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12810b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12820b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12830b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12840b0bbd2fSMarshall Clow} 12850b0bbd2fSMarshall Clow#endif 12860b0bbd2fSMarshall Clow 12873e519524SHoward Hinnant// is_permutation 12883e519524SHoward Hinnant 12893e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 129049c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 12913e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12923e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12933e519524SHoward Hinnant{ 129449c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1295910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12963e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 129749c7643cSMarshall Clow break; 129849c7643cSMarshall Clow if (__first1 == __last1) 12993e519524SHoward Hinnant return true; 130049c7643cSMarshall Clow 13013e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 13023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1303ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 13043e519524SHoward Hinnant if (__l1 == _D1(1)) 13053e519524SHoward Hinnant return false; 1306ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13073e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13083e519524SHoward Hinnant // equal elements in [f2, l2) 13093e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13103e519524SHoward Hinnant { 13113e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 1312939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1313939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1314939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1315939b1623SPeter Collingbourne break; 1316939b1623SPeter Collingbourne if (__match == __i) { 13173e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13183e519524SHoward Hinnant _D1 __c2 = 0; 13193e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13203e519524SHoward Hinnant if (__pred(*__i, *__j)) 13213e519524SHoward Hinnant ++__c2; 13223e519524SHoward Hinnant if (__c2 == 0) 13233e519524SHoward Hinnant return false; 13243e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13253e519524SHoward Hinnant _D1 __c1 = 1; 1326ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13273e519524SHoward Hinnant if (__pred(*__i, *__j)) 13283e519524SHoward Hinnant ++__c1; 13293e519524SHoward Hinnant if (__c1 != __c2) 13303e519524SHoward Hinnant return false; 13313e519524SHoward Hinnant } 13323e519524SHoward Hinnant } 13333e519524SHoward Hinnant return true; 13343e519524SHoward Hinnant} 13353e519524SHoward Hinnant 13363e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 133749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13383e519524SHoward Hinnantbool 13393e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13403e519524SHoward Hinnant _ForwardIterator2 __first2) 13413e519524SHoward Hinnant{ 13423e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13433e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1344ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13453e519524SHoward Hinnant} 13463e519524SHoward Hinnant 13470b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13480b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 134949c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13500b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13510b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13520b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13530b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13540b0bbd2fSMarshall Clow{ 135549c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1356847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13570b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 135849c7643cSMarshall Clow break; 135949c7643cSMarshall Clow if (__first1 == __last1) 136049c7643cSMarshall Clow return __first2 == __last2; 136149c7643cSMarshall Clow else if (__first2 == __last2) 136249c7643cSMarshall Clow return false; 136349c7643cSMarshall Clow 13640b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13650b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13660b0bbd2fSMarshall Clow 13670b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1368fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13690b0bbd2fSMarshall Clow if (__l1 != __l2) 13700b0bbd2fSMarshall Clow return false; 13710b0bbd2fSMarshall Clow 13720b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13730b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13740b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13750b0bbd2fSMarshall Clow { 13760b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1377939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1378939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1379939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1380939b1623SPeter Collingbourne break; 1381939b1623SPeter Collingbourne if (__match == __i) { 13820b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13830b0bbd2fSMarshall Clow _D1 __c2 = 0; 13840b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13850b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13860b0bbd2fSMarshall Clow ++__c2; 13870b0bbd2fSMarshall Clow if (__c2 == 0) 13880b0bbd2fSMarshall Clow return false; 13890b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13900b0bbd2fSMarshall Clow _D1 __c1 = 1; 13910b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13920b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13930b0bbd2fSMarshall Clow ++__c1; 13940b0bbd2fSMarshall Clow if (__c1 != __c2) 13950b0bbd2fSMarshall Clow return false; 13960b0bbd2fSMarshall Clow } 13970b0bbd2fSMarshall Clow } 13980b0bbd2fSMarshall Clow return true; 13990b0bbd2fSMarshall Clow} 14000b0bbd2fSMarshall Clow 14010b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 140249c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14030b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 14040b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 14050b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14060b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 14070b0bbd2fSMarshall Clow{ 14080b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14090b0bbd2fSMarshall Clow return false; 14100b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14110b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14120b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14130b0bbd2fSMarshall Clow} 14140b0bbd2fSMarshall Clow 14150b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 141649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14170b0bbd2fSMarshall Clowbool 14180b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14190b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14200b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 14210b0bbd2fSMarshall Clow{ 14220b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14230b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14240b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14250b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14260b0bbd2fSMarshall Clow} 14270b0bbd2fSMarshall Clow 14280b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 142949c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14300b0bbd2fSMarshall Clowbool 14310b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14320b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14330b0bbd2fSMarshall Clow{ 14340b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14350b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14360b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14370b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14380b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14390b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14400b0bbd2fSMarshall Clow} 14410b0bbd2fSMarshall Clow#endif 14420b0bbd2fSMarshall Clow 14433e519524SHoward Hinnant// search 1444d835e592SMarshall Clow// __search is in <functional> 14453e519524SHoward Hinnant 14463e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 144712f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14483e519524SHoward Hinnant_ForwardIterator1 14493e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14503e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 14513e519524SHoward Hinnant{ 1452ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 14533e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 145428cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 145528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 145628cc4ddeSMarshall Clow .first; 14573e519524SHoward Hinnant} 14583e519524SHoward Hinnant 14593e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 146012f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14613e519524SHoward Hinnant_ForwardIterator1 14623e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14633e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14643e519524SHoward Hinnant{ 146528cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 146628cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1467ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 14683e519524SHoward Hinnant} 14693e519524SHoward Hinnant 1470d835e592SMarshall Clow 1471d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1472d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 147312f0a779SMarshall Clow_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1474d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1475d835e592SMarshall Clow{ return __s(__f, __l).first; } 1476d835e592SMarshall Clow#endif 1477d835e592SMarshall Clow 14783e519524SHoward Hinnant// search_n 14793e519524SHoward Hinnant 14803e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 148112f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 14823e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1483e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 14843e519524SHoward Hinnant{ 14853e519524SHoward Hinnant if (__count <= 0) 14863e519524SHoward Hinnant return __first; 14873e519524SHoward Hinnant while (true) 14883e519524SHoward Hinnant { 1489e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 14903e519524SHoward Hinnant while (true) 14913e519524SHoward Hinnant { 1492e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 14933e519524SHoward Hinnant return __last; 1494e4383379SHoward Hinnant if (__pred(*__first, __value_)) 14953e519524SHoward Hinnant break; 14963e519524SHoward Hinnant ++__first; 14973e519524SHoward Hinnant } 1498e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 14993e519524SHoward Hinnant _ForwardIterator __m = __first; 15003e519524SHoward Hinnant _Size __c(0); 15013e519524SHoward Hinnant while (true) 15023e519524SHoward Hinnant { 15033e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15043e519524SHoward Hinnant return __first; 15053e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15063e519524SHoward Hinnant return __last; 1507e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15083e519524SHoward Hinnant { 15093e519524SHoward Hinnant __first = __m; 15103e519524SHoward Hinnant ++__first; 15113e519524SHoward Hinnant break; 15123e519524SHoward Hinnant } // else there is a match, check next elements 15133e519524SHoward Hinnant } 15143e519524SHoward Hinnant } 15153e519524SHoward Hinnant} 15163e519524SHoward Hinnant 15173e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 151812f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 15193e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1520e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15213e519524SHoward Hinnant{ 15223e519524SHoward Hinnant if (__count <= 0) 15233e519524SHoward Hinnant return __first; 15243e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 15253e519524SHoward Hinnant if (__len < __count) 15263e519524SHoward Hinnant return __last; 15273e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 15283e519524SHoward Hinnant while (true) 15293e519524SHoward Hinnant { 1530e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15313e519524SHoward Hinnant while (true) 15323e519524SHoward Hinnant { 1533b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 15343e519524SHoward Hinnant return __last; 1535e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15363e519524SHoward Hinnant break; 15373e519524SHoward Hinnant ++__first; 15383e519524SHoward Hinnant } 1539e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15403e519524SHoward Hinnant _RandomAccessIterator __m = __first; 15413e519524SHoward Hinnant _Size __c(0); 15423e519524SHoward Hinnant while (true) 15433e519524SHoward Hinnant { 15443e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15453e519524SHoward Hinnant return __first; 15463e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1547e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15483e519524SHoward Hinnant { 15493e519524SHoward Hinnant __first = __m; 15503e519524SHoward Hinnant ++__first; 15513e519524SHoward Hinnant break; 15523e519524SHoward Hinnant } // else there is a match, check next elements 15533e519524SHoward Hinnant } 15543e519524SHoward Hinnant } 15553e519524SHoward Hinnant} 15563e519524SHoward Hinnant 15573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 155812f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15593e519524SHoward Hinnant_ForwardIterator 15603e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1561e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 15623e519524SHoward Hinnant{ 1563ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 156451544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 156551544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 15663e519524SHoward Hinnant} 15673e519524SHoward Hinnant 15683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 156912f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15703e519524SHoward Hinnant_ForwardIterator 1571e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 15723e519524SHoward Hinnant{ 15733e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 157451544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 157551544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 15763e519524SHoward Hinnant} 15773e519524SHoward Hinnant 15783e519524SHoward Hinnant// copy 15793e519524SHoward Hinnanttemplate <class _Iter> 15803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15813e519524SHoward Hinnant_Iter 15823e519524SHoward Hinnant__unwrap_iter(_Iter __i) 15833e519524SHoward Hinnant{ 15843e519524SHoward Hinnant return __i; 15853e519524SHoward Hinnant} 15863e519524SHoward Hinnant 15873e519524SHoward Hinnanttemplate <class _Tp> 15885b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15893e519524SHoward Hinnanttypename enable_if 15903e519524SHoward Hinnant< 1591ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 15923e519524SHoward Hinnant _Tp* 15933e519524SHoward Hinnant>::type 15943e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 15953e519524SHoward Hinnant{ 15963e519524SHoward Hinnant return __i.base(); 15973e519524SHoward Hinnant} 15983e519524SHoward Hinnant 1599fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1600fc88dbd2SHoward Hinnant 16013e519524SHoward Hinnanttemplate <class _Tp> 16029cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 16033e519524SHoward Hinnanttypename enable_if 16043e519524SHoward Hinnant< 1605ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16063e519524SHoward Hinnant _Tp* 16073e519524SHoward Hinnant>::type 16083e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16093e519524SHoward Hinnant{ 16103e519524SHoward Hinnant return __i.base(); 16113e519524SHoward Hinnant} 16123e519524SHoward Hinnant 161314bd0bf0SEric Fiselier#else 161414bd0bf0SEric Fiselier 161514bd0bf0SEric Fiseliertemplate <class _Tp> 16169cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 161714bd0bf0SEric Fiseliertypename enable_if 161814bd0bf0SEric Fiselier< 161914bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 162014bd0bf0SEric Fiselier __wrap_iter<_Tp*> 162114bd0bf0SEric Fiselier>::type 162214bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 162314bd0bf0SEric Fiselier{ 162414bd0bf0SEric Fiselier return __i; 162514bd0bf0SEric Fiselier} 162614bd0bf0SEric Fiselier 1627fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1628fc88dbd2SHoward Hinnant 16293e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16313e519524SHoward Hinnant_OutputIterator 16323e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16333e519524SHoward Hinnant{ 1634910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 16353e519524SHoward Hinnant *__result = *__first; 16363e519524SHoward Hinnant return __result; 16373e519524SHoward Hinnant} 16383e519524SHoward Hinnant 16393e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16413e519524SHoward Hinnanttypename enable_if 16423e519524SHoward Hinnant< 16433e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1644ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16453e519524SHoward Hinnant _Up* 16463e519524SHoward Hinnant>::type 16473e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 16483e519524SHoward Hinnant{ 16493e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16505b312052SMarshall Clow if (__n > 0) 1651ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16523e519524SHoward Hinnant return __result + __n; 16533e519524SHoward Hinnant} 16543e519524SHoward Hinnant 16553e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16573e519524SHoward Hinnant_OutputIterator 16583e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16593e519524SHoward Hinnant{ 1660ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16613e519524SHoward Hinnant} 16623e519524SHoward Hinnant 16633e519524SHoward Hinnant// copy_backward 16643e519524SHoward Hinnant 1665d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 16663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16673e519524SHoward Hinnant_OutputIterator 1668d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 16693e519524SHoward Hinnant{ 16703e519524SHoward Hinnant while (__first != __last) 16713e519524SHoward Hinnant *--__result = *--__last; 16723e519524SHoward Hinnant return __result; 16733e519524SHoward Hinnant} 16743e519524SHoward Hinnant 16753e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16773e519524SHoward Hinnanttypename enable_if 16783e519524SHoward Hinnant< 16793e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1680ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16813e519524SHoward Hinnant _Up* 16823e519524SHoward Hinnant>::type 16833e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 16843e519524SHoward Hinnant{ 16853e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16865b312052SMarshall Clow if (__n > 0) 16875b312052SMarshall Clow { 16883e519524SHoward Hinnant __result -= __n; 1689ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16905b312052SMarshall Clow } 16913e519524SHoward Hinnant return __result; 16923e519524SHoward Hinnant} 16933e519524SHoward Hinnant 16943e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 16953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16963e519524SHoward Hinnant_BidirectionalIterator2 16973e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 16983e519524SHoward Hinnant _BidirectionalIterator2 __result) 16993e519524SHoward Hinnant{ 1700fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1701fd838227SEric Fiselier __unwrap_iter(__last), 1702fd838227SEric Fiselier __unwrap_iter(__result)); 17033e519524SHoward Hinnant} 17043e519524SHoward Hinnant 17053e519524SHoward Hinnant// copy_if 17063e519524SHoward Hinnant 17073e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17093e519524SHoward Hinnant_OutputIterator 17103e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17113e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17123e519524SHoward Hinnant{ 17133e519524SHoward Hinnant for (; __first != __last; ++__first) 17143e519524SHoward Hinnant { 17153e519524SHoward Hinnant if (__pred(*__first)) 17163e519524SHoward Hinnant { 17173e519524SHoward Hinnant *__result = *__first; 17183e519524SHoward Hinnant ++__result; 17193e519524SHoward Hinnant } 17203e519524SHoward Hinnant } 17213e519524SHoward Hinnant return __result; 17223e519524SHoward Hinnant} 17233e519524SHoward Hinnant 17243e519524SHoward Hinnant// copy_n 17253e519524SHoward Hinnant 17263e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17283e519524SHoward Hinnanttypename enable_if 17293e519524SHoward Hinnant< 17303e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 17313e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 17323e519524SHoward Hinnant _OutputIterator 17333e519524SHoward Hinnant>::type 173451544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17353e519524SHoward Hinnant{ 173651544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 173751544023SEric Fiselier _IntegralSize __n = __orig_n; 173899847d2bSHoward Hinnant if (__n > 0) 173999847d2bSHoward Hinnant { 17403e519524SHoward Hinnant *__result = *__first; 174199847d2bSHoward Hinnant ++__result; 174299847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 174399847d2bSHoward Hinnant { 174499847d2bSHoward Hinnant ++__first; 174599847d2bSHoward Hinnant *__result = *__first; 174699847d2bSHoward Hinnant ++__result; 174799847d2bSHoward Hinnant } 174899847d2bSHoward Hinnant } 17493e519524SHoward Hinnant return __result; 17503e519524SHoward Hinnant} 17513e519524SHoward Hinnant 17523e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17543e519524SHoward Hinnanttypename enable_if 17553e519524SHoward Hinnant< 17563e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 17573e519524SHoward Hinnant _OutputIterator 17583e519524SHoward Hinnant>::type 175951544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17603e519524SHoward Hinnant{ 176151544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 176251544023SEric Fiselier _IntegralSize __n = __orig_n; 1763ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 17643e519524SHoward Hinnant} 17653e519524SHoward Hinnant 17663e519524SHoward Hinnant// move 17673e519524SHoward Hinnant 17683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17703e519524SHoward Hinnant_OutputIterator 17713e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17723e519524SHoward Hinnant{ 1773910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1774ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 17753e519524SHoward Hinnant return __result; 17763e519524SHoward Hinnant} 17773e519524SHoward Hinnant 17783e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17803e519524SHoward Hinnanttypename enable_if 17813e519524SHoward Hinnant< 17823e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1783ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17843e519524SHoward Hinnant _Up* 17853e519524SHoward Hinnant>::type 17863e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 17873e519524SHoward Hinnant{ 17883e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17895b312052SMarshall Clow if (__n > 0) 1790ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17913e519524SHoward Hinnant return __result + __n; 17923e519524SHoward Hinnant} 17933e519524SHoward Hinnant 17943e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17963e519524SHoward Hinnant_OutputIterator 17973e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17983e519524SHoward Hinnant{ 1799ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18003e519524SHoward Hinnant} 18013e519524SHoward Hinnant 18023e519524SHoward Hinnant// move_backward 18033e519524SHoward Hinnant 18043e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18063e519524SHoward Hinnant_OutputIterator 18073e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18083e519524SHoward Hinnant{ 18093e519524SHoward Hinnant while (__first != __last) 1810ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18113e519524SHoward Hinnant return __result; 18123e519524SHoward Hinnant} 18133e519524SHoward Hinnant 18143e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18163e519524SHoward Hinnanttypename enable_if 18173e519524SHoward Hinnant< 18183e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1819ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18203e519524SHoward Hinnant _Up* 18213e519524SHoward Hinnant>::type 18223e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18233e519524SHoward Hinnant{ 18243e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18255b312052SMarshall Clow if (__n > 0) 18265b312052SMarshall Clow { 18273e519524SHoward Hinnant __result -= __n; 1828ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18295b312052SMarshall Clow } 18303e519524SHoward Hinnant return __result; 18313e519524SHoward Hinnant} 18323e519524SHoward Hinnant 18333e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18353e519524SHoward Hinnant_BidirectionalIterator2 18363e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18373e519524SHoward Hinnant _BidirectionalIterator2 __result) 18383e519524SHoward Hinnant{ 1839ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18403e519524SHoward Hinnant} 18413e519524SHoward Hinnant 18423e519524SHoward Hinnant// iter_swap 18433e519524SHoward Hinnant 1844a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 18453e519524SHoward Hinnant 18463e519524SHoward Hinnant// transform 18473e519524SHoward Hinnant 18483e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 184999894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18503e519524SHoward Hinnant_OutputIterator 18513e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 18523e519524SHoward Hinnant{ 1853910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18543e519524SHoward Hinnant *__result = __op(*__first); 18553e519524SHoward Hinnant return __result; 18563e519524SHoward Hinnant} 18573e519524SHoward Hinnant 18583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 185999894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18603e519524SHoward Hinnant_OutputIterator 18613e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 18623e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 18633e519524SHoward Hinnant{ 1864910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 18653e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 18663e519524SHoward Hinnant return __result; 18673e519524SHoward Hinnant} 18683e519524SHoward Hinnant 18693e519524SHoward Hinnant// replace 18703e519524SHoward Hinnant 18713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 187212c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18733e519524SHoward Hinnantvoid 18743e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 18753e519524SHoward Hinnant{ 18763e519524SHoward Hinnant for (; __first != __last; ++__first) 18773e519524SHoward Hinnant if (*__first == __old_value) 18783e519524SHoward Hinnant *__first = __new_value; 18793e519524SHoward Hinnant} 18803e519524SHoward Hinnant 18813e519524SHoward Hinnant// replace_if 18823e519524SHoward Hinnant 18833e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 188412c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18853e519524SHoward Hinnantvoid 18863e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 18873e519524SHoward Hinnant{ 18883e519524SHoward Hinnant for (; __first != __last; ++__first) 18893e519524SHoward Hinnant if (__pred(*__first)) 18903e519524SHoward Hinnant *__first = __new_value; 18913e519524SHoward Hinnant} 18923e519524SHoward Hinnant 18933e519524SHoward Hinnant// replace_copy 18943e519524SHoward Hinnant 18953e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 189612c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18973e519524SHoward Hinnant_OutputIterator 18983e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 18993e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19003e519524SHoward Hinnant{ 1901910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19023e519524SHoward Hinnant if (*__first == __old_value) 19033e519524SHoward Hinnant *__result = __new_value; 19043e519524SHoward Hinnant else 19053e519524SHoward Hinnant *__result = *__first; 19063e519524SHoward Hinnant return __result; 19073e519524SHoward Hinnant} 19083e519524SHoward Hinnant 19093e519524SHoward Hinnant// replace_copy_if 19103e519524SHoward Hinnant 19113e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 191212c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19133e519524SHoward Hinnant_OutputIterator 19143e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19153e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19163e519524SHoward Hinnant{ 1917910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19183e519524SHoward Hinnant if (__pred(*__first)) 19193e519524SHoward Hinnant *__result = __new_value; 19203e519524SHoward Hinnant else 19213e519524SHoward Hinnant *__result = *__first; 19223e519524SHoward Hinnant return __result; 19233e519524SHoward Hinnant} 19243e519524SHoward Hinnant 19253e519524SHoward Hinnant// fill_n 19263e519524SHoward Hinnant 19273e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19284bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19293e519524SHoward Hinnant_OutputIterator 19300f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19313e519524SHoward Hinnant{ 1932910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 1933e4383379SHoward Hinnant *__first = __value_; 19343e519524SHoward Hinnant return __first; 19353e519524SHoward Hinnant} 19363e519524SHoward Hinnant 19373e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19384bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19393e519524SHoward Hinnant_OutputIterator 1940e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19413e519524SHoward Hinnant{ 194251544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 19433e519524SHoward Hinnant} 19443e519524SHoward Hinnant 19453e519524SHoward Hinnant// fill 19463e519524SHoward Hinnant 19473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19484bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19493e519524SHoward Hinnantvoid 1950e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 19513e519524SHoward Hinnant{ 19523e519524SHoward Hinnant for (; __first != __last; ++__first) 1953e4383379SHoward Hinnant *__first = __value_; 19543e519524SHoward Hinnant} 19553e519524SHoward Hinnant 19563e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 19574bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19583e519524SHoward Hinnantvoid 1959e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 19603e519524SHoward Hinnant{ 1961e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 19623e519524SHoward Hinnant} 19633e519524SHoward Hinnant 19643e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19654bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19663e519524SHoward Hinnantvoid 1967e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 19683e519524SHoward Hinnant{ 1969e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 19703e519524SHoward Hinnant} 19713e519524SHoward Hinnant 19723e519524SHoward Hinnant// generate 19733e519524SHoward Hinnant 19743e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 19754bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19763e519524SHoward Hinnantvoid 19773e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 19783e519524SHoward Hinnant{ 19793e519524SHoward Hinnant for (; __first != __last; ++__first) 19803e519524SHoward Hinnant *__first = __gen(); 19813e519524SHoward Hinnant} 19823e519524SHoward Hinnant 19833e519524SHoward Hinnant// generate_n 19843e519524SHoward Hinnant 19853e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 19864bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19873e519524SHoward Hinnant_OutputIterator 198851544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 19893e519524SHoward Hinnant{ 199051544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 199151544023SEric Fiselier _IntegralSize __n = __orig_n; 1992910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 19933e519524SHoward Hinnant *__first = __gen(); 19943e519524SHoward Hinnant return __first; 19953e519524SHoward Hinnant} 19963e519524SHoward Hinnant 19973e519524SHoward Hinnant// remove 19983e519524SHoward Hinnant 19993e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 2000e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2001e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20023e519524SHoward Hinnant{ 2003e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20043e519524SHoward Hinnant if (__first != __last) 20053e519524SHoward Hinnant { 20063e519524SHoward Hinnant _ForwardIterator __i = __first; 20073e519524SHoward Hinnant while (++__i != __last) 20083e519524SHoward Hinnant { 2009e4383379SHoward Hinnant if (!(*__i == __value_)) 20103e519524SHoward Hinnant { 2011ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20123e519524SHoward Hinnant ++__first; 20133e519524SHoward Hinnant } 20143e519524SHoward Hinnant } 20153e519524SHoward Hinnant } 20163e519524SHoward Hinnant return __first; 20173e519524SHoward Hinnant} 20183e519524SHoward Hinnant 20193e519524SHoward Hinnant// remove_if 20203e519524SHoward Hinnant 20213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 2022e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 20233e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 20243e519524SHoward Hinnant{ 2025ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 20263e519524SHoward Hinnant (__first, __last, __pred); 20273e519524SHoward Hinnant if (__first != __last) 20283e519524SHoward Hinnant { 20293e519524SHoward Hinnant _ForwardIterator __i = __first; 20303e519524SHoward Hinnant while (++__i != __last) 20313e519524SHoward Hinnant { 20323e519524SHoward Hinnant if (!__pred(*__i)) 20333e519524SHoward Hinnant { 2034ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20353e519524SHoward Hinnant ++__first; 20363e519524SHoward Hinnant } 20373e519524SHoward Hinnant } 20383e519524SHoward Hinnant } 20393e519524SHoward Hinnant return __first; 20403e519524SHoward Hinnant} 20413e519524SHoward Hinnant 20423e519524SHoward Hinnant// remove_copy 20433e519524SHoward Hinnant 20443e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2045e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20463e519524SHoward Hinnant_OutputIterator 2047e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 20483e519524SHoward Hinnant{ 20493e519524SHoward Hinnant for (; __first != __last; ++__first) 20503e519524SHoward Hinnant { 2051e4383379SHoward Hinnant if (!(*__first == __value_)) 20523e519524SHoward Hinnant { 20533e519524SHoward Hinnant *__result = *__first; 20543e519524SHoward Hinnant ++__result; 20553e519524SHoward Hinnant } 20563e519524SHoward Hinnant } 20573e519524SHoward Hinnant return __result; 20583e519524SHoward Hinnant} 20593e519524SHoward Hinnant 20603e519524SHoward Hinnant// remove_copy_if 20613e519524SHoward Hinnant 20623e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2063e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20643e519524SHoward Hinnant_OutputIterator 20653e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 20663e519524SHoward Hinnant{ 20673e519524SHoward Hinnant for (; __first != __last; ++__first) 20683e519524SHoward Hinnant { 20693e519524SHoward Hinnant if (!__pred(*__first)) 20703e519524SHoward Hinnant { 20713e519524SHoward Hinnant *__result = *__first; 20723e519524SHoward Hinnant ++__result; 20733e519524SHoward Hinnant } 20743e519524SHoward Hinnant } 20753e519524SHoward Hinnant return __result; 20763e519524SHoward Hinnant} 20773e519524SHoward Hinnant 20783e519524SHoward Hinnant// unique 20793e519524SHoward Hinnant 20803e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 20814bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 20823e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 20833e519524SHoward Hinnant{ 2084ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 20853e519524SHoward Hinnant (__first, __last, __pred); 20863e519524SHoward Hinnant if (__first != __last) 20873e519524SHoward Hinnant { 20883e519524SHoward Hinnant // ... a a ? ... 20893e519524SHoward Hinnant // f i 20903e519524SHoward Hinnant _ForwardIterator __i = __first; 20913e519524SHoward Hinnant for (++__i; ++__i != __last;) 20923e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2093ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 20943e519524SHoward Hinnant ++__first; 20953e519524SHoward Hinnant } 20963e519524SHoward Hinnant return __first; 20973e519524SHoward Hinnant} 20983e519524SHoward Hinnant 20993e519524SHoward Hinnanttemplate <class _ForwardIterator> 21004bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21013e519524SHoward Hinnant_ForwardIterator 21023e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21033e519524SHoward Hinnant{ 21043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2105ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21063e519524SHoward Hinnant} 21073e519524SHoward Hinnant 21083e519524SHoward Hinnant// unique_copy 21093e519524SHoward Hinnant 21103e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21114bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 21123e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21133e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21143e519524SHoward Hinnant{ 21153e519524SHoward Hinnant if (__first != __last) 21163e519524SHoward Hinnant { 21173e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 21183e519524SHoward Hinnant *__result = __t; 21193e519524SHoward Hinnant ++__result; 21203e519524SHoward Hinnant while (++__first != __last) 21213e519524SHoward Hinnant { 21223e519524SHoward Hinnant if (!__pred(__t, *__first)) 21233e519524SHoward Hinnant { 21243e519524SHoward Hinnant __t = *__first; 21253e519524SHoward Hinnant *__result = __t; 21263e519524SHoward Hinnant ++__result; 21273e519524SHoward Hinnant } 21283e519524SHoward Hinnant } 21293e519524SHoward Hinnant } 21303e519524SHoward Hinnant return __result; 21313e519524SHoward Hinnant} 21323e519524SHoward Hinnant 21333e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 21344bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 21353e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21363e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 21373e519524SHoward Hinnant{ 21383e519524SHoward Hinnant if (__first != __last) 21393e519524SHoward Hinnant { 21403e519524SHoward Hinnant _ForwardIterator __i = __first; 21413e519524SHoward Hinnant *__result = *__i; 21423e519524SHoward Hinnant ++__result; 21433e519524SHoward Hinnant while (++__first != __last) 21443e519524SHoward Hinnant { 21453e519524SHoward Hinnant if (!__pred(*__i, *__first)) 21463e519524SHoward Hinnant { 21473e519524SHoward Hinnant *__result = *__first; 21483e519524SHoward Hinnant ++__result; 21493e519524SHoward Hinnant __i = __first; 21503e519524SHoward Hinnant } 21513e519524SHoward Hinnant } 21523e519524SHoward Hinnant } 21533e519524SHoward Hinnant return __result; 21543e519524SHoward Hinnant} 21553e519524SHoward Hinnant 21563e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 21574bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21583e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 21593e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 21603e519524SHoward Hinnant{ 21613e519524SHoward Hinnant if (__first != __last) 21623e519524SHoward Hinnant { 21633e519524SHoward Hinnant *__result = *__first; 21643e519524SHoward Hinnant while (++__first != __last) 21653e519524SHoward Hinnant if (!__pred(*__result, *__first)) 21663e519524SHoward Hinnant *++__result = *__first; 21673e519524SHoward Hinnant ++__result; 21683e519524SHoward Hinnant } 21693e519524SHoward Hinnant return __result; 21703e519524SHoward Hinnant} 21713e519524SHoward Hinnant 21723e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 21734bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21743e519524SHoward Hinnant_OutputIterator 21753e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 21763e519524SHoward Hinnant{ 2177ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 21783e519524SHoward Hinnant (__first, __last, __result, __pred, 21793e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 21803e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 21813e519524SHoward Hinnant} 21823e519524SHoward Hinnant 21833e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 21844bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21853e519524SHoward Hinnant_OutputIterator 21863e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 21873e519524SHoward Hinnant{ 21883e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2189ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 21903e519524SHoward Hinnant} 21913e519524SHoward Hinnant 21923e519524SHoward Hinnant// reverse 21933e519524SHoward Hinnant 21943e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 21953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21963e519524SHoward Hinnantvoid 21973e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 21983e519524SHoward Hinnant{ 21993e519524SHoward Hinnant while (__first != __last) 22003e519524SHoward Hinnant { 22013e519524SHoward Hinnant if (__first == --__last) 22023e519524SHoward Hinnant break; 2203def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22043e519524SHoward Hinnant ++__first; 22053e519524SHoward Hinnant } 22063e519524SHoward Hinnant} 22073e519524SHoward Hinnant 22083e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22103e519524SHoward Hinnantvoid 22113e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22123e519524SHoward Hinnant{ 22133e519524SHoward Hinnant if (__first != __last) 22143e519524SHoward Hinnant for (; __first < --__last; ++__first) 2215def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22163e519524SHoward Hinnant} 22173e519524SHoward Hinnant 22183e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22203e519524SHoward Hinnantvoid 22213e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 22223e519524SHoward Hinnant{ 2223ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 22243e519524SHoward Hinnant} 22253e519524SHoward Hinnant 22263e519524SHoward Hinnant// reverse_copy 22273e519524SHoward Hinnant 22283e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2229e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22303e519524SHoward Hinnant_OutputIterator 22313e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 22323e519524SHoward Hinnant{ 22333e519524SHoward Hinnant for (; __first != __last; ++__result) 22343e519524SHoward Hinnant *__result = *--__last; 22353e519524SHoward Hinnant return __result; 22363e519524SHoward Hinnant} 22373e519524SHoward Hinnant 22383e519524SHoward Hinnant// rotate 22393e519524SHoward Hinnant 22403e519524SHoward Hinnanttemplate <class _ForwardIterator> 22413e519524SHoward Hinnant_ForwardIterator 2242aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 22433e519524SHoward Hinnant{ 2244aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2245aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2246aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2247aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2248aca09de3SHoward Hinnant return __lm1; 2249aca09de3SHoward Hinnant} 2250aca09de3SHoward Hinnant 2251aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2252aca09de3SHoward Hinnant_BidirectionalIterator 2253aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2254aca09de3SHoward Hinnant{ 2255aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2256aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2257aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2258aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2259aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2260aca09de3SHoward Hinnant return __fp1; 2261aca09de3SHoward Hinnant} 2262aca09de3SHoward Hinnant 2263aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2264aca09de3SHoward Hinnant_ForwardIterator 2265aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2266aca09de3SHoward Hinnant{ 22673e519524SHoward Hinnant _ForwardIterator __i = __middle; 22683e519524SHoward Hinnant while (true) 22693e519524SHoward Hinnant { 22703e519524SHoward Hinnant swap(*__first, *__i); 22713e519524SHoward Hinnant ++__first; 22723e519524SHoward Hinnant if (++__i == __last) 22733e519524SHoward Hinnant break; 22743e519524SHoward Hinnant if (__first == __middle) 22753e519524SHoward Hinnant __middle = __i; 22763e519524SHoward Hinnant } 22773e519524SHoward Hinnant _ForwardIterator __r = __first; 22783e519524SHoward Hinnant if (__first != __middle) 22793e519524SHoward Hinnant { 22803e519524SHoward Hinnant __i = __middle; 22813e519524SHoward Hinnant while (true) 22823e519524SHoward Hinnant { 22833e519524SHoward Hinnant swap(*__first, *__i); 22843e519524SHoward Hinnant ++__first; 22853e519524SHoward Hinnant if (++__i == __last) 22863e519524SHoward Hinnant { 22873e519524SHoward Hinnant if (__first == __middle) 22883e519524SHoward Hinnant break; 22893e519524SHoward Hinnant __i = __middle; 22903e519524SHoward Hinnant } 22913e519524SHoward Hinnant else if (__first == __middle) 22923e519524SHoward Hinnant __middle = __i; 22933e519524SHoward Hinnant } 22943e519524SHoward Hinnant } 22953e519524SHoward Hinnant return __r; 22963e519524SHoward Hinnant} 22973e519524SHoward Hinnant 22983e519524SHoward Hinnanttemplate<typename _Integral> 22993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23003e519524SHoward Hinnant_Integral 230119b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 23023e519524SHoward Hinnant{ 23033e519524SHoward Hinnant do 23043e519524SHoward Hinnant { 23053e519524SHoward Hinnant _Integral __t = __x % __y; 23063e519524SHoward Hinnant __x = __y; 23073e519524SHoward Hinnant __y = __t; 23083e519524SHoward Hinnant } while (__y); 23093e519524SHoward Hinnant return __x; 23103e519524SHoward Hinnant} 23113e519524SHoward Hinnant 23123e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23133e519524SHoward Hinnant_RandomAccessIterator 2314aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 23153e519524SHoward Hinnant{ 23163e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 23173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 23183e519524SHoward Hinnant 23193e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 23203e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 23213e519524SHoward Hinnant if (__m1 == __m2) 23223e519524SHoward Hinnant { 2323ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 23243e519524SHoward Hinnant return __middle; 23253e519524SHoward Hinnant } 232619b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 23273e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 23283e519524SHoward Hinnant { 2329aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 23303e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 23313e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 23323e519524SHoward Hinnant do 23333e519524SHoward Hinnant { 2334aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 23353e519524SHoward Hinnant __p1 = __p2; 23363e519524SHoward Hinnant const difference_type __d = __last - __p2; 23373e519524SHoward Hinnant if (__m1 < __d) 23383e519524SHoward Hinnant __p2 += __m1; 23393e519524SHoward Hinnant else 23403e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 23413e519524SHoward Hinnant } while (__p2 != __p); 2342aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 23433e519524SHoward Hinnant } 23443e519524SHoward Hinnant return __first + __m2; 23453e519524SHoward Hinnant} 23463e519524SHoward Hinnant 23473e519524SHoward Hinnanttemplate <class _ForwardIterator> 23483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23493e519524SHoward Hinnant_ForwardIterator 2350aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2351aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2352aca09de3SHoward Hinnant{ 2353aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2354aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2355aca09de3SHoward Hinnant { 2356aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2357aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2358aca09de3SHoward Hinnant } 2359aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2360aca09de3SHoward Hinnant} 2361aca09de3SHoward Hinnant 2362aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2363aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2364aca09de3SHoward Hinnant_BidirectionalIterator 2365aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2366aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2367aca09de3SHoward Hinnant{ 2368aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2369aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2370aca09de3SHoward Hinnant { 2371aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2372aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2373aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2374aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2375aca09de3SHoward Hinnant } 2376aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2377aca09de3SHoward Hinnant} 2378aca09de3SHoward Hinnant 2379aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2380aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2381aca09de3SHoward Hinnant_RandomAccessIterator 2382aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2383aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2384aca09de3SHoward Hinnant{ 2385aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2386aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2387aca09de3SHoward Hinnant { 2388aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2389aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2390aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2391aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2392aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2393aca09de3SHoward Hinnant } 2394aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2395aca09de3SHoward Hinnant} 2396aca09de3SHoward Hinnant 2397aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2398aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2399aca09de3SHoward Hinnant_ForwardIterator 24003e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24013e519524SHoward Hinnant{ 2402aca09de3SHoward Hinnant if (__first == __middle) 2403aca09de3SHoward Hinnant return __last; 2404aca09de3SHoward Hinnant if (__middle == __last) 2405aca09de3SHoward Hinnant return __first; 2406ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2407aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24083e519524SHoward Hinnant} 24093e519524SHoward Hinnant 24103e519524SHoward Hinnant// rotate_copy 24113e519524SHoward Hinnant 24123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24143e519524SHoward Hinnant_OutputIterator 24153e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 24163e519524SHoward Hinnant{ 2417ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 24183e519524SHoward Hinnant} 24193e519524SHoward Hinnant 24203e519524SHoward Hinnant// min_element 24213e519524SHoward Hinnant 24223e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24239d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24243e519524SHoward Hinnant_ForwardIterator 24250b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24263e519524SHoward Hinnant{ 2427a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2428a60d7facSEric Fiselier "std::min_element requires a ForwardIterator"); 24293e519524SHoward Hinnant if (__first != __last) 24303e519524SHoward Hinnant { 24313e519524SHoward Hinnant _ForwardIterator __i = __first; 24323e519524SHoward Hinnant while (++__i != __last) 24333e519524SHoward Hinnant if (__comp(*__i, *__first)) 24343e519524SHoward Hinnant __first = __i; 24353e519524SHoward Hinnant } 24363e519524SHoward Hinnant return __first; 24373e519524SHoward Hinnant} 24383e519524SHoward Hinnant 24393e519524SHoward Hinnanttemplate <class _ForwardIterator> 24400b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24413e519524SHoward Hinnant_ForwardIterator 24423e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 24433e519524SHoward Hinnant{ 24440b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 24454eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 24464eb27b79SHoward Hinnant} 24474eb27b79SHoward Hinnant 24484eb27b79SHoward Hinnant// min 24494eb27b79SHoward Hinnant 24504eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 24519d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24524eb27b79SHoward Hinnantconst _Tp& 24534eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 24544eb27b79SHoward Hinnant{ 24554eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 24564eb27b79SHoward Hinnant} 24574eb27b79SHoward Hinnant 24584eb27b79SHoward Hinnanttemplate <class _Tp> 24599d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24604eb27b79SHoward Hinnantconst _Tp& 24614eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 24624eb27b79SHoward Hinnant{ 2463ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 24644eb27b79SHoward Hinnant} 24654eb27b79SHoward Hinnant 2466ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 246754976f26SHoward Hinnant 24684eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 24699d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24704eb27b79SHoward Hinnant_Tp 24714eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 24724eb27b79SHoward Hinnant{ 24730b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 24744eb27b79SHoward Hinnant} 24754eb27b79SHoward Hinnant 24764eb27b79SHoward Hinnanttemplate<class _Tp> 24779d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24784eb27b79SHoward Hinnant_Tp 24794eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 24804eb27b79SHoward Hinnant{ 24810b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 24823e519524SHoward Hinnant} 24833e519524SHoward Hinnant 2484ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 248554976f26SHoward Hinnant 24863e519524SHoward Hinnant// max_element 24873e519524SHoward Hinnant 24883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24899d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24903e519524SHoward Hinnant_ForwardIterator 24910b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24923e519524SHoward Hinnant{ 2493a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2494a60d7facSEric Fiselier "std::max_element requires a ForwardIterator"); 24953e519524SHoward Hinnant if (__first != __last) 24963e519524SHoward Hinnant { 24973e519524SHoward Hinnant _ForwardIterator __i = __first; 24983e519524SHoward Hinnant while (++__i != __last) 24993e519524SHoward Hinnant if (__comp(*__first, *__i)) 25003e519524SHoward Hinnant __first = __i; 25013e519524SHoward Hinnant } 25023e519524SHoward Hinnant return __first; 25033e519524SHoward Hinnant} 25043e519524SHoward Hinnant 25059d67c6d5SMarshall Clow 25063e519524SHoward Hinnanttemplate <class _ForwardIterator> 25070b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25083e519524SHoward Hinnant_ForwardIterator 25093e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25103e519524SHoward Hinnant{ 25110b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 25124eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25134eb27b79SHoward Hinnant} 25144eb27b79SHoward Hinnant 25154eb27b79SHoward Hinnant// max 25164eb27b79SHoward Hinnant 25174eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25189d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25194eb27b79SHoward Hinnantconst _Tp& 25204eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 25214eb27b79SHoward Hinnant{ 25224eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 25234eb27b79SHoward Hinnant} 25244eb27b79SHoward Hinnant 25254eb27b79SHoward Hinnanttemplate <class _Tp> 25269d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25274eb27b79SHoward Hinnantconst _Tp& 25284eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 25294eb27b79SHoward Hinnant{ 2530ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 25314eb27b79SHoward Hinnant} 25324eb27b79SHoward Hinnant 2533ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 253454976f26SHoward Hinnant 25354eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25369d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25374eb27b79SHoward Hinnant_Tp 25384eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 25394eb27b79SHoward Hinnant{ 25400b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 25414eb27b79SHoward Hinnant} 25424eb27b79SHoward Hinnant 25434eb27b79SHoward Hinnanttemplate<class _Tp> 25449d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25454eb27b79SHoward Hinnant_Tp 25464eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 25474eb27b79SHoward Hinnant{ 25480b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 25493e519524SHoward Hinnant} 25503e519524SHoward Hinnant 2551ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 255254976f26SHoward Hinnant 2553146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2554146c14acSMarshall Clow// clamp 2555146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2556146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2557146c14acSMarshall Clowconst _Tp& 2558146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2559146c14acSMarshall Clow{ 2560146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2561146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2562146c14acSMarshall Clow 2563146c14acSMarshall Clow} 2564146c14acSMarshall Clow 2565146c14acSMarshall Clowtemplate<class _Tp> 2566146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2567146c14acSMarshall Clowconst _Tp& 2568146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2569146c14acSMarshall Clow{ 2570146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2571146c14acSMarshall Clow} 2572146c14acSMarshall Clow#endif 2573146c14acSMarshall Clow 25743e519524SHoward Hinnant// minmax_element 25753e519524SHoward Hinnant 25763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25770b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 25783e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 25793e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25803e519524SHoward Hinnant{ 2581a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2582a60d7facSEric Fiselier "std::minmax_element requires a ForwardIterator"); 25833e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 25843e519524SHoward Hinnant if (__first != __last) 25853e519524SHoward Hinnant { 25863e519524SHoward Hinnant if (++__first != __last) 25873e519524SHoward Hinnant { 25883e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 25893e519524SHoward Hinnant __result.first = __first; 25903e519524SHoward Hinnant else 25913e519524SHoward Hinnant __result.second = __first; 25923e519524SHoward Hinnant while (++__first != __last) 25933e519524SHoward Hinnant { 25943e519524SHoward Hinnant _ForwardIterator __i = __first; 25953e519524SHoward Hinnant if (++__first == __last) 25963e519524SHoward Hinnant { 25973e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 25983e519524SHoward Hinnant __result.first = __i; 25993e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26003e519524SHoward Hinnant __result.second = __i; 26013e519524SHoward Hinnant break; 26023e519524SHoward Hinnant } 26033e519524SHoward Hinnant else 26043e519524SHoward Hinnant { 26053e519524SHoward Hinnant if (__comp(*__first, *__i)) 26063e519524SHoward Hinnant { 26073e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26083e519524SHoward Hinnant __result.first = __first; 26093e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26103e519524SHoward Hinnant __result.second = __i; 26113e519524SHoward Hinnant } 26123e519524SHoward Hinnant else 26133e519524SHoward Hinnant { 26143e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26153e519524SHoward Hinnant __result.first = __i; 26163e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26173e519524SHoward Hinnant __result.second = __first; 26183e519524SHoward Hinnant } 26193e519524SHoward Hinnant } 26203e519524SHoward Hinnant } 26213e519524SHoward Hinnant } 26223e519524SHoward Hinnant } 26233e519524SHoward Hinnant return __result; 26243e519524SHoward Hinnant} 26253e519524SHoward Hinnant 26263e519524SHoward Hinnanttemplate <class _ForwardIterator> 26270b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26283e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26293e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26303e519524SHoward Hinnant{ 26319d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 26329d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26333e519524SHoward Hinnant} 26343e519524SHoward Hinnant 26354eb27b79SHoward Hinnant// minmax 26364eb27b79SHoward Hinnant 26374eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26389d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26394eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26404eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26414eb27b79SHoward Hinnant{ 26424eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 26434eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 26444eb27b79SHoward Hinnant} 26454eb27b79SHoward Hinnant 26464eb27b79SHoward Hinnanttemplate<class _Tp> 26479d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26484eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26494eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 26504eb27b79SHoward Hinnant{ 2651ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 26524eb27b79SHoward Hinnant} 26534eb27b79SHoward Hinnant 2654ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 265554976f26SHoward Hinnant 26564eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26579d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26584eb27b79SHoward Hinnantpair<_Tp, _Tp> 26594eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 26604eb27b79SHoward Hinnant{ 26619d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 26629d67c6d5SMarshall Clow _Iter __first = __t.begin(); 26639d67c6d5SMarshall Clow _Iter __last = __t.end(); 26649d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 26659d67c6d5SMarshall Clow 26669d67c6d5SMarshall Clow ++__first; 26679d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 26689d67c6d5SMarshall Clow { 26699d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 26709d67c6d5SMarshall Clow __result.first = *__first; 26719d67c6d5SMarshall Clow else 26729d67c6d5SMarshall Clow __result.second = *__first; 26739d67c6d5SMarshall Clow ++__first; 26749d67c6d5SMarshall Clow } 26759d67c6d5SMarshall Clow 26769d67c6d5SMarshall Clow while (__first != __last) 26779d67c6d5SMarshall Clow { 26789d67c6d5SMarshall Clow _Tp __prev = *__first++; 2679002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2680002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2681002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 26829d67c6d5SMarshall Clow } 26839d67c6d5SMarshall Clow else { 2684002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2685002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 26869d67c6d5SMarshall Clow } 26879d67c6d5SMarshall Clow 26889d67c6d5SMarshall Clow __first++; 26899d67c6d5SMarshall Clow } 26909d67c6d5SMarshall Clow return __result; 26919d67c6d5SMarshall Clow} 26929d67c6d5SMarshall Clow 26939d67c6d5SMarshall Clowtemplate<class _Tp> 26949d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26959d67c6d5SMarshall Clowpair<_Tp, _Tp> 26969d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 26979d67c6d5SMarshall Clow{ 26989d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 26994eb27b79SHoward Hinnant} 27004eb27b79SHoward Hinnant 2701ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 270254976f26SHoward Hinnant 27033e519524SHoward Hinnant// random_shuffle 27043e519524SHoward Hinnant 2705f9d540b0SHoward Hinnant// __independent_bits_engine 2706f9d540b0SHoward Hinnant 2707c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2708f9d540b0SHoward Hinnantstruct __log2_imp 27093e519524SHoward Hinnant{ 2710c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2711c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27123e519524SHoward Hinnant}; 27133e519524SHoward Hinnant 2714c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2715c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 27163e519524SHoward Hinnant{ 2717f9d540b0SHoward Hinnant static const size_t value = 0; 27183e519524SHoward Hinnant}; 27193e519524SHoward Hinnant 2720c003db1fSHoward Hinnanttemplate <size_t _Rp> 2721c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 27223e519524SHoward Hinnant{ 2723c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 27243e519524SHoward Hinnant}; 27253e519524SHoward Hinnant 272689918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2727f9d540b0SHoward Hinnantstruct __log2 27283e519524SHoward Hinnant{ 2729c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 273089918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 27313e519524SHoward Hinnant}; 27323e519524SHoward Hinnant 2733f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2734f9d540b0SHoward Hinnantclass __independent_bits_engine 27353e519524SHoward Hinnant{ 2736f9d540b0SHoward Hinnantpublic: 2737f9d540b0SHoward Hinnant // types 2738f9d540b0SHoward Hinnant typedef _UIntType result_type; 2739f9d540b0SHoward Hinnant 2740f9d540b0SHoward Hinnantprivate: 2741f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2742f9d540b0SHoward Hinnant typedef typename conditional 2743f9d540b0SHoward Hinnant < 2744f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2745f9d540b0SHoward Hinnant result_type, 2746f9d540b0SHoward Hinnant _Engine_result_type 2747f9d540b0SHoward Hinnant >::type _Working_result_type; 2748f9d540b0SHoward Hinnant 2749f9d540b0SHoward Hinnant _Engine& __e_; 2750f9d540b0SHoward Hinnant size_t __w_; 2751f9d540b0SHoward Hinnant size_t __w0_; 2752f9d540b0SHoward Hinnant size_t __n_; 2753f9d540b0SHoward Hinnant size_t __n0_; 2754f9d540b0SHoward Hinnant _Working_result_type __y0_; 2755f9d540b0SHoward Hinnant _Working_result_type __y1_; 2756f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2757f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2758f9d540b0SHoward Hinnant 2759ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2760c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2761f9d540b0SHoward Hinnant + _Working_result_type(1); 2762e386b7b3SHoward Hinnant#else 2763e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2764e386b7b3SHoward Hinnant + _Working_result_type(1); 2765e386b7b3SHoward Hinnant#endif 2766e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2767e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2768e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2769f9d540b0SHoward Hinnant 2770f9d540b0SHoward Hinnantpublic: 2771f9d540b0SHoward Hinnant // constructors and seeding functions 2772f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2773f9d540b0SHoward Hinnant 2774f9d540b0SHoward Hinnant // generating functions 2775c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2776f9d540b0SHoward Hinnant 2777f9d540b0SHoward Hinnantprivate: 277808bba64aSMarshall Clow result_type __eval(false_type); 277908bba64aSMarshall Clow result_type __eval(true_type); 2780f9d540b0SHoward Hinnant}; 2781f9d540b0SHoward Hinnant 2782f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2783f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2784f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2785f9d540b0SHoward Hinnant : __e_(__e), 2786f9d540b0SHoward Hinnant __w_(__w) 2787f9d540b0SHoward Hinnant{ 2788f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2789f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2790c003db1fSHoward Hinnant if (_Rp == 0) 2791c003db1fSHoward Hinnant __y0_ = _Rp; 2792f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2793c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2794f9d540b0SHoward Hinnant else 2795f9d540b0SHoward Hinnant __y0_ = 0; 2796c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2797f9d540b0SHoward Hinnant { 2798f9d540b0SHoward Hinnant ++__n_; 2799f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2800f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2801c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2802f9d540b0SHoward Hinnant else 2803f9d540b0SHoward Hinnant __y0_ = 0; 2804f9d540b0SHoward Hinnant } 2805f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2806f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2807c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2808f9d540b0SHoward Hinnant else 2809f9d540b0SHoward Hinnant __y1_ = 0; 2810f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2811f9d540b0SHoward Hinnant _Engine_result_type(0); 2812f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2813f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2814f9d540b0SHoward Hinnant _Engine_result_type(~0); 28153e519524SHoward Hinnant} 28163e519524SHoward Hinnant 2817f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2818f9d540b0SHoward Hinnantinline 2819f9d540b0SHoward Hinnant_UIntType 282008bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 28213e519524SHoward Hinnant{ 2822f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 28233e519524SHoward Hinnant} 28243e519524SHoward Hinnant 2825f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2826f9d540b0SHoward Hinnant_UIntType 282708bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28283e519524SHoward Hinnant{ 28295beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2830c003db1fSHoward Hinnant result_type _Sp = 0; 2831f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2832f9d540b0SHoward Hinnant { 2833f9d540b0SHoward Hinnant _Engine_result_type __u; 28343e519524SHoward Hinnant do 2835f9d540b0SHoward Hinnant { 2836f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2837f9d540b0SHoward Hinnant } while (__u >= __y0_); 28385beb2c3aSMarshall Clow if (__w0_ < _WRt) 2839c003db1fSHoward Hinnant _Sp <<= __w0_; 2840f9d540b0SHoward Hinnant else 2841c003db1fSHoward Hinnant _Sp = 0; 2842c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2843f9d540b0SHoward Hinnant } 2844f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2845f9d540b0SHoward Hinnant { 2846f9d540b0SHoward Hinnant _Engine_result_type __u; 2847f9d540b0SHoward Hinnant do 2848f9d540b0SHoward Hinnant { 2849f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2850f9d540b0SHoward Hinnant } while (__u >= __y1_); 28515beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2852c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2853f9d540b0SHoward Hinnant else 2854c003db1fSHoward Hinnant _Sp = 0; 2855c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2856f9d540b0SHoward Hinnant } 2857c003db1fSHoward Hinnant return _Sp; 28583e519524SHoward Hinnant} 28593e519524SHoward Hinnant 2860f9d540b0SHoward Hinnant// uniform_int_distribution 28613e519524SHoward Hinnant 2862f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2863f9d540b0SHoward Hinnantclass uniform_int_distribution 28643e519524SHoward Hinnant{ 2865f9d540b0SHoward Hinnantpublic: 2866f9d540b0SHoward Hinnant // types 2867f9d540b0SHoward Hinnant typedef _IntType result_type; 2868f9d540b0SHoward Hinnant 2869f9d540b0SHoward Hinnant class param_type 2870f9d540b0SHoward Hinnant { 2871f9d540b0SHoward Hinnant result_type __a_; 2872f9d540b0SHoward Hinnant result_type __b_; 2873f9d540b0SHoward Hinnant public: 2874f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2875f9d540b0SHoward Hinnant 2876f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2877f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2878f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2879f9d540b0SHoward Hinnant 2880f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2881f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2882f9d540b0SHoward Hinnant 2883f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2884f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2885f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2886f9d540b0SHoward Hinnant {return !(__x == __y);} 28873e519524SHoward Hinnant }; 28883e519524SHoward Hinnant 2889f9d540b0SHoward Hinnantprivate: 2890f9d540b0SHoward Hinnant param_type __p_; 28913e519524SHoward Hinnant 2892f9d540b0SHoward Hinnantpublic: 2893f9d540b0SHoward Hinnant // constructors and reset functions 2894f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2895f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2896f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2897f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2898f9d540b0SHoward Hinnant void reset() {} 2899f9d540b0SHoward Hinnant 2900f9d540b0SHoward Hinnant // generating functions 2901f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2902f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2903f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2904f9d540b0SHoward Hinnant 2905f9d540b0SHoward Hinnant // property functions 2906f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2907f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2908f9d540b0SHoward Hinnant 2909f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2910f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2911f9d540b0SHoward Hinnant 2912f9d540b0SHoward Hinnant result_type min() const {return a();} 2913f9d540b0SHoward Hinnant result_type max() const {return b();} 2914f9d540b0SHoward Hinnant 2915f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2916f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2917f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2918f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2919f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2920f9d540b0SHoward Hinnant {return !(__x == __y);} 29213e519524SHoward Hinnant}; 29223e519524SHoward Hinnant 2923f9d540b0SHoward Hinnanttemplate<class _IntType> 2924f9d540b0SHoward Hinnanttemplate<class _URNG> 2925f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2926f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29272dd53352SMarshall Clow_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK 29283e519524SHoward Hinnant{ 2929f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2930f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 29312dd53352SMarshall Clow const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1); 2932c003db1fSHoward Hinnant if (_Rp == 1) 2933f9d540b0SHoward Hinnant return __p.a(); 2934f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2935f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2936c003db1fSHoward Hinnant if (_Rp == 0) 2937f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2938c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2939a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 2940f9d540b0SHoward Hinnant ++__w; 2941f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2942f9d540b0SHoward Hinnant _UIntType __u; 2943f9d540b0SHoward Hinnant do 29443e519524SHoward Hinnant { 2945f9d540b0SHoward Hinnant __u = __e(); 2946c003db1fSHoward Hinnant } while (__u >= _Rp); 2947f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 29483e519524SHoward Hinnant} 2949f9d540b0SHoward Hinnant 295066f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 295166f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 2952f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 2953f9d540b0SHoward Hinnant 2954f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 2955f9d540b0SHoward Hinnant 2956f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 29573e519524SHoward Hinnant{ 2958f9d540b0SHoward Hinnant static unsigned __c_; 2959f9d540b0SHoward Hinnant 2960f9d540b0SHoward Hinnant __rs_default(); 2961f9d540b0SHoward Hinnantpublic: 2962b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 2963f9d540b0SHoward Hinnant 2964f9d540b0SHoward Hinnant static const result_type _Min = 0; 2965f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2966f9d540b0SHoward Hinnant 2967f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2968f9d540b0SHoward Hinnant ~__rs_default(); 2969f9d540b0SHoward Hinnant 2970f9d540b0SHoward Hinnant result_type operator()(); 2971f9d540b0SHoward Hinnant 2972788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2973788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 2974f9d540b0SHoward Hinnant 2975f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 2976f9d540b0SHoward Hinnant}; 2977f9d540b0SHoward Hinnant 2978f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 29793e519524SHoward Hinnant 29803e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 2981ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 29823e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 29833e519524SHoward Hinnant{ 29843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2985c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2986c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 29873e519524SHoward Hinnant difference_type __d = __last - __first; 29883e519524SHoward Hinnant if (__d > 1) 29893e519524SHoward Hinnant { 2990c003db1fSHoward Hinnant _Dp __uid; 2991f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 2992f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2993007b26beSHoward Hinnant { 2994c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 2995007b26beSHoward Hinnant if (__i != difference_type(0)) 2996007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2997007b26beSHoward Hinnant } 29983e519524SHoward Hinnant } 29993e519524SHoward Hinnant} 30003e519524SHoward Hinnant 30013e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 3002ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 30033e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3004ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 30053e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30063e519524SHoward Hinnant#else 30073e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30083e519524SHoward Hinnant#endif 30093e519524SHoward Hinnant{ 30103e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30113e519524SHoward Hinnant difference_type __d = __last - __first; 30123e519524SHoward Hinnant if (__d > 1) 30133e519524SHoward Hinnant { 30143e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3015007b26beSHoward Hinnant { 3016007b26beSHoward Hinnant difference_type __i = __rand(__d); 3017e9cc5451SMarshall Clow if (__i != difference_type(0)) 3018007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3019007b26beSHoward Hinnant } 30203e519524SHoward Hinnant } 30213e519524SHoward Hinnant} 30220f37a410SMarshall Clow#endif 30233e519524SHoward Hinnant 3024e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3025e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3026e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3027e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 302842bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3029e7154709SEric Fiselier _Distance __n, 3030e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3031e7154709SEric Fiselier input_iterator_tag) { 3032e7154709SEric Fiselier 3033e7154709SEric Fiselier _Distance __k = 0; 3034e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 303542bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3036e7154709SEric Fiselier _Distance __sz = __k; 3037e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3038e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3039e7154709SEric Fiselier if (__r < __sz) 304042bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3041e7154709SEric Fiselier } 304242bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3043e7154709SEric Fiselier} 3044e7154709SEric Fiselier 3045e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3046e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3047e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3048e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 304942bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3050e7154709SEric Fiselier _Distance __n, 3051e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3052e7154709SEric Fiselier forward_iterator_tag) { 3053e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3054e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3055e7154709SEric Fiselier _Distance __r = 3056e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3057e7154709SEric Fiselier if (__r < __n) { 305842bfedd9SAlexander Richardson *__output_iter++ = *__first; 3059e7154709SEric Fiselier --__n; 3060e7154709SEric Fiselier } 3061e7154709SEric Fiselier } 306242bfedd9SAlexander Richardson return __output_iter; 3063e7154709SEric Fiselier} 3064e7154709SEric Fiselier 3065e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3066e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3067e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3068e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 306942bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3070e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3071e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3072e7154709SEric Fiselier _PopCategory; 3073e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3074e7154709SEric Fiselier _Difference; 3075e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3076e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3077e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3078e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3079e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3080e7154709SEric Fiselier return _VSTD::__sample( 308142bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3082e7154709SEric Fiselier __g, _PopCategory()); 3083e7154709SEric Fiselier} 3084e7154709SEric Fiselier 3085e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3086e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3087e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3088e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3089e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 309042bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3091e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 309242bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3093e7154709SEric Fiselier} 3094e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3095e7154709SEric Fiselier 3096f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3097f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3098ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3099fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3100fb340102SHoward Hinnant#else 3101f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3102fb340102SHoward Hinnant#endif 3103f9d540b0SHoward Hinnant{ 3104f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3105c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3106c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3107f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3108f9d540b0SHoward Hinnant if (__d > 1) 3109f9d540b0SHoward Hinnant { 3110c003db1fSHoward Hinnant _Dp __uid; 3111f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3112007b26beSHoward Hinnant { 3113c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3114007b26beSHoward Hinnant if (__i != difference_type(0)) 3115007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3116007b26beSHoward Hinnant } 3117f9d540b0SHoward Hinnant } 3118f9d540b0SHoward Hinnant} 3119f9d540b0SHoward Hinnant 31203e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 312149c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 31223e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31233e519524SHoward Hinnant{ 31243e519524SHoward Hinnant for (; __first != __last; ++__first) 31253e519524SHoward Hinnant if (!__pred(*__first)) 31263e519524SHoward Hinnant break; 3127b9595b79SMarshall Clow if ( __first == __last ) 3128b9595b79SMarshall Clow return true; 3129b9595b79SMarshall Clow ++__first; 31303e519524SHoward Hinnant for (; __first != __last; ++__first) 31313e519524SHoward Hinnant if (__pred(*__first)) 31323e519524SHoward Hinnant return false; 31333e519524SHoward Hinnant return true; 31343e519524SHoward Hinnant} 31353e519524SHoward Hinnant 31363e519524SHoward Hinnant// partition 31373e519524SHoward Hinnant 31383e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31393e519524SHoward Hinnant_ForwardIterator 31403e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31413e519524SHoward Hinnant{ 31423e519524SHoward Hinnant while (true) 31433e519524SHoward Hinnant { 31443e519524SHoward Hinnant if (__first == __last) 31453e519524SHoward Hinnant return __first; 31463e519524SHoward Hinnant if (!__pred(*__first)) 31473e519524SHoward Hinnant break; 31483e519524SHoward Hinnant ++__first; 31493e519524SHoward Hinnant } 31503e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31513e519524SHoward Hinnant { 31523e519524SHoward Hinnant if (__pred(*__p)) 31533e519524SHoward Hinnant { 31543e519524SHoward Hinnant swap(*__first, *__p); 31553e519524SHoward Hinnant ++__first; 31563e519524SHoward Hinnant } 31573e519524SHoward Hinnant } 31583e519524SHoward Hinnant return __first; 31593e519524SHoward Hinnant} 31603e519524SHoward Hinnant 31613e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31623e519524SHoward Hinnant_BidirectionalIterator 31633e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31643e519524SHoward Hinnant bidirectional_iterator_tag) 31653e519524SHoward Hinnant{ 31663e519524SHoward Hinnant while (true) 31673e519524SHoward Hinnant { 31683e519524SHoward Hinnant while (true) 31693e519524SHoward Hinnant { 31703e519524SHoward Hinnant if (__first == __last) 31713e519524SHoward Hinnant return __first; 31723e519524SHoward Hinnant if (!__pred(*__first)) 31733e519524SHoward Hinnant break; 31743e519524SHoward Hinnant ++__first; 31753e519524SHoward Hinnant } 31763e519524SHoward Hinnant do 31773e519524SHoward Hinnant { 31783e519524SHoward Hinnant if (__first == --__last) 31793e519524SHoward Hinnant return __first; 31803e519524SHoward Hinnant } while (!__pred(*__last)); 31813e519524SHoward Hinnant swap(*__first, *__last); 31823e519524SHoward Hinnant ++__first; 31833e519524SHoward Hinnant } 31843e519524SHoward Hinnant} 31853e519524SHoward Hinnant 31863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31883e519524SHoward Hinnant_ForwardIterator 31893e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31903e519524SHoward Hinnant{ 3191ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 31923e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31933e519524SHoward Hinnant} 31943e519524SHoward Hinnant 31953e519524SHoward Hinnant// partition_copy 31963e519524SHoward Hinnant 31973e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 31983e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 31991b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 32003e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32013e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32023e519524SHoward Hinnant _Predicate __pred) 32033e519524SHoward Hinnant{ 32043e519524SHoward Hinnant for (; __first != __last; ++__first) 32053e519524SHoward Hinnant { 32063e519524SHoward Hinnant if (__pred(*__first)) 32073e519524SHoward Hinnant { 32083e519524SHoward Hinnant *__out_true = *__first; 32093e519524SHoward Hinnant ++__out_true; 32103e519524SHoward Hinnant } 32113e519524SHoward Hinnant else 32123e519524SHoward Hinnant { 32133e519524SHoward Hinnant *__out_false = *__first; 32143e519524SHoward Hinnant ++__out_false; 32153e519524SHoward Hinnant } 32163e519524SHoward Hinnant } 32173e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32183e519524SHoward Hinnant} 32193e519524SHoward Hinnant 32203e519524SHoward Hinnant// partition_point 32213e519524SHoward Hinnant 32223e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3223674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 32243e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32253e519524SHoward Hinnant{ 32263e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3227ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32283e519524SHoward Hinnant while (__len != 0) 32293e519524SHoward Hinnant { 323004695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 32313e519524SHoward Hinnant _ForwardIterator __m = __first; 3232ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32333e519524SHoward Hinnant if (__pred(*__m)) 32343e519524SHoward Hinnant { 32353e519524SHoward Hinnant __first = ++__m; 32363e519524SHoward Hinnant __len -= __l2 + 1; 32373e519524SHoward Hinnant } 32383e519524SHoward Hinnant else 32393e519524SHoward Hinnant __len = __l2; 32403e519524SHoward Hinnant } 32413e519524SHoward Hinnant return __first; 32423e519524SHoward Hinnant} 32433e519524SHoward Hinnant 32443e519524SHoward Hinnant// stable_partition 32453e519524SHoward Hinnant 32463e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32473e519524SHoward Hinnant_ForwardIterator 32483e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32493e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32503e519524SHoward Hinnant{ 32513e519524SHoward Hinnant // *__first is known to be false 32523e519524SHoward Hinnant // __len >= 1 32533e519524SHoward Hinnant if (__len == 1) 32543e519524SHoward Hinnant return __first; 32553e519524SHoward Hinnant if (__len == 2) 32563e519524SHoward Hinnant { 32573e519524SHoward Hinnant _ForwardIterator __m = __first; 32583e519524SHoward Hinnant if (__pred(*++__m)) 32593e519524SHoward Hinnant { 32603e519524SHoward Hinnant swap(*__first, *__m); 32613e519524SHoward Hinnant return __m; 32623e519524SHoward Hinnant } 32633e519524SHoward Hinnant return __first; 32643e519524SHoward Hinnant } 32653e519524SHoward Hinnant if (__len <= __p.second) 32663e519524SHoward Hinnant { // The buffer is big enough to use 32673e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32683e519524SHoward Hinnant __destruct_n __d(0); 32693e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32703e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32713e519524SHoward Hinnant // Update __first to always point to the end of the trues 32723e519524SHoward Hinnant value_type* __t = __p.first; 3273ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32743e519524SHoward Hinnant __d.__incr((value_type*)0); 32753e519524SHoward Hinnant ++__t; 32763e519524SHoward Hinnant _ForwardIterator __i = __first; 32773e519524SHoward Hinnant while (++__i != __last) 32783e519524SHoward Hinnant { 32793e519524SHoward Hinnant if (__pred(*__i)) 32803e519524SHoward Hinnant { 3281ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32823e519524SHoward Hinnant ++__first; 32833e519524SHoward Hinnant } 32843e519524SHoward Hinnant else 32853e519524SHoward Hinnant { 3286ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32873e519524SHoward Hinnant __d.__incr((value_type*)0); 32883e519524SHoward Hinnant ++__t; 32893e519524SHoward Hinnant } 32903e519524SHoward Hinnant } 32913e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 32923e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 32933e519524SHoward Hinnant __i = __first; 32943e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3295ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 32963e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 32973e519524SHoward Hinnant return __first; 32983e519524SHoward Hinnant } 32993e519524SHoward Hinnant // Else not enough buffer, do in place 33003e519524SHoward Hinnant // __len >= 3 33013e519524SHoward Hinnant _ForwardIterator __m = __first; 33023e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3303ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33043e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33053e519524SHoward Hinnant // F????????????????? 33063e519524SHoward Hinnant // f m l 33073e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33083e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33093e519524SHoward Hinnant // TTTFFFFF?????????? 33103e519524SHoward Hinnant // f ff m l 33113e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33123e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33133e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33143e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33153e519524SHoward Hinnant while (__pred(*__m1)) 33163e519524SHoward Hinnant { 33173e519524SHoward Hinnant if (++__m1 == __last) 33183e519524SHoward Hinnant goto __second_half_done; 33193e519524SHoward Hinnant --__len_half; 33203e519524SHoward Hinnant } 33213e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33223e519524SHoward Hinnant // f ff m m1 l 33233e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33243e519524SHoward Hinnant__second_half_done: 33253e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33263e519524SHoward Hinnant // f ff m sf l 3327ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33283e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33293e519524SHoward Hinnant // | 33303e519524SHoward Hinnant} 33313e519524SHoward Hinnant 33323e519524SHoward Hinnantstruct __return_temporary_buffer 33333e519524SHoward Hinnant{ 33343e519524SHoward Hinnant template <class _Tp> 3335ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33363e519524SHoward Hinnant}; 33373e519524SHoward Hinnant 33383e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33393e519524SHoward Hinnant_ForwardIterator 33403e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33413e519524SHoward Hinnant forward_iterator_tag) 33423e519524SHoward Hinnant{ 33433e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33443e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33453e519524SHoward Hinnant while (true) 33463e519524SHoward Hinnant { 33473e519524SHoward Hinnant if (__first == __last) 33483e519524SHoward Hinnant return __first; 33493e519524SHoward Hinnant if (!__pred(*__first)) 33503e519524SHoward Hinnant break; 33513e519524SHoward Hinnant ++__first; 33523e519524SHoward Hinnant } 33533e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33543e519524SHoward Hinnant // *__first is known to be false 33553e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33563e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3357ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33583e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33593e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33603e519524SHoward Hinnant if (__len >= __alloc_limit) 33613e519524SHoward Hinnant { 3362ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33633e519524SHoward Hinnant __h.reset(__p.first); 33643e519524SHoward Hinnant } 33653e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33663e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33673e519524SHoward Hinnant} 33683e519524SHoward Hinnant 33693e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33703e519524SHoward Hinnant_BidirectionalIterator 33713e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33723e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33733e519524SHoward Hinnant{ 33743e519524SHoward Hinnant // *__first is known to be false 33753e519524SHoward Hinnant // *__last is known to be true 33763e519524SHoward Hinnant // __len >= 2 33773e519524SHoward Hinnant if (__len == 2) 33783e519524SHoward Hinnant { 33793e519524SHoward Hinnant swap(*__first, *__last); 33803e519524SHoward Hinnant return __last; 33813e519524SHoward Hinnant } 33823e519524SHoward Hinnant if (__len == 3) 33833e519524SHoward Hinnant { 33843e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33853e519524SHoward Hinnant if (__pred(*++__m)) 33863e519524SHoward Hinnant { 33873e519524SHoward Hinnant swap(*__first, *__m); 33883e519524SHoward Hinnant swap(*__m, *__last); 33893e519524SHoward Hinnant return __last; 33903e519524SHoward Hinnant } 33913e519524SHoward Hinnant swap(*__m, *__last); 33923e519524SHoward Hinnant swap(*__first, *__m); 33933e519524SHoward Hinnant return __m; 33943e519524SHoward Hinnant } 33953e519524SHoward Hinnant if (__len <= __p.second) 33963e519524SHoward Hinnant { // The buffer is big enough to use 33973e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 33983e519524SHoward Hinnant __destruct_n __d(0); 33993e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34003e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34013e519524SHoward Hinnant // Update __first to always point to the end of the trues 34023e519524SHoward Hinnant value_type* __t = __p.first; 3403ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34043e519524SHoward Hinnant __d.__incr((value_type*)0); 34053e519524SHoward Hinnant ++__t; 34063e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34073e519524SHoward Hinnant while (++__i != __last) 34083e519524SHoward Hinnant { 34093e519524SHoward Hinnant if (__pred(*__i)) 34103e519524SHoward Hinnant { 3411ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34123e519524SHoward Hinnant ++__first; 34133e519524SHoward Hinnant } 34143e519524SHoward Hinnant else 34153e519524SHoward Hinnant { 3416ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34173e519524SHoward Hinnant __d.__incr((value_type*)0); 34183e519524SHoward Hinnant ++__t; 34193e519524SHoward Hinnant } 34203e519524SHoward Hinnant } 34213e519524SHoward Hinnant // move *__last, known to be true 3422ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34233e519524SHoward Hinnant __i = ++__first; 34243e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34253e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34263e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3427ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34283e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34293e519524SHoward Hinnant return __first; 34303e519524SHoward Hinnant } 34313e519524SHoward Hinnant // Else not enough buffer, do in place 34323e519524SHoward Hinnant // __len >= 4 34333e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34343e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3435ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34363e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34373e519524SHoward Hinnant // F????????????????T 34383e519524SHoward Hinnant // f m l 34393e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34403e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34413e519524SHoward Hinnant _Distance __len_half = __len2; 34423e519524SHoward Hinnant while (!__pred(*--__m1)) 34433e519524SHoward Hinnant { 34443e519524SHoward Hinnant if (__m1 == __first) 34453e519524SHoward Hinnant goto __first_half_done; 34463e519524SHoward Hinnant --__len_half; 34473e519524SHoward Hinnant } 34483e519524SHoward Hinnant // F???TFFF?????????T 34493e519524SHoward Hinnant // f m1 m l 34503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34513e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34523e519524SHoward Hinnant__first_half_done: 34533e519524SHoward Hinnant // TTTFFFFF?????????T 34543e519524SHoward Hinnant // f ff m l 34553e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34563e519524SHoward Hinnant __m1 = __m; 34573e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34583e519524SHoward Hinnant ++__second_false; 34593e519524SHoward Hinnant __len_half = __len - __len2; 34603e519524SHoward Hinnant while (__pred(*__m1)) 34613e519524SHoward Hinnant { 34623e519524SHoward Hinnant if (++__m1 == __last) 34633e519524SHoward Hinnant goto __second_half_done; 34643e519524SHoward Hinnant --__len_half; 34653e519524SHoward Hinnant } 34663e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34673e519524SHoward Hinnant // f ff m m1 l 34683e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34693e519524SHoward Hinnant__second_half_done: 34703e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34713e519524SHoward Hinnant // f ff m sf l 3472ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34733e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34743e519524SHoward Hinnant // | 34753e519524SHoward Hinnant} 34763e519524SHoward Hinnant 34773e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34783e519524SHoward Hinnant_BidirectionalIterator 34793e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34803e519524SHoward Hinnant bidirectional_iterator_tag) 34813e519524SHoward Hinnant{ 34823e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34833e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34843e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34853e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34863e519524SHoward Hinnant while (true) 34873e519524SHoward Hinnant { 34883e519524SHoward Hinnant if (__first == __last) 34893e519524SHoward Hinnant return __first; 34903e519524SHoward Hinnant if (!__pred(*__first)) 34913e519524SHoward Hinnant break; 34923e519524SHoward Hinnant ++__first; 34933e519524SHoward Hinnant } 34943e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 34953e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 34963e519524SHoward Hinnant do 34973e519524SHoward Hinnant { 34983e519524SHoward Hinnant if (__first == --__last) 34993e519524SHoward Hinnant return __first; 35003e519524SHoward Hinnant } while (!__pred(*__last)); 35013e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35023e519524SHoward Hinnant // *__first is known to be false 35033e519524SHoward Hinnant // *__last is known to be true 35043e519524SHoward Hinnant // __len >= 2 3505ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35063e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35073e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35083e519524SHoward Hinnant if (__len >= __alloc_limit) 35093e519524SHoward Hinnant { 3510ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35113e519524SHoward Hinnant __h.reset(__p.first); 35123e519524SHoward Hinnant } 35133e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35143e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35153e519524SHoward Hinnant} 35163e519524SHoward Hinnant 35173e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35193e519524SHoward Hinnant_ForwardIterator 35203e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35213e519524SHoward Hinnant{ 35223e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35233e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35243e519524SHoward Hinnant} 35253e519524SHoward Hinnant 35263e519524SHoward Hinnant// is_sorted_until 35273e519524SHoward Hinnant 35283e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 352949c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 35303e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35313e519524SHoward Hinnant{ 35323e519524SHoward Hinnant if (__first != __last) 35333e519524SHoward Hinnant { 35343e519524SHoward Hinnant _ForwardIterator __i = __first; 35353e519524SHoward Hinnant while (++__i != __last) 35363e519524SHoward Hinnant { 35373e519524SHoward Hinnant if (__comp(*__i, *__first)) 35383e519524SHoward Hinnant return __i; 35393e519524SHoward Hinnant __first = __i; 35403e519524SHoward Hinnant } 35413e519524SHoward Hinnant } 35423e519524SHoward Hinnant return __last; 35433e519524SHoward Hinnant} 35443e519524SHoward Hinnant 35453e519524SHoward Hinnanttemplate<class _ForwardIterator> 354649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35473e519524SHoward Hinnant_ForwardIterator 35483e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35493e519524SHoward Hinnant{ 3550ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35513e519524SHoward Hinnant} 35523e519524SHoward Hinnant 35533e519524SHoward Hinnant// is_sorted 35543e519524SHoward Hinnant 35553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 355649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35573e519524SHoward Hinnantbool 35583e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35593e519524SHoward Hinnant{ 3560ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35613e519524SHoward Hinnant} 35623e519524SHoward Hinnant 35633e519524SHoward Hinnanttemplate<class _ForwardIterator> 356449c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35653e519524SHoward Hinnantbool 35663e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35673e519524SHoward Hinnant{ 3568ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35693e519524SHoward Hinnant} 35703e519524SHoward Hinnant 35713e519524SHoward Hinnant// sort 35723e519524SHoward Hinnant 35733e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35743e519524SHoward Hinnant 35753e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35763e519524SHoward Hinnantunsigned 35773e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35783e519524SHoward Hinnant{ 35793e519524SHoward Hinnant unsigned __r = 0; 35803e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35813e519524SHoward Hinnant { 35823e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35833e519524SHoward Hinnant return __r; // x <= y && y <= z 35843e519524SHoward Hinnant // x <= y && y > z 35853e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35863e519524SHoward Hinnant __r = 1; 35873e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35883e519524SHoward Hinnant { 35893e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35903e519524SHoward Hinnant __r = 2; 35913e519524SHoward Hinnant } 35923e519524SHoward Hinnant return __r; // x <= y && y < z 35933e519524SHoward Hinnant } 35943e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 35953e519524SHoward Hinnant { 35963e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 35973e519524SHoward Hinnant __r = 1; 35983e519524SHoward Hinnant return __r; 35993e519524SHoward Hinnant } 36003e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36013e519524SHoward Hinnant __r = 1; // x < y && x <= z 36023e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36033e519524SHoward Hinnant { 36043e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36053e519524SHoward Hinnant __r = 2; 36063e519524SHoward Hinnant } 36073e519524SHoward Hinnant return __r; 36083e519524SHoward Hinnant} // x <= y && y <= z 36093e519524SHoward Hinnant 36103e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36113e519524SHoward Hinnant 36123e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36133e519524SHoward Hinnantunsigned 36143e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36153e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36163e519524SHoward Hinnant{ 36173e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36183e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36193e519524SHoward Hinnant { 36203e519524SHoward Hinnant swap(*__x3, *__x4); 36213e519524SHoward Hinnant ++__r; 36223e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36233e519524SHoward Hinnant { 36243e519524SHoward Hinnant swap(*__x2, *__x3); 36253e519524SHoward Hinnant ++__r; 36263e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36273e519524SHoward Hinnant { 36283e519524SHoward Hinnant swap(*__x1, *__x2); 36293e519524SHoward Hinnant ++__r; 36303e519524SHoward Hinnant } 36313e519524SHoward Hinnant } 36323e519524SHoward Hinnant } 36333e519524SHoward Hinnant return __r; 36343e519524SHoward Hinnant} 36353e519524SHoward Hinnant 36363e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36373e519524SHoward Hinnant 36383e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 3639835140a4SLouis Dionne_LIBCPP_HIDDEN 36403e519524SHoward Hinnantunsigned 36413e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36423e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36433e519524SHoward Hinnant{ 36443e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36453e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36463e519524SHoward Hinnant { 36473e519524SHoward Hinnant swap(*__x4, *__x5); 36483e519524SHoward Hinnant ++__r; 36493e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36503e519524SHoward Hinnant { 36513e519524SHoward Hinnant swap(*__x3, *__x4); 36523e519524SHoward Hinnant ++__r; 36533e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36543e519524SHoward Hinnant { 36553e519524SHoward Hinnant swap(*__x2, *__x3); 36563e519524SHoward Hinnant ++__r; 36573e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36583e519524SHoward Hinnant { 36593e519524SHoward Hinnant swap(*__x1, *__x2); 36603e519524SHoward Hinnant ++__r; 36613e519524SHoward Hinnant } 36623e519524SHoward Hinnant } 36633e519524SHoward Hinnant } 36643e519524SHoward Hinnant } 36653e519524SHoward Hinnant return __r; 36663e519524SHoward Hinnant} 36673e519524SHoward Hinnant 36683e519524SHoward Hinnant// Assumes size > 0 36693e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36703e519524SHoward Hinnantvoid 36713e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36723e519524SHoward Hinnant{ 36733e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36743e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36753e519524SHoward Hinnant { 3676ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36773e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36783e519524SHoward Hinnant (__first, __last, __comp); 36793e519524SHoward Hinnant if (__i != __first) 36803e519524SHoward Hinnant swap(*__first, *__i); 36813e519524SHoward Hinnant } 36823e519524SHoward Hinnant} 36833e519524SHoward Hinnant 36843e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36853e519524SHoward Hinnantvoid 36863e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36873e519524SHoward Hinnant{ 36883e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36893e519524SHoward Hinnant if (__first != __last) 36903e519524SHoward Hinnant { 36913e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 36923e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 36933e519524SHoward Hinnant { 36943e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3695ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 36963e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3697ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3698ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36993e519524SHoward Hinnant } 37003e519524SHoward Hinnant } 37013e519524SHoward Hinnant} 37023e519524SHoward Hinnant 37033e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37043e519524SHoward Hinnantvoid 37053e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37063e519524SHoward Hinnant{ 37073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37083e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37093e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37103e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37113e519524SHoward Hinnant { 37123e519524SHoward Hinnant if (__comp(*__i, *__j)) 37133e519524SHoward Hinnant { 3714ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37153e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37163e519524SHoward Hinnant __j = __i; 37173e519524SHoward Hinnant do 37183e519524SHoward Hinnant { 3719ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37203e519524SHoward Hinnant __j = __k; 37213e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3722ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37233e519524SHoward Hinnant } 37243e519524SHoward Hinnant __j = __i; 37253e519524SHoward Hinnant } 37263e519524SHoward Hinnant} 37273e519524SHoward Hinnant 37283e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37293e519524SHoward Hinnantbool 37303e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37313e519524SHoward Hinnant{ 37323e519524SHoward Hinnant switch (__last - __first) 37333e519524SHoward Hinnant { 37343e519524SHoward Hinnant case 0: 37353e519524SHoward Hinnant case 1: 37363e519524SHoward Hinnant return true; 37373e519524SHoward Hinnant case 2: 37383e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37393e519524SHoward Hinnant swap(*__first, *__last); 37403e519524SHoward Hinnant return true; 37413e519524SHoward Hinnant case 3: 3742ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37433e519524SHoward Hinnant return true; 37443e519524SHoward Hinnant case 4: 3745ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37463e519524SHoward Hinnant return true; 37473e519524SHoward Hinnant case 5: 3748ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37493e519524SHoward Hinnant return true; 37503e519524SHoward Hinnant } 37513e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37523e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37533e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37543e519524SHoward Hinnant const unsigned __limit = 8; 37553e519524SHoward Hinnant unsigned __count = 0; 37563e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37573e519524SHoward Hinnant { 37583e519524SHoward Hinnant if (__comp(*__i, *__j)) 37593e519524SHoward Hinnant { 3760ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37613e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37623e519524SHoward Hinnant __j = __i; 37633e519524SHoward Hinnant do 37643e519524SHoward Hinnant { 3765ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37663e519524SHoward Hinnant __j = __k; 37673e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3768ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37693e519524SHoward Hinnant if (++__count == __limit) 37703e519524SHoward Hinnant return ++__i == __last; 37713e519524SHoward Hinnant } 37723e519524SHoward Hinnant __j = __i; 37733e519524SHoward Hinnant } 37743e519524SHoward Hinnant return true; 37753e519524SHoward Hinnant} 37763e519524SHoward Hinnant 37773e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37783e519524SHoward Hinnantvoid 37793e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37803e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37813e519524SHoward Hinnant{ 37823e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37833e519524SHoward Hinnant if (__first1 != __last1) 37843e519524SHoward Hinnant { 37853e519524SHoward Hinnant __destruct_n __d(0); 37863e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37873e519524SHoward Hinnant value_type* __last2 = __first2; 3788ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37893e519524SHoward Hinnant __d.__incr((value_type*)0); 37903e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37913e519524SHoward Hinnant { 37923e519524SHoward Hinnant value_type* __j2 = __last2; 37933e519524SHoward Hinnant value_type* __i2 = __j2; 37943e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 37953e519524SHoward Hinnant { 3796ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 37973e519524SHoward Hinnant __d.__incr((value_type*)0); 37983e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3799ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3800ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38013e519524SHoward Hinnant } 38023e519524SHoward Hinnant else 38033e519524SHoward Hinnant { 3804ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38053e519524SHoward Hinnant __d.__incr((value_type*)0); 38063e519524SHoward Hinnant } 38073e519524SHoward Hinnant } 38083e519524SHoward Hinnant __h.release(); 38093e519524SHoward Hinnant } 38103e519524SHoward Hinnant} 38113e519524SHoward Hinnant 38123e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38133e519524SHoward Hinnantvoid 38143e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38153e519524SHoward Hinnant{ 38163e519524SHoward Hinnant // _Compare is known to be a reference type 38173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3819ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3820ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38213e519524SHoward Hinnant while (true) 38223e519524SHoward Hinnant { 38233e519524SHoward Hinnant __restart: 38243e519524SHoward Hinnant difference_type __len = __last - __first; 38253e519524SHoward Hinnant switch (__len) 38263e519524SHoward Hinnant { 38273e519524SHoward Hinnant case 0: 38283e519524SHoward Hinnant case 1: 38293e519524SHoward Hinnant return; 38303e519524SHoward Hinnant case 2: 38313e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38323e519524SHoward Hinnant swap(*__first, *__last); 38333e519524SHoward Hinnant return; 38343e519524SHoward Hinnant case 3: 3835ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38363e519524SHoward Hinnant return; 38373e519524SHoward Hinnant case 4: 3838ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38393e519524SHoward Hinnant return; 38403e519524SHoward Hinnant case 5: 3841ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38423e519524SHoward Hinnant return; 38433e519524SHoward Hinnant } 38443e519524SHoward Hinnant if (__len <= __limit) 38453e519524SHoward Hinnant { 3846ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38473e519524SHoward Hinnant return; 38483e519524SHoward Hinnant } 38493e519524SHoward Hinnant // __len > 5 38503e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38513e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38523e519524SHoward Hinnant --__lm1; 38533e519524SHoward Hinnant unsigned __n_swaps; 38543e519524SHoward Hinnant { 38553e519524SHoward Hinnant difference_type __delta; 38563e519524SHoward Hinnant if (__len >= 1000) 38573e519524SHoward Hinnant { 38583e519524SHoward Hinnant __delta = __len/2; 38593e519524SHoward Hinnant __m += __delta; 38603e519524SHoward Hinnant __delta /= 2; 3861ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38623e519524SHoward Hinnant } 38633e519524SHoward Hinnant else 38643e519524SHoward Hinnant { 38653e519524SHoward Hinnant __delta = __len/2; 38663e519524SHoward Hinnant __m += __delta; 3867ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38683e519524SHoward Hinnant } 38693e519524SHoward Hinnant } 38703e519524SHoward Hinnant // *__m is median 38713e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38723e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38733e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38743e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38753e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38763e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38773e519524SHoward Hinnant // Prime the downward search with a guard. 38783e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38793e519524SHoward Hinnant { 38803e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38813e519524SHoward Hinnant // manually guard downward moving __j against __i 38823e519524SHoward Hinnant while (true) 38833e519524SHoward Hinnant { 38843e519524SHoward Hinnant if (__i == --__j) 38853e519524SHoward Hinnant { 38863e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38873e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38883e519524SHoward Hinnant ++__i; // __first + 1 38893e519524SHoward Hinnant __j = __last; 38903e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38913e519524SHoward Hinnant { 38923e519524SHoward Hinnant while (true) 38933e519524SHoward Hinnant { 38943e519524SHoward Hinnant if (__i == __j) 38953e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 38963e519524SHoward Hinnant if (__comp(*__first, *__i)) 38973e519524SHoward Hinnant { 38983e519524SHoward Hinnant swap(*__i, *__j); 38993e519524SHoward Hinnant ++__n_swaps; 39003e519524SHoward Hinnant ++__i; 39013e519524SHoward Hinnant break; 39023e519524SHoward Hinnant } 39033e519524SHoward Hinnant ++__i; 39043e519524SHoward Hinnant } 39053e519524SHoward Hinnant } 39063e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39073e519524SHoward Hinnant if (__i == __j) 39083e519524SHoward Hinnant return; 39093e519524SHoward Hinnant while (true) 39103e519524SHoward Hinnant { 39113e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39123e519524SHoward Hinnant ++__i; 39133e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39143e519524SHoward Hinnant ; 39153e519524SHoward Hinnant if (__i >= __j) 39163e519524SHoward Hinnant break; 39173e519524SHoward Hinnant swap(*__i, *__j); 39183e519524SHoward Hinnant ++__n_swaps; 39193e519524SHoward Hinnant ++__i; 39203e519524SHoward Hinnant } 39213e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39223e519524SHoward Hinnant // The first part is sorted, sort the secod part 3923ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39243e519524SHoward Hinnant __first = __i; 39253e519524SHoward Hinnant goto __restart; 39263e519524SHoward Hinnant } 39273e519524SHoward Hinnant if (__comp(*__j, *__m)) 39283e519524SHoward Hinnant { 39293e519524SHoward Hinnant swap(*__i, *__j); 39303e519524SHoward Hinnant ++__n_swaps; 39313e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39323e519524SHoward Hinnant } 39333e519524SHoward Hinnant } 39343e519524SHoward Hinnant } 39353e519524SHoward Hinnant // It is known that *__i < *__m 39363e519524SHoward Hinnant ++__i; 39373e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39383e519524SHoward Hinnant // if not yet partitioned... 39393e519524SHoward Hinnant if (__i < __j) 39403e519524SHoward Hinnant { 39413e519524SHoward Hinnant // known that *(__i - 1) < *__m 39423e519524SHoward Hinnant // known that __i <= __m 39433e519524SHoward Hinnant while (true) 39443e519524SHoward Hinnant { 39453e519524SHoward Hinnant // __m still guards upward moving __i 39463e519524SHoward Hinnant while (__comp(*__i, *__m)) 39473e519524SHoward Hinnant ++__i; 39483e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39493e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39503e519524SHoward Hinnant ; 39513e519524SHoward Hinnant if (__i > __j) 39523e519524SHoward Hinnant break; 39533e519524SHoward Hinnant swap(*__i, *__j); 39543e519524SHoward Hinnant ++__n_swaps; 39553e519524SHoward Hinnant // It is known that __m != __j 39563e519524SHoward Hinnant // If __m just moved, follow it 39573e519524SHoward Hinnant if (__m == __i) 39583e519524SHoward Hinnant __m = __j; 39593e519524SHoward Hinnant ++__i; 39603e519524SHoward Hinnant } 39613e519524SHoward Hinnant } 39623e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39633e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39643e519524SHoward Hinnant { 39653e519524SHoward Hinnant swap(*__i, *__m); 39663e519524SHoward Hinnant ++__n_swaps; 39673e519524SHoward Hinnant } 39683e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39693e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39703e519524SHoward Hinnant if (__n_swaps == 0) 39713e519524SHoward Hinnant { 3972ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3973ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39743e519524SHoward Hinnant { 39753e519524SHoward Hinnant if (__fs) 39763e519524SHoward Hinnant return; 39773e519524SHoward Hinnant __last = __i; 39783e519524SHoward Hinnant continue; 39793e519524SHoward Hinnant } 39803e519524SHoward Hinnant else 39813e519524SHoward Hinnant { 39823e519524SHoward Hinnant if (__fs) 39833e519524SHoward Hinnant { 39843e519524SHoward Hinnant __first = ++__i; 39853e519524SHoward Hinnant continue; 39863e519524SHoward Hinnant } 39873e519524SHoward Hinnant } 39883e519524SHoward Hinnant } 39893e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39903e519524SHoward Hinnant if (__i - __first < __last - __i) 39913e519524SHoward Hinnant { 3992ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3993ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 39943e519524SHoward Hinnant __first = ++__i; 39953e519524SHoward Hinnant } 39963e519524SHoward Hinnant else 39973e519524SHoward Hinnant { 3998ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 3999ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40003e519524SHoward Hinnant __last = __i; 40013e519524SHoward Hinnant } 40023e519524SHoward Hinnant } 40033e519524SHoward Hinnant} 40043e519524SHoward Hinnant 40053e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40083e519524SHoward Hinnantvoid 40093e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40103e519524SHoward Hinnant{ 4011145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40143e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4015145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40173e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4018145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40193e519524SHoward Hinnant} 40203e519524SHoward Hinnant 40213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40233e519524SHoward Hinnantvoid 40243e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40253e519524SHoward Hinnant{ 4026ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40273e519524SHoward Hinnant} 40283e519524SHoward Hinnant 40293e519524SHoward Hinnanttemplate <class _Tp> 40303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40313e519524SHoward Hinnantvoid 40323e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40333e519524SHoward Hinnant{ 4034ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40353e519524SHoward Hinnant} 40363e519524SHoward Hinnant 40373e519524SHoward Hinnanttemplate <class _Tp> 40383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40393e519524SHoward Hinnantvoid 40403e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40413e519524SHoward Hinnant{ 4042ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40433e519524SHoward Hinnant} 40443e519524SHoward Hinnant 4045f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4046f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4047f554add5SHoward Hinnantvoid 4048f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4049f554add5SHoward Hinnant{ 4050f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4051f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4052f554add5SHoward Hinnant} 4053f554add5SHoward Hinnant 4054f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4055f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4056f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4057f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4058f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4059f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4060f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4061f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4062f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4063f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4064f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4065f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4066f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4067f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4068f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40693e519524SHoward Hinnant 4070f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4071f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4072f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4073f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4074f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4075f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4076f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4077f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4078f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4079f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4080f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4081f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4082f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4083f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4084f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40853e519524SHoward Hinnant 4086f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&)) 40873e519524SHoward Hinnant 40883e519524SHoward Hinnant// lower_bound 40893e519524SHoward Hinnant 40903e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4091d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4092e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40933e519524SHoward Hinnant{ 40943e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4095ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40963e519524SHoward Hinnant while (__len != 0) 40973e519524SHoward Hinnant { 409804695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 40993e519524SHoward Hinnant _ForwardIterator __m = __first; 4100ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4101e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41023e519524SHoward Hinnant { 41033e519524SHoward Hinnant __first = ++__m; 41043e519524SHoward Hinnant __len -= __l2 + 1; 41053e519524SHoward Hinnant } 41063e519524SHoward Hinnant else 41073e519524SHoward Hinnant __len = __l2; 41083e519524SHoward Hinnant } 41093e519524SHoward Hinnant return __first; 41103e519524SHoward Hinnant} 41113e519524SHoward Hinnant 41123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4113d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41143e519524SHoward Hinnant_ForwardIterator 4115e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41163e519524SHoward Hinnant{ 41173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4118e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 41193e519524SHoward Hinnant} 41203e519524SHoward Hinnant 41213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4122d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41233e519524SHoward Hinnant_ForwardIterator 4124e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41253e519524SHoward Hinnant{ 4126e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41273e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41283e519524SHoward Hinnant} 41293e519524SHoward Hinnant 41303e519524SHoward Hinnant// upper_bound 41313e519524SHoward Hinnant 41323e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4133d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4134e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41353e519524SHoward Hinnant{ 41363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4137ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41383e519524SHoward Hinnant while (__len != 0) 41393e519524SHoward Hinnant { 414004695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41413e519524SHoward Hinnant _ForwardIterator __m = __first; 4142ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4143e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41443e519524SHoward Hinnant __len = __l2; 41453e519524SHoward Hinnant else 41463e519524SHoward Hinnant { 41473e519524SHoward Hinnant __first = ++__m; 41483e519524SHoward Hinnant __len -= __l2 + 1; 41493e519524SHoward Hinnant } 41503e519524SHoward Hinnant } 41513e519524SHoward Hinnant return __first; 41523e519524SHoward Hinnant} 41533e519524SHoward Hinnant 41543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4155d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41563e519524SHoward Hinnant_ForwardIterator 4157e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41583e519524SHoward Hinnant{ 41593e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4160e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 41613e519524SHoward Hinnant} 41623e519524SHoward Hinnant 41633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4164d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41653e519524SHoward Hinnant_ForwardIterator 4166e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41673e519524SHoward Hinnant{ 4168e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41693e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41703e519524SHoward Hinnant} 41713e519524SHoward Hinnant 41723e519524SHoward Hinnant// equal_range 41733e519524SHoward Hinnant 41743e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4175d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4176e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41773e519524SHoward Hinnant{ 41783e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4179ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41803e519524SHoward Hinnant while (__len != 0) 41813e519524SHoward Hinnant { 418204695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41833e519524SHoward Hinnant _ForwardIterator __m = __first; 4184ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4185e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41863e519524SHoward Hinnant { 41873e519524SHoward Hinnant __first = ++__m; 41883e519524SHoward Hinnant __len -= __l2 + 1; 41893e519524SHoward Hinnant } 4190e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 41913e519524SHoward Hinnant { 41923e519524SHoward Hinnant __last = __m; 41933e519524SHoward Hinnant __len = __l2; 41943e519524SHoward Hinnant } 41953e519524SHoward Hinnant else 41963e519524SHoward Hinnant { 41973e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 41983e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 41993e519524SHoward Hinnant ( 4200e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4201e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42023e519524SHoward Hinnant ); 42033e519524SHoward Hinnant } 42043e519524SHoward Hinnant } 42053e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42063e519524SHoward Hinnant} 42073e519524SHoward Hinnant 42083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4209d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42103e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4211e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42123e519524SHoward Hinnant{ 4213145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42143e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42153e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4216e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4217145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42183e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4219e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4220145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42213e519524SHoward Hinnant} 42223e519524SHoward Hinnant 42233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4224d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42253e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4226e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42273e519524SHoward Hinnant{ 4228e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42293e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42303e519524SHoward Hinnant} 42313e519524SHoward Hinnant 42323e519524SHoward Hinnant// binary_search 42333e519524SHoward Hinnant 42343e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4235d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42363e519524SHoward Hinnantbool 4237e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42383e519524SHoward Hinnant{ 4239e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4240e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42413e519524SHoward Hinnant} 42423e519524SHoward Hinnant 42433e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4244d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42453e519524SHoward Hinnantbool 4246e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42473e519524SHoward Hinnant{ 4248145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42493e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42503e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4251e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4252145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42533e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4254e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4255145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42563e519524SHoward Hinnant} 42573e519524SHoward Hinnant 42583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4259d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42603e519524SHoward Hinnantbool 4261e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42623e519524SHoward Hinnant{ 4263e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42643e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42653e519524SHoward Hinnant} 42663e519524SHoward Hinnant 42673e519524SHoward Hinnant// merge 42683e519524SHoward Hinnant 42693e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42703e519524SHoward Hinnant_OutputIterator 42713e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42733e519524SHoward Hinnant{ 42743e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42753e519524SHoward Hinnant { 42763e519524SHoward Hinnant if (__first2 == __last2) 4277ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 42783e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42793e519524SHoward Hinnant { 42803e519524SHoward Hinnant *__result = *__first2; 42813e519524SHoward Hinnant ++__first2; 42823e519524SHoward Hinnant } 42833e519524SHoward Hinnant else 42843e519524SHoward Hinnant { 42853e519524SHoward Hinnant *__result = *__first1; 42863e519524SHoward Hinnant ++__first1; 42873e519524SHoward Hinnant } 42883e519524SHoward Hinnant } 4289ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 42903e519524SHoward Hinnant} 42913e519524SHoward Hinnant 42923e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 42933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42943e519524SHoward Hinnant_OutputIterator 42953e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42963e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42973e519524SHoward Hinnant{ 4298145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4301ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4302145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43033e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4304ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4305145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43063e519524SHoward Hinnant} 43073e519524SHoward Hinnant 43083e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43103e519524SHoward Hinnant_OutputIterator 43113e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43123e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43133e519524SHoward Hinnant{ 43143e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43153e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43163e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43173e519524SHoward Hinnant} 43183e519524SHoward Hinnant 43193e519524SHoward Hinnant// inplace_merge 43203e519524SHoward Hinnant 4321adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4322adfdae18SMarshall Clow class _OutputIterator> 4323adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4324adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4325adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4326adfdae18SMarshall Clow{ 4327adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4328adfdae18SMarshall Clow { 4329adfdae18SMarshall Clow if (__first2 == __last2) 4330adfdae18SMarshall Clow { 4331adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4332adfdae18SMarshall Clow return; 4333adfdae18SMarshall Clow } 4334adfdae18SMarshall Clow 4335adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4336adfdae18SMarshall Clow { 4337adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4338adfdae18SMarshall Clow ++__first2; 4339adfdae18SMarshall Clow } 4340adfdae18SMarshall Clow else 4341adfdae18SMarshall Clow { 4342adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4343adfdae18SMarshall Clow ++__first1; 4344adfdae18SMarshall Clow } 4345adfdae18SMarshall Clow } 4346adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4347adfdae18SMarshall Clow} 4348adfdae18SMarshall Clow 43493e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43503e519524SHoward Hinnantvoid 43513e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43523e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43533e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43543e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 43553e519524SHoward Hinnant{ 43563e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43573e519524SHoward Hinnant __destruct_n __d(0); 43583e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43593e519524SHoward Hinnant if (__len1 <= __len2) 43603e519524SHoward Hinnant { 43613e519524SHoward Hinnant value_type* __p = __buff; 4362910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4363ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4364adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 43653e519524SHoward Hinnant } 43663e519524SHoward Hinnant else 43673e519524SHoward Hinnant { 43683e519524SHoward Hinnant value_type* __p = __buff; 4369910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4370ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43713e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43723e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4373adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4374adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4375a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 43763e519524SHoward Hinnant } 43773e519524SHoward Hinnant} 43783e519524SHoward Hinnant 43793e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43803e519524SHoward Hinnantvoid 43813e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43823e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43833e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43843e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43853e519524SHoward Hinnant{ 43863e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43873e519524SHoward Hinnant while (true) 43883e519524SHoward Hinnant { 43893e519524SHoward Hinnant // if __middle == __last, we're done 43903e519524SHoward Hinnant if (__len2 == 0) 43913e519524SHoward Hinnant return; 4392526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4393526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4394526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 43953e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4396910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 43973e519524SHoward Hinnant { 43983e519524SHoward Hinnant if (__len1 == 0) 43993e519524SHoward Hinnant return; 44003e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44013e519524SHoward Hinnant break; 44023e519524SHoward Hinnant } 44033e519524SHoward Hinnant // __first < __middle < __last 44043e519524SHoward Hinnant // *__first > *__middle 44053e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44063e519524SHoward Hinnant // all elements in: 44073e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44083e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44093e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44103e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44113e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44123e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44133e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44143e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44153e519524SHoward Hinnant // binary search smaller range 44163e519524SHoward Hinnant if (__len1 < __len2) 44173e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44183e519524SHoward Hinnant __len21 = __len2 / 2; 44193e519524SHoward Hinnant __m2 = __middle; 4420ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44213e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4422ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44233e519524SHoward Hinnant } 44243e519524SHoward Hinnant else 44253e519524SHoward Hinnant { 44263e519524SHoward Hinnant if (__len1 == 1) 44273e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44283e519524SHoward Hinnant // It is known *__first > *__middle 44293e519524SHoward Hinnant swap(*__first, *__middle); 44303e519524SHoward Hinnant return; 44313e519524SHoward Hinnant } 44323e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44333e519524SHoward Hinnant __len11 = __len1 / 2; 44343e519524SHoward Hinnant __m1 = __first; 4435ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44363e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4437ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44383e519524SHoward Hinnant } 44393e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44403e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44413e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44423e519524SHoward Hinnant // swap middle two partitions 4443ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44443e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44453e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44463e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 44473e519524SHoward Hinnant { 44483e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44493e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44503e519524SHoward Hinnant __first = __middle; 44513e519524SHoward Hinnant __middle = __m2; 44523e519524SHoward Hinnant __len1 = __len12; 44533e519524SHoward Hinnant __len2 = __len22; 44543e519524SHoward Hinnant } 44553e519524SHoward Hinnant else 44563e519524SHoward Hinnant { 44573e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44583e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44593e519524SHoward Hinnant __last = __middle; 44603e519524SHoward Hinnant __middle = __m1; 44613e519524SHoward Hinnant __len1 = __len11; 44623e519524SHoward Hinnant __len2 = __len21; 44633e519524SHoward Hinnant } 44643e519524SHoward Hinnant } 44653e519524SHoward Hinnant} 44663e519524SHoward Hinnant 44673e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44693e519524SHoward Hinnantvoid 44703e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44713e519524SHoward Hinnant _Compare __comp) 44723e519524SHoward Hinnant{ 44733e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44743e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4475ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4476ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4477ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44780b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44790b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 44800b48cf9aSMarshall Clow 4481145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44823e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44833e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4484ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 44853e519524SHoward Hinnant __buf.first, __buf.second); 4486145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4488ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 44893e519524SHoward Hinnant __buf.first, __buf.second); 4490145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44913e519524SHoward Hinnant} 44923e519524SHoward Hinnant 44933e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 44943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44953e519524SHoward Hinnantvoid 44963e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 44973e519524SHoward Hinnant{ 4498ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 44993e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45003e519524SHoward Hinnant} 45013e519524SHoward Hinnant 45023e519524SHoward Hinnant// stable_sort 45033e519524SHoward Hinnant 45043e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45053e519524SHoward Hinnantvoid 45063e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45073e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45083e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45093e519524SHoward Hinnant{ 45103e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45113e519524SHoward Hinnant __destruct_n __d(0); 45123e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45133e519524SHoward Hinnant for (; true; ++__result) 45143e519524SHoward Hinnant { 45153e519524SHoward Hinnant if (__first1 == __last1) 45163e519524SHoward Hinnant { 45173e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4518ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45193e519524SHoward Hinnant __h.release(); 45203e519524SHoward Hinnant return; 45213e519524SHoward Hinnant } 45223e519524SHoward Hinnant if (__first2 == __last2) 45233e519524SHoward Hinnant { 45243e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4525ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45263e519524SHoward Hinnant __h.release(); 45273e519524SHoward Hinnant return; 45283e519524SHoward Hinnant } 45293e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45303e519524SHoward Hinnant { 4531ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45323e519524SHoward Hinnant __d.__incr((value_type*)0); 45333e519524SHoward Hinnant ++__first2; 45343e519524SHoward Hinnant } 45353e519524SHoward Hinnant else 45363e519524SHoward Hinnant { 4537ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45383e519524SHoward Hinnant __d.__incr((value_type*)0); 45393e519524SHoward Hinnant ++__first1; 45403e519524SHoward Hinnant } 45413e519524SHoward Hinnant } 45423e519524SHoward Hinnant} 45433e519524SHoward Hinnant 45443e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45453e519524SHoward Hinnantvoid 45463e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45483e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45493e519524SHoward Hinnant{ 45503e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45513e519524SHoward Hinnant { 45523e519524SHoward Hinnant if (__first2 == __last2) 45533e519524SHoward Hinnant { 45543e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4555ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45563e519524SHoward Hinnant return; 45573e519524SHoward Hinnant } 45583e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45593e519524SHoward Hinnant { 4560ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45613e519524SHoward Hinnant ++__first2; 45623e519524SHoward Hinnant } 45633e519524SHoward Hinnant else 45643e519524SHoward Hinnant { 4565ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45663e519524SHoward Hinnant ++__first1; 45673e519524SHoward Hinnant } 45683e519524SHoward Hinnant } 45693e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4570ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45713e519524SHoward Hinnant} 45723e519524SHoward Hinnant 45733e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45743e519524SHoward Hinnantvoid 45753e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45763e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45773e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45783e519524SHoward Hinnant 45793e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45803e519524SHoward Hinnantvoid 45813e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45823e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45833e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 45843e519524SHoward Hinnant{ 45853e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45863e519524SHoward Hinnant switch (__len) 45873e519524SHoward Hinnant { 45883e519524SHoward Hinnant case 0: 45893e519524SHoward Hinnant return; 45903e519524SHoward Hinnant case 1: 4591ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45923e519524SHoward Hinnant return; 45933e519524SHoward Hinnant case 2: 45943e519524SHoward Hinnant __destruct_n __d(0); 45953e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 45963e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 45973e519524SHoward Hinnant { 4598ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45993e519524SHoward Hinnant __d.__incr((value_type*)0); 46003e519524SHoward Hinnant ++__first2; 4601ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46023e519524SHoward Hinnant } 46033e519524SHoward Hinnant else 46043e519524SHoward Hinnant { 4605ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46063e519524SHoward Hinnant __d.__incr((value_type*)0); 46073e519524SHoward Hinnant ++__first2; 4608ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46093e519524SHoward Hinnant } 46103e519524SHoward Hinnant __h2.release(); 46113e519524SHoward Hinnant return; 46123e519524SHoward Hinnant } 46133e519524SHoward Hinnant if (__len <= 8) 46143e519524SHoward Hinnant { 46153e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46163e519524SHoward Hinnant return; 46173e519524SHoward Hinnant } 46183e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46193e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46203e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46213e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46223e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46233e519524SHoward Hinnant} 46243e519524SHoward Hinnant 46253e519524SHoward Hinnanttemplate <class _Tp> 46263e519524SHoward Hinnantstruct __stable_sort_switch 46273e519524SHoward Hinnant{ 4628ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46293e519524SHoward Hinnant}; 46303e519524SHoward Hinnant 46313e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46323e519524SHoward Hinnantvoid 46333e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46343e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46353e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46363e519524SHoward Hinnant{ 46373e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46393e519524SHoward Hinnant switch (__len) 46403e519524SHoward Hinnant { 46413e519524SHoward Hinnant case 0: 46423e519524SHoward Hinnant case 1: 46433e519524SHoward Hinnant return; 46443e519524SHoward Hinnant case 2: 46453e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46463e519524SHoward Hinnant swap(*__first, *__last); 46473e519524SHoward Hinnant return; 46483e519524SHoward Hinnant } 46493e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46503e519524SHoward Hinnant { 46513e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46523e519524SHoward Hinnant return; 46533e519524SHoward Hinnant } 46543e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46553e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46563e519524SHoward Hinnant if (__len <= __buff_size) 46573e519524SHoward Hinnant { 46583e519524SHoward Hinnant __destruct_n __d(0); 46593e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46603e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46613e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46623e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46633e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46643e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46653e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46663e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46673e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46683e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46693e519524SHoward Hinnant// __first, __comp); 46703e519524SHoward Hinnant return; 46713e519524SHoward Hinnant } 46723e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46733e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46743e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46753e519524SHoward Hinnant} 46763e519524SHoward Hinnant 46773e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46793e519524SHoward Hinnantvoid 46803e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46813e519524SHoward Hinnant{ 46823e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46843e519524SHoward Hinnant difference_type __len = __last - __first; 46853e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 46863e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 46873e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46883e519524SHoward Hinnant { 4689ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 46903e519524SHoward Hinnant __h.reset(__buf.first); 46913e519524SHoward Hinnant } 4692145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46933e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46943e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46953e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4696145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46973e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46983e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4699145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47003e519524SHoward Hinnant} 47013e519524SHoward Hinnant 47023e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47043e519524SHoward Hinnantvoid 47053e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47063e519524SHoward Hinnant{ 4707ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47083e519524SHoward Hinnant} 47093e519524SHoward Hinnant 47103e519524SHoward Hinnant// is_heap_until 47113e519524SHoward Hinnant 47123e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 471349c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 47143e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47153e519524SHoward Hinnant{ 4716ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47173e519524SHoward Hinnant difference_type __len = __last - __first; 47183e519524SHoward Hinnant difference_type __p = 0; 47193e519524SHoward Hinnant difference_type __c = 1; 47203e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47213e519524SHoward Hinnant while (__c < __len) 47223e519524SHoward Hinnant { 47233e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47243e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47253e519524SHoward Hinnant return __cp; 47263e519524SHoward Hinnant ++__c; 47273e519524SHoward Hinnant ++__cp; 47283e519524SHoward Hinnant if (__c == __len) 47293e519524SHoward Hinnant return __last; 47303e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47313e519524SHoward Hinnant return __cp; 47323e519524SHoward Hinnant ++__p; 47333e519524SHoward Hinnant ++__pp; 47343e519524SHoward Hinnant __c = 2 * __p + 1; 47353e519524SHoward Hinnant } 47363e519524SHoward Hinnant return __last; 47373e519524SHoward Hinnant} 47383e519524SHoward Hinnant 47393e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 474049c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47413e519524SHoward Hinnant_RandomAccessIterator 47423e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47433e519524SHoward Hinnant{ 4744ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47453e519524SHoward Hinnant} 47463e519524SHoward Hinnant 47473e519524SHoward Hinnant// is_heap 47483e519524SHoward Hinnant 47493e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 475049c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47513e519524SHoward Hinnantbool 47523e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47533e519524SHoward Hinnant{ 4754ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47553e519524SHoward Hinnant} 47563e519524SHoward Hinnant 47573e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 475849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47593e519524SHoward Hinnantbool 47603e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47613e519524SHoward Hinnant{ 4762ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47633e519524SHoward Hinnant} 47643e519524SHoward Hinnant 47653e519524SHoward Hinnant// push_heap 47663e519524SHoward Hinnant 47673e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47683e519524SHoward Hinnantvoid 47698b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47703e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47713e519524SHoward Hinnant{ 47723e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47733e519524SHoward Hinnant if (__len > 1) 47743e519524SHoward Hinnant { 47753e519524SHoward Hinnant __len = (__len - 2) / 2; 47763e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 47773e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 47783e519524SHoward Hinnant { 4779ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 47803e519524SHoward Hinnant do 47813e519524SHoward Hinnant { 4782ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 47833e519524SHoward Hinnant __last = __ptr; 47843e519524SHoward Hinnant if (__len == 0) 47853e519524SHoward Hinnant break; 47863e519524SHoward Hinnant __len = (__len - 1) / 2; 47873e519524SHoward Hinnant __ptr = __first + __len; 47883e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4789ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 47903e519524SHoward Hinnant } 47913e519524SHoward Hinnant } 47923e519524SHoward Hinnant} 47933e519524SHoward Hinnant 47943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47963e519524SHoward Hinnantvoid 47973e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47983e519524SHoward Hinnant{ 4799145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48028b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4803145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48058b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4806145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48073e519524SHoward Hinnant} 48083e519524SHoward Hinnant 48093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48113e519524SHoward Hinnantvoid 48123e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48133e519524SHoward Hinnant{ 4814ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48153e519524SHoward Hinnant} 48163e519524SHoward Hinnant 48173e519524SHoward Hinnant// pop_heap 48183e519524SHoward Hinnant 48193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48208b512602SDavid Majnemervoid 4821fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4822fd838227SEric Fiselier _Compare __comp, 48238b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48248b512602SDavid Majnemer _RandomAccessIterator __start) 48258b512602SDavid Majnemer{ 48268b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48278b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48288b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48298b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48308b512602SDavid Majnemer difference_type __child = __start - __first; 48318b512602SDavid Majnemer 48328b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48338b512602SDavid Majnemer return; 48348b512602SDavid Majnemer 48358b512602SDavid Majnemer __child = 2 * __child + 1; 48368b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 48378b512602SDavid Majnemer 48388b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48398b512602SDavid Majnemer // right-child exists and is greater than left-child 48408b512602SDavid Majnemer ++__child_i; 48418b512602SDavid Majnemer ++__child; 48428b512602SDavid Majnemer } 48438b512602SDavid Majnemer 48448b512602SDavid Majnemer // check if we are in heap-order 48458b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 48468b512602SDavid Majnemer // we are, __start is larger than it's largest child 48478b512602SDavid Majnemer return; 48488b512602SDavid Majnemer 48498b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 48508b512602SDavid Majnemer do 48518b512602SDavid Majnemer { 48528b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 48538b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 48548b512602SDavid Majnemer __start = __child_i; 48558b512602SDavid Majnemer 48568b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 48578b512602SDavid Majnemer break; 48588b512602SDavid Majnemer 48598b512602SDavid Majnemer // recompute the child based off of the updated parent 48608b512602SDavid Majnemer __child = 2 * __child + 1; 48618b512602SDavid Majnemer __child_i = __first + __child; 48628b512602SDavid Majnemer 48638b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48648b512602SDavid Majnemer // right-child exists and is greater than left-child 48658b512602SDavid Majnemer ++__child_i; 48668b512602SDavid Majnemer ++__child; 48678b512602SDavid Majnemer } 48688b512602SDavid Majnemer 48698b512602SDavid Majnemer // check if we are in heap-order 48708b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 48718b512602SDavid Majnemer *__start = _VSTD::move(__top); 48728b512602SDavid Majnemer} 48738b512602SDavid Majnemer 48748b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 48753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48763e519524SHoward Hinnantvoid 48773e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48783e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48793e519524SHoward Hinnant{ 48803e519524SHoward Hinnant if (__len > 1) 48813e519524SHoward Hinnant { 48823e519524SHoward Hinnant swap(*__first, *--__last); 48838b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 48843e519524SHoward Hinnant } 48853e519524SHoward Hinnant} 48863e519524SHoward Hinnant 48873e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48893e519524SHoward Hinnantvoid 48903e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48913e519524SHoward Hinnant{ 4892145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48933e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48943e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48953e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4896145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48973e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48983e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4899145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49003e519524SHoward Hinnant} 49013e519524SHoward Hinnant 49023e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49043e519524SHoward Hinnantvoid 49053e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49063e519524SHoward Hinnant{ 4907ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49083e519524SHoward Hinnant} 49093e519524SHoward Hinnant 49103e519524SHoward Hinnant// make_heap 49113e519524SHoward Hinnant 49123e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49133e519524SHoward Hinnantvoid 49143e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49153e519524SHoward Hinnant{ 49163e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49173e519524SHoward Hinnant difference_type __n = __last - __first; 49183e519524SHoward Hinnant if (__n > 1) 49193e519524SHoward Hinnant { 49208b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49218b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49228b512602SDavid Majnemer { 49238b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49248b512602SDavid Majnemer } 49253e519524SHoward Hinnant } 49263e519524SHoward Hinnant} 49273e519524SHoward Hinnant 49283e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49303e519524SHoward Hinnantvoid 49313e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49323e519524SHoward Hinnant{ 4933145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49363e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4937145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49393e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4940145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49413e519524SHoward Hinnant} 49423e519524SHoward Hinnant 49433e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49453e519524SHoward Hinnantvoid 49463e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49473e519524SHoward Hinnant{ 4948ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49493e519524SHoward Hinnant} 49503e519524SHoward Hinnant 49513e519524SHoward Hinnant// sort_heap 49523e519524SHoward Hinnant 49533e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49543e519524SHoward Hinnantvoid 49553e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49563e519524SHoward Hinnant{ 49573e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49583e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49593e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49603e519524SHoward Hinnant} 49613e519524SHoward Hinnant 49623e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49643e519524SHoward Hinnantvoid 49653e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49663e519524SHoward Hinnant{ 4967145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49683e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49693e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49703e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4971145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49723e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49733e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4974145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49753e519524SHoward Hinnant} 49763e519524SHoward Hinnant 49773e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49793e519524SHoward Hinnantvoid 49803e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49813e519524SHoward Hinnant{ 4982ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49833e519524SHoward Hinnant} 49843e519524SHoward Hinnant 49853e519524SHoward Hinnant// partial_sort 49863e519524SHoward Hinnant 49873e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49883e519524SHoward Hinnantvoid 49893e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49903e519524SHoward Hinnant _Compare __comp) 49913e519524SHoward Hinnant{ 49923e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49933e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49943e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49953e519524SHoward Hinnant { 49963e519524SHoward Hinnant if (__comp(*__i, *__first)) 49973e519524SHoward Hinnant { 49983e519524SHoward Hinnant swap(*__i, *__first); 49998b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50003e519524SHoward Hinnant } 50013e519524SHoward Hinnant } 50023e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50033e519524SHoward Hinnant} 50043e519524SHoward Hinnant 50053e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50073e519524SHoward Hinnantvoid 50083e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50093e519524SHoward Hinnant _Compare __comp) 50103e519524SHoward Hinnant{ 5011145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50143e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5015145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50173e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5018145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50193e519524SHoward Hinnant} 50203e519524SHoward Hinnant 50213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50233e519524SHoward Hinnantvoid 50243e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50253e519524SHoward Hinnant{ 5026ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50273e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50283e519524SHoward Hinnant} 50293e519524SHoward Hinnant 50303e519524SHoward Hinnant// partial_sort_copy 50313e519524SHoward Hinnant 50323e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50333e519524SHoward Hinnant_RandomAccessIterator 50343e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50353e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50363e519524SHoward Hinnant{ 50373e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50383e519524SHoward Hinnant if (__r != __result_last) 50393e519524SHoward Hinnant { 5040910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 50413e519524SHoward Hinnant *__r = *__first; 50423e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50438b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 50443e519524SHoward Hinnant for (; __first != __last; ++__first) 50453e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50463e519524SHoward Hinnant { 50473e519524SHoward Hinnant *__result_first = *__first; 50488b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 50493e519524SHoward Hinnant } 50503e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50513e519524SHoward Hinnant } 50523e519524SHoward Hinnant return __r; 50533e519524SHoward Hinnant} 50543e519524SHoward Hinnant 50553e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50573e519524SHoward Hinnant_RandomAccessIterator 50583e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50593e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50603e519524SHoward Hinnant{ 5061145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50623e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50633e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50643e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5065145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50663e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50673e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5068145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50693e519524SHoward Hinnant} 50703e519524SHoward Hinnant 50713e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50733e519524SHoward Hinnant_RandomAccessIterator 50743e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50753e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50763e519524SHoward Hinnant{ 5077ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50783e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50793e519524SHoward Hinnant} 50803e519524SHoward Hinnant 50813e519524SHoward Hinnant// nth_element 50823e519524SHoward Hinnant 50833e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50843e519524SHoward Hinnantvoid 50853e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50863e519524SHoward Hinnant{ 50873e519524SHoward Hinnant // _Compare is known to be a reference type 50883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50893e519524SHoward Hinnant const difference_type __limit = 7; 50903e519524SHoward Hinnant while (true) 50913e519524SHoward Hinnant { 50923e519524SHoward Hinnant __restart: 5093b34b4819SHoward Hinnant if (__nth == __last) 5094b34b4819SHoward Hinnant return; 50953e519524SHoward Hinnant difference_type __len = __last - __first; 50963e519524SHoward Hinnant switch (__len) 50973e519524SHoward Hinnant { 50983e519524SHoward Hinnant case 0: 50993e519524SHoward Hinnant case 1: 51003e519524SHoward Hinnant return; 51013e519524SHoward Hinnant case 2: 51023e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51033e519524SHoward Hinnant swap(*__first, *__last); 51043e519524SHoward Hinnant return; 51053e519524SHoward Hinnant case 3: 51063e519524SHoward Hinnant { 51073e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5108ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51093e519524SHoward Hinnant return; 51103e519524SHoward Hinnant } 51113e519524SHoward Hinnant } 51123e519524SHoward Hinnant if (__len <= __limit) 51133e519524SHoward Hinnant { 51143e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51153e519524SHoward Hinnant return; 51163e519524SHoward Hinnant } 51173e519524SHoward Hinnant // __len > __limit >= 3 51183e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51193e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5120ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51213e519524SHoward Hinnant // *__m is median 51223e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51233e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51243e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51253e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51263e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51273e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51283e519524SHoward Hinnant // Prime the downward search with a guard. 51293e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51303e519524SHoward Hinnant { 51313e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51323e519524SHoward Hinnant // manually guard downward moving __j against __i 51333e519524SHoward Hinnant while (true) 51343e519524SHoward Hinnant { 51353e519524SHoward Hinnant if (__i == --__j) 51363e519524SHoward Hinnant { 51373e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51383e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51393e519524SHoward Hinnant ++__i; // __first + 1 51403e519524SHoward Hinnant __j = __last; 51413e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51423e519524SHoward Hinnant { 51433e519524SHoward Hinnant while (true) 51443e519524SHoward Hinnant { 51453e519524SHoward Hinnant if (__i == __j) 51463e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51473e519524SHoward Hinnant if (__comp(*__first, *__i)) 51483e519524SHoward Hinnant { 51493e519524SHoward Hinnant swap(*__i, *__j); 51503e519524SHoward Hinnant ++__n_swaps; 51513e519524SHoward Hinnant ++__i; 51523e519524SHoward Hinnant break; 51533e519524SHoward Hinnant } 51543e519524SHoward Hinnant ++__i; 51553e519524SHoward Hinnant } 51563e519524SHoward Hinnant } 51573e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51583e519524SHoward Hinnant if (__i == __j) 51593e519524SHoward Hinnant return; 51603e519524SHoward Hinnant while (true) 51613e519524SHoward Hinnant { 51623e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51633e519524SHoward Hinnant ++__i; 51643e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51653e519524SHoward Hinnant ; 51663e519524SHoward Hinnant if (__i >= __j) 51673e519524SHoward Hinnant break; 51683e519524SHoward Hinnant swap(*__i, *__j); 51693e519524SHoward Hinnant ++__n_swaps; 51703e519524SHoward Hinnant ++__i; 51713e519524SHoward Hinnant } 51723e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51733e519524SHoward Hinnant // The first part is sorted, 51743e519524SHoward Hinnant if (__nth < __i) 51753e519524SHoward Hinnant return; 51763e519524SHoward Hinnant // __nth_element the secod part 51773e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51783e519524SHoward Hinnant __first = __i; 51793e519524SHoward Hinnant goto __restart; 51803e519524SHoward Hinnant } 51813e519524SHoward Hinnant if (__comp(*__j, *__m)) 51823e519524SHoward Hinnant { 51833e519524SHoward Hinnant swap(*__i, *__j); 51843e519524SHoward Hinnant ++__n_swaps; 51853e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51863e519524SHoward Hinnant } 51873e519524SHoward Hinnant } 51883e519524SHoward Hinnant } 51893e519524SHoward Hinnant ++__i; 51903e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51913e519524SHoward Hinnant // if not yet partitioned... 51923e519524SHoward Hinnant if (__i < __j) 51933e519524SHoward Hinnant { 51943e519524SHoward Hinnant // known that *(__i - 1) < *__m 51953e519524SHoward Hinnant while (true) 51963e519524SHoward Hinnant { 51973e519524SHoward Hinnant // __m still guards upward moving __i 51983e519524SHoward Hinnant while (__comp(*__i, *__m)) 51993e519524SHoward Hinnant ++__i; 52003e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52013e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52023e519524SHoward Hinnant ; 52033e519524SHoward Hinnant if (__i >= __j) 52043e519524SHoward Hinnant break; 52053e519524SHoward Hinnant swap(*__i, *__j); 52063e519524SHoward Hinnant ++__n_swaps; 52073e519524SHoward Hinnant // It is known that __m != __j 52083e519524SHoward Hinnant // If __m just moved, follow it 52093e519524SHoward Hinnant if (__m == __i) 52103e519524SHoward Hinnant __m = __j; 52113e519524SHoward Hinnant ++__i; 52123e519524SHoward Hinnant } 52133e519524SHoward Hinnant } 52143e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52153e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52163e519524SHoward Hinnant { 52173e519524SHoward Hinnant swap(*__i, *__m); 52183e519524SHoward Hinnant ++__n_swaps; 52193e519524SHoward Hinnant } 52203e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52213e519524SHoward Hinnant if (__nth == __i) 52223e519524SHoward Hinnant return; 52233e519524SHoward Hinnant if (__n_swaps == 0) 52243e519524SHoward Hinnant { 52253e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52263e519524SHoward Hinnant if (__nth < __i) 52273e519524SHoward Hinnant { 52283e519524SHoward Hinnant // Check for [__first, __i) already sorted 52293e519524SHoward Hinnant __j = __m = __first; 52303e519524SHoward Hinnant while (++__j != __i) 52313e519524SHoward Hinnant { 52323e519524SHoward Hinnant if (__comp(*__j, *__m)) 52333e519524SHoward Hinnant // not yet sorted, so sort 52343e519524SHoward Hinnant goto not_sorted; 52353e519524SHoward Hinnant __m = __j; 52363e519524SHoward Hinnant } 52373e519524SHoward Hinnant // [__first, __i) sorted 52383e519524SHoward Hinnant return; 52393e519524SHoward Hinnant } 52403e519524SHoward Hinnant else 52413e519524SHoward Hinnant { 52423e519524SHoward Hinnant // Check for [__i, __last) already sorted 52433e519524SHoward Hinnant __j = __m = __i; 52443e519524SHoward Hinnant while (++__j != __last) 52453e519524SHoward Hinnant { 52463e519524SHoward Hinnant if (__comp(*__j, *__m)) 52473e519524SHoward Hinnant // not yet sorted, so sort 52483e519524SHoward Hinnant goto not_sorted; 52493e519524SHoward Hinnant __m = __j; 52503e519524SHoward Hinnant } 52513e519524SHoward Hinnant // [__i, __last) sorted 52523e519524SHoward Hinnant return; 52533e519524SHoward Hinnant } 52543e519524SHoward Hinnant } 52553e519524SHoward Hinnantnot_sorted: 52563e519524SHoward Hinnant // __nth_element on range containing __nth 52573e519524SHoward Hinnant if (__nth < __i) 52583e519524SHoward Hinnant { 52593e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52603e519524SHoward Hinnant __last = __i; 52613e519524SHoward Hinnant } 52623e519524SHoward Hinnant else 52633e519524SHoward Hinnant { 52643e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52653e519524SHoward Hinnant __first = ++__i; 52663e519524SHoward Hinnant } 52673e519524SHoward Hinnant } 52683e519524SHoward Hinnant} 52693e519524SHoward Hinnant 52703e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52723e519524SHoward Hinnantvoid 52733e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52743e519524SHoward Hinnant{ 5275145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52783e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5279145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52813e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5282145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52833e519524SHoward Hinnant} 52843e519524SHoward Hinnant 52853e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52873e519524SHoward Hinnantvoid 52883e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52893e519524SHoward Hinnant{ 5290ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52913e519524SHoward Hinnant} 52923e519524SHoward Hinnant 52933e519524SHoward Hinnant// includes 52943e519524SHoward Hinnant 52953e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52968da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 52973e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52983e519524SHoward Hinnant _Compare __comp) 52993e519524SHoward Hinnant{ 53003e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53013e519524SHoward Hinnant { 53023e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53033e519524SHoward Hinnant return false; 53043e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53053e519524SHoward Hinnant ++__first2; 53063e519524SHoward Hinnant } 53073e519524SHoward Hinnant return true; 53083e519524SHoward Hinnant} 53093e519524SHoward Hinnant 53103e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53118da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53123e519524SHoward Hinnantbool 53133e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53143e519524SHoward Hinnant _Compare __comp) 53153e519524SHoward Hinnant{ 5316145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53193e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5320145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53223e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5323145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53243e519524SHoward Hinnant} 53253e519524SHoward Hinnant 53263e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53278da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53283e519524SHoward Hinnantbool 53293e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53303e519524SHoward Hinnant{ 5331ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53323e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53333e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53343e519524SHoward Hinnant} 53353e519524SHoward Hinnant 53363e519524SHoward Hinnant// set_union 53373e519524SHoward Hinnant 53383e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53393e519524SHoward Hinnant_OutputIterator 53403e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53413e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53423e519524SHoward Hinnant{ 53433e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53443e519524SHoward Hinnant { 53453e519524SHoward Hinnant if (__first2 == __last2) 5346ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53473e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53483e519524SHoward Hinnant { 53493e519524SHoward Hinnant *__result = *__first2; 53503e519524SHoward Hinnant ++__first2; 53513e519524SHoward Hinnant } 53523e519524SHoward Hinnant else 53533e519524SHoward Hinnant { 53543e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53553e519524SHoward Hinnant ++__first2; 535605da5b02SMarshall Clow *__result = *__first1; 53573e519524SHoward Hinnant ++__first1; 53583e519524SHoward Hinnant } 53593e519524SHoward Hinnant } 5360ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53613e519524SHoward Hinnant} 53623e519524SHoward Hinnant 53633e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53653e519524SHoward Hinnant_OutputIterator 53663e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53673e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53683e519524SHoward Hinnant{ 5369145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53703e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53713e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53723e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5373145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53743e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53753e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5376145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53773e519524SHoward Hinnant} 53783e519524SHoward Hinnant 53793e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53813e519524SHoward Hinnant_OutputIterator 53823e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53833e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53843e519524SHoward Hinnant{ 5385ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53863e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53873e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53883e519524SHoward Hinnant} 53893e519524SHoward Hinnant 53903e519524SHoward Hinnant// set_intersection 53913e519524SHoward Hinnant 53923e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53938da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 53943e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53953e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53963e519524SHoward Hinnant{ 53973e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 53983e519524SHoward Hinnant { 53993e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54003e519524SHoward Hinnant ++__first1; 54013e519524SHoward Hinnant else 54023e519524SHoward Hinnant { 54033e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54043e519524SHoward Hinnant { 54053e519524SHoward Hinnant *__result = *__first1; 54063e519524SHoward Hinnant ++__result; 54073e519524SHoward Hinnant ++__first1; 54083e519524SHoward Hinnant } 54093e519524SHoward Hinnant ++__first2; 54103e519524SHoward Hinnant } 54113e519524SHoward Hinnant } 54123e519524SHoward Hinnant return __result; 54133e519524SHoward Hinnant} 54143e519524SHoward Hinnant 54153e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54168da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54173e519524SHoward Hinnant_OutputIterator 54183e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54193e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54203e519524SHoward Hinnant{ 5421145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54223e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54233e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54243e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5425145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54263e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54273e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5428145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54293e519524SHoward Hinnant} 54303e519524SHoward Hinnant 54313e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54328da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54333e519524SHoward Hinnant_OutputIterator 54343e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54353e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54363e519524SHoward Hinnant{ 5437ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54383e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54393e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54403e519524SHoward Hinnant} 54413e519524SHoward Hinnant 54423e519524SHoward Hinnant// set_difference 54433e519524SHoward Hinnant 54443e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54453e519524SHoward Hinnant_OutputIterator 54463e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54483e519524SHoward Hinnant{ 54493e519524SHoward Hinnant while (__first1 != __last1) 54503e519524SHoward Hinnant { 54513e519524SHoward Hinnant if (__first2 == __last2) 5452ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54533e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54543e519524SHoward Hinnant { 54553e519524SHoward Hinnant *__result = *__first1; 54563e519524SHoward Hinnant ++__result; 54573e519524SHoward Hinnant ++__first1; 54583e519524SHoward Hinnant } 54593e519524SHoward Hinnant else 54603e519524SHoward Hinnant { 54613e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54623e519524SHoward Hinnant ++__first1; 54633e519524SHoward Hinnant ++__first2; 54643e519524SHoward Hinnant } 54653e519524SHoward Hinnant } 54663e519524SHoward Hinnant return __result; 54673e519524SHoward Hinnant} 54683e519524SHoward Hinnant 54693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54713e519524SHoward Hinnant_OutputIterator 54723e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54733e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54743e519524SHoward Hinnant{ 5475145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54783e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5479145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54813e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5482145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54833e519524SHoward Hinnant} 54843e519524SHoward Hinnant 54853e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54873e519524SHoward Hinnant_OutputIterator 54883e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54893e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54903e519524SHoward Hinnant{ 5491ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54923e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54933e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54943e519524SHoward Hinnant} 54953e519524SHoward Hinnant 54963e519524SHoward Hinnant// set_symmetric_difference 54973e519524SHoward Hinnant 54983e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54993e519524SHoward Hinnant_OutputIterator 55003e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55023e519524SHoward Hinnant{ 55033e519524SHoward Hinnant while (__first1 != __last1) 55043e519524SHoward Hinnant { 55053e519524SHoward Hinnant if (__first2 == __last2) 5506ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55073e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55083e519524SHoward Hinnant { 55093e519524SHoward Hinnant *__result = *__first1; 55103e519524SHoward Hinnant ++__result; 55113e519524SHoward Hinnant ++__first1; 55123e519524SHoward Hinnant } 55133e519524SHoward Hinnant else 55143e519524SHoward Hinnant { 55153e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55163e519524SHoward Hinnant { 55173e519524SHoward Hinnant *__result = *__first2; 55183e519524SHoward Hinnant ++__result; 55193e519524SHoward Hinnant } 55203e519524SHoward Hinnant else 55213e519524SHoward Hinnant ++__first1; 55223e519524SHoward Hinnant ++__first2; 55233e519524SHoward Hinnant } 55243e519524SHoward Hinnant } 5525ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55263e519524SHoward Hinnant} 55273e519524SHoward Hinnant 55283e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55303e519524SHoward Hinnant_OutputIterator 55313e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55323e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55333e519524SHoward Hinnant{ 5534145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55353e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55363e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55373e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5538145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55393e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55403e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5541145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55423e519524SHoward Hinnant} 55433e519524SHoward Hinnant 55443e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55463e519524SHoward Hinnant_OutputIterator 55473e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55483e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55493e519524SHoward Hinnant{ 5550ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55513e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55523e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55533e519524SHoward Hinnant} 55543e519524SHoward Hinnant 55553e519524SHoward Hinnant// lexicographical_compare 55563e519524SHoward Hinnant 55573e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55581b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 55593e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55613e519524SHoward Hinnant{ 5562910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 55633e519524SHoward Hinnant { 55643e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55653e519524SHoward Hinnant return true; 55663e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55673e519524SHoward Hinnant return false; 55683e519524SHoward Hinnant } 55693e519524SHoward Hinnant return false; 55703e519524SHoward Hinnant} 55713e519524SHoward Hinnant 55723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55731b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55743e519524SHoward Hinnantbool 55753e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55773e519524SHoward Hinnant{ 5578145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55793e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55803e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55813e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5582145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55833e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55843e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5585145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55863e519524SHoward Hinnant} 55873e519524SHoward Hinnant 55883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55891b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55903e519524SHoward Hinnantbool 55913e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55933e519524SHoward Hinnant{ 5594ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55953e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55963e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55973e519524SHoward Hinnant} 55983e519524SHoward Hinnant 55993e519524SHoward Hinnant// next_permutation 56003e519524SHoward Hinnant 56013e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56023e519524SHoward Hinnantbool 56033e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56043e519524SHoward Hinnant{ 56053e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56063e519524SHoward Hinnant if (__first == __last || __first == --__i) 56073e519524SHoward Hinnant return false; 56083e519524SHoward Hinnant while (true) 56093e519524SHoward Hinnant { 56103e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56113e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56123e519524SHoward Hinnant { 56133e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56143e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56153e519524SHoward Hinnant ; 56163e519524SHoward Hinnant swap(*__i, *__j); 5617ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56183e519524SHoward Hinnant return true; 56193e519524SHoward Hinnant } 56203e519524SHoward Hinnant if (__i == __first) 56213e519524SHoward Hinnant { 5622ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56233e519524SHoward Hinnant return false; 56243e519524SHoward Hinnant } 56253e519524SHoward Hinnant } 56263e519524SHoward Hinnant} 56273e519524SHoward Hinnant 56283e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56303e519524SHoward Hinnantbool 56313e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56323e519524SHoward Hinnant{ 5633145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56363e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5637145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56393e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5640145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56413e519524SHoward Hinnant} 56423e519524SHoward Hinnant 56433e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56453e519524SHoward Hinnantbool 56463e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56473e519524SHoward Hinnant{ 5648ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56493e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56503e519524SHoward Hinnant} 56513e519524SHoward Hinnant 56523e519524SHoward Hinnant// prev_permutation 56533e519524SHoward Hinnant 56543e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56553e519524SHoward Hinnantbool 56563e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56573e519524SHoward Hinnant{ 56583e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56593e519524SHoward Hinnant if (__first == __last || __first == --__i) 56603e519524SHoward Hinnant return false; 56613e519524SHoward Hinnant while (true) 56623e519524SHoward Hinnant { 56633e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56643e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56653e519524SHoward Hinnant { 56663e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56673e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56683e519524SHoward Hinnant ; 56693e519524SHoward Hinnant swap(*__i, *__j); 5670ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56713e519524SHoward Hinnant return true; 56723e519524SHoward Hinnant } 56733e519524SHoward Hinnant if (__i == __first) 56743e519524SHoward Hinnant { 5675ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56763e519524SHoward Hinnant return false; 56773e519524SHoward Hinnant } 56783e519524SHoward Hinnant } 56793e519524SHoward Hinnant} 56803e519524SHoward Hinnant 56813e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56833e519524SHoward Hinnantbool 56843e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56853e519524SHoward Hinnant{ 5686145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56873e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56883e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56893e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5690145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56913e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56923e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5693145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56943e519524SHoward Hinnant} 56953e519524SHoward Hinnant 56963e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56983e519524SHoward Hinnantbool 56993e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57003e519524SHoward Hinnant{ 5701ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57023e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57033e519524SHoward Hinnant} 57043e519524SHoward Hinnant 57053e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57063e519524SHoward Hinnant 5707a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5708a016efb1SEric Fiselier 57093e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5710