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

remove unused var warnings

This commit is contained in:
Sébastien Loriot 2012-07-27 10:29:10 +00:00
parent 389c2ab9e9
commit cd58d025f7
4 changed files with 3 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
CGAL_ipelets/demo/CGAL_ipelets/alpha_shapes.cpp
View File

@ -74,7 +74,7 @@ void ASphapeIpelet::protected_run(int fn)
Iso_rectangle_2 bbox=read_active_objects(
read_active_objects(
CGAL::dispatch_or_drop_output<Point_2,Circle_2>(std::back_inserter(pt_list),
std::back_inserter(cir_list))
);

1
CGAL_ipelets/demo/CGAL_ipelets/multi_delaunay.cpp
View File

@ -119,7 +119,6 @@ void MdelaunayIpelet::protected_run(int fn)
//WE MAY COUNT SEVERAL TIME SAME TRIANGLE WITH THE FOLLOWING METHOD
//iterate over adjacent point in the regular triangulation and compute a new wpoint for those having one commun parent from delaunay
for (RegularI::Finite_edges_iterator it=rti.finite_edges_begin();it!=rti.finite_edges_end();++it){
VertexI ff=it->first->vertex(Delaunay::cw(it->second));
Point_2 pt0_ori0=it->first->vertex(Delaunay::cw(it->second))->info().front();
Point_2 pt0_ori1=it->first->vertex(Delaunay::cw(it->second))->info().back();
Point_2 pt1_ori0=it->first->vertex(Delaunay::ccw(it->second))->info().front();

3
CGAL_ipelets/demo/CGAL_ipelets/partition.cpp
View File

@ -56,8 +56,7 @@ void ConvexpartitionIpelet::protected_run(int fn)
}
std::list<Polygon_2> pol_list;
Iso_rectangle_2 bbox=
read_active_objects( CGAL::dispatch_or_drop_output<Polygon_2>( std::back_inserter(pol_list) ) );
read_active_objects( CGAL::dispatch_or_drop_output<Polygon_2>( std::back_inserter(pol_list) ) );

2
CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h
View File

@ -496,7 +496,7 @@ public:
typedef typename std::multimap<double,std::pair<Type_circ_arc,const Point_2*> >::iterator Map_theta_iterator;
Map_theta_iterator s_it=map_theta.insert(
std::make_pair(get_theta(*source,circle),std::make_pair(OSRC,source)));
Map_theta_iterator t_it=map_theta.insert(
/*Map_theta_iterator t_it=*/map_theta.insert(
std::make_pair(get_theta(*target,circle),std::make_pair(OTRG,target)));
for (typename std::vector<Circular_arc_2>::iterator it_arc=arc_list.begin();it_arc!=arc_list.end();++it_arc){