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