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

remove BOOST_FOREACH introduced by a merge of 4.14 release branch

This commit is contained in:
Sébastien Loriot 2020-03-16 16:24:24 +01:00
parent cf99ea072d
commit f8f369173a
3 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
BGL/include/CGAL/boost/graph/Euler_operations.h
View File

@ -707,7 +707,7 @@ add_face(const VertexRange& vr, Graph& g)
halfedge_descriptor hv = halfedge(v, g); halfedge_descriptor hv = halfedge(v, g);
if (hv != boost::graph_traits<Graph>::null_halfedge() && !is_border(hv, g)) if (hv != boost::graph_traits<Graph>::null_halfedge() && !is_border(hv, g))
{ {
BOOST_FOREACH(halfedge_descriptor h_around_v, halfedges_around_target(hv, g)) for(halfedge_descriptor h_around_v : halfedges_around_target(hv, g))
if (is_border(h_around_v, g)) if (is_border(h_around_v, g))
{ {
hv = h_around_v; hv = h_around_v;

2
BGL/test/BGL/test_Euler_operations.cpp
View File

@ -422,7 +422,7 @@ add_face_bug()
CGAL::Euler::add_face(CGAL::make_array(vs[1], vs[3], vs[2]), g); CGAL::Euler::add_face(CGAL::make_array(vs[1], vs[3], vs[2]), g);
// force vertex halfedge to not be a border halfedge // force vertex halfedge to not be a border halfedge
BOOST_FOREACH(vertex_descriptor v, vertices(g)) for(vertex_descriptor v : vertices(g))
{ {
halfedge_descriptor h = halfedge(v, g); halfedge_descriptor h = halfedge(v, g);
if ( CGAL::is_border(h, g) ) if ( CGAL::is_border(h, g) )

6
BGL/test/BGL/test_Manifold_face_removal.cpp
View File

@ -32,7 +32,7 @@ void border_cases()
sm, sm,
is_selected); is_selected);
int i=0; int i=0;
BOOST_FOREACH(face_descriptor fh, sm.faces()) for(face_descriptor fh : sm.faces())
if(!is_selected[fh]) ++i; if(!is_selected[fh]) ++i;
assert(i==4); assert(i==4);
} }
@ -49,7 +49,7 @@ void border_cases()
sm, sm,
is_selected); is_selected);
int i=0; int i=0;
BOOST_FOREACH(face_descriptor fh, sm.faces()) for(face_descriptor fh : sm.faces())
if(!is_selected[fh]) ++i; if(!is_selected[fh]) ++i;
assert(i==1 || i==4); // depends on the start point assert(i==1 || i==4); // depends on the start point
@ -69,7 +69,7 @@ void border_cases()
sm, sm,
is_selected); is_selected);
int i=0; int i=0;
BOOST_FOREACH(face_descriptor fh, sm.faces()) for(face_descriptor fh : sm.faces())
if(!is_selected[fh]) ++i; if(!is_selected[fh]) ++i;
assert(i==4); // depends on the start point assert(i==4); // depends on the start point
} }