/usr/include/CGAL/Gmpfi.h is in libcgal-dev 4.2-5ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 | // Copyright (c) 2007-2009 Inria Lorraine (France). 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; either version 3 of the License,
// or (at your option) any later version.
//
// 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$
// $Id$
//
// Author: Luis PeƱaranda <luis.penaranda@gmx.com>
// Michael Hemmer <Michael.Hemmer@sophia.inria.fr>
#ifndef CGAL_GMPFI_H
#define CGAL_GMPFI_H
#include <CGAL/GMP/Gmpfi_type.h>
#include <CGAL/number_type_basic.h>
#include <CGAL/mpfi_coercion_traits.h>
#include <CGAL/Interval_traits.h>
#include <CGAL/Bigfloat_interval_traits.h>
namespace CGAL{
template <>
class Algebraic_structure_traits<Gmpfi>:
public Algebraic_structure_traits_base<Gmpfi,Field_with_kth_root_tag>{
public:
typedef Tag_false Is_exact;
typedef Tag_true Is_numerical_sensitive;
typedef Uncertain<bool> Boolean;
struct Is_zero:
public std::unary_function<Type,Boolean>{
Boolean operator()(const Type &x)const{
return x.is_zero();
}
};
struct Is_one:
public std::unary_function<Type,Boolean>{
Boolean operator()(const Type &x)const{
return x.is_one();
}
};
struct Square:
public std::unary_function<Type,Type>{
Type operator()(const Type &x)const{
return x.square();
};
};
struct Is_square:
public std::binary_function<Type,Type&,Boolean>{
Boolean operator()(const Type &x)const{
return x.is_square();
};
Boolean operator()(const Type &x,Type &y)const{
return x.is_square(y);
};
};
struct Sqrt:
public std::unary_function<Type,Type>{
Type operator()(const Type &x)const{
return x.sqrt();
};
};
struct Kth_Root:
public std::binary_function<int,Type,Type>{
Type operator()(int k,const Type &x)const{
return (k==3?x.cbrt():x.kthroot(k));
};
};
struct Divides:
public std::binary_function<Type,Type,Boolean>{
Boolean operator()(const Type &d,const Type &n)const{
// Avoid compiler warning
(void)n;
return !(d.is_zero());
};
Boolean operator()(const Type &d,const Type &n,Type &c)const{
return d.divides(n,c);
};
};
};
template <>
class Real_embeddable_traits<Gmpfi>:
public INTERN_RET::Real_embeddable_traits_base<Gmpfi,CGAL::Tag_true>{
typedef Algebraic_structure_traits<Type> AST;
public:
typedef Tag_true Is_real_embeddable;
typedef Uncertain<bool> Boolean;
typedef Uncertain<CGAL::Comparison_result> Comparison_result;
typedef Uncertain<CGAL::Sign> Sign;
typedef AST::Is_zero Is_zero;
struct Is_finite:
public std::unary_function<Type,Boolean>{
inline Boolean operator()(const Type &x)const{
return(x.is_number());
};
};
struct Abs:
public std::unary_function<Type,Type>{
inline Type operator()(const Type &x)const{
return x.abs();
};
};
struct Sgn:
public std::unary_function<Type,Sign>{
inline Sign operator()(const Type &x)const{
return x.sign();
};
};
struct Is_positive:
public std::unary_function<Type,Boolean>{
inline Boolean operator()(const Type &x)const{
return x.is_positive();
};
};
struct Is_negative:
public std::unary_function<Type,Boolean>{
inline Boolean operator()(const Type &x)const{
return x.is_negative();
};
};
struct Compare:
public std::binary_function<Type,Type,Comparison_result>{
inline Comparison_result operator()
(const Type &x,const Type &y)const{
return x.compare(y);
};
CGAL_IMPLICIT_INTEROPERABLE_BINARY_OPERATOR_WITH_RT(Type,Comparison_result)
};
struct To_double:
public std::unary_function<Type,double>{
inline double operator()(const Type &x)const{
return x.to_double();
};
};
struct To_interval:
public std::unary_function<Type,std::pair<double,double> >{
inline std::pair<double,double> operator()(const Type &x)const{
return x.to_interval();
};
};
};
template<>
class Interval_traits<Gmpfi>
: public internal::Interval_traits_base<Gmpfi>{
public:
typedef Interval_traits<Gmpfi> Self;
typedef Gmpfi Interval;
typedef CGAL::Gmpfr Bound;
typedef CGAL::Tag_false With_empty_interval;
typedef CGAL::Tag_true Is_interval;
struct Construct :public std::binary_function<Bound,Bound,Interval>{
Interval operator()( const Bound& l,const Bound& r) const {
CGAL_precondition( l < r );
return Interval(std::make_pair(l,r));
}
};
struct Lower :public std::unary_function<Interval,Bound>{
Bound operator()( const Interval& a ) const {
return a.inf();
}
};
struct Upper :public std::unary_function<Interval,Bound>{
Bound operator()( const Interval& a ) const {
return a.sup();
}
};
struct Width :public std::unary_function<Interval,Bound>{
Bound operator()( const Interval& a ) const {
return Gmpfr::sub(a.sup(),a.inf(),std::round_toward_infinity);
}
};
struct Median :public std::unary_function<Interval,Bound>{
Bound operator()( const Interval& a ) const {
return (a.inf()+a.sup())/2;
}
};
struct Norm :public std::unary_function<Interval,Bound>{
Bound operator()( const Interval& a ) const {
return a.abs().sup();
}
};
struct Singleton :public std::unary_function<Interval,bool>{
bool operator()( const Interval& a ) const {
return a.inf() == a.sup();
}
};
struct Zero_in :public std::unary_function<Interval,bool>{
bool operator()( const Interval& a ) const {
return a.inf() <= 0 && 0 <= a.sup();
}
};
struct In :public std::binary_function<Bound,Interval,bool>{
bool operator()( Bound x, const Interval& a ) const {
return a.inf() <= x && x <= a.sup();
}
};
struct Equal :public std::binary_function<Interval,Interval,bool>{
bool operator()( const Interval& a, const Interval& b ) const {
return a.is_same(b);
}
};
struct Overlap :public std::binary_function<Interval,Interval,bool>{
bool operator()( const Interval& a, const Interval& b ) const {
return a.do_overlap(b);
}
};
struct Subset :public std::binary_function<Interval,Interval,bool>{
bool operator()( const Interval& a, const Interval& b ) const {
return b.inf() <= a.inf() && a.sup() <= b.sup() ;
}
};
struct Proper_subset :public std::binary_function<Interval,Interval,bool>{
bool operator()( const Interval& a, const Interval& b ) const {
return Subset()(a,b) && ! Equal()(a,b);
}
};
struct Hull :public std::binary_function<Interval,Interval,Interval>{
Interval operator()( const Interval& a, const Interval& b ) const {
BOOST_USING_STD_MAX();
BOOST_USING_STD_MIN();
return Interval(
std::make_pair(
min BOOST_PREVENT_MACRO_SUBSTITUTION (a.inf(),b.inf()),
max BOOST_PREVENT_MACRO_SUBSTITUTION (a.sup(),b.sup())));
}
};
// struct Empty is Null_functor
struct Intersection :public std::binary_function<Interval,Interval,Interval>{
Interval operator()( const Interval& a, const Interval& b ) const {
BOOST_USING_STD_MAX();
BOOST_USING_STD_MIN();
Bound l(max BOOST_PREVENT_MACRO_SUBSTITUTION (Lower()(a),Lower()(b)));
Bound u(min BOOST_PREVENT_MACRO_SUBSTITUTION (Upper()(a),Upper()(b)));
if(u < l ) throw Exception_intersection_is_empty();
return Construct()(l,u);
}
};
};
template<>
class Bigfloat_interval_traits<Gmpfi>
:public Interval_traits<Gmpfi>
{
typedef Gmpfi NT;
typedef CGAL::Gmpfr BF;
public:
typedef Bigfloat_interval_traits<Gmpfi> Self;
typedef CGAL::Tag_true Is_bigfloat_interval;
struct Relative_precision: public std::unary_function<NT,long>{
long operator()(const NT& x) const {
CGAL_precondition(!Singleton()(x));
CGAL_precondition(!CGAL::zero_in(x));
// w = |x| * 2^-p (return p)
BF w(CGAL::width(x));
mpfr_div(w.fr(), w.fr(), CGAL::lower(CGAL::abs(x)).fr(), GMP_RNDU);
mpfr_log2(w.fr(), w.fr(), GMP_RNDU);
return -mpfr_get_si(w.fr(), GMP_RNDU);
}
};
struct Set_precision {
// type for the \c AdaptableUnaryFunction concept.
typedef long argument_type;
// type for the \c AdaptableUnaryFunction concept.
typedef long result_type;
long operator()( long prec ) const {
return Gmpfi::set_default_precision(prec);
}
};
struct Get_precision {
// type for the \c AdaptableGenerator concept.
typedef long result_type;
long operator()() const {
return Gmpfi::get_default_precision();
}
};
};
} // namespace CGAL
namespace Eigen {
template<class> struct NumTraits;
template<> struct NumTraits<CGAL::Gmpfi>
{
typedef CGAL::Gmpfi Real;
typedef CGAL::Gmpfi NonInteger;
typedef CGAL::Gmpfi Nested;
static inline Real epsilon() { return 0; }
enum {
IsInteger = 0,
IsSigned = 1,
IsComplex = 0,
RequireInitialization = 1,
ReadCost = 12,
AddCost = 100,
MulCost = 100
};
};
}
#include <CGAL/GMP/Gmpfi_type.h>
#include <CGAL/GMP_arithmetic_kernel.h>
#endif // CGAL_GMPFI_H
// vim: tabstop=8: softtabstop=8: smarttab: shiftwidth=8: expandtab
|