20{
25 {
26 ll = 0;
28 }
30 poly q = &rp, r;
31 number n;
32 const unsigned long *spNoether_exp = spNoether->
exp;
34 omBin bin = ri->PolyBin;
35 DECLARE_LENGTH(
const unsigned long length = ri->ExpL_Size);
36 DECLARE_ORDSGN(const long* ordsgn = ri->ordsgn);
37 const unsigned long* m_e =
m->exp;
38 pAssume(!n_IsZero__T(ln,ri->cf));
41
42 do
43 {
45 p_MemSum__T(r->exp,
p->exp, m_e,
length);
46 p_MemAddAdjust__T(r, ri);
47
48 p_MemCmp__T(r->exp, spNoether_exp,
length, ordsgn,
goto Continue,
goto Continue,
goto Break);
49
50 Break:
52 break;
53
54 Continue:
55
57
58 #ifdef HAVE_RINGS
59 if(n_IsZero__T(n, ri->cf))
60 {
63 } else
64 #endif
65 {
69 }
70
72
74
75 if (ll < 0)
77 else
79
81
84}
static BOOLEAN length(leftv result, leftv arg)
#define p_FreeBinAddr(p, r)
#define p_AllocBin(p, bin, r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define n_Delete__T(n, r)
static int pLength(poly a)
static long p_MaxComp(poly p, ring lmRing, ring tailRing)