Searched refs:GetPathCost (Results 1 – 11 of 11) sorted by relevance
| /dports/games/spring/spring_98.0/rts/Sim/Path/QTPFS/ |
| H A D | PathSearch.cpp | 187 if (curNode->GetPathCost(NODE_PATH_COST_H) < minNode->GetPathCost(NODE_PATH_COST_H)) in IterateNodes()
241 curNode->GetPathCost(NODE_PATH_COST_G) + in IterateNodeNeighbors()
259 curNode->GetPathCost(NODE_PATH_COST_G) + in IterateNodeNeighbors()
282 if (gCosts[netPointIdx] >= nxtNode->GetPathCost(NODE_PATH_COST_G)) in IterateNodeNeighbors()
|
| H A D | Node.hpp | 28 float GetHeapPriority() const { return GetPathCost(NODE_PATH_COST_F); } in GetHeapPriority()
79 float GetPathCost(unsigned int type) const;
|
| H A D | Node.cpp | 43 float QTPFS::INode::GetPathCost(unsigned int type) const { in GetPathCost() function in QTPFS::INode
|
| /dports/games/openjk/OpenJK-07675e2/codemp/server/NPCNav/ |
| H A D | navigator.cpp | 1449 cost += GetPathCost( (*nci).nodeID, (*nci2).nodeID ); in GetBestPathBetweenEnts()
1617 dist = GetPathCost( (*nci).nodeID, targetID ); in GetNearestNode()
2313 rejectRank = GetPathCost( startID, endID );//end->GetRank( start->GetEdge(i) ); in GetBestNodeAltRoute()
2323 testRank = GetPathCost( edgeID, endID );//end->GetRank( edgeID ); in GetBestNodeAltRoute()
2545 unsigned int CNavigator::GetPathCost( int startID, int endID ) in GetPathCost() function in CNavigator
|
| H A D | navigator.h | 199 unsigned int GetPathCost( int startID, int endID );
|
| /dports/games/openjk/OpenJK-07675e2/codeJK2/game/ |
| H A D | g_navigator.h | 202 unsigned int GetPathCost( int startID, int endID );
|
| H A D | g_navigator.cpp | 1410 cost += GetPathCost( (*nci).nodeID, (*nci2).nodeID ); in GetBestPathBetweenEnts()
1578 dist = GetPathCost( (*nci).nodeID, targetID ); in GetNearestNode()
2264 rejectRank = GetPathCost( startID, endID );//end->GetRank( start->GetEdge(i) ); in GetBestNodeAltRoute()
2274 testRank = GetPathCost( edgeID, endID );//end->GetRank( edgeID ); in GetBestNodeAltRoute()
2496 unsigned int CNavigator::GetPathCost( int startID, int endID ) in GetPathCost() function in CNavigator
|
| H A D | AI_Utils.cpp | 147 …group->member[i].pathCostToEnemy = navigator.GetPathCost( group->member[i].waypoint, group->enemyW… in AI_SortGroupByPathCostToEnemy()
|
| H A D | AI_Stormtrooper.cpp | 1766 …else if ( group->enemy->waypoint == WAYPOINT_NONE || (navigator.GetPathCost( NPC->waypoint, group-… in ST_Commander()
|
| H A D | NPC_combat.cpp | 2684 cost = navigator.GetPathCost( waypoint, level.combatPoints[i].waypoint ); in NPC_FindCombatPoint()
|
| /dports/games/openjk/OpenJK-07675e2/codemp/server/ |
| H A D | sv_gameapi.cpp | 799 return navigator.GetPathCost( startID, endID ); in SV_Nav_GetPathCost()
2152 return navigator.GetPathCost(args[1], args[2]); in SV_GameSystemCalls()
|