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

removed unused parameters

This commit is contained in:
Andreas Fabri 2007-03-17 09:37:57 +00:00
parent 2ee2c6877b
commit cd3f2587ee
5 changed files with 16 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Identity_rejectors.h
View File

@ -53,27 +53,27 @@ struct Identity_edge_rejector
typedef typename Delaunay_graph::All_edges_iterator All_edges_iterator; typedef typename Delaunay_graph::All_edges_iterator All_edges_iterator;
typedef typename Delaunay_graph::Finite_edges_iterator Finite_edges_iterator; typedef typename Delaunay_graph::Finite_edges_iterator Finite_edges_iterator;
bool operator()(const Delaunay_graph& dual, bool operator()(const Delaunay_graph& ,
const Face_handle& f, int i) const { const Face_handle& , int ) const {
return false; return false;
} }
bool operator()(const Delaunay_graph& dual, const Edge& e) const { bool operator()(const Delaunay_graph& , const Edge& ) const {
return false; return false;
} }
bool operator()(const Delaunay_graph& dual, bool operator()(const Delaunay_graph& ,
const All_edges_iterator& eit) const { const All_edges_iterator& ) const {
return false; return false;
} }
bool operator()(const Delaunay_graph& dual, bool operator()(const Delaunay_graph& ,
const Finite_edges_iterator& eit) const { const Finite_edges_iterator& ) const {
return false; return false;
} }
bool operator()(const Delaunay_graph& dual, bool operator()(const Delaunay_graph& ,
const Edge_circulator& ec) const { const Edge_circulator& ) const {
return false; return false;
} }
}; };

2
Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Policy_base.h
View File

@ -77,7 +77,7 @@ public:
return e_rejector_.is_valid() && f_rejector_.is_valid(); return e_rejector_.is_valid() && f_rejector_.is_valid();
} }
bool is_valid(const Delaunay_graph& dg) const { bool is_valid(const Delaunay_graph& ) const {
return e_rejector_.is_valid() && f_rejector_.is_valid(); return e_rejector_.is_valid() && f_rejector_.is_valid();
} }

2
Voronoi_diagram_2/test/Voronoi_diagram_2/include/Adaptation_traits_concept.h
View File

@ -60,7 +60,7 @@ public:
typedef typename DG::Face_handle Face_handle; typedef typename DG::Face_handle Face_handle;
typedef Arity_tag<1> Arity; typedef Arity_tag<1> Arity;
Point_2 operator()(const Face_handle& f) const { Point_2 operator()(const Face_handle& ) const {
return Point_2(); return Point_2();
} }
}; };

8
Voronoi_diagram_2/test/Voronoi_diagram_2/include/Delaunay_graph_concept.h
View File

@ -226,11 +226,11 @@ class Delaunay_graph_concept
} }
public: public:
Delaunay_graph_concept(const Geom_traits& gt = Geom_traits()) {} Delaunay_graph_concept(const Geom_traits& /* gt */ = Geom_traits()) {}
template<class Iterator> template<class Iterator>
Delaunay_graph_concept(Iterator first, Iterator beyond, Delaunay_graph_concept(Iterator /* first */, Iterator /* beyond */,
const Geom_traits& gt = Geom_traits()) {} const Geom_traits& /* gt */ = Geom_traits()) {}
void insert(const Site_2&) {} void insert(const Site_2&) {}
@ -242,7 +242,7 @@ class Delaunay_graph_concept
size_type number_of_faces() const { return 0; } size_type number_of_faces() const { return 0; }
size_type number_of_edges() const { return 0; } size_type number_of_edges() const { return 0; }
size_type degree(Vertex_handle v) const { return 0; } size_type degree(Vertex_handle ) const { return 0; }
int dimension() const { return -1; } int dimension() const { return -1; }

2
Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test.h
View File

@ -104,7 +104,7 @@ class VDA_Tester
} }
template<class Iterator> template<class Iterator>
VD* compute_vd(const DG& dg, Iterator first, Iterator beyond, VD* compute_vd(const DG& , Iterator first, Iterator beyond,
CGAL::Tag_true) const CGAL::Tag_true) const
{ {
// insertion is supported // insertion is supported