HDK
|
#include <UT_RTreeImpl.h>
Public Types | |
using | ItemIndexRep = ItemIndex_UnderlyingIntegerType_t< ITEM_INDEX > |
Public Member Functions | |
template<typename FT , typename QUERY_SHAPE , typename ACCEPT_ITEM > | |
constexpr void | operator() (ACCEPT_ITEM &&accept_item, const RNodeT< ItemIndexRep, MAX_ORDER > shared_nodes[], const UT_BoxT< FT > shared_boxes[], const RNodeT< ItemIndexRep, MAX_ORDER > *const node, const QUERY_SHAPE &query_shape) const noexcept |
Definition at line 540 of file UT_RTreeImpl.h.
using UT::SubtreeForEachIntersectingItem< ITEM_INDEX, MAX_ORDER >::ItemIndexRep = ItemIndex_UnderlyingIntegerType_t< ITEM_INDEX > |
Definition at line 542 of file UT_RTreeImpl.h.
|
inlinenoexcept |
Definition at line 545 of file UT_RTreeImpl.h.