16 #ifndef GEOS_PLANARGRAPH_NODEMAP_H
17 #define GEOS_PLANARGRAPH_NODEMAP_H
19 #include <geos/export.h>
20 #include <geos/geom/Coordinate.h>
27 #pragma warning(disable: 4251)
32 namespace planargraph {
33 class DirectedEdgeStar;
41 namespace planargraph {
50 typedef std::map<geom::Coordinate, Node*, geom::CoordinateLessThen> container;
59 container& getNodeMap();
94 return nodeMap.begin();
100 return nodeMap.begin();
102 container::const_iterator
105 return nodeMap.begin();
111 return nodeMap.end();
113 container::const_iterator
116 return nodeMap.end();
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:60
A map of Node, indexed by the coordinate of the node.
Definition: planargraph/NodeMap.h:48
Node * add(Node *n)
Adds a node to the std::map, replacing any that is already at that location.
void getNodes(std::vector< Node * > &nodes)
Returns the Nodes in this NodeMap, sorted in ascending order by angle with the positive x-axis.
Node * remove(geom::Coordinate &pt)
Removes the Node at the given location, and returns it (or null if no Node was there).
NodeMap()
Constructs a NodeMap without any Nodes.
Node * find(const geom::Coordinate &coord)
Returns the Node at the given location, or null if no Node was there.
container::iterator iterator()
Returns an Iterator over the Nodes in this NodeMap, sorted in ascending order by angle with the posit...
Definition: planargraph/NodeMap.h:92
A node in a PlanarGraph is a location where 0 or more Edge meet.
Definition: planargraph/Node.h:45
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:26