version 1.13, 2003/07/17 07:33:03 |
version 1.18, 2003/08/22 11:47:03 |
|
|
/* $OpenXM: OpenXM/src/kan96xx/Kan/usage.c,v 1.12 2003/07/10 05:01:41 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" |
Line 194 void Kusage2(fp,s) |
|
Line 194 void Kusage2(fp,s) |
|
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," [(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 253 void Kusage2(fp,s) |
|
Line 254 void Kusage2(fp,s) |
|
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"); |
Line 458 void Kusage2(fp,s) |
|
Line 465 void Kusage2(fp,s) |
|
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, SecureMode, Ecart\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"); |
Line 467 void Kusage2(fp,s) |
|
Line 475 void Kusage2(fp,s) |
|
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) { |
}else if (strcmp(s,"tlimit")==0) { |
fppp(fp,"<< { ... } t tlimit results >>\n"); |
fppp(fp,"<< { ... } t tlimit results >>\n"); |
fppp(fp,"Limit the execution time to t seconds.\n"); |
fppp(fp,"Limit the execution time to t seconds.\n"); |