/dports/math/nanoflann/nanoflann-1.3.2/tests/ |
H A D | test_main.cpp | 209 dist+= (query_pt[d]-cloud.kdtree_get_pt(i,d))*(query_pt[d]-cloud.kdtree_get_pt(i,d)); in SO3_vs_bruteforce_test() 261 dist = cloud.kdtree_get_pt(i,0) - query_pt[0]; in SO2_vs_bruteforce_test() 331 dist+= (query_pt[d]-cloud.kdtree_get_pt(i,d))*(query_pt[d]-cloud.kdtree_get_pt(i,d)); in L2_dynamic_vs_bruteforce_test() 369 dist+= (query_pt[d]-cloud.kdtree_get_pt(i,d))*(query_pt[d]-cloud.kdtree_get_pt(i,d)); in L2_dynamic_vs_bruteforce_test()
|
/dports/math/libmesh/libmesh-1.6.2/contrib/nanoflann/examples/ |
H A D | utils.h | 48 inline T kdtree_get_pt(const size_t idx, int dim) const in kdtree_get_pt() function 93 inline T kdtree_get_pt(const size_t idx, int dim) const in kdtree_get_pt() function 150 inline T kdtree_get_pt(const size_t idx, int dim = 0) const
|
H A D | KDTreeVectorOfVectorsAdaptor.h | 103 inline num_t kdtree_get_pt(const size_t idx, int dim) const { in kdtree_get_pt() function
|
H A D | pointcloud_adaptor_example.cpp | 74 inline coord_t kdtree_get_pt(const size_t idx, int dim) const in kdtree_get_pt() function
|
/dports/math/nanoflann/nanoflann-1.3.2/examples/ |
H A D | utils.h | 48 inline T kdtree_get_pt(const size_t idx, const size_t dim) const in kdtree_get_pt() function 93 inline T kdtree_get_pt(const size_t idx, const size_t dim) const in kdtree_get_pt() function 150 inline T kdtree_get_pt(const size_t idx, const size_t dim = 0) const
|
H A D | KDTreeVectorOfVectorsAdaptor.h | 103 inline num_t kdtree_get_pt(const size_t idx, const size_t dim) const { in kdtree_get_pt() function
|
H A D | pointcloud_adaptor_example.cpp | 74 inline coord_t kdtree_get_pt(const size_t idx, const size_t dim) const in kdtree_get_pt() function
|
/dports/cad/gmsh/gmsh-4.9.2-source/Numeric/ |
H A D | nanoflann.hpp | 281 const DistanceType diff0 = std::abs(a[0] - data_source.kdtree_get_pt(b_idx,d++)); in operator ()() 282 const DistanceType diff1 = std::abs(a[1] - data_source.kdtree_get_pt(b_idx,d++)); in operator ()() 283 const DistanceType diff2 = std::abs(a[2] - data_source.kdtree_get_pt(b_idx,d++)); in operator ()() 293 result += std::abs( *a++ - data_source.kdtree_get_pt(b_idx,d++) ); in operator ()() 329 const DistanceType diff0 = a[0] - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 330 const DistanceType diff1 = a[1] - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 331 const DistanceType diff2 = a[2] - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 332 const DistanceType diff3 = a[3] - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 341 const DistanceType diff0 = *a++ - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 985 return dataset.kdtree_get_pt(idx,component); in dataset_get() [all …]
|
/dports/devel/vcglib/vcglib-2020.09/apps/sample/trimesh_indexing/ |
H A D | nanoflann.hpp | 267 const DistanceType diff0 = nanoflann::abs(a[0] - data_source.kdtree_get_pt(b_idx,d++)); in operator ()() 268 const DistanceType diff1 = nanoflann::abs(a[1] - data_source.kdtree_get_pt(b_idx,d++)); in operator ()() 269 const DistanceType diff2 = nanoflann::abs(a[2] - data_source.kdtree_get_pt(b_idx,d++)); in operator ()() 279 result += nanoflann::abs( *a++ - data_source.kdtree_get_pt(b_idx,d++) ); in operator ()() 315 const DistanceType diff0 = a[0] - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 316 const DistanceType diff1 = a[1] - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 317 const DistanceType diff2 = a[2] - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 318 const DistanceType diff3 = a[3] - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 327 const DistanceType diff0 = *a++ - data_source.kdtree_get_pt(b_idx,d++); in operator ()() 995 return dataset.kdtree_get_pt(idx,component); in dataset_get() [all …]
|
/dports/math/saga/saga-8.1.3/saga-gis/src/saga_core/saga_api/ |
H A D | nanoflann.hpp | 342 std::abs(a[0] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 344 std::abs(a[1] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 346 std::abs(a[2] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 348 std::abs(a[3] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 357 result += std::abs(*a++ - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 392 const DistanceType diff0 = a[0] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 393 const DistanceType diff1 = a[1] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 394 const DistanceType diff2 = a[2] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 436 const DistanceType diff = a[i] - data_source.kdtree_get_pt(b_idx, i); in evalMetric() 823 return obj.dataset.kdtree_get_pt(idx, component); in dataset_get() [all …]
|
H A D | kdtree.cpp | 77 virtual double kdtree_get_pt (const size_t Index, int Dimension) const = 0; 132 virtual double kdtree_get_pt (const size_t Index, int Dimension) const in kdtree_get_pt() function in CSG_KDTree_Adaptor_Points 182 virtual double kdtree_get_pt (const size_t Index, int Dimension) const in kdtree_get_pt() function in CSG_KDTree_Adaptor_PointCloud 228 virtual double kdtree_get_pt (const size_t Index, int Dimension) const in kdtree_get_pt() function in CSG_KDTree_Adaptor_Coordinates
|
/dports/math/libmesh/libmesh-1.6.2/contrib/nanoflann/include/ |
H A D | nanoflann.hpp | 284 const DistanceType diff0 = std::abs(a[0] - data_source.kdtree_get_pt(b_idx,d++)); in evalMetric() 285 const DistanceType diff1 = std::abs(a[1] - data_source.kdtree_get_pt(b_idx,d++)); in evalMetric() 296 result += std::abs( *a++ - data_source.kdtree_get_pt(b_idx, d++) ); in evalMetric() 332 const DistanceType diff0 = a[0] - data_source.kdtree_get_pt(b_idx,d++); in evalMetric() 333 const DistanceType diff1 = a[1] - data_source.kdtree_get_pt(b_idx,d++); in evalMetric() 334 const DistanceType diff2 = a[2] - data_source.kdtree_get_pt(b_idx,d++); in evalMetric() 335 const DistanceType diff3 = a[3] - data_source.kdtree_get_pt(b_idx,d++); in evalMetric() 344 const DistanceType diff0 = *a++ - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 375 const DistanceType diff = a[i] - data_source.kdtree_get_pt(b_idx, i); in evalMetric() 886 return obj.dataset.kdtree_get_pt(idx, component); in dataset_get() [all …]
|
/dports/science/cdo/cdo-2.0.0/src/ |
H A D | nanoflann.hpp | 355 std::abs(a[0] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 357 std::abs(a[1] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 359 std::abs(a[2] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 361 std::abs(a[3] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 370 result += std::abs(*a++ - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 405 const DistanceType diff0 = a[0] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 406 const DistanceType diff1 = a[1] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 407 const DistanceType diff2 = a[2] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 449 const DistanceType diff = a[i] - data_source.kdtree_get_pt(b_idx, i); in evalMetric() 837 return obj.dataset.kdtree_get_pt(idx, component); in dataset_get() [all …]
|
/dports/math/nanoflann/nanoflann-1.3.2/include/ |
H A D | nanoflann.hpp | 342 std::abs(a[0] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 344 std::abs(a[1] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 346 std::abs(a[2] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 348 std::abs(a[3] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 357 result += std::abs(*a++ - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 392 const DistanceType diff0 = a[0] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 393 const DistanceType diff1 = a[1] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 394 const DistanceType diff2 = a[2] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 436 const DistanceType diff = a[i] - data_source.kdtree_get_pt(b_idx, i); in evalMetric() 824 return obj.dataset.kdtree_get_pt(idx, component); in dataset_get() [all …]
|
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/alphamat/src/3rdparty/ |
H A D | nanoflann.hpp | 342 std::abs(a[0] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 344 std::abs(a[1] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 346 std::abs(a[2] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 348 std::abs(a[3] - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 357 result += std::abs(*a++ - data_source.kdtree_get_pt(b_idx, d++)); in evalMetric() 392 const DistanceType diff0 = a[0] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 393 const DistanceType diff1 = a[1] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 394 const DistanceType diff2 = a[2] - data_source.kdtree_get_pt(b_idx, d++); in evalMetric() 436 const DistanceType diff = a[i] - data_source.kdtree_get_pt(b_idx, i); in evalMetric() 824 return obj.dataset.kdtree_get_pt(idx, component); in dataset_get() [all …]
|
H A D | KDTreeVectorOfVectorsAdaptor.h | 104 inline num_t kdtree_get_pt(const size_t idx, const size_t dim) const { in kdtree_get_pt() function
|
/dports/math/pdal/PDAL-2.3.0/pdal/private/ |
H A D | KDImpl.hpp | 54 double kdtree_get_pt(const PointId idx, int dim) const in kdtree_get_pt() function in pdal::KD2Impl 156 double kdtree_get_pt(const PointId idx, int dim) const in kdtree_get_pt() function in pdal::KD3Impl 354 inline double kdtree_get_pt(const PointId idx, int dim) const in kdtree_get_pt() function in pdal::KDFlexImpl
|
/dports/cad/gmsh/gmsh-4.9.2-source/Geo/ |
H A D | SPoint3KDTree.h | 29 inline double kdtree_get_pt(const size_t idx, int dim) const in kdtree_get_pt() function
|
/dports/math/nanoflann/nanoflann-1.3.2/perf-tests/nanoflann/ |
H A D | test_nanoflann.cpp | 69 inline float kdtree_get_pt(const size_t idx, const size_t dim) const in kdtree_get_pt() function
|
H A D | test_leaf_max_size.cpp | 72 inline T kdtree_get_pt(const size_t idx, const size_t dim) const in kdtree_get_pt() function
|
/dports/math/nanoflann/nanoflann-1.3.2/benchmarkTool/randomTests/ |
H A D | benchmark_nanoflann_random.cpp | 54 inline T kdtree_get_pt(const size_t idx, const size_t dim) const in kdtree_get_pt() function
|
/dports/math/nanoflann/nanoflann-1.3.2/benchmarkTool/realTests/ |
H A D | benchmark_nanoflann_real.cpp | 54 inline T kdtree_get_pt(const size_t idx, const size_t dim) const { in kdtree_get_pt() function
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/muq2/MUQ/Modeling/Flann/ |
H A D | FlannCache.h | 77 inline double kdtree_get_pt(const size_t idx, int dim) const { in kdtree_get_pt() function
|
/dports/math/libmesh/libmesh-1.6.2/include/solution_transfer/ |
H A D | meshfree_interpolation.h | 260 inline coord_t kdtree_get_pt(const size_t idx, int dim) const in kdtree_get_pt() function
|
/dports/math/pdal/PDAL-2.3.0/vendor/nanoflann/ |
H A D | nanoflann.hpp | 301 const DistanceType diff = a[i] - data_source.kdtree_get_pt(b_idx, i); in evalMetric() 603 return obj.dataset.kdtree_get_pt(idx, component); in dataset_get()
|