RandomNumberGenerator.hpp

/*

Copyright (C) University of Oxford, 2005-2011

University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.

This file is part of Chaste.

Chaste is free software: you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation, either version 2.1 of the License, or
(at your option) any later version.

Chaste 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 Lesser General Public
License for more details. The offer of Chaste under the terms of the
License is subject to the License being interpreted in accordance with
English Law and subject to any action against the University of Oxford
being under the jurisdiction of the English Courts.

You should have received a copy of the GNU Lesser General Public License
along with Chaste. If not, see <http://www.gnu.org/licenses/>.

*/

#ifndef RANDOMNUMBERGENERATORS_HPP_
#define RANDOMNUMBERGENERATORS_HPP_

#include "ChasteSerialization.hpp"
#include "SerializableSingleton.hpp"
#include <boost/serialization/split_member.hpp>

class RandomNumberGenerator : public SerializableSingleton<RandomNumberGenerator>
{
private:

    int mSeed;

    long unsigned mTimesCalled;

    static RandomNumberGenerator* mpInstance;

    double mWorkingMem1;

    double mWorkingMem2;

    double mWorkingMemW;

    double mRandNum2;

    bool mUseLastNum;

    friend class boost::serialization::access;
    template<class Archive>
    void save(Archive & archive, const unsigned int version) const
    {
        archive & mSeed;
        archive & mTimesCalled;
        archive & mUseLastNum;
        archive & mRandNum2;
    }

    template<class Archive>
    void load(Archive & archive, const unsigned int version)
    {
        archive & mSeed;
        archive & mTimesCalled;
        archive & mUseLastNum;
        archive & mRandNum2;

        // Reset the random number generator to use the correct seed
        srandom(mSeed);

        /*
         * Call it the correct number of times to put it in the same state
         * as it used to be.
         */
        for (long unsigned i=0; i<mTimesCalled; i++)
        {
            random();
        }
    }
    BOOST_SERIALIZATION_SPLIT_MEMBER()

protected:

    RandomNumberGenerator();

public:

    double StandardNormalRandomDeviate();

    double NormalRandomDeviate(double mean, double sd);

    double ranf();

    unsigned randMod(unsigned base);

    void Shuffle(unsigned num, std::vector<unsigned>& rValues);

    static RandomNumberGenerator* Instance();

    static void Destroy();

    void Reseed(int seed);
};

#endif /*RANDOMNUMBERGENERATORS_HPP_*/