void setwfl_ (int *velocity, int *nominal, float *dt)
{
if (BwtHook != 0) {
free_hook(&BwtHook) ;
}
BwtHook = wa_new ( *velocity, *nominal, *dt ) ;
}
wast_t make_wast(tinyap_t t, ast_node_t a) {
wast_t ret;
int i;
int max;
if(!a) {
return NULL;
}
if(tinyap_node_is_string(a)) {
ret = wa_new(tinyap_node_get_string(a),tinyap_node_get_row(t, a), tinyap_node_get_col(t, a));
} else {
ret = wa_new(tinyap_node_get_operator(a),tinyap_node_get_row(t, a), tinyap_node_get_col(t, a));
max=tinyap_node_get_operand_count(a);
for(i=0;i<max;i+=1) {
/* FIXME : quadratic complexity in the AST size instead of linear complexity, it suxx. recursion over cdr(a) would perform better. */
wa_add(ret,make_wast(t, tinyap_node_get_operand(a,i)));
}
}
return ret;
}
