/*
- * Copyright 2014 Facebook, Inc.
+ * Copyright 2017 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* limitations under the License.
*/
-#include "folly/Random.h"
+#include <folly/Random.h>
#include <glog/logging.h>
-#include <gtest/gtest.h>
#include <algorithm>
#include <thread>
#include <vector>
+#include <random>
+#include <unordered_set>
+
+#include <folly/portability/GTest.h>
using namespace folly;
+TEST(Random, StateSize) {
+ using namespace folly::detail;
+
+ // uint_fast32_t is uint64_t on x86_64, w00t
+ EXPECT_EQ(sizeof(uint_fast32_t) / 4 + 3,
+ StateSize<std::minstd_rand0>::value);
+ EXPECT_EQ(624, StateSize<std::mt19937>::value);
+#if FOLLY_HAVE_EXTRANDOM_SFMT19937
+ EXPECT_EQ(624, StateSize<__gnu_cxx::sfmt19937>::value);
+#endif
+ EXPECT_EQ(24, StateSize<std::ranlux24_base>::value);
+}
+
TEST(Random, Simple) {
uint32_t prev = 0, seed = 0;
for (int i = 0; i < 1024; ++i) {
}
}
+TEST(Random, FixedSeed) {
+ // clang-format off
+ struct ConstantRNG {
+ typedef uint32_t result_type;
+ result_type operator()() {
+ return 4; // chosen by fair dice roll.
+ // guaranteed to be random.
+ }
+ static constexpr result_type min() {
+ return std::numeric_limits<result_type>::min();
+ }
+ static constexpr result_type max() {
+ return std::numeric_limits<result_type>::max();
+ }
+ };
+ // clang-format on
+
+ ConstantRNG gen;
+
+ // Pick a constant random number...
+ auto value = Random::rand32(10, gen);
+
+ // Loop to make sure it really is constant.
+ for (int i = 0; i < 1024; ++i) {
+ auto result = Random::rand32(10, gen);
+ EXPECT_EQ(value, result);
+ }
+}
+
TEST(Random, MultiThreaded) {
- const int n = 1024;
+ const int n = 100;
std::vector<uint32_t> seeds(n);
std::vector<std::thread> threads;
for (int i = 0; i < n; ++i) {
EXPECT_LT(seeds[i], seeds[i+1]);
}
}
+
+TEST(Random, sanity) {
+ // edge cases
+ EXPECT_EQ(folly::Random::rand32(0), 0);
+ EXPECT_EQ(folly::Random::rand32(12, 12), 0);
+ EXPECT_EQ(folly::Random::rand64(0), 0);
+ EXPECT_EQ(folly::Random::rand64(12, 12), 0);
+
+ // 32-bit repeatability, uniqueness
+ constexpr int kTestSize = 1000;
+ {
+ std::vector<uint32_t> vals;
+ folly::Random::DefaultGenerator rng;
+ rng.seed(0xdeadbeef);
+ for (int i = 0; i < kTestSize; ++i) {
+ vals.push_back(folly::Random::rand32(rng));
+ }
+ rng.seed(0xdeadbeef);
+ for (int i = 0; i < kTestSize; ++i) {
+ EXPECT_EQ(vals[i], folly::Random::rand32(rng));
+ }
+ EXPECT_EQ(
+ vals.size(),
+ std::unordered_set<uint32_t>(vals.begin(), vals.end()).size());
+ }
+
+ // 64-bit repeatability, uniqueness
+ {
+ std::vector<uint64_t> vals;
+ folly::Random::DefaultGenerator rng;
+ rng.seed(0xdeadbeef);
+ for (int i = 0; i < kTestSize; ++i) {
+ vals.push_back(folly::Random::rand64(rng));
+ }
+ rng.seed(0xdeadbeef);
+ for (int i = 0; i < kTestSize; ++i) {
+ EXPECT_EQ(vals[i], folly::Random::rand64(rng));
+ }
+ EXPECT_EQ(
+ vals.size(),
+ std::unordered_set<uint32_t>(vals.begin(), vals.end()).size());
+ }
+}