Click or drag to resize

Ran055 Class

Ran055: Knuth's shift and add random generator. Returns integer random numbers uniformly distributed within [0,2147483647] DON'T USE THIS GENERATOR IN SERIOUS APPLICATIONS BECAUSE IT HAS SERIOUS CORRELATIONS.
Inheritance Hierarchy
SystemObject
  Altaxo.Calc.Probability.OldRandomGenerator
    Altaxo.Calc.Probability.OldRan055

Namespace: Altaxo.Calc.Probability.Old
Assembly: AltaxoCore (in AltaxoCore.dll) Version: 4.8.3179.0 (4.8.3179.0)
Syntax
C#
Copy
public class Ran055 : RandomGenerator

The Ran055 type exposes the following members.

Constructors
 NameDescription
Public methodRan055Initializes a new instance of the Ran055 class
Public methodRan055(UInt32)Initializes a new instance of the Ran055 class
Top
Properties
 NameDescription
Public propertyMaximumThe maximum value of the random number which can be returned.
(Inherited from RandomGenerator)
Public propertySeedThe seed value.
(Inherited from RandomGenerator)
Top
Methods
 NameDescription
Public methodEqualsDetermines whether the specified object is equal to the current object.
(Inherited from Object)
Protected methodFinalizeAllows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.
(Inherited from Object)
Public methodGetHashCodeServes as the default hash function.
(Inherited from Object)
Public methodGetTypeGets the Type of the current instance.
(Inherited from Object)
Public methodLong
(Overrides RandomGeneratorLong)
Protected methodMemberwiseCloneCreates a shallow copy of the current Object.
(Inherited from Object)
Public methodToStringReturns a string that represents the current object.
(Inherited from Object)
Top
Fields
 NameDescription
Protected fieldmax_valUniform long int values within [0...max_val].
(Inherited from RandomGenerator)
Protected fieldseedThe seed of the random generator.
(Inherited from RandomGenerator)
Top
Remarks
C#
Copy
    - The period is 2^55 = 36 028 797 018 963 968 > 3.6*10^16.

   - At least 32 bit long int is required, but works with any larger
word lengths
   - This is a lagged Fibonacci generator:
       x(n) =  ( x(n-55) - x(n-24) ) mod 2^31
   - Reference:
     A version of this pseudrandom number generator is described in
     J. Bentley's column, "The Software Exploratorium", Unix Review 1991.
     It is based on Algorithm A in D. E. Knuth, The Art of Computer-
     Programming, Vol 2, Section 3.2.2, pp. 172
See Also