HDK
|
#include <UT_RTree.h>
Public Types | |
using | ItemIndex = ITEM_INDEX |
Public Member Functions | |
RTreeT (RTreeT &&) | |
~RTreeT () | |
RTreeT ()=delete | |
RTreeT (const RTreeT &)=delete | |
RTreeT & | operator= (const RTreeT &)=delete |
Static Public Attributes | |
static constexpr int | max_order = MAX_ORDER |
Friends | |
template<typename ALT_ITEM_INDEX , int ALT_MAX_ORDER, typename FT > | |
RTreeT< ALT_ITEM_INDEX, ALT_MAX_ORDER > | constructRTree (const UT_BoxT< FT > item_box[], const ALT_ITEM_INDEX num_items) |
template<typename ALT_ITEM_INDEX , int ALT_MAX_ORDER, typename FT > | |
RTreeConfigurationT< FT > | constructRTreeConfiguration (const RTreeT< ALT_ITEM_INDEX, ALT_MAX_ORDER > &tree, const UT_BoxT< FT > item_box[], const ALT_ITEM_INDEX num_items) |
template<typename ALT_ITEM_INDEX , int ALT_MAX_ORDER, typename FT , typename QUERY_SHAPE , typename ACCEPT_ITEM > | |
void | forEachIntersecting (ACCEPT_ITEM &&accept_item, const RTreeT< ALT_ITEM_INDEX, ALT_MAX_ORDER > &tree, const RTreeConfigurationT< FT > &configuration, const QUERY_SHAPE &query_shape) |
template<typename ALT_ITEM_INDEX , int ALT_MAX_ORDER, typename FT > | |
void | updateConfiguration (RTreeConfigurationT< FT > &configuration, const RTreeT< ALT_ITEM_INDEX, ALT_MAX_ORDER > &tree, const UT_BoxT< FT > item_box[], const ALT_ITEM_INDEX num_items) |
template<typename ALT_ITEM_INDEX , int ALT_MAX_ORDER> | |
exint | heapMemoryUsage (const RTreeT< ALT_ITEM_INDEX, ALT_MAX_ORDER > &tree) |
Definition at line 23 of file UT_RTree.h.
using UT::RTreeT< ITEM_INDEX, MAX_ORDER >::ItemIndex = ITEM_INDEX |
Definition at line 132 of file UT_RTree.h.
UT::RTreeT< ITEM_INDEX, MAX_ORDER >::RTreeT | ( | RTreeT< ITEM_INDEX, MAX_ORDER > && | a | ) |
Definition at line 752 of file UT_RTreeImpl.h.
UT::RTreeT< ITEM_INDEX, MAX_ORDER >::~RTreeT | ( | ) |
Definition at line 765 of file UT_RTreeImpl.h.
|
delete |
|
delete |
|
delete |
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
static |
Definition at line 133 of file UT_RTree.h.