com.wallstop-studios.unity-helpers 2.0.0-rc26 → 2.0.0-rc30

package/Tests/Runtime/DataStructures/QuadTreeTests.cs

@@ -1,14 +1,14 @@
-namespace UnityHelpers.Tests.DataStructures
-{
-    using System.Collections.Generic;
-    using Core.DataStructure;
-    using UnityEngine;
-
-    public sealed class QuadTreeTests : SpatialTreeTests<QuadTree<Vector2>>
-    {
-        protected override QuadTree<Vector2> CreateTree(IEnumerable<Vector2> points)
-        {
-            return new QuadTree<Vector2>(points, _ => _);
-        }
-    }
-}
+namespace UnityHelpers.Tests.DataStructures
+{
+    using System.Collections.Generic;
+    using Core.DataStructure;
+    using UnityEngine;
+
+    public sealed class QuadTreeTests : SpatialTreeTests<QuadTree<Vector2>>
+    {
+        protected override QuadTree<Vector2> CreateTree(IEnumerable<Vector2> points)
+        {
+            return new QuadTree<Vector2>(points, _ => _);
+        }
+    }
+}

package/Tests/Runtime/DataStructures/QuadTreeTests.cs.meta

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

package/Tests/Runtime/DataStructures/SpatialTreeTests.cs

@@ -1,130 +1,130 @@
-namespace UnityHelpers.Tests.DataStructures
-{
-    using System.Collections.Generic;
-    using System.Linq;
-    using Core.DataStructure;
-    using Core.Helper;
-    using Core.Random;
-    using NUnit.Framework;
-    using Vector2 = UnityEngine.Vector2;
-
-    public abstract class SpatialTreeTests<TTree>
-        where TTree : ISpatialTree<Vector2>
-    {
-        private IRandom Random => PRNG.Instance;
-
-        protected abstract TTree CreateTree(IEnumerable<Vector2> points);
-
-        [Test]
-        public void SimpleWithinCircle()
-        {
-            Vector2 center = new(Random.NextFloat(-100, 100), Random.NextFloat(-100, 100));
-            float radius = Random.NextFloat(5, 25f);
-
-            const int numPoints = 1_000;
-            HashSet<Vector2> points = new(numPoints);
-            for (int i = 0; i < numPoints; ++i)
-            {
-                Vector2 point;
-                do
-                {
-                    point = Helpers.GetRandomPointInCircle(center, radius);
-                } while (!points.Add(point));
-            }
-
-            TTree quadTree = CreateTree(points);
-
-            List<Vector2> pointsInRange = quadTree.GetElementsInRange(center, radius).ToList();
-            Assert.IsTrue(
-                points.SetEquals(pointsInRange),
-                "Found {0} points in range, expected {1}.",
-                pointsInRange.Count,
-                points.Count
-            );
-            // Translate by a unit-square - there should be no points in this range
-            Vector2 offset = center;
-            offset.x -= radius * 2;
-            offset.y -= radius * 2;
-
-            pointsInRange = quadTree.GetElementsInRange(offset, radius).ToList();
-            Assert.AreEqual(
-                0,
-                pointsInRange.Count,
-                "Found {0} points within {1} range of {2} (original center {3})",
-                pointsInRange.Count,
-                radius,
-                offset,
-                center
-            );
-        }
-
-        [Test]
-        public void SimplePointOutsideRange()
-        {
-            Vector2 point = new(Random.NextFloat(-100, 100), Random.NextFloat(-100, 100));
-
-            Vector2 direction = Helpers.GetRandomPointInCircle(Vector2.zero, 1f).normalized;
-            float range = Random.NextFloat(25, 1_000);
-            Vector2 testPoint = point + (direction * range);
-            List<Vector2> points = new(1) { testPoint };
-
-            TTree quadTree = CreateTree(points);
-            List<Vector2> pointsInRange = quadTree
-                .GetElementsInRange(point, range * 0.99f)
-                .ToList();
-            Assert.AreEqual(0, pointsInRange.Count);
-            pointsInRange = quadTree.GetElementsInRange(point, range * 1.01f).ToList();
-            Assert.AreEqual(
-                1,
-                pointsInRange.Count,
-                "Failed to find point {0} from test point {1} with {2:0.00} range.",
-                point,
-                testPoint,
-                range
-            );
-            Assert.AreEqual(testPoint, pointsInRange[0]);
-        }
-
-        [Test]
-        public void SimpleANN()
-        {
-            List<Vector2> points = new();
-            for (int x = 0; x < 100; ++x)
-            {
-                for (int y = 0; y < 100; ++y)
-                {
-                    Vector2 point = new(x, y);
-                    points.Add(point);
-                }
-            }
-
-            TTree quadTree = CreateTree(points);
-            Vector2 center = quadTree.Boundary.center;
-
-            List<Vector2> nearestNeighbors = new();
-            int nearestNeighborCount = 1;
-            quadTree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
-            Assert.AreEqual(nearestNeighborCount, nearestNeighbors.Count);
-            Assert.IsTrue(nearestNeighbors.All(neighbor => (neighbor - center).magnitude <= 2f));
-
-            nearestNeighborCount = 4;
-            quadTree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
-            Assert.AreEqual(nearestNeighborCount, nearestNeighbors.Count);
-            Assert.IsTrue(nearestNeighbors.All(neighbor => (neighbor - center).magnitude <= 2.2f));
-
-            nearestNeighborCount = 16;
-            quadTree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
-            Assert.AreEqual(nearestNeighborCount, nearestNeighbors.Count);
-            Assert.IsTrue(
-                nearestNeighbors.All(neighbor => (neighbor - center).magnitude <= 5.6f),
-                "Max: {0}",
-                nearestNeighbors.Select(neighbor => (neighbor - center).magnitude).Max()
-            );
-
-            center = new Vector2(-100, -100);
-
-            quadTree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
-            Assert.AreEqual(nearestNeighborCount, nearestNeighbors.Count);
-        }
-    }
-}
+namespace UnityHelpers.Tests.DataStructures
+{
+    using System.Collections.Generic;
+    using System.Linq;
+    using Core.DataStructure;
+    using Core.Helper;
+    using Core.Random;
+    using NUnit.Framework;
+    using Vector2 = UnityEngine.Vector2;
+
+    public abstract class SpatialTreeTests<TTree>
+        where TTree : ISpatialTree<Vector2>
+    {
+        private IRandom Random => PRNG.Instance;
+
+        protected abstract TTree CreateTree(IEnumerable<Vector2> points);
+
+        [Test]
+        public void SimpleWithinCircle()
+        {
+            Vector2 center = new(Random.NextFloat(-100, 100), Random.NextFloat(-100, 100));
+            float radius = Random.NextFloat(5, 25f);
+
+            const int numPoints = 1_000;
+            HashSet<Vector2> points = new(numPoints);
+            for (int i = 0; i < numPoints; ++i)
+            {
+                Vector2 point;
+                do
+                {
+                    point = Helpers.GetRandomPointInCircle(center, radius);
+                } while (!points.Add(point));
+            }
+
+            TTree quadTree = CreateTree(points);
+
+            List<Vector2> pointsInRange = quadTree.GetElementsInRange(center, radius).ToList();
+            Assert.IsTrue(
+                points.SetEquals(pointsInRange),
+                "Found {0} points in range, expected {1}.",
+                pointsInRange.Count,
+                points.Count
+            );
+            // Translate by a unit-square - there should be no points in this range
+            Vector2 offset = center;
+            offset.x -= radius * 2;
+            offset.y -= radius * 2;
+
+            pointsInRange = quadTree.GetElementsInRange(offset, radius).ToList();
+            Assert.AreEqual(
+                0,
+                pointsInRange.Count,
+                "Found {0} points within {1} range of {2} (original center {3})",
+                pointsInRange.Count,
+                radius,
+                offset,
+                center
+            );
+        }
+
+        [Test]
+        public void SimplePointOutsideRange()
+        {
+            Vector2 point = new(Random.NextFloat(-100, 100), Random.NextFloat(-100, 100));
+
+            Vector2 direction = Helpers.GetRandomPointInCircle(Vector2.zero, 1f).normalized;
+            float range = Random.NextFloat(25, 1_000);
+            Vector2 testPoint = point + (direction * range);
+            List<Vector2> points = new(1) { testPoint };
+
+            TTree quadTree = CreateTree(points);
+            List<Vector2> pointsInRange = quadTree
+                .GetElementsInRange(point, range * 0.99f)
+                .ToList();
+            Assert.AreEqual(0, pointsInRange.Count);
+            pointsInRange = quadTree.GetElementsInRange(point, range * 1.01f).ToList();
+            Assert.AreEqual(
+                1,
+                pointsInRange.Count,
+                "Failed to find point {0} from test point {1} with {2:0.00} range.",
+                point,
+                testPoint,
+                range
+            );
+            Assert.AreEqual(testPoint, pointsInRange[0]);
+        }
+
+        [Test]
+        public void SimpleANN()
+        {
+            List<Vector2> points = new();
+            for (int x = 0; x < 100; ++x)
+            {
+                for (int y = 0; y < 100; ++y)
+                {
+                    Vector2 point = new(x, y);
+                    points.Add(point);
+                }
+            }
+
+            TTree quadTree = CreateTree(points);
+            Vector2 center = quadTree.Boundary.center;
+
+            List<Vector2> nearestNeighbors = new();
+            int nearestNeighborCount = 1;
+            quadTree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
+            Assert.AreEqual(nearestNeighborCount, nearestNeighbors.Count);
+            Assert.IsTrue(nearestNeighbors.All(neighbor => (neighbor - center).magnitude <= 2f));
+
+            nearestNeighborCount = 4;
+            quadTree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
+            Assert.AreEqual(nearestNeighborCount, nearestNeighbors.Count);
+            Assert.IsTrue(nearestNeighbors.All(neighbor => (neighbor - center).magnitude <= 2.2f));
+
+            nearestNeighborCount = 16;
+            quadTree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
+            Assert.AreEqual(nearestNeighborCount, nearestNeighbors.Count);
+            Assert.IsTrue(
+                nearestNeighbors.All(neighbor => (neighbor - center).magnitude <= 5.6f),
+                "Max: {0}",
+                nearestNeighbors.Select(neighbor => (neighbor - center).magnitude).Max()
+            );
+
+            center = new Vector2(-100, -100);
+
+            quadTree.GetApproximateNearestNeighbors(center, nearestNeighborCount, nearestNeighbors);
+            Assert.AreEqual(nearestNeighborCount, nearestNeighbors.Count);
+        }
+    }
+}

package/Tests/Runtime/DataStructures/SpatialTreeTests.cs.meta

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

package/Tests/Runtime/DataStructures/UnbalancedKDTreeTests.cs

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

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

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

package/Tests/Runtime/DataStructures.meta

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