| /dports/devel/volk/volk-2.2.1/kernels/volk/ |
| H A D | volk_32fc_index_max_16u.h | 228 sq_dist = (holderf.f[1] > sq_dist) ? holderf.f[1] : sq_dist; in volk_32fc_index_max_16u_a_avx2()
230 sq_dist = (holderf.f[2] > sq_dist) ? holderf.f[2] : sq_dist; in volk_32fc_index_max_16u_a_avx2()
232 sq_dist = (holderf.f[3] > sq_dist) ? holderf.f[3] : sq_dist; in volk_32fc_index_max_16u_a_avx2()
234 sq_dist = (holderf.f[4] > sq_dist) ? holderf.f[4] : sq_dist; in volk_32fc_index_max_16u_a_avx2()
236 sq_dist = (holderf.f[5] > sq_dist) ? holderf.f[5] : sq_dist; in volk_32fc_index_max_16u_a_avx2()
238 sq_dist = (holderf.f[6] > sq_dist) ? holderf.f[6] : sq_dist; in volk_32fc_index_max_16u_a_avx2()
240 sq_dist = (holderf.f[7] > sq_dist) ? holderf.f[7] : sq_dist; in volk_32fc_index_max_16u_a_avx2()
369 sq_dist = (holderf.f[1] > sq_dist) ? holderf.f[1] : sq_dist; in volk_32fc_index_max_16u_a_sse3()
371 sq_dist = (holderf.f[2] > sq_dist) ? holderf.f[2] : sq_dist; in volk_32fc_index_max_16u_a_sse3()
373 sq_dist = (holderf.f[3] > sq_dist) ? holderf.f[3] : sq_dist; in volk_32fc_index_max_16u_a_sse3()
[all …]
|
| H A D | volk_32fc_index_max_32u.h | 190 sq_dist = (holderf.f[1] > sq_dist) ? holderf.f[1] : sq_dist; in volk_32fc_index_max_32u_a_avx2()
192 sq_dist = (holderf.f[2] > sq_dist) ? holderf.f[2] : sq_dist; in volk_32fc_index_max_32u_a_avx2()
194 sq_dist = (holderf.f[3] > sq_dist) ? holderf.f[3] : sq_dist; in volk_32fc_index_max_32u_a_avx2()
196 sq_dist = (holderf.f[4] > sq_dist) ? holderf.f[4] : sq_dist; in volk_32fc_index_max_32u_a_avx2()
198 sq_dist = (holderf.f[5] > sq_dist) ? holderf.f[5] : sq_dist; in volk_32fc_index_max_32u_a_avx2()
200 sq_dist = (holderf.f[6] > sq_dist) ? holderf.f[6] : sq_dist; in volk_32fc_index_max_32u_a_avx2()
202 sq_dist = (holderf.f[7] > sq_dist) ? holderf.f[7] : sq_dist; in volk_32fc_index_max_32u_a_avx2()
328 sq_dist = (holderf.f[1] > sq_dist) ? holderf.f[1] : sq_dist; in volk_32fc_index_max_32u_a_sse3()
330 sq_dist = (holderf.f[2] > sq_dist) ? holderf.f[2] : sq_dist; in volk_32fc_index_max_32u_a_sse3()
332 sq_dist = (holderf.f[3] > sq_dist) ? holderf.f[3] : sq_dist; in volk_32fc_index_max_32u_a_sse3()
[all …]
|
| H A D | volk_32fc_x2_square_dist_32f.h | 97 float sq_dist; in volk_32fc_x2_square_dist_32f_a_avx2() local
171 sq_dist = lv_creal(diff) * lv_creal(diff) + lv_cimag(diff) * lv_cimag(diff); in volk_32fc_x2_square_dist_32f_a_avx2()
173 target[0] = sq_dist; in volk_32fc_x2_square_dist_32f_a_avx2()
192 float sq_dist; in volk_32fc_x2_square_dist_32f_a_sse3() local
254 sq_dist = lv_creal(diff) * lv_creal(diff) + lv_cimag(diff) * lv_cimag(diff); in volk_32fc_x2_square_dist_32f_a_sse3()
256 target[0] = sq_dist; in volk_32fc_x2_square_dist_32f_a_sse3()
304 float sq_dist; in volk_32fc_x2_square_dist_32f_generic() local
310 sq_dist = lv_creal(diff) * lv_creal(diff) + lv_cimag(diff) * lv_cimag(diff); in volk_32fc_x2_square_dist_32f_generic()
312 target[i] = sq_dist; in volk_32fc_x2_square_dist_32f_generic()
340 float sq_dist; in volk_32fc_x2_square_dist_32f_u_avx2() local
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Homogeneous/ |
| H A D | CircleH2.h | 139 FT sq_dist = squared_distance( p, center() ); in oriented_side() local
141 Comparison_result vgl = CGAL_NTS compare( sq_dist, sq_rad ); in oriented_side()
169 FT sq_dist = squared_distance( p, center() ); in has_on_boundary() local
171 return ( sq_dist == sq_rad ); in has_on_boundary()
194 FT sq_dist = squared_distance( p, center() ); in bounded_side() local
196 Comparison_result vgl = CGAL_NTS compare( sq_dist, sq_rad ); in bounded_side()
208 FT sq_dist = squared_distance( p, center() ); in has_on_bounded_side() local
210 return ( sq_dist < sq_rad ); in has_on_bounded_side()
218 FT sq_dist = squared_distance( p, center() ); in has_on_unbounded_side() local
220 return ( sq_rad < sq_dist ); in has_on_unbounded_side()
|
| /dports/astro/py-metpy/MetPy-1.1.0/src/metpy/interpolate/ |
| H A D | tools.py | 151 def barnes_weights(sq_dist, kappa, gamma): argument
171 return np.exp(-1.0 * sq_dist / (kappa * gamma))
174 def cressman_weights(sq_dist, r): argument
194 return (r * r - sq_dist) / (r * r + sq_dist)
|
| H A D | points.py | 20 def cressman_point(sq_dist, values, radius): argument
41 weights = tools.cressman_weights(sq_dist, radius)
47 def barnes_point(sq_dist, values, kappa, gamma=None): argument
80 weights = tools.barnes_weights(sq_dist, kappa, gamma)
|
| /dports/misc/vxl/vxl-3.3.2/contrib/rpl/rsdl/ |
| H A D | rsdl_kd_tree.cxx | 327 double sq_dist; in n_nearest_with_stack() local
332 sq_dist = 0; in n_nearest_with_stack()
351 sq_dist = stack_vec[ stack_vec.size()-1 ].dist_; in n_nearest_with_stack()
386 sq_dist = stack_vec[ stack_vec.size()-1 ].dist_; in n_nearest_with_stack()
441 double sq_dist; in n_nearest_with_heap() local
460 sq_dist = 0; in n_nearest_with_heap()
535 sq_dist = heap_vec[ heap_vec.size()-1 ].dist_; in n_nearest_with_heap()
559 double sq_dist = rsdl_dist_sq( query_point, points_[ id ] ); in update_closest() local
562 << ", sq_dist = " << sq_dist << std::endl; in update_closest()
581 while ( j >= 0 && sq_distances[j] > sq_dist ) { in update_closest()
[all …]
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/mesh/ |
| H A D | mesh_AABB.h | 451 const vec3& p, vec3& nearest_point, double& sq_dist in nearest_facet() argument
454 get_nearest_facet_hint(p, nearest_facet, nearest_point, sq_dist); in nearest_facet()
457 nearest_facet, nearest_point, sq_dist, in nearest_facet()
470 double sq_dist; in nearest_facet() local
471 return nearest_facet(p, nearest_point, sq_dist); in nearest_facet()
495 index_t& nearest_facet, vec3& nearest_point, double& sq_dist in nearest_facet_with_hint() argument
499 p, nearest_facet, nearest_point, sq_dist in nearest_facet_with_hint()
504 nearest_facet, nearest_point, sq_dist, in nearest_facet_with_hint()
603 index_t& nearest_facet, vec3& nearest_point, double& sq_dist
625 index_t& nearest_facet, vec3& nearest_point, double& sq_dist,
|
| H A D | mesh_AABB.cpp | 454 sq_dist = Geom::distance2(p, nearest_point); in get_nearest_facet_hint()
472 if(cur_sq_dist < sq_dist) { in nearest_facet_recursive()
475 sq_dist = cur_sq_dist; in nearest_facet_recursive()
489 if(dl < sq_dist) { in nearest_facet_recursive()
492 nearest_f, nearest_point, sq_dist, in nearest_facet_recursive()
496 if(dr < sq_dist) { in nearest_facet_recursive()
499 nearest_f, nearest_point, sq_dist, in nearest_facet_recursive()
504 if(dr < sq_dist) { in nearest_facet_recursive()
507 nearest_f, nearest_point, sq_dist, in nearest_facet_recursive()
511 if(dl < sq_dist) { in nearest_facet_recursive()
[all …]
|
| H A D | mesh_baking.cpp | 287 double sq_dist; in bake_mesh_facet_normals_indirect() local
299 AABB.nearest_facet(p, nearest_point, sq_dist in bake_mesh_facet_normals_indirect()
302 sq_dist = length2(p - nearest_point); in bake_mesh_facet_normals_indirect()
304 p,nearest_facet,nearest_point,sq_dist in bake_mesh_facet_normals_indirect()
347 double sq_dist; in bake_mesh_points_attribute_indirect() local
359 1, p.data(), &nearest_vertex, &sq_dist in bake_mesh_points_attribute_indirect()
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/numerics/predicates/ |
| H A D | side4.pck | 17 scalar a14 = -sq_dist(p1,p0) ;
22 scalar a24 = -sq_dist(p2,p0) ;
27 scalar a34 = -sq_dist(p3,p0) ;
32 scalar a44 = -sq_dist(p4,p0) ;
88 scalar l1 = 1*sq_dist(p1,p0);
89 scalar l2 = 1*sq_dist(p2,p0);
90 scalar l3 = 1*sq_dist(p3,p0);
91 scalar l4 = 1*sq_dist(p4,p0);
|
| H A D | side3.pck | 9 scalar l1 = 1*sq_dist(p1,p0);
10 scalar l2 = 1*sq_dist(p2,p0);
11 scalar l3 = 1*sq_dist(p3,p0);
|
| H A D | side2.pck | 8 scalar l1 = 1*sq_dist(p1,p0) ;
9 scalar l2 = 1*sq_dist(p2,p0) ;
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bapl/ |
| H A D | bapl_bbf_tree.cxx | 243 double sq_dist; in n_nearest() local
262 sq_dist = 0; in n_nearest()
277 if ( num_found < n || sq_dist < sq_distances[ num_found-1 ] ) { in n_nearest()
319 sq_dist = priority_queue.back().dist_; in n_nearest()
356 double sq_dist = vnl_vector_ssd( query_point->descriptor(), points_[ id ]->descriptor() ); in update_closest() local
363 if ( num_found >= n && sq_dist >= sq_distances[ num_found-1 ] ) in update_closest()
376 while ( j >= 0 && sq_distances[j] > sq_dist ) { in update_closest()
382 sq_distances[ j+1 ] = sq_dist; in update_closest()
|
| /dports/games/freeciv-nox11/freeciv-2.6.6/common/ |
| H A D | borders.c | 100 int sq_dist = sq_map_distance(ptile, source); in tile_border_strength() local
102 if (sq_dist > 0) { in tile_border_strength()
103 return full_strength * full_strength / sq_dist; in tile_border_strength()
|
| /dports/games/freeciv/freeciv-2.6.6/common/ |
| H A D | borders.c | 100 int sq_dist = sq_map_distance(ptile, source); in tile_border_strength() local
102 if (sq_dist > 0) { in tile_border_strength()
103 return full_strength * full_strength / sq_dist; in tile_border_strength()
|
| /dports/graphics/scantailor/scantailor-advanced-1.0.16/filters/output/ |
| H A D | DespeckleVisualization.cpp | 61 const uint32_t sq_dist = sedm_line[x]; in colorizeSpeckles() local
62 if (sq_dist == 0) { in colorizeSpeckles()
73 const float alpha = alpha_upper_bound - scale * sq_dist; in colorizeSpeckles()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/rpl/rsdl/tests/ |
| H A D | test_dist.cxx | 30 double sq_dist = in test_dist() local
39 TEST_NEAR("square distance between points", sq_dist, rsdl_dist_sq( p, q ), 1e-6); in test_dist()
40 TEST_NEAR("distance between points", std::sqrt(sq_dist), rsdl_dist( p, q ), 1e-6); in test_dist()
73 sq_dist = vnl_math::sqr( vnl_math::pi/16 ) + vnl_math::sqr( vnl_math::pi/8 ) + in test_dist()
75 TEST_NEAR("point-to-box dist sq - angle outside (a)", rsdl_dist_sq( test_p, box), sq_dist , 1e-6); in test_dist()
76 …TEST_NEAR("point-to-box dist - angle outside (a) ", rsdl_dist( test_p, box), std::sqrt(sq_dist), 1… in test_dist()
82 sq_dist = vnl_math::sqr( vnl_math::pi/4 ) + vnl_math::sqr( vnl_math::pi/8 ) + in test_dist()
84 TEST_NEAR("point-to-box dist sq - angle outside (b)", rsdl_dist_sq( test_p, box), sq_dist , 1e-6); in test_dist()
85 …TEST_NEAR("point-to-box dist - angle outside (b) ", rsdl_dist( test_p, box), std::sqrt(sq_dist), 1… in test_dist()
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/cluster/ |
| H A D | _k_means_lloyd.pyx | 183 floating sq_dist, min_sq_dist
204 sq_dist = pairwise_distances[i * n_clusters + j]
205 if sq_dist < min_sq_dist:
206 min_sq_dist = sq_dist
378 floating sq_dist, min_sq_dist
391 sq_dist = 0.0
393 sq_dist += centers_old[j, X_indices[k]] * X_data[k]
399 sq_dist = centers_squared_norms[j] -2 * sq_dist
400 if sq_dist < min_sq_dist:
401 min_sq_dist = sq_dist
|
| /dports/math/py-yt/yt-4.0.1/yt/utilities/lib/ |
| H A D | particle_kdtree_tools.pyx | 263 cdef np.float64_t tpos, sq_dist
268 sq_dist = 0.0
273 sq_dist += tpos*tpos
276 queue.add_pid(sq_dist, i)
368 cdef np.float64_t tpos, sq_dist
373 sq_dist = 0.0
378 sq_dist += tpos*tpos
381 if (sq_dist < r2):
382 nblist.add_pid(sq_dist, i)
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/ |
| H A D | NonDAdaptiveSampling.cpp | 474 double sq_dist = 0; in calc_score_delta_x() local
480 if(first || sq_dist < min_sq_dist) in calc_score_delta_x()
482 min_sq_dist = sq_dist; in calc_score_delta_x()
513 double sq_dist = 0; in calc_score_delta_y() local
519 if(first || sq_dist < min_sq_dist) in calc_score_delta_y()
521 min_sq_dist = sq_dist; in calc_score_delta_y()
1219 double sq_dist = 0; in calc_score_delta_y() local
1223 if(first || sq_dist < min_sq_dist) { in calc_score_delta_y()
1224 min_sq_dist = sq_dist; in calc_score_delta_y()
1251 double sq_dist = 0; in calc_score_delta_x() local
[all …]
|
| /dports/graphics/hugin/hugin-2020.0.0/src/foreign/flann/algorithms/ |
| H A D | kmeans_index.h | 688 DistanceType sq_dist = distance_(dataset_[indices[i]], dcenters[0], veclen_); in computeClustering() local
692 if (sq_dist>new_sq_dist) { in computeClustering()
694 sq_dist = new_sq_dist; in computeClustering()
697 if (sq_dist>radiuses[belongs_to[i]]) { in computeClustering()
698 radiuses[belongs_to[i]] = sq_dist; in computeClustering()
730 DistanceType sq_dist = distance_(dataset_[indices[i]], dcenters[0], veclen_); in computeClustering() local
734 if (sq_dist>new_sq_dist) { in computeClustering()
736 sq_dist = new_sq_dist; in computeClustering()
739 if (sq_dist>radiuses[new_centroid]) { in computeClustering()
740 radiuses[new_centroid] = sq_dist; in computeClustering()
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/points/ |
| H A D | nn_search.h | 203 double sq_dist; in get_nearest_neighbor() local
204 get_nearest_neighbors(1, query_point, &result, &sq_dist); in get_nearest_neighbor()
|
| H A D | kd_tree.h | 180 index_t neighbor, double sq_dist in insert()
183 sq_dist <= furthest_neighbor_sq_dist() in insert()
188 if(neighbors_sq_dist[i - 1] < sq_dist) { in insert()
196 neighbors_sq_dist[i] = sq_dist; in insert()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Mesh_3/ |
| H A D | polyhedral_to_labeled_function_wrapper.h | 220 if ( sq_dist(p,use_cache) < sq_tolerance_size_ ) in operator()
232 double sq_dist(const Point_3& p, bool use_cache) const in sq_dist() function
295 if ( sq_dist(p,use_cache) < sq_tolerance_size_ ) in operator()
307 double sq_dist(const Point_3& p, bool use_cache) const in sq_dist() function
|