=================================================================== RCS file: /home/cvs/OpenXM/src/kan96xx/Kan/usage.c,v retrieving revision 1.27 retrieving revision 1.31 diff -u -p -r1.27 -r1.31 --- OpenXM/src/kan96xx/Kan/usage.c 2003/12/03 09:00:46 1.27 +++ OpenXM/src/kan96xx/Kan/usage.c 2004/09/05 07:42:43 1.31 @@ -1,4 +1,4 @@ -/* $OpenXM: OpenXM/src/kan96xx/Kan/usage.c,v 1.26 2003/12/03 01:21:43 takayama Exp $ */ +/* $OpenXM: OpenXM/src/kan96xx/Kan/usage.c,v 1.30 2004/09/04 11:25:58 takayama Exp $ */ #include #include "datatype.h" #include "stackm.h" @@ -99,6 +99,8 @@ void Kusage2(fp,s) fppp(fp," map, orderMatrix, error, \n"); fppp(fp," or [(class) (class-name)].\n"); fppp(fp,"The primitive reports and converts the data type of obj.\n"); + fppp(fp,"Special combinations of obj and keyword.\n"); + fppp(fp," ring (oxRingStructure) data_conversion list\n"); fppp(fp,"Example: (2) (integer) data_conversion ===> 2\n"); }else if (strcmp(s,"def")==0 || strcmp(s,"set")==0) { fppp(fp,"<< /name object def >> or << object /name set >>\n"); @@ -159,6 +161,8 @@ void Kusage2(fp,s) fppp(fp," [(outputObjectToFile) path obj] extension null \n"); fppp(fp," [(ostype)] extension list \n"); fppp(fp," [(regionMatches) string stringArray] extension list \n"); + fppp(fp," [(traceClearStack)] extension null \n"); + fppp(fp," [(traceShowStack)] extension str \n"); /* fppp(fp," [(asir0) string] extension result-object \n"); */ fppp(fp,"See also plugin-* in ??. \n"); }else if (strcmp(s,"file")==0) { @@ -178,29 +182,33 @@ void Kusage2(fp,s) fppp(fp,"array of objects obj1;"); fppp(fp,"The first element of the obj1 should be the key word tag.\n"); fppp(fp,"<< gbext >> is used to call auxiliary functions for g-basis computation. \n"); + fppp(fp," [(divByN) poly1 n(universalNumber)] gbext [qpoly rpoly] \n"); + fppp(fp," where poly1 = n*qpoly+rpoly.\n"); + fppp(fp," (see also cancelCoeff) \n"); + fppp(fp," [(exponents) poly type ] gbext array \n"); + fppp(fp," example: type == 0 x,y,Dx,Dy\n"); + fppp(fp," type == 1 x,y,Dx,Dy,h,H\n"); + fppp(fp," type == 2 x,y,Dx,Dy,h --- default.\n"); + fppp(fp," [(grade) poly1 ] gbext integer \n"); + fppp(fp," [(isConstant) poly] gbext bool \n"); + fppp(fp," [(isConstantAll) poly] gbext bool \n"); + fppp(fp," [(isOrdered) poly] gbext poly \n"); fppp(fp," [(isReducible) poly1 poly2 ] gbext integer \n"); fppp(fp," [(lcm) poly1 poly2] gbext poly \n"); - fppp(fp," [(grade) poly1 ] gbext integer \n"); - fppp(fp," [(ord_ws_all) fv wv] gbext integer \n"); + fppp(fp," [(lcoeff) poly] gbext poly \n"); + fppp(fp," [(lmonom) poly] gbext poly \n"); fppp(fp," [(mod) poly1 universalNumber] gbext poly \n"); fppp(fp," poly = poly1 mod universalNumber where char=0 and \n"); fppp(fp," poly and poly2 belong to a same ring.\n"); + fppp(fp," [(ord_ws_all) fv wv] gbext integer \n"); + fppp(fp," [(reduceContent) poly] gbext [poly c] \n"); fppp(fp," [(tomodp) poly1 ring] gbext poly, char(ring)>0. \n"); fppp(fp," poly = poly1 mod char(ring) where poly belongs to ring.\n"); fppp(fp," [(tomod0) poly1 ring] gbext poly, char(ring)=0. \n"); - fppp(fp," [(divByN) poly1 n(universalNumber)] gbext [qpoly rpoly] \n"); - fppp(fp," where poly1 = n*qpoly+rpoly.\n"); - fppp(fp," (see also cancelCoeff) \n"); - fppp(fp," [(isConstant) poly] gbext bool \n"); - fppp(fp," [(isConstantAll) poly] gbext bool \n"); - fppp(fp," [(lcoeff) poly] gbext poly \n"); - fppp(fp," [(lmonom) poly] gbext poly \n"); fppp(fp," [(schreyerSkelton) array_of_poly] gbext array \n"); fppp(fp," [(toes) array_of_poly] gbext poly \n"); fppp(fp," [(toe_) poly] gbext poly \n"); fppp(fp," [(toe_) array_of_poly] gbext poly cf. toVectors \n"); - fppp(fp," [(isOrdered) poly] gbext poly \n"); - fppp(fp," [(reduceContent) poly] gbext [poly c] \n"); }else if (strcmp(s,"get")==0) { fppp(fp,"<< [f0 f1 ... fn] k get fk >>\n"); fppp(fp,"integer k;");