29 #ifndef _GLIBCXX_EXPERIMENTAL_ALGORITHM
30 #define _GLIBCXX_EXPERIMENTAL_ALGORITHM 1
32 #pragma GCC system_header
34 #if __cplusplus <= 201103L
41 namespace std _GLIBCXX_VISIBILITY(default)
43 namespace experimental
45 inline namespace fundamentals_v1
47 _GLIBCXX_BEGIN_NAMESPACE_VERSION
49 template<
typename _ForwardIterator,
typename _Searcher>
50 inline _ForwardIterator
51 search(_ForwardIterator __first, _ForwardIterator __last,
52 const _Searcher& __searcher)
53 {
return __searcher(__first, __last); }
55 #define __cpp_lib_experimental_sample 201402
58 template<
typename _PopulationIterator,
typename _SampleIterator,
59 typename _Distance,
typename _UniformRandomNumberGenerator>
61 sample(_PopulationIterator __first, _PopulationIterator __last,
62 _SampleIterator __out, _Distance __n,
63 _UniformRandomNumberGenerator&& __g)
65 using __pop_cat =
typename
66 std::iterator_traits<_PopulationIterator>::iterator_category;
67 using __samp_cat =
typename
68 std::iterator_traits<_SampleIterator>::iterator_category;
71 __or_<is_convertible<__pop_cat, forward_iterator_tag>,
72 is_convertible<__samp_cat, random_access_iterator_tag>>::value,
73 "output range must use a RandomAccessIterator when input range"
74 " does not meet the ForwardIterator requirements");
76 static_assert(is_integral<_Distance>::value,
77 "sample size must be an integer type");
79 typename iterator_traits<_PopulationIterator>::difference_type __d = __n;
80 return std::__sample(__first, __last, __pop_cat{}, __out, __samp_cat{},
82 std::forward<_UniformRandomNumberGenerator>(__g));
85 _GLIBCXX_END_NAMESPACE_VERSION
92 #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.