| /dports/net/olsrd/olsrd-0.9.8/lib/info.java/org.olsr.v1.info.api/src/org/olsr/v1/info/api/dto/ |
| H A D | JsonInfoSgwBandwidth.java | 21 private double pathCost = Double.POSITIVE_INFINITY; field in JsonInfoSgwBandwidth
93 return this.pathCost; in getPathCost()
100 public void setPathCost(final double pathCost) { in setPathCost() argument
101 if (Double.compare(pathCost, OlsrdConstants.ROUTE_COST_BROKEN) >= 0) { in setPathCost()
102 this.pathCost = Double.POSITIVE_INFINITY; in setPathCost()
104 this.pathCost = pathCost; in setPathCost()
218 long temp = Double.doubleToLongBits(this.pathCost); in hashCode()
283 result = Double.compare(this.pathCost, other.pathCost); in compareTo()
323 builder.append(this.pathCost); in toString()
|
| H A D | JsonInfoGatewaysEntryBase.java | 31 private double pathCost = Double.POSITIVE_INFINITY; field in JsonInfoGatewaysEntryBase
245 return this.pathCost; in getPathCost()
252 public void setPathCost(final double pathCost) { in setPathCost() argument
253 if (Double.compare(pathCost, OlsrdConstants.ROUTE_COST_BROKEN) >= 0) { in setPathCost()
254 this.pathCost = Double.POSITIVE_INFINITY; in setPathCost()
256 this.pathCost = pathCost; in setPathCost()
293 temp = Double.doubleToLongBits(this.pathCost); in hashCode()
384 result = Double.compare(this.pathCost, other.pathCost); in compareTo()
427 builder.append(this.pathCost); in toString()
|
| H A D | JsonInfoTopologyEntry.java | 18 private double pathCost = Double.POSITIVE_INFINITY; field in JsonInfoTopologyEntry
57 return this.pathCost; in getPathCost()
64 public void setPathCost(final double pathCost) { in setPathCost() argument
65 if (Double.compare(pathCost, OlsrdConstants.ROUTE_COST_BROKEN) >= 0) { in setPathCost()
66 this.pathCost = Double.POSITIVE_INFINITY; in setPathCost()
68 this.pathCost = pathCost; in setPathCost()
296 temp = Double.doubleToLongBits(this.pathCost); in hashCode()
346 result = Double.compare(this.pathCost, other.pathCost); in compareTo()
429 builder.append(this.pathCost); in toString()
|
| /dports/graphics/scantailor/scantailor-advanced-1.0.16/dewarping/ |
| H A D | TopBottomEdgeTracer.cpp | 68 float pathCost; member
82 pathCost = -1; in setupForPadding()
141 float pathCost{}; member
465 data[offset].pathCost = 0; in prepareForShortestPathsFrom()
480 assert(node->pathCost >= 0); in propagateShortestPaths()
746 step.pathCost = 0; in downTheHillSnake()
751 step.pathCost += 100; in downTheHillSnake()
765 float cost = prev_step.pathCost + step.pathCost; in downTheHillSnake()
878 step.pathCost = 0; in upTheHillSnake()
885 step.pathCost += 100; in upTheHillSnake()
[all …]
|
| H A D | TextLineRefiner.cpp | 520 step_storage.back().pathCost = 0; in tangentMovement()
533 step.pathCost = NumericTraits<float>::max(); in tangentMovement()
548 if (cost < step.pathCost) { in tangentMovement()
549 step.pathCost = cost; in tangentMovement()
567 if (step.pathCost < best_cost) { in tangentMovement()
568 best_cost = step.pathCost; in tangentMovement()
630 …step.pathCost = step_storage[prev_step_idx].pathCost + calcExternalEnergy(gradient, step.node, dow… in normalMovement()
658 if (cost < step.pathCost) { in normalMovement()
659 step.pathCost = cost; in normalMovement()
677 if (step.pathCost < best_cost) { in normalMovement()
[all …]
|
| H A D | TextLineRefiner.h | 67 float pathCost{0};
|
| /dports/games/spring/spring_98.0/rts/Sim/Path/Default/ |
| H A D | IPath.h | 26 , pathCost(-1.0f) in Path()
38 float pathCost; member
|
| H A D | IPathFinder.cpp | 97 path.pathCost = PATHCOST_INFINITY; in GetPath()
138 LOG_L(L_DEBUG, "Path cost: %f", path.pathCost); in GetPath()
|
| H A D | PathEstimator.cpp | 358 vertexCosts[vertexNbr] = path.pathCost; in CalculateVertex()
676 foundPath.pathCost = blockStates.fCost[mGoalBlockIdx] - mGoalHeuristic; in FinishSearch()
|
| H A D | PathFinder.cpp | 330 foundPath.pathCost = blockStates.fCost[mGoalBlockIdx]; in FinishSearch()
|
| /dports/games/spring/spring_98.0/AI/Skirmish/KAIK/ |
| H A D | PathFinder.cpp | 278 float pathCost = 0.0f; in MakePath() local
287 …if (micropather->FindBestPathToPointOnRadius(XY2Node(sx, sy), XY2Node(ex, ey), &path, &pathCost, r… in MakePath()
297 return pathCost; in MakePath()
302 float pathCost = 0.0f; in FindBestPath() local
308 return pathCost; in FindBestPath()
406 …if (micropather->FindBestPathToAnyGivenPoint(Pos2Node(startPos), endNodes, &path, &pathCost) == Mi… in FindBestPath()
419 return pathCost; in FindBestPath()
|
| /dports/games/fheroes2/fheroes2-0.9.11/src/fheroes2/battle/ |
| H A D | battle_pathfinding.cpp | 102 const uint32_t pathCost = _cache[targetCell]._cost; in findTwoMovesOverlap() local
103 if ( pathCost >= movementRange * 2 ) in findTwoMovesOverlap()
107 uint32_t nodeCost = pathCost; in findTwoMovesOverlap()
119 if ( movementRange > 0 && !path.empty() && pathCost - nodeCost >= movementRange ) in findTwoMovesOverlap()
|
| /dports/games/openjk/OpenJK-07675e2/codemp/server/NPCNav/ |
| H A D | navigator.cpp | 1349 int cost, pathCost, bestCost = Q3_INFINITE; in GetBestPathBetweenEnts() local
1444 nextNode = GetBestNodeAltRoute( (*nci).nodeID, (*nci2).nodeID, &pathCost, bestNode ); in GetBestPathBetweenEnts()
1445 cost += pathCost; in GetBestPathBetweenEnts()
2304 *pathCost = 0; in GetBestNodeAltRoute()
2334 *pathCost += start->GetEdgeCost( i ); in GetBestNodeAltRoute()
2346 *pathCost = Q3_INFINITE; in GetBestNodeAltRoute()
2364 *pathCost = bestCost; in GetBestNodeAltRoute()
2567 int pathCost = 0; in GetPathCost() local
2589 return pathCost + moveNode->GetEdgeCost( i ); in GetPathCost()
2609 pathCost += bestCost; in GetPathCost()
[all …]
|
| H A D | navigator.h | 215 int GetBestNodeAltRoute( int startID, int endID, int *pathCost, int rejectID = NODE_NONE );
|
| /dports/games/openjk/OpenJK-07675e2/codeJK2/game/ |
| H A D | g_navigator.cpp | 1310 int cost, pathCost, bestCost = Q3_INFINITE; in GetBestPathBetweenEnts() local
1405 nextNode = GetBestNodeAltRoute( (*nci).nodeID, (*nci2).nodeID, &pathCost, bestNode ); in GetBestPathBetweenEnts()
1406 cost += pathCost; in GetBestPathBetweenEnts()
2255 *pathCost = 0; in GetBestNodeAltRoute()
2285 *pathCost += start->GetEdgeCost( i ); in GetBestNodeAltRoute()
2297 *pathCost = Q3_INFINITE; in GetBestNodeAltRoute()
2315 *pathCost = bestCost; in GetBestNodeAltRoute()
2518 int pathCost = 0; in GetPathCost() local
2538 return pathCost + moveNode->GetEdgeCost( i ); in GetPathCost()
2558 pathCost += bestCost; in GetPathCost()
[all …]
|
| H A D | g_navigator.h | 218 int GetBestNodeAltRoute( int startID, int endID, int *pathCost, int rejectID = NODE_NONE );
|
| /dports/misc/ompl/ompl-1.5.2/src/ompl/geometric/planners/prm/src/ |
| H A D | PRM.cpp | 419 base::Cost pathCost = p->cost(opt_); in maybeConstructSolution() local
420 if (opt_->isCostBetterThan(pathCost, bestCost_)) in maybeConstructSolution()
421 bestCost_ = pathCost; in maybeConstructSolution()
423 if (opt_->isSatisfied(pathCost)) in maybeConstructSolution()
428 if (opt_->isCostBetterThan(pathCost, sol_cost)) in maybeConstructSolution()
431 sol_cost = pathCost; in maybeConstructSolution()
|
| H A D | SPARStwo.cpp | 193 base::Cost pathCost = p->cost(opt_); in haveSolution() local
194 if (opt_->isCostBetterThan(pathCost, bestCost_)) in haveSolution()
195 bestCost_ = pathCost; in haveSolution()
197 if (opt_->isSatisfied(pathCost)) in haveSolution()
202 if (opt_->isCostBetterThan(pathCost, sol_cost)) in haveSolution()
205 sol_cost = pathCost; in haveSolution()
|
| H A D | SPARS.cpp | 269 base::Cost pathCost = p->cost(opt_); in haveSolution() local
270 if (opt_->isCostBetterThan(pathCost, bestCost_)) in haveSolution()
271 bestCost_ = pathCost; in haveSolution()
273 if (opt_->isSatisfied(pathCost)) in haveSolution()
278 if (opt_->isCostBetterThan(pathCost, sol_cost)) in haveSolution()
281 sol_cost = pathCost; in haveSolution()
|
| /dports/net-mgmt/librenms/librenms-21.5.1/sql-schema/ |
| H A D | 095.sql | 1 …ned NOT NULL,`state` varchar(11) NOT NULL,`enable` varchar(8) NOT NULL,`pathCost` int(10) unsigned…
|
| /dports/misc/ompl/ompl-1.5.2/src/ompl/geometric/planners/ |
| H A D | AnytimePathShortening.cpp | 122 base::Cost pathCost = path->cost(opt); in addPath() local
124 if (opt->isCostBetterThan(pathCost, bestCost_)) in addPath()
126 bestCost_ = pathCost; in addPath()
|
| /dports/graphics/recastnavigation/recastnavigation-e75adf86f91eb3082220085e42dda62679f9a3ea/Detour/Include/ |
| H A D | DetourNavMeshQuery.h | 146 float pathCost; member
|
| /dports/graphics/recastnavigation/recastnavigation-e75adf86f91eb3082220085e42dda62679f9a3ea/Detour/Source/ |
| H A D | DetourNavMeshQuery.cpp | 1395 rayHit.pathCost = rayHit.t = 0; in updateSlicedFindPath()
1406 cost = parentNode->cost + rayHit.pathCost; in updateSlicedFindPath()
2466 hit->pathCost = 0; in raycast()
2543 …hit->pathCost += filter->getCost(curPos, endPos, prevRef, prevTile, prevPoly, curRef, tile, poly, … in raycast()
2643 …hit->pathCost += filter->getCost(lastPos, curPos, prevRef, prevTile, prevPoly, curRef, tile, poly,… in raycast()
|
| /dports/games/openjk/OpenJK-07675e2/codemp/game/ |
| H A D | g_syscalls.c | 376 int trap_Nav_GetBestNodeAltRoute( int startID, int endID, int *pathCost, int rejectID ) { in trap_Nav_GetBestNodeAltRoute() argument
377 return Q_syscall(G_NAV_GETBESTNODEALTROUTE, startID, endID, pathCost, rejectID); in trap_Nav_GetBestNodeAltRoute()
|
| H A D | g_public.h | 880 int (*Nav_GetBestNodeAltRoute) ( int startID, int endID, int *pathCost, int rejectID );
|