|
template<typename ITEM_INDEX , int MAX_ORDER> |
class | RTreeT |
|
template<typename ITEM_INDEX , int MAX_ORDER, typename ALT_FT > |
RTreeConfigurationT< ALT_FT > | constructRTreeConfiguration (const RTreeT< ITEM_INDEX, MAX_ORDER > &tree, const UT_BoxT< ALT_FT > item_box[], const ITEM_INDEX num_items) |
|
template<typename ITEM_INDEX , int MAX_ORDER, typename ALT_FT , typename QUERY_SHAPE , typename ACCEPT_ITEM > |
void | forEachIntersecting (ACCEPT_ITEM &&accept_item, const RTreeT< ITEM_INDEX, MAX_ORDER > &tree, const RTreeConfigurationT< ALT_FT > &configuration, const QUERY_SHAPE &query_shape) |
|
template<typename ITEM_INDEX , int MAX_ORDER, typename ALT_FT > |
void | updateConfiguration (RTreeConfigurationT< ALT_FT > &configuration, const RTreeT< ITEM_INDEX, MAX_ORDER > &tree, const UT_BoxT< ALT_FT > item_box[], const ITEM_INDEX num_items) |
|
exint | heapMemoryUsage (const RTreeConfigurationT< FT > &configuration) |
|
template<typename FT>
class UT::RTreeConfigurationT< FT >
Definition at line 24 of file UT_RTree.h.