/
qgsalgorithmprojectpointcartesian.cpp
146 lines (122 loc) · 5.96 KB
/
qgsalgorithmprojectpointcartesian.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
/***************************************************************************
qgsalgorithmprojectpointcartesian.cpp
---------------------
begin : April 2017
copyright : (C) 2017 by Nyall Dawson
email : nyall dot dawson at gmail dot com
***************************************************************************/
/***************************************************************************
* *
* 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 "qgsalgorithmprojectpointcartesian.h"
#include "qgsmultipoint.h"
///@cond PRIVATE
QString QgsProjectPointCartesianAlgorithm::name() const
{
return QStringLiteral( "projectpointcartesian" );
}
QString QgsProjectPointCartesianAlgorithm::displayName() const
{
return QObject::tr( "Project points (Cartesian)" );
}
QStringList QgsProjectPointCartesianAlgorithm::tags() const
{
return QObject::tr( "bearing,azimuth,distance,angle" ).split( ',' );
}
QString QgsProjectPointCartesianAlgorithm::group() const
{
return QObject::tr( "Vector geometry" );
}
QString QgsProjectPointCartesianAlgorithm::groupId() const
{
return QStringLiteral( "vectorgeometry" );
}
QString QgsProjectPointCartesianAlgorithm::outputName() const
{
return QObject::tr( "Projected" );
}
QString QgsProjectPointCartesianAlgorithm::shortHelpString() const
{
return QObject::tr( "This algorithm projects point geometries by a specified distance and bearing (azimuth), creating a new point layer with the projected points.\n\n"
"The distance is specified in layer units, and the bearing in degrees clockwise from North." );
}
QList<int> QgsProjectPointCartesianAlgorithm::inputLayerTypes() const
{
return QList<int>() << QgsProcessing::TypeVectorPoint;
}
QgsProcessing::SourceType QgsProjectPointCartesianAlgorithm::outputLayerType() const
{
return QgsProcessing::TypeVectorPoint;
}
QgsProjectPointCartesianAlgorithm *QgsProjectPointCartesianAlgorithm::createInstance() const
{
return new QgsProjectPointCartesianAlgorithm();
}
void QgsProjectPointCartesianAlgorithm::initParameters( const QVariantMap & )
{
std::unique_ptr< QgsProcessingParameterNumber > bearing = qgis::make_unique< QgsProcessingParameterNumber >( QStringLiteral( "BEARING" ), QObject::tr( "Bearing (degrees from North)" ), QgsProcessingParameterNumber::Double, 0, false );
bearing->setIsDynamic( true );
bearing->setDynamicPropertyDefinition( QgsPropertyDefinition( QStringLiteral( "Bearing" ), QObject::tr( "Bearing (degrees from North)" ), QgsPropertyDefinition::Double ) );
bearing->setDynamicLayerParameterName( QStringLiteral( "INPUT" ) );
addParameter( bearing.release() );
std::unique_ptr< QgsProcessingParameterDistance > distance = qgis::make_unique< QgsProcessingParameterDistance >( QStringLiteral( "DISTANCE" ), QObject::tr( "Distance" ), 1, QStringLiteral( "INPUT" ), false );
distance->setIsDynamic( true );
distance->setDynamicPropertyDefinition( QgsPropertyDefinition( QStringLiteral( "Distance" ), QObject::tr( "Projection distance" ), QgsPropertyDefinition::Double ) );
distance->setDynamicLayerParameterName( QStringLiteral( "INPUT" ) );
addParameter( distance.release() );
}
QgsProcessingFeatureSource::Flag QgsProjectPointCartesianAlgorithm::sourceFlags() const
{
return QgsProcessingFeatureSource::FlagSkipGeometryValidityChecks;
}
bool QgsProjectPointCartesianAlgorithm::prepareAlgorithm( const QVariantMap ¶meters, QgsProcessingContext &context, QgsProcessingFeedback * )
{
mBearing = parameterAsDouble( parameters, QStringLiteral( "BEARING" ), context );
mDynamicBearing = QgsProcessingParameters::isDynamic( parameters, QStringLiteral( "BEARING" ) );
if ( mDynamicBearing )
mBearingProperty = parameters.value( QStringLiteral( "BEARING" ) ).value< QgsProperty >();
mDistance = parameterAsDouble( parameters, QStringLiteral( "DISTANCE" ), context );
mDynamicDistance = QgsProcessingParameters::isDynamic( parameters, QStringLiteral( "DISTANCE" ) );
if ( mDynamicDistance )
mDistanceProperty = parameters.value( QStringLiteral( "DISTANCE" ) ).value< QgsProperty >();
return true;
}
QgsFeatureList QgsProjectPointCartesianAlgorithm::processFeature( const QgsFeature &feature, QgsProcessingContext &context, QgsProcessingFeedback * )
{
QgsFeature f = feature;
if ( f.hasGeometry() && QgsWkbTypes::geometryType( f.geometry().wkbType() ) == QgsWkbTypes::PointGeometry )
{
double distance = mDistance;
if ( mDynamicDistance )
distance = mDistanceProperty.valueAsDouble( context.expressionContext(), distance );
double bearing = mBearing;
if ( mDynamicBearing )
bearing = mBearingProperty.valueAsDouble( context.expressionContext(), bearing );
QgsGeometry g = f.geometry();
if ( QgsWkbTypes::isMultiType( g.wkbType() ) )
{
const QgsMultiPoint *mp = static_cast< const QgsMultiPoint * >( g.constGet() );
std::unique_ptr< QgsMultiPoint > result = qgis::make_unique< QgsMultiPoint >();
result->reserve( mp->numGeometries() );
for ( int i = 0; i < mp->numGeometries(); ++i )
{
const QgsPoint *p = mp->pointN( i );
result->addGeometry( p->project( distance, bearing ).clone() );
}
f.setGeometry( QgsGeometry( std::move( result ) ) );
}
else
{
const QgsPoint *p = static_cast< const QgsPoint * >( g.constGet() );
QgsPoint result = p->project( distance, bearing );
f.setGeometry( QgsGeometry( result.clone() ) );
}
}
return QgsFeatureList() << f;
}
///@endcond