HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
UT_RTreeGeneric< MAX_ORDER > Class Template Reference

#include <UT_RTree.h>

Public Member Functions

template<typename T >
 UT_RTreeGeneric (const UT_BoxT< T > item_boxes[], const int size)
 
 ~UT_RTreeGeneric ()
 
int getNumItems () const
 
exint getMemoryUsage () const
 
template<typename T >
void createBoxAssignment (UT_RTreeBoxAssignmentT< T > &assignment, const UT_BoxT< T > item_boxes[]) const
 
template<typename QUERY_SHAPE , typename RESULT_ACCEPTOR , typename T >
void getIntersectingItems (RESULT_ACCEPTOR &result_acceptor, const QUERY_SHAPE &query_box, const UT_RTreeBoxAssignmentT< T > &assignment) const
 
template<typename T >
UT_BoxT< TboundingBox (const UT_RTreeBoxAssignmentT< T > &assignment) const
 

Detailed Description

template<int MAX_ORDER>
class UT_RTreeGeneric< MAX_ORDER >

Definition at line 149 of file UT_RTree.h.

Constructor & Destructor Documentation

template<int MAX_ORDER>
template<typename T >
UT_RTreeGeneric< MAX_ORDER >::UT_RTreeGeneric ( const UT_BoxT< T item_boxes[],
const int  size 
)
inline

Definition at line 839 of file UT_RTree.C.

template<int MAX_ORDER>
UT_RTreeGeneric< MAX_ORDER >::~UT_RTreeGeneric ( )
inline

Definition at line 892 of file UT_RTree.C.

Member Function Documentation

template<int MAX_ORDER>
template<typename T >
UT_BoxT< T > UT_RTreeGeneric< MAX_ORDER >::boundingBox ( const UT_RTreeBoxAssignmentT< T > &  assignment) const

Definition at line 1053 of file UT_RTree.C.

template<int MAX_ORDER>
template<typename T >
void UT_RTreeGeneric< MAX_ORDER >::createBoxAssignment ( UT_RTreeBoxAssignmentT< T > &  assignment,
const UT_BoxT< T item_boxes[] 
) const
inline

Definition at line 901 of file UT_RTree.C.

template<int MAX_ORDER>
template<typename QUERY_SHAPE , typename RESULT_ACCEPTOR , typename T >
void UT_RTreeGeneric< MAX_ORDER >::getIntersectingItems ( RESULT_ACCEPTOR &  result_acceptor,
const QUERY_SHAPE &  query_box,
const UT_RTreeBoxAssignmentT< T > &  assignment 
) const

For each item i for which item_boxes[i] intersects query_box, call result_acceptor(i). This assumes that RESULT_ACCEPTOR is a function or a functor. A further generlaization of getIntersectingItems that takes a queryshape. It is assumed to have an .intersects() method which takes a UT_Box<T> It is very important that the intersects() method will return false for empty nodes.

Definition at line 937 of file UT_RTree.C.

template<int MAX_ORDER>
exint UT_RTreeGeneric< MAX_ORDER >::getMemoryUsage ( ) const
inline

Definition at line 202 of file UT_RTree.h.

template<int MAX_ORDER>
int UT_RTreeGeneric< MAX_ORDER >::getNumItems ( void  ) const
inline

Definition at line 686 of file UT_RTree.C.


The documentation for this class was generated from the following files: