-
-
Notifications
You must be signed in to change notification settings - Fork 2.9k
/
qgsafsfeatureiterator.cpp
278 lines (242 loc) · 8.57 KB
/
qgsafsfeatureiterator.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
/***************************************************************************
qgsafsfeatureiterator.cpp
-------------------------
begin : Jun 03, 2015
copyright : (C) 2015 by Sandro Mani
email : smani@sourcepole.ch
***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#include "qgsafsfeatureiterator.h"
#include "qgsspatialindex.h"
#include "qgsafsshareddata.h"
#include "qgsmessagelog.h"
#include "geometry/qgsgeometry.h"
#include "qgsexception.h"
#include "qgsarcgisrestutils.h"
#include "qgsfeedback.h"
#include "qgsgeometryengine.h"
QgsAfsFeatureSource::QgsAfsFeatureSource( const std::shared_ptr<QgsAfsSharedData> &sharedData )
: mSharedData( sharedData )
{
}
QgsFeatureIterator QgsAfsFeatureSource::getFeatures( const QgsFeatureRequest &request )
{
return QgsFeatureIterator( new QgsAfsFeatureIterator( this, false, request ) );
}
QgsAfsSharedData *QgsAfsFeatureSource::sharedData() const
{
return mSharedData.get();
}
///////////////////////////////////////////////////////////////////////////////
QgsAfsFeatureIterator::QgsAfsFeatureIterator( QgsAfsFeatureSource *source, bool ownSource, const QgsFeatureRequest &request )
: QgsAbstractFeatureIteratorFromSource<QgsAfsFeatureSource>( source, ownSource, request )
{
if ( mRequest.destinationCrs().isValid() && mRequest.destinationCrs() != mSource->sharedData()->crs() )
{
mTransform = QgsCoordinateTransform( mSource->sharedData()->crs(), mRequest.destinationCrs(), mRequest.transformContext() );
}
try
{
mFilterRect = filterRectToSourceCrs( mTransform );
if ( !mRequest.filterRect().isNull() && mFilterRect.isNull() )
{
close();
return;
}
}
catch ( QgsCsException & )
{
// can't reproject mFilterRect
close();
return;
}
QgsFeatureIds requestIds;
if ( mRequest.filterType() == QgsFeatureRequest::FilterFids )
{
requestIds = mRequest.filterFids();
}
else if ( mRequest.filterType() == QgsFeatureRequest::FilterFid )
{
requestIds.insert( mRequest.filterFid() );
}
if ( !mFilterRect.isNull() && !mSource->sharedData()->hasCachedAllFeatures() )
{
// defer request to find features in filter rect until first feature is requested
// this allows time for a interruption checker to be installed on the iterator
// and avoids performing this expensive check in the main thread when just
// preparing iterators
// (but if we've already cached ALL the features, we skip this -- there's no need for
// firing off another request to the server)
mDeferredFeaturesInFilterRectCheck = true;
}
// prepare spatial filter geometries for optimal speed
switch ( mRequest.spatialFilterType() )
{
case Qgis::SpatialFilterType::NoFilter:
case Qgis::SpatialFilterType::BoundingBox:
break;
case Qgis::SpatialFilterType::DistanceWithin:
if ( !mRequest.referenceGeometry().isEmpty() )
{
mDistanceWithinGeom = mRequest.referenceGeometry();
mDistanceWithinEngine.reset( QgsGeometry::createGeometryEngine( mDistanceWithinGeom.constGet() ) );
mDistanceWithinEngine->prepareGeometry();
}
break;
}
mFeatureIdList = qgis::setToList( requestIds );
std::sort( mFeatureIdList.begin(), mFeatureIdList.end() );
mRemainingFeatureIds = mFeatureIdList;
if ( !mRemainingFeatureIds.empty() )
mFeatureIterator = mRemainingFeatureIds.at( 0 );
}
QgsAfsFeatureIterator::~QgsAfsFeatureIterator()
{
close();
}
bool QgsAfsFeatureIterator::fetchFeature( QgsFeature &f )
{
f.setValid( false );
if ( mClosed )
return false;
if ( mInterruptionChecker && mInterruptionChecker->isCanceled() )
return false;
if ( mFeatureIterator >= mSource->sharedData()->objectIdCount() )
return false;
if ( mDeferredFeaturesInFilterRectCheck )
{
const QgsFeatureIds featuresInRect = mSource->sharedData()->getFeatureIdsInExtent( mFilterRect, mInterruptionChecker );
if ( !mFeatureIdList.isEmpty() )
{
QgsFeatureIds requestIds = qgis::listToSet( mFeatureIdList );
requestIds.intersect( featuresInRect );
mFeatureIdList = qgis::setToList( requestIds );
}
else
{
mFeatureIdList = qgis::setToList( featuresInRect );
}
if ( mFeatureIdList.empty() )
{
return false;
}
std::sort( mFeatureIdList.begin(), mFeatureIdList.end() );
mRemainingFeatureIds = mFeatureIdList;
if ( !mRemainingFeatureIds.empty() )
mFeatureIterator = mRemainingFeatureIds.at( 0 );
mDeferredFeaturesInFilterRectCheck = false;
if ( !( mRequest.flags() & QgsFeatureRequest::ExactIntersect ) )
{
// discard the filter rect - we know that the features in mRemainingFeatureIds are guaranteed
// to be intersecting the rect, so avoid any extra unnecessary checks
mFilterRect = QgsRectangle();
}
}
if ( !mFeatureIdList.empty() && mRemainingFeatureIds.empty() )
return false;
switch ( mRequest.filterType() )
{
case QgsFeatureRequest::FilterFid:
{
if ( mRemainingFeatureIds.empty() )
return false;
bool result = mSource->sharedData()->getFeature( mRequest.filterFid(), f, QgsRectangle(), mInterruptionChecker );
if ( mInterruptionChecker && mInterruptionChecker->isCanceled() )
return false;
geometryToDestinationCrs( f, mTransform );
if ( mDistanceWithinEngine && mDistanceWithinEngine->distance( f.geometry().constGet() ) > mRequest.distanceWithin() )
{
result = false;
}
f.setValid( result );
mRemainingFeatureIds.removeAll( f.id() );
return result;
}
case QgsFeatureRequest::FilterFids:
case QgsFeatureRequest::FilterExpression:
case QgsFeatureRequest::FilterNone:
{
while ( mFeatureIterator < mSource->sharedData()->objectIdCount() )
{
if ( mInterruptionChecker && mInterruptionChecker->isCanceled() )
return false;
if ( !mFeatureIdList.empty() && mRemainingFeatureIds.empty() )
return false;
bool success = false;
bool isDeleted = mSource->sharedData()->isDeleted( mFeatureIterator );
if ( !isDeleted )
{
success = mSource->sharedData()->getFeature( mFeatureIterator, f, QgsRectangle(), mInterruptionChecker );
}
if ( !mFeatureIdList.empty() )
{
mRemainingFeatureIds.removeAll( mFeatureIterator );
if ( !mRemainingFeatureIds.empty() )
mFeatureIterator = mRemainingFeatureIds.at( 0 );
}
else
{
++mFeatureIterator;
}
if ( success && !mFilterRect.isNull() )
{
if ( !f.hasGeometry() )
success = false;
else
{
if ( mRequest.spatialFilterType() == Qgis::SpatialFilterType::BoundingBox && mRequest.flags() & QgsFeatureRequest::ExactIntersect )
{
// exact intersection check requested
if ( !f.geometry().intersects( mFilterRect ) )
success = false;
}
else
{
// bounding box intersect check only
if ( !f.geometry().boundingBoxIntersects( mFilterRect ) )
success = false;
}
}
}
if ( !success )
continue;
geometryToDestinationCrs( f, mTransform );
bool result = true;
if ( mDistanceWithinEngine && mDistanceWithinEngine->distance( f.geometry().constGet() ) > mRequest.distanceWithin() )
result = false;
if ( result )
return true;
}
return false;
}
}
return false;
}
bool QgsAfsFeatureIterator::rewind()
{
if ( mClosed )
return false;
mFeatureIterator = 0;
mRemainingFeatureIds = mFeatureIdList;
if ( !mRemainingFeatureIds.empty() )
mFeatureIterator = mRemainingFeatureIds.at( 0 );
return true;
}
bool QgsAfsFeatureIterator::close()
{
if ( mClosed )
return false;
iteratorClosed();
mClosed = true;
return true;
}
void QgsAfsFeatureIterator::setInterruptionChecker( QgsFeedback *interruptionChecker )
{
mInterruptionChecker = interruptionChecker;
}