#include <EdgeEndStar.h>

Public Types | |
|
typedef std::set< EdgeEnd *, EdgeEndLT > | container |
| typedef container::iterator | iterator |
| typedef container::reverse_iterator | reverse_iterator |
Public Member Functions | |
| virtual void | insert (EdgeEnd *e)=0 |
| Insert a EdgeEnd into this EdgeEndStar. | |
| virtual geom::Coordinate & | getCoordinate () |
| |
| virtual size_t | getDegree () |
| virtual iterator | begin () |
| virtual iterator | end () |
| virtual reverse_iterator | rbegin () |
| virtual reverse_iterator | rend () |
| virtual container & | getEdges () |
| virtual EdgeEnd * | getNextCW (EdgeEnd *ee) |
| virtual void | computeLabelling (std::vector< GeometryGraph * > *geom) |
| virtual int | getLocation (int geomIndex, const geom::Coordinate &p, std::vector< GeometryGraph * > *geom) |
| virtual bool | isAreaLabelsConsistent () |
| virtual void | propagateSideLabels (int geomIndex) |
| virtual iterator | find (EdgeEnd *eSearch) |
| virtual std::string | print () |
Protected Member Functions | |
| virtual void | insertEdgeEnd (EdgeEnd *e) |
| Insert an EdgeEnd into the map. | |
Protected Attributes | |
| EdgeEndStar::container | edgeMap |
| A map which maintains the edges in sorted order around the node. | |
They are maintained in CCW order (starting with the positive x-axis) around the node for efficient lookup and topology building.
1.5.4