 |
My Project
debian-1:4.1.1-p2+ds-4build2
|
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 152 of file ntupel.cc.
163 number *C=(number*)
omAlloc(
i*
sizeof(number));
167 C[
i]=d[
i]->cfAdd(
A[
i],
B[
i],d[
i]);
169 if (d[
i]==
NULL)
return (number)C;
◆ nnChineseRemainder()
◆ nnCoeffName()
Definition at line 547 of file ntupel.cc.
554 char *
s=d[
i]->cfCoeffName(d[
i]);
557 if (d[
i]==
NULL)
break;
◆ nnCoeffString()
Definition at line 527 of file ntupel.cc.
529 #define SI_BUF_SIZE 1024
536 char *
s=d[
i]->cfCoeffName(d[
i]);
539 if (d[
i]==
NULL)
break;
◆ nnCoeffWrite()
Definition at line 28 of file ntupel.cc.
34 d[
i]->cfCoeffWrite(d[
i],
b);
36 if (d[
i]==
NULL)
break;
◆ nnCopy()
Definition at line 132 of file ntupel.cc.
142 number *C=(number*)
omAlloc(
i*
sizeof(number));
146 C[
i]=d[
i]->cfCopy(
A[
i],d[
i]);
148 if (d[
i]==
NULL)
return (number)C;
◆ nnDBTest()
◆ nnDelete()
◆ nnDiv()
static number nnDiv |
( |
number |
a, |
|
|
number |
b, |
|
|
const coeffs |
r |
|
) |
| |
|
static |
Definition at line 233 of file ntupel.cc.
249 number *C=(number*)
omAlloc(
i*
sizeof(number));
253 C[
i]=d[
i]->cfDiv(
A[
i],
B[
i],d[
i]);
255 if (d[
i]==
NULL)
return (number)C;
◆ nnEqual()
◆ nnGreater()
Definition at line 303 of file ntupel.cc.
311 if (d[
i]->type==
n_R)
return d[
i]->cfGreater(
A[
i],
B[
i],d[
i]);
316 return d[
i-1]->cfGreater(
A[
i],
B[
i],d[
i-1]);
◆ nnGreaterZero()
Definition at line 42 of file ntupel.cc.
48 if (d[
i]->type==
n_R)
return d[
i]->cfGreaterZero(
k,d[
i]);
49 if (d[
i]->type==
n_long_R)
return d[
i]->cfGreaterZero(
k,d[
i]);
51 if (d[
i]==
NULL)
return d[
i-1]->cfGreaterZero(
k,d[
i-1]);
◆ nnInit()
Definition at line 79 of file ntupel.cc.
88 number *C=(number*)
omAlloc(
i*
sizeof(number));
92 C[
i]=d[
i]->cfInit(
l,d[
i]);
94 if (d[
i]==
NULL)
return (number)C;
◆ nnInitChar()
◆ nnInpNeg()
◆ nnInt()
Definition at line 101 of file ntupel.cc.
107 if (d[
i]->type==
n_R)
return d[
i]->cfInt(n,d[
i]);
108 if (d[
i]->type==
n_long_R)
return d[
i]->cfInt(n,d[
i]);
110 if (d[
i]==
NULL)
return d[
i-1]->cfInt(n,d[
i-1]);
◆ nnInvers()
Definition at line 259 of file ntupel.cc.
274 number *C=(number*)
omAlloc(
i*
sizeof(number));
278 C[
i]=d[
i]->cfInvers(
A[
i],d[
i]);
280 if (d[
i]==
NULL)
return (number)C;
◆ nnIsMOne()
◆ nnIsOne()
◆ nnIsZero()
◆ nnMap()
Definition at line 500 of file ntupel.cc.
509 number *C=(number*)
omAlloc(
i*
sizeof(number));
514 nMap=d[
i]->cfSetMap(aRing,d[
i]);
515 if (nMap==
NULL)
Werror(
"no map for compoment %d",
i);
516 else C[
i]=nMap(from,aRing,d[
i]);
518 if (d[
i]==
NULL)
return (number)C;
◆ nnMult()
static number nnMult |
( |
number |
a, |
|
|
number |
b, |
|
|
const coeffs |
r |
|
) |
| |
|
static |
Definition at line 55 of file ntupel.cc.
66 number *C=(number*)
omAlloc(
i*
sizeof(number));
70 C[
i]=d[
i]->cfMult(
A[
i],
B[
i],d[
i]);
72 if (d[
i]==
NULL)
return (number)C;
◆ nnRead()
Definition at line 384 of file ntupel.cc.
394 number *C=(number*)
omAlloc0(
i*
sizeof(number));
401 if ((d[
i]->type==
n_R)
404 s=d[
i]->cfRead(
s,&(C[
i]),d[
i]);
405 is_zero=d[
i]->cfIsZero(C[
i],d[
i]);
412 s=d[
i-1]->cfRead(
s,&(C[
i-1]),d[
i-1]);
413 is_zero=d[
i-1]->cfIsZero(C[
i-1],d[
i-1]);
425 if (d[
i]->type==
n_Zp)
431 }
while(
l%(d[
i]->ch)==0);
432 C[
i]=d[
i]->cfInit(
l,d[
i]);
434 else if ((d[
i]->type==
n_R)
438 C[
i]=nMap(C[reader],d[reader],d[
i]);
442 WerrorS(
"reading is not suppiorted for such compinations of coeffs");
447 if (d[
i]==
NULL)
break;
455 C[
i]=d[
i]->cfInit(0,d[
i]);
457 if (d[
i]==
NULL)
break;
462 s=d[0]->cfRead(
s,&(C[0]),d[0]);
466 if (d[
i]==
NULL)
break;
470 C[
i]=nMap(C[0],d[0],d[
i]);
476 WerrorS(
"nnRead: should not happen");
◆ nnSetMap()
◆ nnSize()
Definition at line 114 of file ntupel.cc.
121 if (d[
i]->type==
n_R)
s+=d[
i]->cfSize(n,d[
i]);
126 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 173 of file ntupel.cc.
184 number *C=(number*)
omAlloc(
i*
sizeof(number));
188 C[
i]=d[
i]->cfSub(
A[
i],
B[
i],d[
i]);
190 if (d[
i]==
NULL)
return (number)C;
◆ nnWriteLong()
◆ nnWriteShort()
Definition at line 335 of file ntupel.cc.
342 if (d[
i]->type==
n_R) { d[
i]->cfWriteLong(
A[
i],d[
i]);
return; }
343 else if (d[
i]->type==
n_long_R) {d[
i]->cfWriteLong(
A[
i],d[
i]);
return; }
345 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 char * nnCoeffString(const coeffs r)
static int nnSize(number n, const coeffs r)
@ n_nTupel
n-tupel of cf: ZZ/p1,...
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)
@ n_long_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)
@ n_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 si_char_SI_BUF_SIZE nnCoeffName_buf
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)