Changeset d2b2a7 in git for Singular/LIB/poly.lib

Timestamp:

May 5, 1998, 1:55:40 PM (26 years ago)

Author:

Kai Krüger <krueger@…>

Branches:

(u'spielwiese', 'ec94ef7a30b928574c0c3daf41f6804dff5f6b69')

Children:

97f92aa6d280f6022eaae47195ccc02503ccb984

Parents:

4996f5286c7671191ad22e654499fd8b752fe4f0

Message:

Modified Files:
	libparse.l utils.cc LIB/classify.lib LIB/deform.lib
	LIB/elim.lib LIB/factor.lib LIB/fastsolv.lib LIB/finvar.lib
	LIB/general.lib LIB/hnoether.lib LIB/homolog.lib LIB/inout.lib
	LIB/invar.lib LIB/makedbm.lib LIB/matrix.lib LIB/normal.lib
	LIB/poly.lib LIB/presolve.lib LIB/primdec.lib LIB/primitiv.lib
	LIB/random.lib LIB/ring.lib LIB/sing.lib LIB/standard.lib
	LIB/tex.lib LIB/tst.lib
Changed help section o procedures to have an quoted help-string between
proc-definition and proc-body.


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

File:

• Singular/LIB/poly.lib (modified) (23 diffs)

Singular/LIB/poly.lib

@@ -1 @@
-// $Id: poly.lib,v 1.11 1998-04-06 17:59:38 obachman Exp $
+// $Id: poly.lib,v 1.12 1998-05-05 11:55:33 krueger Exp $
 //system("random",787422842);
 //(GMG, last modified 22.06.96)
@@ -5 +5 @@
 ///////////////////////////////////////////////////////////////////////////////
 
-version="$Id: poly.lib,v 1.11 1998-04-06 17:59:38 obachman Exp $";
+version="$Id: poly.lib,v 1.12 1998-05-05 11:55:33 krueger Exp $";
 info="
 LIBRARY:  poly.lib      PROCEDURES FOR MANIPULATING POLYS, IDEALS, MODULES
@@ -30 +30 @@
 
 proc cyclic (int n)
-USAGE:   cyclic(n);  n integer
+"USAGE:   cyclic(n);  n integer
 RETURN:  ideal of cyclic n-roots from 1-st n variables of basering
 EXAMPLE: example cyclic; shows examples
+"
 {
 //----------------------------- procedure body --------------------------------
@@ -58 +59 @@
 
 proc katsura
-USAGE:  katsura([n]); n integer
+"USAGE: katsura([n]); n integer
 RETURN: katsura(n) : n-th katsura ideal of newly created and set ring
                      (32003, x(0..n), dp)
         katsura()  : katsura ideal of basering 
 EXAMPLE: example katsura; shows examples
+"
 {
   if ( size(#) == 1 && typeof(#[1]) == "int")
@@ -111 +113 @@
 
 proc freerank
-USAGE:   freerank(M[,any]);  M=poly/ideal/vector/module/matrix
+"USAGE:   freerank(M[,any]);  M=poly/ideal/vector/module/matrix
 COMPUTE: rank of module presented by M in case it is free. By definition this
          is vdim(coker(M)/m*coker(M)) if coker(M) is free, where m = maximal
@@ -124 +126 @@
          //betti(0) ist -1 statt 0
 EXAMPLE: example freerank; shows examples
+"
 {
   int rk;
@@ -148 +151 @@
 
 proc is_homog (id)
-USAGE:   is_homog(id);  id  poly/ideal/vector/module/matrix
+"USAGE:   is_homog(id);  id  poly/ideal/vector/module/matrix
 RETURN:  integer which is 1 if input is homogeneous (resp. weighted homogeneous
          if the monomial ordering consists of one block of type ws,Ws,wp or Wp,
@@ -157 +160 @@
          //*** ergaenzen, wenn Matrizen-Spalten Gewichte haben
 EXAMPLE: example is_homog; shows examples
+"
 {
 //----------------------------- procedure body --------------------------------
@@ -186 +190 @@
 
 proc is_zero
-USAGE:   is_zero(M[,any]); M=poly/ideal/vector/module/matrix
+"USAGE:   is_zero(M[,any]); M=poly/ideal/vector/module/matrix
 RETURN:  integer, 1 if coker(M)=0 resp. 0 if coker(M)!=0, where M is considered
          as matrix
@@ -193 +197 @@
                 L[2] = dim(M)
 EXAMPLE: example is_zero; shows examples
+"
 {
   int d=dim(std(#[1]));
@@ -211 +216 @@
 
 proc maxcoef (f)
-USAGE:   maxcoef(f);  f  poly/ideal/vector/module/matrix
+"USAGE:   maxcoef(f);  f  poly/ideal/vector/module/matrix
 RETURN:  maximal length of coefficient of f of type int (by counting the
          length of the string of each coefficient)
 EXAMPLE: example maxcoef; shows examples
+"
 {
 //----------------------------- procedure body --------------------------------
@@ -247 +253 @@
 
 proc maxdeg (id)
-USAGE:   maxdeg(id);  id  poly/ideal/vector/module/matrix
+"USAGE:   maxdeg(id);  id  poly/ideal/vector/module/matrix
 RETURN:  int/intmat, each component equals maximal degree of monomials in the
          corresponding component of id, independent of ring ordering
@@ -255 +261 @@
          an option for computing weighted degrees
 EXAMPLE: example maxdeg; shows examples
+"
 {
    //-------- subprocedure to find maximal degree of given component ----------
@@ -300 +307 @@
 
 proc maxdeg1 (id,list #)
-USAGE:   maxdeg1(id[,v]);  id=poly/ideal/vector/module/matrix, v=intvec
+"USAGE:   maxdeg1(id[,v]);  id=poly/ideal/vector/module/matrix, v=intvec
 RETURN:  integer, maximal [weighted] degree of monomials of id independent of
          ring ordering, maxdeg1 of i-th variable is v[i] (default: v=1..1).
@@ -307 +314 @@
          maxdeg is faster
 EXAMPLE: example maxdeg1; shows examples
+"
 {
    //-------- subprocedure to find maximal degree of given component ----------
@@ -381 +389 @@
 
 proc mindeg (id)
-USAGE:   mindeg(id);  id  poly/ideal/vector/module/matrix
+"USAGE:   mindeg(id);  id  poly/ideal/vector/module/matrix
 RETURN:  minimal degree/s of monomials of id, independent of ring ordering
          (mindeg of each variable is 1) of type int if id of type poly, else
@@ -388 +396 @@
          has an option for computing weighted degrees.
 EXAMPLE: example mindeg; shows examples
+"
 {
    //--------- subprocedure to find minimal degree of given component ---------
@@ -434 +443 @@
 
 proc mindeg1 (id, list #)
-USAGE:   mindeg1(id[,v]);  id=poly/ideal/vector/module/matrix, v=intvec
+"USAGE:   mindeg1(id[,v]);  id=poly/ideal/vector/module/matrix, v=intvec
 RETURN:  integer, minimal [weighted] degree of monomials of id independent of
          ring ordering, mindeg1 of i-th variable is v[i] (default v=1..1).
@@ -441 +450 @@
          mindeg is faster.
 EXAMPLE: example mindeg1; shows examples
+"
 {
    //--------- subprocedure to find minimal degree of given component ---------
@@ -514 +524 @@
 
 proc normalize (id)
-USAGE:   normalize(id);  id=poly/vector/ideal/module
+"USAGE:   normalize(id);  id=poly/vector/ideal/module
 RETURN:  object of same type with leading coefficient equal to 1
 EXAMPLE: example normalize; shows an example
+"
 {
    return(simplify(id,1));
@@ -543 +554 @@
 ////////////////////////////////////////////////////////////////////////////////
 proc rad_con (poly g,ideal I)
-  USAGE:   rad_con(<poly>,<ideal>);
+"  USAGE:   rad_con(<poly>,<ideal>);
   RETURNS: 1 (TRUE) (type <int>) if <poly> is contained in the radical of
            <ideal>, 0 (FALSE) (type <int>) otherwise
   EXAMPLE: example rad_con; shows an example
+"
 { def br=basering;
   int n=nvars(br);
@@ -582 +594 @@
 
 proc lcm (ideal i)
-USAGE:   lcm(i); i ideal
+"USAGE:   lcm(i); i ideal
 RETURN:  poly = lcm(i[1],...,i[size(i)])
 NOTE:    
 EXAMPLE: example lcm; shows an example
+"
 {
   int k,j;
@@ -636 +649 @@
 
 proc content(f)
-USAGE:   content(f); f polynomial/vector
+"USAGE:   content(f); f polynomial/vector
 RETURN:  number, the content (greatest common factor of coefficients)
          of the polynomial/vector f
 EXAMPLE: example content; shows an example
+"
 {
   return(leadcoef(f)/leadcoef(cleardenom(f)));