/usr/include/CGAL/long_long.h is in libcgal-dev 4.7-4.
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 | // Copyright (c) 1999,2001,2007
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// 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; 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(s) : Stefan Schirra, Michael Hemmer
// ISO C++ does not support `long long', but ISO C does, which means the next
// revision of ISO C++ probably will too. However, currently, g++ -pedantic
// produces a warning so we don't include this file by default.
#ifndef CGAL_LONG_LONG_H
#define CGAL_LONG_LONG_H
#include <CGAL/number_type_basic.h>
namespace CGAL {
template<> class Algebraic_structure_traits< long long int >
: public Algebraic_structure_traits_base< long long int,
Euclidean_ring_tag > {
public:
typedef Tag_true Is_exact;
typedef Tag_false Is_numerical_sensitive;
typedef INTERN_AST::Div_per_operator< Type > Div;
typedef INTERN_AST::Mod_per_operator< Type > Mod;
class Is_square
: public std::binary_function< Type, Type&,
bool > {
public:
bool operator()( const Type& x,
Type& y ) const {
y = (Type) std::sqrt( (double)x );
return x == y * y;
}
bool operator()( const Type& x) const {
Type y
= (Type) std::sqrt( (double)x );
return x == y * y;
}
};
};
template <> class Real_embeddable_traits< long long int >
: public INTERN_RET::Real_embeddable_traits_base< long long int , CGAL::Tag_true > {
public:
class To_interval
: public std::unary_function< Type, std::pair< double, double > > {
public:
std::pair<double, double> operator()( const Type& x ) const {
return Interval_nt<true>(x).pair();
}
};
};
// unsigned long long
template <> class Real_embeddable_traits< unsigned long long >
: public INTERN_RET::Real_embeddable_traits_base< unsigned long long , CGAL::Tag_true > {
public:
class To_interval
: public std::unary_function< Type, std::pair< double, double > > {
public:
std::pair<double, double> operator()( const Type& x ) const {
return Interval_nt<true>(x).pair();
}
};
};
#ifdef BOOST_HAS_INT128
// __int128
template<> class Algebraic_structure_traits< boost::int128_type >
: public Algebraic_structure_traits_base< boost::int128_type,
Euclidean_ring_tag > {
public:
typedef Tag_true Is_exact;
typedef Tag_false Is_numerical_sensitive;
typedef INTERN_AST::Div_per_operator< Type > Div;
typedef INTERN_AST::Mod_per_operator< Type > Mod;
};
template <> class Real_embeddable_traits< boost::int128_type >
: public INTERN_RET::Real_embeddable_traits_base< boost::int128_type , CGAL::Tag_true > {
public:
class To_interval
: public std::unary_function< Type, std::pair< double, double > > {
public:
std::pair<double, double> operator()( const Type& x ) const {
return (Interval_nt<>((double)x)+Interval_nt<>::smallest()).pair();
}
};
};
// unsigned __int128
template <> class Real_embeddable_traits< boost::uint128_type >
: public INTERN_RET::Real_embeddable_traits_base< boost::uint128_type , CGAL::Tag_true > {
public:
class To_interval
: public std::unary_function< Type, std::pair< double, double > > {
public:
std::pair<double, double> operator()( const Type& x ) const {
return (Interval_nt<>((double)x)+Interval_nt<>::smallest()).pair();
}
};
};
#endif
} //namespace CGAL
#include <CGAL/Interval_nt.h>
#endif // CGAL_LONG_LONG_H
|