diff --git a/Packages/Arrangement/include/CGAL/Arr_conic_traits_2.h b/Packages/Arrangement/include/CGAL/Arr_conic_traits_2.h index 48217199b8b..6fb1ed79b98 100644 --- a/Packages/Arrangement/include/CGAL/Arr_conic_traits_2.h +++ b/Packages/Arrangement/include/CGAL/Arr_conic_traits_2.h @@ -1,5 +1,25 @@ -#ifndef CGAL_ARR_CONIC_TRAITS_H -#define CGAL_ARR_CONIC_TRAITS_H +// ====================================================================== +// +// Copyright (c) 1999 The CGAL Consortium +// +// This software and related documentation is part of an INTERNAL release +// of the Computational Geometry Algorithms Library (CGAL). It is not +// intended for general use. +// +// ---------------------------------------------------------------------- +// +// release : $$ +// release_date : $$ +// +// file : include/CGAL/Arr_conic_traits_2.h +// package : Arrangement (2.62) +// author(s) : Ron Wein +// +// coordinator : Tel-Aviv University (Dan Halperin ) +// +// ====================================================================== +#ifndef CGAL_ARR_CONIC_TRAITS_2_H +#define CGAL_ARR_CONIC_TRAITS_2_H #include #include @@ -559,14 +579,16 @@ class Arr_conic_traits // c1 is a vertical segment going up: if (c2_is_left) { - return ((!curve_is_left) || - (curve_is_left && - _curve_compare_at_intersection_left (c2, curve, p) == LARGER)); + return + ((!curve_is_left) || + (curve_is_left && + _curve_compare_at_intersection_left (c2, curve, p) == LARGER)); } else { - return (!curve_is_left && - _curve_compare_at_intersection_right (c2, curve, p) == SMALLER); + return + (!curve_is_left && + _curve_compare_at_intersection_right (c2, curve, p) == SMALLER); } } else @@ -574,15 +596,17 @@ class Arr_conic_traits // c1 is a vertical segment going down: if (c2_is_left) { - return (curve_is_left && - _curve_compare_at_intersection_left (c2, curve, p) == LARGER); + return + (curve_is_left && + _curve_compare_at_intersection_left (c2, curve, p) == LARGER); } else { - return ((curve_is_left) || - (curve_vertical == 1) || - (!curve_is_left && - _curve_compare_at_intersection_right (c2, curve, p) == SMALLER)); + return + ((curve_is_left) || + (curve_vertical == 1) || + (!curve_is_left && + _curve_compare_at_intersection_right (c2, curve, p) == SMALLER)); } } } @@ -606,15 +630,17 @@ class Arr_conic_traits // c2 is a vertical segment going up: if (c1_is_left) { - return (curve_is_left && - _curve_compare_at_intersection_left (c1, curve, p) == SMALLER); + return + (curve_is_left && + _curve_compare_at_intersection_left (c1, curve, p) == SMALLER); } else { - return ((curve_is_left) || - (curve_vertical == -1) || - (!curve_is_left && - _curve_compare_at_intersection_right (c1, curve, p) == LARGER)); + return + ((curve_is_left) || + (curve_vertical == -1) || + (!curve_is_left && + _curve_compare_at_intersection_right (c1, curve, p) == LARGER)); } } else @@ -622,15 +648,17 @@ class Arr_conic_traits // c2 is a vertical segment going down: if (c1_is_left) { - return ((!curve_is_left) || - (curve_vertical == 1) || - (curve_is_left && - _curve_compare_at_intersection_left (c1, curve, p) == SMALLER)); + return + ((!curve_is_left) || + (curve_vertical == 1) || + (curve_is_left && + _curve_compare_at_intersection_left (c1, curve, p) == SMALLER)); } else { - return ((!curve_is_left) && - _curve_compare_at_intersection_right (c1, curve, p) == LARGER); + return + ((!curve_is_left) && + _curve_compare_at_intersection_right (c1, curve, p) == LARGER); } } } @@ -673,16 +701,18 @@ class Arr_conic_traits if (_curve_compare_at_intersection_left (c1, c2, p) == LARGER) { // c1 is above c2: - return (!curve_is_left || - !(_curve_compare_at_intersection_left (c2, curve, p) == SMALLER && - _curve_compare_at_intersection_left (c1, curve, p) == LARGER)); + return + (!curve_is_left || + !(_curve_compare_at_intersection_left (c2, curve, p) == SMALLER && + _curve_compare_at_intersection_left (c1, curve, p) == LARGER)); } else { // c2 is above c1: - return (curve_is_left && - _curve_compare_at_intersection_left (c1, curve, p) == SMALLER && - _curve_compare_at_intersection_left (c2, curve, p) == LARGER); + return + (curve_is_left && + _curve_compare_at_intersection_left (c1, curve, p) == SMALLER && + _curve_compare_at_intersection_left (c2, curve, p) == LARGER); } } else if (!c1_is_left && !c2_is_left) @@ -694,16 +724,18 @@ class Arr_conic_traits if (_curve_compare_at_intersection_right (c1, c2, p) == LARGER) { // c1 is above c2: - return (!curve_is_left && - _curve_compare_at_intersection_right (c2, curve, p) == SMALLER && - _curve_compare_at_intersection_right (c1, curve, p) == LARGER); + return + (!curve_is_left && + _curve_compare_at_intersection_right (c2, curve, p) == SMALLER && + _curve_compare_at_intersection_right (c1, curve, p) == LARGER); } else { // c2 is above c1: - return (curve_is_left || - !(_curve_compare_at_intersection_right (c1, curve, p) == SMALLER && - _curve_compare_at_intersection_right (c2, curve, p) == LARGER)); + return + (curve_is_left || + !(_curve_compare_at_intersection_right (c1, curve, p) == SMALLER && + _curve_compare_at_intersection_right (c2, curve, p) == LARGER)); } } else if (c1_is_left && !c2_is_left) diff --git a/Packages/Arrangement/include/CGAL/Arr_segment_exact_traits.h b/Packages/Arrangement/include/CGAL/Arr_segment_exact_traits.h index 8e71103a870..739909ea96e 100644 --- a/Packages/Arrangement/include/CGAL/Arr_segment_exact_traits.h +++ b/Packages/Arrangement/include/CGAL/Arr_segment_exact_traits.h @@ -8,11 +8,11 @@ // // ---------------------------------------------------------------------- // -// release : -// release_date : 1999, October 13 +// release : $$ +// release_date : $$ // // file : include/CGAL/Arr_segment_exact_traits.h -// package : arr (1.03) +// package : Arrangement (1.03) // source : // revision : // revision_date : diff --git a/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2.h b/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2.h index c90dfdb9c5a..37d002cd5e2 100644 --- a/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2.h +++ b/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2.h @@ -1,3 +1,23 @@ +// ====================================================================== +// +// Copyright (c) 1999 The CGAL Consortium +// +// This software and related documentation is part of an INTERNAL release +// of the Computational Geometry Algorithms Library (CGAL). It is not +// intended for general use. +// +// ---------------------------------------------------------------------- +// +// release : $$ +// release_date : $$ +// +// file : include/CGAL/Arrangement_2/Conic_arc_2_eq.h +// package : Arrangement (2.62) +// author(s) : Ron Wein +// +// coordinator : Tel-Aviv University (Dan Halperin ) +// +// ====================================================================== #ifndef CGAL_CONIC_ARC_2_H #define CGAL_CONIC_ARC_2_H diff --git a/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2_eq.h b/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2_eq.h index eb42714fdf3..b4680fbb4b9 100644 --- a/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2_eq.h +++ b/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2_eq.h @@ -1,3 +1,23 @@ +// ====================================================================== +// +// Copyright (c) 1999 The CGAL Consortium +// +// This software and related documentation is part of an INTERNAL release +// of the Computational Geometry Algorithms Library (CGAL). It is not +// intended for general use. +// +// ---------------------------------------------------------------------- +// +// release : $$ +// release_date : $$ +// +// file : include/CGAL/Arrangement_2/Conic_arc_2_eq.h +// package : Arrangement (2.62) +// author(s) : Ron Wein +// +// coordinator : Tel-Aviv University (Dan Halperin ) +// +// ====================================================================== #ifndef CGAL_CONIC_ARC_2_EQ_H #define CGAL_CONIC_ARC_2_EQ_H diff --git a/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2_point.h b/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2_point.h index 8f892f6b54a..43b25ea8d9f 100644 --- a/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2_point.h +++ b/Packages/Arrangement/include/CGAL/Arrangement_2/Conic_arc_2_point.h @@ -1,3 +1,26 @@ +// ====================================================================== +// +// Copyright (c) 1999 The CGAL Consortium +// +// This software and related documentation is part of an INTERNAL release +// of the Computational Geometry Algorithms Library (CGAL). It is not +// intended for general use. +// +// ---------------------------------------------------------------------- +// +// release : $$ +// release_date : $$ +// +// file : include/CGAL/Arrangement_2/Conic_arc_2_point.h +// package : Arrangement (2.62) +// author(s) : Ron Wein +// +// coordinator : Tel-Aviv University (Dan Halperin ) +// +// ====================================================================== +#ifndef CGAL_CONIC_ARC_2_POINT_H +#define CGAL_CONIC_ARC_2_POINT_H + CGAL_BEGIN_NAMESPACE template @@ -466,3 +489,6 @@ private: }; CGAL_END_NAMESPACE + +#endif + diff --git a/Packages/Arrangement/include/CGAL/Arrangement_2/Polynom.h b/Packages/Arrangement/include/CGAL/Arrangement_2/Polynom.h index a2bcb8c1216..acfbd6dce22 100644 --- a/Packages/Arrangement/include/CGAL/Arrangement_2/Polynom.h +++ b/Packages/Arrangement/include/CGAL/Arrangement_2/Polynom.h @@ -1,5 +1,25 @@ -#ifndef __Polynom__ -#define __Polynom__ +// ====================================================================== +// +// Copyright (c) 1999 The CGAL Consortium +// +// This software and related documentation is part of an INTERNAL release +// of the Computational Geometry Algorithms Library (CGAL). It is not +// intended for general use. +// +// ---------------------------------------------------------------------- +// +// release : $$ +// release_date : $$ +// +// file : include/CGAL/Arrangement_2/Polynom.h +// package : Arrangement (2.62) +// author(s) : Ron Wein +// +// coordinator : Tel-Aviv University (Dan Halperin ) +// +// ====================================================================== +#ifndef CGAL_POLYNOM_H +#define CGAL_POLYNOM_H #include #include diff --git a/Packages/Arrangement/include/CGAL/Arrangement_2/Sturm_seq.h b/Packages/Arrangement/include/CGAL/Arrangement_2/Sturm_seq.h index ba458fe0c55..e0ad161af70 100644 --- a/Packages/Arrangement/include/CGAL/Arrangement_2/Sturm_seq.h +++ b/Packages/Arrangement/include/CGAL/Arrangement_2/Sturm_seq.h @@ -1,5 +1,25 @@ -#ifndef __STURM_SEQ__ -#define __STURM_SEQ__ +// ====================================================================== +// +// Copyright (c) 1999 The CGAL Consortium +// +// This software and related documentation is part of an INTERNAL release +// of the Computational Geometry Algorithms Library (CGAL). It is not +// intended for general use. +// +// ---------------------------------------------------------------------- +// +// release : $$ +// release_date : $$ +// +// file : include/CGAL/Arrangement_2/Sturm_seq.h +// package : Arrangement (2.62) +// author(s) : Ron Wein +// +// coordinator : Tel-Aviv University (Dan Halperin ) +// +// ====================================================================== +#ifndef CGAL_STURM_SEQ_H +#define CGAL_STURM_SEQ_H #include #include