50 fprintf(stderr,
"\n// ***dPolyReportError: ");
51 vfprintf(stderr, fmt,
ap);
52 fprintf(stderr,
"\n occurred at\n");
58 fprintf(stderr,
" occurred for poly: ");
62 #ifndef MAKE_DISTRIBUTION
78 #if (OM_TRACK > 0) && defined(OM_TRACK_CUSTOM)
79 void* custom = omGetCustomOfAddr(
p);
88 "monomial not from specified ring",
p,r);
196 poly d_p =
p_Init(dest_ring);
198 assume(dest_ring->N == src_ring->N);
200 for (
i=1;
i<= src_ring->N;
i++)
265 long c1, cc1, ccc1, ec1;
269 if (o->
data.syzcomp.Components!=
NULL)
271 cc1 = o->
data.syzcomp.Components[c1];
272 ccc1 = o->
data.syzcomp.ShiftedComponents[cc1];
274 else { cc1=0; ccc1=0; }
277 ec1 =
p->exp[o->
data.syzcomp.place];
309 for (
i=r->N;
i>0;
i--)
346 poly pnext =
pNext(lm);
Coefficient rings, fields and other domains suitable for Singular polynomials.
#define n_Test(a, r)
BOOLEAN n_Test(number a, const coeffs r)
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
static FORCE_INLINE BOOLEAN n_DivBy(number a, number b, const coeffs r)
test whether 'a' is divisible 'b'; for r encoding a field: TRUE iff 'b' does not represent zero in Z:...
#define pPolyAssumeReturnMsg(cond, msg)
#define pFalseReturn(cond)
#define pAssumeReturn(cond)
#define _pPolyAssumeReturnMsg(cond, msg, p, r)
#define _pPolyAssumeReturn(cond, p, r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define rRing_has_Comp(r)
#define omSizeWOfBin(bin_ptr)
#define omIsBinPageAddr(addr)
#define omTestList(ptr, level)
static poly p_DebugInit(poly p, ring src_ring, ring dest_ring)
BOOLEAN pIsMonomOf(poly p, poly m)
BOOLEAN p_LmCheckPolyRing(poly p, ring r)
BOOLEAN _p_Test(poly p, ring r, int level)
BOOLEAN p_CheckIsFromRing(poly p, ring r)
void p_Setm_General(poly p, ring r)
BOOLEAN p_DebugLmDivisibleByNoComp(poly a, poly b, ring r)
STATIC_VAR BOOLEAN d_poly_error_reporting
BOOLEAN _p_LmTest(poly p, ring r, int level)
BOOLEAN dPolyReportError(poly p, ring r, const char *fmt,...)
BOOLEAN p_CheckRing(ring r)
BOOLEAN p_LmCheckIsFromRing(poly p, ring r)
BOOLEAN p_CheckPolyRing(poly p, ring r)
BOOLEAN pHaveCommonMonoms(poly p, poly q)
BOOLEAN _pp_Test(poly p, ring lmRing, ring tailRing, int level)
static BOOLEAN p_ExpVectorEqual(poly p1, poly p2, const ring r1, const ring r2)
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static int p_LmCmp(poly p, poly q, 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 void p_LmFree(poly p, ring)
static poly p_Init(const ring r, omBin bin)
void p_wrp(poly p, ring lmRing, ring tailRing)
BOOLEAN rSamePolyRep(ring r1, ring r2)
returns TRUE, if r1 and r2 represents the monomials in the same way FALSE, otherwise this is an analo...
union sro_ord::@006200034235045362245112336324125006204215012002 data
#define omTestBinAddrSize(A, B, C)
#define omPrintAddrInfo(A, B, C)
#define omPrintCurrentBackTraceMax(A, B)