x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
linear_congruential.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\random\linear_congruential.hpp
旋转
特效
属性
历史版本
/* boost random/linear_congruential.hpp header file * * Copyright Jens Maurer 2000-2001 * 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) * * See http://www.boost.org for most recent version including documentation. * * $Id: linear_congruential.hpp 29116 2005-05-21 15:57:01Z dgregor $ * * Revision history * 2001-02-18 moved to individual header files */ #ifndef BOOST_RANDOM_LINEAR_CONGRUENTIAL_HPP #define BOOST_RANDOM_LINEAR_CONGRUENTIAL_HPP #include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace random { // compile-time configurable linear congruential generator template
class linear_congruential { public: typedef IntType result_type; #ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION static const bool has_fixed_range = true; static const result_type min_value = ( c == 0 ? 1 : 0 ); static const result_type max_value = m-1; #else BOOST_STATIC_CONSTANT(bool, has_fixed_range = false); #endif BOOST_STATIC_CONSTANT(IntType, multiplier = a); BOOST_STATIC_CONSTANT(IntType, increment = c); BOOST_STATIC_CONSTANT(IntType, modulus = m); // MSVC 6 and possibly others crash when encountering complicated integral // constant expressions. Avoid the check for now. // BOOST_STATIC_ASSERT(m == 0 || a < m); // BOOST_STATIC_ASSERT(m == 0 || c < m); explicit linear_congruential(IntType x0 = 1) : _modulus(modulus), _x(_modulus ? (x0 % _modulus) : x0) { assert(c || x0); /* if c == 0 and x(0) == 0 then x(n) = 0 for all n */ // overflow check // disabled because it gives spurious "divide by zero" gcc warnings // assert(m == 0 || (a*(m-1)+c) % m == (c < a ? c-a+m : c-a)); // MSVC fails BOOST_STATIC_ASSERT with std::numeric_limits at class scope #ifndef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS BOOST_STATIC_ASSERT(std::numeric_limits
::is_integer); #endif } template
linear_congruential(It& first, It last) { seed(first, last); } // compiler-generated copy constructor and assignment operator are fine void seed(IntType x0 = 1) { assert(c || x0); _x = (_modulus ? (x0 % _modulus) : x0); } template
void seed(It& first, It last) { if(first == last) throw std::invalid_argument("linear_congruential::seed"); IntType value = *first++; _x = (_modulus ? (value % _modulus) : value); } result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () const { return c == 0 ? 1 : 0; } result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () const { return modulus-1; } IntType operator()() { _x = const_mod
::mult_add(a, _x, c); return _x; } static bool validation(IntType x) { return val == x; } #ifdef BOOST_NO_OPERATORS_IN_NAMESPACE // Use a member function; Streamable concept not supported. bool operator==(const linear_congruential& rhs) const { return _x == rhs._x; } bool operator!=(const linear_congruential& rhs) const { return !(*this == rhs); } #else friend bool operator==(const linear_congruential& x, const linear_congruential& y) { return x._x == y._x; } friend bool operator!=(const linear_congruential& x, const linear_congruential& y) { return !(x == y); } #if !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) && !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551)) template
friend std::basic_ostream
& operator<<(std::basic_ostream
& os, const linear_congruential& lcg) { return os << lcg._x; } template
friend std::basic_istream
& operator>>(std::basic_istream
& is, linear_congruential& lcg) { return is >> lcg._x; } private: #endif #endif IntType _modulus; // work-around for gcc "divide by zero" warning in ctor IntType _x; }; // probably needs the "no native streams" caveat for STLPort #if !defined(__SGI_STL_PORT) && BOOST_WORKAROUND(__GNUC__, == 2) template
std::ostream& operator<<(std::ostream& os, const linear_congruential
& lcg) { return os << lcg._x; } template
std::istream& operator>>(std::istream& is, linear_congruential
& lcg) { return is >> lcg._x; } #elif defined(BOOST_NO_OPERATORS_IN_NAMESPACE) || defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551)) template
std::basic_ostream
& operator<<(std::basic_ostream
& os, const linear_congruential
& lcg) { return os << lcg._x; } template
std::basic_istream
& operator>>(std::basic_istream
& is, linear_congruential
& lcg) { return is >> lcg._x; } #endif #ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION // A definition is required even for integral static constants template
const bool linear_congruential
::has_fixed_range; template
const typename linear_congruential
::result_type linear_congruential
::min_value; template
const typename linear_congruential
::result_type linear_congruential
::max_value; template
const IntType linear_congruential
::modulus; #endif } // namespace random // validation values from the publications typedef random::linear_congruential
minstd_rand0; typedef random::linear_congruential
minstd_rand; #if !defined(BOOST_NO_INT64_T) && !defined(BOOST_NO_INTEGRAL_INT64_T) // emulate the lrand48() C library function; requires support for uint64_t class rand48 { public: typedef int32_t result_type; #ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION static const bool has_fixed_range = true; static const int32_t min_value = 0; static const int32_t max_value = integer_traits
::const_max; #else enum { has_fixed_range = false }; #endif int32_t min BOOST_PREVENT_MACRO_SUBSTITUTION () const { return 0; } int32_t max BOOST_PREVENT_MACRO_SUBSTITUTION () const { return std::numeric_limits
::max BOOST_PREVENT_MACRO_SUBSTITUTION (); } explicit rand48(int32_t x0 = 1) : lcf(cnv(x0)) { } explicit rand48(uint64_t x0) : lcf(x0) { } template
rand48(It& first, It last) : lcf(first, last) { } // compiler-generated copy ctor and assignment operator are fine void seed(int32_t x0 = 1) { lcf.seed(cnv(x0)); } void seed(uint64_t x0) { lcf.seed(x0); } template
void seed(It& first, It last) { lcf.seed(first,last); } int32_t operator()() { return static_cast
(lcf() >> 17); } // by experiment from lrand48() static bool validation(int32_t x) { return x == 1993516219; } #ifndef BOOST_NO_OPERATORS_IN_NAMESPACE #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS template
friend std::basic_ostream
& operator<<(std::basic_ostream
& os, const rand48& r) { os << r.lcf; return os; } template
friend std::basic_istream
& operator>>(std::basic_istream
& is, rand48& r) { is >> r.lcf; return is; } #endif friend bool operator==(const rand48& x, const rand48& y) { return x.lcf == y.lcf; } friend bool operator!=(const rand48& x, const rand48& y) { return !(x == y); } #else // Use a member function; Streamable concept not supported. bool operator==(const rand48& rhs) const { return lcf == rhs.lcf; } bool operator!=(const rand48& rhs) const { return !(*this == rhs); } #endif private: random::linear_congruential
lcf; static uint64_t cnv(int32_t x) { return (static_cast
(x) << 16) | 0x330e; } }; #endif /* !BOOST_NO_INT64_T && !BOOST_NO_INTEGRAL_INT64_T */ } // namespace boost #endif // BOOST_RANDOM_LINEAR_CONGRUENTIAL_HPP
linear_congruential.hpp
网页地址
文件地址
上一页
11/28
下一页
下载
( 9 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.