Template Class NdtreeNodeChunk

• Defined in File ndtree_node_chunk.h

Class Documentation

template<typename DataT, int dim, int height>
class NdtreeNodeChunk

Public Types

using DataType = DataT

using BitRef = typename std::bitset<kNumInnerNodes>::reference

Public Functions

NdtreeNodeChunk() = default

~NdtreeNodeChunk() = default

bool empty() const

void clear()

bool hasNonzeroData() const

bool hasNonzeroData(FloatingPoint threshold) const

inline bool hasChildrenArray() const

inline void deleteChildrenArray()

bool hasChild(LinearIndex relative_child_index) const

bool hasAtLeastOneChild() const

NdtreeNodeChunk *allocateChild(LinearIndex relative_child_index)

bool deleteChild(LinearIndex relative_child_index)

NdtreeNodeChunk *getChild(LinearIndex relative_child_index)

const NdtreeNodeChunk *getChild(LinearIndex relative_child_index) const

size_t getMemoryUsage() const

bool nodeHasNonzeroData(LinearIndex relative_node_index) const

bool nodeHasNonzeroData(LinearIndex relative_node_index, FloatingPoint threshold) const

DataT &nodeData(LinearIndex relative_node_index)

const DataT &nodeData(LinearIndex relative_node_index) const

BitRef nodeHasAtLeastOneChild(LinearIndex relative_node_index)

bool nodeHasAtLeastOneChild(LinearIndex relative_node_index) const

Public Static Attributes

static constexpr int kNumInnerNodes = tree_math::perfect_tree::num_total_nodes<dim>(height)

static constexpr int kNumChildren = tree_math::perfect_tree::num_leaf_nodes<dim>(height + 1)

Friends

inline friend bool operator==(const NdtreeNodeChunk &lhs, const NdtreeNodeChunk &rhs)