CGAL 4.7 - Kinetic Data Structures
|
#include <CGAL/Kinetic/Delaunay_triangulation_recent_edges_visitor_2.h>
The class Kinetic::Delaunay_triangulation_recent_edges_visitor_2
provides a model of Kinetic::DelaunayTriangulationVisitor_2
which tracks which edges were created in the most recent change.
Kinetic::Delaunay_triangulation_2<Traits, Triangulation, Visitor>
Creation | |
typedef unspecified_type | iterator |
The iterator through the recently created edges. More... | |
Delaunay_triangulation_recent_edges_visitor_2 () | |
default constructor. More... | |
Operations | |
iterator | begin () const |
Begin iteration through the recent edges. More... | |
iterator | end () const |
End iteration through the recent edges. More... | |
bool | contains (Triangulation::Edge) const |
Returns true if this edge exists in the set. More... | |
typedef unspecified_type CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::iterator |
The iterator through the recently created edges.
CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::Delaunay_triangulation_recent_edges_visitor_2 | ( | ) |
default constructor.
iterator CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::begin | ( | ) | const |
Begin iteration through the recent edges.
bool CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::contains | ( | Triangulation::Edge | ) | const |
Returns true if this edge exists in the set.
iterator CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::end | ( | ) | const |
End iteration through the recent edges.