2023-03-14 08:02:43 +03:00
|
|
|
/*
|
|
|
|
recast4j copyright (c) 2021 Piotr Piastucki piotr@jtilia.org
|
2023-08-19 10:13:37 +03:00
|
|
|
DotRecast Copyright (c) 2023 Choi Ikpil ikpil@naver.com
|
2023-03-14 08:02:43 +03:00
|
|
|
|
|
|
|
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;
|
2023-10-16 17:55:34 +03:00
|
|
|
using DotRecast.Core.Numerics;
|
2023-06-23 01:54:28 +03:00
|
|
|
|
2023-03-14 08:02:43 +03:00
|
|
|
using Moq;
|
|
|
|
using NUnit.Framework;
|
|
|
|
|
|
|
|
namespace DotRecast.Detour.Crowd.Test;
|
|
|
|
|
2023-04-25 17:22:44 +03:00
|
|
|
[Parallelizable]
|
2023-03-16 19:48:49 +03:00
|
|
|
public class PathCorridorTest
|
|
|
|
{
|
2023-06-08 15:38:02 +03:00
|
|
|
private readonly DtPathCorridor corridor = new DtPathCorridor();
|
|
|
|
private readonly IDtQueryFilter filter = new DtQueryDefaultFilter();
|
2023-03-14 08:02:43 +03:00
|
|
|
|
|
|
|
[SetUp]
|
2023-05-05 02:44:48 +03:00
|
|
|
public void SetUp()
|
2023-03-16 19:48:49 +03:00
|
|
|
{
|
2023-10-12 17:52:32 +03:00
|
|
|
corridor.Reset(0, new RcVec3f(10, 20, 30));
|
2023-03-14 08:02:43 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
[Test]
|
2023-05-05 02:44:48 +03:00
|
|
|
public void ShouldKeepOriginalPathInFindCornersWhenNothingCanBePruned()
|
2023-03-16 19:48:49 +03:00
|
|
|
{
|
2023-10-04 18:11:58 +03:00
|
|
|
List<DtStraightPath> straightPath = new();
|
2023-10-12 17:52:32 +03:00
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(11, 20, 30.00001f), 0, 0));
|
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(12, 20, 30.00002f), 0, 0));
|
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(11f, 21, 32f), 0, 0));
|
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(11f, 21, 32f), 0, 0));
|
2023-06-08 15:38:02 +03:00
|
|
|
var mockQuery = new Mock<DtNavMeshQuery>(It.IsAny<DtNavMesh>());
|
2023-05-05 02:44:48 +03:00
|
|
|
mockQuery.Setup(q => q.FindStraightPath(
|
2023-06-19 19:36:03 +03:00
|
|
|
It.IsAny<RcVec3f>(),
|
|
|
|
It.IsAny<RcVec3f>(),
|
|
|
|
It.IsAny<List<long>>(),
|
2023-10-04 18:11:58 +03:00
|
|
|
ref It.Ref<List<DtStraightPath>>.IsAny,
|
2023-06-19 19:36:03 +03:00
|
|
|
It.IsAny<int>(),
|
|
|
|
It.IsAny<int>())
|
|
|
|
)
|
|
|
|
.Callback((RcVec3f startPos, RcVec3f endPos, List<long> path,
|
2023-10-04 18:11:58 +03:00
|
|
|
ref List<DtStraightPath> refStraightPath, int maxStraightPath, int options) =>
|
2023-06-19 19:36:03 +03:00
|
|
|
{
|
|
|
|
refStraightPath = straightPath;
|
|
|
|
})
|
|
|
|
.Returns(() => DtStatus.DT_SUCCSESS);
|
|
|
|
|
2023-10-04 18:11:58 +03:00
|
|
|
var path = new List<DtStraightPath>();
|
2023-06-19 19:36:03 +03:00
|
|
|
corridor.FindCorners(ref path, int.MaxValue, mockQuery.Object, filter);
|
2023-03-14 08:02:43 +03:00
|
|
|
Assert.That(path.Count, Is.EqualTo(4));
|
|
|
|
Assert.That(path, Is.EqualTo(straightPath));
|
|
|
|
}
|
|
|
|
|
|
|
|
[Test]
|
2023-05-05 02:44:48 +03:00
|
|
|
public void ShouldPrunePathInFindCorners()
|
2023-03-16 19:48:49 +03:00
|
|
|
{
|
2023-10-04 18:11:58 +03:00
|
|
|
List<DtStraightPath> straightPath = new();
|
2023-10-12 17:52:32 +03:00
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(10, 20, 30.00001f), 0, 0)); // too close
|
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(10, 20, 30.00002f), 0, 0)); // too close
|
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(11f, 21, 32f), 0, 0));
|
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(12f, 22, 33f), DtStraightPathFlags.DT_STRAIGHTPATH_OFFMESH_CONNECTION, 0)); // offmesh
|
|
|
|
straightPath.Add(new DtStraightPath(new RcVec3f(11f, 21, 32f), DtStraightPathFlags.DT_STRAIGHTPATH_OFFMESH_CONNECTION, 0)); // offmesh
|
2023-03-14 08:02:43 +03:00
|
|
|
|
2023-06-08 15:38:02 +03:00
|
|
|
var mockQuery = new Mock<DtNavMeshQuery>(It.IsAny<DtNavMesh>());
|
2023-06-19 19:36:03 +03:00
|
|
|
mockQuery.Setup(q => q.FindStraightPath(
|
|
|
|
It.IsAny<RcVec3f>(),
|
|
|
|
It.IsAny<RcVec3f>(),
|
|
|
|
It.IsAny<List<long>>(),
|
2023-10-04 18:11:58 +03:00
|
|
|
ref It.Ref<List<DtStraightPath>>.IsAny,
|
2023-06-19 19:36:03 +03:00
|
|
|
It.IsAny<int>(),
|
|
|
|
It.IsAny<int>())
|
|
|
|
).Callback((RcVec3f startPos, RcVec3f endPos, List<long> path,
|
2023-10-04 18:11:58 +03:00
|
|
|
ref List<DtStraightPath> refStraightPath, int maxStraightPath, int options) =>
|
2023-06-19 19:36:03 +03:00
|
|
|
{
|
|
|
|
refStraightPath = straightPath;
|
|
|
|
})
|
|
|
|
.Returns(() => DtStatus.DT_SUCCSESS);
|
2023-03-14 08:02:43 +03:00
|
|
|
|
2023-10-04 18:11:58 +03:00
|
|
|
var path = new List<DtStraightPath>();
|
2023-06-19 19:36:03 +03:00
|
|
|
corridor.FindCorners(ref path, int.MaxValue, mockQuery.Object, filter);
|
2023-03-14 08:02:43 +03:00
|
|
|
Assert.That(path.Count, Is.EqualTo(2));
|
2023-10-04 18:11:58 +03:00
|
|
|
Assert.That(path, Is.EqualTo(new List<DtStraightPath> { straightPath[2], straightPath[3] }));
|
2023-03-14 08:02:43 +03:00
|
|
|
}
|
2023-06-19 19:36:03 +03:00
|
|
|
}
|