Changeset ec66b3f in git

Timestamp:

Sep 18, 2018, 3:39:45 PM (6 years ago)

Author:

Andreas Steenpass <steenpass@…>

Branches:

(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')

Children:

1e440acd9490b8589048022b1691c2b4e7e90c3d

Parents:

1adfacf6826d2b0c6660854e9fa7689b6adf7538

Message:

chg: fix issues in ffmodstd found by formal checker

File:

• Singular/LIB/ffmodstd.lib (modified) (14 diffs)

Singular/LIB/ffmodstd.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-//version="version ffmodstd.lib 4.1.1.0 Dec_2017 "; // $Id$
-version=" $ Id$ ";
+version="version ffmodstd.lib 4.1.1.0 Sep_2018 "; // $Id$
 category="Commutative Algebra";
 info="
@@ -7 +6 @@
                            over rational function fields
 AUTHORS:   D.K. Boku       boku@mathematik.uni-kl.de
-@*         W. Decker       decker@mathematik.uni-kl.de
-@*         C. Fieker       fieker@mathematik.uni-kl.de
+           W. Decker       decker@mathematik.uni-kl.dei
+           C. Fieker       fieker@mathematik.uni-kl.de
 
 OVERVIEW:
@@ -53 +52 @@
   fareypoly(g,f);         univariate rational function reconstruction
   polyInterpolation(l,m);  univariate polynomial interpolation
-  modrationalInterpolation(l,m); modular univariate rational interpolation 
+  modrationalInterpolation(l,m); modular univariate rational interpolation
   BerlekampMassey(L,i);    Berlekamp/Massey algorithm
   modberlekampMassey(L,i)  modular Berlekamp/Massey algorithm
@@ -355 +354 @@
       the length of the sequence L is long enough. If this polynomial does not split into
       linear factors, an optional parameter M = BerlekampMassey(L',i) can be provided to
-      add more elements to the sequence. 
+      add more elements to the sequence.
 REFERENCES:
 @* [1] E. Kaltofen and W.-s. Lee: Early termination in sparse interpolation
@@ -405 +404 @@
        if(D1 == 0)
        {
-           if(j>1)//(2*l0) < j && 
+           if(j>1)//(2*l0) < j &&
            {
                // early termination is triggered here
@@ -413 +412 @@
            B1 = var(i)*B0;
            l1 = l0;
-           
        }
        else
@@ -1135 +1133 @@
            vL[j] = T[j][1];
            if(evbd < T[j][3])
-           { 
+           {
              evbd = T[j][3];
            }
@@ -1384 +1382 @@
 ///////////////////////////////////////////////////////////////////////////////
 // +++++++++++++++++ std for one parameter begins here +++++++++++++++++++
- 
+
 static proc test_fmodI(poly f,ideal I)
 {
@@ -1491 +1489 @@
         }
     }
-    number Nd = 0; 
+    number Nd = 0;
     number Nn = 1;
     list Pl, Il, L, M;
@@ -1575 +1573 @@
 
 ///////////////////////////////////////////////////////////////////////////////
- 
+
 static proc firststd(ideal I, ideal cI, int in_value, list #)
 {
@@ -2055 +2053 @@
        }
        v = (v0-q*v1)*N;
-       v0 = v1; 
-       v1 = v; 
+       v0 = v1;
+       v1 = v;
        f = g1;
        g1= r*N;
@@ -2120 +2118 @@
 {
     // check that whether the relation -L[j+t] = c_0*L[j] + ... + c_{t-1}*L[j+t-1]
-    // for all j >=1 where t= size(L)/2 
+    // for all j >=1 where t= size(L)/2
     int i, j;
     poly f = fareyresult[1];
@@ -2136 +2134 @@
         {
             return(0);
-        }      
+        }
     }
     return(1);
@@ -2271 +2269 @@
     * cannot be satisfied for all i
     */
-    return(1); 
+    return(1);
 }