mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-14 15:04:09 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

[sprout.random] add Sseq version: constructor, seed

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-11-09 17:39:57 +09:00
parent ab0731c4fc
commit b60a7aca9c
10 changed files with 495 additions and 152 deletions
Download patch file Download diff file Expand all files Collapse all files

72
sprout/random/inversive_congruential.hpp
View file

@ -14,6 +14,7 @@
#include <sprout/config.hpp>
#include <sprout/limits.hpp>
#include <sprout/random/detail/const_mod.hpp>
#include <sprout/random/detail/seed_impl.hpp>
#include <sprout/random/random_result.hpp>
#include <sprout/math/greater_equal.hpp>
#include <sprout/assert.hpp>
@ -30,33 +31,45 @@ namespace sprout {
private:
struct private_construct_t {};
public:
SPROUT_STATIC_CONSTEXPR IntType multiplier = a;
SPROUT_STATIC_CONSTEXPR IntType increment = b;
SPROUT_STATIC_CONSTEXPR IntType modulus = p;
SPROUT_STATIC_CONSTEXPR IntType default_seed = 1;
SPROUT_STATIC_CONSTEXPR result_type multiplier = a;
SPROUT_STATIC_CONSTEXPR result_type increment = b;
SPROUT_STATIC_CONSTEXPR result_type modulus = p;
SPROUT_STATIC_CONSTEXPR result_type default_seed = 1;
public:
static SPROUT_CONSTEXPR result_type static_min() SPROUT_NOEXCEPT {
return b == 0 ? 1 : 0;
return increment == 0 ? 1 : 0;
}
static SPROUT_CONSTEXPR result_type static_max() SPROUT_NOEXCEPT {
return modulus - 1;
}
static SPROUT_CONSTEXPR IntType init_seed_3(IntType const& x0) {
static SPROUT_CONSTEXPR result_type init_seed_3(result_type x0) {
return SPROUT_ASSERT(sprout::math::greater_equal(x0, static_min())), SPROUT_ASSERT(x0 <= static_max()), x0;
}
static SPROUT_CONSTEXPR IntType init_seed_2(IntType const& x0) {
static SPROUT_CONSTEXPR result_type init_seed_2(result_type x0) {
return init_seed_3(increment == 0 && x0 == 0 ? 1 : x0);
}
static SPROUT_CONSTEXPR IntType init_seed_1(IntType const& x0) {
static SPROUT_CONSTEXPR result_type init_seed_1(result_type x0) {
return init_seed_2(x0 <= 0 && x0 != 0 ? x0 + modulus : x0);
}
static SPROUT_CONSTEXPR IntType init_seed(IntType const& x0) {
static SPROUT_CONSTEXPR result_type init_seed(result_type x0 = default_seed) {
return init_seed_1(modulus == 0 ? x0 : x0 % modulus);
}
template<typename Sseq>
static SPROUT_CXX14_CONSTEXPR result_type init_seed(Sseq& seq) {
return init_seed(sprout::random::detail::seed_one_int<result_type, modulus>(seq));
}
template<typename Sseq>
static SPROUT_CONSTEXPR result_type init_seed(Sseq const& seq) {
return init_seed(sprout::random::detail::seed_one_int<result_type, modulus>(seq));
}
template<typename InputIterator>
static SPROUT_CONSTEXPR result_type init_seed(InputIterator first, InputIterator last) {
return init_seed(sprout::random::detail::get_one_int<result_type, modulus>(first, last));
}
private:
IntType x_;
result_type x_;
private:
SPROUT_CONSTEXPR inversive_congruential_engine(IntType const& x, private_construct_t)
SPROUT_CONSTEXPR inversive_congruential_engine(result_type x, private_construct_t)
: x_(x)
{}
SPROUT_CONSTEXPR sprout::random::random_result<inversive_congruential_engine>
@ -70,9 +83,36 @@ namespace sprout {
SPROUT_CONSTEXPR inversive_congruential_engine()
: x_(init_seed(default_seed))
{}
explicit SPROUT_CONSTEXPR inversive_congruential_engine(IntType const& x0)
explicit SPROUT_CONSTEXPR inversive_congruential_engine(result_type x0)
: x_(init_seed(x0))
{}
template<typename Sseq>
explicit SPROUT_CXX14_CONSTEXPR inversive_congruential_engine(Sseq& seq)
: x_(init_seed(seq))
{}
template<typename Sseq>
explicit SPROUT_CONSTEXPR inversive_congruential_engine(Sseq const& seq)
: x_(init_seed(seq))
{}
template<typename InputIterator>
SPROUT_CONSTEXPR inversive_congruential_engine(InputIterator first, InputIterator last)
: x_(init_seed(first, last))
{}
SPROUT_CXX14_CONSTEXPR void seed(result_type x0 = default_seed) {
x_ = init_seed(x0);
}
template<typename Sseq>
SPROUT_CXX14_CONSTEXPR void seed(Sseq& seq) {
x_ = init_seed(seq);
}
template<typename Sseq>
SPROUT_CXX14_CONSTEXPR void seed(Sseq const& seq) {
x_ = init_seed(seq);
}
template<typename InputIterator>
SPROUT_CXX14_CONSTEXPR void seed(InputIterator first, InputIterator last) {
x_ = init_seed(first, last);
}
SPROUT_CONSTEXPR result_type min() const SPROUT_NOEXCEPT {
return static_min();
}
@ -80,12 +120,12 @@ namespace sprout {
return static_max();
}
SPROUT_CXX14_CONSTEXPR result_type operator()() {
typedef sprout::random::detail::const_mod<IntType, p> do_mod;
typedef sprout::random::detail::const_mod<result_type, p> do_mod;
x_ = do_mod::mult_add(a, do_mod::invert(x_), b);
return x_;
}
SPROUT_CONSTEXPR sprout::random::random_result<inversive_congruential_engine> const operator()() const {
typedef sprout::random::detail::const_mod<IntType, p> do_mod;
typedef sprout::random::detail::const_mod<result_type, p> do_mod;
return generate(do_mod::mult_add(a, do_mod::invert(x_), b));
}
friend SPROUT_CONSTEXPR bool operator==(inversive_congruential_engine const& lhs, inversive_congruential_engine const& rhs) SPROUT_NOEXCEPT {
@ -100,7 +140,7 @@ namespace sprout {
inversive_congruential_engine& rhs
)
{
IntType x;
result_type x;
if (lhs >> x) {
if (sprout::math::greater_equal(x, static_min()) && x <= static_max()) {
rhs.x_ = x;
@ -131,7 +171,7 @@ namespace sprout {
//
// hellekalek1995
//
typedef sprout::random::inversive_congruential_engine<std::uint32_t, 9102, 2147483647 - 36884165, 2147483647> hellekalek1995;
typedef sprout::random::inversive_congruential_engine<std::uint_fast32_t, 9102, 2147483647 - 36884165, 2147483647> hellekalek1995;
} // namespace random
using sprout::random::inversive_congruential_engine;