Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 123]

Clinb::any
▼Cbad_cast
Clinb::bad_any_cast
CBenchResult
CNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::BucketEntry	Entry in a bucket
CNabo::KDTreeBalancedPtInLeavesStack< T, CloudType >::BuildPoint
CNabo::KDTreeBalancedPtInNodes< T, CloudType >::BuildPoint
CNabo::KDTreeUnbalancedPtInLeavesExplicitBoundsStack< T, CloudType >::BuildPoint
CNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::BuildPoint
CNabo::KDTreeUnbalancedPtInLeavesExplicitBoundsStack< T, CloudType >::CompareDim
CNabo::KDTreeBalancedPtInLeavesStack< T, CloudType >::CompareDim
CNabo::KDTreeBalancedPtInNodes< T, CloudType >::CompareDim
CNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::CompareDim
CNabo::IndexHeapSTL< IT, VT >::Entry	Entry of the heap tree
CNabo::IndexHeapBruteForceVector< IT, VT >::Entry	Entry of the heap vector
CNabo::IndexHeapBruteForceVector< IT, VT >	Brute-force implementation of heap
CNabo::IndexHeapSTL< IT, VT >	Balanced-tree implementation of heap
▼Cintegral_constant
Clinb::any::requires_allocation< T >	Whether the type T must be dynamically allocated or can be stored on the stack
CLoader< T, CloudType >
CLoader< T, Eigen::Map< const Eigen::Matrix< T, 3, Eigen::Dynamic >, Eigen::Aligned > >
▼Cmap
CNabo::Parameters	Parameter vector
CNearestNeighbourSearch
CNabo::NearestNeighbourSearch< T, Cloud_T >	Nearest neighbour search interface, templatized on scalar type
▼CNabo::NearestNeighbourSearch< T, CloudType >
CNabo::KDTreeBalancedPtInLeavesStack< T, CloudType >
▼CNabo::KDTreeBalancedPtInNodes< T, CloudType >
CNabo::KDTreeBalancedPtInNodesPQ< T, CloudType >
CNabo::KDTreeBalancedPtInNodesStack< T, CloudType >
CNabo::KDTreeUnbalancedPtInLeavesExplicitBoundsStack< T, CloudType >
CNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >
▼CNabo::NearestNeighbourSearch< T, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
CNabo::BruteForceSearch< T, CloudType >	Brute-force nearest neighbour
CNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >	KDTree, unbalanced, points in leaves, stack, implicit bounds, ANN_KD_SL_MIDPT, optimised implementation
CNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Node
CNabo::KDTreeBalancedPtInNodes< T, CloudType >::Node
CNabo::KDTreeBalancedPtInLeavesStack< T, CloudType >::Node
CNabo::KDTreeUnbalancedPtInLeavesExplicitBoundsStack< T, CloudType >::Node
CNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node	Search node
▼Cruntime_error
CNabo::runtime_error
CNabo::KDTreeBalancedPtInNodesPQ< T, CloudType >::SearchElement
Clinb::any::storage_union
Ctimer
Clinb::any::vtable_dynamic< T >	VTable for dynamically allocated storage
Clinb::any::vtable_stack< T >	VTable for stack allocated storage
Clinb::any::vtable_type	Base VTable specification