Home
last modified time | relevance | path

Searched refs:closest_node (Results 1 – 25 of 30) sorted by relevance

12

/dports/games/qudos/QuDos-0.40.1-src/src/mods/jabot/ai/
H A Dai_dropnodes.c201 int closest_node; in AI_CheckForLadder() local
212 if(closest_node != -1) in AI_CheckForLadder()
227 int closest_node; in AI_WaterJumpNode() local
292 if( closest_node == -1 ) // we need to drop a node in AI_WaterJumpNode()
298 player.last_node = closest_node; in AI_WaterJumpNode()
317 int closest_node; in AI_PathMap() local
373 if(closest_node == INVALID) in AI_PathMap()
377 if( player.last_node != -1 && closest_node != -1) in AI_PathMap()
380 if( closest_node != -1 ) in AI_PathMap()
398 if( closest_node == INVALID ) in AI_PathMap()
[all …]
/dports/games/quake2-lights/quake2-lights-1/lights/src/ace/
H A Dacebot_nodes.c324 int closest_node; in ACEND_CheckForLadder() local
332 if(closest_node == -1) in ACEND_CheckForLadder()
334 closest_node = ACEND_AddNode(self,NODE_LADDER); in ACEND_CheckForLadder()
340 self->last_node = closest_node; in ACEND_CheckForLadder()
358 int closest_node; in ACEND_PathMap() local
397 if(closest_node == INVALID) in ACEND_PathMap()
398 closest_node = ACEND_AddNode(self,NODE_JUMP); in ACEND_PathMap()
423 if(closest_node == INVALID) in ACEND_PathMap()
437 if(closest_node == INVALID) in ACEND_PathMap()
441 closest_node = ACEND_AddNode(self,NODE_WATER); in ACEND_PathMap()
[all …]
/dports/games/qudos/QuDos-0.40.1-src/src/mods/xatrix/ace/
H A Dacebot_nodes.c326 int closest_node; in ACEND_CheckForLadder() local
334 if(closest_node == -1) in ACEND_CheckForLadder()
336 closest_node = ACEND_AddNode(self,NODE_LADDER); in ACEND_CheckForLadder()
342 self->last_node = closest_node; in ACEND_CheckForLadder()
360 int closest_node; in ACEND_PathMap() local
399 if(closest_node == INVALID) in ACEND_PathMap()
400 closest_node = ACEND_AddNode(self,NODE_JUMP); in ACEND_PathMap()
425 if(closest_node == INVALID) in ACEND_PathMap()
439 if(closest_node == INVALID) in ACEND_PathMap()
443 closest_node = ACEND_AddNode(self,NODE_WATER); in ACEND_PathMap()
[all …]
/dports/games/qudos/QuDos-0.40.1-src/src/mods/zaero/ace/
H A Dacebot_nodes.c326 int closest_node; in ACEND_CheckForLadder() local
334 if(closest_node == -1) in ACEND_CheckForLadder()
336 closest_node = ACEND_AddNode(self,NODE_LADDER); in ACEND_CheckForLadder()
342 self->last_node = closest_node; in ACEND_CheckForLadder()
360 int closest_node; in ACEND_PathMap() local
399 if(closest_node == INVALID) in ACEND_PathMap()
400 closest_node = ACEND_AddNode(self,NODE_JUMP); in ACEND_PathMap()
425 if(closest_node == INVALID) in ACEND_PathMap()
439 if(closest_node == INVALID) in ACEND_PathMap()
443 closest_node = ACEND_AddNode(self,NODE_WATER); in ACEND_PathMap()
[all …]
/dports/games/qudos/QuDos-0.40.1-src/src/mods/rogue/ace/
H A Dacebot_nodes.c326 int closest_node; in ACEND_CheckForLadder() local
334 if(closest_node == -1) in ACEND_CheckForLadder()
336 closest_node = ACEND_AddNode(self,NODE_LADDER); in ACEND_CheckForLadder()
342 self->last_node = closest_node; in ACEND_CheckForLadder()
360 int closest_node; in ACEND_PathMap() local
399 if(closest_node == INVALID) in ACEND_PathMap()
400 closest_node = ACEND_AddNode(self,NODE_JUMP); in ACEND_PathMap()
425 if(closest_node == INVALID) in ACEND_PathMap()
439 if(closest_node == INVALID) in ACEND_PathMap()
443 closest_node = ACEND_AddNode(self,NODE_WATER); in ACEND_PathMap()
[all …]
/dports/games/qudos/QuDos-0.40.1-src/src/game/ace/
H A Dacebot_nodes.c326 int closest_node; in ACEND_CheckForLadder() local
334 if(closest_node == -1) in ACEND_CheckForLadder()
336 closest_node = ACEND_AddNode(self,NODE_LADDER); in ACEND_CheckForLadder()
342 self->last_node = closest_node; in ACEND_CheckForLadder()
360 int closest_node; in ACEND_PathMap() local
399 if(closest_node == INVALID) in ACEND_PathMap()
400 closest_node = ACEND_AddNode(self,NODE_JUMP); in ACEND_PathMap()
425 if(closest_node == INVALID) in ACEND_PathMap()
439 if(closest_node == INVALID) in ACEND_PathMap()
443 closest_node = ACEND_AddNode(self,NODE_WATER); in ACEND_PathMap()
[all …]
/dports/games/openage/openage-0.3.0-1262-ga554ab49/libopenage/pathfinding/
H A Da_star.cpp86 node_pt closest_node = start_node; in a_star() local
98 util::FloatFixed<3, 8>{closest_node->future_cost}); in a_star()
104 if (best_candidate->heuristic_cost < closest_node->heuristic_cost) { in a_star()
105 closest_node = best_candidate; in a_star()
126 if (neighbor->heuristic_cost > closest_node->heuristic_cost * 3) { in a_star()
147 util::FloatFixed<3, 8>{closest_node->future_cost}); in a_star()
149 return closest_node->generate_backtrace(); in a_star()
/dports/science/afni/afni-AFNI_21.3.16/src/SUMA/
H A DSUMA_NikoMap.c197 int *closest_node = NULL; in main() local
291 closest_node = (int *)SUMA_malloc(sizeof(int)*vp->nx*vp->ny*vp->nz); in main()
294 if (!closest_node || !closest_dist) { in main()
298 if (!SUMA_ClosestNodeToVoxels(SO, vp, closest_node, closest_dist, NULL, 1)) { in main()
348 i, ii, jj, kk, closest_node[i], closest_dist[i]); in main()
480 if (closest_node) SUMA_free(closest_node); closest_node = NULL; in main()
H A DSUMA_VolData.c45 int *closest_node, float *closest_dist, in SUMA_ClosestNodeToVoxels() argument
56 if (!SO || !vp || !closest_node) { in SUMA_ClosestNodeToVoxels()
75 closest_node[ijk] = -1; in SUMA_ClosestNodeToVoxels()
83 SUMA_CLOSEST_NODE(SO, iv.xyz, closest_node[ijk], d); in SUMA_ClosestNodeToVoxels()
91 dxyz = d; closest_node[ijk] = n; in SUMA_ClosestNodeToVoxels()
H A DSUMA_DOmanip.h14 int *closest_node, float *closest_dist,
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Heuristics/
H A Dmst_ins_rout.c142 int closest_node; in closest() local
152 closest_node = nbtree[1].nbor; in closest()
179 return(closest_node); in closest()
H A Dtsp_ins_rout.c66 int closest_node; in tsp_closest() local
76 closest_node = nbtree[1].nbor; in tsp_closest()
101 return(closest_node); in tsp_closest()
H A Dins_routines.c72 int closest_node; in closest() local
82 closest_node = nbtree[1].nbor; in closest()
107 return(closest_node); in closest()
H A Dins_routines2.c76 int closest_node; in closest2() local
86 closest_node = nbtree[1].nbor; in closest2()
112 return(closest_node); in closest2()
/dports/graphics/graphviz/graphviz-2.44.1/lib/circogen/
H A Dcircpos.c55 Agnode_t *n, *closest_node, *neighbor; in getRotation() local
97 closest_node = neighbor; in getRotation()
109 closest_node = n; in getRotation()
114 if (neighbor != closest_node) { in getRotation()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/Decomp/
H A Ddecomp_lower_bound.c276 int closest_node; in decomp_closest() local
286 closest_node = nbtree[1].nbor; in decomp_closest()
313 return(closest_node); in decomp_closest()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/recognition/src/ransac_based/
H A Dobj_rec_ransac.cpp684 ORROctree::Node *closest_node = *n; in testHypothesisNormalBased() local
685 … float min_sqr_dist = aux::sqrDistance3 (closest_node->getData ()->getPoint (), transformed_point); in testHypothesisNormalBased()
692 closest_node = *n; in testHypothesisNormalBased()
698 aux::mult3x3 (rigid_transform, closest_node->getData ()->getNormal (), rotated_normal); in testHypothesisNormalBased()
/dports/games/openlierox/OpenLieroX/src/common/
H A DCWorm_AI.cpp828 for(closest_node = node, count = 0; closest_node; closest_node = closest_node->psNext, count++) { in simplifyPath()
829 len += CVec(closest_node->fX - last_node->fX, closest_node->fY - last_node->fY).GetLength2(); in simplifyPath()
830 dist = CVec(closest_node->fX - node->fX, closest_node->fY - node->fY).GetLength2(); in simplifyPath()
833 && traceWormLine(CVec(closest_node->fX,closest_node->fY),CVec(node->fX,node->fY))) { in simplifyPath()
834 node->psNext = closest_node; in simplifyPath()
835 closest_node->psPrev = node; in simplifyPath()
838 last_node = closest_node; in simplifyPath()
846 …while (closest_node && traceWormLine(CVec(closest_node->fX,closest_node->fY),CVec(node->fX,node->f… in simplifyPath()
848 node->psNext = closest_node; in simplifyPath()
849 closest_node->psPrev = node; in simplifyPath()
[all …]
/dports/graphics/kludge3d/kludge3d-20040822/src/
H A Dtex_app.c1040 TCNode *closest_node = NULL; in texapp_pick_node() local
1059 if( closest_node ) { in texapp_pick_node()
1060 closest_delta_u = fabs( u - closest_node->tc->x ); in texapp_pick_node()
1061 closest_delta_v = fabs( v - closest_node->tc->y ); in texapp_pick_node()
1069 closest_node = t; in texapp_pick_node()
1074 return closest_node; in texapp_pick_node()
/dports/graphics/graphviz/graphviz-2.44.1/lib/topfish/
H A Dhierarchy.c1031 double closest_dist, int *closest_node, in findClosestActiveNode() argument
1047 *closest_node = node; in findClosestActiveNode()
1057 level - 1, x, y, closest_dist, closest_node, in findClosestActiveNode()
1065 closest_node, closest_node_level); in findClosestActiveNode()
1094 int i, closest_node, closest_node_level; in find_closest_active_node() local
1100 …min_dist = findClosestActiveNode(hierarchy, i, top_level, x, y,min_dist, &closest_node, &closest_n… in find_closest_active_node()
1102 …*closest_fine_node =find_leftmost_descendant(hierarchy, closest_node,closest_node_level, cur_level… in find_closest_active_node()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/os/linux/
H A Dos_linux.cpp3092 int closest_node = 0; in rebuild_cpu_to_node_map() local
3115 closest_node = nindex_to_node()->at(m); in rebuild_cpu_to_node_map()
3121 closest_node = nindex_to_node()->at(i); in rebuild_cpu_to_node_map()
3142 cpu_to_node()->at_put(cpu_index, closest_node); in rebuild_cpu_to_node_map()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/os/linux/
H A Dos_linux.cpp3109 int closest_node = 0; in rebuild_cpu_to_node_map() local
3132 closest_node = nindex_to_node()->at(m); in rebuild_cpu_to_node_map()
3138 closest_node = nindex_to_node()->at(i); in rebuild_cpu_to_node_map()
3159 cpu_to_node()->at_put(cpu_index, closest_node); in rebuild_cpu_to_node_map()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/os/linux/
H A Dos_linux.cpp3291 int closest_node = 0; in rebuild_cpu_to_node_map() local
3314 closest_node = nindex_to_node()->at(m); in rebuild_cpu_to_node_map()
3320 closest_node = nindex_to_node()->at(i); in rebuild_cpu_to_node_map()
3331 cpu_to_node()->at_put(j * BitsPerCLong + k, closest_node); in rebuild_cpu_to_node_map()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/os/linux/
H A Dos_linux.cpp3195 int closest_node = 0; in rebuild_cpu_to_node_map() local
3218 closest_node = nindex_to_node()->at(m); in rebuild_cpu_to_node_map()
3224 closest_node = nindex_to_node()->at(i); in rebuild_cpu_to_node_map()
3235 cpu_to_node()->at_put(j * BitsPerCLong + k, closest_node); in rebuild_cpu_to_node_map()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/os/linux/
H A Dos_linux.cpp3291 int closest_node = 0; in rebuild_cpu_to_node_map() local
3314 closest_node = nindex_to_node()->at(m); in rebuild_cpu_to_node_map()
3320 closest_node = nindex_to_node()->at(i); in rebuild_cpu_to_node_map()
3331 cpu_to_node()->at_put(j * BitsPerCLong + k, closest_node); in rebuild_cpu_to_node_map()

12