version 1.25, 2003/11/20 09:20:36 |
version 1.29, 2004/07/30 11:21:55 |
|
|
/* $OpenXM: OpenXM/src/kan96xx/Kan/usage.c,v 1.24 2003/11/17 00:28:13 takayama Exp $ */ |
/* $OpenXM: OpenXM/src/kan96xx/Kan/usage.c,v 1.28 2004/05/13 04:38:28 takayama Exp $ */ |
#include <stdio.h> |
#include <stdio.h> |
#include "datatype.h" |
#include "datatype.h" |
#include "stackm.h" |
#include "stackm.h" |
Line 99 void Kusage2(fp,s) |
|
Line 99 void Kusage2(fp,s) |
|
fppp(fp," map, orderMatrix, error, \n"); |
fppp(fp," map, orderMatrix, error, \n"); |
fppp(fp," or [(class) (class-name)].\n"); |
fppp(fp," or [(class) (class-name)].\n"); |
fppp(fp,"The primitive reports and converts the data type of obj.\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"); |
fppp(fp,"Example: (2) (integer) data_conversion ===> 2\n"); |
}else if (strcmp(s,"def")==0 || strcmp(s,"set")==0) { |
}else if (strcmp(s,"def")==0 || strcmp(s,"set")==0) { |
fppp(fp,"<< /name object def >> or << object /name set >>\n"); |
fppp(fp,"<< /name object def >> or << object /name set >>\n"); |
Line 178 void Kusage2(fp,s) |
|
Line 180 void Kusage2(fp,s) |
|
fppp(fp,"array of objects obj1;"); |
fppp(fp,"array of objects obj1;"); |
fppp(fp,"The first element of the obj1 should be the key word tag.\n"); |
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,"<< 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,h,Dx,Dy,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," [(isReducible) poly1 poly2 ] gbext integer \n"); |
fppp(fp," [(lcm) poly1 poly2] gbext poly \n"); |
fppp(fp," [(lcm) poly1 poly2] gbext poly \n"); |
fppp(fp," [(grade) poly1 ] gbext integer \n"); |
fppp(fp," [(lcoeff) poly] gbext poly \n"); |
fppp(fp," [(ord_ws_all) fv wv] gbext integer \n"); |
fppp(fp," [(lmonom) poly] gbext poly \n"); |
fppp(fp," [(mod) poly1 universalNumber] 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 = poly1 mod universalNumber where char=0 and \n"); |
fppp(fp," poly and poly2 belong to a same ring.\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," [(tomodp) poly1 ring] gbext poly, char(ring)>0. \n"); |
fppp(fp," poly = poly1 mod char(ring) where poly belongs to ring.\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," [(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," [(schreyerSkelton) array_of_poly] gbext array \n"); |
fppp(fp," [(toes) array_of_poly] gbext poly \n"); |
fppp(fp," [(toes) array_of_poly] gbext poly \n"); |
fppp(fp," [(toe_) poly] gbext poly \n"); |
fppp(fp," [(toe_) poly] gbext poly \n"); |
fppp(fp," [(toe_) array_of_poly] gbext poly cf. toVectors \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) { |
}else if (strcmp(s,"get")==0) { |
fppp(fp,"<< [f0 f1 ... fn] k get fk >>\n"); |
fppp(fp,"<< [f0 f1 ... fn] k get fk >>\n"); |
fppp(fp,"integer k;"); |
fppp(fp,"integer k;"); |
Line 325 void Kusage2(fp,s) |
|
Line 331 void Kusage2(fp,s) |
|
}else if (strcmp(s,"newstack") == 0) { |
}else if (strcmp(s,"newstack") == 0) { |
fppp(fp,"<< size newstack class.OperandStack >>\n"); /*:*/ |
fppp(fp,"<< size newstack class.OperandStack >>\n"); /*:*/ |
fppp(fp,"cf. setstack, stdstack.\n"); |
fppp(fp,"cf. setstack, stdstack.\n"); |
|
}else if (strcmp(s,"oxshell") == 0) { |
|
fppp(fp,"<< cmds oxshell result >>\n"); /*:*/ |
|
fppp(fp,"cmds is an array of strings.\n"); |
|
KoxShellHelp((char *)NULL,fp); |
}else if (strcmp(s,"pop")==0) { |
}else if (strcmp(s,"pop")==0) { |
fppp(fp,"<< obj pop >> \n"); /*:*/ |
fppp(fp,"<< obj pop >> \n"); /*:*/ |
fppp(fp,"It removes the obj from the stack.\n"); |
fppp(fp,"It removes the obj from the stack.\n"); |