17#include "moc_qgspointlocator.cpp"
33#include <spatialindex/SpatialIndex.h>
35#include <QLinkedListIterator>
36#include <QtConcurrent>
42static SpatialIndex::Point point2point(
const QgsPointXY &point )
44 double plow[2] = { point.
x(), point.
y() };
45 return Point( plow, 2 );
49static SpatialIndex::Region rect2region(
const QgsRectangle &rect )
53 return SpatialIndex::Region( pLow, pHigh, 2 );
61static const double POINT_LOC_EPSILON = 1e-12;
75 : mDataList( dataList )
79 IData *
getNext()
override {
return mIt.next(); }
80 bool hasNext()
override {
return mIt.hasNext(); }
82 uint32_t
size()
override { Q_ASSERT(
false &&
"not available" );
return 0; }
83 void rewind()
override { Q_ASSERT(
false &&
"not available" ); }
86 QLinkedList<RTree::Data *> mDataList;
87 QLinkedListIterator<RTree::Data *> mIt;
105 , mSrcPoint( srcPoint )
109 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
110 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
118 int vertexIndex, beforeVertex, afterVertex;
162 , mSrcPoint( srcPoint )
166 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
167 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
216 , mSrcPoint( srcPoint )
220 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
221 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
237 edgePoints[0] = geom->
vertexAt( afterVertex - 1 );
238 edgePoints[1] = geom->
vertexAt( afterVertex );
239 pt =
QgsPointXY( ( edgePoints[0].x() + edgePoints[1].x() ) / 2.0, ( edgePoints[0].y() + edgePoints[1].y() ) / 2.0 );
277 , mSrcPoint( srcPoint )
281 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
282 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
287 const QgsGeometry *geom = mLocator->mGeoms.value(
id );
292 int bestVertexNumber = -1;
293 auto replaceIfBetter = [
this, &bestPoint, &bestVertexNumber](
const QgsPoint & candidate,
int vertexNumber )
295 if ( bestPoint.
isEmpty() || candidate.distanceSquared( mSrcPoint.
x(), mSrcPoint.
y() ) < bestPoint.
sqrDist( mSrcPoint ) )
298 bestVertexNumber = vertexNumber;
311 int partStartVertexNum = 0;
314 if (
const QgsCurve *curve = qgsgeometry_cast< const QgsCurve * >( *partIt ) )
316 replaceIfBetter( curve->startPoint(), partStartVertexNum );
317 replaceIfBetter( curve->endPoint(), partStartVertexNum + curve->numPoints() - 1 );
318 partStartVertexNum += curve->numPoints();
326 int partStartVertexNum = 0;
329 if (
const QgsCurvePolygon *polygon = qgsgeometry_cast< const QgsCurvePolygon * >( *partIt ) )
331 if ( polygon->exteriorRing() )
333 replaceIfBetter( polygon->exteriorRing()->startPoint(), partStartVertexNum );
334 partStartVertexNum += polygon->exteriorRing()->numPoints();
336 for (
int i = 0; i < polygon->numInteriorRings(); ++i )
338 const QgsCurve *ring = polygon->interiorRing( i );
339 replaceIfBetter( ring->
startPoint(), partStartVertexNum );
379 , mSrcPoint( srcPoint )
383 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
384 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
400 edgePoints[0] = geom->
vertexAt( afterVertex - 1 );
401 edgePoints[1] = geom->
vertexAt( afterVertex );
437 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
438 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
504 if ( !( outcode0 | outcode1 ) )
510 else if ( outcode0 & outcode1 )
522 const OutCode outcodeOut = outcode0 ? outcode0 : outcode1;
526 if ( outcodeOut &
TOP )
529 x = x0 + ( x1 - x0 ) * (
mRect.
yMaximum() - y0 ) / ( y1 - y0 );
532 else if ( outcodeOut &
BOTTOM )
535 x = x0 + ( x1 - x0 ) * (
mRect.
yMinimum() - y0 ) / ( y1 - y0 );
538 else if ( outcodeOut &
RIGHT )
541 y = y0 + ( y1 - y0 ) * (
mRect.
xMaximum() - x0 ) / ( x1 - x0 );
544 else if ( outcodeOut &
LEFT )
547 y = y0 + ( y1 - y0 ) * (
mRect.
xMinimum() - x0 ) / ( x1 - x0 );
555 if ( outcodeOut == outcode0 )
600 QgsCurve *curve = qgsgeometry_cast<QgsCurve *>( *part );
608 while ( it != ( *part )->vertices_end() )
611 if ( cs.isSegmentInRect( prevPoint.x(), prevPoint.y(), thisPoint.x(), thisPoint.y() ) )
614 edgePoints[0] = prevPoint;
615 edgePoints[1] = thisPoint;
638 , mSrcRect( srcRect )
642 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
643 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
652 const auto segmentsInRect {_geometrySegmentsInRect( geom, mSrcRect, mLocator->mLayer,
id )};
685 , mSrcRect( srcRect )
689 void visitNode(
const INode &n )
override { Q_UNUSED( n ) }
690 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ) }
695 const QgsGeometry *geom = mLocator->mGeoms.value(
id );
734 , mSrcRect( srcRect )
738 void visitNode(
const INode &n )
override { Q_UNUSED( n ); }
739 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ); }
744 const QgsGeometry *geom = mLocator->mGeoms.value(
id );
749 if ( mSrcRect.
contains( centroid ) )
779 , mSrcRect( srcRect )
783 void visitNode(
const INode &n )
override { Q_UNUSED( n ); }
784 void visitData( std::vector<const IData *> &v )
override { Q_UNUSED( v ); }
789 const QgsGeometry *geom = mLocator->mGeoms.value(
id );
798 for ( ; it != geom->
vertices_end(); ++it, ++itPrevious )
800 const QgsPointXY pt( ( ( *itPrevious ).x() + ( *it ).x() ) / 2.0, ( ( *itPrevious ).y() + ( *it ).y() ) / 2.0 );
837 void getNextEntry(
const IEntry &entry, id_type &nextEntry,
bool &hasNext )
override
839 const INode *n =
dynamic_cast<const INode *
>( &entry );
843 QgsDebugMsgLevel( QStringLiteral(
"NODE: %1" ).arg( n->getIdentifier() ), 4 );
844 if ( n->getLevel() > 0 )
847 for ( uint32_t cChild = 0; cChild < n->getChildrenCount(); cChild++ )
849 QgsDebugMsgLevel( QStringLiteral(
"- CH: %1" ).arg( n->getChildIdentifier( cChild ) ), 4 );
850 ids.push( n->getChildIdentifier( cChild ) );
856 for ( uint32_t cChild = 0; cChild < n->getChildrenCount(); cChild++ )
858 QgsDebugMsgLevel( QStringLiteral(
"- L: %1" ).arg( n->getChildIdentifier( cChild ) ), 4 );
864 nextEntry = ids.back();
886 mStorage.reset( StorageManager::createNewMemoryStorageManager() );
899 mIsDestroying =
true;
931 mContext.reset(
nullptr );
935 mContext = std::unique_ptr<QgsRenderContext>(
new QgsRenderContext( *context ) );
941void QgsPointLocator::onInitTaskFinished()
943 Q_ASSERT_X( QThread::currentThread() == qApp->thread(),
"QgsPointLocator::onInitTaskFinished",
"was not called on main thread" );
958 for (
const QgsFeatureId fid : std::as_const( mAddedFeatures ) )
959 onFeatureAdded( fid );
960 mAddedFeatures.clear();
962 for (
const QgsFeatureId fid : std::as_const( mDeletedFeatures ) )
963 onFeatureDeleted( fid );
964 mDeletedFeatures.clear();
994 connect( mInitTask, &QgsPointLocatorInitTask::taskTerminated,
this, &QgsPointLocator::onInitTaskFinished );
995 connect( mInitTask, &QgsPointLocatorInitTask::taskCompleted,
this, &QgsPointLocator::onInitTaskFinished );
1002 mIsIndexing =
false;
1011 disconnect( mInitTask, &QgsPointLocatorInitTask::taskTerminated,
this, &QgsPointLocator::onInitTaskFinished );
1012 disconnect( mInitTask, &QgsPointLocatorInitTask::taskCompleted,
this, &QgsPointLocator::onInitTaskFinished );
1013 mInitTask->waitForFinished();
1015 if ( !mIsDestroying )
1016 onInitTaskFinished();
1021 return mIsIndexing || mRTree || mIsEmptyLayer;
1024bool QgsPointLocator::prepare(
bool relaxed )
1036 init( -1, relaxed );
1037 if ( ( relaxed && mIsIndexing ) || !mRTree )
1049 QgsDebugMsgLevel( QStringLiteral(
"RebuildIndex start : %1" ).arg( mSource->id() ), 2 );
1053 QLinkedList<RTree::Data *> dataList;
1074 QgsDebugError( QStringLiteral(
"could not transform bounding box to map, skipping the snap filter (%1)" ).arg( e.
what() ) );
1080 bool filter =
false;
1084 ctx = mContext.get();
1088 mRenderer->startRender( *ctx, mSource->fields() );
1095 int indexedCount = 0;
1102 if ( filter && ctx && mRenderer )
1105 if ( !mRenderer->willRenderFeature( f, *ctx ) )
1116 transformedGeometry.
transform( mTransform );
1123 QgsDebugError( QStringLiteral(
"could not transform geometry to map, skipping the snap for it (%1)" ).arg( e.
what() ) );
1131 SpatialIndex::Region r( rect2region( bbox ) );
1132 dataList <<
new RTree::Data( 0,
nullptr, r, f.
id() );
1134 auto it = mGeoms.find( f.
id() );
1135 if ( it != mGeoms.end() )
1147 if ( maxFeaturesToIndex != -1 && indexedCount > maxFeaturesToIndex )
1149 qDeleteAll( dataList );
1156 const double fillFactor = 0.7;
1157 const unsigned long indexCapacity = 10;
1158 const unsigned long leafCapacity = 10;
1159 const unsigned long dimension = 2;
1160 const RTree::RTreeVariant variant = RTree::RV_RSTAR;
1161 SpatialIndex::id_type indexId;
1163 if ( dataList.isEmpty() )
1165 mIsEmptyLayer =
true;
1170 mRTree.reset( RTree::createAndBulkLoadNewRTree( RTree::BLM_STR, stream, *mStorage, fillFactor, indexCapacity,
1171 leafCapacity, dimension, variant, indexId ) );
1173 if ( ctx && mRenderer )
1175 mRenderer->stopRender( *ctx );
1178 QgsDebugMsgLevel( QStringLiteral(
"RebuildIndex end : %1 ms (%2)" ).arg( t.elapsed() ).arg( mSource->id() ), 2 );
1188 mIsEmptyLayer =
false;
1190 qDeleteAll( mGeoms );
1195void QgsPointLocator::onFeatureAdded(
QgsFeatureId fid )
1200 mAddedFeatures << fid;
1206 if ( mIsEmptyLayer )
1209 mIsEmptyLayer =
false;
1223 std::unique_ptr< QgsFeatureRenderer > renderer( mLayer->
renderer() ? mLayer->
renderer()->
clone() : nullptr );
1227 ctx = mContext.get();
1228 if ( renderer && ctx )
1231 renderer->startRender( *ctx, mLayer->
fields() );
1234 if ( !renderer->willRenderFeature( f, *ctx ) )
1239 renderer->stopRender( *ctx );
1250 transformedGeom.
transform( mTransform );
1257 QgsDebugError( QStringLiteral(
"could not transform geometry to map, skipping the snap for it (%1)" ).arg( e.
what() ) );
1265 const SpatialIndex::Region r( rect2region( bbox ) );
1266 mRTree->insertData( 0,
nullptr, r, f.
id() );
1268 auto it = mGeoms.find( f.
id() );
1269 if ( it != mGeoms.end() )
1282void QgsPointLocator::onFeatureDeleted(
QgsFeatureId fid )
1286 if ( mAddedFeatures.contains( fid ) )
1288 mAddedFeatures.remove( fid );
1293 mDeletedFeatures << fid;
1301 auto it = mGeoms.find( fid );
1302 if ( it != mGeoms.end() )
1304 mRTree->deleteData( rect2region( ( *it )->boundingBox() ), fid );
1314 onFeatureDeleted( fid );
1315 onFeatureAdded( fid );
1318void QgsPointLocator::onAttributeValueChanged(
QgsFeatureId fid,
int idx,
const QVariant &value )
1324 onFeatureDeleted( fid );
1325 onFeatureAdded( fid );
1332 if ( !prepare( relaxed ) )
1337 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1338 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1346 if ( !prepare( relaxed ) )
1352 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1353 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1361 if ( !prepare( relaxed ) )
1367 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1368 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1376 if ( !prepare( relaxed ) )
1382 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1383 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1391 if ( !prepare( relaxed ) )
1400 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1401 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1409 if ( !prepare( relaxed ) )
1413 if ( !mlist.isEmpty() && mlist.at( 0 ).isValid() )
1415 return mlist.at( 0 );
1418 if ( tolerance == 0 )
1439 if ( !prepare( relaxed ) )
1448 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1455 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1461 if ( !prepare( relaxed ) )
1466 mRTree->intersectsWithQuery( rect2region( rect ), visitor );
1473 const QgsRectangle rect( point.
x() - tolerance, point.
y() - tolerance, point.
x() + tolerance, point.
y() + tolerance );
1480 if ( !prepare( relaxed ) )
1489 mRTree->intersectsWithQuery( point2point( point ), visitor );
GeometryType
The geometry types are used to group Qgis::WkbType in a coarse way.
@ Reverse
Reverse/inverse transform (from destination to source)
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)
Fetch next feature and stores in f, returns true on success.
@ Filter
Features may be filtered, i.e. some features may not be rendered (categorized, rule based ....
virtual QgsFeatureRenderer * clone() const =0
Create a deep copy of this renderer.
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.
QgsAbstractGeometry::const_part_iterator const_parts_begin() const
Returns STL-style const iterator pointing to the first part of the geometry.
QgsGeometry convertToType(Qgis::GeometryType destType, bool destMultipart=false) const
Try to convert the geometry to the requested type.
Qgis::GeometryOperationResult transform(const QgsCoordinateTransform &ct, Qgis::TransformDirection direction=Qgis::TransformDirection::Forward, bool transformZ=false)
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 ...
QgsPointXY asPoint() const
Returns the contents of the geometry as a 2-dimensional point.
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.
bool isMultipart() const
Returns true if WKB of the geometry is of WKBMulti* 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.
Qgis::WkbType wkbType() const
Returns type of the geometry as a WKB type (point / linestring / polygon etc.)
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, QgsPointLocator::MatchFilter *filter=nullptr)
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:
friend class QgsPointLocatorInitTask
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.
MatchList pointInPolygon(const QgsPointXY &point, bool relaxed=false, QgsPointLocator::MatchFilter *filter=nullptr)
Find out if the point is in any polygons.
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.
QgsVectorLayer * layer() const
Gets associated layer.
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...
const QgsRectangle * extent() const
Gets extent of the area point locator covers - if nullptr then it caches the whole 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.
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.
double sqrDist(double x, double y) const
Returns the squared distance between this point a specified x, y coordinate.
bool isEmpty() const
Returns true if the geometry is empty.
Point geometry type, with support for z-dimension and m-values.
A rectangle specified with double values.
bool contains(const QgsRectangle &rect) const
Returns true when rectangle contains other 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.
QgsFeatureIterator getFeatures(const QgsFeatureRequest &request=QgsFeatureRequest()) const FINAL
Queries the layer for features specified in request.
QgsFeatureRenderer * renderer()
Returns the feature renderer used for rendering the features in the layer in 2D map views.
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.
Q_INVOKABLE Qgis::GeometryType geometryType() const
Returns point, line or polygon.
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.
static Qgis::GeometryType geometryType(Qgis::WkbType type)
Returns the geometry type for a WKB type, e.g., both MultiPolygon and CurvePolygon would have a Polyg...
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...
qint64 QgsFeatureId
64 bit feature ids negative numbers are used for uncommitted/newly added features
#define QgsDebugMsgLevel(str, level)
#define QgsDebugError(str)
Interface that allows rejection of some matches in intersection queries (e.g.
virtual bool acceptMatch(const QgsPointLocator::Match &match)=0
QgsFeatureId featureId() const
The id of the feature to which the snapped geometry belongs.
QgsVectorLayer * layer() const
The vector layer where the snap occurred.
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)