Home
last modified time | relevance | path

Searched refs:bestchild (Results 1 – 7 of 7) sorted by relevance

/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-core-util/src/templates/java/de/lmu/ifi/dbs/elki/utilities/datastructures/heap/
H A DKMinHeap.java157 int bestchild = (twopos << 1) + 1;
158 ${raw} best = twoheap[bestchild];
159 final int right = bestchild + 1;
161 bestchild = right;
168 twopos = bestchild;
H A DKMaxHeap.java157 int bestchild = (twopos << 1) + 1;
158 ${raw} best = twoheap[bestchild];
159 final int right = bestchild + 1;
161 bestchild = right;
168 twopos = bestchild;
H A DKVMinHeap.java179 int bestchild = (twopos << 1) + 1;
180 ${key.raw} best = twoheap[bestchild];
181 final int right = bestchild + 1;
183 bestchild = right;
190 twovals[twopos] = twovals[bestchild];
191 twopos = bestchild;
H A DKVMaxHeap.java179 int bestchild = (twopos << 1) + 1;
180 ${key.raw} best = twoheap[bestchild];
181 final int right = bestchild + 1;
183 bestchild = right;
190 twovals[twopos] = twovals[bestchild];
191 twopos = bestchild;
/dports/games/iortcw/iortcw-1.51c/MP/code/botlib/
H A Dbe_aas_routetable.c503 int bestchild, bestcount, bestparent, cnt; in AAS_RT_BuildRouteTable() local
647 bestchild = -1; in AAS_RT_BuildRouteTable()
661 bestchild = i; in AAS_RT_BuildRouteTable()
665 if ( bestchild < 0 ) { in AAS_RT_BuildRouteTable()
670 localinfo = area_localinfos[bestchild]; in AAS_RT_BuildRouteTable()
674 bestparent = bestchild; in AAS_RT_BuildRouteTable()
/dports/games/iortcw/iortcw-1.51c/SP/code/botlib/
H A Dbe_aas_routetable.c503 int bestchild, bestcount, bestparent, cnt; in AAS_RT_BuildRouteTable() local
647 bestchild = -1; in AAS_RT_BuildRouteTable()
661 bestchild = i; in AAS_RT_BuildRouteTable()
665 if ( bestchild < 0 ) { in AAS_RT_BuildRouteTable()
670 localinfo = area_localinfos[bestchild]; in AAS_RT_BuildRouteTable()
674 bestparent = bestchild; in AAS_RT_BuildRouteTable()
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dtree.c7223 SCIP_NODE* bestchild; in SCIPtreeGetBestNode() local
7234 bestchild = SCIPtreeGetBestChild(tree, set); in SCIPtreeGetBestNode()
7239 bestnode = bestchild; in SCIPtreeGetBestNode()