Changeset 3939bc in git for Singular/LIB/standard.lib

Timestamp:

May 29, 1998, 5:02:06 PM (26 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

1d4300694bf8c8b67ec71e837ab58b13264fedf7

Parents:

311499b3c35b89d435a5b5b44c51e0ace5b13c6c

Message:

* hannes: changed res->nres, resu->res


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

File:

• Singular/LIB/standard.lib (modified) (19 diffs)

Singular/LIB/standard.lib

@@ -1 @@
-// $Id: standard.lib,v 1.16 1998-05-25 21:28:33 obachman Exp $
+// $Id: standard.lib,v 1.17 1998-05-29 15:02:02 Singular Exp $
 //////////////////////////////////////////////////////////////////////////////
 
-version="$Id: standard.lib,v 1.16 1998-05-25 21:28:33 obachman Exp $";
+version="$Id: standard.lib,v 1.17 1998-05-29 15:02:02 Singular Exp $";
 info="
 LIBRARY: standard.lib   PROCEDURES WHICH ARE ALWAYS LOADED AT START-UP
@@ -8 +8 @@
  stdfglm(ideal[,ord])   standard basis of the ideal via fglm [and ordering ord]
  stdhilb(ideal)         standard basis of the ideal using the Hilbert function
- groebner(ideal/module) standard basis of ideal or module using a 
-                        heuristically choosen method 
+ groebner(ideal/module) standard basis of ideal or module using a
+                        heuristically choosen method
 ";
 
@@ -126 +126 @@
 proc groebner(def i, list #)
 "USAGE: groebner(i[, wait]) i -- ideal/module; wait -- int
-RETURNS: Standard basis of ideal or module which is computed using a 
-         heuristically choosen method: 
+RETURNS: Standard basis of ideal or module which is computed using a
+         heuristically choosen method:
          If the ordering of the current ring is a local ordering, or
          if it is a non-block ordering and the current ring has no
-         parameters, then std(i) is returned.  
+         parameters, then std(i) is returned.
          Otherwise, i is mapped into a ring with no parameters and
          ordering dp, where its Hilbert series is computed. This is
@@ -136 +136 @@
          original ring.
 NOTE: If a 2nd argument 'wait' is given, then the computation proceeds
-      at most 'wait' seconds. That is, if no result could be computed in 
-      'wait' seconds, then the computation is interrupted, 0 is returned, 
-      a warning message is displayed, and the global variable 
-      'groebner_error' is defined. 
+      at most 'wait' seconds. That is, if no result could be computed in
+      'wait' seconds, then the computation is interrupted, 0 is returned,
+      a warning message is displayed, and the global variable
+      'groebner_error' is defined.
 EXAMPLE: example groebner; shows an example"
 {
@@ -153 +153 @@
         int wait = #[1];
         int j = 10;
-        
+
         string bs = nameof(basering);
         link l_fork = "MPtcp:fork";
@@ -160 +160 @@
         int pid = read(l_fork);
         write(l_fork, quote(groebner(eval(i))));
-        
+
         // sleep in small intervalls for appr. one second
         if (wait > 0)
@@ -170 +170 @@
           }
         }
-        
+
         // sleep in intervalls of one second from now on
         j = 1;
@@ -178 +178 @@
           j = j + 1;
         }
-        
+
         if (status(l_fork, "read", "ready"))
         {
@@ -226 +226 @@
     return(std(i));
   }
-   
+
   int IsSimple_P;
   if (system("nblocks") <= 2)
@@ -265 +265 @@
     option(mem);
   }
-   
+
   // construct ring in which first std computation is done
   string varstr_P = varstr(P);
   string parstr_P = parstr(P);
-  int is_homog = (homog(i) && (npars_P == 0)); 
-   
+  int is_homog = (homog(i) && (npars_P == 0));
+
   string ri = "ring Phelp =" + string(char(P)) + ",(" + varstr_P;
   // parameters are converted to ring variables
@@ -287 +287 @@
   // change the ring
   execute(ri);
-   
+
   // get ideal from previous ring
   if (is_homog)
@@ -298 +298 @@
     ideal qh=homog(imap(P,i),@t);
   }
-   
+
   // compute std and hilbert series
   if (p_opt)
@@ -322 +322 @@
     // additional variables were introduced
     // need another intermediate ring
-    ri = "ring Phelp1 =" + string(char(P)) 
+    ri = "ring Phelp1 =" + string(char(P))
       + ",(" + varstr(Phelp) + "),(" + ordstr_P;
-     
+
     // for lp without parameters, we do not need a block ordering
     if ( ! (IsSimple_P && (npars_P + is_homog < 2) && find(ordstr_P, "l")))
@@ -332 +332 @@
     }
     ri = ri + ");";
-     
+
     // change to intermediate ring
     execute(ri);
@@ -348 +348 @@
       qh = subst(qh, @t, 1);
     }
-     
+
     // go back to original ring
     setring P;
@@ -370 +370 @@
   "EXAMPLE: "; echo = 2;
   ring r = 0, (a,b,c,d), lp;
-  option(prot); 
+  option(prot);
   ideal i = a+b+c+d, ab+ad+bc+cd, abc+abd+acd+bcd, abcd-1; // cyclic 4
   groebner(i);
@@ -384 +384 @@
 
 //////////////////////////////////////////////////////////////////////////
-proc resu(list #)
+proc res(list #)
 {
    def P=basering;
    list result;
    def m=#[1]; //the ideal or module
-   
+
    int i=#[2]; //the length of the resolution
                //if size(#)>2 a minimal resolution is computed
@@ -414 +414 @@
       setring P;
       result=imap(Phelp,re);
-      return(result);   
+      return(result);
    }
 
@@ -439 +439 @@
    setring P;
    result=imap(Phelp,re);
-   return(result);      
+   return(result);
 }
 
 proc minresu(list #)
 {
-   return(resu(#[1],#[2],1));
-}
+   return(res(#[1],#[2],1));
+}