Removing leading and trailing empty lines from all example files.

Using the following Perl script:
-----------------------------------------------------
#!/usr/bin/perl

local($/) = undef;
my $text = <>;

$text =~ s/\A\n+//mg;
$text =~ s/\n+\Z/\n/mg;

print "$text";
-----------------------------------------------------

Alpha_shapes_2/examples/Alpha_shapes_2/alpha_shapes_2.cpp

@@ -1,4 +1,3 @@
-
 /***********************************************************************
 
 Takes a list of points and returns a list of segments corresponding to the

Alpha_shapes_2/examples/Alpha_shapes_2/weighted_alpha_shapes_2.cpp

@@ -1,4 +1,3 @@
-
 /***********************************************************************
 
 Takes a list of points and returns a list of segments corresponding to

Alpha_shapes_3/examples/Alpha_shapes_3/alpha_shapes_3.cpp

@@ -44,5 +44,3 @@ int main()
   assert(as.number_of_solid_components() == 1);
   return 0;
 }
-
-

Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 // standard includes
@@ -48,5 +47,3 @@ int main()
 
   return 0;
 }
-
-

Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits_sqrt.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 // standard includes

Apollonius_graph_2/examples/Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 // standard includes
@@ -62,5 +61,3 @@ int main()
 
   return 0;
 }
-
-

Apollonius_graph_2/examples/Apollonius_graph_2/ag2_hierarchy.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 // standard includes
@@ -62,5 +61,3 @@ int main()
 
   return 0;
 }
-
-

Approximate_min_ellipsoid_d/examples/Approximate_min_ellipsoid_d/ellipsoid.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian_d.h>
 #include <CGAL/MP_Float.h>
 #include <CGAL/point_generators_d.h>

Arrangement_2/examples/Arrangement_2/Bezier_curves.cpp

@@ -78,4 +78,3 @@ int main (int argc, char **argv)
 }
 
 #endif
-

Arrangement_2/examples/Arrangement_2/aggregated_insertion.cpp

@@ -36,4 +36,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/batched_point_location.cpp

@@ -72,4 +72,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/circles.cpp

@@ -61,4 +61,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/circular_arcs.cpp

@@ -91,4 +91,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/curve_history.cpp

@@ -77,4 +77,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/dcel_extension_io.cpp

@@ -135,4 +135,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/edge_insertion.cpp

@@ -40,4 +40,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/edge_manipulation.cpp

@@ -82,4 +82,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/edge_manipulation_curve_history.cpp

@@ -85,4 +85,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/global_insertion.cpp

@@ -58,4 +58,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/global_removal.cpp

@@ -50,4 +50,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/incremental_insertion.cpp

@@ -55,4 +55,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/io.cpp

@@ -46,4 +46,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/io_curve_history.cpp

@@ -55,4 +55,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/isolated_vertices.cpp

@@ -60,4 +60,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/point_location.cpp

@@ -48,4 +48,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/predefined_kernel.cpp

@@ -83,4 +83,3 @@ int main (int argc, char **argv)
 
   return 0;
 }
-

Arrangement_2/examples/Arrangement_2/predefined_kernel_non_intersecting.cpp

@@ -80,4 +80,3 @@ int main (int argc, char **argv)
 
   return 0;
 }
-

Arrangement_2/examples/Arrangement_2/special_edge_insertion.cpp

@@ -44,4 +44,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/vertical_decomposition.cpp

@@ -82,4 +82,3 @@ int main ()
 
   return (0);
 }
-

Arrangement_2/examples/Arrangement_2/vertical_ray_shooting.cpp

@@ -48,4 +48,3 @@ int main ()
 
   return (0);
 }
-

Benchmark/examples/Benchmark/check_syntax.cpp

@@ -83,4 +83,3 @@ int main( int argc, char* argv[] ) {
     }
     return exit_status;
 }
-

Benchmark/examples/Benchmark/polynomial.cpp

@@ -105,4 +105,3 @@ int main( int argc, char* argv[] ) {
     }
     return exit_status;
 }
-

Box_intersection_d/examples/Box_intersection_d/minimal.cpp

@@ -18,4 +18,3 @@ int main() {
     CGAL::box_intersection_d( boxes, boxes+9, query, query+2, callback);
     return 0;
 }
-

Box_intersection_d/examples/Box_intersection_d/minimal_self.cpp

@@ -18,4 +18,3 @@ int main() {
     CGAL::box_self_intersection_d( boxes, boxes+9, callback);
     return 0;
 }
-

Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement.cpp

@@ -53,4 +53,3 @@ int main(){
 
   return 0;
 };
-

Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_Circular.cpp

@@ -82,4 +82,3 @@ int main(){
 
   return 0;
 };
-

Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_arc.cpp

@@ -76,4 +76,3 @@ int main(){
   }
   return 0;
 };
-

Circular_kernel_2/examples/Circular_kernel_2/Exact_circular_kernel.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <CGAL/Random.h>
 #include <CGAL/point_generators_2.h>
@@ -65,4 +64,3 @@ int main(){
 
   return 0;
 };
-

Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement.cpp

@@ -116,4 +116,3 @@ std::cout<<"Exact Circular_k ="<<(t4-t3)<<std::endl;
 
   return 0;
 };
-

Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_Circular.cpp

@@ -180,4 +180,3 @@ int main(){
 
   return 0;
 };
-

Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_arc.cpp

@@ -140,4 +140,3 @@ int main(){
  // }
   return 0;
 };
-

Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles.cpp

@@ -48,4 +48,3 @@ int main(){
 
   return 0;
 };
-

Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles_segments.cpp

@@ -68,4 +68,3 @@ int main(){
 
   return 0;
 };
-

Circulator/examples/Circulator/circulator_prog1.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <cassert>
 #include <vector>

Circulator/examples/Circulator/circulator_prog2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <cassert>
 #include <vector>

Circulator/examples/Circulator/circulator_prog3.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <cassert>
 #include <list>

Convex_hull_2/examples/Convex_hull_2/ch_example_from_cin_to_cout.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/ch_graham_andrew.h>
 
@@ -14,4 +13,3 @@ int main()
   CGAL::ch_graham_andrew( in_start, in_end, out );
   return 0;
 }
-

Convex_hull_2/examples/Convex_hull_2/ch_example_timing.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/convex_hull_traits_2.h>
 

Convex_hull_2/examples/Convex_hull_2/ch_graham_anderson.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/ch_graham_andrew.h>
 #include <CGAL/functional.h>

Convex_hull_3/examples/Convex_hull_3/dynamic_hull_3.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Filtered_kernel.h>
 #include <CGAL/point_generators_3.h>

Convex_hull_3/examples/Convex_hull_3/incremental_hull_3.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Homogeneous.h>
 #include <CGAL/point_generators_3.h>
 #include <CGAL/copy_n.h>

Convex_hull_3/examples/Convex_hull_3/quickhull_3.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Homogeneous.h>
 #include <CGAL/point_generators_3.h>
 #include <CGAL/copy_n.h>

Core/examples/Core/delaunay.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 #ifdef CGAL_USE_CORE

Cubical_gaussian_map_3/examples/Cubical_gaussian_map_3/minksum_simple.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Gmpq.h>
 #include <CGAL/Polyhedral_cgm_polyhedron_3.h>

Envelope_2/examples/Envelope_2/ex_envelope_circles.cpp

@@ -75,4 +75,3 @@ int main ()
 
   return (0);
 }
-

Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Filtered_predicate.h>
 #include <CGAL/MP_Float.h>
@@ -41,4 +40,3 @@ int main()
   orientation(p, q, r);
   return 0;
 }
-

Generator/examples/Generator/random_convex_set.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_convex_set_2.h>

Generator/examples/Generator/random_degenerate_point_set.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>
 #include <vector>

Generator/examples/Generator/random_grid.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>
 #include <vector>

Generator/examples/Generator/random_polygon.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
@@ -55,4 +54,3 @@ int main( )
    std::cout << polygon << std::endl;
    return 0;
 }
-

Generator/examples/Generator/random_polygon2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_polygon_2.h>

Generator/examples/Generator/random_segments1.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>
 #include <vector>

Generator/examples/Generator/random_segments2.cpp

@@ -1,4 +1,3 @@
-
 // CGAL example program for the generic segment generator
 // using precomputed point locations.
 
@@ -55,5 +54,3 @@ int main() {
     }
     return 0;
 }
-
-

HalfedgeDS/examples/HalfedgeDS/hds_prog_color.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/IO/Color.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_compact.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_vector.h>
 #include <CGAL/HalfedgeDS_decorator.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_compact2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_list.h>
 #include <CGAL/HalfedgeDS_decorator.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_default.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>
 

HalfedgeDS/examples/HalfedgeDS/hds_prog_edge_iterator.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>
 #include <CGAL/N_step_adaptor.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_graph.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_min_items.h>
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_graph2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_min_items.h>
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_halfedge_iterator.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>
 

HalfedgeDS/examples/HalfedgeDS/hds_prog_vector.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_vector.h>
 #include <CGAL/HalfedgeDS_decorator.h>

Interval_skip_list/examples/Interval_skip_list/intervals.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Interval_skip_list.h>
 #include <CGAL/Interval_skip_list_interval.h>
 #include <vector>
@@ -39,5 +38,3 @@ int main()
   return 0;
 
 }
-
-

Interval_skip_list/examples/Interval_skip_list/terrain.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Delaunay_triangulation_2.h>
 #include <CGAL/Triangulation_euclidean_traits_xy_3.h>

Jet_fitting_3/examples/Jet_fitting_3/blind.cpp

@@ -289,4 +289,3 @@ int main(int argc, char *argv[])
   }
   return 0;
 }
-

Kernel_23/examples/Kernel_23/MyKernel.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <CGAL/Filtered_kernel.h>
 #include <CGAL/Delaunay_triangulation_2.h>

Kernel_23/examples/Kernel_23/test_delaunay_2.cpp

@@ -1,4 +1,3 @@
-
 // small example for compilation
 // check of Delaunay_triangulation_2 using the kernel concept
 // archetype

Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder.cpp

@@ -1,4 +1,3 @@
-
 // original version see examples/Polyhedron/polyhedron_prog_incr_builder.cpp
 // this time we test compilation with the
 // kernel concept archetype

Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder_own_archetype.cpp

@@ -1,4 +1,3 @@
-
 // original version see examples/Polyhedron/polyhedron_prog_incr_builder.cpp
 // this time we test compilation with
 // an own archetype that uses functionality

Kinetic_data_structures/examples/Kinetic_framework/listener.cpp

@@ -79,4 +79,3 @@ int main(int, char *[])
 
   return EXIT_SUCCESS;
 }
-

Largest_empty_rect_2/examples/Largest_empty_rect_2/largest_empty_rectangle.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Iso_rectangle_2.h>
 #include <CGAL/Largest_empty_iso_rectangle_2.h>

Matrix_search/examples/Matrix_search/all_furthest_neighbors_2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
@@ -34,4 +33,3 @@ int main()
 // ----------------------------------------------------------------------------
 // ** EOF
 // ----------------------------------------------------------------------------
-

Matrix_search/examples/Matrix_search/rectangular_p_center_2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/rectangular_p_center_2.h>
@@ -40,4 +39,3 @@ int main()
 // ----------------------------------------------------------------------------
 // ** EOF
 // ----------------------------------------------------------------------------
-

Matrix_search/examples/Matrix_search/sorted_matrix_search.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Random.h>
 #include <CGAL/Cartesian_matrix.h>
 #include <CGAL/sorted_matrix_search.h>
@@ -48,4 +47,3 @@ int main()
 // ----------------------------------------------------------------------------
 // ** EOF
 // ----------------------------------------------------------------------------
-

Mesh_2/examples/Mesh_2/conforming.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Triangulation_conformer_2.h>

Mesh_2/examples/Mesh_2/mesh_class.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Delaunay_mesher_2.h>

Mesh_2/examples/Mesh_2/mesh_global.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Delaunay_mesher_2.h>

Mesh_2/examples/Mesh_2/mesh_with_seeds.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Delaunay_mesher_2.h>

Min_annulus_d/examples/Min_annulus_d/min_annulus_d.cpp

@@ -1,4 +1,3 @@
-
 // computes the smallest enclosing annulus of two point
 // sets on nested squares in R^2, using double
 // as input type and some internal EXACT floating point type

Min_annulus_d/examples/Min_annulus_d/min_annulus_d_fast_exact.cpp

@@ -1,4 +1,3 @@
-
 // computes the smallest enclosing annulus of two point
 // sets on nested squares in R^2,  using double
 // as input type and some internal EXACT floating point type;

Min_circle_2/examples/Min_circle_2/min_circle_2.cpp

@@ -1,4 +1,3 @@
-
 // includes
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Min_circle_2.h>

Min_ellipse_2/examples/Min_ellipse_2/min_ellipse_2.cpp

@@ -1,4 +1,3 @@
-
 // includes
 #include <cassert>
 #include <CGAL/Cartesian.h>

Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>

Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
@@ -28,4 +27,3 @@ int main()
 
   return 0;
 }
-

Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
@@ -27,4 +26,3 @@ int main()
 
   return 0;
 }
-

Min_sphere_d/examples/Min_sphere_d/min_sphere_d.cpp

@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian_d.h>
 #include <iostream>
 #include <cstdlib>
@@ -33,4 +32,3 @@ int main ()
 
     return 0;
 }
-

Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/benchmark.cpp

@@ -1,4 +1,3 @@
-
 #include <iostream>
 #include <ctime>
 #include <CGAL/Min_sphere_of_spheres_d.h>

Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_2.cpp

@@ -1,4 +1,3 @@
-
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_2 and CGAL::
 // Weighted_point with the Min_sphere_of_spheres_d package.

Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_3.cpp

@@ -1,4 +1,3 @@
-
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_3 and CGAL::
 // Weighted_point with the Min_sphere_of_spheres_d package.

Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_d.cpp

@@ -1,4 +1,3 @@
-
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_d and CGAL::
 // Weighted_point with the Min_sphere_of_spheres_d package.