Program Listing for File random.h

Return to documentation for file (/tmp/ws/src/marti_common/swri_math_util/include/swri_math_util/random.h)

// *****************************************************************************
//
// Copyright (c) 2014, Southwest Research Institute® (SwRI®)
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of Southwest Research Institute® (SwRI®) nor the
//       names of its contributors may be used to endorse or promote products
//       derived from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// *****************************************************************************

#ifndef MATH_UTIL_RANDOM_H_
#define MATH_UTIL_RANDOM_H_

#include <vector>

#include <boost/random/mersenne_twister.hpp>
#include <boost/random/uniform_int.hpp>
#include <boost/shared_ptr.hpp>
#include <boost/thread/mutex.hpp>

#ifdef BOOST_1_46
  #include <boost/nondet_random.hpp>
#else
  #include <boost/random/random_device.hpp>
#endif

namespace swri_math_util
{
  #ifdef BOOST_1_46
  namespace boost_random = boost;
  #else
  namespace boost_random = boost::random;
  #endif

  class RandomGenerator
  {
    public:
      explicit RandomGenerator(int32_t seed = -1);

      void GetUniformRandomSample(
        int32_t min,
        int32_t max,
        int32_t count,
        std::vector<int32_t>& sample);

    private:
      boost_random::random_device seed_;
      boost_random::mt19937 rng_;
      boost::mutex mutex_;
  };
  typedef boost::shared_ptr<RandomGenerator> RandomGeneratorPtr;

  template <class RNG>
  void GetUniformRandomSample(
    RNG& rng,
    int32_t min,
    int32_t max,
    int32_t count,
    std::vector<int32_t>& sample)
  {
    sample.clear();
    if (count < 0)
    {
      return;
    }

    if (min > max)
    {
      int32_t tmp = min;
      min = max;
      max = tmp;
    }

    int32_t range = (max - min) + 1;
    if (count > range)
    {
      count = range;
    }

    sample.resize(count);

    boost::uniform_int<> dist(min, max);
    for (int32_t i = 0; i < count; i++)
    {
      bool has_sample = false;
      while (!has_sample)
      {
        sample[i] = dist(rng);
        int32_t j;
        for (j = 0; j < i; j++)
        {
          if (sample[i] == sample[j]) break;
        }
        has_sample = j == i;
      }
    }
  }
}

#endif  // MATH_UTIL_RANDOM_H_