Changeset a1c745 in git for Singular/LIB/freegb.lib

Timestamp:

Jun 20, 2007, 5:39:45 PM (17 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '2a584933abf2a2d3082034c7586d38bb6de1a30a')

Children:

58357dfdb1fe1b24b7a844771e7ba9997a9abe7d

Parents:

d31cedc0c35a743b9525836619923330af9a7714

Message:

*hannes: format


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

File:

• Singular/LIB/freegb.lib (modified) (9 diffs)

Singular/LIB/freegb.lib

@@ -1 +1 @@
 //////////////////////////////////////////////////////////////////////////////
-version="$Id: freegb.lib,v 1.1 2007-05-13 19:20:44 levandov Exp $";
+version="$Id: freegb.lib,v 1.2 2007-06-20 15:39:45 Singular Exp $";
 category="Noncommutative";
 info="
@@ -6 +6 @@
 AUTHOR: Viktor Levandovskyy,     levandov@math.rwth-aachen.de
 
-PROCEDURES: 
+PROCEDURES:
 freegb(list L, int n);   compute two-sided Groebner basis of ideal, encoded via L, up to degree n
 lst2str(list L);         convert a list (of modules) into polynomials in free algebra
@@ -150 +150 @@
     if (mp[1] == "-")
     {
-      t = t + mp; 
+      t = t + mp;
     }
     else
@@ -201 +201 @@
       {
         q = find(vv,string(p));
-        if (q==0) 
+        if (q==0)
         {
           err = "error in find for string "+vv;
-          dbprint(ppl,err); 
+          dbprint(ppl,err);
           return("_");
         }
@@ -247 +247 @@
   if (p==0) {  return(0); } //"p=0";
   poly q   = leadmonom(p);
-  if ( (p-lead(p)) !=0 ) { return(0); } // "p-lm(p)>0"; 
+  if ( (p-lead(p)) !=0 ) { return(0); } // "p-lm(p)>0";
   intvec v = leadexp(p);
   int s = size(v);
@@ -254 +254 @@
   int pwr = 0;
   for (i=1; i<=s; i++)
-  {  
-    if (v[i] != 0) 
+  {
+    if (v[i] != 0)
     {
       cnt++;
@@ -375 +375 @@
     }
     //    size(LR[3]);
-    LR[3][nb*(D+1)+1] = tmp;    
+    LR[3][nb*(D+1)+1] = tmp;
   }
   L[3] = LR[3];
@@ -454 +454 @@
   module N;
   list LN;
-  vector V;  
+  vector V;
   poly pn;
   // test and skip exponents >=2
@@ -484 +484 @@
   }
   K  = simplify(K,2);
-  sk = size(K); 
+  sk = size(K);
   for(i=1; i<=sk; i++)
   {