-
Notifications
You must be signed in to change notification settings - Fork 371
/
Copy pathGeometryCollection.cpp
493 lines (426 loc) · 10.9 KB
/
GeometryCollection.cpp
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
/**********************************************************************
*
* GEOS - Geometry Engine Open Source
* http://geos.osgeo.org
*
* Copyright (C) 2001-2002 Vivid Solutions Inc.
* Copyright (C) 2005 2006 Refractions Research 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.
*
**********************************************************************
*
* Last port: geom/GeometryCollection.java rev. 1.41
*
**********************************************************************/
#include <geos/geom/GeometryCollection.h>
#include <geos/util/IllegalArgumentException.h>
#include <geos/geom/CoordinateSequence.h>
#include <geos/geom/CoordinateSequenceFilter.h>
#include <geos/geom/GeometryFactory.h>
#include <geos/geom/GeometryFilter.h>
#include <geos/geom/GeometryComponentFilter.h>
#include <geos/util.h>
#include <algorithm>
#include <vector>
#include <memory>
namespace geos {
namespace geom { // geos::geom
/*protected*/
GeometryCollection::GeometryCollection(const GeometryCollection& gc)
:
Geometry(gc),
geometries(gc.geometries.size()),
flags(gc.flags),
envelope(gc.envelope)
{
for(std::size_t i = 0; i < geometries.size(); ++i) {
geometries[i] = gc.geometries[i]->clone();
}
}
GeometryCollection&
GeometryCollection::operator=(const GeometryCollection& gc)
{
geometries.resize(gc.geometries.size());
envelope = gc.envelope;
flags = gc.flags;
for (std::size_t i = 0; i < geometries.size(); i++) {
geometries[i] = gc.geometries[i]->clone();
}
return *this;
}
GeometryCollection::GeometryCollection(std::vector<std::unique_ptr<Geometry>> && newGeoms, const GeometryFactory& factory) :
Geometry(&factory),
geometries(std::move(newGeoms)),
flags{}, // set all flags to zero
envelope(computeEnvelopeInternal())
{
if (hasNullElements(&geometries)) {
throw util::IllegalArgumentException("geometries must not contain null elements\n");
}
setSRID(getSRID());
}
void
GeometryCollection::setSRID(int newSRID)
{
Geometry::setSRID(newSRID);
for(auto& g : geometries) {
g->setSRID(newSRID);
}
}
/*
* Collects all coordinates of all subgeometries into a CoordinateSequence.
*
* Returns a newly the collected coordinates
*
*/
std::unique_ptr<CoordinateSequence>
GeometryCollection::getCoordinates() const
{
auto coordinates = detail::make_unique<CoordinateSequence>(getNumPoints());
std::size_t k = 0;
for(const auto& g : geometries) {
auto childCoordinates = g->getCoordinates(); // TODO avoid this copy where getCoordinateRO() exists
std::size_t npts = childCoordinates->getSize();
for(std::size_t j = 0; j < npts; ++j) {
coordinates->setAt(childCoordinates->getAt(j), k);
k++;
}
}
return coordinates;
}
bool
GeometryCollection::isEmpty() const
{
for(const auto& g : geometries) {
if(!g->isEmpty()) {
return false;
}
}
return true;
}
void
GeometryCollection::setFlags() const {
if (flags.flagsCalculated) {
return;
}
for (const auto& geom : geometries) {
flags.hasPoints |= geom->hasDimension(Dimension::P);
flags.hasLines |= geom->hasDimension(Dimension::L);
flags.hasPolygons |= geom->hasDimension(Dimension::A);
flags.hasM |= geom->hasM();
flags.hasZ |= geom->hasZ();
flags.hasCurves |= geom->hasCurvedComponents();
}
flags.flagsCalculated = true;
}
Dimension::DimensionType
GeometryCollection::getDimension() const
{
setFlags();
if (flags.hasPolygons) {
return Dimension::A;
}
if (flags.hasLines) {
return Dimension::L;
}
if (flags.hasPoints) {
return Dimension::P;
}
return Dimension::False;
}
bool
GeometryCollection::isDimensionStrict(Dimension::DimensionType d) const {
setFlags();
if (isEmpty()) {
return true;
}
switch(d) {
case Dimension::A: return flags.hasPolygons && !flags.hasLines && !flags.hasPoints;
case Dimension::L: return !flags.hasPolygons && flags.hasLines && !flags.hasPoints;
case Dimension::P: return !flags.hasPolygons && !flags.hasLines && flags.hasPoints;
default:
return false;
}
}
bool
GeometryCollection::hasDimension(Dimension::DimensionType d) const {
setFlags();
switch (d) {
case Dimension:: A: return flags.hasPolygons;
case Dimension:: L: return flags.hasLines;
case Dimension:: P: return flags.hasPoints;
default:
return false;
}
}
int
GeometryCollection::getBoundaryDimension() const
{
int dimension = Dimension::False;
for(const auto& g : geometries) {
dimension = std::max(dimension, g->getBoundaryDimension());
}
return dimension;
}
uint8_t
GeometryCollection::getCoordinateDimension() const
{
uint8_t dimension = 2;
for(const auto& g : geometries) {
dimension = std::max(dimension, g->getCoordinateDimension());
}
return dimension;
}
bool
GeometryCollection::hasM() const
{
setFlags();
return flags.hasM;
}
bool
GeometryCollection::hasZ() const
{
setFlags();
return flags.hasZ;
}
size_t
GeometryCollection::getNumGeometries() const
{
return geometries.size();
}
const Geometry*
GeometryCollection::getGeometryN(std::size_t n) const
{
return geometries[n].get();
}
std::vector<std::unique_ptr<Geometry>>
GeometryCollection::releaseGeometries()
{
auto ret = std::move(geometries);
geometryChanged();
flags.flagsCalculated = false;
return ret;
}
size_t
GeometryCollection::getNumPoints() const
{
std::size_t numPoints = 0;
for(const auto& g : geometries) {
numPoints += g->getNumPoints();
}
return numPoints;
}
std::string
GeometryCollection::getGeometryType() const
{
return "GeometryCollection";
}
std::unique_ptr<Geometry>
GeometryCollection::getBoundary() const
{
throw util::IllegalArgumentException("Operation not supported by GeometryCollection\n");
}
bool
GeometryCollection::equalsExact(const Geometry* other, double tolerance) const
{
if(!isEquivalentClass(other)) {
return false;
}
const GeometryCollection* otherCollection = detail::down_cast<const GeometryCollection*>(other);
if(geometries.size() != otherCollection->geometries.size()) {
return false;
}
for(std::size_t i = 0; i < geometries.size(); ++i) {
if(!(geometries[i]->equalsExact(otherCollection->geometries[i].get(), tolerance))) {
return false;
}
}
return true;
}
bool
GeometryCollection::equalsIdentical(const Geometry* other_g) const
{
if(!isEquivalentClass(other_g)) {
return false;
}
const auto& other = static_cast<const GeometryCollection&>(*other_g);
if(getNumGeometries() != other.getNumGeometries()) {
return false;
}
if (envelope != other.envelope) {
return false;
}
for(std::size_t i = 0; i < getNumGeometries(); i++) {
if(!(getGeometryN(i)->equalsIdentical(other.getGeometryN(i)))) {
return false;
}
}
return true;
}
void
GeometryCollection::apply_rw(const CoordinateFilter* filter)
{
for(auto& g : geometries) {
g->apply_rw(filter);
}
}
void
GeometryCollection::apply_ro(CoordinateFilter* filter) const
{
for(const auto& g : geometries) {
g->apply_ro(filter);
}
}
void
GeometryCollection::apply_ro(GeometryFilter* filter) const
{
filter->filter_ro(this);
for(const auto& g : geometries) {
g->apply_ro(filter);
}
}
void
GeometryCollection::apply_rw(GeometryFilter* filter)
{
filter->filter_rw(this);
for(auto& g : geometries) {
g->apply_rw(filter);
}
}
void
GeometryCollection::normalize()
{
for(auto& g : geometries) {
g->normalize();
}
std::sort(geometries.begin(), geometries.end(), [](const std::unique_ptr<Geometry> & a, const std::unique_ptr<Geometry> & b) {
return a->compareTo(b.get()) > 0;
});
}
Envelope
GeometryCollection::computeEnvelopeInternal() const
{
Envelope p_envelope;
for(const auto& g : geometries) {
const Envelope* env = g->getEnvelopeInternal();
p_envelope.expandToInclude(env);
}
return p_envelope;
}
int
GeometryCollection::compareToSameClass(const Geometry* g) const
{
const GeometryCollection* gc = detail::down_cast<const GeometryCollection*>(g);
return compare(geometries, gc->geometries);
}
bool GeometryCollection::hasCurvedComponents() const {
setFlags();
return flags.hasCurves;
}
const CoordinateXY*
GeometryCollection::getCoordinate() const
{
for(const auto& g : geometries) {
if(!g->isEmpty()) {
return g->getCoordinate();
}
}
return nullptr;
}
/**
* @return the area of this collection
*/
double
GeometryCollection::getArea() const
{
double area = 0.0;
for(const auto& g : geometries) {
area += g->getArea();
}
return area;
}
/**
* @return the total length of this collection
*/
double
GeometryCollection::getLength() const
{
double sum = 0.0;
for(const auto& g : geometries) {
sum += g->getLength();
}
return sum;
}
void
GeometryCollection::apply_rw(GeometryComponentFilter* filter)
{
filter->filter_rw(this);
for(auto& g : geometries) {
if (filter->isDone()) {
return;
}
g->apply_rw(filter);
}
}
void
GeometryCollection::apply_ro(GeometryComponentFilter* filter) const
{
filter->filter_ro(this);
for(const auto& g : geometries) {
if (filter->isDone()) {
return;
}
g->apply_ro(filter);
}
}
void
GeometryCollection::apply_rw(CoordinateSequenceFilter& filter)
{
for(auto& g : geometries) {
g->apply_rw(filter);
if(filter.isDone()) {
break;
}
}
if(filter.isGeometryChanged()) {
geometryChanged();
}
}
void
GeometryCollection::apply_ro(CoordinateSequenceFilter& filter) const
{
for(const auto& g : geometries) {
g->apply_ro(filter);
if(filter.isDone()) {
break;
}
}
assert(!filter.isGeometryChanged()); // read-only filter...
//if (filter.isGeometryChanged()) geometryChanged();
}
GeometryTypeId
GeometryCollection::getGeometryTypeId() const
{
return GEOS_GEOMETRYCOLLECTION;
}
GeometryCollection*
GeometryCollection::reverseImpl() const
{
if(isEmpty()) {
return clone().release();
}
std::vector<std::unique_ptr<Geometry>> reversed(geometries.size());
std::transform(geometries.begin(),
geometries.end(),
reversed.begin(),
[](const std::unique_ptr<Geometry> & g) {
return g->reverse();
});
return getFactory()->createGeometryCollection(std::move(reversed)).release();
}
} // namespace geos::geom
} // namespace geos