boost_mirror/geometry
1
0
Fork 0
mirror of https://github.com/boostorg/geometry.git synced 2025-05-09 23:24:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

[geometry] avoid warnings for multi-line comments and unused var in new sources

Browse Source 
[SVN r86581]
This commit is contained in:
Barend Gehrels 2013-11-07 21:18:57 +00:00
parent 1bb3745741
commit 359703e933
2 changed files with 12 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
include/boost/geometry/algorithms/detail/extreme_points.hpp
View File

@ -57,9 +57,9 @@ inline void move_along_vector(PointType& point, PointType const& extreme, Coordi
// 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 @@ struct extreme_points_on_ring
// 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);

18
include/boost/geometry/algorithms/point_on_surface.hpp
View File

@ -206,11 +206,11 @@ inline void replace_extremes_for_self_tangencies(Extremes& extremes, Intruders&
// 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 @@ inline void replace_extremes_for_self_tangencies(Extremes& extremes, Intruders&
// It then looks like:
// b ___ e
// /|\ \
// / | \ \
// / | \ \
// / | \ \
// /|\ \ .
// / | \ \ .
// / | \ \ .
// / | \ \ .
// a c i1
// Then intruders (here "i1" but there may be more) are sorted from left to right