30#ifndef _GLIBCXX_EXPERIMENTAL_ALGORITHM
31#define _GLIBCXX_EXPERIMENTAL_ALGORITHM 1
34#pragma GCC system_header
39#if __cplusplus >= 201402L
45namespace std _GLIBCXX_VISIBILITY(default)
47_GLIBCXX_BEGIN_NAMESPACE_VERSION
51inline namespace fundamentals_v2
53 template<
typename _ForwardIterator,
typename _Searcher>
54 inline _ForwardIterator
55 search(_ForwardIterator __first, _ForwardIterator __last,
56 const _Searcher& __searcher)
57 {
return __searcher(__first, __last); }
59#define __cpp_lib_experimental_sample 201402
62 template<
typename _PopulationIterator,
typename _SampleIterator,
63 typename _Distance,
typename _UniformRandomNumberGenerator>
65 sample(_PopulationIterator __first, _PopulationIterator __last,
66 _SampleIterator __out, _Distance __n,
67 _UniformRandomNumberGenerator&& __g)
69 using __pop_cat =
typename
71 using __samp_cat =
typename
75 __or_<is_convertible<__pop_cat, forward_iterator_tag>,
77 "output range must use a RandomAccessIterator when input range"
78 " does not meet the ForwardIterator requirements");
81 "sample size must be an integer type");
84 return _GLIBCXX_STD_A::
85 __sample(__first, __last, __pop_cat{}, __out, __samp_cat{}, __d,
86 std::forward<_UniformRandomNumberGenerator>(__g));
89 template<
typename _PopulationIterator,
typename _SampleIterator,
91 inline _SampleIterator
92 sample(_PopulationIterator __first, _PopulationIterator __last,
93 _SampleIterator __out, _Distance __n)
95 return experimental::sample(__first, __last, __out, __n,
99 template<
typename _RandomAccessIterator>
101 shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
102 {
return std::shuffle(__first, __last, _S_randint_engine()); }
107_GLIBCXX_END_NAMESPACE_VERSION
ISO C++ entities toplevel namespace is std.
Traits class for iterators.