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 _InputIterator,
typename _RandomAccessIterator,
59 typename _Size,
typename _UniformRandomNumberGenerator>
61 __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag,
62 _RandomAccessIterator __out, random_access_iterator_tag,
63 _Size __n, _UniformRandomNumberGenerator&& __g)
66 using __param_type =
typename __distrib_type::param_type;
68 _Size __sample_sz = 0;
69 while (__first != __last && __sample_sz != __n)
70 __out[__sample_sz++] = *__first++;
71 for (
auto __pop_sz = __sample_sz; __first != __last;
72 ++__first, ++__pop_sz)
74 const auto __k = __d(__g, __param_type{0, __pop_sz});
76 __out[__k] = *__first;
78 return __out + __sample_sz;
82 template<
typename _ForwardIterator,
typename _OutputIterator,
typename _Cat,
83 typename _Size,
typename _UniformRandomNumberGenerator>
85 __sample(_ForwardIterator __first, _ForwardIterator __last,
87 _OutputIterator __out, _Cat,
88 _Size __n, _UniformRandomNumberGenerator&& __g)
91 using __param_type =
typename __distrib_type::param_type;
94 for (__n =
std::min(__n, __unsampled_sz); __n != 0; ++__first)
95 if (__d(__g, __param_type{0, --__unsampled_sz}) < __n)
104 template<
typename _PopulationIterator,
typename _SampleIterator,
105 typename _Distance,
typename _UniformRandomNumberGenerator>
107 sample(_PopulationIterator __first, _PopulationIterator __last,
108 _SampleIterator __out, _Distance __n,
109 _UniformRandomNumberGenerator&& __g)
111 using __pop_cat =
typename
112 std::iterator_traits<_PopulationIterator>::iterator_category;
113 using __samp_cat =
typename
114 std::iterator_traits<_SampleIterator>::iterator_category;
117 __or_<is_convertible<__pop_cat, forward_iterator_tag>,
118 is_convertible<__samp_cat, random_access_iterator_tag>>::value,
119 "output range must use a RandomAccessIterator when input range"
120 " does not meet the ForwardIterator requirements");
122 static_assert(is_integral<_Distance>::value,
123 "sample size must be an integer type");
125 return std::experimental::__sample(
126 __first, __last, __pop_cat{}, __out, __samp_cat{},
127 __n, std::forward<_UniformRandomNumberGenerator>(__g));
130 _GLIBCXX_END_NAMESPACE_VERSION
137 #endif // _GLIBCXX_EXPERIMENTAL_ALGORITHM
iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)
This does what you think it does.
ISO C++ entities toplevel namespace is std.
Uniform discrete distribution for random numbers.