mirror of
https://github.com/esiur/esiur-dotnet.git
synced 2026-04-29 06:48:41 +00:00
int test
This commit is contained in:
@@ -12,5 +12,6 @@ namespace Esiur.Tests.Gvwie
|
||||
Alternating,
|
||||
Small,
|
||||
Ascending,
|
||||
Clustering,
|
||||
}
|
||||
}
|
||||
|
||||
@@ -120,8 +120,7 @@ public static class IntArrayGenerator
|
||||
|
||||
|
||||
// Generate random int array of given length and distribution
|
||||
public static int[] GenerateInt32(int length, GeneratorPattern pattern = GeneratorPattern.Uniform,
|
||||
int range = int.MaxValue)
|
||||
public static int[] GenerateInt32(int length, GeneratorPattern pattern = GeneratorPattern.Uniform)
|
||||
{
|
||||
var data = new int[length];
|
||||
|
||||
@@ -130,23 +129,23 @@ public static class IntArrayGenerator
|
||||
case GeneratorPattern.Uniform:
|
||||
// Random values in [-range, range]
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = rng.Next(-range, range);
|
||||
data[i] = rng.Next(int.MinValue, int.MaxValue);
|
||||
break;
|
||||
|
||||
case GeneratorPattern.Positive:
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = rng.Next(0, range);
|
||||
data[i] = rng.Next(0, int.MaxValue);
|
||||
break;
|
||||
|
||||
case GeneratorPattern.Negative:
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = -rng.Next(0, range);
|
||||
data[i] = -rng.Next(int.MinValue, 0);
|
||||
break;
|
||||
|
||||
case GeneratorPattern.Alternating:
|
||||
for (int i = 0; i < length; i++)
|
||||
{
|
||||
int val = rng.Next(0, range);
|
||||
int val = rng.Next(0, int.MaxValue);
|
||||
data[i] = (i % 2 == 0) ? val : -val;
|
||||
}
|
||||
break;
|
||||
@@ -160,12 +159,27 @@ public static class IntArrayGenerator
|
||||
|
||||
case GeneratorPattern.Ascending:
|
||||
{
|
||||
int start = rng.Next(-range, range);
|
||||
int start = rng.Next(int.MinValue, int.MaxValue);
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = start + i;
|
||||
}
|
||||
break;
|
||||
|
||||
case GeneratorPattern.Clustering:
|
||||
{
|
||||
// Build ascending runs and cast to int, clamping to int bounds
|
||||
var runs = GenerateRuns(length, 3, 50, ((long)int.MinValue), (long)int.MaxValue, true);
|
||||
for (int i = 0; i < length; i++)
|
||||
{
|
||||
long v = runs[i];
|
||||
if (v > int.MaxValue) data[i] = int.MaxValue;
|
||||
else if (v < int.MinValue) data[i] = int.MinValue;
|
||||
else data[i] = (int)v;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
|
||||
default:
|
||||
throw new ArgumentException($"Unknown pattern: {pattern}");
|
||||
}
|
||||
@@ -175,35 +189,48 @@ public static class IntArrayGenerator
|
||||
|
||||
|
||||
// Generate random int array of given length and distribution
|
||||
public static uint[] GenerateUInt32(int length, string pattern = "uniform",
|
||||
public static uint[] GenerateUInt32(int length, GeneratorPattern pattern = GeneratorPattern.Uniform,
|
||||
uint range = uint.MaxValue)
|
||||
{
|
||||
|
||||
var data = new uint[length];
|
||||
|
||||
switch (pattern.ToLower())
|
||||
switch (pattern)
|
||||
{
|
||||
case "uniform":
|
||||
case GeneratorPattern.Uniform:
|
||||
// Random values in [-range, range]
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = (uint)rng.NextInt64(0, (long)range);
|
||||
break;
|
||||
|
||||
case "small":
|
||||
case GeneratorPattern.Small:
|
||||
// Focused on small magnitudes to test ZigZag fast path
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = (uint)rng.Next(0, 127);
|
||||
break;
|
||||
|
||||
|
||||
case "ascending":
|
||||
case GeneratorPattern.Clustering:
|
||||
{
|
||||
uint start = (uint)rng.NextInt64(0, (long)range);
|
||||
for (uint i = 0; i < length; i++)
|
||||
data[i] = start + i;
|
||||
// Generate runs in a non-negative range and cast to uint
|
||||
var runs = GenerateRuns(length, 3, 50, 0, (long)range, false);
|
||||
for (int i = 0; i < length; i++)
|
||||
{
|
||||
long v = runs[i];
|
||||
if (v < 0) data[i] = 0u;
|
||||
else if ((ulong)v > uint.MaxValue) data[i] = uint.MaxValue;
|
||||
else data[i] = (uint)v;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
|
||||
case GeneratorPattern.Ascending:
|
||||
uint start = (uint)rng.NextInt64(0, (long)range);
|
||||
for (uint i = 0; i < length; i++)
|
||||
data[i] = start + i;
|
||||
|
||||
break;
|
||||
|
||||
default:
|
||||
throw new ArgumentException($"Unknown pattern: {pattern}");
|
||||
}
|
||||
@@ -212,30 +239,42 @@ public static class IntArrayGenerator
|
||||
}
|
||||
|
||||
// Generate random int array of given length and distribution
|
||||
public static ulong[] GenerateUInt64(int length, string pattern = "uniform")
|
||||
public static ulong[] GenerateUInt64(int length, GeneratorPattern pattern = GeneratorPattern.Uniform)
|
||||
{
|
||||
var data = new ulong[length];
|
||||
|
||||
switch (pattern.ToLower())
|
||||
switch (pattern)
|
||||
{
|
||||
case "uniform":
|
||||
case GeneratorPattern.Uniform:
|
||||
// Random values in [-range, range]
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = (ulong)rng.NextInt64();
|
||||
break;
|
||||
|
||||
case "small":
|
||||
case GeneratorPattern.Small:
|
||||
// Focused on small magnitudes to test ZigZag fast path
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = (uint)rng.Next(0, 127);
|
||||
break;
|
||||
|
||||
|
||||
case "ascending":
|
||||
case GeneratorPattern.Ascending:
|
||||
|
||||
uint start = (uint)rng.NextInt64();
|
||||
for (uint i = 0; i < length; i++)
|
||||
data[i] = start + i;
|
||||
|
||||
break;
|
||||
|
||||
case GeneratorPattern.Clustering:
|
||||
{
|
||||
uint start = (uint)rng.NextInt64();
|
||||
for (uint i = 0; i < length; i++)
|
||||
data[i] = start + i;
|
||||
var runs = GenerateRuns(length, 3, 50, 0, long.MaxValue, false);
|
||||
for (int i = 0; i < length; i++)
|
||||
{
|
||||
long v = runs[i];
|
||||
if (v < 0) data[i] = 0UL;
|
||||
else data[i] = (ulong)v;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
@@ -246,31 +285,43 @@ public static class IntArrayGenerator
|
||||
return data;
|
||||
}
|
||||
|
||||
public static uint[] GenerateUInt16(int length, string pattern = "uniform",
|
||||
ushort range = ushort.MaxValue)
|
||||
public static uint[] GenerateUInt16(int length, GeneratorPattern pattern = GeneratorPattern.Uniform)
|
||||
{
|
||||
var data = new uint[length];
|
||||
|
||||
switch (pattern.ToLower())
|
||||
switch (pattern)
|
||||
{
|
||||
case "uniform":
|
||||
case GeneratorPattern.Uniform:
|
||||
// Random values in [-range, range]
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = (ushort)rng.Next(0, range);
|
||||
data[i] = (ushort)rng.Next(0, ushort.MaxValue);
|
||||
break;
|
||||
|
||||
case "small":
|
||||
case GeneratorPattern.Small:
|
||||
// Focused on small magnitudes to test ZigZag fast path
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = (uint)rng.Next(0, 127);
|
||||
break;
|
||||
|
||||
|
||||
case "ascending":
|
||||
case GeneratorPattern.Ascending:
|
||||
|
||||
var start = (ushort)rng.Next(0, ushort.MaxValue);
|
||||
for (uint i = 0; i < length; i++)
|
||||
data[i] = start + i;
|
||||
|
||||
break;
|
||||
|
||||
case GeneratorPattern.Clustering:
|
||||
{
|
||||
var start = (ushort)rng.Next(0, range);
|
||||
for (uint i = 0; i < length; i++)
|
||||
data[i] = start + i;
|
||||
var runs = GenerateRuns(length, 3, 50, 0, ushort.MaxValue, false);
|
||||
for (int i = 0; i < length; i++)
|
||||
{
|
||||
long v = runs[i];
|
||||
if (v < 0) data[i] = 0u;
|
||||
else if (v > ushort.MaxValue) data[i] = ushort.MaxValue;
|
||||
else data[i] = (uint)v;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
@@ -282,7 +333,7 @@ public static class IntArrayGenerator
|
||||
}
|
||||
|
||||
// Generate random int array of given length and distribution
|
||||
public static long[] GenerateInt64(int length, GeneratorPattern pattern = GeneratorPattern.Uniform,
|
||||
public static long[] GenerateInt64(int length, GeneratorPattern pattern = GeneratorPattern.Uniform,
|
||||
long range = long.MaxValue)
|
||||
{
|
||||
var data = new long[length];
|
||||
@@ -328,6 +379,14 @@ public static class IntArrayGenerator
|
||||
}
|
||||
break;
|
||||
|
||||
case GeneratorPattern.Clustering:
|
||||
{
|
||||
var runs = GenerateRuns(length, 3, 50, -range, range, true);
|
||||
for (int i = 0; i < length; i++)
|
||||
data[i] = runs[i];
|
||||
}
|
||||
break;
|
||||
|
||||
default:
|
||||
throw new ArgumentException($"Unknown pattern: {pattern}");
|
||||
}
|
||||
@@ -335,7 +394,7 @@ public static class IntArrayGenerator
|
||||
return data;
|
||||
}
|
||||
|
||||
public static short[] GenerateInt16(int length, GeneratorPattern pattern = GeneratorPattern.Uniform,
|
||||
public static short[] GenerateInt16(int length, GeneratorPattern pattern = GeneratorPattern.Uniform,
|
||||
short range = short.MaxValue)
|
||||
{
|
||||
var data = new short[length];
|
||||
@@ -379,6 +438,19 @@ public static class IntArrayGenerator
|
||||
}
|
||||
break;
|
||||
|
||||
case GeneratorPattern.Clustering:
|
||||
{
|
||||
var runs = GenerateRuns(length, 3, 50, -range, range, true);
|
||||
for (int i = 0; i < length; i++)
|
||||
{
|
||||
long v = runs[i];
|
||||
if (v > short.MaxValue) data[i] = short.MaxValue;
|
||||
else if (v < short.MinValue) data[i] = short.MinValue;
|
||||
else data[i] = (short)v;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
default:
|
||||
throw new ArgumentException($"Unknown pattern: {pattern}");
|
||||
}
|
||||
|
||||
@@ -30,14 +30,14 @@ namespace Esiur.Tests.Gvwie
|
||||
const int TEST_ITERATIONS = 100;
|
||||
const int SAMPLE_SIZE = 100;
|
||||
|
||||
Console.WriteLine(";Esiur;FlatBuffer;ProtoBuffer;MessagePack;BSON;CBOR;Avro,Optimal");
|
||||
Console.WriteLine(";Esiur;FlatBuffer;ProtoBuffer,MessagePack;BSON;CBOR;Avro,Optimal");
|
||||
|
||||
|
||||
|
||||
Console.Write("Cluster (Int32);");
|
||||
|
||||
PrintAverage(
|
||||
Average(() => CompareInt(IntArrayGenerator.GenerateRuns(SAMPLE_SIZE)), TEST_ITERATIONS)
|
||||
Average(() => CompareInt(IntArrayGenerator.GenerateInt32(SAMPLE_SIZE, GeneratorPattern.Clustering)), TEST_ITERATIONS)
|
||||
);
|
||||
|
||||
Console.Write("Positive (Int32);");
|
||||
@@ -111,61 +111,75 @@ namespace Esiur.Tests.Gvwie
|
||||
// Produces a CSV with header: SampleSize;Esiur;FlatBuffer;ProtoBuffer;MessagePack;BSON;CBOR;Avro;Optimal
|
||||
public void RunChart()
|
||||
{
|
||||
var sizes = new int[] { 10, 100, 1000, 10000, 100000 };
|
||||
var sizes = Enumerable.Range(12, 21)
|
||||
.Select(i => (int)Math.Pow(2, i))
|
||||
.ToArray();
|
||||
|
||||
|
||||
// Define generators to evaluate. Each entry maps a name to a function that
|
||||
// given a sample size returns the averages (double[]) by calling Average(...).
|
||||
var generators = new List<(string name, Func<int, int, double[]> fn)>()
|
||||
{
|
||||
("GenerateRuns", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateRuns(size)), iterations)),
|
||||
("Int32_Uniform", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size, GeneratorPattern.Uniform)), iterations)),
|
||||
("Int32_Positive", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size, GeneratorPattern.Positive)), iterations)),
|
||||
|
||||
("Int32_Clustering", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size, GeneratorPattern.Clustering)), iterations)),
|
||||
("Int32_Negative", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size, GeneratorPattern.Negative)), iterations)),
|
||||
("Int32_Small", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size, GeneratorPattern.Small)), iterations)),
|
||||
("Int32_Alternating", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size, GeneratorPattern.Alternating)), iterations)),
|
||||
("Int32_Ascending", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size, GeneratorPattern.Ascending)), iterations)),
|
||||
("Int64", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt64(size)), iterations)),
|
||||
("Int32_Default", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size)), iterations)),
|
||||
("Int16", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt16(size)), iterations)),
|
||||
("UInt64", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateUInt64(size)), iterations)),
|
||||
("UInt32", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateUInt32(size)), iterations)),
|
||||
("UInt16", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateUInt16(size)), iterations)),
|
||||
//("Int64", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt64(size)), iterations)),
|
||||
//("Int32", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt32(size)), iterations)),
|
||||
//("Int16", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateInt16(size)), iterations)),
|
||||
//("UInt64", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateUInt64(size)), iterations)),
|
||||
//("UInt32", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateUInt32(size)), iterations)),
|
||||
//("UInt16", (size, iterations) => Average(() => CompareInt(IntArrayGenerator.GenerateUInt16(size)), iterations)),
|
||||
};
|
||||
|
||||
foreach (var gen in generators)
|
||||
{
|
||||
var sb = new System.Text.StringBuilder();
|
||||
sb.AppendLine("SampleSize,Esiur,FlatBufferProtoBuffer,MessagePack,BSON,CBOR,Avro,Optimal");
|
||||
var sbr = new System.Text.StringBuilder();
|
||||
|
||||
sb.AppendLine("SampleSize,Esiur,FlatBuffer,ProtoBuffer,MessagePack,BSON,CBOR,Avro,Optimal");
|
||||
sbr.AppendLine("SampleSize,Esiur,FlatBuffer,ProtoBuffer,MessagePack,BSON,CBOR,Avro,Optimal");
|
||||
|
||||
foreach (var size in sizes)
|
||||
{
|
||||
// Choose iterations depending on size to keep total runtime reasonable
|
||||
int iterations;
|
||||
if (size <= 100) iterations = 1000;
|
||||
else if (size <= 1000) iterations = 200;
|
||||
else if (size <= 10000) iterations = 50;
|
||||
else iterations = 10;
|
||||
int iterations = 10;
|
||||
//if (size <= 100) iterations = 1000;
|
||||
//else if (size <= 1000) iterations = 200;
|
||||
//else if (size <= 10000) iterations = 50;
|
||||
//else iterations = 10;
|
||||
|
||||
Console.WriteLine($"Running {gen.name} sample size={size}, iterations={iterations}...");
|
||||
|
||||
var averages = gen.fn(size, iterations);
|
||||
PrintAverage(averages);
|
||||
|
||||
sb.Append(size);
|
||||
sbr.Append(size);
|
||||
for (int i = 0; i < averages.Length; i++)
|
||||
{
|
||||
sb.Append(',');
|
||||
sb.Append(Math.Round(averages[i]));
|
||||
sbr.Append(',');
|
||||
sbr.Append(((averages[i] - averages.Last()) / averages.Last()) * 100.0);
|
||||
}
|
||||
|
||||
sb.AppendLine();
|
||||
sbr.AppendLine();
|
||||
}
|
||||
|
||||
var file = $"run_chart_{gen.name}.csv";
|
||||
System.IO.File.WriteAllText(file, sb.ToString());
|
||||
Console.WriteLine($"Chart CSV written to: {file}");
|
||||
var file2 = $"optimal_chart_{gen.name}.csv";
|
||||
System.IO.File.WriteAllText(file, sbr.ToString());
|
||||
|
||||
Console.WriteLine($"Chart CSV written to: {file} {file2}");
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
public static (int, int, int, int, int, int, int, int) CompareInt(long[] sample)
|
||||
{
|
||||
var intRoot = new ArrayRoot<long>() { Values = sample };
|
||||
|
||||
@@ -10,6 +10,6 @@ MessagePack.MessagePackSerializer.DefaultOptions = MessagePackSerializerOptions.
|
||||
|
||||
|
||||
var ints = new IntArrayRunner();
|
||||
ints.Run();
|
||||
//ints.Run();
|
||||
ints.RunChart();
|
||||
|
||||
|
||||
Reference in New Issue
Block a user