1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/**********************************************************************
* $Id: planarNodeMap.cpp,v 1.6 2004/10/19 19:51:14 strk Exp $
*
* GEOS - Geometry Engine Open Source
* http://geos.refractions.net
*
* Copyright (C) 2001-2002 Vivid Solutions Inc.
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************
* $Log: planarNodeMap.cpp,v $
* Revision 1.6 2004/10/19 19:51:14 strk
* Fixed many leaks and bugs in Polygonizer.
* Output still bogus.
*
* Revision 1.5 2004/10/13 10:03:02 strk
* Added missing linemerge and polygonize operation.
* Bug fixes and leaks removal from the newly added modules and
* planargraph (used by them).
* Some comments and indentation changes.
*
* Revision 1.4 2004/07/02 13:28:29 strk
* Fixed all #include lines to reflect headers layout change.
* Added client application build tips in README.
*
* Revision 1.3 2004/05/03 12:09:22 strk
* newline added at end of file
*
* Revision 1.2 2004/04/07 06:55:50 ybychkov
* "operation/linemerge" ported from JTS 1.4
*
* Revision 1.1 2004/04/04 06:29:11 ybychkov
* "planargraph" and "geom/utill" upgraded to JTS 1.4
*
*
**********************************************************************/
#include <geos/planargraph.h>
namespace geos {
//namespace planargraph {
/**
* Constructs a NodeMap without any Nodes.
*/
planarNodeMap::planarNodeMap() {
nodeMap=new map<Coordinate,planarNode*,planarCoordLT>();
}
planarNodeMap::~planarNodeMap() {
delete nodeMap;
}
map<Coordinate,planarNode*,planarCoordLT>* planarNodeMap::getNodeMap() {
return nodeMap;
}
/**
* Adds a node to the map, replacing any that is already at that location.
* @return the added node
*/
planarNode* planarNodeMap::add(planarNode *n){
nodeMap->insert(pair<Coordinate,planarNode*>(n->getCoordinate(),n));
return n;
}
/**
* Removes the Node at the given location, and returns it (or null if no Node was there).
*/
planarNode* planarNodeMap::remove(Coordinate& pt){
planarNode *n=find(pt);
nodeMap->erase(pt);
return n;
}
vector<planarNode*>*
planarNodeMap::getNodes()
{
vector<planarNode*> *values=new vector<planarNode*>();
map<Coordinate,planarNode*,planarCoordLT>::iterator it=nodeMap->begin();
while(it!=nodeMap->end()) {
values->push_back(it->second);
it++;
}
return values;
}
/**
* Returns the Node at the given location, or null if no Node was there.
*/
planarNode* planarNodeMap::find(const Coordinate& coord) {
map<Coordinate,planarNode*,planarCoordLT>::iterator found=nodeMap->find(coord);
if (found==nodeMap->end())
return NULL;
else
return found->second;
}
/**
* Returns an Iterator over the Nodes in this NodeMap, sorted in ascending order
* by angle with the positive x-axis.
*/
map<Coordinate,planarNode*,planarCoordLT>::iterator planarNodeMap::iterator(){
return nodeMap->begin();
}
//} //namespace planargraph
} //namespace geos
|
