|
libnabo 1.0.1
|
Classes | |
| struct | IndexHeapSTL |
| balanced-tree implementation of heap More... | |
| struct | IndexHeapBruteForceVector |
| brute-force implementation of heap More... | |
| struct | EnableCLTypeSupport |
| Template to retrieve type-specific code for CL support. More... | |
| struct | EnableCLTypeSupport< float > |
| CL support code for float. More... | |
| struct | EnableCLTypeSupport< double > |
| CL support code for double. More... | |
| struct | SourceCacher |
| Cache CL source code (including defines and support code) More... | |
| class | ContextManager |
| Create and manage CL contexts and corresponding source caches. More... | |
| struct | Parameters |
| Parameter vector. More... | |
| struct | NearestNeighbourSearch |
| Nearest neighbour search interface, templatized on scalar type. More... | |
| struct | BruteForceSearch |
| Brute-force nearest neighbour. More... | |
| struct | KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt |
| KDTree, unbalanced, points in leaves, stack, implicit bounds, ANN_KD_SL_MIDPT, optimised implementation. More... | |
| struct | OpenCLSearch |
| OpenCL support for nearest neighbour search. More... | |
| struct | BruteForceSearchOpenCL |
| KDTree, balanced, points in leaves, stack, implicit bounds, balance aspect ratio. More... | |
| struct | KDTreeBalancedPtInLeavesStackOpenCL |
| KDTree, balanced, points in leaves, stack, implicit bounds, balance aspect ratio. More... | |
| struct | KDTreeBalancedPtInNodesStackOpenCL |
| KDTree, balanced, points in nodes, stack, implicit bounds, balance aspect ratio. More... | |
Typedefs | |
|
typedef NearestNeighbourSearch < float > | NNSearchF |
| nearest neighbour search with scalars of type float | |
|
typedef NearestNeighbourSearch < double > | NNSearchD |
| nearest neighbour search with scalars of type double | |
Functions | |
| template<typename T , typename A , typename B > | |
| T | dist2 (const A &v0, const B &v1) |
| Euclidean distance. | |
| template<typename T > | |
| T | getStorageBitCount (T v) |
| Return the number of bit required to store a value. | |
| template<typename T > | |
| size_t | argMax (const typename NearestNeighbourSearch< T >::Vector &v) |
| Return the index of the maximum value of a vector. | |
Namespace for Nabo.
| size_t Nabo::argMax | ( | const typename NearestNeighbourSearch< T >::Vector & | v | ) |
Return the index of the maximum value of a vector.
| v | vector |
| T Nabo::getStorageBitCount | ( | T | v | ) |
Return the number of bit required to store a value.
| v | value to store |
1.7.4