mirror of
https://github.com/space-wizards/RobustToolbox.git
synced 2026-09-16 15:22:27 +02:00
Grid collision rectangles are now drawn as a blue overlay in the CollisionOverlay debug view. GridChunkPartition now also returns the bounding rectangle, which is a union of all the collision rectangles. Each IPhysShape now handles it's own debug drawing with a new method, DebugDraw.
95 lines
2.7 KiB
C#
95 lines
2.7 KiB
C#
using System.Collections.Generic;
|
|
using Moq;
|
|
using NUnit.Framework;
|
|
using Robust.Shared.Map;
|
|
using Robust.Shared.Maths;
|
|
|
|
namespace Robust.UnitTesting.Shared.Map
|
|
{
|
|
[TestFixture, Parallelizable, TestOf(typeof(GridChunkPartition))]
|
|
internal class GridChunkPartition_Tests
|
|
{
|
|
// origin is top left
|
|
private static readonly int[] _testMiscTiles = {
|
|
1, 1, 0, 0,
|
|
0, 1, 1, 0,
|
|
0, 1, 1, 1,
|
|
1, 1, 0, 0,
|
|
};
|
|
|
|
[Test]
|
|
public void PartitionChunk_MiscTiles()
|
|
{
|
|
// Arrange
|
|
var chunk = ChunkFactory(4, _testMiscTiles);
|
|
IList<Box2> rects = new List<Box2>(8);
|
|
|
|
// Act
|
|
GridChunkPartition.PartitionChunk(chunk, ref rects, out var bounds);
|
|
|
|
// Assert
|
|
Assert.That(rects.Count, Is.EqualTo(5));
|
|
|
|
// box origin is top left
|
|
// algorithm goes down columns of array, starting on left side, then moves right, expanding rectangles to the right
|
|
/*
|
|
0 2 . .
|
|
. 2 3 .
|
|
. 2 3 4
|
|
1 2 . .
|
|
*/
|
|
Assert.That(rects[0], Is.EqualTo(new Box2(0, 0, 1, 1)));
|
|
Assert.That(rects[1], Is.EqualTo(new Box2(0, 3, 1, 4)));
|
|
Assert.That(rects[2], Is.EqualTo(new Box2(1, 0, 2, 4)));
|
|
Assert.That(rects[3], Is.EqualTo(new Box2(2, 1, 3, 3)));
|
|
Assert.That(rects[4], Is.EqualTo(new Box2(3, 2, 4, 3)));
|
|
|
|
Assert.That(bounds, Is.EqualTo(new Box2i(0,0,4,4)));
|
|
}
|
|
|
|
// origin is top left
|
|
private static readonly int[] _testJoinTiles = {
|
|
0, 1, 1, 0,
|
|
0, 1, 1, 0,
|
|
0, 1, 1, 0,
|
|
0, 0, 0, 0,
|
|
};
|
|
|
|
[Test]
|
|
public void PartitionChunk_JoinTiles()
|
|
{
|
|
// Arrange
|
|
var chunk = ChunkFactory(4, _testJoinTiles);
|
|
IList<Box2> rects = new List<Box2>(16);
|
|
|
|
// Act
|
|
GridChunkPartition.PartitionChunk(chunk, ref rects, out var bounds);
|
|
|
|
// Assert
|
|
Assert.That(rects.Count, Is.EqualTo(1));
|
|
|
|
// box origin is bottom left
|
|
Assert.That(rects[0], Is.EqualTo(new Box2(1,0,3,3)));
|
|
|
|
Assert.That(bounds, Is.EqualTo(new Box2i(1, 0, 3, 3)));
|
|
}
|
|
|
|
private static IMapChunkInternal ChunkFactory(ushort size, int[] tiles)
|
|
{
|
|
var fakeGrid = new Mock<IMapGridInternal>();
|
|
|
|
var chunk = new MapChunk(fakeGrid.Object, 0, 0, size);
|
|
|
|
for (var i = 0; i < tiles.Length; i++)
|
|
{
|
|
var x = i % size;
|
|
var y = i / size;
|
|
|
|
chunk.SetTile((ushort)x, (ushort)y, new Tile((ushort)tiles[i]));
|
|
}
|
|
|
|
return chunk;
|
|
}
|
|
}
|
|
}
|