forked from mirror/DotRecast
63 lines
2.8 KiB
C#
63 lines
2.8 KiB
C#
/*
|
|
Copyright (c) 2009-2010 Mikko Mononen memon@inside.org
|
|
recast4j copyright (c) 2015-2019 Piotr Piastucki piotr@jtilia.org
|
|
DotRecast Copyright (c) 2023 Choi Ikpil ikpil@naver.com
|
|
|
|
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 System.IO;
|
|
using DotRecast.Core;
|
|
using DotRecast.Detour.QueryResults;
|
|
using DotRecast.Detour.TileCache.Io;
|
|
using NUnit.Framework;
|
|
|
|
namespace DotRecast.Detour.TileCache.Test;
|
|
|
|
public class TileCacheFindPathTest : AbstractTileCacheTest
|
|
{
|
|
private readonly Vector3f start = Vector3f.Of(39.44734f, 9.998177f, -0.784811f);
|
|
private readonly Vector3f end = Vector3f.Of(19.292645f, 11.611748f, -57.750366f);
|
|
private readonly NavMesh navmesh;
|
|
private readonly NavMeshQuery query;
|
|
|
|
public TileCacheFindPathTest()
|
|
{
|
|
using var msis = new MemoryStream(Loader.ToBytes("dungeon_all_tiles_tilecache.bin"));
|
|
using var @is = new BinaryReader(msis);
|
|
TileCache tcC = new TileCacheReader().read(@is, 6, new TestTileCacheMeshProcess());
|
|
navmesh = tcC.getNavMesh();
|
|
query = new NavMeshQuery(navmesh);
|
|
}
|
|
|
|
[Test]
|
|
public void testFindPath()
|
|
{
|
|
QueryFilter filter = new DefaultQueryFilter();
|
|
Vector3f extents = Vector3f.Of(2f, 4f, 2f);
|
|
Result<FindNearestPolyResult> findPolyStart = query.findNearestPoly(start, extents, filter);
|
|
Result<FindNearestPolyResult> findPolyEnd = query.findNearestPoly(end, extents, filter);
|
|
long startRef = findPolyStart.result.getNearestRef();
|
|
long endRef = findPolyEnd.result.getNearestRef();
|
|
Vector3f startPos = findPolyStart.result.getNearestPos();
|
|
Vector3f endPos = findPolyEnd.result.getNearestPos();
|
|
Result<List<long>> path = query.findPath(startRef, endRef, startPos, endPos, filter);
|
|
int maxStraightPath = 256;
|
|
int options = 0;
|
|
Result<List<StraightPathItem>> pathStr = query.findStraightPath(startPos, endPos, path.result, maxStraightPath, options);
|
|
Assert.That(pathStr.result.Count, Is.EqualTo(8));
|
|
}
|
|
} |