1*0b57cec5SDimitry Andric// -*- C++ -*- 2*0b57cec5SDimitry Andric//===-------------------------- algorithm ---------------------------------===// 3*0b57cec5SDimitry Andric// 4*0b57cec5SDimitry Andric// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5*0b57cec5SDimitry Andric// See https://llvm.org/LICENSE.txt for license information. 6*0b57cec5SDimitry Andric// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7*0b57cec5SDimitry Andric// 8*0b57cec5SDimitry Andric//===----------------------------------------------------------------------===// 9*0b57cec5SDimitry Andric 10*0b57cec5SDimitry Andric#ifndef _LIBCPP_ALGORITHM 11*0b57cec5SDimitry Andric#define _LIBCPP_ALGORITHM 12*0b57cec5SDimitry Andric 13*0b57cec5SDimitry Andric/* 14*0b57cec5SDimitry Andric algorithm synopsis 15*0b57cec5SDimitry Andric 16*0b57cec5SDimitry Andric#include <initializer_list> 17*0b57cec5SDimitry Andric 18*0b57cec5SDimitry Andricnamespace std 19*0b57cec5SDimitry Andric{ 20*0b57cec5SDimitry Andric 21*0b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 22*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 23*0b57cec5SDimitry Andric all_of(InputIterator first, InputIterator last, Predicate pred); 24*0b57cec5SDimitry Andric 25*0b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 26*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 27*0b57cec5SDimitry Andric any_of(InputIterator first, InputIterator last, Predicate pred); 28*0b57cec5SDimitry Andric 29*0b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 30*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 31*0b57cec5SDimitry Andric none_of(InputIterator first, InputIterator last, Predicate pred); 32*0b57cec5SDimitry Andric 33*0b57cec5SDimitry Andrictemplate <class InputIterator, class Function> 34*0b57cec5SDimitry Andric constexpr Function // constexpr in C++20 35*0b57cec5SDimitry Andric for_each(InputIterator first, InputIterator last, Function f); 36*0b57cec5SDimitry Andric 37*0b57cec5SDimitry Andrictemplate<class InputIterator, class Size, class Function> 38*0b57cec5SDimitry Andric constexpr InputIterator // constexpr in C++20 39*0b57cec5SDimitry Andric for_each_n(InputIterator first, Size n, Function f); // C++17 40*0b57cec5SDimitry Andric 41*0b57cec5SDimitry Andrictemplate <class InputIterator, class T> 42*0b57cec5SDimitry Andric constexpr InputIterator // constexpr in C++20 43*0b57cec5SDimitry Andric find(InputIterator first, InputIterator last, const T& value); 44*0b57cec5SDimitry Andric 45*0b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 46*0b57cec5SDimitry Andric constexpr InputIterator // constexpr in C++20 47*0b57cec5SDimitry Andric find_if(InputIterator first, InputIterator last, Predicate pred); 48*0b57cec5SDimitry Andric 49*0b57cec5SDimitry Andrictemplate<class InputIterator, class Predicate> 50*0b57cec5SDimitry Andric InputIterator // constexpr in C++20 51*0b57cec5SDimitry Andric find_if_not(InputIterator first, InputIterator last, Predicate pred); 52*0b57cec5SDimitry Andric 53*0b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 54*0b57cec5SDimitry Andric ForwardIterator1 // constexpr in C++20 55*0b57cec5SDimitry Andric find_end(ForwardIterator1 first1, ForwardIterator1 last1, 56*0b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2); 57*0b57cec5SDimitry Andric 58*0b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 59*0b57cec5SDimitry Andric ForwardIterator1 // constexpr in C++20 60*0b57cec5SDimitry Andric find_end(ForwardIterator1 first1, ForwardIterator1 last1, 61*0b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 62*0b57cec5SDimitry Andric 63*0b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 64*0b57cec5SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 65*0b57cec5SDimitry Andric find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 66*0b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2); 67*0b57cec5SDimitry Andric 68*0b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 69*0b57cec5SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 70*0b57cec5SDimitry Andric find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 71*0b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 72*0b57cec5SDimitry Andric 73*0b57cec5SDimitry Andrictemplate <class ForwardIterator> 74*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 75*0b57cec5SDimitry Andric adjacent_find(ForwardIterator first, ForwardIterator last); 76*0b57cec5SDimitry Andric 77*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class BinaryPredicate> 78*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 79*0b57cec5SDimitry Andric adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 80*0b57cec5SDimitry Andric 81*0b57cec5SDimitry Andrictemplate <class InputIterator, class T> 82*0b57cec5SDimitry Andric constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 83*0b57cec5SDimitry Andric count(InputIterator first, InputIterator last, const T& value); 84*0b57cec5SDimitry Andric 85*0b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 86*0b57cec5SDimitry Andric constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 87*0b57cec5SDimitry Andric count_if(InputIterator first, InputIterator last, Predicate pred); 88*0b57cec5SDimitry Andric 89*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 90*0b57cec5SDimitry Andric constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 91*0b57cec5SDimitry Andric mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 92*0b57cec5SDimitry Andric 93*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 94*0b57cec5SDimitry Andric constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 95*0b57cec5SDimitry Andric mismatch(InputIterator1 first1, InputIterator1 last1, 96*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2); // **C++14** 97*0b57cec5SDimitry Andric 98*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 99*0b57cec5SDimitry Andric constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 100*0b57cec5SDimitry Andric mismatch(InputIterator1 first1, InputIterator1 last1, 101*0b57cec5SDimitry Andric InputIterator2 first2, BinaryPredicate pred); 102*0b57cec5SDimitry Andric 103*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 104*0b57cec5SDimitry Andric constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 105*0b57cec5SDimitry Andric mismatch(InputIterator1 first1, InputIterator1 last1, 106*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, 107*0b57cec5SDimitry Andric BinaryPredicate pred); // **C++14** 108*0b57cec5SDimitry Andric 109*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 110*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 111*0b57cec5SDimitry Andric equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 112*0b57cec5SDimitry Andric 113*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 114*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 115*0b57cec5SDimitry Andric equal(InputIterator1 first1, InputIterator1 last1, 116*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2); // **C++14** 117*0b57cec5SDimitry Andric 118*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 119*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 120*0b57cec5SDimitry Andric equal(InputIterator1 first1, InputIterator1 last1, 121*0b57cec5SDimitry Andric InputIterator2 first2, BinaryPredicate pred); 122*0b57cec5SDimitry Andric 123*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 124*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 125*0b57cec5SDimitry Andric equal(InputIterator1 first1, InputIterator1 last1, 126*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, 127*0b57cec5SDimitry Andric BinaryPredicate pred); // **C++14** 128*0b57cec5SDimitry Andric 129*0b57cec5SDimitry Andrictemplate<class ForwardIterator1, class ForwardIterator2> 130*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 131*0b57cec5SDimitry Andric is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 132*0b57cec5SDimitry Andric ForwardIterator2 first2); 133*0b57cec5SDimitry Andric 134*0b57cec5SDimitry Andrictemplate<class ForwardIterator1, class ForwardIterator2> 135*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 136*0b57cec5SDimitry Andric is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 137*0b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 138*0b57cec5SDimitry Andric 139*0b57cec5SDimitry Andrictemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 140*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 141*0b57cec5SDimitry Andric is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 142*0b57cec5SDimitry Andric ForwardIterator2 first2, BinaryPredicate pred); 143*0b57cec5SDimitry Andric 144*0b57cec5SDimitry Andrictemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 145*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 146*0b57cec5SDimitry Andric is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 147*0b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2, 148*0b57cec5SDimitry Andric BinaryPredicate pred); // **C++14** 149*0b57cec5SDimitry Andric 150*0b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 151*0b57cec5SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 152*0b57cec5SDimitry Andric search(ForwardIterator1 first1, ForwardIterator1 last1, 153*0b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2); 154*0b57cec5SDimitry Andric 155*0b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 156*0b57cec5SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 157*0b57cec5SDimitry Andric search(ForwardIterator1 first1, ForwardIterator1 last1, 158*0b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 159*0b57cec5SDimitry Andric 160*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Size, class T> 161*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 162*0b57cec5SDimitry Andric search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 163*0b57cec5SDimitry Andric 164*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 165*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 166*0b57cec5SDimitry Andric search_n(ForwardIterator first, ForwardIterator last, 167*0b57cec5SDimitry Andric Size count, const T& value, BinaryPredicate pred); 168*0b57cec5SDimitry Andric 169*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator> 170*0b57cec5SDimitry Andric OutputIterator 171*0b57cec5SDimitry Andric copy(InputIterator first, InputIterator last, OutputIterator result); 172*0b57cec5SDimitry Andric 173*0b57cec5SDimitry Andrictemplate<class InputIterator, class OutputIterator, class Predicate> 174*0b57cec5SDimitry Andric OutputIterator 175*0b57cec5SDimitry Andric copy_if(InputIterator first, InputIterator last, 176*0b57cec5SDimitry Andric OutputIterator result, Predicate pred); 177*0b57cec5SDimitry Andric 178*0b57cec5SDimitry Andrictemplate<class InputIterator, class Size, class OutputIterator> 179*0b57cec5SDimitry Andric OutputIterator 180*0b57cec5SDimitry Andric copy_n(InputIterator first, Size n, OutputIterator result); 181*0b57cec5SDimitry Andric 182*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator1, class BidirectionalIterator2> 183*0b57cec5SDimitry Andric BidirectionalIterator2 184*0b57cec5SDimitry Andric copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 185*0b57cec5SDimitry Andric BidirectionalIterator2 result); 186*0b57cec5SDimitry Andric 187*0b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 188*0b57cec5SDimitry Andric ForwardIterator2 189*0b57cec5SDimitry Andric swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 190*0b57cec5SDimitry Andric 191*0b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 192*0b57cec5SDimitry Andric void 193*0b57cec5SDimitry Andric iter_swap(ForwardIterator1 a, ForwardIterator2 b); 194*0b57cec5SDimitry Andric 195*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class UnaryOperation> 196*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 197*0b57cec5SDimitry Andric transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 198*0b57cec5SDimitry Andric 199*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 200*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 201*0b57cec5SDimitry Andric transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 202*0b57cec5SDimitry Andric OutputIterator result, BinaryOperation binary_op); 203*0b57cec5SDimitry Andric 204*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 205*0b57cec5SDimitry Andric constexpr void // constexpr in C++20 206*0b57cec5SDimitry Andric replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 207*0b57cec5SDimitry Andric 208*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Predicate, class T> 209*0b57cec5SDimitry Andric constexpr void // constexpr in C++20 210*0b57cec5SDimitry Andric replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 211*0b57cec5SDimitry Andric 212*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class T> 213*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 214*0b57cec5SDimitry Andric replace_copy(InputIterator first, InputIterator last, OutputIterator result, 215*0b57cec5SDimitry Andric const T& old_value, const T& new_value); 216*0b57cec5SDimitry Andric 217*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class Predicate, class T> 218*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 219*0b57cec5SDimitry Andric replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 220*0b57cec5SDimitry Andric 221*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 222*0b57cec5SDimitry Andric constexpr void // constexpr in C++20 223*0b57cec5SDimitry Andric fill(ForwardIterator first, ForwardIterator last, const T& value); 224*0b57cec5SDimitry Andric 225*0b57cec5SDimitry Andrictemplate <class OutputIterator, class Size, class T> 226*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 227*0b57cec5SDimitry Andric fill_n(OutputIterator first, Size n, const T& value); 228*0b57cec5SDimitry Andric 229*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Generator> 230*0b57cec5SDimitry Andric constexpr void // constexpr in C++20 231*0b57cec5SDimitry Andric generate(ForwardIterator first, ForwardIterator last, Generator gen); 232*0b57cec5SDimitry Andric 233*0b57cec5SDimitry Andrictemplate <class OutputIterator, class Size, class Generator> 234*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 235*0b57cec5SDimitry Andric generate_n(OutputIterator first, Size n, Generator gen); 236*0b57cec5SDimitry Andric 237*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 238*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 239*0b57cec5SDimitry Andric remove(ForwardIterator first, ForwardIterator last, const T& value); 240*0b57cec5SDimitry Andric 241*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Predicate> 242*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 243*0b57cec5SDimitry Andric remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 244*0b57cec5SDimitry Andric 245*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class T> 246*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 247*0b57cec5SDimitry Andric remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 248*0b57cec5SDimitry Andric 249*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class Predicate> 250*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 251*0b57cec5SDimitry Andric remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 252*0b57cec5SDimitry Andric 253*0b57cec5SDimitry Andrictemplate <class ForwardIterator> 254*0b57cec5SDimitry Andric ForwardIterator 255*0b57cec5SDimitry Andric unique(ForwardIterator first, ForwardIterator last); 256*0b57cec5SDimitry Andric 257*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class BinaryPredicate> 258*0b57cec5SDimitry Andric ForwardIterator 259*0b57cec5SDimitry Andric unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 260*0b57cec5SDimitry Andric 261*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator> 262*0b57cec5SDimitry Andric OutputIterator 263*0b57cec5SDimitry Andric unique_copy(InputIterator first, InputIterator last, OutputIterator result); 264*0b57cec5SDimitry Andric 265*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 266*0b57cec5SDimitry Andric OutputIterator 267*0b57cec5SDimitry Andric unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 268*0b57cec5SDimitry Andric 269*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator> 270*0b57cec5SDimitry Andric void 271*0b57cec5SDimitry Andric reverse(BidirectionalIterator first, BidirectionalIterator last); 272*0b57cec5SDimitry Andric 273*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator, class OutputIterator> 274*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 275*0b57cec5SDimitry Andric reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 276*0b57cec5SDimitry Andric 277*0b57cec5SDimitry Andrictemplate <class ForwardIterator> 278*0b57cec5SDimitry Andric ForwardIterator 279*0b57cec5SDimitry Andric rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 280*0b57cec5SDimitry Andric 281*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class OutputIterator> 282*0b57cec5SDimitry Andric OutputIterator 283*0b57cec5SDimitry Andric rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 284*0b57cec5SDimitry Andric 285*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 286*0b57cec5SDimitry Andric void 287*0b57cec5SDimitry Andric random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 288*0b57cec5SDimitry Andric 289*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class RandomNumberGenerator> 290*0b57cec5SDimitry Andric void 291*0b57cec5SDimitry Andric random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 292*0b57cec5SDimitry Andric RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 293*0b57cec5SDimitry Andric 294*0b57cec5SDimitry Andrictemplate<class PopulationIterator, class SampleIterator, 295*0b57cec5SDimitry Andric class Distance, class UniformRandomBitGenerator> 296*0b57cec5SDimitry Andric SampleIterator sample(PopulationIterator first, PopulationIterator last, 297*0b57cec5SDimitry Andric SampleIterator out, Distance n, 298*0b57cec5SDimitry Andric UniformRandomBitGenerator&& g); // C++17 299*0b57cec5SDimitry Andric 300*0b57cec5SDimitry Andrictemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 301*0b57cec5SDimitry Andric void shuffle(RandomAccessIterator first, RandomAccessIterator last, 302*0b57cec5SDimitry Andric UniformRandomNumberGenerator&& g); 303*0b57cec5SDimitry Andric 304*0b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 305*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 306*0b57cec5SDimitry Andric is_partitioned(InputIterator first, InputIterator last, Predicate pred); 307*0b57cec5SDimitry Andric 308*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Predicate> 309*0b57cec5SDimitry Andric ForwardIterator 310*0b57cec5SDimitry Andric partition(ForwardIterator first, ForwardIterator last, Predicate pred); 311*0b57cec5SDimitry Andric 312*0b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator1, 313*0b57cec5SDimitry Andric class OutputIterator2, class Predicate> 314*0b57cec5SDimitry Andric constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 315*0b57cec5SDimitry Andric partition_copy(InputIterator first, InputIterator last, 316*0b57cec5SDimitry Andric OutputIterator1 out_true, OutputIterator2 out_false, 317*0b57cec5SDimitry Andric Predicate pred); 318*0b57cec5SDimitry Andric 319*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Predicate> 320*0b57cec5SDimitry Andric ForwardIterator 321*0b57cec5SDimitry Andric stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 322*0b57cec5SDimitry Andric 323*0b57cec5SDimitry Andrictemplate<class ForwardIterator, class Predicate> 324*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 325*0b57cec5SDimitry Andric partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 326*0b57cec5SDimitry Andric 327*0b57cec5SDimitry Andrictemplate <class ForwardIterator> 328*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 329*0b57cec5SDimitry Andric is_sorted(ForwardIterator first, ForwardIterator last); 330*0b57cec5SDimitry Andric 331*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Compare> 332*0b57cec5SDimitry Andric bool 333*0b57cec5SDimitry Andric is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 334*0b57cec5SDimitry Andric 335*0b57cec5SDimitry Andrictemplate<class ForwardIterator> 336*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 337*0b57cec5SDimitry Andric is_sorted_until(ForwardIterator first, ForwardIterator last); 338*0b57cec5SDimitry Andric 339*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Compare> 340*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 341*0b57cec5SDimitry Andric is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 342*0b57cec5SDimitry Andric 343*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 344*0b57cec5SDimitry Andric void 345*0b57cec5SDimitry Andric sort(RandomAccessIterator first, RandomAccessIterator last); 346*0b57cec5SDimitry Andric 347*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 348*0b57cec5SDimitry Andric void 349*0b57cec5SDimitry Andric sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 350*0b57cec5SDimitry Andric 351*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 352*0b57cec5SDimitry Andric void 353*0b57cec5SDimitry Andric stable_sort(RandomAccessIterator first, RandomAccessIterator last); 354*0b57cec5SDimitry Andric 355*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 356*0b57cec5SDimitry Andric void 357*0b57cec5SDimitry Andric stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 358*0b57cec5SDimitry Andric 359*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 360*0b57cec5SDimitry Andric void 361*0b57cec5SDimitry Andric partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 362*0b57cec5SDimitry Andric 363*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 364*0b57cec5SDimitry Andric void 365*0b57cec5SDimitry Andric partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 366*0b57cec5SDimitry Andric 367*0b57cec5SDimitry Andrictemplate <class InputIterator, class RandomAccessIterator> 368*0b57cec5SDimitry Andric RandomAccessIterator 369*0b57cec5SDimitry Andric partial_sort_copy(InputIterator first, InputIterator last, 370*0b57cec5SDimitry Andric RandomAccessIterator result_first, RandomAccessIterator result_last); 371*0b57cec5SDimitry Andric 372*0b57cec5SDimitry Andrictemplate <class InputIterator, class RandomAccessIterator, class Compare> 373*0b57cec5SDimitry Andric RandomAccessIterator 374*0b57cec5SDimitry Andric partial_sort_copy(InputIterator first, InputIterator last, 375*0b57cec5SDimitry Andric RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 376*0b57cec5SDimitry Andric 377*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 378*0b57cec5SDimitry Andric void 379*0b57cec5SDimitry Andric nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 380*0b57cec5SDimitry Andric 381*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 382*0b57cec5SDimitry Andric void 383*0b57cec5SDimitry Andric nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 384*0b57cec5SDimitry Andric 385*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 386*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 387*0b57cec5SDimitry Andric lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 388*0b57cec5SDimitry Andric 389*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T, class Compare> 390*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 391*0b57cec5SDimitry Andric lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 392*0b57cec5SDimitry Andric 393*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 394*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 395*0b57cec5SDimitry Andric upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 396*0b57cec5SDimitry Andric 397*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T, class Compare> 398*0b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 399*0b57cec5SDimitry Andric upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 400*0b57cec5SDimitry Andric 401*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 402*0b57cec5SDimitry Andric constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 403*0b57cec5SDimitry Andric equal_range(ForwardIterator first, ForwardIterator last, const T& value); 404*0b57cec5SDimitry Andric 405*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T, class Compare> 406*0b57cec5SDimitry Andric constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 407*0b57cec5SDimitry Andric equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 408*0b57cec5SDimitry Andric 409*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 410*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 411*0b57cec5SDimitry Andric binary_search(ForwardIterator first, ForwardIterator last, const T& value); 412*0b57cec5SDimitry Andric 413*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class T, class Compare> 414*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 415*0b57cec5SDimitry Andric binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 416*0b57cec5SDimitry Andric 417*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 418*0b57cec5SDimitry Andric OutputIterator 419*0b57cec5SDimitry Andric merge(InputIterator1 first1, InputIterator1 last1, 420*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 421*0b57cec5SDimitry Andric 422*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 423*0b57cec5SDimitry Andric OutputIterator 424*0b57cec5SDimitry Andric merge(InputIterator1 first1, InputIterator1 last1, 425*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 426*0b57cec5SDimitry Andric 427*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator> 428*0b57cec5SDimitry Andric void 429*0b57cec5SDimitry Andric inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 430*0b57cec5SDimitry Andric 431*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator, class Compare> 432*0b57cec5SDimitry Andric void 433*0b57cec5SDimitry Andric inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 434*0b57cec5SDimitry Andric 435*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 436*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 437*0b57cec5SDimitry Andric includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 438*0b57cec5SDimitry Andric 439*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class Compare> 440*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 441*0b57cec5SDimitry Andric includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 442*0b57cec5SDimitry Andric 443*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 444*0b57cec5SDimitry Andric OutputIterator 445*0b57cec5SDimitry Andric set_union(InputIterator1 first1, InputIterator1 last1, 446*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 447*0b57cec5SDimitry Andric 448*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 449*0b57cec5SDimitry Andric OutputIterator 450*0b57cec5SDimitry Andric set_union(InputIterator1 first1, InputIterator1 last1, 451*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 452*0b57cec5SDimitry Andric 453*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 454*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 455*0b57cec5SDimitry Andric set_intersection(InputIterator1 first1, InputIterator1 last1, 456*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 457*0b57cec5SDimitry Andric 458*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 459*0b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 460*0b57cec5SDimitry Andric set_intersection(InputIterator1 first1, InputIterator1 last1, 461*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 462*0b57cec5SDimitry Andric 463*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 464*0b57cec5SDimitry Andric OutputIterator 465*0b57cec5SDimitry Andric set_difference(InputIterator1 first1, InputIterator1 last1, 466*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 467*0b57cec5SDimitry Andric 468*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 469*0b57cec5SDimitry Andric OutputIterator 470*0b57cec5SDimitry Andric set_difference(InputIterator1 first1, InputIterator1 last1, 471*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 472*0b57cec5SDimitry Andric 473*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 474*0b57cec5SDimitry Andric OutputIterator 475*0b57cec5SDimitry Andric set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 476*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 477*0b57cec5SDimitry Andric 478*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 479*0b57cec5SDimitry Andric OutputIterator 480*0b57cec5SDimitry Andric set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 481*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 482*0b57cec5SDimitry Andric 483*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 484*0b57cec5SDimitry Andric void 485*0b57cec5SDimitry Andric push_heap(RandomAccessIterator first, RandomAccessIterator last); 486*0b57cec5SDimitry Andric 487*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 488*0b57cec5SDimitry Andric void 489*0b57cec5SDimitry Andric push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 490*0b57cec5SDimitry Andric 491*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 492*0b57cec5SDimitry Andric void 493*0b57cec5SDimitry Andric pop_heap(RandomAccessIterator first, RandomAccessIterator last); 494*0b57cec5SDimitry Andric 495*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 496*0b57cec5SDimitry Andric void 497*0b57cec5SDimitry Andric pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 498*0b57cec5SDimitry Andric 499*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 500*0b57cec5SDimitry Andric void 501*0b57cec5SDimitry Andric make_heap(RandomAccessIterator first, RandomAccessIterator last); 502*0b57cec5SDimitry Andric 503*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 504*0b57cec5SDimitry Andric void 505*0b57cec5SDimitry Andric make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 506*0b57cec5SDimitry Andric 507*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 508*0b57cec5SDimitry Andric void 509*0b57cec5SDimitry Andric sort_heap(RandomAccessIterator first, RandomAccessIterator last); 510*0b57cec5SDimitry Andric 511*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 512*0b57cec5SDimitry Andric void 513*0b57cec5SDimitry Andric sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 514*0b57cec5SDimitry Andric 515*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 516*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 517*0b57cec5SDimitry Andric is_heap(RandomAccessIterator first, RandomAccessiterator last); 518*0b57cec5SDimitry Andric 519*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 520*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 521*0b57cec5SDimitry Andric is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 522*0b57cec5SDimitry Andric 523*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 524*0b57cec5SDimitry Andric constexpr RandomAccessIterator // constexpr in C++20 525*0b57cec5SDimitry Andric is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 526*0b57cec5SDimitry Andric 527*0b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 528*0b57cec5SDimitry Andric constexpr RandomAccessIterator // constexpr in C++20 529*0b57cec5SDimitry Andric is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 530*0b57cec5SDimitry Andric 531*0b57cec5SDimitry Andrictemplate <class ForwardIterator> 532*0b57cec5SDimitry Andric ForwardIterator 533*0b57cec5SDimitry Andric min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 534*0b57cec5SDimitry Andric 535*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Compare> 536*0b57cec5SDimitry Andric ForwardIterator 537*0b57cec5SDimitry Andric min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 538*0b57cec5SDimitry Andric 539*0b57cec5SDimitry Andrictemplate <class T> 540*0b57cec5SDimitry Andric const T& 541*0b57cec5SDimitry Andric min(const T& a, const T& b); // constexpr in C++14 542*0b57cec5SDimitry Andric 543*0b57cec5SDimitry Andrictemplate <class T, class Compare> 544*0b57cec5SDimitry Andric const T& 545*0b57cec5SDimitry Andric min(const T& a, const T& b, Compare comp); // constexpr in C++14 546*0b57cec5SDimitry Andric 547*0b57cec5SDimitry Andrictemplate<class T> 548*0b57cec5SDimitry Andric T 549*0b57cec5SDimitry Andric min(initializer_list<T> t); // constexpr in C++14 550*0b57cec5SDimitry Andric 551*0b57cec5SDimitry Andrictemplate<class T, class Compare> 552*0b57cec5SDimitry Andric T 553*0b57cec5SDimitry Andric min(initializer_list<T> t, Compare comp); // constexpr in C++14 554*0b57cec5SDimitry Andric 555*0b57cec5SDimitry Andrictemplate<class T> 556*0b57cec5SDimitry Andric constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17 557*0b57cec5SDimitry Andric 558*0b57cec5SDimitry Andrictemplate<class T, class Compare> 559*0b57cec5SDimitry Andric constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17 560*0b57cec5SDimitry Andric 561*0b57cec5SDimitry Andrictemplate <class ForwardIterator> 562*0b57cec5SDimitry Andric ForwardIterator 563*0b57cec5SDimitry Andric max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 564*0b57cec5SDimitry Andric 565*0b57cec5SDimitry Andrictemplate <class ForwardIterator, class Compare> 566*0b57cec5SDimitry Andric ForwardIterator 567*0b57cec5SDimitry Andric max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 568*0b57cec5SDimitry Andric 569*0b57cec5SDimitry Andrictemplate <class T> 570*0b57cec5SDimitry Andric const T& 571*0b57cec5SDimitry Andric max(const T& a, const T& b); // constexpr in C++14 572*0b57cec5SDimitry Andric 573*0b57cec5SDimitry Andrictemplate <class T, class Compare> 574*0b57cec5SDimitry Andric const T& 575*0b57cec5SDimitry Andric max(const T& a, const T& b, Compare comp); // constexpr in C++14 576*0b57cec5SDimitry Andric 577*0b57cec5SDimitry Andrictemplate<class T> 578*0b57cec5SDimitry Andric T 579*0b57cec5SDimitry Andric max(initializer_list<T> t); // constexpr in C++14 580*0b57cec5SDimitry Andric 581*0b57cec5SDimitry Andrictemplate<class T, class Compare> 582*0b57cec5SDimitry Andric T 583*0b57cec5SDimitry Andric max(initializer_list<T> t, Compare comp); // constexpr in C++14 584*0b57cec5SDimitry Andric 585*0b57cec5SDimitry Andrictemplate<class ForwardIterator> 586*0b57cec5SDimitry Andric pair<ForwardIterator, ForwardIterator> 587*0b57cec5SDimitry Andric minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 588*0b57cec5SDimitry Andric 589*0b57cec5SDimitry Andrictemplate<class ForwardIterator, class Compare> 590*0b57cec5SDimitry Andric pair<ForwardIterator, ForwardIterator> 591*0b57cec5SDimitry Andric minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 592*0b57cec5SDimitry Andric 593*0b57cec5SDimitry Andrictemplate<class T> 594*0b57cec5SDimitry Andric pair<const T&, const T&> 595*0b57cec5SDimitry Andric minmax(const T& a, const T& b); // constexpr in C++14 596*0b57cec5SDimitry Andric 597*0b57cec5SDimitry Andrictemplate<class T, class Compare> 598*0b57cec5SDimitry Andric pair<const T&, const T&> 599*0b57cec5SDimitry Andric minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 600*0b57cec5SDimitry Andric 601*0b57cec5SDimitry Andrictemplate<class T> 602*0b57cec5SDimitry Andric pair<T, T> 603*0b57cec5SDimitry Andric minmax(initializer_list<T> t); // constexpr in C++14 604*0b57cec5SDimitry Andric 605*0b57cec5SDimitry Andrictemplate<class T, class Compare> 606*0b57cec5SDimitry Andric pair<T, T> 607*0b57cec5SDimitry Andric minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 608*0b57cec5SDimitry Andric 609*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 610*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 611*0b57cec5SDimitry Andric lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 612*0b57cec5SDimitry Andric 613*0b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class Compare> 614*0b57cec5SDimitry Andric constexpr bool // constexpr in C++20 615*0b57cec5SDimitry Andric lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 616*0b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, Compare comp); 617*0b57cec5SDimitry Andric 618*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator> 619*0b57cec5SDimitry Andric bool 620*0b57cec5SDimitry Andric next_permutation(BidirectionalIterator first, BidirectionalIterator last); 621*0b57cec5SDimitry Andric 622*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator, class Compare> 623*0b57cec5SDimitry Andric bool 624*0b57cec5SDimitry Andric next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 625*0b57cec5SDimitry Andric 626*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator> 627*0b57cec5SDimitry Andric bool 628*0b57cec5SDimitry Andric prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 629*0b57cec5SDimitry Andric 630*0b57cec5SDimitry Andrictemplate <class BidirectionalIterator, class Compare> 631*0b57cec5SDimitry Andric bool 632*0b57cec5SDimitry Andric prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 633*0b57cec5SDimitry Andric 634*0b57cec5SDimitry Andric} // std 635*0b57cec5SDimitry Andric 636*0b57cec5SDimitry Andric*/ 637*0b57cec5SDimitry Andric 638*0b57cec5SDimitry Andric#include <__config> 639*0b57cec5SDimitry Andric#include <initializer_list> 640*0b57cec5SDimitry Andric#include <type_traits> 641*0b57cec5SDimitry Andric#include <cstring> 642*0b57cec5SDimitry Andric#include <utility> // needed to provide swap_ranges. 643*0b57cec5SDimitry Andric#include <memory> 644*0b57cec5SDimitry Andric#include <functional> 645*0b57cec5SDimitry Andric#include <iterator> 646*0b57cec5SDimitry Andric#include <cstddef> 647*0b57cec5SDimitry Andric#include <bit> 648*0b57cec5SDimitry Andric#include <version> 649*0b57cec5SDimitry Andric 650*0b57cec5SDimitry Andric#include <__debug> 651*0b57cec5SDimitry Andric 652*0b57cec5SDimitry Andric#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 653*0b57cec5SDimitry Andric#pragma GCC system_header 654*0b57cec5SDimitry Andric#endif 655*0b57cec5SDimitry Andric 656*0b57cec5SDimitry Andric_LIBCPP_PUSH_MACROS 657*0b57cec5SDimitry Andric#include <__undef_macros> 658*0b57cec5SDimitry Andric 659*0b57cec5SDimitry Andric 660*0b57cec5SDimitry Andric_LIBCPP_BEGIN_NAMESPACE_STD 661*0b57cec5SDimitry Andric 662*0b57cec5SDimitry Andric// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 663*0b57cec5SDimitry Andric// * That only works with C++14 and later, and 664*0b57cec5SDimitry Andric// * We haven't included <functional> here. 665*0b57cec5SDimitry Andrictemplate <class _T1, class _T2 = _T1> 666*0b57cec5SDimitry Andricstruct __equal_to 667*0b57cec5SDimitry Andric{ 668*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 669*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 670*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 671*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 672*0b57cec5SDimitry Andric}; 673*0b57cec5SDimitry Andric 674*0b57cec5SDimitry Andrictemplate <class _T1> 675*0b57cec5SDimitry Andricstruct __equal_to<_T1, _T1> 676*0b57cec5SDimitry Andric{ 677*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 678*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 679*0b57cec5SDimitry Andric}; 680*0b57cec5SDimitry Andric 681*0b57cec5SDimitry Andrictemplate <class _T1> 682*0b57cec5SDimitry Andricstruct __equal_to<const _T1, _T1> 683*0b57cec5SDimitry Andric{ 684*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 685*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 686*0b57cec5SDimitry Andric}; 687*0b57cec5SDimitry Andric 688*0b57cec5SDimitry Andrictemplate <class _T1> 689*0b57cec5SDimitry Andricstruct __equal_to<_T1, const _T1> 690*0b57cec5SDimitry Andric{ 691*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 692*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 693*0b57cec5SDimitry Andric}; 694*0b57cec5SDimitry Andric 695*0b57cec5SDimitry Andrictemplate <class _T1, class _T2 = _T1> 696*0b57cec5SDimitry Andricstruct __less 697*0b57cec5SDimitry Andric{ 698*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 699*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 700*0b57cec5SDimitry Andric 701*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 702*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 703*0b57cec5SDimitry Andric 704*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 705*0b57cec5SDimitry Andric bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 706*0b57cec5SDimitry Andric 707*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 708*0b57cec5SDimitry Andric bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 709*0b57cec5SDimitry Andric}; 710*0b57cec5SDimitry Andric 711*0b57cec5SDimitry Andrictemplate <class _T1> 712*0b57cec5SDimitry Andricstruct __less<_T1, _T1> 713*0b57cec5SDimitry Andric{ 714*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 715*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 716*0b57cec5SDimitry Andric}; 717*0b57cec5SDimitry Andric 718*0b57cec5SDimitry Andrictemplate <class _T1> 719*0b57cec5SDimitry Andricstruct __less<const _T1, _T1> 720*0b57cec5SDimitry Andric{ 721*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 722*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 723*0b57cec5SDimitry Andric}; 724*0b57cec5SDimitry Andric 725*0b57cec5SDimitry Andrictemplate <class _T1> 726*0b57cec5SDimitry Andricstruct __less<_T1, const _T1> 727*0b57cec5SDimitry Andric{ 728*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 729*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 730*0b57cec5SDimitry Andric}; 731*0b57cec5SDimitry Andric 732*0b57cec5SDimitry Andrictemplate <class _Predicate> 733*0b57cec5SDimitry Andricclass __invert // invert the sense of a comparison 734*0b57cec5SDimitry Andric{ 735*0b57cec5SDimitry Andricprivate: 736*0b57cec5SDimitry Andric _Predicate __p_; 737*0b57cec5SDimitry Andricpublic: 738*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY __invert() {} 739*0b57cec5SDimitry Andric 740*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY 741*0b57cec5SDimitry Andric explicit __invert(_Predicate __p) : __p_(__p) {} 742*0b57cec5SDimitry Andric 743*0b57cec5SDimitry Andric template <class _T1> 744*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY 745*0b57cec5SDimitry Andric bool operator()(const _T1& __x) {return !__p_(__x);} 746*0b57cec5SDimitry Andric 747*0b57cec5SDimitry Andric template <class _T1, class _T2> 748*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY 749*0b57cec5SDimitry Andric bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 750*0b57cec5SDimitry Andric}; 751*0b57cec5SDimitry Andric 752*0b57cec5SDimitry Andric// Perform division by two quickly for positive integers (llvm.org/PR39129) 753*0b57cec5SDimitry Andric 754*0b57cec5SDimitry Andrictemplate <typename _Integral> 755*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 756*0b57cec5SDimitry Andrictypename enable_if 757*0b57cec5SDimitry Andric< 758*0b57cec5SDimitry Andric is_integral<_Integral>::value, 759*0b57cec5SDimitry Andric _Integral 760*0b57cec5SDimitry Andric>::type 761*0b57cec5SDimitry Andric__half_positive(_Integral __value) 762*0b57cec5SDimitry Andric{ 763*0b57cec5SDimitry Andric return static_cast<_Integral>(static_cast<typename make_unsigned<_Integral>::type>(__value) / 2); 764*0b57cec5SDimitry Andric} 765*0b57cec5SDimitry Andric 766*0b57cec5SDimitry Andrictemplate <typename _Tp> 767*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 768*0b57cec5SDimitry Andrictypename enable_if 769*0b57cec5SDimitry Andric< 770*0b57cec5SDimitry Andric !is_integral<_Tp>::value, 771*0b57cec5SDimitry Andric _Tp 772*0b57cec5SDimitry Andric>::type 773*0b57cec5SDimitry Andric__half_positive(_Tp __value) 774*0b57cec5SDimitry Andric{ 775*0b57cec5SDimitry Andric return __value / 2; 776*0b57cec5SDimitry Andric} 777*0b57cec5SDimitry Andric 778*0b57cec5SDimitry Andric#ifdef _LIBCPP_DEBUG 779*0b57cec5SDimitry Andric 780*0b57cec5SDimitry Andrictemplate <class _Compare> 781*0b57cec5SDimitry Andricstruct __debug_less 782*0b57cec5SDimitry Andric{ 783*0b57cec5SDimitry Andric _Compare &__comp_; 784*0b57cec5SDimitry Andric _LIBCPP_CONSTEXPR_AFTER_CXX17 785*0b57cec5SDimitry Andric __debug_less(_Compare& __c) : __comp_(__c) {} 786*0b57cec5SDimitry Andric 787*0b57cec5SDimitry Andric template <class _Tp, class _Up> 788*0b57cec5SDimitry Andric _LIBCPP_CONSTEXPR_AFTER_CXX17 789*0b57cec5SDimitry Andric bool operator()(const _Tp& __x, const _Up& __y) 790*0b57cec5SDimitry Andric { 791*0b57cec5SDimitry Andric bool __r = __comp_(__x, __y); 792*0b57cec5SDimitry Andric if (__r) 793*0b57cec5SDimitry Andric __do_compare_assert(0, __y, __x); 794*0b57cec5SDimitry Andric return __r; 795*0b57cec5SDimitry Andric } 796*0b57cec5SDimitry Andric 797*0b57cec5SDimitry Andric template <class _Tp, class _Up> 798*0b57cec5SDimitry Andric _LIBCPP_CONSTEXPR_AFTER_CXX17 799*0b57cec5SDimitry Andric bool operator()(_Tp& __x, _Up& __y) 800*0b57cec5SDimitry Andric { 801*0b57cec5SDimitry Andric bool __r = __comp_(__x, __y); 802*0b57cec5SDimitry Andric if (__r) 803*0b57cec5SDimitry Andric __do_compare_assert(0, __y, __x); 804*0b57cec5SDimitry Andric return __r; 805*0b57cec5SDimitry Andric } 806*0b57cec5SDimitry Andric 807*0b57cec5SDimitry Andric template <class _LHS, class _RHS> 808*0b57cec5SDimitry Andric _LIBCPP_CONSTEXPR_AFTER_CXX17 809*0b57cec5SDimitry Andric inline _LIBCPP_INLINE_VISIBILITY 810*0b57cec5SDimitry Andric decltype((void)_VSTD::declval<_Compare&>()( 811*0b57cec5SDimitry Andric _VSTD::declval<_LHS &>(), _VSTD::declval<_RHS &>())) 812*0b57cec5SDimitry Andric __do_compare_assert(int, _LHS & __l, _RHS & __r) { 813*0b57cec5SDimitry Andric _LIBCPP_ASSERT(!__comp_(__l, __r), 814*0b57cec5SDimitry Andric "Comparator does not induce a strict weak ordering"); 815*0b57cec5SDimitry Andric } 816*0b57cec5SDimitry Andric 817*0b57cec5SDimitry Andric template <class _LHS, class _RHS> 818*0b57cec5SDimitry Andric _LIBCPP_CONSTEXPR_AFTER_CXX17 819*0b57cec5SDimitry Andric inline _LIBCPP_INLINE_VISIBILITY 820*0b57cec5SDimitry Andric void __do_compare_assert(long, _LHS &, _RHS &) {} 821*0b57cec5SDimitry Andric}; 822*0b57cec5SDimitry Andric 823*0b57cec5SDimitry Andric#endif // _LIBCPP_DEBUG 824*0b57cec5SDimitry Andric 825*0b57cec5SDimitry Andrictemplate <class _Comp> 826*0b57cec5SDimitry Andricstruct __comp_ref_type { 827*0b57cec5SDimitry Andric // Pass the comparator by lvalue reference. Or in debug mode, using a 828*0b57cec5SDimitry Andric // debugging wrapper that stores a reference. 829*0b57cec5SDimitry Andric#ifndef _LIBCPP_DEBUG 830*0b57cec5SDimitry Andric typedef typename add_lvalue_reference<_Comp>::type type; 831*0b57cec5SDimitry Andric#else 832*0b57cec5SDimitry Andric typedef __debug_less<_Comp> type; 833*0b57cec5SDimitry Andric#endif 834*0b57cec5SDimitry Andric}; 835*0b57cec5SDimitry Andric 836*0b57cec5SDimitry Andric// all_of 837*0b57cec5SDimitry Andric 838*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Predicate> 839*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 840*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 841*0b57cec5SDimitry Andricbool 842*0b57cec5SDimitry Andricall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 843*0b57cec5SDimitry Andric{ 844*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 845*0b57cec5SDimitry Andric if (!__pred(*__first)) 846*0b57cec5SDimitry Andric return false; 847*0b57cec5SDimitry Andric return true; 848*0b57cec5SDimitry Andric} 849*0b57cec5SDimitry Andric 850*0b57cec5SDimitry Andric// any_of 851*0b57cec5SDimitry Andric 852*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Predicate> 853*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 854*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 855*0b57cec5SDimitry Andricbool 856*0b57cec5SDimitry Andricany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 857*0b57cec5SDimitry Andric{ 858*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 859*0b57cec5SDimitry Andric if (__pred(*__first)) 860*0b57cec5SDimitry Andric return true; 861*0b57cec5SDimitry Andric return false; 862*0b57cec5SDimitry Andric} 863*0b57cec5SDimitry Andric 864*0b57cec5SDimitry Andric// none_of 865*0b57cec5SDimitry Andric 866*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Predicate> 867*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 868*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 869*0b57cec5SDimitry Andricbool 870*0b57cec5SDimitry Andricnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 871*0b57cec5SDimitry Andric{ 872*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 873*0b57cec5SDimitry Andric if (__pred(*__first)) 874*0b57cec5SDimitry Andric return false; 875*0b57cec5SDimitry Andric return true; 876*0b57cec5SDimitry Andric} 877*0b57cec5SDimitry Andric 878*0b57cec5SDimitry Andric// for_each 879*0b57cec5SDimitry Andric 880*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Function> 881*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 882*0b57cec5SDimitry Andric_Function 883*0b57cec5SDimitry Andricfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 884*0b57cec5SDimitry Andric{ 885*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 886*0b57cec5SDimitry Andric __f(*__first); 887*0b57cec5SDimitry Andric return __f; 888*0b57cec5SDimitry Andric} 889*0b57cec5SDimitry Andric 890*0b57cec5SDimitry Andric#if _LIBCPP_STD_VER > 14 891*0b57cec5SDimitry Andric// for_each_n 892*0b57cec5SDimitry Andric 893*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Size, class _Function> 894*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 895*0b57cec5SDimitry Andric_InputIterator 896*0b57cec5SDimitry Andricfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 897*0b57cec5SDimitry Andric{ 898*0b57cec5SDimitry Andric typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 899*0b57cec5SDimitry Andric _IntegralSize __n = __orig_n; 900*0b57cec5SDimitry Andric while (__n > 0) 901*0b57cec5SDimitry Andric { 902*0b57cec5SDimitry Andric __f(*__first); 903*0b57cec5SDimitry Andric ++__first; 904*0b57cec5SDimitry Andric --__n; 905*0b57cec5SDimitry Andric } 906*0b57cec5SDimitry Andric return __first; 907*0b57cec5SDimitry Andric} 908*0b57cec5SDimitry Andric#endif 909*0b57cec5SDimitry Andric 910*0b57cec5SDimitry Andric// find 911*0b57cec5SDimitry Andric 912*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Tp> 913*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 914*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 915*0b57cec5SDimitry Andric_InputIterator 916*0b57cec5SDimitry Andricfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 917*0b57cec5SDimitry Andric{ 918*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 919*0b57cec5SDimitry Andric if (*__first == __value_) 920*0b57cec5SDimitry Andric break; 921*0b57cec5SDimitry Andric return __first; 922*0b57cec5SDimitry Andric} 923*0b57cec5SDimitry Andric 924*0b57cec5SDimitry Andric// find_if 925*0b57cec5SDimitry Andric 926*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Predicate> 927*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 928*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 929*0b57cec5SDimitry Andric_InputIterator 930*0b57cec5SDimitry Andricfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 931*0b57cec5SDimitry Andric{ 932*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 933*0b57cec5SDimitry Andric if (__pred(*__first)) 934*0b57cec5SDimitry Andric break; 935*0b57cec5SDimitry Andric return __first; 936*0b57cec5SDimitry Andric} 937*0b57cec5SDimitry Andric 938*0b57cec5SDimitry Andric// find_if_not 939*0b57cec5SDimitry Andric 940*0b57cec5SDimitry Andrictemplate<class _InputIterator, class _Predicate> 941*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 942*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 943*0b57cec5SDimitry Andric_InputIterator 944*0b57cec5SDimitry Andricfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 945*0b57cec5SDimitry Andric{ 946*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 947*0b57cec5SDimitry Andric if (!__pred(*__first)) 948*0b57cec5SDimitry Andric break; 949*0b57cec5SDimitry Andric return __first; 950*0b57cec5SDimitry Andric} 951*0b57cec5SDimitry Andric 952*0b57cec5SDimitry Andric// find_end 953*0b57cec5SDimitry Andric 954*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 955*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 956*0b57cec5SDimitry Andric__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 957*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 958*0b57cec5SDimitry Andric forward_iterator_tag, forward_iterator_tag) 959*0b57cec5SDimitry Andric{ 960*0b57cec5SDimitry Andric // modeled after search algorithm 961*0b57cec5SDimitry Andric _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 962*0b57cec5SDimitry Andric if (__first2 == __last2) 963*0b57cec5SDimitry Andric return __r; 964*0b57cec5SDimitry Andric while (true) 965*0b57cec5SDimitry Andric { 966*0b57cec5SDimitry Andric while (true) 967*0b57cec5SDimitry Andric { 968*0b57cec5SDimitry Andric if (__first1 == __last1) // if source exhausted return last correct answer 969*0b57cec5SDimitry Andric return __r; // (or __last1 if never found) 970*0b57cec5SDimitry Andric if (__pred(*__first1, *__first2)) 971*0b57cec5SDimitry Andric break; 972*0b57cec5SDimitry Andric ++__first1; 973*0b57cec5SDimitry Andric } 974*0b57cec5SDimitry Andric // *__first1 matches *__first2, now match elements after here 975*0b57cec5SDimitry Andric _ForwardIterator1 __m1 = __first1; 976*0b57cec5SDimitry Andric _ForwardIterator2 __m2 = __first2; 977*0b57cec5SDimitry Andric while (true) 978*0b57cec5SDimitry Andric { 979*0b57cec5SDimitry Andric if (++__m2 == __last2) 980*0b57cec5SDimitry Andric { // Pattern exhaused, record answer and search for another one 981*0b57cec5SDimitry Andric __r = __first1; 982*0b57cec5SDimitry Andric ++__first1; 983*0b57cec5SDimitry Andric break; 984*0b57cec5SDimitry Andric } 985*0b57cec5SDimitry Andric if (++__m1 == __last1) // Source exhausted, return last answer 986*0b57cec5SDimitry Andric return __r; 987*0b57cec5SDimitry Andric if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 988*0b57cec5SDimitry Andric { 989*0b57cec5SDimitry Andric ++__first1; 990*0b57cec5SDimitry Andric break; 991*0b57cec5SDimitry Andric } // else there is a match, check next elements 992*0b57cec5SDimitry Andric } 993*0b57cec5SDimitry Andric } 994*0b57cec5SDimitry Andric} 995*0b57cec5SDimitry Andric 996*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 997*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 998*0b57cec5SDimitry Andric__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 999*0b57cec5SDimitry Andric _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 1000*0b57cec5SDimitry Andric bidirectional_iterator_tag, bidirectional_iterator_tag) 1001*0b57cec5SDimitry Andric{ 1002*0b57cec5SDimitry Andric // modeled after search algorithm (in reverse) 1003*0b57cec5SDimitry Andric if (__first2 == __last2) 1004*0b57cec5SDimitry Andric return __last1; // Everything matches an empty sequence 1005*0b57cec5SDimitry Andric _BidirectionalIterator1 __l1 = __last1; 1006*0b57cec5SDimitry Andric _BidirectionalIterator2 __l2 = __last2; 1007*0b57cec5SDimitry Andric --__l2; 1008*0b57cec5SDimitry Andric while (true) 1009*0b57cec5SDimitry Andric { 1010*0b57cec5SDimitry Andric // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 1011*0b57cec5SDimitry Andric while (true) 1012*0b57cec5SDimitry Andric { 1013*0b57cec5SDimitry Andric if (__first1 == __l1) // return __last1 if no element matches *__first2 1014*0b57cec5SDimitry Andric return __last1; 1015*0b57cec5SDimitry Andric if (__pred(*--__l1, *__l2)) 1016*0b57cec5SDimitry Andric break; 1017*0b57cec5SDimitry Andric } 1018*0b57cec5SDimitry Andric // *__l1 matches *__l2, now match elements before here 1019*0b57cec5SDimitry Andric _BidirectionalIterator1 __m1 = __l1; 1020*0b57cec5SDimitry Andric _BidirectionalIterator2 __m2 = __l2; 1021*0b57cec5SDimitry Andric while (true) 1022*0b57cec5SDimitry Andric { 1023*0b57cec5SDimitry Andric if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 1024*0b57cec5SDimitry Andric return __m1; 1025*0b57cec5SDimitry Andric if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 1026*0b57cec5SDimitry Andric return __last1; 1027*0b57cec5SDimitry Andric if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 1028*0b57cec5SDimitry Andric { 1029*0b57cec5SDimitry Andric break; 1030*0b57cec5SDimitry Andric } // else there is a match, check next elements 1031*0b57cec5SDimitry Andric } 1032*0b57cec5SDimitry Andric } 1033*0b57cec5SDimitry Andric} 1034*0b57cec5SDimitry Andric 1035*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 1036*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 1037*0b57cec5SDimitry Andric__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 1038*0b57cec5SDimitry Andric _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 1039*0b57cec5SDimitry Andric random_access_iterator_tag, random_access_iterator_tag) 1040*0b57cec5SDimitry Andric{ 1041*0b57cec5SDimitry Andric // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 1042*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 1043*0b57cec5SDimitry Andric if (__len2 == 0) 1044*0b57cec5SDimitry Andric return __last1; 1045*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 1046*0b57cec5SDimitry Andric if (__len1 < __len2) 1047*0b57cec5SDimitry Andric return __last1; 1048*0b57cec5SDimitry Andric const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 1049*0b57cec5SDimitry Andric _RandomAccessIterator1 __l1 = __last1; 1050*0b57cec5SDimitry Andric _RandomAccessIterator2 __l2 = __last2; 1051*0b57cec5SDimitry Andric --__l2; 1052*0b57cec5SDimitry Andric while (true) 1053*0b57cec5SDimitry Andric { 1054*0b57cec5SDimitry Andric while (true) 1055*0b57cec5SDimitry Andric { 1056*0b57cec5SDimitry Andric if (__s == __l1) 1057*0b57cec5SDimitry Andric return __last1; 1058*0b57cec5SDimitry Andric if (__pred(*--__l1, *__l2)) 1059*0b57cec5SDimitry Andric break; 1060*0b57cec5SDimitry Andric } 1061*0b57cec5SDimitry Andric _RandomAccessIterator1 __m1 = __l1; 1062*0b57cec5SDimitry Andric _RandomAccessIterator2 __m2 = __l2; 1063*0b57cec5SDimitry Andric while (true) 1064*0b57cec5SDimitry Andric { 1065*0b57cec5SDimitry Andric if (__m2 == __first2) 1066*0b57cec5SDimitry Andric return __m1; 1067*0b57cec5SDimitry Andric // no need to check range on __m1 because __s guarantees we have enough source 1068*0b57cec5SDimitry Andric if (!__pred(*--__m1, *--__m2)) 1069*0b57cec5SDimitry Andric { 1070*0b57cec5SDimitry Andric break; 1071*0b57cec5SDimitry Andric } 1072*0b57cec5SDimitry Andric } 1073*0b57cec5SDimitry Andric } 1074*0b57cec5SDimitry Andric} 1075*0b57cec5SDimitry Andric 1076*0b57cec5SDimitry Andrictemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 1077*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1078*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1079*0b57cec5SDimitry Andric_ForwardIterator1 1080*0b57cec5SDimitry Andricfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1081*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 1082*0b57cec5SDimitry Andric{ 1083*0b57cec5SDimitry Andric return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 1084*0b57cec5SDimitry Andric (__first1, __last1, __first2, __last2, __pred, 1085*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator1>::iterator_category(), 1086*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator2>::iterator_category()); 1087*0b57cec5SDimitry Andric} 1088*0b57cec5SDimitry Andric 1089*0b57cec5SDimitry Andrictemplate <class _ForwardIterator1, class _ForwardIterator2> 1090*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1091*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1092*0b57cec5SDimitry Andric_ForwardIterator1 1093*0b57cec5SDimitry Andricfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1094*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2) 1095*0b57cec5SDimitry Andric{ 1096*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 1097*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1098*0b57cec5SDimitry Andric return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 1099*0b57cec5SDimitry Andric} 1100*0b57cec5SDimitry Andric 1101*0b57cec5SDimitry Andric// find_first_of 1102*0b57cec5SDimitry Andric 1103*0b57cec5SDimitry Andrictemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 1104*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 1105*0b57cec5SDimitry Andric__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1106*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 1107*0b57cec5SDimitry Andric{ 1108*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__first1) 1109*0b57cec5SDimitry Andric for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 1110*0b57cec5SDimitry Andric if (__pred(*__first1, *__j)) 1111*0b57cec5SDimitry Andric return __first1; 1112*0b57cec5SDimitry Andric return __last1; 1113*0b57cec5SDimitry Andric} 1114*0b57cec5SDimitry Andric 1115*0b57cec5SDimitry Andric 1116*0b57cec5SDimitry Andrictemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 1117*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1118*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1119*0b57cec5SDimitry Andric_ForwardIterator1 1120*0b57cec5SDimitry Andricfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1121*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 1122*0b57cec5SDimitry Andric{ 1123*0b57cec5SDimitry Andric return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 1124*0b57cec5SDimitry Andric} 1125*0b57cec5SDimitry Andric 1126*0b57cec5SDimitry Andrictemplate <class _ForwardIterator1, class _ForwardIterator2> 1127*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1128*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1129*0b57cec5SDimitry Andric_ForwardIterator1 1130*0b57cec5SDimitry Andricfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1131*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2) 1132*0b57cec5SDimitry Andric{ 1133*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 1134*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1135*0b57cec5SDimitry Andric return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 1136*0b57cec5SDimitry Andric} 1137*0b57cec5SDimitry Andric 1138*0b57cec5SDimitry Andric// adjacent_find 1139*0b57cec5SDimitry Andric 1140*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _BinaryPredicate> 1141*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1142*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1143*0b57cec5SDimitry Andric_ForwardIterator 1144*0b57cec5SDimitry Andricadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 1145*0b57cec5SDimitry Andric{ 1146*0b57cec5SDimitry Andric if (__first != __last) 1147*0b57cec5SDimitry Andric { 1148*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 1149*0b57cec5SDimitry Andric while (++__i != __last) 1150*0b57cec5SDimitry Andric { 1151*0b57cec5SDimitry Andric if (__pred(*__first, *__i)) 1152*0b57cec5SDimitry Andric return __first; 1153*0b57cec5SDimitry Andric __first = __i; 1154*0b57cec5SDimitry Andric } 1155*0b57cec5SDimitry Andric } 1156*0b57cec5SDimitry Andric return __last; 1157*0b57cec5SDimitry Andric} 1158*0b57cec5SDimitry Andric 1159*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 1160*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1161*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1162*0b57cec5SDimitry Andric_ForwardIterator 1163*0b57cec5SDimitry Andricadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 1164*0b57cec5SDimitry Andric{ 1165*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1166*0b57cec5SDimitry Andric return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 1167*0b57cec5SDimitry Andric} 1168*0b57cec5SDimitry Andric 1169*0b57cec5SDimitry Andric// count 1170*0b57cec5SDimitry Andric 1171*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Tp> 1172*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1173*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1174*0b57cec5SDimitry Andrictypename iterator_traits<_InputIterator>::difference_type 1175*0b57cec5SDimitry Andriccount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 1176*0b57cec5SDimitry Andric{ 1177*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator>::difference_type __r(0); 1178*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 1179*0b57cec5SDimitry Andric if (*__first == __value_) 1180*0b57cec5SDimitry Andric ++__r; 1181*0b57cec5SDimitry Andric return __r; 1182*0b57cec5SDimitry Andric} 1183*0b57cec5SDimitry Andric 1184*0b57cec5SDimitry Andric// count_if 1185*0b57cec5SDimitry Andric 1186*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Predicate> 1187*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1188*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1189*0b57cec5SDimitry Andrictypename iterator_traits<_InputIterator>::difference_type 1190*0b57cec5SDimitry Andriccount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 1191*0b57cec5SDimitry Andric{ 1192*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator>::difference_type __r(0); 1193*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 1194*0b57cec5SDimitry Andric if (__pred(*__first)) 1195*0b57cec5SDimitry Andric ++__r; 1196*0b57cec5SDimitry Andric return __r; 1197*0b57cec5SDimitry Andric} 1198*0b57cec5SDimitry Andric 1199*0b57cec5SDimitry Andric// mismatch 1200*0b57cec5SDimitry Andric 1201*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 1202*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1203*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1204*0b57cec5SDimitry Andricpair<_InputIterator1, _InputIterator2> 1205*0b57cec5SDimitry Andricmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 1206*0b57cec5SDimitry Andric _InputIterator2 __first2, _BinaryPredicate __pred) 1207*0b57cec5SDimitry Andric{ 1208*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__first1, (void) ++__first2) 1209*0b57cec5SDimitry Andric if (!__pred(*__first1, *__first2)) 1210*0b57cec5SDimitry Andric break; 1211*0b57cec5SDimitry Andric return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 1212*0b57cec5SDimitry Andric} 1213*0b57cec5SDimitry Andric 1214*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2> 1215*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1216*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1217*0b57cec5SDimitry Andricpair<_InputIterator1, _InputIterator2> 1218*0b57cec5SDimitry Andricmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 1219*0b57cec5SDimitry Andric{ 1220*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator1>::value_type __v1; 1221*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1222*0b57cec5SDimitry Andric return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 1223*0b57cec5SDimitry Andric} 1224*0b57cec5SDimitry Andric 1225*0b57cec5SDimitry Andric#if _LIBCPP_STD_VER > 11 1226*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 1227*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1228*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1229*0b57cec5SDimitry Andricpair<_InputIterator1, _InputIterator2> 1230*0b57cec5SDimitry Andricmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 1231*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, 1232*0b57cec5SDimitry Andric _BinaryPredicate __pred) 1233*0b57cec5SDimitry Andric{ 1234*0b57cec5SDimitry Andric for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 1235*0b57cec5SDimitry Andric if (!__pred(*__first1, *__first2)) 1236*0b57cec5SDimitry Andric break; 1237*0b57cec5SDimitry Andric return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 1238*0b57cec5SDimitry Andric} 1239*0b57cec5SDimitry Andric 1240*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2> 1241*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1242*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1243*0b57cec5SDimitry Andricpair<_InputIterator1, _InputIterator2> 1244*0b57cec5SDimitry Andricmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 1245*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2) 1246*0b57cec5SDimitry Andric{ 1247*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator1>::value_type __v1; 1248*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1249*0b57cec5SDimitry Andric return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 1250*0b57cec5SDimitry Andric} 1251*0b57cec5SDimitry Andric#endif 1252*0b57cec5SDimitry Andric 1253*0b57cec5SDimitry Andric// equal 1254*0b57cec5SDimitry Andric 1255*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 1256*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1257*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1258*0b57cec5SDimitry Andricbool 1259*0b57cec5SDimitry Andricequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 1260*0b57cec5SDimitry Andric{ 1261*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__first1, (void) ++__first2) 1262*0b57cec5SDimitry Andric if (!__pred(*__first1, *__first2)) 1263*0b57cec5SDimitry Andric return false; 1264*0b57cec5SDimitry Andric return true; 1265*0b57cec5SDimitry Andric} 1266*0b57cec5SDimitry Andric 1267*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2> 1268*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1269*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1270*0b57cec5SDimitry Andricbool 1271*0b57cec5SDimitry Andricequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 1272*0b57cec5SDimitry Andric{ 1273*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator1>::value_type __v1; 1274*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1275*0b57cec5SDimitry Andric return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 1276*0b57cec5SDimitry Andric} 1277*0b57cec5SDimitry Andric 1278*0b57cec5SDimitry Andric#if _LIBCPP_STD_VER > 11 1279*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 1280*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1281*0b57cec5SDimitry Andricbool 1282*0b57cec5SDimitry Andric__equal(_InputIterator1 __first1, _InputIterator1 __last1, 1283*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 1284*0b57cec5SDimitry Andric input_iterator_tag, input_iterator_tag ) 1285*0b57cec5SDimitry Andric{ 1286*0b57cec5SDimitry Andric for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 1287*0b57cec5SDimitry Andric if (!__pred(*__first1, *__first2)) 1288*0b57cec5SDimitry Andric return false; 1289*0b57cec5SDimitry Andric return __first1 == __last1 && __first2 == __last2; 1290*0b57cec5SDimitry Andric} 1291*0b57cec5SDimitry Andric 1292*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 1293*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1294*0b57cec5SDimitry Andricbool 1295*0b57cec5SDimitry Andric__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 1296*0b57cec5SDimitry Andric _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 1297*0b57cec5SDimitry Andric random_access_iterator_tag, random_access_iterator_tag ) 1298*0b57cec5SDimitry Andric{ 1299*0b57cec5SDimitry Andric if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 1300*0b57cec5SDimitry Andric return false; 1301*0b57cec5SDimitry Andric return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 1302*0b57cec5SDimitry Andric typename add_lvalue_reference<_BinaryPredicate>::type> 1303*0b57cec5SDimitry Andric (__first1, __last1, __first2, __pred ); 1304*0b57cec5SDimitry Andric} 1305*0b57cec5SDimitry Andric 1306*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 1307*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1308*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1309*0b57cec5SDimitry Andricbool 1310*0b57cec5SDimitry Andricequal(_InputIterator1 __first1, _InputIterator1 __last1, 1311*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 1312*0b57cec5SDimitry Andric{ 1313*0b57cec5SDimitry Andric return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 1314*0b57cec5SDimitry Andric (__first1, __last1, __first2, __last2, __pred, 1315*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator1>::iterator_category(), 1316*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator2>::iterator_category()); 1317*0b57cec5SDimitry Andric} 1318*0b57cec5SDimitry Andric 1319*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2> 1320*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1321*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1322*0b57cec5SDimitry Andricbool 1323*0b57cec5SDimitry Andricequal(_InputIterator1 __first1, _InputIterator1 __last1, 1324*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2) 1325*0b57cec5SDimitry Andric{ 1326*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator1>::value_type __v1; 1327*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1328*0b57cec5SDimitry Andric return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 1329*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator1>::iterator_category(), 1330*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator2>::iterator_category()); 1331*0b57cec5SDimitry Andric} 1332*0b57cec5SDimitry Andric#endif 1333*0b57cec5SDimitry Andric 1334*0b57cec5SDimitry Andric// is_permutation 1335*0b57cec5SDimitry Andric 1336*0b57cec5SDimitry Andrictemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 1337*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 1338*0b57cec5SDimitry Andricis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1339*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _BinaryPredicate __pred) 1340*0b57cec5SDimitry Andric{ 1341*0b57cec5SDimitry Andric// shorten sequences as much as possible by lopping of any equal prefix 1342*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__first1, (void) ++__first2) 1343*0b57cec5SDimitry Andric if (!__pred(*__first1, *__first2)) 1344*0b57cec5SDimitry Andric break; 1345*0b57cec5SDimitry Andric if (__first1 == __last1) 1346*0b57cec5SDimitry Andric return true; 1347*0b57cec5SDimitry Andric 1348*0b57cec5SDimitry Andric// __first1 != __last1 && *__first1 != *__first2 1349*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1350*0b57cec5SDimitry Andric _D1 __l1 = _VSTD::distance(__first1, __last1); 1351*0b57cec5SDimitry Andric if (__l1 == _D1(1)) 1352*0b57cec5SDimitry Andric return false; 1353*0b57cec5SDimitry Andric _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 1354*0b57cec5SDimitry Andric // For each element in [f1, l1) see if there are the same number of 1355*0b57cec5SDimitry Andric // equal elements in [f2, l2) 1356*0b57cec5SDimitry Andric for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 1357*0b57cec5SDimitry Andric { 1358*0b57cec5SDimitry Andric // Have we already counted the number of *__i in [f1, l1)? 1359*0b57cec5SDimitry Andric _ForwardIterator1 __match = __first1; 1360*0b57cec5SDimitry Andric for (; __match != __i; ++__match) 1361*0b57cec5SDimitry Andric if (__pred(*__match, *__i)) 1362*0b57cec5SDimitry Andric break; 1363*0b57cec5SDimitry Andric if (__match == __i) { 1364*0b57cec5SDimitry Andric // Count number of *__i in [f2, l2) 1365*0b57cec5SDimitry Andric _D1 __c2 = 0; 1366*0b57cec5SDimitry Andric for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 1367*0b57cec5SDimitry Andric if (__pred(*__i, *__j)) 1368*0b57cec5SDimitry Andric ++__c2; 1369*0b57cec5SDimitry Andric if (__c2 == 0) 1370*0b57cec5SDimitry Andric return false; 1371*0b57cec5SDimitry Andric // Count number of *__i in [__i, l1) (we can start with 1) 1372*0b57cec5SDimitry Andric _D1 __c1 = 1; 1373*0b57cec5SDimitry Andric for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 1374*0b57cec5SDimitry Andric if (__pred(*__i, *__j)) 1375*0b57cec5SDimitry Andric ++__c1; 1376*0b57cec5SDimitry Andric if (__c1 != __c2) 1377*0b57cec5SDimitry Andric return false; 1378*0b57cec5SDimitry Andric } 1379*0b57cec5SDimitry Andric } 1380*0b57cec5SDimitry Andric return true; 1381*0b57cec5SDimitry Andric} 1382*0b57cec5SDimitry Andric 1383*0b57cec5SDimitry Andrictemplate<class _ForwardIterator1, class _ForwardIterator2> 1384*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1385*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1386*0b57cec5SDimitry Andricbool 1387*0b57cec5SDimitry Andricis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1388*0b57cec5SDimitry Andric _ForwardIterator2 __first2) 1389*0b57cec5SDimitry Andric{ 1390*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 1391*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1392*0b57cec5SDimitry Andric return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 1393*0b57cec5SDimitry Andric} 1394*0b57cec5SDimitry Andric 1395*0b57cec5SDimitry Andric#if _LIBCPP_STD_VER > 11 1396*0b57cec5SDimitry Andrictemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 1397*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 1398*0b57cec5SDimitry Andric__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1399*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2, 1400*0b57cec5SDimitry Andric _BinaryPredicate __pred, 1401*0b57cec5SDimitry Andric forward_iterator_tag, forward_iterator_tag ) 1402*0b57cec5SDimitry Andric{ 1403*0b57cec5SDimitry Andric// shorten sequences as much as possible by lopping of any equal prefix 1404*0b57cec5SDimitry Andric for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 1405*0b57cec5SDimitry Andric if (!__pred(*__first1, *__first2)) 1406*0b57cec5SDimitry Andric break; 1407*0b57cec5SDimitry Andric if (__first1 == __last1) 1408*0b57cec5SDimitry Andric return __first2 == __last2; 1409*0b57cec5SDimitry Andric else if (__first2 == __last2) 1410*0b57cec5SDimitry Andric return false; 1411*0b57cec5SDimitry Andric 1412*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1413*0b57cec5SDimitry Andric _D1 __l1 = _VSTD::distance(__first1, __last1); 1414*0b57cec5SDimitry Andric 1415*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1416*0b57cec5SDimitry Andric _D2 __l2 = _VSTD::distance(__first2, __last2); 1417*0b57cec5SDimitry Andric if (__l1 != __l2) 1418*0b57cec5SDimitry Andric return false; 1419*0b57cec5SDimitry Andric 1420*0b57cec5SDimitry Andric // For each element in [f1, l1) see if there are the same number of 1421*0b57cec5SDimitry Andric // equal elements in [f2, l2) 1422*0b57cec5SDimitry Andric for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 1423*0b57cec5SDimitry Andric { 1424*0b57cec5SDimitry Andric // Have we already counted the number of *__i in [f1, l1)? 1425*0b57cec5SDimitry Andric _ForwardIterator1 __match = __first1; 1426*0b57cec5SDimitry Andric for (; __match != __i; ++__match) 1427*0b57cec5SDimitry Andric if (__pred(*__match, *__i)) 1428*0b57cec5SDimitry Andric break; 1429*0b57cec5SDimitry Andric if (__match == __i) { 1430*0b57cec5SDimitry Andric // Count number of *__i in [f2, l2) 1431*0b57cec5SDimitry Andric _D1 __c2 = 0; 1432*0b57cec5SDimitry Andric for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 1433*0b57cec5SDimitry Andric if (__pred(*__i, *__j)) 1434*0b57cec5SDimitry Andric ++__c2; 1435*0b57cec5SDimitry Andric if (__c2 == 0) 1436*0b57cec5SDimitry Andric return false; 1437*0b57cec5SDimitry Andric // Count number of *__i in [__i, l1) (we can start with 1) 1438*0b57cec5SDimitry Andric _D1 __c1 = 1; 1439*0b57cec5SDimitry Andric for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 1440*0b57cec5SDimitry Andric if (__pred(*__i, *__j)) 1441*0b57cec5SDimitry Andric ++__c1; 1442*0b57cec5SDimitry Andric if (__c1 != __c2) 1443*0b57cec5SDimitry Andric return false; 1444*0b57cec5SDimitry Andric } 1445*0b57cec5SDimitry Andric } 1446*0b57cec5SDimitry Andric return true; 1447*0b57cec5SDimitry Andric} 1448*0b57cec5SDimitry Andric 1449*0b57cec5SDimitry Andrictemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 1450*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 1451*0b57cec5SDimitry Andric__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 1452*0b57cec5SDimitry Andric _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 1453*0b57cec5SDimitry Andric _BinaryPredicate __pred, 1454*0b57cec5SDimitry Andric random_access_iterator_tag, random_access_iterator_tag ) 1455*0b57cec5SDimitry Andric{ 1456*0b57cec5SDimitry Andric if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 1457*0b57cec5SDimitry Andric return false; 1458*0b57cec5SDimitry Andric return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 1459*0b57cec5SDimitry Andric typename add_lvalue_reference<_BinaryPredicate>::type> 1460*0b57cec5SDimitry Andric (__first1, __last1, __first2, __pred ); 1461*0b57cec5SDimitry Andric} 1462*0b57cec5SDimitry Andric 1463*0b57cec5SDimitry Andrictemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 1464*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1465*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1466*0b57cec5SDimitry Andricbool 1467*0b57cec5SDimitry Andricis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1468*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2, 1469*0b57cec5SDimitry Andric _BinaryPredicate __pred ) 1470*0b57cec5SDimitry Andric{ 1471*0b57cec5SDimitry Andric return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 1472*0b57cec5SDimitry Andric (__first1, __last1, __first2, __last2, __pred, 1473*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator1>::iterator_category(), 1474*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator2>::iterator_category()); 1475*0b57cec5SDimitry Andric} 1476*0b57cec5SDimitry Andric 1477*0b57cec5SDimitry Andrictemplate<class _ForwardIterator1, class _ForwardIterator2> 1478*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1479*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1480*0b57cec5SDimitry Andricbool 1481*0b57cec5SDimitry Andricis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1482*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2) 1483*0b57cec5SDimitry Andric{ 1484*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 1485*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1486*0b57cec5SDimitry Andric return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 1487*0b57cec5SDimitry Andric __equal_to<__v1, __v2>(), 1488*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator1>::iterator_category(), 1489*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator2>::iterator_category()); 1490*0b57cec5SDimitry Andric} 1491*0b57cec5SDimitry Andric#endif 1492*0b57cec5SDimitry Andric 1493*0b57cec5SDimitry Andric// search 1494*0b57cec5SDimitry Andric// __search is in <functional> 1495*0b57cec5SDimitry Andric 1496*0b57cec5SDimitry Andrictemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 1497*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1498*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1499*0b57cec5SDimitry Andric_ForwardIterator1 1500*0b57cec5SDimitry Andricsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1501*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 1502*0b57cec5SDimitry Andric{ 1503*0b57cec5SDimitry Andric return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 1504*0b57cec5SDimitry Andric (__first1, __last1, __first2, __last2, __pred, 1505*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator1>::iterator_category(), 1506*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator2>::iterator_category()) 1507*0b57cec5SDimitry Andric .first; 1508*0b57cec5SDimitry Andric} 1509*0b57cec5SDimitry Andric 1510*0b57cec5SDimitry Andrictemplate <class _ForwardIterator1, class _ForwardIterator2> 1511*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1512*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1513*0b57cec5SDimitry Andric_ForwardIterator1 1514*0b57cec5SDimitry Andricsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 1515*0b57cec5SDimitry Andric _ForwardIterator2 __first2, _ForwardIterator2 __last2) 1516*0b57cec5SDimitry Andric{ 1517*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 1518*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1519*0b57cec5SDimitry Andric return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 1520*0b57cec5SDimitry Andric} 1521*0b57cec5SDimitry Andric 1522*0b57cec5SDimitry Andric 1523*0b57cec5SDimitry Andric#if _LIBCPP_STD_VER > 14 1524*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Searcher> 1525*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1526*0b57cec5SDimitry Andric_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1527*0b57cec5SDimitry Andric{ return __s(__f, __l).first; } 1528*0b57cec5SDimitry Andric#endif 1529*0b57cec5SDimitry Andric 1530*0b57cec5SDimitry Andric// search_n 1531*0b57cec5SDimitry Andric 1532*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 1533*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 1534*0b57cec5SDimitry Andric__search_n(_ForwardIterator __first, _ForwardIterator __last, 1535*0b57cec5SDimitry Andric _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 1536*0b57cec5SDimitry Andric{ 1537*0b57cec5SDimitry Andric if (__count <= 0) 1538*0b57cec5SDimitry Andric return __first; 1539*0b57cec5SDimitry Andric while (true) 1540*0b57cec5SDimitry Andric { 1541*0b57cec5SDimitry Andric // Find first element in sequence that matchs __value_, with a mininum of loop checks 1542*0b57cec5SDimitry Andric while (true) 1543*0b57cec5SDimitry Andric { 1544*0b57cec5SDimitry Andric if (__first == __last) // return __last if no element matches __value_ 1545*0b57cec5SDimitry Andric return __last; 1546*0b57cec5SDimitry Andric if (__pred(*__first, __value_)) 1547*0b57cec5SDimitry Andric break; 1548*0b57cec5SDimitry Andric ++__first; 1549*0b57cec5SDimitry Andric } 1550*0b57cec5SDimitry Andric // *__first matches __value_, now match elements after here 1551*0b57cec5SDimitry Andric _ForwardIterator __m = __first; 1552*0b57cec5SDimitry Andric _Size __c(0); 1553*0b57cec5SDimitry Andric while (true) 1554*0b57cec5SDimitry Andric { 1555*0b57cec5SDimitry Andric if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 1556*0b57cec5SDimitry Andric return __first; 1557*0b57cec5SDimitry Andric if (++__m == __last) // Otherwise if source exhaused, pattern not found 1558*0b57cec5SDimitry Andric return __last; 1559*0b57cec5SDimitry Andric if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 1560*0b57cec5SDimitry Andric { 1561*0b57cec5SDimitry Andric __first = __m; 1562*0b57cec5SDimitry Andric ++__first; 1563*0b57cec5SDimitry Andric break; 1564*0b57cec5SDimitry Andric } // else there is a match, check next elements 1565*0b57cec5SDimitry Andric } 1566*0b57cec5SDimitry Andric } 1567*0b57cec5SDimitry Andric} 1568*0b57cec5SDimitry Andric 1569*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 1570*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 1571*0b57cec5SDimitry Andric__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1572*0b57cec5SDimitry Andric _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 1573*0b57cec5SDimitry Andric{ 1574*0b57cec5SDimitry Andric if (__count <= 0) 1575*0b57cec5SDimitry Andric return __first; 1576*0b57cec5SDimitry Andric _Size __len = static_cast<_Size>(__last - __first); 1577*0b57cec5SDimitry Andric if (__len < __count) 1578*0b57cec5SDimitry Andric return __last; 1579*0b57cec5SDimitry Andric const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 1580*0b57cec5SDimitry Andric while (true) 1581*0b57cec5SDimitry Andric { 1582*0b57cec5SDimitry Andric // Find first element in sequence that matchs __value_, with a mininum of loop checks 1583*0b57cec5SDimitry Andric while (true) 1584*0b57cec5SDimitry Andric { 1585*0b57cec5SDimitry Andric if (__first >= __s) // return __last if no element matches __value_ 1586*0b57cec5SDimitry Andric return __last; 1587*0b57cec5SDimitry Andric if (__pred(*__first, __value_)) 1588*0b57cec5SDimitry Andric break; 1589*0b57cec5SDimitry Andric ++__first; 1590*0b57cec5SDimitry Andric } 1591*0b57cec5SDimitry Andric // *__first matches __value_, now match elements after here 1592*0b57cec5SDimitry Andric _RandomAccessIterator __m = __first; 1593*0b57cec5SDimitry Andric _Size __c(0); 1594*0b57cec5SDimitry Andric while (true) 1595*0b57cec5SDimitry Andric { 1596*0b57cec5SDimitry Andric if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 1597*0b57cec5SDimitry Andric return __first; 1598*0b57cec5SDimitry Andric ++__m; // no need to check range on __m because __s guarantees we have enough source 1599*0b57cec5SDimitry Andric if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 1600*0b57cec5SDimitry Andric { 1601*0b57cec5SDimitry Andric __first = __m; 1602*0b57cec5SDimitry Andric ++__first; 1603*0b57cec5SDimitry Andric break; 1604*0b57cec5SDimitry Andric } // else there is a match, check next elements 1605*0b57cec5SDimitry Andric } 1606*0b57cec5SDimitry Andric } 1607*0b57cec5SDimitry Andric} 1608*0b57cec5SDimitry Andric 1609*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 1610*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1611*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1612*0b57cec5SDimitry Andric_ForwardIterator 1613*0b57cec5SDimitry Andricsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1614*0b57cec5SDimitry Andric _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 1615*0b57cec5SDimitry Andric{ 1616*0b57cec5SDimitry Andric return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1617*0b57cec5SDimitry Andric (__first, __last, __convert_to_integral(__count), __value_, __pred, 1618*0b57cec5SDimitry Andric typename iterator_traits<_ForwardIterator>::iterator_category()); 1619*0b57cec5SDimitry Andric} 1620*0b57cec5SDimitry Andric 1621*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Size, class _Tp> 1622*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 1623*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1624*0b57cec5SDimitry Andric_ForwardIterator 1625*0b57cec5SDimitry Andricsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 1626*0b57cec5SDimitry Andric{ 1627*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1628*0b57cec5SDimitry Andric return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 1629*0b57cec5SDimitry Andric __value_, __equal_to<__v, _Tp>()); 1630*0b57cec5SDimitry Andric} 1631*0b57cec5SDimitry Andric 1632*0b57cec5SDimitry Andric// copy 1633*0b57cec5SDimitry Andrictemplate <class _Iter> 1634*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1635*0b57cec5SDimitry Andric_Iter 1636*0b57cec5SDimitry Andric__unwrap_iter(_Iter __i) 1637*0b57cec5SDimitry Andric{ 1638*0b57cec5SDimitry Andric return __i; 1639*0b57cec5SDimitry Andric} 1640*0b57cec5SDimitry Andric 1641*0b57cec5SDimitry Andrictemplate <class _Tp> 1642*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1643*0b57cec5SDimitry Andrictypename enable_if 1644*0b57cec5SDimitry Andric< 1645*0b57cec5SDimitry Andric is_trivially_copy_assignable<_Tp>::value, 1646*0b57cec5SDimitry Andric _Tp* 1647*0b57cec5SDimitry Andric>::type 1648*0b57cec5SDimitry Andric__unwrap_iter(move_iterator<_Tp*> __i) 1649*0b57cec5SDimitry Andric{ 1650*0b57cec5SDimitry Andric return __i.base(); 1651*0b57cec5SDimitry Andric} 1652*0b57cec5SDimitry Andric 1653*0b57cec5SDimitry Andric#if _LIBCPP_DEBUG_LEVEL < 2 1654*0b57cec5SDimitry Andric 1655*0b57cec5SDimitry Andrictemplate <class _Tp> 1656*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 1657*0b57cec5SDimitry Andrictypename enable_if 1658*0b57cec5SDimitry Andric< 1659*0b57cec5SDimitry Andric is_trivially_copy_assignable<_Tp>::value, 1660*0b57cec5SDimitry Andric _Tp* 1661*0b57cec5SDimitry Andric>::type 1662*0b57cec5SDimitry Andric__unwrap_iter(__wrap_iter<_Tp*> __i) 1663*0b57cec5SDimitry Andric{ 1664*0b57cec5SDimitry Andric return __i.base(); 1665*0b57cec5SDimitry Andric} 1666*0b57cec5SDimitry Andric 1667*0b57cec5SDimitry Andrictemplate <class _Tp> 1668*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 1669*0b57cec5SDimitry Andrictypename enable_if 1670*0b57cec5SDimitry Andric< 1671*0b57cec5SDimitry Andric is_trivially_copy_assignable<_Tp>::value, 1672*0b57cec5SDimitry Andric const _Tp* 1673*0b57cec5SDimitry Andric>::type 1674*0b57cec5SDimitry Andric__unwrap_iter(__wrap_iter<const _Tp*> __i) 1675*0b57cec5SDimitry Andric{ 1676*0b57cec5SDimitry Andric return __i.base(); 1677*0b57cec5SDimitry Andric} 1678*0b57cec5SDimitry Andric 1679*0b57cec5SDimitry Andric#else 1680*0b57cec5SDimitry Andric 1681*0b57cec5SDimitry Andrictemplate <class _Tp> 1682*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 1683*0b57cec5SDimitry Andrictypename enable_if 1684*0b57cec5SDimitry Andric< 1685*0b57cec5SDimitry Andric is_trivially_copy_assignable<_Tp>::value, 1686*0b57cec5SDimitry Andric __wrap_iter<_Tp*> 1687*0b57cec5SDimitry Andric>::type 1688*0b57cec5SDimitry Andric__unwrap_iter(__wrap_iter<_Tp*> __i) 1689*0b57cec5SDimitry Andric{ 1690*0b57cec5SDimitry Andric return __i; 1691*0b57cec5SDimitry Andric} 1692*0b57cec5SDimitry Andric 1693*0b57cec5SDimitry Andric#endif // _LIBCPP_DEBUG_LEVEL < 2 1694*0b57cec5SDimitry Andric 1695*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator> 1696*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1697*0b57cec5SDimitry Andric_OutputIterator 1698*0b57cec5SDimitry Andric__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 1699*0b57cec5SDimitry Andric{ 1700*0b57cec5SDimitry Andric for (; __first != __last; ++__first, (void) ++__result) 1701*0b57cec5SDimitry Andric *__result = *__first; 1702*0b57cec5SDimitry Andric return __result; 1703*0b57cec5SDimitry Andric} 1704*0b57cec5SDimitry Andric 1705*0b57cec5SDimitry Andrictemplate <class _Tp, class _Up> 1706*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1707*0b57cec5SDimitry Andrictypename enable_if 1708*0b57cec5SDimitry Andric< 1709*0b57cec5SDimitry Andric is_same<typename remove_const<_Tp>::type, _Up>::value && 1710*0b57cec5SDimitry Andric is_trivially_copy_assignable<_Up>::value, 1711*0b57cec5SDimitry Andric _Up* 1712*0b57cec5SDimitry Andric>::type 1713*0b57cec5SDimitry Andric__copy(_Tp* __first, _Tp* __last, _Up* __result) 1714*0b57cec5SDimitry Andric{ 1715*0b57cec5SDimitry Andric const size_t __n = static_cast<size_t>(__last - __first); 1716*0b57cec5SDimitry Andric if (__n > 0) 1717*0b57cec5SDimitry Andric _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 1718*0b57cec5SDimitry Andric return __result + __n; 1719*0b57cec5SDimitry Andric} 1720*0b57cec5SDimitry Andric 1721*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator> 1722*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1723*0b57cec5SDimitry Andric_OutputIterator 1724*0b57cec5SDimitry Andriccopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 1725*0b57cec5SDimitry Andric{ 1726*0b57cec5SDimitry Andric return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 1727*0b57cec5SDimitry Andric} 1728*0b57cec5SDimitry Andric 1729*0b57cec5SDimitry Andric// copy_backward 1730*0b57cec5SDimitry Andric 1731*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator, class _OutputIterator> 1732*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1733*0b57cec5SDimitry Andric_OutputIterator 1734*0b57cec5SDimitry Andric__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 1735*0b57cec5SDimitry Andric{ 1736*0b57cec5SDimitry Andric while (__first != __last) 1737*0b57cec5SDimitry Andric *--__result = *--__last; 1738*0b57cec5SDimitry Andric return __result; 1739*0b57cec5SDimitry Andric} 1740*0b57cec5SDimitry Andric 1741*0b57cec5SDimitry Andrictemplate <class _Tp, class _Up> 1742*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1743*0b57cec5SDimitry Andrictypename enable_if 1744*0b57cec5SDimitry Andric< 1745*0b57cec5SDimitry Andric is_same<typename remove_const<_Tp>::type, _Up>::value && 1746*0b57cec5SDimitry Andric is_trivially_copy_assignable<_Up>::value, 1747*0b57cec5SDimitry Andric _Up* 1748*0b57cec5SDimitry Andric>::type 1749*0b57cec5SDimitry Andric__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 1750*0b57cec5SDimitry Andric{ 1751*0b57cec5SDimitry Andric const size_t __n = static_cast<size_t>(__last - __first); 1752*0b57cec5SDimitry Andric if (__n > 0) 1753*0b57cec5SDimitry Andric { 1754*0b57cec5SDimitry Andric __result -= __n; 1755*0b57cec5SDimitry Andric _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 1756*0b57cec5SDimitry Andric } 1757*0b57cec5SDimitry Andric return __result; 1758*0b57cec5SDimitry Andric} 1759*0b57cec5SDimitry Andric 1760*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 1761*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1762*0b57cec5SDimitry Andric_BidirectionalIterator2 1763*0b57cec5SDimitry Andriccopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 1764*0b57cec5SDimitry Andric _BidirectionalIterator2 __result) 1765*0b57cec5SDimitry Andric{ 1766*0b57cec5SDimitry Andric return _VSTD::__copy_backward(__unwrap_iter(__first), 1767*0b57cec5SDimitry Andric __unwrap_iter(__last), 1768*0b57cec5SDimitry Andric __unwrap_iter(__result)); 1769*0b57cec5SDimitry Andric} 1770*0b57cec5SDimitry Andric 1771*0b57cec5SDimitry Andric// copy_if 1772*0b57cec5SDimitry Andric 1773*0b57cec5SDimitry Andrictemplate<class _InputIterator, class _OutputIterator, class _Predicate> 1774*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1775*0b57cec5SDimitry Andric_OutputIterator 1776*0b57cec5SDimitry Andriccopy_if(_InputIterator __first, _InputIterator __last, 1777*0b57cec5SDimitry Andric _OutputIterator __result, _Predicate __pred) 1778*0b57cec5SDimitry Andric{ 1779*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 1780*0b57cec5SDimitry Andric { 1781*0b57cec5SDimitry Andric if (__pred(*__first)) 1782*0b57cec5SDimitry Andric { 1783*0b57cec5SDimitry Andric *__result = *__first; 1784*0b57cec5SDimitry Andric ++__result; 1785*0b57cec5SDimitry Andric } 1786*0b57cec5SDimitry Andric } 1787*0b57cec5SDimitry Andric return __result; 1788*0b57cec5SDimitry Andric} 1789*0b57cec5SDimitry Andric 1790*0b57cec5SDimitry Andric// copy_n 1791*0b57cec5SDimitry Andric 1792*0b57cec5SDimitry Andrictemplate<class _InputIterator, class _Size, class _OutputIterator> 1793*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1794*0b57cec5SDimitry Andrictypename enable_if 1795*0b57cec5SDimitry Andric< 1796*0b57cec5SDimitry Andric __is_input_iterator<_InputIterator>::value && 1797*0b57cec5SDimitry Andric !__is_random_access_iterator<_InputIterator>::value, 1798*0b57cec5SDimitry Andric _OutputIterator 1799*0b57cec5SDimitry Andric>::type 1800*0b57cec5SDimitry Andriccopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 1801*0b57cec5SDimitry Andric{ 1802*0b57cec5SDimitry Andric typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 1803*0b57cec5SDimitry Andric _IntegralSize __n = __orig_n; 1804*0b57cec5SDimitry Andric if (__n > 0) 1805*0b57cec5SDimitry Andric { 1806*0b57cec5SDimitry Andric *__result = *__first; 1807*0b57cec5SDimitry Andric ++__result; 1808*0b57cec5SDimitry Andric for (--__n; __n > 0; --__n) 1809*0b57cec5SDimitry Andric { 1810*0b57cec5SDimitry Andric ++__first; 1811*0b57cec5SDimitry Andric *__result = *__first; 1812*0b57cec5SDimitry Andric ++__result; 1813*0b57cec5SDimitry Andric } 1814*0b57cec5SDimitry Andric } 1815*0b57cec5SDimitry Andric return __result; 1816*0b57cec5SDimitry Andric} 1817*0b57cec5SDimitry Andric 1818*0b57cec5SDimitry Andrictemplate<class _InputIterator, class _Size, class _OutputIterator> 1819*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1820*0b57cec5SDimitry Andrictypename enable_if 1821*0b57cec5SDimitry Andric< 1822*0b57cec5SDimitry Andric __is_random_access_iterator<_InputIterator>::value, 1823*0b57cec5SDimitry Andric _OutputIterator 1824*0b57cec5SDimitry Andric>::type 1825*0b57cec5SDimitry Andriccopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 1826*0b57cec5SDimitry Andric{ 1827*0b57cec5SDimitry Andric typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 1828*0b57cec5SDimitry Andric _IntegralSize __n = __orig_n; 1829*0b57cec5SDimitry Andric return _VSTD::copy(__first, __first + __n, __result); 1830*0b57cec5SDimitry Andric} 1831*0b57cec5SDimitry Andric 1832*0b57cec5SDimitry Andric// move 1833*0b57cec5SDimitry Andric 1834*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator> 1835*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1836*0b57cec5SDimitry Andric_OutputIterator 1837*0b57cec5SDimitry Andric__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 1838*0b57cec5SDimitry Andric{ 1839*0b57cec5SDimitry Andric for (; __first != __last; ++__first, (void) ++__result) 1840*0b57cec5SDimitry Andric *__result = _VSTD::move(*__first); 1841*0b57cec5SDimitry Andric return __result; 1842*0b57cec5SDimitry Andric} 1843*0b57cec5SDimitry Andric 1844*0b57cec5SDimitry Andrictemplate <class _Tp, class _Up> 1845*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1846*0b57cec5SDimitry Andrictypename enable_if 1847*0b57cec5SDimitry Andric< 1848*0b57cec5SDimitry Andric is_same<typename remove_const<_Tp>::type, _Up>::value && 1849*0b57cec5SDimitry Andric is_trivially_copy_assignable<_Up>::value, 1850*0b57cec5SDimitry Andric _Up* 1851*0b57cec5SDimitry Andric>::type 1852*0b57cec5SDimitry Andric__move(_Tp* __first, _Tp* __last, _Up* __result) 1853*0b57cec5SDimitry Andric{ 1854*0b57cec5SDimitry Andric const size_t __n = static_cast<size_t>(__last - __first); 1855*0b57cec5SDimitry Andric if (__n > 0) 1856*0b57cec5SDimitry Andric _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 1857*0b57cec5SDimitry Andric return __result + __n; 1858*0b57cec5SDimitry Andric} 1859*0b57cec5SDimitry Andric 1860*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator> 1861*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1862*0b57cec5SDimitry Andric_OutputIterator 1863*0b57cec5SDimitry Andricmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 1864*0b57cec5SDimitry Andric{ 1865*0b57cec5SDimitry Andric return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 1866*0b57cec5SDimitry Andric} 1867*0b57cec5SDimitry Andric 1868*0b57cec5SDimitry Andric// move_backward 1869*0b57cec5SDimitry Andric 1870*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator> 1871*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1872*0b57cec5SDimitry Andric_OutputIterator 1873*0b57cec5SDimitry Andric__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 1874*0b57cec5SDimitry Andric{ 1875*0b57cec5SDimitry Andric while (__first != __last) 1876*0b57cec5SDimitry Andric *--__result = _VSTD::move(*--__last); 1877*0b57cec5SDimitry Andric return __result; 1878*0b57cec5SDimitry Andric} 1879*0b57cec5SDimitry Andric 1880*0b57cec5SDimitry Andrictemplate <class _Tp, class _Up> 1881*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1882*0b57cec5SDimitry Andrictypename enable_if 1883*0b57cec5SDimitry Andric< 1884*0b57cec5SDimitry Andric is_same<typename remove_const<_Tp>::type, _Up>::value && 1885*0b57cec5SDimitry Andric is_trivially_copy_assignable<_Up>::value, 1886*0b57cec5SDimitry Andric _Up* 1887*0b57cec5SDimitry Andric>::type 1888*0b57cec5SDimitry Andric__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 1889*0b57cec5SDimitry Andric{ 1890*0b57cec5SDimitry Andric const size_t __n = static_cast<size_t>(__last - __first); 1891*0b57cec5SDimitry Andric if (__n > 0) 1892*0b57cec5SDimitry Andric { 1893*0b57cec5SDimitry Andric __result -= __n; 1894*0b57cec5SDimitry Andric _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 1895*0b57cec5SDimitry Andric } 1896*0b57cec5SDimitry Andric return __result; 1897*0b57cec5SDimitry Andric} 1898*0b57cec5SDimitry Andric 1899*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 1900*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 1901*0b57cec5SDimitry Andric_BidirectionalIterator2 1902*0b57cec5SDimitry Andricmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 1903*0b57cec5SDimitry Andric _BidirectionalIterator2 __result) 1904*0b57cec5SDimitry Andric{ 1905*0b57cec5SDimitry Andric return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 1906*0b57cec5SDimitry Andric} 1907*0b57cec5SDimitry Andric 1908*0b57cec5SDimitry Andric// iter_swap 1909*0b57cec5SDimitry Andric 1910*0b57cec5SDimitry Andric// moved to <type_traits> for better swap / noexcept support 1911*0b57cec5SDimitry Andric 1912*0b57cec5SDimitry Andric// transform 1913*0b57cec5SDimitry Andric 1914*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 1915*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1916*0b57cec5SDimitry Andric_OutputIterator 1917*0b57cec5SDimitry Andrictransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 1918*0b57cec5SDimitry Andric{ 1919*0b57cec5SDimitry Andric for (; __first != __last; ++__first, (void) ++__result) 1920*0b57cec5SDimitry Andric *__result = __op(*__first); 1921*0b57cec5SDimitry Andric return __result; 1922*0b57cec5SDimitry Andric} 1923*0b57cec5SDimitry Andric 1924*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 1925*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1926*0b57cec5SDimitry Andric_OutputIterator 1927*0b57cec5SDimitry Andrictransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 1928*0b57cec5SDimitry Andric _OutputIterator __result, _BinaryOperation __binary_op) 1929*0b57cec5SDimitry Andric{ 1930*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 1931*0b57cec5SDimitry Andric *__result = __binary_op(*__first1, *__first2); 1932*0b57cec5SDimitry Andric return __result; 1933*0b57cec5SDimitry Andric} 1934*0b57cec5SDimitry Andric 1935*0b57cec5SDimitry Andric// replace 1936*0b57cec5SDimitry Andric 1937*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp> 1938*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1939*0b57cec5SDimitry Andricvoid 1940*0b57cec5SDimitry Andricreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 1941*0b57cec5SDimitry Andric{ 1942*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 1943*0b57cec5SDimitry Andric if (*__first == __old_value) 1944*0b57cec5SDimitry Andric *__first = __new_value; 1945*0b57cec5SDimitry Andric} 1946*0b57cec5SDimitry Andric 1947*0b57cec5SDimitry Andric// replace_if 1948*0b57cec5SDimitry Andric 1949*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Predicate, class _Tp> 1950*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1951*0b57cec5SDimitry Andricvoid 1952*0b57cec5SDimitry Andricreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 1953*0b57cec5SDimitry Andric{ 1954*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 1955*0b57cec5SDimitry Andric if (__pred(*__first)) 1956*0b57cec5SDimitry Andric *__first = __new_value; 1957*0b57cec5SDimitry Andric} 1958*0b57cec5SDimitry Andric 1959*0b57cec5SDimitry Andric// replace_copy 1960*0b57cec5SDimitry Andric 1961*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator, class _Tp> 1962*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1963*0b57cec5SDimitry Andric_OutputIterator 1964*0b57cec5SDimitry Andricreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 1965*0b57cec5SDimitry Andric const _Tp& __old_value, const _Tp& __new_value) 1966*0b57cec5SDimitry Andric{ 1967*0b57cec5SDimitry Andric for (; __first != __last; ++__first, (void) ++__result) 1968*0b57cec5SDimitry Andric if (*__first == __old_value) 1969*0b57cec5SDimitry Andric *__result = __new_value; 1970*0b57cec5SDimitry Andric else 1971*0b57cec5SDimitry Andric *__result = *__first; 1972*0b57cec5SDimitry Andric return __result; 1973*0b57cec5SDimitry Andric} 1974*0b57cec5SDimitry Andric 1975*0b57cec5SDimitry Andric// replace_copy_if 1976*0b57cec5SDimitry Andric 1977*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 1978*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1979*0b57cec5SDimitry Andric_OutputIterator 1980*0b57cec5SDimitry Andricreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 1981*0b57cec5SDimitry Andric _Predicate __pred, const _Tp& __new_value) 1982*0b57cec5SDimitry Andric{ 1983*0b57cec5SDimitry Andric for (; __first != __last; ++__first, (void) ++__result) 1984*0b57cec5SDimitry Andric if (__pred(*__first)) 1985*0b57cec5SDimitry Andric *__result = __new_value; 1986*0b57cec5SDimitry Andric else 1987*0b57cec5SDimitry Andric *__result = *__first; 1988*0b57cec5SDimitry Andric return __result; 1989*0b57cec5SDimitry Andric} 1990*0b57cec5SDimitry Andric 1991*0b57cec5SDimitry Andric// fill_n 1992*0b57cec5SDimitry Andric 1993*0b57cec5SDimitry Andrictemplate <class _OutputIterator, class _Size, class _Tp> 1994*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1995*0b57cec5SDimitry Andric_OutputIterator 1996*0b57cec5SDimitry Andric__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 1997*0b57cec5SDimitry Andric{ 1998*0b57cec5SDimitry Andric for (; __n > 0; ++__first, (void) --__n) 1999*0b57cec5SDimitry Andric *__first = __value_; 2000*0b57cec5SDimitry Andric return __first; 2001*0b57cec5SDimitry Andric} 2002*0b57cec5SDimitry Andric 2003*0b57cec5SDimitry Andrictemplate <class _OutputIterator, class _Size, class _Tp> 2004*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2005*0b57cec5SDimitry Andric_OutputIterator 2006*0b57cec5SDimitry Andricfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 2007*0b57cec5SDimitry Andric{ 2008*0b57cec5SDimitry Andric return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 2009*0b57cec5SDimitry Andric} 2010*0b57cec5SDimitry Andric 2011*0b57cec5SDimitry Andric// fill 2012*0b57cec5SDimitry Andric 2013*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp> 2014*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2015*0b57cec5SDimitry Andricvoid 2016*0b57cec5SDimitry Andric__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 2017*0b57cec5SDimitry Andric{ 2018*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 2019*0b57cec5SDimitry Andric *__first = __value_; 2020*0b57cec5SDimitry Andric} 2021*0b57cec5SDimitry Andric 2022*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Tp> 2023*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2024*0b57cec5SDimitry Andricvoid 2025*0b57cec5SDimitry Andric__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 2026*0b57cec5SDimitry Andric{ 2027*0b57cec5SDimitry Andric _VSTD::fill_n(__first, __last - __first, __value_); 2028*0b57cec5SDimitry Andric} 2029*0b57cec5SDimitry Andric 2030*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp> 2031*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2032*0b57cec5SDimitry Andricvoid 2033*0b57cec5SDimitry Andricfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 2034*0b57cec5SDimitry Andric{ 2035*0b57cec5SDimitry Andric _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 2036*0b57cec5SDimitry Andric} 2037*0b57cec5SDimitry Andric 2038*0b57cec5SDimitry Andric// generate 2039*0b57cec5SDimitry Andric 2040*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Generator> 2041*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2042*0b57cec5SDimitry Andricvoid 2043*0b57cec5SDimitry Andricgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 2044*0b57cec5SDimitry Andric{ 2045*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 2046*0b57cec5SDimitry Andric *__first = __gen(); 2047*0b57cec5SDimitry Andric} 2048*0b57cec5SDimitry Andric 2049*0b57cec5SDimitry Andric// generate_n 2050*0b57cec5SDimitry Andric 2051*0b57cec5SDimitry Andrictemplate <class _OutputIterator, class _Size, class _Generator> 2052*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2053*0b57cec5SDimitry Andric_OutputIterator 2054*0b57cec5SDimitry Andricgenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 2055*0b57cec5SDimitry Andric{ 2056*0b57cec5SDimitry Andric typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 2057*0b57cec5SDimitry Andric _IntegralSize __n = __orig_n; 2058*0b57cec5SDimitry Andric for (; __n > 0; ++__first, (void) --__n) 2059*0b57cec5SDimitry Andric *__first = __gen(); 2060*0b57cec5SDimitry Andric return __first; 2061*0b57cec5SDimitry Andric} 2062*0b57cec5SDimitry Andric 2063*0b57cec5SDimitry Andric// remove 2064*0b57cec5SDimitry Andric 2065*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp> 2066*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2067*0b57cec5SDimitry Andricremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 2068*0b57cec5SDimitry Andric{ 2069*0b57cec5SDimitry Andric __first = _VSTD::find(__first, __last, __value_); 2070*0b57cec5SDimitry Andric if (__first != __last) 2071*0b57cec5SDimitry Andric { 2072*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 2073*0b57cec5SDimitry Andric while (++__i != __last) 2074*0b57cec5SDimitry Andric { 2075*0b57cec5SDimitry Andric if (!(*__i == __value_)) 2076*0b57cec5SDimitry Andric { 2077*0b57cec5SDimitry Andric *__first = _VSTD::move(*__i); 2078*0b57cec5SDimitry Andric ++__first; 2079*0b57cec5SDimitry Andric } 2080*0b57cec5SDimitry Andric } 2081*0b57cec5SDimitry Andric } 2082*0b57cec5SDimitry Andric return __first; 2083*0b57cec5SDimitry Andric} 2084*0b57cec5SDimitry Andric 2085*0b57cec5SDimitry Andric// remove_if 2086*0b57cec5SDimitry Andric 2087*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Predicate> 2088*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2089*0b57cec5SDimitry Andricremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 2090*0b57cec5SDimitry Andric{ 2091*0b57cec5SDimitry Andric __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 2092*0b57cec5SDimitry Andric (__first, __last, __pred); 2093*0b57cec5SDimitry Andric if (__first != __last) 2094*0b57cec5SDimitry Andric { 2095*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 2096*0b57cec5SDimitry Andric while (++__i != __last) 2097*0b57cec5SDimitry Andric { 2098*0b57cec5SDimitry Andric if (!__pred(*__i)) 2099*0b57cec5SDimitry Andric { 2100*0b57cec5SDimitry Andric *__first = _VSTD::move(*__i); 2101*0b57cec5SDimitry Andric ++__first; 2102*0b57cec5SDimitry Andric } 2103*0b57cec5SDimitry Andric } 2104*0b57cec5SDimitry Andric } 2105*0b57cec5SDimitry Andric return __first; 2106*0b57cec5SDimitry Andric} 2107*0b57cec5SDimitry Andric 2108*0b57cec5SDimitry Andric// remove_copy 2109*0b57cec5SDimitry Andric 2110*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator, class _Tp> 2111*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2112*0b57cec5SDimitry Andric_OutputIterator 2113*0b57cec5SDimitry Andricremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 2114*0b57cec5SDimitry Andric{ 2115*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 2116*0b57cec5SDimitry Andric { 2117*0b57cec5SDimitry Andric if (!(*__first == __value_)) 2118*0b57cec5SDimitry Andric { 2119*0b57cec5SDimitry Andric *__result = *__first; 2120*0b57cec5SDimitry Andric ++__result; 2121*0b57cec5SDimitry Andric } 2122*0b57cec5SDimitry Andric } 2123*0b57cec5SDimitry Andric return __result; 2124*0b57cec5SDimitry Andric} 2125*0b57cec5SDimitry Andric 2126*0b57cec5SDimitry Andric// remove_copy_if 2127*0b57cec5SDimitry Andric 2128*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2129*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2130*0b57cec5SDimitry Andric_OutputIterator 2131*0b57cec5SDimitry Andricremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 2132*0b57cec5SDimitry Andric{ 2133*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 2134*0b57cec5SDimitry Andric { 2135*0b57cec5SDimitry Andric if (!__pred(*__first)) 2136*0b57cec5SDimitry Andric { 2137*0b57cec5SDimitry Andric *__result = *__first; 2138*0b57cec5SDimitry Andric ++__result; 2139*0b57cec5SDimitry Andric } 2140*0b57cec5SDimitry Andric } 2141*0b57cec5SDimitry Andric return __result; 2142*0b57cec5SDimitry Andric} 2143*0b57cec5SDimitry Andric 2144*0b57cec5SDimitry Andric// unique 2145*0b57cec5SDimitry Andric 2146*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _BinaryPredicate> 2147*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2148*0b57cec5SDimitry Andricunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 2149*0b57cec5SDimitry Andric{ 2150*0b57cec5SDimitry Andric __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 2151*0b57cec5SDimitry Andric (__first, __last, __pred); 2152*0b57cec5SDimitry Andric if (__first != __last) 2153*0b57cec5SDimitry Andric { 2154*0b57cec5SDimitry Andric // ... a a ? ... 2155*0b57cec5SDimitry Andric // f i 2156*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 2157*0b57cec5SDimitry Andric for (++__i; ++__i != __last;) 2158*0b57cec5SDimitry Andric if (!__pred(*__first, *__i)) 2159*0b57cec5SDimitry Andric *++__first = _VSTD::move(*__i); 2160*0b57cec5SDimitry Andric ++__first; 2161*0b57cec5SDimitry Andric } 2162*0b57cec5SDimitry Andric return __first; 2163*0b57cec5SDimitry Andric} 2164*0b57cec5SDimitry Andric 2165*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 2166*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2167*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2168*0b57cec5SDimitry Andric_ForwardIterator 2169*0b57cec5SDimitry Andricunique(_ForwardIterator __first, _ForwardIterator __last) 2170*0b57cec5SDimitry Andric{ 2171*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2172*0b57cec5SDimitry Andric return _VSTD::unique(__first, __last, __equal_to<__v>()); 2173*0b57cec5SDimitry Andric} 2174*0b57cec5SDimitry Andric 2175*0b57cec5SDimitry Andric// unique_copy 2176*0b57cec5SDimitry Andric 2177*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 2178*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 2179*0b57cec5SDimitry Andric__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 2180*0b57cec5SDimitry Andric input_iterator_tag, output_iterator_tag) 2181*0b57cec5SDimitry Andric{ 2182*0b57cec5SDimitry Andric if (__first != __last) 2183*0b57cec5SDimitry Andric { 2184*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator>::value_type __t(*__first); 2185*0b57cec5SDimitry Andric *__result = __t; 2186*0b57cec5SDimitry Andric ++__result; 2187*0b57cec5SDimitry Andric while (++__first != __last) 2188*0b57cec5SDimitry Andric { 2189*0b57cec5SDimitry Andric if (!__pred(__t, *__first)) 2190*0b57cec5SDimitry Andric { 2191*0b57cec5SDimitry Andric __t = *__first; 2192*0b57cec5SDimitry Andric *__result = __t; 2193*0b57cec5SDimitry Andric ++__result; 2194*0b57cec5SDimitry Andric } 2195*0b57cec5SDimitry Andric } 2196*0b57cec5SDimitry Andric } 2197*0b57cec5SDimitry Andric return __result; 2198*0b57cec5SDimitry Andric} 2199*0b57cec5SDimitry Andric 2200*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 2201*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 2202*0b57cec5SDimitry Andric__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 2203*0b57cec5SDimitry Andric forward_iterator_tag, output_iterator_tag) 2204*0b57cec5SDimitry Andric{ 2205*0b57cec5SDimitry Andric if (__first != __last) 2206*0b57cec5SDimitry Andric { 2207*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 2208*0b57cec5SDimitry Andric *__result = *__i; 2209*0b57cec5SDimitry Andric ++__result; 2210*0b57cec5SDimitry Andric while (++__first != __last) 2211*0b57cec5SDimitry Andric { 2212*0b57cec5SDimitry Andric if (!__pred(*__i, *__first)) 2213*0b57cec5SDimitry Andric { 2214*0b57cec5SDimitry Andric *__result = *__first; 2215*0b57cec5SDimitry Andric ++__result; 2216*0b57cec5SDimitry Andric __i = __first; 2217*0b57cec5SDimitry Andric } 2218*0b57cec5SDimitry Andric } 2219*0b57cec5SDimitry Andric } 2220*0b57cec5SDimitry Andric return __result; 2221*0b57cec5SDimitry Andric} 2222*0b57cec5SDimitry Andric 2223*0b57cec5SDimitry Andrictemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 2224*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2225*0b57cec5SDimitry Andric__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 2226*0b57cec5SDimitry Andric input_iterator_tag, forward_iterator_tag) 2227*0b57cec5SDimitry Andric{ 2228*0b57cec5SDimitry Andric if (__first != __last) 2229*0b57cec5SDimitry Andric { 2230*0b57cec5SDimitry Andric *__result = *__first; 2231*0b57cec5SDimitry Andric while (++__first != __last) 2232*0b57cec5SDimitry Andric if (!__pred(*__result, *__first)) 2233*0b57cec5SDimitry Andric *++__result = *__first; 2234*0b57cec5SDimitry Andric ++__result; 2235*0b57cec5SDimitry Andric } 2236*0b57cec5SDimitry Andric return __result; 2237*0b57cec5SDimitry Andric} 2238*0b57cec5SDimitry Andric 2239*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 2240*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2241*0b57cec5SDimitry Andric_OutputIterator 2242*0b57cec5SDimitry Andricunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 2243*0b57cec5SDimitry Andric{ 2244*0b57cec5SDimitry Andric return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 2245*0b57cec5SDimitry Andric (__first, __last, __result, __pred, 2246*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator>::iterator_category(), 2247*0b57cec5SDimitry Andric typename iterator_traits<_OutputIterator>::iterator_category()); 2248*0b57cec5SDimitry Andric} 2249*0b57cec5SDimitry Andric 2250*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator> 2251*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2252*0b57cec5SDimitry Andric_OutputIterator 2253*0b57cec5SDimitry Andricunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 2254*0b57cec5SDimitry Andric{ 2255*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator>::value_type __v; 2256*0b57cec5SDimitry Andric return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 2257*0b57cec5SDimitry Andric} 2258*0b57cec5SDimitry Andric 2259*0b57cec5SDimitry Andric// reverse 2260*0b57cec5SDimitry Andric 2261*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator> 2262*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2263*0b57cec5SDimitry Andricvoid 2264*0b57cec5SDimitry Andric__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 2265*0b57cec5SDimitry Andric{ 2266*0b57cec5SDimitry Andric while (__first != __last) 2267*0b57cec5SDimitry Andric { 2268*0b57cec5SDimitry Andric if (__first == --__last) 2269*0b57cec5SDimitry Andric break; 2270*0b57cec5SDimitry Andric _VSTD::iter_swap(__first, __last); 2271*0b57cec5SDimitry Andric ++__first; 2272*0b57cec5SDimitry Andric } 2273*0b57cec5SDimitry Andric} 2274*0b57cec5SDimitry Andric 2275*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 2276*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2277*0b57cec5SDimitry Andricvoid 2278*0b57cec5SDimitry Andric__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 2279*0b57cec5SDimitry Andric{ 2280*0b57cec5SDimitry Andric if (__first != __last) 2281*0b57cec5SDimitry Andric for (; __first < --__last; ++__first) 2282*0b57cec5SDimitry Andric _VSTD::iter_swap(__first, __last); 2283*0b57cec5SDimitry Andric} 2284*0b57cec5SDimitry Andric 2285*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator> 2286*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2287*0b57cec5SDimitry Andricvoid 2288*0b57cec5SDimitry Andricreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 2289*0b57cec5SDimitry Andric{ 2290*0b57cec5SDimitry Andric _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 2291*0b57cec5SDimitry Andric} 2292*0b57cec5SDimitry Andric 2293*0b57cec5SDimitry Andric// reverse_copy 2294*0b57cec5SDimitry Andric 2295*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator, class _OutputIterator> 2296*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 2297*0b57cec5SDimitry Andric_OutputIterator 2298*0b57cec5SDimitry Andricreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 2299*0b57cec5SDimitry Andric{ 2300*0b57cec5SDimitry Andric for (; __first != __last; ++__result) 2301*0b57cec5SDimitry Andric *__result = *--__last; 2302*0b57cec5SDimitry Andric return __result; 2303*0b57cec5SDimitry Andric} 2304*0b57cec5SDimitry Andric 2305*0b57cec5SDimitry Andric// rotate 2306*0b57cec5SDimitry Andric 2307*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 2308*0b57cec5SDimitry Andric_ForwardIterator 2309*0b57cec5SDimitry Andric__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 2310*0b57cec5SDimitry Andric{ 2311*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2312*0b57cec5SDimitry Andric value_type __tmp = _VSTD::move(*__first); 2313*0b57cec5SDimitry Andric _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2314*0b57cec5SDimitry Andric *__lm1 = _VSTD::move(__tmp); 2315*0b57cec5SDimitry Andric return __lm1; 2316*0b57cec5SDimitry Andric} 2317*0b57cec5SDimitry Andric 2318*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator> 2319*0b57cec5SDimitry Andric_BidirectionalIterator 2320*0b57cec5SDimitry Andric__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2321*0b57cec5SDimitry Andric{ 2322*0b57cec5SDimitry Andric typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2323*0b57cec5SDimitry Andric _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2324*0b57cec5SDimitry Andric value_type __tmp = _VSTD::move(*__lm1); 2325*0b57cec5SDimitry Andric _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2326*0b57cec5SDimitry Andric *__first = _VSTD::move(__tmp); 2327*0b57cec5SDimitry Andric return __fp1; 2328*0b57cec5SDimitry Andric} 2329*0b57cec5SDimitry Andric 2330*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 2331*0b57cec5SDimitry Andric_ForwardIterator 2332*0b57cec5SDimitry Andric__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2333*0b57cec5SDimitry Andric{ 2334*0b57cec5SDimitry Andric _ForwardIterator __i = __middle; 2335*0b57cec5SDimitry Andric while (true) 2336*0b57cec5SDimitry Andric { 2337*0b57cec5SDimitry Andric swap(*__first, *__i); 2338*0b57cec5SDimitry Andric ++__first; 2339*0b57cec5SDimitry Andric if (++__i == __last) 2340*0b57cec5SDimitry Andric break; 2341*0b57cec5SDimitry Andric if (__first == __middle) 2342*0b57cec5SDimitry Andric __middle = __i; 2343*0b57cec5SDimitry Andric } 2344*0b57cec5SDimitry Andric _ForwardIterator __r = __first; 2345*0b57cec5SDimitry Andric if (__first != __middle) 2346*0b57cec5SDimitry Andric { 2347*0b57cec5SDimitry Andric __i = __middle; 2348*0b57cec5SDimitry Andric while (true) 2349*0b57cec5SDimitry Andric { 2350*0b57cec5SDimitry Andric swap(*__first, *__i); 2351*0b57cec5SDimitry Andric ++__first; 2352*0b57cec5SDimitry Andric if (++__i == __last) 2353*0b57cec5SDimitry Andric { 2354*0b57cec5SDimitry Andric if (__first == __middle) 2355*0b57cec5SDimitry Andric break; 2356*0b57cec5SDimitry Andric __i = __middle; 2357*0b57cec5SDimitry Andric } 2358*0b57cec5SDimitry Andric else if (__first == __middle) 2359*0b57cec5SDimitry Andric __middle = __i; 2360*0b57cec5SDimitry Andric } 2361*0b57cec5SDimitry Andric } 2362*0b57cec5SDimitry Andric return __r; 2363*0b57cec5SDimitry Andric} 2364*0b57cec5SDimitry Andric 2365*0b57cec5SDimitry Andrictemplate<typename _Integral> 2366*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2367*0b57cec5SDimitry Andric_Integral 2368*0b57cec5SDimitry Andric__algo_gcd(_Integral __x, _Integral __y) 2369*0b57cec5SDimitry Andric{ 2370*0b57cec5SDimitry Andric do 2371*0b57cec5SDimitry Andric { 2372*0b57cec5SDimitry Andric _Integral __t = __x % __y; 2373*0b57cec5SDimitry Andric __x = __y; 2374*0b57cec5SDimitry Andric __y = __t; 2375*0b57cec5SDimitry Andric } while (__y); 2376*0b57cec5SDimitry Andric return __x; 2377*0b57cec5SDimitry Andric} 2378*0b57cec5SDimitry Andric 2379*0b57cec5SDimitry Andrictemplate<typename _RandomAccessIterator> 2380*0b57cec5SDimitry Andric_RandomAccessIterator 2381*0b57cec5SDimitry Andric__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 2382*0b57cec5SDimitry Andric{ 2383*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2384*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 2385*0b57cec5SDimitry Andric 2386*0b57cec5SDimitry Andric const difference_type __m1 = __middle - __first; 2387*0b57cec5SDimitry Andric const difference_type __m2 = __last - __middle; 2388*0b57cec5SDimitry Andric if (__m1 == __m2) 2389*0b57cec5SDimitry Andric { 2390*0b57cec5SDimitry Andric _VSTD::swap_ranges(__first, __middle, __middle); 2391*0b57cec5SDimitry Andric return __middle; 2392*0b57cec5SDimitry Andric } 2393*0b57cec5SDimitry Andric const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 2394*0b57cec5SDimitry Andric for (_RandomAccessIterator __p = __first + __g; __p != __first;) 2395*0b57cec5SDimitry Andric { 2396*0b57cec5SDimitry Andric value_type __t(_VSTD::move(*--__p)); 2397*0b57cec5SDimitry Andric _RandomAccessIterator __p1 = __p; 2398*0b57cec5SDimitry Andric _RandomAccessIterator __p2 = __p1 + __m1; 2399*0b57cec5SDimitry Andric do 2400*0b57cec5SDimitry Andric { 2401*0b57cec5SDimitry Andric *__p1 = _VSTD::move(*__p2); 2402*0b57cec5SDimitry Andric __p1 = __p2; 2403*0b57cec5SDimitry Andric const difference_type __d = __last - __p2; 2404*0b57cec5SDimitry Andric if (__m1 < __d) 2405*0b57cec5SDimitry Andric __p2 += __m1; 2406*0b57cec5SDimitry Andric else 2407*0b57cec5SDimitry Andric __p2 = __first + (__m1 - __d); 2408*0b57cec5SDimitry Andric } while (__p2 != __p); 2409*0b57cec5SDimitry Andric *__p1 = _VSTD::move(__t); 2410*0b57cec5SDimitry Andric } 2411*0b57cec5SDimitry Andric return __first + __m2; 2412*0b57cec5SDimitry Andric} 2413*0b57cec5SDimitry Andric 2414*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 2415*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2416*0b57cec5SDimitry Andric_ForwardIterator 2417*0b57cec5SDimitry Andric__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2418*0b57cec5SDimitry Andric _VSTD::forward_iterator_tag) 2419*0b57cec5SDimitry Andric{ 2420*0b57cec5SDimitry Andric typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2421*0b57cec5SDimitry Andric if (_VSTD::is_trivially_move_assignable<value_type>::value) 2422*0b57cec5SDimitry Andric { 2423*0b57cec5SDimitry Andric if (_VSTD::next(__first) == __middle) 2424*0b57cec5SDimitry Andric return _VSTD::__rotate_left(__first, __last); 2425*0b57cec5SDimitry Andric } 2426*0b57cec5SDimitry Andric return _VSTD::__rotate_forward(__first, __middle, __last); 2427*0b57cec5SDimitry Andric} 2428*0b57cec5SDimitry Andric 2429*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator> 2430*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2431*0b57cec5SDimitry Andric_BidirectionalIterator 2432*0b57cec5SDimitry Andric__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2433*0b57cec5SDimitry Andric _VSTD::bidirectional_iterator_tag) 2434*0b57cec5SDimitry Andric{ 2435*0b57cec5SDimitry Andric typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2436*0b57cec5SDimitry Andric if (_VSTD::is_trivially_move_assignable<value_type>::value) 2437*0b57cec5SDimitry Andric { 2438*0b57cec5SDimitry Andric if (_VSTD::next(__first) == __middle) 2439*0b57cec5SDimitry Andric return _VSTD::__rotate_left(__first, __last); 2440*0b57cec5SDimitry Andric if (_VSTD::next(__middle) == __last) 2441*0b57cec5SDimitry Andric return _VSTD::__rotate_right(__first, __last); 2442*0b57cec5SDimitry Andric } 2443*0b57cec5SDimitry Andric return _VSTD::__rotate_forward(__first, __middle, __last); 2444*0b57cec5SDimitry Andric} 2445*0b57cec5SDimitry Andric 2446*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 2447*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2448*0b57cec5SDimitry Andric_RandomAccessIterator 2449*0b57cec5SDimitry Andric__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2450*0b57cec5SDimitry Andric _VSTD::random_access_iterator_tag) 2451*0b57cec5SDimitry Andric{ 2452*0b57cec5SDimitry Andric typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2453*0b57cec5SDimitry Andric if (_VSTD::is_trivially_move_assignable<value_type>::value) 2454*0b57cec5SDimitry Andric { 2455*0b57cec5SDimitry Andric if (_VSTD::next(__first) == __middle) 2456*0b57cec5SDimitry Andric return _VSTD::__rotate_left(__first, __last); 2457*0b57cec5SDimitry Andric if (_VSTD::next(__middle) == __last) 2458*0b57cec5SDimitry Andric return _VSTD::__rotate_right(__first, __last); 2459*0b57cec5SDimitry Andric return _VSTD::__rotate_gcd(__first, __middle, __last); 2460*0b57cec5SDimitry Andric } 2461*0b57cec5SDimitry Andric return _VSTD::__rotate_forward(__first, __middle, __last); 2462*0b57cec5SDimitry Andric} 2463*0b57cec5SDimitry Andric 2464*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 2465*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2466*0b57cec5SDimitry Andric_ForwardIterator 2467*0b57cec5SDimitry Andricrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2468*0b57cec5SDimitry Andric{ 2469*0b57cec5SDimitry Andric if (__first == __middle) 2470*0b57cec5SDimitry Andric return __last; 2471*0b57cec5SDimitry Andric if (__middle == __last) 2472*0b57cec5SDimitry Andric return __first; 2473*0b57cec5SDimitry Andric return _VSTD::__rotate(__first, __middle, __last, 2474*0b57cec5SDimitry Andric typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 2475*0b57cec5SDimitry Andric} 2476*0b57cec5SDimitry Andric 2477*0b57cec5SDimitry Andric// rotate_copy 2478*0b57cec5SDimitry Andric 2479*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _OutputIterator> 2480*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 2481*0b57cec5SDimitry Andric_OutputIterator 2482*0b57cec5SDimitry Andricrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 2483*0b57cec5SDimitry Andric{ 2484*0b57cec5SDimitry Andric return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 2485*0b57cec5SDimitry Andric} 2486*0b57cec5SDimitry Andric 2487*0b57cec5SDimitry Andric// min_element 2488*0b57cec5SDimitry Andric 2489*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Compare> 2490*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2491*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2492*0b57cec5SDimitry Andric_ForwardIterator 2493*0b57cec5SDimitry Andricmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 2494*0b57cec5SDimitry Andric{ 2495*0b57cec5SDimitry Andric static_assert(__is_forward_iterator<_ForwardIterator>::value, 2496*0b57cec5SDimitry Andric "std::min_element requires a ForwardIterator"); 2497*0b57cec5SDimitry Andric if (__first != __last) 2498*0b57cec5SDimitry Andric { 2499*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 2500*0b57cec5SDimitry Andric while (++__i != __last) 2501*0b57cec5SDimitry Andric if (__comp(*__i, *__first)) 2502*0b57cec5SDimitry Andric __first = __i; 2503*0b57cec5SDimitry Andric } 2504*0b57cec5SDimitry Andric return __first; 2505*0b57cec5SDimitry Andric} 2506*0b57cec5SDimitry Andric 2507*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 2508*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2509*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2510*0b57cec5SDimitry Andric_ForwardIterator 2511*0b57cec5SDimitry Andricmin_element(_ForwardIterator __first, _ForwardIterator __last) 2512*0b57cec5SDimitry Andric{ 2513*0b57cec5SDimitry Andric return _VSTD::min_element(__first, __last, 2514*0b57cec5SDimitry Andric __less<typename iterator_traits<_ForwardIterator>::value_type>()); 2515*0b57cec5SDimitry Andric} 2516*0b57cec5SDimitry Andric 2517*0b57cec5SDimitry Andric// min 2518*0b57cec5SDimitry Andric 2519*0b57cec5SDimitry Andrictemplate <class _Tp, class _Compare> 2520*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2521*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2522*0b57cec5SDimitry Andricconst _Tp& 2523*0b57cec5SDimitry Andricmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 2524*0b57cec5SDimitry Andric{ 2525*0b57cec5SDimitry Andric return __comp(__b, __a) ? __b : __a; 2526*0b57cec5SDimitry Andric} 2527*0b57cec5SDimitry Andric 2528*0b57cec5SDimitry Andrictemplate <class _Tp> 2529*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2530*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2531*0b57cec5SDimitry Andricconst _Tp& 2532*0b57cec5SDimitry Andricmin(const _Tp& __a, const _Tp& __b) 2533*0b57cec5SDimitry Andric{ 2534*0b57cec5SDimitry Andric return _VSTD::min(__a, __b, __less<_Tp>()); 2535*0b57cec5SDimitry Andric} 2536*0b57cec5SDimitry Andric 2537*0b57cec5SDimitry Andric#ifndef _LIBCPP_CXX03_LANG 2538*0b57cec5SDimitry Andric 2539*0b57cec5SDimitry Andrictemplate<class _Tp, class _Compare> 2540*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2541*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2542*0b57cec5SDimitry Andric_Tp 2543*0b57cec5SDimitry Andricmin(initializer_list<_Tp> __t, _Compare __comp) 2544*0b57cec5SDimitry Andric{ 2545*0b57cec5SDimitry Andric return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 2546*0b57cec5SDimitry Andric} 2547*0b57cec5SDimitry Andric 2548*0b57cec5SDimitry Andrictemplate<class _Tp> 2549*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2550*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2551*0b57cec5SDimitry Andric_Tp 2552*0b57cec5SDimitry Andricmin(initializer_list<_Tp> __t) 2553*0b57cec5SDimitry Andric{ 2554*0b57cec5SDimitry Andric return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 2555*0b57cec5SDimitry Andric} 2556*0b57cec5SDimitry Andric 2557*0b57cec5SDimitry Andric#endif // _LIBCPP_CXX03_LANG 2558*0b57cec5SDimitry Andric 2559*0b57cec5SDimitry Andric// max_element 2560*0b57cec5SDimitry Andric 2561*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Compare> 2562*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2563*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2564*0b57cec5SDimitry Andric_ForwardIterator 2565*0b57cec5SDimitry Andricmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 2566*0b57cec5SDimitry Andric{ 2567*0b57cec5SDimitry Andric static_assert(__is_forward_iterator<_ForwardIterator>::value, 2568*0b57cec5SDimitry Andric "std::max_element requires a ForwardIterator"); 2569*0b57cec5SDimitry Andric if (__first != __last) 2570*0b57cec5SDimitry Andric { 2571*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 2572*0b57cec5SDimitry Andric while (++__i != __last) 2573*0b57cec5SDimitry Andric if (__comp(*__first, *__i)) 2574*0b57cec5SDimitry Andric __first = __i; 2575*0b57cec5SDimitry Andric } 2576*0b57cec5SDimitry Andric return __first; 2577*0b57cec5SDimitry Andric} 2578*0b57cec5SDimitry Andric 2579*0b57cec5SDimitry Andric 2580*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 2581*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2582*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2583*0b57cec5SDimitry Andric_ForwardIterator 2584*0b57cec5SDimitry Andricmax_element(_ForwardIterator __first, _ForwardIterator __last) 2585*0b57cec5SDimitry Andric{ 2586*0b57cec5SDimitry Andric return _VSTD::max_element(__first, __last, 2587*0b57cec5SDimitry Andric __less<typename iterator_traits<_ForwardIterator>::value_type>()); 2588*0b57cec5SDimitry Andric} 2589*0b57cec5SDimitry Andric 2590*0b57cec5SDimitry Andric// max 2591*0b57cec5SDimitry Andric 2592*0b57cec5SDimitry Andrictemplate <class _Tp, class _Compare> 2593*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2594*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2595*0b57cec5SDimitry Andricconst _Tp& 2596*0b57cec5SDimitry Andricmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 2597*0b57cec5SDimitry Andric{ 2598*0b57cec5SDimitry Andric return __comp(__a, __b) ? __b : __a; 2599*0b57cec5SDimitry Andric} 2600*0b57cec5SDimitry Andric 2601*0b57cec5SDimitry Andrictemplate <class _Tp> 2602*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2603*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2604*0b57cec5SDimitry Andricconst _Tp& 2605*0b57cec5SDimitry Andricmax(const _Tp& __a, const _Tp& __b) 2606*0b57cec5SDimitry Andric{ 2607*0b57cec5SDimitry Andric return _VSTD::max(__a, __b, __less<_Tp>()); 2608*0b57cec5SDimitry Andric} 2609*0b57cec5SDimitry Andric 2610*0b57cec5SDimitry Andric#ifndef _LIBCPP_CXX03_LANG 2611*0b57cec5SDimitry Andric 2612*0b57cec5SDimitry Andrictemplate<class _Tp, class _Compare> 2613*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2614*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2615*0b57cec5SDimitry Andric_Tp 2616*0b57cec5SDimitry Andricmax(initializer_list<_Tp> __t, _Compare __comp) 2617*0b57cec5SDimitry Andric{ 2618*0b57cec5SDimitry Andric return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 2619*0b57cec5SDimitry Andric} 2620*0b57cec5SDimitry Andric 2621*0b57cec5SDimitry Andrictemplate<class _Tp> 2622*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2623*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2624*0b57cec5SDimitry Andric_Tp 2625*0b57cec5SDimitry Andricmax(initializer_list<_Tp> __t) 2626*0b57cec5SDimitry Andric{ 2627*0b57cec5SDimitry Andric return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 2628*0b57cec5SDimitry Andric} 2629*0b57cec5SDimitry Andric 2630*0b57cec5SDimitry Andric#endif // _LIBCPP_CXX03_LANG 2631*0b57cec5SDimitry Andric 2632*0b57cec5SDimitry Andric#if _LIBCPP_STD_VER > 14 2633*0b57cec5SDimitry Andric// clamp 2634*0b57cec5SDimitry Andrictemplate<class _Tp, class _Compare> 2635*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2636*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2637*0b57cec5SDimitry Andricconst _Tp& 2638*0b57cec5SDimitry Andricclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2639*0b57cec5SDimitry Andric{ 2640*0b57cec5SDimitry Andric _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2641*0b57cec5SDimitry Andric return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2642*0b57cec5SDimitry Andric 2643*0b57cec5SDimitry Andric} 2644*0b57cec5SDimitry Andric 2645*0b57cec5SDimitry Andrictemplate<class _Tp> 2646*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2647*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2648*0b57cec5SDimitry Andricconst _Tp& 2649*0b57cec5SDimitry Andricclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2650*0b57cec5SDimitry Andric{ 2651*0b57cec5SDimitry Andric return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2652*0b57cec5SDimitry Andric} 2653*0b57cec5SDimitry Andric#endif 2654*0b57cec5SDimitry Andric 2655*0b57cec5SDimitry Andric// minmax_element 2656*0b57cec5SDimitry Andric 2657*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Compare> 2658*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX11 2659*0b57cec5SDimitry Andricstd::pair<_ForwardIterator, _ForwardIterator> 2660*0b57cec5SDimitry Andricminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 2661*0b57cec5SDimitry Andric{ 2662*0b57cec5SDimitry Andric static_assert(__is_forward_iterator<_ForwardIterator>::value, 2663*0b57cec5SDimitry Andric "std::minmax_element requires a ForwardIterator"); 2664*0b57cec5SDimitry Andric std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 2665*0b57cec5SDimitry Andric if (__first != __last) 2666*0b57cec5SDimitry Andric { 2667*0b57cec5SDimitry Andric if (++__first != __last) 2668*0b57cec5SDimitry Andric { 2669*0b57cec5SDimitry Andric if (__comp(*__first, *__result.first)) 2670*0b57cec5SDimitry Andric __result.first = __first; 2671*0b57cec5SDimitry Andric else 2672*0b57cec5SDimitry Andric __result.second = __first; 2673*0b57cec5SDimitry Andric while (++__first != __last) 2674*0b57cec5SDimitry Andric { 2675*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 2676*0b57cec5SDimitry Andric if (++__first == __last) 2677*0b57cec5SDimitry Andric { 2678*0b57cec5SDimitry Andric if (__comp(*__i, *__result.first)) 2679*0b57cec5SDimitry Andric __result.first = __i; 2680*0b57cec5SDimitry Andric else if (!__comp(*__i, *__result.second)) 2681*0b57cec5SDimitry Andric __result.second = __i; 2682*0b57cec5SDimitry Andric break; 2683*0b57cec5SDimitry Andric } 2684*0b57cec5SDimitry Andric else 2685*0b57cec5SDimitry Andric { 2686*0b57cec5SDimitry Andric if (__comp(*__first, *__i)) 2687*0b57cec5SDimitry Andric { 2688*0b57cec5SDimitry Andric if (__comp(*__first, *__result.first)) 2689*0b57cec5SDimitry Andric __result.first = __first; 2690*0b57cec5SDimitry Andric if (!__comp(*__i, *__result.second)) 2691*0b57cec5SDimitry Andric __result.second = __i; 2692*0b57cec5SDimitry Andric } 2693*0b57cec5SDimitry Andric else 2694*0b57cec5SDimitry Andric { 2695*0b57cec5SDimitry Andric if (__comp(*__i, *__result.first)) 2696*0b57cec5SDimitry Andric __result.first = __i; 2697*0b57cec5SDimitry Andric if (!__comp(*__first, *__result.second)) 2698*0b57cec5SDimitry Andric __result.second = __first; 2699*0b57cec5SDimitry Andric } 2700*0b57cec5SDimitry Andric } 2701*0b57cec5SDimitry Andric } 2702*0b57cec5SDimitry Andric } 2703*0b57cec5SDimitry Andric } 2704*0b57cec5SDimitry Andric return __result; 2705*0b57cec5SDimitry Andric} 2706*0b57cec5SDimitry Andric 2707*0b57cec5SDimitry Andrictemplate <class _ForwardIterator> 2708*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2709*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2710*0b57cec5SDimitry Andricstd::pair<_ForwardIterator, _ForwardIterator> 2711*0b57cec5SDimitry Andricminmax_element(_ForwardIterator __first, _ForwardIterator __last) 2712*0b57cec5SDimitry Andric{ 2713*0b57cec5SDimitry Andric return _VSTD::minmax_element(__first, __last, 2714*0b57cec5SDimitry Andric __less<typename iterator_traits<_ForwardIterator>::value_type>()); 2715*0b57cec5SDimitry Andric} 2716*0b57cec5SDimitry Andric 2717*0b57cec5SDimitry Andric// minmax 2718*0b57cec5SDimitry Andric 2719*0b57cec5SDimitry Andrictemplate<class _Tp, class _Compare> 2720*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2721*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2722*0b57cec5SDimitry Andricpair<const _Tp&, const _Tp&> 2723*0b57cec5SDimitry Andricminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 2724*0b57cec5SDimitry Andric{ 2725*0b57cec5SDimitry Andric return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 2726*0b57cec5SDimitry Andric pair<const _Tp&, const _Tp&>(__a, __b); 2727*0b57cec5SDimitry Andric} 2728*0b57cec5SDimitry Andric 2729*0b57cec5SDimitry Andrictemplate<class _Tp> 2730*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2731*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2732*0b57cec5SDimitry Andricpair<const _Tp&, const _Tp&> 2733*0b57cec5SDimitry Andricminmax(const _Tp& __a, const _Tp& __b) 2734*0b57cec5SDimitry Andric{ 2735*0b57cec5SDimitry Andric return _VSTD::minmax(__a, __b, __less<_Tp>()); 2736*0b57cec5SDimitry Andric} 2737*0b57cec5SDimitry Andric 2738*0b57cec5SDimitry Andric#ifndef _LIBCPP_CXX03_LANG 2739*0b57cec5SDimitry Andric 2740*0b57cec5SDimitry Andrictemplate<class _Tp, class _Compare> 2741*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2742*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2743*0b57cec5SDimitry Andricpair<_Tp, _Tp> 2744*0b57cec5SDimitry Andricminmax(initializer_list<_Tp> __t, _Compare __comp) 2745*0b57cec5SDimitry Andric{ 2746*0b57cec5SDimitry Andric typedef typename initializer_list<_Tp>::const_iterator _Iter; 2747*0b57cec5SDimitry Andric _Iter __first = __t.begin(); 2748*0b57cec5SDimitry Andric _Iter __last = __t.end(); 2749*0b57cec5SDimitry Andric std::pair<_Tp, _Tp> __result(*__first, *__first); 2750*0b57cec5SDimitry Andric 2751*0b57cec5SDimitry Andric ++__first; 2752*0b57cec5SDimitry Andric if (__t.size() % 2 == 0) 2753*0b57cec5SDimitry Andric { 2754*0b57cec5SDimitry Andric if (__comp(*__first, __result.first)) 2755*0b57cec5SDimitry Andric __result.first = *__first; 2756*0b57cec5SDimitry Andric else 2757*0b57cec5SDimitry Andric __result.second = *__first; 2758*0b57cec5SDimitry Andric ++__first; 2759*0b57cec5SDimitry Andric } 2760*0b57cec5SDimitry Andric 2761*0b57cec5SDimitry Andric while (__first != __last) 2762*0b57cec5SDimitry Andric { 2763*0b57cec5SDimitry Andric _Tp __prev = *__first++; 2764*0b57cec5SDimitry Andric if (__comp(*__first, __prev)) { 2765*0b57cec5SDimitry Andric if ( __comp(*__first, __result.first)) __result.first = *__first; 2766*0b57cec5SDimitry Andric if (!__comp(__prev, __result.second)) __result.second = __prev; 2767*0b57cec5SDimitry Andric } 2768*0b57cec5SDimitry Andric else { 2769*0b57cec5SDimitry Andric if ( __comp(__prev, __result.first)) __result.first = __prev; 2770*0b57cec5SDimitry Andric if (!__comp(*__first, __result.second)) __result.second = *__first; 2771*0b57cec5SDimitry Andric } 2772*0b57cec5SDimitry Andric 2773*0b57cec5SDimitry Andric __first++; 2774*0b57cec5SDimitry Andric } 2775*0b57cec5SDimitry Andric return __result; 2776*0b57cec5SDimitry Andric} 2777*0b57cec5SDimitry Andric 2778*0b57cec5SDimitry Andrictemplate<class _Tp> 2779*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 2780*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2781*0b57cec5SDimitry Andricpair<_Tp, _Tp> 2782*0b57cec5SDimitry Andricminmax(initializer_list<_Tp> __t) 2783*0b57cec5SDimitry Andric{ 2784*0b57cec5SDimitry Andric return _VSTD::minmax(__t, __less<_Tp>()); 2785*0b57cec5SDimitry Andric} 2786*0b57cec5SDimitry Andric 2787*0b57cec5SDimitry Andric#endif // _LIBCPP_CXX03_LANG 2788*0b57cec5SDimitry Andric 2789*0b57cec5SDimitry Andric// random_shuffle 2790*0b57cec5SDimitry Andric 2791*0b57cec5SDimitry Andric// __independent_bits_engine 2792*0b57cec5SDimitry Andric 2793*0b57cec5SDimitry Andrictemplate <unsigned long long _Xp, size_t _Rp> 2794*0b57cec5SDimitry Andricstruct __log2_imp 2795*0b57cec5SDimitry Andric{ 2796*0b57cec5SDimitry Andric static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2797*0b57cec5SDimitry Andric : __log2_imp<_Xp, _Rp - 1>::value; 2798*0b57cec5SDimitry Andric}; 2799*0b57cec5SDimitry Andric 2800*0b57cec5SDimitry Andrictemplate <unsigned long long _Xp> 2801*0b57cec5SDimitry Andricstruct __log2_imp<_Xp, 0> 2802*0b57cec5SDimitry Andric{ 2803*0b57cec5SDimitry Andric static const size_t value = 0; 2804*0b57cec5SDimitry Andric}; 2805*0b57cec5SDimitry Andric 2806*0b57cec5SDimitry Andrictemplate <size_t _Rp> 2807*0b57cec5SDimitry Andricstruct __log2_imp<0, _Rp> 2808*0b57cec5SDimitry Andric{ 2809*0b57cec5SDimitry Andric static const size_t value = _Rp + 1; 2810*0b57cec5SDimitry Andric}; 2811*0b57cec5SDimitry Andric 2812*0b57cec5SDimitry Andrictemplate <class _UIntType, _UIntType _Xp> 2813*0b57cec5SDimitry Andricstruct __log2 2814*0b57cec5SDimitry Andric{ 2815*0b57cec5SDimitry Andric static const size_t value = __log2_imp<_Xp, 2816*0b57cec5SDimitry Andric sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 2817*0b57cec5SDimitry Andric}; 2818*0b57cec5SDimitry Andric 2819*0b57cec5SDimitry Andrictemplate<class _Engine, class _UIntType> 2820*0b57cec5SDimitry Andricclass __independent_bits_engine 2821*0b57cec5SDimitry Andric{ 2822*0b57cec5SDimitry Andricpublic: 2823*0b57cec5SDimitry Andric // types 2824*0b57cec5SDimitry Andric typedef _UIntType result_type; 2825*0b57cec5SDimitry Andric 2826*0b57cec5SDimitry Andricprivate: 2827*0b57cec5SDimitry Andric typedef typename _Engine::result_type _Engine_result_type; 2828*0b57cec5SDimitry Andric typedef typename conditional 2829*0b57cec5SDimitry Andric < 2830*0b57cec5SDimitry Andric sizeof(_Engine_result_type) <= sizeof(result_type), 2831*0b57cec5SDimitry Andric result_type, 2832*0b57cec5SDimitry Andric _Engine_result_type 2833*0b57cec5SDimitry Andric >::type _Working_result_type; 2834*0b57cec5SDimitry Andric 2835*0b57cec5SDimitry Andric _Engine& __e_; 2836*0b57cec5SDimitry Andric size_t __w_; 2837*0b57cec5SDimitry Andric size_t __w0_; 2838*0b57cec5SDimitry Andric size_t __n_; 2839*0b57cec5SDimitry Andric size_t __n0_; 2840*0b57cec5SDimitry Andric _Working_result_type __y0_; 2841*0b57cec5SDimitry Andric _Working_result_type __y1_; 2842*0b57cec5SDimitry Andric _Engine_result_type __mask0_; 2843*0b57cec5SDimitry Andric _Engine_result_type __mask1_; 2844*0b57cec5SDimitry Andric 2845*0b57cec5SDimitry Andric#ifdef _LIBCPP_CXX03_LANG 2846*0b57cec5SDimitry Andric static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2847*0b57cec5SDimitry Andric + _Working_result_type(1); 2848*0b57cec5SDimitry Andric#else 2849*0b57cec5SDimitry Andric static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2850*0b57cec5SDimitry Andric + _Working_result_type(1); 2851*0b57cec5SDimitry Andric#endif 2852*0b57cec5SDimitry Andric static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2853*0b57cec5SDimitry Andric static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2854*0b57cec5SDimitry Andric static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2855*0b57cec5SDimitry Andric 2856*0b57cec5SDimitry Andricpublic: 2857*0b57cec5SDimitry Andric // constructors and seeding functions 2858*0b57cec5SDimitry Andric __independent_bits_engine(_Engine& __e, size_t __w); 2859*0b57cec5SDimitry Andric 2860*0b57cec5SDimitry Andric // generating functions 2861*0b57cec5SDimitry Andric result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2862*0b57cec5SDimitry Andric 2863*0b57cec5SDimitry Andricprivate: 2864*0b57cec5SDimitry Andric result_type __eval(false_type); 2865*0b57cec5SDimitry Andric result_type __eval(true_type); 2866*0b57cec5SDimitry Andric}; 2867*0b57cec5SDimitry Andric 2868*0b57cec5SDimitry Andrictemplate<class _Engine, class _UIntType> 2869*0b57cec5SDimitry Andric__independent_bits_engine<_Engine, _UIntType> 2870*0b57cec5SDimitry Andric ::__independent_bits_engine(_Engine& __e, size_t __w) 2871*0b57cec5SDimitry Andric : __e_(__e), 2872*0b57cec5SDimitry Andric __w_(__w) 2873*0b57cec5SDimitry Andric{ 2874*0b57cec5SDimitry Andric __n_ = __w_ / __m + (__w_ % __m != 0); 2875*0b57cec5SDimitry Andric __w0_ = __w_ / __n_; 2876*0b57cec5SDimitry Andric if (_Rp == 0) 2877*0b57cec5SDimitry Andric __y0_ = _Rp; 2878*0b57cec5SDimitry Andric else if (__w0_ < _WDt) 2879*0b57cec5SDimitry Andric __y0_ = (_Rp >> __w0_) << __w0_; 2880*0b57cec5SDimitry Andric else 2881*0b57cec5SDimitry Andric __y0_ = 0; 2882*0b57cec5SDimitry Andric if (_Rp - __y0_ > __y0_ / __n_) 2883*0b57cec5SDimitry Andric { 2884*0b57cec5SDimitry Andric ++__n_; 2885*0b57cec5SDimitry Andric __w0_ = __w_ / __n_; 2886*0b57cec5SDimitry Andric if (__w0_ < _WDt) 2887*0b57cec5SDimitry Andric __y0_ = (_Rp >> __w0_) << __w0_; 2888*0b57cec5SDimitry Andric else 2889*0b57cec5SDimitry Andric __y0_ = 0; 2890*0b57cec5SDimitry Andric } 2891*0b57cec5SDimitry Andric __n0_ = __n_ - __w_ % __n_; 2892*0b57cec5SDimitry Andric if (__w0_ < _WDt - 1) 2893*0b57cec5SDimitry Andric __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2894*0b57cec5SDimitry Andric else 2895*0b57cec5SDimitry Andric __y1_ = 0; 2896*0b57cec5SDimitry Andric __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2897*0b57cec5SDimitry Andric _Engine_result_type(0); 2898*0b57cec5SDimitry Andric __mask1_ = __w0_ < _EDt - 1 ? 2899*0b57cec5SDimitry Andric _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2900*0b57cec5SDimitry Andric _Engine_result_type(~0); 2901*0b57cec5SDimitry Andric} 2902*0b57cec5SDimitry Andric 2903*0b57cec5SDimitry Andrictemplate<class _Engine, class _UIntType> 2904*0b57cec5SDimitry Andricinline 2905*0b57cec5SDimitry Andric_UIntType 2906*0b57cec5SDimitry Andric__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 2907*0b57cec5SDimitry Andric{ 2908*0b57cec5SDimitry Andric return static_cast<result_type>(__e_() & __mask0_); 2909*0b57cec5SDimitry Andric} 2910*0b57cec5SDimitry Andric 2911*0b57cec5SDimitry Andrictemplate<class _Engine, class _UIntType> 2912*0b57cec5SDimitry Andric_UIntType 2913*0b57cec5SDimitry Andric__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 2914*0b57cec5SDimitry Andric{ 2915*0b57cec5SDimitry Andric const size_t _WRt = numeric_limits<result_type>::digits; 2916*0b57cec5SDimitry Andric result_type _Sp = 0; 2917*0b57cec5SDimitry Andric for (size_t __k = 0; __k < __n0_; ++__k) 2918*0b57cec5SDimitry Andric { 2919*0b57cec5SDimitry Andric _Engine_result_type __u; 2920*0b57cec5SDimitry Andric do 2921*0b57cec5SDimitry Andric { 2922*0b57cec5SDimitry Andric __u = __e_() - _Engine::min(); 2923*0b57cec5SDimitry Andric } while (__u >= __y0_); 2924*0b57cec5SDimitry Andric if (__w0_ < _WRt) 2925*0b57cec5SDimitry Andric _Sp <<= __w0_; 2926*0b57cec5SDimitry Andric else 2927*0b57cec5SDimitry Andric _Sp = 0; 2928*0b57cec5SDimitry Andric _Sp += __u & __mask0_; 2929*0b57cec5SDimitry Andric } 2930*0b57cec5SDimitry Andric for (size_t __k = __n0_; __k < __n_; ++__k) 2931*0b57cec5SDimitry Andric { 2932*0b57cec5SDimitry Andric _Engine_result_type __u; 2933*0b57cec5SDimitry Andric do 2934*0b57cec5SDimitry Andric { 2935*0b57cec5SDimitry Andric __u = __e_() - _Engine::min(); 2936*0b57cec5SDimitry Andric } while (__u >= __y1_); 2937*0b57cec5SDimitry Andric if (__w0_ < _WRt - 1) 2938*0b57cec5SDimitry Andric _Sp <<= __w0_ + 1; 2939*0b57cec5SDimitry Andric else 2940*0b57cec5SDimitry Andric _Sp = 0; 2941*0b57cec5SDimitry Andric _Sp += __u & __mask1_; 2942*0b57cec5SDimitry Andric } 2943*0b57cec5SDimitry Andric return _Sp; 2944*0b57cec5SDimitry Andric} 2945*0b57cec5SDimitry Andric 2946*0b57cec5SDimitry Andric// uniform_int_distribution 2947*0b57cec5SDimitry Andric 2948*0b57cec5SDimitry Andrictemplate<class _IntType = int> 2949*0b57cec5SDimitry Andricclass uniform_int_distribution 2950*0b57cec5SDimitry Andric{ 2951*0b57cec5SDimitry Andricpublic: 2952*0b57cec5SDimitry Andric // types 2953*0b57cec5SDimitry Andric typedef _IntType result_type; 2954*0b57cec5SDimitry Andric 2955*0b57cec5SDimitry Andric class param_type 2956*0b57cec5SDimitry Andric { 2957*0b57cec5SDimitry Andric result_type __a_; 2958*0b57cec5SDimitry Andric result_type __b_; 2959*0b57cec5SDimitry Andric public: 2960*0b57cec5SDimitry Andric typedef uniform_int_distribution distribution_type; 2961*0b57cec5SDimitry Andric 2962*0b57cec5SDimitry Andric explicit param_type(result_type __a = 0, 2963*0b57cec5SDimitry Andric result_type __b = numeric_limits<result_type>::max()) 2964*0b57cec5SDimitry Andric : __a_(__a), __b_(__b) {} 2965*0b57cec5SDimitry Andric 2966*0b57cec5SDimitry Andric result_type a() const {return __a_;} 2967*0b57cec5SDimitry Andric result_type b() const {return __b_;} 2968*0b57cec5SDimitry Andric 2969*0b57cec5SDimitry Andric friend bool operator==(const param_type& __x, const param_type& __y) 2970*0b57cec5SDimitry Andric {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2971*0b57cec5SDimitry Andric friend bool operator!=(const param_type& __x, const param_type& __y) 2972*0b57cec5SDimitry Andric {return !(__x == __y);} 2973*0b57cec5SDimitry Andric }; 2974*0b57cec5SDimitry Andric 2975*0b57cec5SDimitry Andricprivate: 2976*0b57cec5SDimitry Andric param_type __p_; 2977*0b57cec5SDimitry Andric 2978*0b57cec5SDimitry Andricpublic: 2979*0b57cec5SDimitry Andric // constructors and reset functions 2980*0b57cec5SDimitry Andric explicit uniform_int_distribution(result_type __a = 0, 2981*0b57cec5SDimitry Andric result_type __b = numeric_limits<result_type>::max()) 2982*0b57cec5SDimitry Andric : __p_(param_type(__a, __b)) {} 2983*0b57cec5SDimitry Andric explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2984*0b57cec5SDimitry Andric void reset() {} 2985*0b57cec5SDimitry Andric 2986*0b57cec5SDimitry Andric // generating functions 2987*0b57cec5SDimitry Andric template<class _URNG> result_type operator()(_URNG& __g) 2988*0b57cec5SDimitry Andric {return (*this)(__g, __p_);} 2989*0b57cec5SDimitry Andric template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2990*0b57cec5SDimitry Andric 2991*0b57cec5SDimitry Andric // property functions 2992*0b57cec5SDimitry Andric result_type a() const {return __p_.a();} 2993*0b57cec5SDimitry Andric result_type b() const {return __p_.b();} 2994*0b57cec5SDimitry Andric 2995*0b57cec5SDimitry Andric param_type param() const {return __p_;} 2996*0b57cec5SDimitry Andric void param(const param_type& __p) {__p_ = __p;} 2997*0b57cec5SDimitry Andric 2998*0b57cec5SDimitry Andric result_type min() const {return a();} 2999*0b57cec5SDimitry Andric result_type max() const {return b();} 3000*0b57cec5SDimitry Andric 3001*0b57cec5SDimitry Andric friend bool operator==(const uniform_int_distribution& __x, 3002*0b57cec5SDimitry Andric const uniform_int_distribution& __y) 3003*0b57cec5SDimitry Andric {return __x.__p_ == __y.__p_;} 3004*0b57cec5SDimitry Andric friend bool operator!=(const uniform_int_distribution& __x, 3005*0b57cec5SDimitry Andric const uniform_int_distribution& __y) 3006*0b57cec5SDimitry Andric {return !(__x == __y);} 3007*0b57cec5SDimitry Andric}; 3008*0b57cec5SDimitry Andric 3009*0b57cec5SDimitry Andrictemplate<class _IntType> 3010*0b57cec5SDimitry Andrictemplate<class _URNG> 3011*0b57cec5SDimitry Andrictypename uniform_int_distribution<_IntType>::result_type 3012*0b57cec5SDimitry Andricuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 3013*0b57cec5SDimitry Andric_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK 3014*0b57cec5SDimitry Andric{ 3015*0b57cec5SDimitry Andric typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3016*0b57cec5SDimitry Andric uint32_t, uint64_t>::type _UIntType; 3017*0b57cec5SDimitry Andric const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1); 3018*0b57cec5SDimitry Andric if (_Rp == 1) 3019*0b57cec5SDimitry Andric return __p.a(); 3020*0b57cec5SDimitry Andric const size_t _Dt = numeric_limits<_UIntType>::digits; 3021*0b57cec5SDimitry Andric typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3022*0b57cec5SDimitry Andric if (_Rp == 0) 3023*0b57cec5SDimitry Andric return static_cast<result_type>(_Eng(__g, _Dt)()); 3024*0b57cec5SDimitry Andric size_t __w = _Dt - __libcpp_clz(_Rp) - 1; 3025*0b57cec5SDimitry Andric if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3026*0b57cec5SDimitry Andric ++__w; 3027*0b57cec5SDimitry Andric _Eng __e(__g, __w); 3028*0b57cec5SDimitry Andric _UIntType __u; 3029*0b57cec5SDimitry Andric do 3030*0b57cec5SDimitry Andric { 3031*0b57cec5SDimitry Andric __u = __e(); 3032*0b57cec5SDimitry Andric } while (__u >= _Rp); 3033*0b57cec5SDimitry Andric return static_cast<result_type>(__u + __p.a()); 3034*0b57cec5SDimitry Andric} 3035*0b57cec5SDimitry Andric 3036*0b57cec5SDimitry Andric#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 3037*0b57cec5SDimitry Andric || defined(_LIBCPP_BUILDING_LIBRARY) 3038*0b57cec5SDimitry Andricclass _LIBCPP_TYPE_VIS __rs_default; 3039*0b57cec5SDimitry Andric 3040*0b57cec5SDimitry Andric_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3041*0b57cec5SDimitry Andric 3042*0b57cec5SDimitry Andricclass _LIBCPP_TYPE_VIS __rs_default 3043*0b57cec5SDimitry Andric{ 3044*0b57cec5SDimitry Andric static unsigned __c_; 3045*0b57cec5SDimitry Andric 3046*0b57cec5SDimitry Andric __rs_default(); 3047*0b57cec5SDimitry Andricpublic: 3048*0b57cec5SDimitry Andric typedef uint_fast32_t result_type; 3049*0b57cec5SDimitry Andric 3050*0b57cec5SDimitry Andric static const result_type _Min = 0; 3051*0b57cec5SDimitry Andric static const result_type _Max = 0xFFFFFFFF; 3052*0b57cec5SDimitry Andric 3053*0b57cec5SDimitry Andric __rs_default(const __rs_default&); 3054*0b57cec5SDimitry Andric ~__rs_default(); 3055*0b57cec5SDimitry Andric 3056*0b57cec5SDimitry Andric result_type operator()(); 3057*0b57cec5SDimitry Andric 3058*0b57cec5SDimitry Andric static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3059*0b57cec5SDimitry Andric static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3060*0b57cec5SDimitry Andric 3061*0b57cec5SDimitry Andric friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3062*0b57cec5SDimitry Andric}; 3063*0b57cec5SDimitry Andric 3064*0b57cec5SDimitry Andric_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3065*0b57cec5SDimitry Andric 3066*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 3067*0b57cec5SDimitry Andric_LIBCPP_DEPRECATED_IN_CXX14 void 3068*0b57cec5SDimitry Andricrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 3069*0b57cec5SDimitry Andric{ 3070*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3071*0b57cec5SDimitry Andric typedef uniform_int_distribution<ptrdiff_t> _Dp; 3072*0b57cec5SDimitry Andric typedef typename _Dp::param_type _Pp; 3073*0b57cec5SDimitry Andric difference_type __d = __last - __first; 3074*0b57cec5SDimitry Andric if (__d > 1) 3075*0b57cec5SDimitry Andric { 3076*0b57cec5SDimitry Andric _Dp __uid; 3077*0b57cec5SDimitry Andric __rs_default __g = __rs_get(); 3078*0b57cec5SDimitry Andric for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3079*0b57cec5SDimitry Andric { 3080*0b57cec5SDimitry Andric difference_type __i = __uid(__g, _Pp(0, __d)); 3081*0b57cec5SDimitry Andric if (__i != difference_type(0)) 3082*0b57cec5SDimitry Andric swap(*__first, *(__first + __i)); 3083*0b57cec5SDimitry Andric } 3084*0b57cec5SDimitry Andric } 3085*0b57cec5SDimitry Andric} 3086*0b57cec5SDimitry Andric 3087*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 3088*0b57cec5SDimitry Andric_LIBCPP_DEPRECATED_IN_CXX14 void 3089*0b57cec5SDimitry Andricrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3090*0b57cec5SDimitry Andric#ifndef _LIBCPP_CXX03_LANG 3091*0b57cec5SDimitry Andric _RandomNumberGenerator&& __rand) 3092*0b57cec5SDimitry Andric#else 3093*0b57cec5SDimitry Andric _RandomNumberGenerator& __rand) 3094*0b57cec5SDimitry Andric#endif 3095*0b57cec5SDimitry Andric{ 3096*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3097*0b57cec5SDimitry Andric difference_type __d = __last - __first; 3098*0b57cec5SDimitry Andric if (__d > 1) 3099*0b57cec5SDimitry Andric { 3100*0b57cec5SDimitry Andric for (--__last; __first < __last; ++__first, (void) --__d) 3101*0b57cec5SDimitry Andric { 3102*0b57cec5SDimitry Andric difference_type __i = __rand(__d); 3103*0b57cec5SDimitry Andric if (__i != difference_type(0)) 3104*0b57cec5SDimitry Andric swap(*__first, *(__first + __i)); 3105*0b57cec5SDimitry Andric } 3106*0b57cec5SDimitry Andric } 3107*0b57cec5SDimitry Andric} 3108*0b57cec5SDimitry Andric#endif 3109*0b57cec5SDimitry Andric 3110*0b57cec5SDimitry Andrictemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3111*0b57cec5SDimitry Andric class _UniformRandomNumberGenerator> 3112*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY 3113*0b57cec5SDimitry Andric_SampleIterator __sample(_PopulationIterator __first, 3114*0b57cec5SDimitry Andric _PopulationIterator __last, _SampleIterator __output_iter, 3115*0b57cec5SDimitry Andric _Distance __n, 3116*0b57cec5SDimitry Andric _UniformRandomNumberGenerator & __g, 3117*0b57cec5SDimitry Andric input_iterator_tag) { 3118*0b57cec5SDimitry Andric 3119*0b57cec5SDimitry Andric _Distance __k = 0; 3120*0b57cec5SDimitry Andric for (; __first != __last && __k < __n; ++__first, (void)++__k) 3121*0b57cec5SDimitry Andric __output_iter[__k] = *__first; 3122*0b57cec5SDimitry Andric _Distance __sz = __k; 3123*0b57cec5SDimitry Andric for (; __first != __last; ++__first, (void)++__k) { 3124*0b57cec5SDimitry Andric _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3125*0b57cec5SDimitry Andric if (__r < __sz) 3126*0b57cec5SDimitry Andric __output_iter[__r] = *__first; 3127*0b57cec5SDimitry Andric } 3128*0b57cec5SDimitry Andric return __output_iter + _VSTD::min(__n, __k); 3129*0b57cec5SDimitry Andric} 3130*0b57cec5SDimitry Andric 3131*0b57cec5SDimitry Andrictemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3132*0b57cec5SDimitry Andric class _UniformRandomNumberGenerator> 3133*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY 3134*0b57cec5SDimitry Andric_SampleIterator __sample(_PopulationIterator __first, 3135*0b57cec5SDimitry Andric _PopulationIterator __last, _SampleIterator __output_iter, 3136*0b57cec5SDimitry Andric _Distance __n, 3137*0b57cec5SDimitry Andric _UniformRandomNumberGenerator& __g, 3138*0b57cec5SDimitry Andric forward_iterator_tag) { 3139*0b57cec5SDimitry Andric _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3140*0b57cec5SDimitry Andric for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3141*0b57cec5SDimitry Andric _Distance __r = 3142*0b57cec5SDimitry Andric _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3143*0b57cec5SDimitry Andric if (__r < __n) { 3144*0b57cec5SDimitry Andric *__output_iter++ = *__first; 3145*0b57cec5SDimitry Andric --__n; 3146*0b57cec5SDimitry Andric } 3147*0b57cec5SDimitry Andric } 3148*0b57cec5SDimitry Andric return __output_iter; 3149*0b57cec5SDimitry Andric} 3150*0b57cec5SDimitry Andric 3151*0b57cec5SDimitry Andrictemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3152*0b57cec5SDimitry Andric class _UniformRandomNumberGenerator> 3153*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY 3154*0b57cec5SDimitry Andric_SampleIterator __sample(_PopulationIterator __first, 3155*0b57cec5SDimitry Andric _PopulationIterator __last, _SampleIterator __output_iter, 3156*0b57cec5SDimitry Andric _Distance __n, _UniformRandomNumberGenerator& __g) { 3157*0b57cec5SDimitry Andric typedef typename iterator_traits<_PopulationIterator>::iterator_category 3158*0b57cec5SDimitry Andric _PopCategory; 3159*0b57cec5SDimitry Andric typedef typename iterator_traits<_PopulationIterator>::difference_type 3160*0b57cec5SDimitry Andric _Difference; 3161*0b57cec5SDimitry Andric static_assert(__is_forward_iterator<_PopulationIterator>::value || 3162*0b57cec5SDimitry Andric __is_random_access_iterator<_SampleIterator>::value, 3163*0b57cec5SDimitry Andric "SampleIterator must meet the requirements of RandomAccessIterator"); 3164*0b57cec5SDimitry Andric typedef typename common_type<_Distance, _Difference>::type _CommonType; 3165*0b57cec5SDimitry Andric _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3166*0b57cec5SDimitry Andric return _VSTD::__sample( 3167*0b57cec5SDimitry Andric __first, __last, __output_iter, _CommonType(__n), 3168*0b57cec5SDimitry Andric __g, _PopCategory()); 3169*0b57cec5SDimitry Andric} 3170*0b57cec5SDimitry Andric 3171*0b57cec5SDimitry Andric#if _LIBCPP_STD_VER > 14 3172*0b57cec5SDimitry Andrictemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3173*0b57cec5SDimitry Andric class _UniformRandomNumberGenerator> 3174*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 3175*0b57cec5SDimitry Andric_SampleIterator sample(_PopulationIterator __first, 3176*0b57cec5SDimitry Andric _PopulationIterator __last, _SampleIterator __output_iter, 3177*0b57cec5SDimitry Andric _Distance __n, _UniformRandomNumberGenerator&& __g) { 3178*0b57cec5SDimitry Andric return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3179*0b57cec5SDimitry Andric} 3180*0b57cec5SDimitry Andric#endif // _LIBCPP_STD_VER > 14 3181*0b57cec5SDimitry Andric 3182*0b57cec5SDimitry Andrictemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3183*0b57cec5SDimitry Andric void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3184*0b57cec5SDimitry Andric _UniformRandomNumberGenerator&& __g) 3185*0b57cec5SDimitry Andric{ 3186*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3187*0b57cec5SDimitry Andric typedef uniform_int_distribution<ptrdiff_t> _Dp; 3188*0b57cec5SDimitry Andric typedef typename _Dp::param_type _Pp; 3189*0b57cec5SDimitry Andric difference_type __d = __last - __first; 3190*0b57cec5SDimitry Andric if (__d > 1) 3191*0b57cec5SDimitry Andric { 3192*0b57cec5SDimitry Andric _Dp __uid; 3193*0b57cec5SDimitry Andric for (--__last, --__d; __first < __last; ++__first, --__d) 3194*0b57cec5SDimitry Andric { 3195*0b57cec5SDimitry Andric difference_type __i = __uid(__g, _Pp(0, __d)); 3196*0b57cec5SDimitry Andric if (__i != difference_type(0)) 3197*0b57cec5SDimitry Andric swap(*__first, *(__first + __i)); 3198*0b57cec5SDimitry Andric } 3199*0b57cec5SDimitry Andric } 3200*0b57cec5SDimitry Andric} 3201*0b57cec5SDimitry Andric 3202*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _Predicate> 3203*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 3204*0b57cec5SDimitry Andricis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 3205*0b57cec5SDimitry Andric{ 3206*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 3207*0b57cec5SDimitry Andric if (!__pred(*__first)) 3208*0b57cec5SDimitry Andric break; 3209*0b57cec5SDimitry Andric if ( __first == __last ) 3210*0b57cec5SDimitry Andric return true; 3211*0b57cec5SDimitry Andric ++__first; 3212*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 3213*0b57cec5SDimitry Andric if (__pred(*__first)) 3214*0b57cec5SDimitry Andric return false; 3215*0b57cec5SDimitry Andric return true; 3216*0b57cec5SDimitry Andric} 3217*0b57cec5SDimitry Andric 3218*0b57cec5SDimitry Andric// partition 3219*0b57cec5SDimitry Andric 3220*0b57cec5SDimitry Andrictemplate <class _Predicate, class _ForwardIterator> 3221*0b57cec5SDimitry Andric_ForwardIterator 3222*0b57cec5SDimitry Andric__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 3223*0b57cec5SDimitry Andric{ 3224*0b57cec5SDimitry Andric while (true) 3225*0b57cec5SDimitry Andric { 3226*0b57cec5SDimitry Andric if (__first == __last) 3227*0b57cec5SDimitry Andric return __first; 3228*0b57cec5SDimitry Andric if (!__pred(*__first)) 3229*0b57cec5SDimitry Andric break; 3230*0b57cec5SDimitry Andric ++__first; 3231*0b57cec5SDimitry Andric } 3232*0b57cec5SDimitry Andric for (_ForwardIterator __p = __first; ++__p != __last;) 3233*0b57cec5SDimitry Andric { 3234*0b57cec5SDimitry Andric if (__pred(*__p)) 3235*0b57cec5SDimitry Andric { 3236*0b57cec5SDimitry Andric swap(*__first, *__p); 3237*0b57cec5SDimitry Andric ++__first; 3238*0b57cec5SDimitry Andric } 3239*0b57cec5SDimitry Andric } 3240*0b57cec5SDimitry Andric return __first; 3241*0b57cec5SDimitry Andric} 3242*0b57cec5SDimitry Andric 3243*0b57cec5SDimitry Andrictemplate <class _Predicate, class _BidirectionalIterator> 3244*0b57cec5SDimitry Andric_BidirectionalIterator 3245*0b57cec5SDimitry Andric__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 3246*0b57cec5SDimitry Andric bidirectional_iterator_tag) 3247*0b57cec5SDimitry Andric{ 3248*0b57cec5SDimitry Andric while (true) 3249*0b57cec5SDimitry Andric { 3250*0b57cec5SDimitry Andric while (true) 3251*0b57cec5SDimitry Andric { 3252*0b57cec5SDimitry Andric if (__first == __last) 3253*0b57cec5SDimitry Andric return __first; 3254*0b57cec5SDimitry Andric if (!__pred(*__first)) 3255*0b57cec5SDimitry Andric break; 3256*0b57cec5SDimitry Andric ++__first; 3257*0b57cec5SDimitry Andric } 3258*0b57cec5SDimitry Andric do 3259*0b57cec5SDimitry Andric { 3260*0b57cec5SDimitry Andric if (__first == --__last) 3261*0b57cec5SDimitry Andric return __first; 3262*0b57cec5SDimitry Andric } while (!__pred(*__last)); 3263*0b57cec5SDimitry Andric swap(*__first, *__last); 3264*0b57cec5SDimitry Andric ++__first; 3265*0b57cec5SDimitry Andric } 3266*0b57cec5SDimitry Andric} 3267*0b57cec5SDimitry Andric 3268*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Predicate> 3269*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 3270*0b57cec5SDimitry Andric_ForwardIterator 3271*0b57cec5SDimitry Andricpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 3272*0b57cec5SDimitry Andric{ 3273*0b57cec5SDimitry Andric return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 3274*0b57cec5SDimitry Andric (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 3275*0b57cec5SDimitry Andric} 3276*0b57cec5SDimitry Andric 3277*0b57cec5SDimitry Andric// partition_copy 3278*0b57cec5SDimitry Andric 3279*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _OutputIterator1, 3280*0b57cec5SDimitry Andric class _OutputIterator2, class _Predicate> 3281*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 3282*0b57cec5SDimitry Andricpartition_copy(_InputIterator __first, _InputIterator __last, 3283*0b57cec5SDimitry Andric _OutputIterator1 __out_true, _OutputIterator2 __out_false, 3284*0b57cec5SDimitry Andric _Predicate __pred) 3285*0b57cec5SDimitry Andric{ 3286*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 3287*0b57cec5SDimitry Andric { 3288*0b57cec5SDimitry Andric if (__pred(*__first)) 3289*0b57cec5SDimitry Andric { 3290*0b57cec5SDimitry Andric *__out_true = *__first; 3291*0b57cec5SDimitry Andric ++__out_true; 3292*0b57cec5SDimitry Andric } 3293*0b57cec5SDimitry Andric else 3294*0b57cec5SDimitry Andric { 3295*0b57cec5SDimitry Andric *__out_false = *__first; 3296*0b57cec5SDimitry Andric ++__out_false; 3297*0b57cec5SDimitry Andric } 3298*0b57cec5SDimitry Andric } 3299*0b57cec5SDimitry Andric return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 3300*0b57cec5SDimitry Andric} 3301*0b57cec5SDimitry Andric 3302*0b57cec5SDimitry Andric// partition_point 3303*0b57cec5SDimitry Andric 3304*0b57cec5SDimitry Andrictemplate<class _ForwardIterator, class _Predicate> 3305*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 3306*0b57cec5SDimitry Andricpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 3307*0b57cec5SDimitry Andric{ 3308*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3309*0b57cec5SDimitry Andric difference_type __len = _VSTD::distance(__first, __last); 3310*0b57cec5SDimitry Andric while (__len != 0) 3311*0b57cec5SDimitry Andric { 3312*0b57cec5SDimitry Andric difference_type __l2 = _VSTD::__half_positive(__len); 3313*0b57cec5SDimitry Andric _ForwardIterator __m = __first; 3314*0b57cec5SDimitry Andric _VSTD::advance(__m, __l2); 3315*0b57cec5SDimitry Andric if (__pred(*__m)) 3316*0b57cec5SDimitry Andric { 3317*0b57cec5SDimitry Andric __first = ++__m; 3318*0b57cec5SDimitry Andric __len -= __l2 + 1; 3319*0b57cec5SDimitry Andric } 3320*0b57cec5SDimitry Andric else 3321*0b57cec5SDimitry Andric __len = __l2; 3322*0b57cec5SDimitry Andric } 3323*0b57cec5SDimitry Andric return __first; 3324*0b57cec5SDimitry Andric} 3325*0b57cec5SDimitry Andric 3326*0b57cec5SDimitry Andric// stable_partition 3327*0b57cec5SDimitry Andric 3328*0b57cec5SDimitry Andrictemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 3329*0b57cec5SDimitry Andric_ForwardIterator 3330*0b57cec5SDimitry Andric__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 3331*0b57cec5SDimitry Andric _Distance __len, _Pair __p, forward_iterator_tag __fit) 3332*0b57cec5SDimitry Andric{ 3333*0b57cec5SDimitry Andric // *__first is known to be false 3334*0b57cec5SDimitry Andric // __len >= 1 3335*0b57cec5SDimitry Andric if (__len == 1) 3336*0b57cec5SDimitry Andric return __first; 3337*0b57cec5SDimitry Andric if (__len == 2) 3338*0b57cec5SDimitry Andric { 3339*0b57cec5SDimitry Andric _ForwardIterator __m = __first; 3340*0b57cec5SDimitry Andric if (__pred(*++__m)) 3341*0b57cec5SDimitry Andric { 3342*0b57cec5SDimitry Andric swap(*__first, *__m); 3343*0b57cec5SDimitry Andric return __m; 3344*0b57cec5SDimitry Andric } 3345*0b57cec5SDimitry Andric return __first; 3346*0b57cec5SDimitry Andric } 3347*0b57cec5SDimitry Andric if (__len <= __p.second) 3348*0b57cec5SDimitry Andric { // The buffer is big enough to use 3349*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3350*0b57cec5SDimitry Andric __destruct_n __d(0); 3351*0b57cec5SDimitry Andric unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 3352*0b57cec5SDimitry Andric // Move the falses into the temporary buffer, and the trues to the front of the line 3353*0b57cec5SDimitry Andric // Update __first to always point to the end of the trues 3354*0b57cec5SDimitry Andric value_type* __t = __p.first; 3355*0b57cec5SDimitry Andric ::new(__t) value_type(_VSTD::move(*__first)); 3356*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 3357*0b57cec5SDimitry Andric ++__t; 3358*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 3359*0b57cec5SDimitry Andric while (++__i != __last) 3360*0b57cec5SDimitry Andric { 3361*0b57cec5SDimitry Andric if (__pred(*__i)) 3362*0b57cec5SDimitry Andric { 3363*0b57cec5SDimitry Andric *__first = _VSTD::move(*__i); 3364*0b57cec5SDimitry Andric ++__first; 3365*0b57cec5SDimitry Andric } 3366*0b57cec5SDimitry Andric else 3367*0b57cec5SDimitry Andric { 3368*0b57cec5SDimitry Andric ::new(__t) value_type(_VSTD::move(*__i)); 3369*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 3370*0b57cec5SDimitry Andric ++__t; 3371*0b57cec5SDimitry Andric } 3372*0b57cec5SDimitry Andric } 3373*0b57cec5SDimitry Andric // All trues now at start of range, all falses in buffer 3374*0b57cec5SDimitry Andric // Move falses back into range, but don't mess up __first which points to first false 3375*0b57cec5SDimitry Andric __i = __first; 3376*0b57cec5SDimitry Andric for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3377*0b57cec5SDimitry Andric *__i = _VSTD::move(*__t2); 3378*0b57cec5SDimitry Andric // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 3379*0b57cec5SDimitry Andric return __first; 3380*0b57cec5SDimitry Andric } 3381*0b57cec5SDimitry Andric // Else not enough buffer, do in place 3382*0b57cec5SDimitry Andric // __len >= 3 3383*0b57cec5SDimitry Andric _ForwardIterator __m = __first; 3384*0b57cec5SDimitry Andric _Distance __len2 = __len / 2; // __len2 >= 2 3385*0b57cec5SDimitry Andric _VSTD::advance(__m, __len2); 3386*0b57cec5SDimitry Andric // recurse on [__first, __m), *__first know to be false 3387*0b57cec5SDimitry Andric // F????????????????? 3388*0b57cec5SDimitry Andric // f m l 3389*0b57cec5SDimitry Andric typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 3390*0b57cec5SDimitry Andric _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 3391*0b57cec5SDimitry Andric // TTTFFFFF?????????? 3392*0b57cec5SDimitry Andric // f ff m l 3393*0b57cec5SDimitry Andric // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 3394*0b57cec5SDimitry Andric _ForwardIterator __m1 = __m; 3395*0b57cec5SDimitry Andric _ForwardIterator __second_false = __last; 3396*0b57cec5SDimitry Andric _Distance __len_half = __len - __len2; 3397*0b57cec5SDimitry Andric while (__pred(*__m1)) 3398*0b57cec5SDimitry Andric { 3399*0b57cec5SDimitry Andric if (++__m1 == __last) 3400*0b57cec5SDimitry Andric goto __second_half_done; 3401*0b57cec5SDimitry Andric --__len_half; 3402*0b57cec5SDimitry Andric } 3403*0b57cec5SDimitry Andric // TTTFFFFFTTTF?????? 3404*0b57cec5SDimitry Andric // f ff m m1 l 3405*0b57cec5SDimitry Andric __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 3406*0b57cec5SDimitry Andric__second_half_done: 3407*0b57cec5SDimitry Andric // TTTFFFFFTTTTTFFFFF 3408*0b57cec5SDimitry Andric // f ff m sf l 3409*0b57cec5SDimitry Andric return _VSTD::rotate(__first_false, __m, __second_false); 3410*0b57cec5SDimitry Andric // TTTTTTTTFFFFFFFFFF 3411*0b57cec5SDimitry Andric // | 3412*0b57cec5SDimitry Andric} 3413*0b57cec5SDimitry Andric 3414*0b57cec5SDimitry Andricstruct __return_temporary_buffer 3415*0b57cec5SDimitry Andric{ 3416*0b57cec5SDimitry Andric template <class _Tp> 3417*0b57cec5SDimitry Andric _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 3418*0b57cec5SDimitry Andric}; 3419*0b57cec5SDimitry Andric 3420*0b57cec5SDimitry Andrictemplate <class _Predicate, class _ForwardIterator> 3421*0b57cec5SDimitry Andric_ForwardIterator 3422*0b57cec5SDimitry Andric__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 3423*0b57cec5SDimitry Andric forward_iterator_tag) 3424*0b57cec5SDimitry Andric{ 3425*0b57cec5SDimitry Andric const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 3426*0b57cec5SDimitry Andric // Either prove all true and return __first or point to first false 3427*0b57cec5SDimitry Andric while (true) 3428*0b57cec5SDimitry Andric { 3429*0b57cec5SDimitry Andric if (__first == __last) 3430*0b57cec5SDimitry Andric return __first; 3431*0b57cec5SDimitry Andric if (!__pred(*__first)) 3432*0b57cec5SDimitry Andric break; 3433*0b57cec5SDimitry Andric ++__first; 3434*0b57cec5SDimitry Andric } 3435*0b57cec5SDimitry Andric // We now have a reduced range [__first, __last) 3436*0b57cec5SDimitry Andric // *__first is known to be false 3437*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3438*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3439*0b57cec5SDimitry Andric difference_type __len = _VSTD::distance(__first, __last); 3440*0b57cec5SDimitry Andric pair<value_type*, ptrdiff_t> __p(0, 0); 3441*0b57cec5SDimitry Andric unique_ptr<value_type, __return_temporary_buffer> __h; 3442*0b57cec5SDimitry Andric if (__len >= __alloc_limit) 3443*0b57cec5SDimitry Andric { 3444*0b57cec5SDimitry Andric __p = _VSTD::get_temporary_buffer<value_type>(__len); 3445*0b57cec5SDimitry Andric __h.reset(__p.first); 3446*0b57cec5SDimitry Andric } 3447*0b57cec5SDimitry Andric return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 3448*0b57cec5SDimitry Andric (__first, __last, __pred, __len, __p, forward_iterator_tag()); 3449*0b57cec5SDimitry Andric} 3450*0b57cec5SDimitry Andric 3451*0b57cec5SDimitry Andrictemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 3452*0b57cec5SDimitry Andric_BidirectionalIterator 3453*0b57cec5SDimitry Andric__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 3454*0b57cec5SDimitry Andric _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 3455*0b57cec5SDimitry Andric{ 3456*0b57cec5SDimitry Andric // *__first is known to be false 3457*0b57cec5SDimitry Andric // *__last is known to be true 3458*0b57cec5SDimitry Andric // __len >= 2 3459*0b57cec5SDimitry Andric if (__len == 2) 3460*0b57cec5SDimitry Andric { 3461*0b57cec5SDimitry Andric swap(*__first, *__last); 3462*0b57cec5SDimitry Andric return __last; 3463*0b57cec5SDimitry Andric } 3464*0b57cec5SDimitry Andric if (__len == 3) 3465*0b57cec5SDimitry Andric { 3466*0b57cec5SDimitry Andric _BidirectionalIterator __m = __first; 3467*0b57cec5SDimitry Andric if (__pred(*++__m)) 3468*0b57cec5SDimitry Andric { 3469*0b57cec5SDimitry Andric swap(*__first, *__m); 3470*0b57cec5SDimitry Andric swap(*__m, *__last); 3471*0b57cec5SDimitry Andric return __last; 3472*0b57cec5SDimitry Andric } 3473*0b57cec5SDimitry Andric swap(*__m, *__last); 3474*0b57cec5SDimitry Andric swap(*__first, *__m); 3475*0b57cec5SDimitry Andric return __m; 3476*0b57cec5SDimitry Andric } 3477*0b57cec5SDimitry Andric if (__len <= __p.second) 3478*0b57cec5SDimitry Andric { // The buffer is big enough to use 3479*0b57cec5SDimitry Andric typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 3480*0b57cec5SDimitry Andric __destruct_n __d(0); 3481*0b57cec5SDimitry Andric unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 3482*0b57cec5SDimitry Andric // Move the falses into the temporary buffer, and the trues to the front of the line 3483*0b57cec5SDimitry Andric // Update __first to always point to the end of the trues 3484*0b57cec5SDimitry Andric value_type* __t = __p.first; 3485*0b57cec5SDimitry Andric ::new(__t) value_type(_VSTD::move(*__first)); 3486*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 3487*0b57cec5SDimitry Andric ++__t; 3488*0b57cec5SDimitry Andric _BidirectionalIterator __i = __first; 3489*0b57cec5SDimitry Andric while (++__i != __last) 3490*0b57cec5SDimitry Andric { 3491*0b57cec5SDimitry Andric if (__pred(*__i)) 3492*0b57cec5SDimitry Andric { 3493*0b57cec5SDimitry Andric *__first = _VSTD::move(*__i); 3494*0b57cec5SDimitry Andric ++__first; 3495*0b57cec5SDimitry Andric } 3496*0b57cec5SDimitry Andric else 3497*0b57cec5SDimitry Andric { 3498*0b57cec5SDimitry Andric ::new(__t) value_type(_VSTD::move(*__i)); 3499*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 3500*0b57cec5SDimitry Andric ++__t; 3501*0b57cec5SDimitry Andric } 3502*0b57cec5SDimitry Andric } 3503*0b57cec5SDimitry Andric // move *__last, known to be true 3504*0b57cec5SDimitry Andric *__first = _VSTD::move(*__i); 3505*0b57cec5SDimitry Andric __i = ++__first; 3506*0b57cec5SDimitry Andric // All trues now at start of range, all falses in buffer 3507*0b57cec5SDimitry Andric // Move falses back into range, but don't mess up __first which points to first false 3508*0b57cec5SDimitry Andric for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3509*0b57cec5SDimitry Andric *__i = _VSTD::move(*__t2); 3510*0b57cec5SDimitry Andric // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 3511*0b57cec5SDimitry Andric return __first; 3512*0b57cec5SDimitry Andric } 3513*0b57cec5SDimitry Andric // Else not enough buffer, do in place 3514*0b57cec5SDimitry Andric // __len >= 4 3515*0b57cec5SDimitry Andric _BidirectionalIterator __m = __first; 3516*0b57cec5SDimitry Andric _Distance __len2 = __len / 2; // __len2 >= 2 3517*0b57cec5SDimitry Andric _VSTD::advance(__m, __len2); 3518*0b57cec5SDimitry Andric // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 3519*0b57cec5SDimitry Andric // F????????????????T 3520*0b57cec5SDimitry Andric // f m l 3521*0b57cec5SDimitry Andric _BidirectionalIterator __m1 = __m; 3522*0b57cec5SDimitry Andric _BidirectionalIterator __first_false = __first; 3523*0b57cec5SDimitry Andric _Distance __len_half = __len2; 3524*0b57cec5SDimitry Andric while (!__pred(*--__m1)) 3525*0b57cec5SDimitry Andric { 3526*0b57cec5SDimitry Andric if (__m1 == __first) 3527*0b57cec5SDimitry Andric goto __first_half_done; 3528*0b57cec5SDimitry Andric --__len_half; 3529*0b57cec5SDimitry Andric } 3530*0b57cec5SDimitry Andric // F???TFFF?????????T 3531*0b57cec5SDimitry Andric // f m1 m l 3532*0b57cec5SDimitry Andric typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 3533*0b57cec5SDimitry Andric __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 3534*0b57cec5SDimitry Andric__first_half_done: 3535*0b57cec5SDimitry Andric // TTTFFFFF?????????T 3536*0b57cec5SDimitry Andric // f ff m l 3537*0b57cec5SDimitry Andric // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 3538*0b57cec5SDimitry Andric __m1 = __m; 3539*0b57cec5SDimitry Andric _BidirectionalIterator __second_false = __last; 3540*0b57cec5SDimitry Andric ++__second_false; 3541*0b57cec5SDimitry Andric __len_half = __len - __len2; 3542*0b57cec5SDimitry Andric while (__pred(*__m1)) 3543*0b57cec5SDimitry Andric { 3544*0b57cec5SDimitry Andric if (++__m1 == __last) 3545*0b57cec5SDimitry Andric goto __second_half_done; 3546*0b57cec5SDimitry Andric --__len_half; 3547*0b57cec5SDimitry Andric } 3548*0b57cec5SDimitry Andric // TTTFFFFFTTTF?????T 3549*0b57cec5SDimitry Andric // f ff m m1 l 3550*0b57cec5SDimitry Andric __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 3551*0b57cec5SDimitry Andric__second_half_done: 3552*0b57cec5SDimitry Andric // TTTFFFFFTTTTTFFFFF 3553*0b57cec5SDimitry Andric // f ff m sf l 3554*0b57cec5SDimitry Andric return _VSTD::rotate(__first_false, __m, __second_false); 3555*0b57cec5SDimitry Andric // TTTTTTTTFFFFFFFFFF 3556*0b57cec5SDimitry Andric // | 3557*0b57cec5SDimitry Andric} 3558*0b57cec5SDimitry Andric 3559*0b57cec5SDimitry Andrictemplate <class _Predicate, class _BidirectionalIterator> 3560*0b57cec5SDimitry Andric_BidirectionalIterator 3561*0b57cec5SDimitry Andric__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 3562*0b57cec5SDimitry Andric bidirectional_iterator_tag) 3563*0b57cec5SDimitry Andric{ 3564*0b57cec5SDimitry Andric typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 3565*0b57cec5SDimitry Andric typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 3566*0b57cec5SDimitry Andric const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 3567*0b57cec5SDimitry Andric // Either prove all true and return __first or point to first false 3568*0b57cec5SDimitry Andric while (true) 3569*0b57cec5SDimitry Andric { 3570*0b57cec5SDimitry Andric if (__first == __last) 3571*0b57cec5SDimitry Andric return __first; 3572*0b57cec5SDimitry Andric if (!__pred(*__first)) 3573*0b57cec5SDimitry Andric break; 3574*0b57cec5SDimitry Andric ++__first; 3575*0b57cec5SDimitry Andric } 3576*0b57cec5SDimitry Andric // __first points to first false, everything prior to __first is already set. 3577*0b57cec5SDimitry Andric // Either prove [__first, __last) is all false and return __first, or point __last to last true 3578*0b57cec5SDimitry Andric do 3579*0b57cec5SDimitry Andric { 3580*0b57cec5SDimitry Andric if (__first == --__last) 3581*0b57cec5SDimitry Andric return __first; 3582*0b57cec5SDimitry Andric } while (!__pred(*__last)); 3583*0b57cec5SDimitry Andric // We now have a reduced range [__first, __last] 3584*0b57cec5SDimitry Andric // *__first is known to be false 3585*0b57cec5SDimitry Andric // *__last is known to be true 3586*0b57cec5SDimitry Andric // __len >= 2 3587*0b57cec5SDimitry Andric difference_type __len = _VSTD::distance(__first, __last) + 1; 3588*0b57cec5SDimitry Andric pair<value_type*, ptrdiff_t> __p(0, 0); 3589*0b57cec5SDimitry Andric unique_ptr<value_type, __return_temporary_buffer> __h; 3590*0b57cec5SDimitry Andric if (__len >= __alloc_limit) 3591*0b57cec5SDimitry Andric { 3592*0b57cec5SDimitry Andric __p = _VSTD::get_temporary_buffer<value_type>(__len); 3593*0b57cec5SDimitry Andric __h.reset(__p.first); 3594*0b57cec5SDimitry Andric } 3595*0b57cec5SDimitry Andric return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 3596*0b57cec5SDimitry Andric (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 3597*0b57cec5SDimitry Andric} 3598*0b57cec5SDimitry Andric 3599*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Predicate> 3600*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 3601*0b57cec5SDimitry Andric_ForwardIterator 3602*0b57cec5SDimitry Andricstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 3603*0b57cec5SDimitry Andric{ 3604*0b57cec5SDimitry Andric return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 3605*0b57cec5SDimitry Andric (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 3606*0b57cec5SDimitry Andric} 3607*0b57cec5SDimitry Andric 3608*0b57cec5SDimitry Andric// is_sorted_until 3609*0b57cec5SDimitry Andric 3610*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Compare> 3611*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 3612*0b57cec5SDimitry Andricis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 3613*0b57cec5SDimitry Andric{ 3614*0b57cec5SDimitry Andric if (__first != __last) 3615*0b57cec5SDimitry Andric { 3616*0b57cec5SDimitry Andric _ForwardIterator __i = __first; 3617*0b57cec5SDimitry Andric while (++__i != __last) 3618*0b57cec5SDimitry Andric { 3619*0b57cec5SDimitry Andric if (__comp(*__i, *__first)) 3620*0b57cec5SDimitry Andric return __i; 3621*0b57cec5SDimitry Andric __first = __i; 3622*0b57cec5SDimitry Andric } 3623*0b57cec5SDimitry Andric } 3624*0b57cec5SDimitry Andric return __last; 3625*0b57cec5SDimitry Andric} 3626*0b57cec5SDimitry Andric 3627*0b57cec5SDimitry Andrictemplate<class _ForwardIterator> 3628*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 3629*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 3630*0b57cec5SDimitry Andric_ForwardIterator 3631*0b57cec5SDimitry Andricis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 3632*0b57cec5SDimitry Andric{ 3633*0b57cec5SDimitry Andric return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 3634*0b57cec5SDimitry Andric} 3635*0b57cec5SDimitry Andric 3636*0b57cec5SDimitry Andric// is_sorted 3637*0b57cec5SDimitry Andric 3638*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Compare> 3639*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 3640*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 3641*0b57cec5SDimitry Andricbool 3642*0b57cec5SDimitry Andricis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 3643*0b57cec5SDimitry Andric{ 3644*0b57cec5SDimitry Andric return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 3645*0b57cec5SDimitry Andric} 3646*0b57cec5SDimitry Andric 3647*0b57cec5SDimitry Andrictemplate<class _ForwardIterator> 3648*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 3649*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 3650*0b57cec5SDimitry Andricbool 3651*0b57cec5SDimitry Andricis_sorted(_ForwardIterator __first, _ForwardIterator __last) 3652*0b57cec5SDimitry Andric{ 3653*0b57cec5SDimitry Andric return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 3654*0b57cec5SDimitry Andric} 3655*0b57cec5SDimitry Andric 3656*0b57cec5SDimitry Andric// sort 3657*0b57cec5SDimitry Andric 3658*0b57cec5SDimitry Andric// stable, 2-3 compares, 0-2 swaps 3659*0b57cec5SDimitry Andric 3660*0b57cec5SDimitry Andrictemplate <class _Compare, class _ForwardIterator> 3661*0b57cec5SDimitry Andricunsigned 3662*0b57cec5SDimitry Andric__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 3663*0b57cec5SDimitry Andric{ 3664*0b57cec5SDimitry Andric unsigned __r = 0; 3665*0b57cec5SDimitry Andric if (!__c(*__y, *__x)) // if x <= y 3666*0b57cec5SDimitry Andric { 3667*0b57cec5SDimitry Andric if (!__c(*__z, *__y)) // if y <= z 3668*0b57cec5SDimitry Andric return __r; // x <= y && y <= z 3669*0b57cec5SDimitry Andric // x <= y && y > z 3670*0b57cec5SDimitry Andric swap(*__y, *__z); // x <= z && y < z 3671*0b57cec5SDimitry Andric __r = 1; 3672*0b57cec5SDimitry Andric if (__c(*__y, *__x)) // if x > y 3673*0b57cec5SDimitry Andric { 3674*0b57cec5SDimitry Andric swap(*__x, *__y); // x < y && y <= z 3675*0b57cec5SDimitry Andric __r = 2; 3676*0b57cec5SDimitry Andric } 3677*0b57cec5SDimitry Andric return __r; // x <= y && y < z 3678*0b57cec5SDimitry Andric } 3679*0b57cec5SDimitry Andric if (__c(*__z, *__y)) // x > y, if y > z 3680*0b57cec5SDimitry Andric { 3681*0b57cec5SDimitry Andric swap(*__x, *__z); // x < y && y < z 3682*0b57cec5SDimitry Andric __r = 1; 3683*0b57cec5SDimitry Andric return __r; 3684*0b57cec5SDimitry Andric } 3685*0b57cec5SDimitry Andric swap(*__x, *__y); // x > y && y <= z 3686*0b57cec5SDimitry Andric __r = 1; // x < y && x <= z 3687*0b57cec5SDimitry Andric if (__c(*__z, *__y)) // if y > z 3688*0b57cec5SDimitry Andric { 3689*0b57cec5SDimitry Andric swap(*__y, *__z); // x <= y && y < z 3690*0b57cec5SDimitry Andric __r = 2; 3691*0b57cec5SDimitry Andric } 3692*0b57cec5SDimitry Andric return __r; 3693*0b57cec5SDimitry Andric} // x <= y && y <= z 3694*0b57cec5SDimitry Andric 3695*0b57cec5SDimitry Andric// stable, 3-6 compares, 0-5 swaps 3696*0b57cec5SDimitry Andric 3697*0b57cec5SDimitry Andrictemplate <class _Compare, class _ForwardIterator> 3698*0b57cec5SDimitry Andricunsigned 3699*0b57cec5SDimitry Andric__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 3700*0b57cec5SDimitry Andric _ForwardIterator __x4, _Compare __c) 3701*0b57cec5SDimitry Andric{ 3702*0b57cec5SDimitry Andric unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 3703*0b57cec5SDimitry Andric if (__c(*__x4, *__x3)) 3704*0b57cec5SDimitry Andric { 3705*0b57cec5SDimitry Andric swap(*__x3, *__x4); 3706*0b57cec5SDimitry Andric ++__r; 3707*0b57cec5SDimitry Andric if (__c(*__x3, *__x2)) 3708*0b57cec5SDimitry Andric { 3709*0b57cec5SDimitry Andric swap(*__x2, *__x3); 3710*0b57cec5SDimitry Andric ++__r; 3711*0b57cec5SDimitry Andric if (__c(*__x2, *__x1)) 3712*0b57cec5SDimitry Andric { 3713*0b57cec5SDimitry Andric swap(*__x1, *__x2); 3714*0b57cec5SDimitry Andric ++__r; 3715*0b57cec5SDimitry Andric } 3716*0b57cec5SDimitry Andric } 3717*0b57cec5SDimitry Andric } 3718*0b57cec5SDimitry Andric return __r; 3719*0b57cec5SDimitry Andric} 3720*0b57cec5SDimitry Andric 3721*0b57cec5SDimitry Andric// stable, 4-10 compares, 0-9 swaps 3722*0b57cec5SDimitry Andric 3723*0b57cec5SDimitry Andrictemplate <class _Compare, class _ForwardIterator> 3724*0b57cec5SDimitry Andric_LIBCPP_HIDDEN 3725*0b57cec5SDimitry Andricunsigned 3726*0b57cec5SDimitry Andric__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 3727*0b57cec5SDimitry Andric _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 3728*0b57cec5SDimitry Andric{ 3729*0b57cec5SDimitry Andric unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 3730*0b57cec5SDimitry Andric if (__c(*__x5, *__x4)) 3731*0b57cec5SDimitry Andric { 3732*0b57cec5SDimitry Andric swap(*__x4, *__x5); 3733*0b57cec5SDimitry Andric ++__r; 3734*0b57cec5SDimitry Andric if (__c(*__x4, *__x3)) 3735*0b57cec5SDimitry Andric { 3736*0b57cec5SDimitry Andric swap(*__x3, *__x4); 3737*0b57cec5SDimitry Andric ++__r; 3738*0b57cec5SDimitry Andric if (__c(*__x3, *__x2)) 3739*0b57cec5SDimitry Andric { 3740*0b57cec5SDimitry Andric swap(*__x2, *__x3); 3741*0b57cec5SDimitry Andric ++__r; 3742*0b57cec5SDimitry Andric if (__c(*__x2, *__x1)) 3743*0b57cec5SDimitry Andric { 3744*0b57cec5SDimitry Andric swap(*__x1, *__x2); 3745*0b57cec5SDimitry Andric ++__r; 3746*0b57cec5SDimitry Andric } 3747*0b57cec5SDimitry Andric } 3748*0b57cec5SDimitry Andric } 3749*0b57cec5SDimitry Andric } 3750*0b57cec5SDimitry Andric return __r; 3751*0b57cec5SDimitry Andric} 3752*0b57cec5SDimitry Andric 3753*0b57cec5SDimitry Andric// Assumes size > 0 3754*0b57cec5SDimitry Andrictemplate <class _Compare, class _BirdirectionalIterator> 3755*0b57cec5SDimitry Andricvoid 3756*0b57cec5SDimitry Andric__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 3757*0b57cec5SDimitry Andric{ 3758*0b57cec5SDimitry Andric _BirdirectionalIterator __lm1 = __last; 3759*0b57cec5SDimitry Andric for (--__lm1; __first != __lm1; ++__first) 3760*0b57cec5SDimitry Andric { 3761*0b57cec5SDimitry Andric _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 3762*0b57cec5SDimitry Andric typename add_lvalue_reference<_Compare>::type> 3763*0b57cec5SDimitry Andric (__first, __last, __comp); 3764*0b57cec5SDimitry Andric if (__i != __first) 3765*0b57cec5SDimitry Andric swap(*__first, *__i); 3766*0b57cec5SDimitry Andric } 3767*0b57cec5SDimitry Andric} 3768*0b57cec5SDimitry Andric 3769*0b57cec5SDimitry Andrictemplate <class _Compare, class _BirdirectionalIterator> 3770*0b57cec5SDimitry Andricvoid 3771*0b57cec5SDimitry Andric__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 3772*0b57cec5SDimitry Andric{ 3773*0b57cec5SDimitry Andric typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 3774*0b57cec5SDimitry Andric if (__first != __last) 3775*0b57cec5SDimitry Andric { 3776*0b57cec5SDimitry Andric _BirdirectionalIterator __i = __first; 3777*0b57cec5SDimitry Andric for (++__i; __i != __last; ++__i) 3778*0b57cec5SDimitry Andric { 3779*0b57cec5SDimitry Andric _BirdirectionalIterator __j = __i; 3780*0b57cec5SDimitry Andric value_type __t(_VSTD::move(*__j)); 3781*0b57cec5SDimitry Andric for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3782*0b57cec5SDimitry Andric *__j = _VSTD::move(*__k); 3783*0b57cec5SDimitry Andric *__j = _VSTD::move(__t); 3784*0b57cec5SDimitry Andric } 3785*0b57cec5SDimitry Andric } 3786*0b57cec5SDimitry Andric} 3787*0b57cec5SDimitry Andric 3788*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 3789*0b57cec5SDimitry Andricvoid 3790*0b57cec5SDimitry Andric__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 3791*0b57cec5SDimitry Andric{ 3792*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3793*0b57cec5SDimitry Andric _RandomAccessIterator __j = __first+2; 3794*0b57cec5SDimitry Andric __sort3<_Compare>(__first, __first+1, __j, __comp); 3795*0b57cec5SDimitry Andric for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 3796*0b57cec5SDimitry Andric { 3797*0b57cec5SDimitry Andric if (__comp(*__i, *__j)) 3798*0b57cec5SDimitry Andric { 3799*0b57cec5SDimitry Andric value_type __t(_VSTD::move(*__i)); 3800*0b57cec5SDimitry Andric _RandomAccessIterator __k = __j; 3801*0b57cec5SDimitry Andric __j = __i; 3802*0b57cec5SDimitry Andric do 3803*0b57cec5SDimitry Andric { 3804*0b57cec5SDimitry Andric *__j = _VSTD::move(*__k); 3805*0b57cec5SDimitry Andric __j = __k; 3806*0b57cec5SDimitry Andric } while (__j != __first && __comp(__t, *--__k)); 3807*0b57cec5SDimitry Andric *__j = _VSTD::move(__t); 3808*0b57cec5SDimitry Andric } 3809*0b57cec5SDimitry Andric __j = __i; 3810*0b57cec5SDimitry Andric } 3811*0b57cec5SDimitry Andric} 3812*0b57cec5SDimitry Andric 3813*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 3814*0b57cec5SDimitry Andricbool 3815*0b57cec5SDimitry Andric__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 3816*0b57cec5SDimitry Andric{ 3817*0b57cec5SDimitry Andric switch (__last - __first) 3818*0b57cec5SDimitry Andric { 3819*0b57cec5SDimitry Andric case 0: 3820*0b57cec5SDimitry Andric case 1: 3821*0b57cec5SDimitry Andric return true; 3822*0b57cec5SDimitry Andric case 2: 3823*0b57cec5SDimitry Andric if (__comp(*--__last, *__first)) 3824*0b57cec5SDimitry Andric swap(*__first, *__last); 3825*0b57cec5SDimitry Andric return true; 3826*0b57cec5SDimitry Andric case 3: 3827*0b57cec5SDimitry Andric _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 3828*0b57cec5SDimitry Andric return true; 3829*0b57cec5SDimitry Andric case 4: 3830*0b57cec5SDimitry Andric _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 3831*0b57cec5SDimitry Andric return true; 3832*0b57cec5SDimitry Andric case 5: 3833*0b57cec5SDimitry Andric _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 3834*0b57cec5SDimitry Andric return true; 3835*0b57cec5SDimitry Andric } 3836*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3837*0b57cec5SDimitry Andric _RandomAccessIterator __j = __first+2; 3838*0b57cec5SDimitry Andric __sort3<_Compare>(__first, __first+1, __j, __comp); 3839*0b57cec5SDimitry Andric const unsigned __limit = 8; 3840*0b57cec5SDimitry Andric unsigned __count = 0; 3841*0b57cec5SDimitry Andric for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 3842*0b57cec5SDimitry Andric { 3843*0b57cec5SDimitry Andric if (__comp(*__i, *__j)) 3844*0b57cec5SDimitry Andric { 3845*0b57cec5SDimitry Andric value_type __t(_VSTD::move(*__i)); 3846*0b57cec5SDimitry Andric _RandomAccessIterator __k = __j; 3847*0b57cec5SDimitry Andric __j = __i; 3848*0b57cec5SDimitry Andric do 3849*0b57cec5SDimitry Andric { 3850*0b57cec5SDimitry Andric *__j = _VSTD::move(*__k); 3851*0b57cec5SDimitry Andric __j = __k; 3852*0b57cec5SDimitry Andric } while (__j != __first && __comp(__t, *--__k)); 3853*0b57cec5SDimitry Andric *__j = _VSTD::move(__t); 3854*0b57cec5SDimitry Andric if (++__count == __limit) 3855*0b57cec5SDimitry Andric return ++__i == __last; 3856*0b57cec5SDimitry Andric } 3857*0b57cec5SDimitry Andric __j = __i; 3858*0b57cec5SDimitry Andric } 3859*0b57cec5SDimitry Andric return true; 3860*0b57cec5SDimitry Andric} 3861*0b57cec5SDimitry Andric 3862*0b57cec5SDimitry Andrictemplate <class _Compare, class _BirdirectionalIterator> 3863*0b57cec5SDimitry Andricvoid 3864*0b57cec5SDimitry Andric__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 3865*0b57cec5SDimitry Andric typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 3866*0b57cec5SDimitry Andric{ 3867*0b57cec5SDimitry Andric typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 3868*0b57cec5SDimitry Andric if (__first1 != __last1) 3869*0b57cec5SDimitry Andric { 3870*0b57cec5SDimitry Andric __destruct_n __d(0); 3871*0b57cec5SDimitry Andric unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 3872*0b57cec5SDimitry Andric value_type* __last2 = __first2; 3873*0b57cec5SDimitry Andric ::new(__last2) value_type(_VSTD::move(*__first1)); 3874*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 3875*0b57cec5SDimitry Andric for (++__last2; ++__first1 != __last1; ++__last2) 3876*0b57cec5SDimitry Andric { 3877*0b57cec5SDimitry Andric value_type* __j2 = __last2; 3878*0b57cec5SDimitry Andric value_type* __i2 = __j2; 3879*0b57cec5SDimitry Andric if (__comp(*__first1, *--__i2)) 3880*0b57cec5SDimitry Andric { 3881*0b57cec5SDimitry Andric ::new(__j2) value_type(_VSTD::move(*__i2)); 3882*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 3883*0b57cec5SDimitry Andric for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3884*0b57cec5SDimitry Andric *__j2 = _VSTD::move(*__i2); 3885*0b57cec5SDimitry Andric *__j2 = _VSTD::move(*__first1); 3886*0b57cec5SDimitry Andric } 3887*0b57cec5SDimitry Andric else 3888*0b57cec5SDimitry Andric { 3889*0b57cec5SDimitry Andric ::new(__j2) value_type(_VSTD::move(*__first1)); 3890*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 3891*0b57cec5SDimitry Andric } 3892*0b57cec5SDimitry Andric } 3893*0b57cec5SDimitry Andric __h.release(); 3894*0b57cec5SDimitry Andric } 3895*0b57cec5SDimitry Andric} 3896*0b57cec5SDimitry Andric 3897*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 3898*0b57cec5SDimitry Andricvoid 3899*0b57cec5SDimitry Andric__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 3900*0b57cec5SDimitry Andric{ 3901*0b57cec5SDimitry Andric // _Compare is known to be a reference type 3902*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3903*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3904*0b57cec5SDimitry Andric const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3905*0b57cec5SDimitry Andric is_trivially_copy_assignable<value_type>::value ? 30 : 6; 3906*0b57cec5SDimitry Andric while (true) 3907*0b57cec5SDimitry Andric { 3908*0b57cec5SDimitry Andric __restart: 3909*0b57cec5SDimitry Andric difference_type __len = __last - __first; 3910*0b57cec5SDimitry Andric switch (__len) 3911*0b57cec5SDimitry Andric { 3912*0b57cec5SDimitry Andric case 0: 3913*0b57cec5SDimitry Andric case 1: 3914*0b57cec5SDimitry Andric return; 3915*0b57cec5SDimitry Andric case 2: 3916*0b57cec5SDimitry Andric if (__comp(*--__last, *__first)) 3917*0b57cec5SDimitry Andric swap(*__first, *__last); 3918*0b57cec5SDimitry Andric return; 3919*0b57cec5SDimitry Andric case 3: 3920*0b57cec5SDimitry Andric _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 3921*0b57cec5SDimitry Andric return; 3922*0b57cec5SDimitry Andric case 4: 3923*0b57cec5SDimitry Andric _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 3924*0b57cec5SDimitry Andric return; 3925*0b57cec5SDimitry Andric case 5: 3926*0b57cec5SDimitry Andric _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 3927*0b57cec5SDimitry Andric return; 3928*0b57cec5SDimitry Andric } 3929*0b57cec5SDimitry Andric if (__len <= __limit) 3930*0b57cec5SDimitry Andric { 3931*0b57cec5SDimitry Andric _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 3932*0b57cec5SDimitry Andric return; 3933*0b57cec5SDimitry Andric } 3934*0b57cec5SDimitry Andric // __len > 5 3935*0b57cec5SDimitry Andric _RandomAccessIterator __m = __first; 3936*0b57cec5SDimitry Andric _RandomAccessIterator __lm1 = __last; 3937*0b57cec5SDimitry Andric --__lm1; 3938*0b57cec5SDimitry Andric unsigned __n_swaps; 3939*0b57cec5SDimitry Andric { 3940*0b57cec5SDimitry Andric difference_type __delta; 3941*0b57cec5SDimitry Andric if (__len >= 1000) 3942*0b57cec5SDimitry Andric { 3943*0b57cec5SDimitry Andric __delta = __len/2; 3944*0b57cec5SDimitry Andric __m += __delta; 3945*0b57cec5SDimitry Andric __delta /= 2; 3946*0b57cec5SDimitry Andric __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 3947*0b57cec5SDimitry Andric } 3948*0b57cec5SDimitry Andric else 3949*0b57cec5SDimitry Andric { 3950*0b57cec5SDimitry Andric __delta = __len/2; 3951*0b57cec5SDimitry Andric __m += __delta; 3952*0b57cec5SDimitry Andric __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 3953*0b57cec5SDimitry Andric } 3954*0b57cec5SDimitry Andric } 3955*0b57cec5SDimitry Andric // *__m is median 3956*0b57cec5SDimitry Andric // partition [__first, __m) < *__m and *__m <= [__m, __last) 3957*0b57cec5SDimitry Andric // (this inhibits tossing elements equivalent to __m around unnecessarily) 3958*0b57cec5SDimitry Andric _RandomAccessIterator __i = __first; 3959*0b57cec5SDimitry Andric _RandomAccessIterator __j = __lm1; 3960*0b57cec5SDimitry Andric // j points beyond range to be tested, *__m is known to be <= *__lm1 3961*0b57cec5SDimitry Andric // The search going up is known to be guarded but the search coming down isn't. 3962*0b57cec5SDimitry Andric // Prime the downward search with a guard. 3963*0b57cec5SDimitry Andric if (!__comp(*__i, *__m)) // if *__first == *__m 3964*0b57cec5SDimitry Andric { 3965*0b57cec5SDimitry Andric // *__first == *__m, *__first doesn't go in first part 3966*0b57cec5SDimitry Andric // manually guard downward moving __j against __i 3967*0b57cec5SDimitry Andric while (true) 3968*0b57cec5SDimitry Andric { 3969*0b57cec5SDimitry Andric if (__i == --__j) 3970*0b57cec5SDimitry Andric { 3971*0b57cec5SDimitry Andric // *__first == *__m, *__m <= all other elements 3972*0b57cec5SDimitry Andric // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 3973*0b57cec5SDimitry Andric ++__i; // __first + 1 3974*0b57cec5SDimitry Andric __j = __last; 3975*0b57cec5SDimitry Andric if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 3976*0b57cec5SDimitry Andric { 3977*0b57cec5SDimitry Andric while (true) 3978*0b57cec5SDimitry Andric { 3979*0b57cec5SDimitry Andric if (__i == __j) 3980*0b57cec5SDimitry Andric return; // [__first, __last) all equivalent elements 3981*0b57cec5SDimitry Andric if (__comp(*__first, *__i)) 3982*0b57cec5SDimitry Andric { 3983*0b57cec5SDimitry Andric swap(*__i, *__j); 3984*0b57cec5SDimitry Andric ++__n_swaps; 3985*0b57cec5SDimitry Andric ++__i; 3986*0b57cec5SDimitry Andric break; 3987*0b57cec5SDimitry Andric } 3988*0b57cec5SDimitry Andric ++__i; 3989*0b57cec5SDimitry Andric } 3990*0b57cec5SDimitry Andric } 3991*0b57cec5SDimitry Andric // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 3992*0b57cec5SDimitry Andric if (__i == __j) 3993*0b57cec5SDimitry Andric return; 3994*0b57cec5SDimitry Andric while (true) 3995*0b57cec5SDimitry Andric { 3996*0b57cec5SDimitry Andric while (!__comp(*__first, *__i)) 3997*0b57cec5SDimitry Andric ++__i; 3998*0b57cec5SDimitry Andric while (__comp(*__first, *--__j)) 3999*0b57cec5SDimitry Andric ; 4000*0b57cec5SDimitry Andric if (__i >= __j) 4001*0b57cec5SDimitry Andric break; 4002*0b57cec5SDimitry Andric swap(*__i, *__j); 4003*0b57cec5SDimitry Andric ++__n_swaps; 4004*0b57cec5SDimitry Andric ++__i; 4005*0b57cec5SDimitry Andric } 4006*0b57cec5SDimitry Andric // [__first, __i) == *__first and *__first < [__i, __last) 4007*0b57cec5SDimitry Andric // The first part is sorted, sort the secod part 4008*0b57cec5SDimitry Andric // _VSTD::__sort<_Compare>(__i, __last, __comp); 4009*0b57cec5SDimitry Andric __first = __i; 4010*0b57cec5SDimitry Andric goto __restart; 4011*0b57cec5SDimitry Andric } 4012*0b57cec5SDimitry Andric if (__comp(*__j, *__m)) 4013*0b57cec5SDimitry Andric { 4014*0b57cec5SDimitry Andric swap(*__i, *__j); 4015*0b57cec5SDimitry Andric ++__n_swaps; 4016*0b57cec5SDimitry Andric break; // found guard for downward moving __j, now use unguarded partition 4017*0b57cec5SDimitry Andric } 4018*0b57cec5SDimitry Andric } 4019*0b57cec5SDimitry Andric } 4020*0b57cec5SDimitry Andric // It is known that *__i < *__m 4021*0b57cec5SDimitry Andric ++__i; 4022*0b57cec5SDimitry Andric // j points beyond range to be tested, *__m is known to be <= *__lm1 4023*0b57cec5SDimitry Andric // if not yet partitioned... 4024*0b57cec5SDimitry Andric if (__i < __j) 4025*0b57cec5SDimitry Andric { 4026*0b57cec5SDimitry Andric // known that *(__i - 1) < *__m 4027*0b57cec5SDimitry Andric // known that __i <= __m 4028*0b57cec5SDimitry Andric while (true) 4029*0b57cec5SDimitry Andric { 4030*0b57cec5SDimitry Andric // __m still guards upward moving __i 4031*0b57cec5SDimitry Andric while (__comp(*__i, *__m)) 4032*0b57cec5SDimitry Andric ++__i; 4033*0b57cec5SDimitry Andric // It is now known that a guard exists for downward moving __j 4034*0b57cec5SDimitry Andric while (!__comp(*--__j, *__m)) 4035*0b57cec5SDimitry Andric ; 4036*0b57cec5SDimitry Andric if (__i > __j) 4037*0b57cec5SDimitry Andric break; 4038*0b57cec5SDimitry Andric swap(*__i, *__j); 4039*0b57cec5SDimitry Andric ++__n_swaps; 4040*0b57cec5SDimitry Andric // It is known that __m != __j 4041*0b57cec5SDimitry Andric // If __m just moved, follow it 4042*0b57cec5SDimitry Andric if (__m == __i) 4043*0b57cec5SDimitry Andric __m = __j; 4044*0b57cec5SDimitry Andric ++__i; 4045*0b57cec5SDimitry Andric } 4046*0b57cec5SDimitry Andric } 4047*0b57cec5SDimitry Andric // [__first, __i) < *__m and *__m <= [__i, __last) 4048*0b57cec5SDimitry Andric if (__i != __m && __comp(*__m, *__i)) 4049*0b57cec5SDimitry Andric { 4050*0b57cec5SDimitry Andric swap(*__i, *__m); 4051*0b57cec5SDimitry Andric ++__n_swaps; 4052*0b57cec5SDimitry Andric } 4053*0b57cec5SDimitry Andric // [__first, __i) < *__i and *__i <= [__i+1, __last) 4054*0b57cec5SDimitry Andric // If we were given a perfect partition, see if insertion sort is quick... 4055*0b57cec5SDimitry Andric if (__n_swaps == 0) 4056*0b57cec5SDimitry Andric { 4057*0b57cec5SDimitry Andric bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4058*0b57cec5SDimitry Andric if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 4059*0b57cec5SDimitry Andric { 4060*0b57cec5SDimitry Andric if (__fs) 4061*0b57cec5SDimitry Andric return; 4062*0b57cec5SDimitry Andric __last = __i; 4063*0b57cec5SDimitry Andric continue; 4064*0b57cec5SDimitry Andric } 4065*0b57cec5SDimitry Andric else 4066*0b57cec5SDimitry Andric { 4067*0b57cec5SDimitry Andric if (__fs) 4068*0b57cec5SDimitry Andric { 4069*0b57cec5SDimitry Andric __first = ++__i; 4070*0b57cec5SDimitry Andric continue; 4071*0b57cec5SDimitry Andric } 4072*0b57cec5SDimitry Andric } 4073*0b57cec5SDimitry Andric } 4074*0b57cec5SDimitry Andric // sort smaller range with recursive call and larger with tail recursion elimination 4075*0b57cec5SDimitry Andric if (__i - __first < __last - __i) 4076*0b57cec5SDimitry Andric { 4077*0b57cec5SDimitry Andric _VSTD::__sort<_Compare>(__first, __i, __comp); 4078*0b57cec5SDimitry Andric // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4079*0b57cec5SDimitry Andric __first = ++__i; 4080*0b57cec5SDimitry Andric } 4081*0b57cec5SDimitry Andric else 4082*0b57cec5SDimitry Andric { 4083*0b57cec5SDimitry Andric _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4084*0b57cec5SDimitry Andric // _VSTD::__sort<_Compare>(__first, __i, __comp); 4085*0b57cec5SDimitry Andric __last = __i; 4086*0b57cec5SDimitry Andric } 4087*0b57cec5SDimitry Andric } 4088*0b57cec5SDimitry Andric} 4089*0b57cec5SDimitry Andric 4090*0b57cec5SDimitry Andric// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 4091*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 4092*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4093*0b57cec5SDimitry Andricvoid 4094*0b57cec5SDimitry Andricsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4095*0b57cec5SDimitry Andric{ 4096*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4097*0b57cec5SDimitry Andric _VSTD::__sort<_Comp_ref>(__first, __last, _Comp_ref(__comp)); 4098*0b57cec5SDimitry Andric} 4099*0b57cec5SDimitry Andric 4100*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 4101*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4102*0b57cec5SDimitry Andricvoid 4103*0b57cec5SDimitry Andricsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 4104*0b57cec5SDimitry Andric{ 4105*0b57cec5SDimitry Andric _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 4106*0b57cec5SDimitry Andric} 4107*0b57cec5SDimitry Andric 4108*0b57cec5SDimitry Andrictemplate <class _Tp> 4109*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4110*0b57cec5SDimitry Andricvoid 4111*0b57cec5SDimitry Andricsort(_Tp** __first, _Tp** __last) 4112*0b57cec5SDimitry Andric{ 4113*0b57cec5SDimitry Andric _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 4114*0b57cec5SDimitry Andric} 4115*0b57cec5SDimitry Andric 4116*0b57cec5SDimitry Andrictemplate <class _Tp> 4117*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4118*0b57cec5SDimitry Andricvoid 4119*0b57cec5SDimitry Andricsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 4120*0b57cec5SDimitry Andric{ 4121*0b57cec5SDimitry Andric _VSTD::sort(__first.base(), __last.base()); 4122*0b57cec5SDimitry Andric} 4123*0b57cec5SDimitry Andric 4124*0b57cec5SDimitry Andrictemplate <class _Tp, class _Compare> 4125*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4126*0b57cec5SDimitry Andricvoid 4127*0b57cec5SDimitry Andricsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4128*0b57cec5SDimitry Andric{ 4129*0b57cec5SDimitry Andric typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4130*0b57cec5SDimitry Andric _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4131*0b57cec5SDimitry Andric} 4132*0b57cec5SDimitry Andric 4133*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4134*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4135*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4136*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4137*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4138*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4139*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4140*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4141*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4142*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4143*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4144*0b57cec5SDimitry Andric_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>&)) 4145*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4146*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4147*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 4148*0b57cec5SDimitry Andric 4149*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4150*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4151*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4152*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4153*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4154*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4155*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4156*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4157*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4158*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4159*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4160*0b57cec5SDimitry Andric_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>&)) 4161*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4162*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4163*0b57cec5SDimitry Andric_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 4164*0b57cec5SDimitry Andric 4165*0b57cec5SDimitry Andric_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>&)) 4166*0b57cec5SDimitry Andric 4167*0b57cec5SDimitry Andric// lower_bound 4168*0b57cec5SDimitry Andric 4169*0b57cec5SDimitry Andrictemplate <class _Compare, class _ForwardIterator, class _Tp> 4170*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4171*0b57cec5SDimitry Andric__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 4172*0b57cec5SDimitry Andric{ 4173*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4174*0b57cec5SDimitry Andric difference_type __len = _VSTD::distance(__first, __last); 4175*0b57cec5SDimitry Andric while (__len != 0) 4176*0b57cec5SDimitry Andric { 4177*0b57cec5SDimitry Andric difference_type __l2 = _VSTD::__half_positive(__len); 4178*0b57cec5SDimitry Andric _ForwardIterator __m = __first; 4179*0b57cec5SDimitry Andric _VSTD::advance(__m, __l2); 4180*0b57cec5SDimitry Andric if (__comp(*__m, __value_)) 4181*0b57cec5SDimitry Andric { 4182*0b57cec5SDimitry Andric __first = ++__m; 4183*0b57cec5SDimitry Andric __len -= __l2 + 1; 4184*0b57cec5SDimitry Andric } 4185*0b57cec5SDimitry Andric else 4186*0b57cec5SDimitry Andric __len = __l2; 4187*0b57cec5SDimitry Andric } 4188*0b57cec5SDimitry Andric return __first; 4189*0b57cec5SDimitry Andric} 4190*0b57cec5SDimitry Andric 4191*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp, class _Compare> 4192*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4193*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4194*0b57cec5SDimitry Andric_ForwardIterator 4195*0b57cec5SDimitry Andriclower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 4196*0b57cec5SDimitry Andric{ 4197*0b57cec5SDimitry Andric typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4198*0b57cec5SDimitry Andric return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4199*0b57cec5SDimitry Andric} 4200*0b57cec5SDimitry Andric 4201*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp> 4202*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4203*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4204*0b57cec5SDimitry Andric_ForwardIterator 4205*0b57cec5SDimitry Andriclower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 4206*0b57cec5SDimitry Andric{ 4207*0b57cec5SDimitry Andric return _VSTD::lower_bound(__first, __last, __value_, 4208*0b57cec5SDimitry Andric __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 4209*0b57cec5SDimitry Andric} 4210*0b57cec5SDimitry Andric 4211*0b57cec5SDimitry Andric// upper_bound 4212*0b57cec5SDimitry Andric 4213*0b57cec5SDimitry Andrictemplate <class _Compare, class _ForwardIterator, class _Tp> 4214*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4215*0b57cec5SDimitry Andric__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 4216*0b57cec5SDimitry Andric{ 4217*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4218*0b57cec5SDimitry Andric difference_type __len = _VSTD::distance(__first, __last); 4219*0b57cec5SDimitry Andric while (__len != 0) 4220*0b57cec5SDimitry Andric { 4221*0b57cec5SDimitry Andric difference_type __l2 = _VSTD::__half_positive(__len); 4222*0b57cec5SDimitry Andric _ForwardIterator __m = __first; 4223*0b57cec5SDimitry Andric _VSTD::advance(__m, __l2); 4224*0b57cec5SDimitry Andric if (__comp(__value_, *__m)) 4225*0b57cec5SDimitry Andric __len = __l2; 4226*0b57cec5SDimitry Andric else 4227*0b57cec5SDimitry Andric { 4228*0b57cec5SDimitry Andric __first = ++__m; 4229*0b57cec5SDimitry Andric __len -= __l2 + 1; 4230*0b57cec5SDimitry Andric } 4231*0b57cec5SDimitry Andric } 4232*0b57cec5SDimitry Andric return __first; 4233*0b57cec5SDimitry Andric} 4234*0b57cec5SDimitry Andric 4235*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp, class _Compare> 4236*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4237*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4238*0b57cec5SDimitry Andric_ForwardIterator 4239*0b57cec5SDimitry Andricupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 4240*0b57cec5SDimitry Andric{ 4241*0b57cec5SDimitry Andric typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4242*0b57cec5SDimitry Andric return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4243*0b57cec5SDimitry Andric} 4244*0b57cec5SDimitry Andric 4245*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp> 4246*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4247*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4248*0b57cec5SDimitry Andric_ForwardIterator 4249*0b57cec5SDimitry Andricupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 4250*0b57cec5SDimitry Andric{ 4251*0b57cec5SDimitry Andric return _VSTD::upper_bound(__first, __last, __value_, 4252*0b57cec5SDimitry Andric __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 4253*0b57cec5SDimitry Andric} 4254*0b57cec5SDimitry Andric 4255*0b57cec5SDimitry Andric// equal_range 4256*0b57cec5SDimitry Andric 4257*0b57cec5SDimitry Andrictemplate <class _Compare, class _ForwardIterator, class _Tp> 4258*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4259*0b57cec5SDimitry Andric__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 4260*0b57cec5SDimitry Andric{ 4261*0b57cec5SDimitry Andric typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4262*0b57cec5SDimitry Andric difference_type __len = _VSTD::distance(__first, __last); 4263*0b57cec5SDimitry Andric while (__len != 0) 4264*0b57cec5SDimitry Andric { 4265*0b57cec5SDimitry Andric difference_type __l2 = _VSTD::__half_positive(__len); 4266*0b57cec5SDimitry Andric _ForwardIterator __m = __first; 4267*0b57cec5SDimitry Andric _VSTD::advance(__m, __l2); 4268*0b57cec5SDimitry Andric if (__comp(*__m, __value_)) 4269*0b57cec5SDimitry Andric { 4270*0b57cec5SDimitry Andric __first = ++__m; 4271*0b57cec5SDimitry Andric __len -= __l2 + 1; 4272*0b57cec5SDimitry Andric } 4273*0b57cec5SDimitry Andric else if (__comp(__value_, *__m)) 4274*0b57cec5SDimitry Andric { 4275*0b57cec5SDimitry Andric __last = __m; 4276*0b57cec5SDimitry Andric __len = __l2; 4277*0b57cec5SDimitry Andric } 4278*0b57cec5SDimitry Andric else 4279*0b57cec5SDimitry Andric { 4280*0b57cec5SDimitry Andric _ForwardIterator __mp1 = __m; 4281*0b57cec5SDimitry Andric return pair<_ForwardIterator, _ForwardIterator> 4282*0b57cec5SDimitry Andric ( 4283*0b57cec5SDimitry Andric __lower_bound<_Compare>(__first, __m, __value_, __comp), 4284*0b57cec5SDimitry Andric __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 4285*0b57cec5SDimitry Andric ); 4286*0b57cec5SDimitry Andric } 4287*0b57cec5SDimitry Andric } 4288*0b57cec5SDimitry Andric return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 4289*0b57cec5SDimitry Andric} 4290*0b57cec5SDimitry Andric 4291*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp, class _Compare> 4292*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4293*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4294*0b57cec5SDimitry Andricpair<_ForwardIterator, _ForwardIterator> 4295*0b57cec5SDimitry Andricequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 4296*0b57cec5SDimitry Andric{ 4297*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4298*0b57cec5SDimitry Andric return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4299*0b57cec5SDimitry Andric} 4300*0b57cec5SDimitry Andric 4301*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp> 4302*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4303*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4304*0b57cec5SDimitry Andricpair<_ForwardIterator, _ForwardIterator> 4305*0b57cec5SDimitry Andricequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 4306*0b57cec5SDimitry Andric{ 4307*0b57cec5SDimitry Andric return _VSTD::equal_range(__first, __last, __value_, 4308*0b57cec5SDimitry Andric __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 4309*0b57cec5SDimitry Andric} 4310*0b57cec5SDimitry Andric 4311*0b57cec5SDimitry Andric// binary_search 4312*0b57cec5SDimitry Andric 4313*0b57cec5SDimitry Andrictemplate <class _Compare, class _ForwardIterator, class _Tp> 4314*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4315*0b57cec5SDimitry Andricbool 4316*0b57cec5SDimitry Andric__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 4317*0b57cec5SDimitry Andric{ 4318*0b57cec5SDimitry Andric __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4319*0b57cec5SDimitry Andric return __first != __last && !__comp(__value_, *__first); 4320*0b57cec5SDimitry Andric} 4321*0b57cec5SDimitry Andric 4322*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp, class _Compare> 4323*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4324*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4325*0b57cec5SDimitry Andricbool 4326*0b57cec5SDimitry Andricbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 4327*0b57cec5SDimitry Andric{ 4328*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4329*0b57cec5SDimitry Andric return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4330*0b57cec5SDimitry Andric} 4331*0b57cec5SDimitry Andric 4332*0b57cec5SDimitry Andrictemplate <class _ForwardIterator, class _Tp> 4333*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4334*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4335*0b57cec5SDimitry Andricbool 4336*0b57cec5SDimitry Andricbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 4337*0b57cec5SDimitry Andric{ 4338*0b57cec5SDimitry Andric return _VSTD::binary_search(__first, __last, __value_, 4339*0b57cec5SDimitry Andric __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 4340*0b57cec5SDimitry Andric} 4341*0b57cec5SDimitry Andric 4342*0b57cec5SDimitry Andric// merge 4343*0b57cec5SDimitry Andric 4344*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 4345*0b57cec5SDimitry Andric_OutputIterator 4346*0b57cec5SDimitry Andric__merge(_InputIterator1 __first1, _InputIterator1 __last1, 4347*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 4348*0b57cec5SDimitry Andric{ 4349*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__result) 4350*0b57cec5SDimitry Andric { 4351*0b57cec5SDimitry Andric if (__first2 == __last2) 4352*0b57cec5SDimitry Andric return _VSTD::copy(__first1, __last1, __result); 4353*0b57cec5SDimitry Andric if (__comp(*__first2, *__first1)) 4354*0b57cec5SDimitry Andric { 4355*0b57cec5SDimitry Andric *__result = *__first2; 4356*0b57cec5SDimitry Andric ++__first2; 4357*0b57cec5SDimitry Andric } 4358*0b57cec5SDimitry Andric else 4359*0b57cec5SDimitry Andric { 4360*0b57cec5SDimitry Andric *__result = *__first1; 4361*0b57cec5SDimitry Andric ++__first1; 4362*0b57cec5SDimitry Andric } 4363*0b57cec5SDimitry Andric } 4364*0b57cec5SDimitry Andric return _VSTD::copy(__first2, __last2, __result); 4365*0b57cec5SDimitry Andric} 4366*0b57cec5SDimitry Andric 4367*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 4368*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4369*0b57cec5SDimitry Andric_OutputIterator 4370*0b57cec5SDimitry Andricmerge(_InputIterator1 __first1, _InputIterator1 __last1, 4371*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 4372*0b57cec5SDimitry Andric{ 4373*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4374*0b57cec5SDimitry Andric return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4375*0b57cec5SDimitry Andric} 4376*0b57cec5SDimitry Andric 4377*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 4378*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4379*0b57cec5SDimitry Andric_OutputIterator 4380*0b57cec5SDimitry Andricmerge(_InputIterator1 __first1, _InputIterator1 __last1, 4381*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 4382*0b57cec5SDimitry Andric{ 4383*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator1>::value_type __v1; 4384*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator2>::value_type __v2; 4385*0b57cec5SDimitry Andric return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 4386*0b57cec5SDimitry Andric} 4387*0b57cec5SDimitry Andric 4388*0b57cec5SDimitry Andric// inplace_merge 4389*0b57cec5SDimitry Andric 4390*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4391*0b57cec5SDimitry Andric class _OutputIterator> 4392*0b57cec5SDimitry Andricvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4393*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, 4394*0b57cec5SDimitry Andric _OutputIterator __result, _Compare __comp) 4395*0b57cec5SDimitry Andric{ 4396*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__result) 4397*0b57cec5SDimitry Andric { 4398*0b57cec5SDimitry Andric if (__first2 == __last2) 4399*0b57cec5SDimitry Andric { 4400*0b57cec5SDimitry Andric _VSTD::move(__first1, __last1, __result); 4401*0b57cec5SDimitry Andric return; 4402*0b57cec5SDimitry Andric } 4403*0b57cec5SDimitry Andric 4404*0b57cec5SDimitry Andric if (__comp(*__first2, *__first1)) 4405*0b57cec5SDimitry Andric { 4406*0b57cec5SDimitry Andric *__result = _VSTD::move(*__first2); 4407*0b57cec5SDimitry Andric ++__first2; 4408*0b57cec5SDimitry Andric } 4409*0b57cec5SDimitry Andric else 4410*0b57cec5SDimitry Andric { 4411*0b57cec5SDimitry Andric *__result = _VSTD::move(*__first1); 4412*0b57cec5SDimitry Andric ++__first1; 4413*0b57cec5SDimitry Andric } 4414*0b57cec5SDimitry Andric } 4415*0b57cec5SDimitry Andric // __first2 through __last2 are already in the right spot. 4416*0b57cec5SDimitry Andric} 4417*0b57cec5SDimitry Andric 4418*0b57cec5SDimitry Andrictemplate <class _Compare, class _BidirectionalIterator> 4419*0b57cec5SDimitry Andricvoid 4420*0b57cec5SDimitry Andric__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 4421*0b57cec5SDimitry Andric _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 4422*0b57cec5SDimitry Andric typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 4423*0b57cec5SDimitry Andric typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 4424*0b57cec5SDimitry Andric{ 4425*0b57cec5SDimitry Andric typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 4426*0b57cec5SDimitry Andric __destruct_n __d(0); 4427*0b57cec5SDimitry Andric unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 4428*0b57cec5SDimitry Andric if (__len1 <= __len2) 4429*0b57cec5SDimitry Andric { 4430*0b57cec5SDimitry Andric value_type* __p = __buff; 4431*0b57cec5SDimitry Andric for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4432*0b57cec5SDimitry Andric ::new(__p) value_type(_VSTD::move(*__i)); 4433*0b57cec5SDimitry Andric __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 4434*0b57cec5SDimitry Andric } 4435*0b57cec5SDimitry Andric else 4436*0b57cec5SDimitry Andric { 4437*0b57cec5SDimitry Andric value_type* __p = __buff; 4438*0b57cec5SDimitry Andric for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4439*0b57cec5SDimitry Andric ::new(__p) value_type(_VSTD::move(*__i)); 4440*0b57cec5SDimitry Andric typedef reverse_iterator<_BidirectionalIterator> _RBi; 4441*0b57cec5SDimitry Andric typedef reverse_iterator<value_type*> _Rv; 4442*0b57cec5SDimitry Andric __half_inplace_merge(_Rv(__p), _Rv(__buff), 4443*0b57cec5SDimitry Andric _RBi(__middle), _RBi(__first), 4444*0b57cec5SDimitry Andric _RBi(__last), __invert<_Compare>(__comp)); 4445*0b57cec5SDimitry Andric } 4446*0b57cec5SDimitry Andric} 4447*0b57cec5SDimitry Andric 4448*0b57cec5SDimitry Andrictemplate <class _Compare, class _BidirectionalIterator> 4449*0b57cec5SDimitry Andricvoid 4450*0b57cec5SDimitry Andric__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 4451*0b57cec5SDimitry Andric _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 4452*0b57cec5SDimitry Andric typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 4453*0b57cec5SDimitry Andric typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 4454*0b57cec5SDimitry Andric{ 4455*0b57cec5SDimitry Andric typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4456*0b57cec5SDimitry Andric while (true) 4457*0b57cec5SDimitry Andric { 4458*0b57cec5SDimitry Andric // if __middle == __last, we're done 4459*0b57cec5SDimitry Andric if (__len2 == 0) 4460*0b57cec5SDimitry Andric return; 4461*0b57cec5SDimitry Andric if (__len1 <= __buff_size || __len2 <= __buff_size) 4462*0b57cec5SDimitry Andric return __buffered_inplace_merge<_Compare> 4463*0b57cec5SDimitry Andric (__first, __middle, __last, __comp, __len1, __len2, __buff); 4464*0b57cec5SDimitry Andric // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4465*0b57cec5SDimitry Andric for (; true; ++__first, (void) --__len1) 4466*0b57cec5SDimitry Andric { 4467*0b57cec5SDimitry Andric if (__len1 == 0) 4468*0b57cec5SDimitry Andric return; 4469*0b57cec5SDimitry Andric if (__comp(*__middle, *__first)) 4470*0b57cec5SDimitry Andric break; 4471*0b57cec5SDimitry Andric } 4472*0b57cec5SDimitry Andric // __first < __middle < __last 4473*0b57cec5SDimitry Andric // *__first > *__middle 4474*0b57cec5SDimitry Andric // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 4475*0b57cec5SDimitry Andric // all elements in: 4476*0b57cec5SDimitry Andric // [__first, __m1) <= [__middle, __m2) 4477*0b57cec5SDimitry Andric // [__middle, __m2) < [__m1, __middle) 4478*0b57cec5SDimitry Andric // [__m1, __middle) <= [__m2, __last) 4479*0b57cec5SDimitry Andric // and __m1 or __m2 is in the middle of its range 4480*0b57cec5SDimitry Andric _BidirectionalIterator __m1; // "median" of [__first, __middle) 4481*0b57cec5SDimitry Andric _BidirectionalIterator __m2; // "median" of [__middle, __last) 4482*0b57cec5SDimitry Andric difference_type __len11; // distance(__first, __m1) 4483*0b57cec5SDimitry Andric difference_type __len21; // distance(__middle, __m2) 4484*0b57cec5SDimitry Andric // binary search smaller range 4485*0b57cec5SDimitry Andric if (__len1 < __len2) 4486*0b57cec5SDimitry Andric { // __len >= 1, __len2 >= 2 4487*0b57cec5SDimitry Andric __len21 = __len2 / 2; 4488*0b57cec5SDimitry Andric __m2 = __middle; 4489*0b57cec5SDimitry Andric _VSTD::advance(__m2, __len21); 4490*0b57cec5SDimitry Andric __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4491*0b57cec5SDimitry Andric __len11 = _VSTD::distance(__first, __m1); 4492*0b57cec5SDimitry Andric } 4493*0b57cec5SDimitry Andric else 4494*0b57cec5SDimitry Andric { 4495*0b57cec5SDimitry Andric if (__len1 == 1) 4496*0b57cec5SDimitry Andric { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 4497*0b57cec5SDimitry Andric // It is known *__first > *__middle 4498*0b57cec5SDimitry Andric swap(*__first, *__middle); 4499*0b57cec5SDimitry Andric return; 4500*0b57cec5SDimitry Andric } 4501*0b57cec5SDimitry Andric // __len1 >= 2, __len2 >= 1 4502*0b57cec5SDimitry Andric __len11 = __len1 / 2; 4503*0b57cec5SDimitry Andric __m1 = __first; 4504*0b57cec5SDimitry Andric _VSTD::advance(__m1, __len11); 4505*0b57cec5SDimitry Andric __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4506*0b57cec5SDimitry Andric __len21 = _VSTD::distance(__middle, __m2); 4507*0b57cec5SDimitry Andric } 4508*0b57cec5SDimitry Andric difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 4509*0b57cec5SDimitry Andric difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 4510*0b57cec5SDimitry Andric // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 4511*0b57cec5SDimitry Andric // swap middle two partitions 4512*0b57cec5SDimitry Andric __middle = _VSTD::rotate(__m1, __middle, __m2); 4513*0b57cec5SDimitry Andric // __len12 and __len21 now have swapped meanings 4514*0b57cec5SDimitry Andric // merge smaller range with recurisve call and larger with tail recursion elimination 4515*0b57cec5SDimitry Andric if (__len11 + __len21 < __len12 + __len22) 4516*0b57cec5SDimitry Andric { 4517*0b57cec5SDimitry Andric __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 4518*0b57cec5SDimitry Andric// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 4519*0b57cec5SDimitry Andric __first = __middle; 4520*0b57cec5SDimitry Andric __middle = __m2; 4521*0b57cec5SDimitry Andric __len1 = __len12; 4522*0b57cec5SDimitry Andric __len2 = __len22; 4523*0b57cec5SDimitry Andric } 4524*0b57cec5SDimitry Andric else 4525*0b57cec5SDimitry Andric { 4526*0b57cec5SDimitry Andric __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 4527*0b57cec5SDimitry Andric// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 4528*0b57cec5SDimitry Andric __last = __middle; 4529*0b57cec5SDimitry Andric __middle = __m1; 4530*0b57cec5SDimitry Andric __len1 = __len11; 4531*0b57cec5SDimitry Andric __len2 = __len21; 4532*0b57cec5SDimitry Andric } 4533*0b57cec5SDimitry Andric } 4534*0b57cec5SDimitry Andric} 4535*0b57cec5SDimitry Andric 4536*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator, class _Compare> 4537*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4538*0b57cec5SDimitry Andricvoid 4539*0b57cec5SDimitry Andricinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 4540*0b57cec5SDimitry Andric _Compare __comp) 4541*0b57cec5SDimitry Andric{ 4542*0b57cec5SDimitry Andric typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 4543*0b57cec5SDimitry Andric typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4544*0b57cec5SDimitry Andric difference_type __len1 = _VSTD::distance(__first, __middle); 4545*0b57cec5SDimitry Andric difference_type __len2 = _VSTD::distance(__middle, __last); 4546*0b57cec5SDimitry Andric difference_type __buf_size = _VSTD::min(__len1, __len2); 4547*0b57cec5SDimitry Andric pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 4548*0b57cec5SDimitry Andric unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 4549*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4550*0b57cec5SDimitry Andric return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 4551*0b57cec5SDimitry Andric __buf.first, __buf.second); 4552*0b57cec5SDimitry Andric} 4553*0b57cec5SDimitry Andric 4554*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator> 4555*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4556*0b57cec5SDimitry Andricvoid 4557*0b57cec5SDimitry Andricinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 4558*0b57cec5SDimitry Andric{ 4559*0b57cec5SDimitry Andric _VSTD::inplace_merge(__first, __middle, __last, 4560*0b57cec5SDimitry Andric __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 4561*0b57cec5SDimitry Andric} 4562*0b57cec5SDimitry Andric 4563*0b57cec5SDimitry Andric// stable_sort 4564*0b57cec5SDimitry Andric 4565*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2> 4566*0b57cec5SDimitry Andricvoid 4567*0b57cec5SDimitry Andric__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 4568*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, 4569*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 4570*0b57cec5SDimitry Andric{ 4571*0b57cec5SDimitry Andric typedef typename iterator_traits<_InputIterator1>::value_type value_type; 4572*0b57cec5SDimitry Andric __destruct_n __d(0); 4573*0b57cec5SDimitry Andric unique_ptr<value_type, __destruct_n&> __h(__result, __d); 4574*0b57cec5SDimitry Andric for (; true; ++__result) 4575*0b57cec5SDimitry Andric { 4576*0b57cec5SDimitry Andric if (__first1 == __last1) 4577*0b57cec5SDimitry Andric { 4578*0b57cec5SDimitry Andric for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4579*0b57cec5SDimitry Andric ::new (__result) value_type(_VSTD::move(*__first2)); 4580*0b57cec5SDimitry Andric __h.release(); 4581*0b57cec5SDimitry Andric return; 4582*0b57cec5SDimitry Andric } 4583*0b57cec5SDimitry Andric if (__first2 == __last2) 4584*0b57cec5SDimitry Andric { 4585*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4586*0b57cec5SDimitry Andric ::new (__result) value_type(_VSTD::move(*__first1)); 4587*0b57cec5SDimitry Andric __h.release(); 4588*0b57cec5SDimitry Andric return; 4589*0b57cec5SDimitry Andric } 4590*0b57cec5SDimitry Andric if (__comp(*__first2, *__first1)) 4591*0b57cec5SDimitry Andric { 4592*0b57cec5SDimitry Andric ::new (__result) value_type(_VSTD::move(*__first2)); 4593*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 4594*0b57cec5SDimitry Andric ++__first2; 4595*0b57cec5SDimitry Andric } 4596*0b57cec5SDimitry Andric else 4597*0b57cec5SDimitry Andric { 4598*0b57cec5SDimitry Andric ::new (__result) value_type(_VSTD::move(*__first1)); 4599*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 4600*0b57cec5SDimitry Andric ++__first1; 4601*0b57cec5SDimitry Andric } 4602*0b57cec5SDimitry Andric } 4603*0b57cec5SDimitry Andric} 4604*0b57cec5SDimitry Andric 4605*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 4606*0b57cec5SDimitry Andricvoid 4607*0b57cec5SDimitry Andric__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 4608*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, 4609*0b57cec5SDimitry Andric _OutputIterator __result, _Compare __comp) 4610*0b57cec5SDimitry Andric{ 4611*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__result) 4612*0b57cec5SDimitry Andric { 4613*0b57cec5SDimitry Andric if (__first2 == __last2) 4614*0b57cec5SDimitry Andric { 4615*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__first1, ++__result) 4616*0b57cec5SDimitry Andric *__result = _VSTD::move(*__first1); 4617*0b57cec5SDimitry Andric return; 4618*0b57cec5SDimitry Andric } 4619*0b57cec5SDimitry Andric if (__comp(*__first2, *__first1)) 4620*0b57cec5SDimitry Andric { 4621*0b57cec5SDimitry Andric *__result = _VSTD::move(*__first2); 4622*0b57cec5SDimitry Andric ++__first2; 4623*0b57cec5SDimitry Andric } 4624*0b57cec5SDimitry Andric else 4625*0b57cec5SDimitry Andric { 4626*0b57cec5SDimitry Andric *__result = _VSTD::move(*__first1); 4627*0b57cec5SDimitry Andric ++__first1; 4628*0b57cec5SDimitry Andric } 4629*0b57cec5SDimitry Andric } 4630*0b57cec5SDimitry Andric for (; __first2 != __last2; ++__first2, ++__result) 4631*0b57cec5SDimitry Andric *__result = _VSTD::move(*__first2); 4632*0b57cec5SDimitry Andric} 4633*0b57cec5SDimitry Andric 4634*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 4635*0b57cec5SDimitry Andricvoid 4636*0b57cec5SDimitry Andric__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 4637*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __len, 4638*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 4639*0b57cec5SDimitry Andric 4640*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 4641*0b57cec5SDimitry Andricvoid 4642*0b57cec5SDimitry Andric__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 4643*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __len, 4644*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 4645*0b57cec5SDimitry Andric{ 4646*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4647*0b57cec5SDimitry Andric switch (__len) 4648*0b57cec5SDimitry Andric { 4649*0b57cec5SDimitry Andric case 0: 4650*0b57cec5SDimitry Andric return; 4651*0b57cec5SDimitry Andric case 1: 4652*0b57cec5SDimitry Andric ::new(__first2) value_type(_VSTD::move(*__first1)); 4653*0b57cec5SDimitry Andric return; 4654*0b57cec5SDimitry Andric case 2: 4655*0b57cec5SDimitry Andric __destruct_n __d(0); 4656*0b57cec5SDimitry Andric unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 4657*0b57cec5SDimitry Andric if (__comp(*--__last1, *__first1)) 4658*0b57cec5SDimitry Andric { 4659*0b57cec5SDimitry Andric ::new(__first2) value_type(_VSTD::move(*__last1)); 4660*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 4661*0b57cec5SDimitry Andric ++__first2; 4662*0b57cec5SDimitry Andric ::new(__first2) value_type(_VSTD::move(*__first1)); 4663*0b57cec5SDimitry Andric } 4664*0b57cec5SDimitry Andric else 4665*0b57cec5SDimitry Andric { 4666*0b57cec5SDimitry Andric ::new(__first2) value_type(_VSTD::move(*__first1)); 4667*0b57cec5SDimitry Andric __d.__incr((value_type*)0); 4668*0b57cec5SDimitry Andric ++__first2; 4669*0b57cec5SDimitry Andric ::new(__first2) value_type(_VSTD::move(*__last1)); 4670*0b57cec5SDimitry Andric } 4671*0b57cec5SDimitry Andric __h2.release(); 4672*0b57cec5SDimitry Andric return; 4673*0b57cec5SDimitry Andric } 4674*0b57cec5SDimitry Andric if (__len <= 8) 4675*0b57cec5SDimitry Andric { 4676*0b57cec5SDimitry Andric __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 4677*0b57cec5SDimitry Andric return; 4678*0b57cec5SDimitry Andric } 4679*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 4680*0b57cec5SDimitry Andric _RandomAccessIterator __m = __first1 + __l2; 4681*0b57cec5SDimitry Andric __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 4682*0b57cec5SDimitry Andric __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 4683*0b57cec5SDimitry Andric __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 4684*0b57cec5SDimitry Andric} 4685*0b57cec5SDimitry Andric 4686*0b57cec5SDimitry Andrictemplate <class _Tp> 4687*0b57cec5SDimitry Andricstruct __stable_sort_switch 4688*0b57cec5SDimitry Andric{ 4689*0b57cec5SDimitry Andric static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 4690*0b57cec5SDimitry Andric}; 4691*0b57cec5SDimitry Andric 4692*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 4693*0b57cec5SDimitry Andricvoid 4694*0b57cec5SDimitry Andric__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 4695*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __len, 4696*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 4697*0b57cec5SDimitry Andric{ 4698*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4699*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 4700*0b57cec5SDimitry Andric switch (__len) 4701*0b57cec5SDimitry Andric { 4702*0b57cec5SDimitry Andric case 0: 4703*0b57cec5SDimitry Andric case 1: 4704*0b57cec5SDimitry Andric return; 4705*0b57cec5SDimitry Andric case 2: 4706*0b57cec5SDimitry Andric if (__comp(*--__last, *__first)) 4707*0b57cec5SDimitry Andric swap(*__first, *__last); 4708*0b57cec5SDimitry Andric return; 4709*0b57cec5SDimitry Andric } 4710*0b57cec5SDimitry Andric if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 4711*0b57cec5SDimitry Andric { 4712*0b57cec5SDimitry Andric __insertion_sort<_Compare>(__first, __last, __comp); 4713*0b57cec5SDimitry Andric return; 4714*0b57cec5SDimitry Andric } 4715*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 4716*0b57cec5SDimitry Andric _RandomAccessIterator __m = __first + __l2; 4717*0b57cec5SDimitry Andric if (__len <= __buff_size) 4718*0b57cec5SDimitry Andric { 4719*0b57cec5SDimitry Andric __destruct_n __d(0); 4720*0b57cec5SDimitry Andric unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 4721*0b57cec5SDimitry Andric __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 4722*0b57cec5SDimitry Andric __d.__set(__l2, (value_type*)0); 4723*0b57cec5SDimitry Andric __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 4724*0b57cec5SDimitry Andric __d.__set(__len, (value_type*)0); 4725*0b57cec5SDimitry Andric __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 4726*0b57cec5SDimitry Andric// __merge<_Compare>(move_iterator<value_type*>(__buff), 4727*0b57cec5SDimitry Andric// move_iterator<value_type*>(__buff + __l2), 4728*0b57cec5SDimitry Andric// move_iterator<_RandomAccessIterator>(__buff + __l2), 4729*0b57cec5SDimitry Andric// move_iterator<_RandomAccessIterator>(__buff + __len), 4730*0b57cec5SDimitry Andric// __first, __comp); 4731*0b57cec5SDimitry Andric return; 4732*0b57cec5SDimitry Andric } 4733*0b57cec5SDimitry Andric __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 4734*0b57cec5SDimitry Andric __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 4735*0b57cec5SDimitry Andric __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 4736*0b57cec5SDimitry Andric} 4737*0b57cec5SDimitry Andric 4738*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 4739*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4740*0b57cec5SDimitry Andricvoid 4741*0b57cec5SDimitry Andricstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4742*0b57cec5SDimitry Andric{ 4743*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4744*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 4745*0b57cec5SDimitry Andric difference_type __len = __last - __first; 4746*0b57cec5SDimitry Andric pair<value_type*, ptrdiff_t> __buf(0, 0); 4747*0b57cec5SDimitry Andric unique_ptr<value_type, __return_temporary_buffer> __h; 4748*0b57cec5SDimitry Andric if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 4749*0b57cec5SDimitry Andric { 4750*0b57cec5SDimitry Andric __buf = _VSTD::get_temporary_buffer<value_type>(__len); 4751*0b57cec5SDimitry Andric __h.reset(__buf.first); 4752*0b57cec5SDimitry Andric } 4753*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4754*0b57cec5SDimitry Andric __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4755*0b57cec5SDimitry Andric} 4756*0b57cec5SDimitry Andric 4757*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 4758*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4759*0b57cec5SDimitry Andricvoid 4760*0b57cec5SDimitry Andricstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 4761*0b57cec5SDimitry Andric{ 4762*0b57cec5SDimitry Andric _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 4763*0b57cec5SDimitry Andric} 4764*0b57cec5SDimitry Andric 4765*0b57cec5SDimitry Andric// is_heap_until 4766*0b57cec5SDimitry Andric 4767*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 4768*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 4769*0b57cec5SDimitry Andricis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4770*0b57cec5SDimitry Andric{ 4771*0b57cec5SDimitry Andric typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 4772*0b57cec5SDimitry Andric difference_type __len = __last - __first; 4773*0b57cec5SDimitry Andric difference_type __p = 0; 4774*0b57cec5SDimitry Andric difference_type __c = 1; 4775*0b57cec5SDimitry Andric _RandomAccessIterator __pp = __first; 4776*0b57cec5SDimitry Andric while (__c < __len) 4777*0b57cec5SDimitry Andric { 4778*0b57cec5SDimitry Andric _RandomAccessIterator __cp = __first + __c; 4779*0b57cec5SDimitry Andric if (__comp(*__pp, *__cp)) 4780*0b57cec5SDimitry Andric return __cp; 4781*0b57cec5SDimitry Andric ++__c; 4782*0b57cec5SDimitry Andric ++__cp; 4783*0b57cec5SDimitry Andric if (__c == __len) 4784*0b57cec5SDimitry Andric return __last; 4785*0b57cec5SDimitry Andric if (__comp(*__pp, *__cp)) 4786*0b57cec5SDimitry Andric return __cp; 4787*0b57cec5SDimitry Andric ++__p; 4788*0b57cec5SDimitry Andric ++__pp; 4789*0b57cec5SDimitry Andric __c = 2 * __p + 1; 4790*0b57cec5SDimitry Andric } 4791*0b57cec5SDimitry Andric return __last; 4792*0b57cec5SDimitry Andric} 4793*0b57cec5SDimitry Andric 4794*0b57cec5SDimitry Andrictemplate<class _RandomAccessIterator> 4795*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4796*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4797*0b57cec5SDimitry Andric_RandomAccessIterator 4798*0b57cec5SDimitry Andricis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 4799*0b57cec5SDimitry Andric{ 4800*0b57cec5SDimitry Andric return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 4801*0b57cec5SDimitry Andric} 4802*0b57cec5SDimitry Andric 4803*0b57cec5SDimitry Andric// is_heap 4804*0b57cec5SDimitry Andric 4805*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 4806*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4807*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4808*0b57cec5SDimitry Andricbool 4809*0b57cec5SDimitry Andricis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4810*0b57cec5SDimitry Andric{ 4811*0b57cec5SDimitry Andric return _VSTD::is_heap_until(__first, __last, __comp) == __last; 4812*0b57cec5SDimitry Andric} 4813*0b57cec5SDimitry Andric 4814*0b57cec5SDimitry Andrictemplate<class _RandomAccessIterator> 4815*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 4816*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 4817*0b57cec5SDimitry Andricbool 4818*0b57cec5SDimitry Andricis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 4819*0b57cec5SDimitry Andric{ 4820*0b57cec5SDimitry Andric return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 4821*0b57cec5SDimitry Andric} 4822*0b57cec5SDimitry Andric 4823*0b57cec5SDimitry Andric// push_heap 4824*0b57cec5SDimitry Andric 4825*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 4826*0b57cec5SDimitry Andricvoid 4827*0b57cec5SDimitry Andric__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 4828*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __len) 4829*0b57cec5SDimitry Andric{ 4830*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4831*0b57cec5SDimitry Andric if (__len > 1) 4832*0b57cec5SDimitry Andric { 4833*0b57cec5SDimitry Andric __len = (__len - 2) / 2; 4834*0b57cec5SDimitry Andric _RandomAccessIterator __ptr = __first + __len; 4835*0b57cec5SDimitry Andric if (__comp(*__ptr, *--__last)) 4836*0b57cec5SDimitry Andric { 4837*0b57cec5SDimitry Andric value_type __t(_VSTD::move(*__last)); 4838*0b57cec5SDimitry Andric do 4839*0b57cec5SDimitry Andric { 4840*0b57cec5SDimitry Andric *__last = _VSTD::move(*__ptr); 4841*0b57cec5SDimitry Andric __last = __ptr; 4842*0b57cec5SDimitry Andric if (__len == 0) 4843*0b57cec5SDimitry Andric break; 4844*0b57cec5SDimitry Andric __len = (__len - 1) / 2; 4845*0b57cec5SDimitry Andric __ptr = __first + __len; 4846*0b57cec5SDimitry Andric } while (__comp(*__ptr, __t)); 4847*0b57cec5SDimitry Andric *__last = _VSTD::move(__t); 4848*0b57cec5SDimitry Andric } 4849*0b57cec5SDimitry Andric } 4850*0b57cec5SDimitry Andric} 4851*0b57cec5SDimitry Andric 4852*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 4853*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4854*0b57cec5SDimitry Andricvoid 4855*0b57cec5SDimitry Andricpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4856*0b57cec5SDimitry Andric{ 4857*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4858*0b57cec5SDimitry Andric __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4859*0b57cec5SDimitry Andric} 4860*0b57cec5SDimitry Andric 4861*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 4862*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4863*0b57cec5SDimitry Andricvoid 4864*0b57cec5SDimitry Andricpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 4865*0b57cec5SDimitry Andric{ 4866*0b57cec5SDimitry Andric _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 4867*0b57cec5SDimitry Andric} 4868*0b57cec5SDimitry Andric 4869*0b57cec5SDimitry Andric// pop_heap 4870*0b57cec5SDimitry Andric 4871*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 4872*0b57cec5SDimitry Andricvoid 4873*0b57cec5SDimitry Andric__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4874*0b57cec5SDimitry Andric _Compare __comp, 4875*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __len, 4876*0b57cec5SDimitry Andric _RandomAccessIterator __start) 4877*0b57cec5SDimitry Andric{ 4878*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 4879*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4880*0b57cec5SDimitry Andric // left-child of __start is at 2 * __start + 1 4881*0b57cec5SDimitry Andric // right-child of __start is at 2 * __start + 2 4882*0b57cec5SDimitry Andric difference_type __child = __start - __first; 4883*0b57cec5SDimitry Andric 4884*0b57cec5SDimitry Andric if (__len < 2 || (__len - 2) / 2 < __child) 4885*0b57cec5SDimitry Andric return; 4886*0b57cec5SDimitry Andric 4887*0b57cec5SDimitry Andric __child = 2 * __child + 1; 4888*0b57cec5SDimitry Andric _RandomAccessIterator __child_i = __first + __child; 4889*0b57cec5SDimitry Andric 4890*0b57cec5SDimitry Andric if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 4891*0b57cec5SDimitry Andric // right-child exists and is greater than left-child 4892*0b57cec5SDimitry Andric ++__child_i; 4893*0b57cec5SDimitry Andric ++__child; 4894*0b57cec5SDimitry Andric } 4895*0b57cec5SDimitry Andric 4896*0b57cec5SDimitry Andric // check if we are in heap-order 4897*0b57cec5SDimitry Andric if (__comp(*__child_i, *__start)) 4898*0b57cec5SDimitry Andric // we are, __start is larger than it's largest child 4899*0b57cec5SDimitry Andric return; 4900*0b57cec5SDimitry Andric 4901*0b57cec5SDimitry Andric value_type __top(_VSTD::move(*__start)); 4902*0b57cec5SDimitry Andric do 4903*0b57cec5SDimitry Andric { 4904*0b57cec5SDimitry Andric // we are not in heap-order, swap the parent with it's largest child 4905*0b57cec5SDimitry Andric *__start = _VSTD::move(*__child_i); 4906*0b57cec5SDimitry Andric __start = __child_i; 4907*0b57cec5SDimitry Andric 4908*0b57cec5SDimitry Andric if ((__len - 2) / 2 < __child) 4909*0b57cec5SDimitry Andric break; 4910*0b57cec5SDimitry Andric 4911*0b57cec5SDimitry Andric // recompute the child based off of the updated parent 4912*0b57cec5SDimitry Andric __child = 2 * __child + 1; 4913*0b57cec5SDimitry Andric __child_i = __first + __child; 4914*0b57cec5SDimitry Andric 4915*0b57cec5SDimitry Andric if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 4916*0b57cec5SDimitry Andric // right-child exists and is greater than left-child 4917*0b57cec5SDimitry Andric ++__child_i; 4918*0b57cec5SDimitry Andric ++__child; 4919*0b57cec5SDimitry Andric } 4920*0b57cec5SDimitry Andric 4921*0b57cec5SDimitry Andric // check if we are in heap-order 4922*0b57cec5SDimitry Andric } while (!__comp(*__child_i, __top)); 4923*0b57cec5SDimitry Andric *__start = _VSTD::move(__top); 4924*0b57cec5SDimitry Andric} 4925*0b57cec5SDimitry Andric 4926*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 4927*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4928*0b57cec5SDimitry Andricvoid 4929*0b57cec5SDimitry Andric__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 4930*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __len) 4931*0b57cec5SDimitry Andric{ 4932*0b57cec5SDimitry Andric if (__len > 1) 4933*0b57cec5SDimitry Andric { 4934*0b57cec5SDimitry Andric swap(*__first, *--__last); 4935*0b57cec5SDimitry Andric __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 4936*0b57cec5SDimitry Andric } 4937*0b57cec5SDimitry Andric} 4938*0b57cec5SDimitry Andric 4939*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 4940*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4941*0b57cec5SDimitry Andricvoid 4942*0b57cec5SDimitry Andricpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4943*0b57cec5SDimitry Andric{ 4944*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4945*0b57cec5SDimitry Andric __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4946*0b57cec5SDimitry Andric} 4947*0b57cec5SDimitry Andric 4948*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 4949*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4950*0b57cec5SDimitry Andricvoid 4951*0b57cec5SDimitry Andricpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 4952*0b57cec5SDimitry Andric{ 4953*0b57cec5SDimitry Andric _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 4954*0b57cec5SDimitry Andric} 4955*0b57cec5SDimitry Andric 4956*0b57cec5SDimitry Andric// make_heap 4957*0b57cec5SDimitry Andric 4958*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 4959*0b57cec5SDimitry Andricvoid 4960*0b57cec5SDimitry Andric__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4961*0b57cec5SDimitry Andric{ 4962*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 4963*0b57cec5SDimitry Andric difference_type __n = __last - __first; 4964*0b57cec5SDimitry Andric if (__n > 1) 4965*0b57cec5SDimitry Andric { 4966*0b57cec5SDimitry Andric // start from the first parent, there is no need to consider children 4967*0b57cec5SDimitry Andric for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 4968*0b57cec5SDimitry Andric { 4969*0b57cec5SDimitry Andric __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 4970*0b57cec5SDimitry Andric } 4971*0b57cec5SDimitry Andric } 4972*0b57cec5SDimitry Andric} 4973*0b57cec5SDimitry Andric 4974*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 4975*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4976*0b57cec5SDimitry Andricvoid 4977*0b57cec5SDimitry Andricmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4978*0b57cec5SDimitry Andric{ 4979*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4980*0b57cec5SDimitry Andric __make_heap<_Comp_ref>(__first, __last, __comp); 4981*0b57cec5SDimitry Andric} 4982*0b57cec5SDimitry Andric 4983*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 4984*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 4985*0b57cec5SDimitry Andricvoid 4986*0b57cec5SDimitry Andricmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 4987*0b57cec5SDimitry Andric{ 4988*0b57cec5SDimitry Andric _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 4989*0b57cec5SDimitry Andric} 4990*0b57cec5SDimitry Andric 4991*0b57cec5SDimitry Andric// sort_heap 4992*0b57cec5SDimitry Andric 4993*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 4994*0b57cec5SDimitry Andricvoid 4995*0b57cec5SDimitry Andric__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 4996*0b57cec5SDimitry Andric{ 4997*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 4998*0b57cec5SDimitry Andric for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 4999*0b57cec5SDimitry Andric __pop_heap<_Compare>(__first, __last, __comp, __n); 5000*0b57cec5SDimitry Andric} 5001*0b57cec5SDimitry Andric 5002*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 5003*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5004*0b57cec5SDimitry Andricvoid 5005*0b57cec5SDimitry Andricsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 5006*0b57cec5SDimitry Andric{ 5007*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5008*0b57cec5SDimitry Andric __sort_heap<_Comp_ref>(__first, __last, __comp); 5009*0b57cec5SDimitry Andric} 5010*0b57cec5SDimitry Andric 5011*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 5012*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5013*0b57cec5SDimitry Andricvoid 5014*0b57cec5SDimitry Andricsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 5015*0b57cec5SDimitry Andric{ 5016*0b57cec5SDimitry Andric _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 5017*0b57cec5SDimitry Andric} 5018*0b57cec5SDimitry Andric 5019*0b57cec5SDimitry Andric// partial_sort 5020*0b57cec5SDimitry Andric 5021*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 5022*0b57cec5SDimitry Andricvoid 5023*0b57cec5SDimitry Andric__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 5024*0b57cec5SDimitry Andric _Compare __comp) 5025*0b57cec5SDimitry Andric{ 5026*0b57cec5SDimitry Andric __make_heap<_Compare>(__first, __middle, __comp); 5027*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 5028*0b57cec5SDimitry Andric for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 5029*0b57cec5SDimitry Andric { 5030*0b57cec5SDimitry Andric if (__comp(*__i, *__first)) 5031*0b57cec5SDimitry Andric { 5032*0b57cec5SDimitry Andric swap(*__i, *__first); 5033*0b57cec5SDimitry Andric __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 5034*0b57cec5SDimitry Andric } 5035*0b57cec5SDimitry Andric } 5036*0b57cec5SDimitry Andric __sort_heap<_Compare>(__first, __middle, __comp); 5037*0b57cec5SDimitry Andric} 5038*0b57cec5SDimitry Andric 5039*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 5040*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5041*0b57cec5SDimitry Andricvoid 5042*0b57cec5SDimitry Andricpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 5043*0b57cec5SDimitry Andric _Compare __comp) 5044*0b57cec5SDimitry Andric{ 5045*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5046*0b57cec5SDimitry Andric __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5047*0b57cec5SDimitry Andric} 5048*0b57cec5SDimitry Andric 5049*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 5050*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5051*0b57cec5SDimitry Andricvoid 5052*0b57cec5SDimitry Andricpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 5053*0b57cec5SDimitry Andric{ 5054*0b57cec5SDimitry Andric _VSTD::partial_sort(__first, __middle, __last, 5055*0b57cec5SDimitry Andric __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 5056*0b57cec5SDimitry Andric} 5057*0b57cec5SDimitry Andric 5058*0b57cec5SDimitry Andric// partial_sort_copy 5059*0b57cec5SDimitry Andric 5060*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 5061*0b57cec5SDimitry Andric_RandomAccessIterator 5062*0b57cec5SDimitry Andric__partial_sort_copy(_InputIterator __first, _InputIterator __last, 5063*0b57cec5SDimitry Andric _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 5064*0b57cec5SDimitry Andric{ 5065*0b57cec5SDimitry Andric _RandomAccessIterator __r = __result_first; 5066*0b57cec5SDimitry Andric if (__r != __result_last) 5067*0b57cec5SDimitry Andric { 5068*0b57cec5SDimitry Andric for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 5069*0b57cec5SDimitry Andric *__r = *__first; 5070*0b57cec5SDimitry Andric __make_heap<_Compare>(__result_first, __r, __comp); 5071*0b57cec5SDimitry Andric typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 5072*0b57cec5SDimitry Andric for (; __first != __last; ++__first) 5073*0b57cec5SDimitry Andric if (__comp(*__first, *__result_first)) 5074*0b57cec5SDimitry Andric { 5075*0b57cec5SDimitry Andric *__result_first = *__first; 5076*0b57cec5SDimitry Andric __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 5077*0b57cec5SDimitry Andric } 5078*0b57cec5SDimitry Andric __sort_heap<_Compare>(__result_first, __r, __comp); 5079*0b57cec5SDimitry Andric } 5080*0b57cec5SDimitry Andric return __r; 5081*0b57cec5SDimitry Andric} 5082*0b57cec5SDimitry Andric 5083*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 5084*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5085*0b57cec5SDimitry Andric_RandomAccessIterator 5086*0b57cec5SDimitry Andricpartial_sort_copy(_InputIterator __first, _InputIterator __last, 5087*0b57cec5SDimitry Andric _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 5088*0b57cec5SDimitry Andric{ 5089*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5090*0b57cec5SDimitry Andric return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5091*0b57cec5SDimitry Andric} 5092*0b57cec5SDimitry Andric 5093*0b57cec5SDimitry Andrictemplate <class _InputIterator, class _RandomAccessIterator> 5094*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5095*0b57cec5SDimitry Andric_RandomAccessIterator 5096*0b57cec5SDimitry Andricpartial_sort_copy(_InputIterator __first, _InputIterator __last, 5097*0b57cec5SDimitry Andric _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 5098*0b57cec5SDimitry Andric{ 5099*0b57cec5SDimitry Andric return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 5100*0b57cec5SDimitry Andric __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 5101*0b57cec5SDimitry Andric} 5102*0b57cec5SDimitry Andric 5103*0b57cec5SDimitry Andric// nth_element 5104*0b57cec5SDimitry Andric 5105*0b57cec5SDimitry Andrictemplate <class _Compare, class _RandomAccessIterator> 5106*0b57cec5SDimitry Andricvoid 5107*0b57cec5SDimitry Andric__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 5108*0b57cec5SDimitry Andric{ 5109*0b57cec5SDimitry Andric // _Compare is known to be a reference type 5110*0b57cec5SDimitry Andric typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 5111*0b57cec5SDimitry Andric const difference_type __limit = 7; 5112*0b57cec5SDimitry Andric while (true) 5113*0b57cec5SDimitry Andric { 5114*0b57cec5SDimitry Andric __restart: 5115*0b57cec5SDimitry Andric if (__nth == __last) 5116*0b57cec5SDimitry Andric return; 5117*0b57cec5SDimitry Andric difference_type __len = __last - __first; 5118*0b57cec5SDimitry Andric switch (__len) 5119*0b57cec5SDimitry Andric { 5120*0b57cec5SDimitry Andric case 0: 5121*0b57cec5SDimitry Andric case 1: 5122*0b57cec5SDimitry Andric return; 5123*0b57cec5SDimitry Andric case 2: 5124*0b57cec5SDimitry Andric if (__comp(*--__last, *__first)) 5125*0b57cec5SDimitry Andric swap(*__first, *__last); 5126*0b57cec5SDimitry Andric return; 5127*0b57cec5SDimitry Andric case 3: 5128*0b57cec5SDimitry Andric { 5129*0b57cec5SDimitry Andric _RandomAccessIterator __m = __first; 5130*0b57cec5SDimitry Andric _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 5131*0b57cec5SDimitry Andric return; 5132*0b57cec5SDimitry Andric } 5133*0b57cec5SDimitry Andric } 5134*0b57cec5SDimitry Andric if (__len <= __limit) 5135*0b57cec5SDimitry Andric { 5136*0b57cec5SDimitry Andric __selection_sort<_Compare>(__first, __last, __comp); 5137*0b57cec5SDimitry Andric return; 5138*0b57cec5SDimitry Andric } 5139*0b57cec5SDimitry Andric // __len > __limit >= 3 5140*0b57cec5SDimitry Andric _RandomAccessIterator __m = __first + __len/2; 5141*0b57cec5SDimitry Andric _RandomAccessIterator __lm1 = __last; 5142*0b57cec5SDimitry Andric unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 5143*0b57cec5SDimitry Andric // *__m is median 5144*0b57cec5SDimitry Andric // partition [__first, __m) < *__m and *__m <= [__m, __last) 5145*0b57cec5SDimitry Andric // (this inhibits tossing elements equivalent to __m around unnecessarily) 5146*0b57cec5SDimitry Andric _RandomAccessIterator __i = __first; 5147*0b57cec5SDimitry Andric _RandomAccessIterator __j = __lm1; 5148*0b57cec5SDimitry Andric // j points beyond range to be tested, *__lm1 is known to be <= *__m 5149*0b57cec5SDimitry Andric // The search going up is known to be guarded but the search coming down isn't. 5150*0b57cec5SDimitry Andric // Prime the downward search with a guard. 5151*0b57cec5SDimitry Andric if (!__comp(*__i, *__m)) // if *__first == *__m 5152*0b57cec5SDimitry Andric { 5153*0b57cec5SDimitry Andric // *__first == *__m, *__first doesn't go in first part 5154*0b57cec5SDimitry Andric // manually guard downward moving __j against __i 5155*0b57cec5SDimitry Andric while (true) 5156*0b57cec5SDimitry Andric { 5157*0b57cec5SDimitry Andric if (__i == --__j) 5158*0b57cec5SDimitry Andric { 5159*0b57cec5SDimitry Andric // *__first == *__m, *__m <= all other elements 5160*0b57cec5SDimitry Andric // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 5161*0b57cec5SDimitry Andric ++__i; // __first + 1 5162*0b57cec5SDimitry Andric __j = __last; 5163*0b57cec5SDimitry Andric if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 5164*0b57cec5SDimitry Andric { 5165*0b57cec5SDimitry Andric while (true) 5166*0b57cec5SDimitry Andric { 5167*0b57cec5SDimitry Andric if (__i == __j) 5168*0b57cec5SDimitry Andric return; // [__first, __last) all equivalent elements 5169*0b57cec5SDimitry Andric if (__comp(*__first, *__i)) 5170*0b57cec5SDimitry Andric { 5171*0b57cec5SDimitry Andric swap(*__i, *__j); 5172*0b57cec5SDimitry Andric ++__n_swaps; 5173*0b57cec5SDimitry Andric ++__i; 5174*0b57cec5SDimitry Andric break; 5175*0b57cec5SDimitry Andric } 5176*0b57cec5SDimitry Andric ++__i; 5177*0b57cec5SDimitry Andric } 5178*0b57cec5SDimitry Andric } 5179*0b57cec5SDimitry Andric // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 5180*0b57cec5SDimitry Andric if (__i == __j) 5181*0b57cec5SDimitry Andric return; 5182*0b57cec5SDimitry Andric while (true) 5183*0b57cec5SDimitry Andric { 5184*0b57cec5SDimitry Andric while (!__comp(*__first, *__i)) 5185*0b57cec5SDimitry Andric ++__i; 5186*0b57cec5SDimitry Andric while (__comp(*__first, *--__j)) 5187*0b57cec5SDimitry Andric ; 5188*0b57cec5SDimitry Andric if (__i >= __j) 5189*0b57cec5SDimitry Andric break; 5190*0b57cec5SDimitry Andric swap(*__i, *__j); 5191*0b57cec5SDimitry Andric ++__n_swaps; 5192*0b57cec5SDimitry Andric ++__i; 5193*0b57cec5SDimitry Andric } 5194*0b57cec5SDimitry Andric // [__first, __i) == *__first and *__first < [__i, __last) 5195*0b57cec5SDimitry Andric // The first part is sorted, 5196*0b57cec5SDimitry Andric if (__nth < __i) 5197*0b57cec5SDimitry Andric return; 5198*0b57cec5SDimitry Andric // __nth_element the secod part 5199*0b57cec5SDimitry Andric // __nth_element<_Compare>(__i, __nth, __last, __comp); 5200*0b57cec5SDimitry Andric __first = __i; 5201*0b57cec5SDimitry Andric goto __restart; 5202*0b57cec5SDimitry Andric } 5203*0b57cec5SDimitry Andric if (__comp(*__j, *__m)) 5204*0b57cec5SDimitry Andric { 5205*0b57cec5SDimitry Andric swap(*__i, *__j); 5206*0b57cec5SDimitry Andric ++__n_swaps; 5207*0b57cec5SDimitry Andric break; // found guard for downward moving __j, now use unguarded partition 5208*0b57cec5SDimitry Andric } 5209*0b57cec5SDimitry Andric } 5210*0b57cec5SDimitry Andric } 5211*0b57cec5SDimitry Andric ++__i; 5212*0b57cec5SDimitry Andric // j points beyond range to be tested, *__lm1 is known to be <= *__m 5213*0b57cec5SDimitry Andric // if not yet partitioned... 5214*0b57cec5SDimitry Andric if (__i < __j) 5215*0b57cec5SDimitry Andric { 5216*0b57cec5SDimitry Andric // known that *(__i - 1) < *__m 5217*0b57cec5SDimitry Andric while (true) 5218*0b57cec5SDimitry Andric { 5219*0b57cec5SDimitry Andric // __m still guards upward moving __i 5220*0b57cec5SDimitry Andric while (__comp(*__i, *__m)) 5221*0b57cec5SDimitry Andric ++__i; 5222*0b57cec5SDimitry Andric // It is now known that a guard exists for downward moving __j 5223*0b57cec5SDimitry Andric while (!__comp(*--__j, *__m)) 5224*0b57cec5SDimitry Andric ; 5225*0b57cec5SDimitry Andric if (__i >= __j) 5226*0b57cec5SDimitry Andric break; 5227*0b57cec5SDimitry Andric swap(*__i, *__j); 5228*0b57cec5SDimitry Andric ++__n_swaps; 5229*0b57cec5SDimitry Andric // It is known that __m != __j 5230*0b57cec5SDimitry Andric // If __m just moved, follow it 5231*0b57cec5SDimitry Andric if (__m == __i) 5232*0b57cec5SDimitry Andric __m = __j; 5233*0b57cec5SDimitry Andric ++__i; 5234*0b57cec5SDimitry Andric } 5235*0b57cec5SDimitry Andric } 5236*0b57cec5SDimitry Andric // [__first, __i) < *__m and *__m <= [__i, __last) 5237*0b57cec5SDimitry Andric if (__i != __m && __comp(*__m, *__i)) 5238*0b57cec5SDimitry Andric { 5239*0b57cec5SDimitry Andric swap(*__i, *__m); 5240*0b57cec5SDimitry Andric ++__n_swaps; 5241*0b57cec5SDimitry Andric } 5242*0b57cec5SDimitry Andric // [__first, __i) < *__i and *__i <= [__i+1, __last) 5243*0b57cec5SDimitry Andric if (__nth == __i) 5244*0b57cec5SDimitry Andric return; 5245*0b57cec5SDimitry Andric if (__n_swaps == 0) 5246*0b57cec5SDimitry Andric { 5247*0b57cec5SDimitry Andric // We were given a perfectly partitioned sequence. Coincidence? 5248*0b57cec5SDimitry Andric if (__nth < __i) 5249*0b57cec5SDimitry Andric { 5250*0b57cec5SDimitry Andric // Check for [__first, __i) already sorted 5251*0b57cec5SDimitry Andric __j = __m = __first; 5252*0b57cec5SDimitry Andric while (++__j != __i) 5253*0b57cec5SDimitry Andric { 5254*0b57cec5SDimitry Andric if (__comp(*__j, *__m)) 5255*0b57cec5SDimitry Andric // not yet sorted, so sort 5256*0b57cec5SDimitry Andric goto not_sorted; 5257*0b57cec5SDimitry Andric __m = __j; 5258*0b57cec5SDimitry Andric } 5259*0b57cec5SDimitry Andric // [__first, __i) sorted 5260*0b57cec5SDimitry Andric return; 5261*0b57cec5SDimitry Andric } 5262*0b57cec5SDimitry Andric else 5263*0b57cec5SDimitry Andric { 5264*0b57cec5SDimitry Andric // Check for [__i, __last) already sorted 5265*0b57cec5SDimitry Andric __j = __m = __i; 5266*0b57cec5SDimitry Andric while (++__j != __last) 5267*0b57cec5SDimitry Andric { 5268*0b57cec5SDimitry Andric if (__comp(*__j, *__m)) 5269*0b57cec5SDimitry Andric // not yet sorted, so sort 5270*0b57cec5SDimitry Andric goto not_sorted; 5271*0b57cec5SDimitry Andric __m = __j; 5272*0b57cec5SDimitry Andric } 5273*0b57cec5SDimitry Andric // [__i, __last) sorted 5274*0b57cec5SDimitry Andric return; 5275*0b57cec5SDimitry Andric } 5276*0b57cec5SDimitry Andric } 5277*0b57cec5SDimitry Andricnot_sorted: 5278*0b57cec5SDimitry Andric // __nth_element on range containing __nth 5279*0b57cec5SDimitry Andric if (__nth < __i) 5280*0b57cec5SDimitry Andric { 5281*0b57cec5SDimitry Andric // __nth_element<_Compare>(__first, __nth, __i, __comp); 5282*0b57cec5SDimitry Andric __last = __i; 5283*0b57cec5SDimitry Andric } 5284*0b57cec5SDimitry Andric else 5285*0b57cec5SDimitry Andric { 5286*0b57cec5SDimitry Andric // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 5287*0b57cec5SDimitry Andric __first = ++__i; 5288*0b57cec5SDimitry Andric } 5289*0b57cec5SDimitry Andric } 5290*0b57cec5SDimitry Andric} 5291*0b57cec5SDimitry Andric 5292*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator, class _Compare> 5293*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5294*0b57cec5SDimitry Andricvoid 5295*0b57cec5SDimitry Andricnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 5296*0b57cec5SDimitry Andric{ 5297*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5298*0b57cec5SDimitry Andric __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5299*0b57cec5SDimitry Andric} 5300*0b57cec5SDimitry Andric 5301*0b57cec5SDimitry Andrictemplate <class _RandomAccessIterator> 5302*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5303*0b57cec5SDimitry Andricvoid 5304*0b57cec5SDimitry Andricnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 5305*0b57cec5SDimitry Andric{ 5306*0b57cec5SDimitry Andric _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 5307*0b57cec5SDimitry Andric} 5308*0b57cec5SDimitry Andric 5309*0b57cec5SDimitry Andric// includes 5310*0b57cec5SDimitry Andric 5311*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2> 5312*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 5313*0b57cec5SDimitry Andric__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 5314*0b57cec5SDimitry Andric _Compare __comp) 5315*0b57cec5SDimitry Andric{ 5316*0b57cec5SDimitry Andric for (; __first2 != __last2; ++__first1) 5317*0b57cec5SDimitry Andric { 5318*0b57cec5SDimitry Andric if (__first1 == __last1 || __comp(*__first2, *__first1)) 5319*0b57cec5SDimitry Andric return false; 5320*0b57cec5SDimitry Andric if (!__comp(*__first1, *__first2)) 5321*0b57cec5SDimitry Andric ++__first2; 5322*0b57cec5SDimitry Andric } 5323*0b57cec5SDimitry Andric return true; 5324*0b57cec5SDimitry Andric} 5325*0b57cec5SDimitry Andric 5326*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _Compare> 5327*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 5328*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 5329*0b57cec5SDimitry Andricbool 5330*0b57cec5SDimitry Andricincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 5331*0b57cec5SDimitry Andric _Compare __comp) 5332*0b57cec5SDimitry Andric{ 5333*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5334*0b57cec5SDimitry Andric return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5335*0b57cec5SDimitry Andric} 5336*0b57cec5SDimitry Andric 5337*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2> 5338*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 5339*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 5340*0b57cec5SDimitry Andricbool 5341*0b57cec5SDimitry Andricincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 5342*0b57cec5SDimitry Andric{ 5343*0b57cec5SDimitry Andric return _VSTD::includes(__first1, __last1, __first2, __last2, 5344*0b57cec5SDimitry Andric __less<typename iterator_traits<_InputIterator1>::value_type, 5345*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator2>::value_type>()); 5346*0b57cec5SDimitry Andric} 5347*0b57cec5SDimitry Andric 5348*0b57cec5SDimitry Andric// set_union 5349*0b57cec5SDimitry Andric 5350*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 5351*0b57cec5SDimitry Andric_OutputIterator 5352*0b57cec5SDimitry Andric__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 5353*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 5354*0b57cec5SDimitry Andric{ 5355*0b57cec5SDimitry Andric for (; __first1 != __last1; ++__result) 5356*0b57cec5SDimitry Andric { 5357*0b57cec5SDimitry Andric if (__first2 == __last2) 5358*0b57cec5SDimitry Andric return _VSTD::copy(__first1, __last1, __result); 5359*0b57cec5SDimitry Andric if (__comp(*__first2, *__first1)) 5360*0b57cec5SDimitry Andric { 5361*0b57cec5SDimitry Andric *__result = *__first2; 5362*0b57cec5SDimitry Andric ++__first2; 5363*0b57cec5SDimitry Andric } 5364*0b57cec5SDimitry Andric else 5365*0b57cec5SDimitry Andric { 5366*0b57cec5SDimitry Andric if (!__comp(*__first1, *__first2)) 5367*0b57cec5SDimitry Andric ++__first2; 5368*0b57cec5SDimitry Andric *__result = *__first1; 5369*0b57cec5SDimitry Andric ++__first1; 5370*0b57cec5SDimitry Andric } 5371*0b57cec5SDimitry Andric } 5372*0b57cec5SDimitry Andric return _VSTD::copy(__first2, __last2, __result); 5373*0b57cec5SDimitry Andric} 5374*0b57cec5SDimitry Andric 5375*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 5376*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5377*0b57cec5SDimitry Andric_OutputIterator 5378*0b57cec5SDimitry Andricset_union(_InputIterator1 __first1, _InputIterator1 __last1, 5379*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 5380*0b57cec5SDimitry Andric{ 5381*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5382*0b57cec5SDimitry Andric return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5383*0b57cec5SDimitry Andric} 5384*0b57cec5SDimitry Andric 5385*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 5386*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5387*0b57cec5SDimitry Andric_OutputIterator 5388*0b57cec5SDimitry Andricset_union(_InputIterator1 __first1, _InputIterator1 __last1, 5389*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 5390*0b57cec5SDimitry Andric{ 5391*0b57cec5SDimitry Andric return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 5392*0b57cec5SDimitry Andric __less<typename iterator_traits<_InputIterator1>::value_type, 5393*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator2>::value_type>()); 5394*0b57cec5SDimitry Andric} 5395*0b57cec5SDimitry Andric 5396*0b57cec5SDimitry Andric// set_intersection 5397*0b57cec5SDimitry Andric 5398*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 5399*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 5400*0b57cec5SDimitry Andric__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 5401*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 5402*0b57cec5SDimitry Andric{ 5403*0b57cec5SDimitry Andric while (__first1 != __last1 && __first2 != __last2) 5404*0b57cec5SDimitry Andric { 5405*0b57cec5SDimitry Andric if (__comp(*__first1, *__first2)) 5406*0b57cec5SDimitry Andric ++__first1; 5407*0b57cec5SDimitry Andric else 5408*0b57cec5SDimitry Andric { 5409*0b57cec5SDimitry Andric if (!__comp(*__first2, *__first1)) 5410*0b57cec5SDimitry Andric { 5411*0b57cec5SDimitry Andric *__result = *__first1; 5412*0b57cec5SDimitry Andric ++__result; 5413*0b57cec5SDimitry Andric ++__first1; 5414*0b57cec5SDimitry Andric } 5415*0b57cec5SDimitry Andric ++__first2; 5416*0b57cec5SDimitry Andric } 5417*0b57cec5SDimitry Andric } 5418*0b57cec5SDimitry Andric return __result; 5419*0b57cec5SDimitry Andric} 5420*0b57cec5SDimitry Andric 5421*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 5422*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 5423*0b57cec5SDimitry Andric_OutputIterator 5424*0b57cec5SDimitry Andricset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 5425*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 5426*0b57cec5SDimitry Andric{ 5427*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5428*0b57cec5SDimitry Andric return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5429*0b57cec5SDimitry Andric} 5430*0b57cec5SDimitry Andric 5431*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 5432*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 5433*0b57cec5SDimitry Andric_OutputIterator 5434*0b57cec5SDimitry Andricset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 5435*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 5436*0b57cec5SDimitry Andric{ 5437*0b57cec5SDimitry Andric return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 5438*0b57cec5SDimitry Andric __less<typename iterator_traits<_InputIterator1>::value_type, 5439*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator2>::value_type>()); 5440*0b57cec5SDimitry Andric} 5441*0b57cec5SDimitry Andric 5442*0b57cec5SDimitry Andric// set_difference 5443*0b57cec5SDimitry Andric 5444*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 5445*0b57cec5SDimitry Andric_OutputIterator 5446*0b57cec5SDimitry Andric__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 5447*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 5448*0b57cec5SDimitry Andric{ 5449*0b57cec5SDimitry Andric while (__first1 != __last1) 5450*0b57cec5SDimitry Andric { 5451*0b57cec5SDimitry Andric if (__first2 == __last2) 5452*0b57cec5SDimitry Andric return _VSTD::copy(__first1, __last1, __result); 5453*0b57cec5SDimitry Andric if (__comp(*__first1, *__first2)) 5454*0b57cec5SDimitry Andric { 5455*0b57cec5SDimitry Andric *__result = *__first1; 5456*0b57cec5SDimitry Andric ++__result; 5457*0b57cec5SDimitry Andric ++__first1; 5458*0b57cec5SDimitry Andric } 5459*0b57cec5SDimitry Andric else 5460*0b57cec5SDimitry Andric { 5461*0b57cec5SDimitry Andric if (!__comp(*__first2, *__first1)) 5462*0b57cec5SDimitry Andric ++__first1; 5463*0b57cec5SDimitry Andric ++__first2; 5464*0b57cec5SDimitry Andric } 5465*0b57cec5SDimitry Andric } 5466*0b57cec5SDimitry Andric return __result; 5467*0b57cec5SDimitry Andric} 5468*0b57cec5SDimitry Andric 5469*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 5470*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5471*0b57cec5SDimitry Andric_OutputIterator 5472*0b57cec5SDimitry Andricset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 5473*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 5474*0b57cec5SDimitry Andric{ 5475*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5476*0b57cec5SDimitry Andric return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5477*0b57cec5SDimitry Andric} 5478*0b57cec5SDimitry Andric 5479*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 5480*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5481*0b57cec5SDimitry Andric_OutputIterator 5482*0b57cec5SDimitry Andricset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 5483*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 5484*0b57cec5SDimitry Andric{ 5485*0b57cec5SDimitry Andric return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 5486*0b57cec5SDimitry Andric __less<typename iterator_traits<_InputIterator1>::value_type, 5487*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator2>::value_type>()); 5488*0b57cec5SDimitry Andric} 5489*0b57cec5SDimitry Andric 5490*0b57cec5SDimitry Andric// set_symmetric_difference 5491*0b57cec5SDimitry Andric 5492*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 5493*0b57cec5SDimitry Andric_OutputIterator 5494*0b57cec5SDimitry Andric__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 5495*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 5496*0b57cec5SDimitry Andric{ 5497*0b57cec5SDimitry Andric while (__first1 != __last1) 5498*0b57cec5SDimitry Andric { 5499*0b57cec5SDimitry Andric if (__first2 == __last2) 5500*0b57cec5SDimitry Andric return _VSTD::copy(__first1, __last1, __result); 5501*0b57cec5SDimitry Andric if (__comp(*__first1, *__first2)) 5502*0b57cec5SDimitry Andric { 5503*0b57cec5SDimitry Andric *__result = *__first1; 5504*0b57cec5SDimitry Andric ++__result; 5505*0b57cec5SDimitry Andric ++__first1; 5506*0b57cec5SDimitry Andric } 5507*0b57cec5SDimitry Andric else 5508*0b57cec5SDimitry Andric { 5509*0b57cec5SDimitry Andric if (__comp(*__first2, *__first1)) 5510*0b57cec5SDimitry Andric { 5511*0b57cec5SDimitry Andric *__result = *__first2; 5512*0b57cec5SDimitry Andric ++__result; 5513*0b57cec5SDimitry Andric } 5514*0b57cec5SDimitry Andric else 5515*0b57cec5SDimitry Andric ++__first1; 5516*0b57cec5SDimitry Andric ++__first2; 5517*0b57cec5SDimitry Andric } 5518*0b57cec5SDimitry Andric } 5519*0b57cec5SDimitry Andric return _VSTD::copy(__first2, __last2, __result); 5520*0b57cec5SDimitry Andric} 5521*0b57cec5SDimitry Andric 5522*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 5523*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5524*0b57cec5SDimitry Andric_OutputIterator 5525*0b57cec5SDimitry Andricset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 5526*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 5527*0b57cec5SDimitry Andric{ 5528*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5529*0b57cec5SDimitry Andric return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5530*0b57cec5SDimitry Andric} 5531*0b57cec5SDimitry Andric 5532*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 5533*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5534*0b57cec5SDimitry Andric_OutputIterator 5535*0b57cec5SDimitry Andricset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 5536*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 5537*0b57cec5SDimitry Andric{ 5538*0b57cec5SDimitry Andric return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 5539*0b57cec5SDimitry Andric __less<typename iterator_traits<_InputIterator1>::value_type, 5540*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator2>::value_type>()); 5541*0b57cec5SDimitry Andric} 5542*0b57cec5SDimitry Andric 5543*0b57cec5SDimitry Andric// lexicographical_compare 5544*0b57cec5SDimitry Andric 5545*0b57cec5SDimitry Andrictemplate <class _Compare, class _InputIterator1, class _InputIterator2> 5546*0b57cec5SDimitry Andric_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 5547*0b57cec5SDimitry Andric__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 5548*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 5549*0b57cec5SDimitry Andric{ 5550*0b57cec5SDimitry Andric for (; __first2 != __last2; ++__first1, (void) ++__first2) 5551*0b57cec5SDimitry Andric { 5552*0b57cec5SDimitry Andric if (__first1 == __last1 || __comp(*__first1, *__first2)) 5553*0b57cec5SDimitry Andric return true; 5554*0b57cec5SDimitry Andric if (__comp(*__first2, *__first1)) 5555*0b57cec5SDimitry Andric return false; 5556*0b57cec5SDimitry Andric } 5557*0b57cec5SDimitry Andric return false; 5558*0b57cec5SDimitry Andric} 5559*0b57cec5SDimitry Andric 5560*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2, class _Compare> 5561*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 5562*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 5563*0b57cec5SDimitry Andricbool 5564*0b57cec5SDimitry Andriclexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 5565*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 5566*0b57cec5SDimitry Andric{ 5567*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5568*0b57cec5SDimitry Andric return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5569*0b57cec5SDimitry Andric} 5570*0b57cec5SDimitry Andric 5571*0b57cec5SDimitry Andrictemplate <class _InputIterator1, class _InputIterator2> 5572*0b57cec5SDimitry Andric_LIBCPP_NODISCARD_EXT inline 5573*0b57cec5SDimitry Andric_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 5574*0b57cec5SDimitry Andricbool 5575*0b57cec5SDimitry Andriclexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 5576*0b57cec5SDimitry Andric _InputIterator2 __first2, _InputIterator2 __last2) 5577*0b57cec5SDimitry Andric{ 5578*0b57cec5SDimitry Andric return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 5579*0b57cec5SDimitry Andric __less<typename iterator_traits<_InputIterator1>::value_type, 5580*0b57cec5SDimitry Andric typename iterator_traits<_InputIterator2>::value_type>()); 5581*0b57cec5SDimitry Andric} 5582*0b57cec5SDimitry Andric 5583*0b57cec5SDimitry Andric// next_permutation 5584*0b57cec5SDimitry Andric 5585*0b57cec5SDimitry Andrictemplate <class _Compare, class _BidirectionalIterator> 5586*0b57cec5SDimitry Andricbool 5587*0b57cec5SDimitry Andric__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 5588*0b57cec5SDimitry Andric{ 5589*0b57cec5SDimitry Andric _BidirectionalIterator __i = __last; 5590*0b57cec5SDimitry Andric if (__first == __last || __first == --__i) 5591*0b57cec5SDimitry Andric return false; 5592*0b57cec5SDimitry Andric while (true) 5593*0b57cec5SDimitry Andric { 5594*0b57cec5SDimitry Andric _BidirectionalIterator __ip1 = __i; 5595*0b57cec5SDimitry Andric if (__comp(*--__i, *__ip1)) 5596*0b57cec5SDimitry Andric { 5597*0b57cec5SDimitry Andric _BidirectionalIterator __j = __last; 5598*0b57cec5SDimitry Andric while (!__comp(*__i, *--__j)) 5599*0b57cec5SDimitry Andric ; 5600*0b57cec5SDimitry Andric swap(*__i, *__j); 5601*0b57cec5SDimitry Andric _VSTD::reverse(__ip1, __last); 5602*0b57cec5SDimitry Andric return true; 5603*0b57cec5SDimitry Andric } 5604*0b57cec5SDimitry Andric if (__i == __first) 5605*0b57cec5SDimitry Andric { 5606*0b57cec5SDimitry Andric _VSTD::reverse(__first, __last); 5607*0b57cec5SDimitry Andric return false; 5608*0b57cec5SDimitry Andric } 5609*0b57cec5SDimitry Andric } 5610*0b57cec5SDimitry Andric} 5611*0b57cec5SDimitry Andric 5612*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator, class _Compare> 5613*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5614*0b57cec5SDimitry Andricbool 5615*0b57cec5SDimitry Andricnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 5616*0b57cec5SDimitry Andric{ 5617*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5618*0b57cec5SDimitry Andric return __next_permutation<_Comp_ref>(__first, __last, __comp); 5619*0b57cec5SDimitry Andric} 5620*0b57cec5SDimitry Andric 5621*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator> 5622*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5623*0b57cec5SDimitry Andricbool 5624*0b57cec5SDimitry Andricnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 5625*0b57cec5SDimitry Andric{ 5626*0b57cec5SDimitry Andric return _VSTD::next_permutation(__first, __last, 5627*0b57cec5SDimitry Andric __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 5628*0b57cec5SDimitry Andric} 5629*0b57cec5SDimitry Andric 5630*0b57cec5SDimitry Andric// prev_permutation 5631*0b57cec5SDimitry Andric 5632*0b57cec5SDimitry Andrictemplate <class _Compare, class _BidirectionalIterator> 5633*0b57cec5SDimitry Andricbool 5634*0b57cec5SDimitry Andric__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 5635*0b57cec5SDimitry Andric{ 5636*0b57cec5SDimitry Andric _BidirectionalIterator __i = __last; 5637*0b57cec5SDimitry Andric if (__first == __last || __first == --__i) 5638*0b57cec5SDimitry Andric return false; 5639*0b57cec5SDimitry Andric while (true) 5640*0b57cec5SDimitry Andric { 5641*0b57cec5SDimitry Andric _BidirectionalIterator __ip1 = __i; 5642*0b57cec5SDimitry Andric if (__comp(*__ip1, *--__i)) 5643*0b57cec5SDimitry Andric { 5644*0b57cec5SDimitry Andric _BidirectionalIterator __j = __last; 5645*0b57cec5SDimitry Andric while (!__comp(*--__j, *__i)) 5646*0b57cec5SDimitry Andric ; 5647*0b57cec5SDimitry Andric swap(*__i, *__j); 5648*0b57cec5SDimitry Andric _VSTD::reverse(__ip1, __last); 5649*0b57cec5SDimitry Andric return true; 5650*0b57cec5SDimitry Andric } 5651*0b57cec5SDimitry Andric if (__i == __first) 5652*0b57cec5SDimitry Andric { 5653*0b57cec5SDimitry Andric _VSTD::reverse(__first, __last); 5654*0b57cec5SDimitry Andric return false; 5655*0b57cec5SDimitry Andric } 5656*0b57cec5SDimitry Andric } 5657*0b57cec5SDimitry Andric} 5658*0b57cec5SDimitry Andric 5659*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator, class _Compare> 5660*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5661*0b57cec5SDimitry Andricbool 5662*0b57cec5SDimitry Andricprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 5663*0b57cec5SDimitry Andric{ 5664*0b57cec5SDimitry Andric typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5665*0b57cec5SDimitry Andric return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5666*0b57cec5SDimitry Andric} 5667*0b57cec5SDimitry Andric 5668*0b57cec5SDimitry Andrictemplate <class _BidirectionalIterator> 5669*0b57cec5SDimitry Andricinline _LIBCPP_INLINE_VISIBILITY 5670*0b57cec5SDimitry Andricbool 5671*0b57cec5SDimitry Andricprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 5672*0b57cec5SDimitry Andric{ 5673*0b57cec5SDimitry Andric return _VSTD::prev_permutation(__first, __last, 5674*0b57cec5SDimitry Andric __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 5675*0b57cec5SDimitry Andric} 5676*0b57cec5SDimitry Andric 5677*0b57cec5SDimitry Andric_LIBCPP_END_NAMESPACE_STD 5678*0b57cec5SDimitry Andric 5679*0b57cec5SDimitry Andric_LIBCPP_POP_MACROS 5680*0b57cec5SDimitry Andric 5681*0b57cec5SDimitry Andric#endif // _LIBCPP_ALGORITHM 5682