3 * compute for monomials p*q * destroys p, keeps q */
| 432 | * destroys p, keeps q |
| 433 | */ |
| 434 | static void p_MonMultMB(poly p, poly q,ring r) |
| 435 | { |
| 436 | number x, y; |
| 437 | // int i; |
| 438 | |
| 439 | y = p_GetCoeff(p,r); |
| 440 | x = n_Mult(y,pGetCoeff(q),r->cf); |
| 441 | n_Delete(&y,r->cf); |
| 442 | p_SetCoeff0(p,x,r); |
| 443 | //for (i=(currRing->N); i!=0; i--) |
| 444 | //{ |
| 445 | // pAddExp(p,i, pGetExp(q,i)); |
| 446 | //} |
| 447 | //p->Order += q->Order; |
| 448 | p_ExpVectorAdd(p,q,r); |
| 449 | } |
| 450 | /*3 |
| 451 | * compute for monomials p*q |
| 452 | * keeps p, q |
no test coverage detected