Changeset 8acd267 in git for Singular/LIB/primdecint.lib

Timestamp:

Sep 29, 2010, 12:10:12 PM (14 years ago)

Author:

Frank Seelisch <seelisch@…>

Branches:

(u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')

Children:

ed65b8ac2bdf0cef1353911cef4a1aa9dfd599f4

Parents:

08076474d5b872058ae014f8e1e6d95434bc7f29

Message:

re-established old ordering in result list of command 'primefactors' (kernel code, LIB code, docu)

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

File:

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

Singular/LIB/primdecint.lib

@@ -112 +112 @@
       ideal J = imap(R,J);
 
-      for(j=1;j<=size(L[3]);j++)
-      {
-         if(L[3][j] > 1){ ex = 1; break; }
+      for(j=1;j<=size(L[2]);j++)
+      {
+         if(L[2][j] > 1){ ex = 1; break; }
       }
 
@@ -120 +120 @@
       {
          "n = "+string(n);
-         "size(L[3]) = "+string(size(L[3]));
+         "size(L[2]) = "+string(size(L[2]));
       }
 
       int RT = rtimer;
-      if((n > 1) && (n < size(L[3])))
+      if((n > 1) && (n < size(L[2])))
       {
 
 //-----  Create n1 links l(1),...,l(n1), open all of them and compute  ---------
-//-----  standard basis for the primes L[2],...,L[n + 1].              ---------
+//-----  standard basis for the primes L[1][2],...,L[1][n + 1].              ---------
 
          for(i = 1; i <= n; i++)
          {
-            p=int(L[2][i + 1]);
-            nu=int(L[3][i + 1]);
+            p=int(L[1][i + 1]);
+            nu=int(L[2][i + 1]);
             link l(i) = "MPtcp:fork";
 //            link l(i) = "ssi:fork";
@@ -140 +140 @@
          }
 
-         p = int(L[2][1]);
-         nu = int(L[3][1]);
+         p = int(L[1][1]);
+         nu = int(L[2][1]);
          int t = timer;
          A[size(A)+1] = modp(J, p, nu);
@@ -150 +150 @@
          j = n + 2;
 
-         while(j <= size(L[3]) + 1)
+         while(j <= size(L[2]) + 1)
          {
             for(i = 1; i <= n; i++)
@@ -160 +160 @@
                   A[size(A)+1] = read(l(i));                             
 
-                  if(j <= size(L[3]))
+                  if(j <= size(L[2]))
                   {
-                     p=int(L[2][j]);
-                     nu=int(L[3][j]);
+                     p=int(L[1][j]);
+                     nu=int(L[2][j]);
                      write(l(i), quote(modp(eval(J), eval(p), eval(nu))));
                      j++;
@@ -185 +185 @@
       else
       {
-         for(j=1;j<=size(L[3]);j++)
-         {
-            A[size(A)+1] = modp(J, L[2][j], L[3][j]);
+         for(j=1;j<=size(L[2]);j++)
+         {
+            A[size(A)+1] = modp(J, L[1][j], L[2][j]);
          }
       }