songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

using std::distance and std::advance instead of counting

This commit is contained in:
Ophir Setter 2009-05-04 08:04:20 +00:00
parent 64ed32dc80
commit d2da417b45
1 changed files with 2 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
View File

@ -70,16 +70,9 @@ _construct_envelope_non_vertical (Curve_pointer_iterator begin,
else
{
// Divide the given range of curves into two.
std::size_t size = std::distance(begin, end);
Curve_pointer_iterator div_it = begin;
unsigned int count = 0;
for (iter = begin; iter != end; ++iter)
{
if (count % 2 == 0)
++div_it;
count++;
}
std::advance(div_it, size / 2);
// Construct the diagrams (envelopes) for the two sub-ranges recursively
// and then merge the two diagrams to obtain the result.