add missing license include directives

Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h

@@ -10,6 +10,10 @@
 //
 // Author(s)     : Kaspar Fischer <[email protected]>
 
+#ifndef CGAL_APPROXIMATE_MIN_ELLIPSOID_D_APPROXIMATE_MIN_ELLIPSOID_D_IMPL_H
+#define CGAL_APPROXIMATE_MIN_ELLIPSOID_D_APPROXIMATE_MIN_ELLIPSOID_D_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
 
 #include <CGAL/Default_diagonalize_traits.h>
 
@@ -272,3 +276,5 @@ namespace CGAL {
   }
 
 }
+
+#endif //CGAL_APPROXIMATE_MIN_ELLIPSOID_D_APPROXIMATE_MIN_ELLIPSOID_D_IMPL_H

Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation_impl.h

@@ -10,6 +10,11 @@
 //
 // Author(s)     : Kaspar Fischer <[email protected]>
 
+#ifndef CGAL_APPROX_MIN_ELLIPSOID_KHACHIYAN_APPROX_IMPL_H
+#define CGAL_APPROX_MIN_ELLIPSOID_KHACHIYAN_APPROX_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 // Note: whenever a comment refers to "Khachiyan's paper" then the
 // paper "Rounding of polytopes in the real number model of
 // computation" is meant (Mathematics of Operations Research, Vol. 21,
@@ -663,3 +668,5 @@ namespace CGAL {
   }
 
 }
+
+#endif // CGAL_APPROX_MIN_ELLIPSOID_KHACHIYAN_APPROX_IMPL_H

Bounding_volumes/include/CGAL/Min_circle_2/Min_circle_2_impl.h

@@ -10,6 +10,11 @@
 //
 // Author(s)     : Sven Schoenherr <[email protected]>, Bernd Gaertner
 
+#ifndef CGAL_MIN_CIRCLE_2_MIN_CIRCLE_2_IMPL_H
+#define CGAL_MIN_CIRCLE_2_MIN_CIRCLE_2_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 #include <iterator>
 
 namespace CGAL {
@@ -98,3 +103,5 @@ operator >> ( std::istream& is, CGAL::Min_circle_2<Traits_>& min_circle)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif // CGAL_MIN_CIRCLE_2_MIN_CIRCLE_2_IMPL_H

Bounding_volumes/include/CGAL/Min_circle_2/Optimisation_circle_2_impl.h

@@ -10,6 +10,11 @@
 //
 // Author(s)     : Sven Schoenherr <[email protected]>, Bernd Gaertner
 
+#ifndef CGAL_MIN_SPHERE_D_OPTIMISATION_CIRCLE_2_IMPL_H
+#define CGAL_MIN_SPHERE_D_OPTIMISATION_CIRCLE_2_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 // includes
 #  include <CGAL/assertions.h>
 
@@ -89,3 +94,5 @@ operator >> ( std::istream& is, CGAL::Optimisation_circle_2<K_>& c)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif //CGAL_MIN_SPHERE_D_OPTIMISATION_CIRCLE_2_IMPL_H

Bounding_volumes/include/CGAL/Min_ellipse_2/Min_ellipse_2_impl.h

@@ -10,6 +10,11 @@
 //
 // Author(s)     : Sven Schoenherr <[email protected]>, Bernd Gaertner
 
+#ifndef CGAL_MIN_ELLIPSE_2_MIN_ELLIPSE_2_IMP_H
+#define CGAL_MIN_ELLIPSE_2_MIN_ELLIPSE_2_IMP_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 #include <iterator>
 
 namespace CGAL {
@@ -98,3 +103,5 @@ operator >> ( std::istream& is, CGAL::Min_ellipse_2<Traits_>& min_ellipse)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif // CGAL_MIN_ELLIPSE_2_MIN_ELLIPSE_2_IMP_H

Bounding_volumes/include/CGAL/Min_ellipse_2/Optimisation_ellipse_2_impl.h

@@ -10,6 +10,11 @@
 //
 // Author(s)     : Sven Schoenherr <[email protected]>, Bernd Gaertner
 
+#ifndef CGAL_MIN_ELLIPSE_2_OPTIMISATION_ELLIPSE_2_IMPL_H
+#define CGAL_MIN_ELLIPSE_2_OPTIMISATION_ELLIPSE_2_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 namespace CGAL {
 
 // Class implementation (continued)
@@ -116,3 +121,5 @@ operator >> ( std::istream& is, CGAL::Optimisation_ellipse_2<K_>& e)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif // CGAL_MIN_ELLIPSE_2_OPTIMISATION_ELLIPSE_2_IMPL_H

Bounding_volumes/include/CGAL/Min_sphere_d/Min_sphere_d_impl.h

@@ -11,6 +11,11 @@
 // Author(s)     : Sven Schoenherr <[email protected]>
 //                 Bernd Gaertner
 
+#ifndef CGAL_MIN_SPHERE_D_MIN_SPHERE_D_IMPL_H
+#define CGAL_MIN_SPHERE_D_MIN_SPHERE_D_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 #include <iterator>
 
 namespace CGAL {
@@ -105,3 +110,5 @@ operator >> ( std::istream& is, Min_sphere_d<Traits>& min_sphere)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif //CGAL_MIN_SPHERE_D_MIN_SPHERE_D_IMPL_H

Circular_kernel_2/include/CGAL/Circular_kernel_2/interface_macros.h

@@ -9,6 +9,8 @@
 //
 // Author(s)     : Monique Teillaud, Sylvain Pion, Pedro Machado
 
+#include <CGAL/license/Circular_kernel_2.h>
+
 // Partially supported by the IST Programme of the EU as a Shared-cost
 // RTD (FET Open) Project under Contract No  IST-2000-26473
 // (ECG - Effective Computational Geometry for Curves and Surfaces)

Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/interface_macros.h

@@ -9,6 +9,8 @@
 //
 // Author(s)     : Monique Teillaud, Sylvain Pion, Pedro Machado
 
+#include <CGAL/license/Circular_kernel_2.h>
+
 // Partially supported by the IST Programme of the EU as a Shared-cost
 // RTD (FET Open) Project under Contract No  IST-2000-26473
 // (ECG - Effective Computational Geometry for Curves and Surfaces)

Circular_kernel_3/include/CGAL/Circular_kernel_3/interface_macros.h

@@ -10,6 +10,8 @@
 // Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado,
 //             Sebastien Loriot, Julien Hazebrouck, Damien Leroy
 
+#include <CGAL/license/Circular_kernel_3.h>
+
 // Partially supported by the IST Programme of the EU as a
 // STREP (FET Open) Project under Contract No  IST-006413
 // (ACS -- Algorithms for Complex Shapes)

Partition_2/include/CGAL/Partition_2/Rotation_tree_2_impl.h

@@ -10,6 +10,11 @@
 //
 // Author(s)     : Susan Hert <[email protected]>
 
+#ifndef CGAL_PARTITION_2_ROTATION_TREE_2_IMPL_H
+#define CGAL_PARTITION_2_ROTATION_TREE_2_IMPL_H
+
+#include <CGAL/license/Partition_2.h>
+
 #include <iostream>
 
 namespace CGAL {
@@ -130,3 +135,5 @@ std::ostream& operator<<(std::ostream& os, const Rotation_tree_2<Traits>& tree)
 }
 
 }
+
+#endif // CGAL_PARTITION_2_ROTATION_TREE_2_IMPL_H

Partition_2/include/CGAL/Partition_2/Vertex_visibility_graph_2_impl.h

@@ -10,6 +10,11 @@
 //
 // Author(s)     : Susan Hert <[email protected]>
 
+#ifndef CGAL_PARTITION_2_VERTEX_VISIBILITY_GRAPH_2_IMPL_H
+#define CGAL_PARTITION_2_VERTEX_VISIBILITY_GRAPH_2_IMPL_H
+
+#include <CGAL/license/Partition_2.h>
+
 namespace CGAL {
 
 
@@ -699,3 +704,5 @@ void Vertex_visibility_graph_2<Traits>::handle(Tree_iterator p,
 }
 
 }
+
+#endif // CGAL_PARTITION_2_VERTEX_VISIBILITY_GRAPH_2_IMPL_H

Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_dummy_12.h

@@ -9,6 +9,8 @@
 //
 // Author(s)     : Nico Kruithof <[email protected]>
 
+#include <CGAL/license/Periodic_2_triangulation_2.h>
+
 #ifdef CGAL_INCLUDE_FROM_PERIODIC_2_TRIANGULATION_2_H
 
 #include <vector>

Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_dummy_288.h

@@ -10,6 +10,8 @@
 //
 // Author(s)     : Manuel Caroli <[email protected]>
 
+#include <CGAL/license/Periodic_3_triangulation_3.h>
+
 #ifdef CGAL_INCLUDE_FROM_PERIODIC_3_REGULAR_TRIANGULATION_3_H
 
 std::vector<Weighted_point> dummy_points()

Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_36.h

@@ -10,6 +10,8 @@
 //
 // Author(s)     : Manuel Caroli <[email protected]>
 
+#include <CGAL/license/Periodic_3_triangulation_3.h>
+
 #ifdef CGAL_INCLUDE_FROM_PERIODIC_3_TRIANGULATION_3_H
 
 template < class GT, class TDS >

Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h

@@ -10,6 +10,8 @@
 //
 // Author(s)     : Mael Rouxel-Labbé
 
+#include <CGAL/license/Periodic_3_triangulation_3.h>
+
 #ifdef CGAL_INCLUDE_FROM_PERIODIC_3_TRIANGULATION_3_H
 
 template < class GT, class TDS >