search node More...
#include <nabo_private.h>
Public Member Functions | |
Node (const uint32_t dimChild, const T cutVal) | |
construct a split node | |
Node (const uint32_t bucketSize, const uint32_t bucketIndex) | |
construct a leaf node | |
Public Attributes | |
union { | |
uint32_t bucketIndex | |
for leaf node, pointer to bucket | |
T cutVal | |
for split node, split value | |
}; | |
uint32_t | dimChildBucketSize |
cut dimension for split nodes (dimBitCount lsb), index of right node or number of bucket(rest). Note that left index is current+1 |
search node
Definition at line 138 of file nabo_private.h.
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node::Node | ( | const uint32_t | dimChild, |
const T | cutVal | ||
) | [inline] |
construct a split node
Definition at line 148 of file nabo_private.h.
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node::Node | ( | const uint32_t | bucketSize, |
const uint32_t | bucketIndex | ||
) | [inline] |
construct a leaf node
Definition at line 151 of file nabo_private.h.
union { ... } |
uint32_t Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node::bucketIndex |
for leaf node, pointer to bucket
Definition at line 144 of file nabo_private.h.
T Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node::cutVal |
for split node, split value
Definition at line 143 of file nabo_private.h.
uint32_t Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node::dimChildBucketSize |
cut dimension for split nodes (dimBitCount lsb), index of right node or number of bucket(rest). Note that left index is current+1
Definition at line 140 of file nabo_private.h.