Home
last modified time | relevance | path

Searched refs:farthest_dist (Results 1 – 5 of 5) sorted by relevance

/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/router/
H A Dpns_line.cpp185 int farthest_dist = 0; in Walkaround() local
220 if( dist >= farthest_dist ) in Walkaround()
222 farthest_dist = dist; in Walkaround()
244 assert( nearest_dist <= farthest_dist ); in Walkaround()
/dports/biology/py-ete3/ete3-3.1.2/ete3/coretype/
H A Dtree.py1048 farthest_node, farthest_dist = self.get_farthest_leaf(topology_only=topology_only)
1065 if cdist+fdist > farthest_dist:
1066 farthest_dist = cdist + fdist
1074 return farthest_node, farthest_dist
/dports/games/dxx-rebirth/dxx-rebirth_20211220-src/similar/main/
H A Dautomap.cpp138 fix farthest_dist = (F1_0 * 20 * 50); // 50 segments away member
1352 if ( dist >= am.farthest_dist ) continue; in draw_all_edges()
1356 …: gr_fade_table[static_cast<gr_fade_level>(f2i((F1_0 - fixdiv(dist, am.farthest_dist)) * 31))][e->… in draw_all_edges()
/dports/games/diaspora/Diaspora_R1_Linux/Diaspora/fs2_open/code/ai/
H A Daicode.cpp9369 float farthest_dist; in remove_farthest_attacker() local
9373 farthest_dist = 9999999.9f; in remove_farthest_attacker()
9389 if (dist < farthest_dist) { in remove_farthest_attacker()
9390 farthest_dist = dist; in remove_farthest_attacker()
/dports/games/fs2open/fs2open.github.com-release_21_4_1/code/ai/
H A Daicode.cpp9898 float farthest_dist; in remove_farthest_attacker() local
9902 farthest_dist = 9999999.9f; in remove_farthest_attacker()
9918 if (dist < farthest_dist) { in remove_farthest_attacker()
9919 farthest_dist = dist; in remove_farthest_attacker()