CGAL 4.8.2 - 2D Triangulation
Triangulation_2/info_insert_with_pair_iterator_regular_2.cpp
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Regular_triangulation_2.h>
#include <CGAL/Regular_triangulation_euclidean_traits_2.h>
#include <CGAL/Triangulation_vertex_base_with_info_2.h>
#include <cassert>
#include <vector>
typedef K::Point_2 Point;
typedef Traits::Weighted_point_2 Wpoint;
int main()
{
std::vector< std::pair<Wpoint,unsigned> > points;
points.push_back( std::make_pair(Wpoint(Point(0,0),2),0) );
points.push_back( std::make_pair(Wpoint(Point(1,0),2),1) );
points.push_back( std::make_pair(Wpoint(Point(0,1),2),2) );
points.push_back( std::make_pair(Wpoint(Point(-4,54),2),3) );
points.push_back( std::make_pair(Wpoint(Point(2,2),2),4) );
points.push_back( std::make_pair(Wpoint(Point(-1,0),2),5) );
Regular rt;
rt.insert( points.begin(),points.end() );
CGAL_assertion( rt.number_of_vertices() == 6 );
// check that the info was correctly set.
Regular::Finite_vertices_iterator vit;
for (vit = rt.finite_vertices_begin(); vit != rt.finite_vertices_end(); ++vit)
if( points[ vit->info() ].first != vit->point() ){
std::cerr << "Error different info" << std::endl;
exit(EXIT_FAILURE);
}
std::cout << "OK" << std::endl;
return 0;
}