/// <summary>
/// <summary>
public static void TestQuantileCalculation(String[] args)
{
int size = int.Parse(args[0]);
int b = int.Parse(args[1]);
int k = int.Parse(args[2]);
//cern.it.util.Log.enableLogging(args[3].Equals("log"));
int chunks = int.Parse(args[4]);
Boolean computeExactQuantilesAlso = args[5].Equals("exact");
Boolean doShuffle = args[6].Equals("shuffle");
double epsilon = Double.Parse(args[7]);
double delta = Double.Parse(args[8]);
int quantiles = int.Parse(args[9]);
long max_N = long.Parse(args[10]);
Console.WriteLine("free=" + Cern.Colt.Karnel.FreePhysicalMemorySize);
Console.WriteLine("total=" + Cern.Colt.Karnel.TotalVisibleMemorySize);
double[] phis = { 0.001, 0.01, 0.1, 0.5, 0.9, 0.99, 0.999, 1.0 };
//int quantiles = phis.Length;
Timer timer = new Timer();
Timer timer2 = new Timer();
IDoubleQuantileFinder approxFinder;
approxFinder = QuantileFinderFactory.NewDoubleQuantileFinder(false, max_N, epsilon, delta, quantiles, null);
Console.WriteLine(approxFinder);
//new UnknownApproximateDoubleQuantileFinder(b,k);
//approxFinder = new ApproximateDoubleQuantileFinder(b,k);
/*
double[] returnSamplingRate = new double[1];
long[] result = ApproximateQuantileFinder.computeBestBandK(size*chunks, epsilon, delta, quantiles, returnSamplingRate);
approxFinder = new ApproximateQuantileFinder((int) result[0], (int) result[1]);
Console.WriteLine("epsilon="+epsilon);
Console.WriteLine("delta="+delta);
Console.WriteLine("samplingRate="+returnSamplingRate[0]);
*/
IDoubleQuantileFinder exactFinder = QuantileFinderFactory.NewDoubleQuantileFinder(false, -1, 0.0, delta, quantiles, null);
Console.WriteLine(exactFinder);
DoubleArrayList list = new DoubleArrayList(size);
for (int chunk = 0; chunk < chunks; chunk++)
{
list.Clear();
int d = chunk * size;
timer2.Start();
for (int i = 0; i < size; i++)
{
list.Add((double)(i + d));
}
timer2.Stop();
//Console.WriteLine("unshuffled="+list);
if (doShuffle)
{
Timer timer3 = new Timer();
timer3.Start();
list.Shuffle();
Console.WriteLine("shuffling took " + timer3.Interval.ToString());
timer3.Stop();
}
//Console.WriteLine("shuffled="+list);
//list.sort();
//Console.WriteLine("sorted="+list);
timer.Start();
approxFinder.AddAllOf(list);
timer.Stop();
if (computeExactQuantilesAlso)
{
exactFinder.AddAllOf(list);
}
}
Console.WriteLine("list.Add() took" + timer2);
Console.WriteLine("approxFinder.Add() took" + timer);
//Console.WriteLine("free="+Cern.Colt.Karnel.FreePhysicalMemorySize);
//Console.WriteLine("total="+Cern.Colt.Karnel.TotalVisibleMemorySize);
timer.Stop();
timer.Start();
//approxFinder.close();
DoubleArrayList approxQuantiles = approxFinder.QuantileElements(new DoubleArrayList(phis));
Console.WriteLine(timer.Display);
timer.Stop();
Console.WriteLine("Phis=" + new DoubleArrayList(phis));
Console.WriteLine("ApproxQuantiles=" + approxQuantiles);
//Console.WriteLine("MaxLevel of full buffers="+maxLevelOfFullBuffers(approxFinder.bufferSet));
//Console.WriteLine("total buffers filled="+ approxFinder.totalBuffersFilled);
//Console.WriteLine("free="+Cern.Colt.Karnel.FreePhysicalMemorySize);
//Console.WriteLine("total="+Cern.Colt.Karnel.TotalVisibleMemorySize);
if (computeExactQuantilesAlso)
{
Console.WriteLine("Comparing with exact quantile computation...");
timer.Reset();
//exactFinder.close();
DoubleArrayList exactQuantiles = exactFinder.QuantileElements(new DoubleArrayList(phis));
Console.WriteLine(timer.Display);
timer.Stop();
Console.WriteLine("ExactQuantiles=" + exactQuantiles);
//double[] errors1 = errors1(exactQuantiles.ToArray(), approxQuantiles.ToArray());
//Console.WriteLine("Error1="+new DoubleArrayList(errors1));
/*
DoubleArrayList buffer = new DoubleArrayList((int)exactFinder.Count);
exactFinder.forEach(
new cern.colt.function.DoubleFunction() {
public void apply(double element) {
buffer.Add(element);
}
}
);
*/
DoubleArrayList observedEpsilons = ObservedEpsilonsAtPhis(new DoubleArrayList(phis), (ExactDoubleQuantileFinder)exactFinder, approxFinder, epsilon);
Console.WriteLine("observedEpsilons=" + observedEpsilons);
double element = 1000.0f;
Console.WriteLine("exact phi(" + element + ")=" + exactFinder.Phi(element));
Console.WriteLine("apprx phi(" + element + ")=" + approxFinder.Phi(element));
Console.WriteLine("exact elem(phi(" + element + "))=" + exactFinder.QuantileElements(new DoubleArrayList(new double[] { exactFinder.Phi(element) })));
Console.WriteLine("apprx elem(phi(" + element + "))=" + approxFinder.QuantileElements(new DoubleArrayList(new double[] { approxFinder.Phi(element) })));
}
}
public void TestMain()
{
var path = NUnit.Framework.TestContext.CurrentContext.TestDirectory + "\\TestResult\\QuantileFinderTest\\";
if (!Directory.Exists(path))
Directory.CreateDirectory(path);
var filename = path + "QuantileFinderTest.log";
//Boolean known_N;
//if (args==null) known_N = false;
//else known_N = new Boolean(args[0]).BooleanValue();
int[] quantiles = { 100, 10000 };
//int[] quantiles = {1,100,10000};
long[] sizes = { long.MaxValue, 1000000, 10000000, 100000000 };
double[] deltas = { 0.0, 0.1, 0.00001 };
//double[] deltas = {0.0, 0.001, 0.00001, 0.000001};
//double[] epsilons = {0.0, 0.01, 0.001, 0.0001, 0.00001};
double[] epsilons = { 0.0, 0.1, 0.01, 0.001, 0.0001, 0.00001, 0.000001 };
try
{
using (StreamWriter writer = new StreamWriter(filename))
{
//if (! known_N) sizes = new long[] {0};
writer.WriteLine("\n\n");
//if (known_N)
// Console.WriteLine("Computing b's and k's for KNOWN N");
//else
// Console.WriteLine("Computing b's and k's for UNKNOWN N");
writer.WriteLine("mem [System.Math.Round(elements/1000.0)]");
writer.WriteLine("***********************************");
Timer timer = new Timer();
timer.Start();
for (int q = 0; q < quantiles.Length; q++)
{
int p = quantiles[q];
writer.WriteLine("------------------------------");
writer.WriteLine("computing for p = " + p);
for (int s = 0; s < sizes.Length; s++)
{
long N = sizes[s];
writer.WriteLine(" ------------------------------");
writer.WriteLine(" computing for N = " + N);
for (int e = 0; e < epsilons.Length; e++)
{
double epsilon = epsilons[e];
writer.WriteLine(" ------------------------------");
writer.WriteLine(" computing for e = " + epsilon);
for (int d = 0; d < deltas.Length; d++)
{
double delta = deltas[d];
for (int knownCounter = 0; knownCounter < 2; knownCounter++)
{
Boolean known_N;
if (knownCounter == 0) known_N = true;
else known_N = false;
IDoubleQuantileFinder finder = QuantileFinderFactory.NewDoubleQuantileFinder(known_N, N, epsilon, delta, p, null);
//Console.WriteLine(finder.this.GetType().Name);
/*
double[] returnSamplingRate = new double[1];
long[] result;
if (known_N) {
result = QuantileFinderFactory.known_N_compute_B_and_K(N, epsilon, delta, p, returnSamplingRate);
}
else {
result = QuantileFinderFactory.unknown_N_compute_B_and_K(epsilon, delta, p);
long b1 = result[0];
long k1 = result[1];
if (N>=0) {
long[] resultKnown = QuantileFinderFactory.known_N_compute_B_and_K(N, epsilon, delta, p, returnSamplingRate);
long b2 = resultKnown[0];
long k2 = resultKnown[1];
if (b2 * k2 < b1 * k1) { // the KnownFinder is smaller
result = resultKnown;
}
}
}
long b = result[0];
long k = result[1];
*/
String knownStr = known_N ? " known" : "unknown";
long mem = finder.TotalMemory();
if (mem == 0) mem = N;
//else if (mem==0 && !known_N && N<0) mem = long.MaxValue; // actually infinity
//else if (mem==0 && !known_N && N>=0) mem = N;
//Console.Write(" (e,d,N,p)=("+epsilon+","+delta+","+N+","+p+") --> ");
writer.Write(" (known, d)=(" + knownStr + ", " + delta + ") --> ");
//Console.Write("(mem,b,k,memF");
writer.Write("(MB,mem");
//if (known_N) Console.Write(",sampling");
//Console.Write(")=("+(System.Math.Round(b*k/1000.0))+","+b+","+k+", "+System.Math.Round(b*k*8/1024.0/1024.0));
//Console.Write(")=("+b*k/1000.0+","+b+","+k+", "+b*k*8/1024.0/1024.0+", "+System.Math.Round(b*k*8/1024.0/1024.0));
writer.Write(")=(" + mem * 8.0 / 1024.0 / 1024.0 + ", " + mem / 1000.0 + ", " + System.Math.Round(mem * 8.0 / 1024.0 / 1024.0));
//if (known_N) Console.Write(","+returnSamplingRate[0]);
writer.WriteLine(")");
}
}
}
}
}
timer.Stop();
}
}
catch (IOException x)
{
using (StreamWriter writer = new StreamWriter(filename))
{
writer.Write(x.StackTrace);
}
}
}
