/dports/math/igraph/igraph-0.9.5/tests/unit/ |
H A D | igraph_layout_mds.c | 65 double dist_sq = 0.0; in main() local 66 dist_sq += sqr(MATRIX(coords, i, 0) - MATRIX(coords, j, 0)); in main() 67 dist_sq += sqr(MATRIX(coords, i, 1) - MATRIX(coords, j, 1)); in main() 68 MATRIX(dist_mat, i, j) = sqrt(dist_sq); in main() 69 MATRIX(dist_mat, j, i) = sqrt(dist_sq); in main() 74 double dist_sq = 0.0; in main() local 75 dist_sq += sqr(MATRIX(coords, i, 0) - MATRIX(coords, j, 0)); in main() 76 dist_sq += sqr(MATRIX(coords, i, 1) - MATRIX(coords, j, 1)); in main() 77 if (fabs(sqrt(dist_sq) - MATRIX(dist_mat, i, j)) > 1e-2) { in main() 79 i, j, MATRIX(dist_mat, i, j), sqrt(dist_sq)); in main()
|
/dports/science/cdo/cdo-2.0.0/src/kdtreelib/ |
H A D | kdtree_spherical.cc | 324 kdata_t dist_sq, tmp_dist_sq, dx; in kd_sph_nearest() local 346 if (*max_dist_sq > dist_sq) in kd_sph_nearest() 347 *max_dist_sq = dist_sq; in kd_sph_nearest() 384 if (tmp_dist_sq < dist_sq) { in kd_sph_nearest() 386 dist_sq = tmp_dist_sq; in kd_sph_nearest() 443 kdata_t dist_sq, dx; in kd_sph_doQnearest() local 455 point->dist_sq = dist_sq; in kd_sph_doQnearest() 523 point->dist_sq = dist_sq; in kd_sph_doQnearest() 589 kdata_t dist_sq, dx; in kd_sph_doRange() local 601 point->dist_sq = ordered ? dist_sq : -1; in kd_sph_doRange() [all …]
|
H A D | kdtree_cartesian.cc | 258 if (*max_dist_sq > dist_sq) in kd_nearest() 259 *max_dist_sq = dist_sq; in kd_nearest() 279 … if ( tmp_dist_sq < dist_sq || (tmp_dist_sq <= dist_sq && tmp_nearest->index < nearest->index) ) { in kd_nearest() 281 dist_sq = tmp_dist_sq; in kd_nearest() 342 point->dist_sq = dist_sq; in kd_check_dist() 355 *max_dist_sq = item->dist_sq; in kd_check_dist() 447 kdata_t dist_sq, dx; in kd_doRange() local 452 dist_sq = kd_dist_sq(node->location, p); in kd_doRange() 458 point->dist_sq = ordered ? dist_sq : -1; in kd_doRange() 484 dist_sq = kd_dist_sq(node->location, p); in kd_doRange() [all …]
|
/dports/science/chrono/chrono-7.0.1/src/chrono_sensor/utils/ |
H A D | Kdtree.cpp | 136 float dist_sq, dx; in find_nearest() local 142 dist_sq = 0; in find_nearest() 146 if (dist_sq <= range * range) { in find_nearest() 175 float dummy, dist_sq; in kd_nearest_i() local 199 dist_sq = 0; in kd_nearest_i() 205 *result_dist_sq = dist_sq; in kd_nearest_i() 223 float dist_sq; in kd_nearest() local 249 dist_sq = 0; in kd_nearest() 396 rnode->dist_sq = dist_sq; in rlist_insert() 398 if (dist_sq >= 0.0) { in rlist_insert() [all …]
|
/dports/x11/xsnow/xsnow-3.4.2/src/ |
H A D | kdtree.c | 100 double dist_sq; member 294 double dist_sq, dx; in find_nearest() local 299 dist_sq = 0; in find_nearest() 328 double dist_sq, dx; 334 dist_sq = 0; 344 if(maxelem->dist_sq > dist_sq) { 409 dist_sq = 0; in kd_nearest_i() 439 double dist_sq; in kd_nearest() local 464 dist_sq = 0; in kd_nearest() 853 rnode->dist_sq = dist_sq; in rlist_insert() [all …]
|
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/libs/kimath/include/geometry/ |
H A D | shape_segment.h | 85 ecoord dist_sq = m_seg.SquaredDistance( aSeg ); 87 if( dist_sq == 0 || dist_sq < SEG::Square( min_dist ) ) 93 *aActual = std::max( 0, (int) sqrt( dist_sq ) - ( m_width + 1 ) / 2 ); 105 ecoord dist_sq = m_seg.SquaredDistance( aP ); 107 if( dist_sq == 0 || dist_sq < SEG::Square( min_dist ) ) 113 *aActual = std::max( 0, (int) sqrt( dist_sq ) - ( m_width + 1 ) / 2 );
|
H A D | shape_circle.h | 81 ecoord dist_sq = ( pn - m_circle.Center ).SquaredEuclideanNorm(); 83 if( dist_sq == 0 || dist_sq < SEG::Square( minDist ) ) 89 *aActual = std::max( 0, (int) sqrt( dist_sq ) - m_circle.Radius );
|
/dports/biology/clustal-omega/clustal-omega-1.2.4/src/kmpp/ |
H A D | KmTree.cpp | 198 Scalar dist_sq = 0; in GetNodeCost() local 201 dist_sq += x*x; in GetNodeCost() 203 return node->opt_cost + node->num_points * dist_sq; in GetNodeCost() 220 if (dist_sq < min_dist_sq) { in DoKMeansStepAtNode() 221 min_dist_sq = dist_sq; in DoKMeansStepAtNode() 288 Scalar *dist_sq = (Scalar*)malloc(n_ * sizeof(Scalar)); in SeedKMeansPlusPlus() local 289 KM_ASSERT(dist_sq != 0); in SeedKMeansPlusPlus() 298 total_cost += dist_sq[j]; in SeedKMeansPlusPlus() 307 cur_cost += dist_sq[i]; in SeedKMeansPlusPlus() 319 free(dist_sq); in SeedKMeansPlusPlus() [all …]
|
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/libs/kimath/src/geometry/ |
H A D | seg.cpp | 202 ecoord dist_sq = VECTOR2I::ECOORD_MAX; in Collide() local 204 dist_sq = std::min( dist_sq, SquaredDistance( aSeg.A ) ); in Collide() 205 dist_sq = std::min( dist_sq, SquaredDistance( aSeg.B ) ); in Collide() 206 dist_sq = std::min( dist_sq, aSeg.SquaredDistance( A ) ); in Collide() 207 dist_sq = std::min( dist_sq, aSeg.SquaredDistance( B ) ); in Collide() 209 if( dist_sq == 0 || dist_sq < (ecoord) aClearance * aClearance ) in Collide() 212 *aActual = sqrt( dist_sq ); in Collide()
|
/dports/graphics/libart_lgpl/libart_lgpl-2.3.21/ |
H A D | art_svp_point.c | 98 double dist_sq; in art_svp_point_dist() local 120 dist_sq = dxx0 * dxx0 + dyy0 * dyy0; in art_svp_point_dist() 126 dist_sq = (x - x1) * (x - x1) + (y - y1) * (y - y1); in art_svp_point_dist() 131 dist_sq = perp * perp / rr; in art_svp_point_dist() 134 if (best_sq < 0 || dist_sq < best_sq) in art_svp_point_dist() 135 best_sq = dist_sq; in art_svp_point_dist()
|
/dports/print/py-reportlab/reportlab-3.5.68/src/rl_addons/renderPM/libart_lgpl/ |
H A D | art_svp_point.c | 98 double dist_sq; in art_svp_point_dist() local 120 dist_sq = dxx0 * dxx0 + dyy0 * dyy0; in art_svp_point_dist() 126 dist_sq = (x - x1) * (x - x1) + (y - y1) * (y - y1); in art_svp_point_dist() 131 dist_sq = perp * perp / rr; in art_svp_point_dist() 134 if (best_sq < 0 || dist_sq < best_sq) in art_svp_point_dist() 135 best_sq = dist_sq; in art_svp_point_dist()
|
/dports/audio/libmysofa/libmysofa-1.2.1-16-g52590e1/src/hrtf/ |
H A D | kdtree.c | 154 float dummy, dist_sq; in kd_nearest_i() local 184 dist_sq = 0; in kd_nearest_i() 186 dist_sq += SQ(node->pos[i] - pos[i]); in kd_nearest_i() 188 if (dist_sq < *result_dist_sq) { in kd_nearest_i() 190 *result_dist_sq = dist_sq; in kd_nearest_i() 212 float dist_sq; in kd_nearest() local 225 dist_sq = 0; in kd_nearest() 227 dist_sq += SQ(result->pos[i] - pos[i]); in kd_nearest() 230 kd_nearest_i(kd->root, pos, &result, &dist_sq, &rect); in kd_nearest()
|
/dports/graphics/blender/blender-2.91.0/source/blender/bmesh/operators/ |
H A D | bmo_normals.c | 95 float dist_sq; in recalc_face_normals_find_index() member 130 best.dist_sq = eps; in recalc_face_normals_find_index() 152 test.dist_sq = len_squared_v3(dir); in recalc_face_normals_find_index() 153 is_best_dist_sq = (test.dist_sq > best.dist_sq); in recalc_face_normals_find_index() 154 if (is_best_dist_sq || (test.dist_sq == best.dist_sq)) { in recalc_face_normals_find_index() 156 mul_v3_fl(dir, 1.0f / sqrtf(test.dist_sq)); in recalc_face_normals_find_index()
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/ |
H A D | editmesh_bvh.c | 429 const float dist_sq = len_squared_v3v3(co, tri_cos[i]); in bmbvh_find_vert_closest_cb() local 430 if (dist_sq < hit->dist_sq && dist_sq < dist_max_sq) { in bmbvh_find_vert_closest_cb() 434 hit->dist_sq = dist_sq; in bmbvh_find_vert_closest_cb() 451 hit.dist_sq = dist_max_sq; in BKE_bmbvh_find_vert_closest() 491 const float dist_sq = len_squared_v3v3(co, co_close); in bmbvh_find_face_closest_cb() local 492 if (dist_sq < hit->dist_sq && dist_sq < dist_max_sq) { in bmbvh_find_face_closest_cb() 495 hit->dist_sq = dist_sq; in bmbvh_find_face_closest_cb() 512 hit.dist_sq = dist_max_sq; in BKE_bmbvh_find_face_closest()
|
H A D | shrinkwrap.c | 394 nearest->dist_sq = FLT_MAX; in shrinkwrap_calc_nearest_vertex_cb_ex() 422 nearest.dist_sq = FLT_MAX; in shrinkwrap_calc_nearest_vertex() 942 if (dist_sq < nearest->dist_sq) { in update_hit() 945 "#=#=#> %d (%.3f,%.3f,%.3f) %g < %g\n", index, UNPACK3(hit_co), dist_sq, nearest->dist_sq); in update_hit() 948 nearest->dist_sq = dist_sq; in update_hit() 1060 dist_sq, in mesh_looptri_target_project() 1061 nearest->dist_sq); in mesh_looptri_target_project() 1064 if (dist_sq >= nearest->dist_sq) { in mesh_looptri_target_project() 1169 nearest->dist_sq = FLT_MAX; in shrinkwrap_calc_nearest_surface_point_cb_ex() 1176 nearest->dist_sq = FLT_MAX; in shrinkwrap_calc_nearest_surface_point_cb_ex() [all …]
|
/dports/math/stanmath/math-4.2.0/stan/math/rev/fun/ |
H A D | cov_exp_quad.hpp | 58 double dist_sq = squared_distance(x[i], x[j]); in cov_exp_quad_vari() local 59 dist_[pos] = dist_sq; in cov_exp_quad_vari() 61 sigma_sq_d_ * std::exp(-dist_sq * inv_half_sq_l_d), false); in cov_exp_quad_vari() 126 double dist_sq = squared_distance(x[i], x[j]); in cov_exp_quad_vari() local 127 dist_[pos] = dist_sq; in cov_exp_quad_vari() 129 sigma_sq_d_ * std::exp(-dist_sq * inv_half_sq_l_d), false); in cov_exp_quad_vari()
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/stan/math/rev/mat/fun/ |
H A D | cov_exp_quad.hpp | 61 double dist_sq = squared_distance(x[i], x[j]); in cov_exp_quad_vari() local 62 dist_[pos] = dist_sq; in cov_exp_quad_vari() 64 sigma_sq_d_ * std::exp(-dist_sq * inv_half_sq_l_d), false); in cov_exp_quad_vari() 128 double dist_sq = squared_distance(x[i], x[j]); in cov_exp_quad_vari() local 129 dist_[pos] = dist_sq; in cov_exp_quad_vari() 131 sigma_sq_d_ * std::exp(-dist_sq * inv_half_sq_l_d), false); in cov_exp_quad_vari()
|
/dports/science/py-chainer/chainer-7.8.0/chainer/functions/loss/ |
H A D | contrastive.py | 44 dist_sq = xp.sum(diff ** 2, axis=1) 45 dist = xp.sqrt(dist_sq) 48 loss = (y * dist_sq + (1 - y) * dist * dist) * .5 60 dist_sq = chainer.functions.sum(diff ** 2, axis=1) 61 dist = chainer.functions.sqrt(dist_sq)
|
/dports/math/ogdf/OGDF/include/ogdf/energybased/dtree/ |
H A D | DTreeWSPD.h | 288 double dist_sq = 0.0; in areWellSeparated() local 293 dist_sq += dx * dx; in areWellSeparated() 305 …return dist_sq > (m_wspdSeparationFactor * m_wspdSeparationFactor + 4.0 * m_wspdSeparationFactor +… in areWellSeparated() 307 return dist_sq > s * s * r_max_sq; in areWellSeparated() 310 return dist_sq > m_wspdSeparationFactorPlus2Squared_cached * r_max_sq; in areWellSeparated() 323 double dist_sq = dx_0 * dx_0 + dx_1 * dx_1; in areWellSeparated() local 326 return dist_sq > m_wspdSeparationFactorPlus2Squared_cached * r_max_sq; in areWellSeparated() 339 double dist_sq = dx_0 * dx_0 + dx_1 * dx_1 + dx_2 * dx_2; in areWellSeparated() local 342 return dist_sq > m_wspdSeparationFactorPlus2Squared_cached * r_max_sq; in areWellSeparated()
|
/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/common/geometry/ |
H A D | seg.cpp | 38 ecoord dist_sq = (ecoord) aDist * aDist; in PointCloserThan() local 44 return ( aP - A ).SquaredEuclideanNorm() < dist_sq; in PointCloserThan() 46 return ( aP - B ).SquaredEuclideanNorm() < dist_sq; in PointCloserThan() 70 if( num > ( dist_sq + 100 ) ) in PointCloserThan() 73 else if( num < ( dist_sq - 100 ) ) in PointCloserThan() 81 return ( nearest - aP ).SquaredEuclideanNorm() <= dist_sq; in PointCloserThan()
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/intern/ |
H A D | BLI_kdopbvh.c | 1513 data->nearest.dist_sq) { in dfs_find_nearest_dfs() 1522 data->nearest.dist_sq) { in dfs_find_nearest_dfs() 1533 float nearest[3], dist_sq; in dfs_find_nearest_begin() local 1535 if (dist_sq >= data->nearest.dist_sq) { in dfs_find_nearest_begin() 1559 if (dist_sq < data->nearest.dist_sq) { in heap_find_nearest_inner() 1571 if (dist_sq < data->nearest.dist_sq) { in heap_find_nearest_begin() 1614 data.nearest.dist_sq = FLT_MAX; in BLI_bvhtree_find_nearest_ex() 1667 const float dist_sq = data->nearest.dist_sq; in dfs_find_duplicate_fast_dfs() local 1669 return (data->nearest.dist_sq < dist_sq); in dfs_find_duplicate_fast_dfs() 1721 data.nearest.dist_sq = dist_sq; in BLI_bvhtree_find_nearest_first() [all …]
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/moab/ |
H A D | BoundBox.hpp | 168 double dist_sq = 0.0; in distance_squared() local 171 dist_sq += (bMin[i] - from_point[i]) * (bMin[i] - from_point[i]); in distance_squared() 173 dist_sq += (bMax[i] - from_point[i]) * (bMax[i] - from_point[i]); in distance_squared() 175 return dist_sq; in distance_squared() 180 double dist_sq = distance_squared(from_point); in distance() local 181 return sqrt(dist_sq); in distance()
|
/dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/rodio-0.14.0/src/source/ |
H A D | spatial.rs | 18 fn dist_sq(a: [f32; 3], b: [f32; 3]) -> f32 { in dist_sq() function 54 let left_dist_sq = dist_sq(left_ear, emitter_pos); 55 let right_dist_sq = dist_sq(right_ear, emitter_pos); 56 let max_diff = dist_sq(left_ear, right_ear).sqrt();
|
/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/rodio-0.14.0/src/source/ |
H A D | spatial.rs | 18 fn dist_sq(a: [f32; 3], b: [f32; 3]) -> f32 { in dist_sq() function 54 let left_dist_sq = dist_sq(left_ear, emitter_pos); 55 let right_dist_sq = dist_sq(right_ear, emitter_pos); 56 let max_diff = dist_sq(left_ear, right_ear).sqrt();
|
/dports/graphics/blender/blender-2.91.0/source/blender/editors/mesh/ |
H A D | editmesh_rip.c | 66 float vec1[2], vec2[2], dist_sq; in edbm_rip_edgedist_squared() local 82 BLI_assert(isfinite(dist_sq)); in edbm_rip_edgedist_squared() 84 return dist_sq; in edbm_rip_edgedist_squared() 527 float dist_sq = FLT_MAX; in edbm_rip_invoke__vert() local 572 dist_sq = d; in edbm_rip_invoke__vert() 623 dist_sq = d; in edbm_rip_invoke__vert() 667 dist_sq = FLT_MAX; in edbm_rip_invoke__vert() 684 dist_sq = d; in edbm_rip_invoke__vert() 702 dist_sq = d; in edbm_rip_invoke__vert() 828 dist_sq = FLT_MAX; in edbm_rip_invoke__vert() [all …]
|