SHAPE_INDEX< T > Class Template Reference

#include <shape_index.h>

Classes
class	Iterator

Public Member Functions
	SHAPE_INDEX ()
	~SHAPE_INDEX ()
void	Add (T aShape)
	Add a SHAPE to the index. More...
void	Add (T aShape, const BOX2I &aBbox)
	Add a shape with alternate BBox. More...
void	Remove (T aShape)
	Remove a SHAPE from the index. More...
void	RemoveAll ()
	Remove all the contents of the index. More...
template<class V >
void	Accept (V aVisitor)
	Accept a visitor for every SHAPE object contained in this INDEX. More...
void	Reindex ()
	Rebuild the index. More...
template<class V >
int	Query (const SHAPE *aShape, int aMinDistance, V &aVisitor) const
	Run a callback on every SHAPE object contained in the bounding box of (shape). More...
Iterator	Begin ()
	Create an iterator for the current index object. More...

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

Detailed Description

template<class T = SHAPE*>
class SHAPE_INDEX< T >

Definition at line 130 of file shape_index.h.

Constructor & Destructor Documentation

SHAPE_INDEX()

template<class T >

SHAPE_INDEX< T >::SHAPE_INDEX

Definition at line 309 of file shape_index.h.

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

~SHAPE_INDEX()

template<class T >

SHAPE_INDEX< T >::~SHAPE_INDEX

Definition at line 315 of file shape_index.h.

{
 delete this->m_tree;
}

Member Function Documentation

Accept()

template<class T = SHAPE*>

template<class V >

void SHAPE_INDEX< T >::Accept ( V  aVisitor )

inline

Accept a visitor for every SHAPE object contained in this INDEX.

Parameters

aVisitor

is the visitor object to be run.

Definition at line 255 of file shape_index.h.

 {
 Iterator iter = this->Begin();
 
 while( !iter.IsNull() )
 {
 T shape = *iter;
 acceptVisitor( shape, aVisitor );
 iter++;
 }
 }

References acceptVisitor(), SHAPE_INDEX< T >::Begin(), and SHAPE_INDEX< T >::Iterator::IsNull().

Add() [1/2]

template<class T >

void SHAPE_INDEX< T >::Add

(

T

aShape

)

Add a SHAPE to the index.

Parameters

aShape

is the new SHAPE.

Definition at line 330 of file shape_index.h.

{
 BOX2I box = boundingBox( aShape );
 int min[2] = { box.GetX(), box.GetY() };
 int max[2] = { box.GetRight(), box.GetBottom() };
 
 this->m_tree->Insert( min, max, aShape );
}

References boundingBox(), BOX2< Vec >::GetBottom(), BOX2< Vec >::GetRight(), BOX2< Vec >::GetX(), and BOX2< Vec >::GetY().

Add() [2/2]

template<class T >

void SHAPE_INDEX< T >::Add	(	T	aShape,
		const BOX2I &	aBbox
	)

Add a shape with alternate BBox.

Parameters

aShape	Shape (Item) to add.
aBbox	alternate bounding box. This should be a subset of the item's bbox

Definition at line 321 of file shape_index.h.

{
 int min[2] = { aBbox.GetX(), aBbox.GetY() };
 int max[2] = { aBbox.GetRight(), aBbox.GetBottom() };
 
 this->m_tree->Insert( min, max, aShape );
}

References BOX2< Vec >::GetBottom(), BOX2< Vec >::GetRight(), BOX2< Vec >::GetX(), and BOX2< Vec >::GetY().

Begin()

template<class T >

SHAPE_INDEX< T >::Iterator SHAPE_INDEX< T >::Begin

Create an iterator for the current index object.

Returns

iterator to the first object.

Definition at line 378 of file shape_index.h.

{
 return Iterator( this );
}

Referenced by SHAPE_INDEX< T >::Accept().

Query()

template<class T = SHAPE*>

template<class V >

int SHAPE_INDEX< T >::Query ( const SHAPE *  aShape, int  aMinDistance, V &  aVisitor  ) const

inline

Run a callback on every SHAPE object contained in the bounding box of (shape).

Parameters

aShape	is the shape to search against.
aMinDistance	is the distance threshold.
aVisitor	is the object to be invoked on every object contained in the search area.

Definition at line 282 of file shape_index.h.

 {
 BOX2I box = aShape->BBox();
 box.Inflate( aMinDistance );
 
 int min[2] = { box.GetX(), box.GetY() };
 int max[2] = { box.GetRight(), box.GetBottom() };
 
 return this->m_tree->Search( min, max, aVisitor );
 }

References SHAPE::BBox(), BOX2< Vec >::GetBottom(), BOX2< Vec >::GetRight(), BOX2< Vec >::GetX(), BOX2< Vec >::GetY(), BOX2< Vec >::Inflate(), and SHAPE_INDEX< T >::m_tree.

Reindex()

template<class T >

void SHAPE_INDEX< T >::Reindex

Rebuild the index.

This should be used if the geometry of the objects contained by the index has changed.

Definition at line 356 of file shape_index.h.

{
 RTree<T, int, 2, double>* newTree;
 newTree = new RTree<T, int, 2, double>();
 
 Iterator iter = this->Begin();
 
 while( !iter.IsNull() )
 {
 T shape = *iter;
 BOX2I box = boundingBox( shape );
 int min[2] = { box.GetX(), box.GetY() };
 int max[2] = { box.GetRight(), box.GetBottom() };
 newTree->Insert( min, max, shape );
 iter++;
 }
 
 delete this->m_tree;
 this->m_tree = newTree;
}

References boundingBox(), BOX2< Vec >::GetBottom(), BOX2< Vec >::GetRight(), BOX2< Vec >::GetX(), BOX2< Vec >::GetY(), and SHAPE_INDEX< T >::Iterator::IsNull().

Remove()

template<class T >

void SHAPE_INDEX< T >::Remove

(

T

aShape

)

Remove a SHAPE from the index.

Parameters

aShape

is the SHAPE to remove.

Definition at line 340 of file shape_index.h.

{
 BOX2I box = boundingBox( aShape );
 int min[2] = { box.GetX(), box.GetY() };
 int max[2] = { box.GetRight(), box.GetBottom() };
 
 this->m_tree->Remove( min, max, aShape );
}

References boundingBox(), BOX2< Vec >::GetBottom(), BOX2< Vec >::GetRight(), BOX2< Vec >::GetX(), and BOX2< Vec >::GetY().

RemoveAll()

template<class T >

void SHAPE_INDEX< T >::RemoveAll

Remove all the contents of the index.

Definition at line 350 of file shape_index.h.

{
 this->m_tree->RemoveAll();
}

Member Data Documentation

m_tree

template<class T = SHAPE*>

RTree<T, int, 2, double>* SHAPE_INDEX< T >::m_tree

private

Definition at line 301 of file shape_index.h.

Referenced by SHAPE_INDEX< T >::Iterator::Iterator(), and SHAPE_INDEX< T >::Query().

---

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

• shape_index.h