=================================================================== RCS file: /home/cvs/OpenXM/src/ox_gsl/ox_eval.c,v retrieving revision 1.2 retrieving revision 1.5 diff -u -p -r1.2 -r1.5 --- OpenXM/src/ox_gsl/ox_eval.c 2018/04/05 05:53:52 1.2 +++ OpenXM/src/ox_gsl/ox_eval.c 2018/04/13 16:51:42 1.5 @@ -1,7 +1,8 @@ -/* $OpenXM: OpenXM/src/ox_gsl/ox_eval.c,v 1.1 2018/04/03 12:09:46 ohara Exp $ */ +/* $OpenXM: OpenXM/src/ox_gsl/ox_eval.c,v 1.4 2018/04/06 10:44:51 ohara Exp $ */ #include #include +#include #include #include #include "ox_toolkit.h" @@ -10,9 +11,7 @@ Usage: double d; -init_dic(); -register_entry("x",1.25); -register_entry("y",2.1); +replace(3,"x",1.25,"y",-2.0, "z", 2.1); if(eval_cmo(your_cmo_tree,&d)==0) goto_error(); */ @@ -22,6 +21,8 @@ if(eval_cmo(your_cmo_tree,&d)==0) goto_error(); #define FAILED 0 #define SUCCEED 1 +void replace(int n, ...); +void replace2(int n, char *s[], double v[]); int eval_cmo(cmo *c, double *retval); static double op_add(double x,double y) @@ -66,16 +67,38 @@ typedef struct { entry global_dic[512] = { {"sin",0,sin,1}, {"cos",0,cos,1}, + {"tan",0,tan,1}, + {"sinh",0,sinh,1}, + {"cosh",0,cosh,1}, + {"tanh",0,tanh,1}, + {"asin",0,asin,1}, + {"acos",0,acos,1}, + {"asinh",0,asinh,1}, + {"acosh",0,acosh,1}, + {"erf",0,erf,1}, {"exp",0,exp,1}, + {"exp2",0,exp2,1}, {"log",0,log,1}, - {"negative",0,op_negative,1}, + {"log2",0,log2,1}, + {"log10",0,log10,1}, + {"gamma",0,gamma,1}, + {"lgamma",0,lgamma,1}, + {"sqrt",0,sqrt,1}, + {"cbrt",0,cbrt,1}, + {"fabs",0,fabs,1}, + {"j0",0,j0,1}, + {"j1",0,j1,1}, + {"y0",0,y0,1}, + {"y1",0,y1,1}, + {"-", 0,op_negative,1}, {"+", 0,op_add,2}, {"-", 0,op_sub,2}, {"*", 0,op_mul,2}, {"/", 0,op_div,2}, {"^", 0,pow,2}, - {"e", M_E, NULL,0}, - {"pi", M_PI,NULL,0}, + {"pow", 0,pow,2}, + {"@e", M_E, NULL,0}, + {"@pi", M_PI,NULL,0}, {NULL,0,NULL,0} }; @@ -108,9 +131,32 @@ void init_dic() memset(local_dic, 0, sizeof(entry)*LOCAL_DIC_SIZE); } -static entry *find_entry(cmo *node, entry *dic) +void replace(int n, ...) { char *s; + double d; + va_list ap; + va_start(ap,n); + for(init_dic(); n>0; n--) { + s = va_arg(ap, char *); + d = va_arg(ap, double); + register_entry(s,d); + } + va_end(ap); +} + +void replace2(int n, char *s[], double v[]) +{ + int i; + init_dic(); + for(i=0; itag == CMO_STRING) { s = ((cmo_string *)node)->s; @@ -120,7 +166,7 @@ static entry *find_entry(cmo *node, entry *dic) return NULL; } for(e=dic; e->name != NULL; e++) { - if(strcmp(e->name,s)==0) { + if(strcmp(e->name,s)==0 && (len<0 || len==e->n_args)) { return e; } } @@ -183,18 +229,18 @@ int entry_value(entry *e, double *retval) */ static int eval_cmo_tree(cmo_tree* t, double *retval) { - entry *e = find_entry((cmo *)t->name,global_dic); - if (FUNCTION_P(e)) { - return entry_function(e,t->leaves,retval); - }else if (VALUE_P(e)) { - return entry_value(e, retval); - } + entry *e = find_entry((cmo *)t->name,list_length(t->leaves),global_dic); + if (FUNCTION_P(e)) { + return entry_function(e,t->leaves,retval); + }else if (VALUE_P(e)) { + return entry_value(e, retval); + } return 0; } static int eval_cmo_indeterminate(cmo_indeterminate *c, double *retval) { - entry *e = find_entry((cmo *)c,local_dic); + entry *e = find_entry((cmo *)c,-1,local_dic); if (VALUE_P(e)) { return entry_value(e,retval); } @@ -263,7 +309,7 @@ static int eval_cmo_recursive_polynomial(cmo_recursive } vars=(double *)calloc(n,sizeof(double)); for(i=0; iringdef,i),local_dic); + e = find_entry(list_nth(c->ringdef,i),-1,local_dic); if(e == NULL) { free(vars); return 0; /* failed */ @@ -282,6 +328,7 @@ int eval_cmo(cmo *c, double *retval) { int tag = c->tag; switch(c->tag) { + case CMO_NULL: case CMO_ZERO: *retval = 0; break;