Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 123]
  Nabo | Namespace for Nabo |
   IndexHeapSTL | Balanced-tree implementation of heap |
  Entry | Entry of the heap tree |
| IndexHeapBruteForceVector | Brute-force implementation of heap |
| Entry | Entry of the heap vector |
 EnableCLTypeSupport | Template to retrieve type-specific code for CL support |
| EnableCLTypeSupport< float > | CL support code for float |
| EnableCLTypeSupport< double > | CL support code for double |
| SourceCacher | Cache CL source code (including defines and support code) |
| ContextManager | Create and manage CL contexts and corresponding source caches |
| Parameters | Parameter vector |
| NearestNeighbourSearch | Nearest neighbour search interface, templatized on scalar type |
| BruteForceSearch | Brute-force nearest neighbour |
| KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt | KDTree, unbalanced, points in leaves, stack, implicit bounds, ANN_KD_SL_MIDPT, optimised implementation |
| BucketEntry | Entry in a bucket |
| Node | Search node |
| OpenCLSearch | OpenCL support for nearest neighbour search |
| BruteForceSearchOpenCL | KDTree, balanced, points in leaves, stack, implicit bounds, balance aspect ratio |
| KDTreeBalancedPtInLeavesStackOpenCL | KDTree, balanced, points in leaves, stack, implicit bounds, balance aspect ratio |
| BuildPoint | Point during kd-tree construction |
| CompareDim | Functor to compare point values on a given dimension |
| Node | Tree node for CL |
| KDTreeBalancedPtInNodesStackOpenCL | KDTree, balanced, points in nodes, stack, implicit bounds, balance aspect ratio |
| CompareDim | Functor to compare point values on a given dimension |
| Node | Tree node for CL |
