Subject: [Boost-commit] svn:boost r86581 - in trunk/boost/geometry/algorithms: . detail
From: barend.gehrels_at_[hidden]
Date: 2013-11-07 16:18:57
Author: barendgehrels
Date: 2013-11-07 16:18:57 EST (Thu, 07 Nov 2013)
New Revision: 86581
URL: http://svn.boost.org/trac/boost/changeset/86581
Log:
[geometry] avoid warnings for multi-line comments and unused var in new sources
Text files modified:
trunk/boost/geometry/algorithms/detail/extreme_points.hpp | 7 +++----
trunk/boost/geometry/algorithms/point_on_surface.hpp | 18 +++++++++---------
2 files changed, 12 insertions(+), 13 deletions(-)
Modified: trunk/boost/geometry/algorithms/detail/extreme_points.hpp
==============================================================================
--- trunk/boost/geometry/algorithms/detail/extreme_points.hpp Wed Nov 6 18:27:02 2013 (r86580)
+++ trunk/boost/geometry/algorithms/detail/extreme_points.hpp 2013-11-07 16:18:57 EST (Thu, 07 Nov 2013) (r86581)
@@ -57,9 +57,9 @@
// Moves a point along the vector (point, extreme) in the direction of the extreme point
// This adapts the possibly uneven legs of the triangle (or trapezium-like shape)
// _____extreme _____
- // / \ / \
- // /base \ => / \ point
- // \ point
+ // / \ / \ .
+ // /base \ => / \ point .
+ // \ point .
//
// For so-called intruders, it can be used to adapt both legs to the level of "base"
// For the base, it can be used to adapt both legs to the level of the max-value of the intruders
@@ -244,7 +244,6 @@
// we start at this intrusion until it is handled, and don't affect our initial left iterator
CirclingIterator left_intrusion_it = right;
- point_type local_top = *right;
typename boost::range_value<Intruders>::type intruder;
collect(ring, *right, intruder, left_intrusion_it, right);
Modified: trunk/boost/geometry/algorithms/point_on_surface.hpp
==============================================================================
--- trunk/boost/geometry/algorithms/point_on_surface.hpp Wed Nov 6 18:27:02 2013 (r86580)
+++ trunk/boost/geometry/algorithms/point_on_surface.hpp 2013-11-07 16:18:57 EST (Thu, 07 Nov 2013) (r86581)
@@ -206,11 +206,11 @@
// Self-tangencies use, as usual, the major part of code...
// ___ e
- // /|\ \
- // / | \ \
- // / | \ \
- // / | \ \
- // / /\ | \ \
+ // /|\ \ .
+ // / | \ \ .
+ // / | \ \ .
+ // / | \ \ .
+ // / /\ | \ \ .
// i2 i1
// The picture above shows the extreme (outside, "e") and two intruders ("i1","i2")
@@ -221,10 +221,10 @@
// It then looks like:
// b ___ e
- // /|\ \
- // / | \ \
- // / | \ \
- // / | \ \
+ // /|\ \ .
+ // / | \ \ .
+ // / | \ \ .
+ // / | \ \ .
// a c i1
// Then intruders (here "i1" but there may be more) are sorted from left to right