2019-12-30 06:19:10 +00:00
|
|
|
|
using System;
|
2019-09-06 08:11:58 +00:00
|
|
|
|
using System.Collections.Generic;
|
2019-12-30 06:19:10 +00:00
|
|
|
|
using System.Numerics;
|
2019-09-06 08:11:58 +00:00
|
|
|
|
using MoonTools.Core.Structs;
|
|
|
|
|
|
|
|
|
|
namespace MoonTools.Core.Bonk
|
|
|
|
|
{
|
2019-10-25 21:01:36 +00:00
|
|
|
|
/// <summary>
|
|
|
|
|
/// Used to quickly check if two shapes are potentially overlapping.
|
|
|
|
|
/// </summary>
|
|
|
|
|
/// <typeparam name="T">The type that will be used to uniquely identify shape-transform pairs.</typeparam>
|
2019-09-06 08:11:58 +00:00
|
|
|
|
public class SpatialHash<T> where T : IEquatable<T>
|
|
|
|
|
{
|
|
|
|
|
private readonly int cellSize;
|
|
|
|
|
|
2020-01-01 00:13:11 +00:00
|
|
|
|
private readonly Dictionary<long, HashSet<T>> hashDictionary = new Dictionary<long, HashSet<T>>();
|
2020-01-02 09:40:03 +00:00
|
|
|
|
private readonly Dictionary<T, (IHasAABB2D, Transform2D)> IDLookup = new Dictionary<T, (IHasAABB2D, Transform2D)>();
|
2019-09-06 08:11:58 +00:00
|
|
|
|
|
|
|
|
|
public SpatialHash(int cellSize)
|
|
|
|
|
{
|
|
|
|
|
this.cellSize = cellSize;
|
|
|
|
|
}
|
|
|
|
|
|
2019-12-30 06:19:10 +00:00
|
|
|
|
private (int, int) Hash(Vector2 position)
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2019-12-30 06:19:10 +00:00
|
|
|
|
return ((int)Math.Floor(position.X / cellSize), (int)Math.Floor(position.Y / cellSize));
|
2019-09-06 08:11:58 +00:00
|
|
|
|
}
|
|
|
|
|
|
2019-10-25 21:01:36 +00:00
|
|
|
|
/// <summary>
|
|
|
|
|
/// Inserts an element into the SpatialHash.
|
|
|
|
|
/// </summary>
|
|
|
|
|
/// <param name="id">A unique ID for the shape-transform pair.</param>
|
|
|
|
|
/// <param name="shape"></param>
|
|
|
|
|
/// <param name="transform2D"></param>
|
2020-01-02 09:40:03 +00:00
|
|
|
|
public void Insert(T id, IHasAABB2D shape, Transform2D transform2D)
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2019-12-30 06:19:10 +00:00
|
|
|
|
var box = shape.TransformedAABB(transform2D);
|
|
|
|
|
var minHash = Hash(box.Min);
|
|
|
|
|
var maxHash = Hash(box.Max);
|
2019-09-06 08:11:58 +00:00
|
|
|
|
|
2019-12-30 06:19:10 +00:00
|
|
|
|
for (var i = minHash.Item1; i <= maxHash.Item1; i++)
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2019-12-30 06:19:10 +00:00
|
|
|
|
for (var j = minHash.Item2; j <= maxHash.Item2; j++)
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2020-01-01 01:57:38 +00:00
|
|
|
|
var key = MakeLong(i, j);
|
2020-01-01 00:13:11 +00:00
|
|
|
|
if (!hashDictionary.ContainsKey(key))
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2020-01-01 00:13:11 +00:00
|
|
|
|
hashDictionary.Add(key, new HashSet<T>());
|
2019-09-06 08:11:58 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-01-01 00:13:11 +00:00
|
|
|
|
hashDictionary[key].Add(id);
|
2019-09-19 00:00:28 +00:00
|
|
|
|
IDLookup[id] = (shape, transform2D);
|
2019-09-06 08:11:58 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-10-25 21:01:36 +00:00
|
|
|
|
/// <summary>
|
|
|
|
|
/// Retrieves all the potential collisions of a shape-transform pair. Excludes any shape-transforms with the given ID.
|
|
|
|
|
/// </summary>
|
2020-01-02 09:40:03 +00:00
|
|
|
|
public IEnumerable<(T, IHasAABB2D, Transform2D)> Retrieve(T id, IHasAABB2D shape, Transform2D transform2D)
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2020-01-02 07:08:14 +00:00
|
|
|
|
var box = shape.TransformedAABB(transform2D);
|
2019-12-30 06:19:10 +00:00
|
|
|
|
var minHash = Hash(box.Min);
|
|
|
|
|
var maxHash = Hash(box.Max);
|
2019-09-06 08:11:58 +00:00
|
|
|
|
|
2020-01-02 07:08:14 +00:00
|
|
|
|
for (var i = minHash.Item1; i <= maxHash.Item1; i++)
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2020-01-02 07:08:14 +00:00
|
|
|
|
for (var j = minHash.Item2; j <= maxHash.Item2; j++)
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2020-01-01 01:57:38 +00:00
|
|
|
|
var key = MakeLong(i, j);
|
2020-01-01 00:13:11 +00:00
|
|
|
|
if (hashDictionary.ContainsKey(key))
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2020-01-01 00:13:11 +00:00
|
|
|
|
foreach (var t in hashDictionary[key])
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2019-09-19 00:00:28 +00:00
|
|
|
|
var (otherShape, otherTransform) = IDLookup[t];
|
2020-01-05 21:10:52 +00:00
|
|
|
|
if (!id.Equals(t) && AABB.TestOverlap(box, otherShape.TransformedAABB(otherTransform)))
|
|
|
|
|
{
|
|
|
|
|
yield return (t, otherShape, otherTransform);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// <summary>
|
|
|
|
|
/// Retrieves objects based on a pre-transformed AABB.
|
|
|
|
|
/// </summary>
|
|
|
|
|
/// <param name="aabb">A transformed AABB.</param>
|
|
|
|
|
/// <returns></returns>
|
|
|
|
|
public IEnumerable<(T, IHasAABB2D, Transform2D)> 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, otherTransform) = IDLookup[t];
|
|
|
|
|
if (AABB.TestOverlap(aabb, otherShape.TransformedAABB(otherTransform)))
|
2020-01-02 03:24:42 +00:00
|
|
|
|
{
|
|
|
|
|
yield return (t, otherShape, otherTransform);
|
|
|
|
|
}
|
2019-09-06 08:11:58 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-10-25 21:01:36 +00:00
|
|
|
|
/// <summary>
|
|
|
|
|
/// Removes everything that has been inserted into the SpatialHash.
|
|
|
|
|
/// </summary>
|
2019-09-06 08:11:58 +00:00
|
|
|
|
public void Clear()
|
|
|
|
|
{
|
2020-01-01 00:13:11 +00:00
|
|
|
|
foreach (var hash in hashDictionary.Values)
|
2019-09-06 08:11:58 +00:00
|
|
|
|
{
|
2020-01-01 00:13:11 +00:00
|
|
|
|
hash.Clear();
|
2019-09-06 08:11:58 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
IDLookup.Clear();
|
|
|
|
|
}
|
2020-01-01 01:57:38 +00:00
|
|
|
|
|
|
|
|
|
private static long MakeLong(int left, int right)
|
|
|
|
|
{
|
|
|
|
|
return ((long)left << 32) | ((uint)right);
|
|
|
|
|
}
|
2019-09-06 08:11:58 +00:00
|
|
|
|
}
|
2019-12-30 06:19:10 +00:00
|
|
|
|
}
|