\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.7 - Kinetic Data Structures
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation > Class Template Reference

#include <CGAL/Kinetic/Delaunay_triangulation_recent_edges_visitor_2.h>

Definition

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.

Is Model Of:
Kinetic::DelaunayTriangulationVisitor_2
See also
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...
 

Member Typedef Documentation

template<typename Triangulation >
typedef unspecified_type CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::iterator

The iterator through the recently created edges.

Constructor & Destructor Documentation

default constructor.

Member Function Documentation

template<typename Triangulation >
iterator CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::begin ( ) const

Begin iteration through the recent edges.

template<typename Triangulation >
bool CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::contains ( Triangulation::Edge  ) const

Returns true if this edge exists in the set.

template<typename Triangulation >
iterator CGAL::Kinetic::Delaunay_triangulation_recent_edges_visitor_2< Triangulation >::end ( ) const

End iteration through the recent edges.