Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
112 changes: 56 additions & 56 deletions AvalancheTest.cpp
Original file line number Diff line number Diff line change
@@ -1,56 +1,56 @@
#include "AvalancheTest.h"
//-----------------------------------------------------------------------------
void PrintAvalancheDiagram ( int x, int y, int reps, double scale, int * bins )
{
const char * symbols = ".123456789X";
for(int i = 0; i < y; i++)
{
printf("[");
for(int j = 0; j < x; j++)
{
int k = (y - i) -1;
int bin = bins[k + (j*y)];
double b = double(bin) / double(reps);
b = fabs(b*2 - 1);
b *= scale;
int s = (int)floor(b*10);
if(s > 10) s = 10;
if(s < 0) s = 0;
printf("%c",symbols[s]);
}
printf("]\n");
}
}
//----------------------------------------------------------------------------
double maxBias ( std::vector<int> & counts, int reps )
{
double worst = 0;
for(int i = 0; i < (int)counts.size(); i++)
{
double c = double(counts[i]) / double(reps);
double d = fabs(c * 2 - 1);
if(d > worst)
{
worst = d;
}
}
return worst;
}
//-----------------------------------------------------------------------------
#include "AvalancheTest.h"

//-----------------------------------------------------------------------------

void PrintAvalancheDiagram ( int x, int y, int reps, double scale, int * bins )
{
const char * symbols = ".123456789X";

for(int i = 0; i < y; i++)
{
printf("[");
for(int j = 0; j < x; j++)
{
int k = (y - i) -1;

int bin = bins[k + (j*y)];

double b = double(bin) / double(reps);
b = fabs(b*2 - 1);

b *= scale;

int s = (int)floor(b*10);

if(s > 10) s = 10;
if(s < 0) s = 0;

printf("%c",symbols[s]);
}

printf("]\n");
}
}

//----------------------------------------------------------------------------

double maxBias ( std::vector<int> & counts, int reps )
{
double worst = 0;

for(int i = 0; i < (int)counts.size(); i++)
{
double c = double(counts[i]) / double(reps);

double d = fabs(c * 2 - 1);

if(d > worst)
{
worst = d;
}
}

return worst;
}

//-----------------------------------------------------------------------------
Loading