11 #include <factory/factory.h> 65 extern unsigned short *npInvTable;
75 #pragma GCC diagnostic ignored "-Wlong-long" 81 #define ULONG64 (unsigned long long)(unsigned long) 83 #define ULONG64 (unsigned long) 101 int h = (int)((
long)
k);
102 return ((
int)h !=0) && (h <= (r->ch>>1));
118 if (((
long)a == 0) || ((
long)b == 0))
130 long ii=i % (long)r->ch;
131 if (ii < 0L) ii += (long)r->ch;
133 number c = (number)ii;
147 if ((
long)n > (((
long)r->ch) >>1))
return ((
long)n -((
long)r->ch));
148 else return ((
long)n);
156 number c =
npAddM(a,b, r);
193 return ((r->npPminus1M == (
long)a)&&(1L!=(
long)a));
214 XGCD(d, s, t,
a, R->ch);
217 long u,
v, u0, v0, u1, v1, u2, v2, q,
r;
248 number d = (number)(
long)r->npExpTable[r->npPminus1M - r->npLogTable[(long)c]];
250 long inv=(long)r->npInvTable[(
long)c];
254 r->npInvTable[(long)c]=inv;
256 number d = (number)inv;
283 int s = r->npLogTable[(long)a] - r->npLogTable[(
long)
b];
286 d = (number)(
long)r->npExpTable[
s];
316 if ((
long)c==0L)
return c;
335 return ((
long)a) > ((long)b);
352 if ((
long)a>(((
long)r->ch) >>1))
StringAppend(
"-%d",(
int)(((
long)r->ch)-((
long)a)));
381 if (((*s) >=
'0') && ((*s) <=
'9'))
390 while (((*s) >=
'0') && ((*s) <=
'9'));
391 if (ii >= (
unsigned long)r->ch) ii = ii % r->ch;
410 *a = (number)(
long)z;
418 *a =
nvDiv((number)(
long)z,(number)(
long)n,r);
421 *a =
npDiv((number)(
long)z,(number)(
long)n,r);
435 if (r->npInvTable!=
NULL)
436 omFreeSize( (
void *)r->npInvTable, r->ch*
sizeof(
unsigned short) );
439 if (r->npExpTable!=
NULL)
441 omFreeSize( (
void *)r->npExpTable, r->ch*
sizeof(
unsigned short) );
442 omFreeSize( (
void *)r->npLogTable, r->ch*
sizeof(
unsigned short) );
443 r->npExpTable=
NULL; r->npLogTable=
NULL;
451 return (n==
n_Zp) && (r->ch==(int)(
long)parameter);
476 snprintf(s,11,
"%d",r->ch);
482 fprintf(f,
"%d ",(
int)(
long)n);
490 return (number)(long)dd;
501 const int c = (int) (
long)
p;
512 r->npPminus1M = c - 1;
561 r->cfExactDiv=
nvDiv;
582 r->nNULL = (number)0;
585 r->has_simple_Alloc=
TRUE;
586 r->has_simple_Inverse=
TRUE;
593 #if !defined(HAVE_DIV_MOD) || !defined(HAVE_MULT_MOD) 594 r->npExpTable=(
unsigned short *)
omAlloc( r->ch*
sizeof(
unsigned short) );
595 r->npLogTable=(
unsigned short *)
omAlloc( r->ch*
sizeof(
unsigned short) );
596 r->npExpTable[0] = 1;
597 r->npLogTable[0] = 0;
603 r->npLogTable[1] = 0;
609 r->npExpTable[
i] =(int)(((
long)w * (long)r->npExpTable[i-1]) % r->ch);
610 r->npLogTable[r->npExpTable[
i]] =
i;
611 if ( r->npExpTable[
i] == 1 )
620 r->npExpTable[1] = 1;
621 r->npLogTable[1] = 0;
625 r->npInvTable=(
unsigned short*)
omAlloc0( r->ch*
sizeof(
unsigned short) );
634 if (((
long)a<0L) || ((
long)a>(
long)r->ch))
636 Print(
"wrong mod p number %ld at %s,%d\n",(
long)a,f,l);
649 while (i < 0) i+=dst_r->ch;
666 size = (*f)[0]._mp_size;
680 e=(*f)[0]._mp_exp-
size;
692 al = dest->_mp_size =
size;
694 dd = (mp_ptr)
omAlloc(
sizeof(mp_limb_t)*al);
695 for (i=0;i<
size;i++) dd[i] = qp[i];
697 nn = (mp_ptr)
omAlloc(
sizeof(mp_limb_t)*bl);
699 for (i=bl-2;i>=0;i--) nn[i] = 0;
702 ndest->_mp_alloc = ndest->_mp_size = bl;
704 in=mpz_fdiv_ui(ndest,dst_r->ch);
709 al = dest->_mp_size = size+e;
711 dd = (mp_ptr)
omAlloc(
sizeof(mp_limb_t)*al);
712 for (i=0;i<
size;i++) dd[i+e] = qp[i];
713 for (i=0;i<e;i++) dd[i] = 0;
718 dest->_mp_alloc = al;
719 iz=mpz_fdiv_ui(dest,dst_r->ch);
722 iz=(long)
npDiv((number)iz,(number)in,dst_r);
733 mpz_ptr erg = (mpz_ptr)
omAlloc(
sizeof(mpz_t));
736 mpz_mod_ui(erg, (mpz_ptr) from, dst->ch);
737 number r = (number) mpz_get_si(erg);
759 long i = (long) (((
unsigned long) from) % dst->ch);
768 return (number) (f.
intval());
842 long u, u0, u1, u2, q,
r;
883 else if ((
long)b==0L)
926 Print(
"// characteristic : %d\n",r->ch);
const CanonicalForm int s
unsigned short * npExpTable
static FORCE_INLINE BOOLEAN nCoeff_is_Zp(const coeffs r)
static number npMultM(number a, number b, const coeffs r)
number npInit(long i, const coeffs r)
long npInt(number &n, const coeffs r)
number npMapZ(number from, const coeffs src, const coeffs dst)
number nvInvers(number c, const coeffs r)
number ndCopyMap(number a, const coeffs aRing, const coeffs r)
static FORCE_INLINE BOOLEAN nCoeff_is_long_R(const coeffs r)
void npPower(number a, int i, number *result, const coeffs r)
number npInvers(number c, const coeffs r)
#define npEqualM(A, B, r)
number nvMult(number a, number b, const coeffs r)
long nvInvMod(long a, const coeffs R)
#define omFreeSize(addr, size)
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_2toM(const coeffs r)
(), see rinteger.h, new impl.
number npAdd(number a, number b, const coeffs r)
void nvInpMult(number &a, number b, const coeffs r)
number npMapP(number from, const coeffs src, const coeffs r)
void npWrite(number a, const coeffs r)
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
number npDiv(number a, number b, const coeffs r)
void WerrorS(const char *s)
static number npReadFd(s_buff f, const coeffs r)
BOOLEAN npEqual(number a, number b, const coeffs r)
BOOLEAN npInitChar(coeffs r, void *p)
BOOLEAN npDBTest(number a, const char *f, const int l, const coeffs r)
virtual class for internal CanonicalForm's
static void npWriteFd(number n, FILE *f, const coeffs r)
static number npNegM(number a, const coeffs r)
number npInversM(number c, const coeffs r)
static number npSubM(number a, number b, const coeffs r)
static number npRandom(siRandProc p, number, number, const coeffs cf)
number npMapMachineInt(number from, const coeffs, const coeffs dst)
BOOLEAN npGreater(number a, number b, const coeffs r)
number nvDiv(number a, number b, const coeffs r)
unsigned short * npLogTable
BOOLEAN npIsMOne(number a, const coeffs r)
Coefficient rings, fields and other domains suitable for Singular polynomials.
void npCoeffWrite(const coeffs r, BOOLEAN details)
static FORCE_INLINE BOOLEAN nCoeff_is_CF(const coeffs r)
static const n_coeffType ID
Our Type!
The main handler for Singular numbers which are suitable for Singular polynomials.
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
BOOLEAN npGreaterZero(number k, const coeffs r)
number nlModP(number q, const coeffs Q, const coeffs Zp)
static const char * npEati(const char *s, int *i, const coeffs r)
#define n_Test(a, r)
BOOLEAN n_Test(number a, const coeffs r)
static number npAddM(number a, number b, const coeffs r)
const char *const nDivBy0
nMapFunc npSetMap(const coeffs src, const coeffs dst)
(mpz_ptr), see rmodulon,h
static number npMapLongR(number from, const coeffs, const coeffs dst_r)
static char * npCoeffString(const coeffs r)
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
number npSub(number a, number b, const coeffs r)
number npConvFactoryNSingN(const CanonicalForm n, const coeffs r)
const Variable & v
< [in] a sqrfree bivariate poly
unsigned long InvMod(unsigned long a, const coeffs r)
number npNeg(number c, const coeffs r)
number npMult(number a, number b, const coeffs r)
CanonicalForm npConvSingNFactoryN(number n, BOOLEAN setChar, const coeffs r)
static BOOLEAN npCoeffsEqual(const coeffs r, n_coeffType n, void *parameter)
number nvInversM(number c, const coeffs r)
void npKillChar(coeffs r)
const char * npRead(const char *s, number *a, const coeffs r)
BOOLEAN npIsOne(number a, const coeffs r)
number npMapGMP(number from, const coeffs, const coeffs dst)
BOOLEAN npIsZero(number a, const coeffs r)
static number nvMultM(number a, number b, const coeffs r)
number npMapCanonicalForm(number a, const coeffs, const coeffs dst)