removing unused variables or adding CGAL_USE

Lab/demo/Lab/triangulate_primitive.h

@@ -145,14 +145,9 @@ private:
     Vertex_handle previous, first, last_inserted;
 
     // Iterate the points of the facet and decide if they must be inserted in the CDT
-    typename Kernel::FT x(0), y(0), z(0);
-
     for(std::size_t i = 0;i<idPoints.size();i++)
     {
       const std::pair<typename Kernel::Point_3, Index>& idPoint = idPoints[i];
-      x += idPoint.first.x();
-      y += idPoint.first.y();
-      z += idPoint.first.z();
 
       Vertex_handle vh;
       // Always insert the first point, then only insert if the distance with the previous is reasonable.

Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h

@@ -1285,8 +1285,6 @@ perturb_vertex( PVertex pv
 
   CGAL_assertion(pv.is_perturbable());
 
-  int num_new_vertices_to_treat = 0;
-
   Cell_vector slivers;
   slivers.reserve(8);
   if (!helper_.try_lock_and_get_incident_slivers(
@@ -1349,8 +1347,7 @@ perturb_vertex( PVertex pv
         pv.increment_try_nb();
 
         // update modified vertices
-        num_new_vertices_to_treat +=
-          update_priority_queue(modified_vertices, sliver_bound, visitor, bad_vertices);
+        update_priority_queue(modified_vertices, sliver_bound, visitor, bad_vertices);
       }
       else
       {
@@ -1372,7 +1369,6 @@ perturb_vertex( PVertex pv
       if (pv.is_perturbable())
       {
         enqueue_task(pv, sliver_bound, visitor, bad_vertices);
-        ++num_new_vertices_to_treat;
       }
     }
     else

Partition_2/include/CGAL/partition_is_valid_2.h

@@ -157,6 +157,7 @@ partition_is_valid_2 (InputIterator point_first, InputIterator point_last,
    int poly_num = 0;
    for (; poly_first != poly_last; poly_first++, poly_num++)
    {
+      CGAL_USE(poly_num);
       vtx_begin = (*poly_first).vertices_begin();
       vtx_end = (*poly_first).vertices_end();
 #ifdef CGAL_PARTITION_CHECK_DEBUG

Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_triangulation_2/internal/Dehn_hyperbolic_octagon_translation_word.h

@@ -89,7 +89,6 @@ private:
   {
     Word_idx_type start = 0;
     Word_idx_type mstart = 0;
-    Word_idx_type end = 1;
     Word_idx_type max = 1;
     Word_idx_type len = 1;
     std::vector<Word_idx_type> tmp, mvec;
@@ -98,7 +97,6 @@ private:
     {
       if(is_next_relation_index(w[i], w[i-1]))
       {
-        end++;
         len++;
         tmp.push_back(w[i]);
         if(len > max) {
@@ -112,7 +110,6 @@ private:
         tmp.clear();
         tmp.push_back(w[i]);
         start = i;
-        end = i;
         len = 0;
       }
     }

Point_set_processing_3/include/CGAL/IO/write_las_points.h

@@ -103,7 +103,13 @@ namespace LAS {
   inline void output_value(LASpoint& r, const unsigned char& v, const LAS_property::Withheld_flag&)
   { r.set_withheld_flag(v); }
   inline void output_value(LASpoint& r, const float& v, const LAS_property::Scan_angle&)
-  { r.set_scan_angle_rank(char(v)); }
+  {
+#if LAS_TOOLS_VERSION < 250517
+    r.set_scan_angle_rank(v);
+#else
+    r.set_scan_angle(v);
+#endif
+  }
   inline void output_value(LASpoint& r, const unsigned char& v, const LAS_property::User_data&)
   { r.set_user_data(v); }
   inline void output_value(LASpoint& r, const unsigned short& v, const LAS_property::Point_source_ID&)

Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h

@@ -232,10 +232,9 @@ public:
   void
   initialize_costs()
   {
-    int n=0;
     Constraint_iterator cit = pct.constraints_begin(), e = pct.constraints_end();
     for(; cit!=e; ++cit){
-      n+= initialize_costs(*cit);
+      initialize_costs(*cit);
     }
   }
 

SMDS_3/include/CGAL/IO/File_maya.h

@@ -150,10 +150,10 @@ output_to_maya(std::ostream& os,
   {
     facets_sstr <<  "  setAttr -s " << number_of_triangles
       << " \".fc[0:" << number_of_triangles-1 << "]\"  -type \"polyFaces\" \n";
-    int c = 0;
+
     for( Facet_iterator fit = c3t3.facets_in_complex_begin();
          fit != c3t3.facets_in_complex_end();
-         ++fit, ++c)
+         ++fit)
     {
       int indices[3];
       //Weighted_point points[3];
@@ -207,10 +207,9 @@ output_to_maya(std::ostream& os,
   {
     facets_sstr <<  "  setAttr -s " << 4*c3t3.number_of_cells_in_complex()
       << " \".fc[0:" << 4*c3t3.number_of_cells_in_complex()-1 << "]\"  -type \"polyFaces\" \n";
-    int c = 0;
     for( Cell_iterator cit = c3t3.cells_in_complex_begin();
          cit != c3t3.cells_in_complex_end();
-         ++cit, ++c)
+         ++cit)
     {
       for (int facet_i = 0 ; facet_i < 4 ; ++facet_i)
       {

Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h

@@ -668,6 +668,8 @@ loop()
       CGAL_SMS_TRACE(1, edge_to_string(*opt_h) << " uncomputable cost." );
     }
   }
+
+  CGAL_assertion_code(CGAL_USE(non_collapsable_count));
 }
 
 template<class TM, class GT, class SP, class VIM, class VPM,class HIM, class ECM, class CF, class PF, class SI, class V, bool URH>

Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_degeneracy_testers.h

@@ -209,6 +209,8 @@ class Segment_Delaunay_graph_face_tester_2
       ++ec;
     } while ( ec != ec_start );
 
+    CGAL_USE(n_inf);
+
     if ( deg == n_degen ) { return true; }
     if ( n_non_degen != 2 ) { return false; }