Namespaces | |
| details | |
Classes | |
| struct | DefaultDistanceCompTraits |
| class | DefaultPointDataTraits |
| struct | DistanceComp |
| struct | EuclideanDistSq |
| class | LinearQualityEvaluator |
| class | NearestNeighbourFilter |
| struct | NoData |
| class | Node |
| class | NodeBase |
| class | NodeSimple |
| class | PointData |
| class | SplitHeuristic |
| class | SplitHeuristicPointData |
| class | Tree |
| class | TreeBase |
| class | TreeSimple |
| struct | TreeSimpleTraits |
| class | TreeStatistics |
| struct | TreeTraits |
| class | XML |
Typedefs | |
| template<typename Traits > | |
| using | SplitHeuristicPointDataDefault = meta::invoke< meta::bind_front< meta::quote< SplitHeuristicPointData >, LinearQualityEvaluator >, Traits > |
| using ApproxMVBB::KdTree::SplitHeuristicPointDataDefault = typedef meta::invoke<meta::bind_front< meta::quote<SplitHeuristicPointData>, LinearQualityEvaluator >, Traits> |
======================================================================================= Tree stuff ============================================================================
Definition at line 1753 of file KdTree.hpp.