| /dports/devel/ode/ode-0.13/ode/src/ |
| H A D | sphere.cpp | 178 dReal min_distance = l[0] - dFabs(t[0]); in dCollideSphereBox() local
182 if (face_distance < min_distance) { in dCollideSphereBox()
183 min_distance = face_distance; in dCollideSphereBox()
199 contact->depth = min_distance + sphere->radius; in dCollideSphereBox()
|
| /dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/feature/tests/ |
| H A D | test_brief.py | 23 keypoints = corner_peaks(corner_harris(img), min_distance=5,
47 keypoints = corner_peaks(corner_harris(img), min_distance=5,
|
| /dports/math/fcl/fcl-0.7.0/test/ |
| H A D | test_fcl_broadphase_distance.cpp | 396 …EXPECT_TRUE(fabs(self_data[0].result.min_distance - self_data[i].result.min_distance) < getDELTA<S… in broad_phase_self_distance_test()
397 …fabs(self_data[0].result.min_distance - self_data[i].result.min_distance) / fabs(self_data[0].resu… in broad_phase_self_distance_test()
540 …EXPECT_TRUE(fabs(query_data[0].result.min_distance - query_data[j].result.min_distance) < getDELTA… in broad_phase_distance_test()
541 …fabs(query_data[0].result.min_distance - query_data[j].result.min_distance) / fabs(query_data[0].r… in broad_phase_distance_test()
|
| /dports/devel/sgb/sgb-20090810_1/ |
| H A D | gb_roget.w | 16 @ The subroutine call |roget(n,min_distance,prob,seed)|
36 numbers differ by less than |min_distance|. For example, if
37 |min_distance>1|, the arc between categories 312 and~313 will not
40 |min_distance=3|.)
78 Graph *roget(n,min_distance,prob,seed)
80 unsigned long min_distance; /* smallest inter-category distance allowed
106 sprintf(new_graph->id,"roget(%lu,%lu,%lu,%ld)",n,min_distance,prob,seed);
198 if (mapping[j] && iabs(j-k)>=min_distance &&
|
| /dports/games/unnethack/unnethack-5.1.0-20131208/src/ |
| H A D | mail.c | 232 int x, y, distance, min_distance = -1; local
240 if (min_distance < 0 || distance < min_distance ||
241 (distance == min_distance && rn2(2))) {
244 min_distance = distance;
250 if (min_distance < 0 &&
|
| /dports/science/py-nilearn/nilearn-0.8.1/nilearn/_utils/ |
| H A D | ndimage.py | 73 def _peak_local_max(image, min_distance=10, threshold_abs=0, threshold_rel=0.1, argument
133 size = 2 * min_distance + 1
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 209 min_distance(0), in lookahead_dijkstra_queue()
262 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
279 &min_distance, minimum<distance_type>()); in do_synchronize()
292 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
330 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 208 min_distance(0), in lookahead_dijkstra_queue()
261 && get(distance_map, queue.top()) <= min_distance + lookahead); in has_suitable_vertex()
278 &min_distance, minimum<distance_type>()); in do_synchronize()
291 return min_distance == (std::numeric_limits<distance_type>::max)(); in do_synchronize()
329 distance_type min_distance; member in boost::graph::distributed::detail::lookahead_dijkstra_queue
|
| /dports/sysutils/ansible/ansible-4.7.0/ansible_collections/cisco/ios/tests/unit/modules/network/ios/ |
| H A D | test_ios_ntp_global.py | 133 min_distance=10,
215 min_distance=10,
429 min_distance=10,
550 min_distance=10,
|
| /dports/math/fcl/fcl-0.7.0/include/fcl/narrowphase/detail/traversal/distance/ |
| H A D | mesh_shape_conservative_advancement_traversal_node.h | 70 mutable S min_distance; variable
120 typename BV::S& min_distance,
130 typename BV::S min_distance,
|