Changeset f9ca02 in git for Singular/LIB/assprimeszerodim.lib

Timestamp:

Sep 27, 2010, 12:21:25 PM (14 years ago)

Author:

Stefan Steidel <steidel@…>

Branches:

(u'spielwiese', '4a9821a93ffdc22a6696668bd4f6b8c9de3e6c5f')

Children:

59a7ca1a2295e730269784972ec5b06a44bed680

Parents:

d8423632ac2a14a2b19b324e619be2d5757af760

Message:

Documentation

git-svn-id: file:///usr/local/Singular/svn/trunk@13288 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/assprimeszerodim.lib (modified) (6 diffs)

Singular/LIB/assprimeszerodim.lib

@@ -106 +106 @@
                if(status(l(i), "read", "ready"))
                {
-                  P = read(l(i));                                        // read the result from l(i)
+                  //--- read the result from l(i) ---
+                  P = read(l(i));                                        
                   CO1[index] = P[1];
                   CO2[index] = bigint(P[2]);
@@ -123 +124 @@
                }
             }
-            if(k == n)                                                   // k describes the number of closed links
+            //--- k describes the number of closed links ---
+            if(k == n)                                                   
             {
                j++;
             }
-            i_sleep = system("sh", "sleep "+string(t));                  // sleep for t seconds
+            //--- sleep for t seconds ---
+            i_sleep = system("sh", "sleep "+string(t));                  
          }
       }
@@ -359 +362 @@
             for(i = 1; i <= n; i++)
             {
-               if(status(l(i), "read", "ready"))           // ask if link l(i) is ready otherwise sleep for t seconds
+               //--- ask if link l(i) is ready otherwise sleep for t seconds ---
+               if(status(l(i), "read", "ready"))           
                {
-                  P = read(l(i));                          // read the result from l(i)
+                  //--- read the result from l(i) ---
+                  P = read(l(i));                          
                   CO1[index] = P[1];
                   CO2[index] = bigint(P[2]);
@@ -378 +383 @@
                }
             }
-            if(k == n)                                     // k describes the number of closed links
+            //--- k describes the number of closed links ---
+            if(k == n)                                     
             {
                j++;
@@ -683 +689 @@
 {
 //=== computes a poly F in Z/q1[T] such that <F>=kernel(Z/q1[T]--->Z/q1[vars(basering)])
-//=== mapping T to p1 and test if d=deg(squarefreepart(F)), q1 a prime randomly choosen
+//=== mapping T to p1 and test if d=deg(squarefreepart(F)), q1 a prime randomly chosen
 //=== If not choose randomly another prime q2 and another linear form p2 and
 //=== computes a poly F in Z/q2[T] such that <F>=kernel(Z/q2[T]--->Z/q2[vars(basering)])
@@ -742 +748 @@
 static proc zeroRadP(ideal I, int p)
 {
-//=== computes F=(F_1,...,F_n) such that <F_i>=IZ/p[x_1,...,x_n] intersected with Z/p[x_i], F_i monic
+//=== computes F=(F_1,...,F_n) such that <F_i>=IZ/p[x_1,...,x_n] intersected 
+//=== with Z/p[x_i], F_i monic
    def R0 = basering;
    list ringL = ringlist(R0);