[geos-commits] r4326 - branches/3.6/src/algorithm
Sandro Santilli
strk at kbt.io
Wed Jan 18 04:44:04 PST 2017
Author: strk
Date: 2017-01-18 04:44:04 -0800 (Wed, 18 Jan 2017)
New Revision: 4326
Modified:
branches/3.6/src/algorithm/MinimumDiameter.cpp
Log:
Remove trailing spaces
Modified: branches/3.6/src/algorithm/MinimumDiameter.cpp
===================================================================
--- branches/3.6/src/algorithm/MinimumDiameter.cpp 2017-01-12 08:41:51 UTC (rev 4325)
+++ branches/3.6/src/algorithm/MinimumDiameter.cpp 2017-01-18 12:44:04 UTC (rev 4326)
@@ -8,7 +8,7 @@
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Public Licence as published
- * by the Free Software Foundation.
+ * by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************
@@ -16,7 +16,7 @@
* Last port: algorithm/MinimumDiameter.java r966
*
**********************************************************************
- *
+ *
* TODO:
* - avoid heap allocation for LineSegment and Coordinate
*
@@ -49,7 +49,7 @@
* by two parallel lines.
* This can be thought of as the smallest hole that the geometry can be
* moved through, with a single rotation.
- *
+ *
* The first step in the algorithm is computing the convex hull of the Geometry.
* If the input Geometry is known to be convex, a hint can be supplied to
* avoid this computation.
@@ -268,7 +268,7 @@
if (maxPerpDistance < minWidth) {
minPtIndex = maxIndex;
minWidth = maxPerpDistance;
- delete minWidthPt;
+ delete minWidthPt;
minWidthPt = new Coordinate(pts->getAt(minPtIndex));
delete minBaseSeg;
minBaseSeg = new LineSegment(*seg);
More information about the geos-commits
mailing list