Fast spatial search
for .NET 10.

using Tedd.RTree;

var tree = new RTree<string>(maxEntries: 16);
var oldBounds = new Rectangle(0, 0, 10, 10);
tree.Insert(oldBounds, "A");
tree.Insert(new Rectangle(20, 20, 30, 30), "B");
tree.Update(oldBounds, "A", new Rectangle(5, 5, 15, 15));

List<string> matches = tree.Search(
    new Rectangle(8, 8, 12, 12));
// matches contains "A"

using Tedd.RTree;

var entries = new[]
{
    new SpatialEntry<int>(new Rectangle(0, 0, 4, 4), 1),
    new SpatialEntry<int>(new Rectangle(5, 5, 9, 9), 2)
};

var tree = new RTree<int>();
tree.BulkLoad(entries);

var results = new List<int>();
int added = tree.Search(new Rectangle(3, 3, 6, 6), results);
// added == 2

using Tedd.RTree;

var index = new SnapshotRTree<int>();
index.ReplaceAll(new[]
{
    new SpatialEntry<int>(new Rectangle(0, 0, 10, 10), 42)
});

List<int> matches = index.Search(new Rectangle(5, 5, 6, 6));

using Tedd.RTree;

using var index = new ConcurrentRTree<int>();
index.Add(new Rectangle(0, 0, 10, 10), 42);
index.Move(42, new Rectangle(20, 20, 30, 30));

List<int> matches = index.Search(new Rectangle(20, 20, 21, 21));