25{
29
32
37 )
38 )
39 {
40 if( bNotShortOut )
42 else
44
45 wroteCoef=(bNotShortOut)
49 }
51 {
53 {
54 if( bNotShortOut )
56 else
58
59 wroteCoef=(bNotShortOut)
63 }
64 else
66 }
67
69 {
71 {
72 {
74 if (ee!=0L)
75 {
76 if (wroteCoef)
78
79 wroteCoef=(bNotShortOut);
82 if (ee != 1L)
83 {
86 }
87 }
88 }
89 }
90 }
91
93 {
96 }
97}
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 void n_WriteLong(number n, const coeffs r)
write to the output buffer of the currently used reporter
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,...
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
The main handler for Singular numbers which are suitable for Singular polynomials.
static BOOLEAN p_LmIsConstantComp(const poly p, const ring r)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
static BOOLEAN rField_is_R(const ring r)
static BOOLEAN rField_is_long_C(const ring r)
static char * rRingVar(short i, const ring r)
static char const ** rParameter(const ring r)
(r->cf->parameter)
static BOOLEAN rField_is_long_R(const ring r)
static short rVar(const ring r)
#define rVar(r) (r->N)