18 #include <geos/export.h>
24 #pragma warning(disable: 4251)
32 namespace planargraph {
39 namespace planargraph {
49 mutable std::vector<DirectedEdge*> outEdges;
51 void sortEdges()
const;
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();
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:217
A sorted collection of DirectedEdge which leave a Node in a PlanarGraph.
Definition: planargraph/DirectedEdgeStar.h:42
void add(DirectedEdge *de)
Adds a new member to this DirectedEdgeStar.
std::vector< DirectedEdge * >::const_iterator begin() const
Returns an const_iterator to first DirectedEdge.
std::vector< DirectedEdge * >::iterator begin()
Returns an iterator to first DirectedEdge.
std::vector< DirectedEdge * > & getEdges()
Returns the DirectedEdges, in ascending order by angle with the positive x-axis.
unsigned int getIndex(int i) const
Returns the remainder when i is divided by the number of edges in this DirectedEdgeStar.
geom::Coordinate & getCoordinate() const
Returns the coordinate for the node at which this star is based.
int getIndex(const Edge *edge)
Returns the zero-based index of the given Edge, after sorting in ascending order by angle with the po...
std::size_t getDegree() const
Returns the number of edges around the Node associated with this DirectedEdgeStar.
Definition: planargraph/DirectedEdgeStar.h:98
DirectedEdgeStar()
Constructs a DirectedEdgeStar with no edges.
Definition: planargraph/DirectedEdgeStar.h:57
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
std::vector< DirectedEdge * >::iterator end()
Returns an iterator to one-past last DirectedEdge.
std::vector< DirectedEdge * >::const_iterator end() const
Returns an const_iterator to one-past last DirectedEdge.
DirectedEdge * getNextEdge(DirectedEdge *dirEdge)
Returns the DirectedEdge on the left-hand side of the given DirectedEdge (which must be a member of t...
void remove(DirectedEdge *de)
Drops a member of this DirectedEdgeStar.
int getIndex(const DirectedEdge *dirEdge)
Returns the zero-based index of the given DirectedEdge, after sorting in ascending order by angle wit...
Represents a directed edge in a PlanarGraph.
Definition: planargraph/DirectedEdge.h:45
Represents an undirected edge of a PlanarGraph.
Definition: planargraph/Edge.h:54
Basic namespace for all GEOS functionalities.
Definition: Angle.h:25