// ACG.h            -*- C++ -*-/* Copyright (C) 1988 Free Software Foundation    written by Dirk Grunwald (grunwald@cs.uiuc.edu)This file is part of the GNU C++ Library.  This library is freesoftware; you can redistribute it and/or modify it under the terms ofthe GNU Library General Public License as published by the FreeSoftware Foundation; either version 2 of the License, or (at youroption) any later version.  This library is distributed in the hopethat it will be useful, but WITHOUT ANY WARRANTY; without even theimplied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULARPURPOSE.  See the GNU Library General Public License for more details.You should have received a copy of the GNU Library General PublicLicense along with this library; if not, write to the Free SoftwareFoundation, 675 Mass Ave, Cambridge, MA 02139, USA.*/#ifndef _ACG_hhh#define _ACG_hhh 1 #include "RNG.h"#include <math.h>////	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 int initialSeed;	// used to reset generator    int initialTableEntry;    unsigned int *state;    unsigned int *auxState;    short stateSize;    short auxSize;    unsigned int lcgRecurr;    short j;    short k;protected:public:    ACG(unsigned int seed = 0, int size = 55);    virtual ~ACG();    //    // Return a long-words word of random bits    //    virtual unsigned int asLong();    virtual void reset();};#endif