version 1.66, 2005/09/30 02:20:06 |
version 1.71, 2005/10/12 14:43:36 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.65 2005/09/30 01:35:25 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.70 2005/10/12 03:31:04 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 63 struct TeXSymbol { |
|
Line 63 struct TeXSymbol { |
|
char *symbol; |
char *symbol; |
}; |
}; |
|
|
|
#define OPNAME(f) (((ARF)FA0(f))->name[0]) |
|
|
extern char *parse_strp; |
extern char *parse_strp; |
|
|
void Psprintf(); |
void Psprintf(); |
Line 77 void Pquotetotex_tb(); |
|
Line 79 void Pquotetotex_tb(); |
|
void Pquotetotex(); |
void Pquotetotex(); |
void Pquotetotex_env(); |
void Pquotetotex_env(); |
void Pflatten_quote(); |
void Pflatten_quote(); |
|
|
|
void Pquote_is_integer(),Pquote_is_rational(),Pquote_is_number(); |
|
void Pquote_is_dependent(),Pquote_is_function(); |
|
void Pquote_normalize(); |
|
|
void Pquote_to_funargs(),Pfunargs_to_quote(),Pget_function_name(); |
void Pquote_to_funargs(),Pfunargs_to_quote(),Pget_function_name(); |
void Pquote_unify(),Pget_quote_id(); |
void Pquote_unify(),Pget_quote_id(),Pquote_match_rewrite(); |
void Pquote_to_nary(),Pquote_to_bin(); |
void Pquote_to_nary(),Pquote_to_bin(); |
void do_assign(NODE arg); |
void do_assign(NODE arg); |
void fnodetotex_tb(FNODE f,TB tb); |
void fnodetotex_tb(FNODE f,TB tb); |
Line 107 struct ftab str_tab[] = { |
|
Line 114 struct ftab str_tab[] = { |
|
{"tb_to_string",Ptb_to_string,1}, |
{"tb_to_string",Ptb_to_string,1}, |
{"string_to_tb",Pstring_to_tb,1}, |
{"string_to_tb",Pstring_to_tb,1}, |
{"get_quote_id",Pget_quote_id,1}, |
{"get_quote_id",Pget_quote_id,1}, |
|
|
|
{"quote_is_number",Pquote_is_number,1}, |
|
{"quote_is_rational",Pquote_is_rational,1}, |
|
{"quote_is_integer",Pquote_is_integer,1}, |
|
{"quote_is_function",Pquote_is_function,1}, |
|
{"quote_is_dependent",Pquote_is_dependent,2}, |
|
|
|
{"quote_normalize",Pquote_normalize,1}, |
|
|
{"quote_to_nary",Pquote_to_nary,1}, |
{"quote_to_nary",Pquote_to_nary,1}, |
{"quote_to_bin",Pquote_to_bin,2}, |
{"quote_to_bin",Pquote_to_bin,2}, |
{"quotetotex_tb",Pquotetotex_tb,2}, |
{"quotetotex_tb",Pquotetotex_tb,2}, |
Line 115 struct ftab str_tab[] = { |
|
Line 131 struct ftab str_tab[] = { |
|
{"flatten_quote",Pflatten_quote,-2}, |
{"flatten_quote",Pflatten_quote,-2}, |
{"quote_to_funargs",Pquote_to_funargs,1}, |
{"quote_to_funargs",Pquote_to_funargs,1}, |
{"quote_unify",Pquote_unify,2}, |
{"quote_unify",Pquote_unify,2}, |
|
{"quote_match_rewrite",Pquote_match_rewrite,-4}, |
{"funargs_to_quote",Pfunargs_to_quote,1}, |
{"funargs_to_quote",Pfunargs_to_quote,1}, |
{"get_function_name",Pget_function_name,1}, |
{"get_function_name",Pget_function_name,1}, |
{0,0,0}, |
{0,0,0}, |
Line 512 void Pwrite_to_tb(NODE arg,Q *rp) |
|
Line 529 void Pwrite_to_tb(NODE arg,Q *rp) |
|
*rp = 0; |
*rp = 0; |
} |
} |
|
|
FNODE partial_eval(FNODE), quote_to_nary(FNODE), quote_to_bin(FNODE,int); |
FNODE partial_eval(FNODE), fnode_to_nary(FNODE), fnode_to_bin(FNODE,int); |
|
FNODE fnode_normalize(FNODE); |
|
|
void Pquote_to_nary(NODE arg,QUOTE *rp) |
void Pquote_to_nary(NODE arg,QUOTE *rp) |
{ |
{ |
FNODE f; |
FNODE f; |
|
|
f = quote_to_nary(BDY((QUOTE)ARG0(arg))); |
f = fnode_to_nary(BDY((QUOTE)ARG0(arg))); |
MKQUOTE(*rp,f); |
MKQUOTE(*rp,f); |
} |
} |
|
|
Line 528 void Pquote_to_bin(NODE arg,QUOTE *rp) |
|
Line 546 void Pquote_to_bin(NODE arg,QUOTE *rp) |
|
int direction; |
int direction; |
|
|
direction = QTOS((Q)ARG1(arg)); |
direction = QTOS((Q)ARG1(arg)); |
f = quote_to_bin(BDY((QUOTE)ARG0(arg)),direction); |
f = fnode_to_bin(BDY((QUOTE)ARG0(arg)),direction); |
|
|
MKQUOTE(*rp,f); |
MKQUOTE(*rp,f); |
} |
} |
|
|
|
void Pquote_is_number(NODE arg,Q *rp) |
|
{ |
|
QUOTE q; |
|
int ret; |
|
|
|
q = (QUOTE)ARG0(arg); |
|
asir_assert(q,O_QUOTE,"quote_is_number"); |
|
ret = fnode_is_number(BDY(q)); |
|
STOQ(ret,*rp); |
|
} |
|
|
|
void Pquote_is_rational(NODE arg,Q *rp) |
|
{ |
|
QUOTE q; |
|
int ret; |
|
|
|
q = (QUOTE)ARG0(arg); |
|
asir_assert(q,O_QUOTE,"quote_is_rational"); |
|
ret = fnode_is_rational(BDY(q)); |
|
STOQ(ret,*rp); |
|
} |
|
|
|
void Pquote_is_integer(NODE arg,Q *rp) |
|
{ |
|
QUOTE q; |
|
int ret; |
|
|
|
q = (QUOTE)ARG0(arg); |
|
asir_assert(q,O_QUOTE,"quote_is_integer"); |
|
ret = fnode_is_integer(BDY(q)); |
|
STOQ(ret,*rp); |
|
} |
|
|
|
void Pquote_is_function(NODE arg,Q *rp) |
|
{ |
|
QUOTE q; |
|
int ret; |
|
|
|
q = (QUOTE)ARG0(arg); |
|
asir_assert(q,O_QUOTE,"quote_is_function"); |
|
if ( q->id == I_FUNC || q->id == I_IFUNC ) |
|
ret = 1; |
|
else |
|
ret = 0; |
|
STOQ(ret,*rp); |
|
} |
|
|
|
void Pquote_is_dependent(NODE arg,Q *rp) |
|
{ |
|
P x; |
|
QUOTE q,v; |
|
int ret; |
|
V var; |
|
|
|
q = (QUOTE)ARG0(arg); |
|
v = (QUOTE)ARG1(arg); |
|
asir_assert(q,O_QUOTE,"quote_is_dependent"); |
|
asir_assert(v,O_QUOTE,"quote_is_dependent"); |
|
x = (P)eval(BDY(v)); |
|
if ( !x || OID(x) != O_P ) |
|
*rp = 0; |
|
var = VR(x); |
|
ret = fnode_is_dependent(BDY(q),var); |
|
STOQ(ret,*rp); |
|
} |
|
|
|
|
void Pquote_unify(NODE arg,Q *rp) |
void Pquote_unify(NODE arg,Q *rp) |
{ |
{ |
FNODE f,g; |
FNODE f,g; |
Line 547 void Pquote_unify(NODE arg,Q *rp) |
|
Line 632 void Pquote_unify(NODE arg,Q *rp) |
|
ret = quote_unify((Obj)q,(Obj)ARG1(arg),&r); |
ret = quote_unify((Obj)q,(Obj)ARG1(arg),&r); |
#else |
#else |
obj = (Obj)ARG0(arg); |
obj = (Obj)ARG0(arg); |
if ( !obj || OID(obj) != O_QUOTE) { |
|
objtoquote(obj,&q); obj = (Obj)q; |
|
} |
|
ret = quote_unify(obj,(Obj)ARG1(arg),&r); |
ret = quote_unify(obj,(Obj)ARG1(arg),&r); |
#endif |
#endif |
if ( ret ) { |
if ( ret ) { |
Line 559 void Pquote_unify(NODE arg,Q *rp) |
|
Line 641 void Pquote_unify(NODE arg,Q *rp) |
|
*rp = 0; |
*rp = 0; |
} |
} |
|
|
|
FNODE rewrite_fnode(FNODE,NODE); |
|
|
|
extern Obj VOIDobj; |
|
|
|
void Pquote_match_rewrite(NODE arg,Obj *rp) |
|
{ |
|
FNODE f,g,h,c,value; |
|
Obj obj; |
|
QUOTE q; |
|
NODE r,t,s,s0,pair; |
|
int ret,ind,ac; |
|
|
|
obj = (Obj)ARG0(arg); |
|
ret = quote_unify(obj,(Obj)ARG1(arg),&r); |
|
if ( ret ) { |
|
for ( t = r, s0 = 0; t; t = NEXT(t) ) { |
|
NEXTNODE(s0,s); |
|
pair = BDY((LIST)BDY(t)); |
|
ind = (int)FA0((FNODE)BDY((QUOTE)BDY(pair))); |
|
value = mkfnode(1,I_FORMULA,BDY(NEXT(pair))); |
|
BDY(s) = mknode(2,ind,value); |
|
} |
|
if ( s0 ) NEXT(s) = 0; |
|
switch ( ac = argc(arg) ) { |
|
case 3: |
|
h = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0); |
|
*rp = eval(h); |
|
break; |
|
case 4: |
|
c = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0); |
|
if ( eval(c) ) { |
|
h = rewrite_fnode(BDY((QUOTE)ARG3(arg)),s0); |
|
*rp = eval(h); |
|
} else |
|
*rp = VOIDobj; |
|
break; |
|
default: |
|
error("quote_match_rewrite : invalid argument"); |
|
} |
|
} else |
|
*rp = VOIDobj; |
|
} |
|
|
void do_assign(NODE arg) |
void do_assign(NODE arg) |
{ |
{ |
NODE t,pair; |
NODE t,pair; |
Line 683 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
Line 808 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
QUOTE q; |
QUOTE q; |
FNODE g; |
FNODE g; |
|
|
if ( OID(pat) == O_LIST ) { |
if ( !f ) |
|
if ( !pat ) { |
|
*rp = 0; return 1; |
|
} else |
|
return 0; |
|
else if ( OID(pat) == O_LIST ) { |
if ( OID(f) == O_LIST ) |
if ( OID(f) == O_LIST ) |
return quote_unify_node(BDY((LIST)f),BDY((LIST)pat),rp); |
return quote_unify_node(BDY((LIST)f),BDY((LIST)pat),rp); |
else |
else |
return 0; |
return 0; |
} else if ( OID(pat) == O_QUOTE ) { |
} else if ( OID(pat) == O_QUOTE ) { |
if ( OID(f) != O_QUOTE ) return 0; |
pid = ((FNODE)BDY((QUOTE)pat))->id; |
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
|
get_quote_id_arg((QUOTE)f,&id,&farg); |
|
switch ( pid ) { |
switch ( pid ) { |
case I_FORMULA: |
case I_FORMULA: |
if ( compquote(CO,f,pat) ) |
if ( compquote(CO,f,pat) ) |
return 0; |
return 0; |
else { |
else { |
*rp = 0; |
*rp = 0; return 1; |
return 1; |
|
} |
} |
break; |
break; |
case I_LIST: |
|
return quote_unify_node(BDY((LIST)BDY(farg)), |
case I_LIST: case I_CONS: |
BDY((LIST)BDY(parg)),rp); |
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
case I_CONS: |
if ( OID(f) == O_LIST ) |
tf = BDY((LIST)BDY(farg)); |
tf = BDY((LIST)f); |
|
else if ( OID(f) == O_QUOTE |
|
&& ((FNODE)BDY((QUOTE)f))->id == pid ) { |
|
get_quote_id_arg((QUOTE)f,&id,&farg); |
|
tf = BDY((LIST)BDY(farg)); |
|
} else |
|
return 0; |
|
|
tp = BDY((LIST)BDY(parg)); |
tp = BDY((LIST)BDY(parg)); |
rpat = (Obj)BDY(NEXT(parg)); |
if ( pid == I_LIST ) |
return quote_unify_cons(tf,tp,rpat,rp); |
return quote_unify_node(tf,tp,rp); |
|
else { |
|
rpat = (Obj)BDY(NEXT(parg)); |
|
return quote_unify_cons(tf,tp,rpat,rp); |
|
} |
|
|
case I_PVAR: |
case I_PVAR: |
/* [[pat,f]] */ |
/* [[pat,f]] */ |
r = mknode(2,pat,f); MKLIST(l,r); |
r = mknode(2,pat,f); MKLIST(l,r); |
*rp = mknode(1,l); |
*rp = mknode(1,l); |
return 1; |
return 1; |
|
|
case I_IFUNC: |
case I_IFUNC: |
/* F(X,Y,...) = ... */ |
/* F(X,Y,...) = ... */ |
|
get_quote_id_arg((QUOTE)f,&id,&farg); |
|
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
if ( id == I_FUNC ) { |
if ( id == I_FUNC ) { |
r = mknode(2,BDY(parg),BDY(farg)); MKLIST(l,r); |
r = mknode(2,BDY(parg),BDY(farg)); MKLIST(l,r); |
head = mknode(1,l); |
head = mknode(1,l); |
Line 726 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
Line 868 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
} else |
} else |
return 0; |
return 0; |
|
|
case I_NARYOP: |
case I_NARYOP: case I_BOP: case I_FUNC: |
case I_BOP: |
|
/* X+Y = ... */ |
/* X+Y = ... */ |
if ( compqa(CO,BDY(farg),BDY(parg)) ) return 0; |
|
|
|
/* XXX converting to I_BOP */ |
|
if ( ((FNODE)BDY((QUOTE)pat))->id == I_NARYOP ) { |
|
g = quote_to_bin(BDY((QUOTE)pat),1); |
|
MKQUOTE(q,g); |
|
get_quote_id_arg((QUOTE)q,&pid,&parg); |
|
} |
|
if ( ((FNODE)BDY((QUOTE)f))->id == I_NARYOP ) { |
|
g = quote_to_bin(BDY((QUOTE)f),1); |
|
MKQUOTE(q,g); |
|
get_quote_id_arg((QUOTE)q,&id,&farg); |
|
} |
|
return quote_unify_node(NEXT(farg),NEXT(parg),rp); |
|
break; |
|
|
|
case I_FUNC: |
|
/* f(...) = ... */ |
/* f(...) = ... */ |
|
if ( OID(f) != O_QUOTE ) return 0; |
|
id = ((FNODE)BDY((QUOTE)f))->id; |
|
if ( pid == I_FUNC ) |
|
; |
|
else { |
|
/* XXX converting to I_BOP */ |
|
if ( pid == I_NARYOP ) { |
|
g = fnode_to_bin(BDY((QUOTE)pat),1); |
|
MKQUOTE(q,g); pat = (Obj)q; |
|
} |
|
if ( id == I_NARYOP ) { |
|
g = fnode_to_bin(BDY((QUOTE)f),1); |
|
MKQUOTE(q,g); f = (Obj)q; |
|
} |
|
} |
|
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
|
get_quote_id_arg((QUOTE)f,&id,&farg); |
if ( compqa(CO,BDY(farg),BDY(parg)) ) return 0; |
if ( compqa(CO,BDY(farg),BDY(parg)) ) return 0; |
return quote_unify_node(NEXT(farg),NEXT(parg),rp); |
return quote_unify_node(NEXT(farg),NEXT(parg),rp); |
break; |
|
default: |
default: |
if ( pid == id ) |
if ( OID(f) != O_QUOTE ) return 0; |
return quote_unify_node(farg,parg,rp); |
id = ((FNODE)BDY((QUOTE)f))->id; |
else |
if ( id != pid ) return 0; |
return 0; |
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
|
get_quote_id_arg((QUOTE)f,&id,&farg); |
|
return quote_unify_node(farg,parg,rp); |
} |
} |
} |
} |
} |
} |
Line 1157 void fnodetotex_tb(FNODE f,TB tb) |
|
Line 1300 void fnodetotex_tb(FNODE f,TB tb) |
|
/* otherwise => FA1(f), FA2(f) */ |
/* otherwise => FA1(f), FA2(f) */ |
case I_BOP: |
case I_BOP: |
opname = ((ARF)FA0(f))->name; |
opname = ((ARF)FA0(f))->name; |
if ( !strcmp(opname,"+") ) { |
switch ( opname[0] ) { |
fnodetotex_tb((FNODE)FA1(f),tb); |
case '+': |
if ( !top_is_minus((FNODE)FA2(f)) ) write_tb(opname,tb); |
fnodetotex_tb((FNODE)FA1(f),tb); |
fnodetotex_tb((FNODE)FA2(f),tb); |
if ( !top_is_minus((FNODE)FA2(f)) ) write_tb(opname,tb); |
} else if ( !strcmp(opname,"-") ) { |
fnodetotex_tb((FNODE)FA2(f),tb); |
if ( FA1(f) ) fnodetotex_tb((FNODE)FA1(f),tb); |
break; |
write_tb(opname,tb); |
case '-': |
fnodetotex_tb((FNODE)FA2(f),tb); |
if ( FA1(f) ) fnodetotex_tb((FNODE)FA1(f),tb); |
} else if ( !strcmp(opname,"*") ) { |
write_tb(opname,tb); |
fnodetotex_tb((FNODE)FA1(f),tb); |
fnodetotex_tb((FNODE)FA2(f),tb); |
write_tb(" ",tb); |
break; |
/* XXX special care for DP */ |
case '*': |
f2 = (FNODE)FA2(f); |
fnodetotex_tb((FNODE)FA1(f),tb); |
if ( f2->id == I_EV ) { |
write_tb(" ",tb); |
n = (NODE)FA0(f2); |
/* XXX special care for DP */ |
for ( i = 0; n; n = NEXT(n), i++ ) { |
f2 = (FNODE)FA2(f); |
fi = (FNODE)BDY(n); |
if ( f2->id == I_EV ) { |
if ( fi->id != I_FORMULA || FA0(fi) ) |
n = (NODE)FA0(f2); |
break; |
for ( i = 0; n; n = NEXT(n), i++ ) { |
} |
fi = (FNODE)BDY(n); |
if ( n ) |
if ( fi->id != I_FORMULA || FA0(fi) ) |
|
break; |
|
} |
|
if ( n ) |
|
fnodetotex_tb((FNODE)FA2(f),tb); |
|
} else |
fnodetotex_tb((FNODE)FA2(f),tb); |
fnodetotex_tb((FNODE)FA2(f),tb); |
} else |
break; |
|
case '/': |
|
write_tb("\\frac{",tb); |
|
fnodetotex_tb((FNODE)FA1(f),tb); |
|
write_tb("} {",tb); |
fnodetotex_tb((FNODE)FA2(f),tb); |
fnodetotex_tb((FNODE)FA2(f),tb); |
} else if ( !strcmp(opname,"/") ) { |
write_tb("}",tb); |
write_tb("\\frac{",tb); |
break; |
fnodetotex_tb((FNODE)FA1(f),tb); |
case '^': |
write_tb("} {",tb); |
fnodetotex_tb((FNODE)FA1(f),tb); |
fnodetotex_tb((FNODE)FA2(f),tb); |
write_tb("^{",tb); |
write_tb("}",tb); |
fnodetotex_tb(strip_paren((FNODE)FA2(f)),tb); |
} else if ( !strcmp(opname,"^") ) { |
write_tb("} ",tb); |
fnodetotex_tb((FNODE)FA1(f),tb); |
break; |
write_tb("^{",tb); |
case '%': |
fnodetotex_tb(strip_paren((FNODE)FA2(f)),tb); |
fnodetotex_tb((FNODE)FA1(f),tb); |
write_tb("} ",tb); |
write_tb(" {\\rm mod}\\, ",tb); |
} else if ( !strcmp(opname,"%") ) { |
fnodetotex_tb((FNODE)FA2(f),tb); |
fnodetotex_tb((FNODE)FA1(f),tb); |
break; |
write_tb(" {\\rm mod}\\, ",tb); |
default: |
fnodetotex_tb((FNODE)FA2(f),tb); |
error("invalid binary operator"); |
} else |
break; |
error("invalid binary operator"); |
} |
break; |
break; |
|
|
case I_COP: |
case I_COP: |
Line 1767 void Pfunargs_to_quote(NODE arg,QUOTE *rp) |
|
Line 1919 void Pfunargs_to_quote(NODE arg,QUOTE *rp) |
|
} |
} |
} |
} |
MKQUOTE(*rp,f); |
MKQUOTE(*rp,f); |
|
} |
|
|
|
FNODE fnode_apply(FNODE f,FNODE (*func)()); |
|
FNODE fnode_normalize(FNODE f); |
|
FNODE fnode_normalize_nary(FNODE f); |
|
|
|
void Pquote_normalize(NODE arg,QUOTE *rp) |
|
{ |
|
QUOTE q,r; |
|
FNODE f; |
|
|
|
q = (QUOTE)ARG0(arg); |
|
if ( !q || OID(q) != O_QUOTE ) { |
|
*rp = q; |
|
return; |
|
} else { |
|
#if 0 |
|
f = flatten_fnode(BDY(q),"+"); |
|
f = flatten_fnode(f,"*"); |
|
#endif |
|
f = fnode_normalize(BDY(q)); |
|
f = fnode_to_nary(f); |
|
f = fnode_normalize_nary(f); |
|
MKQUOTE(r,f); |
|
*rp = r; |
|
} |
|
} |
|
|
|
int fnode_is_number(FNODE f) |
|
{ |
|
Obj obj; |
|
|
|
switch ( f->id ) { |
|
case I_MINUS: case I_PAREN: |
|
return fnode_is_number(FA0(f)); |
|
|
|
case I_FORMULA: |
|
obj = FA0(f); |
|
if ( !obj ) return 1; |
|
else if ( OID(obj) == O_QUOTE ) |
|
return fnode_is_number(BDY((QUOTE)obj)); |
|
else if ( NUM(obj) ) return 1; |
|
else return 0; |
|
|
|
case I_BOP: |
|
return fnode_is_number(FA1(f)) && fnode_is_number(FA2(f)); |
|
|
|
default: |
|
return 0; |
|
} |
|
} |
|
|
|
int fnode_is_rational(FNODE f) |
|
{ |
|
Obj obj; |
|
|
|
switch ( f->id ) { |
|
case I_MINUS: case I_PAREN: |
|
return fnode_is_number(FA0(f)); |
|
|
|
case I_FORMULA: |
|
obj = FA0(f); |
|
if ( !obj ) return 1; |
|
else if ( OID(obj) == O_QUOTE ) |
|
return fnode_is_rational(BDY((QUOTE)obj)); |
|
else if ( NUM(obj) && RATN(obj) ) return 1; |
|
else return 0; |
|
|
|
case I_BOP: |
|
if ( !strcmp(((ARF)FA0(f))->name,"^") ) |
|
return fnode_is_rational(FA1(f)) && fnode_is_integer(FA2(f)); |
|
else |
|
return fnode_is_rational(FA1(f)) && fnode_is_rational(FA2(f)); |
|
|
|
default: |
|
return 0; |
|
} |
|
} |
|
|
|
int fnode_is_integer(FNODE f) |
|
{ |
|
Obj obj; |
|
|
|
switch ( f->id ) { |
|
case I_MINUS: case I_PAREN: |
|
return fnode_is_integer(FA0(f)); |
|
|
|
case I_FORMULA: |
|
obj = FA0(f); |
|
if ( !obj ) return 1; |
|
else if ( OID(obj) == O_QUOTE ) |
|
return fnode_is_integer(BDY((QUOTE)obj)); |
|
else if ( INT(obj)) return 1; |
|
else return 0; |
|
|
|
case I_BOP: |
|
switch ( ((ARF)FA0(f))->name[0] ) { |
|
case '^': |
|
return fnode_is_integer(FA1(f)) |
|
&& fnode_is_nonnegative_integer(FA2(f)); |
|
case '/': |
|
return fnode_is_integer(FA1(f)) && |
|
( fnode_is_one(FA2(f)) || fnode_is_minusone(FA2(f)) ); |
|
default: |
|
return fnode_is_integer(FA1(f)) && fnode_is_integer(FA2(f)); |
|
} |
|
break; |
|
|
|
default: |
|
return 0; |
|
} |
|
} |
|
|
|
int fnode_is_zero(FNODE f) |
|
{ |
|
Q n; |
|
|
|
n = eval(f); |
|
if ( !n ) return 1; |
|
else return 0; |
|
} |
|
|
|
int fnode_is_nonnegative_integer(FNODE f) |
|
{ |
|
Q n; |
|
|
|
n = eval(f); |
|
if ( !n || (INT(n) && SGN(n) > 0) ) return 1; |
|
else return 0; |
|
} |
|
|
|
int fnode_is_one(FNODE f) |
|
{ |
|
Q n; |
|
|
|
n = eval(f); |
|
if ( UNIQ(n) ) return 1; |
|
else return 0; |
|
} |
|
|
|
int fnode_is_minusone(FNODE f) |
|
{ |
|
Q n; |
|
|
|
n = eval(f); |
|
if ( MUNIQ(n) ) return 1; |
|
else return 0; |
|
} |
|
|
|
int fnode_is_dependent(FNODE f,V v) |
|
{ |
|
Obj obj; |
|
FNODE arg; |
|
NODE t; |
|
|
|
switch ( f->id ) { |
|
case I_MINUS: case I_PAREN: |
|
return fnode_is_dependent(FA0(f),v); |
|
|
|
case I_FORMULA: |
|
obj = FA0(f); |
|
if ( !obj ) return 0; |
|
else if ( OID(obj) == O_QUOTE ) |
|
return fnode_is_dependent(BDY((QUOTE)obj),v); |
|
else if ( obj_is_dependent(obj,v) ) return 1; |
|
else return 0; |
|
|
|
case I_BOP: |
|
return fnode_is_dependent(FA1(f),v) || fnode_is_dependent(FA2(f),v); |
|
|
|
case I_FUNC: |
|
arg = (FNODE)FA1(f); |
|
for ( t = FA0(arg); t; t = NEXT(t) ) |
|
if ( fnode_is_dependent(BDY(t),v) ) return 1; |
|
return 0; |
|
|
|
default: |
|
return 0; |
|
} |
|
} |
|
|
|
FNODE fnode_normalize(FNODE f) |
|
{ |
|
FNODE a2,mone; |
|
Q q; |
|
NODE n; |
|
|
|
switch ( f->id ) { |
|
case I_PAREN: |
|
return fnode_normalize(FA0(f)); |
|
|
|
case I_MINUS: |
|
f = fnode_normalize(FA0(f)); |
|
return f->id==I_MINUS ? FA0(f) : mkfnode(1,I_MINUS,f); |
|
|
|
case I_BOP: |
|
/* arf fnode fnode */ |
|
f = fnode_apply(f,fnode_normalize); |
|
switch ( ((ARF)FA0(f))->name[0] ) { |
|
case '-': |
|
a2 = mkfnode(1,I_MINUS,FA2(f)); |
|
return mkfnode(3,I_BOP,addfs,FA1(f),a2); |
|
case '/': |
|
STOQ(-1,q); |
|
mone = mkfnode(1,I_FORMULA,q); |
|
a2 = mkfnode(3,I_BOP,pwrfs,FA2(f),mone); |
|
return mkfnode(3,I_BOP,mulfs,FA1(f),a2); |
|
default: |
|
return f; |
|
} |
|
break; |
|
|
|
default: |
|
return fnode_apply(f,fnode_normalize); |
|
} |
|
} |
|
|
|
FNODE fnode_simplify_add(FNODE f); |
|
FNODE fnode_simplify_mul(FNODE f); |
|
|
|
FNODE fnode_normalize_nary(FNODE f) |
|
{ |
|
NODE n; |
|
|
|
switch ( f->id ) { |
|
case I_PAREN: |
|
return fnode_normalize_nary(FA0(f)); |
|
|
|
case I_MINUS: |
|
f = fnode_normalize_nary(FA0(f)); |
|
return f->id==I_MINUS ? FA0(f) : mkfnode(1,I_MINUS,f); |
|
|
|
case I_NARYOP: |
|
f = fnode_apply(f,fnode_normalize_nary); |
|
switch ( ((ARF)FA0(f))->name[0] ) { |
|
/* XXX */ |
|
case '+': |
|
return fnode_simplify_add(f); |
|
case '*': |
|
return fnode_simplify_mul(f); |
|
default: |
|
return f; |
|
} |
|
break; |
|
|
|
default: |
|
return fnode_apply(f,fnode_normalize_nary); |
|
break; |
|
} |
|
} |
|
|
|
FNODE fnode_apply(FNODE f,FNODE (*func)()) |
|
{ |
|
fid_spec_p spec; |
|
FNODE r; |
|
int i,n; |
|
NODE t,t0,s; |
|
|
|
get_fid_spec(f->id,&spec); |
|
for ( n = 0; spec->type[n] != A_end; n++ ); |
|
NEWFNODE(r,n); r->id = f->id; |
|
for ( i = 0; i < n; i++ ) { |
|
switch ( spec->type[i] ) { |
|
case A_fnode: |
|
r->arg[i] = func(f->arg[i]); |
|
break; |
|
case A_node: |
|
s = (NODE)f->arg[i]; |
|
for ( t0 = 0; s; s = NEXT(s) ) { |
|
NEXTNODE(t0,t); |
|
BDY(t) = (pointer)func((FNODE)BDY(s)); |
|
} |
|
if ( t0 ) NEXT(t) = 0; |
|
r->arg[i] = t0; |
|
break; |
|
default: |
|
r->arg[i] = f->arg[i]; |
|
break; |
|
} |
|
} |
|
return r; |
|
} |
|
|
|
NODE2 fnode_add_monomial(NODE2 s0,FNODE g); |
|
|
|
FNODE fnode_simplify_add(FNODE f) |
|
{ |
|
NODE n; |
|
NODE r0,r,t,u; |
|
NODE2 s,s0; |
|
FNODE g,m; |
|
QUOTE q; |
|
|
|
n = (NODE)FA1(f); |
|
s0 = 0; |
|
for ( t = n; t; t = NEXT(t) ) { |
|
g = (FNODE)BDY(t); |
|
s0 = fnode_add_monomial(s0,g); |
|
} |
|
if ( !s0 ) |
|
return mkfnode(1,I_FORMULA,0); |
|
else { |
|
for ( s = s0, r0 = 0; s; s = NEXT(s) ) { |
|
NEXTNODE(r0,r); |
|
if ( UNIQ(s->body1) ) |
|
BDY(r) = s->body2; |
|
else if ( MUNIQ(s->body1) ) |
|
BDY(r) = mkfnode(1,I_MINUS,s->body2); |
|
else { |
|
objtoquote(s->body1,&q); |
|
m = (FNODE)s->body2; |
|
if ( m->id == I_NARYOP && OPNAME(m) == '*' ) { |
|
MKNODE(u,BDY(q),FA1(m)); FA1(m) = u; |
|
BDY(r) = m; |
|
} else { |
|
u = mknode(2,BDY(q),m); |
|
BDY(r) = mkfnode(2,I_NARYOP,mulfs,u); |
|
} |
|
} |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
if ( length(r0) == 1 ) |
|
return (FNODE)BDY(r0); |
|
else |
|
return mkfnode(2,I_NARYOP,FA0(f),r0); |
|
} |
|
} |
|
|
|
NODE2 fnode_add_monomial(NODE2 r,FNODE g) |
|
{ |
|
Num c,c1; |
|
FNODE b; |
|
NODE arg; |
|
NODE2 prev,cur,t; |
|
int a; |
|
|
|
if ( fnode_is_number(g) ) { |
|
c = (Num)eval(g); |
|
b = mkfnode(1,I_FORMULA,ONE); |
|
} else if ( g->id == I_NARYOP && OPNAME(g) == '*' ) { |
|
arg = (NODE)FA1(g); |
|
if ( fnode_is_number(BDY(arg)) ) { |
|
c = (Num)eval(BDY(arg)); |
|
if ( length(arg) > 2 ) |
|
b = mkfnode(2,I_NARYOP,FA0(g),NEXT(arg)); |
|
else |
|
b = BDY(NEXT(arg)); |
|
} else { |
|
c = (Num)ONE; |
|
b = g; |
|
} |
|
} else { |
|
c = (Num)ONE; |
|
b = g; |
|
} |
|
|
|
for ( prev = 0, cur = r; cur; prev = cur, cur = NEXT(cur) ) { |
|
a = compfnode(b,cur->body2); |
|
if ( a > 0 ) { |
|
MKNODE2(t,c,b,cur); |
|
if ( !prev ) |
|
return t; |
|
else { |
|
NEXT(prev) = t; return r; |
|
} |
|
} else if ( a == 0 ) { |
|
addnum(0,cur->body1,c,&c1); |
|
if ( !c1 ) { |
|
if ( !prev ) |
|
return NEXT(cur); |
|
else { |
|
NEXT(prev) = NEXT(cur); return r; |
|
} |
|
} else { |
|
cur->body1 = c1; return r; |
|
} |
|
} |
|
} |
|
MKNODE2(t,c,b,0); |
|
if ( !r ) |
|
return t; |
|
else { |
|
NEXT(prev) = t; return r; |
|
} |
|
} |
|
|
|
FNODE fnode_simplify_mul(FNODE f) |
|
{ |
|
int l,i,j; |
|
FNODE *b; |
|
Obj *e; |
|
NODE n,t,r,r1; |
|
FNODE g,base; |
|
QUOTE q; |
|
Obj exp,exp1; |
|
Num c,c1; |
|
|
|
n = (NODE)FA1(f); |
|
for ( l = 0, t = n; t; t = NEXT(t), l++ ); |
|
b = (FNODE *)MALLOC(l*sizeof(FNODE)); |
|
e = (Obj *)MALLOC(l*sizeof(Obj)); |
|
c = (Num)ONE; |
|
for ( i = 0, t = n; t; t = NEXT(t) ) { |
|
g = (FNODE)BDY(t); |
|
if ( fnode_is_number(g) ) { |
|
if ( fnode_is_zero(g) ) |
|
return mkfnode(1,I_FORMULA,0); |
|
else { |
|
mulnum(0,c,(Num)eval(g),&c1); c = c1; |
|
} |
|
} else { |
|
if ( g->id == I_MINUS ) { |
|
chsgnnum(c,&c1); c = c1; |
|
g = FA0(g); |
|
} |
|
if ( g->id == I_BOP && ((ARF)FA0(g))->name[0] == '^' ) { |
|
base = FA1(g); |
|
exp = (Obj)eval(FA2(g)); |
|
} else { |
|
base = g; exp = (Obj)ONE; |
|
} |
|
if ( i > 0 && !compfnode(b[i-1],base) ) { |
|
arf_add(CO,e[i-1],exp,&exp1); |
|
if ( !exp1 ) |
|
i--; |
|
else |
|
e[i-1] = exp1; |
|
} else { |
|
b[i] = base; |
|
e[i] = exp; |
|
i++; |
|
} |
|
} |
|
} |
|
if ( !i ) { |
|
/* coeff only */ |
|
g = mkfnode(1,I_FORMULA,c); |
|
return g; |
|
} else { |
|
r = 0; |
|
for ( j = i-1; j >= 0; j-- ) { |
|
if ( UNIQ(e[j]) ) |
|
g = b[j]; |
|
else { |
|
objtoquote(e[j],&q); |
|
g = mkfnode(3,I_BOP,pwrfs,b[j],BDY(q)); |
|
} |
|
MKNODE(r1,g,r); r = r1; |
|
} |
|
g = mkfnode(1,I_FORMULA,c); |
|
MKNODE(r1,g,r); r = r1; |
|
return mkfnode(2,I_NARYOP,FA0(f),r); |
|
} |
} |
} |