/usr/include/singular/gfanlib/gfanlib_z.h is in libsingular4-dev-common 4.0.3+ds-1.
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 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 | /*
* lib_z.h
*
* Created on: Sep 28, 2010
* Author: anders
*/
#ifndef LIB_Z_H_
#define LIB_Z_H_
#include <string.h>
#include <iostream>
#include <ostream>
#define OLD 1
#if OLD
#include "gmp.h"
namespace gfan{
class Rational;
class Integer
{
friend class Rational;
mpz_t value;
public:
static bool isField()
{
return false;
}
Integer()
{
mpz_init(value);
}
Integer(signed long int value_)
{
mpz_init(value);
mpz_set_si(value,value_);
}
Integer(Integer const & value_)
{
mpz_init_set(value,value_.value);
}
Integer(mpz_t value_)
{
mpz_init_set(value,value_);
}
~Integer()
{
mpz_clear(value);
}
Integer& operator=(const Integer& a)
{
const Integer *A=(const Integer*)&a;
if (this != A) {
mpz_clear(value);
mpz_init_set(value, a.value);
}
return *this;
}
bool isZero()const{
return mpz_sgn(value)==0;
}
bool isOne()const{
return mpz_cmp_si(value,1);
}
friend std::ostream &operator<<(std::ostream &f, Integer const &a)
{
void (*freefunc)(void *, size_t);
mp_get_memory_functions(0,0,&freefunc);
char *str=mpz_get_str(0,10,a.value);
f<<str;
freefunc(str,strlen(str)+1);
return f;
}
void debugPrint() const
{
void (*freefunc)(void *, size_t);
mp_get_memory_functions(0,0,&freefunc);
char *str=mpz_get_str(0,10,value);
std::cout << str;
freefunc(str,strlen(str)+1);
return;
}
Integer& operator+=(const Integer& a)
{
mpz_add(value,value,a.value);
return *this;
}
Integer& operator-=(const Integer& a)
{
mpz_sub(value,value,a.value);
return *this;
}
Integer& operator*=(const Integer& a)
{
mpz_mul(value,value,a.value);
return *this;
}
Integer& operator/=(const Integer& a)
{
mpz_div(value,value,a.value);
return *this;
}
friend Integer operator-(const Integer &b)
{
Integer ret;
ret-=b;
return ret;
}
Integer operator+(const Integer &a)const
{
Integer ret(*this);
ret+=a;
return ret;
}
Integer operator-(const Integer &a)const
{
Integer ret(*this);
ret-=a;
return ret;
}
Integer operator*(const Integer &a)const
{
Integer ret(*this);
ret*=a;
return ret;
}
Integer operator/(const Integer &a)const
{
Integer ret(*this);
ret/=a;
return ret;
}
void madd(const Integer &a,const Integer &b)
{
mpz_t temp;
mpz_init(temp);
mpz_mul(temp,a.value,b.value);
mpz_add(value,value,temp);
mpz_clear(temp);
}
bool operator<(const Integer &a)const
{
return mpz_cmp(value,a.value)<0;
}
bool operator==(const Integer &a)const
{
return mpz_cmp(value,a.value)==0;
}
bool operator!=(const Integer &a)const
{
return mpz_cmp(value,a.value)!=0;
}
int sign()const
{
return mpz_sgn(value);
}
static Integer gcd(Integer const &a, Integer const &b, Integer &s, Integer &t)
{
mpz_t r;
mpz_init(r);
mpz_gcdext(r,s.value,t.value,a.value,b.value);
Integer ret(r);
mpz_clear(r);
return ret;
}
static Integer gcd(Integer const &a, Integer const &b)
{
if (a.isOne() || b.isOne())
return Integer(1);
mpz_t r;
mpz_init(r);
mpz_gcd(r,a.value,b.value);
Integer ret(r);
mpz_clear(r);
return ret;
}
/**
* Assigns the value to z. z must have been initialized as a gmp variable.
*/
void setGmp(mpz_t z)const
{
mpz_set(z,value);
}
/**
* Returns a value which is useful for computing hash functions.
*/
signed long int hashValue()const
{
return mpz_get_si(value);
}
bool fitsInInt()const
{
mpz_t v;
mpz_init(v);
this->setGmp(v);
bool ret=(mpz_fits_sint_p(v)!=0);
mpz_clear(v);
return ret;
}
int toInt()const
{
mpz_t v;
mpz_init(v);
this->setGmp(v);
int ret=0;
if(mpz_fits_sint_p(v))
ret=mpz_get_si(v);
// else
// ok=false;
mpz_clear(v);
return ret;
}
};
}
#else
namespace gfan{
typedef signed long int word;//processor type for integers
typedef int64_t LimbWord;//memory word. Assumed to be at least as big as word
typedef uint64_t uLimbWord;//memory word. Assumed to be at least as big as word
const int limbSizeInBytes=8;
#include <stdint.h>
struct spec64malloc{
int64_t data;
bool hasLimbs()
{
return data&1;
}
word fitsMask()
{
return 0xc000000000000000;
}
void assign(word value)//assuming data fits
{
data=value<<1;
}
void alloc(int nlimbs)//one limb is added since that will tell the number of remaining limbs
{
int64_t temp=(int64_t)malloc((nlimbs+1)*limbSizeInBytes);
assert(temp);
data=temp+1;
}
LimbWord *limbs()//assuming that limbs exist
{
return (LimbWord*)(data-1);
}
word nlimbs()//assuming limbs exist
{
return (word)*limbs();
}
void copy(spec64malloc b)
{
if(hasLimbs())
{
word n2=b.nlimbs()+1;
int64_t temp=(int64_t)malloc((n2)*limbSizeInBytes);
assert(temp);
data=temp+1;
memcpy((LimbWord*)temp,limbs(),n2*limbSizeInBytes);
}
else
{
data=b.data;
}
}
void doFree()//assuming that limbs exist
{
free((void*)(data-1));
}
word valueToWord()//assume no limbs and that word is big enough to contain int64_t
{
return data>>1;
}
};
template <struct spec> struct IntegerTemplate : public spec
{
private:
bool fits(word v)
{
return !((value_&fitsMask())^((value_<<1)&fitsMask));
}
public:
static bool isField()
{
return false;
}
IntegerTemplate()
{
spec.data=0;
}
void assignWordNoFree()
{
if(fits(value_))
{
assign(value);
}
else
{
alloc(1);
limbs()[0]=1;
limbs()[1]=value_;
}
}
IntegerTemplate(word value_)
{
assignWordNoFree(value_);
}
IntegerTemplate(IntegerTemplate const & value_)
{
if(value_.hasLimbs())
{
copy(value_);
}
else
data=value.data;
}
/* Integer(mpz_t value_)
{
mpz_init_set(value,value_);
}*/
~IntegerTemplate()
{
if(hasLimbs())doFree();
}
IntegerTemplate& operator=(const IntegerTemplate& a)
{
if(this!=&a)
{
if(hasLimps())doFree();
copy(a);
}
return *this;
}
bool isZero()const{
return data==0;
}
friend std::ostream &operator<<(std::ostream &f, IntegerTemplate const &a)
{
if(hasLimps())
{
LimpWord *p=limbs();
int l=*p++;
for(int i=0;i<l;i++)
f<<":"<<p[i];
}
else
{
f<<valueToWord();
}
return f;
}
friend void debugPrint(IntegerTemplate const &a)
{
std::cout << a << std::endl;
return;
}
LimbWord signExtension(LimbWord a)
{
return 0-(a<0);
}
void addWordToLimbs(word v)
{
int n=nlimbs();
LimbWord V=v;
LimbWord *p=limbs()+1;
LimbWord s=signExtension(V);
for(int i=0;i<n;i++)
{
LimbWord r=V+*p;
bool carry=(uLimbWord)r<(uLimbWord)V;
V=carry+s;
}
}
IntegerTemplate& operator+=(const IntegerTemplate& a)
{
if(hasLimbs()||a.hasLimbs())
{
if(!hasLimbs())
{
}
else
{
}
}
else
{
word C=valueToWord();
word A=a.valueToWord();
word D=A+C;
assignWordNoFree(D);
}
return *this;
}
};
typedef IntegerTemplate<spec64malloc> Integer;
};
#endif
#endif /* LIB_Z_H_ */
|