Here are the classes, structs, unions and interfaces with brief descriptions:
| Nabo::BruteForceSearch< T > | Brute-force nearest neighbour |
| Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::BucketEntry | Entry in a bucket |
| Nabo::IndexHeapSTL< IT, VT >::Entry | Entry of the heap tree |
| Nabo::IndexHeapBruteForceVector< IT, VT >::Entry | Entry of the heap vector |
| Nabo::IndexHeapBruteForceVector< IT, VT > | Brute-force implementation of heap |
| Nabo::IndexHeapSTL< IT, VT > | Balanced-tree implementation of heap |
| Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | KDTree, unbalanced, points in leaves, stack, implicit bounds, ANN_KD_SL_MIDPT, optimised implementation |
| Nabo::NearestNeighbourSearch< T > | Nearest neighbour search interface, templatized on scalar type |
| Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::Node | Search node |
| Nabo::Parameters | Parameter vector |