#include <vector>#include <map>#include <functional>#include <iostream>#include "fcl/common/warning.h"#include "fcl/math/bv/AABB.h"#include "fcl/broadphase/detail/morton.h"#include "fcl/broadphase/detail/node_base_array.h"#include "fcl/broadphase/detail/hierarchy_tree_array-inl.h"

Go to the source code of this file.
| Classes | |
| class | fcl::detail::implementation_array::HierarchyTree< BV > | 
| Class for hierarchy tree structure.  More... | |
| struct | fcl::detail::implementation_array::nodeBaseLess< BV > | 
| Functor comparing two nodes.  More... | |
| struct | fcl::detail::implementation_array::HierarchyTree< BV >::SortByMorton | 
| Namespaces | |
| fcl | |
| Main namespace. | |
| fcl::detail | |
| fcl::detail::implementation_array | |
| Functions | |
| 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 | |
| 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... | |