75 lines
2.2 KiB
C
75 lines
2.2 KiB
C
|
// This may look like C code, but it is really -*- C++ -*-
|
||
|
/*
|
||
|
Copyright (C) 1988 Free Software Foundation
|
||
|
written by Dirk Grunwald (grunwald@cs.uiuc.edu)
|
||
|
|
||
|
This file is part of GNU CC.
|
||
|
|
||
|
GNU CC is distributed in the hope that it will be useful,
|
||
|
but WITHOUT ANY WARRANTY. No author or distributor
|
||
|
accepts responsibility to anyone for the consequences of using it
|
||
|
or for whether it serves any particular purpose or works at all,
|
||
|
unless he says so in writing. Refer to the GNU CC General Public
|
||
|
License for full details.
|
||
|
|
||
|
Everyone is granted permission to copy, modify and redistribute
|
||
|
GNU CC, but only under the conditions described in the
|
||
|
GNU CC General Public License. A copy of this license is
|
||
|
supposed to have been given to you along with GNU CC so you
|
||
|
can know your rights and responsibilities. It should be in a
|
||
|
file named COPYING. Among other things, the copyright notice
|
||
|
and this notice must be preserved on all copies.
|
||
|
*/
|
||
|
#ifndef _ACG_h
|
||
|
#define _ACG_h 1
|
||
|
|
||
|
#include <RNG.h>
|
||
|
#include <math.h>
|
||
|
#ifdef __GNUG__
|
||
|
#pragma once
|
||
|
#pragma interface
|
||
|
#endif
|
||
|
|
||
|
//
|
||
|
// Additive number generator. This method is presented in Volume II
|
||
|
// of The Art of Computer Programming by Knuth. I've coded the algorithm
|
||
|
// and have added the extensions by Andres Nowatzyk of CMU to randomize
|
||
|
// the result of algorithm M a bit by using an LCG & a spatial
|
||
|
// permutation table.
|
||
|
//
|
||
|
// The version presented uses the same constants for the LCG that Andres
|
||
|
// uses (chosen by trial & error). The spatial permutation table is
|
||
|
// the same size (it's based on word size). This is for 32-bit words.
|
||
|
//
|
||
|
// The ``auxillary table'' used by the LCG table varies in size, and
|
||
|
// is chosen to be the the smallest power of two which is larger than
|
||
|
// twice the size of the state table.
|
||
|
//
|
||
|
|
||
|
class ACG : public RNG {
|
||
|
|
||
|
unsigned long initialSeed; // used to reset generator
|
||
|
int initialTableEntry;
|
||
|
|
||
|
unsigned long *state;
|
||
|
unsigned long *auxState;
|
||
|
short stateSize;
|
||
|
short auxSize;
|
||
|
unsigned long lcgRecurr;
|
||
|
short j;
|
||
|
short k;
|
||
|
|
||
|
protected:
|
||
|
|
||
|
public:
|
||
|
ACG(unsigned long seed = 0, int size = 55);
|
||
|
virtual ~ACG();
|
||
|
//
|
||
|
// Return a long-words word of random bits
|
||
|
//
|
||
|
virtual unsigned long asLong();
|
||
|
virtual void reset();
|
||
|
};
|
||
|
|
||
|
#endif
|