Changeset 76d26c in git for Singular

Timestamp:

Oct 14, 2013, 6:45:42 PM (11 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', '4a9821a93ffdc22a6696668bd4f6b8c9de3e6c5f')

Children:

7476bc5b8ce22fb85faf9749e7e05b330e99f9c5

Parents:

08fa62c9765eb4775a2b8570706325428bd1b390

Message:

fix: rename minIntRoot to minIntRootD to avoid name clash

File:

• Singular/LIB/derham.lib (modified) (4 diffs)

Singular/LIB/derham.lib

@@ -725 +725 @@
              annihilators we computed for L[i]  ->this will ensure  we can compute
              the maps of the MV complex*/
-          minroot=Derham::minIntRoot(findminintroot);
+          minroot=minIntRootD(findminintroot);
           for (j=1; j<=i; j++)
             {
@@ -811 +811 @@
                    s-parametric annihilators we computed for L[i]  ->this will
                    ensure  we can compute the maps of the MV complex*/
-              minroot=Derham::minIntRoot(findminintroot);
+              minroot=minIntRootD(findminintroot);
               for (j=1; j<=i; j++)
                 {
@@ -4230 +4230 @@
    for (i=1; i<=size(G4); i++)
      {
-       minmax[i]=Derham::minIntRoot(G4[i],1);
+       minmax[i]=minIntRootD(G4[i],1);
        if (size(minmax[i])!=0)
          {
@@ -5531 +5531 @@
 ////////////////////////////////////////////////////////////////////////////////////
 
-static proc minIntRoot(list L,list #)
-"USAGE:minIntRoot(L [,M]); L list, M optinonal list
+static proc minIntRootD(list L,list #)
+"USAGE:minIntRootD(L [,M]); L list, M optinonal list
 ASSUME:L a list of univariate polynomials with rational coefficients @*
        the variable of the polynomial is s if size(#)==0 (needed for proc