ndtree
nd-octree data-structure and algorithms
ndtree::v1::tree< nd > Member List

This is the complete list of members for ndtree::v1::tree< nd >, including all inherited members.

capacity() const noexceptndtree::v1::tree< nd >
child(node_idx n, child_pos p) const noexceptndtree::v1::tree< nd >
child_pos typedefndtree::v1::tree< nd >
child_positions() noexceptndtree::v1::tree< nd >static
children(node_idx n) const noexceptndtree::v1::tree< nd >
children_group(node_idx n) const noexceptndtree::v1::tree< nd >
coarsen(node_idx p) noexceptndtree::v1::tree< nd >
dimension() noexceptndtree::v1::tree< nd >static
dimensions() noexceptndtree::v1::tree< nd >static
empty() const noexceptndtree::v1::tree< nd >
is_compact() const noexceptndtree::v1::tree< nd >
is_leaf(node_idx n) const noexceptndtree::v1::tree< nd >
is_root(node_idx n) noexceptndtree::v1::tree< nd >static
leaf() const noexceptndtree::v1::tree< nd >
no_children() noexceptndtree::v1::tree< nd >static
no_children(node_idx n) const noexceptndtree::v1::tree< nd >
no_nodes(siblings_idx no_sibling_groups) noexceptndtree::v1::tree< nd >static
no_sibling_groups(node_idx no_nodes) noexceptndtree::v1::tree< nd >static
nodes(siblings_idx s) noexceptndtree::v1::tree< nd >static
nodes() const noexceptndtree::v1::tree< nd >
operator()() const noexceptndtree::v1::tree< nd >
parent(siblings_idx s) const noexceptndtree::v1::tree< nd >
parent(node_idx n) const noexceptndtree::v1::tree< nd >
position_in_parent(node_idx n) noexceptndtree::v1::tree< nd >static
refine(node_idx p) noexceptndtree::v1::tree< nd >
set_first_free_sibling_group(siblings_idx s) noexceptndtree::v1::tree< nd >
sibling_group(node_idx n) noexceptndtree::v1::tree< nd >static
sibling_group_capacity() const noexceptndtree::v1::tree< nd >
size() const noexceptndtree::v1::tree< nd >
swap(siblings_idx a, siblings_idx b) noexceptndtree::v1::tree< nd >
tree(uint_t node_capacity)ndtree::v1::tree< nd >
with_children() const noexceptndtree::v1::tree< nd >