HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
UT::SubtreeForEachIntersectingItem< ITEM_INDEX, MAX_ORDER > Struct Template Reference

#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
 

Detailed Description

template<typename ITEM_INDEX, int MAX_ORDER>
struct UT::SubtreeForEachIntersectingItem< ITEM_INDEX, MAX_ORDER >

Definition at line 540 of file UT_RTreeImpl.h.

Member Typedef Documentation

template<typename ITEM_INDEX , int MAX_ORDER>
using UT::SubtreeForEachIntersectingItem< ITEM_INDEX, MAX_ORDER >::ItemIndexRep = ItemIndex_UnderlyingIntegerType_t< ITEM_INDEX >

Definition at line 542 of file UT_RTreeImpl.h.

Member Function Documentation

template<typename ITEM_INDEX , int MAX_ORDER>
template<typename FT , typename QUERY_SHAPE , typename ACCEPT_ITEM >
constexpr void UT::SubtreeForEachIntersectingItem< ITEM_INDEX, MAX_ORDER >::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
inlinenoexcept

Definition at line 545 of file UT_RTreeImpl.h.


The documentation for this struct was generated from the following file: