#include "qgstracer.h"#include "moc_qgstracer.cpp"#include "qgsfeatureiterator.h"#include "qgsgeometry.h"#include "qgsgeometryutils.h"#include "qgsgeos.h"#include "qgslogger.h"#include "qgsvectorlayer.h"#include "qgsrenderer.h"#include "qgssettingsregistrycore.h"#include "qgsexpressioncontextutils.h"#include "qgsrendercontext.h"#include "qgssettingsentryimpl.h"#include <queue>#include <vector>
Include dependency graph for qgstracer.cpp:
Go to the source code of this file.
Classes | |
| struct | comp |
| struct | QgsTracerGraph::E |
| struct | QgsTracerGraph |
| Simple graph structure for shortest path search. More... | |
| struct | QgsTracerGraph::V |
Typedefs | |
| typedef std::pair< int, double > | DijkstraQueueItem |
Functions | |
| double | closestSegment (const QgsPolylineXY &pl, const QgsPointXY &pt, int &vertexAfter, double epsilon) |
| double | distance2D (const QgsPolylineXY &coords) |
| void | extractLinework (const QgsGeometry &g, QgsMultiPolylineXY &mpl) |
| int | joinVertexToGraph (QgsTracerGraph &g, const QgsPointXY &pt) |
| QgsTracerGraph * | makeGraph (const QVector< QgsPolylineXY > &edges) |
| int | point2edge (const QgsTracerGraph &g, const QgsPointXY &pt, int &lineVertexAfter, double epsilon=1e-6) |
| int | point2vertex (const QgsTracerGraph &g, const QgsPointXY &pt, double epsilon=1e-6) |
| int | pointInGraph (QgsTracerGraph &g, const QgsPointXY &pt) |
| void | resetGraph (QgsTracerGraph &g) |
| QVector< QgsPointXY > | shortestPath (const QgsTracerGraph &g, int v1, int v2) |
| void | splitLinestring (const QgsPolylineXY &points, const QgsPointXY &pt, int lineVertexAfter, QgsPolylineXY &pts1, QgsPolylineXY &pts2) |
Typedef Documentation
◆ DijkstraQueueItem
| typedef std::pair<int, double> DijkstraQueueItem |
Definition at line 35 of file qgstracer.cpp.
Function Documentation
◆ closestSegment()
| double closestSegment | ( | const QgsPolylineXY & | pl, |
| const QgsPointXY & | pt, | ||
| int & | vertexAfter, | ||
| double | epsilon | ||
| ) |
Definition at line 70 of file qgstracer.cpp.
◆ distance2D()
| double distance2D | ( | const QgsPolylineXY & | coords | ) |
Definition at line 48 of file qgstracer.cpp.
◆ extractLinework()
| void extractLinework | ( | const QgsGeometry & | g, |
| QgsMultiPolylineXY & | mpl | ||
| ) |
Definition at line 414 of file qgstracer.cpp.
◆ joinVertexToGraph()
| int joinVertexToGraph | ( | QgsTracerGraph & | g, |
| const QgsPointXY & | pt | ||
| ) |
Definition at line 315 of file qgstracer.cpp.
◆ makeGraph()
| QgsTracerGraph * makeGraph | ( | const QVector< QgsPolylineXY > & | edges | ) |
Definition at line 131 of file qgstracer.cpp.
◆ point2edge()
| int point2edge | ( | const QgsTracerGraph & | g, |
| const QgsPointXY & | pt, | ||
| int & | lineVertexAfter, | ||
| double | epsilon = 1e-6 |
||
| ) |
Definition at line 278 of file qgstracer.cpp.
◆ point2vertex()
| int point2vertex | ( | const QgsTracerGraph & | g, |
| const QgsPointXY & | pt, | ||
| double | epsilon = 1e-6 |
||
| ) |
Definition at line 263 of file qgstracer.cpp.
◆ pointInGraph()
| int pointInGraph | ( | QgsTracerGraph & | g, |
| const QgsPointXY & | pt | ||
| ) |
Definition at line 368 of file qgstracer.cpp.
◆ resetGraph()
| void resetGraph | ( | QgsTracerGraph & | g | ) |
Definition at line 380 of file qgstracer.cpp.
◆ shortestPath()
| QVector< QgsPointXY > shortestPath | ( | const QgsTracerGraph & | g, |
| int | v1, | ||
| int | v2 | ||
| ) |
Definition at line 185 of file qgstracer.cpp.
◆ splitLinestring()
| void splitLinestring | ( | const QgsPolylineXY & | points, |
| const QgsPointXY & | pt, | ||
| int | lineVertexAfter, | ||
| QgsPolylineXY & | pts1, | ||
| QgsPolylineXY & | pts2 | ||
| ) |
Definition at line 298 of file qgstracer.cpp.
