source: trunk/yat/random/random.cc @ 1118

// $Id: random.cc 1000 2007-12-23 20:09:15Z jari $

/*
  Copyright (C) 2005, 2006 Jari Häkkinen, Peter Johansson
  Copyright (C) 2007 Jari Häkkinen

  This file is part of the yat library, http://trac.thep.lu.se/yat

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

  The yat 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
  General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with this program; if not, write to the Free Software
  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  02111-1307, USA.
*/

#include "random.h"
#include "yat/statistics/Histogram.h"
#include "yat/utility/Exception.h"

#include <fstream>
#include <sstream>

namespace theplu {
namespace yat {
namespace random {

  RNG* RNG::instance_ = NULL;

  RNG::RNG(void)
  {
      // support rng/seed changes through environment vars
    if (!gsl_rng_env_setup())
      throw utility::GSL_error("RNG::RNG unknown generator");
    if (!(rng_=gsl_rng_alloc(gsl_rng_default)))
      throw utility::GSL_error("RNG::RNG failed to allocate memory");
  }


  RNG::~RNG(void)
  {
    gsl_rng_free(rng_);
    rng_=NULL;
  }

  
  RNG* RNG::instance(void)
  {
    if (!instance_)
      instance_=new RNG;
    return instance_;
  }


  u_long RNG::max(void) const
  {
    return gsl_rng_max(rng_);
  }


  u_long RNG::min(void) const
  {
    return gsl_rng_min(rng_);
  }


  std::string RNG::name(void) const
  {
    return gsl_rng_name(rng_);
  }


  const gsl_rng* RNG::rng(void) const
  {
    return rng_;
  }


  void RNG::seed(u_long s) const
  {
    gsl_rng_set(rng_,s);
  }


  u_long RNG::seed_from_devurandom(void)
  {
    u_char ulongsize=sizeof(u_long);
    char* buffer=new char[ulongsize];
    std::ifstream is("/dev/urandom");
    is.read(buffer,ulongsize);
    is.close();
    u_long s=0;
    for (u_int i=0; i<ulongsize; i++) {
      u_char ch=buffer[i];
      s+=ch<<((ulongsize-1-i)*8);
    }
    seed(s);
    return s;
  }


  int RNG::set_state(const RNG_state& state)
  {
    return gsl_rng_memcpy(rng_, state.rng());
  }

  // --------------------- RNG_state ----------------------------------

  RNG_state::RNG_state(const RNG* rng)
  {
    if (!(rng_ = gsl_rng_clone(rng->rng())))
      throw utility::GSL_error("RNG_state::RNG_state failed to allocate memory");
  }
  

  RNG_state::~RNG_state(void)
  {
    gsl_rng_free(rng_);
    rng_=NULL;
  }

  const gsl_rng* RNG_state::rng(void) const
  {
    return rng_;
  }

  // --------------------- Discrete distribtuions ---------------------

  Discrete::Discrete(void)
    : rng_(RNG::instance())
  {
  }

  
  Discrete::~Discrete(void)
  {
  }


  void Discrete::seed(u_long s) const
  {
    rng_->seed(s);
  }


  DiscreteGeneral::DiscreteGeneral(const statistics::Histogram& hist)
  {
    double* p = new double[ hist.nof_bins() ];
    for (size_t i=0; i<hist.nof_bins(); i++) 
      p[ i ] = hist[i];
    gen_ = gsl_ran_discrete_preproc( hist.nof_bins(), p );
    delete p;
    if (!gen_)
      throw utility::GSL_error("DiscreteGeneral::DiscreteGeneral failed to setup generator.");
  }


  DiscreteGeneral::~DiscreteGeneral(void)
  {
    if (gen_)
      gsl_ran_discrete_free( gen_ );
    gen_ = NULL;
  }


  u_long DiscreteGeneral::operator()(void) const
  {
    return gsl_ran_discrete(rng_->rng(), gen_);
  }


  DiscreteUniform::DiscreteUniform(u_long n)
    : range_(n)
  {
    if (range_>rng_->max()) {
      std::stringstream ss("DiscreteUniform::DiscreteUniform: ");
      ss << n << " is too large for RNG " << rng_->name();
      throw utility::GSL_error(ss.str());
    }
  }


  u_long DiscreteUniform::operator()(void) const
  {
    return (range_ ?
            gsl_rng_uniform_int(rng_->rng(), range_) : gsl_rng_get(rng_->rng()));
  }


  u_long DiscreteUniform::operator()(u_long n) const
  {
    // making sure that n is not larger than the range of the
    // underlying RNG
    if (n>rng_->max()) {
      std::stringstream ss("DiscreteUniform::operator(u_long): ");
      ss << n << " is too large for RNG " << rng_->name();
      throw utility::GSL_error(ss.str());
    }
    return gsl_rng_uniform_int(rng_->rng(),n);
  }


  Poisson::Poisson(const double m)
    : m_(m)
  {
  }

  u_long Poisson::operator()(void) const
  {
    return gsl_ran_poisson(rng_->rng(), m_);
  }


  u_long Poisson::operator()(const double m) const
  {
    return gsl_ran_poisson(rng_->rng(), m);
  }

  // --------------------- Continuous distribtuions ---------------------

  Continuous::Continuous(void)
    : rng_(RNG::instance())
  {
  }


  Continuous::~Continuous(void)
  {
  }


  void Continuous::seed(u_long s) const
  {
    rng_->seed(s);
  }


  ContinuousGeneral::ContinuousGeneral(const statistics::Histogram& hist)
    : discrete_(DiscreteGeneral(hist)), hist_(hist)
  {
  }


  double ContinuousGeneral::operator()(void) const
  {
    return hist_.observation_value(discrete_())+(u_()-0.5)*hist_.spacing();
  }

  double ContinuousUniform::operator()(void) const
  {
    return gsl_rng_uniform(rng_->rng());
  }


  Exponential::Exponential(const double m)
    : m_(m)
  {
  }


  double Exponential::operator()(void) const
  {
    return gsl_ran_exponential(rng_->rng(), m_);
  }


  double Exponential::operator()(const double m) const
  {
    return gsl_ran_exponential(rng_->rng(), m);
  }


  Gaussian::Gaussian(const double s, const double m)
    : m_(m), s_(s)
  {
  }


  double Gaussian::operator()(void) const
  {
    return gsl_ran_gaussian(rng_->rng(), s_)+m_;
  }


  double Gaussian::operator()(const double s) const
  {
    return gsl_ran_gaussian(rng_->rng(), s);
  }


  double Gaussian::operator()(const double s, const double m) const
  {
    return gsl_ran_gaussian(rng_->rng(), s)+m;
  }

}}} // of namespace random, yat, and theplu