Adam Hathcock
86 lines
2.5 KiB
C#
86 lines
2.5 KiB
C#
using System.Diagnostics;
|
|
using NUnit.Framework;
|
|
using Speckle.Core.Models;
|
|
using Speckle.Core.Tests.Unit.Kits;
|
|
|
|
namespace Speckle.Core.Tests.Unit.Models;
|
|
|
|
[TestFixture]
|
|
[TestOf(typeof(Base))]
|
|
public class Hashing
|
|
{
|
|
[Test(Description = "Checks that hashing (as represented by object ids) actually works.")]
|
|
public void HashChangeCheck()
|
|
{
|
|
var table = new DiningTable();
|
|
var secondTable = new DiningTable();
|
|
|
|
Assert.That(secondTable.GetId(), Is.EqualTo(table.GetId()));
|
|
|
|
((dynamic)secondTable).testProp = "wonderful";
|
|
|
|
Assert.That(secondTable.GetId(), Is.Not.EqualTo(table.GetId()));
|
|
}
|
|
|
|
[Test(
|
|
Description = "Tests the convention that dynamic properties that have key names prepended with '__' are ignored."
|
|
)]
|
|
public void IgnoredDynamicPropertiesCheck()
|
|
{
|
|
var table = new DiningTable();
|
|
var originalHash = table.GetId();
|
|
|
|
((dynamic)table).__testProp = "wonderful";
|
|
|
|
Assert.That(table.GetId(), Is.EqualTo(originalHash));
|
|
}
|
|
|
|
[Test(Description = "Rather stupid test as results vary wildly even on one machine.")]
|
|
public void HashingPerformance()
|
|
{
|
|
var polyline = new Polyline();
|
|
|
|
for (int i = 0; i < 1000; i++)
|
|
{
|
|
polyline.Points.Add(new Point { X = i * 2, Y = i % 2 });
|
|
}
|
|
|
|
var stopWatch = new Stopwatch();
|
|
stopWatch.Start();
|
|
|
|
// Warm-up: first hashing always takes longer due to json serialisation init
|
|
_ = polyline.GetId();
|
|
var stopWatchStep = stopWatch.ElapsedMilliseconds;
|
|
_ = polyline.GetId();
|
|
|
|
var diff1 = stopWatch.ElapsedMilliseconds - stopWatchStep;
|
|
Assert.That(diff1, Is.LessThan(300), $"Hashing shouldn't take that long ({diff1} ms) for the test object used.");
|
|
Console.WriteLine($"Big obj hash duration: {diff1} ms");
|
|
|
|
var pt = new Point
|
|
{
|
|
X = 10,
|
|
Y = 12,
|
|
Z = 30
|
|
};
|
|
stopWatchStep = stopWatch.ElapsedMilliseconds;
|
|
_ = pt.GetId();
|
|
|
|
var diff2 = stopWatch.ElapsedMilliseconds - stopWatchStep;
|
|
Assert.That(diff2, Is.LessThan(10), $"Hashing shouldn't take that long ({diff2} ms)for the point object used.");
|
|
Console.WriteLine($"Small obj hash duration: {diff2} ms");
|
|
}
|
|
|
|
[Test(Description = "The hash of a decomposed object is different that that of a non-decomposed object.")]
|
|
public void DecompositionHashes()
|
|
{
|
|
var table = new DiningTable();
|
|
((dynamic)table)["@decomposeMePlease"] = new Point();
|
|
|
|
var hash1 = table.GetId();
|
|
var hash2 = table.GetId(true);
|
|
|
|
Assert.That(hash2, Is.Not.EqualTo(hash1));
|
|
}
|
|
}
|