// @(#)root/base:$Name: $:$Id: TRandom3.cxx,v 1.6 2004/11/24 17:49:08 brun Exp $
// Author: Peter Malzacher 31/08/99
//////////////////////////////////////////////////////////////////////////
//
// TRandom3
//
// Random number generator class based on
// M. Matsumoto and T. Nishimura,
// Mersenne Twistor: A 623-diminsionally equidistributed
// uniform pseudorandom number generator
// ACM Transactions on Modeling and Computer Simulation,
// Vol. 8, No. 1, January 1998, pp 3--30.
//
// For more information see the Mersenne Twistor homepage
// http://www.math.keio.ac.jp/~matumoto/emt.html
//
// Advantage: large period 2**19937-1
// relativly fast
// (only two times slower than TRandom, but
// two times faster than TRandom2)
// Drawback: a relative large internal state of 624 integers
//
//
// Aug.99 ROOT implementation based on CLHEP by P.Malzacher
//
// the original code contains the following copyright notice:
/* This library is free software; you can redistribute it and/or */
/* modify it under the terms of the GNU Library General Public */
/* License as published by the Free Software Foundation; either */
/* version 2 of the License, or (at your option) any later */
/* version. */
/* This library is distributed in the hope that it will be useful, */
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. */
/* See the GNU Library General Public License for more details. */
/* You should have received a copy of the GNU Library General */
/* Public License along with this library; if not, write to the */
/* Free Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA */
/* 02111-1307 USA */
/* Copyright (C) 1997 Makoto Matsumoto and Takuji Nishimura. */
/* When you use this, send an email to: matumoto@math.keio.ac.jp */
/* with an appropriate reference to your work. */
/////////////////////////////////////////////////////////////////////
#include "TRandom3.h"
#include "TClass.h"
#include "TMath.h"
#include "TUUID.h"
ClassImp(TRandom3)
//______________________________________________________________________________
TRandom3::TRandom3(UInt_t seed)
{
//*-*-*-*-*-*-*-*-*-*-*default constructor*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
// If seed is 0, the seed is automatically computed via a TUUID object.
// In this case the seed is guaranteed to be unique in space and time.
SetName("Random3");
SetTitle("Random number generator: Mersenne Twistor");
SetSeed(seed);
}
//______________________________________________________________________________
TRandom3::~TRandom3()
{
//*-*-*-*-*-*-*-*-*-*-*default destructor*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
//*-* ==================
}
//______________________________________________________________________________
Double_t TRandom3::Rndm(Int_t)
{
// Machine independent random number generator.
// Produces uniformly-distributed floating points in [0,1]
// Method: Mersenne Twistor
UInt_t y;
const Int_t kM = 397;
const Int_t kN = 624;
const UInt_t kTemperingMaskB = 0x9d2c5680;
const UInt_t kTemperingMaskC = 0xefc60000;
const UInt_t kUpperMask = 0x80000000;
const UInt_t kLowerMask = 0x7fffffff;
const UInt_t kMatrixA = 0x9908b0df;
if (fCount624 >= kN) {
register Int_t i;
for (i=0; i < kN-kM; i++) {
y = (fMt[i] & kUpperMask) | (fMt[i+1] & kLowerMask);
fMt[i] = fMt[i+kM] ^ (y >> 1) ^ ((y & 0x1) ? kMatrixA : 0x0);
}
for ( ; i < kN-1 ; i++) {
y = (fMt[i] & kUpperMask) | (fMt[i+1] & kLowerMask);
fMt[i] = fMt[i+kM-kN] ^ (y >> 1) ^ ((y & 0x1) ? kMatrixA : 0x0);
}
y = (fMt[kN-1] & kUpperMask) | (fMt[0] & kLowerMask);
fMt[kN-1] = fMt[kM-1] ^ (y >> 1) ^ ((y & 0x1) ? kMatrixA : 0x0);
fCount624 = 0;
}
y = fMt[fCount624++];
y ^= (y >> 11);
y ^= ((y << 7 ) & kTemperingMaskB );
y ^= ((y << 15) & kTemperingMaskC );
y ^= (y >> 18);
if (y) return ( (Double_t) y * 2.3283064365386963e-10); // * Power(2,-32)
return Rndm();
}
//______________________________________________________________________________
void TRandom3::RndmArray(Int_t n, Float_t *array)
{
// Return an array of n random numbers uniformly distributed in ]0,1]
for(Int_t i=0; i<n; i++) array[i]=(Float_t)Rndm();
}
//______________________________________________________________________________
void TRandom3::RndmArray(Int_t n, Double_t *array)
{
// Return an array of n random numbers uniformly distributed in ]0,1]
for(Int_t i=0; i<n; i++) array[i]=Rndm();
}
//______________________________________________________________________________
void TRandom3::SetSeed(UInt_t seed)
{
// Set the random generator sequence
// if seed is 0 (default value) a TUUID is generated and used to fill
// the first 8 integers of the seed array.
// In this case the seed is guaranteed to be unique in space and time.
TRandom::SetSeed(seed);
fCount624 = 624;
Int_t i,j;
if (seed > 0) {
fMt[0] = fSeed;
j = 1;
} else {
TUUID uid;
UChar_t uuid[16];
uid.GetUUID(uuid);
for (i=0;i<8;i++) {
fMt[i] = uuid[2*i]*256 +uuid[2*i+1];
}
j = 9;
}
for(i=j; i<624; i++) {
fMt[i] = (69069 * fMt[i-1]) & 0xffffffff;
}
}
//______________________________________________________________________________
void TRandom3::Streamer(TBuffer &R__b)
{
// Stream an object of class TRandom3.
if (R__b.IsReading()) {
UInt_t R__s, R__c;
Version_t R__v = R__b.ReadVersion(&R__s, &R__c);
if (R__v > 1) {
TRandom3::Class()->ReadBuffer(R__b, this, R__v, R__s, R__c);
return;
}
//====process old versions before automatic schema evolution
TRandom::Streamer(R__b);
R__b.ReadStaticArray(fMt);
R__b >> fCount624;
R__b.CheckByteCount(R__s, R__c, TRandom3::IsA());
//====end of old versions
} else {
TRandom3::Class()->WriteBuffer(R__b,this);
}
}
ROOT page - Class index - Class Hierarchy - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.