Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node Struct Reference

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
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
union {
T   cutVal
	for split node, split value
uint32_t   bucketIndex
	for leaf node, pointer to bucket
};

Detailed Description

template<typename T, typename Heap, typename CloudType = Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>>
struct Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >::Node

search node

---

The documentation for this struct was generated from the following file:

• nabo_private.h