11 #include <factory/factory.h>
136 mpz_init_set_ui(m, i);
139 number res1=
reinterpret_cast<number
>(
res);
147 number res1=
reinterpret_cast<number
>(
res);
261 else {
return FALSE; }
390 r->nNULL = (number) 0;
393 r->has_simple_Alloc=
TRUE;
394 r->has_simple_Inverse=
TRUE;
number nAEGcd(number a, number b, const coeffs r)
BOOLEAN nAEGreater(number a, number b, const coeffs r)
BOOLEAN nAEClearDenominators(number a, const coeffs r)
const CanonicalForm int s
BOOLEAN n_AEInitChar(coeffs r, void *)
const char * nAERead(const char *s, number *a, const coeffs r)
void poly_gcd(int_poly, int_poly)
number nAEInitMPZ(mpz_t m, const coeffs r)
void nAEDelete(number *a, const coeffs r)
number ndCopyMap(number a, const coeffs aRing, const coeffs r)
void poly_sub_to(const int_poly)
BOOLEAN nAEIsZero(number a, const coeffs r)
BOOLEAN nAEClearContent(number a, const coeffs r)
BOOLEAN nAEIsOne(number a, const coeffs r)
long nAEInt(number &a, const coeffs r)
void poly_mult_n(int_poly, int_poly)
number nAESetMap(number a, const coeffs r)
number nAENormalize(number a, number b, const coeffs r)
number nAELcm(number a, number b, const coeffs r)
number nAECopy(number a, number b, const coeffs r)
void nAEPower(number a, int i, number *result, const coeffs r)
BOOLEAN nAEEqual(number a, number b, const coeffs r)
number nAENeg(number c, const coeffs r)
BOOLEAN nAEIsMOne(number a, const coeffs r)
number nAEIntMod(number a, number b, const coeffs r)
Coefficient rings, fields and other domains suitable for Singular polynomials.
void nAEInpMult(number &a, number b, const coeffs r)
int is_equal(const int_poly) const
The main handler for Singular numbers which are suitable for Singular polynomials.
void poly_set(const int_poly)
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
number nAEGetDenom(number &a, const coeffs r)
number nAEInit(long i, const coeffs r)
number nAEAdd(number a, number b, const coeffs r)
number nAEGetNumerator(number &a, const coeffs r)
number nAEMPZ(number a, const coeffs r)
void poly_div_to(int_poly &, int_poly &, const int_poly)
void poly_mult_n_to(const int_poly)
int nAESize(number a, const coeffs r)
static char * n_AECoeffName(const coeffs r)
number nAERePart(number a, number b, const coeffs r)
number nAESub(number a, number b, const coeffs r)
void nAEWriteShort(number a, const coeffs r)
BOOLEAN nAECoeffIsEqual(number a, number b, const coeffs r)
number nAEDiv(number a, number b, const coeffs r)
number nAEExactDiv(number a, number b, const coeffs r)
number nAEImPart(number a, number b, const coeffs r)
void nAEWriteLong(number a, const coeffs r)
BOOLEAN nAEGreaterZero(number a, number b, const coeffs r)
number nAEMult(number a, number b, const coeffs r)
void poly_add_to(const int_poly)
void nAECoeffWrite(const coeffs r, BOOLEAN details)