| /dports/finance/quantlib/QuantLib-1.20/ql/experimental/math/ |
| H A D | hybridsimulatedannealing.hpp | 133 Array bestPoint(x); in minimize() local
137 Real bestValue = P.value(bestPoint); in minimize()
172 bestPoint = newPoint; in minimize()
201 currentPoint = bestPoint; in minimize()
223 P.setCurrentValue(bestPoint); in minimize()
|
| /dports/graphics/lightzone/LightZone-4.1.8-3-g36e87773/macosx/helpers/JavaAppLauncher/ |
| H A D | SetJVMVersion.mm | 87 int bestMajor = 0, bestMinor = 0, bestPoint = 0;
107 dirPoint >= jvmPoint && dirPoint >= bestPoint
110 bestPoint = dirPoint;
121 bestPoint = dirPoint;
|
| /dports/astro/merkaartor/merkaartor-0.19.0/plugins/background/MCadastreFranceBackground/qadastre/ |
| H A D | tile.cpp | 66 QPoint bestPoint(-1, -1); in getNeightbour() local
70 bestPoint = pt; in getNeightbour()
73 return bestPoint; in getNeightbour()
|
| /dports/games/libretro-scummvm/scummvm-7b1e929/engines/saga/ |
| H A D | actor_path.cpp | 94 Point bestPoint; in findActorPath() local
199 i = fillPathArray(fromPoint, toPoint, bestPoint); in findActorPath()
201 if (fromPoint == bestPoint) { in findActorPath()
202 actor->addWalkStepPoint(bestPoint); in findActorPath()
210 setActorPath(actor, fromPoint, bestPoint); in findActorPath()
272 int Actor::fillPathArray(const Point &fromPoint, const Point &toPoint, Point &bestPoint) { in fillPathArray() argument
329 bestPoint = toPoint; in fillPathArray()
340 bestPoint = bestPath; in fillPathArray()
|
| H A D | actor.h | 583 int fillPathArray(const Point &fromPoint, const Point &toPoint, Point &bestPoint);
|
| /dports/games/scummvm/scummvm-2.5.1/engines/saga/ |
| H A D | actor_path.cpp | 94 Point bestPoint; in findActorPath() local
199 i = fillPathArray(fromPoint, toPoint, bestPoint); in findActorPath()
201 if (fromPoint == bestPoint) { in findActorPath()
202 actor->addWalkStepPoint(bestPoint); in findActorPath()
210 setActorPath(actor, fromPoint, bestPoint); in findActorPath()
272 int Actor::fillPathArray(const Point &fromPoint, const Point &toPoint, Point &bestPoint) { in fillPathArray() argument
329 bestPoint = toPoint; in fillPathArray()
340 bestPoint = bestPath; in fillPathArray()
|
| H A D | actor.h | 591 int fillPathArray(const Point &fromPoint, const Point &toPoint, Point &bestPoint);
|
| /dports/biology/seqan1/seqan-1.3.1/seqan/chaining/ |
| H A D | tree_chain_sop.h | 130 MetaFragment_< FragType > * bestPoint = NULL; //&_meta( *points.begin() ); in _computeChain() local
160 bestPoint = &_meta( *result ); in _computeChain()
165 _setPred( meta, *bestPoint ); in _computeChain()
|
| /dports/editors/calligra/calligra-3.2.1/libs/flake/tools/ |
| H A D | KoPathTool.cpp | 563 KoPathPoint * bestPoint = 0; in mouseMoveEvent() local
576 bestPoint = p; in mouseMoveEvent()
585 bestPoint = p; in mouseMoveEvent()
594 bestPoint = p; in mouseMoveEvent()
600 if (! bestPoint) in mouseMoveEvent()
610 … if (prev && prev->activePoint() == bestPoint && prev->activePointType() == bestPointType) in mouseMoveEvent()
616 m_activeHandle = new PointHandle(this, bestPoint, bestPointType); in mouseMoveEvent()
|
| /dports/games/openjk/OpenJK-07675e2/codemp/game/ |
| H A D | NPC_senses.c | 895 int i, bestPoint = ENTITYNUM_NONE; in G_FindLocalInterestPoint() local
919 bestPoint = i; in G_FindLocalInterestPoint()
924 if ( bestPoint != ENTITYNUM_NONE && level.interestPoints[bestPoint].target ) in G_FindLocalInterestPoint()
926 G_UseTargets2( self, self, level.interestPoints[bestPoint].target ); in G_FindLocalInterestPoint()
928 return bestPoint; in G_FindLocalInterestPoint()
|
| /dports/games/openjk/OpenJK-07675e2/codeJK2/game/ |
| H A D | NPC_senses.cpp | 897 int i, bestPoint = ENTITYNUM_NONE; in G_FindLocalInterestPoint() local
921 bestPoint = i; in G_FindLocalInterestPoint()
926 if ( bestPoint != ENTITYNUM_NONE && level.interestPoints[bestPoint].target ) in G_FindLocalInterestPoint()
928 G_UseTargets2( self, self, level.interestPoints[bestPoint].target ); in G_FindLocalInterestPoint()
930 return bestPoint; in G_FindLocalInterestPoint()
|
| /dports/games/openjk/OpenJK-07675e2/code/game/ |
| H A D | NPC_senses.cpp | 1063 int i, bestPoint = ENTITYNUM_NONE; in G_FindLocalInterestPoint() local
1087 bestPoint = i; in G_FindLocalInterestPoint()
1092 if ( bestPoint != ENTITYNUM_NONE && level.interestPoints[bestPoint].target ) in G_FindLocalInterestPoint()
1094 G_UseTargets2( self, self, level.interestPoints[bestPoint].target ); in G_FindLocalInterestPoint()
1096 return bestPoint; in G_FindLocalInterestPoint()
|
| /dports/graphics/krita/krita-4.4.8/libs/flake/tools/ |
| H A D | KoPathTool.cpp | 669 KoPathPoint * bestPoint = 0; in mouseMoveEvent() local
682 bestPoint = p; in mouseMoveEvent()
691 bestPoint = p; in mouseMoveEvent()
700 bestPoint = p; in mouseMoveEvent()
706 if (! bestPoint) { in mouseMoveEvent()
718 … if (prev && prev->activePoint() == bestPoint && prev->activePointType() == bestPointType) in mouseMoveEvent()
721 m_activeHandle.reset(new PointHandle(this, bestPoint, bestPointType)); in mouseMoveEvent()
|
| /dports/graphics/qgis/qgis-3.22.3/src/core/ |
| H A D | qgspointlocator.cpp | 281 QgsPointXY bestPoint; in visitData() local
283 …auto replaceIfBetter = [this, &bestPoint, &bestVertexNumber]( const QgsPoint & candidate, int vert… in visitData()
285 …if ( bestPoint.isEmpty() || candidate.distanceSquared( mSrcPoint.x(), mSrcPoint.y() ) < bestPoint.… in visitData()
287 bestPoint = QgsPointXY( candidate ); in visitData()
338 …neEndpoint, mLocator->mLayer, id, std::sqrt( mSrcPoint.sqrDist( bestPoint ) ), bestPoint, bestVert… in visitData()
|
| /dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/filter_clean/ |
| H A D | cleanfilter.cpp | 494 Point3m bestPoint; in SnapVertexBorder() local
516 bestPoint=(*vi).cP(); in SnapVertexBorder()
534 splitVertVec.push_back(bestPoint); in SnapVertexBorder()
|
| /dports/x11-toolkits/irrlicht/irrlicht-1.8.5/tools/IrrFontTool/newFontTool/ |
| H A D | CVectorFontTool.h | 396 s32 bestPoint = -1; in makeTriangles() local
454 bestPoint = j; in makeTriangles()
458 if (bestEdge >= 0 && bestPoint >= 0 && bestScore >= 0.0f) in makeTriangles()
463 …core::vector2df point(ll[bestEdge].lines[bestPoint].start.X, ll[bestEdge].lines[bestPoint].start.Y… in makeTriangles()
|
| /dports/lang/smalltalk/smalltalk-3.2.5/packages/numerics/ |
| H A D | Optimization.st | 890 | bestPoint |
891 bestPoints isEmpty not ifTrue: [bestPoint := bestPoints removeFirst].
894 bestPoint notNil ifTrue: [bestPoints add: bestPoint].
|
| /dports/graphics/qgis/qgis-3.22.3/src/core/geometry/ |
| H A D | qgsinternalgeometryengine.cpp | 395 QgsPoint bestPoint; in poleOfInaccessibility() local
407 bestPoint = p; in poleOfInaccessibility()
411 if ( bestPoint.isEmpty() ) in poleOfInaccessibility()
416 return QgsGeometry( new QgsPoint( bestPoint ) ); in poleOfInaccessibility()
|
| /dports/graphics/qgis-ltr/qgis-3.16.16/src/core/geometry/ |
| H A D | qgsinternalgeometryengine.cpp | 262 QgsPoint bestPoint; in poleOfInaccessibility() local
276 bestPoint = p; in poleOfInaccessibility()
285 return QgsGeometry( new QgsPoint( bestPoint ) ); in poleOfInaccessibility()
|
| /dports/games/dhewm3/dhewm3-1.5.1/neo/game/ai/ |
| H A D | AI_pathing.cpp | 161 idVec2 newPoint, dir, bestPoint; in GetPointOutsideObstacles() local
253 bestPoint = newPoint; in GetPointOutsideObstacles()
263 point = bestPoint; in GetPointOutsideObstacles()
|
| /dports/games/dhewm3/dhewm3-1.5.1/neo/d3xp/ai/ |
| H A D | AI_pathing.cpp | 159 idVec2 newPoint, dir, bestPoint; in GetPointOutsideObstacles() local
251 bestPoint = newPoint; in GetPointOutsideObstacles()
261 point = bestPoint; in GetPointOutsideObstacles()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/hxt/tetMesh/src/ |
| H A D | HXTSPR.c | 1247 int* bestPoint) { in find_best_point() argument
1342 *bestPoint = mostConnectedPoint; in find_best_point()
|
| /dports/math/kmplot/kmplot-21.12.3/kmplot/ |
| H A D | view.cpp | 3744 QPointF bestPoint; in findMinMaxValue() local
3752 bestPoint = QPointF(rv.x(), rv.y()); in findMinMaxValue()
3756 return bestPoint; in findMinMaxValue()
|
| /dports/games/dhewm3/dhewm3-1.5.1/neo/renderer/ |
| H A D | RenderWorld.cpp | 976 idVec3 localStart, localEnd, bestPoint; in GuiTrace() local
|
| /dports/www/tikiwiki/tiki-21.2/vendor_bundled/vendor/openlayers/openlayers/ |
| H A D | ol.js.map | 1 …bestPoint","p5","minDist","intersectingSegments","currSeg","calculateIntersection_","dist","points…
|