20 #include <boost/random/mersenne_twister.hpp> 35 template <
class Integral1,
class Integral2>
36 Integral2
random(Integral1 low, Integral2 up) {
37 boost::uniform_int<>
range(low, up);
41 template <
class String>
44 toFill->resize(
random(0, maxSize));
45 for (
auto&
c : *toFill) {
50 template <
class String,
class Integral>
53 sprintf(&str[0],
"%ul", 10);
54 str.resize(strlen(str.c_str()));
58 std::list<char> lst(
random(0u, maxSize));
59 std::list<char>::iterator
i = lst.begin();
60 for (; i != lst.end(); ++
i) {
88 #define CONCAT(A, B) CONCAT_HELPER(A, B) 89 #define CONCAT_HELPER(A, B) A##B 90 #define BENCHFUN(F) CONCAT(CONCAT(BM_, F), CONCAT(_, VECTOR)) 91 #define TESTFUN(F) TEST(fbvector, CONCAT(F, VECTOR)) boost::random::mt19937 RandomT
—— Concurrent Priority Queue Implementation ——
Integral2 random(Integral1 low, Integral2 up)
int randomObject< int >()
constexpr Range< Iter > range(Iter first, Iter last)
void Num2String(String &str, Integral)
uint32_t randomNumberSeed()
std::list< char > RandomList(unsigned int maxSize)
void randomString(String *toFill, unsigned int maxSize=1000)