public unsafe void CouldChainHashes()
{
Console.WriteLine("Default: " + default(Hash16).ToString());
var h1 = Hash16.Random();
var h2 = Hash16.Random();
var rm = BufferPool.Retain(Hash16.Size * 2, true);
var ptr = (byte *)rm.Pointer;
*(Hash16 *)ptr = h1;
*(Hash16 *)(ptr + Hash16.Size) = h2;
var db = new DirectBuffer(Hash16.Size * 2, ptr);
var chainStr = Hash16.Chain(h1, h2.AsSpan()).ToString();
Console.WriteLine(chainStr);
var chainStr2 = Hash16.Chain2(h1, h2.AsSpan()).ToString();
Console.WriteLine(chainStr2);
Assert.AreEqual(chainStr, chainStr2);
Span <byte> output = stackalloc byte[Hash16.Size];
//SauceControl.Blake2Fast.Blake2b.ComputeAndWriteHash(Hash32.Size,
// h1.AsSpan(), h2.AsSpan(), output);
//var reference = Unsafe.As<byte, Hash32>(ref output[0]);
//Assert.AreEqual(chained, reference);
//var incrHash = SauceControl.Blake2Fast.Blake2b.CreateIncrementalHasher(Hash32.Size);
//incrHash.Update(h1.AsSpan());
//incrHash.Update(default(Hash32).AsSpan());
//incrHash.Update(default(Hash32).AsSpan());
//incrHash.Update(default(Hash32).AsSpan());
//incrHash.Update(h2.AsSpan());
//incrHash.TryFinish(output, out _);
//var incremental = Unsafe.As<byte, Hash32>(ref output[0]);
//Console.WriteLine(incremental);
Spreads.Algorithms.Hash.Blake2b.ComputeAndWriteHash(Hash16.Size,
db, output);
var manual = Unsafe.As <byte, Hash16>(ref output[0]);
// Assert.AreEqual(chained, manual);
}
public unsafe void CouldChainHashesBench()
{
var h = Hash16.Random();
var count = 1_000_000;
var rounds = 10;
var h1 = Hash16.Chain(h, h.AsSpan());
var h2 = Hash16.Chain2(h, h.AsSpan());
for (int _ = 0; _ < rounds; _++)
{
h1 = CouldChainHashesBench_ChainSimd(count, h);
h2 = CouldChainHashesBench_ChainLibsodium(count, h);
Assert.AreEqual(h1.ToString(), h2.ToString());
Console.WriteLine(h1.ToString());
h = h1;
}
Benchmark.Dump();
}