Classes | |
class | HierarchyTree |
Class for hierarchy tree structure. More... | |
struct | NodeBase |
struct | nodeBaseLess |
Functor comparing two nodes. More... | |
struct | SelectImpl |
struct | SelectImpl< S, AABB< S > > |
Functions | |
template<typename BV > | |
size_t | select (const BV &query, size_t node1, size_t node2, NodeBase< BV > *nodes) |
select the node from node1 and node2 which is close to the query AABB | |
template<typename BV > | |
size_t | select (size_t query, size_t node1, size_t node2, NodeBase< BV > *nodes) |
select the node from node1 and node2 which is close to the query-th node in the nodes. 0 for node1 and 1 for node2. More... | |
size_t fcl::detail::implementation_array::select | ( | const BV & | query, |
size_t | node1, | ||
size_t | node2, | ||
NodeBase< BV > * | nodes | ||
) |
select the node from node1 and node2 which is close to the query AABB. 0 for node1 and 1 for node2.
Definition at line 1099 of file hierarchy_tree_array-inl.h.
size_t fcl::detail::implementation_array::select | ( | size_t | query, |
size_t | node1, | ||
size_t | node2, | ||
NodeBase< BV > * | nodes | ||
) |
select the node from node1 and node2 which is close to the query-th node in the nodes. 0 for node1 and 1 for node2.
Definition at line 1092 of file hierarchy_tree_array-inl.h.