SPH
KdTree< TNode, TMetric > Member List

This is the complete list of members for KdTree< TNode, TMetric >, including all inherited members.

build(IScheduler &scheduler, ArrayView< const Vector > points, Flags< FinderFlag > flags=FinderFlag::MAKE_RANK)ISymmetricFinder
IBasicFinder::build(IScheduler &scheduler, ArrayView< const Vector > points)IBasicFinder
buildImpl(IScheduler &scheduler, ArrayView< const Vector > points) overrideKdTree< TNode, TMetric >protectedvirtual
buildWithRank(IScheduler &scheduler, ArrayView< const Vector > points, TCompare &&comp)ISymmetricFinderinline
find(const Vector &pos, const Size index, const Float radius, Array< NeighbourRecord > &neighs) constKdTree< TNode, TMetric >
findAll(const Size index, const Float radius, Array< NeighbourRecord > &neighbours) const overrideFinderTemplate< KdTree< TNode, EuclideanMetric > >inlinevirtual
findAll(const Vector &pos, const Float radius, Array< NeighbourRecord > &neighbours) const overrideFinderTemplate< KdTree< TNode, EuclideanMetric > >inlinevirtual
findLowerRank(const Size index, const Float radius, Array< NeighbourRecord > &neighbours) const overrideFinderTemplate< KdTree< TNode, EuclideanMetric > >inlinevirtual
getLeafIndices(const LeafNode< TNode > &leaf) constKdTree< TNode, TMetric >inline
getNode(const Size nodeIdx)KdTree< TNode, TMetric >inline
getNode(const Size nodeIdx) constKdTree< TNode, TMetric >inline
getNodeCnt() constKdTree< TNode, TMetric >inline
KdTree(const Size leafSize=25, const Size maxParallelDepth=50)KdTree< TNode, TMetric >inlineexplicit
leafSizeKdTree< TNode, TMetric >
maxParallelDepthKdTree< TNode, TMetric >
rankISymmetricFinderprotected
sanityCheck() constKdTree< TNode, TMetric >
valuesIBasicFinderprotected
~Polymorphic()Polymorphicinlinevirtual