CN_RTREE< T > Class Template Reference

CN_RTREE - Implements an R-tree for fast spatial indexing of connectivity items. More...

#include <connectivity_rtree.h>

Public Member Functions
	CN_RTREE ()
	~CN_RTREE ()
void	Insert (T aItem)
	Function Insert() Inserts an item into the tree. More...
void	Remove (T aItem)
	Function Remove() Removes an item from the tree. More...
void	RemoveAll ()
	Function RemoveAll() Removes all items from the RTree. More...
template<class Visitor >
void	Query (const BOX2I &aBounds, const LAYER_RANGE &aRange, Visitor &aVisitor) const
	Function Query() Executes a function object aVisitor for each item whose bounding box intersects with aBounds. More...

Private Attributes
RTree< T, int, 3, double > *	m_tree

Detailed Description

template<class T>
class CN_RTREE< T >

CN_RTREE - Implements an R-tree for fast spatial indexing of connectivity items.

Non-owning.

Definition at line 39 of file connectivity_rtree.h.

Constructor & Destructor Documentation

CN_RTREE()

template<class T>

CN_RTREE< T >::CN_RTREE ( )

inline

Definition at line 43 of file connectivity_rtree.h.

    {
        this->m_tree = new RTree<T, int, 3, double>();
    }

~CN_RTREE()

template<class T>

CN_RTREE< T >::~CN_RTREE ( )

inline

Definition at line 48 of file connectivity_rtree.h.

    {
        delete this->m_tree;
    }

Member Function Documentation

Insert()

template<class T>

void CN_RTREE< T >::Insert ( T  aItem )

inline

Function Insert() Inserts an item into the tree.

Item's bounding box is taken via its BBox() method.

Definition at line 57 of file connectivity_rtree.h.

    {
        const BOX2I&        bbox    = aItem->BBox();
        const LAYER_RANGE   layers  = aItem->Layers();

        const int           mmin[3] = { layers.Start(), bbox.GetX(), bbox.GetY() };
        const int           mmax[3] = { layers.End(), bbox.GetRight(), bbox.GetBottom() };

        m_tree->Insert( mmin, mmax, aItem );
    }

Referenced by CN_LIST::addItemtoTree().

Query()

template<class T>

template<class Visitor >

void CN_RTREE< T >::Query ( const BOX2I &  aBounds, const LAYER_RANGE &  aRange, Visitor &  aVisitor  ) const

inline

Function Query() Executes a function object aVisitor for each item whose bounding box intersects with aBounds.

Definition at line 110 of file connectivity_rtree.h.

    {
        const int   mmin[3] = { aRange.Start(), aBounds.GetX(), aBounds.GetY() };
        const int   mmax[3] = { aRange.End(), aBounds.GetRight(), aBounds.GetBottom() };

        m_tree->Search( mmin, mmax, aVisitor );
    }

Referenced by CN_LIST::FindNearby().

Remove()

template<class T>

void CN_RTREE< T >::Remove ( T  aItem )

inline

Function Remove() Removes an item from the tree.

Removal is done by comparing pointers, attempting to remove a copy of the item will fail.

Definition at line 73 of file connectivity_rtree.h.

    {

        // First, attempt to remove the item using its given BBox
        const BOX2I&        bbox    = aItem->BBox();
        const LAYER_RANGE   layers  = aItem->Layers();
        const int           mmin[3] = { layers.Start(), bbox.GetX(), bbox.GetY() };
        const int           mmax[3] = { layers.End(), bbox.GetRight(), bbox.GetBottom() };

        // If we are not successful ( 1 == not found ), then we expand
        // the search to the full tree
        if( m_tree->Remove( mmin, mmax, aItem ) )
        {
            // N.B. We must search the whole tree for the pointer to remove
            // because the item may have been moved before we have the chance to
            // delete it from the tree
            const int       mmin2[3] = { INT_MIN, INT_MIN, INT_MIN };
            const int       mmax2[3] = { INT_MAX, INT_MAX, INT_MAX };
            m_tree->Remove( mmin2, mmax2, aItem );
        }
    }

Referenced by CN_LIST::RemoveInvalidItems().

RemoveAll()

template<class T>

void CN_RTREE< T >::RemoveAll ( )

inline

Function RemoveAll() Removes all items from the RTree.

Definition at line 99 of file connectivity_rtree.h.

    {
        m_tree->RemoveAll();
    }

Referenced by CN_LIST::Clear().

Member Data Documentation

m_tree

template<class T>

RTree<T, int, 3, double>* CN_RTREE< T >::m_tree

private

Definition at line 120 of file connectivity_rtree.h.

Referenced by CN_RTREE< CN_ITEM * >::CN_RTREE(), CN_RTREE< CN_ITEM * >::Insert(), CN_RTREE< CN_ITEM * >::Query(), CN_RTREE< CN_ITEM * >::Remove(), CN_RTREE< CN_ITEM * >::RemoveAll(), and CN_RTREE< CN_ITEM * >::~CN_RTREE().

---

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

• connectivity_rtree.h