32 #include <spatialindex/SpatialIndex.h>
34 #include <QLinkedListIterator>
35 #include <QtConcurrent>
41 static SpatialIndex::Point point2point(
const QgsPointXY &point )
43 double plow[2] = { point.
x(), point.
y() };
44 return Point( plow, 2 );
48 static SpatialIndex::Region rect2region(
const QgsRectangle &rect )
52 return SpatialIndex::Region( pLow, pHigh, 2 );
60 static const double POINT_LOC_EPSILON = 1e-12;
74 : mDataList( dataList )
78 IData *
getNext()
override {
return mIt.next(); }
79 bool hasNext()
override {
return mIt.hasNext(); }
81 uint32_t
size()
override { Q_ASSERT(
false &&
"not available" );
return 0; }
82 void rewind()
override { Q_ASSERT(
false &&
"not available" ); }
85 QLinkedList<RTree::Data *> mDataList;
86 QLinkedListIterator<RTree::Data *> mIt;
104 , mSrcPoint( srcPoint )
108 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
109 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
115 int vertexIndex, beforeVertex, afterVertex;
124 if ( mFilter && !mFilter->acceptMatch( m ) )
127 if ( !mBest.isValid() || m.
distance() < mBest.distance() )
159 , mSrcPoint( srcPoint )
163 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
164 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
175 if ( mFilter && !mFilter->acceptMatch( m ) )
178 if ( !mBest.isValid() || m.
distance() < mBest.distance() )
211 , mSrcPoint( srcPoint )
215 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
216 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
229 edgePoints[0] = geom->
vertexAt( afterVertex - 1 );
230 edgePoints[1] = geom->
vertexAt( afterVertex );
231 pt =
QgsPointXY( ( edgePoints[0].x() + edgePoints[1].x() ) / 2.0, ( edgePoints[0].y() + edgePoints[1].y() ) / 2.0 );
235 if ( mFilter && !mFilter->acceptMatch( m ) )
238 if ( !mBest.isValid() || m.
distance() < mBest.distance() )
269 , mSrcPoint( srcPoint )
273 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
274 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
279 const QgsGeometry *geom = mLocator->mGeoms.value(
id );
282 int bestVertexNumber = -1;
283 auto replaceIfBetter = [
this, &bestPoint, &bestVertexNumber](
const QgsPoint & candidate,
int vertexNumber )
285 if ( bestPoint.
isEmpty() || candidate.distanceSquared( mSrcPoint.x(), mSrcPoint.y() ) < bestPoint.
sqrDist( mSrcPoint ) )
288 bestVertexNumber = vertexNumber;
301 int partStartVertexNum = 0;
304 if (
const QgsCurve *curve = qgsgeometry_cast< const QgsCurve * >( *partIt ) )
306 replaceIfBetter( curve->startPoint(), partStartVertexNum );
307 replaceIfBetter( curve->endPoint(), partStartVertexNum + curve->numPoints() - 1 );
308 partStartVertexNum += curve->numPoints();
316 int partStartVertexNum = 0;
319 if (
const QgsCurvePolygon *polygon = qgsgeometry_cast< const QgsCurvePolygon * >( *partIt ) )
321 if ( polygon->exteriorRing() )
323 replaceIfBetter( polygon->exteriorRing()->startPoint(), partStartVertexNum );
324 partStartVertexNum += polygon->exteriorRing()->numPoints();
326 for (
int i = 0; i < polygon->numInteriorRings(); ++i )
328 const QgsCurve *ring = polygon->interiorRing( i );
329 replaceIfBetter( ring->
startPoint(), partStartVertexNum );
340 if ( mFilter && !mFilter->acceptMatch( m ) )
343 if ( !mBest.isValid() || m.
distance() < mBest.distance() )
369 , mSrcPoint( srcPoint )
373 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
374 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
387 edgePoints[0] = geom->
vertexAt( afterVertex - 1 );
388 edgePoints[1] = geom->
vertexAt( afterVertex );
391 if ( mFilter && !mFilter->acceptMatch( m ) )
394 if ( !mBest.isValid() || m.
distance() < mBest.distance() )
423 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
424 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
450 static const int INSIDE = 0;
453 static const int BOTTOM = 4;
454 static const int TOP = 8;
475 OutCode outcode0 = computeOutCode( x0, y0 );
476 OutCode outcode1 = computeOutCode( x1, y1 );
481 if ( !( outcode0 | outcode1 ) )
487 else if ( outcode0 & outcode1 )
499 const OutCode outcodeOut = outcode0 ? outcode0 : outcode1;
503 if ( outcodeOut & TOP )
506 x = x0 + ( x1 - x0 ) * ( mRect.
yMaximum() - y0 ) / ( y1 - y0 );
509 else if ( outcodeOut & BOTTOM )
512 x = x0 + ( x1 - x0 ) * ( mRect.
yMinimum() - y0 ) / ( y1 - y0 );
515 else if ( outcodeOut &
RIGHT )
518 y = y0 + ( y1 - y0 ) * ( mRect.
xMaximum() - x0 ) / ( x1 - x0 );
521 else if ( outcodeOut &
LEFT )
524 y = y0 + ( y1 - y0 ) * ( mRect.
xMinimum() - x0 ) / ( x1 - x0 );
532 if ( outcodeOut == outcode0 )
536 outcode0 = computeOutCode( x0, y0 );
542 outcode1 = computeOutCode( x1, y1 );
577 QgsCurve *curve = qgsgeometry_cast<QgsCurve *>( *part );
585 while ( it != ( *part )->vertices_end() )
588 if ( cs.isSegmentInRect( prevPoint.x(), prevPoint.y(), thisPoint.x(), thisPoint.y() ) )
591 edgePoints[0] = prevPoint;
592 edgePoints[1] = thisPoint;
615 , mSrcRect( srcRect )
619 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
620 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
627 const auto segmentsInRect {_geometrySegmentsInRect( geom, mSrcRect, mLocator->mLayer,
id )};
631 if ( mFilter && !mFilter->acceptMatch( m ) )
660 , mSrcRect( srcRect )
664 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
665 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
670 const QgsGeometry *geom = mLocator->mGeoms.value(
id );
674 if ( mSrcRect.contains( *it ) )
679 if ( mFilter && !mFilter->acceptMatch( m ) )
707 , mSrcRect( srcRect )
711 void visitNode(
const INode &n )
override { Q_UNUSED( n ); }
712 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ); }
717 const QgsGeometry *geom = mLocator->mGeoms.value(
id );
719 if ( mSrcRect.contains(
centroid ) )
724 if ( !( mFilter && !mFilter->acceptMatch( m ) ) )
749 , mSrcRect( srcRect )
753 void visitNode(
const INode &n )
override { Q_UNUSED( n ); }
754 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ); }
759 const QgsGeometry *geom = mLocator->mGeoms.value(
id );
766 for ( ; it != geom->
vertices_end(); ++it, ++itPrevious )
768 const QgsPointXY pt( ( ( *itPrevious ).x() + ( *it ).x() ) / 2.0, ( ( *itPrevious ).y() + ( *it ).y() ) / 2.0 );
769 if ( mSrcRect.contains( pt ) )
774 if ( mFilter && !mFilter->acceptMatch( m ) )
805 void getNextEntry(
const IEntry &entry, id_type &nextEntry,
bool &hasNext )
override
807 const INode *n =
dynamic_cast<const INode *
>( &entry );
811 QgsDebugMsgLevel( QStringLiteral(
"NODE: %1" ).arg( n->getIdentifier() ), 4 );
812 if ( n->getLevel() > 0 )
815 for ( uint32_t cChild = 0; cChild < n->getChildrenCount(); cChild++ )
817 QgsDebugMsgLevel( QStringLiteral(
"- CH: %1" ).arg( n->getChildIdentifier( cChild ) ), 4 );
818 ids.push( n->getChildIdentifier( cChild ) );
824 for ( uint32_t cChild = 0; cChild < n->getChildrenCount(); cChild++ )
826 QgsDebugMsgLevel( QStringLiteral(
"- L: %1" ).arg( n->getChildIdentifier( cChild ) ), 4 );
832 nextEntry = ids.back();
854 mStorage.reset( StorageManager::createNewMemoryStorageManager() );
867 mIsDestroying =
true;
899 mContext.reset(
nullptr );
903 mContext = std::unique_ptr<QgsRenderContext>(
new QgsRenderContext( *context ) );
909 void QgsPointLocator::onInitTaskFinished()
925 onFeatureAdded( fid );
926 mAddedFeatures.clear();
929 onFeatureDeleted( fid );
930 mDeletedFeatures.clear();
960 connect( mInitTask, &QgsPointLocatorInitTask::taskTerminated,
this, &QgsPointLocator::onInitTaskFinished );
961 connect( mInitTask, &QgsPointLocatorInitTask::taskCompleted,
this, &QgsPointLocator::onInitTaskFinished );
976 mInitTask->waitForFinished();
978 if ( !mIsDestroying )
979 onInitTaskFinished();
984 return mIsIndexing || mRTree || mIsEmptyLayer;
987 bool QgsPointLocator::prepare(
bool relaxed )
1000 if ( ( relaxed && mIsIndexing ) || !mRTree )
1012 QgsDebugMsgLevel( QStringLiteral(
"RebuildIndex start : %1" ).arg( mSource->id() ), 2 );
1016 QLinkedList<RTree::Data *> dataList;
1037 QgsDebugMsg( QStringLiteral(
"could not transform bounding box to map, skipping the snap filter (%1)" ).arg( e.
what() ) );
1043 bool filter =
false;
1047 ctx = mContext.get();
1051 mRenderer->startRender( *ctx, mSource->fields() );
1058 int indexedCount = 0;
1065 if ( filter && ctx && mRenderer )
1068 if ( !mRenderer->willRenderFeature( f, *ctx ) )
1079 transformedGeometry.
transform( mTransform );
1086 QgsDebugMsg( QStringLiteral(
"could not transform geometry to map, skipping the snap for it (%1)" ).arg( e.
what() ) );
1094 SpatialIndex::Region r( rect2region( bbox ) );
1095 dataList <<
new RTree::Data( 0,
nullptr, r, f.
id() );
1097 if ( mGeoms.contains( f.
id() ) )
1098 delete mGeoms.take( f.
id() );
1103 if ( maxFeaturesToIndex != -1 && indexedCount > maxFeaturesToIndex )
1105 qDeleteAll( dataList );
1112 const double fillFactor = 0.7;
1113 const unsigned long indexCapacity = 10;
1114 const unsigned long leafCapacity = 10;
1115 const unsigned long dimension = 2;
1116 const RTree::RTreeVariant variant = RTree::RV_RSTAR;
1117 SpatialIndex::id_type indexId;
1119 if ( dataList.isEmpty() )
1121 mIsEmptyLayer =
true;
1126 mRTree.reset( RTree::createAndBulkLoadNewRTree( RTree::BLM_STR, stream, *mStorage, fillFactor, indexCapacity,
1127 leafCapacity, dimension, variant, indexId ) );
1129 if ( ctx && mRenderer )
1131 mRenderer->stopRender( *ctx );
1134 QgsDebugMsgLevel( QStringLiteral(
"RebuildIndex end : %1 ms (%2)" ).arg( t.elapsed() ).arg( mSource->id() ), 2 );
1144 mIsEmptyLayer =
false;
1146 qDeleteAll( mGeoms );
1151 void QgsPointLocator::onFeatureAdded(
QgsFeatureId fid )
1156 mAddedFeatures << fid;
1162 if ( mIsEmptyLayer )
1165 mIsEmptyLayer =
false;
1179 std::unique_ptr< QgsFeatureRenderer > renderer( mLayer->
renderer() ? mLayer->
renderer()->
clone() :
nullptr );
1183 ctx = mContext.get();
1184 if ( renderer && ctx )
1187 renderer->startRender( *ctx, mLayer->
fields() );
1190 if ( !renderer->willRenderFeature( f, *ctx ) )
1195 renderer->stopRender( *ctx );
1206 transformedGeom.
transform( mTransform );
1213 QgsDebugMsg( QStringLiteral(
"could not transform geometry to map, skipping the snap for it (%1)" ).arg( e.
what() ) );
1221 const SpatialIndex::Region r( rect2region( bbox ) );
1222 mRTree->insertData( 0,
nullptr, r, f.
id() );
1224 if ( mGeoms.contains( f.
id() ) )
1225 delete mGeoms.take( f.
id() );
1231 void QgsPointLocator::onFeatureDeleted(
QgsFeatureId fid )
1235 if ( mAddedFeatures.contains( fid ) )
1237 mAddedFeatures.remove( fid );
1242 mDeletedFeatures << fid;
1250 if ( mGeoms.contains( fid ) )
1252 mRTree->deleteData( rect2region( mGeoms[fid]->boundingBox() ), fid );
1253 delete mGeoms.take( fid );
1261 onFeatureDeleted( fid );
1262 onFeatureAdded( fid );
1265 void QgsPointLocator::onAttributeValueChanged(
QgsFeatureId fid,
int idx,
const QVariant &value )
1271 onFeatureDeleted( fid );
1272 onFeatureAdded( fid );
1279 if ( !prepare( relaxed ) )
1284 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1285 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1293 if ( !prepare( relaxed ) )
1299 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1300 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1308 if ( !prepare( relaxed ) )
1314 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1315 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1323 if ( !prepare( relaxed ) )
1329 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1330 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1338 if ( !prepare( relaxed ) )
1347 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1348 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1356 if ( !prepare( relaxed ) )
1360 if ( !mlist.isEmpty() && mlist.at( 0 ).isValid() )
1362 return mlist.at( 0 );
1365 if ( tolerance == 0 )
1386 if ( !prepare( relaxed ) )
1395 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1402 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1408 if ( !prepare( relaxed ) )
1413 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1420 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1426 if ( !prepare( relaxed ) )
1435 mRTree->intersectsWithQuery( point2point( point ), visitor );
The part_iterator class provides STL-style iterator for const references to geometry parts.
The vertex_iterator class provides STL-style iterator for vertices.
QgsVertexId vertexId() const
Returns vertex ID of the current item.
virtual bool hasCurvedSegments() const
Returns true if the geometry contains curved segments.
static QgsTaskManager * taskManager()
Returns the application's task manager, used for managing application wide background task handling.
This class represents a coordinate reference system (CRS).
bool isValid() const
Returns whether this CRS is correctly initialized and usable.
Contains information about the context in which a coordinate transform is executed.
Curve polygon geometry type.
Abstract base class for curved geometry type.
virtual int numPoints() const =0
Returns the number of points in the curve.
virtual QgsPoint startPoint() const =0
Returns the starting point of the curve.
virtual bool isValid() const =0
Returns true if this is a valid layer.
Defines a QGIS exception class.
static QgsExpressionContextScope * layerScope(const QgsMapLayer *layer)
Creates a new scope which contains variables and functions relating to a QgsMapLayer.
void setFeature(const QgsFeature &feature)
Convenience function for setting a feature for the context.
Wrapper for iterator of features from vector data provider or vector layer.
bool nextFeature(QgsFeature &f)
virtual QgsFeatureRenderer * clone() const =0
Create a deep copy of this renderer.
@ Filter
Features may be filtered, i.e. some features may not be rendered (categorized, rule based ....
This class wraps a request for features to a vector layer (or directly its vector data provider).
QgsFeatureRequest & setSubsetOfAttributes(const QgsAttributeList &attrs)
Set a subset of attributes that will be fetched.
QgsFeatureRequest & setNoAttributes()
Set that no attributes will be fetched.
QgsFeatureRequest & setFilterRect(const QgsRectangle &rectangle)
Sets the rectangle from which features will be taken.
The feature class encapsulates a single feature including its unique ID, geometry and a list of field...
bool hasGeometry() const
Returns true if the feature has an associated geometry.
void setGeometry(const QgsGeometry &geometry)
Set the feature's geometry.
A geometry is the spatial representation of a feature.
QgsWkbTypes::Type wkbType() const SIP_HOLDGIL
Returns type of the geometry as a WKB type (point / linestring / polygon etc.)
QgsAbstractGeometry::const_part_iterator const_parts_begin() const
Returns STL-style const iterator pointing to the first part of the geometry.
Qgis::GeometryOperationResult transform(const QgsCoordinateTransform &ct, Qgis::TransformDirection direction=Qgis::TransformDirection::Forward, bool transformZ=false) SIP_THROW(QgsCsException)
Transforms this geometry as described by the coordinate transform ct.
QgsPoint vertexAt(int atVertex) const
Returns coordinates of a vertex.
QgsPointXY closestVertex(const QgsPointXY &point, int &closestVertexIndex, int &previousVertexIndex, int &nextVertexIndex, double &sqrDist) const
Returns the vertex closest to the given point, the corresponding vertex index, squared distance snap ...
bool isMultipart() const SIP_HOLDGIL
Returns true if WKB of the geometry is of WKBMulti* type.
QgsGeometry convertToType(QgsWkbTypes::GeometryType destType, bool destMultipart=false) const
Try to convert the geometry to the requested type.
QgsPointXY asPoint() const
Returns the contents of the geometry as a 2-dimensional point.
QgsWkbTypes::GeometryType type
void convertToStraightSegment(double tolerance=M_PI/180., QgsAbstractGeometry::SegmentationToleranceType toleranceType=QgsAbstractGeometry::MaximumAngle)
Converts the geometry to straight line segments, if it is a curved geometry type.
QgsGeometry centroid() const
Returns the center of mass of a geometry.
bool isEmpty() const
Returns true if the geometry is empty (eg a linestring with no vertices, or a collection with no geom...
int vertexNrFromVertexId(QgsVertexId id) const
Returns the vertex number corresponding to a vertex id.
QgsAbstractGeometry::const_part_iterator const_parts_end() const
Returns STL-style iterator pointing to the imaginary part after the last part of the geometry.
QgsAbstractGeometry::vertex_iterator vertices_begin() const
Returns STL-style iterator pointing to the first vertex of the geometry.
QgsRectangle boundingBox() const
Returns the bounding box of the geometry.
double closestSegmentWithContext(const QgsPointXY &point, QgsPointXY &minDistPoint, int &nextVertexIndex, int *leftOrRightOfSegment=nullptr, double epsilon=DEFAULT_SEGMENT_EPSILON) const
Searches for the closest segment of geometry to the given point.
bool intersects(const QgsRectangle &rectangle) const
Returns true if this geometry exactly intersects with a rectangle.
QgsAbstractGeometry::vertex_iterator vertices_end() const
Returns STL-style iterator pointing to the imaginary vertex after the last vertex of the geometry.
QgsCoordinateReferenceSystem crs
void styleChanged()
Signal emitted whenever a change affects the layer's style.
void dataChanged()
Data of layer changed.
Helper class to dump the R-index nodes and their content.
void getNextEntry(const IEntry &entry, id_type &nextEntry, bool &hasNext) override
Helper class for bulk loading of R-trees.
IData * getNext() override
QgsPointLocator_Stream(const QLinkedList< RTree::Data * > &dataList)
Helper class used when traversing the index with areas - builds a list of matches.
void visitNode(const INode &n) override
void visitData(const IData &d) override
void visitData(std::vector< const IData * > &v) override
QgsPointLocator_VisitorArea(QgsPointLocator *pl, const QgsPointXY &origPt, QgsPointLocator::MatchList &list)
constructor
Helper class used when traversing the index looking for centroid - builds a list of matches.
QgsPointLocator_VisitorCentroidsInRect(QgsPointLocator *pl, QgsPointLocator::MatchList &lst, const QgsRectangle &srcRect, QgsPointLocator::MatchFilter *filter=nullptr)
Constructs the visitor.
void visitData(const IData &d) override
void visitData(std::vector< const IData * > &v) override
void visitNode(const INode &n) override
Helper class used when traversing the index looking for edges - builds a list of matches.
void visitData(std::vector< const IData * > &v) override
QgsPointLocator_VisitorEdgesInRect(QgsPointLocator *pl, QgsPointLocator::MatchList &lst, const QgsRectangle &srcRect, QgsPointLocator::MatchFilter *filter=nullptr)
void visitNode(const INode &n) override
void visitData(const IData &d) override
Helper class used when traversing the index looking for middle segment - builds a list of matches.
void visitData(std::vector< const IData * > &v) override
void visitNode(const INode &n) override
void visitData(const IData &d) override
QgsPointLocator_VisitorMiddlesInRect(QgsPointLocator *pl, QgsPointLocator::MatchList &lst, const QgsRectangle &srcRect, QgsPointLocator::MatchFilter *filter=nullptr)
Constructs the visitor.
Helper class used when traversing the index looking for centroid - builds a list of matches.
void visitData(const IData &d) override
void visitNode(const INode &n) override
void visitData(std::vector< const IData * > &v) override
Helper class used when traversing the index looking for edges - builds a list of matches.
QgsPointLocator_VisitorNearestEdge(QgsPointLocator *pl, QgsPointLocator::Match &m, const QgsPointXY &srcPoint, QgsPointLocator::MatchFilter *filter=nullptr)
void visitData(const IData &d) override
void visitData(std::vector< const IData * > &v) override
void visitNode(const INode &n) override
Helper class used when traversing the index looking for line endpoints (start or end vertex) - builds...
void visitData(std::vector< const IData * > &v) override
void visitNode(const INode &n) override
void visitData(const IData &d) override
Helper class used when traversing the index looking for middle segment - builds a list of matches.
void visitData(std::vector< const IData * > &v) override
void visitData(const IData &d) override
void visitNode(const INode &n) override
Helper class used when traversing the index looking for vertices - builds a list of matches.
void visitData(const IData &d) override
void visitNode(const INode &n) override
void visitData(std::vector< const IData * > &v) override
QgsPointLocator_VisitorNearestVertex(QgsPointLocator *pl, QgsPointLocator::Match &m, const QgsPointXY &srcPoint, QgsPointLocator::MatchFilter *filter=nullptr)
Helper class used when traversing the index looking for vertices - builds a list of matches.
void visitData(const IData &d) override
void visitNode(const INode &n) override
void visitData(std::vector< const IData * > &v) override
QgsPointLocator_VisitorVerticesInRect(QgsPointLocator *pl, QgsPointLocator::MatchList &lst, const QgsRectangle &srcRect, QgsPointLocator::MatchFilter *filter=nullptr)
Constructs the visitor.
The class defines interface for querying point location:
const QgsRectangle * extent() const
Gets extent of the area point locator covers - if nullptr then it caches the whole layer.
friend class QgsPointLocatorInitTask
MatchList pointInPolygon(const QgsPointXY &point, bool relaxed=false)
find out if the point is in any polygons This method is either blocking or non blocking according to ...
Match nearestEdge(const QgsPointXY &point, double tolerance, QgsPointLocator::MatchFilter *filter=nullptr, bool relaxed=false)
Find nearest edge to the specified point - up to distance specified by tolerance Optional filter may ...
void setRenderContext(const QgsRenderContext *context)
Configure render context - if not nullptr, it will use to index only visible feature.
QgsCoordinateReferenceSystem destinationCrs() const
Gets destination CRS - may be an invalid QgsCoordinateReferenceSystem if not doing OTF reprojection.
void setExtent(const QgsRectangle *extent)
Configure extent - if not nullptr, it will index only that area.
bool init(int maxFeaturesToIndex=-1, bool relaxed=false)
Prepare the index for queries.
MatchList verticesInRect(const QgsRectangle &rect, QgsPointLocator::MatchFilter *filter=nullptr, bool relaxed=false)
Find vertices within a specified rectangle This method is either blocking or non blocking according t...
class QList< QgsPointLocator::Match > MatchList
Match nearestVertex(const QgsPointXY &point, double tolerance, QgsPointLocator::MatchFilter *filter=nullptr, bool relaxed=false)
Find nearest vertex to the specified point - up to distance specified by tolerance Optional filter ma...
QgsVectorLayer * layer() const
Gets associated layer.
MatchList edgesInRect(const QgsRectangle &rect, QgsPointLocator::MatchFilter *filter=nullptr, bool relaxed=false)
Find edges within a specified rectangle Optional filter may discard unwanted matches.
bool hasIndex() const
Indicate whether the data have been already indexed.
Match nearestMiddleOfSegment(const QgsPointXY &point, double tolerance, QgsPointLocator::MatchFilter *filter=nullptr, bool relaxed=false)
Find nearest middle of segment to the specified point - up to distance specified by tolerance Optiona...
void waitForIndexingFinished()
If the point locator has been initialized relaxedly and is currently indexing, this methods waits for...
Match nearestCentroid(const QgsPointXY &point, double tolerance, QgsPointLocator::MatchFilter *filter=nullptr, bool relaxed=false)
Find nearest centroid to the specified point - up to distance specified by tolerance Optional filter ...
void initFinished(bool ok)
Emitted whenever index has been built and initialization is finished.
bool rebuildIndex(int maxFeaturesToIndex=-1)
Match nearestArea(const QgsPointXY &point, double tolerance, QgsPointLocator::MatchFilter *filter=nullptr, bool relaxed=false)
Find nearest area to the specified point - up to distance specified by tolerance Optional filter may ...
@ Area
Snapped to an area.
@ MiddleOfSegment
Snapped to the middle of a segment.
@ Vertex
Snapped to a vertex. Can be a vertex of the geometry or an intersection.
@ Centroid
Snapped to a centroid.
@ Edge
Snapped to an edge.
@ LineEndpoint
Start or end points of lines only (since QGIS 3.20)
QgsPointLocator(QgsVectorLayer *layer, const QgsCoordinateReferenceSystem &destinationCrs=QgsCoordinateReferenceSystem(), const QgsCoordinateTransformContext &transformContext=QgsCoordinateTransformContext(), const QgsRectangle *extent=nullptr)
Construct point locator for a layer.
~QgsPointLocator() override
Match nearestLineEndpoints(const QgsPointXY &point, double tolerance, QgsPointLocator::MatchFilter *filter=nullptr, bool relaxed=false)
Find nearest line endpoint (start or end vertex) to the specified point - up to distance specified by...
A class to represent a 2D point.
bool isEmpty() const SIP_HOLDGIL
Returns true if the geometry is empty.
double sqrDist(double x, double y) const SIP_HOLDGIL
Returns the squared distance between this point a specified x, y coordinate.
Point geometry type, with support for z-dimension and m-values.
A rectangle specified with double values.
double yMaximum() const SIP_HOLDGIL
Returns the y maximum value (top side of rectangle).
double xMaximum() const SIP_HOLDGIL
Returns the x maximum value (right side of rectangle).
double xMinimum() const SIP_HOLDGIL
Returns the x minimum value (left side of rectangle).
double yMinimum() const SIP_HOLDGIL
Returns the y minimum value (bottom side of rectangle).
bool isFinite() const
Returns true if the rectangle has finite boundaries.
Contains information about the context of a rendering operation.
QgsExpressionContext & expressionContext()
Gets the expression context.
long addTask(QgsTask *task, int priority=0)
Adds a task to the manager.
Partial snapshot of vector layer's state (only the members necessary for access to features)
Represents a vector layer which manages a vector based data sets.
Q_INVOKABLE QgsWkbTypes::GeometryType geometryType() const
Returns point, line or polygon.
QgsFeatureIterator getFeatures(const QgsFeatureRequest &request=QgsFeatureRequest()) const FINAL
Queries the layer for features specified in request.
QgsFields fields() const FINAL
Returns the list of fields of this layer.
QgsVectorDataProvider * dataProvider() FINAL
Returns the layer's data provider, it may be nullptr.
void attributeValueChanged(QgsFeatureId fid, int idx, const QVariant &value)
Emitted whenever an attribute value change is done in the edit buffer.
void featureAdded(QgsFeatureId fid)
Emitted when a new feature has been added to the layer.
void featureDeleted(QgsFeatureId fid)
Emitted when a feature has been deleted.
void geometryChanged(QgsFeatureId fid, const QgsGeometry &geometry)
Emitted whenever a geometry change is done in the edit buffer.
QgsFeatureRenderer * renderer()
Returns the feature renderer used for rendering the features in the layer in 2D map views.
static GeometryType geometryType(Type type) SIP_HOLDGIL
Returns the geometry type for a WKB type, e.g., both MultiPolygon and CurvePolygon would have a Polyg...
GeometryType
The geometry types are used to group QgsWkbTypes::Type in a coarse way.
QgsPointLocator_VisitorNearestCentroid(QgsPointLocator *pl, QgsPointLocator::Match &m, const QgsPointXY &srcPoint, QgsPointLocator::MatchFilter *filter=nullptr)
Helper class used when traversing the index looking for centroid - builds a list of matches.
QgsPointLocator_VisitorNearestMiddleOfSegment(QgsPointLocator *pl, QgsPointLocator::Match &m, const QgsPointXY &srcPoint, QgsPointLocator::MatchFilter *filter=nullptr)
Helper class used when traversing the index looking for middle segment - builds a list of matches.
QgsPointLocator_VisitorNearestLineEndpoint(QgsPointLocator *pl, QgsPointLocator::Match &m, const QgsPointXY &srcPoint, QgsPointLocator::MatchFilter *filter=nullptr)
Helper class used when traversing the index looking for line endpoints (start or end vertex) - builds...
CORE_EXPORT QgsMeshVertex centroid(const QgsMeshFace &face, const QVector< QgsMeshVertex > &vertices)
Returns the centroid of the face.
qint64 QgsFeatureId
64 bit feature ids negative numbers are used for uncommitted/newly added features
#define QgsDebugMsgLevel(str, level)
Interface that allows rejection of some matches in intersection queries (e.g.
QgsVectorLayer * layer() const
The vector layer where the snap occurred.
QgsFeatureId featureId() const
The id of the feature to which the snapped geometry belongs.
double distance() const
for vertex / edge match units depending on what class returns it (geom.cache: layer units,...
QgsPointXY point() const
for vertex / edge match coords depending on what class returns it (geom.cache: layer coords,...
OutCode computeOutCode(double x, double y)
bool isSegmentInRect(double x0, double y0, double x1, double y1)
_CohenSutherland(const QgsRectangle &rect)