songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Changed category name to Has_left

This commit is contained in:
Efi Fogel 2003-01-23 13:58:11 +00:00
parent 1ee563397d
commit c8a67a77f9
5 changed files with 17 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Packages/Arrangement/include/CGAL/Arr_circles_real_traits.h
View File

@ -24,7 +24,7 @@
#include <list>
#include <CGAL/Cartesian.h>
#include <CGAL/Arr_intersection_tags.h>
#include <CGAL/tags.h>
CGAL_BEGIN_NAMESPACE
@ -113,7 +113,9 @@ private:
template <class _NT>
class Arr_circles_real_traits {
public:
typedef Lazy_intersection_tag Intersection_category;
// Categories:
typedef Tag_false Has_left_category;
typedef _NT NT;
//the difference between Curve and X_curve is semantical only,

14
Packages/Arrangement/include/CGAL/Arr_conic_traits_2.h
View File

@ -22,14 +22,12 @@
#define CGAL_ARR_CONIC_TRAITS_2_H
#include <CGAL/basic.h>
#include <CGAL/Arr_intersection_tags.h>
#include <CGAL/tags.h>
#include "CGAL/Arrangement_2/Conic_arc_2.h"
#include <list>
CGAL_BEGIN_NAMESPACE
// #define REFLECT
// ----------------------------------------------------------------------------
// Arrangement traits for conic arcs.
//
@ -41,10 +39,12 @@ class Arr_conic_traits_2
typedef Kernel_ Kernel;
typedef typename Kernel::FT NT;
#if defined(REFLECT)
typedef Lazy_intersection_tag Intersection_category;
// Categories:
//#define HAS_LEFT_NOT
#if !defined(HAS_LEFT_NOT)
typedef Tag_true Has_left_category;
#else
typedef Efficient_intersection_tag Intersection_category;
typedef Tag_false Has_left_category;
#endif
// The difference between Curve_2 and X_curve_2 is semantical only,
@ -822,7 +822,7 @@ class Arr_conic_traits_2
Point_2::User_defined));
}
#if defined(REFLECT)
#if defined(HAS_LEFT_NOT)
// Reflect a point in y.
Point_2 point_reflect_in_y (const Point_2& p) const
{

4
Packages/Arrangement/include/CGAL/Arr_leda_polyline_traits.h
View File

@ -32,7 +32,7 @@
#include <CGAL/rat_leda_in_CGAL_2.h>
#include <LEDA/rat_point.h>
#include <CEP/Leda_rat_kernel/leda_rat_kernel_traits.h>
#include <CGAL/Arr_intersection_tags.h>
#include <CGAL/tags.h>
//the following is for a type check (creates compiler problems,not implemented)
//#include <typeinfo>
@ -44,7 +44,7 @@ template <class FT_, class Container = std::vector<leda_rat_point > >
class Arr_leda_polyline_traits : public leda_rat_kernel_traits
{
public:
typedef Lazy_intersection_tag Intersection_category;
typedef Tag_false Has_left_category;
typedef FT_ FT;
typedef Arr_leda_polyline_traits<FT,Container> Self;

4
Packages/Arrangement/include/CGAL/Arr_polyline_traits.h
View File

@ -37,7 +37,7 @@
#include <CGAL/squared_distance_2.h>
#include <CGAL/Pm_segment_traits_2.h>
#include <CGAL/Arr_intersection_tags.h>
#include <CGAL/tags.h>
CGAL_BEGIN_NAMESPACE
@ -46,7 +46,7 @@ template <class Kernel_,
class Arr_polyline_traits : public Kernel_
{
public:
typedef Lazy_intersection_tag Intersection_category;
typedef Tag_false Has_left_category;
typedef Kernel_ Kernel;
typedef Arr_polyline_traits<Kernel> Self;

4
Packages/Arrangement/include/CGAL/Arr_segment_circle_traits.h
View File

@ -25,7 +25,7 @@
#include <list>
#include <CGAL/Segment_circle_2.h>
#include <CGAL/Arr_intersection_tags.h>
#include <CGAL/tags.h>
CGAL_BEGIN_NAMESPACE
@ -37,7 +37,7 @@ template <class _NT>
class Arr_segment_circle_traits
{
public:
typedef Lazy_intersection_tag Intersection_category;
typedef Tag_false Has_left_category;
typedef _NT NT;