mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-16 10:49:05 +00:00
82 lines
3.1 KiB
C++
82 lines
3.1 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2015 Bolero MURAKAMI
|
|
https://github.com/bolero-MURAKAMI/Sprout
|
|
|
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
=============================================================================*/
|
|
#ifndef SPROUT_ALGORITHM_CXX14_SAMPLE_HPP
|
|
#define SPROUT_ALGORITHM_CXX14_SAMPLE_HPP
|
|
|
|
#include <iterator>
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/utility/forward.hpp>
|
|
#include <sprout/iterator/distance.hpp>
|
|
#include <sprout/workaround/detail/uniform_int_distribution.hpp>
|
|
#include HDR_ALGORITHM_MIN_MAX_SSCRISK_CEL_OR_SPROUT
|
|
|
|
namespace sprout {
|
|
namespace detail {
|
|
template<typename PopulationIterator, typename SampleIterator, typename Distance, typename URNG>
|
|
inline SPROUT_CXX14_CONSTEXPR SampleIterator
|
|
sample_impl(
|
|
PopulationIterator first, PopulationIterator last, std::input_iterator_tag*,
|
|
SampleIterator out, std::random_access_iterator_tag*,
|
|
Distance n, URNG&& g
|
|
)
|
|
{
|
|
typedef SPROUT_WORKAROUND_DETAIL_UNIFORM_INT_DISTRIBUTION<Distance> distribution_type;
|
|
typedef typename distribution_type::param_type param_type;
|
|
distribution_type dist = {};
|
|
Distance sample_size = 0;
|
|
while (first != last && sample_size != n) {
|
|
out[sample_size++] = *first++;
|
|
}
|
|
for (Distance pop_size = sample_size; first != last; ++first, ++pop_size) {
|
|
param_type const p(0, pop_size);
|
|
Distance const k = dist(g, p);
|
|
if (k < n) {
|
|
out[k] = *first;
|
|
}
|
|
}
|
|
return out + sample_size;
|
|
}
|
|
template<typename PopulationIterator, typename SampleIterator, typename Distance, typename URNG>
|
|
inline SPROUT_CXX14_CONSTEXPR SampleIterator
|
|
sample_impl(
|
|
PopulationIterator first, PopulationIterator last, std::forward_iterator_tag*,
|
|
SampleIterator out, std::output_iterator_tag*,
|
|
Distance n, URNG&& g
|
|
)
|
|
{
|
|
typedef SPROUT_WORKAROUND_DETAIL_UNIFORM_INT_DISTRIBUTION<Distance> distribution_type;
|
|
typedef typename distribution_type::param_type param_type;
|
|
distribution_type dist = {};
|
|
Distance unsampled_size = sprout::distance(first, last);
|
|
for (n = NS_SSCRISK_CEL_OR_SPROUT::min(n, unsampled_size); n != 0; ++first ) {
|
|
param_type const p(0, --unsampled_size);
|
|
if (dist(g, p) < n) {
|
|
*out++ = *first;
|
|
--n;
|
|
}
|
|
}
|
|
return out;
|
|
}
|
|
} // namespace detail
|
|
//
|
|
// sample
|
|
//
|
|
template<typename PopulationIterator, typename SampleIterator, typename Distance, typename URNG>
|
|
inline SPROUT_CXX14_CONSTEXPR SampleIterator
|
|
sample(PopulationIterator first, PopulationIterator last, SampleIterator out, Distance n, URNG&& g) {
|
|
typedef typename std::iterator_traits<PopulationIterator>::iterator_category* pop_category;
|
|
typedef typename std::iterator_traits<SampleIterator>::iterator_category* sample_category;
|
|
return sprout::detail::sample_impl(
|
|
first, last, pop_category(),
|
|
out, sample_category(),
|
|
n, SPROUT_FORWARD(URNG, g)
|
|
);
|
|
}
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_CXX14_SAMPLE_HPP
|