Changeset fde66a9 in git for Singular/LIB/modwalk.lib

Timestamp:

Aug 7, 2014, 4:10:35 PM (10 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

a5ab27d45c122614af41115f7486270074ab53f5

Parents:

a0e7db5bccc63a9fe9ea7898cd864a561f0656cc

git-author:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2014-08-07 16:10:35+02:00

git-committer:

Hans Schoenemann <hannes@mathematik.uni-kl.de>2014-08-07 16:12:11+02:00

Message:

format errors

File:

• Singular/LIB/modwalk.lib (modified) (7 diffs)

Singular/LIB/modwalk.lib

@@ -31 +31 @@
 proc modpWalk(def II, int p, int variant, list #)
 "USAGE:  modpWalk(I,p,#); I ideal, p integer, variant integer
-ASSUME:  If size(#) > 0, then 
+ASSUME:  If size(#) > 0, then
            #[1] is an intvec describing the current weight vector
            #[2] is an intvec describing the target weight vector
 RETURN:  ideal - a standard basis of I mod p, integer - p
 NOTE:    The procedure computes a standard basis of the ideal I modulo p and
-         fetches the result to the basering. 
+         fetches the result to the basering.
 EXAMPLE: example modpWalk; shows an example
 "
@@ -89 +89 @@
       {
         list rl@r = ringlist(@r);
-        nvar@r = nvars(@r);      
+        nvar@r = nvars(@r);
         intvec w;
         for(k = 1; k <= nvar@r; k++)
@@ -236 +236 @@
 proc modWalk(def II, int variant, list #)
 "USAGE:  modWalk(II); II ideal or list(ideal,int)
-ASSUME:  If variant = 
+ASSUME:  If variant =
 @*       - 1 the Random Walk algorithm with radius II[2] is applied
            to II[1] if II = list(ideal, int). It is applied to II with radius 2
            if II is an ideal.
-@*       - 2, the Groebner Walk algorithm is applied to II[1] or to II, respectively.
+@*       - 2, the Groebner Walk algorithm is applied to II[1] or to II, respectively.
 @*       - 3, the Fractal Walk algorithm with random element is applied to II[1] or II,
            respectively.
@@ -246 +246 @@
 @*       - 5, the Perturbation Walk algorithm with random element is applied to II[1]
            or II, respectively, with radius II[3] and perturbation degree II[2].
-@*       - 6, the Perturbation Walk algorithm is applied to II[1] or II, respectively,
-           with perturbation degree II[3].
+@*       - 6, the Perturbation Walk algorithm is applied to II[1] or II, respectively,
+           with perturbation degree II[3].
          If size(#) > 0, then # contains either 1, 2 or 4 integers such that
 @*       - #[1] is the number of available processors for the computation,
@@ -300 +300 @@
         II[3] = 2;
       }
-    
     }
     else
@@ -378 +377 @@
           ERROR("Unexpected type of input.");
         }
-      }  
+      }
     }
     if(size(#) == 3)
@@ -739 +738 @@
   }
   results_chinrem = parallelWaitAll("chinrem",arguments_chinrem);
-    for(j=1; j <= size(results_chinrem); j++)  
+    for(j=1; j <= size(results_chinrem); j++)
     {
       J = results_chinrem[j];