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

Replaced boost prior with CGAL::cpp11::prev

This commit is contained in:
Mael Rouxel-Labbé 2018-03-13 10:10:11 +01:00
parent 2c68965397
commit f9b68b670d
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Polygon/include/CGAL/Polygon_2/Polygon_2_algorithms_impl.h
View File

@ -23,12 +23,11 @@
// //
// Author(s) : Wieger Wesselink <wieger@cs.ruu.nl> // Author(s) : Wieger Wesselink <wieger@cs.ruu.nl>
#include <CGAL/algorithm.h>
#include <CGAL/assertions.h> #include <CGAL/assertions.h>
#include <CGAL/determinant.h> #include <CGAL/determinant.h>
#include <CGAL/Polygon_2/Polygon_2_simplicity.h> #include <CGAL/Polygon_2/Polygon_2_simplicity.h>
#include <boost/next_prior.hpp>
#include <algorithm> #include <algorithm>
#include <cstdlib> #include <cstdlib>
#include <iterator> #include <iterator>
@ -72,7 +71,7 @@ OutputForwardIterator filter_collinear_points(InputForwardIterator first,
typedef typename K::FT FT; typedef typename K::FT FT;
typedef typename K::Point_2 Point; typedef typename K::Point_2 Point;
InputForwardIterator last = boost::prior(beyond); InputForwardIterator last = cpp11::prev(beyond);
InputForwardIterator vit = first, vit_next = vit, vit_next_2 = vit, vend = vit; InputForwardIterator vit = first, vit_next = vit, vit_next_2 = vit, vend = vit;
++vit_next; ++vit_next;
@ -103,7 +102,7 @@ OutputForwardIterator filter_collinear_points(InputForwardIterator first,
} }
else else
{ {
// 'vit = vit_next' and not '++vit' because we don't necessarily have *(boost::next(vit) == p) // 'vit = vit_next' and not '++vit' because we don't necessarily have *(next(vit) == p)
// and collinear points between 'o' and 'p' are ignored // and collinear points between 'o' and 'p' are ignored
vit = vit_next; vit = vit_next;
vit_next = (vit_next == last) ? first : ++vit_next; vit_next = (vit_next == last) ? first : ++vit_next;