20{
24
25#if PDEBUG > 0
27#endif
28
30
32
36
37
42
43
47
48 const unsigned long*
m_e =
m->exp;
49 omBin bin = r->PolyBin;
50
52
54
60
62
64
67#ifdef HAVE_ZERODIVISORS
69#endif
72 {
79 }
80 else
81 {
85 }
86#ifdef HAVE_ZERODIVISORS
87 }
88 else
89 {
91 }
92#endif
96
98
99
101#ifdef HAVE_ZERODIVISORS
104 {
105#endif
108#ifdef HAVE_ZERODIVISORS
109 }
110 else
111 {
113 }
115#endif
118 {
121 }
122
124
130
131
134 {
136 }
137 else
138 {
141 {
145 }
146 else
147 {
148 pNext(a) = r->p_Procs->pp_Mult_mm(q,
m, r);
149#ifdef HAVE_ZERODIVISORS
151 {
153 }
154#endif
155 }
157 }
158
164}
static BOOLEAN Equal(number a, number b, const coeffs)
static bool Greater(mono_type m1, mono_type m2)
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 poly p_LmFreeAndNext(poly p, ring)
static BOOLEAN rField_is_Domain(const ring r)