/dports/cad/opencascade/opencascade-7.6.0/src/DrawDim/ |
H A D | DrawDim_Angle.cxx | 129 Standard_Real curdist = 0; in DrawOn() local 163 Standard_Real curdist = curpos.Distance (curpt); in DrawOn() local
|
H A D | DrawDim.cxx | 182 Standard_Real curdist; in Nearest() local
|
/dports/security/steghide/steghide-0.5.1/src/ |
H A D | BmpPaletteSampleValue.cc | 43 UWORD32 curdist = calcDistance (destsv) ; in getNearestTargetSampleValue() local
|
H A D | BmpRGBSampleValue.cc | 78 UWORD32 curdist = Color.calcDistance(*cit) ; in getNearestTargetSampleValue() local
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-outlier/src/main/java/de/lmu/ifi/dbs/elki/algorithm/outlier/lof/ |
H A D | COF.java | 165 double curdist = mindists[i]; in computeAverageChainingDistances() local 178 final double curdist = mindists[i]; in computeAverageChainingDistances() local
|
H A D | LOCI.java | 234 final double curdist = ni.doubleValue(); in precomputeInterestingRadii() local
|
/dports/graphics/liblug/lug/utils/ |
H A D | change.c | 46 int curdist; local
|
/dports/math/igraph/igraph-0.9.5/src/paths/ |
H A D | simple_paths.c | 120 int curdist = igraph_vector_int_tail(&dist); in igraph_get_all_simple_paths() local
|
H A D | dijkstra.c | 194 igraph_real_t curdist = active ? -igraph_2wheap_get(&Q, tto) : 0.0; in igraph_shortest_paths_dijkstra() local 425 igraph_real_t curdist = VECTOR(dists)[tto]; in igraph_get_shortest_paths_dijkstra() local 808 igraph_real_t curdist = VECTOR(dists)[tto]; in igraph_get_all_shortest_paths_dijkstra() local
|
H A D | shortest_paths.c | 242 igraph_real_t curdist = active ? -igraph_2wheap_get(&Q, tto) : 0.0; in igraph_i_average_path_length_dijkstra() local 610 igraph_real_t altdist, curdist; in igraph_i_local_efficiency_dijkstra() local 1205 igraph_real_t curdist = active ? -igraph_2wheap_get(&Q, tto) : 0.0; in igraph_diameter_dijkstra() local
|
/dports/math/R-cran-igraph/igraph/src/ |
H A D | paths.c | 117 int curdist = igraph_vector_int_tail(&dist); in igraph_get_all_simple_paths() local
|
/dports/astro/gpsbabel14/gpsbabel-1.4.4/ |
H A D | interpolate.c | 66 double curdist; in interpfilt_process() local
|
/dports/misc/openmvg/openMVG-2.0/src/third_party/hnswlib/ |
H A D | hnswalg.h | 341 dist_t curdist = in getNeighborsByHeuristic2() local 492 …dist_t curdist = fstdistfunc_(query_data, getDataByInternalId(enterpoint_node_), dist_func_param_); in searchKnnInternal() local 852 … dist_t curdist = fstdistfunc_(data_point, getDataByInternalId(currObj), dist_func_param_); in addPoint() local 919 …dist_t curdist = fstdistfunc_(query_data, getDataByInternalId(enterpoint_node_), dist_func_param_); in searchKnn() local
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Numerics/FEM/src/ |
H A D | itkFEMLoadLandmark.cxx | 161 Element::Float curdist = new_source.magnitude(); in ApplyLoad() local
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/ALGLIB/ |
H A D | alglibmisc.h | 61 double curdist; member
|
/dports/math/igraph/igraph-0.9.5/src/centrality/ |
H A D | closeness.c | 222 igraph_real_t curdist = VECTOR(dist)[to]; in igraph_i_closeness_cutoff_weighted() local 707 igraph_real_t curdist = VECTOR(dist)[to]; in igraph_i_harmonic_centrality_weighted() local
|
H A D | betweenness.c | 169 igraph_real_t curdist = VECTOR(dist)[to]; in igraph_i_betweenness_cutoff_weighted() local 644 igraph_real_t curdist = VECTOR(distance)[to]; in igraph_i_edge_betweenness_cutoff_weighted() local
|
/dports/games/wolfpack/empire-4.4.1/include/ |
H A D | nsc.h | 158 int curdist; /* NS_DIST: current range */ member 171 int curdist; /* if NS_DIST, current item's dist */ member
|
/dports/math/alglib/alglib-cpp/src/ |
H A D | alglibmisc.h | 64 double curdist; member
|
/dports/astro/qmapshack/qmapshack-V_1.16.1/3rdparty/alglib/src/ |
H A D | alglibmisc.h | 48 double curdist; member
|
/dports/games/hyperrogue/hyperrogue-12.0f/rogueviz/ |
H A D | reverb.cpp | 113 array<ld, 2> curdist; member
|
/dports/audio/sc3-plugins/sc3-plugins-Version-3.9.0/source/MCLDUGens/ |
H A D | MCLDSOMUGens.cpp | 429 double curdist = 0.0; in SOM_findnearest_getdist() local 723 double curdist = 0.0; in KMeansRT_findnearest() local
|
/dports/math/igraph/igraph-0.9.5/src/community/ |
H A D | edge_betweenness.c | 634 igraph_real_t curdist = distance[to]; in igraph_community_edge_betweenness() local
|
/dports/lang/gcc12-devel/gcc-12-20211205/libphobos/libdruntime/rt/ |
H A D | minfo.d | 79 int curdist = 0; in genCyclePath() local
|
/dports/lang/gcc10/gcc-10.3.0/libphobos/libdruntime/rt/ |
H A D | minfo.d | 79 int curdist = 0; in genCyclePath() local
|