mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-12-25 21:35:41 +00:00
144 lines
5.2 KiB
C++
144 lines
5.2 KiB
C++
#ifndef SPROUT_RANDOM_INVERSIVE_CONGRUENTIAL_HPP
|
|
#define SPROUT_RANDOM_INVERSIVE_CONGRUENTIAL_HPP
|
|
|
|
#include <cstdint>
|
|
#include <limits>
|
|
#include <ios>
|
|
#include <stdexcept>
|
|
#include <type_traits>
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/random/detail/const_mod.hpp>
|
|
#include <sprout/random/random_result.hpp>
|
|
|
|
namespace sprout {
|
|
namespace random {
|
|
//
|
|
// inversive_congruential_engine
|
|
//
|
|
template<typename IntType, IntType a, IntType b, IntType p>
|
|
class inversive_congruential_engine {
|
|
public:
|
|
typedef IntType result_type;
|
|
private:
|
|
struct private_constructor_tag {};
|
|
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;
|
|
public:
|
|
static SPROUT_CONSTEXPR result_type static_min() SPROUT_NOEXCEPT {
|
|
return b == 0 ? 1 : 0;
|
|
}
|
|
static SPROUT_CONSTEXPR result_type static_max() SPROUT_NOEXCEPT {
|
|
return modulus - 1;
|
|
}
|
|
private:
|
|
template<typename T>
|
|
static SPROUT_CONSTEXPR typename std::enable_if<!(b == 0) && std::is_unsigned<T>::value, bool>::type
|
|
arg_check_nothrow(T const& x0) {
|
|
return x0 <= static_max();
|
|
}
|
|
template<typename T>
|
|
static SPROUT_CONSTEXPR typename std::enable_if<!(!(b == 0) && std::is_unsigned<T>::value), bool>::type
|
|
arg_check_nothrow(T const& x0) {
|
|
return x0 >= static_min() && x0 <= static_max();
|
|
}
|
|
static SPROUT_CONSTEXPR IntType arg_check(IntType const& x0) {
|
|
return arg_check_nothrow(x0)
|
|
? x0
|
|
: throw std::invalid_argument(
|
|
"inversive_congruential_engine<>: invalid argument (x0 >= static_min() && x0 <= static_max())"
|
|
)
|
|
;
|
|
}
|
|
static SPROUT_CONSTEXPR IntType init_seed_2(IntType const& x0) {
|
|
return arg_check(increment == 0 && x0 == 0 ? 1 : x0);
|
|
}
|
|
static SPROUT_CONSTEXPR IntType init_seed_1(IntType const& x0) {
|
|
return init_seed_2(x0 <= 0 && x0 != 0 ? x0 + modulus : x0);
|
|
}
|
|
static SPROUT_CONSTEXPR IntType init_seed(IntType const& x0) {
|
|
return init_seed_1(modulus == 0 ? x0 : x0 % modulus);
|
|
}
|
|
private:
|
|
IntType x_;
|
|
private:
|
|
SPROUT_CONSTEXPR inversive_congruential_engine(IntType const& x, private_constructor_tag)
|
|
: x_(x)
|
|
{}
|
|
SPROUT_CONSTEXPR sprout::random::random_result<inversive_congruential_engine>
|
|
generate(result_type result) const {
|
|
return sprout::random::random_result<inversive_congruential_engine>(
|
|
result,
|
|
inversive_congruential_engine(result, private_constructor_tag())
|
|
);
|
|
}
|
|
public:
|
|
SPROUT_CONSTEXPR inversive_congruential_engine()
|
|
: x_(init_seed(default_seed))
|
|
{}
|
|
explicit SPROUT_CONSTEXPR inversive_congruential_engine(IntType const& x0)
|
|
: x_(init_seed(x0))
|
|
{}
|
|
SPROUT_CONSTEXPR result_type min() const SPROUT_NOEXCEPT {
|
|
return static_min();
|
|
}
|
|
SPROUT_CONSTEXPR result_type max() const SPROUT_NOEXCEPT {
|
|
return static_max();
|
|
}
|
|
SPROUT_CONSTEXPR sprout::random::random_result<inversive_congruential_engine> operator()() const {
|
|
typedef sprout::random::detail::const_mod<IntType, 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 {
|
|
return lhs.x_ == rhs.x_;
|
|
}
|
|
friend SPROUT_CONSTEXPR bool operator!=(inversive_congruential_engine const& lhs, inversive_congruential_engine const& rhs) SPROUT_NOEXCEPT {
|
|
return !(lhs == rhs);
|
|
}
|
|
template<typename Elem, typename Traits>
|
|
friend std::basic_istream<Elem, Traits>& operator>>(
|
|
std::basic_istream<Elem, Traits>& lhs,
|
|
inversive_congruential_engine& rhs
|
|
)
|
|
{
|
|
IntType x;
|
|
if (lhs >> x) {
|
|
if(arg_check_nothrow(x)) {
|
|
rhs.x_ = x;
|
|
} else {
|
|
lhs.setstate(std::ios_base::failbit);
|
|
}
|
|
}
|
|
return lhs;
|
|
}
|
|
template<typename Elem, typename Traits>
|
|
friend std::basic_ostream<Elem, Traits>& operator<<(
|
|
std::basic_ostream<Elem, Traits>& lhs,
|
|
inversive_congruential_engine const& rhs
|
|
)
|
|
{
|
|
return lhs << rhs.x_;
|
|
}
|
|
};
|
|
template<typename IntType, IntType a, IntType b, IntType p>
|
|
SPROUT_CONSTEXPR_OR_CONST IntType sprout::random::inversive_congruential_engine<IntType, a, b, p>::multiplier;
|
|
template<typename IntType, IntType a, IntType b, IntType p>
|
|
SPROUT_CONSTEXPR_OR_CONST IntType sprout::random::inversive_congruential_engine<IntType, a, b, p>::increment;
|
|
template<typename IntType, IntType a, IntType b, IntType p>
|
|
SPROUT_CONSTEXPR_OR_CONST IntType sprout::random::inversive_congruential_engine<IntType, a, b, p>::modulus;
|
|
template<typename IntType, IntType a, IntType b, IntType p>
|
|
SPROUT_CONSTEXPR_OR_CONST IntType sprout::random::inversive_congruential_engine<IntType, a, b, p>::default_seed;
|
|
|
|
//
|
|
// hellekalek1995
|
|
//
|
|
typedef sprout::random::inversive_congruential_engine<std::uint32_t, 9102, 2147483647 - 36884165, 2147483647> hellekalek1995;
|
|
} // namespace random
|
|
|
|
using sprout::random::inversive_congruential_engine;
|
|
using sprout::random::hellekalek1995;
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_RANDOM_INVERSIVE_CONGRUENTIAL_HPP
|