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

Timestamp:

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

Author:

Kai Krüger <krueger@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

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/general.lib (modified) (23 diffs)

Singular/LIB/general.lib

@@ -1 @@
-// $Id: general.lib,v 1.6 1998-04-23 17:09:20 Singular Exp $
+// $Id: general.lib,v 1.7 1998-05-05 11:55:27 krueger Exp $
 //system("random",787422842);
 //(GMG, last modified 22.06.96)
 ///////////////////////////////////////////////////////////////////////////////
 
-version="$Id: general.lib,v 1.6 1998-04-23 17:09:20 Singular Exp $";
+version="$Id: general.lib,v 1.7 1998-05-05 11:55:27 krueger Exp $";
 info="
 LIBRARY:  general.lib   PROCEDURES OF GENERAL TYPE
@@ -30 +30 @@
 
 proc A_Z (string s,int n)
-USAGE:   A_Z("a",n);  a any letter, n integer (-26<= n <=26, !=0)
+"USAGE:   A_Z(\"a\",n);  a any letter, n integer (-26<= n <=26, !=0)
 RETURN:  string of n small (if a is small) or capital (if a is capital)
          letters, comma seperated, beginning with a, in alphabetical
          order (or revers alphabetical order if n<0)
 EXAMPLE: example A_Z; shows an example
+"
 {
   if ( n>=-26 and n<=26 and n!=0 )
@@ -85 +86 @@
 
 proc binomial (int n, int k, list #)
-USAGE:   binomial(n,k[,p/s]); n,k,p integers, s string
+"USAGE:   binomial(n,k[,p/s]); n,k,p integers, s string
 RETURN:  binomial(n,k);    binomial coefficient n choose k of type int
                            (machine integer, limited size! )
@@ -92 +93 @@
                            in char of basering if a basering is defined
 EXAMPLE: example binomial; shows an example
+"
 {
    if ( size(#)==0 ) { int rr=1; }
@@ -120 +122 @@
 
 proc factorial (int n, list #)
-USAGE:   factorial(n[,string]);  n integer
+"USAGE:   factorial(n[,string]);  n integer
 RETURN:  factorial(n); string of n! in char 0
          factorial(n,s);  n! of type number (s any string), computed in char of
          basering if a basering is defined
 EXAMPLE: example factorial; shows an example
+"
 {
    if ( size(#)==0 ) { ring R = 0,x,dp; poly r=1; }
@@ -148 +151 @@
 
 proc fibonacci (int n, list #)
-USAGE:   fibonacci(n[,string]);  (n integer)
+"USAGE:   fibonacci(n[,string]);  (n integer)
 RETURN:  fibonacci(n); string of nth Fibonacci number,
             f(0)=f(1)=1, f(i+1)=f(i-1)+f(i)
@@ -154 +157 @@
          computed in characteristic of basering if a basering is defined
 EXAMPLE: example fibonacci; shows an example
+"
 {
    if ( size(#)==0 ) { ring fibo = 0,x,dp; number f=1; }
@@ -177 +181 @@
 
 proc kmemory ()
-USAGE:   kmemory();
+"USAGE:   kmemory();
 RETURN:  memory used by active variables, of type int (in kilobyte)
 EXAMPLE: example kmemory; shows an example
+"
 {
   if ( voice==2 ) { "// memory used by active variables (kilobyte):"; }
@@ -191 +196 @@
 
 proc killall
-USAGE:   killall(); (no parameter)
-         killall("type_name");
-         killall("not", "type_name");
+"USAGE:   killall(); (no parameter)
+         killall(\"type_name\");
+         killall(\"not\", \"type_name\");
 COMPUTE: killall(); kills all user-defined variables but not loaded procedures
-         killall("type_name"); kills all user-defined variables, of type "type_name" 
-         killall("not", "type_name"); kills all user-defined
-         variables, except those of type "type_name" and except loaded procedures
+         killall(\"type_name\"); kills all user-defined variables, of type \"type_name\" 
+         killall(\"not\", \"type_name\"); kills all user-defined
+         variables, except those of type \"type_name\" and except loaded procedures
 RETURN:  no return value
 NOTE:    killall should never be used inside a procedure
 EXAMPLE: example killall; shows an example AND KILLS ALL YOUR VARIABLES
+"
 {
    list L=names(); int joni=size(L);
@@ -255 +261 @@
 
 proc number_e (int n)
-USAGE:   number_e(n);  n integer
+"USAGE:   number_e(n);  n integer
 COMPUTE: exp(1) up to n decimal digits (no rounding)
          by A.H.J. Sale's algorithm
@@ -262 +268 @@
          display its decimal format
 EXAMPLE: example number_e; shows an example
+"
 {
    int i,m,s,t;
@@ -296 +303 @@
 
 proc number_pi (int n)
-USAGE:   number_pi(n);  n positive integer
+"USAGE:   number_pi(n);  n positive integer
 COMPUTE: pi (area of unit circle) up to n decimal digits (no rounding)
          by algorithm of S. Rabinowitz
@@ -303 +310 @@
          its decimal format
 EXAMPLE: example number_pi; shows an example
+"
 {
    int i,m,t,e,q,N;
@@ -366 +374 @@
 
 proc primes (int n, int m)
-USAGE:   primes(n,m);  n,m integers
+"USAGE:   primes(n,m);  n,m integers
 RETURN:  intvec, consisting of all primes p, prime(n)<=p<=m, in increasing
          order if n<=m, resp. prime(m)<=p<=n, in decreasing order if m<n
 NOTE:    prime(n); returns the biggest prime number <= n (if n>=2, else 2)
 EXAMPLE: example primes; shows an example
+"
 {  int change;
    if ( n>m ) { change=n; n=m ; m=change; change=1; }
@@ -386 +395 @@
 
 proc product (id, list #)
-USAGE:    product(id[,v]); id=ideal/vector/module/matrix
+"USAGE:    product(id[,v]); id=ideal/vector/module/matrix
           resp.id=intvec/intmat, v=intvec (e.g. v=1..n, n=integer)
 RETURN:   poly resp. int which is the product of all entries of id, with index
@@ -393 +402 @@
           identified with corresponding matrix M (columns of M generate m)
 EXAMPLE:  example product; shows an example
+"
 {
    int n,j;
@@ -431 +441 @@
 
 proc ringweights (r)
-USAGE:   ringweights(r); r ring
+"USAGE:   ringweights(r); r ring
 RETURN:  intvec of weights of ring variables. If, say, x(1),...,x(n) are the
          variables of the ring r, in this order, the resulting intvec is
@@ -439 +449 @@
          the resulting intvec is 1,...,1
 EXAMPLE: example ringweights; shows an example
+"
 {
    int i; intvec v; setring r;
@@ -456 +467 @@
 
 proc sort (id, list #)
-USAGE:   sort(id[v,o,n]); id=ideal/module/intvec/list (of intvec's or int's)
+"USAGE:   sort(id[v,o,n]); id=ideal/module/intvec/list (of intvec's or int's)
          sort may be called with 1, 2 or 3 arguments in the following way:
          -  sort(id[v,n]); v=intvec, n=integer,
@@ -488 +499 @@
          Zero generators of ideal/module are deleted
 EXAMPLE: example sort; shows an example
+"
 {
    int ii,jj,s,n = 0,0,1,0;
@@ -580 +592 @@
 
 proc sum (id, list #)
-USAGE:    sum(id[,v]); id=ideal/vector/module/matrix resp. id=intvec/intmat,
+"USAGE:    sum(id[,v]); id=ideal/vector/module/matrix resp. id=intvec/intmat,
                        v=intvec (e.g. v=1..n, n=integer)
 RETURN:   poly resp. int which is the sum of all entries of id, with index
@@ -587 +599 @@
           identified with corresponding matrix M (columns of M generate m)
 EXAMPLE:  example sum; shows an example
+"
 {
    if( typeof(id)=="poly" or typeof(id)=="ideal" or typeof(id)=="vector"
@@ -625 +638 @@
 
 proc which (command)
-USAGE:    which(command); command = string expression
+"USAGE:    which(command); command = string expression
 RETURN:   Absolute pathname of command, if found in search path.
           Empty string, otherwise.
 NOTE:     Based on the Unix command 'which'.
 EXAMPLE:  example which; shows an example
+"
 {
    int rs;