| AddIfCommonEnd(C2DRoute &Other) | C2DRoute | |
| AddPoint(const C2DPoint &pt) | C2DRoute | |
| AddPointDirect(C2DPoint *pt) | C2DRoute | |
| C2DBase(E_TYPE Type) | C2DBase | [inline] |
| C2DRoute(void) | C2DRoute | |
| Clear(void) | C2DRoute | |
| Crosses(const C2DLine &Line, C2DPointSet *IntersectionPts) | C2DRoute | |
| Distance(const C2DPoint &TestPoint) const | C2DRoute | [virtual] |
| Distance(const C2DPoint &TestPoint, unsigned int &nClosestLine) const | C2DRoute | |
| E_TYPE enum name | C2DBase | |
| ExtractLast(void) | C2DRoute | [inline] |
| ExtractPoint(int nIndx) | C2DRoute | [inline] |
| GetBoundingRect(C2DRect &Rect) const | C2DRoute | [virtual] |
| GetLinesCount(void) const | C2DRoute | |
| GetPoint(int nPointIndex) const | C2DRoute | |
| GetPointsCount(void) const | C2DRoute | [inline] |
| GetType(void) const | C2DBase | [inline] |
| Grow(double dFactor, const C2DPoint &Origin) | C2DRoute | [virtual] |
| HasRepeatedPoints(void) const | C2DRoute | |
| InsertOptimally(C2DPoint *pt) | C2DRoute | |
| InsertPointDirect(unsigned int nIndx, C2DPoint *pt) | C2DRoute | |
| IsClosed(void) const | C2DRoute | |
| m_Type | C2DBase | [protected] |
| Move(const C2DVector &Vector) | C2DRoute | [virtual] |
| operator=(const C2DRoute &Other) | C2DRoute | |
| Project(const C2DLine &Line, CInterval &Interval) const | C2DRoute | [virtual] |
| Project(const C2DVector &Vector, CInterval &Interval) const | C2DRoute | [virtual] |
| PurgeRepeatedAdjacentPoints(void) | C2DRoute | |
| Reflect(const C2DPoint &Point) | C2DRoute | [virtual] |
| Reflect(const C2DLine &Line) | C2DRoute | [virtual] |
| RemoveLast(void) | C2DRoute | |
| RotateToRight(double dAng, const C2DPoint &Origin) | C2DRoute | [virtual] |
| SnapToGrid(void) | C2DRoute | [virtual] |
| ~C2DBase(void) | C2DBase | [inline, virtual] |
| ~C2DRoute(void) | C2DRoute |
1.4.4