 |
My Project
debian-1:4.1.2-p1+ds-2
|
Go to the source code of this file.
|
static void | nnCoeffWrite (const coeffs r, BOOLEAN b) |
|
static BOOLEAN | nnGreaterZero (number k, const coeffs r) |
|
static number | nnMult (number a, number b, const coeffs r) |
|
static number | nnInit (long l, const coeffs r) |
|
static long | nnInt (number &n, const coeffs r) |
|
static int | nnSize (number n, const coeffs r) |
|
static number | nnCopy (number a, const coeffs r) |
|
static number | nnAdd (number a, number b, const coeffs r) |
|
static number | nnSub (number a, number b, const coeffs r) |
|
static BOOLEAN | nnIsZero (number a, const coeffs r) |
|
static BOOLEAN | nnIsOne (number a, const coeffs r) |
|
static BOOLEAN | nnIsMOne (number a, const coeffs r) |
|
static number | nnDiv (number a, number b, const coeffs r) |
|
static number | nnInvers (number a, const coeffs r) |
|
static number | nnInpNeg (number a, const coeffs r) |
|
static BOOLEAN | nnGreater (number a, number b, const coeffs r) |
|
static BOOLEAN | nnEqual (number a, number b, const coeffs r) |
|
static void | nnWriteShort (number a, const coeffs r) |
|
static void | nnWriteLong (number a, const coeffs r) |
|
static const char * | nnRead (const char *s, number *a, const coeffs r) |
|
BOOLEAN | nnDBTest (number a, const char *f, const int l, const coeffs r) |
|
static number | nnMap (number from, const coeffs aRing, const coeffs r) |
|
nMapFunc | nnSetMap (const coeffs src, const coeffs dst) |
|
static char * | nnCoeffString (const coeffs r) |
|
static char * | nnCoeffName (const coeffs r) |
|
static void | nnDelete (number *a, const coeffs r) |
|
static number | nnChineseRemainder (number *x, number *q, int rl, BOOLEAN sym, CFArray &inv_cache, const coeffs CF) |
|
BOOLEAN | nnInitChar (coeffs n, void *p) |
| Initialize r. More...
|
|
◆ SI_BUF_SIZE
◆ coeffs_array
◆ number_array
◆ si_char_SI_BUF_SIZE
◆ nnAdd()
static number nnAdd |
( |
number |
a, |
|
|
number |
b, |
|
|
const coeffs |
r |
|
) |
| |
|
static |
Definition at line 151 of file ntupel.cc.
162 number *C=(number*)
omAlloc(
i*
sizeof(number));
166 C[
i]=d[
i]->cfAdd(
A[
i],
B[
i],d[
i]);
168 if (d[
i]==
NULL)
return (number)C;
◆ nnChineseRemainder()
◆ nnCoeffName()
Definition at line 546 of file ntupel.cc.
553 char *
s=d[
i]->cfCoeffName(d[
i]);
556 if (d[
i]==
NULL)
break;
◆ nnCoeffString()
Definition at line 526 of file ntupel.cc.
528 #define SI_BUF_SIZE 1024
535 char *
s=d[
i]->cfCoeffName(d[
i]);
538 if (d[
i]==
NULL)
break;
◆ nnCoeffWrite()
Definition at line 27 of file ntupel.cc.
33 d[
i]->cfCoeffWrite(d[
i],
b);
35 if (d[
i]==
NULL)
break;
◆ nnCopy()
Definition at line 131 of file ntupel.cc.
141 number *C=(number*)
omAlloc(
i*
sizeof(number));
145 C[
i]=d[
i]->cfCopy(
A[
i],d[
i]);
147 if (d[
i]==
NULL)
return (number)C;
◆ nnDBTest()
◆ nnDelete()
◆ nnDiv()
static number nnDiv |
( |
number |
a, |
|
|
number |
b, |
|
|
const coeffs |
r |
|
) |
| |
|
static |
Definition at line 232 of file ntupel.cc.
248 number *C=(number*)
omAlloc(
i*
sizeof(number));
252 C[
i]=d[
i]->cfDiv(
A[
i],
B[
i],d[
i]);
254 if (d[
i]==
NULL)
return (number)C;
◆ nnEqual()
◆ nnGreater()
Definition at line 302 of file ntupel.cc.
310 if (d[
i]->type==
n_R)
return d[
i]->cfGreater(
A[
i],
B[
i],d[
i]);
315 return d[
i-1]->cfGreater(
A[
i],
B[
i],d[
i-1]);
◆ nnGreaterZero()
Definition at line 41 of file ntupel.cc.
47 if (d[
i]->type==
n_R)
return d[
i]->cfGreaterZero(
k,d[
i]);
48 if (d[
i]->type==
n_long_R)
return d[
i]->cfGreaterZero(
k,d[
i]);
50 if (d[
i]==
NULL)
return d[
i-1]->cfGreaterZero(
k,d[
i-1]);
◆ nnInit()
Definition at line 78 of file ntupel.cc.
87 number *C=(number*)
omAlloc(
i*
sizeof(number));
91 C[
i]=d[
i]->cfInit(
l,d[
i]);
93 if (d[
i]==
NULL)
return (number)C;
◆ nnInitChar()
◆ nnInpNeg()
◆ nnInt()
Definition at line 100 of file ntupel.cc.
106 if (d[
i]->type==
n_R)
return d[
i]->cfInt(n,d[
i]);
107 if (d[
i]->type==
n_long_R)
return d[
i]->cfInt(n,d[
i]);
109 if (d[
i]==
NULL)
return d[
i-1]->cfInt(n,d[
i-1]);
◆ nnInvers()
Definition at line 258 of file ntupel.cc.
273 number *C=(number*)
omAlloc(
i*
sizeof(number));
277 C[
i]=d[
i]->cfInvers(
A[
i],d[
i]);
279 if (d[
i]==
NULL)
return (number)C;
◆ nnIsMOne()
◆ nnIsOne()
◆ nnIsZero()
◆ nnMap()
Definition at line 499 of file ntupel.cc.
508 number *C=(number*)
omAlloc(
i*
sizeof(number));
513 nMap=d[
i]->cfSetMap(aRing,d[
i]);
514 if (nMap==
NULL)
Werror(
"no map for compoment %d",
i);
515 else C[
i]=nMap(from,aRing,d[
i]);
517 if (d[
i]==
NULL)
return (number)C;
◆ nnMult()
static number nnMult |
( |
number |
a, |
|
|
number |
b, |
|
|
const coeffs |
r |
|
) |
| |
|
static |
Definition at line 54 of file ntupel.cc.
65 number *C=(number*)
omAlloc(
i*
sizeof(number));
69 C[
i]=d[
i]->cfMult(
A[
i],
B[
i],d[
i]);
71 if (d[
i]==
NULL)
return (number)C;
◆ nnRead()
Definition at line 383 of file ntupel.cc.
393 number *C=(number*)
omAlloc0(
i*
sizeof(number));
400 if ((d[
i]->type==
n_R)
403 s=d[
i]->cfRead(
s,&(C[
i]),d[
i]);
404 is_zero=d[
i]->cfIsZero(C[
i],d[
i]);
411 s=d[
i-1]->cfRead(
s,&(C[
i-1]),d[
i-1]);
412 is_zero=d[
i-1]->cfIsZero(C[
i-1],d[
i-1]);
424 if (d[
i]->type==
n_Zp)
430 }
while(
l%(d[
i]->ch)==0);
431 C[
i]=d[
i]->cfInit(
l,d[
i]);
433 else if ((d[
i]->type==
n_R)
437 C[
i]=nMap(C[reader],d[reader],d[
i]);
441 WerrorS(
"reading is not suppiorted for such compinations of coeffs");
446 if (d[
i]==
NULL)
break;
454 C[
i]=d[
i]->cfInit(0,d[
i]);
456 if (d[
i]==
NULL)
break;
461 s=d[0]->cfRead(
s,&(C[0]),d[0]);
465 if (d[
i]==
NULL)
break;
469 C[
i]=nMap(C[0],d[0],d[
i]);
475 WerrorS(
"nnRead: should not happen");
◆ nnSetMap()
◆ nnSize()
Definition at line 113 of file ntupel.cc.
120 if (d[
i]->type==
n_R)
s+=d[
i]->cfSize(n,d[
i]);
125 if (
s==0)
return d[
i-1]->cfSize(n,d[
i-1]);
◆ nnSub()
static number nnSub |
( |
number |
a, |
|
|
number |
b, |
|
|
const coeffs |
r |
|
) |
| |
|
static |
Definition at line 172 of file ntupel.cc.
183 number *C=(number*)
omAlloc(
i*
sizeof(number));
187 C[
i]=d[
i]->cfSub(
A[
i],
B[
i],d[
i]);
189 if (d[
i]==
NULL)
return (number)C;
◆ nnWriteLong()
◆ nnWriteShort()
Definition at line 334 of file ntupel.cc.
341 if (d[
i]->type==
n_R) { d[
i]->cfWriteLong(
A[
i],d[
i]);
return; }
342 else if (d[
i]->type==
n_long_R) {d[
i]->cfWriteLong(
A[
i],d[
i]);
return; }
344 if (d[
i]==
NULL) { d[
i-1]->cfWriteLong(
A[
i-1],d[
i-1]);
return; }
◆ nnCoeffName_buf
void StringAppendS(const char *st)
static const char * nnRead(const char *s, number *a, const coeffs r)
static void nnWriteLong(number a, const coeffs r)
static BOOLEAN nnIsZero(number a, const coeffs r)
STATIC_VAR si_char_SI_BUF_SIZE nnCoeffName_buf
static char * nnCoeffString(const coeffs r)
static int nnSize(number n, const coeffs r)
static number nnDiv(number a, number b, const coeffs r)
static number nnMult(number a, number b, const coeffs r)
static void nnWriteShort(number a, const coeffs r)
real floating point (GMP) numbers
static BOOLEAN nnGreaterZero(number k, const coeffs r)
static BOOLEAN nnIsOne(number a, const coeffs r)
static number nnMap(number from, const coeffs aRing, const coeffs r)
static number nnInpNeg(number a, const coeffs r)
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
int status int void * buf
static void nnDelete(number *a, const coeffs r)
const char *const nDivBy0
void PrintS(const char *s)
#define omFreeSize(addr, size)
static number nnInit(long l, const coeffs r)
single prescision (6,6) real numbers
static BOOLEAN nnIsMOne(number a, const coeffs r)
static number nnSub(number a, number b, const coeffs r)
static number nnInvers(number a, const coeffs r)
static BOOLEAN nnGreater(number a, number b, const coeffs r)
static long nnInt(number &n, const coeffs r)
static number nnAdd(number a, number b, const coeffs r)
void StringSetS(const char *st)
static void nnCoeffWrite(const coeffs r, BOOLEAN b)
void Werror(const char *fmt,...)
static number nnChineseRemainder(number *x, number *q, int rl, BOOLEAN sym, CFArray &inv_cache, const coeffs CF)
void WerrorS(const char *s)
static BOOLEAN nnEqual(number a, number b, const coeffs r)
nMapFunc nnSetMap(const coeffs src, const coeffs dst)
const CanonicalForm int s
static number nnCopy(number a, const coeffs r)
static char * nnCoeffName(const coeffs r)
BOOLEAN nnDBTest(number a, const char *f, const int l, const coeffs r)