CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

The following PR fixes the issue:
https://github.com/CGAL/cgal/pull/4820

Note that if (i = 0) is an assignment and will be evaluated to true.

Best,

Sebastien.

On 6/30/20 1:45 AM, Trần Anh ( via cgal-discuss 
Mailing List) wrote:
> Hi,
> I have a set of edges in an Arrangement and would like to delete the 
> edges based on some condition while iterating through the edges. I have 
> the following example:
>
>     #include <CGAL/Cartesian.h>
>     #include <CGAL/MP_Float.h>
>     #include <CGAL/Quotient.h>
>     #include <CGAL/Arr_segment_traits_2.h>
>     #include <CGAL/Arrangement_2.h>
>     typedef CGAL::Quotient<CGAL::MP_Float> Number_type;
>     typedef CGAL::Cartesian<Number_type> Kernel;
>     typedef CGAL::Arr_segment_traits_2<Kernel> Traits_2;
>     typedef Traits_2::Point_2 Point_2;
>     typedef Traits_2::X_monotone_curve_2 Segment_2;
>     typedef CGAL::Arrangement_2<Traits_2> Arrangement_2;
>     int main()
>     {
>     Arrangement_2 arr;
>     Segment_2 cv[3];
>     Point_2 p1(0, 0), p2(0, 4), p3(4, 0);
>     cv[0] = Segment_2(p1, p2);
>     cv[1] = Segment_2(p2, p3);
>     cv[2] = Segment_2(p3, p1);
>     CGAL::insert(arr, &cv[0], &cv[3]); Arrangement_2::Edge_iterator curr;
>     Arrangement_2::Edge_iterator next = arr.edges_begin(); int i = 0;
>     for (curr = next++; curr != arr.edges_end(); curr = next++)
>     {
>     if (i = 0)
>     {
>     arr.remove_edge(curr);
>     }
>     } return (0);
>     }
>
> However, my Visual Studio was not very happy with the operation*curr = 
> next++*. I was trying to 
> replicate  Arrangement_on_surface_2/isolated_vertices.cpp. Very much 
> appreciate your help :).
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss