, including all inherited members.
| averageStatistics() | ApproxMVBB::KdTree::Tree< TTraits > | [inline, private] |
| build(const AABB< Dimension > &aabb, std::unique_ptr< NodeDataType > data, unsigned int maxTreeDepth=50, unsigned int maxLeafs=std::numeric_limits< unsigned int >::max()) | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| TreeBase< TTraits::BaseTraits >::build(NodeType *root, NodeMap &c, NodeToChildMap &links) | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| buildLeafNeighbours(PREC minExtent) | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| buildLeafNeighboursAutomatic() | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| cleanUp(T &&...t) | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| copyFrom(const TreeBase< T > &tree) | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline, protected] |
| enumerateNodes() | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| getKNearestNeighbours(typename TKNNTraits::PrioQueue &kNearest) const | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| getLeaf(const MatrixBase< Derived > &point) const | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| getLeaf(const std::size_t &leafIndex) const | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| getLeafs() | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| getLowestCommonAncestor(const NodeType *a, const NodeType *b) | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| getNode(const std::size_t &globalIndex) const | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| getNodes() | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| getRootNode() | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| getStatistics() | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| getStatisticsString() | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| initSplitHeuristic(T &&...t) | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| m_heuristic | ApproxMVBB::KdTree::Tree< TTraits > | [private] |
| m_leafs | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [protected] |
| m_maxLeafs | ApproxMVBB::KdTree::Tree< TTraits > | [private] |
| m_maxTreeDepth | ApproxMVBB::KdTree::Tree< TTraits > | [private] |
| m_nodes | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [protected] |
| m_root | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [protected] |
| m_statistics | ApproxMVBB::KdTree::Tree< TTraits > | [private] |
| operator=(const Tree &t) | ApproxMVBB::KdTree::Tree< TTraits > | |
| resetStatistics() | ApproxMVBB::KdTree::Tree< TTraits > | [inline, private] |
| resetTree() | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| safetyCheckNeighbours(const NeighbourMap &n, PREC minExtent) | ApproxMVBB::KdTree::Tree< TTraits > | [inline, private] |
| Tree class | ApproxMVBB::KdTree::Tree< TTraits > | [friend] |
| Tree() | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| Tree(Tree &&tree) | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| Tree(const Tree &tree) | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| Tree(const Tree< T > &tree) | ApproxMVBB::KdTree::Tree< TTraits > | [inline, explicit] |
| Tree(const TTree &tree) | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| TreeBase() | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| TreeBase(TreeBase &&t) | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| TreeBase(const TreeBase &t) | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline] |
| TreeBase(const TreeBase< T > &t) | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline, explicit] |
| TreeSimple class | ApproxMVBB::KdTree::Tree< TTraits > | [friend] |
| XML class | ApproxMVBB::KdTree::Tree< TTraits > | [friend] |
| ~Tree() | ApproxMVBB::KdTree::Tree< TTraits > | [inline] |
| ~TreeBase() | ApproxMVBB::KdTree::TreeBase< TTraits::BaseTraits > | [inline, protected] |