veitR/mod-playerbots
1
0
Fork 0
mirror of https://github.com/liyunfan1223/mod-playerbots.git synced 2026-06-20 15:39:25 +02:00
Code Issues Packages Projects Releases Wiki Activity

fix(Core/Travel): Drop short-distance short-circuit in GetFullPath

Browse Source
This commit is contained in:
bash 2026-05-09 13:34:09 +02:00
parent 49be0f279a
commit 71dcd6ff09
1 changed files with 12 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/Mgr/Travel/TravelNode.cpp
View File

@ -1290,14 +1290,18 @@ bool TravelNodeMap::GetFullPath(TravelPlan& plan,
plan.Reset(); plan.Reset();
plan.destination = destination; plan.destination = destination;
// Short distance — direct walk, no nodes needed // Removed the "short distance — direct walk" short-circuit that
if (botPos.fDist(destination) < MAX_PATHFINDING_DISTANCE && // returned a 2-point plan [botPos, destination] without any
botPos.GetMapId() == destination.GetMapId()) // navmesh validation. NODE_PREPATH dispatch then MoveTo'd the
{ // destination as a single straight-line spline, which clipped
plan.steps.addPoint(botPos, PathNodeType::NODE_PREPATH); // through walls/mountains whenever bot and dest sat on opposite
plan.steps.addPoint(destination, PathNodeType::NODE_PATH); // sides of geometry within 296y.
return true; //
} // Falling through to the graph build here means: if a graph
// route exists, use it (now validated by IsPathCheating in
// BuildPath + RefineWalkPoints at runtime); otherwise return
// false so MoveFarTo falls through to its chained mmap probe,
// which resolves an mmap-clean waypoint chain.
std::shared_lock<std::shared_timed_mutex> guard(m_nMapMtx); std::shared_lock<std::shared_timed_mutex> guard(m_nMapMtx);