mirror of
https://github.com/VCMP-SqMod/SqMod.git
synced 2025-01-31 18:07:14 +01:00
4a6bfc086c
Switched to POCO library for unified platform/library interface. Deprecated the external module API. It was creating more problems than solving. Removed most built-in libraries in favor of system libraries for easier maintenance. Cleaned and secured code with help from static analyzers.
150 lines
2.5 KiB
C++
150 lines
2.5 KiB
C++
//
|
|
// RandomTest.cpp
|
|
//
|
|
// Copyright (c) 2004-2006, Applied Informatics Software Engineering GmbH.
|
|
// and Contributors.
|
|
//
|
|
// SPDX-License-Identifier: BSL-1.0
|
|
//
|
|
|
|
|
|
#include "RandomTest.h"
|
|
#include "CppUnit/TestCaller.h"
|
|
#include "CppUnit/TestSuite.h"
|
|
#include "Poco/Random.h"
|
|
#include <vector>
|
|
#include <cmath>
|
|
|
|
|
|
using Poco::UInt32;
|
|
|
|
|
|
RandomTest::RandomTest(const std::string& name): CppUnit::TestCase(name)
|
|
{
|
|
}
|
|
|
|
|
|
RandomTest::~RandomTest()
|
|
{
|
|
}
|
|
|
|
|
|
void RandomTest::testSequence1()
|
|
{
|
|
Poco::Random rnd1;
|
|
Poco::Random rnd2;
|
|
rnd1.seed(12345);
|
|
rnd2.seed(12345);
|
|
for (int i = 0; i < 100; ++i)
|
|
{
|
|
assertTrue (rnd1.next() == rnd2.next());
|
|
}
|
|
}
|
|
|
|
|
|
void RandomTest::testSequence2()
|
|
{
|
|
Poco::Random rnd1;
|
|
Poco::Random rnd2;
|
|
rnd1.seed(12345);
|
|
rnd2.seed(54321);
|
|
|
|
bool equals = true;
|
|
for (int i = 0; i < 20; ++i)
|
|
{
|
|
if (rnd1.next() != rnd2.next())
|
|
{
|
|
equals = false;
|
|
break;
|
|
}
|
|
}
|
|
assertTrue (!equals);
|
|
}
|
|
|
|
|
|
void RandomTest::testDistribution1()
|
|
{
|
|
Poco::Random rnd;
|
|
rnd.seed(123456);
|
|
const int n = 11;
|
|
int d[n] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
|
|
for (int i = 0; i < 100; ++i)
|
|
{
|
|
d[rnd.next() % n] = 1;
|
|
}
|
|
int sum = 0;
|
|
for (int k = 0; k < n; ++k) sum += d[k];
|
|
|
|
assertTrue (sum == n);
|
|
}
|
|
|
|
|
|
void RandomTest::testDistribution2()
|
|
{
|
|
Poco::Random rnd;
|
|
rnd.seed();
|
|
const int n = 101;
|
|
std::vector<int> d(n, 0);
|
|
for (int i = 0; i < 10000; ++i)
|
|
{
|
|
d[rnd.next(n)]++;
|
|
}
|
|
int sum = 0;
|
|
for (int k = 0; k < n; ++k) sum += d[k];
|
|
int avg = sum/n;
|
|
int var = 0;
|
|
for (int k = 0; k < n; ++k) var += (d[k] - avg)*(d[k] - avg);
|
|
var /= n;
|
|
int sd = int(std::sqrt((double) var));
|
|
|
|
assertTrue (95 < avg && avg < 105);
|
|
assertTrue (sd < 15);
|
|
}
|
|
|
|
|
|
void RandomTest::testDistribution3()
|
|
{
|
|
Poco::Random rnd;
|
|
rnd.seed();
|
|
const int n = 101;
|
|
std::vector<int> d(n, 0);
|
|
for (int i = 0; i < 10000; ++i)
|
|
{
|
|
d[int(rnd.nextFloat()*n)]++;
|
|
}
|
|
int sum = 0;
|
|
for (int k = 0; k < n; ++k) sum += d[k];
|
|
int avg = sum/n;
|
|
int var = 0;
|
|
for (int k = 0; k < n; ++k) var += (d[k] - avg)*(d[k] - avg);
|
|
var /= n;
|
|
int sd = int(std::sqrt((double) var));
|
|
|
|
assertTrue (95 < avg && avg < 105);
|
|
assertTrue (sd < 15);
|
|
}
|
|
|
|
|
|
void RandomTest::setUp()
|
|
{
|
|
}
|
|
|
|
|
|
void RandomTest::tearDown()
|
|
{
|
|
}
|
|
|
|
|
|
CppUnit::Test* RandomTest::suite()
|
|
{
|
|
CppUnit::TestSuite* pSuite = new CppUnit::TestSuite("RandomTest");
|
|
|
|
CppUnit_addTest(pSuite, RandomTest, testSequence1);
|
|
CppUnit_addTest(pSuite, RandomTest, testSequence2);
|
|
CppUnit_addTest(pSuite, RandomTest, testDistribution1);
|
|
CppUnit_addTest(pSuite, RandomTest, testDistribution2);
|
|
CppUnit_addTest(pSuite, RandomTest, testDistribution3);
|
|
|
|
return pSuite;
|
|
}
|