13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 457b08b09SChandler Carruth// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 557b08b09SChandler Carruth// See https://llvm.org/LICENSE.txt for license information. 657b08b09SChandler 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{ 783aa1cad15SEric Fiselier _Compare &__comp_; 784aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 7853e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 786331d2159SEric Fiselier 7873e519524SHoward Hinnant template <class _Tp, class _Up> 788*3c3ccc00SThomas Anderson bool operator()(const _Tp& __x, const _Up& __y) 789*3c3ccc00SThomas Anderson { 790*3c3ccc00SThomas Anderson bool __r = __comp_(__x, __y); 791*3c3ccc00SThomas Anderson if (__r) 792*3c3ccc00SThomas Anderson __do_compare_assert(0, __y, __x); 793*3c3ccc00SThomas Anderson return __r; 794*3c3ccc00SThomas Anderson } 795*3c3ccc00SThomas Anderson 796*3c3ccc00SThomas Anderson template <class _Tp, class _Up> 797aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 7986e4ec602SEric Fiselier bool operator()(_Tp& __x, _Up& __y) 7993e519524SHoward Hinnant { 8003e519524SHoward Hinnant bool __r = __comp_(__x, __y); 8013e519524SHoward Hinnant if (__r) 802331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 8033e519524SHoward Hinnant return __r; 8043e519524SHoward Hinnant } 805331d2159SEric Fiselier 806331d2159SEric Fiselier template <class _LHS, class _RHS> 807aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 808331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 809331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 8106e4ec602SEric Fiselier _VSTD::declval<_LHS &>(), _VSTD::declval<_RHS &>())) 8116e4ec602SEric Fiselier __do_compare_assert(int, _LHS & __l, _RHS & __r) { 812331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 813331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 814331d2159SEric Fiselier } 815331d2159SEric Fiselier 816331d2159SEric Fiselier template <class _LHS, class _RHS> 817aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 818331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 8196e4ec602SEric Fiselier void __do_compare_assert(long, _LHS &, _RHS &) {} 8203e519524SHoward Hinnant}; 8213e519524SHoward Hinnant 822145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 8233e519524SHoward Hinnant 824aa1cad15SEric Fiseliertemplate <class _Comp> 825aa1cad15SEric Fiselierstruct __comp_ref_type { 826aa1cad15SEric Fiselier // Pass the comparator by lvalue reference. Or in debug mode, using a 827aa1cad15SEric Fiselier // debugging wrapper that stores a reference. 828aa1cad15SEric Fiselier#ifndef _LIBCPP_DEBUG 829aa1cad15SEric Fiselier typedef typename add_lvalue_reference<_Comp>::type type; 830aa1cad15SEric Fiselier#else 831aa1cad15SEric Fiselier typedef __debug_less<_Comp> type; 832aa1cad15SEric Fiselier#endif 833aa1cad15SEric Fiselier}; 834aa1cad15SEric Fiselier 8353e519524SHoward Hinnant// all_of 8363e519524SHoward Hinnant 8373e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8381362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8391362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8403e519524SHoward Hinnantbool 8413e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8423e519524SHoward Hinnant{ 8433e519524SHoward Hinnant for (; __first != __last; ++__first) 8443e519524SHoward Hinnant if (!__pred(*__first)) 8453e519524SHoward Hinnant return false; 8463e519524SHoward Hinnant return true; 8473e519524SHoward Hinnant} 8483e519524SHoward Hinnant 8493e519524SHoward Hinnant// any_of 8503e519524SHoward Hinnant 8513e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8521362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8531362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8543e519524SHoward Hinnantbool 8553e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8563e519524SHoward Hinnant{ 8573e519524SHoward Hinnant for (; __first != __last; ++__first) 8583e519524SHoward Hinnant if (__pred(*__first)) 8593e519524SHoward Hinnant return true; 8603e519524SHoward Hinnant return false; 8613e519524SHoward Hinnant} 8623e519524SHoward Hinnant 8633e519524SHoward Hinnant// none_of 8643e519524SHoward Hinnant 8653e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8661362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8671362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8683e519524SHoward Hinnantbool 8693e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8703e519524SHoward Hinnant{ 8713e519524SHoward Hinnant for (; __first != __last; ++__first) 8723e519524SHoward Hinnant if (__pred(*__first)) 8733e519524SHoward Hinnant return false; 8743e519524SHoward Hinnant return true; 8753e519524SHoward Hinnant} 8763e519524SHoward Hinnant 8773e519524SHoward Hinnant// for_each 8783e519524SHoward Hinnant 8793e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8801b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8813e519524SHoward Hinnant_Function 8823e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8833e519524SHoward Hinnant{ 8843e519524SHoward Hinnant for (; __first != __last; ++__first) 8853e519524SHoward Hinnant __f(*__first); 8861c7fe126SMarshall Clow return __f; 8873e519524SHoward Hinnant} 8883e519524SHoward Hinnant 8891d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 890d5c65ffaSMarshall Clow// for_each_n 891d5c65ffaSMarshall Clow 892d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 8931b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 894d5c65ffaSMarshall Clow_InputIterator 895d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 896d5c65ffaSMarshall Clow{ 897d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 898d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 899d5c65ffaSMarshall Clow while (__n > 0) 900d5c65ffaSMarshall Clow { 901d5c65ffaSMarshall Clow __f(*__first); 902d5c65ffaSMarshall Clow ++__first; 903d5c65ffaSMarshall Clow --__n; 904d5c65ffaSMarshall Clow } 905d5c65ffaSMarshall Clow return __first; 906d5c65ffaSMarshall Clow} 9071d02996dSMarshall Clow#endif 908d5c65ffaSMarshall Clow 9093e519524SHoward Hinnant// find 9103e519524SHoward Hinnant 9113e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9121362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9131362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9143e519524SHoward Hinnant_InputIterator 915e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9163e519524SHoward Hinnant{ 9173e519524SHoward Hinnant for (; __first != __last; ++__first) 918e4383379SHoward Hinnant if (*__first == __value_) 9193e519524SHoward Hinnant break; 9203e519524SHoward Hinnant return __first; 9213e519524SHoward Hinnant} 9223e519524SHoward Hinnant 9233e519524SHoward Hinnant// find_if 9243e519524SHoward Hinnant 9253e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9261362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9271362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9283e519524SHoward Hinnant_InputIterator 9293e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9303e519524SHoward Hinnant{ 9313e519524SHoward Hinnant for (; __first != __last; ++__first) 9323e519524SHoward Hinnant if (__pred(*__first)) 9333e519524SHoward Hinnant break; 9343e519524SHoward Hinnant return __first; 9353e519524SHoward Hinnant} 9363e519524SHoward Hinnant 9373e519524SHoward Hinnant// find_if_not 9383e519524SHoward Hinnant 9393e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9401362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9411362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9423e519524SHoward Hinnant_InputIterator 9433e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9443e519524SHoward Hinnant{ 9453e519524SHoward Hinnant for (; __first != __last; ++__first) 9463e519524SHoward Hinnant if (!__pred(*__first)) 9473e519524SHoward Hinnant break; 9483e519524SHoward Hinnant return __first; 9493e519524SHoward Hinnant} 9503e519524SHoward Hinnant 9513e519524SHoward Hinnant// find_end 9523e519524SHoward Hinnant 9533e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9548694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 9553e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9563e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9573e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9583e519524SHoward Hinnant{ 9593e519524SHoward Hinnant // modeled after search algorithm 9603e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9613e519524SHoward Hinnant if (__first2 == __last2) 9623e519524SHoward Hinnant return __r; 9633e519524SHoward Hinnant while (true) 9643e519524SHoward Hinnant { 9653e519524SHoward Hinnant while (true) 9663e519524SHoward Hinnant { 9673e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9683e519524SHoward Hinnant return __r; // (or __last1 if never found) 9693e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9703e519524SHoward Hinnant break; 9713e519524SHoward Hinnant ++__first1; 9723e519524SHoward Hinnant } 9733e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9743e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9753e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9763e519524SHoward Hinnant while (true) 9773e519524SHoward Hinnant { 9783e519524SHoward Hinnant if (++__m2 == __last2) 9793e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9803e519524SHoward Hinnant __r = __first1; 9813e519524SHoward Hinnant ++__first1; 9823e519524SHoward Hinnant break; 9833e519524SHoward Hinnant } 9843e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9853e519524SHoward Hinnant return __r; 9863e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9873e519524SHoward Hinnant { 9883e519524SHoward Hinnant ++__first1; 9893e519524SHoward Hinnant break; 9903e519524SHoward Hinnant } // else there is a match, check next elements 9913e519524SHoward Hinnant } 9923e519524SHoward Hinnant } 9933e519524SHoward Hinnant} 9943e519524SHoward Hinnant 9953e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9968694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 9973e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9983e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9993e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10003e519524SHoward Hinnant{ 10013e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10023e519524SHoward Hinnant if (__first2 == __last2) 10033e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10043e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10053e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10063e519524SHoward Hinnant --__l2; 10073e519524SHoward Hinnant while (true) 10083e519524SHoward Hinnant { 10093e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10103e519524SHoward Hinnant while (true) 10113e519524SHoward Hinnant { 10123e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10133e519524SHoward Hinnant return __last1; 10143e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10153e519524SHoward Hinnant break; 10163e519524SHoward Hinnant } 10173e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10183e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10193e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10203e519524SHoward Hinnant while (true) 10213e519524SHoward Hinnant { 10223e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 10233e519524SHoward Hinnant return __m1; 10243e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 10253e519524SHoward Hinnant return __last1; 10263e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 10273e519524SHoward Hinnant { 10283e519524SHoward Hinnant break; 10293e519524SHoward Hinnant } // else there is a match, check next elements 10303e519524SHoward Hinnant } 10313e519524SHoward Hinnant } 10323e519524SHoward Hinnant} 10333e519524SHoward Hinnant 10343e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10359b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10363e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10373e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10383e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10393e519524SHoward Hinnant{ 10403e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10413e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10423e519524SHoward Hinnant if (__len2 == 0) 10433e519524SHoward Hinnant return __last1; 10443e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10453e519524SHoward Hinnant if (__len1 < __len2) 10463e519524SHoward Hinnant return __last1; 10473e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 10483e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10493e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10503e519524SHoward Hinnant --__l2; 10513e519524SHoward Hinnant while (true) 10523e519524SHoward Hinnant { 10533e519524SHoward Hinnant while (true) 10543e519524SHoward Hinnant { 10553e519524SHoward Hinnant if (__s == __l1) 10563e519524SHoward Hinnant return __last1; 10573e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10583e519524SHoward Hinnant break; 10593e519524SHoward Hinnant } 10603e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10613e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10623e519524SHoward Hinnant while (true) 10633e519524SHoward Hinnant { 10643e519524SHoward Hinnant if (__m2 == __first2) 10653e519524SHoward Hinnant return __m1; 10663e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10673e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10683e519524SHoward Hinnant { 10693e519524SHoward Hinnant break; 10703e519524SHoward Hinnant } 10713e519524SHoward Hinnant } 10723e519524SHoward Hinnant } 10733e519524SHoward Hinnant} 10743e519524SHoward Hinnant 10753e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10761362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 10771362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10783e519524SHoward Hinnant_ForwardIterator1 10793e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10803e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10813e519524SHoward Hinnant{ 1082ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10833e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10843e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10853e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10863e519524SHoward Hinnant} 10873e519524SHoward Hinnant 10883e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10891362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 10901362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10913e519524SHoward Hinnant_ForwardIterator1 10923e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10933e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10943e519524SHoward Hinnant{ 10953e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10963e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1097ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10983e519524SHoward Hinnant} 10993e519524SHoward Hinnant 11003e519524SHoward Hinnant// find_first_of 11013e519524SHoward Hinnant 11023e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11039b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11049b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11053e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11063e519524SHoward Hinnant{ 11073e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11083e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11093e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11103e519524SHoward Hinnant return __first1; 11113e519524SHoward Hinnant return __last1; 11123e519524SHoward Hinnant} 11133e519524SHoward Hinnant 11149b0af34dSMarshall Clow 11159b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11161362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11171362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11189b0af34dSMarshall Clow_ForwardIterator1 11199b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11209b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11219b0af34dSMarshall Clow{ 11229b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11239b0af34dSMarshall Clow} 11249b0af34dSMarshall Clow 11253e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11261362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11271362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11283e519524SHoward Hinnant_ForwardIterator1 11293e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11303e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11313e519524SHoward Hinnant{ 11323e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11333e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11349b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11353e519524SHoward Hinnant} 11363e519524SHoward Hinnant 11373e519524SHoward Hinnant// adjacent_find 11383e519524SHoward Hinnant 11393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11401362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11411362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11423e519524SHoward Hinnant_ForwardIterator 11433e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11443e519524SHoward Hinnant{ 11453e519524SHoward Hinnant if (__first != __last) 11463e519524SHoward Hinnant { 11473e519524SHoward Hinnant _ForwardIterator __i = __first; 11483e519524SHoward Hinnant while (++__i != __last) 11493e519524SHoward Hinnant { 11503e519524SHoward Hinnant if (__pred(*__first, *__i)) 11513e519524SHoward Hinnant return __first; 11523e519524SHoward Hinnant __first = __i; 11533e519524SHoward Hinnant } 11543e519524SHoward Hinnant } 11553e519524SHoward Hinnant return __last; 11563e519524SHoward Hinnant} 11573e519524SHoward Hinnant 11583e519524SHoward Hinnanttemplate <class _ForwardIterator> 11591362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11601362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11613e519524SHoward Hinnant_ForwardIterator 11623e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11633e519524SHoward Hinnant{ 11643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1165ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11663e519524SHoward Hinnant} 11673e519524SHoward Hinnant 11683e519524SHoward Hinnant// count 11693e519524SHoward Hinnant 11703e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 11711362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11721362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11733e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1174e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11753e519524SHoward Hinnant{ 11763e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11773e519524SHoward Hinnant for (; __first != __last; ++__first) 1178e4383379SHoward Hinnant if (*__first == __value_) 11793e519524SHoward Hinnant ++__r; 11803e519524SHoward Hinnant return __r; 11813e519524SHoward Hinnant} 11823e519524SHoward Hinnant 11833e519524SHoward Hinnant// count_if 11843e519524SHoward Hinnant 11853e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11861362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11871362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11883e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11893e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11903e519524SHoward Hinnant{ 11913e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11923e519524SHoward Hinnant for (; __first != __last; ++__first) 11933e519524SHoward Hinnant if (__pred(*__first)) 11943e519524SHoward Hinnant ++__r; 11953e519524SHoward Hinnant return __r; 11963e519524SHoward Hinnant} 11973e519524SHoward Hinnant 11983e519524SHoward Hinnant// mismatch 11993e519524SHoward Hinnant 12003e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12011362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12021362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12033e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12043e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12053e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12063e519524SHoward Hinnant{ 1207bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12083e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12093e519524SHoward Hinnant break; 12103e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12113e519524SHoward Hinnant} 12123e519524SHoward Hinnant 12133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12141362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12151362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12163e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12173e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12183e519524SHoward Hinnant{ 12193e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12203e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1221ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12223e519524SHoward Hinnant} 12233e519524SHoward Hinnant 12240b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12250b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12261362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12271362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12280b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12290b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12300b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12310b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12320b0bbd2fSMarshall Clow{ 1233bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12340b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12350b0bbd2fSMarshall Clow break; 12360b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12370b0bbd2fSMarshall Clow} 12380b0bbd2fSMarshall Clow 12390b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12401362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12411362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12420b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12430b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12440b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12450b0bbd2fSMarshall Clow{ 12460b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12470b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12480b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12490b0bbd2fSMarshall Clow} 12500b0bbd2fSMarshall Clow#endif 12510b0bbd2fSMarshall Clow 12523e519524SHoward Hinnant// equal 12533e519524SHoward Hinnant 12543e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12551362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12561362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12573e519524SHoward Hinnantbool 12583e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12593e519524SHoward Hinnant{ 1260910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12613e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12623e519524SHoward Hinnant return false; 12633e519524SHoward Hinnant return true; 12643e519524SHoward Hinnant} 12653e519524SHoward Hinnant 12663e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12671362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12681362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12693e519524SHoward Hinnantbool 12703e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12713e519524SHoward Hinnant{ 12723e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12733e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1274ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12753e519524SHoward Hinnant} 12763e519524SHoward Hinnant 12770b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12780b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12796538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12800b0bbd2fSMarshall Clowbool 12810b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12820b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12830b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12840b0bbd2fSMarshall Clow{ 1285910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12860b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12870b0bbd2fSMarshall Clow return false; 12880b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12890b0bbd2fSMarshall Clow} 12900b0bbd2fSMarshall Clow 12910b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12926538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12930b0bbd2fSMarshall Clowbool 12940b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12950b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12960b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12970b0bbd2fSMarshall Clow{ 12980b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12990b0bbd2fSMarshall Clow return false; 13000b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13010b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13020b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13030b0bbd2fSMarshall Clow} 13040b0bbd2fSMarshall Clow 13050b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13061362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13071362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13080b0bbd2fSMarshall Clowbool 13090b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13100b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13110b0bbd2fSMarshall Clow{ 13120b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13130b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13140b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13150b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13160b0bbd2fSMarshall Clow} 13170b0bbd2fSMarshall Clow 13180b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13191362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13201362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13210b0bbd2fSMarshall Clowbool 13220b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13230b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13240b0bbd2fSMarshall Clow{ 13250b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13260b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13270b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13280b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13290b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13300b0bbd2fSMarshall Clow} 13310b0bbd2fSMarshall Clow#endif 13320b0bbd2fSMarshall Clow 13333e519524SHoward Hinnant// is_permutation 13343e519524SHoward Hinnant 13353e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13361362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13373e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13383e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 13393e519524SHoward Hinnant{ 134049c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1341910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13423e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 134349c7643cSMarshall Clow break; 134449c7643cSMarshall Clow if (__first1 == __last1) 13453e519524SHoward Hinnant return true; 134649c7643cSMarshall Clow 13473e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 13483e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1349ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 13503e519524SHoward Hinnant if (__l1 == _D1(1)) 13513e519524SHoward Hinnant return false; 1352ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13533e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13543e519524SHoward Hinnant // equal elements in [f2, l2) 13553e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13563e519524SHoward Hinnant { 13573e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 1358939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1359939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1360939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1361939b1623SPeter Collingbourne break; 1362939b1623SPeter Collingbourne if (__match == __i) { 13633e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13643e519524SHoward Hinnant _D1 __c2 = 0; 13653e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13663e519524SHoward Hinnant if (__pred(*__i, *__j)) 13673e519524SHoward Hinnant ++__c2; 13683e519524SHoward Hinnant if (__c2 == 0) 13693e519524SHoward Hinnant return false; 13703e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13713e519524SHoward Hinnant _D1 __c1 = 1; 1372ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13733e519524SHoward Hinnant if (__pred(*__i, *__j)) 13743e519524SHoward Hinnant ++__c1; 13753e519524SHoward Hinnant if (__c1 != __c2) 13763e519524SHoward Hinnant return false; 13773e519524SHoward Hinnant } 13783e519524SHoward Hinnant } 13793e519524SHoward Hinnant return true; 13803e519524SHoward Hinnant} 13813e519524SHoward Hinnant 13823e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 13831362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13841362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13853e519524SHoward Hinnantbool 13863e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13873e519524SHoward Hinnant _ForwardIterator2 __first2) 13883e519524SHoward Hinnant{ 13893e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1391ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13923e519524SHoward Hinnant} 13933e519524SHoward Hinnant 13940b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13950b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 139649c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13970b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13980b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13990b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14000b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14010b0bbd2fSMarshall Clow{ 140249c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1403847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14040b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 140549c7643cSMarshall Clow break; 140649c7643cSMarshall Clow if (__first1 == __last1) 140749c7643cSMarshall Clow return __first2 == __last2; 140849c7643cSMarshall Clow else if (__first2 == __last2) 140949c7643cSMarshall Clow return false; 141049c7643cSMarshall Clow 14110b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14120b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14130b0bbd2fSMarshall Clow 14140b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1415fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14160b0bbd2fSMarshall Clow if (__l1 != __l2) 14170b0bbd2fSMarshall Clow return false; 14180b0bbd2fSMarshall Clow 14190b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14200b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14210b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14220b0bbd2fSMarshall Clow { 14230b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1424939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1425939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1426939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1427939b1623SPeter Collingbourne break; 1428939b1623SPeter Collingbourne if (__match == __i) { 14290b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14300b0bbd2fSMarshall Clow _D1 __c2 = 0; 14310b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14320b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14330b0bbd2fSMarshall Clow ++__c2; 14340b0bbd2fSMarshall Clow if (__c2 == 0) 14350b0bbd2fSMarshall Clow return false; 14360b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14370b0bbd2fSMarshall Clow _D1 __c1 = 1; 14380b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14390b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14400b0bbd2fSMarshall Clow ++__c1; 14410b0bbd2fSMarshall Clow if (__c1 != __c2) 14420b0bbd2fSMarshall Clow return false; 14430b0bbd2fSMarshall Clow } 14440b0bbd2fSMarshall Clow } 14450b0bbd2fSMarshall Clow return true; 14460b0bbd2fSMarshall Clow} 14470b0bbd2fSMarshall Clow 14480b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 144949c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14500b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 14510b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 14520b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14530b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 14540b0bbd2fSMarshall Clow{ 14550b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14560b0bbd2fSMarshall Clow return false; 14570b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14580b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14590b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14600b0bbd2fSMarshall Clow} 14610b0bbd2fSMarshall Clow 14620b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 14631362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 14641362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14650b0bbd2fSMarshall Clowbool 14660b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14670b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14680b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 14690b0bbd2fSMarshall Clow{ 14700b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14710b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14720b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14730b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14740b0bbd2fSMarshall Clow} 14750b0bbd2fSMarshall Clow 14760b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 14771362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 14781362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14790b0bbd2fSMarshall Clowbool 14800b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14810b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14820b0bbd2fSMarshall Clow{ 14830b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14840b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14850b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14860b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14870b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14880b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14890b0bbd2fSMarshall Clow} 14900b0bbd2fSMarshall Clow#endif 14910b0bbd2fSMarshall Clow 14923e519524SHoward Hinnant// search 1493d835e592SMarshall Clow// __search is in <functional> 14943e519524SHoward Hinnant 14953e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 14961362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 14971362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14983e519524SHoward Hinnant_ForwardIterator1 14993e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15003e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15013e519524SHoward Hinnant{ 1502ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15033e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 150428cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 150528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 150628cc4ddeSMarshall Clow .first; 15073e519524SHoward Hinnant} 15083e519524SHoward Hinnant 15093e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15101362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 15111362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15123e519524SHoward Hinnant_ForwardIterator1 15133e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15143e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15153e519524SHoward Hinnant{ 151628cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 151728cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1518ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15193e519524SHoward Hinnant} 15203e519524SHoward Hinnant 1521d835e592SMarshall Clow 1522d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1523d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 15241362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1525d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1526d835e592SMarshall Clow{ return __s(__f, __l).first; } 1527d835e592SMarshall Clow#endif 1528d835e592SMarshall Clow 15293e519524SHoward Hinnant// search_n 15303e519524SHoward Hinnant 15313e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 153212f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 15333e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1534e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15353e519524SHoward Hinnant{ 15363e519524SHoward Hinnant if (__count <= 0) 15373e519524SHoward Hinnant return __first; 15383e519524SHoward Hinnant while (true) 15393e519524SHoward Hinnant { 1540e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15413e519524SHoward Hinnant while (true) 15423e519524SHoward Hinnant { 1543e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15443e519524SHoward Hinnant return __last; 1545e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15463e519524SHoward Hinnant break; 15473e519524SHoward Hinnant ++__first; 15483e519524SHoward Hinnant } 1549e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15503e519524SHoward Hinnant _ForwardIterator __m = __first; 15513e519524SHoward Hinnant _Size __c(0); 15523e519524SHoward Hinnant while (true) 15533e519524SHoward Hinnant { 15543e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15553e519524SHoward Hinnant return __first; 15563e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15573e519524SHoward Hinnant return __last; 1558e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15593e519524SHoward Hinnant { 15603e519524SHoward Hinnant __first = __m; 15613e519524SHoward Hinnant ++__first; 15623e519524SHoward Hinnant break; 15633e519524SHoward Hinnant } // else there is a match, check next elements 15643e519524SHoward Hinnant } 15653e519524SHoward Hinnant } 15663e519524SHoward Hinnant} 15673e519524SHoward Hinnant 15683e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 156912f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 15703e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1571e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15723e519524SHoward Hinnant{ 15733e519524SHoward Hinnant if (__count <= 0) 15743e519524SHoward Hinnant return __first; 15753e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 15763e519524SHoward Hinnant if (__len < __count) 15773e519524SHoward Hinnant return __last; 15783e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 15793e519524SHoward Hinnant while (true) 15803e519524SHoward Hinnant { 1581e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15823e519524SHoward Hinnant while (true) 15833e519524SHoward Hinnant { 1584b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 15853e519524SHoward Hinnant return __last; 1586e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15873e519524SHoward Hinnant break; 15883e519524SHoward Hinnant ++__first; 15893e519524SHoward Hinnant } 1590e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15913e519524SHoward Hinnant _RandomAccessIterator __m = __first; 15923e519524SHoward Hinnant _Size __c(0); 15933e519524SHoward Hinnant while (true) 15943e519524SHoward Hinnant { 15953e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15963e519524SHoward Hinnant return __first; 15973e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1598e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15993e519524SHoward Hinnant { 16003e519524SHoward Hinnant __first = __m; 16013e519524SHoward Hinnant ++__first; 16023e519524SHoward Hinnant break; 16033e519524SHoward Hinnant } // else there is a match, check next elements 16043e519524SHoward Hinnant } 16053e519524SHoward Hinnant } 16063e519524SHoward Hinnant} 16073e519524SHoward Hinnant 16083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16091362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 16101362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16113e519524SHoward Hinnant_ForwardIterator 16123e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1613e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16143e519524SHoward Hinnant{ 1615ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 161651544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 161751544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16183e519524SHoward Hinnant} 16193e519524SHoward Hinnant 16203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16211362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 16221362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16233e519524SHoward Hinnant_ForwardIterator 1624e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16253e519524SHoward Hinnant{ 16263e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 162751544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 162851544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16293e519524SHoward Hinnant} 16303e519524SHoward Hinnant 16313e519524SHoward Hinnant// copy 16323e519524SHoward Hinnanttemplate <class _Iter> 16333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16343e519524SHoward Hinnant_Iter 16353e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16363e519524SHoward Hinnant{ 16373e519524SHoward Hinnant return __i; 16383e519524SHoward Hinnant} 16393e519524SHoward Hinnant 16403e519524SHoward Hinnanttemplate <class _Tp> 16415b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 16423e519524SHoward Hinnanttypename enable_if 16433e519524SHoward Hinnant< 1644ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16453e519524SHoward Hinnant _Tp* 16463e519524SHoward Hinnant>::type 16473e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16483e519524SHoward Hinnant{ 16493e519524SHoward Hinnant return __i.base(); 16503e519524SHoward Hinnant} 16513e519524SHoward Hinnant 1652fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1653fc88dbd2SHoward Hinnant 16543e519524SHoward Hinnanttemplate <class _Tp> 16559cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 16563e519524SHoward Hinnanttypename enable_if 16573e519524SHoward Hinnant< 1658ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16593e519524SHoward Hinnant _Tp* 16603e519524SHoward Hinnant>::type 16613e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16623e519524SHoward Hinnant{ 16633e519524SHoward Hinnant return __i.base(); 16643e519524SHoward Hinnant} 16653e519524SHoward Hinnant 1666c8879ab2SMarshall Clowtemplate <class _Tp> 1667c8879ab2SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 1668c8879ab2SMarshall Clowtypename enable_if 1669c8879ab2SMarshall Clow< 1670c8879ab2SMarshall Clow is_trivially_copy_assignable<_Tp>::value, 1671c8879ab2SMarshall Clow const _Tp* 1672c8879ab2SMarshall Clow>::type 1673c8879ab2SMarshall Clow__unwrap_iter(__wrap_iter<const _Tp*> __i) 1674c8879ab2SMarshall Clow{ 1675c8879ab2SMarshall Clow return __i.base(); 1676c8879ab2SMarshall Clow} 1677c8879ab2SMarshall Clow 167814bd0bf0SEric Fiselier#else 167914bd0bf0SEric Fiselier 168014bd0bf0SEric Fiseliertemplate <class _Tp> 16819cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 168214bd0bf0SEric Fiseliertypename enable_if 168314bd0bf0SEric Fiselier< 168414bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 168514bd0bf0SEric Fiselier __wrap_iter<_Tp*> 168614bd0bf0SEric Fiselier>::type 168714bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 168814bd0bf0SEric Fiselier{ 168914bd0bf0SEric Fiselier return __i; 169014bd0bf0SEric Fiselier} 169114bd0bf0SEric Fiselier 1692fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1693fc88dbd2SHoward Hinnant 16943e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16963e519524SHoward Hinnant_OutputIterator 16973e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16983e519524SHoward Hinnant{ 1699910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17003e519524SHoward Hinnant *__result = *__first; 17013e519524SHoward Hinnant return __result; 17023e519524SHoward Hinnant} 17033e519524SHoward Hinnant 17043e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17063e519524SHoward Hinnanttypename enable_if 17073e519524SHoward Hinnant< 17083e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1709ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17103e519524SHoward Hinnant _Up* 17113e519524SHoward Hinnant>::type 17123e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17133e519524SHoward Hinnant{ 17143e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17155b312052SMarshall Clow if (__n > 0) 1716ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17173e519524SHoward Hinnant return __result + __n; 17183e519524SHoward Hinnant} 17193e519524SHoward Hinnant 17203e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17223e519524SHoward Hinnant_OutputIterator 17233e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17243e519524SHoward Hinnant{ 1725ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17263e519524SHoward Hinnant} 17273e519524SHoward Hinnant 17283e519524SHoward Hinnant// copy_backward 17293e519524SHoward Hinnant 1730d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17323e519524SHoward Hinnant_OutputIterator 1733d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17343e519524SHoward Hinnant{ 17353e519524SHoward Hinnant while (__first != __last) 17363e519524SHoward Hinnant *--__result = *--__last; 17373e519524SHoward Hinnant return __result; 17383e519524SHoward Hinnant} 17393e519524SHoward Hinnant 17403e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17423e519524SHoward Hinnanttypename enable_if 17433e519524SHoward Hinnant< 17443e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1745ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17463e519524SHoward Hinnant _Up* 17473e519524SHoward Hinnant>::type 17483e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17493e519524SHoward Hinnant{ 17503e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17515b312052SMarshall Clow if (__n > 0) 17525b312052SMarshall Clow { 17533e519524SHoward Hinnant __result -= __n; 1754ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17555b312052SMarshall Clow } 17563e519524SHoward Hinnant return __result; 17573e519524SHoward Hinnant} 17583e519524SHoward Hinnant 17593e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17613e519524SHoward Hinnant_BidirectionalIterator2 17623e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17633e519524SHoward Hinnant _BidirectionalIterator2 __result) 17643e519524SHoward Hinnant{ 1765fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1766fd838227SEric Fiselier __unwrap_iter(__last), 1767fd838227SEric Fiselier __unwrap_iter(__result)); 17683e519524SHoward Hinnant} 17693e519524SHoward Hinnant 17703e519524SHoward Hinnant// copy_if 17713e519524SHoward Hinnant 17723e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17743e519524SHoward Hinnant_OutputIterator 17753e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17763e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17773e519524SHoward Hinnant{ 17783e519524SHoward Hinnant for (; __first != __last; ++__first) 17793e519524SHoward Hinnant { 17803e519524SHoward Hinnant if (__pred(*__first)) 17813e519524SHoward Hinnant { 17823e519524SHoward Hinnant *__result = *__first; 17833e519524SHoward Hinnant ++__result; 17843e519524SHoward Hinnant } 17853e519524SHoward Hinnant } 17863e519524SHoward Hinnant return __result; 17873e519524SHoward Hinnant} 17883e519524SHoward Hinnant 17893e519524SHoward Hinnant// copy_n 17903e519524SHoward Hinnant 17913e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17933e519524SHoward Hinnanttypename enable_if 17943e519524SHoward Hinnant< 17953e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 17963e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 17973e519524SHoward Hinnant _OutputIterator 17983e519524SHoward Hinnant>::type 179951544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18003e519524SHoward Hinnant{ 180151544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 180251544023SEric Fiselier _IntegralSize __n = __orig_n; 180399847d2bSHoward Hinnant if (__n > 0) 180499847d2bSHoward Hinnant { 18053e519524SHoward Hinnant *__result = *__first; 180699847d2bSHoward Hinnant ++__result; 180799847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 180899847d2bSHoward Hinnant { 180999847d2bSHoward Hinnant ++__first; 181099847d2bSHoward Hinnant *__result = *__first; 181199847d2bSHoward Hinnant ++__result; 181299847d2bSHoward Hinnant } 181399847d2bSHoward Hinnant } 18143e519524SHoward Hinnant return __result; 18153e519524SHoward Hinnant} 18163e519524SHoward Hinnant 18173e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18193e519524SHoward Hinnanttypename enable_if 18203e519524SHoward Hinnant< 18213e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18223e519524SHoward Hinnant _OutputIterator 18233e519524SHoward Hinnant>::type 182451544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18253e519524SHoward Hinnant{ 182651544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 182751544023SEric Fiselier _IntegralSize __n = __orig_n; 1828ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18293e519524SHoward Hinnant} 18303e519524SHoward Hinnant 18313e519524SHoward Hinnant// move 18323e519524SHoward Hinnant 18333e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18353e519524SHoward Hinnant_OutputIterator 18363e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18373e519524SHoward Hinnant{ 1838910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1839ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18403e519524SHoward Hinnant return __result; 18413e519524SHoward Hinnant} 18423e519524SHoward Hinnant 18433e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18453e519524SHoward Hinnanttypename enable_if 18463e519524SHoward Hinnant< 18473e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1848ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18493e519524SHoward Hinnant _Up* 18503e519524SHoward Hinnant>::type 18513e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18523e519524SHoward Hinnant{ 18533e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18545b312052SMarshall Clow if (__n > 0) 1855ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18563e519524SHoward Hinnant return __result + __n; 18573e519524SHoward Hinnant} 18583e519524SHoward Hinnant 18593e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18613e519524SHoward Hinnant_OutputIterator 18623e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18633e519524SHoward Hinnant{ 1864ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18653e519524SHoward Hinnant} 18663e519524SHoward Hinnant 18673e519524SHoward Hinnant// move_backward 18683e519524SHoward Hinnant 18693e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18713e519524SHoward Hinnant_OutputIterator 18723e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18733e519524SHoward Hinnant{ 18743e519524SHoward Hinnant while (__first != __last) 1875ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18763e519524SHoward Hinnant return __result; 18773e519524SHoward Hinnant} 18783e519524SHoward Hinnant 18793e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18813e519524SHoward Hinnanttypename enable_if 18823e519524SHoward Hinnant< 18833e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1884ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18853e519524SHoward Hinnant _Up* 18863e519524SHoward Hinnant>::type 18873e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18883e519524SHoward Hinnant{ 18893e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18905b312052SMarshall Clow if (__n > 0) 18915b312052SMarshall Clow { 18923e519524SHoward Hinnant __result -= __n; 1893ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18945b312052SMarshall Clow } 18953e519524SHoward Hinnant return __result; 18963e519524SHoward Hinnant} 18973e519524SHoward Hinnant 18983e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19003e519524SHoward Hinnant_BidirectionalIterator2 19013e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19023e519524SHoward Hinnant _BidirectionalIterator2 __result) 19033e519524SHoward Hinnant{ 1904ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19053e519524SHoward Hinnant} 19063e519524SHoward Hinnant 19073e519524SHoward Hinnant// iter_swap 19083e519524SHoward Hinnant 1909a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19103e519524SHoward Hinnant 19113e519524SHoward Hinnant// transform 19123e519524SHoward Hinnant 19133e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 191499894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19153e519524SHoward Hinnant_OutputIterator 19163e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19173e519524SHoward Hinnant{ 1918910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19193e519524SHoward Hinnant *__result = __op(*__first); 19203e519524SHoward Hinnant return __result; 19213e519524SHoward Hinnant} 19223e519524SHoward Hinnant 19233e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 192499894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19253e519524SHoward Hinnant_OutputIterator 19263e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19273e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19283e519524SHoward Hinnant{ 1929910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19303e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19313e519524SHoward Hinnant return __result; 19323e519524SHoward Hinnant} 19333e519524SHoward Hinnant 19343e519524SHoward Hinnant// replace 19353e519524SHoward Hinnant 19363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 193712c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19383e519524SHoward Hinnantvoid 19393e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19403e519524SHoward Hinnant{ 19413e519524SHoward Hinnant for (; __first != __last; ++__first) 19423e519524SHoward Hinnant if (*__first == __old_value) 19433e519524SHoward Hinnant *__first = __new_value; 19443e519524SHoward Hinnant} 19453e519524SHoward Hinnant 19463e519524SHoward Hinnant// replace_if 19473e519524SHoward Hinnant 19483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 194912c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19503e519524SHoward Hinnantvoid 19513e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19523e519524SHoward Hinnant{ 19533e519524SHoward Hinnant for (; __first != __last; ++__first) 19543e519524SHoward Hinnant if (__pred(*__first)) 19553e519524SHoward Hinnant *__first = __new_value; 19563e519524SHoward Hinnant} 19573e519524SHoward Hinnant 19583e519524SHoward Hinnant// replace_copy 19593e519524SHoward Hinnant 19603e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 196112c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19623e519524SHoward Hinnant_OutputIterator 19633e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19643e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19653e519524SHoward Hinnant{ 1966910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19673e519524SHoward Hinnant if (*__first == __old_value) 19683e519524SHoward Hinnant *__result = __new_value; 19693e519524SHoward Hinnant else 19703e519524SHoward Hinnant *__result = *__first; 19713e519524SHoward Hinnant return __result; 19723e519524SHoward Hinnant} 19733e519524SHoward Hinnant 19743e519524SHoward Hinnant// replace_copy_if 19753e519524SHoward Hinnant 19763e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 197712c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19783e519524SHoward Hinnant_OutputIterator 19793e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19803e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19813e519524SHoward Hinnant{ 1982910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19833e519524SHoward Hinnant if (__pred(*__first)) 19843e519524SHoward Hinnant *__result = __new_value; 19853e519524SHoward Hinnant else 19863e519524SHoward Hinnant *__result = *__first; 19873e519524SHoward Hinnant return __result; 19883e519524SHoward Hinnant} 19893e519524SHoward Hinnant 19903e519524SHoward Hinnant// fill_n 19913e519524SHoward Hinnant 19923e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19934bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19943e519524SHoward Hinnant_OutputIterator 19950f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19963e519524SHoward Hinnant{ 1997910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 1998e4383379SHoward Hinnant *__first = __value_; 19993e519524SHoward Hinnant return __first; 20003e519524SHoward Hinnant} 20013e519524SHoward Hinnant 20023e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20034bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20043e519524SHoward Hinnant_OutputIterator 2005e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20063e519524SHoward Hinnant{ 200751544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20083e519524SHoward Hinnant} 20093e519524SHoward Hinnant 20103e519524SHoward Hinnant// fill 20113e519524SHoward Hinnant 20123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20134bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20143e519524SHoward Hinnantvoid 2015e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20163e519524SHoward Hinnant{ 20173e519524SHoward Hinnant for (; __first != __last; ++__first) 2018e4383379SHoward Hinnant *__first = __value_; 20193e519524SHoward Hinnant} 20203e519524SHoward Hinnant 20213e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20224bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20233e519524SHoward Hinnantvoid 2024e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20253e519524SHoward Hinnant{ 2026e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20273e519524SHoward Hinnant} 20283e519524SHoward Hinnant 20293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20304bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20313e519524SHoward Hinnantvoid 2032e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20333e519524SHoward Hinnant{ 2034e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20353e519524SHoward Hinnant} 20363e519524SHoward Hinnant 20373e519524SHoward Hinnant// generate 20383e519524SHoward Hinnant 20393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20404bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20413e519524SHoward Hinnantvoid 20423e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20433e519524SHoward Hinnant{ 20443e519524SHoward Hinnant for (; __first != __last; ++__first) 20453e519524SHoward Hinnant *__first = __gen(); 20463e519524SHoward Hinnant} 20473e519524SHoward Hinnant 20483e519524SHoward Hinnant// generate_n 20493e519524SHoward Hinnant 20503e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20514bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20523e519524SHoward Hinnant_OutputIterator 205351544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 20543e519524SHoward Hinnant{ 205551544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 205651544023SEric Fiselier _IntegralSize __n = __orig_n; 2057910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 20583e519524SHoward Hinnant *__first = __gen(); 20593e519524SHoward Hinnant return __first; 20603e519524SHoward Hinnant} 20613e519524SHoward Hinnant 20623e519524SHoward Hinnant// remove 20633e519524SHoward Hinnant 20643e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20651362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2066e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20673e519524SHoward Hinnant{ 2068e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20693e519524SHoward Hinnant if (__first != __last) 20703e519524SHoward Hinnant { 20713e519524SHoward Hinnant _ForwardIterator __i = __first; 20723e519524SHoward Hinnant while (++__i != __last) 20733e519524SHoward Hinnant { 2074e4383379SHoward Hinnant if (!(*__i == __value_)) 20753e519524SHoward Hinnant { 2076ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20773e519524SHoward Hinnant ++__first; 20783e519524SHoward Hinnant } 20793e519524SHoward Hinnant } 20803e519524SHoward Hinnant } 20813e519524SHoward Hinnant return __first; 20823e519524SHoward Hinnant} 20833e519524SHoward Hinnant 20843e519524SHoward Hinnant// remove_if 20853e519524SHoward Hinnant 20863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 20871362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 20883e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 20893e519524SHoward Hinnant{ 2090ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 20913e519524SHoward Hinnant (__first, __last, __pred); 20923e519524SHoward Hinnant if (__first != __last) 20933e519524SHoward Hinnant { 20943e519524SHoward Hinnant _ForwardIterator __i = __first; 20953e519524SHoward Hinnant while (++__i != __last) 20963e519524SHoward Hinnant { 20973e519524SHoward Hinnant if (!__pred(*__i)) 20983e519524SHoward Hinnant { 2099ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21003e519524SHoward Hinnant ++__first; 21013e519524SHoward Hinnant } 21023e519524SHoward Hinnant } 21033e519524SHoward Hinnant } 21043e519524SHoward Hinnant return __first; 21053e519524SHoward Hinnant} 21063e519524SHoward Hinnant 21073e519524SHoward Hinnant// remove_copy 21083e519524SHoward Hinnant 21093e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2110e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21113e519524SHoward Hinnant_OutputIterator 2112e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21133e519524SHoward Hinnant{ 21143e519524SHoward Hinnant for (; __first != __last; ++__first) 21153e519524SHoward Hinnant { 2116e4383379SHoward Hinnant if (!(*__first == __value_)) 21173e519524SHoward Hinnant { 21183e519524SHoward Hinnant *__result = *__first; 21193e519524SHoward Hinnant ++__result; 21203e519524SHoward Hinnant } 21213e519524SHoward Hinnant } 21223e519524SHoward Hinnant return __result; 21233e519524SHoward Hinnant} 21243e519524SHoward Hinnant 21253e519524SHoward Hinnant// remove_copy_if 21263e519524SHoward Hinnant 21273e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2128e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21293e519524SHoward Hinnant_OutputIterator 21303e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21313e519524SHoward Hinnant{ 21323e519524SHoward Hinnant for (; __first != __last; ++__first) 21333e519524SHoward Hinnant { 21343e519524SHoward Hinnant if (!__pred(*__first)) 21353e519524SHoward Hinnant { 21363e519524SHoward Hinnant *__result = *__first; 21373e519524SHoward Hinnant ++__result; 21383e519524SHoward Hinnant } 21393e519524SHoward Hinnant } 21403e519524SHoward Hinnant return __result; 21413e519524SHoward Hinnant} 21423e519524SHoward Hinnant 21433e519524SHoward Hinnant// unique 21443e519524SHoward Hinnant 21453e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21461362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21473e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21483e519524SHoward Hinnant{ 2149ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21503e519524SHoward Hinnant (__first, __last, __pred); 21513e519524SHoward Hinnant if (__first != __last) 21523e519524SHoward Hinnant { 21533e519524SHoward Hinnant // ... a a ? ... 21543e519524SHoward Hinnant // f i 21553e519524SHoward Hinnant _ForwardIterator __i = __first; 21563e519524SHoward Hinnant for (++__i; ++__i != __last;) 21573e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2158ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21593e519524SHoward Hinnant ++__first; 21603e519524SHoward Hinnant } 21613e519524SHoward Hinnant return __first; 21623e519524SHoward Hinnant} 21633e519524SHoward Hinnant 21643e519524SHoward Hinnanttemplate <class _ForwardIterator> 21651362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 21661362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21673e519524SHoward Hinnant_ForwardIterator 21683e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21693e519524SHoward Hinnant{ 21703e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2171ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21723e519524SHoward Hinnant} 21733e519524SHoward Hinnant 21743e519524SHoward Hinnant// unique_copy 21753e519524SHoward Hinnant 21763e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21774bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 21783e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21793e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21803e519524SHoward Hinnant{ 21813e519524SHoward Hinnant if (__first != __last) 21823e519524SHoward Hinnant { 21833e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 21843e519524SHoward Hinnant *__result = __t; 21853e519524SHoward Hinnant ++__result; 21863e519524SHoward Hinnant while (++__first != __last) 21873e519524SHoward Hinnant { 21883e519524SHoward Hinnant if (!__pred(__t, *__first)) 21893e519524SHoward Hinnant { 21903e519524SHoward Hinnant __t = *__first; 21913e519524SHoward Hinnant *__result = __t; 21923e519524SHoward Hinnant ++__result; 21933e519524SHoward Hinnant } 21943e519524SHoward Hinnant } 21953e519524SHoward Hinnant } 21963e519524SHoward Hinnant return __result; 21973e519524SHoward Hinnant} 21983e519524SHoward Hinnant 21993e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22004bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22013e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22023e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22033e519524SHoward Hinnant{ 22043e519524SHoward Hinnant if (__first != __last) 22053e519524SHoward Hinnant { 22063e519524SHoward Hinnant _ForwardIterator __i = __first; 22073e519524SHoward Hinnant *__result = *__i; 22083e519524SHoward Hinnant ++__result; 22093e519524SHoward Hinnant while (++__first != __last) 22103e519524SHoward Hinnant { 22113e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22123e519524SHoward Hinnant { 22133e519524SHoward Hinnant *__result = *__first; 22143e519524SHoward Hinnant ++__result; 22153e519524SHoward Hinnant __i = __first; 22163e519524SHoward Hinnant } 22173e519524SHoward Hinnant } 22183e519524SHoward Hinnant } 22193e519524SHoward Hinnant return __result; 22203e519524SHoward Hinnant} 22213e519524SHoward Hinnant 22223e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22234bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 22243e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22253e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22263e519524SHoward Hinnant{ 22273e519524SHoward Hinnant if (__first != __last) 22283e519524SHoward Hinnant { 22293e519524SHoward Hinnant *__result = *__first; 22303e519524SHoward Hinnant while (++__first != __last) 22313e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22323e519524SHoward Hinnant *++__result = *__first; 22333e519524SHoward Hinnant ++__result; 22343e519524SHoward Hinnant } 22353e519524SHoward Hinnant return __result; 22363e519524SHoward Hinnant} 22373e519524SHoward Hinnant 22383e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22394bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22403e519524SHoward Hinnant_OutputIterator 22413e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22423e519524SHoward Hinnant{ 2243ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22443e519524SHoward Hinnant (__first, __last, __result, __pred, 22453e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22463e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22473e519524SHoward Hinnant} 22483e519524SHoward Hinnant 22493e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22504bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22513e519524SHoward Hinnant_OutputIterator 22523e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22533e519524SHoward Hinnant{ 22543e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2255ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22563e519524SHoward Hinnant} 22573e519524SHoward Hinnant 22583e519524SHoward Hinnant// reverse 22593e519524SHoward Hinnant 22603e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22623e519524SHoward Hinnantvoid 22633e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22643e519524SHoward Hinnant{ 22653e519524SHoward Hinnant while (__first != __last) 22663e519524SHoward Hinnant { 22673e519524SHoward Hinnant if (__first == --__last) 22683e519524SHoward Hinnant break; 2269def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22703e519524SHoward Hinnant ++__first; 22713e519524SHoward Hinnant } 22723e519524SHoward Hinnant} 22733e519524SHoward Hinnant 22743e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22763e519524SHoward Hinnantvoid 22773e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22783e519524SHoward Hinnant{ 22793e519524SHoward Hinnant if (__first != __last) 22803e519524SHoward Hinnant for (; __first < --__last; ++__first) 2281def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22823e519524SHoward Hinnant} 22833e519524SHoward Hinnant 22843e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22863e519524SHoward Hinnantvoid 22873e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 22883e519524SHoward Hinnant{ 2289ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 22903e519524SHoward Hinnant} 22913e519524SHoward Hinnant 22923e519524SHoward Hinnant// reverse_copy 22933e519524SHoward Hinnant 22943e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2295e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22963e519524SHoward Hinnant_OutputIterator 22973e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 22983e519524SHoward Hinnant{ 22993e519524SHoward Hinnant for (; __first != __last; ++__result) 23003e519524SHoward Hinnant *__result = *--__last; 23013e519524SHoward Hinnant return __result; 23023e519524SHoward Hinnant} 23033e519524SHoward Hinnant 23043e519524SHoward Hinnant// rotate 23053e519524SHoward Hinnant 23063e519524SHoward Hinnanttemplate <class _ForwardIterator> 23073e519524SHoward Hinnant_ForwardIterator 2308aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23093e519524SHoward Hinnant{ 2310aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2311aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2312aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2313aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2314aca09de3SHoward Hinnant return __lm1; 2315aca09de3SHoward Hinnant} 2316aca09de3SHoward Hinnant 2317aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2318aca09de3SHoward Hinnant_BidirectionalIterator 2319aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2320aca09de3SHoward Hinnant{ 2321aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2322aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2323aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2324aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2325aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2326aca09de3SHoward Hinnant return __fp1; 2327aca09de3SHoward Hinnant} 2328aca09de3SHoward Hinnant 2329aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2330aca09de3SHoward Hinnant_ForwardIterator 2331aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2332aca09de3SHoward Hinnant{ 23333e519524SHoward Hinnant _ForwardIterator __i = __middle; 23343e519524SHoward Hinnant while (true) 23353e519524SHoward Hinnant { 23363e519524SHoward Hinnant swap(*__first, *__i); 23373e519524SHoward Hinnant ++__first; 23383e519524SHoward Hinnant if (++__i == __last) 23393e519524SHoward Hinnant break; 23403e519524SHoward Hinnant if (__first == __middle) 23413e519524SHoward Hinnant __middle = __i; 23423e519524SHoward Hinnant } 23433e519524SHoward Hinnant _ForwardIterator __r = __first; 23443e519524SHoward Hinnant if (__first != __middle) 23453e519524SHoward Hinnant { 23463e519524SHoward Hinnant __i = __middle; 23473e519524SHoward Hinnant while (true) 23483e519524SHoward Hinnant { 23493e519524SHoward Hinnant swap(*__first, *__i); 23503e519524SHoward Hinnant ++__first; 23513e519524SHoward Hinnant if (++__i == __last) 23523e519524SHoward Hinnant { 23533e519524SHoward Hinnant if (__first == __middle) 23543e519524SHoward Hinnant break; 23553e519524SHoward Hinnant __i = __middle; 23563e519524SHoward Hinnant } 23573e519524SHoward Hinnant else if (__first == __middle) 23583e519524SHoward Hinnant __middle = __i; 23593e519524SHoward Hinnant } 23603e519524SHoward Hinnant } 23613e519524SHoward Hinnant return __r; 23623e519524SHoward Hinnant} 23633e519524SHoward Hinnant 23643e519524SHoward Hinnanttemplate<typename _Integral> 23653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23663e519524SHoward Hinnant_Integral 236719b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 23683e519524SHoward Hinnant{ 23693e519524SHoward Hinnant do 23703e519524SHoward Hinnant { 23713e519524SHoward Hinnant _Integral __t = __x % __y; 23723e519524SHoward Hinnant __x = __y; 23733e519524SHoward Hinnant __y = __t; 23743e519524SHoward Hinnant } while (__y); 23753e519524SHoward Hinnant return __x; 23763e519524SHoward Hinnant} 23773e519524SHoward Hinnant 23783e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23793e519524SHoward Hinnant_RandomAccessIterator 2380aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 23813e519524SHoward Hinnant{ 23823e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 23833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 23843e519524SHoward Hinnant 23853e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 23863e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 23873e519524SHoward Hinnant if (__m1 == __m2) 23883e519524SHoward Hinnant { 2389ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 23903e519524SHoward Hinnant return __middle; 23913e519524SHoward Hinnant } 239219b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 23933e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 23943e519524SHoward Hinnant { 2395aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 23963e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 23973e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 23983e519524SHoward Hinnant do 23993e519524SHoward Hinnant { 2400aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24013e519524SHoward Hinnant __p1 = __p2; 24023e519524SHoward Hinnant const difference_type __d = __last - __p2; 24033e519524SHoward Hinnant if (__m1 < __d) 24043e519524SHoward Hinnant __p2 += __m1; 24053e519524SHoward Hinnant else 24063e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24073e519524SHoward Hinnant } while (__p2 != __p); 2408aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24093e519524SHoward Hinnant } 24103e519524SHoward Hinnant return __first + __m2; 24113e519524SHoward Hinnant} 24123e519524SHoward Hinnant 24133e519524SHoward Hinnanttemplate <class _ForwardIterator> 24143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24153e519524SHoward Hinnant_ForwardIterator 2416aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2417aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2418aca09de3SHoward Hinnant{ 2419aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2420aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2421aca09de3SHoward Hinnant { 2422aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2423aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2424aca09de3SHoward Hinnant } 2425aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2426aca09de3SHoward Hinnant} 2427aca09de3SHoward Hinnant 2428aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2429aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2430aca09de3SHoward Hinnant_BidirectionalIterator 2431aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2432aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2433aca09de3SHoward Hinnant{ 2434aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2435aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2436aca09de3SHoward Hinnant { 2437aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2438aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2439aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2440aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2441aca09de3SHoward Hinnant } 2442aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2443aca09de3SHoward Hinnant} 2444aca09de3SHoward Hinnant 2445aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2446aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2447aca09de3SHoward Hinnant_RandomAccessIterator 2448aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2449aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2450aca09de3SHoward Hinnant{ 2451aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2452aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2453aca09de3SHoward Hinnant { 2454aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2455aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2456aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2457aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2458aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2459aca09de3SHoward Hinnant } 2460aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2461aca09de3SHoward Hinnant} 2462aca09de3SHoward Hinnant 2463aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2464aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2465aca09de3SHoward Hinnant_ForwardIterator 24663e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24673e519524SHoward Hinnant{ 2468aca09de3SHoward Hinnant if (__first == __middle) 2469aca09de3SHoward Hinnant return __last; 2470aca09de3SHoward Hinnant if (__middle == __last) 2471aca09de3SHoward Hinnant return __first; 2472ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2473aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24743e519524SHoward Hinnant} 24753e519524SHoward Hinnant 24763e519524SHoward Hinnant// rotate_copy 24773e519524SHoward Hinnant 24783e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24803e519524SHoward Hinnant_OutputIterator 24813e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 24823e519524SHoward Hinnant{ 2483ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 24843e519524SHoward Hinnant} 24853e519524SHoward Hinnant 24863e519524SHoward Hinnant// min_element 24873e519524SHoward Hinnant 24883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24891362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 24901362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24913e519524SHoward Hinnant_ForwardIterator 24920b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24933e519524SHoward Hinnant{ 2494a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2495a60d7facSEric Fiselier "std::min_element requires a ForwardIterator"); 24963e519524SHoward Hinnant if (__first != __last) 24973e519524SHoward Hinnant { 24983e519524SHoward Hinnant _ForwardIterator __i = __first; 24993e519524SHoward Hinnant while (++__i != __last) 25003e519524SHoward Hinnant if (__comp(*__i, *__first)) 25013e519524SHoward Hinnant __first = __i; 25023e519524SHoward Hinnant } 25033e519524SHoward Hinnant return __first; 25043e519524SHoward Hinnant} 25053e519524SHoward Hinnant 25063e519524SHoward Hinnanttemplate <class _ForwardIterator> 25071362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25081362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25093e519524SHoward Hinnant_ForwardIterator 25103e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25113e519524SHoward Hinnant{ 25120b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25134eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25144eb27b79SHoward Hinnant} 25154eb27b79SHoward Hinnant 25164eb27b79SHoward Hinnant// min 25174eb27b79SHoward Hinnant 25184eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25191362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25201362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25214eb27b79SHoward Hinnantconst _Tp& 25224eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25234eb27b79SHoward Hinnant{ 25244eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25254eb27b79SHoward Hinnant} 25264eb27b79SHoward Hinnant 25274eb27b79SHoward Hinnanttemplate <class _Tp> 25281362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25291362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25304eb27b79SHoward Hinnantconst _Tp& 25314eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25324eb27b79SHoward Hinnant{ 2533ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25344eb27b79SHoward Hinnant} 25354eb27b79SHoward Hinnant 2536ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 253754976f26SHoward Hinnant 25384eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25391362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25401362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25414eb27b79SHoward Hinnant_Tp 25424eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25434eb27b79SHoward Hinnant{ 25440b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25454eb27b79SHoward Hinnant} 25464eb27b79SHoward Hinnant 25474eb27b79SHoward Hinnanttemplate<class _Tp> 25481362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25491362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25504eb27b79SHoward Hinnant_Tp 25514eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25524eb27b79SHoward Hinnant{ 25530b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 25543e519524SHoward Hinnant} 25553e519524SHoward Hinnant 2556ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 255754976f26SHoward Hinnant 25583e519524SHoward Hinnant// max_element 25593e519524SHoward Hinnant 25603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25611362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25621362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25633e519524SHoward Hinnant_ForwardIterator 25640b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25653e519524SHoward Hinnant{ 2566a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2567a60d7facSEric Fiselier "std::max_element requires a ForwardIterator"); 25683e519524SHoward Hinnant if (__first != __last) 25693e519524SHoward Hinnant { 25703e519524SHoward Hinnant _ForwardIterator __i = __first; 25713e519524SHoward Hinnant while (++__i != __last) 25723e519524SHoward Hinnant if (__comp(*__first, *__i)) 25733e519524SHoward Hinnant __first = __i; 25743e519524SHoward Hinnant } 25753e519524SHoward Hinnant return __first; 25763e519524SHoward Hinnant} 25773e519524SHoward Hinnant 25789d67c6d5SMarshall Clow 25793e519524SHoward Hinnanttemplate <class _ForwardIterator> 25801362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25811362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25823e519524SHoward Hinnant_ForwardIterator 25833e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25843e519524SHoward Hinnant{ 25850b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 25864eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25874eb27b79SHoward Hinnant} 25884eb27b79SHoward Hinnant 25894eb27b79SHoward Hinnant// max 25904eb27b79SHoward Hinnant 25914eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25921362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25931362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25944eb27b79SHoward Hinnantconst _Tp& 25954eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 25964eb27b79SHoward Hinnant{ 25974eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 25984eb27b79SHoward Hinnant} 25994eb27b79SHoward Hinnant 26004eb27b79SHoward Hinnanttemplate <class _Tp> 26011362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26021362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26034eb27b79SHoward Hinnantconst _Tp& 26044eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26054eb27b79SHoward Hinnant{ 2606ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26074eb27b79SHoward Hinnant} 26084eb27b79SHoward Hinnant 2609ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 261054976f26SHoward Hinnant 26114eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26121362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26131362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26144eb27b79SHoward Hinnant_Tp 26154eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26164eb27b79SHoward Hinnant{ 26170b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26184eb27b79SHoward Hinnant} 26194eb27b79SHoward Hinnant 26204eb27b79SHoward Hinnanttemplate<class _Tp> 26211362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26221362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26234eb27b79SHoward Hinnant_Tp 26244eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26254eb27b79SHoward Hinnant{ 26260b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26273e519524SHoward Hinnant} 26283e519524SHoward Hinnant 2629ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 263054976f26SHoward Hinnant 2631146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2632146c14acSMarshall Clow// clamp 2633146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 26341362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26351362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2636146c14acSMarshall Clowconst _Tp& 2637146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2638146c14acSMarshall Clow{ 2639146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2640146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2641146c14acSMarshall Clow 2642146c14acSMarshall Clow} 2643146c14acSMarshall Clow 2644146c14acSMarshall Clowtemplate<class _Tp> 26451362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26461362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2647146c14acSMarshall Clowconst _Tp& 2648146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2649146c14acSMarshall Clow{ 2650146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2651146c14acSMarshall Clow} 2652146c14acSMarshall Clow#endif 2653146c14acSMarshall Clow 26543e519524SHoward Hinnant// minmax_element 26553e519524SHoward Hinnant 26563e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26571362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX11 26583e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26593e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26603e519524SHoward Hinnant{ 2661a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2662a60d7facSEric Fiselier "std::minmax_element requires a ForwardIterator"); 26633e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26643e519524SHoward Hinnant if (__first != __last) 26653e519524SHoward Hinnant { 26663e519524SHoward Hinnant if (++__first != __last) 26673e519524SHoward Hinnant { 26683e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26693e519524SHoward Hinnant __result.first = __first; 26703e519524SHoward Hinnant else 26713e519524SHoward Hinnant __result.second = __first; 26723e519524SHoward Hinnant while (++__first != __last) 26733e519524SHoward Hinnant { 26743e519524SHoward Hinnant _ForwardIterator __i = __first; 26753e519524SHoward Hinnant if (++__first == __last) 26763e519524SHoward Hinnant { 26773e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26783e519524SHoward Hinnant __result.first = __i; 26793e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26803e519524SHoward Hinnant __result.second = __i; 26813e519524SHoward Hinnant break; 26823e519524SHoward Hinnant } 26833e519524SHoward Hinnant else 26843e519524SHoward Hinnant { 26853e519524SHoward Hinnant if (__comp(*__first, *__i)) 26863e519524SHoward Hinnant { 26873e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26883e519524SHoward Hinnant __result.first = __first; 26893e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26903e519524SHoward Hinnant __result.second = __i; 26913e519524SHoward Hinnant } 26923e519524SHoward Hinnant else 26933e519524SHoward Hinnant { 26943e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26953e519524SHoward Hinnant __result.first = __i; 26963e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26973e519524SHoward Hinnant __result.second = __first; 26983e519524SHoward Hinnant } 26993e519524SHoward Hinnant } 27003e519524SHoward Hinnant } 27013e519524SHoward Hinnant } 27023e519524SHoward Hinnant } 27033e519524SHoward Hinnant return __result; 27043e519524SHoward Hinnant} 27053e519524SHoward Hinnant 27063e519524SHoward Hinnanttemplate <class _ForwardIterator> 27071362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27081362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27093e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27103e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27113e519524SHoward Hinnant{ 27129d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27139d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27143e519524SHoward Hinnant} 27153e519524SHoward Hinnant 27164eb27b79SHoward Hinnant// minmax 27174eb27b79SHoward Hinnant 27184eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27191362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27201362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27214eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27224eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27234eb27b79SHoward Hinnant{ 27244eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27254eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27264eb27b79SHoward Hinnant} 27274eb27b79SHoward Hinnant 27284eb27b79SHoward Hinnanttemplate<class _Tp> 27291362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27301362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27314eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27324eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27334eb27b79SHoward Hinnant{ 2734ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27354eb27b79SHoward Hinnant} 27364eb27b79SHoward Hinnant 2737ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 273854976f26SHoward Hinnant 27394eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27401362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27411362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27424eb27b79SHoward Hinnantpair<_Tp, _Tp> 27434eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27444eb27b79SHoward Hinnant{ 27459d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27469d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27479d67c6d5SMarshall Clow _Iter __last = __t.end(); 27489d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27499d67c6d5SMarshall Clow 27509d67c6d5SMarshall Clow ++__first; 27519d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27529d67c6d5SMarshall Clow { 27539d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27549d67c6d5SMarshall Clow __result.first = *__first; 27559d67c6d5SMarshall Clow else 27569d67c6d5SMarshall Clow __result.second = *__first; 27579d67c6d5SMarshall Clow ++__first; 27589d67c6d5SMarshall Clow } 27599d67c6d5SMarshall Clow 27609d67c6d5SMarshall Clow while (__first != __last) 27619d67c6d5SMarshall Clow { 27629d67c6d5SMarshall Clow _Tp __prev = *__first++; 2763002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2764002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2765002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 27669d67c6d5SMarshall Clow } 27679d67c6d5SMarshall Clow else { 2768002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2769002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 27709d67c6d5SMarshall Clow } 27719d67c6d5SMarshall Clow 27729d67c6d5SMarshall Clow __first++; 27739d67c6d5SMarshall Clow } 27749d67c6d5SMarshall Clow return __result; 27759d67c6d5SMarshall Clow} 27769d67c6d5SMarshall Clow 27779d67c6d5SMarshall Clowtemplate<class _Tp> 27781362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27791362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27809d67c6d5SMarshall Clowpair<_Tp, _Tp> 27819d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 27829d67c6d5SMarshall Clow{ 27839d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 27844eb27b79SHoward Hinnant} 27854eb27b79SHoward Hinnant 2786ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 278754976f26SHoward Hinnant 27883e519524SHoward Hinnant// random_shuffle 27893e519524SHoward Hinnant 2790f9d540b0SHoward Hinnant// __independent_bits_engine 2791f9d540b0SHoward Hinnant 2792c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2793f9d540b0SHoward Hinnantstruct __log2_imp 27943e519524SHoward Hinnant{ 2795c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2796c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27973e519524SHoward Hinnant}; 27983e519524SHoward Hinnant 2799c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2800c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28013e519524SHoward Hinnant{ 2802f9d540b0SHoward Hinnant static const size_t value = 0; 28033e519524SHoward Hinnant}; 28043e519524SHoward Hinnant 2805c003db1fSHoward Hinnanttemplate <size_t _Rp> 2806c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28073e519524SHoward Hinnant{ 2808c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28093e519524SHoward Hinnant}; 28103e519524SHoward Hinnant 281189918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2812f9d540b0SHoward Hinnantstruct __log2 28133e519524SHoward Hinnant{ 2814c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 281589918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 28163e519524SHoward Hinnant}; 28173e519524SHoward Hinnant 2818f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2819f9d540b0SHoward Hinnantclass __independent_bits_engine 28203e519524SHoward Hinnant{ 2821f9d540b0SHoward Hinnantpublic: 2822f9d540b0SHoward Hinnant // types 2823f9d540b0SHoward Hinnant typedef _UIntType result_type; 2824f9d540b0SHoward Hinnant 2825f9d540b0SHoward Hinnantprivate: 2826f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2827f9d540b0SHoward Hinnant typedef typename conditional 2828f9d540b0SHoward Hinnant < 2829f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2830f9d540b0SHoward Hinnant result_type, 2831f9d540b0SHoward Hinnant _Engine_result_type 2832f9d540b0SHoward Hinnant >::type _Working_result_type; 2833f9d540b0SHoward Hinnant 2834f9d540b0SHoward Hinnant _Engine& __e_; 2835f9d540b0SHoward Hinnant size_t __w_; 2836f9d540b0SHoward Hinnant size_t __w0_; 2837f9d540b0SHoward Hinnant size_t __n_; 2838f9d540b0SHoward Hinnant size_t __n0_; 2839f9d540b0SHoward Hinnant _Working_result_type __y0_; 2840f9d540b0SHoward Hinnant _Working_result_type __y1_; 2841f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2842f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2843f9d540b0SHoward Hinnant 2844ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2845c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2846f9d540b0SHoward Hinnant + _Working_result_type(1); 2847e386b7b3SHoward Hinnant#else 2848e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2849e386b7b3SHoward Hinnant + _Working_result_type(1); 2850e386b7b3SHoward Hinnant#endif 2851e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2852e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2853e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2854f9d540b0SHoward Hinnant 2855f9d540b0SHoward Hinnantpublic: 2856f9d540b0SHoward Hinnant // constructors and seeding functions 2857f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2858f9d540b0SHoward Hinnant 2859f9d540b0SHoward Hinnant // generating functions 2860c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2861f9d540b0SHoward Hinnant 2862f9d540b0SHoward Hinnantprivate: 286308bba64aSMarshall Clow result_type __eval(false_type); 286408bba64aSMarshall Clow result_type __eval(true_type); 2865f9d540b0SHoward Hinnant}; 2866f9d540b0SHoward Hinnant 2867f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2868f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2869f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2870f9d540b0SHoward Hinnant : __e_(__e), 2871f9d540b0SHoward Hinnant __w_(__w) 2872f9d540b0SHoward Hinnant{ 2873f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2874f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2875c003db1fSHoward Hinnant if (_Rp == 0) 2876c003db1fSHoward Hinnant __y0_ = _Rp; 2877f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2878c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2879f9d540b0SHoward Hinnant else 2880f9d540b0SHoward Hinnant __y0_ = 0; 2881c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2882f9d540b0SHoward Hinnant { 2883f9d540b0SHoward Hinnant ++__n_; 2884f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2885f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2886c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2887f9d540b0SHoward Hinnant else 2888f9d540b0SHoward Hinnant __y0_ = 0; 2889f9d540b0SHoward Hinnant } 2890f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2891f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2892c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2893f9d540b0SHoward Hinnant else 2894f9d540b0SHoward Hinnant __y1_ = 0; 2895f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2896f9d540b0SHoward Hinnant _Engine_result_type(0); 2897f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2898f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2899f9d540b0SHoward Hinnant _Engine_result_type(~0); 29003e519524SHoward Hinnant} 29013e519524SHoward Hinnant 2902f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2903f9d540b0SHoward Hinnantinline 2904f9d540b0SHoward Hinnant_UIntType 290508bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29063e519524SHoward Hinnant{ 2907f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29083e519524SHoward Hinnant} 29093e519524SHoward Hinnant 2910f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2911f9d540b0SHoward Hinnant_UIntType 291208bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29133e519524SHoward Hinnant{ 29145beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2915c003db1fSHoward Hinnant result_type _Sp = 0; 2916f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2917f9d540b0SHoward Hinnant { 2918f9d540b0SHoward Hinnant _Engine_result_type __u; 29193e519524SHoward Hinnant do 2920f9d540b0SHoward Hinnant { 2921f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2922f9d540b0SHoward Hinnant } while (__u >= __y0_); 29235beb2c3aSMarshall Clow if (__w0_ < _WRt) 2924c003db1fSHoward Hinnant _Sp <<= __w0_; 2925f9d540b0SHoward Hinnant else 2926c003db1fSHoward Hinnant _Sp = 0; 2927c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2928f9d540b0SHoward Hinnant } 2929f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2930f9d540b0SHoward Hinnant { 2931f9d540b0SHoward Hinnant _Engine_result_type __u; 2932f9d540b0SHoward Hinnant do 2933f9d540b0SHoward Hinnant { 2934f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2935f9d540b0SHoward Hinnant } while (__u >= __y1_); 29365beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2937c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2938f9d540b0SHoward Hinnant else 2939c003db1fSHoward Hinnant _Sp = 0; 2940c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2941f9d540b0SHoward Hinnant } 2942c003db1fSHoward Hinnant return _Sp; 29433e519524SHoward Hinnant} 29443e519524SHoward Hinnant 2945f9d540b0SHoward Hinnant// uniform_int_distribution 29463e519524SHoward Hinnant 2947f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2948f9d540b0SHoward Hinnantclass uniform_int_distribution 29493e519524SHoward Hinnant{ 2950f9d540b0SHoward Hinnantpublic: 2951f9d540b0SHoward Hinnant // types 2952f9d540b0SHoward Hinnant typedef _IntType result_type; 2953f9d540b0SHoward Hinnant 2954f9d540b0SHoward Hinnant class param_type 2955f9d540b0SHoward Hinnant { 2956f9d540b0SHoward Hinnant result_type __a_; 2957f9d540b0SHoward Hinnant result_type __b_; 2958f9d540b0SHoward Hinnant public: 2959f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2960f9d540b0SHoward Hinnant 2961f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2962f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2963f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2964f9d540b0SHoward Hinnant 2965f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2966f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2967f9d540b0SHoward Hinnant 2968f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2969f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2970f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2971f9d540b0SHoward Hinnant {return !(__x == __y);} 29723e519524SHoward Hinnant }; 29733e519524SHoward Hinnant 2974f9d540b0SHoward Hinnantprivate: 2975f9d540b0SHoward Hinnant param_type __p_; 29763e519524SHoward Hinnant 2977f9d540b0SHoward Hinnantpublic: 2978f9d540b0SHoward Hinnant // constructors and reset functions 2979f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2980f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2981f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2982f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2983f9d540b0SHoward Hinnant void reset() {} 2984f9d540b0SHoward Hinnant 2985f9d540b0SHoward Hinnant // generating functions 2986f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2987f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2988f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2989f9d540b0SHoward Hinnant 2990f9d540b0SHoward Hinnant // property functions 2991f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2992f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2993f9d540b0SHoward Hinnant 2994f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2995f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2996f9d540b0SHoward Hinnant 2997f9d540b0SHoward Hinnant result_type min() const {return a();} 2998f9d540b0SHoward Hinnant result_type max() const {return b();} 2999f9d540b0SHoward Hinnant 3000f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3001f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3002f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3003f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3004f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3005f9d540b0SHoward Hinnant {return !(__x == __y);} 30063e519524SHoward Hinnant}; 30073e519524SHoward Hinnant 3008f9d540b0SHoward Hinnanttemplate<class _IntType> 3009f9d540b0SHoward Hinnanttemplate<class _URNG> 3010f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3011f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30122dd53352SMarshall Clow_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK 30133e519524SHoward Hinnant{ 3014f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3015f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 30162dd53352SMarshall Clow const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1); 3017c003db1fSHoward Hinnant if (_Rp == 1) 3018f9d540b0SHoward Hinnant return __p.a(); 3019f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3020f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3021c003db1fSHoward Hinnant if (_Rp == 0) 3022f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3023c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3024a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3025f9d540b0SHoward Hinnant ++__w; 3026f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3027f9d540b0SHoward Hinnant _UIntType __u; 3028f9d540b0SHoward Hinnant do 30293e519524SHoward Hinnant { 3030f9d540b0SHoward Hinnant __u = __e(); 3031c003db1fSHoward Hinnant } while (__u >= _Rp); 3032f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30333e519524SHoward Hinnant} 3034f9d540b0SHoward Hinnant 303566f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 303666f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3037f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3038f9d540b0SHoward Hinnant 3039f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3040f9d540b0SHoward Hinnant 3041f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30423e519524SHoward Hinnant{ 3043f9d540b0SHoward Hinnant static unsigned __c_; 3044f9d540b0SHoward Hinnant 3045f9d540b0SHoward Hinnant __rs_default(); 3046f9d540b0SHoward Hinnantpublic: 3047b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3048f9d540b0SHoward Hinnant 3049f9d540b0SHoward Hinnant static const result_type _Min = 0; 3050f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3051f9d540b0SHoward Hinnant 3052f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3053f9d540b0SHoward Hinnant ~__rs_default(); 3054f9d540b0SHoward Hinnant 3055f9d540b0SHoward Hinnant result_type operator()(); 3056f9d540b0SHoward Hinnant 3057788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3058788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3059f9d540b0SHoward Hinnant 3060f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3061f9d540b0SHoward Hinnant}; 3062f9d540b0SHoward Hinnant 3063f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30643e519524SHoward Hinnant 30653e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 3066ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 30673e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30683e519524SHoward Hinnant{ 30693e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3070c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3071c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30723e519524SHoward Hinnant difference_type __d = __last - __first; 30733e519524SHoward Hinnant if (__d > 1) 30743e519524SHoward Hinnant { 3075c003db1fSHoward Hinnant _Dp __uid; 3076f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 30775a8525e0SMarshall Clow for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3078007b26beSHoward Hinnant { 3079c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3080007b26beSHoward Hinnant if (__i != difference_type(0)) 3081007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3082007b26beSHoward Hinnant } 30833e519524SHoward Hinnant } 30843e519524SHoward Hinnant} 30853e519524SHoward Hinnant 30863e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 3087ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 30883e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3089ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 30903e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30913e519524SHoward Hinnant#else 30923e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30933e519524SHoward Hinnant#endif 30943e519524SHoward Hinnant{ 30953e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30963e519524SHoward Hinnant difference_type __d = __last - __first; 30973e519524SHoward Hinnant if (__d > 1) 30983e519524SHoward Hinnant { 30995a8525e0SMarshall Clow for (--__last; __first < __last; ++__first, (void) --__d) 3100007b26beSHoward Hinnant { 3101007b26beSHoward Hinnant difference_type __i = __rand(__d); 3102e9cc5451SMarshall Clow if (__i != difference_type(0)) 3103007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3104007b26beSHoward Hinnant } 31053e519524SHoward Hinnant } 31063e519524SHoward Hinnant} 31070f37a410SMarshall Clow#endif 31083e519524SHoward Hinnant 3109e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3110e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3111e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3112e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 311342bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3114e7154709SEric Fiselier _Distance __n, 3115e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3116e7154709SEric Fiselier input_iterator_tag) { 3117e7154709SEric Fiselier 3118e7154709SEric Fiselier _Distance __k = 0; 3119e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 312042bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3121e7154709SEric Fiselier _Distance __sz = __k; 3122e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3123e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3124e7154709SEric Fiselier if (__r < __sz) 312542bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3126e7154709SEric Fiselier } 312742bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3128e7154709SEric Fiselier} 3129e7154709SEric Fiselier 3130e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3131e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3132e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3133e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 313442bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3135e7154709SEric Fiselier _Distance __n, 3136e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3137e7154709SEric Fiselier forward_iterator_tag) { 3138e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3139e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3140e7154709SEric Fiselier _Distance __r = 3141e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3142e7154709SEric Fiselier if (__r < __n) { 314342bfedd9SAlexander Richardson *__output_iter++ = *__first; 3144e7154709SEric Fiselier --__n; 3145e7154709SEric Fiselier } 3146e7154709SEric Fiselier } 314742bfedd9SAlexander Richardson return __output_iter; 3148e7154709SEric Fiselier} 3149e7154709SEric Fiselier 3150e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3151e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3152e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3153e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 315442bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3155e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3156e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3157e7154709SEric Fiselier _PopCategory; 3158e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3159e7154709SEric Fiselier _Difference; 3160e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3161e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3162e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3163e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3164e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3165e7154709SEric Fiselier return _VSTD::__sample( 316642bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3167e7154709SEric Fiselier __g, _PopCategory()); 3168e7154709SEric Fiselier} 3169e7154709SEric Fiselier 3170e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3171e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3172e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3173e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3174e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 317542bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3176e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 317742bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3178e7154709SEric Fiselier} 3179e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3180e7154709SEric Fiselier 3181f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3182f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3183ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3184fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3185fb340102SHoward Hinnant#else 3186f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3187fb340102SHoward Hinnant#endif 3188f9d540b0SHoward Hinnant{ 3189f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3190c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3191c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3192f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3193f9d540b0SHoward Hinnant if (__d > 1) 3194f9d540b0SHoward Hinnant { 3195c003db1fSHoward Hinnant _Dp __uid; 3196f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3197007b26beSHoward Hinnant { 3198c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3199007b26beSHoward Hinnant if (__i != difference_type(0)) 3200007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3201007b26beSHoward Hinnant } 3202f9d540b0SHoward Hinnant } 3203f9d540b0SHoward Hinnant} 3204f9d540b0SHoward Hinnant 32053e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 32061362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 32073e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 32083e519524SHoward Hinnant{ 32093e519524SHoward Hinnant for (; __first != __last; ++__first) 32103e519524SHoward Hinnant if (!__pred(*__first)) 32113e519524SHoward Hinnant break; 3212b9595b79SMarshall Clow if ( __first == __last ) 3213b9595b79SMarshall Clow return true; 3214b9595b79SMarshall Clow ++__first; 32153e519524SHoward Hinnant for (; __first != __last; ++__first) 32163e519524SHoward Hinnant if (__pred(*__first)) 32173e519524SHoward Hinnant return false; 32183e519524SHoward Hinnant return true; 32193e519524SHoward Hinnant} 32203e519524SHoward Hinnant 32213e519524SHoward Hinnant// partition 32223e519524SHoward Hinnant 32233e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32243e519524SHoward Hinnant_ForwardIterator 32253e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 32263e519524SHoward Hinnant{ 32273e519524SHoward Hinnant while (true) 32283e519524SHoward Hinnant { 32293e519524SHoward Hinnant if (__first == __last) 32303e519524SHoward Hinnant return __first; 32313e519524SHoward Hinnant if (!__pred(*__first)) 32323e519524SHoward Hinnant break; 32333e519524SHoward Hinnant ++__first; 32343e519524SHoward Hinnant } 32353e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 32363e519524SHoward Hinnant { 32373e519524SHoward Hinnant if (__pred(*__p)) 32383e519524SHoward Hinnant { 32393e519524SHoward Hinnant swap(*__first, *__p); 32403e519524SHoward Hinnant ++__first; 32413e519524SHoward Hinnant } 32423e519524SHoward Hinnant } 32433e519524SHoward Hinnant return __first; 32443e519524SHoward Hinnant} 32453e519524SHoward Hinnant 32463e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 32473e519524SHoward Hinnant_BidirectionalIterator 32483e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 32493e519524SHoward Hinnant bidirectional_iterator_tag) 32503e519524SHoward Hinnant{ 32513e519524SHoward Hinnant while (true) 32523e519524SHoward Hinnant { 32533e519524SHoward Hinnant while (true) 32543e519524SHoward Hinnant { 32553e519524SHoward Hinnant if (__first == __last) 32563e519524SHoward Hinnant return __first; 32573e519524SHoward Hinnant if (!__pred(*__first)) 32583e519524SHoward Hinnant break; 32593e519524SHoward Hinnant ++__first; 32603e519524SHoward Hinnant } 32613e519524SHoward Hinnant do 32623e519524SHoward Hinnant { 32633e519524SHoward Hinnant if (__first == --__last) 32643e519524SHoward Hinnant return __first; 32653e519524SHoward Hinnant } while (!__pred(*__last)); 32663e519524SHoward Hinnant swap(*__first, *__last); 32673e519524SHoward Hinnant ++__first; 32683e519524SHoward Hinnant } 32693e519524SHoward Hinnant} 32703e519524SHoward Hinnant 32713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32733e519524SHoward Hinnant_ForwardIterator 32743e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32753e519524SHoward Hinnant{ 3276ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32773e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32783e519524SHoward Hinnant} 32793e519524SHoward Hinnant 32803e519524SHoward Hinnant// partition_copy 32813e519524SHoward Hinnant 32823e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32833e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32841b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 32853e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32863e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32873e519524SHoward Hinnant _Predicate __pred) 32883e519524SHoward Hinnant{ 32893e519524SHoward Hinnant for (; __first != __last; ++__first) 32903e519524SHoward Hinnant { 32913e519524SHoward Hinnant if (__pred(*__first)) 32923e519524SHoward Hinnant { 32933e519524SHoward Hinnant *__out_true = *__first; 32943e519524SHoward Hinnant ++__out_true; 32953e519524SHoward Hinnant } 32963e519524SHoward Hinnant else 32973e519524SHoward Hinnant { 32983e519524SHoward Hinnant *__out_false = *__first; 32993e519524SHoward Hinnant ++__out_false; 33003e519524SHoward Hinnant } 33013e519524SHoward Hinnant } 33023e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 33033e519524SHoward Hinnant} 33043e519524SHoward Hinnant 33053e519524SHoward Hinnant// partition_point 33063e519524SHoward Hinnant 33073e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3308674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 33093e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33103e519524SHoward Hinnant{ 33113e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3312ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33133e519524SHoward Hinnant while (__len != 0) 33143e519524SHoward Hinnant { 331504695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 33163e519524SHoward Hinnant _ForwardIterator __m = __first; 3317ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 33183e519524SHoward Hinnant if (__pred(*__m)) 33193e519524SHoward Hinnant { 33203e519524SHoward Hinnant __first = ++__m; 33213e519524SHoward Hinnant __len -= __l2 + 1; 33223e519524SHoward Hinnant } 33233e519524SHoward Hinnant else 33243e519524SHoward Hinnant __len = __l2; 33253e519524SHoward Hinnant } 33263e519524SHoward Hinnant return __first; 33273e519524SHoward Hinnant} 33283e519524SHoward Hinnant 33293e519524SHoward Hinnant// stable_partition 33303e519524SHoward Hinnant 33313e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 33323e519524SHoward Hinnant_ForwardIterator 33333e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33343e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 33353e519524SHoward Hinnant{ 33363e519524SHoward Hinnant // *__first is known to be false 33373e519524SHoward Hinnant // __len >= 1 33383e519524SHoward Hinnant if (__len == 1) 33393e519524SHoward Hinnant return __first; 33403e519524SHoward Hinnant if (__len == 2) 33413e519524SHoward Hinnant { 33423e519524SHoward Hinnant _ForwardIterator __m = __first; 33433e519524SHoward Hinnant if (__pred(*++__m)) 33443e519524SHoward Hinnant { 33453e519524SHoward Hinnant swap(*__first, *__m); 33463e519524SHoward Hinnant return __m; 33473e519524SHoward Hinnant } 33483e519524SHoward Hinnant return __first; 33493e519524SHoward Hinnant } 33503e519524SHoward Hinnant if (__len <= __p.second) 33513e519524SHoward Hinnant { // The buffer is big enough to use 33523e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33533e519524SHoward Hinnant __destruct_n __d(0); 33543e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33553e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33563e519524SHoward Hinnant // Update __first to always point to the end of the trues 33573e519524SHoward Hinnant value_type* __t = __p.first; 3358ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33593e519524SHoward Hinnant __d.__incr((value_type*)0); 33603e519524SHoward Hinnant ++__t; 33613e519524SHoward Hinnant _ForwardIterator __i = __first; 33623e519524SHoward Hinnant while (++__i != __last) 33633e519524SHoward Hinnant { 33643e519524SHoward Hinnant if (__pred(*__i)) 33653e519524SHoward Hinnant { 3366ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33673e519524SHoward Hinnant ++__first; 33683e519524SHoward Hinnant } 33693e519524SHoward Hinnant else 33703e519524SHoward Hinnant { 3371ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33723e519524SHoward Hinnant __d.__incr((value_type*)0); 33733e519524SHoward Hinnant ++__t; 33743e519524SHoward Hinnant } 33753e519524SHoward Hinnant } 33763e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33773e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33783e519524SHoward Hinnant __i = __first; 33793e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3380ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33813e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33823e519524SHoward Hinnant return __first; 33833e519524SHoward Hinnant } 33843e519524SHoward Hinnant // Else not enough buffer, do in place 33853e519524SHoward Hinnant // __len >= 3 33863e519524SHoward Hinnant _ForwardIterator __m = __first; 33873e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3388ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33893e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33903e519524SHoward Hinnant // F????????????????? 33913e519524SHoward Hinnant // f m l 33923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33933e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33943e519524SHoward Hinnant // TTTFFFFF?????????? 33953e519524SHoward Hinnant // f ff m l 33963e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33973e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33983e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33993e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34003e519524SHoward Hinnant while (__pred(*__m1)) 34013e519524SHoward Hinnant { 34023e519524SHoward Hinnant if (++__m1 == __last) 34033e519524SHoward Hinnant goto __second_half_done; 34043e519524SHoward Hinnant --__len_half; 34053e519524SHoward Hinnant } 34063e519524SHoward Hinnant // TTTFFFFFTTTF?????? 34073e519524SHoward Hinnant // f ff m m1 l 34083e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 34093e519524SHoward Hinnant__second_half_done: 34103e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34113e519524SHoward Hinnant // f ff m sf l 3412ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34133e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34143e519524SHoward Hinnant // | 34153e519524SHoward Hinnant} 34163e519524SHoward Hinnant 34173e519524SHoward Hinnantstruct __return_temporary_buffer 34183e519524SHoward Hinnant{ 34193e519524SHoward Hinnant template <class _Tp> 3420ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 34213e519524SHoward Hinnant}; 34223e519524SHoward Hinnant 34233e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 34243e519524SHoward Hinnant_ForwardIterator 34253e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34263e519524SHoward Hinnant forward_iterator_tag) 34273e519524SHoward Hinnant{ 34283e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 34293e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34303e519524SHoward Hinnant while (true) 34313e519524SHoward Hinnant { 34323e519524SHoward Hinnant if (__first == __last) 34333e519524SHoward Hinnant return __first; 34343e519524SHoward Hinnant if (!__pred(*__first)) 34353e519524SHoward Hinnant break; 34363e519524SHoward Hinnant ++__first; 34373e519524SHoward Hinnant } 34383e519524SHoward Hinnant // We now have a reduced range [__first, __last) 34393e519524SHoward Hinnant // *__first is known to be false 34403e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34413e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3442ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34433e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34443e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34453e519524SHoward Hinnant if (__len >= __alloc_limit) 34463e519524SHoward Hinnant { 3447ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34483e519524SHoward Hinnant __h.reset(__p.first); 34493e519524SHoward Hinnant } 34503e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34513e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34523e519524SHoward Hinnant} 34533e519524SHoward Hinnant 34543e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34553e519524SHoward Hinnant_BidirectionalIterator 34563e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34573e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 34583e519524SHoward Hinnant{ 34593e519524SHoward Hinnant // *__first is known to be false 34603e519524SHoward Hinnant // *__last is known to be true 34613e519524SHoward Hinnant // __len >= 2 34623e519524SHoward Hinnant if (__len == 2) 34633e519524SHoward Hinnant { 34643e519524SHoward Hinnant swap(*__first, *__last); 34653e519524SHoward Hinnant return __last; 34663e519524SHoward Hinnant } 34673e519524SHoward Hinnant if (__len == 3) 34683e519524SHoward Hinnant { 34693e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34703e519524SHoward Hinnant if (__pred(*++__m)) 34713e519524SHoward Hinnant { 34723e519524SHoward Hinnant swap(*__first, *__m); 34733e519524SHoward Hinnant swap(*__m, *__last); 34743e519524SHoward Hinnant return __last; 34753e519524SHoward Hinnant } 34763e519524SHoward Hinnant swap(*__m, *__last); 34773e519524SHoward Hinnant swap(*__first, *__m); 34783e519524SHoward Hinnant return __m; 34793e519524SHoward Hinnant } 34803e519524SHoward Hinnant if (__len <= __p.second) 34813e519524SHoward Hinnant { // The buffer is big enough to use 34823e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34833e519524SHoward Hinnant __destruct_n __d(0); 34843e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34853e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34863e519524SHoward Hinnant // Update __first to always point to the end of the trues 34873e519524SHoward Hinnant value_type* __t = __p.first; 3488ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34893e519524SHoward Hinnant __d.__incr((value_type*)0); 34903e519524SHoward Hinnant ++__t; 34913e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34923e519524SHoward Hinnant while (++__i != __last) 34933e519524SHoward Hinnant { 34943e519524SHoward Hinnant if (__pred(*__i)) 34953e519524SHoward Hinnant { 3496ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34973e519524SHoward Hinnant ++__first; 34983e519524SHoward Hinnant } 34993e519524SHoward Hinnant else 35003e519524SHoward Hinnant { 3501ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35023e519524SHoward Hinnant __d.__incr((value_type*)0); 35033e519524SHoward Hinnant ++__t; 35043e519524SHoward Hinnant } 35053e519524SHoward Hinnant } 35063e519524SHoward Hinnant // move *__last, known to be true 3507ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35083e519524SHoward Hinnant __i = ++__first; 35093e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35103e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35113e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3512ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35133e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35143e519524SHoward Hinnant return __first; 35153e519524SHoward Hinnant } 35163e519524SHoward Hinnant // Else not enough buffer, do in place 35173e519524SHoward Hinnant // __len >= 4 35183e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35193e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3520ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35213e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 35223e519524SHoward Hinnant // F????????????????T 35233e519524SHoward Hinnant // f m l 35243e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 35253e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 35263e519524SHoward Hinnant _Distance __len_half = __len2; 35273e519524SHoward Hinnant while (!__pred(*--__m1)) 35283e519524SHoward Hinnant { 35293e519524SHoward Hinnant if (__m1 == __first) 35303e519524SHoward Hinnant goto __first_half_done; 35313e519524SHoward Hinnant --__len_half; 35323e519524SHoward Hinnant } 35333e519524SHoward Hinnant // F???TFFF?????????T 35343e519524SHoward Hinnant // f m1 m l 35353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35363e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 35373e519524SHoward Hinnant__first_half_done: 35383e519524SHoward Hinnant // TTTFFFFF?????????T 35393e519524SHoward Hinnant // f ff m l 35403e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35413e519524SHoward Hinnant __m1 = __m; 35423e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 35433e519524SHoward Hinnant ++__second_false; 35443e519524SHoward Hinnant __len_half = __len - __len2; 35453e519524SHoward Hinnant while (__pred(*__m1)) 35463e519524SHoward Hinnant { 35473e519524SHoward Hinnant if (++__m1 == __last) 35483e519524SHoward Hinnant goto __second_half_done; 35493e519524SHoward Hinnant --__len_half; 35503e519524SHoward Hinnant } 35513e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35523e519524SHoward Hinnant // f ff m m1 l 35533e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35543e519524SHoward Hinnant__second_half_done: 35553e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35563e519524SHoward Hinnant // f ff m sf l 3557ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35583e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35593e519524SHoward Hinnant // | 35603e519524SHoward Hinnant} 35613e519524SHoward Hinnant 35623e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35633e519524SHoward Hinnant_BidirectionalIterator 35643e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35653e519524SHoward Hinnant bidirectional_iterator_tag) 35663e519524SHoward Hinnant{ 35673e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35683e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35693e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35703e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35713e519524SHoward Hinnant while (true) 35723e519524SHoward Hinnant { 35733e519524SHoward Hinnant if (__first == __last) 35743e519524SHoward Hinnant return __first; 35753e519524SHoward Hinnant if (!__pred(*__first)) 35763e519524SHoward Hinnant break; 35773e519524SHoward Hinnant ++__first; 35783e519524SHoward Hinnant } 35793e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35803e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35813e519524SHoward Hinnant do 35823e519524SHoward Hinnant { 35833e519524SHoward Hinnant if (__first == --__last) 35843e519524SHoward Hinnant return __first; 35853e519524SHoward Hinnant } while (!__pred(*__last)); 35863e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35873e519524SHoward Hinnant // *__first is known to be false 35883e519524SHoward Hinnant // *__last is known to be true 35893e519524SHoward Hinnant // __len >= 2 3590ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35913e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35923e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35933e519524SHoward Hinnant if (__len >= __alloc_limit) 35943e519524SHoward Hinnant { 3595ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35963e519524SHoward Hinnant __h.reset(__p.first); 35973e519524SHoward Hinnant } 35983e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35993e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36003e519524SHoward Hinnant} 36013e519524SHoward Hinnant 36023e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 36033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36043e519524SHoward Hinnant_ForwardIterator 36053e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 36063e519524SHoward Hinnant{ 36073e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36083e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 36093e519524SHoward Hinnant} 36103e519524SHoward Hinnant 36113e519524SHoward Hinnant// is_sorted_until 36123e519524SHoward Hinnant 36133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36141362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 36153e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36163e519524SHoward Hinnant{ 36173e519524SHoward Hinnant if (__first != __last) 36183e519524SHoward Hinnant { 36193e519524SHoward Hinnant _ForwardIterator __i = __first; 36203e519524SHoward Hinnant while (++__i != __last) 36213e519524SHoward Hinnant { 36223e519524SHoward Hinnant if (__comp(*__i, *__first)) 36233e519524SHoward Hinnant return __i; 36243e519524SHoward Hinnant __first = __i; 36253e519524SHoward Hinnant } 36263e519524SHoward Hinnant } 36273e519524SHoward Hinnant return __last; 36283e519524SHoward Hinnant} 36293e519524SHoward Hinnant 36303e519524SHoward Hinnanttemplate<class _ForwardIterator> 36311362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 36321362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36333e519524SHoward Hinnant_ForwardIterator 36343e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 36353e519524SHoward Hinnant{ 3636ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36373e519524SHoward Hinnant} 36383e519524SHoward Hinnant 36393e519524SHoward Hinnant// is_sorted 36403e519524SHoward Hinnant 36413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36421362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 36431362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36443e519524SHoward Hinnantbool 36453e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36463e519524SHoward Hinnant{ 3647ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 36483e519524SHoward Hinnant} 36493e519524SHoward Hinnant 36503e519524SHoward Hinnanttemplate<class _ForwardIterator> 36511362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 36521362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36533e519524SHoward Hinnantbool 36543e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36553e519524SHoward Hinnant{ 3656ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36573e519524SHoward Hinnant} 36583e519524SHoward Hinnant 36593e519524SHoward Hinnant// sort 36603e519524SHoward Hinnant 36613e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 36623e519524SHoward Hinnant 36633e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36643e519524SHoward Hinnantunsigned 36653e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36663e519524SHoward Hinnant{ 36673e519524SHoward Hinnant unsigned __r = 0; 36683e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36693e519524SHoward Hinnant { 36703e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36713e519524SHoward Hinnant return __r; // x <= y && y <= z 36723e519524SHoward Hinnant // x <= y && y > z 36733e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36743e519524SHoward Hinnant __r = 1; 36753e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36763e519524SHoward Hinnant { 36773e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36783e519524SHoward Hinnant __r = 2; 36793e519524SHoward Hinnant } 36803e519524SHoward Hinnant return __r; // x <= y && y < z 36813e519524SHoward Hinnant } 36823e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36833e519524SHoward Hinnant { 36843e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36853e519524SHoward Hinnant __r = 1; 36863e519524SHoward Hinnant return __r; 36873e519524SHoward Hinnant } 36883e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36893e519524SHoward Hinnant __r = 1; // x < y && x <= z 36903e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36913e519524SHoward Hinnant { 36923e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36933e519524SHoward Hinnant __r = 2; 36943e519524SHoward Hinnant } 36953e519524SHoward Hinnant return __r; 36963e519524SHoward Hinnant} // x <= y && y <= z 36973e519524SHoward Hinnant 36983e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36993e519524SHoward Hinnant 37003e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37013e519524SHoward Hinnantunsigned 37023e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37033e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37043e519524SHoward Hinnant{ 37053e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 37063e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37073e519524SHoward Hinnant { 37083e519524SHoward Hinnant swap(*__x3, *__x4); 37093e519524SHoward Hinnant ++__r; 37103e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37113e519524SHoward Hinnant { 37123e519524SHoward Hinnant swap(*__x2, *__x3); 37133e519524SHoward Hinnant ++__r; 37143e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37153e519524SHoward Hinnant { 37163e519524SHoward Hinnant swap(*__x1, *__x2); 37173e519524SHoward Hinnant ++__r; 37183e519524SHoward Hinnant } 37193e519524SHoward Hinnant } 37203e519524SHoward Hinnant } 37213e519524SHoward Hinnant return __r; 37223e519524SHoward Hinnant} 37233e519524SHoward Hinnant 37243e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 37253e519524SHoward Hinnant 37263e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 3727835140a4SLouis Dionne_LIBCPP_HIDDEN 37283e519524SHoward Hinnantunsigned 37293e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37303e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 37313e519524SHoward Hinnant{ 37323e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 37333e519524SHoward Hinnant if (__c(*__x5, *__x4)) 37343e519524SHoward Hinnant { 37353e519524SHoward Hinnant swap(*__x4, *__x5); 37363e519524SHoward Hinnant ++__r; 37373e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37383e519524SHoward Hinnant { 37393e519524SHoward Hinnant swap(*__x3, *__x4); 37403e519524SHoward Hinnant ++__r; 37413e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37423e519524SHoward Hinnant { 37433e519524SHoward Hinnant swap(*__x2, *__x3); 37443e519524SHoward Hinnant ++__r; 37453e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37463e519524SHoward Hinnant { 37473e519524SHoward Hinnant swap(*__x1, *__x2); 37483e519524SHoward Hinnant ++__r; 37493e519524SHoward Hinnant } 37503e519524SHoward Hinnant } 37513e519524SHoward Hinnant } 37523e519524SHoward Hinnant } 37533e519524SHoward Hinnant return __r; 37543e519524SHoward Hinnant} 37553e519524SHoward Hinnant 37563e519524SHoward Hinnant// Assumes size > 0 37573e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37583e519524SHoward Hinnantvoid 37593e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37603e519524SHoward Hinnant{ 37613e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 37623e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 37633e519524SHoward Hinnant { 3764ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37653e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37663e519524SHoward Hinnant (__first, __last, __comp); 37673e519524SHoward Hinnant if (__i != __first) 37683e519524SHoward Hinnant swap(*__first, *__i); 37693e519524SHoward Hinnant } 37703e519524SHoward Hinnant} 37713e519524SHoward Hinnant 37723e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37733e519524SHoward Hinnantvoid 37743e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37753e519524SHoward Hinnant{ 37763e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37773e519524SHoward Hinnant if (__first != __last) 37783e519524SHoward Hinnant { 37793e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37803e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37813e519524SHoward Hinnant { 37823e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3783ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37843e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3785ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3786ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37873e519524SHoward Hinnant } 37883e519524SHoward Hinnant } 37893e519524SHoward Hinnant} 37903e519524SHoward Hinnant 37913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37923e519524SHoward Hinnantvoid 37933e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37943e519524SHoward Hinnant{ 37953e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37963e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37973e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37983e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37993e519524SHoward Hinnant { 38003e519524SHoward Hinnant if (__comp(*__i, *__j)) 38013e519524SHoward Hinnant { 3802ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38033e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38043e519524SHoward Hinnant __j = __i; 38053e519524SHoward Hinnant do 38063e519524SHoward Hinnant { 3807ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38083e519524SHoward Hinnant __j = __k; 38093e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3810ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38113e519524SHoward Hinnant } 38123e519524SHoward Hinnant __j = __i; 38133e519524SHoward Hinnant } 38143e519524SHoward Hinnant} 38153e519524SHoward Hinnant 38163e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38173e519524SHoward Hinnantbool 38183e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38193e519524SHoward Hinnant{ 38203e519524SHoward Hinnant switch (__last - __first) 38213e519524SHoward Hinnant { 38223e519524SHoward Hinnant case 0: 38233e519524SHoward Hinnant case 1: 38243e519524SHoward Hinnant return true; 38253e519524SHoward Hinnant case 2: 38263e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38273e519524SHoward Hinnant swap(*__first, *__last); 38283e519524SHoward Hinnant return true; 38293e519524SHoward Hinnant case 3: 3830ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38313e519524SHoward Hinnant return true; 38323e519524SHoward Hinnant case 4: 3833ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38343e519524SHoward Hinnant return true; 38353e519524SHoward Hinnant case 5: 3836ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38373e519524SHoward Hinnant return true; 38383e519524SHoward Hinnant } 38393e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38403e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38413e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38423e519524SHoward Hinnant const unsigned __limit = 8; 38433e519524SHoward Hinnant unsigned __count = 0; 38443e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38453e519524SHoward Hinnant { 38463e519524SHoward Hinnant if (__comp(*__i, *__j)) 38473e519524SHoward Hinnant { 3848ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38493e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38503e519524SHoward Hinnant __j = __i; 38513e519524SHoward Hinnant do 38523e519524SHoward Hinnant { 3853ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38543e519524SHoward Hinnant __j = __k; 38553e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3856ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38573e519524SHoward Hinnant if (++__count == __limit) 38583e519524SHoward Hinnant return ++__i == __last; 38593e519524SHoward Hinnant } 38603e519524SHoward Hinnant __j = __i; 38613e519524SHoward Hinnant } 38623e519524SHoward Hinnant return true; 38633e519524SHoward Hinnant} 38643e519524SHoward Hinnant 38653e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38663e519524SHoward Hinnantvoid 38673e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38683e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38693e519524SHoward Hinnant{ 38703e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38713e519524SHoward Hinnant if (__first1 != __last1) 38723e519524SHoward Hinnant { 38733e519524SHoward Hinnant __destruct_n __d(0); 38743e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38753e519524SHoward Hinnant value_type* __last2 = __first2; 3876ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38773e519524SHoward Hinnant __d.__incr((value_type*)0); 38783e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38793e519524SHoward Hinnant { 38803e519524SHoward Hinnant value_type* __j2 = __last2; 38813e519524SHoward Hinnant value_type* __i2 = __j2; 38823e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38833e519524SHoward Hinnant { 3884ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38853e519524SHoward Hinnant __d.__incr((value_type*)0); 38863e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3887ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3888ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38893e519524SHoward Hinnant } 38903e519524SHoward Hinnant else 38913e519524SHoward Hinnant { 3892ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38933e519524SHoward Hinnant __d.__incr((value_type*)0); 38943e519524SHoward Hinnant } 38953e519524SHoward Hinnant } 38963e519524SHoward Hinnant __h.release(); 38973e519524SHoward Hinnant } 38983e519524SHoward Hinnant} 38993e519524SHoward Hinnant 39003e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39013e519524SHoward Hinnantvoid 39023e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39033e519524SHoward Hinnant{ 39043e519524SHoward Hinnant // _Compare is known to be a reference type 39053e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39063e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3907ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3908ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 39093e519524SHoward Hinnant while (true) 39103e519524SHoward Hinnant { 39113e519524SHoward Hinnant __restart: 39123e519524SHoward Hinnant difference_type __len = __last - __first; 39133e519524SHoward Hinnant switch (__len) 39143e519524SHoward Hinnant { 39153e519524SHoward Hinnant case 0: 39163e519524SHoward Hinnant case 1: 39173e519524SHoward Hinnant return; 39183e519524SHoward Hinnant case 2: 39193e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39203e519524SHoward Hinnant swap(*__first, *__last); 39213e519524SHoward Hinnant return; 39223e519524SHoward Hinnant case 3: 3923ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39243e519524SHoward Hinnant return; 39253e519524SHoward Hinnant case 4: 3926ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39273e519524SHoward Hinnant return; 39283e519524SHoward Hinnant case 5: 3929ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39303e519524SHoward Hinnant return; 39313e519524SHoward Hinnant } 39323e519524SHoward Hinnant if (__len <= __limit) 39333e519524SHoward Hinnant { 3934ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 39353e519524SHoward Hinnant return; 39363e519524SHoward Hinnant } 39373e519524SHoward Hinnant // __len > 5 39383e519524SHoward Hinnant _RandomAccessIterator __m = __first; 39393e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 39403e519524SHoward Hinnant --__lm1; 39413e519524SHoward Hinnant unsigned __n_swaps; 39423e519524SHoward Hinnant { 39433e519524SHoward Hinnant difference_type __delta; 39443e519524SHoward Hinnant if (__len >= 1000) 39453e519524SHoward Hinnant { 39463e519524SHoward Hinnant __delta = __len/2; 39473e519524SHoward Hinnant __m += __delta; 39483e519524SHoward Hinnant __delta /= 2; 3949ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 39503e519524SHoward Hinnant } 39513e519524SHoward Hinnant else 39523e519524SHoward Hinnant { 39533e519524SHoward Hinnant __delta = __len/2; 39543e519524SHoward Hinnant __m += __delta; 3955ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39563e519524SHoward Hinnant } 39573e519524SHoward Hinnant } 39583e519524SHoward Hinnant // *__m is median 39593e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39603e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39613e519524SHoward Hinnant _RandomAccessIterator __i = __first; 39623e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 39633e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39643e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39653e519524SHoward Hinnant // Prime the downward search with a guard. 39663e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39673e519524SHoward Hinnant { 39683e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39693e519524SHoward Hinnant // manually guard downward moving __j against __i 39703e519524SHoward Hinnant while (true) 39713e519524SHoward Hinnant { 39723e519524SHoward Hinnant if (__i == --__j) 39733e519524SHoward Hinnant { 39743e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39753e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39763e519524SHoward Hinnant ++__i; // __first + 1 39773e519524SHoward Hinnant __j = __last; 39783e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39793e519524SHoward Hinnant { 39803e519524SHoward Hinnant while (true) 39813e519524SHoward Hinnant { 39823e519524SHoward Hinnant if (__i == __j) 39833e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39843e519524SHoward Hinnant if (__comp(*__first, *__i)) 39853e519524SHoward Hinnant { 39863e519524SHoward Hinnant swap(*__i, *__j); 39873e519524SHoward Hinnant ++__n_swaps; 39883e519524SHoward Hinnant ++__i; 39893e519524SHoward Hinnant break; 39903e519524SHoward Hinnant } 39913e519524SHoward Hinnant ++__i; 39923e519524SHoward Hinnant } 39933e519524SHoward Hinnant } 39943e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39953e519524SHoward Hinnant if (__i == __j) 39963e519524SHoward Hinnant return; 39973e519524SHoward Hinnant while (true) 39983e519524SHoward Hinnant { 39993e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40003e519524SHoward Hinnant ++__i; 40013e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40023e519524SHoward Hinnant ; 40033e519524SHoward Hinnant if (__i >= __j) 40043e519524SHoward Hinnant break; 40053e519524SHoward Hinnant swap(*__i, *__j); 40063e519524SHoward Hinnant ++__n_swaps; 40073e519524SHoward Hinnant ++__i; 40083e519524SHoward Hinnant } 40093e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 40103e519524SHoward Hinnant // The first part is sorted, sort the secod part 4011ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 40123e519524SHoward Hinnant __first = __i; 40133e519524SHoward Hinnant goto __restart; 40143e519524SHoward Hinnant } 40153e519524SHoward Hinnant if (__comp(*__j, *__m)) 40163e519524SHoward Hinnant { 40173e519524SHoward Hinnant swap(*__i, *__j); 40183e519524SHoward Hinnant ++__n_swaps; 40193e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 40203e519524SHoward Hinnant } 40213e519524SHoward Hinnant } 40223e519524SHoward Hinnant } 40233e519524SHoward Hinnant // It is known that *__i < *__m 40243e519524SHoward Hinnant ++__i; 40253e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40263e519524SHoward Hinnant // if not yet partitioned... 40273e519524SHoward Hinnant if (__i < __j) 40283e519524SHoward Hinnant { 40293e519524SHoward Hinnant // known that *(__i - 1) < *__m 40303e519524SHoward Hinnant // known that __i <= __m 40313e519524SHoward Hinnant while (true) 40323e519524SHoward Hinnant { 40333e519524SHoward Hinnant // __m still guards upward moving __i 40343e519524SHoward Hinnant while (__comp(*__i, *__m)) 40353e519524SHoward Hinnant ++__i; 40363e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 40373e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 40383e519524SHoward Hinnant ; 40393e519524SHoward Hinnant if (__i > __j) 40403e519524SHoward Hinnant break; 40413e519524SHoward Hinnant swap(*__i, *__j); 40423e519524SHoward Hinnant ++__n_swaps; 40433e519524SHoward Hinnant // It is known that __m != __j 40443e519524SHoward Hinnant // If __m just moved, follow it 40453e519524SHoward Hinnant if (__m == __i) 40463e519524SHoward Hinnant __m = __j; 40473e519524SHoward Hinnant ++__i; 40483e519524SHoward Hinnant } 40493e519524SHoward Hinnant } 40503e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 40513e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 40523e519524SHoward Hinnant { 40533e519524SHoward Hinnant swap(*__i, *__m); 40543e519524SHoward Hinnant ++__n_swaps; 40553e519524SHoward Hinnant } 40563e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40573e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40583e519524SHoward Hinnant if (__n_swaps == 0) 40593e519524SHoward Hinnant { 4060ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4061ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 40623e519524SHoward Hinnant { 40633e519524SHoward Hinnant if (__fs) 40643e519524SHoward Hinnant return; 40653e519524SHoward Hinnant __last = __i; 40663e519524SHoward Hinnant continue; 40673e519524SHoward Hinnant } 40683e519524SHoward Hinnant else 40693e519524SHoward Hinnant { 40703e519524SHoward Hinnant if (__fs) 40713e519524SHoward Hinnant { 40723e519524SHoward Hinnant __first = ++__i; 40733e519524SHoward Hinnant continue; 40743e519524SHoward Hinnant } 40753e519524SHoward Hinnant } 40763e519524SHoward Hinnant } 40773e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40783e519524SHoward Hinnant if (__i - __first < __last - __i) 40793e519524SHoward Hinnant { 4080ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4081ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40823e519524SHoward Hinnant __first = ++__i; 40833e519524SHoward Hinnant } 40843e519524SHoward Hinnant else 40853e519524SHoward Hinnant { 4086ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4087ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40883e519524SHoward Hinnant __last = __i; 40893e519524SHoward Hinnant } 40903e519524SHoward Hinnant } 40913e519524SHoward Hinnant} 40923e519524SHoward Hinnant 40933e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40963e519524SHoward Hinnantvoid 40973e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40983e519524SHoward Hinnant{ 4099aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4100aa1cad15SEric Fiselier _VSTD::__sort<_Comp_ref>(__first, __last, _Comp_ref(__comp)); 41013e519524SHoward Hinnant} 41023e519524SHoward Hinnant 41033e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41053e519524SHoward Hinnantvoid 41063e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 41073e519524SHoward Hinnant{ 4108ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41093e519524SHoward Hinnant} 41103e519524SHoward Hinnant 41113e519524SHoward Hinnanttemplate <class _Tp> 41123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41133e519524SHoward Hinnantvoid 41143e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 41153e519524SHoward Hinnant{ 4116ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 41173e519524SHoward Hinnant} 41183e519524SHoward Hinnant 41193e519524SHoward Hinnanttemplate <class _Tp> 41203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41213e519524SHoward Hinnantvoid 41223e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 41233e519524SHoward Hinnant{ 4124ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 41253e519524SHoward Hinnant} 41263e519524SHoward Hinnant 4127f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4128f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4129f554add5SHoward Hinnantvoid 4130f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4131f554add5SHoward Hinnant{ 4132f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4133f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4134f554add5SHoward Hinnant} 4135f554add5SHoward Hinnant 4136f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4137f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4138f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4139f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4140f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4141f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4142f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4143f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4144f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4145f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4146f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4147f0544c20SHoward 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>&)) 4148f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4149f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4150f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41513e519524SHoward Hinnant 4152f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4153f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4154f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4155f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4156f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4157f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4158f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4159f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4160f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4161f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4162f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4163f0544c20SHoward 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>&)) 4164f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4165f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4166f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41673e519524SHoward Hinnant 4168f0544c20SHoward 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>&)) 41693e519524SHoward Hinnant 41703e519524SHoward Hinnant// lower_bound 41713e519524SHoward Hinnant 41723e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4173d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4174e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41753e519524SHoward Hinnant{ 41763e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4177ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41783e519524SHoward Hinnant while (__len != 0) 41793e519524SHoward Hinnant { 418004695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41813e519524SHoward Hinnant _ForwardIterator __m = __first; 4182ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4183e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41843e519524SHoward Hinnant { 41853e519524SHoward Hinnant __first = ++__m; 41863e519524SHoward Hinnant __len -= __l2 + 1; 41873e519524SHoward Hinnant } 41883e519524SHoward Hinnant else 41893e519524SHoward Hinnant __len = __l2; 41903e519524SHoward Hinnant } 41913e519524SHoward Hinnant return __first; 41923e519524SHoward Hinnant} 41933e519524SHoward Hinnant 41943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41951362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 41961362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41973e519524SHoward Hinnant_ForwardIterator 4198e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41993e519524SHoward Hinnant{ 42003e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4201e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 42023e519524SHoward Hinnant} 42033e519524SHoward Hinnant 42043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42051362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 42061362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42073e519524SHoward Hinnant_ForwardIterator 4208e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42093e519524SHoward Hinnant{ 4210e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 42113e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42123e519524SHoward Hinnant} 42133e519524SHoward Hinnant 42143e519524SHoward Hinnant// upper_bound 42153e519524SHoward Hinnant 42163e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4217d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4218e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42193e519524SHoward Hinnant{ 42203e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4221ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42223e519524SHoward Hinnant while (__len != 0) 42233e519524SHoward Hinnant { 422404695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 42253e519524SHoward Hinnant _ForwardIterator __m = __first; 4226ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4227e4383379SHoward Hinnant if (__comp(__value_, *__m)) 42283e519524SHoward Hinnant __len = __l2; 42293e519524SHoward Hinnant else 42303e519524SHoward Hinnant { 42313e519524SHoward Hinnant __first = ++__m; 42323e519524SHoward Hinnant __len -= __l2 + 1; 42333e519524SHoward Hinnant } 42343e519524SHoward Hinnant } 42353e519524SHoward Hinnant return __first; 42363e519524SHoward Hinnant} 42373e519524SHoward Hinnant 42383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42391362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 42401362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42413e519524SHoward Hinnant_ForwardIterator 4242e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42433e519524SHoward Hinnant{ 42443e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4245e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 42463e519524SHoward Hinnant} 42473e519524SHoward Hinnant 42483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42491362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 42501362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42513e519524SHoward Hinnant_ForwardIterator 4252e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42533e519524SHoward Hinnant{ 4254e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42553e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42563e519524SHoward Hinnant} 42573e519524SHoward Hinnant 42583e519524SHoward Hinnant// equal_range 42593e519524SHoward Hinnant 42603e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4261d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4262e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42633e519524SHoward Hinnant{ 42643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4265ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42663e519524SHoward Hinnant while (__len != 0) 42673e519524SHoward Hinnant { 426804695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 42693e519524SHoward Hinnant _ForwardIterator __m = __first; 4270ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4271e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42723e519524SHoward Hinnant { 42733e519524SHoward Hinnant __first = ++__m; 42743e519524SHoward Hinnant __len -= __l2 + 1; 42753e519524SHoward Hinnant } 4276e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42773e519524SHoward Hinnant { 42783e519524SHoward Hinnant __last = __m; 42793e519524SHoward Hinnant __len = __l2; 42803e519524SHoward Hinnant } 42813e519524SHoward Hinnant else 42823e519524SHoward Hinnant { 42833e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42843e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42853e519524SHoward Hinnant ( 4286e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4287e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42883e519524SHoward Hinnant ); 42893e519524SHoward Hinnant } 42903e519524SHoward Hinnant } 42913e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42923e519524SHoward Hinnant} 42933e519524SHoward Hinnant 42943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42951362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 42961362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42973e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4298e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42993e519524SHoward Hinnant{ 4300aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4301e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 43023e519524SHoward Hinnant} 43033e519524SHoward Hinnant 43043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43051362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43061362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43073e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4308e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43093e519524SHoward Hinnant{ 4310e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 43113e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43123e519524SHoward Hinnant} 43133e519524SHoward Hinnant 43143e519524SHoward Hinnant// binary_search 43153e519524SHoward Hinnant 43163e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4317d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43183e519524SHoward Hinnantbool 4319e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43203e519524SHoward Hinnant{ 4321e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4322e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 43233e519524SHoward Hinnant} 43243e519524SHoward Hinnant 43253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43261362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43271362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43283e519524SHoward Hinnantbool 4329e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43303e519524SHoward Hinnant{ 4331aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4332e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 43333e519524SHoward Hinnant} 43343e519524SHoward Hinnant 43353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43361362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43371362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43383e519524SHoward Hinnantbool 4339e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43403e519524SHoward Hinnant{ 4341e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43423e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43433e519524SHoward Hinnant} 43443e519524SHoward Hinnant 43453e519524SHoward Hinnant// merge 43463e519524SHoward Hinnant 43473e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43483e519524SHoward Hinnant_OutputIterator 43493e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43503e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43513e519524SHoward Hinnant{ 43523e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43533e519524SHoward Hinnant { 43543e519524SHoward Hinnant if (__first2 == __last2) 4355ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43563e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43573e519524SHoward Hinnant { 43583e519524SHoward Hinnant *__result = *__first2; 43593e519524SHoward Hinnant ++__first2; 43603e519524SHoward Hinnant } 43613e519524SHoward Hinnant else 43623e519524SHoward Hinnant { 43633e519524SHoward Hinnant *__result = *__first1; 43643e519524SHoward Hinnant ++__first1; 43653e519524SHoward Hinnant } 43663e519524SHoward Hinnant } 4367ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43683e519524SHoward Hinnant} 43693e519524SHoward Hinnant 43703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43723e519524SHoward Hinnant_OutputIterator 43733e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43743e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43753e519524SHoward Hinnant{ 4376aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4377ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 43783e519524SHoward Hinnant} 43793e519524SHoward Hinnant 43803e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43823e519524SHoward Hinnant_OutputIterator 43833e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43843e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43853e519524SHoward Hinnant{ 43863e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43873e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43883e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43893e519524SHoward Hinnant} 43903e519524SHoward Hinnant 43913e519524SHoward Hinnant// inplace_merge 43923e519524SHoward Hinnant 4393adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4394adfdae18SMarshall Clow class _OutputIterator> 4395adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4396adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4397adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4398adfdae18SMarshall Clow{ 4399adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4400adfdae18SMarshall Clow { 4401adfdae18SMarshall Clow if (__first2 == __last2) 4402adfdae18SMarshall Clow { 4403adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4404adfdae18SMarshall Clow return; 4405adfdae18SMarshall Clow } 4406adfdae18SMarshall Clow 4407adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4408adfdae18SMarshall Clow { 4409adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4410adfdae18SMarshall Clow ++__first2; 4411adfdae18SMarshall Clow } 4412adfdae18SMarshall Clow else 4413adfdae18SMarshall Clow { 4414adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4415adfdae18SMarshall Clow ++__first1; 4416adfdae18SMarshall Clow } 4417adfdae18SMarshall Clow } 4418adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4419adfdae18SMarshall Clow} 4420adfdae18SMarshall Clow 44213e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44223e519524SHoward Hinnantvoid 44233e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44243e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44253e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44263e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 44273e519524SHoward Hinnant{ 44283e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44293e519524SHoward Hinnant __destruct_n __d(0); 44303e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44313e519524SHoward Hinnant if (__len1 <= __len2) 44323e519524SHoward Hinnant { 44333e519524SHoward Hinnant value_type* __p = __buff; 4434910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4435ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4436adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44373e519524SHoward Hinnant } 44383e519524SHoward Hinnant else 44393e519524SHoward Hinnant { 44403e519524SHoward Hinnant value_type* __p = __buff; 4441910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4442ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44433e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44443e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4445adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4446adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4447a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 44483e519524SHoward Hinnant } 44493e519524SHoward Hinnant} 44503e519524SHoward Hinnant 44513e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44523e519524SHoward Hinnantvoid 44533e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44543e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44553e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44563e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 44573e519524SHoward Hinnant{ 44583e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 44593e519524SHoward Hinnant while (true) 44603e519524SHoward Hinnant { 44613e519524SHoward Hinnant // if __middle == __last, we're done 44623e519524SHoward Hinnant if (__len2 == 0) 44633e519524SHoward Hinnant return; 4464526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4465526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4466526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 44673e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4468910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 44693e519524SHoward Hinnant { 44703e519524SHoward Hinnant if (__len1 == 0) 44713e519524SHoward Hinnant return; 44723e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44733e519524SHoward Hinnant break; 44743e519524SHoward Hinnant } 44753e519524SHoward Hinnant // __first < __middle < __last 44763e519524SHoward Hinnant // *__first > *__middle 44773e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44783e519524SHoward Hinnant // all elements in: 44793e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44803e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44813e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44823e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44833e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44843e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44853e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44863e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44873e519524SHoward Hinnant // binary search smaller range 44883e519524SHoward Hinnant if (__len1 < __len2) 44893e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44903e519524SHoward Hinnant __len21 = __len2 / 2; 44913e519524SHoward Hinnant __m2 = __middle; 4492ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44933e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4494ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44953e519524SHoward Hinnant } 44963e519524SHoward Hinnant else 44973e519524SHoward Hinnant { 44983e519524SHoward Hinnant if (__len1 == 1) 44993e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 45003e519524SHoward Hinnant // It is known *__first > *__middle 45013e519524SHoward Hinnant swap(*__first, *__middle); 45023e519524SHoward Hinnant return; 45033e519524SHoward Hinnant } 45043e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 45053e519524SHoward Hinnant __len11 = __len1 / 2; 45063e519524SHoward Hinnant __m1 = __first; 4507ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 45083e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4509ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 45103e519524SHoward Hinnant } 45113e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 45123e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 45133e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 45143e519524SHoward Hinnant // swap middle two partitions 4515ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 45163e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 45173e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 45183e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45193e519524SHoward Hinnant { 45203e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45213e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45223e519524SHoward Hinnant __first = __middle; 45233e519524SHoward Hinnant __middle = __m2; 45243e519524SHoward Hinnant __len1 = __len12; 45253e519524SHoward Hinnant __len2 = __len22; 45263e519524SHoward Hinnant } 45273e519524SHoward Hinnant else 45283e519524SHoward Hinnant { 45293e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45303e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45313e519524SHoward Hinnant __last = __middle; 45323e519524SHoward Hinnant __middle = __m1; 45333e519524SHoward Hinnant __len1 = __len11; 45343e519524SHoward Hinnant __len2 = __len21; 45353e519524SHoward Hinnant } 45363e519524SHoward Hinnant } 45373e519524SHoward Hinnant} 45383e519524SHoward Hinnant 45393e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45413e519524SHoward Hinnantvoid 45423e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45433e519524SHoward Hinnant _Compare __comp) 45443e519524SHoward Hinnant{ 45453e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45463e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4547ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4548ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4549ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45500b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45510b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 4552aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4553ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45543e519524SHoward Hinnant __buf.first, __buf.second); 45553e519524SHoward Hinnant} 45563e519524SHoward Hinnant 45573e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45593e519524SHoward Hinnantvoid 45603e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45613e519524SHoward Hinnant{ 4562ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45633e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45643e519524SHoward Hinnant} 45653e519524SHoward Hinnant 45663e519524SHoward Hinnant// stable_sort 45673e519524SHoward Hinnant 45683e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45693e519524SHoward Hinnantvoid 45703e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45723e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45733e519524SHoward Hinnant{ 45743e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45753e519524SHoward Hinnant __destruct_n __d(0); 45763e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45773e519524SHoward Hinnant for (; true; ++__result) 45783e519524SHoward Hinnant { 45793e519524SHoward Hinnant if (__first1 == __last1) 45803e519524SHoward Hinnant { 45813e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4582ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45833e519524SHoward Hinnant __h.release(); 45843e519524SHoward Hinnant return; 45853e519524SHoward Hinnant } 45863e519524SHoward Hinnant if (__first2 == __last2) 45873e519524SHoward Hinnant { 45883e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4589ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45903e519524SHoward Hinnant __h.release(); 45913e519524SHoward Hinnant return; 45923e519524SHoward Hinnant } 45933e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45943e519524SHoward Hinnant { 4595ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45963e519524SHoward Hinnant __d.__incr((value_type*)0); 45973e519524SHoward Hinnant ++__first2; 45983e519524SHoward Hinnant } 45993e519524SHoward Hinnant else 46003e519524SHoward Hinnant { 4601ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46023e519524SHoward Hinnant __d.__incr((value_type*)0); 46033e519524SHoward Hinnant ++__first1; 46043e519524SHoward Hinnant } 46053e519524SHoward Hinnant } 46063e519524SHoward Hinnant} 46073e519524SHoward Hinnant 46083e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46093e519524SHoward Hinnantvoid 46103e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46113e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46123e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46133e519524SHoward Hinnant{ 46143e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46153e519524SHoward Hinnant { 46163e519524SHoward Hinnant if (__first2 == __last2) 46173e519524SHoward Hinnant { 46183e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4619ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46203e519524SHoward Hinnant return; 46213e519524SHoward Hinnant } 46223e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46233e519524SHoward Hinnant { 4624ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46253e519524SHoward Hinnant ++__first2; 46263e519524SHoward Hinnant } 46273e519524SHoward Hinnant else 46283e519524SHoward Hinnant { 4629ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46303e519524SHoward Hinnant ++__first1; 46313e519524SHoward Hinnant } 46323e519524SHoward Hinnant } 46333e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4634ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46353e519524SHoward Hinnant} 46363e519524SHoward Hinnant 46373e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46383e519524SHoward Hinnantvoid 46393e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46403e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46413e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46423e519524SHoward Hinnant 46433e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46443e519524SHoward Hinnantvoid 46453e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46463e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46473e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46483e519524SHoward Hinnant{ 46493e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46503e519524SHoward Hinnant switch (__len) 46513e519524SHoward Hinnant { 46523e519524SHoward Hinnant case 0: 46533e519524SHoward Hinnant return; 46543e519524SHoward Hinnant case 1: 4655ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46563e519524SHoward Hinnant return; 46573e519524SHoward Hinnant case 2: 46583e519524SHoward Hinnant __destruct_n __d(0); 46593e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46603e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46613e519524SHoward Hinnant { 4662ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46633e519524SHoward Hinnant __d.__incr((value_type*)0); 46643e519524SHoward Hinnant ++__first2; 4665ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46663e519524SHoward Hinnant } 46673e519524SHoward Hinnant else 46683e519524SHoward Hinnant { 4669ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46703e519524SHoward Hinnant __d.__incr((value_type*)0); 46713e519524SHoward Hinnant ++__first2; 4672ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46733e519524SHoward Hinnant } 46743e519524SHoward Hinnant __h2.release(); 46753e519524SHoward Hinnant return; 46763e519524SHoward Hinnant } 46773e519524SHoward Hinnant if (__len <= 8) 46783e519524SHoward Hinnant { 46793e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46803e519524SHoward Hinnant return; 46813e519524SHoward Hinnant } 46823e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46833e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46843e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46853e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46863e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46873e519524SHoward Hinnant} 46883e519524SHoward Hinnant 46893e519524SHoward Hinnanttemplate <class _Tp> 46903e519524SHoward Hinnantstruct __stable_sort_switch 46913e519524SHoward Hinnant{ 4692ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46933e519524SHoward Hinnant}; 46943e519524SHoward Hinnant 46953e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46963e519524SHoward Hinnantvoid 46973e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46983e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46993e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 47003e519524SHoward Hinnant{ 47013e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47023e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47033e519524SHoward Hinnant switch (__len) 47043e519524SHoward Hinnant { 47053e519524SHoward Hinnant case 0: 47063e519524SHoward Hinnant case 1: 47073e519524SHoward Hinnant return; 47083e519524SHoward Hinnant case 2: 47093e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47103e519524SHoward Hinnant swap(*__first, *__last); 47113e519524SHoward Hinnant return; 47123e519524SHoward Hinnant } 47133e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47143e519524SHoward Hinnant { 47153e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47163e519524SHoward Hinnant return; 47173e519524SHoward Hinnant } 47183e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47193e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 47203e519524SHoward Hinnant if (__len <= __buff_size) 47213e519524SHoward Hinnant { 47223e519524SHoward Hinnant __destruct_n __d(0); 47233e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47243e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47253e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47263e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47273e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47283e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47293e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47303e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47313e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47323e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47333e519524SHoward Hinnant// __first, __comp); 47343e519524SHoward Hinnant return; 47353e519524SHoward Hinnant } 47363e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47373e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47383e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47393e519524SHoward Hinnant} 47403e519524SHoward Hinnant 47413e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47433e519524SHoward Hinnantvoid 47443e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47453e519524SHoward Hinnant{ 47463e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47473e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47483e519524SHoward Hinnant difference_type __len = __last - __first; 47493e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47503e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47513e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47523e519524SHoward Hinnant { 4753ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47543e519524SHoward Hinnant __h.reset(__buf.first); 47553e519524SHoward Hinnant } 4756aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 47573e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 47583e519524SHoward Hinnant} 47593e519524SHoward Hinnant 47603e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47623e519524SHoward Hinnantvoid 47633e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47643e519524SHoward Hinnant{ 4765ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47663e519524SHoward Hinnant} 47673e519524SHoward Hinnant 47683e519524SHoward Hinnant// is_heap_until 47693e519524SHoward Hinnant 47703e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47711362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 47723e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47733e519524SHoward Hinnant{ 4774ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47753e519524SHoward Hinnant difference_type __len = __last - __first; 47763e519524SHoward Hinnant difference_type __p = 0; 47773e519524SHoward Hinnant difference_type __c = 1; 47783e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47793e519524SHoward Hinnant while (__c < __len) 47803e519524SHoward Hinnant { 47813e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47823e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47833e519524SHoward Hinnant return __cp; 47843e519524SHoward Hinnant ++__c; 47853e519524SHoward Hinnant ++__cp; 47863e519524SHoward Hinnant if (__c == __len) 47873e519524SHoward Hinnant return __last; 47883e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47893e519524SHoward Hinnant return __cp; 47903e519524SHoward Hinnant ++__p; 47913e519524SHoward Hinnant ++__pp; 47923e519524SHoward Hinnant __c = 2 * __p + 1; 47933e519524SHoward Hinnant } 47943e519524SHoward Hinnant return __last; 47953e519524SHoward Hinnant} 47963e519524SHoward Hinnant 47973e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47981362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 47991362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48003e519524SHoward Hinnant_RandomAccessIterator 48013e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 48023e519524SHoward Hinnant{ 4803ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48043e519524SHoward Hinnant} 48053e519524SHoward Hinnant 48063e519524SHoward Hinnant// is_heap 48073e519524SHoward Hinnant 48083e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48091362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 48101362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48113e519524SHoward Hinnantbool 48123e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48133e519524SHoward Hinnant{ 4814ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 48153e519524SHoward Hinnant} 48163e519524SHoward Hinnant 48173e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48181362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 48191362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48203e519524SHoward Hinnantbool 48213e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48223e519524SHoward Hinnant{ 4823ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48243e519524SHoward Hinnant} 48253e519524SHoward Hinnant 48263e519524SHoward Hinnant// push_heap 48273e519524SHoward Hinnant 48283e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48293e519524SHoward Hinnantvoid 48308b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48313e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48323e519524SHoward Hinnant{ 48333e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48343e519524SHoward Hinnant if (__len > 1) 48353e519524SHoward Hinnant { 48363e519524SHoward Hinnant __len = (__len - 2) / 2; 48373e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48383e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48393e519524SHoward Hinnant { 4840ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48413e519524SHoward Hinnant do 48423e519524SHoward Hinnant { 4843ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48443e519524SHoward Hinnant __last = __ptr; 48453e519524SHoward Hinnant if (__len == 0) 48463e519524SHoward Hinnant break; 48473e519524SHoward Hinnant __len = (__len - 1) / 2; 48483e519524SHoward Hinnant __ptr = __first + __len; 48493e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4850ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48513e519524SHoward Hinnant } 48523e519524SHoward Hinnant } 48533e519524SHoward Hinnant} 48543e519524SHoward Hinnant 48553e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48573e519524SHoward Hinnantvoid 48583e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48593e519524SHoward Hinnant{ 4860aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 48618b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 48623e519524SHoward Hinnant} 48633e519524SHoward Hinnant 48643e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48663e519524SHoward Hinnantvoid 48673e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48683e519524SHoward Hinnant{ 4869ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48703e519524SHoward Hinnant} 48713e519524SHoward Hinnant 48723e519524SHoward Hinnant// pop_heap 48733e519524SHoward Hinnant 48743e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48758b512602SDavid Majnemervoid 4876fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4877fd838227SEric Fiselier _Compare __comp, 48788b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48798b512602SDavid Majnemer _RandomAccessIterator __start) 48808b512602SDavid Majnemer{ 48818b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48828b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48838b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48848b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48858b512602SDavid Majnemer difference_type __child = __start - __first; 48868b512602SDavid Majnemer 48878b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48888b512602SDavid Majnemer return; 48898b512602SDavid Majnemer 48908b512602SDavid Majnemer __child = 2 * __child + 1; 48918b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 48928b512602SDavid Majnemer 48938b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48948b512602SDavid Majnemer // right-child exists and is greater than left-child 48958b512602SDavid Majnemer ++__child_i; 48968b512602SDavid Majnemer ++__child; 48978b512602SDavid Majnemer } 48988b512602SDavid Majnemer 48998b512602SDavid Majnemer // check if we are in heap-order 49008b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 49018b512602SDavid Majnemer // we are, __start is larger than it's largest child 49028b512602SDavid Majnemer return; 49038b512602SDavid Majnemer 49048b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49058b512602SDavid Majnemer do 49068b512602SDavid Majnemer { 49078b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49088b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49098b512602SDavid Majnemer __start = __child_i; 49108b512602SDavid Majnemer 49118b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 49128b512602SDavid Majnemer break; 49138b512602SDavid Majnemer 49148b512602SDavid Majnemer // recompute the child based off of the updated parent 49158b512602SDavid Majnemer __child = 2 * __child + 1; 49168b512602SDavid Majnemer __child_i = __first + __child; 49178b512602SDavid Majnemer 49188b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49198b512602SDavid Majnemer // right-child exists and is greater than left-child 49208b512602SDavid Majnemer ++__child_i; 49218b512602SDavid Majnemer ++__child; 49228b512602SDavid Majnemer } 49238b512602SDavid Majnemer 49248b512602SDavid Majnemer // check if we are in heap-order 49258b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49268b512602SDavid Majnemer *__start = _VSTD::move(__top); 49278b512602SDavid Majnemer} 49288b512602SDavid Majnemer 49298b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49313e519524SHoward Hinnantvoid 49323e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49333e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49343e519524SHoward Hinnant{ 49353e519524SHoward Hinnant if (__len > 1) 49363e519524SHoward Hinnant { 49373e519524SHoward Hinnant swap(*__first, *--__last); 49388b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 49393e519524SHoward Hinnant } 49403e519524SHoward Hinnant} 49413e519524SHoward Hinnant 49423e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49443e519524SHoward Hinnantvoid 49453e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49463e519524SHoward Hinnant{ 4947aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 49483e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 49493e519524SHoward Hinnant} 49503e519524SHoward Hinnant 49513e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49533e519524SHoward Hinnantvoid 49543e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49553e519524SHoward Hinnant{ 4956ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49573e519524SHoward Hinnant} 49583e519524SHoward Hinnant 49593e519524SHoward Hinnant// make_heap 49603e519524SHoward Hinnant 49613e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49623e519524SHoward Hinnantvoid 49633e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49643e519524SHoward Hinnant{ 49653e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49663e519524SHoward Hinnant difference_type __n = __last - __first; 49673e519524SHoward Hinnant if (__n > 1) 49683e519524SHoward Hinnant { 49698b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49708b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49718b512602SDavid Majnemer { 49728b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49738b512602SDavid Majnemer } 49743e519524SHoward Hinnant } 49753e519524SHoward Hinnant} 49763e519524SHoward Hinnant 49773e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49793e519524SHoward Hinnantvoid 49803e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49813e519524SHoward Hinnant{ 4982aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 49833e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 49843e519524SHoward Hinnant} 49853e519524SHoward Hinnant 49863e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49883e519524SHoward Hinnantvoid 49893e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49903e519524SHoward Hinnant{ 4991ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49923e519524SHoward Hinnant} 49933e519524SHoward Hinnant 49943e519524SHoward Hinnant// sort_heap 49953e519524SHoward Hinnant 49963e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49973e519524SHoward Hinnantvoid 49983e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49993e519524SHoward Hinnant{ 50003e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50013e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 50023e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50033e519524SHoward Hinnant} 50043e519524SHoward Hinnant 50053e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50073e519524SHoward Hinnantvoid 50083e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50093e519524SHoward Hinnant{ 5010aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50113e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 50123e519524SHoward Hinnant} 50133e519524SHoward Hinnant 50143e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50163e519524SHoward Hinnantvoid 50173e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50183e519524SHoward Hinnant{ 5019ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50203e519524SHoward Hinnant} 50213e519524SHoward Hinnant 50223e519524SHoward Hinnant// partial_sort 50233e519524SHoward Hinnant 50243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50253e519524SHoward Hinnantvoid 50263e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50273e519524SHoward Hinnant _Compare __comp) 50283e519524SHoward Hinnant{ 50293e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 50303e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 50313e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 50323e519524SHoward Hinnant { 50333e519524SHoward Hinnant if (__comp(*__i, *__first)) 50343e519524SHoward Hinnant { 50353e519524SHoward Hinnant swap(*__i, *__first); 50368b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50373e519524SHoward Hinnant } 50383e519524SHoward Hinnant } 50393e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50403e519524SHoward Hinnant} 50413e519524SHoward Hinnant 50423e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50443e519524SHoward Hinnantvoid 50453e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50463e519524SHoward Hinnant _Compare __comp) 50473e519524SHoward Hinnant{ 5048aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50493e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 50503e519524SHoward Hinnant} 50513e519524SHoward Hinnant 50523e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50543e519524SHoward Hinnantvoid 50553e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50563e519524SHoward Hinnant{ 5057ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50583e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50593e519524SHoward Hinnant} 50603e519524SHoward Hinnant 50613e519524SHoward Hinnant// partial_sort_copy 50623e519524SHoward Hinnant 50633e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50643e519524SHoward Hinnant_RandomAccessIterator 50653e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50663e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50673e519524SHoward Hinnant{ 50683e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50693e519524SHoward Hinnant if (__r != __result_last) 50703e519524SHoward Hinnant { 5071910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 50723e519524SHoward Hinnant *__r = *__first; 50733e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50748b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 50753e519524SHoward Hinnant for (; __first != __last; ++__first) 50763e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50773e519524SHoward Hinnant { 50783e519524SHoward Hinnant *__result_first = *__first; 50798b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 50803e519524SHoward Hinnant } 50813e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50823e519524SHoward Hinnant } 50833e519524SHoward Hinnant return __r; 50843e519524SHoward Hinnant} 50853e519524SHoward Hinnant 50863e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50883e519524SHoward Hinnant_RandomAccessIterator 50893e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50903e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50913e519524SHoward Hinnant{ 5092aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50933e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 50943e519524SHoward Hinnant} 50953e519524SHoward Hinnant 50963e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50983e519524SHoward Hinnant_RandomAccessIterator 50993e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51003e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51013e519524SHoward Hinnant{ 5102ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51033e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51043e519524SHoward Hinnant} 51053e519524SHoward Hinnant 51063e519524SHoward Hinnant// nth_element 51073e519524SHoward Hinnant 51083e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51093e519524SHoward Hinnantvoid 51103e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 51113e519524SHoward Hinnant{ 51123e519524SHoward Hinnant // _Compare is known to be a reference type 51133e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51143e519524SHoward Hinnant const difference_type __limit = 7; 51153e519524SHoward Hinnant while (true) 51163e519524SHoward Hinnant { 51173e519524SHoward Hinnant __restart: 5118b34b4819SHoward Hinnant if (__nth == __last) 5119b34b4819SHoward Hinnant return; 51203e519524SHoward Hinnant difference_type __len = __last - __first; 51213e519524SHoward Hinnant switch (__len) 51223e519524SHoward Hinnant { 51233e519524SHoward Hinnant case 0: 51243e519524SHoward Hinnant case 1: 51253e519524SHoward Hinnant return; 51263e519524SHoward Hinnant case 2: 51273e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51283e519524SHoward Hinnant swap(*__first, *__last); 51293e519524SHoward Hinnant return; 51303e519524SHoward Hinnant case 3: 51313e519524SHoward Hinnant { 51323e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5133ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51343e519524SHoward Hinnant return; 51353e519524SHoward Hinnant } 51363e519524SHoward Hinnant } 51373e519524SHoward Hinnant if (__len <= __limit) 51383e519524SHoward Hinnant { 51393e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51403e519524SHoward Hinnant return; 51413e519524SHoward Hinnant } 51423e519524SHoward Hinnant // __len > __limit >= 3 51433e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51443e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5145ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51463e519524SHoward Hinnant // *__m is median 51473e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51483e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51493e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51503e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51513e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51523e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51533e519524SHoward Hinnant // Prime the downward search with a guard. 51543e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51553e519524SHoward Hinnant { 51563e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51573e519524SHoward Hinnant // manually guard downward moving __j against __i 51583e519524SHoward Hinnant while (true) 51593e519524SHoward Hinnant { 51603e519524SHoward Hinnant if (__i == --__j) 51613e519524SHoward Hinnant { 51623e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51633e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51643e519524SHoward Hinnant ++__i; // __first + 1 51653e519524SHoward Hinnant __j = __last; 51663e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51673e519524SHoward Hinnant { 51683e519524SHoward Hinnant while (true) 51693e519524SHoward Hinnant { 51703e519524SHoward Hinnant if (__i == __j) 51713e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51723e519524SHoward Hinnant if (__comp(*__first, *__i)) 51733e519524SHoward Hinnant { 51743e519524SHoward Hinnant swap(*__i, *__j); 51753e519524SHoward Hinnant ++__n_swaps; 51763e519524SHoward Hinnant ++__i; 51773e519524SHoward Hinnant break; 51783e519524SHoward Hinnant } 51793e519524SHoward Hinnant ++__i; 51803e519524SHoward Hinnant } 51813e519524SHoward Hinnant } 51823e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51833e519524SHoward Hinnant if (__i == __j) 51843e519524SHoward Hinnant return; 51853e519524SHoward Hinnant while (true) 51863e519524SHoward Hinnant { 51873e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51883e519524SHoward Hinnant ++__i; 51893e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51903e519524SHoward Hinnant ; 51913e519524SHoward Hinnant if (__i >= __j) 51923e519524SHoward Hinnant break; 51933e519524SHoward Hinnant swap(*__i, *__j); 51943e519524SHoward Hinnant ++__n_swaps; 51953e519524SHoward Hinnant ++__i; 51963e519524SHoward Hinnant } 51973e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51983e519524SHoward Hinnant // The first part is sorted, 51993e519524SHoward Hinnant if (__nth < __i) 52003e519524SHoward Hinnant return; 52013e519524SHoward Hinnant // __nth_element the secod part 52023e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52033e519524SHoward Hinnant __first = __i; 52043e519524SHoward Hinnant goto __restart; 52053e519524SHoward Hinnant } 52063e519524SHoward Hinnant if (__comp(*__j, *__m)) 52073e519524SHoward Hinnant { 52083e519524SHoward Hinnant swap(*__i, *__j); 52093e519524SHoward Hinnant ++__n_swaps; 52103e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 52113e519524SHoward Hinnant } 52123e519524SHoward Hinnant } 52133e519524SHoward Hinnant } 52143e519524SHoward Hinnant ++__i; 52153e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52163e519524SHoward Hinnant // if not yet partitioned... 52173e519524SHoward Hinnant if (__i < __j) 52183e519524SHoward Hinnant { 52193e519524SHoward Hinnant // known that *(__i - 1) < *__m 52203e519524SHoward Hinnant while (true) 52213e519524SHoward Hinnant { 52223e519524SHoward Hinnant // __m still guards upward moving __i 52233e519524SHoward Hinnant while (__comp(*__i, *__m)) 52243e519524SHoward Hinnant ++__i; 52253e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52263e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52273e519524SHoward Hinnant ; 52283e519524SHoward Hinnant if (__i >= __j) 52293e519524SHoward Hinnant break; 52303e519524SHoward Hinnant swap(*__i, *__j); 52313e519524SHoward Hinnant ++__n_swaps; 52323e519524SHoward Hinnant // It is known that __m != __j 52333e519524SHoward Hinnant // If __m just moved, follow it 52343e519524SHoward Hinnant if (__m == __i) 52353e519524SHoward Hinnant __m = __j; 52363e519524SHoward Hinnant ++__i; 52373e519524SHoward Hinnant } 52383e519524SHoward Hinnant } 52393e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52403e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52413e519524SHoward Hinnant { 52423e519524SHoward Hinnant swap(*__i, *__m); 52433e519524SHoward Hinnant ++__n_swaps; 52443e519524SHoward Hinnant } 52453e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52463e519524SHoward Hinnant if (__nth == __i) 52473e519524SHoward Hinnant return; 52483e519524SHoward Hinnant if (__n_swaps == 0) 52493e519524SHoward Hinnant { 52503e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52513e519524SHoward Hinnant if (__nth < __i) 52523e519524SHoward Hinnant { 52533e519524SHoward Hinnant // Check for [__first, __i) already sorted 52543e519524SHoward Hinnant __j = __m = __first; 52553e519524SHoward Hinnant while (++__j != __i) 52563e519524SHoward Hinnant { 52573e519524SHoward Hinnant if (__comp(*__j, *__m)) 52583e519524SHoward Hinnant // not yet sorted, so sort 52593e519524SHoward Hinnant goto not_sorted; 52603e519524SHoward Hinnant __m = __j; 52613e519524SHoward Hinnant } 52623e519524SHoward Hinnant // [__first, __i) sorted 52633e519524SHoward Hinnant return; 52643e519524SHoward Hinnant } 52653e519524SHoward Hinnant else 52663e519524SHoward Hinnant { 52673e519524SHoward Hinnant // Check for [__i, __last) already sorted 52683e519524SHoward Hinnant __j = __m = __i; 52693e519524SHoward Hinnant while (++__j != __last) 52703e519524SHoward Hinnant { 52713e519524SHoward Hinnant if (__comp(*__j, *__m)) 52723e519524SHoward Hinnant // not yet sorted, so sort 52733e519524SHoward Hinnant goto not_sorted; 52743e519524SHoward Hinnant __m = __j; 52753e519524SHoward Hinnant } 52763e519524SHoward Hinnant // [__i, __last) sorted 52773e519524SHoward Hinnant return; 52783e519524SHoward Hinnant } 52793e519524SHoward Hinnant } 52803e519524SHoward Hinnantnot_sorted: 52813e519524SHoward Hinnant // __nth_element on range containing __nth 52823e519524SHoward Hinnant if (__nth < __i) 52833e519524SHoward Hinnant { 52843e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52853e519524SHoward Hinnant __last = __i; 52863e519524SHoward Hinnant } 52873e519524SHoward Hinnant else 52883e519524SHoward Hinnant { 52893e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52903e519524SHoward Hinnant __first = ++__i; 52913e519524SHoward Hinnant } 52923e519524SHoward Hinnant } 52933e519524SHoward Hinnant} 52943e519524SHoward Hinnant 52953e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52973e519524SHoward Hinnantvoid 52983e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52993e519524SHoward Hinnant{ 5300aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 53013e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 53023e519524SHoward Hinnant} 53033e519524SHoward Hinnant 53043e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 53053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53063e519524SHoward Hinnantvoid 53073e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 53083e519524SHoward Hinnant{ 5309ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 53103e519524SHoward Hinnant} 53113e519524SHoward Hinnant 53123e519524SHoward Hinnant// includes 53133e519524SHoward Hinnant 53143e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53158da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 53163e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53173e519524SHoward Hinnant _Compare __comp) 53183e519524SHoward Hinnant{ 53193e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53203e519524SHoward Hinnant { 53213e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53223e519524SHoward Hinnant return false; 53233e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53243e519524SHoward Hinnant ++__first2; 53253e519524SHoward Hinnant } 53263e519524SHoward Hinnant return true; 53273e519524SHoward Hinnant} 53283e519524SHoward Hinnant 53293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53301362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 53311362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53323e519524SHoward Hinnantbool 53333e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53343e519524SHoward Hinnant _Compare __comp) 53353e519524SHoward Hinnant{ 5336aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 53373e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 53383e519524SHoward Hinnant} 53393e519524SHoward Hinnant 53403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53411362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 53421362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53433e519524SHoward Hinnantbool 53443e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53453e519524SHoward Hinnant{ 5346ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53473e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53483e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53493e519524SHoward Hinnant} 53503e519524SHoward Hinnant 53513e519524SHoward Hinnant// set_union 53523e519524SHoward Hinnant 53533e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53543e519524SHoward Hinnant_OutputIterator 53553e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53563e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53573e519524SHoward Hinnant{ 53583e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53593e519524SHoward Hinnant { 53603e519524SHoward Hinnant if (__first2 == __last2) 5361ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53623e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53633e519524SHoward Hinnant { 53643e519524SHoward Hinnant *__result = *__first2; 53653e519524SHoward Hinnant ++__first2; 53663e519524SHoward Hinnant } 53673e519524SHoward Hinnant else 53683e519524SHoward Hinnant { 53693e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53703e519524SHoward Hinnant ++__first2; 537105da5b02SMarshall Clow *__result = *__first1; 53723e519524SHoward Hinnant ++__first1; 53733e519524SHoward Hinnant } 53743e519524SHoward Hinnant } 5375ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53763e519524SHoward Hinnant} 53773e519524SHoward Hinnant 53783e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53803e519524SHoward Hinnant_OutputIterator 53813e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53823e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53833e519524SHoward Hinnant{ 5384aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 53853e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 53863e519524SHoward Hinnant} 53873e519524SHoward Hinnant 53883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53903e519524SHoward Hinnant_OutputIterator 53913e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53933e519524SHoward Hinnant{ 5394ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53953e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53963e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53973e519524SHoward Hinnant} 53983e519524SHoward Hinnant 53993e519524SHoward Hinnant// set_intersection 54003e519524SHoward Hinnant 54013e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54028da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 54033e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54043e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54053e519524SHoward Hinnant{ 54063e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54073e519524SHoward Hinnant { 54083e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54093e519524SHoward Hinnant ++__first1; 54103e519524SHoward Hinnant else 54113e519524SHoward Hinnant { 54123e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54133e519524SHoward Hinnant { 54143e519524SHoward Hinnant *__result = *__first1; 54153e519524SHoward Hinnant ++__result; 54163e519524SHoward Hinnant ++__first1; 54173e519524SHoward Hinnant } 54183e519524SHoward Hinnant ++__first2; 54193e519524SHoward Hinnant } 54203e519524SHoward Hinnant } 54213e519524SHoward Hinnant return __result; 54223e519524SHoward Hinnant} 54233e519524SHoward Hinnant 54243e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54258da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54263e519524SHoward Hinnant_OutputIterator 54273e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54283e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54293e519524SHoward Hinnant{ 5430aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 54313e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 54323e519524SHoward Hinnant} 54333e519524SHoward Hinnant 54343e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54358da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54363e519524SHoward Hinnant_OutputIterator 54373e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54383e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54393e519524SHoward Hinnant{ 5440ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54413e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54423e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54433e519524SHoward Hinnant} 54443e519524SHoward Hinnant 54453e519524SHoward Hinnant// set_difference 54463e519524SHoward Hinnant 54473e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54483e519524SHoward Hinnant_OutputIterator 54493e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54503e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54513e519524SHoward Hinnant{ 54523e519524SHoward Hinnant while (__first1 != __last1) 54533e519524SHoward Hinnant { 54543e519524SHoward Hinnant if (__first2 == __last2) 5455ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54563e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54573e519524SHoward Hinnant { 54583e519524SHoward Hinnant *__result = *__first1; 54593e519524SHoward Hinnant ++__result; 54603e519524SHoward Hinnant ++__first1; 54613e519524SHoward Hinnant } 54623e519524SHoward Hinnant else 54633e519524SHoward Hinnant { 54643e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54653e519524SHoward Hinnant ++__first1; 54663e519524SHoward Hinnant ++__first2; 54673e519524SHoward Hinnant } 54683e519524SHoward Hinnant } 54693e519524SHoward Hinnant return __result; 54703e519524SHoward Hinnant} 54713e519524SHoward Hinnant 54723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54743e519524SHoward Hinnant_OutputIterator 54753e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54773e519524SHoward Hinnant{ 5478aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 54793e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 54803e519524SHoward Hinnant} 54813e519524SHoward Hinnant 54823e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54843e519524SHoward Hinnant_OutputIterator 54853e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54863e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54873e519524SHoward Hinnant{ 5488ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54893e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54903e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54913e519524SHoward Hinnant} 54923e519524SHoward Hinnant 54933e519524SHoward Hinnant// set_symmetric_difference 54943e519524SHoward Hinnant 54953e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54963e519524SHoward Hinnant_OutputIterator 54973e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54983e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54993e519524SHoward Hinnant{ 55003e519524SHoward Hinnant while (__first1 != __last1) 55013e519524SHoward Hinnant { 55023e519524SHoward Hinnant if (__first2 == __last2) 5503ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55043e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55053e519524SHoward Hinnant { 55063e519524SHoward Hinnant *__result = *__first1; 55073e519524SHoward Hinnant ++__result; 55083e519524SHoward Hinnant ++__first1; 55093e519524SHoward Hinnant } 55103e519524SHoward Hinnant else 55113e519524SHoward Hinnant { 55123e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55133e519524SHoward Hinnant { 55143e519524SHoward Hinnant *__result = *__first2; 55153e519524SHoward Hinnant ++__result; 55163e519524SHoward Hinnant } 55173e519524SHoward Hinnant else 55183e519524SHoward Hinnant ++__first1; 55193e519524SHoward Hinnant ++__first2; 55203e519524SHoward Hinnant } 55213e519524SHoward Hinnant } 5522ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55233e519524SHoward Hinnant} 55243e519524SHoward Hinnant 55253e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55273e519524SHoward Hinnant_OutputIterator 55283e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55293e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55303e519524SHoward Hinnant{ 5531aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55323e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 55333e519524SHoward Hinnant} 55343e519524SHoward Hinnant 55353e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55373e519524SHoward Hinnant_OutputIterator 55383e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55403e519524SHoward Hinnant{ 5541ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55423e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55433e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55443e519524SHoward Hinnant} 55453e519524SHoward Hinnant 55463e519524SHoward Hinnant// lexicographical_compare 55473e519524SHoward Hinnant 55483e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55491b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 55503e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55513e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55523e519524SHoward Hinnant{ 5553910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 55543e519524SHoward Hinnant { 55553e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55563e519524SHoward Hinnant return true; 55573e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55583e519524SHoward Hinnant return false; 55593e519524SHoward Hinnant } 55603e519524SHoward Hinnant return false; 55613e519524SHoward Hinnant} 55623e519524SHoward Hinnant 55633e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55641362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 55651362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55663e519524SHoward Hinnantbool 55673e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55683e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55693e519524SHoward Hinnant{ 5570aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55713e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 55723e519524SHoward Hinnant} 55733e519524SHoward Hinnant 55743e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55751362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 55761362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55773e519524SHoward Hinnantbool 55783e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55803e519524SHoward Hinnant{ 5581ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55823e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55833e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55843e519524SHoward Hinnant} 55853e519524SHoward Hinnant 55863e519524SHoward Hinnant// next_permutation 55873e519524SHoward Hinnant 55883e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55893e519524SHoward Hinnantbool 55903e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55913e519524SHoward Hinnant{ 55923e519524SHoward Hinnant _BidirectionalIterator __i = __last; 55933e519524SHoward Hinnant if (__first == __last || __first == --__i) 55943e519524SHoward Hinnant return false; 55953e519524SHoward Hinnant while (true) 55963e519524SHoward Hinnant { 55973e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 55983e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 55993e519524SHoward Hinnant { 56003e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56013e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56023e519524SHoward Hinnant ; 56033e519524SHoward Hinnant swap(*__i, *__j); 5604ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56053e519524SHoward Hinnant return true; 56063e519524SHoward Hinnant } 56073e519524SHoward Hinnant if (__i == __first) 56083e519524SHoward Hinnant { 5609ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56103e519524SHoward Hinnant return false; 56113e519524SHoward Hinnant } 56123e519524SHoward Hinnant } 56133e519524SHoward Hinnant} 56143e519524SHoward Hinnant 56153e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56173e519524SHoward Hinnantbool 56183e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56193e519524SHoward Hinnant{ 5620aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 56213e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 56223e519524SHoward Hinnant} 56233e519524SHoward Hinnant 56243e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56263e519524SHoward Hinnantbool 56273e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56283e519524SHoward Hinnant{ 5629ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56303e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56313e519524SHoward Hinnant} 56323e519524SHoward Hinnant 56333e519524SHoward Hinnant// prev_permutation 56343e519524SHoward Hinnant 56353e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56363e519524SHoward Hinnantbool 56373e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56383e519524SHoward Hinnant{ 56393e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56403e519524SHoward Hinnant if (__first == __last || __first == --__i) 56413e519524SHoward Hinnant return false; 56423e519524SHoward Hinnant while (true) 56433e519524SHoward Hinnant { 56443e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56453e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56463e519524SHoward Hinnant { 56473e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56483e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56493e519524SHoward Hinnant ; 56503e519524SHoward Hinnant swap(*__i, *__j); 5651ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56523e519524SHoward Hinnant return true; 56533e519524SHoward Hinnant } 56543e519524SHoward Hinnant if (__i == __first) 56553e519524SHoward Hinnant { 5656ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56573e519524SHoward Hinnant return false; 56583e519524SHoward Hinnant } 56593e519524SHoward Hinnant } 56603e519524SHoward Hinnant} 56613e519524SHoward Hinnant 56623e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56643e519524SHoward Hinnantbool 56653e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56663e519524SHoward Hinnant{ 5667aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 56683e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 56693e519524SHoward Hinnant} 56703e519524SHoward Hinnant 56713e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56733e519524SHoward Hinnantbool 56743e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56753e519524SHoward Hinnant{ 5676ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 56773e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56783e519524SHoward Hinnant} 56793e519524SHoward Hinnant 56803e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 56813e519524SHoward Hinnant 5682a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5683a016efb1SEric Fiselier 56843e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5685