1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
// Copyright (c) 2000,2001,2002,2003 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.6-branch/Filtered_kernel/examples/Filtered_kernel/Cartesian_I.h $
// $Id: Cartesian_I.h 51161 2009-08-10 15:57:03Z spion $
//
//
// Author(s) : Herve Bronnimann, Sylvain Pion
#ifndef CGAL_CARTESIAN_I_H
#define CGAL_CARTESIAN_I_H
#include <CGAL/Cartesian/Cartesian_base.h>
#include <CGAL/Handle_for.h>
#include <CGAL/Kernel/Type_equality_wrapper.h>
CGAL_BEGIN_NAMESPACE
namespace CartesianKernelFunctors {
template <typename K>
class Intersect_with_iterators_2
{
public:
typedef typename K::Point_2 Point_2;
typedef typename K::Segment_2 Segment_2;
public:
typedef void result_type;
Intersect_with_iterators_2() {}
template <typename OutputIterator>
OutputIterator
operator()(const Segment_2& s1, const Segment_2& s2, OutputIterator it ) const
{
Object o = typename K::Intersect_2()(s1, s2);
if(! o.is_empty()){
*it = o;
it++;
}
return it;
}
};
} // namespace CartesianKernelFunctors
template < typename FT_, typename Kernel_ >
struct Cartesian_base_ref_count_I
: public Cartesian_base< Kernel_, FT_ >
{
typedef FT_ RT;
typedef FT_ FT;
// The mechanism that allows to specify reference-counting or not.
template < typename T >
struct Handle { typedef Handle_for<T> type; };
template < typename Kernel2 >
struct Base { typedef Cartesian_base_ref_count_I<FT_, Kernel2> Type; };
// TODO: cleanup (use Rational_traits<> instead)
static FT make_FT(const RT & num, const RT& denom) { return num/denom;}
static FT make_FT(const RT & num) { return num;}
static RT FT_numerator(const FT &r) { return r;}
static RT FT_denominator(const FT &) { return RT(1);}
// was in Cartesian_base
typedef Kernel_ K;
#define CGAL_Kernel_pred(Y,Z) typedef CartesianKernelFunctors::Y<K> Y; \
Y Z() const { return Y(); }
#define CGAL_Kernel_cons(Y,Z) CGAL_Kernel_pred(Y,Z)
CGAL_Kernel_cons(Intersect_with_iterators_2,
intersect_with_iterators_2_object)
#include <CGAL/Kernel/interface_macros.h>
};
template < typename FT_ >
struct Cartesian_I
: public Type_equality_wrapper<
Cartesian_base_ref_count_I<FT_, Cartesian_I<FT_> >,
Cartesian_I<FT_> >
{};
CGAL_END_NAMESPACE
#endif // CGAL_CARTESIAN_I_H
|
