KJB
|
Random number generator using the "RANLUX" algorithm, 24 bits. This implements the "RANLUX" algorithm of Luescher at single precision, i.e., meant for a float not a double. This is a "luxury random number" algorithm, i.e., slow. Nevertheless this one is "level 0" so it's the entry-level luxury model. Period is 10 ** 171. Defined using macro Gsl_rng_template. More...
#include <gsl_rng.h>
Additional Inherited Members | |
Public Member Functions inherited from kjb::Gsl_rng_basic< KIND > | |
Gsl_rng_basic (const gsl_rng_type *type) | |
ctor defines type – not meant to be called directly by users. More... | |
Gsl_rng_basic (const Gsl_rng_basic< KIND > &rng) | |
copy ctor of an RNG of the same kind More... | |
Gsl_rng_basic< KIND > & | operator= (const Gsl_rng_basic< KIND > &that) |
assignment operator from an RNG of the same kind More... | |
void | seed (unsigned long seed_val) const |
seed the generator to determine its future values More... | |
std::string | serialize () const |
take a snapshot of the generator state right now More... | |
void | deserialize (const std::string &state) const |
return generator to the state "snapshot" from serialize(). More... | |
unsigned long | get () const |
Sample uniformly distributed integers over a large range. More... | |
const char * | name () const |
return C-style string of the name of the generator algorithm. More... | |
unsigned long | max () const |
maximum possible value that get() can potentially return. More... | |
unsigned long | min () const |
minimum possible value that get() can potentially return. More... | |
double | uniform () const |
Sample uniformly distributed float in interval [0,1) More... | |
double | uniform_pos () const |
Sample uniformly distributed positive float in interval (0,1) More... | |
unsigned long | uniform_int (unsigned long end_value) const |
Sample uniformly dist. non-neg. integers less than end_value. More... | |
operator const gsl_rng * () const | |
return raw pointer to generator – needed by other GSL methods More... | |
Random number generator using the "RANLUX" algorithm, 24 bits. This implements the "RANLUX" algorithm of Luescher at single precision, i.e., meant for a float not a double. This is a "luxury random number" algorithm, i.e., slow. Nevertheless this one is "level 0" so it's the entry-level luxury model. Period is 10 ** 171. Defined using macro Gsl_rng_template.
< GSL_RNG_RANLXS0 >