File tree Expand file tree Collapse file tree 1 file changed +8
-8
lines changed Expand file tree Collapse file tree 1 file changed +8
-8
lines changed Original file line number Diff line number Diff line change @@ -164,21 +164,21 @@ static QgsPointLocator::Match _findClosestSegmentIntersection( const QgsPointXY
164
164
}
165
165
166
166
167
- static void _replaceIfBetter ( QgsPointLocator::Match &mBest , const QgsPointLocator::Match &mNew , double maxDistance )
167
+ static void _replaceIfBetter ( QgsPointLocator::Match &bestMatch , const QgsPointLocator::Match &candidateMatch , double maxDistance )
168
168
{
169
- // is other match relevant?
170
- if ( !mNew .isValid () || mNew .distance () > maxDistance )
169
+ // is candidate match relevant?
170
+ if ( !candidateMatch .isValid () || candidateMatch .distance () > maxDistance )
171
171
return ;
172
172
173
- // is other match actually better?
174
- if ( mBest .isValid () && mBest .type () == mNew .type () && mBest .distance () - 10e-6 < mNew .distance () )
173
+ // is candidate match actually better?
174
+ if ( bestMatch .isValid () && bestMatch .type () == candidateMatch .type () && bestMatch .distance () - 10e-6 < candidateMatch .distance () )
175
175
return ;
176
176
177
- // prefer vertex matches to edge matches (even if they are closer)
178
- if ( mBest .type () == QgsPointLocator::Vertex && mNew .type () == QgsPointLocator::Edge )
177
+ // prefer vertex matches over edge matches (even if they are closer)
178
+ if ( bestMatch .type () == QgsPointLocator::Vertex && candidateMatch .type () == QgsPointLocator::Edge )
179
179
return ;
180
180
181
- mBest = mNew ; // the other match is better!
181
+ bestMatch = candidateMatch ; // the other match is better!
182
182
}
183
183
184
184
You can’t perform that action at this time.
0 commit comments