random.h

Go to the documentation of this file.

// Copyright 2010-2018 Google LLC
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
 
#ifndef OR_TOOLS_BASE_RANDOM_H_
#define OR_TOOLS_BASE_RANDOM_H_
 
#include <random>
#include <string>
 
#include "absl/random/random.h"
#include "ortools/base/basictypes.h"
 
namespace operations_research {
 
// A wrapper around std::mt19937. Called ACMRandom for historical reasons.
class ACMRandom {
 public:
  explicit ACMRandom(int32 seed) : generator_(seed) {}
 
  // Unbounded generators.
  uint32 Next();
  uint64 Next64();
  uint64 Rand64() { return Next64(); }
  uint64 operator()() { return Next64(); }
 
  // Bounded generators.
  uint32 Uniform(uint32 n);
  uint64 operator()(uint64 val_max);
 
  // Seed management.
  void Reset(int32 seed) { generator_.seed(seed); }
  static int32 HostnamePidTimeSeed();
  static int32 DeterministicSeed();
 
  // C++11 goodies.
  typedef int64 difference_type;
  typedef uint64 result_type;
  static constexpr result_type min() { return 0; }
  static constexpr result_type max() { return kuint32max; }
 
 private:
  std::mt19937 generator_;
};
 
class MTRandom : public ACMRandom {
 public:
  explicit MTRandom(int32 seed) : ACMRandom(seed) {}
  // MTRandom also supports a std::string seed.
  explicit MTRandom(const std::string& str_seed)
      : ACMRandom(GenerateInt32SeedFromString(str_seed)) {}
 
  MTRandom() : ACMRandom(ACMRandom::HostnamePidTimeSeed()) {}
 
 private:
  int32 GenerateInt32SeedFromString(const std::string& str) {
    uint32 seed = 1234567;
    for (size_t i = 0; i < str.size(); ++i) {
      seed *= 1000003;  // prime
      seed += static_cast<uint32>(str[i]);
    }
    return seed >> 1;  // Will fit into an int32.
  }
};
 
}  // namespace operations_research
 
#endif  // OR_TOOLS_BASE_RANDOM_H_