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
|
/**********************************************************************
* $Id: EdgeIntersection.cpp,v 1.2 2004/07/02 13:28:26 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 Public Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************
* $Log: EdgeIntersection.cpp,v $
* Revision 1.2 2004/07/02 13:28:26 strk
* Fixed all #include lines to reflect headers layout change.
* Added client application build tips in README.
*
* Revision 1.1 2004/03/19 09:48:45 ybychkov
* "geomgraph" and "geomgraph/indexl" upgraded to JTS 1.4
*
* Revision 1.9 2003/11/07 01:23:42 pramsey
* Add standard CVS headers licence notices and copyrights to all cpp and h
* files.
*
*
**********************************************************************/
#include <geos/geomgraph.h>
#include <stdio.h>
namespace geos {
EdgeIntersection::EdgeIntersection(const Coordinate& newCoord, int newSegmentIndex, double newDist) {
coord=newCoord;
segmentIndex=newSegmentIndex;
dist=newDist;
}
EdgeIntersection::~EdgeIntersection() {
//aaa
}
int EdgeIntersection::compare(int newSegmentIndex, double newDist) {
if (segmentIndex<newSegmentIndex) return -1;
if (segmentIndex>newSegmentIndex) return 1;
if (dist<newDist) return -1;
if (dist>newDist) return 1;
return 0;
}
bool EdgeIntersection::isEndPoint(int maxSegmentIndex) {
if (segmentIndex==0 && dist==0.0) return true;
if (segmentIndex==maxSegmentIndex) return true;
return false;
}
string EdgeIntersection::print(){
string out="";
out+=coord.toString();
char buffer[255];
sprintf(buffer," seg # = %i dist= %g",segmentIndex,dist);
string out2(buffer);
out.append(out2);
return out;
}
int EdgeIntersection::compareTo(void* obj) {
EdgeIntersection* other=(EdgeIntersection*) obj;
return compare(other->segmentIndex,other->dist);
}
}
|
