/dports/math/openturns/openturns-1.18/validation/src/optimal_lhs/ |
H A D | space_filling_criteria_ref.val | 2 c2=3.7424634916177e-02, phip=9.2368609820592e+00, mindist=1.1180339887499e-01 4 c2=3.9756801916269e-02, phip=1.4539725173219e+01, mindist=7.0710678118655e-02 6 c2=3.4622655857252e-02, phip=1.4142135623826e+01, mindist=7.0710678118655e-02 8 c2=3.5310809939870e-02, phip=1.4456309011263e+01, mindist=7.0710678118655e-02 10 c2=4.6320657363751e-02, phip=1.4456309011328e+01, mindist=7.0710678118655e-02 12 c2=4.1862612180906e-02, phip=1.4539725173244e+01, mindist=7.0710678118655e-02 14 c2=4.0934133661406e-02, phip=1.4539725173228e+01, mindist=7.0710678118655e-02 16 c2=3.5951054207203e-02, phip=9.1957299868635e+00, mindist=1.1180339887499e-01 18 c2=3.8810157157769e-02, phip=9.2706042376728e+00, mindist=1.1180339887499e-01 20 c2=3.8826257849676e-02, phip=1.4456309011263e+01, mindist=7.0710678118655e-02 [all …]
|
H A D | space_filling_criteria_nonunit_ref.val | 2 c2=4.4357011356332e-02, phip=9.2368609820592e-01, mindist=1.1768778828946e-01 4 c2=4.6324814650957e-02, phip=1.4539725173219e+00, mindist=7.4432292756479e-02 6 c2=4.2261234399007e-02, phip=1.4142135623826e+00, mindist=7.4432292756479e-02 8 c2=4.2165120114984e-02, phip=1.4456309011263e+00, mindist=7.4432292756479e-02 10 c2=5.2539455833220e-02, phip=1.4456309011328e+00, mindist=7.4432292756479e-02 12 c2=5.0367916188338e-02, phip=1.4539725173244e+00, mindist=7.4432292756479e-02 14 c2=4.7038414132210e-02, phip=1.4539725173228e+00, mindist=7.4432292756479e-02 16 c2=4.2643525269348e-02, phip=9.1957299868635e-01, mindist=1.1768778828946e-01 18 c2=4.5189290427044e-02, phip=9.2706042376728e-01, mindist=1.1768778828946e-01 20 c2=4.5572906886560e-02, phip=1.4456309011263e+00, mindist=7.4432292756479e-02 [all …]
|
H A D | space_filling_criteria.val | 2 c2=3.7424634916177e-02, phip=9.2368609820592e+00, mindist=1.1180339887499e-01 4 c2=3.9756801916269e-02, phip=1.4539725173219e+01, mindist=7.0710678118655e-02 6 c2=3.4622655857252e-02, phip=1.4142135623826e+01, mindist=7.0710678118655e-02 8 c2=3.5310809939870e-02, phip=1.4456309011263e+01, mindist=7.0710678118655e-02 10 c2=4.6320657363751e-02, phip=1.4456309011328e+01, mindist=7.0710678118655e-02 12 c2=4.1862612180906e-02, phip=1.4539725173244e+01, mindist=7.0710678118655e-02 14 c2=4.0934133661406e-02, phip=1.4539725173228e+01, mindist=7.0710678118655e-02 16 c2=3.5951054207203e-02, phip=9.1957299868635e+00, mindist=1.1180339887499e-01 18 c2=3.8810157157769e-02, phip=9.2706042376728e+00, mindist=1.1180339887499e-01 20 c2=3.8826257849676e-02, phip=1.4456309011263e+01, mindist=7.0710678118655e-02 [all …]
|
H A D | space_filling_criteria_nonunit.val | 2 c2=4.4357011356332e-02, phip=9.2368609820592e-01, mindist=1.1768778828946e-01 4 c2=4.6324814650957e-02, phip=1.4539725173219e+00, mindist=7.4432292756479e-02 6 c2=4.2261234399007e-02, phip=1.4142135623826e+00, mindist=7.4432292756479e-02 8 c2=4.2165120114984e-02, phip=1.4456309011263e+00, mindist=7.4432292756479e-02 10 c2=5.2539455833220e-02, phip=1.4456309011328e+00, mindist=7.4432292756479e-02 12 c2=5.0367916188338e-02, phip=1.4539725173244e+00, mindist=7.4432292756479e-02 14 c2=4.7038414132210e-02, phip=1.4539725173228e+00, mindist=7.4432292756479e-02 16 c2=4.2643525269354e-02, phip=9.1957299868635e-01, mindist=1.1768778828946e-01 18 c2=4.5189290427044e-02, phip=9.2706042376728e-01, mindist=1.1768778828946e-01 20 c2=4.5572906886560e-02, phip=1.4456309011263e+00, mindist=7.4432292756479e-02 [all …]
|
/dports/games/NBlood/NBlood-a1689a4/source/build/src/ |
H A D | colmatch.cpp | 95 int mindist = -1; in paletteGetClosestColorWithBlacklist() local 114 if (mindist == -1) in paletteGetClosestColorWithBlacklist() 118 if (mindist != -1) in paletteGetClosestColorWithBlacklist() 120 uint32_t const idx = colmatchresults[mindist]>>24; in paletteGetClosestColorWithBlacklist() 146 int mindist = min(minrdist, mingdist); in paletteGetClosestColorWithBlacklistNoCache() local 147 mindist = min(mindist, minbdist) + 1; in paletteGetClosestColorWithBlacklistNoCache() 171 mindist = dist; in paletteGetClosestColorWithBlacklistNoCache() 180 mindist = INT32_MAX; in paletteGetClosestColorWithBlacklistNoCache() 190 if (dist >= mindist) continue; in paletteGetClosestColorWithBlacklistNoCache() 191 if ((dist += rdist[pal1[0]+r]) >= mindist) continue; in paletteGetClosestColorWithBlacklistNoCache() [all …]
|
/dports/math/fcl/fcl-0.7.0/include/fcl/math/detail/ |
H A D | project-inl.h | 89 S mindist = -1; in projectTriangle() local 97 if(mindist < 0 || res_line.sqr_distance < mindist) in projectTriangle() 140 S mindist = -1; in projectTetrahedra() local 149 if(mindist < 0 || res_triangle.sqr_distance < mindist) in projectTetrahedra() 161 if(mindist < 0) in projectTetrahedra() 163 mindist = 0; in projectTetrahedra() 217 S mindist = -1; in projectTriangleOrigin() local 225 if(mindist < 0 || res_line.sqr_distance < mindist) in projectTriangleOrigin() 268 S mindist = -1; in projectTetrahedraOrigin() local 277 if(mindist < 0 || res_triangle.sqr_distance < mindist) in projectTetrahedraOrigin() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | squared_distance_2_2.h | 268 FT mindist, dist; in squared_distance() local 276 return mindist; in squared_distance() 300 FT mindist, dist; in squared_distance() local 302 mindist = in squared_distance() 317 return mindist; in squared_distance() 338 return mindist; in squared_distance() 362 FT mindist, dist; in squared_distance() local 387 return mindist; in squared_distance() 411 return mindist; in squared_distance() 437 mindist = in squared_distance() [all …]
|
/dports/math/igraph/igraph-0.9.5/src/properties/ |
H A D | neighborhood.c | 87 if (mindist < 0 || mindist > order) { in igraph_neighborhood_size() 89 IGRAPH_EINVAL, order, mindist); in igraph_neighborhood_size() 105 long int size = mindist == 0 ? 1 : 0; in igraph_neighborhood_size() 128 if (actdist + 1 >= mindist) { in igraph_neighborhood_size() 139 if (actdist + 1 >= mindist) { in igraph_neighborhood_size() 219 if (mindist < 0 || mindist > order) { in igraph_neighborhood() 240 if (mindist == 0) { in igraph_neighborhood() 263 if (actdist + 1 >= mindist) { in igraph_neighborhood() 274 if (actdist + 1 >= mindist) { in igraph_neighborhood() 366 if (mindist < 0 || mindist > order) { in igraph_neighborhood_graphs() [all …]
|
/dports/graphics/ocrad/ocrad-0.27/ |
H A D | mask.cc | 114 int mindist = INT_MAX; in distance() local 118 if( vd >= mindist ) { if( i < re.top() ) break; else continue; } in distance() 120 if( hd >= mindist ) continue; in distance() 122 if( d < mindist ) mindist = d; in distance() 124 return mindist; in distance() 130 int mindist = INT_MAX; in distance() local 134 if( vd >= mindist ) { if( i < row ) break; else continue; } in distance() 136 if( hd >= mindist ) continue; in distance() 138 if( d < mindist ) mindist = d; in distance() 140 return mindist; in distance()
|
/dports/textproc/py-whoosh/Whoosh-2.7.4/src/whoosh/query/ |
H A D | spans.py | 394 self.mindist = mindist 405 and self.mindist == other.mindist) 416 ordered=self.ordered, mindist=self.mindist) 423 mindist=self.mindist) 451 self.mindist = mindist 467 mindist = self.mindist 537 self.mindist = mindist 548 and self.mindist == other.mindist) 578 mindist=self.mindist) 585 self.mindist = mindist [all …]
|
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/geometry/multi/algorithms/ |
H A D | distance.hpp | 47 return_type mindist; in apply() local 54 if (first || dist < mindist) in apply() 56 mindist = dist; in apply() 61 return mindist; in apply() 74 return_type mindist; in apply() local 86 if (first || dist < mindist) in apply() 88 mindist = dist; in apply() 93 return mindist; in apply()
|
/dports/math/R-cran-igraph/igraph/tests/testthat/ |
H A D | test_neighborhood.R | 48 expect_that(ego_size(g, order=2, mindist=0), equals(rep(5, 10))) 49 expect_that(ego_size(g, order=2, mindist=1), equals(rep(4, 10))) 50 expect_that(ego_size(g, order=2, mindist=2), equals(rep(2, 10))) 54 n0 <- unvs(ego(g, order=2, 5:6, mindist=0)) 55 n1 <- unvs(ego(g, order=2, 5:6, mindist=1)) 56 n2 <- unvs(ego(g, order=2, 5:6, mindist=2)) 62 ng0 <- make_ego_graph(g, order=2, 5:6, mindist=0) 63 ng1 <- make_ego_graph(g, order=2, 5:6, mindist=1) 64 ng2 <- make_ego_graph(g, order=2, 5:6, mindist=2)
|
/dports/math/dieharder/dieharder-3.31.1/libdieharder/ |
H A D | diehard_2dsphere.c | 67 double dist,mindist; in diehard_2dsphere() local 136 mindist = 10000.0; in diehard_2dsphere() 147 if(points[j].c[0] - points[i].c[0] > mindist) break; in diehard_2dsphere() 152 if( dist < mindist) mindist = dist; in diehard_2dsphere() 156 printf("Found minimum distance = %16.10e\n",mindist); in diehard_2dsphere() 170 test[0]->pvalues[irun] = 1.0 - exp(-mindist*mindist/0.995); in diehard_2dsphere()
|
H A D | rgb_minimum_distance.c | 80 double earg,qarg,dist,mindist,dvolume; in rgb_minimum_distance() local 164 mindist = 1.0; in rgb_minimum_distance() 175 if(points[j].c[0] - points[i].c[0] > mindist) break; in rgb_minimum_distance() 180 if( dist < mindist) mindist = dist; in rgb_minimum_distance() 184 printf("Found rmin = %16.10e\n",mindist); in rgb_minimum_distance() 186 rgb_mindist_avg += mindist; in rgb_minimum_distance() 197 dvolume = pow(PI,rgb_md_dim/2)*pow(mindist,rgb_md_dim)/gsl_sf_fact(rgb_md_dim/2); in rgb_minimum_distance() 199 dvolume = 2.0*pow(2.0*PI,(rgb_md_dim-1)/2)*pow(mindist,rgb_md_dim)/gsl_sf_doublefact(rgb_md_dim); in rgb_minimum_distance()
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-mtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/query/ |
H A D | MTreeSearchCandidate.java | 39 public double mindist; field in MTreeSearchCandidate 65 …public MTreeSearchCandidate(final double mindist, final int nodeID, final DBID routingObjectID, do… in MTreeSearchCandidate() argument 67 this.mindist = mindist; in MTreeSearchCandidate() 86 return Double.compare(this.mindist, o.mindist); in compareTo()
|
/dports/cad/alliance/alliance/src/ring/src/ |
H A D | distance.c | 174 long mindist = distance; in existe_con_precalim() local 192 if (dist < mindist) { in existe_con_precalim() 193 mindist = dist; in existe_con_precalim() 217 if (dist < mindist) { in existe_con_precalim() 218 mindist = dist; in existe_con_precalim() 250 long mindist = 0; in existe_con_suiv() local 272 mindist = dist; in existe_con_suiv() 275 } else if (dist < mindist) { in existe_con_suiv() 276 mindist = dist; in existe_con_suiv() 302 mindist = dist; in existe_con_suiv() [all …]
|
/dports/multimedia/mlt6/mlt-6.26.1/src/modules/videostab/stab/klt/ |
H A D | selectGoodFeatures.c | 27 int mindist, in _fillFeaturemap() argument 33 for (iy = y - mindist ; iy <= y + mindist ; iy++) in _fillFeaturemap() 34 for (ix = x - mindist ; ix <= x + mindist ; ix++) in _fillFeaturemap() 62 int mindist, /* min. dist b/w features */ in _enforceMinimumDistance() argument 79 mindist--; in _enforceMinimumDistance() 87 _fillFeaturemap(x, y, featuremap, mindist, ncols, nrows); in _enforceMinimumDistance() 131 _fillFeaturemap(x, y, featuremap, mindist, ncols, nrows); in _enforceMinimumDistance() 319 if (tc->mindist < 0) { in _KLTSelectGoodFeatures() 321 "is negative (%d); setting to zero", tc->mindist); in _KLTSelectGoodFeatures() 322 tc->mindist = 0; in _KLTSelectGoodFeatures() [all …]
|
/dports/multimedia/mlt6-qt5/mlt-6.26.1/src/modules/videostab/stab/klt/ |
H A D | selectGoodFeatures.c | 27 int mindist, in _fillFeaturemap() argument 33 for (iy = y - mindist ; iy <= y + mindist ; iy++) in _fillFeaturemap() 34 for (ix = x - mindist ; ix <= x + mindist ; ix++) in _fillFeaturemap() 62 int mindist, /* min. dist b/w features */ in _enforceMinimumDistance() argument 79 mindist--; in _enforceMinimumDistance() 87 _fillFeaturemap(x, y, featuremap, mindist, ncols, nrows); in _enforceMinimumDistance() 131 _fillFeaturemap(x, y, featuremap, mindist, ncols, nrows); in _enforceMinimumDistance() 319 if (tc->mindist < 0) { in _KLTSelectGoodFeatures() 321 "is negative (%d); setting to zero", tc->mindist); in _KLTSelectGoodFeatures() 322 tc->mindist = 0; in _KLTSelectGoodFeatures() [all …]
|
/dports/multimedia/py-mlt6/mlt-6.26.1/src/modules/videostab/stab/klt/ |
H A D | selectGoodFeatures.c | 27 int mindist, in _fillFeaturemap() argument 33 for (iy = y - mindist ; iy <= y + mindist ; iy++) in _fillFeaturemap() 34 for (ix = x - mindist ; ix <= x + mindist ; ix++) in _fillFeaturemap() 62 int mindist, /* min. dist b/w features */ in _enforceMinimumDistance() argument 79 mindist--; in _enforceMinimumDistance() 87 _fillFeaturemap(x, y, featuremap, mindist, ncols, nrows); in _enforceMinimumDistance() 131 _fillFeaturemap(x, y, featuremap, mindist, ncols, nrows); in _enforceMinimumDistance() 319 if (tc->mindist < 0) { in _KLTSelectGoodFeatures() 321 "is negative (%d); setting to zero", tc->mindist); in _KLTSelectGoodFeatures() 322 tc->mindist = 0; in _KLTSelectGoodFeatures() [all …]
|
/dports/games/jfsw/jfsw-c434002/jfbuild/tools/ |
H A D | transpal.c | 31 int i, j, k, dist, mindist, retcol; in getclosestcol() local 39 mindist = min(mindist,bdist[coldist[b&7]+64+8]); in getclosestcol() 40 mindist++; in getclosestcol() 53 dist = glookup[ptr[1]]; if (dist >= mindist) continue; in getclosestcol() 54 dist += rlookup[ptr[0]]; if (dist >= mindist) continue; in getclosestcol() 55 dist += blookup[ptr[2]]; if (dist >= mindist) continue; in getclosestcol() 56 mindist = dist; retcol = i; in getclosestcol() 61 mindist = 0x7fffffff; in getclosestcol() 65 dist = glookup[ptr[1]]; if (dist >= mindist) continue; in getclosestcol() 66 dist += rlookup[ptr[0]]; if (dist >= mindist) continue; in getclosestcol() [all …]
|
/dports/devel/vcglib/vcglib-2020.09/wrap/gui/ |
H A D | frustum.h | 112 T mindist = 0; in Remoteness() local 115 if(tmp > mindist) mindist = tmp; in Remoteness() 117 if(tmp > mindist) mindist = tmp; in Remoteness() 120 if(tmp > mindist) mindist = tmp; in Remoteness() 122 if(tmp > mindist) mindist = tmp; in Remoteness() 124 if(mindist == 0) return 0; in Remoteness() 125 return 1 + (mindist / (View<T>::viewport[0] + View<T>::viewport[2])); in Remoteness()
|
/dports/graphics/wdune/wdune-1.926/vcglib/wrap/gui/ |
H A D | frustum.h | 112 T mindist = 0; in Remoteness() local 115 if(tmp > mindist) mindist = tmp; in Remoteness() 117 if(tmp > mindist) mindist = tmp; in Remoteness() 120 if(tmp > mindist) mindist = tmp; in Remoteness() 122 if(tmp > mindist) mindist = tmp; in Remoteness() 124 if(mindist == 0) return 0; in Remoteness() 125 return 1 + (mindist / (View<T>::viewport[0] + View<T>::viewport[2])); in Remoteness()
|
/dports/science/fastjet/fastjet-3.3.4/include/fastjet/internal/ |
H A D | DnnPlane.hh | 159 double & mindist){ in _is_closer_to() argument 161 return _is_closer_to_with_hint(pref, candidate, near, dist, mindist); in _is_closer_to() 170 double & mindist){ in _is_closer_to_with_hint() argument 191 if ((std::abs(dist-mindist)<DISTANCE_FOR_CGAL_CHECKS) && in _is_closer_to_with_hint() 203 mindist = dist; in _is_closer_to_with_hint() 206 } else if (dist <= mindist) { in _is_closer_to_with_hint() 213 mindist = dist; in _is_closer_to_with_hint()
|
/dports/graphics/gimp-app/gimp-2.10.30/app/core/ |
H A D | gimpimage-pick-item.c | 198 gdouble mindist = G_MAXDOUBLE; in gimp_image_pick_vectors() local 224 dist < MIN (epsilon_y, mindist)) in gimp_image_pick_vectors() 226 mindist = dist; in gimp_image_pick_vectors() 248 gdouble mindist = G_MAXDOUBLE; in gimp_image_pick_guide_internal() local 265 if (dist < MIN (epsilon_y, mindist)) in gimp_image_pick_guide_internal() 267 mindist = dist; in gimp_image_pick_guide_internal() 279 if (dist < MIN (epsilon_x, mindist / epsilon_y * epsilon_x)) in gimp_image_pick_guide_internal() 281 mindist = dist * epsilon_y / epsilon_x; in gimp_image_pick_guide_internal() 346 gdouble mindist = G_MAXDOUBLE; in gimp_image_pick_sample_point() local 373 if (dist < MIN (epsilon_y, mindist)) in gimp_image_pick_sample_point() [all …]
|
/dports/graphics/rayshade/rayshade.4.0/libray/libobj/ |
H A D | list.c | 66 ListIntersect(list, ray, hitlist, mindist, maxdist) in ListIntersect() argument 70 Float mindist, *maxdist; 82 if (intersect(objlist, ray, hitlist, mindist, maxdist)) 90 VecAddScaled(ray->pos, mindist, ray->dir, &vtmp); 92 !BoundsIntersect(ray, list->bounds, mindist, &s)) 102 if (intersect(objlist, ray, hitlist, mindist, maxdist))
|