/usr/include/libnormaliz/integer.h is in libnormaliz-dev-common 3.5.1+ds-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 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 | /*
* Normaliz
* Copyright (C) 2007-2014 Winfried Bruns, Bogdan Ichim, Christof Soeger
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* As an exception, when this program is distributed through (i) the App Store
* by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or (iii) Google Play
* by Google Inc., then that store may impose any digital rights management,
* device limits and/or redistribution restrictions that are required by its
* terms of service.
*/
#ifndef INTEGER_H_
#define INTEGER_H_
#include <libnormaliz/general.h>
#include <list>
#include <vector>
#include <string>
#include <limits.h>
// Integer should (may) support:
// Integer abs(Integer); here implemented as Iabs
// Integer min(Integer, Integer); here we use the template min in <algorithm>
// It provides abs, gcd and lcm
//---------------------------------------------------------------------------
namespace libnormaliz {
using namespace std;
//---------------------------------------------------------------------------
// Basic functions
//---------------------------------------------------------------------------
// returns the absolute value of a
template<typename Integer> inline Integer Iabs(const Integer& a) {
return (a>=0) ? (a) : Integer(-a);
}
//returns gcd of a and b, if one is 0 returns the other integer
template<typename Integer> Integer gcd(const Integer& a, const Integer& b);
template<> mpz_class gcd<mpz_class>(const mpz_class& a, const mpz_class& b);
//returns lcm of a and b, returns 0 if one is 0
template<typename Integer> Integer lcm(const Integer& a, const Integer& b);
template<> mpz_class lcm(const mpz_class& a, const mpz_class& b);
// integer division a/b. Returns quot and rem = minimal remainder <= |b|/2
template<typename Integer>
void minimal_remainder(const Integer& a, const Integer&b, Integer& quot, Integer& rem);
// extended Euclidean algorithm: d=ua+vb
template <typename Integer>
Integer ext_gcd(const Integer& a, const Integer& b, Integer& u, Integer&v);
// minimizes u and v and makes d >= 0.
template <typename Integer>
void sign_adjust_and_minimize(const Integer& a, const Integer& b, Integer& d, Integer& u, Integer&v);
// the following functions behave like the C++ floating point functions with the same name
mpz_class floor(const mpq_class& q);
mpz_class ceil(const mpq_class& q);
mpz_class round(const mpq_class& q);
//---------------------------------------------------------------------------
// Conversions and checks
//---------------------------------------------------------------------------
// convert val to ret
// does the conversion and returns false if it fails
bool try_convert(long& ret, const long long& val);
inline bool try_convert(long long& ret, const long& val) {ret = val; return true;}
bool try_convert(long& ret, const mpz_class& val);
bool try_convert(long long& ret, const mpz_class& val);
inline bool try_convert(mpz_class& ret, const long& val) {ret = val; return true;}
bool try_convert(mpz_class& ret, const long long& val);
bool try_convert(nmz_float& ret, const long& val);
bool try_convert(nmz_float& ret, const long long& val);
bool try_convert(nmz_float& ret, const mpz_class& val);
bool try_convert(long& ret, const nmz_float& val);
bool try_convert(long long& ret, const nmz_float& val);
bool try_convert(mpz_class& ret, const nmz_float& val);
// template for same type "conversion"
template<typename Type>
inline bool try_convert(Type& ret, const Type& val) {ret = val; return true;}
inline bool try_convert(nmz_float& ret, const nmz_float& val) {ret = val; return true;}
bool fits_long_range(long long a);
template<typename Integer>
inline bool using_GMP() {
return false;
}
template<>
inline bool using_GMP<mpz_class>() {
return true;
}
template<typename Integer>
inline bool using_float() {
return false;
}
template<>
inline bool using_float<nmz_float>() {
return true;
}
template<typename Integer>
Integer int_max_value_dual();
template<typename Integer>
Integer int_max_value_primary();
//---------------------------------------------------------------------------
template<typename Integer>
inline bool check_range(const Integer& m) {
const Integer max_primary = int_max_value_primary<Integer>();
return (Iabs(m) <= max_primary);
}
template<>
inline bool check_range<mpz_class>(const mpz_class& m) {
return true;
}
template<>
inline bool check_range<nmz_float>(const nmz_float& m) {
return true;
}
template<>
inline bool check_range<mpq_class>(const mpq_class& m) {
return true;
}
//---------------------------------------------------------------------------
template<typename Integer>
void check_range_list(const std::list<std::vector<Integer> >& ll);
template<typename Integer> class CandidateList;
template<typename Integer> class Candidate;
template<typename Integer>
void check_range_list(const CandidateList<Integer>& ll);
template<typename Integer>
void check_range_list(const std::list<Candidate<Integer> >& ll);
//---------------------------------------------------------------------------
// String conversion functions
//---------------------------------------------------------------------------
// forward declaration to silence clang error:
// 'operator<<' should be declared prior to the call site or in the global namespace
template <typename T> std::ostream& operator<< (std::ostream& out, const vector<T>& vec);
template<typename Integer> string toString(Integer a) {
ostringstream ostream;
ostream << a;
return ostream.str();
}
template<> inline string toString(mpz_class a) {
return a.get_str();
}
template<> inline string toString(mpq_class a) {
return a.get_str();
}
// for the interpretation of a string as a decimal fraction or floating point number
mpq_class dec_fraction_to_mpq(string s);
nmz_float mpq_to_nmz_float(const mpq_class& val);
//----------------------------------------------------------------------
// the next function produce an integer quotient and determine whether
// there is a remainder
bool int_quotient(long long& Quot, const mpz_class& Num, const mpz_class& Den);
bool int_quotient(long& Quot, const long & Num, const long& Den);
bool int_quotient(long long& Quot, const long long& Num, const long long& Den);
bool int_quotient(mpz_class& Quot, const mpz_class& Num, const mpz_class& Den);
template<typename IntegerRet>
bool int_quotient(IntegerRet& Quot, const nmz_float& Num, const nmz_float& Den);
//---------------------------------------------------------------------------
template<typename Integer>
void minimal_remainder(const Integer& a, const Integer&b, Integer& quot, Integer& rem) {
quot=a/b;
rem=a-quot*b;
if(rem==0)
return;
if(2*Iabs(rem)>Iabs(b)){
if((rem<0 && b>0) || (rem >0 && b<0)){
rem+=b;
quot--;
}
else{
rem-=b;
quot++;
}
}
}
template <typename Integer>
void sign_adjust_and_minimize(const Integer& a, const Integer& b, Integer& d, Integer& u, Integer&v){
if(d<0){
d=-d;
u=-u;
v=-v;
}
// cout << u << " " << v << endl;
if(b==0)
return;
Integer sign=1;
if(a<0)
sign=-1;
Integer u1= (sign*u) % (Iabs(b)/d);
if(u1==0)
u1+=Iabs(b)/d;
u=sign*u1;
v=(d-a*u)/b;
}
template <typename Integer>
Integer ext_gcd(const Integer& a, const Integer& b, Integer& u, Integer&v){
u=1;
v=0;
Integer d=a;
if (b==0) {
sign_adjust_and_minimize(a,b,d,u,v);
return(d);
}
Integer v1=0;
Integer v3=b;
Integer q,t1,t3;
while(v3!=0){
q=d/v3;
t3=d-q*v3;
t1=u-q*v1;
u=v1;
d=v3;
v1=t1;
v3=t3;
}
sign_adjust_and_minimize(a,b,d,u,v);
return(d);
}
template <typename Integer>
size_t decimal_length(Integer a){
ostringstream test;
test << a;
return test.str().size();
}
//---------------------------------------------------------------------------
template <typename Integer>
Integer permutations(const size_t& a, const size_t& b){
unsigned long i;
Integer P=1;
for (i = a+1; i <= b; i++) {
P*=i;
}
return P;
}
//---------------------------------------------------------------------------
template<typename Integer>
Integer permutations_modulo(const size_t& a, const size_t& b, long m) {
unsigned long i;
Integer P=1;
for (i = a+1; i <= b; i++) {
P*=i; P%=m;
}
return P;
}
//---------------------------------------------------------------------------
// Special functions
//---------------------------------------------------------------------------
//return the number of decimals, needed to write the Integer a
template<typename Integer> size_t decimal_length(Integer a);
//returns b!/a!
template<typename Integer> Integer permutations(const size_t& a, const size_t& b);
template<typename Integer> Integer permutations_modulo(const size_t& a, const size_t& b, long m);
template<typename Integer>
mpz_class nmz_factorial(Integer n);
} // end libnormaliz
//---------------------------------------------------------------------------
#endif /* INTEGER_H_ */
//---------------------------------------------------------------------------
|