#include <NodeMap.h>
Public Types | |
typedef std::map < geom::Coordinate, Node *, geom::CoordinateLessThen > | container |
Public Member Functions | |
NodeMap () | |
Constructs a NodeMap without any Nodes. | |
container & | getNodeMap () |
Node * | add (Node *n) |
Adds a node to the std::map, replacing any that is already at that location. | |
Node * | remove (geom::Coordinate &pt) |
Removes the Node at the given location, and returns it (or null if no Node was there). | |
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 positive x-axis. | |
container::iterator | begin () |
container::const_iterator | begin () const |
container::iterator | end () |
container::const_iterator | end () const |
std::vector< Node * > * | getNodes () |
Returns the Nodes in this NodeMap, sorted in ascending order by angle with the positive x-axis. |
Adds a node to the std::map, replacing any that is already at that location.