65 #if __cplusplus >= 201103L
71 namespace std _GLIBCXX_VISIBILITY(default)
73 _GLIBCXX_BEGIN_NAMESPACE_VERSION
76 template<
typename _Iterator,
typename _Compare>
79 _Iterator __c, _Compare __comp)
85 else if (__comp(__a, __c))
90 else if (__comp(__a, __c))
92 else if (__comp(__b, __c))
99 template<
typename _InputIterator,
typename _Predicate>
100 inline _InputIterator
101 __find_if(_InputIterator __first, _InputIterator __last,
104 while (__first != __last && !__pred(__first))
110 template<
typename _RandomAccessIterator,
typename _Predicate>
111 _RandomAccessIterator
112 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
115 typename iterator_traits<_RandomAccessIterator>::difference_type
116 __trip_count = (__last - __first) >> 2;
118 for (; __trip_count > 0; --__trip_count)
137 switch (__last - __first)
157 template<
typename _Iterator,
typename _Predicate>
159 __find_if(_Iterator __first, _Iterator __last, _Predicate __pred)
161 return __find_if(__first, __last, __pred,
166 template<
typename _InputIterator,
typename _Predicate>
167 inline _InputIterator
172 __gnu_cxx::__ops::__negate(__pred),
179 template<
typename _InputIterator,
typename _Predicate,
typename _Distance>
183 for (; __len; --__len, (void) ++__first)
184 if (!__pred(__first))
202 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
203 typename _BinaryPredicate>
205 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
206 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
207 _BinaryPredicate __predicate)
210 if (__first1 == __last1 || __first2 == __last2)
214 _ForwardIterator2 __p1(__first2);
215 if (++__p1 == __last2)
217 __gnu_cxx::__ops::__iter_comp_iter(__predicate, __first2));
220 _ForwardIterator2 __p;
221 _ForwardIterator1 __current = __first1;
227 __gnu_cxx::__ops::__iter_comp_iter(__predicate, __first2));
229 if (__first1 == __last1)
233 __current = __first1;
234 if (++__current == __last1)
237 while (__predicate(__current, __p))
239 if (++__p == __last2)
241 if (++__current == __last1)
254 template<
typename _ForwardIterator,
typename _Integer,
255 typename _UnaryPredicate>
258 _Integer __count, _UnaryPredicate __unary_pred,
262 while (__first != __last)
264 typename iterator_traits<_ForwardIterator>::difference_type
266 _ForwardIterator __i = __first;
268 while (__i != __last && __n != 1 && __unary_pred(__i))
286 template<
typename _RandomAccessIter,
typename _Integer,
287 typename _UnaryPredicate>
290 _Integer __count, _UnaryPredicate __unary_pred,
293 typedef typename std::iterator_traits<_RandomAccessIter>::difference_type
296 _DistanceType __tailSize = __last - __first;
297 _DistanceType __remainder = __count;
299 while (__remainder <= __tailSize)
301 __first += __remainder;
302 __tailSize -= __remainder;
305 _RandomAccessIter __backTrack = __first;
306 while (__unary_pred(--__backTrack))
308 if (--__remainder == 0)
309 return (__first - __count);
311 __remainder = __count + 1 - (__first - __backTrack);
316 template<
typename _ForwardIterator,
typename _Integer,
317 typename _UnaryPredicate>
319 __search_n(_ForwardIterator __first, _ForwardIterator __last,
321 _UnaryPredicate __unary_pred)
334 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
335 typename _BinaryPredicate>
337 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
338 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
339 forward_iterator_tag, forward_iterator_tag,
340 _BinaryPredicate __comp)
342 if (__first2 == __last2)
345 _ForwardIterator1 __result = __last1;
348 _ForwardIterator1 __new_result
349 = std::__search(__first1, __last1, __first2, __last2, __comp);
350 if (__new_result == __last1)
354 __result = __new_result;
355 __first1 = __new_result;
362 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
363 typename _BinaryPredicate>
364 _BidirectionalIterator1
365 __find_end(_BidirectionalIterator1 __first1,
366 _BidirectionalIterator1 __last1,
367 _BidirectionalIterator2 __first2,
368 _BidirectionalIterator2 __last2,
369 bidirectional_iterator_tag, bidirectional_iterator_tag,
370 _BinaryPredicate __comp)
373 __glibcxx_function_requires(_BidirectionalIteratorConcept<
374 _BidirectionalIterator1>)
375 __glibcxx_function_requires(_BidirectionalIteratorConcept<
376 _BidirectionalIterator2>)
378 typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1;
379 typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2;
381 _RevIterator1 __rlast1(__first1);
382 _RevIterator2 __rlast2(__first2);
383 _RevIterator1 __rresult =
std::__search(_RevIterator1(__last1), __rlast1,
384 _RevIterator2(__last2), __rlast2,
387 if (__rresult == __rlast1)
391 _BidirectionalIterator1 __result = __rresult.base();
423 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
424 inline _ForwardIterator1
425 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
426 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
429 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
430 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
431 __glibcxx_function_requires(_EqualOpConcept<
432 typename iterator_traits<_ForwardIterator1>::value_type,
433 typename iterator_traits<_ForwardIterator2>::value_type>)
434 __glibcxx_requires_valid_range(__first1, __last1);
435 __glibcxx_requires_valid_range(__first2, __last2);
437 return std::__find_end(__first1, __last1, __first2, __last2,
440 __gnu_cxx::__ops::__iter_equal_to_iter());
471 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
472 typename _BinaryPredicate>
473 inline _ForwardIterator1
474 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
475 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
476 _BinaryPredicate __comp)
479 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
480 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
481 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
482 typename iterator_traits<_ForwardIterator1>::value_type,
483 typename iterator_traits<_ForwardIterator2>::value_type>)
484 __glibcxx_requires_valid_range(__first1, __last1);
485 __glibcxx_requires_valid_range(__first2, __last2);
487 return std::__find_end(__first1, __last1, __first2, __last2,
490 __gnu_cxx::__ops::__iter_comp_iter(__comp));
493 #if __cplusplus >= 201103L
506 template<
typename _InputIterator,
typename _Predicate>
508 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
523 template<
typename _InputIterator,
typename _Predicate>
525 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
541 template<
typename _InputIterator,
typename _Predicate>
543 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
556 template<
typename _InputIterator,
typename _Predicate>
557 inline _InputIterator
558 find_if_not(_InputIterator __first, _InputIterator __last,
562 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
563 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
564 typename iterator_traits<_InputIterator>::value_type>)
565 __glibcxx_requires_valid_range(__first, __last);
567 __gnu_cxx::__ops::__pred_iter(__pred));
580 template<
typename _InputIterator,
typename _Predicate>
582 is_partitioned(_InputIterator __first, _InputIterator __last,
586 if (__first == __last)
601 template<
typename _ForwardIterator,
typename _Predicate>
603 partition_point(_ForwardIterator __first, _ForwardIterator __last,
607 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
608 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
609 typename iterator_traits<_ForwardIterator>::value_type>)
612 __glibcxx_requires_valid_range(__first, __last);
614 typedef typename iterator_traits<_ForwardIterator>::difference_type
618 _DistanceType __half;
619 _ForwardIterator __middle;
626 if (__pred(*__middle))
630 __len = __len - __half - 1;
639 template<
typename _InputIterator,
typename _OutputIterator,
642 __remove_copy_if(_InputIterator __first, _InputIterator __last,
643 _OutputIterator __result, _Predicate __pred)
645 for (; __first != __last; ++__first)
646 if (!__pred(__first))
648 *__result = *__first;
668 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
669 inline _OutputIterator
670 remove_copy(_InputIterator __first, _InputIterator __last,
671 _OutputIterator __result,
const _Tp& __value)
674 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
675 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
676 typename iterator_traits<_InputIterator>::value_type>)
677 __glibcxx_function_requires(_EqualOpConcept<
678 typename iterator_traits<_InputIterator>::value_type, _Tp>)
679 __glibcxx_requires_valid_range(__first, __last);
681 return std::__remove_copy_if(__first, __last, __result,
682 __gnu_cxx::__ops::__iter_equals_val(__value));
700 template<
typename _InputIterator,
typename _OutputIterator,
702 inline _OutputIterator
703 remove_copy_if(_InputIterator __first, _InputIterator __last,
704 _OutputIterator __result, _Predicate __pred)
707 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
708 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
709 typename iterator_traits<_InputIterator>::value_type>)
710 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
711 typename iterator_traits<_InputIterator>::value_type>)
712 __glibcxx_requires_valid_range(__first, __last);
714 return std::__remove_copy_if(__first, __last, __result,
715 __gnu_cxx::__ops::__pred_iter(__pred));
718 #if __cplusplus >= 201103L
734 template<
typename _InputIterator,
typename _OutputIterator,
737 copy_if(_InputIterator __first, _InputIterator __last,
738 _OutputIterator __result, _Predicate __pred)
741 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
742 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
743 typename iterator_traits<_InputIterator>::value_type>)
744 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
745 typename iterator_traits<_InputIterator>::value_type>)
746 __glibcxx_requires_valid_range(__first, __last);
748 for (; __first != __last; ++__first)
749 if (__pred(*__first))
751 *__result = *__first;
757 template<
typename _InputIterator,
typename _Size,
typename _OutputIterator>
759 __copy_n(_InputIterator __first, _Size __n,
760 _OutputIterator __result, input_iterator_tag)
766 *__result = *__first;
777 template<
typename _RandomAccessIterator,
typename _Size,
778 typename _OutputIterator>
779 inline _OutputIterator
780 __copy_n(_RandomAccessIterator __first, _Size __n,
781 _OutputIterator __result, random_access_iterator_tag)
782 {
return std::copy(__first, __first + __n, __result); }
797 template<
typename _InputIterator,
typename _Size,
typename _OutputIterator>
798 inline _OutputIterator
799 copy_n(_InputIterator __first, _Size __n, _OutputIterator __result)
802 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
803 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
804 typename iterator_traits<_InputIterator>::value_type>)
806 return std::__copy_n(__first, __n, __result,
825 template<
typename _InputIterator,
typename _OutputIterator1,
826 typename _OutputIterator2,
typename _Predicate>
827 pair<_OutputIterator1, _OutputIterator2>
828 partition_copy(_InputIterator __first, _InputIterator __last,
829 _OutputIterator1 __out_true, _OutputIterator2 __out_false,
833 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
834 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator1,
835 typename iterator_traits<_InputIterator>::value_type>)
836 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator2,
837 typename iterator_traits<_InputIterator>::value_type>)
838 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
839 typename iterator_traits<_InputIterator>::value_type>)
840 __glibcxx_requires_valid_range(__first, __last);
842 for (; __first != __last; ++__first)
843 if (__pred(*__first))
845 *__out_true = *__first;
850 *__out_false = *__first;
858 template<
typename _ForwardIterator,
typename _Predicate>
860 __remove_if(_ForwardIterator __first, _ForwardIterator __last,
864 if (__first == __last)
866 _ForwardIterator __result = __first;
868 for (; __first != __last; ++__first)
869 if (!__pred(__first))
871 *__result = _GLIBCXX_MOVE(*__first);
894 template<
typename _ForwardIterator,
typename _Tp>
895 inline _ForwardIterator
896 remove(_ForwardIterator __first, _ForwardIterator __last,
900 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
902 __glibcxx_function_requires(_EqualOpConcept<
903 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
904 __glibcxx_requires_valid_range(__first, __last);
906 return std::__remove_if(__first, __last,
907 __gnu_cxx::__ops::__iter_equals_val(__value));
927 template<
typename _ForwardIterator,
typename _Predicate>
928 inline _ForwardIterator
929 remove_if(_ForwardIterator __first, _ForwardIterator __last,
933 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
935 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
936 typename iterator_traits<_ForwardIterator>::value_type>)
937 __glibcxx_requires_valid_range(__first, __last);
939 return std::__remove_if(__first, __last,
940 __gnu_cxx::__ops::__pred_iter(__pred));
943 template<
typename _ForwardIterator,
typename _BinaryPredicate>
945 __adjacent_find(_ForwardIterator __first, _ForwardIterator __last,
946 _BinaryPredicate __binary_pred)
948 if (__first == __last)
950 _ForwardIterator __next = __first;
951 while (++__next != __last)
953 if (__binary_pred(__first, __next))
960 template<
typename _ForwardIterator,
typename _BinaryPredicate>
962 __unique(_ForwardIterator __first, _ForwardIterator __last,
963 _BinaryPredicate __binary_pred)
966 __first = std::__adjacent_find(__first, __last, __binary_pred);
967 if (__first == __last)
971 _ForwardIterator __dest = __first;
973 while (++__first != __last)
974 if (!__binary_pred(__dest, __first))
975 *++__dest = _GLIBCXX_MOVE(*__first);
993 template<
typename _ForwardIterator>
994 inline _ForwardIterator
995 unique(_ForwardIterator __first, _ForwardIterator __last)
998 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1000 __glibcxx_function_requires(_EqualityComparableConcept<
1001 typename iterator_traits<_ForwardIterator>::value_type>)
1002 __glibcxx_requires_valid_range(__first, __last);
1004 return std::__unique(__first, __last,
1005 __gnu_cxx::__ops::__iter_equal_to_iter());
1023 template<
typename _ForwardIterator,
typename _BinaryPredicate>
1024 inline _ForwardIterator
1025 unique(_ForwardIterator __first, _ForwardIterator __last,
1026 _BinaryPredicate __binary_pred)
1029 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1031 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1032 typename iterator_traits<_ForwardIterator>::value_type,
1033 typename iterator_traits<_ForwardIterator>::value_type>)
1034 __glibcxx_requires_valid_range(__first, __last);
1036 return std::__unique(__first, __last,
1037 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred));
1046 template<
typename _ForwardIterator,
typename _OutputIterator,
1047 typename _BinaryPredicate>
1050 _OutputIterator __result, _BinaryPredicate __binary_pred,
1054 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1055 typename iterator_traits<_ForwardIterator>::value_type,
1056 typename iterator_traits<_ForwardIterator>::value_type>)
1058 _ForwardIterator __next = __first;
1059 *__result = *__first;
1060 while (++__next != __last)
1061 if (!__binary_pred(__first, __next))
1064 *++__result = *__first;
1075 template<
typename _InputIterator,
typename _OutputIterator,
1076 typename _BinaryPredicate>
1079 _OutputIterator __result, _BinaryPredicate __binary_pred,
1083 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1084 typename iterator_traits<_InputIterator>::value_type,
1085 typename iterator_traits<_InputIterator>::value_type>)
1087 typename iterator_traits<_InputIterator>::value_type __value = *__first;
1088 __decltype(__gnu_cxx::__ops::__iter_comp_val(__binary_pred))
1090 = __gnu_cxx::__ops::__iter_comp_val(__binary_pred);
1091 *__result = __value;
1092 while (++__first != __last)
1093 if (!__rebound_pred(__first, __value))
1096 *++__result = __value;
1107 template<
typename _InputIterator,
typename _ForwardIterator,
1108 typename _BinaryPredicate>
1111 _ForwardIterator __result, _BinaryPredicate __binary_pred,
1115 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1116 typename iterator_traits<_ForwardIterator>::value_type,
1117 typename iterator_traits<_InputIterator>::value_type>)
1118 *__result = *__first;
1119 while (++__first != __last)
1120 if (!__binary_pred(__result, __first))
1121 *++__result = *__first;
1130 template<
typename _B
idirectionalIterator>
1132 __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last,
1136 if (__first == __last || __first == --__last)
1150 template<
typename _RandomAccessIterator>
1152 __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last,
1155 if (__first == __last)
1158 while (__first < __last)
1178 template<
typename _B
idirectionalIterator>
1180 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
1183 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
1184 _BidirectionalIterator>)
1185 __glibcxx_requires_valid_range(__first, __last);
1205 template<
typename _B
idirectionalIterator,
typename _OutputIterator>
1207 reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last,
1208 _OutputIterator __result)
1211 __glibcxx_function_requires(_BidirectionalIteratorConcept<
1212 _BidirectionalIterator>)
1213 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
1214 typename iterator_traits<_BidirectionalIterator>::value_type>)
1215 __glibcxx_requires_valid_range(__first, __last);
1217 while (__first != __last)
1220 *__result = *__last;
1230 template<
typename _Eucl
ideanRingElement>
1231 _EuclideanRingElement
1232 __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
1236 _EuclideanRingElement __t = __m % __n;
1243 inline namespace _V2
1247 template<
typename _ForwardIterator>
1250 _ForwardIterator __middle,
1251 _ForwardIterator __last,
1254 if (__first == __middle)
1256 else if (__last == __middle)
1259 _ForwardIterator __first2 = __middle;
1265 if (__first == __middle)
1266 __middle = __first2;
1268 while (__first2 != __last);
1270 _ForwardIterator __ret = __first;
1272 __first2 = __middle;
1274 while (__first2 != __last)
1279 if (__first == __middle)
1280 __middle = __first2;
1281 else if (__first2 == __last)
1282 __first2 = __middle;
1288 template<
typename _B
idirectionalIterator>
1289 _BidirectionalIterator
1291 _BidirectionalIterator __middle,
1292 _BidirectionalIterator __last,
1296 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
1297 _BidirectionalIterator>)
1299 if (__first == __middle)
1301 else if (__last == __middle)
1307 while (__first != __middle && __middle != __last)
1313 if (__first == __middle)
1326 template<
typename _RandomAccessIterator>
1327 _RandomAccessIterator
1329 _RandomAccessIterator __middle,
1330 _RandomAccessIterator __last,
1334 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
1335 _RandomAccessIterator>)
1337 if (__first == __middle)
1339 else if (__last == __middle)
1342 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
1344 typedef typename iterator_traits<_RandomAccessIterator>::value_type
1347 _Distance __n = __last - __first;
1348 _Distance __k = __middle - __first;
1350 if (__k == __n - __k)
1356 _RandomAccessIterator __p = __first;
1357 _RandomAccessIterator __ret = __first + (__last - __middle);
1361 if (__k < __n - __k)
1363 if (__is_pod(_ValueType) && __k == 1)
1365 _ValueType __t = _GLIBCXX_MOVE(*__p);
1366 _GLIBCXX_MOVE3(__p + 1, __p + __n, __p);
1367 *(__p + __n - 1) = _GLIBCXX_MOVE(__t);
1370 _RandomAccessIterator __q = __p + __k;
1371 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1380 std::swap(__n, __k);
1386 if (__is_pod(_ValueType) && __k == 1)
1388 _ValueType __t = _GLIBCXX_MOVE(*(__p + __n - 1));
1389 _GLIBCXX_MOVE_BACKWARD3(__p, __p + __n - 1, __p + __n);
1390 *__p = _GLIBCXX_MOVE(__t);
1393 _RandomAccessIterator __q = __p + __n;
1395 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1404 std::swap(__n, __k);
1432 template<
typename _ForwardIterator>
1433 inline _ForwardIterator
1434 rotate(_ForwardIterator __first, _ForwardIterator __middle,
1435 _ForwardIterator __last)
1438 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1440 __glibcxx_requires_valid_range(__first, __middle);
1441 __glibcxx_requires_valid_range(__middle, __last);
1469 template<
typename _ForwardIterator,
typename _OutputIterator>
1470 inline _OutputIterator
1471 rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,
1472 _ForwardIterator __last, _OutputIterator __result)
1475 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
1476 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
1477 typename iterator_traits<_ForwardIterator>::value_type>)
1478 __glibcxx_requires_valid_range(__first, __middle);
1479 __glibcxx_requires_valid_range(__middle, __last);
1481 return std::copy(__first, __middle,
1482 std::copy(__middle, __last, __result));
1486 template<
typename _ForwardIterator,
typename _Predicate>
1491 if (__first == __last)
1494 while (__pred(*__first))
1495 if (++__first == __last)
1498 _ForwardIterator __next = __first;
1500 while (++__next != __last)
1501 if (__pred(*__next))
1511 template<
typename _B
idirectionalIterator,
typename _Predicate>
1512 _BidirectionalIterator
1513 __partition(_BidirectionalIterator __first, _BidirectionalIterator __last,
1519 if (__first == __last)
1521 else if (__pred(*__first))
1527 if (__first == __last)
1529 else if (!
bool(__pred(*__last)))
1546 template<
typename _ForwardIterator,
typename _Pointer,
typename _Predicate,
1550 _ForwardIterator __last,
1551 _Predicate __pred, _Distance __len,
1553 _Distance __buffer_size)
1558 if (__len <= __buffer_size)
1560 _ForwardIterator __result1 = __first;
1561 _Pointer __result2 = __buffer;
1566 *__result2 = _GLIBCXX_MOVE(*__first);
1569 for (; __first != __last; ++__first)
1570 if (__pred(__first))
1572 *__result1 = _GLIBCXX_MOVE(*__first);
1577 *__result2 = _GLIBCXX_MOVE(*__first);
1581 _GLIBCXX_MOVE3(__buffer, __result2, __result1);
1585 _ForwardIterator __middle = __first;
1587 _ForwardIterator __left_split =
1589 __len / 2, __buffer,
1594 _Distance __right_len = __len - __len / 2;
1595 _ForwardIterator __right_split =
1602 __buffer, __buffer_size);
1604 return std::rotate(__left_split, __middle, __right_split);
1607 template<
typename _ForwardIterator,
typename _Predicate>
1609 __stable_partition(_ForwardIterator __first, _ForwardIterator __last,
1614 if (__first == __last)
1617 typedef typename iterator_traits<_ForwardIterator>::value_type
1619 typedef typename iterator_traits<_ForwardIterator>::difference_type
1622 _Temporary_buffer<_ForwardIterator, _ValueType>
1626 _DistanceType(__buf.requested_size()),
1628 _DistanceType(__buf.size()));
1648 template<
typename _ForwardIterator,
typename _Predicate>
1649 inline _ForwardIterator
1650 stable_partition(_ForwardIterator __first, _ForwardIterator __last,
1654 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1656 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
1657 typename iterator_traits<_ForwardIterator>::value_type>)
1658 __glibcxx_requires_valid_range(__first, __last);
1660 return std::__stable_partition(__first, __last,
1661 __gnu_cxx::__ops::__pred_iter(__pred));
1665 template<
typename _RandomAccessIterator,
typename _Compare>
1668 _RandomAccessIterator __middle,
1669 _RandomAccessIterator __last, _Compare __comp)
1671 std::__make_heap(__first, __middle, __comp);
1672 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
1673 if (__comp(__i, __first))
1674 std::__pop_heap(__first, __middle, __i, __comp);
1679 template<
typename _InputIterator,
typename _RandomAccessIterator,
1681 _RandomAccessIterator
1682 __partial_sort_copy(_InputIterator __first, _InputIterator __last,
1683 _RandomAccessIterator __result_first,
1684 _RandomAccessIterator __result_last,
1687 typedef typename iterator_traits<_InputIterator>::value_type
1689 typedef iterator_traits<_RandomAccessIterator> _RItTraits;
1690 typedef typename _RItTraits::difference_type _DistanceType;
1692 if (__result_first == __result_last)
1693 return __result_last;
1694 _RandomAccessIterator __result_real_last = __result_first;
1695 while (__first != __last && __result_real_last != __result_last)
1697 *__result_real_last = *__first;
1698 ++__result_real_last;
1702 std::__make_heap(__result_first, __result_real_last, __comp);
1703 while (__first != __last)
1705 if (__comp(__first, __result_first))
1706 std::__adjust_heap(__result_first, _DistanceType(0),
1707 _DistanceType(__result_real_last
1709 _InputValueType(*__first), __comp);
1712 std::__sort_heap(__result_first, __result_real_last, __comp);
1713 return __result_real_last;
1734 template<
typename _InputIterator,
typename _RandomAccessIterator>
1735 inline _RandomAccessIterator
1736 partial_sort_copy(_InputIterator __first, _InputIterator __last,
1737 _RandomAccessIterator __result_first,
1738 _RandomAccessIterator __result_last)
1740 #ifdef _GLIBCXX_CONCEPT_CHECKS
1741 typedef typename iterator_traits<_InputIterator>::value_type
1743 typedef typename iterator_traits<_RandomAccessIterator>::value_type
1748 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
1749 __glibcxx_function_requires(_ConvertibleConcept<_InputValueType,
1751 __glibcxx_function_requires(_LessThanOpConcept<_InputValueType,
1753 __glibcxx_function_requires(_LessThanComparableConcept<_OutputValueType>)
1754 __glibcxx_requires_valid_range(__first, __last);
1755 __glibcxx_requires_irreflexive(__first, __last);
1756 __glibcxx_requires_valid_range(__result_first, __result_last);
1758 return std::__partial_sort_copy(__first, __last,
1759 __result_first, __result_last,
1760 __gnu_cxx::__ops::__iter_less_iter());
1783 template<
typename _InputIterator,
typename _RandomAccessIterator,
1785 inline _RandomAccessIterator
1786 partial_sort_copy(_InputIterator __first, _InputIterator __last,
1787 _RandomAccessIterator __result_first,
1788 _RandomAccessIterator __result_last,
1791 #ifdef _GLIBCXX_CONCEPT_CHECKS
1792 typedef typename iterator_traits<_InputIterator>::value_type
1794 typedef typename iterator_traits<_RandomAccessIterator>::value_type
1799 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
1800 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
1801 _RandomAccessIterator>)
1802 __glibcxx_function_requires(_ConvertibleConcept<_InputValueType,
1804 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1805 _InputValueType, _OutputValueType>)
1806 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1807 _OutputValueType, _OutputValueType>)
1808 __glibcxx_requires_valid_range(__first, __last);
1809 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
1810 __glibcxx_requires_valid_range(__result_first, __result_last);
1812 return std::__partial_sort_copy(__first, __last,
1813 __result_first, __result_last,
1814 __gnu_cxx::__ops::__iter_comp_iter(__comp));
1818 template<
typename _RandomAccessIterator,
typename _Compare>
1823 typename iterator_traits<_RandomAccessIterator>::value_type
1824 __val = _GLIBCXX_MOVE(*__last);
1825 _RandomAccessIterator __next = __last;
1827 while (__comp(__val, __next))
1829 *__last = _GLIBCXX_MOVE(*__next);
1833 *__last = _GLIBCXX_MOVE(__val);
1837 template<
typename _RandomAccessIterator,
typename _Compare>
1840 _RandomAccessIterator __last, _Compare __comp)
1842 if (__first == __last)
return;
1844 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
1846 if (__comp(__i, __first))
1848 typename iterator_traits<_RandomAccessIterator>::value_type
1849 __val = _GLIBCXX_MOVE(*__i);
1850 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
1851 *__first = _GLIBCXX_MOVE(__val);
1855 __gnu_cxx::__ops::__val_comp_iter(__comp));
1860 template<
typename _RandomAccessIterator,
typename _Compare>
1863 _RandomAccessIterator __last, _Compare __comp)
1865 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
1867 __gnu_cxx::__ops::__val_comp_iter(__comp));
1874 enum { _S_threshold = 16 };
1877 template<
typename _RandomAccessIterator,
typename _Compare>
1880 _RandomAccessIterator __last, _Compare __comp)
1882 if (__last - __first >
int(_S_threshold))
1893 template<
typename _RandomAccessIterator,
typename _Compare>
1894 _RandomAccessIterator
1896 _RandomAccessIterator __last,
1897 _RandomAccessIterator __pivot, _Compare __comp)
1901 while (__comp(__first, __pivot))
1904 while (__comp(__pivot, __last))
1906 if (!(__first < __last))
1914 template<
typename _RandomAccessIterator,
typename _Compare>
1915 inline _RandomAccessIterator
1917 _RandomAccessIterator __last, _Compare __comp)
1919 _RandomAccessIterator __mid = __first + (__last - __first) / 2;
1925 template<
typename _RandomAccessIterator,
typename _Compare>
1927 __partial_sort(_RandomAccessIterator __first,
1928 _RandomAccessIterator __middle,
1929 _RandomAccessIterator __last,
1933 std::__sort_heap(__first, __middle, __comp);
1937 template<
typename _RandomAccessIterator,
typename _Size,
typename _Compare>
1940 _RandomAccessIterator __last,
1941 _Size __depth_limit, _Compare __comp)
1943 while (__last - __first >
int(_S_threshold))
1945 if (__depth_limit == 0)
1947 std::__partial_sort(__first, __last, __last, __comp);
1951 _RandomAccessIterator __cut =
1960 template<
typename _RandomAccessIterator,
typename _Compare>
1962 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
1965 if (__first != __last)
1974 template<
typename _RandomAccessIterator,
typename _Size,
typename _Compare>
1976 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,
1977 _RandomAccessIterator __last, _Size __depth_limit,
1980 while (__last - __first > 3)
1982 if (__depth_limit == 0)
1990 _RandomAccessIterator __cut =
2020 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2021 inline _ForwardIterator
2022 lower_bound(_ForwardIterator __first, _ForwardIterator __last,
2023 const _Tp& __val, _Compare __comp)
2026 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2027 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2028 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
2029 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2032 return std::__lower_bound(__first, __last, __val,
2033 __gnu_cxx::__ops::__iter_comp_val(__comp));
2036 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2038 __upper_bound(_ForwardIterator __first, _ForwardIterator __last,
2039 const _Tp& __val, _Compare __comp)
2041 typedef typename iterator_traits<_ForwardIterator>::difference_type
2048 _DistanceType __half = __len >> 1;
2049 _ForwardIterator __middle = __first;
2051 if (__comp(__val, __middle))
2057 __len = __len - __half - 1;
2074 template<
typename _ForwardIterator,
typename _Tp>
2075 inline _ForwardIterator
2076 upper_bound(_ForwardIterator __first, _ForwardIterator __last,
2080 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2081 __glibcxx_function_requires(_LessThanOpConcept<
2082 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2083 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2085 return std::__upper_bound(__first, __last, __val,
2086 __gnu_cxx::__ops::__val_less_iter());
2104 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2105 inline _ForwardIterator
2106 upper_bound(_ForwardIterator __first, _ForwardIterator __last,
2107 const _Tp& __val, _Compare __comp)
2110 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2111 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2112 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2113 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2116 return std::__upper_bound(__first, __last, __val,
2117 __gnu_cxx::__ops::__val_comp_iter(__comp));
2120 template<
typename _ForwardIterator,
typename _Tp,
2121 typename _CompareItTp,
typename _CompareTpIt>
2122 pair<_ForwardIterator, _ForwardIterator>
2123 __equal_range(_ForwardIterator __first, _ForwardIterator __last,
2125 _CompareItTp __comp_it_val, _CompareTpIt __comp_val_it)
2127 typedef typename iterator_traits<_ForwardIterator>::difference_type
2134 _DistanceType __half = __len >> 1;
2135 _ForwardIterator __middle = __first;
2137 if (__comp_it_val(__middle, __val))
2141 __len = __len - __half - 1;
2143 else if (__comp_val_it(__val, __middle))
2147 _ForwardIterator __left
2148 = std::__lower_bound(__first, __middle, __val, __comp_it_val);
2150 _ForwardIterator __right
2151 = std::__upper_bound(++__middle, __first, __val, __comp_val_it);
2152 return pair<_ForwardIterator, _ForwardIterator>(__left, __right);
2155 return pair<_ForwardIterator, _ForwardIterator>(__first, __first);
2175 template<
typename _ForwardIterator,
typename _Tp>
2176 inline pair<_ForwardIterator, _ForwardIterator>
2177 equal_range(_ForwardIterator __first, _ForwardIterator __last,
2181 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2182 __glibcxx_function_requires(_LessThanOpConcept<
2183 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
2184 __glibcxx_function_requires(_LessThanOpConcept<
2185 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2186 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2187 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2189 return std::__equal_range(__first, __last, __val,
2190 __gnu_cxx::__ops::__iter_less_val(),
2191 __gnu_cxx::__ops::__val_less_iter());
2211 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2212 inline pair<_ForwardIterator, _ForwardIterator>
2213 equal_range(_ForwardIterator __first, _ForwardIterator __last,
2214 const _Tp& __val, _Compare __comp)
2217 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2218 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2219 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
2220 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2221 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2222 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2224 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2227 return std::__equal_range(__first, __last, __val,
2228 __gnu_cxx::__ops::__iter_comp_val(__comp),
2229 __gnu_cxx::__ops::__val_comp_iter(__comp));
2244 template<
typename _ForwardIterator,
typename _Tp>
2246 binary_search(_ForwardIterator __first, _ForwardIterator __last,
2250 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2251 __glibcxx_function_requires(_LessThanOpConcept<
2252 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2253 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2254 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2256 _ForwardIterator __i
2257 = std::__lower_bound(__first, __last, __val,
2258 __gnu_cxx::__ops::__iter_less_val());
2259 return __i != __last && !(__val < *__i);
2277 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2279 binary_search(_ForwardIterator __first, _ForwardIterator __last,
2280 const _Tp& __val, _Compare __comp)
2283 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2284 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2285 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2286 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2288 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2291 _ForwardIterator __i
2292 = std::__lower_bound(__first, __last, __val,
2293 __gnu_cxx::__ops::__iter_comp_val(__comp));
2294 return __i != __last && !bool(__comp(__val, *__i));
2300 template<
typename _InputIterator1,
typename _InputIterator2,
2301 typename _OutputIterator,
typename _Compare>
2304 _InputIterator2 __first2, _InputIterator2 __last2,
2305 _OutputIterator __result, _Compare __comp)
2307 while (__first1 != __last1 && __first2 != __last2)
2309 if (__comp(__first2, __first1))
2311 *__result = _GLIBCXX_MOVE(*__first2);
2316 *__result = _GLIBCXX_MOVE(*__first1);
2321 if (__first1 != __last1)
2322 _GLIBCXX_MOVE3(__first1, __last1, __result);
2326 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
2327 typename _BidirectionalIterator3,
typename _Compare>
2330 _BidirectionalIterator1 __last1,
2331 _BidirectionalIterator2 __first2,
2332 _BidirectionalIterator2 __last2,
2333 _BidirectionalIterator3 __result,
2336 if (__first1 == __last1)
2338 _GLIBCXX_MOVE_BACKWARD3(__first2, __last2, __result);
2341 else if (__first2 == __last2)
2348 if (__comp(__last2, __last1))
2350 *--__result = _GLIBCXX_MOVE(*__last1);
2351 if (__first1 == __last1)
2353 _GLIBCXX_MOVE_BACKWARD3(__first2, ++__last2, __result);
2360 *--__result = _GLIBCXX_MOVE(*__last2);
2361 if (__first2 == __last2)
2369 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
2371 _BidirectionalIterator1
2373 _BidirectionalIterator1 __middle,
2374 _BidirectionalIterator1 __last,
2375 _Distance __len1, _Distance __len2,
2376 _BidirectionalIterator2 __buffer,
2377 _Distance __buffer_size)
2379 _BidirectionalIterator2 __buffer_end;
2380 if (__len1 > __len2 && __len2 <= __buffer_size)
2384 __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
2385 _GLIBCXX_MOVE_BACKWARD3(__first, __middle, __last);
2386 return _GLIBCXX_MOVE3(__buffer, __buffer_end, __first);
2391 else if (__len1 <= __buffer_size)
2395 __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
2396 _GLIBCXX_MOVE3(__middle, __last, __first);
2397 return _GLIBCXX_MOVE_BACKWARD3(__buffer, __buffer_end, __last);
2407 template<
typename _BidirectionalIterator,
typename _Distance,
2408 typename _Pointer,
typename _Compare>
2411 _BidirectionalIterator __middle,
2412 _BidirectionalIterator __last,
2413 _Distance __len1, _Distance __len2,
2414 _Pointer __buffer, _Distance __buffer_size,
2417 if (__len1 <= __len2 && __len1 <= __buffer_size)
2419 _Pointer __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
2423 else if (__len2 <= __buffer_size)
2425 _Pointer __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
2427 __buffer_end, __last, __comp);
2431 _BidirectionalIterator __first_cut = __first;
2432 _BidirectionalIterator __second_cut = __middle;
2433 _Distance __len11 = 0;
2434 _Distance __len22 = 0;
2435 if (__len1 > __len2)
2437 __len11 = __len1 / 2;
2440 = std::__lower_bound(__middle, __last, *__first_cut,
2441 __gnu_cxx::__ops::__iter_comp_val(__comp));
2446 __len22 = __len2 / 2;
2449 = std::__upper_bound(__first, __middle, *__second_cut,
2450 __gnu_cxx::__ops::__val_comp_iter(__comp));
2454 _BidirectionalIterator __new_middle
2456 __len1 - __len11, __len22, __buffer,
2459 __len22, __buffer, __buffer_size, __comp);
2462 __len2 - __len22, __buffer,
2463 __buffer_size, __comp);
2468 template<
typename _BidirectionalIterator,
typename _Distance,
2472 _BidirectionalIterator __middle,
2473 _BidirectionalIterator __last,
2474 _Distance __len1, _Distance __len2,
2477 if (__len1 == 0 || __len2 == 0)
2480 if (__len1 + __len2 == 2)
2482 if (__comp(__middle, __first))
2487 _BidirectionalIterator __first_cut = __first;
2488 _BidirectionalIterator __second_cut = __middle;
2489 _Distance __len11 = 0;
2490 _Distance __len22 = 0;
2491 if (__len1 > __len2)
2493 __len11 = __len1 / 2;
2496 = std::__lower_bound(__middle, __last, *__first_cut,
2497 __gnu_cxx::__ops::__iter_comp_val(__comp));
2502 __len22 = __len2 / 2;
2505 = std::__upper_bound(__first, __middle, *__second_cut,
2506 __gnu_cxx::__ops::__val_comp_iter(__comp));
2510 _BidirectionalIterator __new_middle
2511 =
std::rotate(__first_cut, __middle, __second_cut);
2513 __len11, __len22, __comp);
2515 __len1 - __len11, __len2 - __len22, __comp);
2518 template<
typename _B
idirectionalIterator,
typename _Compare>
2520 __inplace_merge(_BidirectionalIterator __first,
2521 _BidirectionalIterator __middle,
2522 _BidirectionalIterator __last,
2525 typedef typename iterator_traits<_BidirectionalIterator>::value_type
2527 typedef typename iterator_traits<_BidirectionalIterator>::difference_type
2530 if (__first == __middle || __middle == __last)
2533 const _DistanceType __len1 =
std::distance(__first, __middle);
2534 const _DistanceType __len2 =
std::distance(__middle, __last);
2536 typedef _Temporary_buffer<_BidirectionalIterator, _ValueType> _TmpBuf;
2537 _TmpBuf __buf(__first, __len1 + __len2);
2539 if (__buf.begin() == 0)
2541 (__first, __middle, __last, __len1, __len2, __comp);
2544 (__first, __middle, __last, __len1, __len2, __buf.begin(),
2545 _DistanceType(__buf.size()), __comp);
2566 template<
typename _B
idirectionalIterator>
2568 inplace_merge(_BidirectionalIterator __first,
2569 _BidirectionalIterator __middle,
2570 _BidirectionalIterator __last)
2573 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
2574 _BidirectionalIterator>)
2575 __glibcxx_function_requires(_LessThanComparableConcept<
2576 typename iterator_traits<_BidirectionalIterator>::value_type>)
2577 __glibcxx_requires_sorted(__first, __middle);
2578 __glibcxx_requires_sorted(__middle, __last);
2579 __glibcxx_requires_irreflexive(__first, __last);
2581 std::__inplace_merge(__first, __middle, __last,
2582 __gnu_cxx::__ops::__iter_less_iter());
2607 template<
typename _B
idirectionalIterator,
typename _Compare>
2609 inplace_merge(_BidirectionalIterator __first,
2610 _BidirectionalIterator __middle,
2611 _BidirectionalIterator __last,
2615 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
2616 _BidirectionalIterator>)
2617 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2618 typename iterator_traits<_BidirectionalIterator>::value_type,
2619 typename iterator_traits<_BidirectionalIterator>::value_type>)
2620 __glibcxx_requires_sorted_pred(__first, __middle, __comp);
2621 __glibcxx_requires_sorted_pred(__middle, __last, __comp);
2622 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
2624 std::__inplace_merge(__first, __middle, __last,
2625 __gnu_cxx::__ops::__iter_comp_iter(__comp));
2630 template<
typename _InputIterator,
typename _OutputIterator,
2634 _InputIterator __first2, _InputIterator __last2,
2635 _OutputIterator __result, _Compare __comp)
2637 while (__first1 != __last1 && __first2 != __last2)
2639 if (__comp(__first2, __first1))
2641 *__result = _GLIBCXX_MOVE(*__first2);
2646 *__result = _GLIBCXX_MOVE(*__first1);
2651 return _GLIBCXX_MOVE3(__first2, __last2,
2652 _GLIBCXX_MOVE3(__first1, __last1,
2656 template<
typename _RandomAccessIterator1,
typename _RandomAccessIterator2,
2657 typename _Distance,
typename _Compare>
2659 __merge_sort_loop(_RandomAccessIterator1 __first,
2660 _RandomAccessIterator1 __last,
2661 _RandomAccessIterator2 __result, _Distance __step_size,
2664 const _Distance __two_step = 2 * __step_size;
2666 while (__last - __first >= __two_step)
2669 __first + __step_size,
2670 __first + __two_step,
2672 __first += __two_step;
2674 __step_size =
std::min(_Distance(__last - __first), __step_size);
2677 __first + __step_size, __last, __result, __comp);
2680 template<
typename _RandomAccessIterator,
typename _Distance,
2683 __chunk_insertion_sort(_RandomAccessIterator __first,
2684 _RandomAccessIterator __last,
2685 _Distance __chunk_size, _Compare __comp)
2687 while (__last - __first >= __chunk_size)
2690 __first += __chunk_size;
2695 enum { _S_chunk_size = 7 };
2697 template<
typename _RandomAccessIterator,
typename _Po
inter,
typename _Compare>
2699 __merge_sort_with_buffer(_RandomAccessIterator __first,
2700 _RandomAccessIterator __last,
2701 _Pointer __buffer, _Compare __comp)
2703 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
2706 const _Distance __len = __last - __first;
2707 const _Pointer __buffer_last = __buffer + __len;
2709 _Distance __step_size = _S_chunk_size;
2710 std::__chunk_insertion_sort(__first, __last, __step_size, __comp);
2712 while (__step_size < __len)
2714 std::__merge_sort_loop(__first, __last, __buffer,
2715 __step_size, __comp);
2717 std::__merge_sort_loop(__buffer, __buffer_last, __first,
2718 __step_size, __comp);
2723 template<
typename _RandomAccessIterator,
typename _Pointer,
2724 typename _Distance,
typename _Compare>
2726 __stable_sort_adaptive(_RandomAccessIterator __first,
2727 _RandomAccessIterator __last,
2728 _Pointer __buffer, _Distance __buffer_size,
2731 const _Distance __len = (__last - __first + 1) / 2;
2732 const _RandomAccessIterator __middle = __first + __len;
2733 if (__len > __buffer_size)
2735 std::__stable_sort_adaptive(__first, __middle, __buffer,
2736 __buffer_size, __comp);
2737 std::__stable_sort_adaptive(__middle, __last, __buffer,
2738 __buffer_size, __comp);
2742 std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
2743 std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
2746 _Distance(__middle - __first),
2747 _Distance(__last - __middle),
2748 __buffer, __buffer_size,
2753 template<
typename _RandomAccessIterator,
typename _Compare>
2756 _RandomAccessIterator __last, _Compare __comp)
2758 if (__last - __first < 15)
2763 _RandomAccessIterator __middle = __first + (__last - __first) / 2;
2779 template<
typename _InputIterator1,
typename _InputIterator2,
2782 __includes(_InputIterator1 __first1, _InputIterator1 __last1,
2783 _InputIterator2 __first2, _InputIterator2 __last2,
2786 while (__first1 != __last1 && __first2 != __last2)
2787 if (__comp(__first2, __first1))
2789 else if (__comp(__first1, __first2))
2797 return __first2 == __last2;
2818 template<
typename _InputIterator1,
typename _InputIterator2>
2820 includes(_InputIterator1 __first1, _InputIterator1 __last1,
2821 _InputIterator2 __first2, _InputIterator2 __last2)
2824 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
2825 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
2826 __glibcxx_function_requires(_LessThanOpConcept<
2827 typename iterator_traits<_InputIterator1>::value_type,
2828 typename iterator_traits<_InputIterator2>::value_type>)
2829 __glibcxx_function_requires(_LessThanOpConcept<
2830 typename iterator_traits<_InputIterator2>::value_type,
2831 typename iterator_traits<_InputIterator1>::value_type>)
2832 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
2833 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
2834 __glibcxx_requires_irreflexive2(__first1, __last1);
2835 __glibcxx_requires_irreflexive2(__first2, __last2);
2837 return std::__includes(__first1, __last1, __first2, __last2,
2838 __gnu_cxx::__ops::__iter_less_iter());
2862 template<
typename _InputIterator1,
typename _InputIterator2,
2865 includes(_InputIterator1 __first1, _InputIterator1 __last1,
2866 _InputIterator2 __first2, _InputIterator2 __last2,
2870 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
2871 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
2872 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2873 typename iterator_traits<_InputIterator1>::value_type,
2874 typename iterator_traits<_InputIterator2>::value_type>)
2875 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2876 typename iterator_traits<_InputIterator2>::value_type,
2877 typename iterator_traits<_InputIterator1>::value_type>)
2878 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
2879 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
2880 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
2881 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
2883 return std::__includes(__first1, __last1, __first2, __last2,
2884 __gnu_cxx::__ops::__iter_comp_iter(__comp));
2897 template<
typename _B
idirectionalIterator,
typename _Compare>
2899 __next_permutation(_BidirectionalIterator __first,
2900 _BidirectionalIterator __last, _Compare __comp)
2902 if (__first == __last)
2904 _BidirectionalIterator __i = __first;
2913 _BidirectionalIterator __ii = __i;
2915 if (__comp(__i, __ii))
2917 _BidirectionalIterator __j = __last;
2918 while (!__comp(__i, --__j))
2946 template<
typename _B
idirectionalIterator>
2948 next_permutation(_BidirectionalIterator __first,
2949 _BidirectionalIterator __last)
2952 __glibcxx_function_requires(_BidirectionalIteratorConcept<
2953 _BidirectionalIterator>)
2954 __glibcxx_function_requires(_LessThanComparableConcept<
2955 typename iterator_traits<_BidirectionalIterator>::value_type>)
2956 __glibcxx_requires_valid_range(__first, __last);
2957 __glibcxx_requires_irreflexive(__first, __last);
2959 return std::__next_permutation
2960 (__first, __last, __gnu_cxx::__ops::__iter_less_iter());
2978 template<
typename _B
idirectionalIterator,
typename _Compare>
2980 next_permutation(_BidirectionalIterator __first,
2981 _BidirectionalIterator __last, _Compare __comp)
2984 __glibcxx_function_requires(_BidirectionalIteratorConcept<
2985 _BidirectionalIterator>)
2986 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2987 typename iterator_traits<_BidirectionalIterator>::value_type,
2988 typename iterator_traits<_BidirectionalIterator>::value_type>)
2989 __glibcxx_requires_valid_range(__first, __last);
2990 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
2992 return std::__next_permutation
2993 (__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
2996 template<
typename _B
idirectionalIterator,
typename _Compare>
2998 __prev_permutation(_BidirectionalIterator __first,
2999 _BidirectionalIterator __last, _Compare __comp)
3001 if (__first == __last)
3003 _BidirectionalIterator __i = __first;
3012 _BidirectionalIterator __ii = __i;
3014 if (__comp(__ii, __i))
3016 _BidirectionalIterator __j = __last;
3017 while (!__comp(--__j, __i))
3046 template<
typename _B
idirectionalIterator>
3048 prev_permutation(_BidirectionalIterator __first,
3049 _BidirectionalIterator __last)
3052 __glibcxx_function_requires(_BidirectionalIteratorConcept<
3053 _BidirectionalIterator>)
3054 __glibcxx_function_requires(_LessThanComparableConcept<
3055 typename iterator_traits<_BidirectionalIterator>::value_type>)
3056 __glibcxx_requires_valid_range(__first, __last);
3057 __glibcxx_requires_irreflexive(__first, __last);
3059 return std::__prev_permutation(__first, __last,
3060 __gnu_cxx::__ops::__iter_less_iter());
3078 template<
typename _B
idirectionalIterator,
typename _Compare>
3080 prev_permutation(_BidirectionalIterator __first,
3081 _BidirectionalIterator __last, _Compare __comp)
3084 __glibcxx_function_requires(_BidirectionalIteratorConcept<
3085 _BidirectionalIterator>)
3086 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3087 typename iterator_traits<_BidirectionalIterator>::value_type,
3088 typename iterator_traits<_BidirectionalIterator>::value_type>)
3089 __glibcxx_requires_valid_range(__first, __last);
3090 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3092 return std::__prev_permutation(__first, __last,
3093 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3099 template<
typename _InputIterator,
typename _OutputIterator,
3100 typename _Predicate,
typename _Tp>
3102 __replace_copy_if(_InputIterator __first, _InputIterator __last,
3103 _OutputIterator __result,
3104 _Predicate __pred,
const _Tp& __new_value)
3106 for (; __first != __last; ++__first, (void)++__result)
3107 if (__pred(__first))
3108 *__result = __new_value;
3110 *__result = *__first;
3128 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
3129 inline _OutputIterator
3130 replace_copy(_InputIterator __first, _InputIterator __last,
3131 _OutputIterator __result,
3132 const _Tp& __old_value,
const _Tp& __new_value)
3135 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3136 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
3137 typename iterator_traits<_InputIterator>::value_type>)
3138 __glibcxx_function_requires(_EqualOpConcept<
3139 typename iterator_traits<_InputIterator>::value_type, _Tp>)
3140 __glibcxx_requires_valid_range(__first, __last);
3142 return std::__replace_copy_if(__first, __last, __result,
3143 __gnu_cxx::__ops::__iter_equals_val(__old_value),
3162 template<
typename _InputIterator,
typename _OutputIterator,
3163 typename _Predicate,
typename _Tp>
3164 inline _OutputIterator
3165 replace_copy_if(_InputIterator __first, _InputIterator __last,
3166 _OutputIterator __result,
3167 _Predicate __pred,
const _Tp& __new_value)
3170 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3171 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
3172 typename iterator_traits<_InputIterator>::value_type>)
3173 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
3174 typename iterator_traits<_InputIterator>::value_type>)
3175 __glibcxx_requires_valid_range(__first, __last);
3177 return std::__replace_copy_if(__first, __last, __result,
3178 __gnu_cxx::__ops::__pred_iter(__pred),
3182 template<
typename _InputIterator,
typename _Predicate>
3183 typename iterator_traits<_InputIterator>::difference_type
3184 __count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
3186 typename iterator_traits<_InputIterator>::difference_type __n = 0;
3187 for (; __first != __last; ++__first)
3188 if (__pred(__first))
3193 #if __cplusplus >= 201103L
3201 template<
typename _ForwardIterator>
3203 is_sorted(_ForwardIterator __first, _ForwardIterator __last)
3215 template<
typename _ForwardIterator,
typename _Compare>
3217 is_sorted(_ForwardIterator __first, _ForwardIterator __last,
3221 template<
typename _ForwardIterator,
typename _Compare>
3223 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last,
3226 if (__first == __last)
3229 _ForwardIterator __next = __first;
3230 for (++__next; __next != __last; __first = __next, (void)++__next)
3231 if (__comp(__next, __first))
3244 template<
typename _ForwardIterator>
3245 inline _ForwardIterator
3246 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last)
3249 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3250 __glibcxx_function_requires(_LessThanComparableConcept<
3251 typename iterator_traits<_ForwardIterator>::value_type>)
3252 __glibcxx_requires_valid_range(__first, __last);
3253 __glibcxx_requires_irreflexive(__first, __last);
3255 return std::__is_sorted_until(__first, __last,
3256 __gnu_cxx::__ops::__iter_less_iter());
3268 template<
typename _ForwardIterator,
typename _Compare>
3269 inline _ForwardIterator
3270 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last,
3274 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3275 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3276 typename iterator_traits<_ForwardIterator>::value_type,
3277 typename iterator_traits<_ForwardIterator>::value_type>)
3278 __glibcxx_requires_valid_range(__first, __last);
3279 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3281 return std::__is_sorted_until(__first, __last,
3282 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3293 template<
typename _Tp>
3294 _GLIBCXX14_CONSTEXPR
3295 inline pair<const _Tp&, const _Tp&>
3299 __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
3301 return __b < __a ? pair<const _Tp&, const _Tp&>(__b, __a)
3314 template<
typename _Tp,
typename _Compare>
3315 _GLIBCXX14_CONSTEXPR
3316 inline pair<const _Tp&, const _Tp&>
3317 minmax(
const _Tp& __a,
const _Tp& __b, _Compare __comp)
3323 template<
typename _ForwardIterator,
typename _Compare>
3324 _GLIBCXX14_CONSTEXPR
3325 pair<_ForwardIterator, _ForwardIterator>
3326 __minmax_element(_ForwardIterator __first, _ForwardIterator __last,
3329 _ForwardIterator __next = __first;
3330 if (__first == __last
3331 || ++__next == __last)
3334 _ForwardIterator __min{}, __max{};
3335 if (__comp(__next, __first))
3349 while (__first != __last)
3352 if (++__next == __last)
3354 if (__comp(__first, __min))
3356 else if (!__comp(__first, __max))
3361 if (__comp(__next, __first))
3363 if (__comp(__next, __min))
3365 if (!__comp(__first, __max))
3370 if (__comp(__first, __min))
3372 if (!__comp(__next, __max))
3394 template<
typename _ForwardIterator>
3395 _GLIBCXX14_CONSTEXPR
3396 inline pair<_ForwardIterator, _ForwardIterator>
3397 minmax_element(_ForwardIterator __first, _ForwardIterator __last)
3400 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3401 __glibcxx_function_requires(_LessThanComparableConcept<
3402 typename iterator_traits<_ForwardIterator>::value_type>)
3403 __glibcxx_requires_valid_range(__first, __last);
3404 __glibcxx_requires_irreflexive(__first, __last);
3406 return std::__minmax_element(__first, __last,
3407 __gnu_cxx::__ops::__iter_less_iter());
3422 template<
typename _ForwardIterator,
typename _Compare>
3423 _GLIBCXX14_CONSTEXPR
3424 inline pair<_ForwardIterator, _ForwardIterator>
3425 minmax_element(_ForwardIterator __first, _ForwardIterator __last,
3429 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3430 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3431 typename iterator_traits<_ForwardIterator>::value_type,
3432 typename iterator_traits<_ForwardIterator>::value_type>)
3433 __glibcxx_requires_valid_range(__first, __last);
3434 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3436 return std::__minmax_element(__first, __last,
3437 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3441 template<
typename _Tp>
3442 _GLIBCXX14_CONSTEXPR
3444 min(initializer_list<_Tp> __l)
3445 {
return *std::min_element(__l.begin(), __l.end()); }
3447 template<
typename _Tp,
typename _Compare>
3448 _GLIBCXX14_CONSTEXPR
3450 min(initializer_list<_Tp> __l, _Compare __comp)
3453 template<
typename _Tp>
3454 _GLIBCXX14_CONSTEXPR
3456 max(initializer_list<_Tp> __l)
3459 template<
typename _Tp,
typename _Compare>
3460 _GLIBCXX14_CONSTEXPR
3462 max(initializer_list<_Tp> __l, _Compare __comp)
3465 template<
typename _Tp>
3466 _GLIBCXX14_CONSTEXPR
3467 inline pair<_Tp, _Tp>
3468 minmax(initializer_list<_Tp> __l)
3470 pair<const _Tp*, const _Tp*> __p =
3475 template<
typename _Tp,
typename _Compare>
3476 _GLIBCXX14_CONSTEXPR
3477 inline pair<_Tp, _Tp>
3478 minmax(initializer_list<_Tp> __l, _Compare __comp)
3480 pair<const _Tp*, const _Tp*> __p =
3485 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3486 typename _BinaryPredicate>
3488 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3489 _ForwardIterator2 __first2, _BinaryPredicate __pred)
3493 for (; __first1 != __last1; ++__first1, (void)++__first2)
3494 if (!__pred(__first1, __first2))
3497 if (__first1 == __last1)
3502 _ForwardIterator2 __last2 = __first2;
3504 for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan)
3507 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)))
3511 = std::__count_if(__first2, __last2,
3512 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan));
3513 if (0 == __matches ||
3514 std::__count_if(__scan, __last1,
3515 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))
3534 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
3536 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3537 _ForwardIterator2 __first2)
3540 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
3541 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
3542 __glibcxx_function_requires(_EqualOpConcept<
3543 typename iterator_traits<_ForwardIterator1>::value_type,
3544 typename iterator_traits<_ForwardIterator2>::value_type>)
3545 __glibcxx_requires_valid_range(__first1, __last1);
3547 return std::__is_permutation(__first1, __last1, __first2,
3548 __gnu_cxx::__ops::__iter_equal_to_iter());
3565 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3566 typename _BinaryPredicate>
3568 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3569 _ForwardIterator2 __first2, _BinaryPredicate __pred)
3572 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
3573 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
3574 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
3575 typename iterator_traits<_ForwardIterator1>::value_type,
3576 typename iterator_traits<_ForwardIterator2>::value_type>)
3577 __glibcxx_requires_valid_range(__first1, __last1);
3579 return std::__is_permutation(__first1, __last1, __first2,
3580 __gnu_cxx::__ops::__iter_comp_iter(__pred));
3583 #if __cplusplus > 201103L
3584 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3585 typename _BinaryPredicate>
3587 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3588 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3589 _BinaryPredicate __pred)
3592 =
typename iterator_traits<_ForwardIterator1>::iterator_category;
3594 =
typename iterator_traits<_ForwardIterator2>::iterator_category;
3595 using _It1_is_RA = is_same<_Cat1, random_access_iterator_tag>;
3596 using _It2_is_RA = is_same<_Cat2, random_access_iterator_tag>;
3597 constexpr
bool __ra_iters = _It1_is_RA() && _It2_is_RA();
3608 for (; __first1 != __last1 && __first2 != __last2;
3609 ++__first1, (void)++__first2)
3610 if (!__pred(__first1, __first2))
3615 if (__first1 == __last1)
3622 if (__d1 == 0 && __d2 == 0)
3628 for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan)
3631 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)))
3634 auto __matches = std::__count_if(__first2, __last2,
3635 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan));
3637 || std::__count_if(__scan, __last1,
3638 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))
3658 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
3660 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3661 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
3663 __glibcxx_requires_valid_range(__first1, __last1);
3664 __glibcxx_requires_valid_range(__first2, __last2);
3667 std::__is_permutation(__first1, __last1, __first2, __last2,
3668 __gnu_cxx::__ops::__iter_equal_to_iter());
3685 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3686 typename _BinaryPredicate>
3688 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3689 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3690 _BinaryPredicate __pred)
3692 __glibcxx_requires_valid_range(__first1, __last1);
3693 __glibcxx_requires_valid_range(__first2, __last2);
3695 return std::__is_permutation(__first1, __last1, __first2, __last2,
3696 __gnu_cxx::__ops::__iter_comp_iter(__pred));
3699 #if __cplusplus > 201402L
3701 #define __cpp_lib_clamp 201603
3711 template<
typename _Tp>
3712 constexpr
const _Tp&
3713 clamp(
const _Tp& __val,
const _Tp& __lo,
const _Tp& __hi)
3715 __glibcxx_assert(!(__hi < __lo));
3716 return (__val < __lo) ? __lo : (__hi < __val) ? __hi : __val;
3729 template<
typename _Tp,
typename _Compare>
3730 constexpr
const _Tp&
3731 clamp(
const _Tp& __val,
const _Tp& __lo,
const _Tp& __hi, _Compare __comp)
3733 __glibcxx_assert(!__comp(__hi, __lo));
3734 return __comp(__val, __lo) ? __lo : __comp(__hi, __val) ? __hi : __val;
3739 #ifdef _GLIBCXX_USE_C99_STDINT_TR1
3761 template<
typename _IntType,
typename _UniformRandomBitGenerator>
3762 pair<_IntType, _IntType>
3764 _UniformRandomBitGenerator&& __g)
3783 template<
typename _RandomAccessIterator,
3784 typename _UniformRandomNumberGenerator>
3786 shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
3787 _UniformRandomNumberGenerator&& __g)
3790 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
3791 _RandomAccessIterator>)
3792 __glibcxx_requires_valid_range(__first, __last);
3794 if (__first == __last)
3797 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
3800 typedef typename std::make_unsigned<_DistanceType>::type __ud_type;
3802 typedef typename __distr_type::param_type __p_type;
3804 typedef typename remove_reference<_UniformRandomNumberGenerator>::type
3809 const __uc_type __urngrange = __g.max() - __g.min();
3810 const __uc_type __urange = __uc_type(__last - __first);
3812 if (__urngrange / __urange >= __urange)
3815 _RandomAccessIterator __i = __first + 1;
3821 if ((__urange % 2) == 0)
3823 __distr_type __d{0, 1};
3831 while (__i != __last)
3833 const __uc_type __swap_range = __uc_type(__i - __first) + 1;
3847 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
3848 std::iter_swap(__i, __first + __d(__g, __p_type(0, __i - __first)));
3854 _GLIBCXX_BEGIN_NAMESPACE_ALGO
3868 template<
typename _InputIterator,
typename _Function>
3870 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
3873 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3874 __glibcxx_requires_valid_range(__first, __last);
3875 for (; __first != __last; ++__first)
3880 #if __cplusplus >= 201703L
3893 template<
typename _InputIterator,
typename _Size,
typename _Function>
3895 for_each_n(_InputIterator __first, _Size __n, _Function __f)
3897 typename iterator_traits<_InputIterator>::difference_type __n2 = __n;
3898 using _Cat =
typename iterator_traits<_InputIterator>::iterator_category;
3899 if constexpr (is_base_of_v<random_access_iterator_tag, _Cat>)
3900 return std::for_each(__first, __first + __n2, __f);
3922 template<
typename _InputIterator,
typename _Tp>
3923 inline _InputIterator
3924 find(_InputIterator __first, _InputIterator __last,
3928 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3929 __glibcxx_function_requires(_EqualOpConcept<
3930 typename iterator_traits<_InputIterator>::value_type, _Tp>)
3931 __glibcxx_requires_valid_range(__first, __last);
3933 __gnu_cxx::__ops::__iter_equals_val(__val));
3946 template<
typename _InputIterator,
typename _Predicate>
3947 inline _InputIterator
3948 find_if(_InputIterator __first, _InputIterator __last,
3952 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3953 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
3954 typename iterator_traits<_InputIterator>::value_type>)
3955 __glibcxx_requires_valid_range(__first, __last);
3958 __gnu_cxx::__ops::__pred_iter(__pred));
3977 template<
typename _InputIterator,
typename _ForwardIterator>
3979 find_first_of(_InputIterator __first1, _InputIterator __last1,
3980 _ForwardIterator __first2, _ForwardIterator __last2)
3983 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3984 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3985 __glibcxx_function_requires(_EqualOpConcept<
3986 typename iterator_traits<_InputIterator>::value_type,
3987 typename iterator_traits<_ForwardIterator>::value_type>)
3988 __glibcxx_requires_valid_range(__first1, __last1);
3989 __glibcxx_requires_valid_range(__first2, __last2);
3991 for (; __first1 != __last1; ++__first1)
3992 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
3993 if (*__first1 == *__iter)
4017 template<
typename _InputIterator,
typename _ForwardIterator,
4018 typename _BinaryPredicate>
4020 find_first_of(_InputIterator __first1, _InputIterator __last1,
4021 _ForwardIterator __first2, _ForwardIterator __last2,
4022 _BinaryPredicate __comp)
4025 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4026 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4027 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4028 typename iterator_traits<_InputIterator>::value_type,
4029 typename iterator_traits<_ForwardIterator>::value_type>)
4030 __glibcxx_requires_valid_range(__first1, __last1);
4031 __glibcxx_requires_valid_range(__first2, __last2);
4033 for (; __first1 != __last1; ++__first1)
4034 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
4035 if (__comp(*__first1, *__iter))
4049 template<
typename _ForwardIterator>
4050 inline _ForwardIterator
4051 adjacent_find(_ForwardIterator __first, _ForwardIterator __last)
4054 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4055 __glibcxx_function_requires(_EqualityComparableConcept<
4056 typename iterator_traits<_ForwardIterator>::value_type>)
4057 __glibcxx_requires_valid_range(__first, __last);
4059 return std::__adjacent_find(__first, __last,
4060 __gnu_cxx::__ops::__iter_equal_to_iter());
4074 template<
typename _ForwardIterator,
typename _BinaryPredicate>
4075 inline _ForwardIterator
4076 adjacent_find(_ForwardIterator __first, _ForwardIterator __last,
4077 _BinaryPredicate __binary_pred)
4080 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4081 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4082 typename iterator_traits<_ForwardIterator>::value_type,
4083 typename iterator_traits<_ForwardIterator>::value_type>)
4084 __glibcxx_requires_valid_range(__first, __last);
4086 return std::__adjacent_find(__first, __last,
4087 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred));
4099 template<
typename _InputIterator,
typename _Tp>
4100 inline typename iterator_traits<_InputIterator>::difference_type
4101 count(_InputIterator __first, _InputIterator __last,
const _Tp& __value)
4104 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4105 __glibcxx_function_requires(_EqualOpConcept<
4106 typename iterator_traits<_InputIterator>::value_type, _Tp>)
4107 __glibcxx_requires_valid_range(__first, __last);
4109 return std::__count_if(__first, __last,
4110 __gnu_cxx::__ops::__iter_equals_val(__value));
4122 template<
typename _InputIterator,
typename _Predicate>
4123 inline typename iterator_traits<_InputIterator>::difference_type
4124 count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
4127 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4128 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4129 typename iterator_traits<_InputIterator>::value_type>)
4130 __glibcxx_requires_valid_range(__first, __last);
4132 return std::__count_if(__first, __last,
4133 __gnu_cxx::__ops::__pred_iter(__pred));
4162 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
4163 inline _ForwardIterator1
4164 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
4165 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
4168 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
4169 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
4170 __glibcxx_function_requires(_EqualOpConcept<
4171 typename iterator_traits<_ForwardIterator1>::value_type,
4172 typename iterator_traits<_ForwardIterator2>::value_type>)
4173 __glibcxx_requires_valid_range(__first1, __last1);
4174 __glibcxx_requires_valid_range(__first2, __last2);
4176 return std::__search(__first1, __last1, __first2, __last2,
4177 __gnu_cxx::__ops::__iter_equal_to_iter());
4201 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
4202 typename _BinaryPredicate>
4203 inline _ForwardIterator1
4204 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
4205 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
4206 _BinaryPredicate __predicate)
4209 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
4210 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
4211 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4212 typename iterator_traits<_ForwardIterator1>::value_type,
4213 typename iterator_traits<_ForwardIterator2>::value_type>)
4214 __glibcxx_requires_valid_range(__first1, __last1);
4215 __glibcxx_requires_valid_range(__first2, __last2);
4217 return std::__search(__first1, __last1, __first2, __last2,
4218 __gnu_cxx::__ops::__iter_comp_iter(__predicate));
4236 template<
typename _ForwardIterator,
typename _Integer,
typename _Tp>
4237 inline _ForwardIterator
4238 search_n(_ForwardIterator __first, _ForwardIterator __last,
4239 _Integer __count,
const _Tp& __val)
4242 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4243 __glibcxx_function_requires(_EqualOpConcept<
4244 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
4245 __glibcxx_requires_valid_range(__first, __last);
4247 return std::__search_n(__first, __last, __count,
4248 __gnu_cxx::__ops::__iter_equals_val(__val));
4269 template<
typename _ForwardIterator,
typename _Integer,
typename _Tp,
4270 typename _BinaryPredicate>
4271 inline _ForwardIterator
4272 search_n(_ForwardIterator __first, _ForwardIterator __last,
4273 _Integer __count,
const _Tp& __val,
4274 _BinaryPredicate __binary_pred)
4277 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4278 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4279 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
4280 __glibcxx_requires_valid_range(__first, __last);
4282 return std::__search_n(__first, __last, __count,
4283 __gnu_cxx::__ops::__iter_comp_val(__binary_pred, __val));
4286 #if __cplusplus > 201402L
4294 template<
typename _ForwardIterator,
typename _Searcher>
4295 inline _ForwardIterator
4296 search(_ForwardIterator __first, _ForwardIterator __last,
4297 const _Searcher& __searcher)
4298 {
return __searcher(__first, __last).first; }
4317 template<
typename _InputIterator,
typename _OutputIterator,
4318 typename _UnaryOperation>
4320 transform(_InputIterator __first, _InputIterator __last,
4321 _OutputIterator __result, _UnaryOperation __unary_op)
4324 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4325 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4327 __typeof__(__unary_op(*__first))>)
4328 __glibcxx_requires_valid_range(__first, __last);
4330 for (; __first != __last; ++__first, (void)++__result)
4331 *__result = __unary_op(*__first);
4354 template<
typename _InputIterator1,
typename _InputIterator2,
4355 typename _OutputIterator,
typename _BinaryOperation>
4357 transform(_InputIterator1 __first1, _InputIterator1 __last1,
4358 _InputIterator2 __first2, _OutputIterator __result,
4359 _BinaryOperation __binary_op)
4362 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4363 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
4364 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4366 __typeof__(__binary_op(*__first1,*__first2))>)
4367 __glibcxx_requires_valid_range(__first1, __last1);
4369 for (; __first1 != __last1; ++__first1, (void)++__first2, ++__result)
4370 *__result = __binary_op(*__first1, *__first2);
4387 template<
typename _ForwardIterator,
typename _Tp>
4389 replace(_ForwardIterator __first, _ForwardIterator __last,
4390 const _Tp& __old_value,
const _Tp& __new_value)
4393 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4395 __glibcxx_function_requires(_EqualOpConcept<
4396 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
4397 __glibcxx_function_requires(_ConvertibleConcept<_Tp,
4398 typename iterator_traits<_ForwardIterator>::value_type>)
4399 __glibcxx_requires_valid_range(__first, __last);
4401 for (; __first != __last; ++__first)
4402 if (*__first == __old_value)
4403 *__first = __new_value;
4419 template<
typename _ForwardIterator,
typename _Predicate,
typename _Tp>
4421 replace_if(_ForwardIterator __first, _ForwardIterator __last,
4422 _Predicate __pred,
const _Tp& __new_value)
4425 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4427 __glibcxx_function_requires(_ConvertibleConcept<_Tp,
4428 typename iterator_traits<_ForwardIterator>::value_type>)
4429 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4430 typename iterator_traits<_ForwardIterator>::value_type>)
4431 __glibcxx_requires_valid_range(__first, __last);
4433 for (; __first != __last; ++__first)
4434 if (__pred(*__first))
4435 *__first = __new_value;
4451 template<
typename _ForwardIterator,
typename _Generator>
4453 generate(_ForwardIterator __first, _ForwardIterator __last,
4457 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4458 __glibcxx_function_requires(_GeneratorConcept<_Generator,
4459 typename iterator_traits<_ForwardIterator>::value_type>)
4460 __glibcxx_requires_valid_range(__first, __last);
4462 for (; __first != __last; ++__first)
4482 template<
typename _OutputIterator,
typename _Size,
typename _Generator>
4484 generate_n(_OutputIterator __first, _Size __n, _Generator __gen)
4487 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4489 __typeof__(__gen())>)
4491 for (__decltype(__n + 0) __niter = __n;
4492 __niter > 0; --__niter, (void) ++__first)
4518 template<
typename _InputIterator,
typename _OutputIterator>
4519 inline _OutputIterator
4520 unique_copy(_InputIterator __first, _InputIterator __last,
4521 _OutputIterator __result)
4524 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4525 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4526 typename iterator_traits<_InputIterator>::value_type>)
4527 __glibcxx_function_requires(_EqualityComparableConcept<
4528 typename iterator_traits<_InputIterator>::value_type>)
4529 __glibcxx_requires_valid_range(__first, __last);
4531 if (__first == __last)
4534 __gnu_cxx::__ops::__iter_equal_to_iter(),
4558 template<
typename _InputIterator,
typename _OutputIterator,
4559 typename _BinaryPredicate>
4560 inline _OutputIterator
4561 unique_copy(_InputIterator __first, _InputIterator __last,
4562 _OutputIterator __result,
4563 _BinaryPredicate __binary_pred)
4566 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4567 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4568 typename iterator_traits<_InputIterator>::value_type>)
4569 __glibcxx_requires_valid_range(__first, __last);
4571 if (__first == __last)
4574 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred),
4591 template<
typename _RandomAccessIterator>
4593 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
4596 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4597 _RandomAccessIterator>)
4598 __glibcxx_requires_valid_range(__first, __last);
4600 if (__first != __last)
4601 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
4604 _RandomAccessIterator __j = __first
4605 + std::rand() % ((__i - __first) + 1);
4607 std::iter_swap(__i, __j);
4626 template<
typename _RandomAccessIterator,
typename _RandomNumberGenerator>
4628 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
4629 #
if __cplusplus >= 201103L
4630 _RandomNumberGenerator&& __rand)
4632 _RandomNumberGenerator& __rand)
4636 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4637 _RandomAccessIterator>)
4638 __glibcxx_requires_valid_range(__first, __last);
4640 if (__first == __last)
4642 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
4644 _RandomAccessIterator __j = __first + __rand((__i - __first) + 1);
4666 template<
typename _ForwardIterator,
typename _Predicate>
4667 inline _ForwardIterator
4668 partition(_ForwardIterator __first, _ForwardIterator __last,
4672 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4674 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4675 typename iterator_traits<_ForwardIterator>::value_type>)
4676 __glibcxx_requires_valid_range(__first, __last);
4699 template<
typename _RandomAccessIterator>
4701 partial_sort(_RandomAccessIterator __first,
4702 _RandomAccessIterator __middle,
4703 _RandomAccessIterator __last)
4706 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4707 _RandomAccessIterator>)
4708 __glibcxx_function_requires(_LessThanComparableConcept<
4709 typename iterator_traits<_RandomAccessIterator>::value_type>)
4710 __glibcxx_requires_valid_range(__first, __middle);
4711 __glibcxx_requires_valid_range(__middle, __last);
4712 __glibcxx_requires_irreflexive(__first, __last);
4714 std::__partial_sort(__first, __middle, __last,
4715 __gnu_cxx::__ops::__iter_less_iter());
4737 template<
typename _RandomAccessIterator,
typename _Compare>
4739 partial_sort(_RandomAccessIterator __first,
4740 _RandomAccessIterator __middle,
4741 _RandomAccessIterator __last,
4745 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4746 _RandomAccessIterator>)
4747 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4748 typename iterator_traits<_RandomAccessIterator>::value_type,
4749 typename iterator_traits<_RandomAccessIterator>::value_type>)
4750 __glibcxx_requires_valid_range(__first, __middle);
4751 __glibcxx_requires_valid_range(__middle, __last);
4752 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4754 std::__partial_sort(__first, __middle, __last,
4755 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4773 template<
typename _RandomAccessIterator>
4775 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
4776 _RandomAccessIterator __last)
4779 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4780 _RandomAccessIterator>)
4781 __glibcxx_function_requires(_LessThanComparableConcept<
4782 typename iterator_traits<_RandomAccessIterator>::value_type>)
4783 __glibcxx_requires_valid_range(__first, __nth);
4784 __glibcxx_requires_valid_range(__nth, __last);
4785 __glibcxx_requires_irreflexive(__first, __last);
4787 if (__first == __last || __nth == __last)
4790 std::__introselect(__first, __nth, __last,
4792 __gnu_cxx::__ops::__iter_less_iter());
4812 template<
typename _RandomAccessIterator,
typename _Compare>
4814 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
4815 _RandomAccessIterator __last, _Compare __comp)
4818 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4819 _RandomAccessIterator>)
4820 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4821 typename iterator_traits<_RandomAccessIterator>::value_type,
4822 typename iterator_traits<_RandomAccessIterator>::value_type>)
4823 __glibcxx_requires_valid_range(__first, __nth);
4824 __glibcxx_requires_valid_range(__nth, __last);
4825 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4827 if (__first == __last || __nth == __last)
4830 std::__introselect(__first, __nth, __last,
4832 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4849 template<
typename _RandomAccessIterator>
4851 sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
4854 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4855 _RandomAccessIterator>)
4856 __glibcxx_function_requires(_LessThanComparableConcept<
4857 typename iterator_traits<_RandomAccessIterator>::value_type>)
4858 __glibcxx_requires_valid_range(__first, __last);
4859 __glibcxx_requires_irreflexive(__first, __last);
4861 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
4879 template<
typename _RandomAccessIterator,
typename _Compare>
4881 sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
4885 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4886 _RandomAccessIterator>)
4887 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4888 typename iterator_traits<_RandomAccessIterator>::value_type,
4889 typename iterator_traits<_RandomAccessIterator>::value_type>)
4890 __glibcxx_requires_valid_range(__first, __last);
4891 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4893 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
4896 template<
typename _InputIterator1,
typename _InputIterator2,
4897 typename _OutputIterator,
typename _Compare>
4899 __merge(_InputIterator1 __first1, _InputIterator1 __last1,
4900 _InputIterator2 __first2, _InputIterator2 __last2,
4901 _OutputIterator __result, _Compare __comp)
4903 while (__first1 != __last1 && __first2 != __last2)
4905 if (__comp(__first2, __first1))
4907 *__result = *__first2;
4912 *__result = *__first1;
4917 return std::copy(__first2, __last2,
4918 std::copy(__first1, __last1, __result));
4940 template<
typename _InputIterator1,
typename _InputIterator2,
4941 typename _OutputIterator>
4942 inline _OutputIterator
4943 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4944 _InputIterator2 __first2, _InputIterator2 __last2,
4945 _OutputIterator __result)
4948 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4949 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
4950 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4951 typename iterator_traits<_InputIterator1>::value_type>)
4952 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4953 typename iterator_traits<_InputIterator2>::value_type>)
4954 __glibcxx_function_requires(_LessThanOpConcept<
4955 typename iterator_traits<_InputIterator2>::value_type,
4956 typename iterator_traits<_InputIterator1>::value_type>)
4957 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
4958 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
4959 __glibcxx_requires_irreflexive2(__first1, __last1);
4960 __glibcxx_requires_irreflexive2(__first2, __last2);
4962 return _GLIBCXX_STD_A::__merge(__first1, __last1,
4963 __first2, __last2, __result,
4964 __gnu_cxx::__ops::__iter_less_iter());
4990 template<
typename _InputIterator1,
typename _InputIterator2,
4991 typename _OutputIterator,
typename _Compare>
4992 inline _OutputIterator
4993 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4994 _InputIterator2 __first2, _InputIterator2 __last2,
4995 _OutputIterator __result, _Compare __comp)
4998 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4999 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5000 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5001 typename iterator_traits<_InputIterator1>::value_type>)
5002 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5003 typename iterator_traits<_InputIterator2>::value_type>)
5004 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5005 typename iterator_traits<_InputIterator2>::value_type,
5006 typename iterator_traits<_InputIterator1>::value_type>)
5007 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5008 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5009 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5010 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5012 return _GLIBCXX_STD_A::__merge(__first1, __last1,
5013 __first2, __last2, __result,
5014 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5017 template<
typename _RandomAccessIterator,
typename _Compare>
5019 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
5022 typedef typename iterator_traits<_RandomAccessIterator>::value_type
5024 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
5027 typedef _Temporary_buffer<_RandomAccessIterator, _ValueType> _TmpBuf;
5030 if (__buf.begin() == 0)
5033 std::__stable_sort_adaptive(__first, __last, __buf.begin(),
5034 _DistanceType(__buf.size()), __comp);
5054 template<
typename _RandomAccessIterator>
5056 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
5059 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
5060 _RandomAccessIterator>)
5061 __glibcxx_function_requires(_LessThanComparableConcept<
5062 typename iterator_traits<_RandomAccessIterator>::value_type>)
5063 __glibcxx_requires_valid_range(__first, __last);
5064 __glibcxx_requires_irreflexive(__first, __last);
5066 _GLIBCXX_STD_A::__stable_sort(__first, __last,
5067 __gnu_cxx::__ops::__iter_less_iter());
5088 template<
typename _RandomAccessIterator,
typename _Compare>
5090 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
5094 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
5095 _RandomAccessIterator>)
5096 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5097 typename iterator_traits<_RandomAccessIterator>::value_type,
5098 typename iterator_traits<_RandomAccessIterator>::value_type>)
5099 __glibcxx_requires_valid_range(__first, __last);
5100 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5102 _GLIBCXX_STD_A::__stable_sort(__first, __last,
5103 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5106 template<
typename _InputIterator1,
typename _InputIterator2,
5107 typename _OutputIterator,
5110 __set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5111 _InputIterator2 __first2, _InputIterator2 __last2,
5112 _OutputIterator __result, _Compare __comp)
5114 while (__first1 != __last1 && __first2 != __last2)
5116 if (__comp(__first1, __first2))
5118 *__result = *__first1;
5121 else if (__comp(__first2, __first1))
5123 *__result = *__first2;
5128 *__result = *__first1;
5134 return std::copy(__first2, __last2,
5135 std::copy(__first1, __last1, __result));
5157 template<
typename _InputIterator1,
typename _InputIterator2,
5158 typename _OutputIterator>
5159 inline _OutputIterator
5160 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5161 _InputIterator2 __first2, _InputIterator2 __last2,
5162 _OutputIterator __result)
5165 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5166 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5167 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5168 typename iterator_traits<_InputIterator1>::value_type>)
5169 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5170 typename iterator_traits<_InputIterator2>::value_type>)
5171 __glibcxx_function_requires(_LessThanOpConcept<
5172 typename iterator_traits<_InputIterator1>::value_type,
5173 typename iterator_traits<_InputIterator2>::value_type>)
5174 __glibcxx_function_requires(_LessThanOpConcept<
5175 typename iterator_traits<_InputIterator2>::value_type,
5176 typename iterator_traits<_InputIterator1>::value_type>)
5177 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5178 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5179 __glibcxx_requires_irreflexive2(__first1, __last1);
5180 __glibcxx_requires_irreflexive2(__first2, __last2);
5182 return _GLIBCXX_STD_A::__set_union(__first1, __last1,
5183 __first2, __last2, __result,
5184 __gnu_cxx::__ops::__iter_less_iter());
5207 template<
typename _InputIterator1,
typename _InputIterator2,
5208 typename _OutputIterator,
typename _Compare>
5209 inline _OutputIterator
5210 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5211 _InputIterator2 __first2, _InputIterator2 __last2,
5212 _OutputIterator __result, _Compare __comp)
5215 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5216 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5217 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5218 typename iterator_traits<_InputIterator1>::value_type>)
5219 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5220 typename iterator_traits<_InputIterator2>::value_type>)
5221 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5222 typename iterator_traits<_InputIterator1>::value_type,
5223 typename iterator_traits<_InputIterator2>::value_type>)
5224 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5225 typename iterator_traits<_InputIterator2>::value_type,
5226 typename iterator_traits<_InputIterator1>::value_type>)
5227 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5228 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5229 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5230 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5232 return _GLIBCXX_STD_A::__set_union(__first1, __last1,
5233 __first2, __last2, __result,
5234 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5237 template<
typename _InputIterator1,
typename _InputIterator2,
5238 typename _OutputIterator,
5241 __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5242 _InputIterator2 __first2, _InputIterator2 __last2,
5243 _OutputIterator __result, _Compare __comp)
5245 while (__first1 != __last1 && __first2 != __last2)
5246 if (__comp(__first1, __first2))
5248 else if (__comp(__first2, __first1))
5252 *__result = *__first1;
5278 template<
typename _InputIterator1,
typename _InputIterator2,
5279 typename _OutputIterator>
5280 inline _OutputIterator
5281 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5282 _InputIterator2 __first2, _InputIterator2 __last2,
5283 _OutputIterator __result)
5286 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5287 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5288 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5289 typename iterator_traits<_InputIterator1>::value_type>)
5290 __glibcxx_function_requires(_LessThanOpConcept<
5291 typename iterator_traits<_InputIterator1>::value_type,
5292 typename iterator_traits<_InputIterator2>::value_type>)
5293 __glibcxx_function_requires(_LessThanOpConcept<
5294 typename iterator_traits<_InputIterator2>::value_type,
5295 typename iterator_traits<_InputIterator1>::value_type>)
5296 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5297 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5298 __glibcxx_requires_irreflexive2(__first1, __last1);
5299 __glibcxx_requires_irreflexive2(__first2, __last2);
5301 return _GLIBCXX_STD_A::__set_intersection(__first1, __last1,
5302 __first2, __last2, __result,
5303 __gnu_cxx::__ops::__iter_less_iter());
5327 template<
typename _InputIterator1,
typename _InputIterator2,
5328 typename _OutputIterator,
typename _Compare>
5329 inline _OutputIterator
5330 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5331 _InputIterator2 __first2, _InputIterator2 __last2,
5332 _OutputIterator __result, _Compare __comp)
5335 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5336 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5337 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5338 typename iterator_traits<_InputIterator1>::value_type>)
5339 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5340 typename iterator_traits<_InputIterator1>::value_type,
5341 typename iterator_traits<_InputIterator2>::value_type>)
5342 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5343 typename iterator_traits<_InputIterator2>::value_type,
5344 typename iterator_traits<_InputIterator1>::value_type>)
5345 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5346 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5347 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5348 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5350 return _GLIBCXX_STD_A::__set_intersection(__first1, __last1,
5351 __first2, __last2, __result,
5352 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5355 template<
typename _InputIterator1,
typename _InputIterator2,
5356 typename _OutputIterator,
5359 __set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5360 _InputIterator2 __first2, _InputIterator2 __last2,
5361 _OutputIterator __result, _Compare __comp)
5363 while (__first1 != __last1 && __first2 != __last2)
5364 if (__comp(__first1, __first2))
5366 *__result = *__first1;
5370 else if (__comp(__first2, __first1))
5377 return std::copy(__first1, __last1, __result);
5400 template<
typename _InputIterator1,
typename _InputIterator2,
5401 typename _OutputIterator>
5402 inline _OutputIterator
5403 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5404 _InputIterator2 __first2, _InputIterator2 __last2,
5405 _OutputIterator __result)
5408 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5409 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5410 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5411 typename iterator_traits<_InputIterator1>::value_type>)
5412 __glibcxx_function_requires(_LessThanOpConcept<
5413 typename iterator_traits<_InputIterator1>::value_type,
5414 typename iterator_traits<_InputIterator2>::value_type>)
5415 __glibcxx_function_requires(_LessThanOpConcept<
5416 typename iterator_traits<_InputIterator2>::value_type,
5417 typename iterator_traits<_InputIterator1>::value_type>)
5418 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5419 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5420 __glibcxx_requires_irreflexive2(__first1, __last1);
5421 __glibcxx_requires_irreflexive2(__first2, __last2);
5423 return _GLIBCXX_STD_A::__set_difference(__first1, __last1,
5424 __first2, __last2, __result,
5425 __gnu_cxx::__ops::__iter_less_iter());
5451 template<
typename _InputIterator1,
typename _InputIterator2,
5452 typename _OutputIterator,
typename _Compare>
5453 inline _OutputIterator
5454 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5455 _InputIterator2 __first2, _InputIterator2 __last2,
5456 _OutputIterator __result, _Compare __comp)
5459 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5460 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5461 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5462 typename iterator_traits<_InputIterator1>::value_type>)
5463 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5464 typename iterator_traits<_InputIterator1>::value_type,
5465 typename iterator_traits<_InputIterator2>::value_type>)
5466 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5467 typename iterator_traits<_InputIterator2>::value_type,
5468 typename iterator_traits<_InputIterator1>::value_type>)
5469 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5470 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5471 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5472 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5474 return _GLIBCXX_STD_A::__set_difference(__first1, __last1,
5475 __first2, __last2, __result,
5476 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5479 template<
typename _InputIterator1,
typename _InputIterator2,
5480 typename _OutputIterator,
5483 __set_symmetric_difference(_InputIterator1 __first1,
5484 _InputIterator1 __last1,
5485 _InputIterator2 __first2,
5486 _InputIterator2 __last2,
5487 _OutputIterator __result,
5490 while (__first1 != __last1 && __first2 != __last2)
5491 if (__comp(__first1, __first2))
5493 *__result = *__first1;
5497 else if (__comp(__first2, __first1))
5499 *__result = *__first2;
5508 return std::copy(__first2, __last2,
5509 std::copy(__first1, __last1, __result));
5530 template<
typename _InputIterator1,
typename _InputIterator2,
5531 typename _OutputIterator>
5532 inline _OutputIterator
5533 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5534 _InputIterator2 __first2, _InputIterator2 __last2,
5535 _OutputIterator __result)
5538 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5539 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5540 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5541 typename iterator_traits<_InputIterator1>::value_type>)
5542 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5543 typename iterator_traits<_InputIterator2>::value_type>)
5544 __glibcxx_function_requires(_LessThanOpConcept<
5545 typename iterator_traits<_InputIterator1>::value_type,
5546 typename iterator_traits<_InputIterator2>::value_type>)
5547 __glibcxx_function_requires(_LessThanOpConcept<
5548 typename iterator_traits<_InputIterator2>::value_type,
5549 typename iterator_traits<_InputIterator1>::value_type>)
5550 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5551 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5552 __glibcxx_requires_irreflexive2(__first1, __last1);
5553 __glibcxx_requires_irreflexive2(__first2, __last2);
5555 return _GLIBCXX_STD_A::__set_symmetric_difference(__first1, __last1,
5556 __first2, __last2, __result,
5557 __gnu_cxx::__ops::__iter_less_iter());
5581 template<
typename _InputIterator1,
typename _InputIterator2,
5582 typename _OutputIterator,
typename _Compare>
5583 inline _OutputIterator
5584 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5585 _InputIterator2 __first2, _InputIterator2 __last2,
5586 _OutputIterator __result,
5590 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5591 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5592 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5593 typename iterator_traits<_InputIterator1>::value_type>)
5594 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5595 typename iterator_traits<_InputIterator2>::value_type>)
5596 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5597 typename iterator_traits<_InputIterator1>::value_type,
5598 typename iterator_traits<_InputIterator2>::value_type>)
5599 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5600 typename iterator_traits<_InputIterator2>::value_type,
5601 typename iterator_traits<_InputIterator1>::value_type>)
5602 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5603 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5604 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5605 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5607 return _GLIBCXX_STD_A::__set_symmetric_difference(__first1, __last1,
5608 __first2, __last2, __result,
5609 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5612 template<
typename _ForwardIterator,
typename _Compare>
5613 _GLIBCXX14_CONSTEXPR
5615 __min_element(_ForwardIterator __first, _ForwardIterator __last,
5618 if (__first == __last)
5620 _ForwardIterator __result = __first;
5621 while (++__first != __last)
5622 if (__comp(__first, __result))
5634 template<
typename _ForwardIterator>
5635 _GLIBCXX14_CONSTEXPR
5637 inline min_element(_ForwardIterator __first, _ForwardIterator __last)
5640 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5641 __glibcxx_function_requires(_LessThanComparableConcept<
5642 typename iterator_traits<_ForwardIterator>::value_type>)
5643 __glibcxx_requires_valid_range(__first, __last);
5644 __glibcxx_requires_irreflexive(__first, __last);
5646 return _GLIBCXX_STD_A::__min_element(__first, __last,
5647 __gnu_cxx::__ops::__iter_less_iter());
5659 template<
typename _ForwardIterator,
typename _Compare>
5660 _GLIBCXX14_CONSTEXPR
5661 inline _ForwardIterator
5662 min_element(_ForwardIterator __first, _ForwardIterator __last,
5666 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5667 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5668 typename iterator_traits<_ForwardIterator>::value_type,
5669 typename iterator_traits<_ForwardIterator>::value_type>)
5670 __glibcxx_requires_valid_range(__first, __last);
5671 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5673 return _GLIBCXX_STD_A::__min_element(__first, __last,
5674 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5677 template<
typename _ForwardIterator,
typename _Compare>
5678 _GLIBCXX14_CONSTEXPR
5680 __max_element(_ForwardIterator __first, _ForwardIterator __last,
5683 if (__first == __last)
return __first;
5684 _ForwardIterator __result = __first;
5685 while (++__first != __last)
5686 if (__comp(__result, __first))
5698 template<
typename _ForwardIterator>
5699 _GLIBCXX14_CONSTEXPR
5700 inline _ForwardIterator
5701 max_element(_ForwardIterator __first, _ForwardIterator __last)
5704 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5705 __glibcxx_function_requires(_LessThanComparableConcept<
5706 typename iterator_traits<_ForwardIterator>::value_type>)
5707 __glibcxx_requires_valid_range(__first, __last);
5708 __glibcxx_requires_irreflexive(__first, __last);
5710 return _GLIBCXX_STD_A::__max_element(__first, __last,
5711 __gnu_cxx::__ops::__iter_less_iter());
5723 template<
typename _ForwardIterator,
typename _Compare>
5724 _GLIBCXX14_CONSTEXPR
5725 inline _ForwardIterator
5726 max_element(_ForwardIterator __first, _ForwardIterator __last,
5730 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5731 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5732 typename iterator_traits<_ForwardIterator>::value_type,
5733 typename iterator_traits<_ForwardIterator>::value_type>)
5734 __glibcxx_requires_valid_range(__first, __last);
5735 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5737 return _GLIBCXX_STD_A::__max_element(__first, __last,
5738 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5741 #if __cplusplus >= 201402L
5743 template<
typename _InputIterator,
typename _RandomAccessIterator,
5744 typename _Size,
typename _UniformRandomBitGenerator>
5745 _RandomAccessIterator
5748 _Size __n, _UniformRandomBitGenerator&& __g)
5751 using __param_type =
typename __distrib_type::param_type;
5752 __distrib_type __d{};
5753 _Size __sample_sz = 0;
5754 while (__first != __last && __sample_sz != __n)
5756 __out[__sample_sz++] = *__first;
5759 for (
auto __pop_sz = __sample_sz; __first != __last;
5760 ++__first, (void) ++__pop_sz)
5762 const auto __k = __d(__g, __param_type{0, __pop_sz});
5764 __out[__k] = *__first;
5766 return __out + __sample_sz;
5770 template<
typename _ForwardIterator,
typename _OutputIterator,
typename _Cat,
5771 typename _Size,
typename _UniformRandomBitGenerator>
5773 __sample(_ForwardIterator __first, _ForwardIterator __last,
5775 _OutputIterator __out, _Cat,
5776 _Size __n, _UniformRandomBitGenerator&& __g)
5779 using __param_type =
typename __distrib_type::param_type;
5784 __distrib_type __d{};
5786 __n =
std::min(__n, __unsampled_sz);
5791 const __uc_type __urngrange = __g.max() - __g.min();
5792 if (__urngrange / __uc_type(__unsampled_sz) >= __uc_type(__unsampled_sz))
5796 while (__n != 0 && __unsampled_sz >= 2)
5802 if (__p.
first < __n)
5804 *__out++ = *__first;
5810 if (__n == 0)
break;
5815 *__out++ = *__first;
5825 for (; __n != 0; ++__first)
5826 if (__d(__g, __param_type{0, --__unsampled_sz}) < __n)
5828 *__out++ = *__first;
5834 #if __cplusplus > 201402L
5835 #define __cpp_lib_sample 201603
5837 template<
typename _PopulationIterator,
typename _SampleIterator,
5838 typename _Distance,
typename _UniformRandomBitGenerator>
5840 sample(_PopulationIterator __first, _PopulationIterator __last,
5841 _SampleIterator __out, _Distance __n,
5842 _UniformRandomBitGenerator&& __g)
5844 using __pop_cat =
typename
5845 std::iterator_traits<_PopulationIterator>::iterator_category;
5846 using __samp_cat =
typename
5847 std::iterator_traits<_SampleIterator>::iterator_category;
5850 __or_<is_convertible<__pop_cat, forward_iterator_tag>,
5851 is_convertible<__samp_cat, random_access_iterator_tag>>::value,
5852 "output range must use a RandomAccessIterator when input range"
5853 " does not meet the ForwardIterator requirements");
5855 static_assert(is_integral<_Distance>::value,
5856 "sample size must be an integer type");
5858 typename iterator_traits<_PopulationIterator>::difference_type __d = __n;
5860 __sample(__first, __last, __pop_cat{}, __out, __samp_cat{}, __d,
5861 std::forward<_UniformRandomBitGenerator>(__g));
5866 _GLIBCXX_END_NAMESPACE_ALGO
5867 _GLIBCXX_END_NAMESPACE_VERSION