18 #include <geos/export.h> 24 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class 32 namespace planargraph {
39 namespace planargraph {
49 mutable std::vector<DirectedEdge*> outEdges;
51 void sortEdges()
const;
65 void add(DirectedEdge* de);
70 void remove(DirectedEdge* de);
76 std::vector<DirectedEdge*>::iterator
82 std::vector<DirectedEdge*>::iterator begin();
85 std::vector<DirectedEdge*>::iterator end();
88 std::vector<DirectedEdge*>::const_iterator begin()
const;
91 std::vector<DirectedEdge*>::const_iterator end()
const;
100 return outEdges.size();
113 std::vector<DirectedEdge*>& getEdges();
120 int getIndex(
const Edge* edge);
133 unsigned int getIndex(
int i)
const;
DirectedEdgeStar()
Constructs a DirectedEdgeStar with no edges.
Definition: planargraph/DirectedEdgeStar.h:57
A sorted collection of DirectedEdge which leave a Node in a PlanarGraph.
Definition: planargraph/DirectedEdgeStar.h:42
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:216
Represents a directed edge in a PlanarGraph.
Definition: planargraph/DirectedEdge.h:45
std::size_t getDegree() const
Returns the number of edges around the Node associated with this DirectedEdgeStar.
Definition: planargraph/DirectedEdgeStar.h:98
std::vector< DirectedEdge * >::iterator iterator()
Returns an Iterator over the DirectedEdges, in ascending order by angle with the positive x-axis...
Definition: planargraph/DirectedEdgeStar.h:77
Basic namespace for all GEOS functionalities.
Definition: Angle.h:25
Represents an undirected edge of a PlanarGraph.
Definition: planargraph/Edge.h:54