spielwiese
|
Last change
on this file since 879cc3c was
879cc3c,
checked in by Mohamed Barakat <mohamed.barakat@…>, 14 years ago
|
|
monmials:
. data structures, allocation/deallocation, comparing monomials
tests for monomials, Setm, Degree
operations:
. operations on polynomials as lists (e.g. length, Maps, Sort, ...)
templates:
. templates for inline procedures and code to generate them
ext_fields:
. quotient fields of polynomial rings and algebraic extensions
|
-
Property mode set to
100644
|
|
File size:
1.3 KB
|
| Line | |
|---|
| 1 | /**************************************** |
|---|
| 2 | * Computer Algebra System SINGULAR * |
|---|
| 3 | ****************************************/ |
|---|
| 4 | /*************************************************************** |
|---|
| 5 | * File: p_Mult_n__Template.cc |
|---|
| 6 | * Purpose: template for p_Mult_n |
|---|
| 7 | * Author: obachman (Olaf Bachmann) |
|---|
| 8 | * Created: 8/00 |
|---|
| 9 | * Version: $Id$ |
|---|
| 10 | *******************************************************************/ |
|---|
| 11 | |
|---|
| 12 | /*************************************************************** |
|---|
| 13 | * |
|---|
| 14 | * Returns: p*n |
|---|
| 15 | * Destroys: p |
|---|
| 16 | * Const: n |
|---|
| 17 | * |
|---|
| 18 | ***************************************************************/ |
|---|
| 19 | LINKAGE poly p_Mult_nn(poly p, const number n, const ring r) |
|---|
| 20 | { |
|---|
| 21 | pAssume(!n_IsZero(n,r)); |
|---|
| 22 | p_Test(p, r); |
|---|
| 23 | |
|---|
| 24 | poly q = p; |
|---|
| 25 | #ifdef HAVE_ZERODIVISORS |
|---|
| 26 | poly old = NULL; |
|---|
| 27 | #endif |
|---|
| 28 | while (p != NULL) |
|---|
| 29 | { |
|---|
| 30 | #ifndef HAVE_ZERODIVISORS |
|---|
| 31 | n_InpMult(pGetCoeff(p), n, r); |
|---|
| 32 | pIter(p); |
|---|
| 33 | #else |
|---|
| 34 | number tmp = n_Mult(n, pGetCoeff(p), r); |
|---|
| 35 | if (!nIsZero(tmp)) |
|---|
| 36 | { |
|---|
| 37 | number nc = pGetCoeff(p); |
|---|
| 38 | p_SetCoeff0(p, tmp, r); |
|---|
| 39 | n_Delete(&nc, r); |
|---|
| 40 | old = p; |
|---|
| 41 | pIter(p); |
|---|
| 42 | } |
|---|
| 43 | else |
|---|
| 44 | { |
|---|
| 45 | n_Delete(&tmp, r); |
|---|
| 46 | if (old == NULL) |
|---|
| 47 | { |
|---|
| 48 | pIter(p); |
|---|
| 49 | p_LmDelete(&q, r); |
|---|
| 50 | } |
|---|
| 51 | else |
|---|
| 52 | { |
|---|
| 53 | p_LmDelete(&p, r); |
|---|
| 54 | pNext(old) = p; |
|---|
| 55 | } |
|---|
| 56 | } |
|---|
| 57 | #endif |
|---|
| 58 | } |
|---|
| 59 | p_Test(q, r); |
|---|
| 60 | return q; |
|---|
| 61 | } |
|---|
Note: See
TracBrowser
for help on using the repository browser.
