hpp::fcl::detail::implementation_array::HierarchyTree< BV > Member List

This is the complete list of members for hpp::fcl::detail::implementation_array::HierarchyTree< BV >, including all inherited members.

allocateNode()hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
balanceBottomup()hpp::fcl::detail::implementation_array::HierarchyTree< BV >
balanceIncremental(int iterations)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
balanceTopdown()hpp::fcl::detail::implementation_array::HierarchyTree< BV >
bottomup(size_t *lbeg, size_t *lend)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
bu_thresholdhpp::fcl::detail::implementation_array::HierarchyTree< BV >
clear()hpp::fcl::detail::implementation_array::HierarchyTree< BV >
createNode(size_t parent, const BV &bv1, const BV &bv2, void *data)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
createNode(size_t parent, const BV &bv, void *data)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
createNode(size_t parent, void *data)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
deleteNode(size_t node)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
empty() consthpp::fcl::detail::implementation_array::HierarchyTree< BV >
extractLeaves(size_t root, Node *&leaves) consthpp::fcl::detail::implementation_array::HierarchyTree< BV >
fetchLeaves(size_t root, Node *&leaves, int depth=-1)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
freelisthpp::fcl::detail::implementation_array::HierarchyTree< BV >protected
getMaxDepth() consthpp::fcl::detail::implementation_array::HierarchyTree< BV >
getMaxDepth(size_t node, size_t depth, size_t &max_depth) consthpp::fcl::detail::implementation_array::HierarchyTree< BV >private
getMaxHeight() consthpp::fcl::detail::implementation_array::HierarchyTree< BV >
getMaxHeight(size_t node) consthpp::fcl::detail::implementation_array::HierarchyTree< BV >private
getNodes() consthpp::fcl::detail::implementation_array::HierarchyTree< BV >
getRoot() consthpp::fcl::detail::implementation_array::HierarchyTree< BV >
HierarchyTree(int bu_threshold_=16, int topdown_level_=0)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
indexOf(size_t node)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
init(Node *leaves, int n_leaves_, int level=0)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
init_0(Node *leaves, int n_leaves_)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
init_1(Node *leaves, int n_leaves_)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
init_2(Node *leaves, int n_leaves_)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
init_3(Node *leaves, int n_leaves_)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
insert(const BV &bv, void *data)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
insertLeaf(size_t root, size_t leaf)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
max_lookahead_levelhpp::fcl::detail::implementation_array::HierarchyTree< BV >protected
mortonRecurse_0(size_t *lbeg, size_t *lend, const uint32_t &split, int bits)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
mortonRecurse_1(size_t *lbeg, size_t *lend, const uint32_t &split, int bits)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
mortonRecurse_2(size_t *lbeg, size_t *lend)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
n_leaveshpp::fcl::detail::implementation_array::HierarchyTree< BV >protected
n_nodeshpp::fcl::detail::implementation_array::HierarchyTree< BV >protected
n_nodes_allochpp::fcl::detail::implementation_array::HierarchyTree< BV >protected
Node typedefhpp::fcl::detail::implementation_array::HierarchyTree< BV >
nodeshpp::fcl::detail::implementation_array::HierarchyTree< BV >protected
NULL_NODEhpp::fcl::detail::implementation_array::HierarchyTree< BV >static
opathhpp::fcl::detail::implementation_array::HierarchyTree< BV >protected
print(size_t root, int depth)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
recurseRefit(size_t node)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
refit()hpp::fcl::detail::implementation_array::HierarchyTree< BV >
remove(size_t leaf)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
removeLeaf(size_t leaf)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
root_nodehpp::fcl::detail::implementation_array::HierarchyTree< BV >protected
size() consthpp::fcl::detail::implementation_array::HierarchyTree< BV >
topdown(size_t *lbeg, size_t *lend)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
topdown_0(size_t *lbeg, size_t *lend)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
topdown_1(size_t *lbeg, size_t *lend)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
topdown_levelhpp::fcl::detail::implementation_array::HierarchyTree< BV >
update(size_t leaf, int lookahead_level=-1)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
update(size_t leaf, const BV &bv)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
update(size_t leaf, const BV &bv, const Vec3f &vel, FCL_REAL margin)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
update(size_t leaf, const BV &bv, const Vec3f &vel)hpp::fcl::detail::implementation_array::HierarchyTree< BV >
update_(size_t leaf, const BV &bv)hpp::fcl::detail::implementation_array::HierarchyTree< BV >private
~HierarchyTree()hpp::fcl::detail::implementation_array::HierarchyTree< BV >


hpp-fcl
Author(s):
autogenerated on Fri Aug 2 2024 02:45:17