ancestor(node_type node, node_type depth) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |
begin() noexcept | geom::hyperoctree< T, N, Order > | inline |
begin() const noexcept | geom::hyperoctree< T, N, Order > | inline |
cbegin() const noexcept | geom::hyperoctree< T, N, Order > | inline |
cend() const noexcept | geom::hyperoctree< T, N, Order > | inline |
child(node_type node, T n) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |
children_per_node | geom::hyperoctree< T, N, Order > | static |
clear() | geom::hyperoctree< T, N, Order > | inline |
common_ancestor(node_type a, node_type b) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |
const_iterator typedef | geom::hyperoctree< T, N, Order > | |
const_reverse_iterator typedef | geom::hyperoctree< T, N, Order > | |
container_type typedef | geom::hyperoctree< T, N, Order > | |
contains(node_type node) const | geom::hyperoctree< T, N, Order > | inline |
crbegin() const noexcept | geom::hyperoctree< T, N, Order > | inline |
crend() const noexcept | geom::hyperoctree< T, N, Order > | inline |
depth(node_type node) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |
depth_bits | geom::hyperoctree< T, N, Order > | static |
dimensions | geom::hyperoctree< T, N, Order > | static |
divider_bits | geom::hyperoctree< T, N, Order > | static |
empty() const noexcept | geom::hyperoctree< T, N, Order > | inline |
end() noexcept | geom::hyperoctree< T, N, Order > | inline |
end() const noexcept | geom::hyperoctree< T, N, Order > | inline |
erase(node_type node) | geom::hyperoctree< T, N, Order > | inline |
full() const noexcept | geom::hyperoctree< T, N, Order > | inline |
hyperoctree() | geom::hyperoctree< T, N, Order > | inline |
insert(node_type node) | geom::hyperoctree< T, N, Order > | inline |
is_leaf(node_type node) const | geom::hyperoctree< T, N, Order > | inline |
iterator typedef | geom::hyperoctree< T, N, Order > | |
location(node_type node) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |
location_bits | geom::hyperoctree< T, N, Order > | static |
max_depth | geom::hyperoctree< T, N, Order > | static |
max_node_count | geom::hyperoctree< T, N, Order > | static |
max_size() const noexcept | geom::hyperoctree< T, N, Order > | inline |
node(node_type depth, node_type location) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |
node_bits | geom::hyperoctree< T, N, Order > | static |
node_type typedef | geom::hyperoctree< T, N, Order > | |
order | geom::hyperoctree< T, N, Order > | static |
parent(node_type node) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |
rbegin() noexcept | geom::hyperoctree< T, N, Order > | inline |
rbegin() const noexcept | geom::hyperoctree< T, N, Order > | inline |
rend() noexcept | geom::hyperoctree< T, N, Order > | inline |
rend() const noexcept | geom::hyperoctree< T, N, Order > | inline |
resolution | geom::hyperoctree< T, N, Order > | static |
reverse_iterator typedef | geom::hyperoctree< T, N, Order > | |
root | geom::hyperoctree< T, N, Order > | static |
sibling(node_type node, node_type n) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |
siblings_per_node | geom::hyperoctree< T, N, Order > | static |
size() const noexcept | geom::hyperoctree< T, N, Order > | inline |
split(node_type node) noexcept | geom::hyperoctree< T, N, Order > | inlinestatic |