using System; using System.Collections.Generic; using System.Numerics; using MoonTools.Core.Structs; namespace MoonTools.Core.Bonk { /// /// Used to quickly check if two shapes are potentially overlapping. /// /// The type that will be used to uniquely identify shape-transform pairs. public class SpatialHash where T : IEquatable { private readonly int cellSize; private readonly Dictionary> hashDictionary = new Dictionary>(); private readonly Dictionary IDLookup = new Dictionary(); public SpatialHash(int cellSize) { this.cellSize = cellSize; } private (int, int) Hash(Vector2 position) { return ((int)Math.Floor(position.X / cellSize), (int)Math.Floor(position.Y / cellSize)); } /// /// Inserts an element into the SpatialHash. /// /// A unique ID for the shape-transform pair. /// public void Insert(T id, IHasAABB2D shape) { var box = shape.AABB; var minHash = Hash(box.Min); var maxHash = Hash(box.Max); for (var i = minHash.Item1; i <= maxHash.Item1; i++) { for (var j = minHash.Item2; j <= maxHash.Item2; j++) { var key = MakeLong(i, j); if (!hashDictionary.ContainsKey(key)) { hashDictionary.Add(key, new HashSet()); } hashDictionary[key].Add(id); IDLookup[id] = (shape, transform2D); } } } /// /// Retrieves all the potential collisions of a shape-transform pair. Excludes any shape-transforms with the given ID. /// public IEnumerable<(T, IHasAABB2D)> Retrieve(T id, IHasAABB2D shape) { var box = shape.AABB; var minHash = Hash(box.Min); var maxHash = Hash(box.Max); for (var i = minHash.Item1; i <= maxHash.Item1; i++) { for (var j = minHash.Item2; j <= maxHash.Item2; j++) { var key = MakeLong(i, j); if (hashDictionary.ContainsKey(key)) { foreach (var t in hashDictionary[key]) { var otherShape = IDLookup[t]; if (!id.Equals(t) && AABB.TestOverlap(shape.AABB, otherShape.AABB)) { yield return (t, otherShape); } } } } } } /// /// Retrieves objects based on a pre-transformed AABB. /// /// A transformed AABB. /// public IEnumerable<(T, IHasAABB2D)> Retrieve(AABB aabb) { var minHash = Hash(aabb.Min); var maxHash = Hash(aabb.Max); for (var i = minHash.Item1; i <= maxHash.Item1; i++) { for (var j = minHash.Item2; j <= maxHash.Item2; j++) { var key = MakeLong(i, j); if (hashDictionary.ContainsKey(key)) { foreach (var t in hashDictionary[key]) { var otherShape = IDLookup[t]; if (AABB.TestOverlap(aabb, otherShape.AABB)) { yield return (t, otherShape); } } } } } } /// /// Removes everything that has been inserted into the SpatialHash. /// public void Clear() { foreach (var hash in hashDictionary.Values) { hash.Clear(); } IDLookup.Clear(); } private static long MakeLong(int left, int right) { return ((long)left << 32) | ((uint)right); } } }