 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the source code of this file.
|
static void | writemon (poly p, int ko, const ring r) |
|
void | p_String0Short (const poly p, ring lmRing, ring tailRing) |
| if possible print p in a short way... More...
|
|
void | p_String0Long (const poly p, ring lmRing, ring tailRing) |
| print p in a long way... More...
|
|
void | p_String0 (poly p, ring lmRing, ring tailRing) |
| print p according to ShortOut in lmRing & tailRing More...
|
|
char * | p_String (poly p, ring lmRing, ring tailRing) |
|
void | p_Write0 (poly p, ring lmRing, ring tailRing) |
|
void | p_Write (poly p, ring lmRing, ring tailRing) |
|
void | p_wrp0 (poly p, ring ri) |
|
void | p_wrp (poly p, ring lmRing, ring tailRing) |
|
◆ p_String()
char* p_String |
( |
poly |
p, |
|
|
ring |
lmRing, |
|
|
ring |
tailRing |
|
) |
| |
◆ p_String0()
void p_String0 |
( |
poly |
p, |
|
|
ring |
lmRing, |
|
|
ring |
tailRing |
|
) |
| |
print p according to ShortOut in lmRing & tailRing
Definition at line 134 of file polys0.cc.
145 if ((
p_GetComp(
p, lmRing) == 0) || (!lmRing->VectorOut))
177 if (
p ==
NULL)
break;
◆ p_String0Long()
void p_String0Long |
( |
const poly |
p, |
|
|
ring |
lmRing, |
|
|
ring |
tailRing |
|
) |
| |
print p in a long way...
print p in a long way
Definition at line 114 of file polys0.cc.
124 lmRing->ShortOut =
FALSE;
125 tailRing->ShortOut =
FALSE;
129 lmRing->ShortOut = bLMShortOut;
130 tailRing->ShortOut = bTAILShortOut;
◆ p_String0Short()
void p_String0Short |
( |
const poly |
p, |
|
|
ring |
lmRing, |
|
|
ring |
tailRing |
|
) |
| |
if possible print p in a short way...
print p in a short way, if possible
Definition at line 95 of file polys0.cc.
109 lmRing->ShortOut = bLMShortOut;
110 tailRing->ShortOut = bTAILShortOut;
◆ p_Write()
void p_Write |
( |
poly |
p, |
|
|
ring |
lmRing, |
|
|
ring |
tailRing |
|
) |
| |
◆ p_Write0()
void p_Write0 |
( |
poly |
p, |
|
|
ring |
lmRing, |
|
|
ring |
tailRing |
|
) |
| |
◆ p_wrp()
void p_wrp |
( |
poly |
p, |
|
|
ring |
lmRing, |
|
|
ring |
tailRing |
|
) |
| |
◆ p_wrp0()
void p_wrp0 |
( |
poly |
p, |
|
|
ring |
ri |
|
) |
| |
◆ writemon()
static void writemon |
( |
poly |
p, |
|
|
int |
ko, |
|
|
const ring |
r |
|
) |
| |
|
static |
Definition at line 21 of file polys0.cc.
42 wroteCoef=(bNotShortOut)
56 wroteCoef=(bNotShortOut)
75 wroteCoef=(bNotShortOut);
static FORCE_INLINE void n_WriteLong(number n, const coeffs r)
write to the output buffer of the currently used reporter
static BOOLEAN rField_is_long_R(const ring r)
static void writemon(poly p, int ko, const ring r)
void StringAppendS(const char *st)
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:
void p_Normalize(poly p, const ring r)
static BOOLEAN rCanShortOut(const ring r)
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
char * p_String(poly p, ring lmRing, ring tailRing)
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
static short rVar(const ring r)
#define rVar(r) (r->N)
void PrintS(const char *s)
static char * rRingVar(short i, const ring r)
void p_Write0(poly p, ring lmRing, ring tailRing)
The main handler for Singular numbers which are suitable for Singular polynomials.
static BOOLEAN rField_is_R(const ring r)
static FORCE_INLINE BOOLEAN nCoeff_is_transExt(const coeffs r)
TRUE iff r represents a transcendental extension field.
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,...
void StringSetS(const char *st)
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),...
const CanonicalForm int s
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
void p_String0(poly p, ring lmRing, ring tailRing)
print p according to ShortOut in lmRing & tailRing
static char const ** rParameter(const ring r)
(r->cf->parameter)
static BOOLEAN rField_is_long_C(const ring r)
static BOOLEAN rShortOut(const ring r)