Changeset 20c540 in git for libpolys/polys/monomials/p_polys.h

Timestamp:

Oct 4, 2012, 7:47:33 PM (11 years ago)

Author:

Oleksandr Motsak <motsak@…>

Branches:

(u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')

Children:

db347cb0bbec256ffb358817738b700f8da08253

Parents:

dc79bd7d1e331302a1fc20150a37e81890e6300a

git-author:

Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-10-04 19:47:33+02:00

git-committer:

Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-10-05 19:05:33+02:00

Message:

Preparing the removal of Frank's p_Monic/p_Gcd/p_ExtGcd from common use

chg: moved most of the functions (with helpers) into algext.cc and made them static

NOTE: p_PolyDiv stayed in p_polys.cc as it is used in convFactoryASingA
NOTE: p_ExtGcd also is made public via algext.h (needed elsewhere?)

File:

• libpolys/polys/monomials/p_polys.h (modified) (1 diff)

libpolys/polys/monomials/p_polys.h

@@ -1825 +1825 @@
 int       p_Weight(int c, const ring r);
 
-/* assumes that p and divisor are univariate polynomials in r,
-   mentioning the same variable;
-   assumes divisor != NULL;
-   p may be NULL;
-   assumes a global monomial ordering in r;
-   performs polynomial division of p by divisor:
-     - afterwards p contains the remainder of the division, i.e.,
-       p_before = result * divisor + p_afterwards;
-     - if needResult == TRUE, then the method computes and returns 'result',
-       otherwise NULL is returned (This parametrization can be used when
-       one is only interested in the remainder of the division. In this
-       case, the method will be slightly faster.)
-   leaves divisor unmodified */
-poly      p_PolyDiv(poly &p, poly divisor, BOOLEAN needResult, ring r);
-
-/* returns NULL if p == NULL, otherwise makes p monic by dividing
-   by its leading coefficient (only done if this is not already 1);
-   this assumes that we are over a ground field so that division
-   is well-defined;
-   modifies p */
-void      p_Monic(poly p, const ring r);
-
-/* assumes that p and q are univariate polynomials in r,
-   mentioning the same variable;
-   assumes a global monomial ordering in r;
-   assumes that not both p and q are NULL;
-   returns the gcd of p and q;
-   leaves p and q unmodified */
-poly      p_Gcd(poly p, poly q, ring r);
-
-/* assumes that p and q are univariate polynomials in r,
-   mentioning the same variable;
-   assumes a global monomial ordering in r;
-   assumes that not both p and q are NULL;
-   returns the gcd of p and q;
-   moreover, afterwards pFactor and qFactor contain appropriate
-   factors such that gcd(p, q) = p * pFactor + q * qFactor;
-   leaves p and q unmodified */
-poly      p_ExtGcd(poly p, poly &pFactor, poly q, poly &qFactor, ring r);
+///   assumes that p and divisor are univariate polynomials in r,
+///   mentioning the same variable;
+///   assumes divisor != NULL;
+///   p may be NULL;
+///   assumes a global monomial ordering in r;
+///   performs polynomial division of p by divisor:
+///     - afterwards p contains the remainder of the division, i.e.,
+///       p_before = result * divisor + p_afterwards;
+///     - if needResult == TRUE, then the method computes and returns 'result',
+///       otherwise NULL is returned (This parametrization can be used when
+///       one is only interested in the remainder of the division. In this
+///       case, the method will be slightly faster.)
+///   leaves divisor unmodified
+poly      p_PolyDiv(poly &p, const poly divisor, const BOOLEAN needResult, const ring r);
 
 /* syszygy stuff */