1 | /**************************************** |
---|
2 | * Computer Algebra System SINGULAR * |
---|
3 | ****************************************/ |
---|
4 | /*************************************************************** |
---|
5 | * File: pp_Mult_mm__Template.cc |
---|
6 | * Purpose: template for p_Mult_n |
---|
7 | * Author: obachman (Olaf Bachmann) |
---|
8 | * Created: 8/00 |
---|
9 | *******************************************************************/ |
---|
10 | |
---|
11 | /*************************************************************** |
---|
12 | * |
---|
13 | * Returns: p*m |
---|
14 | * Const: p, m |
---|
15 | * |
---|
16 | ***************************************************************/ |
---|
17 | LINKAGE poly pp_Mult_mm__T(poly p, const poly m, const ring ri, poly &last) |
---|
18 | { |
---|
19 | p_Test(p, ri); |
---|
20 | p_LmTest(m, ri); |
---|
21 | if (p == NULL) |
---|
22 | { |
---|
23 | last = NULL; |
---|
24 | return NULL; |
---|
25 | } |
---|
26 | spolyrec rp; |
---|
27 | #ifdef HAVE_ZERODIVISORS |
---|
28 | rp.next = NULL; |
---|
29 | #endif |
---|
30 | poly q = &rp; |
---|
31 | number ln = pGetCoeff(m); |
---|
32 | omBin bin = ri->PolyBin; |
---|
33 | DECLARE_LENGTH(const unsigned long length = ri->ExpL_Size); |
---|
34 | const unsigned long* m_e = m->exp; |
---|
35 | pAssume(!n_IsZero__T(ln,ri)); |
---|
36 | pAssume1(p_GetComp(m, ri) == 0 || p_MaxComp(p, ri) == 0); |
---|
37 | number tmp; |
---|
38 | |
---|
39 | do |
---|
40 | { |
---|
41 | tmp = n_Mult__T(ln, pGetCoeff(p), ri); |
---|
42 | #ifdef HAVE_ZERODIVISORS |
---|
43 | if (! n_IsZero__T(tmp, ri)) |
---|
44 | { |
---|
45 | #endif |
---|
46 | p_AllocBin( pNext(q), bin, ri); |
---|
47 | q = pNext(q); |
---|
48 | pSetCoeff0(q, tmp); |
---|
49 | p_MemSum__T(q->exp, p->exp, m_e, length); |
---|
50 | p_MemAddAdjust__T(q, ri); |
---|
51 | #ifdef HAVE_ZERODIVISORS |
---|
52 | } |
---|
53 | else n_Delete__T(&tmp, ri); |
---|
54 | #endif |
---|
55 | p = pNext(p); |
---|
56 | } |
---|
57 | while (p != NULL); |
---|
58 | last = q; |
---|
59 | pNext(q) = NULL; |
---|
60 | |
---|
61 | p_Test(pNext(&rp), ri); |
---|
62 | return pNext(&rp); |
---|
63 | } |
---|
64 | |
---|
65 | |
---|