libnabo: Class Members

libnabo 1.1.2

Here is a list of all documented class members with links to the class documentation for each member:

- a -

ALLOW_SELF_MATCH : Nabo::NearestNeighbourSearch< T, Cloud_T >
any() : linb::any
any_cast : linb::any

- b -

BRUTE_FORCE : Nabo::NearestNeighbourSearch< T, Cloud_T >
BRUTE_FORCE_CL : Nabo::NearestNeighbourSearch< T, Cloud_T >
BruteForceSearch() : Nabo::BruteForceSearch< T, CloudType >
BruteForceSearchOpenCL() : Nabo::BruteForceSearchOpenCL< T, CloudType >
BucketEntry() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::BucketEntry
bucketIndex : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node
buckets : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
Buckets : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
bucketSize : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
buildNodes() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >, Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
BuildPoint() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >::BuildPoint, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >
BuildPoints : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >, Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
BuildPointsCstIt : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >, Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
BuildPointsIt : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >, Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >

- c -

cachedPrograms : Nabo::SourceCacher
cast() : linb::any
checkSizesKnn() : Nabo::NearestNeighbourSearch< T, Cloud_T >
childLeft() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >
childRight() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >
clear() : linb::any
cloud : Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >::CompareDim, Nabo::NearestNeighbourSearch< T, Cloud_T >
cloudCL : Nabo::OpenCLSearch< T, CloudType >
CloudType : Nabo::NearestNeighbourSearch< T, Cloud_T >
code() : Nabo::EnableCLTypeSupport< double, CloudType >, Nabo::EnableCLTypeSupport< float, CloudType >
CompareDim() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >::CompareDim, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >::CompareDim
contains() : Nabo::SourceCacher
context : Nabo::OpenCLSearch< T, CloudType >, Nabo::SourceCacher
create() : Nabo::NearestNeighbourSearch< T, Cloud_T >
createBruteForce() : Nabo::NearestNeighbourSearch< T, Cloud_T >
createContext() : Nabo::ContextManager
createDimChildBucketSize() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
createKDTreeLinearHeap() : Nabo::NearestNeighbourSearch< T, Cloud_T >
createKDTreeTreeHeap() : Nabo::NearestNeighbourSearch< T, Cloud_T >
creationOptionFlags : Nabo::NearestNeighbourSearch< T, Cloud_T >
CreationOptionFlags : Nabo::NearestNeighbourSearch< T, Cloud_T >
cutVal : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >::Node, Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node

- d -

data : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >
Devices : Nabo::ContextManager
devices : Nabo::ContextManager
Devices : Nabo::SourceCacher
devices : Nabo::SourceCacher
deviceType : Nabo::OpenCLSearch< T, CloudType >
dim : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >::CompareDim, Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >::Node, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >::CompareDim, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >::Node, Nabo::NearestNeighbourSearch< T, Cloud_T >
dimBitCount : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
dimChildBucketSize : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node
dimMask : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >

- e -

empty() : linb::any
Entries : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >
Entry() : Nabo::IndexHeapBruteForceVector< IT, VT >::Entry, Nabo::IndexHeapSTL< IT, VT >::Entry

- g -

get() : Nabo::Parameters
getBounds() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
getChildBucketSize() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
getData() : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >
getDim() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
getSourceCacher() : Nabo::ContextManager
getTreeDepth() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >
getTreeSize() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >

- h -

headValue() : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >
headValueRef : Nabo::IndexHeapBruteForceVector< IT, VT >

- i -

index : Nabo::IndexHeapBruteForceVector< IT, VT >::Entry
Index : Nabo::IndexHeapBruteForceVector< IT, VT >
index : Nabo::IndexHeapSTL< IT, VT >::Entry
Index : Nabo::IndexHeapSTL< IT, VT >
index : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >::BuildPoint, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >::Node, Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::BucketEntry
Index : Nabo::NearestNeighbourSearch< T, Cloud_T >
IndexHeapBruteForceVector() : Nabo::IndexHeapBruteForceVector< IT, VT >
IndexHeapSTL() : Nabo::IndexHeapSTL< IT, VT >
IndexMatrix : Nabo::NearestNeighbourSearch< T, Cloud_T >
IndexVector : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >, Nabo::NearestNeighbourSearch< T, Cloud_T >
initOpenCL() : Nabo::OpenCLSearch< T, CloudType >
InvalidIndex : Nabo::NearestNeighbourSearch< T, Cloud_T >
InvalidValue : Nabo::NearestNeighbourSearch< T, Cloud_T >
is_same() : linb::any
is_typed() : linb::any

- k -

KDTREE_CL_PT_IN_LEAVES : Nabo::NearestNeighbourSearch< T, Cloud_T >
KDTREE_CL_PT_IN_NODES : Nabo::NearestNeighbourSearch< T, Cloud_T >
KDTREE_LINEAR_HEAP : Nabo::NearestNeighbourSearch< T, Cloud_T >
KDTREE_TREE_HEAP : Nabo::NearestNeighbourSearch< T, Cloud_T >
KDTreeBalancedPtInLeavesStackOpenCL() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >
KDTreeBalancedPtInNodesStackOpenCL() : Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >
KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
knn() : Nabo::NearestNeighbourSearch< T, Cloud_T >
knnKernel : Nabo::OpenCLSearch< T, CloudType >

- m -

Matrix : Nabo::NearestNeighbourSearch< T, Cloud_T >
maxBound : Nabo::NearestNeighbourSearch< T, Cloud_T >
minBound : Nabo::NearestNeighbourSearch< T, Cloud_T >
mutex : Nabo::ContextManager

- n -

- o -

onePointKnn() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
OpenCLSearch() : Nabo::OpenCLSearch< T, CloudType >
operator()() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >::CompareDim, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >::CompareDim
operator< : Nabo::IndexHeapBruteForceVector< IT, VT >::Entry, Nabo::IndexHeapSTL< IT, VT >::Entry
operator=() : linb::any

- p -

Parameters() : Nabo::Parameters
parent() : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >, Nabo::KDTreeBalancedPtInNodesStackOpenCL< T, CloudType >
pos : Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T, CloudType >::BuildPoint
ProgramCache : Nabo::SourceCacher
pt : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::BucketEntry

- q -

queue : Nabo::OpenCLSearch< T, CloudType >

- r -

recurseKnn() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
replaceHead() : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >
reset() : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >

- s -

SEARCH_TYPE_COUNT : Nabo::NearestNeighbourSearch< T, Cloud_T >
SearchOptionFlags : Nabo::NearestNeighbourSearch< T, Cloud_T >
SearchType : Nabo::NearestNeighbourSearch< T, Cloud_T >
sizeMinusOne : Nabo::IndexHeapBruteForceVector< IT, VT >
sort() : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >
SORT_RESULTS : Nabo::NearestNeighbourSearch< T, Cloud_T >
SourceCacher() : Nabo::SourceCacher
swap() : linb::any

- t -

TOUCH_STATISTICS : Nabo::NearestNeighbourSearch< T, Cloud_T >
type() : linb::any

- v -

value : Nabo::IndexHeapBruteForceVector< IT, VT >::Entry
Value : Nabo::IndexHeapBruteForceVector< IT, VT >
value : Nabo::IndexHeapSTL< IT, VT >::Entry
Value : Nabo::IndexHeapSTL< IT, VT >
ValueVector : Nabo::IndexHeapBruteForceVector< IT, VT >, Nabo::IndexHeapSTL< IT, VT >
Vector : Nabo::NearestNeighbourSearch< T, Cloud_T >

- ~ -

~any() : linb::any
~ContextManager() : Nabo::ContextManager
~NearestNeighbourSearch() : Nabo::NearestNeighbourSearch< T, Cloud_T >
~SourceCacher() : Nabo::SourceCacher