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)
50 typedef std::map<geom::Coordinate, Node*, geom::CoordinateLessThen> container;
59 container& getNodeMap();
92 return nodeMap.begin();
95 container::iterator begin() {
96 return nodeMap.begin();
98 container::const_iterator begin()
const {
99 return nodeMap.begin();
102 container::iterator end() {
103 return nodeMap.end();
105 container::const_iterator end()
const {
106 return nodeMap.end();
Coordinate is the lightweight class used to store coordinates.
Definition Coordinate.h:60
A sorted collection of DirectedEdge which leave a Node in a PlanarGraph.
Definition planargraph/DirectedEdgeStar.h:43
Represents a directed edge in a PlanarGraph.
Definition planargraph/DirectedEdge.h:46
Represents an undirected edge of a PlanarGraph.
Definition planargraph/Edge.h:54
Node * find(const geom::Coordinate &coord)
Returns the Node at the given location, or null if no Node was there.
void getNodes(std::vector< Node * > &nodes)
Returns the Nodes in this NodeMap, sorted in ascending order by angle with the positive x-axis.
NodeMap()
Constructs a NodeMap without any Nodes.
Node * add(Node *n)
Adds a node to the std::map, replacing any that is already at that location.
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:91
Node * remove(geom::Coordinate &pt)
Removes the Node at the given location, and returns it (or null if no Node was there).
A node in a PlanarGraph is a location where 0 or more Edge meet.
Definition planargraph/Node.h:45
Contains classes to implement a planar graph data structure.
Definition LineMergeDirectedEdge.h:32
Basic namespace for all GEOS functionalities.
Definition IndexedNestedRingTester.h:25