22#define SR_HDL(A) ((long)(A))
25#define SR_TO_INT(SR) (((long)SR) >> 2)
54 if (mpz_cmp_si(n,0L)==0)
60 else if (mpz_cmp_si(n,1L)==0)
66 if (mpz_cmp_si(z,0L)==0)
103 int l=mpz_sizeinbase(a->z,10);
104 if (a->s<2)
l=
si_max(
l,(
int)mpz_sizeinbase(a->n,10));
107 z=mpz_get_str(
s,10,a->z);
112 z=mpz_get_str(
s,10,a->n);
120void nlDebugWrite (number a)
133 int l=mpz_sizeinbase(a->z,10);
134 if (a->s<2)
l=
si_max(
l,(
int)mpz_sizeinbase(a->n,10));
137 z=mpz_get_str(
s,10,a->z);
142 z=mpz_get_str(
s,10,a->n);
static int si_max(const int a, const int b)
Coefficient rings, fields and other domains suitable for Singular polynomials.
const CanonicalForm int s
void WerrorS(const char *s)
const char * nlRead(const char *s, number *a, const coeffs r)
void nlWrite(number a, const coeffs)
number nlShort3_noinline(number x)
void nlNormalize(number &x, const coeffs r)
'SR_INT' is the type of those integers small enough to fit into 29 bits.
The main handler for Singular numbers which are suitable for Singular polynomials.
char * nEatLong(char *s, mpz_ptr i)
extracts a long integer from s, returns the rest
const char *const nDivBy0
#define omFreeSize(addr, size)
#define omGetSpecBin(size)
void StringAppendS(const char *st)
void PrintS(const char *s)