whitespace

afabri · May 21, 2024 · 6675d31 · 6675d31
1 parent 498613f
commit 6675d31
Show file tree

Hide file tree

Showing 8 changed files with 8 additions and 8 deletions.
diff --git a/Generator/include/CGAL/random_convex_hull_in_disc_2.h b/Generator/include/CGAL/random_convex_hull_in_disc_2.h
@@ -71,7 +71,7 @@ void generate_points_annulus(long n, double a, double b, double small_radius,
         small_radius * small_radius / (big_radius * big_radius), 1);
 
     std::uniform_real_distribution<double> random_angle_distribution(a, b);
-    
+
     double alpha = random_angle_distribution(gen);
     double r = big_radius * std::sqrt(random_squared_radius_distribution(gen));
     typedef  Creator_uniform_2<double, P> Creator;

diff --git a/GraphicsView/demo/Apollonius_graph_2/Apollonius_graph_2.cpp b/GraphicsView/demo/Apollonius_graph_2/Apollonius_graph_2.cpp
@@ -200,7 +200,7 @@ MainWindow::on_actionInsertRandomPoints_triggered()
   points.reserve(number_of_points);
   std::mt19937 rng;
   boost::uniform_real<> dist(0.005*width, 0.05*width);
-  
+
   for(int i = 0; i < number_of_points; ++i){
     points.push_back(Apollonius_site_2(*pg++,dist(rng)));
   }

diff --git a/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h b/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h
@@ -1129,7 +1129,7 @@ class Random_based_perturbation
     , sphere_radius_(sphere_radius)
     , sphere_sq_radius_(sphere_radius*sphere_radius)
     , generator_() // initialize the random generator deterministically
-    , uni_dist_(0,1) 
+    , uni_dist_(0,1)
     {}
 
   /**

diff --git a/Nef_2/include/CGAL/Nef_polyhedron_2.h b/Nef_2/include/CGAL/Nef_polyhedron_2.h
@@ -573,7 +573,7 @@ static  T EK; // static extended kernel
 
     std::mt19937 rng;
     boost::uniform_real<> dist(0,1);
-    
+
     Vertex_iterator v; Halfedge_iterator e; Face_iterator f;
     for (v = D.vertices_begin(); v != D.vertices_end(); ++v)
       D.mark(v) = ( dist(rng) < p ? true : false );

diff --git a/Nef_S2/include/CGAL/Nef_polyhedron_S2.h b/Nef_S2/include/CGAL/Nef_polyhedron_S2.h
@@ -283,7 +283,7 @@ class Nef_polyhedron_S2 : public Handle_for< Nef_polyhedron_S2_rep<Kernel_,Items
 
     std::mt19937 rng;
     boost::uniform_real<> dist(0,1);
-    
+
     SVertex_iterator v; SHalfedge_iterator e; SFace_iterator f;
     CGAL_forall_svertices(v,D)
       v->mark() = ( dist(rng) < p ? true : false );

diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h
@@ -2881,7 +2881,7 @@ march_locate_2D(Face_handle f, const Point& query,
   // Random generator
   std::mt19937 rng;
   boost::uniform_smallint<> two(0, 1);
-  
+
   // Give the point the best start-offset possible
   if (is_1_cover() && !f->has_zero_offsets())
     {

diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
@@ -2298,7 +2298,7 @@ exact_periodic_locate
 
   std::mt19937 rng;
   boost::uniform_smallint<> four(0, 3);
-  
+
   // Now treat the cell c.
 try_next_cell:
   // For the remembering stochastic walk,

diff --git a/Stream_lines_2/include/CGAL/Stream_lines_2.h b/Stream_lines_2/include/CGAL/Stream_lines_2.h
@@ -257,7 +257,7 @@ void Stream_lines_2<VectorField_2, Integrator_2>::place_stream_lines(const Vecto
 
   boost::uniform_real<> ur_x(min_x, max_x);
   boost::uniform_real<> ur_y(min_y, max_y);
-  
+
   while(!vector_field_2.is_in_domain(seed_point))
     {
       // std::cout << "searching valid seed point..\n";