16 #ifndef GEOS_PLANARGRAPH_DIRECTEDEDGESTAR_H 17 #define GEOS_PLANARGRAPH_DIRECTEDEDGESTAR_H 19 #include <geos/export.h> 25 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class 33 namespace planargraph {
40 namespace planargraph {
50 mutable std::vector<DirectedEdge*> outEdges;
52 void sortEdges()
const;
66 void add(DirectedEdge* de);
71 void remove(DirectedEdge* de);
77 std::vector<DirectedEdge*>::iterator
83 std::vector<DirectedEdge*>::iterator begin();
86 std::vector<DirectedEdge*>::iterator end();
89 std::vector<DirectedEdge*>::const_iterator begin()
const;
92 std::vector<DirectedEdge*>::const_iterator end()
const;
101 return outEdges.size();
114 std::vector<DirectedEdge*>& getEdges();
121 int getIndex(
const Edge* edge);
134 int getIndex(
int i)
const;
151 #endif // GEOS_PLANARGRAPH_DIRECTEDEDGESTAR_H DirectedEdgeStar()
Constructs a DirectedEdgeStar with no edges.
Definition: planargraph/DirectedEdgeStar.h:58
A sorted collection of DirectedEdge which leave a Node in a PlanarGraph.
Definition: planargraph/DirectedEdgeStar.h:43
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:60
Represents a directed edge in a PlanarGraph.
Definition: planargraph/DirectedEdge.h:46
std::size_t getDegree() const
Returns the number of edges around the Node associated with this DirectedEdgeStar.
Definition: planargraph/DirectedEdgeStar.h:99
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:78
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:25
Represents an undirected edge of a PlanarGraph.
Definition: planargraph/Edge.h:54