Home
last modified time | relevance | path

Searched refs:kdtree_get_point_count (Results 1 – 25 of 31) sorted by relevance

12

/dports/math/libmesh/libmesh-1.6.2/contrib/nanoflann/examples/
H A Dutils.h43 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
88 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
145 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
H A DKDTreeVectorOfVectorsAdaptor.h98 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
H A Dpointcloud_adaptor_example.cpp69 inline size_t kdtree_get_point_count() const { return derived().pts.size(); } in kdtree_get_point_count() function
/dports/math/nanoflann/nanoflann-1.3.2/examples/
H A Dutils.h43 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
88 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
145 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
H A DKDTreeVectorOfVectorsAdaptor.h98 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
H A Dpointcloud_adaptor_example.cpp69 inline size_t kdtree_get_point_count() const { return derived().pts.size(); } in kdtree_get_point_count() function
/dports/math/pdal/PDAL-2.3.0/pdal/private/
H A DKDImpl.hpp49 std::size_t kdtree_get_point_count() const in kdtree_get_point_count() function in pdal::KD2Impl
151 std::size_t kdtree_get_point_count() const in kdtree_get_point_count() function in pdal::KD3Impl
284 std::size_t kdtree_get_point_count() const in kdtree_get_point_count() function in pdal::KDFlexImpl
/dports/cad/gmsh/gmsh-4.9.2-source/Geo/
H A DSPoint3KDTree.h20 inline size_t kdtree_get_point_count() const { return derived().pts.size(); } in kdtree_get_point_count() function
/dports/math/saga/saga-8.1.3/saga-gis/src/saga_core/saga_api/
H A Dkdtree.cpp76 virtual size_t kdtree_get_point_count (void) const = 0;
127 virtual size_t kdtree_get_point_count (void) const in kdtree_get_point_count() function in CSG_KDTree_Adaptor_Points
177 virtual size_t kdtree_get_point_count (void) const in kdtree_get_point_count() function in CSG_KDTree_Adaptor_PointCloud
223 virtual size_t kdtree_get_point_count (void) const in kdtree_get_point_count() function in CSG_KDTree_Adaptor_Coordinates
H A Dnanoflann.hpp832 obj.dataset.kdtree_get_point_count() * in usedMemory()
1176 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in KDTreeSingleIndexAdaptor()
1191 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in buildIndex()
1309 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in init_vind()
1321 const size_t N = dataset.kdtree_get_point_count(); in computeBoundingBox()
1870 const size_t num_initial_points = dataset.kdtree_get_point_count(); in KDTreeSingleIndexDynamicAdaptor()
2013 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
/dports/math/pdal/PDAL-2.3.0/vendor/nanoflann/
H A Dnanoflann.hpp612 obj.dataset.kdtree_get_point_count() * in usedMemory()
908 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in KDTreeSingleIndexAdaptor()
923 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in buildIndex()
1041 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in init_vind()
1053 const size_t N = dataset.kdtree_get_point_count(); in computeBoundingBox()
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/alphamat/src/3rdparty/
H A DKDTreeVectorOfVectorsAdaptor.h99 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
H A Dnanoflann.hpp833 obj.dataset.kdtree_get_point_count() * in usedMemory()
1177 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in KDTreeSingleIndexAdaptor()
1192 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in buildIndex()
1310 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in init_vind()
1322 const size_t N = dataset.kdtree_get_point_count(); in computeBoundingBox()
1871 const size_t num_initial_points = dataset.kdtree_get_point_count(); in KDTreeSingleIndexDynamicAdaptor()
2014 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
/dports/math/nanoflann/nanoflann-1.3.2/perf-tests/nanoflann/
H A Dtest_nanoflann.cpp64 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
H A Dtest_leaf_max_size.cpp67 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
/dports/cad/gmsh/gmsh-4.9.2-source/Numeric/
H A Dnanoflann.hpp839 m_size = dataset.kdtree_get_point_count(); in KDTreeSingleIndexAdaptor()
887 …return pool.usedMemory+pool.wastedMemory+dataset.kdtree_get_point_count()*sizeof(IndexType); // p… in usedMemory()
978 m_size = dataset.kdtree_get_point_count(); in init_vind()
1023 const size_t N = dataset.kdtree_get_point_count(); in computeBoundingBox()
1377 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
/dports/devel/vcglib/vcglib-2020.09/apps/sample/trimesh_indexing/
H A Dnanoflann.hpp855 m_size = dataset.kdtree_get_point_count(); in KDTreeSingleIndexAdaptor()
915 …return pool.usedMemory+pool.wastedMemory+dataset.kdtree_get_point_count()*sizeof(IndexType); // p… in usedMemory()
988 m_size = dataset.kdtree_get_point_count(); in init_vind()
1033 const size_t N = dataset.kdtree_get_point_count(); in computeBoundingBox()
1421 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
H A Dtrimesh_indexing.cpp51 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
/dports/math/nanoflann/nanoflann-1.3.2/benchmarkTool/randomTests/
H A Dbenchmark_nanoflann_random.cpp49 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
/dports/math/libmesh/libmesh-1.6.2/contrib/nanoflann/include/
H A Dnanoflann.hpp895 …return obj.pool.usedMemory + obj.pool.wastedMemory + obj.dataset.kdtree_get_point_count() * sizeof… in usedMemory()
1204 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in KDTreeSingleIndexAdaptor()
1219 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in buildIndex()
1317 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in init_vind()
1331 const size_t N = dataset.kdtree_get_point_count(); in computeBoundingBox()
1824 …if (dataset.kdtree_get_point_count()) throw std::runtime_error("[nanoflann] cannot handle non empt… in KDTreeSingleIndexDynamicAdaptor()
1960 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
/dports/science/cdo/cdo-2.0.0/src/
H A Dnanoflann.hpp846 obj.dataset.kdtree_get_point_count() * in usedMemory()
1190 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in KDTreeSingleIndexAdaptor()
1205 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in buildIndex()
1332 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in init_vind()
1344 const size_t N = dataset.kdtree_get_point_count(); in computeBoundingBox()
1900 const size_t num_initial_points = dataset.kdtree_get_point_count(); in KDTreeSingleIndexDynamicAdaptor()
2046 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
/dports/math/nanoflann/nanoflann-1.3.2/include/
H A Dnanoflann.hpp833 obj.dataset.kdtree_get_point_count() * in usedMemory()
1177 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in KDTreeSingleIndexAdaptor()
1192 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in buildIndex()
1310 BaseClassRef::m_size = dataset.kdtree_get_point_count(); in init_vind()
1322 const size_t N = dataset.kdtree_get_point_count(); in computeBoundingBox()
1871 const size_t num_initial_points = dataset.kdtree_get_point_count(); in KDTreeSingleIndexDynamicAdaptor()
2017 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
/dports/math/nanoflann/nanoflann-1.3.2/benchmarkTool/realTests/
H A Dbenchmark_nanoflann_real.cpp48 inline size_t kdtree_get_point_count() const { return pts.size(); } in kdtree_get_point_count() function
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/muq2/MUQ/Modeling/Flann/
H A DFlannCache.h72 inline size_t kdtree_get_point_count() const { in kdtree_get_point_count() function
/dports/math/libmesh/libmesh-1.6.2/include/solution_transfer/
H A Dmeshfree_interpolation.h209 inline size_t kdtree_get_point_count() const { return _pts.size(); } in kdtree_get_point_count() function

12