| allocateNode() | coal::detail::implementation_array::HierarchyTree< BV > | private |
| balanceBottomup() | coal::detail::implementation_array::HierarchyTree< BV > | |
| balanceIncremental(int iterations) | coal::detail::implementation_array::HierarchyTree< BV > | |
| balanceTopdown() | coal::detail::implementation_array::HierarchyTree< BV > | |
| bottomup(size_t *lbeg, size_t *lend) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| bu_threshold | coal::detail::implementation_array::HierarchyTree< BV > | |
| clear() | coal::detail::implementation_array::HierarchyTree< BV > | |
| createNode(size_t parent, const BV &bv1, const BV &bv2, void *data) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| createNode(size_t parent, const BV &bv, void *data) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| createNode(size_t parent, void *data) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| deleteNode(size_t node) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| empty() const | coal::detail::implementation_array::HierarchyTree< BV > | |
| extractLeaves(size_t root, Node *&leaves) const | coal::detail::implementation_array::HierarchyTree< BV > | |
| fetchLeaves(size_t root, Node *&leaves, int depth=-1) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| freelist | coal::detail::implementation_array::HierarchyTree< BV > | protected |
| getMaxDepth() const | coal::detail::implementation_array::HierarchyTree< BV > | |
| getMaxDepth(size_t node, size_t depth, size_t &max_depth) const | coal::detail::implementation_array::HierarchyTree< BV > | private |
| getMaxHeight() const | coal::detail::implementation_array::HierarchyTree< BV > | |
| getMaxHeight(size_t node) const | coal::detail::implementation_array::HierarchyTree< BV > | private |
| getNodes() const | coal::detail::implementation_array::HierarchyTree< BV > | |
| getRoot() const | coal::detail::implementation_array::HierarchyTree< BV > | |
| HierarchyTree(int bu_threshold_=16, int topdown_level_=0) | coal::detail::implementation_array::HierarchyTree< BV > | |
| indexOf(size_t node) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| init(Node *leaves, int n_leaves_, int level=0) | coal::detail::implementation_array::HierarchyTree< BV > | |
| init_0(Node *leaves, int n_leaves_) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| init_1(Node *leaves, int n_leaves_) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| init_2(Node *leaves, int n_leaves_) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| init_3(Node *leaves, int n_leaves_) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| insert(const BV &bv, void *data) | coal::detail::implementation_array::HierarchyTree< BV > | |
| insertLeaf(size_t root, size_t leaf) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| max_lookahead_level | coal::detail::implementation_array::HierarchyTree< BV > | protected |
| mortonRecurse_0(size_t *lbeg, size_t *lend, const uint32_t &split, int bits) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| mortonRecurse_1(size_t *lbeg, size_t *lend, const uint32_t &split, int bits) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| mortonRecurse_2(size_t *lbeg, size_t *lend) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| n_leaves | coal::detail::implementation_array::HierarchyTree< BV > | protected |
| n_nodes | coal::detail::implementation_array::HierarchyTree< BV > | protected |
| n_nodes_alloc | coal::detail::implementation_array::HierarchyTree< BV > | protected |
| Node typedef | coal::detail::implementation_array::HierarchyTree< BV > | |
| nodes | coal::detail::implementation_array::HierarchyTree< BV > | protected |
| NULL_NODE | coal::detail::implementation_array::HierarchyTree< BV > | static |
| opath | coal::detail::implementation_array::HierarchyTree< BV > | protected |
| print(size_t root, int depth) | coal::detail::implementation_array::HierarchyTree< BV > | |
| recurseRefit(size_t node) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| refit() | coal::detail::implementation_array::HierarchyTree< BV > | |
| remove(size_t leaf) | coal::detail::implementation_array::HierarchyTree< BV > | |
| removeLeaf(size_t leaf) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| root_node | coal::detail::implementation_array::HierarchyTree< BV > | protected |
| size() const | coal::detail::implementation_array::HierarchyTree< BV > | |
| topdown(size_t *lbeg, size_t *lend) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| topdown_0(size_t *lbeg, size_t *lend) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| topdown_1(size_t *lbeg, size_t *lend) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| topdown_level | coal::detail::implementation_array::HierarchyTree< BV > | |
| update(size_t leaf, int lookahead_level=-1) | coal::detail::implementation_array::HierarchyTree< BV > | |
| update(size_t leaf, const BV &bv) | coal::detail::implementation_array::HierarchyTree< BV > | |
| update(size_t leaf, const BV &bv, const Vec3s &vel, CoalScalar margin) | coal::detail::implementation_array::HierarchyTree< BV > | |
| update(size_t leaf, const BV &bv, const Vec3s &vel) | coal::detail::implementation_array::HierarchyTree< BV > | |
| update_(size_t leaf, const BV &bv) | coal::detail::implementation_array::HierarchyTree< BV > | private |
| ~HierarchyTree() | coal::detail::implementation_array::HierarchyTree< BV > | |