forked from bit/DotRecastNetSim
81 lines
3.6 KiB
C#
81 lines
3.6 KiB
C#
|
/*
|
||
|
|
recast4j copyright (c) 2021 Piotr Piastucki piotr@jtilia.org
|
||
|
|
|
||
|
|
This software is provided 'as-is', without any express or implied
|
||
|
|
warranty. In no event will the authors be held liable for any damages
|
||
|
|
arising from the use of this software.
|
||
|
|
Permission is granted to anyone to use this software for any purpose,
|
||
|
|
including commercial applications, and to alter it and redistribute it
|
||
|
|
freely, subject to the following restrictions:
|
||
|
|
1. The origin of this software must not be misrepresented; you must not
|
||
|
|
claim that you wrote the original software. If you use this software
|
||
|
|
in a product, an acknowledgment in the product documentation would be
|
||
|
|
appreciated but is not required.
|
||
|
|
2. Altered source versions must be plainly marked as such, and must not be
|
||
|
|
misrepresented as being the original software.
|
||
|
|
3. This notice may not be removed or altered from any source distribution.
|
||
|
|
*/
|
||
|
|
|
||
|
|
using System.Collections.Generic;
|
||
|
|
using Moq;
|
||
|
|
using NUnit.Framework;
|
||
|
|
|
||
|
|
namespace DotRecast.Detour.Crowd.Test;
|
||
|
|
|
||
|
|
public class PathCorridorTest {
|
||
|
|
|
||
|
|
private readonly PathCorridor corridor = new PathCorridor();
|
||
|
|
private readonly QueryFilter filter = new DefaultQueryFilter();
|
||
|
|
|
||
|
|
[SetUp]
|
||
|
|
public void setUp() {
|
||
|
|
corridor.reset(0, new float[] {10,20,30});
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void shouldKeepOriginalPathInFindCornersWhenNothingCanBePruned() {
|
||
|
|
List<StraightPathItem> straightPath = new();
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 11, 20, 30.00001f }, 0, 0));
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 12, 20, 30.00002f }, 0, 0));
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 11f, 21, 32f }, 0, 0));
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 11f, 21, 32f }, 0, 0));
|
||
|
|
Result<List<StraightPathItem>> result = Results.success(straightPath);
|
||
|
|
var mockQuery = new Mock<NavMeshQuery>(It.IsAny<NavMesh>());
|
||
|
|
mockQuery.Setup(q => q.findStraightPath(
|
||
|
|
It.IsAny<float[]>(),
|
||
|
|
It.IsAny<float[]>(),
|
||
|
|
It.IsAny<List<long>>(),
|
||
|
|
It.IsAny<int>(),
|
||
|
|
It.IsAny<int>())
|
||
|
|
).Returns(result);
|
||
|
|
List<StraightPathItem> path = corridor.findCorners(int.MaxValue, mockQuery.Object, filter);
|
||
|
|
Assert.That(path.Count, Is.EqualTo(4));
|
||
|
|
Assert.That(path, Is.EqualTo(straightPath));
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void shouldPrunePathInFindCorners() {
|
||
|
|
List<StraightPathItem> straightPath = new();
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 10, 20, 30.00001f }, 0, 0)); // too close
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 10, 20, 30.00002f }, 0, 0)); // too close
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 11f, 21, 32f }, 0, 0));
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 12f, 22, 33f }, NavMeshQuery.DT_STRAIGHTPATH_OFFMESH_CONNECTION, 0)); // offmesh
|
||
|
|
straightPath.Add(new StraightPathItem(new float[] { 11f, 21, 32f }, NavMeshQuery.DT_STRAIGHTPATH_OFFMESH_CONNECTION, 0)); // offmesh
|
||
|
|
Result<List<StraightPathItem>> result = Results.success(straightPath);
|
||
|
|
|
||
|
|
var mockQuery = new Mock<NavMeshQuery>(It.IsAny<NavMesh>());
|
||
|
|
var s = mockQuery.Setup(q => q.findStraightPath(
|
||
|
|
It.IsAny<float[]>(),
|
||
|
|
It.IsAny<float[]>(),
|
||
|
|
It.IsAny<List<long>>(),
|
||
|
|
It.IsAny<int>(),
|
||
|
|
It.IsAny<int>())
|
||
|
|
).Returns(result);
|
||
|
|
|
||
|
|
List<StraightPathItem> path = corridor.findCorners(int.MaxValue, mockQuery.Object, filter);
|
||
|
|
Assert.That(path.Count, Is.EqualTo(2));
|
||
|
|
Assert.That(path, Is.EqualTo(new List<StraightPathItem> { straightPath[2], straightPath[3] }));
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|