42 wroteCoef=(bNotShortOut)
56 wroteCoef=(bNotShortOut)
66 for (i=0; i<
rVar(r); i++)
75 wroteCoef=(bNotShortOut);
109 lmRing->ShortOut = bLMShortOut;
110 tailRing->ShortOut = bTAILShortOut;
124 lmRing->ShortOut =
FALSE;
125 tailRing->ShortOut =
FALSE;
129 lmRing->ShortOut = bLMShortOut;
130 tailRing->ShortOut = bTAILShortOut;
145 if ((
p_GetComp(p, lmRing) == 0) || (!lmRing->VectorOut))
177 if (p ==
NULL)
break;
210 #if !defined(__OPTIMIZE__) || defined(KDEBUG) 235 void p_wrp(poly
p, ring lmRing, ring tailRing)
const CanonicalForm int s
char * p_String(poly p, ring lmRing, ring tailRing)
static BOOLEAN p_LmIsConstantComp(const poly p, const ring r)
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
static BOOLEAN rField_is_R(const ring r)
static BOOLEAN rShortOut(const ring r)
static short rVar(const ring r)
#define rVar(r) (r->N)
void p_String0Short(const poly p, ring lmRing, ring tailRing)
if possible print p in a short way...
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
static char const ** rParameter(const ring r)
(r->cf->parameter)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
static BOOLEAN rCanShortOut(const ring r)
static FORCE_INLINE void n_WriteLong(number n, const coeffs r)
write to the output buffer of the currently used reporter
void p_Write(poly p, ring lmRing, ring tailRing)
void p_wrp(poly p, ring lmRing, ring tailRing)
void p_Write0(poly p, ring lmRing, ring tailRing)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
The main handler for Singular numbers which are suitable for Singular polynomials.
void StringSetS(const char *st)
void StringAppendS(const char *st)
void p_String0Long(const poly p, ring lmRing, ring tailRing)
print p in a long way...
static FORCE_INLINE BOOLEAN nCoeff_is_transExt(const coeffs r)
TRUE iff r represents a transcendental extension field.
void PrintS(const char *s)
static char * rRingVar(short i, const ring r)
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
void p_wrp0(poly p, ring ri)
static BOOLEAN rField_is_long_C(const ring r)
void p_Normalize(poly p, const ring r)
static BOOLEAN rField_is_long_R(const ring r)
void p_String0(poly p, ring lmRing, ring tailRing)
print p according to ShortOut in lmRing & tailRing
static FORCE_INLINE BOOLEAN n_IsMOne(number n, const coeffs r)
TRUE iff 'n' represents the additive inverse of the one element, i.e. -1.
static FORCE_INLINE BOOLEAN n_GreaterZero(number n, const coeffs r)
ordered fields: TRUE iff 'n' is positive; in Z/pZ: TRUE iff 0 < m <= roundedBelow(p/2), where m is the long representing n in C: TRUE iff (Im(n) != 0 and Im(n) >= 0) or (Im(n) == 0 and Re(n) >= 0) in K(a)/<p(a)>: TRUE iff (n != 0 and (LC(n) > 0 or deg(n) > 0)) in K(t_1, ..., t_n): TRUE iff (LC(numerator(n) is a constant and > 0) or (LC(numerator(n) is not a constant) in Z/2^kZ: TRUE iff 0 < n <= 2^(k-1) in Z/mZ: TRUE iff the internal mpz is greater than zero in Z: TRUE iff n > 0
static FORCE_INLINE void n_WriteShort(number n, const coeffs r)
write to the output buffer of the currently used reporter in a shortest possible way, e.g. in K(a): a2 instead of a^2
static void writemon(poly p, int ko, const ring r)