| ▼Nlinb | |
| Cany | |
| Cbad_any_cast | |
| ▼NNabo | Namespace for Nabo |
| CBruteForceSearch | Brute-force nearest neighbour |
| CBruteForceSearchOpenCL | KDTree, balanced, points in leaves, stack, implicit bounds, balance aspect ratio |
| CContextManager | Create and manage CL contexts and corresponding source caches |
| CEnableCLTypeSupport | Template to retrieve type-specific code for CL support |
| CEnableCLTypeSupport< double, CloudType > | CL support code for double |
| CEnableCLTypeSupport< float, CloudType > | CL support code for float |
| ▼CIndexHeapBruteForceVector | Brute-force implementation of heap |
| CEntry | Entry of the heap vector |
| ▼CIndexHeapSTL | Balanced-tree implementation of heap |
| CEntry | Entry of the heap tree |
| ▼CKDTreeBalancedPtInLeavesStackOpenCL | KDTree, balanced, points in leaves, stack, implicit bounds, balance aspect ratio |
| CBuildPoint | Point during kd-tree construction |
| CCompareDim | Functor to compare point values on a given dimension |
| CNode | Tree node for CL |
| ▼CKDTreeBalancedPtInNodesStackOpenCL | KDTree, balanced, points in nodes, stack, implicit bounds, balance aspect ratio |
| CCompareDim | Functor to compare point values on a given dimension |
| CNode | Tree node for CL |
| ▼CKDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt | KDTree, unbalanced, points in leaves, stack, implicit bounds, ANN_KD_SL_MIDPT, optimised implementation |
| CBucketEntry | Entry in a bucket |
| CNode | Search node |
| CNearestNeighbourSearch | Nearest neighbour search interface, templatized on scalar type |
| COpenCLSearch | OpenCL support for nearest neighbour search
|
| CParameters | Parameter vector |
| Cruntime_error | |
| CSourceCacher | Cache CL source code (including defines and support code) |
