30#ifndef _GLIBCXX_EXPERIMENTAL_ALGORITHM
31#define _GLIBCXX_EXPERIMENTAL_ALGORITHM 1
33#pragma GCC system_header
37#if __cplusplus >= 201402L
43namespace std _GLIBCXX_VISIBILITY(default)
45_GLIBCXX_BEGIN_NAMESPACE_VERSION
49inline namespace fundamentals_v2
51 template<
typename _ForwardIterator,
typename _Searcher>
52 inline _ForwardIterator
53 search(_ForwardIterator __first, _ForwardIterator __last,
54 const _Searcher& __searcher)
55 {
return __searcher(__first, __last); }
57#define __cpp_lib_experimental_sample 201402
60 template<
typename _PopulationIterator,
typename _SampleIterator,
61 typename _Distance,
typename _UniformRandomNumberGenerator>
63 sample(_PopulationIterator __first, _PopulationIterator __last,
64 _SampleIterator __out, _Distance __n,
65 _UniformRandomNumberGenerator&& __g)
67 using __pop_cat =
typename
69 using __samp_cat =
typename
73 __or_<is_convertible<__pop_cat, forward_iterator_tag>,
75 "output range must use a RandomAccessIterator when input range"
76 " does not meet the ForwardIterator requirements");
79 "sample size must be an integer type");
82 return _GLIBCXX_STD_A::
83 __sample(__first, __last, __pop_cat{}, __out, __samp_cat{}, __d,
84 std::forward<_UniformRandomNumberGenerator>(__g));
87 template<
typename _PopulationIterator,
typename _SampleIterator,
89 inline _SampleIterator
90 sample(_PopulationIterator __first, _PopulationIterator __last,
91 _SampleIterator __out, _Distance __n)
93 return experimental::sample(__first, __last, __out, __n,
97 template<
typename _RandomAccessIterator>
99 shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
100 {
return std::shuffle(__first, __last, _S_randint_engine()); }
105_GLIBCXX_END_NAMESPACE_VERSION
ISO C++ entities toplevel namespace is std.
Traits class for iterators.