From cd3f2587eebe84ef5f66f7af8689f9b59f4059df Mon Sep 17 00:00:00 2001
From: Andreas Fabri <Andreas.Fabri@geometryfactory.com>
Date: Sat, 17 Mar 2007 09:37:57 +0000
Subject: [PATCH] removed unused parameters

---
 .../Voronoi_diagram_2/Identity_rejectors.h     | 18 +++++++++---------
 .../CGAL/Voronoi_diagram_2/Policy_base.h       |  2 +-
 .../include/Adaptation_traits_concept.h        |  2 +-
 .../include/Delaunay_graph_concept.h           |  8 ++++----
 .../test/Voronoi_diagram_2/include/vda_test.h  |  2 +-
 5 files changed, 16 insertions(+), 16 deletions(-)

diff --git a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Identity_rejectors.h b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Identity_rejectors.h
index 660ec8452ac..8c211f4a6e5 100644
--- a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Identity_rejectors.h
+++ b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Identity_rejectors.h
@@ -53,27 +53,27 @@ struct Identity_edge_rejector
   typedef typename Delaunay_graph::All_edges_iterator     All_edges_iterator;
   typedef typename Delaunay_graph::Finite_edges_iterator  Finite_edges_iterator;
 
-  bool operator()(const Delaunay_graph& dual,
-		  const Face_handle& f, int i) const {
+  bool operator()(const Delaunay_graph& ,
+		  const Face_handle& , int ) const {
     return false;
   }
 
-  bool operator()(const Delaunay_graph& dual, const Edge& e) const {
+  bool operator()(const Delaunay_graph& , const Edge& ) const {
     return false;
   }
 
-  bool operator()(const Delaunay_graph& dual,
-		  const All_edges_iterator& eit) const {
+  bool operator()(const Delaunay_graph& ,
+		  const All_edges_iterator& ) const {
     return false;
   }
 
-  bool operator()(const Delaunay_graph& dual,
-		  const Finite_edges_iterator& eit) const {
+  bool operator()(const Delaunay_graph& ,
+		  const Finite_edges_iterator& ) const {
     return false;
   }
 
-  bool operator()(const Delaunay_graph& dual,
-		  const Edge_circulator& ec) const {
+  bool operator()(const Delaunay_graph& ,
+		  const Edge_circulator& ) const {
     return false;
   }
 };
diff --git a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Policy_base.h b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Policy_base.h
index d02d6bf4eb4..caa5cd9745c 100644
--- a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Policy_base.h
+++ b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Policy_base.h
@@ -77,7 +77,7 @@ public:
     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();
   }
 
diff --git a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/Adaptation_traits_concept.h b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/Adaptation_traits_concept.h
index ed085c92451..f46d876bed0 100644
--- a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/Adaptation_traits_concept.h
+++ b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/Adaptation_traits_concept.h
@@ -60,7 +60,7 @@ public:
     typedef typename DG::Face_handle   Face_handle;
     typedef Arity_tag<1>  Arity;
 
-    Point_2 operator()(const Face_handle& f) const {
+    Point_2 operator()(const Face_handle& ) const {
       return Point_2();
     }
   };
diff --git a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/Delaunay_graph_concept.h b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/Delaunay_graph_concept.h
index 4b47787e6c9..766aafdbecf 100644
--- a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/Delaunay_graph_concept.h
+++ b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/Delaunay_graph_concept.h
@@ -226,11 +226,11 @@ class Delaunay_graph_concept
   }
 
  public:
-  Delaunay_graph_concept(const Geom_traits& gt = Geom_traits()) {}
+  Delaunay_graph_concept(const Geom_traits& /* gt */ = Geom_traits()) {}
 
   template<class Iterator>
-  Delaunay_graph_concept(Iterator first, Iterator beyond,
-			 const Geom_traits& gt = Geom_traits()) {}
+  Delaunay_graph_concept(Iterator /* first */, Iterator /* beyond */,
+			 const Geom_traits& /* gt */ = Geom_traits()) {}
 
 
   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_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; }
 
diff --git a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test.h b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test.h
index 97e0a6e2891..fd917398f99 100644
--- a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test.h
+++ b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test.h
@@ -104,7 +104,7 @@ class VDA_Tester
   }
 
   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
   {
     // insertion is supported