29 #ifndef _GLIBCXX_EXPERIMENTAL_ALGORITHM
30 #define _GLIBCXX_EXPERIMENTAL_ALGORITHM 1
32 #pragma GCC system_header
34 #if __cplusplus >= 201402L
39 namespace std _GLIBCXX_VISIBILITY(default)
41 namespace experimental
43 inline namespace fundamentals_v1
45 _GLIBCXX_BEGIN_NAMESPACE_VERSION
47 template<
typename _ForwardIterator,
typename _Searcher>
48 inline _ForwardIterator
49 search(_ForwardIterator __first, _ForwardIterator __last,
50 const _Searcher& __searcher)
51 {
return __searcher(__first, __last); }
53 #define __cpp_lib_experimental_sample 201402
56 template<
typename _PopulationIterator,
typename _SampleIterator,
57 typename _Distance,
typename _UniformRandomNumberGenerator>
59 sample(_PopulationIterator __first, _PopulationIterator __last,
60 _SampleIterator __out, _Distance __n,
61 _UniformRandomNumberGenerator&& __g)
63 using __pop_cat =
typename
64 std::iterator_traits<_PopulationIterator>::iterator_category;
65 using __samp_cat =
typename
66 std::iterator_traits<_SampleIterator>::iterator_category;
69 __or_<is_convertible<__pop_cat, forward_iterator_tag>,
70 is_convertible<__samp_cat, random_access_iterator_tag>>::value,
71 "output range must use a RandomAccessIterator when input range"
72 " does not meet the ForwardIterator requirements");
74 static_assert(is_integral<_Distance>::value,
75 "sample size must be an integer type");
77 typename iterator_traits<_PopulationIterator>::difference_type __d = __n;
78 return std::__sample(__first, __last, __pop_cat{}, __out, __samp_cat{},
80 std::forward<_UniformRandomNumberGenerator>(__g));
83 _GLIBCXX_END_NAMESPACE_VERSION
90 #endif // _GLIBCXX_EXPERIMENTAL_ALGORITHM
_RandomAccessIterator __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator __out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator &&__g)
Reservoir sampling algorithm.