com.wallstop-studios.unity-helpers 2.0.0-rc27 → 2.0.0-rc31

package/Tests/Runtime/Performance/SpatialTreePerformanceTest.cs

@@ -1,154 +1,154 @@
-namespace UnityHelpers.Tests.Performance
-{
-    using System;
-    using System.Collections;
-    using System.Collections.Generic;
-    using System.Diagnostics;
-    using System.Linq;
-    using System.Threading.Tasks;
-    using Core.DataStructure;
-    using NUnit.Framework;
-    using UnityEngine;
-    using UnityEngine.TestTools;
-
-    public abstract class SpatialTreePerformanceTest<TTree>
-        where TTree : ISpatialTree<Vector2>
-    {
-        protected abstract TTree CreateTree(IEnumerable<Vector2> points);
-
-        [UnityTest]
-        public IEnumerator Performance()
-        {
-            UnityEngine.Debug.Log("| Operation | Operations / Second |");
-            UnityEngine.Debug.Log("| --------- | ------------------- |");
-
-            Vector2[] points = new Vector2[1_000_000];
-            float radius = 500;
-            ParallelLoopResult result = Parallel.For(
-                0,
-                1_000_000,
-                index =>
-                {
-                    // ReSharper disable once PossibleLossOfFraction
-                    points[index] = new Vector2(index % 1_000, index / 1_000);
-                }
-            );
-
-            while (!result.IsCompleted)
-            {
-                yield return null;
-            }
-
-            Stopwatch timer = Stopwatch.StartNew();
-            TTree tree = CreateTree(points);
-            timer.Stop();
-            UnityEngine.Debug.Log(
-                $"| Construction (1 million points) | {(int)Math.Floor(1 / timer.Elapsed.TotalSeconds)} ({timer.Elapsed.TotalSeconds} seconds total) |"
-            );
-            Vector2 center = tree.Boundary.center;
-            int count = 0;
-            TimeSpan timeout = TimeSpan.FromSeconds(1);
-            timer.Restart();
-            do
-            {
-                int elementsInRange = tree.GetElementsInRange(center, radius).Count();
-                Assert.AreEqual(785456, elementsInRange);
-                ++count;
-            } while (timer.Elapsed < timeout);
-
-            UnityEngine.Debug.Log(
-                $"| Elements In Range - Full | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
-            );
-
-            radius /= 2f;
-            count = 0;
-            timer.Restart();
-            do
-            {
-                int elementsInRange = tree.GetElementsInRange(center, radius).Count();
-                Assert.AreEqual(196364, elementsInRange);
-                ++count;
-            } while (timer.Elapsed < timeout);
-            UnityEngine.Debug.Log(
-                $"| Elements In Range - Half | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
-            );
-
-            radius /= 2f;
-            count = 0;
-            timer.Restart();
-            do
-            {
-                int elementsInRange = tree.GetElementsInRange(center, radius).Count();
-                Assert.AreEqual(49080, elementsInRange);
-                ++count;
-            } while (timer.Elapsed < timeout);
-            UnityEngine.Debug.Log(
-                $"| Elements In Range - Quarter | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
-            );
-
-            radius = 1f;
-            count = 0;
-            timer.Restart();
-            do
-            {
-                int elementsInRange = tree.GetElementsInRange(center, radius).Count();
-                Assert.AreEqual(4, elementsInRange);
-                ++count;
-            } while (timer.Elapsed < timeout);
-            UnityEngine.Debug.Log(
-                $"| Elements In Range - 1 Range | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
-            );
-
-            int nearestNeighborCount = 500;
-            List<Vector2> nearestNeighbors = new();
-            count = 0;
-            timer.Restart();
-            do
-            {
-                tree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
-                Assert.IsTrue(nearestNeighbors.Count <= nearestNeighborCount);
-                ++count;
-            } while (timer.Elapsed < timeout);
-            UnityEngine.Debug.Log(
-                $"| ANN - 500 | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
-            );
-
-            nearestNeighborCount = 100;
-            count = 0;
-            timer.Restart();
-            do
-            {
-                tree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
-                Assert.IsTrue(nearestNeighbors.Count <= nearestNeighborCount);
-                ++count;
-            } while (timer.Elapsed < timeout);
-            UnityEngine.Debug.Log(
-                $"| ANN - 100 | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
-            );
-
-            nearestNeighborCount = 10;
-            count = 0;
-            timer.Restart();
-            do
-            {
-                tree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
-                Assert.IsTrue(nearestNeighbors.Count <= nearestNeighborCount);
-                ++count;
-            } while (timer.Elapsed < timeout);
-            UnityEngine.Debug.Log(
-                $"| ANN - 10 | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
-            );
-
-            nearestNeighborCount = 1;
-            count = 0;
-            timer.Restart();
-            do
-            {
-                tree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
-                Assert.IsTrue(nearestNeighbors.Count <= nearestNeighborCount);
-                ++count;
-            } while (timer.Elapsed < timeout);
-            UnityEngine.Debug.Log($"| ANN - 1 | {(int)Math.Floor(count / timeout.TotalSeconds)} |");
-        }
-    }
-}
+namespace UnityHelpers.Tests.Performance
+{
+    using System;
+    using System.Collections;
+    using System.Collections.Generic;
+    using System.Diagnostics;
+    using System.Linq;
+    using System.Threading.Tasks;
+    using Core.DataStructure;
+    using NUnit.Framework;
+    using UnityEngine;
+    using UnityEngine.TestTools;
+
+    public abstract class SpatialTreePerformanceTest<TTree>
+        where TTree : ISpatialTree<Vector2>
+    {
+        protected abstract TTree CreateTree(IEnumerable<Vector2> points);
+
+        [UnityTest]
+        public IEnumerator Performance()
+        {
+            UnityEngine.Debug.Log("| Operation | Operations / Second |");
+            UnityEngine.Debug.Log("| --------- | ------------------- |");
+
+            Vector2[] points = new Vector2[1_000_000];
+            float radius = 500;
+            ParallelLoopResult result = Parallel.For(
+                0,
+                1_000_000,
+                index =>
+                {
+                    // ReSharper disable once PossibleLossOfFraction
+                    points[index] = new Vector2(index % 1_000, index / 1_000);
+                }
+            );
+
+            while (!result.IsCompleted)
+            {
+                yield return null;
+            }
+
+            Stopwatch timer = Stopwatch.StartNew();
+            TTree tree = CreateTree(points);
+            timer.Stop();
+            UnityEngine.Debug.Log(
+                $"| Construction (1 million points) | {(int)Math.Floor(1 / timer.Elapsed.TotalSeconds)} ({timer.Elapsed.TotalSeconds} seconds total) |"
+            );
+            Vector2 center = tree.Boundary.center;
+            int count = 0;
+            TimeSpan timeout = TimeSpan.FromSeconds(1);
+            timer.Restart();
+            do
+            {
+                int elementsInRange = tree.GetElementsInRange(center, radius).Count();
+                Assert.AreEqual(785456, elementsInRange);
+                ++count;
+            } while (timer.Elapsed < timeout);
+
+            UnityEngine.Debug.Log(
+                $"| Elements In Range - Full | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
+            );
+
+            radius /= 2f;
+            count = 0;
+            timer.Restart();
+            do
+            {
+                int elementsInRange = tree.GetElementsInRange(center, radius).Count();
+                Assert.AreEqual(196364, elementsInRange);
+                ++count;
+            } while (timer.Elapsed < timeout);
+            UnityEngine.Debug.Log(
+                $"| Elements In Range - Half | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
+            );
+
+            radius /= 2f;
+            count = 0;
+            timer.Restart();
+            do
+            {
+                int elementsInRange = tree.GetElementsInRange(center, radius).Count();
+                Assert.AreEqual(49080, elementsInRange);
+                ++count;
+            } while (timer.Elapsed < timeout);
+            UnityEngine.Debug.Log(
+                $"| Elements In Range - Quarter | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
+            );
+
+            radius = 1f;
+            count = 0;
+            timer.Restart();
+            do
+            {
+                int elementsInRange = tree.GetElementsInRange(center, radius).Count();
+                Assert.AreEqual(4, elementsInRange);
+                ++count;
+            } while (timer.Elapsed < timeout);
+            UnityEngine.Debug.Log(
+                $"| Elements In Range - 1 Range | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
+            );
+
+            int nearestNeighborCount = 500;
+            List<Vector2> nearestNeighbors = new();
+            count = 0;
+            timer.Restart();
+            do
+            {
+                tree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
+                Assert.IsTrue(nearestNeighbors.Count <= nearestNeighborCount);
+                ++count;
+            } while (timer.Elapsed < timeout);
+            UnityEngine.Debug.Log(
+                $"| ANN - 500 | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
+            );
+
+            nearestNeighborCount = 100;
+            count = 0;
+            timer.Restart();
+            do
+            {
+                tree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
+                Assert.IsTrue(nearestNeighbors.Count <= nearestNeighborCount);
+                ++count;
+            } while (timer.Elapsed < timeout);
+            UnityEngine.Debug.Log(
+                $"| ANN - 100 | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
+            );
+
+            nearestNeighborCount = 10;
+            count = 0;
+            timer.Restart();
+            do
+            {
+                tree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
+                Assert.IsTrue(nearestNeighbors.Count <= nearestNeighborCount);
+                ++count;
+            } while (timer.Elapsed < timeout);
+            UnityEngine.Debug.Log(
+                $"| ANN - 10 | {(int)Math.Floor(count / timeout.TotalSeconds)} |"
+            );
+
+            nearestNeighborCount = 1;
+            count = 0;
+            timer.Restart();
+            do
+            {
+                tree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
+                Assert.IsTrue(nearestNeighbors.Count <= nearestNeighborCount);
+                ++count;
+            } while (timer.Elapsed < timeout);
+            UnityEngine.Debug.Log($"| ANN - 1 | {(int)Math.Floor(count / timeout.TotalSeconds)} |");
+        }
+    }
+}

package/Tests/Runtime/Performance/SpatialTreePerformanceTest.cs.meta

@@ -1,11 +1,11 @@
-fileFormatVersion: 2
-guid: dfc116ec86bb06747ba0d3471eb2bbba
-MonoImporter:
-  externalObjects: {}
-  serializedVersion: 2
-  defaultReferences: []
-  executionOrder: 0
-  icon: {instanceID: 0}
-  userData: 
-  assetBundleName: 
-  assetBundleVariant: 
+fileFormatVersion: 2
+guid: dfc116ec86bb06747ba0d3471eb2bbba
+MonoImporter:
+  externalObjects: {}
+  serializedVersion: 2
+  defaultReferences: []
+  executionOrder: 0
+  icon: {instanceID: 0}
+  userData: 
+  assetBundleName: 
+  assetBundleVariant: 

package/Tests/Runtime/Performance/UnbalancedKDTreeTests.cs

@@ -1,14 +1,14 @@
-namespace UnityHelpers.Tests.Performance
-{
-    using System.Collections.Generic;
-    using Core.DataStructure;
-    using UnityEngine;
-
-    public sealed class UnbalancedKDTreeTests : SpatialTreePerformanceTest<KDTree<Vector2>>
-    {
-        protected override KDTree<Vector2> CreateTree(IEnumerable<Vector2> points)
-        {
-            return new KDTree<Vector2>(points, _ => _, balanced: false);
-        }
-    }
-}
+namespace UnityHelpers.Tests.Performance
+{
+    using System.Collections.Generic;
+    using Core.DataStructure;
+    using UnityEngine;
+
+    public sealed class UnbalancedKDTreeTests : SpatialTreePerformanceTest<KDTree<Vector2>>
+    {
+        protected override KDTree<Vector2> CreateTree(IEnumerable<Vector2> points)
+        {
+            return new KDTree<Vector2>(points, _ => _, balanced: false);
+        }
+    }
+}

package/Tests/Runtime/Performance/UnbalancedKDTreeTests.cs.meta

@@ -1,11 +1,11 @@
-fileFormatVersion: 2
-guid: 6cc8f8f6f409cc540accf2e960fc2ee8
-MonoImporter:
-  externalObjects: {}
-  serializedVersion: 2
-  defaultReferences: []
-  executionOrder: 0
-  icon: {instanceID: 0}
-  userData: 
-  assetBundleName: 
-  assetBundleVariant: 
+fileFormatVersion: 2
+guid: 6cc8f8f6f409cc540accf2e960fc2ee8
+MonoImporter:
+  externalObjects: {}
+  serializedVersion: 2
+  defaultReferences: []
+  executionOrder: 0
+  icon: {instanceID: 0}
+  userData: 
+  assetBundleName: 
+  assetBundleVariant: 

package/Tests/Runtime/Performance.meta

@@ -1,8 +1,8 @@
-fileFormatVersion: 2
-guid: af87f90044cdc7140b0dc8a0fd6c11d2
-folderAsset: yes
-DefaultImporter:
-  externalObjects: {}
-  userData: 
-  assetBundleName: 
-  assetBundleVariant: 
+fileFormatVersion: 2
+guid: af87f90044cdc7140b0dc8a0fd6c11d2
+folderAsset: yes
+DefaultImporter:
+  externalObjects: {}
+  userData: 
+  assetBundleName: 
+  assetBundleVariant: 

package/Tests/Runtime/Random/DotNetRandomTests.cs

@@ -1,9 +1,9 @@
-namespace UnityHelpers.Tests.Random
-{
-    using Core.Random;
-
-    public sealed class DotNetRandomTests : RandomTestBase
-    {
-        protected override IRandom NewRandom() => new DotNetRandom();
-    }
-}
+namespace UnityHelpers.Tests.Random
+{
+    using Core.Random;
+
+    public sealed class DotNetRandomTests : RandomTestBase
+    {
+        protected override IRandom NewRandom() => new DotNetRandom();
+    }
+}

package/Tests/Runtime/Random/DotNetRandomTests.cs.meta

@@ -1,3 +1,3 @@
-fileFormatVersion: 2
-guid: 45efbe46a3704e97b7d86757c8528a5c
+fileFormatVersion: 2
+guid: 45efbe46a3704e97b7d86757c8528a5c
 timeCreated: 1732482168

package/Tests/Runtime/Random/PcgRandomTests.cs

@@ -1,9 +1,9 @@
-namespace UnityHelpers.Tests.Random
-{
-    using UnityHelpers.Core.Random;
-
-    public sealed class PcgRandomTests : RandomTestBase
-    {
-        protected override IRandom NewRandom() => new PcgRandom();
-    }
-}
+namespace UnityHelpers.Tests.Random
+{
+    using UnityHelpers.Core.Random;
+
+    public sealed class PcgRandomTests : RandomTestBase
+    {
+        protected override IRandom NewRandom() => new PcgRandom();
+    }
+}

package/Tests/Runtime/Random/PcgRandomTests.cs.meta

@@ -1,11 +1,11 @@
-fileFormatVersion: 2
-guid: 1275f0d928181ce439edbcf9a7f0ca2e
-MonoImporter:
-  externalObjects: {}
-  serializedVersion: 2
-  defaultReferences: []
-  executionOrder: 0
-  icon: {instanceID: 0}
-  userData: 
-  assetBundleName: 
-  assetBundleVariant: 
+fileFormatVersion: 2
+guid: 1275f0d928181ce439edbcf9a7f0ca2e
+MonoImporter:
+  externalObjects: {}
+  serializedVersion: 2
+  defaultReferences: []
+  executionOrder: 0
+  icon: {instanceID: 0}
+  userData: 
+  assetBundleName: 
+  assetBundleVariant: