#ifndef SPROUT_RANDOM_INVERSIVE_CONGRUENTIAL_HPP #define SPROUT_RANDOM_INVERSIVE_CONGRUENTIAL_HPP #include #include #include #include #include #include #include namespace sprout { namespace random { // // inversive_congruential_engine // template 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; private: static SPROUT_CONSTEXPR result_type static_min() { return b == 0 ? 1 : 0; } static SPROUT_CONSTEXPR result_type static_max() { return modulus - 1; } static SPROUT_CONSTEXPR bool arg_check_nothrow(IntType 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 generate(result_type result) const { return sprout::random::random_result( result, inversive_congruential_engine(result, private_constructor_tag()) ); } public: SPROUT_CONSTEXPR inversive_congruential_engine() : x_(init_seed(default_seed)) {} SPROUT_CONSTEXPR explicit inversive_congruential_engine(IntType const& x0) : x_(init_seed(x0)) {} SPROUT_CONSTEXPR result_type min() const { return static_min(); } SPROUT_CONSTEXPR result_type max() const { return static_max(); } SPROUT_CONSTEXPR sprout::random::random_result operator()() const { typedef sprout::random::detail::const_mod 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) { return lhs.x_ == rhs.x_; } friend SPROUT_CONSTEXPR bool operator!=(inversive_congruential_engine const& lhs, inversive_congruential_engine const& rhs) { return !(lhs == rhs); } template friend std::basic_istream& operator>>( std::basic_istream& 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 friend std::basic_ostream& operator<<( std::basic_ostream& lhs, inversive_congruential_engine const& rhs ) { return lhs << rhs.x_; } }; template SPROUT_CONSTEXPR IntType sprout::random::inversive_congruential_engine::multiplier; template SPROUT_CONSTEXPR IntType sprout::random::inversive_congruential_engine::increment; template SPROUT_CONSTEXPR IntType sprout::random::inversive_congruential_engine::modulus; template SPROUT_CONSTEXPR IntType sprout::random::inversive_congruential_engine::default_seed; // // hellekalek1995 // typedef sprout::random::inversive_congruential_engine hellekalek1995; } // namespace random using sprout::random::hellekalek1995; } // namespace sprout #endif // #ifndef SPROUT_RANDOM_INVERSIVE_CONGRUENTIAL_HPP