Changeset 36861ed in git for Singular/LIB/standard.lib

Timestamp:

Aug 23, 1999, 4:17:43 PM (24 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')

Children:

b246466423ee9ef5d330e1d138b3953a2067fac1

Parents:

c860e90753c9024c2f5903c409b379238aaa2e55

Message:

* hannes: res recognizes option(prot)


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

File:

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

Singular/LIB/standard.lib

@@ -1 @@
-// $Id: standard.lib,v 1.41 1999-08-19 13:49:39 obachman Exp $
+// $Id: standard.lib,v 1.42 1999-08-23 14:17:35 Singular Exp $
 //////////////////////////////////////////////////////////////////////////////
 
-version="$Id: standard.lib,v 1.41 1999-08-19 13:49:39 obachman Exp $";
+version="$Id: standard.lib,v 1.42 1999-08-23 14:17:35 Singular Exp $";
 info="
 LIBRARY: standard.lib   PROCEDURES WHICH ARE ALWAYS LOADED AT START-UP
@@ -441 +441 @@
 @code{nres} (classical method using syzygies) , see @ref{nres}.
 
-@item @strong{homogenous ideals and k == 0:} 
+@item @strong{homogenous ideals and k == 0:}
 @code{lres} (La'Scala's method), see @ref{lres}.
 
-@item @strong{not minimized resolution,  and, homogenous input with k != 0 or local rings:} 
+@item @strong{not minimized resolution,  and, homogenous input with k != 0 or local rings:}
 @code{sres} (Schreyer's method), see @ref{sres}.
 
-@item @strong{all other inputs:} 
+@item @strong{all other inputs:}
 @code{mres} (classical method), see @ref{mres}.
 @end table
@@ -466 +466 @@
 @c ref
 "
-{         
+{
    def P=basering;
    if (size(#) < 2)
@@ -472 +472 @@
      ERROR("res: need at least two arguments: ideal/module, int");
    }
-   
+
    def m=#[1]; //the ideal or module
    int i=#[2]; //the length of the resolution
    if (i< 0) { i=0;}
-     
+
    string varstr_P = varstr(P);
 
-   
+   int p_opt;
+   string s_opt = option();
+   // set p_opt, if option(prot) is set
+   if (find(s_opt, "prot"))
+   {
+     p_opt = 1;
+   }
+
    if(size(ideal(basering)) > 0)
    {
      // the quick hack for qrings - seems to fit most needs
      // (lres is not implemented for qrings, sres is not so efficient)
+     if (p_opt) { "using nres";}
      return(nres(m,i));
    }
@@ -493 +501 @@
       {
         //LaScala for the homogeneous case and i == 0
+        if (p_opt) { "using lres";}
         re=lres(m,i);
         if(size(#)>2)
@@ -503 +512 @@
         if(size(#)>2)
         {
+          if (p_opt) { "using mres";}
           re=mres(m,i);
         }
         else
         {
+          if (p_opt) { "using sres";}
           re=sres(std(m),i);
         }
@@ -520 +531 @@
       execute(ri);
       def m=imap(P,m);
+      if (p_opt) { "using mres in another ring";}
       list re=mres(m,i);
       setring P;
@@ -535 +547 @@
       def m=imap(P,m);
       m=std(m);
+      if (p_opt) { "using sres in another ring";}
       list re=sres(m,i);
       setring P;
@@ -546 +559 @@
    execute(ri);
    def m=imap(P,m);
+    if (p_opt) { "using mres in another ring";}
    list re=mres(m,i);
    setring P;