| /dports/devel/kdevelop/kdevelop-21.12.3/kdevplatform/language/classmodel/ |
| H A D | documentclassesfolder.cpp | 141 ClassNode* closestNode = nullptr; in findClassNode() local
145 while ((closestNodeIdLen > 0) && (closestNode == nullptr)) { in findClassNode()
150 closestNode = findClassNode(qualifiedIdentifier.mid(0, closestNodeIdLen)); in findClassNode()
153 if (closestNode != nullptr) { in findClassNode()
156 while (closestNode && (closestNodeIdLen < qualifiedIdentifier.count())) { in findClassNode()
159 … closestNode = closestNode->findSubClass(qualifiedIdentifier.mid(0, closestNodeIdLen)); in findClassNode()
163 return closestNode; in findClassNode()
|
| /dports/games/scourge/scourge/src/ |
| H A D | astar.cpp | 293 CPathNode* closestNode = start; //closest node = lowest heuristic value in findPath() local
309 closestNode = bestNode; in findPath()
314 if(bestNode->heuristic < closestNode->heuristic) in findPath()
315 closestNode = bestNode; in findPath()
377 CPathNode nextNode = *closestNode; in findPath()
|
| /dports/games/sdb/sdb-1.0.2/src/ |
| H A D | enemies.cpp | 151 int closestNode = 0; in updateMoveTarget() local
180 { closestDistance = distToNode; closestNode = visibleNodes[i]; } in updateMoveTarget()
185 moveTarget = currLevel.node[closestNode].pos; in updateMoveTarget()
187 nodeTarget = closestNode; in updateMoveTarget()
275 int closest = currLevel.closestNode(currLevelObjs[target]->Pos()); in nodeFollowBehavior()
286 int closest = currLevel.closestNode(currLevelObjs[target]->Pos()); in nodeFollowBehavior()
|
| H A D | level.h | 100 int closestNode(Vector2D pos);
|
| H A D | level.cpp | 855 int Level::closestNode(Vector2D pos) in closestNode() function in Level
858 int closestNode = 0; in closestNode() local
865 closestNode = i; in closestNode()
869 return closestNode; in closestNode()
|
| /dports/math/vtk8/VTK-8.2.0/Interaction/Widgets/ |
| H A D | vtkContourRepresentation.cxx | 303 int closestNode = this->Locator->FindClosestPointWithinRadius( in ActivateNode() local
305 if ( closestNode != this->ActiveNode ) in ActivateNode()
307 this->ActiveNode = closestNode; in ActivateNode()
732 int closestNode=0; in FindClosestPointOnContour() local
827 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
839 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
849 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
857 if ( closestNode < this->GetNumberOfNodes() -1 ) in FindClosestPointOnContour()
859 *idx = closestNode+1; in FindClosestPointOnContour()
|
| /dports/math/vtk9/VTK-9.1.0/Interaction/Widgets/ |
| H A D | vtkContourRepresentation.cxx | 288 int closestNode = in ActivateNode() local
290 if (closestNode != this->ActiveNode) in ActivateNode()
292 this->ActiveNode = closestNode; in ActivateNode()
683 int closestNode = 0; in FindClosestPointOnContour() local
778 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
790 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
800 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
808 if (closestNode < this->GetNumberOfNodes() - 1) in FindClosestPointOnContour()
810 *idx = closestNode + 1; in FindClosestPointOnContour()
|
| /dports/math/vtk6/VTK-6.2.0/Interaction/Widgets/ |
| H A D | vtkContourRepresentation.cxx | 303 int closestNode = this->Locator->FindClosestPointWithinRadius( in ActivateNode() local
305 if ( closestNode != this->ActiveNode ) in ActivateNode()
307 this->ActiveNode = closestNode; in ActivateNode()
732 int closestNode=0; in FindClosestPointOnContour() local
827 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
839 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
849 closestNode = static_cast<int>(i); in FindClosestPointOnContour()
857 if ( closestNode < this->GetNumberOfNodes() -1 ) in FindClosestPointOnContour()
859 *idx = closestNode+1; in FindClosestPointOnContour()
|
| /dports/games/doomlegacy/doomlegacy_1.48.8_source/src/ |
| H A D | b_node.c | 66 SearchNode_t *closestNode = NULL; in B_FindClosestNode() local
71 while (!closestNode && (depth < 50)) in B_FindClosestNode()
76 closestNode = botNodeArray[i][j]; in B_FindClosestNode()
115 return closestNode; in B_FindClosestNode()
|
| /dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/include/geometry/ |
| H A D | rtree.h | 734 NNNode* closestNode = 0; in NearestNeighbor() local
735 while( !closestNode || !closestNode->isLeaf ) in NearestNeighbor()
755 closestNode = nodeList.back(); in NearestNeighbor()
756 node = closestNode->m_branch.m_child; in NearestNeighbor()
758 free(closestNode); in NearestNeighbor()
768 *a_squareDistance = closestNode->minDist; in NearestNeighbor()
769 return closestNode->m_branch.m_data; in NearestNeighbor()
|
| /dports/databases/postgis32/postgis-3.2.0/liblwgeom/ |
| H A D | lwgeom_topo.c | 7066 LWT_ELEMID closestNode = 0; in lwt_GetFaceContainingPoint() local
7130 closestNode = closestEdge->start_node; in lwt_GetFaceContainingPoint()
7139 closestNode = closestEdge->end_node; in lwt_GetFaceContainingPoint()
7147 if ( closestNode != 0 ) in lwt_GetFaceContainingPoint()
7149 LWDEBUGF(1, "Closest point is node %d", closestNode); in lwt_GetFaceContainingPoint()
7152 LWDEBUGF(1, "Query point is node %d", closestNode); in lwt_GetFaceContainingPoint()
7170 …edges = lwt_be_getEdgeByNode( topo, &closestNode, &numedges, LWT_COL_EDGE_FACE_LEFT|LWT_COL_EDGE_F… in lwt_GetFaceContainingPoint()
7192 closestNode, closestEdge->edge_id); in lwt_GetFaceContainingPoint()
7217 int found = _lwt_FindAdjacentEdges( topo, closestNode, &ee, NULL, -1 ); in lwt_GetFaceContainingPoint()
7220 closestNode, closestEdge->edge_id); in lwt_GetFaceContainingPoint()
|
| /dports/math/ogdf/OGDF/include/ogdf/graphalg/ |
| H A D | SteinerTreePreprocessing.h | 1425 node closestNode = minCostIncidentEdge1[terminal]->opposite(terminal); in nearestVertexTest() local
1427 if (voronoiRegions.seed(closestNode) == terminal) { in nearestVertexTest()
1428 markSuccessors(closestNode, voronoiRegions, isSuccessorOfMinCostEdge); in nearestVertexTest()
|