mirror of
https://github.com/Cockatrice/Cockatrice.git
synced 2025-12-22 07:10:25 -08:00
Included SFMT RNG
This commit is contained in:
@@ -1,4 +1,33 @@
|
||||
#include "rng_abstract.h"
|
||||
#include "rng_qt.h"
|
||||
#include "rng_sfmt.h"
|
||||
#include <QDebug>
|
||||
|
||||
RNG_Abstract *rng = new RNG_Qt;
|
||||
RNG_Abstract *rng = new RNG_SFMT;
|
||||
|
||||
QVector<int> RNG_Abstract::makeNumbersVector(int n, int min, int max)
|
||||
{
|
||||
const int bins = max - min + 1;
|
||||
QVector<int> result(bins);
|
||||
for (int i = 0; i < n; ++i) {
|
||||
int number = getNumber(min, max);
|
||||
if ((number < min) || (number > max))
|
||||
qDebug() << "getNumber(" << min << "," << max << ") returned " << number;
|
||||
else
|
||||
result[number - min]++;
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
double RNG_Abstract::testRandom(const QVector<int> &numbers) const
|
||||
{
|
||||
int n = 0;
|
||||
for (int i = 0; i < numbers.size(); ++i)
|
||||
n += numbers[i];
|
||||
double expected = (double) n / (double) numbers.size();
|
||||
double chisq = 0;
|
||||
for (int i = 0; i < numbers.size(); ++i)
|
||||
chisq += ((double) numbers[i] - expected) * ((double) numbers[i] - expected) / expected;
|
||||
|
||||
return chisq;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user