boost_mirror/geometry
1
0
Fork 0
mirror of https://github.com/boostorg/geometry.git synced 2025-05-11 13:34:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove unused count variables in intersection points.

Browse Source
This commit is contained in:
Vissarion Fisikopoulos 2022-10-24 11:36:18 +03:00
parent 419590c41c
commit ae4c906679
1 changed files with 4 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
include/boost/geometry/policies/relate/intersection_points.hpp
View File

@ -2,8 +2,9 @@
// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// This file was modified by Oracle on 2016. // This file was modified by Oracle on 2016, 2022.
// Modifications copyright (c) 2016 Oracle and/or its affiliates. // Modifications copyright (c) 2016-2022 Oracle and/or its affiliates.
// Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
// Use, modification and distribution is subject to the Boost Software License, // Use, modification and distribution is subject to the Boost Software License,
@ -68,7 +69,7 @@ struct segments_intersection_points
Ratio const& rb_from_wrt_a, Ratio const& rb_to_wrt_a) Ratio const& rb_from_wrt_a, Ratio const& rb_to_wrt_a)
{ {
return_type result; return_type result;
unsigned int index = 0, count_a = 0, count_b = 0; unsigned int index = 0;
Ratio on_a[2]; Ratio on_a[2];
// The conditions "index < 2" are necessary for non-robust handling, // The conditions "index < 2" are necessary for non-robust handling,
@ -87,7 +88,6 @@ struct segments_intersection_points
result.fractions[index].assign(Ratio::zero(), ra_from_wrt_b); result.fractions[index].assign(Ratio::zero(), ra_from_wrt_b);
on_a[index] = Ratio::zero(); on_a[index] = Ratio::zero();
index++; index++;
count_a++;
} }
if (b1_wrt_a == 2 //rb_from_wrt_a.in_segment() if (b1_wrt_a == 2 //rb_from_wrt_a.in_segment()
&& index < 2) && index < 2)
@ -103,7 +103,6 @@ struct segments_intersection_points
result.fractions[index].assign(rb_from_wrt_a, Ratio::zero()); result.fractions[index].assign(rb_from_wrt_a, Ratio::zero());
on_a[index] = rb_from_wrt_a; on_a[index] = rb_from_wrt_a;
index++; index++;
count_b++;
} }
if (a2_wrt_b >= 1 && a2_wrt_b <= 3 //ra_to_wrt_b.on_segment() if (a2_wrt_b >= 1 && a2_wrt_b <= 3 //ra_to_wrt_b.on_segment()
@ -116,7 +115,6 @@ struct segments_intersection_points
result.fractions[index].assign(Ratio::one(), ra_to_wrt_b); result.fractions[index].assign(Ratio::one(), ra_to_wrt_b);
on_a[index] = Ratio::one(); on_a[index] = Ratio::one();
index++; index++;
count_a++;
} }
if (b2_wrt_a == 2 // rb_to_wrt_a.in_segment() if (b2_wrt_a == 2 // rb_to_wrt_a.in_segment()
&& index < 2) && index < 2)
@ -125,7 +123,6 @@ struct segments_intersection_points
result.fractions[index].assign(rb_to_wrt_a, Ratio::one()); result.fractions[index].assign(rb_to_wrt_a, Ratio::one());
on_a[index] = rb_to_wrt_a; on_a[index] = rb_to_wrt_a;
index++; index++;
count_b++;
} }
// TEMPORARY // TEMPORARY