Changeset c1986a in git

Timestamp:

May 6, 2005, 11:42:02 AM (18 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '91fdef05f09f54b8d58d92a472e9c4a43aa4656f')

Children:

1d81b2939a37082b3c46e6e21ab974b485e157ed

Parents:

a58f47ac8eee1255eec5e769cce34d8625f4cade

Message:

*hannes/lossen: syntax for doku


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

Location:

Singular/LIB

Files:

• control.lib (modified) (4 diffs)
• gmspoly.lib (modified) (2 diffs)
• normal.lib (modified) (2 diffs)
• presolve.lib (modified) (2 diffs)
• primitiv.lib (modified) (2 diffs)
• rinvar.lib (modified) (4 diffs)
• spcurve.lib (modified) (2 diffs)
• urrcount.lib (modified) (3 diffs)
• zeroset.lib (modified) (3 diffs)

Singular/LIB/control.lib

@@ -1 @@
-version="$Id: control.lib,v 1.29 2005-04-30 20:34:59 levandov Exp $";
+version="$Id: control.lib,v 1.30 2005-05-06 09:41:58 Singular Exp $";
 category="System and Control Theory";
 info="
@@ -1602 +1602 @@
 PURPOSE: define the ring easily
 RETURN:  no return value
- EXAMPLE:  example declare; shows an example 
- "
- {
+EXAMPLE:  example declare; shows an example 
+"
+{
    if(size(#)==0)
    {
@@ -1628 +1628 @@
    };
    keepring(basering);
- }
- example
- {"EXAMPLE:";echo = 2;
+}
+example
+{"EXAMPLE:";echo = 2;
    string v="x,y,z";
    string p="q,p";
@@ -1654 +1654 @@
    print(basering);
    print(nameof(basering));
- };
+}
 //
 // maybe reasonable to add this in declare

Singular/LIB/gmspoly.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: gmspoly.lib,v 1.9 2005-04-28 09:23:17 Singular Exp $";
+version="$Id: gmspoly.lib,v 1.10 2005-05-06 09:41:59 Singular Exp $";
 category="Singularities";
 
@@ -73 +73 @@
   setring @WX;
   ideal J=jacob(imap(@X,f));
-~
   int i;
   for(i=1;i<=n;i++)

Singular/LIB/normal.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: normal.lib,v 1.42 2005-04-29 13:23:25 Singular Exp $";
+version="$Id: normal.lib,v 1.43 2005-05-06 09:41:59 Singular Exp $";
 category="Commutative Algebra";
 info="
@@ -2194 +2194 @@
 //////////////////////////////////////////////////////////////////////////////
 
-proc closureFrac(list L);
+proc closureFrac(list L)
 "USAGE:    closureFrac (L); L a list as in the result of primeClosure, L[n]
                            containing an additional poly f

Singular/LIB/presolve.lib

@@ -1 +1 @@
 //last change: 13.02.2001 (Eric Westenberger)
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: presolve.lib,v 1.23 2005-05-04 09:31:39 Singular Exp $";
+version="$Id: presolve.lib,v 1.24 2005-05-06 09:42:00 Singular Exp $";
 category="Symbolic-numerical solving";
 info="
@@ -22 +22 @@
  sortvars(id[n1,p1..]); sort vars w.r.t. complexity in id [different blocks]
  valvars(id[..]);       valuation of vars w.r.t. to their complexity in id
- idealsSimplify(id);    ideal I = eliminate(Id,m) m is a product of variables
-                       which are only linearly involved in the generators of id
  idealSplit(id,tF,fS);  a list of ideals such that their intersection 
                         has the same radical as id

Singular/LIB/primitiv.lib

@@ -3 +3 @@
 // This library is for Singular 1.2 or newer
 
-version="$Id: primitiv.lib,v 1.20 2005-04-22 16:04:46 Singular Exp $";
+version="$Id: primitiv.lib,v 1.21 2005-05-06 09:42:00 Singular Exp $";
 category="Commutative Algebra";
 info="
@@ -259 +259 @@
          The active ring must allow an algebraic extension (e.g., it cannot
          be a transcendent ring extension of Q or Z/p).
-RETURN:  ring; @
+RETURN:  ring; @*
            if called with a nonempty second parameter L, then in the output 
            ring there is defined a list erg ( =L mapped to the new ring);

Singular/LIB/rinvar.lib

@@ -1 +1 @@
 // Last change 10.12.2000 (TB)
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: rinvar.lib,v 1.11 2005-04-29 08:55:50 Singular Exp $";
+version="$Id: rinvar.lib,v 1.12 2005-05-06 09:42:01 Singular Exp $";
 category="Invariant theory";
 info="
@@ -28 +28 @@
  ReynoldsOperator(G, Gaction);  Reynolds operator of the group G
  SimplifyIdeal(I[,m,s]);        simplify the ideal I (try to reduce variables)
- TransferIdeal(R,name,nA);      transfer the ideal 'name' from R to basering
 
 SEE ALSO: qhmoduli_lib, zeroset_lib
@@ -654 +653 @@
         attrib(groupid, "isSB", 1);
         ideal action = actionid;
-//        ideal invarsGens = TransferIdeal(RIRR, "invarsGens", newA);
-//        export(invarsGens);
-// lossen: ersetzt durch
         setring RIRR;
         string parName, minPoly;
@@ -962 +958 @@
 
   def RORR = ZeroSet(G1, primaryDec);
-//  setring RORR;
-//  id = TransferIdeal(ROBR, "Grp", newA);  // defined in ZeroSet ...
-//  ideal actionid = TransferIdeal(ROBR, "Gaction", newA);
-// lossen: ersetzt durch
   setring ROBR;
   string parName, minPoly;

Singular/LIB/spcurve.lib

@@ -1 +1 @@
 // (anne, last modified 31.5.99)
 /////////////////////////////////////////////////////////////////////////////
-version="$Id: spcurve.lib,v 1.18 2005-04-26 17:19:41 Singular Exp $";
+version="$Id: spcurve.lib,v 1.19 2005-05-06 09:42:01 Singular Exp $";
 category="Singularities";
 info="
@@ -510 +510 @@
          a is an integer vector giving the weights of the variables
 RETURN:  integer, max(a-weighted order(N_ij) - W_ij | all entries ij) @*
-         string "ERROR" if sizes do not match
-EXAMPLE: example relweight; shows an example"
+         string \"ERROR\" if sizes do not match
+EXAMPLE: example relweight; shows an example
+"
 {
   int p = printlevel-voice+3;  // p=printlevel+1 (default: p=1)

Singular/LIB/urrcount.lib

@@ -1 @@
-// $Id: urrcount.lib,v 1.3 2005-05-02 13:11:56 Singular Exp $
+// $Id: urrcount.lib,v 1.4 2005-05-06 09:42:01 Singular Exp $
 // E. Tobis  12.Nov.2004, April 2004
 // last change 1. May 2005 (G.-M. Greuel)
@@ -574 +574 @@
            sequence begininng with p, p' and goes on with minus the remainder
            of the two previous polynomials, until the remainder is zero.
-           See: Basu, Pollack, Roy, "Algorithms in Real Algebraic Geometry",
+           See: Basu, Pollack, Roy, Algorithms in Real Algebraic Geometry,
            Springer, 2003.
 SEE ALSO:  sturm,sturmhaseq
@@ -737 +737 @@
            related to the Sturm sequence, but behaves better with respect to
            the size of the coefficients. It is defined via subresultants.
-           See: Basu, Pollack, Roy, "Algorithms in Real Algebraic Geometry",
+           See: Basu, Pollack, Roy, Algorithms in Real Algebraic Geometry,
            Springer, 2003.
 SEE ALSO:  sturm,sturmseq,sturmha

Singular/LIB/zeroset.lib

@@ -1 +1 @@
 // Last change 12.02.2001 (Eric Westenberger)
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: zeroset.lib,v 1.11 2005-04-25 10:13:07 Singular Exp $";
+version="$Id: zeroset.lib,v 1.12 2005-05-06 09:42:02 Singular Exp $";
 category="Symbolic-numerical solving";
 info="
@@ -622 +622 @@
 EXAMPLE: example EGCD; shows an example
 "
+{
 // might be extended to return s1, s2 s.t. f*s1 + g*s2 = gcd
-{
   int i = 1;
   poly r1, r2, r;
@@ -812 +812 @@
 EXAMPLE: example  Factor; shows an example
 "
+{
 // extend this by a squarefree factorization !!
 // multiplicities are not valid !!
-{
   int i, s;
   list normList, factorList, quo_rem;