38 int i2=(int)(
long)
b->Data();
49 mpz_init_set_ui(modBase,i2);
52 if (mpz_popcount((mpz_ptr)modBase)==1)
55 if (i2<(8*
sizeof(
unsigned long)))
63 mpz_set_ui(modBase,2);
80 number i2=(number)
b->Data();
87 info.base= (mpz_ptr)modBase;
89 if (mpz_popcount(modBase)==1)
92 mp_bitcnt_t
l=mpz_scan1 (modBase,0);
93 if ((
l>0) && (
l<=8*
sizeof(
unsigned long)))
99 mpz_set_ui(modBase,2);
117 res->data=(
void*)(
long)(a2==b2);
123 ring
r=(ring)
a->Data();
137 number2 a2=(number2)
a->Data();
141 n_Power(a2->n,(
int)(
long)
b->Data(),&(
r->n),
r->cf);
163 a2=(number2)an->
Data();
164 b2=(number2)bn->
Data();
165 if (((a2!=
NULL) && (b2!=
NULL) && (a2->cf!=b2->cf))
173 WerrorS(
"Number not compatible");
180 if (
r->cf==
NULL) op=0;
183 case '+':
r->n=
n_Add(aa,bb,
r->cf);
break;
184 case '-':
r->n=
n_Sub(aa,bb,
r->cf);
break;
185 case '*':
r->n=
n_Mult(aa,bb,
r->cf);
break;
186 case '/':
r->n=
n_Div(aa,bb,
r->cf);
break;
204 Werror(
"cannot convert second operand (%s) to Number",
b->Name());
210 Werror(
"cannot convert first operand (%s) to Number",
a->Name());
218 number2 a2=(number2)
a->Data();
221 if (a2->cf==
NULL) op=0;
236 poly2 a2=(poly2)
a->Data();
262 a2=(poly2)an->
Data();
263 b2=(poly2)bn->
Data();
264 if (((a2!=
NULL) && (b2!=
NULL) && (a2->cf!=b2->cf))
272 WerrorS(
"Poly not compatible");
279 if (
r->cf==
NULL) op=0;
303 Werror(
"cannot convert second operand (%s) to Poly",
b->Name());
309 Werror(
"cannot convert first operand (%s) to Poly",
a->Name());
317 poly2 a2=(poly2)
a->Data();
320 if (a2->cf==
NULL) op=0;
323 case '-':
r->n=
p_Copy(a2->n,a2->cf);
r->n=
p_Neg(
r->n,a2->cf);
break;
341 r->n=
n_Init((
long)
a->Data(),
r->cf);
break;
358 number2 a2=(number2)
a->Data();
364 r->n=nMap(a2->n,a2->cf,
r->cf);
370 default: bo=
TRUE;
break;
384 number2 n=(number2)
a->Data();
386 res->data=(
void*)n->cf;
392 poly2 n=(poly2)
a->Data();
394 res->data=(
void*)n->cf;
413 (int)(
long)c->
Data(),
421 number2 n2=(number2)
a->Data();
438 number2 n2Copy(
const number2 d)
453 void n2Delete(number2 &d)
466 char *n2String(number2 d,
BOOLEAN typed)
479 void n2Print(number2 d)
481 char *
s=n2String(d,
FALSE);
490 poly2 p2Copy(
const poly2 d)
505 void p2Delete(poly2 &d)
518 char *p2String(poly2 d,
BOOLEAN typed)
531 void p2Print(poly2 d)
533 char *
s=p2String(d,
FALSE);
static FORCE_INLINE number n_Sub(number a, number b, const coeffs r)
return the difference of 'a' and 'b', i.e., a-b
static FORCE_INLINE number n_IntMod(number a, number b, const coeffs r)
for r a field, return n_Init(0,r) always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a n_IntMod(a,b,r) >=0
const CanonicalForm int s
int iiTestConvert(int inputType, int outputType)
Class used for (list of) interpreter objects.
only used if HAVE_RINGS is defined
BOOLEAN jjCRING_Zm(leftv res, leftv a, leftv b)
only used if HAVE_RINGS is defined
used for all transcendental extensions, i.e., the top-most extension in an extension tower is transce...
const struct sConvertTypes dConvertTypes[]
BOOLEAN iiConvert(int inputType, int outputType, int index, leftv input, leftv output, const struct sConvertTypes *dConvertTypes)
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
#define omFreeSize(addr, size)
BOOLEAN jjEQUAL_CR(leftv res, leftv a, leftv b)
void WerrorS(const char *s)
poly p_Sub(poly p1, poly p2, const ring r)
static poly p_Copy(poly p, const ring r)
returns a copy of p
char * crString(coeffs c)
static FORCE_INLINE number n_Mult(number a, number b, const coeffs r)
return the product of 'a' and 'b', i.e., a*b
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
only used if HAVE_RINGS is defined
The main handler for Singular numbers which are suitable for Singular polynomials.
static FORCE_INLINE number n_Add(number a, number b, const coeffs r)
return the sum of 'a' and 'b', i.e., a+b
void StringSetS(const char *st)
static poly pp_Mult_qq(poly p, poly q, const ring r)
void StringAppendS(const char *st)
const ExtensionInfo & info
< [in] sqrfree poly
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
static FORCE_INLINE char * nCoeffName(const coeffs cf)
static FORCE_INLINE number n_InpNeg(number n, const coeffs r)
in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)
only used if HAVE_RINGS is defined
void PrintS(const char *s)
void nlGMP(number &i, mpz_t n, const coeffs r)
static FORCE_INLINE nMapFunc n_SetMap(const coeffs src, const coeffs dst)
set the mapping function pointers for translating numbers from src to dst
BOOLEAN jjR2_CR(leftv res, leftv a)
void p_Write0(poly p, ring lmRing, ring tailRing)
static void p_Delete(poly *p, const ring r)
static FORCE_INLINE void n_Power(number a, int b, number *res, const coeffs r)
fill res with the power a^b
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
struct for passing initialization parameters to naInitChar
const char * Tok2Cmdname(int tok)
static FORCE_INLINE number n_Div(number a, number b, const coeffs r)
return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exceptio...
BOOLEAN jjCRING_Zp(leftv res, leftv a, leftv b)
void CleanUp(ring r=currRing)
static poly p_Neg(poly p, const ring r)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static poly p_Add_q(poly p, poly q, const ring r)
#define omFreeBin(addr, bin)
void nKillChar(coeffs r)
undo all initialisations
poly p_Power(poly p, int i, const ring r)
void Werror(const char *fmt,...)
coeffs nInitChar(n_coeffType t, void *parameter)
one-time initialisations for new coeffs in case of an error return NULL