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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
// Copyright (c) 1999 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.2-branch/Number_types/include/CGAL/leda_integer.h $
// $Id: leda_integer.h 28567 2006-02-16 14:30:13Z lsaboret $
//
//
// Author(s) : Andreas Fabri
#ifndef CGAL_LEDA_INTEGER_H
#define CGAL_LEDA_INTEGER_H
#include <CGAL/basic.h>
#include <CGAL/Number_type_traits.h>
#include <CGAL/Interval_nt.h>
#include <utility>
#include <CGAL/LEDA_basic.h>
#include <LEDA/integer.h>
CGAL_BEGIN_NAMESPACE
template <> struct Number_type_traits<leda_integer> {
typedef Tag_true Has_gcd;
typedef Tag_true Has_division;
typedef Tag_true Has_sqrt;
typedef Tag_true Has_exact_ring_operations;
typedef Tag_false Has_exact_division;
typedef Tag_false Has_exact_sqrt;
};
inline
double
to_double(const leda_integer & i)
{ return i.to_double(); }
inline
leda_integer
sqrt(const leda_integer & i)
{ return CGAL_LEDA_SCOPE::sqrt(i); }
inline
bool
is_finite(const leda_integer &)
{ return true; }
inline
bool
is_valid(const leda_integer &)
{ return true; }
inline
io_Operator
io_tag(const leda_integer &)
{ return io_Operator(); }
inline
Sign
sign(const leda_integer& n)
{ return (Sign) CGAL_LEDA_SCOPE::sign(n); }
inline
leda_integer
div( const leda_integer& n1, const leda_integer& n2)
{
return n1 / n2;
}
// missing mixed operators
inline
bool
operator==(int a, const leda_integer& b)
{ return b == a; }
inline
bool
operator!=(int a, const leda_integer& b)
{ return b != a; }
inline
std::pair<double,double>
to_interval (const leda_integer & n)
{
Protect_FPU_rounding<true> P (CGAL_FE_TONEAREST);
double cn = CGAL::to_double(n);
leda_integer pn = ( n>0 ? n : -n);
if ( pn.iszero() || log(pn) < 53 )
return to_interval(cn);
else {
FPU_set_cw(CGAL_FE_UPWARD);
Interval_nt_advanced ina(cn);
ina += Interval_nt_advanced::smallest();
return ina.pair();
}
}
inline
leda_integer
gcd( const leda_integer& n1, const leda_integer& n2)
{
return CGAL_LEDA_SCOPE::gcd(n1, n2);
}
CGAL_END_NAMESPACE
#endif // CGAL_LEDA_INTEGER_H
|
