/*============================================================================= Copyright (c) 2011-2014 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_RANDOM_LINEAR_CONGRUENTIAL_HPP #define SPROUT_RANDOM_LINEAR_CONGRUENTIAL_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace sprout { namespace random { // // linear_congruential_engine // template class linear_congruential_engine { static_assert(sprout::numeric_limits::is_integer, "sprout::numeric_limits::is_integer"); static_assert(m == 0 || a < m, "m == 0 || a < m"); static_assert(m == 0 || c < m, "m == 0 || c < m"); public: typedef UIntType result_type; private: struct private_construct_t {}; public: SPROUT_STATIC_CONSTEXPR result_type multiplier = a; SPROUT_STATIC_CONSTEXPR result_type increment = c; SPROUT_STATIC_CONSTEXPR result_type modulus = m; SPROUT_STATIC_CONSTEXPR result_type default_seed = 1; public: static SPROUT_CONSTEXPR result_type static_min() SPROUT_NOEXCEPT { return increment == 0 ? 1 : 0; } static SPROUT_CONSTEXPR result_type static_max() SPROUT_NOEXCEPT { return modulus - 1; } private: 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 result_type init_seed_2(result_type x0) { return init_seed_3(increment == 0 && x0 == 0 ? 1 : 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 result_type init_seed(result_type x0 = default_seed) { return init_seed_1(modulus == 0 ? x0 : x0 % modulus); } template::value>::type = sprout::enabler> static SPROUT_CXX14_CONSTEXPR result_type init_seed(Sseq& seq) { return init_seed(sprout::random::detail::seed_one_int(seq)); } template::value>::type = sprout::enabler> static SPROUT_CONSTEXPR result_type init_seed(Sseq const& seq) { return init_seed(sprout::random::detail::seed_one_int(seq)); } template static SPROUT_CONSTEXPR result_type init_seed(InputIterator first, InputIterator last) { return init_seed(sprout::random::detail::get_one_int(first, last)); } private: result_type x_; private: SPROUT_CONSTEXPR linear_congruential_engine(result_type x, private_construct_t) : x_(x) {} SPROUT_CONSTEXPR sprout::random::random_result generate(result_type result) const { return sprout::random::random_result( result, linear_congruential_engine(result, private_construct_t()) ); } public: SPROUT_CONSTEXPR linear_congruential_engine() : x_(init_seed()) {} linear_congruential_engine(linear_congruential_engine const&) = default; explicit SPROUT_CONSTEXPR linear_congruential_engine(result_type x0) : x_(init_seed(x0)) {} template::value>::type = sprout::enabler> explicit SPROUT_CXX14_CONSTEXPR linear_congruential_engine(Sseq& seq) : x_(init_seed(seq)) {} template::value>::type = sprout::enabler> explicit SPROUT_CONSTEXPR linear_congruential_engine(Sseq const& seq) : x_(init_seed(seq)) {} template SPROUT_CONSTEXPR linear_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::value>::type = sprout::enabler> SPROUT_CXX14_CONSTEXPR void seed(Sseq& seq) { x_ = init_seed(seq); } template::value>::type = sprout::enabler> SPROUT_CXX14_CONSTEXPR void seed(Sseq const& seq) { x_ = init_seed(seq); } template 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(); } SPROUT_CONSTEXPR result_type max() const SPROUT_NOEXCEPT { return static_max(); } SPROUT_CXX14_CONSTEXPR result_type operator()() { x_ = sprout::random::detail::const_mod::mult_add(a, x_, c); return x_; } SPROUT_CONSTEXPR sprout::random::random_result const operator()() const { return generate(sprout::random::detail::const_mod::mult_add(a, x_, c)); } friend SPROUT_CONSTEXPR bool operator==(linear_congruential_engine const& lhs, linear_congruential_engine const& rhs) SPROUT_NOEXCEPT { return lhs.x_ == rhs.x_; } friend SPROUT_CONSTEXPR bool operator!=(linear_congruential_engine const& lhs, linear_congruential_engine const& rhs) SPROUT_NOEXCEPT { return !(lhs == rhs); } template friend SPROUT_NON_CONSTEXPR std::basic_istream& operator>>( std::basic_istream& lhs, linear_congruential_engine& rhs ) { result_type x; if (lhs >> x) { if (sprout::math::greater_equal(x, static_min()) && x <= static_max()) { rhs.x_ = x; } else { lhs.setstate(std::ios_base::failbit); } } return lhs; } template friend SPROUT_NON_CONSTEXPR std::basic_ostream& operator<<( std::basic_ostream& lhs, linear_congruential_engine const& rhs ) { return lhs << rhs.x_; } }; template SPROUT_CONSTEXPR_OR_CONST UIntType sprout::random::linear_congruential_engine::multiplier; template SPROUT_CONSTEXPR_OR_CONST UIntType sprout::random::linear_congruential_engine::increment; template SPROUT_CONSTEXPR_OR_CONST UIntType sprout::random::linear_congruential_engine::modulus; template SPROUT_CONSTEXPR_OR_CONST UIntType sprout::random::linear_congruential_engine::default_seed; // // minstd_rand0 // minstd_rand // typedef sprout::random::linear_congruential_engine minstd_rand0; typedef sprout::random::linear_congruential_engine minstd_rand; // // rand48 // class rand48 { public: typedef std::uint32_t result_type; private: struct private_construct_t {}; typedef sprout::random::linear_congruential_engine< std::uint64_t, std::uint64_t(0xDEECE66DUL) | (std::uint64_t(0x5) << 32), 0xB, std::uint64_t(1) << 48 > lcf_type; private: static SPROUT_CONSTEXPR result_type static_min() { return 0; } static SPROUT_CONSTEXPR result_type static_max() { return 0x7FFFFFFF; } static SPROUT_CONSTEXPR std::uint64_t cnv(std::uint32_t x) { return (static_cast(x) << 16) | 0x330e; } private: lcf_type lcf_; private: SPROUT_CONSTEXPR rand48(lcf_type const& lcf, private_construct_t) : lcf_(lcf) {} template SPROUT_CONSTEXPR sprout::random::random_result generate(EngineResult const& rnd) const { return sprout::random::random_result( static_cast(sprout::random::result(rnd)) >> 17, rand48(sprout::random::next(rnd), private_construct_t()) ); } public: SPROUT_CONSTEXPR rand48() : lcf_(cnv(static_cast(1))) {} explicit SPROUT_CONSTEXPR rand48(result_type x0) : lcf_(cnv(x0)) {} SPROUT_CONSTEXPR result_type min() const { return static_min(); } SPROUT_CONSTEXPR result_type max() const { return static_max(); } SPROUT_CXX14_CONSTEXPR result_type operator()() { return static_cast(static_cast(lcf_()) >> 17); } SPROUT_CONSTEXPR sprout::random::random_result const operator()() const { return generate(lcf_()); } friend SPROUT_CONSTEXPR bool operator==(rand48 const& lhs, rand48 const& rhs) { return lhs.lcf_ == rhs.lcf_; } friend SPROUT_CONSTEXPR bool operator!=(rand48 const& lhs, rand48 const& rhs) { return !(lhs == rhs); } template friend SPROUT_NON_CONSTEXPR std::basic_istream& operator>>( std::basic_istream& lhs, rand48& rhs ) { return lhs >> rhs.lcf_; } template friend SPROUT_NON_CONSTEXPR std::basic_ostream& operator<<( std::basic_ostream& lhs, rand48 const& rhs ) { return lhs << rhs.lcf_; } }; } // namespace random using sprout::random::linear_congruential_engine; using sprout::random::minstd_rand0; using sprout::random::minstd_rand; using sprout::random::rand48; } // namespace sprout #endif // #ifndef SPROUT_RANDOM_LINEAR_CONGRUENTIAL_HPP