#include "fcl/broadphase/detail/hierarchy_tree_array.h"#include "fcl/common/unused.h"#include <algorithm>

Go to the source code of this file.
Classes | |
| struct | fcl::detail::implementation_array::SelectImpl< S, BV > |
| struct | fcl::detail::implementation_array::SelectImpl< S, AABB< S > > |
Namespaces | |
| fcl | |
| Main namespace. | |
| fcl::detail | |
| fcl::detail::implementation_array | |
Functions | |
| template<typename BV > | |
| 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. More... | |
| template<typename BV > | |
| 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<S>. 0 for node1 and 1 for node2. More... | |