#include <Route.h>
Public Member Functions | |
void | DestructItems (uint first, uint last) |
bool | FindClosestUtilNode (const DPoint2 &point, double error, vtRoute *&route, vtUtilNode *&node, double &closest) |
void | BuildGeometry (vtHeightField3d *pHeightField) |
bool | FindRouteFromNode (osg::Node *pNode, int &iOffset) |
![]() | |
vtArray (uint size=0) | |
vtArray (const vtArray< vtRoute * > &) | |
uint | GetSize () const |
uint | GetMaxSize () const |
bool | SetSize (uint) |
bool | SetMaxSize (uint) |
uint | GetElemSize () const |
vtRoute ** | GetData () const |
void | FreeData () |
bool | IsEmpty () const |
vtRoute *& | GetAt (uint i) const |
bool | SetAt (uint i, vtRoute *) |
vtArray< vtRoute * > & | operator= (const vtArray< vtRoute * > &) |
vtRoute *& | operator[] (uint i) |
const vtRoute *& | operator[] (uint i) const |
void | Empty () |
bool | RemoveAt (uint i, int n=1) |
int | Append (const vtRoute *&) |
int | Append (const vtArray< vtRoute * > &) |
int | Find (const vtRoute *&) const |
Additional Inherited Members | |
![]() | |
virtual bool | Grow (uint) |
![]() | |
uint | m_Size |
uint | m_MaxSize |
vtRoute ** | m_Data |
vtRouteMap is a container for a set of vtRoute objects.
bool vtRouteMap::FindClosestUtilNode | ( | const DPoint2 & | point, |
double | error, | ||
vtRoute *& | found_route, | ||
vtUtilNode *& | found_node, | ||
double & | closest | ||
) |
Find the util node which is closest to the given point, if it is within 'error' distance. The node and distance are returned by reference.