version 1.3, 2000/02/24 00:27:12 |
version 1.18, 2003/08/22 11:47:03 |
|
|
/* $OpenXM: OpenXM/src/kan96xx/Kan/usage.c,v 1.2 1999/11/07 13:24:20 takayama Exp $ */ |
/* $OpenXM: OpenXM/src/kan96xx/Kan/usage.c,v 1.17 2003/08/21 04:45:40 takayama Exp $ */ |
#include <stdio.h> |
#include <stdio.h> |
#include "datatype.h" |
#include "datatype.h" |
#include "stackm.h" |
#include "stackm.h" |
|
|
*/ |
*/ |
|
|
void Kusage(ob) |
void Kusage(ob) |
struct object ob; |
struct object ob; |
{ |
{ |
char *s; |
char *s; |
printf("\n"); |
printf("\n"); |
Line 27 struct object ob; |
|
Line 27 struct object ob; |
|
#define fppp fprintf |
#define fppp fprintf |
|
|
void Kusage2(fp,s) |
void Kusage2(fp,s) |
FILE *fp; |
FILE *fp; |
char *s; |
char *s; |
{ |
{ |
/*int n,i; fprintf(stderr,"\n%d: ",strlen(s)); |
/*int n,i; fprintf(stderr,"\n%d: ",strlen(s)); |
for (i=0; i<strlen(s); i++) fprintf(stderr," %x",s[i]);*/ |
for (i=0; i<strlen(s); i++) fprintf(stderr," %x",s[i]);*/ |
if (strcmp(s,"add")==0) { |
if (strcmp(s,"add")==0) { |
fppp(fp,"<< obj1 obj2 add obj3 >>\n"); |
fppp(fp,"<< obj1 obj2 add obj3 >>\n"); |
fppp(fp,"obj3 is the sum of obj1 and obj2.\n"); |
fppp(fp,"obj3 is the sum of obj1 and obj2.\n"); |
|
|
fppp(fp," [(getpid) ] extension result-integer \n"); |
fppp(fp," [(getpid) ] extension result-integer \n"); |
fppp(fp," [(getenv) envName] extension valueOfEnvName \n"); |
fppp(fp," [(getenv) envName] extension valueOfEnvName \n"); |
fppp(fp," [(stat) fname] extension v \n"); |
fppp(fp," [(stat) fname] extension v \n"); |
fppp(fp," v = [null,[(error no), p] or [0, [ ]]\n"); |
fppp(fp," v = [null,[(error no), p]] or [0, [size ]]\n"); |
fppp(fp," [(forkExec) argList fdList sigblock] extension pid\n"); |
fppp(fp," [(forkExec) argList fdList sigblock] extension pid\n"); |
fppp(fp," [(getchild)] extension listOfPid (generated by forkExec)\n"); |
fppp(fp," [(getchild)] extension listOfPid (generated by forkExec)\n"); |
fppp(fp," [(keywords) ] extension array-of-names-of-primitives \n"); |
fppp(fp," [(keywords) ] extension array-of-names-of-primitives \n"); |
|
fppp(fp," [(nobody) ] extension null \n"); |
fppp(fp," [(getUniqueFileName) path] extension newName \n"); |
fppp(fp," [(getUniqueFileName) path] extension newName \n"); |
fppp(fp," [(outputObjectToFile) path obj] extension null \n"); |
fppp(fp," [(outputObjectToFile) path obj] extension null \n"); |
|
fppp(fp," [(ostype)] extension list \n"); |
|
fppp(fp," [(regionMatches) string stringArray] extension list \n"); |
/* fppp(fp," [(asir0) string] extension result-object \n"); */ |
/* fppp(fp," [(asir0) string] extension result-object \n"); */ |
fppp(fp,"See also plugin-* in ??. \n"); |
fppp(fp,"See also plugin-* in ??. \n"); |
}else if (strcmp(s,"file")==0) { |
}else if (strcmp(s,"file")==0) { |
|
|
fppp(fp," [(lmonom) 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_) array_of_poly] gbext poly cf. toVectors \n"); |
fppp(fp," [(isOrdered) poly] gbext poly \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;"); |
|
|
fppp(fp,"Example: 5 2 idiv :: ===> 2\n"); |
fppp(fp,"Example: 5 2 idiv :: ===> 2\n"); |
}else if (strcmp(s,"ifelse") == 0) { |
}else if (strcmp(s,"ifelse") == 0) { |
fppp(fp,"<< condition { true case } { false case } ifelse >>\n"); /*:*/ |
fppp(fp,"<< condition { true case } { false case } ifelse >>\n"); /*:*/ |
/* Tenuki mark --------------^ */ |
/* Tenuki mark --------------^ */ |
fppp(fp,"integer condition;\n"); |
fppp(fp,"integer condition;\n"); |
fppp(fp,"If condition is non-zero, then true-case will be executed,\n"); |
fppp(fp,"If condition is non-zero, then true-case will be executed,\n"); |
fppp(fp,"else false-case will be executed.\n"); |
fppp(fp,"else false-case will be executed.\n"); |
|
|
fppp(fp,"h is the initial term of the polynomial f.\n"); |
fppp(fp,"h is the initial term of the polynomial f.\n"); |
fppp(fp,"Example: (2 x^3 + 3 x + 1). init :: ---> 2 x^3\n"); |
fppp(fp,"Example: (2 x^3 + 3 x + 1). init :: ---> 2 x^3\n"); |
fppp(fp,"Example: [(x^3+1). (x h+ h^5).] {init} map ::\n"); |
fppp(fp,"Example: [(x^3+1). (x h+ h^5).] {init} map ::\n"); |
fppp(fp,"Example: (x+1). [0 1 1 1] init :: cf. weightv \n"); |
fppp(fp,"Example: (x+1). [0 1 1 1] init :: cf. weightv \n\n"); |
|
fppp(fp,"<< fv weight_vector init h >>\n"); |
|
fppp(fp,"<< fv [weight_vector shift_vector] init h >>\n"); |
|
fppp(fp,"fv is a polynomial or a vector of polynomials.\n"); |
|
fppp(fp,"Note: the last x variable is always assumed to be the vector index.\n"); |
|
fppp(fp,"Example: [(x,y) ring_of_differential_operators 0] define_ring\n"); |
|
fppp(fp," [(x^2*Dx^2+2*x*Dx+x). (Dx+x).] [[(Dx) 1 (x) -1] weightv [0 -1]] init ::\n"); |
}else if (strcmp(s,"lc")==0) { |
}else if (strcmp(s,"lc")==0) { |
fppp(fp,"<< obj lc leftCell >>\n"); |
fppp(fp,"<< obj lc leftCell >>\n"); |
fppp(fp,"class leftCell;\n"); |
fppp(fp,"class leftCell;\n"); |
|
|
fppp(fp,"orderMatrix, gbListTower, Schreyer, \n"); |
fppp(fp,"orderMatrix, gbListTower, Schreyer, \n"); |
fppp(fp,"outputOrder, multSymbol, variableNames, Version,\n"); |
fppp(fp,"outputOrder, multSymbol, variableNames, Version,\n"); |
fppp(fp,"AvoidTheSameRing, RingStack, LeftBracket, RightBracket,\n"); |
fppp(fp,"AvoidTheSameRing, RingStack, LeftBracket, RightBracket,\n"); |
fppp(fp,"AutoReduce\n"); |
fppp(fp,"AutoReduce, SecureMode, Ecart, EcartAutomaticHomogenization\n"); |
|
fppp(fp,"DoCancel, DebugContentReduction\n"); |
fppp(fp,"Example: [(N)] system_variable\n"); |
fppp(fp,"Example: [(N)] system_variable\n"); |
fppp(fp," (maximum number of variables)/2.\n"); |
fppp(fp," (maximum number of variables)/2.\n"); |
fppp(fp," [(x) (var) 3] system_variable\n"); |
fppp(fp," [(x) (var) 3] system_variable\n"); |
|
|
fppp(fp," The 4th differential operator.\n"); |
fppp(fp," The 4th differential operator.\n"); |
fppp(fp," [(PrintDollar) 0] system_variable\n"); |
fppp(fp," [(PrintDollar) 0] system_variable\n"); |
fppp(fp," Set the global variable PrintDollar to 0\n"); |
fppp(fp," Set the global variable PrintDollar to 0\n"); |
|
fppp(fp,"DebugReductionEcart (bit): (2) *% (1) find_reducer,in(r) \n"); |
|
fppp(fp," (any) cont (4) #+[rat division, + ecartd] \n"); |
|
fppp(fp,"DoCancel (bit): (2) always_reduce_content (1) Noro_strategy \n"); |
|
fppp(fp," (4) DoCancel_in_reduction1 \n"); |
|
}else if (strcmp(s,"tlimit")==0) { |
|
fppp(fp,"<< { ... } t tlimit results >>\n"); |
|
fppp(fp,"Limit the execution time to t seconds.\n"); |
|
fppp(fp,"When t is not positive, tlimit pushes the execution time.\n"); |
}else if (strcmp(s,"to_records")==0) { |
}else if (strcmp(s,"to_records")==0) { |
fppp(fp,"<< ({arg1,arg2,...,argn}) to_records (arg1) ... (argn) n >>\n"); |
fppp(fp,"<< ({arg1,arg2,...,argn}) to_records (arg1) ... (argn) n >>\n"); |
fppp(fp,"Example: ({x,y2}) to_records ===> (x) (y2) 2\n"); |
fppp(fp,"Example: ({x,y2}) to_records ===> (x) (y2) 2\n"); |
|
|
fppp(fp,"file fd; string s;\n"); |
fppp(fp,"file fd; string s;\n"); |
fppp(fp,"Write the string s to the file fd.\n"); |
fppp(fp,"Write the string s to the file fd.\n"); |
fppp(fp,"cf. [(PrintDollar)] system_variable, file, closefile\n"); |
fppp(fp,"cf. [(PrintDollar)] system_variable, file, closefile\n"); |
/******* macros ************/ |
/******* macros ************/ |
}else if (strcmp(s,"timer")==0) { |
}else if (strcmp(s,"timer")==0) { |
fppp(fp,"<< { executable array } timer >>\n"); /*:*/ |
fppp(fp,"<< { executable array } timer >>\n"); /*:*/ |
}else{ |
}else{ |