| version 1.71, 2005/10/12 14:43:36 |
version 1.124, 2015/08/14 13:51:54 |
|
|
| * 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.70 2005/10/12 03:31:04 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.123 2015/08/06 10:01:52 fujimoto Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "parse.h" |
#include "parse.h" |
| Line 58 extern jmp_buf environnement; |
|
| Line 58 extern jmp_buf environnement; |
|
| #endif |
#endif |
| #include <string.h> |
#include <string.h> |
| |
|
| |
#if defined(__GNUC__) |
| |
#define INLINE inline |
| |
#elif defined(VISUAL) || defined(__MINGW32__) |
| |
#define INLINE __inline |
| |
#else |
| |
#define INLINE |
| |
#endif |
| |
|
| struct TeXSymbol { |
struct TeXSymbol { |
| char *text; |
char *text; |
| char *symbol; |
char *symbol; |
| }; |
}; |
| |
|
| #define OPNAME(f) (((ARF)FA0(f))->name[0]) |
#define OPNAME(f) (((ARF)FA0(f))->name[0]) |
| |
#define IS_ZERO(f) (((f)->id==I_FORMULA) && FA0(f)==0 ) |
| |
#define IS_BINARYPWR(f) (((f)->id==I_BOP) &&(OPNAME(f)=='^')) |
| |
#define IS_NARYADD(f) (((f)->id==I_NARYOP) &&(OPNAME(f)=='+')) |
| |
#define IS_NARYMUL(f) (((f)->id==I_NARYOP) &&(OPNAME(f)=='*')) |
| |
#define IS_MUL(f) (((f)->id==I_NARYOP||(f)->id==I_BOP) &&(OPNAME(f)=='*')) |
| |
|
| extern char *parse_strp; |
extern char *parse_strp; |
| |
|
| Line 80 void Pquotetotex(); |
|
| Line 93 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 Pqt_is_integer(),Pqt_is_rational(),Pqt_is_number(),Pqt_is_coef(); |
| void Pquote_is_dependent(),Pquote_is_function(); |
void Pqt_is_dependent(),Pqt_is_function(),Pqt_is_var(); |
| void Pquote_normalize(); |
void Pqt_set_ord(),Pqt_set_coef(),Pqt_set_weight(); |
| |
void Pqt_normalize(); |
| |
void Pnqt_comp(),Pnqt_weight(); |
| |
void Pnqt_match(); |
| |
void Pnqt_match_rewrite(); |
| |
|
| |
void Pqt_to_nbp(); |
| |
void Pshuffle_mul(), Pharmonic_mul(); |
| |
void Pnbp_hm(), Pnbp_ht(), Pnbp_hc(), Pnbp_rest(); |
| |
void Pnbp_tm(), Pnbp_tt(), Pnbp_tc(), Pnbp_trest(); |
| |
void Pnbm_deg(), Pnbm_index(); |
| |
void Pnbm_hp_rest(); |
| |
void Pnbm_hxky(), Pnbm_xky_rest(); |
| |
void Pnbm_hv(), Pnbm_tv(), Pnbm_rest(),Pnbm_trest(); |
| |
|
| 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(),Pquote_match_rewrite(); |
void Pqt_match(),Pget_quote_id(); |
| void Pquote_to_nary(),Pquote_to_bin(); |
void Pqt_to_nary(),Pqt_to_bin(); |
| |
void fnode_do_assign(NODE arg); |
| void do_assign(NODE arg); |
void do_assign(NODE arg); |
| void fnodetotex_tb(FNODE f,TB tb); |
void fnodetotex_tb(FNODE f,TB tb); |
| char *symbol_name(char *name); |
char *symbol_name(char *name); |
| Line 97 void tb_to_string(TB tb,STRING *rp); |
|
| Line 124 void tb_to_string(TB tb,STRING *rp); |
|
| void fnodenodetotex_tb(NODE n,TB tb); |
void fnodenodetotex_tb(NODE n,TB tb); |
| void fargstotex_tb(char *opname,FNODE f,TB tb); |
void fargstotex_tb(char *opname,FNODE f,TB tb); |
| int top_is_minus(FNODE f); |
int top_is_minus(FNODE f); |
| int quote_unify(Obj f,Obj pat,NODE *rp); |
int qt_match(Obj f,Obj pat,NODE *rp); |
| |
FNODE partial_eval(FNODE), fnode_to_nary(FNODE), fnode_to_bin(FNODE,int); |
| |
FNODE nfnode_add(FNODE a1,FNODE a2,int expand); |
| |
FNODE nfnode_mul(FNODE a1,FNODE a2,int expand); |
| |
FNODE nfnode_pwr(FNODE a1,FNODE a2,int expand); |
| |
FNODE nfnode_mul_coef(Obj c,FNODE f,int expand); |
| |
FNODE fnode_expand_pwr(FNODE f,int n,int expand); |
| |
FNODE to_narymul(FNODE f); |
| |
FNODE to_naryadd(FNODE f); |
| |
FNODE fnode_node_to_nary(ARF op,NODE n); |
| |
void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep); |
| |
void fnode_coef_body(FNODE f,Obj *cp,FNODE *bp); |
| |
FNODE nfnode_match_rewrite(FNODE f,FNODE p,FNODE c,FNODE a,int mode); |
| |
FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand); |
| |
FNODE fnode_normalize(FNODE f,int expand); |
| |
FNODE rewrite_fnode(FNODE f,NODE arg,int qarg); |
| |
|
| struct ftab str_tab[] = { |
struct ftab str_tab[] = { |
| {"sprintf",Psprintf,-99999999}, |
{"sprintf",Psprintf,-99999999}, |
| Line 115 struct ftab str_tab[] = { |
|
| Line 157 struct ftab str_tab[] = { |
|
| {"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}, |
{"qt_is_var",Pqt_is_var,1}, |
| {"quote_is_rational",Pquote_is_rational,1}, |
{"qt_is_coef",Pqt_is_coef,1}, |
| {"quote_is_integer",Pquote_is_integer,1}, |
{"qt_is_number",Pqt_is_number,1}, |
| {"quote_is_function",Pquote_is_function,1}, |
{"qt_is_rational",Pqt_is_rational,1}, |
| {"quote_is_dependent",Pquote_is_dependent,2}, |
{"qt_is_integer",Pqt_is_integer,1}, |
| |
{"qt_is_function",Pqt_is_function,1}, |
| |
{"qt_is_dependent",Pqt_is_dependent,2}, |
| |
|
| {"quote_normalize",Pquote_normalize,1}, |
{"qt_set_coef",Pqt_set_coef,-1}, |
| |
{"qt_set_ord",Pqt_set_ord,-1}, |
| |
{"qt_set_weight",Pqt_set_weight,-1}, |
| |
{"qt_normalize",Pqt_normalize,-2}, |
| |
{"qt_match",Pqt_match,2}, |
| |
{"nqt_match_rewrite",Pnqt_match_rewrite,3}, |
| |
|
| {"quote_to_nary",Pquote_to_nary,1}, |
{"nqt_weight",Pnqt_weight,1}, |
| {"quote_to_bin",Pquote_to_bin,2}, |
{"nqt_comp",Pnqt_comp,2}, |
| |
{"nqt_match",Pnqt_match,-3}, |
| |
{"qt_to_nbp",Pqt_to_nbp,1}, |
| |
{"shuffle_mul",Pshuffle_mul,2}, |
| |
{"harmonic_mul",Pharmonic_mul,2}, |
| |
|
| |
{"nbp_hm", Pnbp_hm,1}, |
| |
{"nbp_ht", Pnbp_ht,1}, |
| |
{"nbp_hc", Pnbp_hc,1}, |
| |
{"nbp_rest", Pnbp_rest,1}, |
| |
{"nbp_tm", Pnbp_tm,1}, |
| |
{"nbp_tt", Pnbp_tt,1}, |
| |
{"nbp_tc", Pnbp_tc,1}, |
| |
{"nbp_trest", Pnbp_trest,1}, |
| |
{"nbm_deg", Pnbm_deg,1}, |
| |
{"nbm_index", Pnbm_index,1}, |
| |
{"nbm_hxky", Pnbm_hxky,1}, |
| |
{"nbm_xky_rest", Pnbm_xky_rest,1}, |
| |
{"nbm_hp_rest", Pnbm_hp_rest,1}, |
| |
{"nbm_hv", Pnbm_hv,1}, |
| |
{"nbm_tv", Pnbm_tv,1}, |
| |
{"nbm_rest", Pnbm_rest,1}, |
| |
{"nbm_trest", Pnbm_trest,1}, |
| |
|
| |
{"qt_to_nary",Pqt_to_nary,1}, |
| |
{"qt_to_bin",Pqt_to_bin,2}, |
| |
|
| {"quotetotex_tb",Pquotetotex_tb,2}, |
{"quotetotex_tb",Pquotetotex_tb,2}, |
| {"quotetotex",Pquotetotex,1}, |
{"quotetotex",Pquotetotex,1}, |
| {"quotetotex_env",Pquotetotex_env,-99999999}, |
{"quotetotex_env",Pquotetotex_env,-99999999}, |
| {"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_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 397 int register_conv_func(Obj arg) |
|
| Line 470 int register_conv_func(Obj arg) |
|
| if ( !arg ) { |
if ( !arg ) { |
| convfunc = 0; |
convfunc = 0; |
| return 1; |
return 1; |
| } else if ( OID(arg) == O_P && (int)(VR((P)arg))->attr == V_SR ) { |
} else if ( OID(arg) == O_P && (long)(VR((P)arg))->attr == V_SR ) { |
| convfunc = (FUNC)(VR((P)arg)->priv); |
convfunc = (FUNC)(VR((P)arg)->priv); |
| /* f must be a function which takes single argument */ |
/* f must be a function which takes single argument */ |
| return 1; |
return 1; |
| Line 529 void Pwrite_to_tb(NODE arg,Q *rp) |
|
| Line 602 void Pwrite_to_tb(NODE arg,Q *rp) |
|
| *rp = 0; |
*rp = 0; |
| } |
} |
| |
|
| FNODE partial_eval(FNODE), fnode_to_nary(FNODE), fnode_to_bin(FNODE,int); |
void Pqt_to_nary(NODE arg,QUOTE *rp) |
| FNODE fnode_normalize(FNODE); |
|
| |
|
| void Pquote_to_nary(NODE arg,QUOTE *rp) |
|
| { |
{ |
| FNODE f; |
FNODE f; |
| |
|
| Line 540 void Pquote_to_nary(NODE arg,QUOTE *rp) |
|
| Line 610 void Pquote_to_nary(NODE arg,QUOTE *rp) |
|
| MKQUOTE(*rp,f); |
MKQUOTE(*rp,f); |
| } |
} |
| |
|
| void Pquote_to_bin(NODE arg,QUOTE *rp) |
void Pqt_to_bin(NODE arg,QUOTE *rp) |
| { |
{ |
| FNODE f; |
FNODE f; |
| int direction; |
int direction; |
| Line 551 void Pquote_to_bin(NODE arg,QUOTE *rp) |
|
| Line 621 void Pquote_to_bin(NODE arg,QUOTE *rp) |
|
| MKQUOTE(*rp,f); |
MKQUOTE(*rp,f); |
| } |
} |
| |
|
| void Pquote_is_number(NODE arg,Q *rp) |
void Pqt_is_var(NODE arg,Q *rp) |
| { |
{ |
| QUOTE q; |
QUOTE q; |
| int ret; |
int ret; |
| |
|
| q = (QUOTE)ARG0(arg); |
q = (QUOTE)ARG0(arg); |
| asir_assert(q,O_QUOTE,"quote_is_number"); |
asir_assert(q,O_QUOTE,"qt_is_var"); |
| |
ret = fnode_is_var(BDY(q)); |
| |
STOQ(ret,*rp); |
| |
} |
| |
|
| |
void Pqt_is_coef(NODE arg,Q *rp) |
| |
{ |
| |
QUOTE q; |
| |
int ret; |
| |
|
| |
q = (QUOTE)ARG0(arg); |
| |
asir_assert(q,O_QUOTE,"qt_is_coef"); |
| |
ret = fnode_is_coef(BDY(q)); |
| |
STOQ(ret,*rp); |
| |
} |
| |
|
| |
void Pqt_is_number(NODE arg,Q *rp) |
| |
{ |
| |
QUOTE q; |
| |
int ret; |
| |
|
| |
q = (QUOTE)ARG0(arg); |
| |
asir_assert(q,O_QUOTE,"qt_is_number"); |
| ret = fnode_is_number(BDY(q)); |
ret = fnode_is_number(BDY(q)); |
| STOQ(ret,*rp); |
STOQ(ret,*rp); |
| } |
} |
| |
|
| void Pquote_is_rational(NODE arg,Q *rp) |
void Pqt_is_rational(NODE arg,Q *rp) |
| { |
{ |
| QUOTE q; |
QUOTE q; |
| int ret; |
int ret; |
| |
|
| q = (QUOTE)ARG0(arg); |
q = (QUOTE)ARG0(arg); |
| asir_assert(q,O_QUOTE,"quote_is_rational"); |
asir_assert(q,O_QUOTE,"qt_is_rational"); |
| ret = fnode_is_rational(BDY(q)); |
ret = fnode_is_rational(BDY(q)); |
| STOQ(ret,*rp); |
STOQ(ret,*rp); |
| } |
} |
| |
|
| void Pquote_is_integer(NODE arg,Q *rp) |
void Pqt_is_integer(NODE arg,Q *rp) |
| { |
{ |
| QUOTE q; |
QUOTE q; |
| int ret; |
int ret; |
| |
|
| q = (QUOTE)ARG0(arg); |
q = (QUOTE)ARG0(arg); |
| asir_assert(q,O_QUOTE,"quote_is_integer"); |
asir_assert(q,O_QUOTE,"qt_is_integer"); |
| ret = fnode_is_integer(BDY(q)); |
ret = fnode_is_integer(BDY(q)); |
| STOQ(ret,*rp); |
STOQ(ret,*rp); |
| } |
} |
| |
|
| void Pquote_is_function(NODE arg,Q *rp) |
void Pqt_is_function(NODE arg,Q *rp) |
| { |
{ |
| QUOTE q; |
QUOTE q; |
| int ret; |
int ret; |
| |
|
| q = (QUOTE)ARG0(arg); |
q = (QUOTE)ARG0(arg); |
| asir_assert(q,O_QUOTE,"quote_is_function"); |
asir_assert(q,O_QUOTE,"qt_is_function"); |
| if ( q->id == I_FUNC || q->id == I_IFUNC ) |
if ( q->id == I_FUNC || q->id == I_IFUNC ) |
| ret = 1; |
ret = 1; |
| else |
else |
| Line 598 void Pquote_is_function(NODE arg,Q *rp) |
|
| Line 690 void Pquote_is_function(NODE arg,Q *rp) |
|
| STOQ(ret,*rp); |
STOQ(ret,*rp); |
| } |
} |
| |
|
| void Pquote_is_dependent(NODE arg,Q *rp) |
void Pqt_is_dependent(NODE arg,Q *rp) |
| { |
{ |
| P x; |
P x; |
| QUOTE q,v; |
QUOTE q,v; |
| Line 607 void Pquote_is_dependent(NODE arg,Q *rp) |
|
| Line 699 void Pquote_is_dependent(NODE arg,Q *rp) |
|
| |
|
| q = (QUOTE)ARG0(arg); |
q = (QUOTE)ARG0(arg); |
| v = (QUOTE)ARG1(arg); |
v = (QUOTE)ARG1(arg); |
| asir_assert(q,O_QUOTE,"quote_is_dependent"); |
asir_assert(q,O_QUOTE,"qt_is_dependent"); |
| asir_assert(v,O_QUOTE,"quote_is_dependent"); |
asir_assert(v,O_QUOTE,"qt_is_dependent"); |
| x = (P)eval(BDY(v)); |
x = (P)eval(BDY(v)); |
| if ( !x || OID(x) != O_P ) |
if ( !x || OID(x) != O_P ) |
| *rp = 0; |
*rp = 0; |
| Line 618 void Pquote_is_dependent(NODE arg,Q *rp) |
|
| Line 710 void Pquote_is_dependent(NODE arg,Q *rp) |
|
| } |
} |
| |
|
| |
|
| void Pquote_unify(NODE arg,Q *rp) |
void Pqt_match(NODE arg,Q *rp) |
| { |
{ |
| FNODE f,g; |
FNODE f,g; |
| Obj obj; |
Obj obj; |
| Line 626 void Pquote_unify(NODE arg,Q *rp) |
|
| Line 718 void Pquote_unify(NODE arg,Q *rp) |
|
| NODE r; |
NODE r; |
| int ret; |
int ret; |
| |
|
| #if 0 |
|
| g = partial_eval(BDY(((QUOTE)ARG0(arg)))); |
|
| MKQUOTE(q,g); |
|
| ret = quote_unify((Obj)q,(Obj)ARG1(arg),&r); |
|
| #else |
|
| obj = (Obj)ARG0(arg); |
obj = (Obj)ARG0(arg); |
| ret = quote_unify(obj,(Obj)ARG1(arg),&r); |
ret = qt_match(obj,(Obj)ARG1(arg),&r); |
| #endif |
|
| if ( ret ) { |
if ( ret ) { |
| do_assign(r); |
do_assign(r); |
| *rp = ONE; |
*rp = ONE; |
| Line 641 void Pquote_unify(NODE arg,Q *rp) |
|
| Line 727 void Pquote_unify(NODE arg,Q *rp) |
|
| *rp = 0; |
*rp = 0; |
| } |
} |
| |
|
| FNODE rewrite_fnode(FNODE,NODE); |
void Pnqt_match(NODE arg,Q *rp) |
| |
{ |
| |
QUOTE fq,pq; |
| |
FNODE f,p; |
| |
int ret; |
| |
Q mode; |
| |
NODE r; |
| |
|
| extern Obj VOIDobj; |
mode = argc(arg)==3 ? (Q)ARG2(arg) : 0; |
| |
fq = (QUOTE)ARG0(arg); Pqt_normalize(mknode(2,fq,mode),&fq); f = (FNODE)BDY(fq); |
| |
pq = (QUOTE)ARG1(arg); Pqt_normalize(mknode(2,pq,mode),&pq); p = (FNODE)BDY(pq); |
| |
ret = nfnode_match(f,p,&r); |
| |
if ( ret ) { |
| |
fnode_do_assign(r); |
| |
*rp = ONE; |
| |
} else |
| |
*rp = 0; |
| |
} |
| |
|
| void Pquote_match_rewrite(NODE arg,Obj *rp) |
void Pnqt_match_rewrite(NODE arg,Obj *rp) |
| { |
{ |
| FNODE f,g,h,c,value; |
FNODE f,p,c,a,r; |
| Obj obj; |
Obj obj,pat,cond,action; |
| |
NODE rule; |
| QUOTE q; |
QUOTE q; |
| NODE r,t,s,s0,pair; |
Q mode; |
| int ret,ind,ac; |
int m; |
| |
|
| obj = (Obj)ARG0(arg); |
obj = (Obj)ARG0(arg); |
| ret = quote_unify(obj,(Obj)ARG1(arg),&r); |
rule = BDY((LIST)ARG1(arg)); |
| if ( ret ) { |
mode = (Q)ARG2(arg); |
| for ( t = r, s0 = 0; t; t = NEXT(t) ) { |
if ( length(rule) == 2 ) { |
| NEXTNODE(s0,s); |
pat = ARG0(rule); |
| pair = BDY((LIST)BDY(t)); |
cond = (Obj)ONE; |
| ind = (int)FA0((FNODE)BDY((QUOTE)BDY(pair))); |
action = (Obj)ARG1(rule); |
| value = mkfnode(1,I_FORMULA,BDY(NEXT(pair))); |
} else { |
| BDY(s) = mknode(2,ind,value); |
pat = ARG0(rule); |
| } |
cond = ARG1(rule); |
| if ( s0 ) NEXT(s) = 0; |
action = (Obj)ARG2(rule); |
| switch ( ac = argc(arg) ) { |
} |
| case 3: |
Pqt_normalize(mknode(2,obj,mode),&q); f = (FNODE)BDY(q); |
| h = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0); |
Pqt_normalize(mknode(2,pat,mode),&q); p = (FNODE)BDY(q); |
| *rp = eval(h); |
Pqt_normalize(mknode(2,action,mode),&q); |
| |
a = (FNODE)BDY(q); |
| |
if ( OID(cond) == O_QUOTE ) c = BDY((QUOTE)cond); |
| |
else c = mkfnode(1,I_FORMULA,ONE); |
| |
|
| |
m = QTOS(mode); |
| |
r = nfnode_match_rewrite(f,p,c,a,m); |
| |
if ( r ) { |
| |
MKQUOTE(q,r); |
| |
*rp = (Obj)q; |
| |
} else |
| |
*rp = obj; |
| |
} |
| |
|
| |
/* f is NARYOP => do submatch */ |
| |
|
| |
#define PV_ANY 99999999 |
| |
|
| |
FNODE nfnode_match_rewrite(FNODE f,FNODE p,FNODE c,FNODE a,int mode) |
| |
{ |
| |
ARF op; |
| |
NODE arg,h0,t,h,valuen; |
| |
NODE r,s0,s,pair; |
| |
FNODE any,pany,head,tail,a1,a2; |
| |
QUOTE q; |
| |
int ret; |
| |
FNODE value; |
| |
int ind; |
| |
|
| |
if ( f->id == I_NARYOP ) { |
| |
op = (ARF)FA0(f); |
| |
arg = (NODE)FA1(f); |
| |
pany = 0; |
| |
for ( h0 = 0, t = arg; t; t = NEXT(t) ) { |
| |
tail = fnode_node_to_nary(op,t); |
| |
ret = nfnode_match(tail,p,&r) && eval(rewrite_fnode(c,r,1)); |
| |
if ( ret ) break; |
| |
|
| |
/* append a variable to the pattern */ |
| |
if ( !pany ) { |
| |
any = mkfnode(1,I_PVAR,PV_ANY); |
| |
pany = mkfnode(3,I_BOP,op,p,any); |
| |
pany = fnode_normalize(pany,mode); |
| |
} |
| |
ret = nfnode_match(tail,pany,&r) && eval(rewrite_fnode(c,r,1)); |
| |
if ( ret ) { |
| |
a = fnode_normalize(mkfnode(3,I_BOP,op,a,any),mode); |
| break; |
break; |
| case 4: |
} |
| c = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0); |
|
| if ( eval(c) ) { |
NEXTNODE(h0,h); |
| h = rewrite_fnode(BDY((QUOTE)ARG3(arg)),s0); |
BDY(h) = BDY(t); |
| *rp = eval(h); |
|
| } else |
|
| *rp = VOIDobj; |
|
| break; |
|
| default: |
|
| error("quote_match_rewrite : invalid argument"); |
|
| } |
} |
| |
if ( t ) { |
| |
if ( h0 ) NEXT(h) = 0; |
| |
head = fnode_node_to_nary(op,h0); |
| |
a = fnode_normalize(mkfnode(3,I_BOP,op,head,a),mode); |
| |
ret = 1; |
| |
} else |
| |
ret = 0; |
| } else |
} else |
| *rp = VOIDobj; |
ret = nfnode_match(f,p,&r) && eval(rewrite_fnode(c,r,1)); |
| |
|
| |
if ( ret ) { |
| |
a1 = rewrite_fnode(a,r,0); |
| |
a2 = partial_eval(a1); |
| |
return fnode_normalize(a2,mode); |
| |
} else |
| |
return 0; |
| } |
} |
| |
|
| void do_assign(NODE arg) |
void do_assign(NODE arg) |
| Line 693 void do_assign(NODE arg) |
|
| Line 849 void do_assign(NODE arg) |
|
| |
|
| for ( t = arg; t; t = NEXT(t) ) { |
for ( t = arg; t; t = NEXT(t) ) { |
| pair = BDY((LIST)BDY(t)); |
pair = BDY((LIST)BDY(t)); |
| pv = (int)FA0((FNODE)BDY((QUOTE)BDY(pair))); |
pv = (long)FA0((FNODE)BDY((QUOTE)BDY(pair))); |
| value = (QUOTE)(BDY(NEXT(pair))); |
value = (QUOTE)(BDY(NEXT(pair))); |
| ASSPV(pv,value); |
ASSPV(pv,value); |
| } |
} |
| } |
} |
| |
|
| |
/* [[index,fnode],...] */ |
| |
|
| |
void fnode_do_assign(NODE arg) |
| |
{ |
| |
NODE t,pair; |
| |
int pv; |
| |
FNODE f; |
| |
QUOTE value; |
| |
QUOTEARG qa; |
| |
|
| |
for ( t = arg; t; t = NEXT(t) ) { |
| |
pair = (NODE)BDY(t); |
| |
pv = (int)BDY(pair); |
| |
f = (FNODE)(BDY(NEXT(pair))); |
| |
if ( f->id == I_FUNC_HEAD ) { |
| |
/* XXX : I_FUNC_HEAD is a dummy id to pass FUNC */ |
| |
MKQUOTEARG(qa,A_func,FA0(f)); |
| |
value = (QUOTE)qa; |
| |
} else |
| |
MKQUOTE(value,f); |
| |
ASSPV(pv,value); |
| |
} |
| |
} |
| |
|
| /* |
/* |
| /* consistency check and merge |
/* consistency check and merge |
| */ |
*/ |
| Line 734 int merge_matching_node(NODE n,NODE a,NODE *rp) |
|
| Line 914 int merge_matching_node(NODE n,NODE a,NODE *rp) |
|
| return 1; |
return 1; |
| } |
} |
| |
|
| int quote_unify_node(NODE f,NODE pat,NODE *rp) { |
int qt_match_node(NODE f,NODE pat,NODE *rp) { |
| NODE r,a,tf,tp,r1; |
NODE r,a,tf,tp,r1; |
| int ret; |
int ret; |
| |
|
| if ( length(f) != length(pat) ) return 0; |
if ( length(f) != length(pat) ) return 0; |
| r = 0; |
r = 0; |
| for ( tf = f, tp = pat; tf; tf = NEXT(tf), tp = NEXT(tp) ) { |
for ( tf = f, tp = pat; tf; tf = NEXT(tf), tp = NEXT(tp) ) { |
| ret = quote_unify((Obj)BDY(tf),(Obj)BDY(tp),&a); |
ret = qt_match((Obj)BDY(tf),(Obj)BDY(tp),&a); |
| if ( !ret ) return 0; |
if ( !ret ) return 0; |
| ret = merge_matching_node(r,a,&r1); |
ret = merge_matching_node(r,a,&r1); |
| if ( !ret ) return 0; |
if ( !ret ) return 0; |
| Line 753 int quote_unify_node(NODE f,NODE pat,NODE *rp) { |
|
| Line 933 int quote_unify_node(NODE f,NODE pat,NODE *rp) { |
|
| |
|
| /* f = [a,b,c,...] pat = [X,Y,...] rpat matches the rest of f */ |
/* f = [a,b,c,...] pat = [X,Y,...] rpat matches the rest of f */ |
| |
|
| int quote_unify_cons(NODE f,NODE pat,Obj rpat,NODE *rp) { |
int qt_match_cons(NODE f,NODE pat,Obj rpat,NODE *rp) { |
| QUOTE q; |
QUOTE q; |
| Q id; |
Q id; |
| FNODE fn; |
FNODE fn; |
| Line 765 int quote_unify_cons(NODE f,NODE pat,Obj rpat,NODE *rp |
|
| Line 945 int quote_unify_cons(NODE f,NODE pat,Obj rpat,NODE *rp |
|
| if ( length(f) < length(pat) ) return 0; |
if ( length(f) < length(pat) ) return 0; |
| r = 0; |
r = 0; |
| for ( tf = f, tp = pat; tp; tf = NEXT(tf), tp = NEXT(tp) ) { |
for ( tf = f, tp = pat; tp; tf = NEXT(tf), tp = NEXT(tp) ) { |
| ret = quote_unify((Obj)BDY(tf),(Obj)BDY(tp),&a); |
ret = qt_match((Obj)BDY(tf),(Obj)BDY(tp),&a); |
| if ( !ret ) return 0; |
if ( !ret ) return 0; |
| ret = merge_matching_node(r,a,&r1); |
ret = merge_matching_node(r,a,&r1); |
| if ( !ret ) return 0; |
if ( !ret ) return 0; |
| Line 777 int quote_unify_cons(NODE f,NODE pat,Obj rpat,NODE *rp |
|
| Line 957 int quote_unify_cons(NODE f,NODE pat,Obj rpat,NODE *rp |
|
| MKLIST(alist,a); |
MKLIST(alist,a); |
| arg = mknode(1,alist); |
arg = mknode(1,alist); |
| Pfunargs_to_quote(arg,&q); |
Pfunargs_to_quote(arg,&q); |
| ret = quote_unify((Obj)q,rpat,&a); |
ret = qt_match((Obj)q,rpat,&a); |
| if ( !ret ) return 0; |
if ( !ret ) return 0; |
| ret = merge_matching_node(r,a,&r1); |
ret = merge_matching_node(r,a,&r1); |
| if ( !ret ) return 0; |
if ( !ret ) return 0; |
| Line 796 void get_quote_id_arg(QUOTE f,int *id,NODE *r) |
|
| Line 976 void get_quote_id_arg(QUOTE f,int *id,NODE *r) |
|
| |
|
| /* *rp : [[quote(A),quote(1)],...] */ |
/* *rp : [[quote(A),quote(1)],...] */ |
| |
|
| int quote_unify(Obj f, Obj pat, NODE *rp) |
int qt_match(Obj f, Obj pat, NODE *rp) |
| { |
{ |
| NODE tf,tp,head,body; |
NODE tf,tp,head,body; |
| NODE parg,farg,r; |
NODE parg,farg,r; |
| Line 815 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| Line 995 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| return 0; |
return 0; |
| else if ( OID(pat) == O_LIST ) { |
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 qt_match_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 ) { |
| Line 842 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| Line 1022 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| |
|
| tp = BDY((LIST)BDY(parg)); |
tp = BDY((LIST)BDY(parg)); |
| if ( pid == I_LIST ) |
if ( pid == I_LIST ) |
| return quote_unify_node(tf,tp,rp); |
return qt_match_node(tf,tp,rp); |
| else { |
else { |
| rpat = (Obj)BDY(NEXT(parg)); |
rpat = (Obj)BDY(NEXT(parg)); |
| return quote_unify_cons(tf,tp,rpat,rp); |
return qt_match_cons(tf,tp,rpat,rp); |
| } |
} |
| |
|
| case I_PVAR: |
case I_PVAR: |
| Line 861 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| Line 1041 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| 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); |
| ret = quote_unify(BDY(NEXT(farg)), |
ret = qt_match(BDY(NEXT(farg)), |
| BDY(NEXT(parg)),&body); |
BDY(NEXT(parg)),&body); |
| if ( !ret ) return 0; |
if ( !ret ) return 0; |
| else return merge_matching_node(head,body,rp); |
else return merge_matching_node(head,body,rp); |
| Line 889 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| Line 1069 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| get_quote_id_arg((QUOTE)pat,&pid,&parg); |
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
| get_quote_id_arg((QUOTE)f,&id,&farg); |
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 qt_match_node(NEXT(farg),NEXT(parg),rp); |
| |
|
| default: |
default: |
| if ( OID(f) != O_QUOTE ) return 0; |
if ( OID(f) != O_QUOTE ) return 0; |
| Line 897 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| Line 1077 int quote_unify(Obj f, Obj pat, NODE *rp) |
|
| if ( id != pid ) return 0; |
if ( id != pid ) return 0; |
| get_quote_id_arg((QUOTE)pat,&pid,&parg); |
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
| get_quote_id_arg((QUOTE)f,&id,&farg); |
get_quote_id_arg((QUOTE)f,&id,&farg); |
| return quote_unify_node(farg,parg,rp); |
return qt_match_node(farg,parg,rp); |
| } |
} |
| } |
} |
| } |
} |
|
|
| Obj *rp; |
Obj *rp; |
| { |
{ |
| FNODE fnode; |
FNODE fnode; |
| |
SNODE snode; |
| char *cmd; |
char *cmd; |
| #if defined(PARI) |
#if defined(PARI) |
| void recover(int); |
void recover(int); |
|
|
| # endif |
# endif |
| #endif |
#endif |
| cmd = BDY((STRING)ARG0(arg)); |
cmd = BDY((STRING)ARG0(arg)); |
| |
#if 0 |
| exprparse_create_var(0,cmd,&fnode); |
exprparse_create_var(0,cmd,&fnode); |
| *rp = eval(fnode); |
*rp = eval(fnode); |
| |
#else |
| |
exprparse_create_var(0,cmd,&snode); |
| |
*rp = evalstat(snode); |
| |
#endif |
| } |
} |
| |
|
| void Prtostr(arg,rp) |
void Prtostr(arg,rp) |
|
|
| P *rp; |
P *rp; |
| { |
{ |
| char *p; |
char *p; |
| |
FUNC f; |
| |
|
| p = BDY((STRING)ARG0(arg)); |
p = BDY((STRING)ARG0(arg)); |
| #if 0 |
#if 0 |
|
|
| makevar(p,rp); |
makevar(p,rp); |
| } |
} |
| #else |
#else |
| makevar(p,rp); |
gen_searchf_searchonly(p,&f); |
| |
if ( f ) |
| |
makesrvar(f,rp); |
| |
else |
| |
makevar(p,rp); |
| #endif |
#endif |
| } |
} |
| |
|
| Line 1245 char *symbol_name(char *name) |
|
| Line 1436 char *symbol_name(char *name) |
|
| |
|
| void Pget_function_name(NODE arg,STRING *rp) |
void Pget_function_name(NODE arg,STRING *rp) |
| { |
{ |
| QUOTEARG qa; |
QUOTEARG qa; |
| ARF f; |
|
| char *opname; |
|
| |
|
| qa = (QUOTEARG)BDY(arg); |
qa = (QUOTEARG)BDY(arg); |
| if ( !qa || OID(qa) != O_QUOTEARG || qa->type != A_arf ) |
if ( !qa || OID(qa) != O_QUOTEARG ) { |
| |
*rp = 0; return; |
| |
} |
| |
switch ( qa->type ) { |
| |
case A_arf: |
| |
MKSTR(*rp,((ARF)BDY(qa))->name); |
| |
break; |
| |
case A_func: |
| |
MKSTR(*rp,((FUNC)BDY(qa))->name); |
| |
break; |
| |
default: |
| *rp = 0; |
*rp = 0; |
| else { |
break; |
| f = (ARF)BDY(qa); |
} |
| opname = f->name; |
|
| MKSTR(*rp,opname); |
|
| } |
|
| } |
} |
| |
|
| FNODE strip_paren(FNODE); |
FNODE strip_paren(FNODE); |
| |
void objtotex_tb(Obj obj,TB tb); |
| |
|
| void fnodetotex_tb(FNODE f,TB tb) |
void fnodetotex_tb(FNODE f,TB tb) |
| { |
{ |
| NODE n,t,t0; |
NODE n,t,t0,args; |
| char vname[BUFSIZ],prefix[BUFSIZ]; |
char vname[BUFSIZ],prefix[BUFSIZ]; |
| char *opname,*vname_conv,*prefix_conv; |
char *opname,*vname_conv,*prefix_conv; |
| Obj obj; |
Obj obj; |
| int i,len,allzero,elen,elen2,si; |
int i,len,allzero,elen,elen2,si; |
| C cplx; |
|
| char *r; |
char *r; |
| FNODE fi,f2; |
FNODE fi,f2,f1; |
| |
|
| write_tb(" ",tb); |
write_tb(" ",tb); |
| if ( !f ) { |
if ( !f ) { |
| Line 1336 void fnodetotex_tb(FNODE f,TB tb) |
|
| Line 1532 void fnodetotex_tb(FNODE f,TB tb) |
|
| write_tb("}",tb); |
write_tb("}",tb); |
| break; |
break; |
| case '^': |
case '^': |
| fnodetotex_tb((FNODE)FA1(f),tb); |
f1 = (FNODE)FA1(f); |
| |
if ( fnode_is_var(f1) ) |
| |
fnodetotex_tb(f1,tb); |
| |
else { |
| |
write_tb("(",tb); |
| |
fnodetotex_tb(f1,tb); |
| |
write_tb(")",tb); |
| |
} |
| write_tb("^{",tb); |
write_tb("^{",tb); |
| fnodetotex_tb(strip_paren((FNODE)FA2(f)),tb); |
fnodetotex_tb(strip_paren((FNODE)FA2(f)),tb); |
| write_tb("} ",tb); |
write_tb("} ",tb); |
| Line 1351 void fnodetotex_tb(FNODE f,TB tb) |
|
| Line 1554 void fnodetotex_tb(FNODE f,TB tb) |
|
| break; |
break; |
| } |
} |
| break; |
break; |
| |
case I_NARYOP: |
| |
args = (NODE)FA1(f); |
| |
switch ( OPNAME(f) ) { |
| |
case '+': |
| |
fnodetotex_tb((FNODE)BDY(args),tb); |
| |
for ( args = NEXT(args); args; args = NEXT(args) ) { |
| |
write_tb("+",tb); |
| |
f1 = (FNODE)BDY(args); |
| |
/* if ( fnode_is_var(f1) || IS_MUL(f1) ) |
| |
fnodetotex_tb(f1,tb); |
| |
else */ { |
| |
write_tb("(",tb); |
| |
fnodetotex_tb(f1,tb); |
| |
write_tb(")",tb); |
| |
} |
| |
} |
| |
break; |
| |
case '*': |
| |
f1 = (FNODE)BDY(args); |
| |
if ( f1->id == I_FORMULA && MUNIQ(FA0(f1)) ) { |
| |
write_tb("- ",tb); args = NEXT(args); |
| |
} |
| |
for ( ; args; args = NEXT(args) ) { |
| |
f2 = (FNODE)BDY(args); |
| |
if ( fnode_is_var(f2) || IS_BINARYPWR(f2) ) |
| |
fnodetotex_tb(f2,tb); |
| |
else { |
| |
write_tb("(",tb); |
| |
fnodetotex_tb(f2,tb); |
| |
write_tb(")",tb); |
| |
} |
| |
} |
| |
break; |
| |
default: |
| |
error("invalid nary op"); |
| |
break; |
| |
} |
| |
break; |
| |
|
| case I_COP: |
case I_COP: |
| switch( (cid)FA0(f) ) { |
switch( (cid)FA0(f) ) { |
| Line 1574 void fnodetotex_tb(FNODE f,TB tb) |
|
| Line 1815 void fnodetotex_tb(FNODE f,TB tb) |
|
| |
|
| /* internal object */ |
/* internal object */ |
| case I_FORMULA: |
case I_FORMULA: |
| obj = (Obj)FA0(f); |
objtotex_tb((Obj)FA0(f),tb); |
| if ( !obj ) |
|
| write_tb("0",tb); |
|
| else if ( OID(obj) == O_N && NID(obj) == N_C ) { |
|
| cplx = (C)obj; |
|
| write_tb("(",tb); |
|
| if ( cplx->r ) { |
|
| r = objtostr((Obj)cplx->r); write_tb(r,tb); |
|
| } |
|
| if ( cplx->i ) { |
|
| if ( cplx->r && compnum(0,cplx->i,0) > 0 ) { |
|
| write_tb("+",tb); |
|
| if ( !UNIQ(cplx->i) ) { |
|
| r = objtostr((Obj)cplx->i); write_tb(r,tb); |
|
| } |
|
| } else if ( MUNIQ(cplx->i) ) |
|
| write_tb("-",tb); |
|
| else if ( !UNIQ(cplx->i) ) { |
|
| r = objtostr((Obj)cplx->i); write_tb(r,tb); |
|
| } |
|
| write_tb("\\sqrt{-1}",tb); |
|
| } |
|
| write_tb(")",tb); |
|
| } else if ( OID(obj) == O_P ) |
|
| write_tb(conv_rule(VR((P)obj)->name),tb); |
|
| else |
|
| write_tb(objtostr(obj),tb); |
|
| break; |
break; |
| |
|
| /* program variable */ |
/* program variable */ |
| Line 1616 void fnodetotex_tb(FNODE f,TB tb) |
|
| Line 1831 void fnodetotex_tb(FNODE f,TB tb) |
|
| } |
} |
| } |
} |
| |
|
| |
void objtotex_tb(Obj obj,TB tb) |
| |
{ |
| |
C cplx; |
| |
char *r; |
| |
P t; |
| |
DCP dc; |
| |
char *v; |
| |
|
| |
if ( !obj ) { |
| |
write_tb("0",tb); |
| |
return; |
| |
} |
| |
switch ( OID(obj) ) { |
| |
case O_N: |
| |
switch ( NID(obj) ) { |
| |
case N_C: |
| |
cplx = (C)obj; |
| |
write_tb("(",tb); |
| |
if ( cplx->r ) { |
| |
r = objtostr((Obj)cplx->r); write_tb(r,tb); |
| |
} |
| |
if ( cplx->i ) { |
| |
if ( cplx->r && compnum(0,cplx->i,0) > 0 ) { |
| |
write_tb("+",tb); |
| |
if ( !UNIQ(cplx->i) ) { |
| |
r = objtostr((Obj)cplx->i); write_tb(r,tb); |
| |
} |
| |
} else if ( MUNIQ(cplx->i) ) |
| |
write_tb("-",tb); |
| |
else if ( !UNIQ(cplx->i) ) { |
| |
r = objtostr((Obj)cplx->i); write_tb(r,tb); |
| |
} |
| |
write_tb("\\sqrt{-1}",tb); |
| |
} |
| |
write_tb(")",tb); |
| |
break; |
| |
default: |
| |
write_tb(objtostr(obj),tb); |
| |
break; |
| |
} |
| |
break; |
| |
case O_P: |
| |
v = conv_rule(VR((P)obj)->name); |
| |
for ( dc = DC((P)obj); dc; dc = NEXT(dc) ) { |
| |
if ( !DEG(dc) ) |
| |
objtotex_tb((Obj)COEF(dc),tb); |
| |
else { |
| |
if ( NUM(COEF(dc)) && UNIQ((Q)COEF(dc)) ) |
| |
; |
| |
else if ( NUM(COEF(dc)) && MUNIQ((Q)COEF(dc)) ) |
| |
write_tb("-",tb); |
| |
else if ( NUM(COEF(dc)) || !NEXT(DC(COEF(dc)))) |
| |
objtotex_tb((Obj)COEF(dc),tb); |
| |
else { |
| |
write_tb("(",tb); objtotex_tb((Obj)COEF(dc),tb); |
| |
write_tb(")",tb); |
| |
} |
| |
write_tb(v,tb); |
| |
if ( cmpq(DEG(dc),ONE) ) { |
| |
write_tb("^",tb); |
| |
if ( INT(DEG(dc)) && SGN(DEG(dc))>0 ) { |
| |
write_tb("{",tb); |
| |
objtotex_tb((Obj)DEG(dc),tb); |
| |
write_tb("}",tb); |
| |
} else { |
| |
write_tb("{",tb); objtotex_tb((Obj)DEG(dc),tb); |
| |
write_tb("}",tb); |
| |
} |
| |
} |
| |
} |
| |
if ( NEXT(dc) ) { |
| |
t = COEF(NEXT(dc)); |
| |
if ( !DEG(NEXT(dc)) ) { |
| |
if ( NUM(t) ) { |
| |
if ( !mmono(t) ) write_tb("+",tb); |
| |
} else { |
| |
if ( !mmono(COEF(DC(t))) ) write_tb("+",tb); |
| |
} |
| |
} else { |
| |
if ( !mmono(t) ) write_tb("+",tb); |
| |
} |
| |
} |
| |
} |
| |
break; |
| |
case O_R: |
| |
write_tb("\\frac{",tb); |
| |
objtotex_tb((Obj)NM((R)obj),tb); |
| |
write_tb("}{",tb); |
| |
objtotex_tb((Obj)DN((R)obj),tb); |
| |
write_tb("}",tb); |
| |
break; |
| |
default: |
| |
write_tb(objtostr(obj),tb); |
| |
break; |
| |
} |
| |
} |
| |
|
| char *objtostr(Obj obj) |
char *objtostr(Obj obj) |
| { |
{ |
| int len; |
int len; |
| Line 1731 int top_is_minus(FNODE f) |
|
| Line 2043 int top_is_minus(FNODE f) |
|
| case O_N: |
case O_N: |
| return mmono((P)obj); |
return mmono((P)obj); |
| case O_P: |
case O_P: |
| |
#if 0 |
| /* must be a variable */ |
/* must be a variable */ |
| opname = conv_rule(VR((P)obj)->name); |
opname = conv_rule(VR((P)obj)->name); |
| return opname[0]=='-'; |
return opname[0]=='-'; |
| |
#else |
| |
return mmono((P)obj); |
| |
#endif |
| default: |
default: |
| /* ??? */ |
/* ??? */ |
| len = estimate_length(CO,obj); |
len = estimate_length(CO,obj); |
| Line 1743 int top_is_minus(FNODE f) |
|
| Line 2059 int top_is_minus(FNODE f) |
|
| return opname[0]=='-'; |
return opname[0]=='-'; |
| } |
} |
| } |
} |
| |
case I_NARYOP: |
| |
return top_is_minus((FNODE)BDY((NODE)FA1(f))); |
| |
|
| default: |
default: |
| return 0; |
return 0; |
| } |
} |
| Line 1921 void Pfunargs_to_quote(NODE arg,QUOTE *rp) |
|
| Line 2240 void Pfunargs_to_quote(NODE arg,QUOTE *rp) |
|
| MKQUOTE(*rp,f); |
MKQUOTE(*rp,f); |
| } |
} |
| |
|
| FNODE fnode_apply(FNODE f,FNODE (*func)()); |
VL reordvars(VL vl0,NODE head) |
| FNODE fnode_normalize(FNODE f); |
{ |
| FNODE fnode_normalize_nary(FNODE f); |
VL vl,svl,tvl; |
| |
int i,j; |
| |
NODE n; |
| |
P t; |
| |
V *va; |
| |
V v; |
| |
|
| void Pquote_normalize(NODE arg,QUOTE *rp) |
for ( vl = 0, i = 0, n = head; n; n = NEXT(n), i++ ) { |
| |
NEXTVL(vl,tvl); |
| |
if ( !(t = (P)BDY(n)) || (OID(t) != O_P) ) |
| |
error("reordvars : invalid argument"); |
| |
VR(tvl) = VR(t); |
| |
} |
| |
va = (V *)ALLOCA(i*sizeof(V)); |
| |
for ( j = 0, svl = vl; j < i; j++, svl = NEXT(svl) ) |
| |
va[j] = VR(svl); |
| |
for ( svl = vl0; svl; svl = NEXT(svl) ) { |
| |
v = VR(svl); |
| |
for ( j = 0; j < i; j++ ) |
| |
if ( v == va[j] ) |
| |
break; |
| |
if ( j == i ) { |
| |
NEXTVL(vl,tvl); |
| |
VR(tvl) = v; |
| |
} |
| |
} |
| |
if ( vl ) |
| |
NEXT(tvl) = 0; |
| |
return vl; |
| |
} |
| |
|
| |
struct wtab { |
| |
V v; |
| |
int w; |
| |
}; |
| |
|
| |
struct wtab *qt_weight_tab; |
| |
VL qt_current_ord, qt_current_coef; |
| |
LIST qt_current_ord_obj,qt_current_coef_obj,qt_current_weight_obj; |
| |
LIST qt_current_weight_obj; |
| |
|
| |
void Pqt_set_ord(NODE arg,LIST *rp) |
| { |
{ |
| |
NODE r0,r; |
| |
VL vl; |
| |
P v; |
| |
|
| |
if ( !argc(arg) ) |
| |
*rp = qt_current_ord_obj; |
| |
else if ( !ARG0(arg) ) { |
| |
qt_current_ord_obj = 0; |
| |
qt_current_ord = 0; |
| |
} else { |
| |
qt_current_ord = reordvars(CO,BDY((LIST)ARG0(arg))); |
| |
for ( r0 = 0, vl = qt_current_ord; vl; vl = NEXT(vl) ) { |
| |
NEXTNODE(r0,r); MKV(vl->v,v); BDY(r) = v; |
| |
} |
| |
if ( r0 ) NEXT(r) = 0; |
| |
MKLIST(*rp,r0); |
| |
qt_current_ord_obj = *rp; |
| |
} |
| |
} |
| |
|
| |
void Pqt_set_weight(NODE arg,LIST *rp) |
| |
{ |
| |
NODE n,pair; |
| |
int l,i; |
| |
struct wtab *tab; |
| |
|
| |
if ( !argc(arg) ) |
| |
*rp = qt_current_weight_obj; |
| |
else if ( !ARG0(arg) ) { |
| |
qt_current_weight_obj = 0; |
| |
qt_weight_tab = 0; |
| |
} else { |
| |
n = BDY((LIST)ARG0(arg)); |
| |
l = length(n); |
| |
tab = qt_weight_tab = (struct wtab *)MALLOC((l+1)*sizeof(struct wtab)); |
| |
for ( i = 0; i < l; i++, n = NEXT(n) ) { |
| |
pair = BDY((LIST)BDY(n)); |
| |
tab[i].v = VR((P)ARG0(pair)); |
| |
tab[i].w = QTOS((Q)ARG1(pair)); |
| |
} |
| |
tab[i].v = 0; |
| |
qt_current_weight_obj = (LIST)ARG0(arg); |
| |
*rp = qt_current_weight_obj; |
| |
} |
| |
} |
| |
|
| |
void Pqt_set_coef(NODE arg,LIST *rp) |
| |
{ |
| |
NODE r0,r,n; |
| |
VL vl0,vl; |
| |
P v; |
| |
|
| |
if ( !argc(arg) ) |
| |
*rp = qt_current_coef_obj; |
| |
else if ( !ARG0(arg) ) { |
| |
qt_current_coef_obj = 0; |
| |
qt_current_coef = 0; |
| |
} else { |
| |
n = BDY((LIST)ARG0(arg)); |
| |
for ( vl0 = 0, r0 = 0; n; n = NEXT(n) ) { |
| |
NEXTNODE(r0,r); |
| |
NEXTVL(vl0,vl); |
| |
vl->v = VR((P)BDY(n)); |
| |
MKV(vl->v,v); BDY(r) = v; |
| |
} |
| |
if ( r0 ) NEXT(r) = 0; |
| |
if ( vl0 ) NEXT(vl) = 0; |
| |
qt_current_coef = vl0; |
| |
MKLIST(*rp,r0); |
| |
qt_current_coef_obj = *rp; |
| |
} |
| |
} |
| |
|
| |
void Pqt_normalize(NODE arg,QUOTE *rp) |
| |
{ |
| QUOTE q,r; |
QUOTE q,r; |
| FNODE f; |
FNODE f; |
| |
int expand,ac; |
| |
|
| |
ac = argc(arg); |
| |
if ( !ac ) error("qt_normalize : invalid argument"); |
| q = (QUOTE)ARG0(arg); |
q = (QUOTE)ARG0(arg); |
| if ( !q || OID(q) != O_QUOTE ) { |
if ( ac == 2 ) |
| |
expand = QTOS((Q)ARG1(arg)); |
| |
if ( !q || OID(q) != O_QUOTE ) |
| *rp = q; |
*rp = q; |
| return; |
else { |
| } else { |
f = fnode_normalize(BDY(q),expand); |
| #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); |
MKQUOTE(r,f); |
| *rp = r; |
*rp = r; |
| } |
} |
| } |
} |
| |
|
| |
NBP fnode_to_nbp(FNODE f); |
| |
|
| |
void Pqt_to_nbp(NODE arg,NBP *rp) |
| |
{ |
| |
QUOTE q; |
| |
FNODE f; |
| |
|
| |
q = (QUOTE)ARG0(arg); f = (FNODE)BDY(q); |
| |
f = fnode_normalize(f,0); |
| |
*rp = fnode_to_nbp(f); |
| |
} |
| |
|
| |
void Pshuffle_mul(NODE arg,NBP *rp) |
| |
{ |
| |
NBP p1,p2; |
| |
|
| |
p1 = (NBP)ARG0(arg); |
| |
p2 = (NBP)ARG1(arg); |
| |
shuffle_mulnbp(CO,p1,p2,rp); |
| |
} |
| |
|
| |
void Pharmonic_mul(NODE arg,NBP *rp) |
| |
{ |
| |
NBP p1,p2; |
| |
|
| |
p1 = (NBP)ARG0(arg); |
| |
p2 = (NBP)ARG1(arg); |
| |
harmonic_mulnbp(CO,p1,p2,rp); |
| |
} |
| |
|
| |
void Pnbp_hm(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
NODE n; |
| |
NBM m; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) *rp = 0; |
| |
else { |
| |
m = (NBM)BDY(BDY(p)); |
| |
MKNODE(n,m,0); |
| |
MKNBP(*rp,n); |
| |
} |
| |
} |
| |
|
| |
void Pnbp_ht(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
NODE n; |
| |
NBM m,m1; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) *rp = 0; |
| |
else { |
| |
m = (NBM)BDY(BDY(p)); |
| |
NEWNBM(m1); |
| |
m1->d = m->d; m1->c = (P)ONE; m1->b = m->b; |
| |
MKNODE(n,m1,0); |
| |
MKNBP(*rp,n); |
| |
} |
| |
} |
| |
|
| |
void Pnbp_hc(NODE arg, P *rp) |
| |
{ |
| |
NBP p; |
| |
NBM m; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) *rp = 0; |
| |
else { |
| |
m = (NBM)BDY(BDY(p)); |
| |
*rp = m->c; |
| |
} |
| |
} |
| |
|
| |
void Pnbp_rest(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
NODE n; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) *rp = 0; |
| |
else { |
| |
n = BDY(p); |
| |
if ( !NEXT(n) ) *rp = 0; |
| |
else |
| |
MKNBP(*rp,NEXT(n)); |
| |
} |
| |
} |
| |
|
| |
void Pnbp_tm(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
NODE n; |
| |
NBM m; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) *rp = 0; |
| |
else { |
| |
for ( n = BDY(p); NEXT(n); n = NEXT(n) ); |
| |
m = (NBM)BDY(n); |
| |
MKNODE(n,m,0); |
| |
MKNBP(*rp,n); |
| |
} |
| |
} |
| |
|
| |
void Pnbp_tt(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
NODE n; |
| |
NBM m,m1; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) *rp = 0; |
| |
else { |
| |
for ( n = BDY(p); NEXT(n); n = NEXT(n) ); |
| |
m = (NBM)BDY(n); |
| |
NEWNBM(m1); |
| |
m1->d = m->d; m1->c = (P)ONE; m1->b = m->b; |
| |
MKNODE(n,m1,0); |
| |
MKNBP(*rp,n); |
| |
} |
| |
} |
| |
|
| |
void Pnbp_tc(NODE arg, P *rp) |
| |
{ |
| |
NBP p; |
| |
NBM m; |
| |
NODE n; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) *rp = 0; |
| |
else { |
| |
for ( n = BDY(p); NEXT(n); n = NEXT(n) ); |
| |
m = (NBM)BDY(n); |
| |
*rp = m->c; |
| |
} |
| |
} |
| |
|
| |
void Pnbp_trest(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
NODE n,r,r0; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) *rp = 0; |
| |
else { |
| |
n = BDY(p); |
| |
for ( r0 = 0; NEXT(n); n = NEXT(n) ) { |
| |
NEXTNODE(r0,r); |
| |
BDY(r) = (pointer)BDY(n); |
| |
} |
| |
if ( r0 ) { |
| |
NEXT(r) = 0; |
| |
MKNBP(*rp,r0); |
| |
} else |
| |
*rp = 0; |
| |
} |
| |
} |
| |
|
| |
void Pnbm_deg(NODE arg, Q *rp) |
| |
{ |
| |
NBP p; |
| |
NBM m; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
STOQ(-1,*rp); |
| |
else { |
| |
m = (NBM)BDY(BDY(p)); |
| |
STOQ(m->d,*rp); |
| |
} |
| |
} |
| |
|
| |
void Pnbm_index(NODE arg, Q *rp) |
| |
{ |
| |
NBP p; |
| |
NBM m; |
| |
unsigned int *b; |
| |
int d,i,r; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
STOQ(0,*rp); |
| |
else { |
| |
m = (NBM)BDY(BDY(p)); |
| |
d = m->d; |
| |
if ( d > 32 ) |
| |
error("nbm_index : weight too large"); |
| |
b = m->b; |
| |
for ( r = 0, i = d-2; i > 0; i-- ) |
| |
if ( !NBM_GET(b,i) ) r |= (1<<(d-2-i)); |
| |
STOQ(r,*rp); |
| |
} |
| |
} |
| |
|
| |
void Pnbm_hp_rest(NODE arg, LIST *rp) |
| |
{ |
| |
NBP p,h,r; |
| |
NBM m,m1; |
| |
NODE n; |
| |
int *b,*b1; |
| |
int d,d1,v,i,j,k; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
MKLIST(*rp,0); |
| |
else { |
| |
m = (NBM)BDY(BDY(p)); |
| |
b = m->b; d = m->d; |
| |
if ( !d ) |
| |
MKLIST(*rp,0); |
| |
else { |
| |
v = NBM_GET(b,0); |
| |
for ( i = 1; i < d; i++ ) |
| |
if ( NBM_GET(b,i) != v ) break; |
| |
NEWNBM(m1); NEWNBMBDY(m1,i); |
| |
b1 = m1->b; m1->d = i; m1->c = (P)ONE; |
| |
if ( v ) for ( j = 0; j < i; j++ ) NBM_SET(b1,j); |
| |
else for ( j = 0; j < i; j++ ) NBM_CLR(b1,j); |
| |
MKNODE(n,m1,0); MKNBP(h,n); |
| |
|
| |
d1 = d-i; |
| |
NEWNBM(m1); NEWNBMBDY(m1,d1); |
| |
b1 = m1->b; m1->d = d1; m1->c = (P)ONE; |
| |
for ( j = 0, k = i; j < d1; j++, k++ ) |
| |
if ( NBM_GET(b,k) ) NBM_SET(b1,j); |
| |
else NBM_CLR(b1,j); |
| |
MKNODE(n,m1,0); MKNBP(r,n); |
| |
n = mknode(2,h,r); |
| |
MKLIST(*rp,n); |
| |
} |
| |
} |
| |
} |
| |
|
| |
void Pnbm_hxky(NODE arg, LIST *rp) |
| |
{ |
| |
NBP p; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
*rp = 0; |
| |
else |
| |
separate_xky_nbm((NBM)BDY(BDY(p)),0,rp,0); |
| |
} |
| |
|
| |
void Pnbm_xky_rest(NODE arg,NBP *rp) |
| |
{ |
| |
NBP p; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
*rp = 0; |
| |
else |
| |
separate_xky_nbm((NBM)BDY(BDY(p)),0,0,rp); |
| |
} |
| |
|
| |
void Pnbm_hv(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
*rp = 0; |
| |
else |
| |
separate_nbm((NBM)BDY(BDY(p)),0,rp,0); |
| |
} |
| |
|
| |
void Pnbm_rest(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
*rp = 0; |
| |
else |
| |
separate_nbm((NBM)BDY(BDY(p)),0,0,rp); |
| |
} |
| |
|
| |
void Pnbm_tv(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
*rp = 0; |
| |
else |
| |
separate_tail_nbm((NBM)BDY(BDY(p)),0,0,rp); |
| |
} |
| |
|
| |
void Pnbm_trest(NODE arg, NBP *rp) |
| |
{ |
| |
NBP p; |
| |
|
| |
p = (NBP)ARG0(arg); |
| |
if ( !p ) |
| |
*rp = 0; |
| |
else |
| |
separate_tail_nbm((NBM)BDY(BDY(p)),0,rp,0); |
| |
} |
| |
|
| |
NBP fnode_to_nbp(FNODE f) |
| |
{ |
| |
Q r; |
| |
int n,i; |
| |
NBM m; |
| |
V v; |
| |
NBP u,u1,u2; |
| |
NODE t,b; |
| |
|
| |
if ( f->id == I_FORMULA ) { |
| |
r = eval(f); |
| |
NEWNBM(m); |
| |
if ( OID(r) == O_N ) { |
| |
m->d = 0; m->c = (P)r; m->b = 0; |
| |
} else { |
| |
v = VR((P)r); |
| |
m->d = 1; m->c = (P)ONE; NEWNBMBDY(m,1); |
| |
if ( !strcmp(NAME(v),"x") ) NBM_SET(m->b,0); |
| |
else NBM_CLR(m->b,0); |
| |
} |
| |
MKNODE(b,m,0); MKNBP(u,b); |
| |
return u; |
| |
} else if ( IS_NARYADD(f) ) { |
| |
t = (NODE)FA1(f); u = fnode_to_nbp((FNODE)BDY(t)); |
| |
for ( t = NEXT(t); t; t = NEXT(t) ) { |
| |
u1 = fnode_to_nbp((FNODE)BDY(t)); |
| |
addnbp(CO,u,u1,&u2); u = u2; |
| |
} |
| |
return u; |
| |
} else if ( IS_NARYMUL(f) ) { |
| |
t = (NODE)FA1(f); u = fnode_to_nbp((FNODE)BDY(t)); |
| |
for ( t = NEXT(t); t; t = NEXT(t) ) { |
| |
u1 = fnode_to_nbp((FNODE)BDY(t)); |
| |
mulnbp(CO,u,u1,&u2); u = u2; |
| |
} |
| |
return u; |
| |
} else if ( IS_BINARYPWR(f) ) { |
| |
u = fnode_to_nbp((FNODE)FA1(f)); |
| |
r = eval((FNODE)FA2(f)); |
| |
pwrnbp(CO,u,r,&u1); |
| |
return u1; |
| |
} |
| |
} |
| |
|
| |
void Pnqt_weight(NODE arg,Q *rp) |
| |
{ |
| |
QUOTE q; |
| |
FNODE f; |
| |
int w; |
| |
|
| |
q = (QUOTE)ARG0(arg); f = (FNODE)BDY(q); |
| |
f = fnode_normalize(f,0); |
| |
w = nfnode_weight(qt_weight_tab,f); |
| |
STOQ(w,*rp); |
| |
} |
| |
|
| |
void Pnqt_comp(NODE arg,Q *rp) |
| |
{ |
| |
QUOTE q1,q2; |
| |
FNODE f1,f2; |
| |
int r; |
| |
|
| |
q1 = (QUOTE)ARG0(arg); f1 = (FNODE)BDY(q1); |
| |
q2 = (QUOTE)ARG1(arg); f2 = (FNODE)BDY(q2); |
| |
f1 = fnode_normalize(f1,0); |
| |
f2 = fnode_normalize(f2,0); |
| |
r = nfnode_comp(f1,f2); |
| |
STOQ(r,*rp); |
| |
} |
| |
|
| |
int fnode_is_var(FNODE f) |
| |
{ |
| |
Obj obj; |
| |
VL vl,t,s; |
| |
DCP dc; |
| |
|
| |
if ( fnode_is_coef(f) ) return 0; |
| |
switch ( f->id ) { |
| |
case I_PAREN: |
| |
return fnode_is_var(FA0(f)); |
| |
|
| |
case I_FORMULA: |
| |
obj = FA0(f); |
| |
if ( obj && OID(obj) == O_P ) { |
| |
dc = DC((P)obj); |
| |
if ( !cmpq(DEG(dc),ONE) && !NEXT(dc) |
| |
&& !arf_comp(CO,(Obj)COEF(dc),(Obj)ONE) ) return 1; |
| |
else return 0; |
| |
} else return 0; |
| |
|
| |
default: |
| |
return 0; |
| |
} |
| |
} |
| |
|
| |
int fnode_is_coef(FNODE f) |
| |
{ |
| |
Obj obj; |
| |
VL vl,t,s; |
| |
|
| |
switch ( f->id ) { |
| |
case I_MINUS: case I_PAREN: |
| |
return fnode_is_coef(FA0(f)); |
| |
|
| |
case I_FORMULA: |
| |
obj = FA0(f); |
| |
if ( !obj ) return 1; |
| |
else if ( OID(obj) == O_QUOTE ) |
| |
return fnode_is_coef(BDY((QUOTE)obj)); |
| |
else if ( NUM(obj) ) return 1; |
| |
else if ( OID(obj) == O_P || OID(obj) == O_R) { |
| |
get_vars_recursive(obj,&vl); |
| |
for ( t = vl; t; t = NEXT(t) ) { |
| |
if ( t->v->attr == (pointer)V_PF ) continue; |
| |
for ( s = qt_current_coef; s; s = NEXT(s) ) |
| |
if ( t->v == s->v ) break; |
| |
if ( !s ) |
| |
return 0; |
| |
} |
| |
return 1; |
| |
} else return 0; |
| |
|
| |
case I_BOP: |
| |
return fnode_is_coef(FA1(f)) && fnode_is_coef(FA2(f)); |
| |
|
| |
default: |
| |
return 0; |
| |
} |
| |
} |
| |
|
| int fnode_is_number(FNODE f) |
int fnode_is_number(FNODE f) |
| { |
{ |
| Obj obj; |
Obj obj; |
| Line 2032 int fnode_is_integer(FNODE f) |
|
| Line 2894 int fnode_is_integer(FNODE f) |
|
| } |
} |
| } |
} |
| |
|
| 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) |
int fnode_is_nonnegative_integer(FNODE f) |
| { |
{ |
| Q n; |
Q n; |
| Line 2100 int fnode_is_dependent(FNODE f,V v) |
|
| Line 2953 int fnode_is_dependent(FNODE f,V v) |
|
| } |
} |
| } |
} |
| |
|
| FNODE fnode_normalize(FNODE f) |
|
| |
FNODE fnode_normalize(FNODE f,int expand) |
| { |
{ |
| FNODE a2,mone; |
FNODE a1,a2,mone,r,b2; |
| Q q; |
|
| NODE n; |
NODE n; |
| |
Q q; |
| |
|
| |
if ( f->normalized && (f->expanded == expand) ) return f; |
| |
STOQ(-1,q); |
| |
mone = mkfnode(1,I_FORMULA,q); |
| switch ( f->id ) { |
switch ( f->id ) { |
| case I_PAREN: |
case I_PAREN: |
| return fnode_normalize(FA0(f)); |
r = fnode_normalize(FA0(f),expand); |
| |
break; |
| |
|
| case I_MINUS: |
case I_MINUS: |
| f = fnode_normalize(FA0(f)); |
r = nfnode_mul_coef((Obj)q, |
| return f->id==I_MINUS ? FA0(f) : mkfnode(1,I_MINUS,f); |
fnode_normalize(FA0(f),expand),expand); |
| |
break; |
| |
|
| case I_BOP: |
case I_BOP: |
| /* arf fnode fnode */ |
/* arf fnode fnode */ |
| f = fnode_apply(f,fnode_normalize); |
a1 = fnode_normalize(FA1(f),expand); |
| switch ( ((ARF)FA0(f))->name[0] ) { |
a2 = fnode_normalize(FA2(f),expand); |
| |
switch ( OPNAME(f) ) { |
| |
case '+': |
| |
r = nfnode_add(a1,a2,expand); |
| |
break; |
| case '-': |
case '-': |
| a2 = mkfnode(1,I_MINUS,FA2(f)); |
a2 = nfnode_mul_coef((Obj)q,a2,expand); |
| return mkfnode(3,I_BOP,addfs,FA1(f),a2); |
r = nfnode_add(a1,a2,expand); |
| |
break; |
| |
case '*': |
| |
r = nfnode_mul(a1,a2,expand); |
| |
break; |
| case '/': |
case '/': |
| STOQ(-1,q); |
a2 = nfnode_pwr(a2,mone,expand); |
| mone = mkfnode(1,I_FORMULA,q); |
r = nfnode_mul(a1,a2,expand); |
| a2 = mkfnode(3,I_BOP,pwrfs,FA2(f),mone); |
break; |
| return mkfnode(3,I_BOP,mulfs,FA1(f),a2); |
case '^': |
| |
r = nfnode_pwr(a1,a2,expand); |
| |
break; |
| default: |
default: |
| return f; |
r = mkfnode(3,I_BOP,FA0(f),a1,a2); |
| |
break; |
| } |
} |
| break; |
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: |
case I_NARYOP: |
| f = fnode_apply(f,fnode_normalize_nary); |
switch ( OPNAME(f) ) { |
| switch ( ((ARF)FA0(f))->name[0] ) { |
|
| /* XXX */ |
|
| case '+': |
case '+': |
| return fnode_simplify_add(f); |
n = (NODE)FA1(f); |
| |
r = fnode_normalize(BDY(n),expand); n = NEXT(n); |
| |
for ( ; n; n = NEXT(n) ) { |
| |
a1 = fnode_normalize(BDY(n),expand); |
| |
r = nfnode_add(r,a1,expand); |
| |
} |
| |
break; |
| case '*': |
case '*': |
| return fnode_simplify_mul(f); |
n = (NODE)FA1(f); |
| |
r = fnode_normalize(BDY(n),expand); n = NEXT(n); |
| |
for ( ; n; n = NEXT(n) ) { |
| |
a1 = fnode_normalize(BDY(n),expand); |
| |
r = nfnode_mul(r,a1,expand); |
| |
} |
| |
break; |
| default: |
default: |
| return f; |
error("fnode_normallize : cannot happen"); |
| } |
} |
| break; |
break; |
| |
|
| default: |
default: |
| return fnode_apply(f,fnode_normalize_nary); |
return fnode_apply(f,fnode_normalize,expand); |
| break; |
|
| } |
} |
| |
r->normalized = 1; |
| |
r->expanded = expand; |
| |
return r; |
| } |
} |
| |
|
| FNODE fnode_apply(FNODE f,FNODE (*func)()) |
FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand) |
| { |
{ |
| fid_spec_p spec; |
fid_spec_p spec; |
| FNODE r; |
FNODE r; |
| Line 2183 FNODE fnode_apply(FNODE f,FNODE (*func)()) |
|
| Line 3045 FNODE fnode_apply(FNODE f,FNODE (*func)()) |
|
| for ( i = 0; i < n; i++ ) { |
for ( i = 0; i < n; i++ ) { |
| switch ( spec->type[i] ) { |
switch ( spec->type[i] ) { |
| case A_fnode: |
case A_fnode: |
| r->arg[i] = func(f->arg[i]); |
r->arg[i] = func(f->arg[i],expand); |
| break; |
break; |
| case A_node: |
case A_node: |
| s = (NODE)f->arg[i]; |
s = (NODE)f->arg[i]; |
| for ( t0 = 0; s; s = NEXT(s) ) { |
for ( t0 = 0; s; s = NEXT(s) ) { |
| NEXTNODE(t0,t); |
NEXTNODE(t0,t); |
| BDY(t) = (pointer)func((FNODE)BDY(s)); |
BDY(t) = (pointer)func((FNODE)BDY(s),expand); |
| } |
} |
| if ( t0 ) NEXT(t) = 0; |
if ( t0 ) NEXT(t) = 0; |
| r->arg[i] = t0; |
r->arg[i] = t0; |
| Line 2202 FNODE fnode_apply(FNODE f,FNODE (*func)()) |
|
| Line 3064 FNODE fnode_apply(FNODE f,FNODE (*func)()) |
|
| return r; |
return r; |
| } |
} |
| |
|
| NODE2 fnode_add_monomial(NODE2 s0,FNODE g); |
FNODE nfnode_add(FNODE f1,FNODE f2,int expand) |
| |
{ |
| |
NODE n1,n2,r0,r; |
| |
FNODE b1,b2; |
| |
int s; |
| |
Obj c1,c2,c; |
| |
|
| FNODE fnode_simplify_add(FNODE f) |
if ( IS_ZERO(f1) ) return f2; |
| |
else if ( IS_ZERO(f2) ) return f1; |
| |
f1 = to_naryadd(f1); f2 = to_naryadd(f2); |
| |
n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2); |
| |
r0 = 0; |
| |
while ( n1 && n2 ) { |
| |
fnode_coef_body(BDY(n1),&c1,&b1); fnode_coef_body(BDY(n2),&c2,&b2); |
| |
if ( (s = nfnode_comp(b1,b2)) > 0 ) { |
| |
NEXTNODE(r0,r); BDY(r) = BDY(n1); n1 = NEXT(n1); |
| |
} else if ( s < 0 ) { |
| |
NEXTNODE(r0,r); BDY(r) = BDY(n2); n2 = NEXT(n2); |
| |
} else { |
| |
arf_add(CO,c1,c2,&c); |
| |
if ( c ) { |
| |
NEXTNODE(r0,r); BDY(r) = nfnode_mul_coef(c,b1,expand); |
| |
} |
| |
n1 = NEXT(n1); n2 = NEXT(n2); |
| |
} |
| |
} |
| |
if ( n1 ) |
| |
if ( r0 ) NEXT(r) = n1; |
| |
else r0 = n1; |
| |
else if ( n2 ) |
| |
if ( r0 ) NEXT(r) = n2; |
| |
else r0 = n2; |
| |
else if ( r0 ) |
| |
NEXT(r) = 0; |
| |
|
| |
return fnode_node_to_nary(addfs,r0); |
| |
} |
| |
|
| |
FNODE fnode_node_to_nary(ARF op,NODE n) |
| { |
{ |
| NODE n; |
if ( !n ) { |
| NODE r0,r,t,u; |
if ( op->name[0] == '+' ) |
| NODE2 s,s0; |
return mkfnode(1,I_FORMULA,NULLP); |
| FNODE g,m; |
else |
| QUOTE q; |
return mkfnode(1,I_FORMULA,ONE); |
| |
} else if ( !NEXT(n) ) return BDY(n); |
| |
else return mkfnode(2,I_NARYOP,op,n); |
| |
} |
| |
|
| n = (NODE)FA1(f); |
FNODE nfnode_mul(FNODE f1,FNODE f2,int expand) |
| s0 = 0; |
{ |
| for ( t = n; t; t = NEXT(t) ) { |
NODE n1,n2,r0,r,r1; |
| g = (FNODE)BDY(t); |
FNODE b1,b2,e1,e2,cc,t,t1; |
| s0 = fnode_add_monomial(s0,g); |
FNODE *m; |
| |
int s; |
| |
Obj c1,c2,c,e; |
| |
int l1,l,i,j; |
| |
|
| |
if ( IS_ZERO(f1) || IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,NULLP); |
| |
else if ( fnode_is_coef(f1) ) |
| |
return nfnode_mul_coef((Obj)eval(f1),f2,expand); |
| |
else if ( fnode_is_coef(f2) ) |
| |
return nfnode_mul_coef((Obj)eval(f2),f1,expand); |
| |
|
| |
if ( expand && IS_NARYADD(f1) ) { |
| |
t = mkfnode(1,I_FORMULA,NULLP); |
| |
for ( n1 = (NODE)FA1(f1); n1; n1 = NEXT(n1) ) { |
| |
t1 = nfnode_mul(BDY(n1),f2,expand); |
| |
t = nfnode_add(t,t1,expand); |
| |
} |
| |
return t; |
| } |
} |
| if ( !s0 ) |
if ( expand && IS_NARYADD(f2) ) { |
| return mkfnode(1,I_FORMULA,0); |
t = mkfnode(1,I_FORMULA,NULLP); |
| else { |
for ( n2 = (NODE)FA1(f2); n2; n2 = NEXT(n2) ) { |
| for ( s = s0, r0 = 0; s; s = NEXT(s) ) { |
t1 = nfnode_mul(f1,BDY(n2),expand); |
| NEXTNODE(r0,r); |
t = nfnode_add(t,t1,expand); |
| if ( UNIQ(s->body1) ) |
} |
| BDY(r) = s->body2; |
return t; |
| else if ( MUNIQ(s->body1) ) |
} |
| BDY(r) = mkfnode(1,I_MINUS,s->body2); |
|
| |
fnode_coef_body(f1,&c1,&b1); fnode_coef_body(f2,&c2,&b2); |
| |
arf_mul(CO,c1,c2,&c); |
| |
if ( !c ) return mkfnode(1,I_FORMULA,NULLP); |
| |
|
| |
|
| |
n1 = (NODE)FA1(to_narymul(b1)); n2 = (NODE)FA1(to_narymul(b2)); |
| |
l1 = length(n1); l = l1+length(n2); |
| |
m = (FNODE *)ALLOCA(l*sizeof(FNODE)); |
| |
for ( r = n1, i = 0; i < l1; r = NEXT(r), i++ ) m[i] = BDY(r); |
| |
for ( r = n2; r; r = NEXT(r) ) { |
| |
if ( i == 0 ) |
| |
m[i++] = BDY(r); |
| |
else { |
| |
fnode_base_exp(m[i-1],&b1,&e1); fnode_base_exp(BDY(r),&b2,&e2); |
| |
if ( compfnode(b1,b2) ) break; |
| |
arf_add(CO,eval(e1),eval(e2),&e); |
| |
if ( !e ) i--; |
| |
else if ( expand == 2 ) { |
| |
if ( INT(e) && SGN((Q)e) < 0 ) { |
| |
t1 = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e)); |
| |
/* r=(r0|rest)->(r0,t1|rest) */ |
| |
t = BDY(r); |
| |
MKNODE(r1,t1,NEXT(r)); |
| |
MKNODE(r,t,r1); |
| |
i--; |
| |
} else |
| |
m[i++] = BDY(r); |
| |
} else if ( UNIQ(e) ) |
| |
m[i-1] = b1; |
| |
else |
| |
m[i-1] = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e)); |
| |
} |
| |
} |
| |
for ( j = i-1; j >= 0; j-- ) { |
| |
MKNODE(r1,m[j],r); r = r1; |
| |
} |
| |
if ( !UNIQ(c) ) { |
| |
cc = mkfnode(1,I_FORMULA,c); MKNODE(r1,cc,r); r = r1; |
| |
} |
| |
return fnode_node_to_nary(mulfs,r); |
| |
} |
| |
|
| |
FNODE nfnode_pwr(FNODE f1,FNODE f2,int expand) |
| |
{ |
| |
FNODE b,b1,e1,e,cc,r,mf2,mone,inv; |
| |
Obj c,c1; |
| |
Num nf2; |
| |
int ee; |
| |
NODE arg,n,t0,t1; |
| |
Q q; |
| |
|
| |
if ( IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,ONE); |
| |
else if ( IS_ZERO(f1) ) return mkfnode(1,I_FORMULA,NULLP); |
| |
else if ( fnode_is_coef(f1) ) { |
| |
if ( fnode_is_integer(f2) ) { |
| |
if ( fnode_is_one(f2) ) return f1; |
| else { |
else { |
| objtoquote(s->body1,&q); |
arf_pwr(CO,eval(f1),(Obj)eval(f2),&c); |
| m = (FNODE)s->body2; |
return mkfnode(1,I_FORMULA,c); |
| 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); |
|
| } |
|
| } |
} |
| |
} else { |
| |
f1 = mkfnode(1,I_FORMULA,eval(f1)); |
| |
return mkfnode(3,I_BOP,pwrfs,f1,f2); |
| } |
} |
| if ( r0 ) NEXT(r) = 0; |
} else if ( IS_BINARYPWR(f1) ) { |
| if ( length(r0) == 1 ) |
b1 = FA1(f1); e1 = FA2(f1); |
| return (FNODE)BDY(r0); |
e = nfnode_mul(e1,f2,expand); |
| |
if ( fnode_is_one(e) ) |
| |
return b1; |
| else |
else |
| return mkfnode(2,I_NARYOP,FA0(f),r0); |
return mkfnode(3,I_BOP,FA0(f1),b1,e); |
| |
} else if ( expand && IS_NARYMUL(f1) && fnode_is_number(f2) |
| |
&& fnode_is_integer(f2) ) { |
| |
fnode_coef_body(f1,&c1,&b1); |
| |
nf2 = (Num)eval(f2); |
| |
arf_pwr(CO,c1,(Obj)nf2,&c); |
| |
ee = QTOS((Q)nf2); |
| |
cc = mkfnode(1,I_FORMULA,c); |
| |
if ( fnode_is_nonnegative_integer(f2) ) |
| |
b = fnode_expand_pwr(b1,ee,expand); |
| |
else { |
| |
STOQ(-1,q); |
| |
mone = mkfnode(1,I_FORMULA,q); |
| |
b1 = to_narymul(b1); |
| |
for ( t0 = 0, n = (NODE)FA1(b1); n; n = NEXT(n) ) { |
| |
inv = mkfnode(3,I_BOP,pwrfs,BDY(n),mone); |
| |
MKNODE(t1,inv,t0); t0 = t1; |
| |
} |
| |
b1 = fnode_node_to_nary(mulfs,t0); |
| |
b = fnode_expand_pwr(b1,-ee,expand); |
| |
} |
| |
if ( fnode_is_one(cc) ) |
| |
return b; |
| |
else |
| |
return fnode_node_to_nary(mulfs,mknode(2,cc,b)); |
| |
} else if ( expand && fnode_is_integer(f2) |
| |
&& fnode_is_nonnegative_integer(f2) ) { |
| |
q = (Q)eval(f2); |
| |
if ( PL(NM(q)) > 1 ) error("nfnode_pwr : exponent too large"); |
| |
return fnode_expand_pwr(f1,QTOS(q),expand); |
| |
} else |
| |
return mkfnode(3,I_BOP,pwrfs,f1,f2); |
| |
} |
| |
|
| |
FNODE fnode_expand_pwr(FNODE f,int n,int expand) |
| |
{ |
| |
int n1,i; |
| |
FNODE f1,f2,fn; |
| |
Q q; |
| |
|
| |
if ( !n ) return mkfnode(1,I_FORMULA,ONE); |
| |
else if ( IS_ZERO(f) ) return mkfnode(1,I_FORMULA,NULLP); |
| |
else if ( n == 1 ) return f; |
| |
else { |
| |
switch ( expand ) { |
| |
case 1: |
| |
n1 = n/2; |
| |
f1 = fnode_expand_pwr(f,n1,expand); |
| |
f2 = nfnode_mul(f1,f1,expand); |
| |
if ( n%2 ) f2 = nfnode_mul(f2,f,1); |
| |
return f2; |
| |
case 2: |
| |
for ( i = 1, f1 = f; i < n; i++ ) |
| |
f1 = nfnode_mul(f1,f,expand); |
| |
return f1; |
| |
case 0: default: |
| |
STOQ(n,q); |
| |
fn = mkfnode(1,I_FORMULA,q); |
| |
return mkfnode(3,I_BOP,pwrfs,f,fn); |
| |
} |
| } |
} |
| } |
} |
| |
|
| NODE2 fnode_add_monomial(NODE2 r,FNODE g) |
/* f = b^e */ |
| |
void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep) |
| { |
{ |
| Num c,c1; |
if ( IS_BINARYPWR(f) ) { |
| FNODE b; |
*bp = FA1(f); *ep = FA2(f); |
| NODE arg; |
} else { |
| NODE2 prev,cur,t; |
*bp = f; *ep = mkfnode(1,I_FORMULA,ONE); |
| int a; |
} |
| |
} |
| |
|
| if ( fnode_is_number(g) ) { |
FNODE to_naryadd(FNODE f) |
| c = (Num)eval(g); |
{ |
| b = mkfnode(1,I_FORMULA,ONE); |
FNODE r; |
| } else if ( g->id == I_NARYOP && OPNAME(g) == '*' ) { |
NODE n; |
| arg = (NODE)FA1(g); |
|
| if ( fnode_is_number(BDY(arg)) ) { |
if ( IS_NARYADD(f) ) return f; |
| c = (Num)eval(BDY(arg)); |
|
| if ( length(arg) > 2 ) |
NEWFNODE(r,2); r->id = I_NARYOP; |
| b = mkfnode(2,I_NARYOP,FA0(g),NEXT(arg)); |
FA0(r) = addfs; MKNODE(n,f,0); FA1(r) = n; |
| else |
return r; |
| b = BDY(NEXT(arg)); |
} |
| |
|
| |
FNODE to_narymul(FNODE f) |
| |
{ |
| |
FNODE r; |
| |
NODE n; |
| |
|
| |
if ( IS_NARYMUL(f) ) return f; |
| |
|
| |
NEWFNODE(r,2); r->id = I_NARYOP; |
| |
FA0(r) = mulfs; MKNODE(n,f,0); FA1(r) = n; |
| |
return r; |
| |
} |
| |
|
| |
FNODE nfnode_mul_coef(Obj c,FNODE f,int expand) |
| |
{ |
| |
FNODE b1,cc; |
| |
Obj c1,c2; |
| |
NODE n,r,r0; |
| |
|
| |
if ( !c ) |
| |
return mkfnode(1,I_FORMULA,NULLP); |
| |
else { |
| |
fnode_coef_body(f,&c1,&b1); |
| |
arf_mul(CO,c,c1,&c2); |
| |
if ( UNIQ(c2) ) return b1; |
| |
else { |
| |
cc = mkfnode(1,I_FORMULA,c2); |
| |
if ( fnode_is_number(b1) ) { |
| |
if ( !fnode_is_one(b1) ) |
| |
error("nfnode_mul_coef : cannot happen"); |
| |
else |
| |
return cc; |
| |
} else if ( IS_NARYMUL(b1) ) { |
| |
MKNODE(n,cc,FA1(b1)); |
| |
return fnode_node_to_nary(mulfs,n); |
| |
} else if ( expand && IS_NARYADD(b1) ) { |
| |
for ( r0 = 0, n = (NODE)FA1(b1); n; n = NEXT(n) ) { |
| |
NEXTNODE(r0,r); |
| |
BDY(r) = nfnode_mul_coef(c2,BDY(n),expand); |
| |
} |
| |
if ( r0 ) NEXT(r) = 0; |
| |
return fnode_node_to_nary(addfs,r0); |
| |
} else |
| |
return fnode_node_to_nary(mulfs,mknode(2,cc,b1)); |
| |
} |
| |
} |
| |
} |
| |
|
| |
void fnode_coef_body(FNODE f,Obj *cp,FNODE *bp) |
| |
{ |
| |
FNODE c; |
| |
|
| |
if ( fnode_is_coef(f) ) { |
| |
*cp = (Obj)eval(f); *bp = mkfnode(1,I_FORMULA,ONE); |
| |
} else if ( IS_NARYMUL(f) ) { |
| |
c=(FNODE)BDY((NODE)FA1(f)); |
| |
if ( fnode_is_coef(c) ) { |
| |
*cp = (Obj)eval(c); |
| |
*bp = fnode_node_to_nary(mulfs,NEXT((NODE)FA1(f))); |
| } else { |
} else { |
| c = (Num)ONE; |
*cp = (Obj)ONE; *bp = f; |
| b = g; |
|
| } |
} |
| } else { |
} else { |
| c = (Num)ONE; |
*cp = (Obj)ONE; *bp = f; |
| b = g; |
|
| } |
} |
| |
} |
| |
|
| for ( prev = 0, cur = r; cur; prev = cur, cur = NEXT(cur) ) { |
int nfnode_weight(struct wtab *tab,FNODE f) |
| a = compfnode(b,cur->body2); |
{ |
| if ( a > 0 ) { |
NODE n; |
| MKNODE2(t,c,b,cur); |
int w,w1; |
| if ( !prev ) |
int i; |
| return t; |
Q a2; |
| |
V v; |
| |
|
| |
switch ( f->id ) { |
| |
case I_FORMULA: |
| |
if ( fnode_is_coef(f) ) return 0; |
| |
else if ( fnode_is_var(f) ) { |
| |
if ( !tab ) return 0; |
| |
v = VR((P)FA0(f)); |
| |
for ( i = 0; tab[i].v; i++ ) |
| |
if ( v == tab[i].v ) return tab[i].w; |
| |
return 0; |
| |
} else return 0; |
| |
|
| |
/* XXX */ |
| |
case I_PVAR: return 1; |
| |
/* XXX */ |
| |
case I_FUNC: I_FUNC: I_FUNC_QARG: |
| |
/* w(f) = 1 */ |
| |
/* w(f(a1,...,an)=w(a1)+...+w(an) */ |
| |
n = FA0((FNODE)FA1(f)); |
| |
for ( w = 0; n; n = NEXT(n) ) |
| |
w += nfnode_weight(tab,BDY(n)); |
| |
return w; |
| |
case I_NARYOP: |
| |
n = (NODE)FA1(f); |
| |
if ( IS_NARYADD(f) ) |
| |
for ( w = nfnode_weight(tab,BDY(n)), |
| |
n = NEXT(n); n; n = NEXT(n) ) { |
| |
w1 = nfnode_weight(tab,BDY(n)); |
| |
w = MAX(w,w1); |
| |
} |
| |
else |
| |
for ( w = 0; n; n = NEXT(n) ) |
| |
w += nfnode_weight(tab,BDY(n)); |
| |
return w; |
| |
case I_BOP: |
| |
/* must be binary power */ |
| |
/* XXX w(2^x)=0 ? */ |
| |
if ( fnode_is_rational(FA2(f)) ) { |
| |
a2 = (Q)eval(FA2(f)); |
| |
w = QTOS(a2); |
| |
} else |
| |
w = nfnode_weight(tab,FA2(f)); |
| |
return nfnode_weight(tab,FA1(f))*w; |
| |
default: |
| |
error("nfnode_weight : not_implemented"); |
| |
} |
| |
} |
| |
|
| |
int nfnode_comp(FNODE f1,FNODE f2) |
| |
{ |
| |
int w1,w2; |
| |
|
| |
if ( qt_weight_tab ) { |
| |
w1 = nfnode_weight(qt_weight_tab,f1); |
| |
w2 = nfnode_weight(qt_weight_tab,f2); |
| |
if ( w1 > w2 ) return 1; |
| |
if ( w1 < w2 ) return -1; |
| |
} |
| |
return nfnode_comp_lex(f1,f2); |
| |
} |
| |
|
| |
int nfnode_comp_lex(FNODE f1,FNODE f2) |
| |
{ |
| |
NODE n1,n2; |
| |
int r,i1,i2,ret; |
| |
char *nm1,*nm2; |
| |
FNODE b1,b2,e1,e2,g,a1,a2,fn1,fn2,h1,h2; |
| |
Num ee,ee1; |
| |
Obj c1,c2; |
| |
int w1,w2; |
| |
|
| |
if ( IS_NARYADD(f1) || IS_NARYADD(f2) ) { |
| |
f1 = to_naryadd(f1); f2 = to_naryadd(f2); |
| |
n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2); |
| |
for ( ; n1 && n2; n1 = NEXT(n1), n2 = NEXT(n2) ) { |
| |
r = nfnode_comp_lex(BDY(n1),BDY(n2)); |
| |
if ( r ) return r; |
| |
} |
| |
if ( !n1 && !n2 ) return 0; |
| |
h1 = n1 ? (FNODE)BDY(n1) : mkfnode(1,I_FORMULA,NULLP); |
| |
h2 = n2 ? (FNODE)BDY(n2) : mkfnode(1,I_FORMULA,NULLP); |
| |
return nfnode_comp_lex(h1,h2); |
| |
} |
| |
if ( IS_NARYMUL(f1) || IS_NARYMUL(f2) ) { |
| |
fnode_coef_body(f1,&c1,&b1); |
| |
fnode_coef_body(f2,&c2,&b2); |
| |
if ( !compfnode(b1,b2) ) return arf_comp(CO,c1,c2); |
| |
b1 = to_narymul(b1); b2 = to_narymul(b2); |
| |
n1 = (NODE)FA1(b1); n2 = (NODE)FA1(b2); |
| |
for ( ; n1 && n2; n1 = NEXT(n1), n2 = NEXT(n2) ) { |
| |
r = nfnode_comp_lex(BDY(n1),BDY(n2)); |
| |
if ( r ) return r; |
| |
} |
| |
if ( !n1 && !n2 ) return 0; |
| |
h1 = n1 ? (FNODE)BDY(n1) : mkfnode(1,I_FORMULA,ONE); |
| |
h2 = n2 ? (FNODE)BDY(n2) : mkfnode(1,I_FORMULA,ONE); |
| |
return nfnode_comp_lex(h1,h2); |
| |
} |
| |
if ( IS_BINARYPWR(f1) || IS_BINARYPWR(f2) ) { |
| |
fnode_base_exp(f1,&b1,&e1); |
| |
fnode_base_exp(f2,&b2,&e2); |
| |
if ( r = nfnode_comp_lex(b1,b2) ) { |
| |
if ( r > 0 ) |
| |
return nfnode_comp_lex(e1,mkfnode(1,I_FORMULA,NULLP)); |
| |
else if ( r < 0 ) |
| |
return nfnode_comp_lex(mkfnode(1,I_FORMULA,NULLP),e2); |
| |
} else return nfnode_comp_lex(e1,e2); |
| |
} |
| |
|
| |
/* now, IDs of f1 and f2 must be I_FORMULA, I_FUNC, I_IFUNC or I_PVAR */ |
| |
/* I_IFUNC > I_PVAR > I_FUNC=I_FUNC_QARG > I_FORMULA */ |
| |
switch ( f1->id ) { |
| |
case I_FORMULA: |
| |
switch ( f2->id ) { |
| |
case I_FORMULA: |
| |
return arf_comp(qt_current_ord?qt_current_ord:CO,FA0(f1),FA0(f2)); |
| |
case I_FUNC: case I_IFUNC: case I_PVAR: |
| |
return -1; |
| |
default: |
| |
error("nfnode_comp_lex : undefined"); |
| |
} |
| |
break; |
| |
case I_FUNC: case I_FUNC_QARG: |
| |
switch ( f2->id ) { |
| |
case I_FORMULA: |
| |
return 1; |
| |
case I_PVAR: case I_IFUNC: |
| |
return -1; |
| |
case I_FUNC: case I_FUNC_QARG: |
| |
nm1 = ((FUNC)FA0(f1))->name; nm2 = ((FUNC)FA0(f2))->name; |
| |
r = strcmp(nm1,nm2); |
| |
if ( r > 0 ) return 1; |
| |
else if ( r < 0 ) return -1; |
| |
else { |
| |
/* compare args */ |
| |
n1 = FA0((FNODE)FA1(f1)); n2 = FA0((FNODE)FA1(f2)); |
| |
while ( n1 && n2 ) |
| |
if ( r = nfnode_comp_lex(BDY(n1),BDY(n2)) ) return r; |
| |
else { |
| |
n1 = NEXT(n1); n2 = NEXT(n2); |
| |
} |
| |
return n1?1:(n2?-1:0); |
| |
} |
| |
break; |
| |
default: |
| |
error("nfnode_comp_lex : undefined"); |
| |
} |
| |
case I_PVAR: |
| |
switch ( f2->id ) { |
| |
case I_FORMULA: case I_FUNC: case I_FUNC_QARG: |
| |
return 1; |
| |
case I_IFUNC: |
| |
return -1; |
| |
case I_PVAR: |
| |
i1 = (int)FA0(f1); i2 = (int)FA0(f2); |
| |
if ( i1 > i2 ) return 1; |
| |
else if ( i1 < i2 ) return -1; |
| |
else return 0; |
| |
default: |
| |
error("nfnode_comp_lex : undefined"); |
| |
} |
| |
break; |
| |
case I_IFUNC: |
| |
switch ( f2->id ) { |
| |
case I_FORMULA: case I_FUNC: case I_FUNC_QARG: case I_PVAR: |
| |
return 1; |
| |
case I_IFUNC: |
| |
i1 = (int)FA0((FNODE)FA0(f1)); |
| |
i2 = (int)FA0((FNODE)FA0(f2)); |
| |
if ( i1 > i2 ) return 1; |
| |
else if ( i1 < i2 ) return -1; |
| |
else { |
| |
/* compare args */ |
| |
n1 = FA0((FNODE)FA1(f1)); n2 = FA0((FNODE)FA1(f2)); |
| |
while ( n1 && n2 ) |
| |
if ( r = nfnode_comp_lex(BDY(n1),BDY(n2)) ) return r; |
| |
else { |
| |
n1 = NEXT(n1); n2 = NEXT(n2); |
| |
} |
| |
return n1?1:(n2?-1:0); |
| |
} |
| |
break; |
| |
|
| |
default: |
| |
error("nfnode_comp_lex : undefined"); |
| |
} |
| |
break; |
| |
default: |
| |
error("nfnode_comp_lex : undefined"); |
| |
} |
| |
} |
| |
|
| |
NODE append_node(NODE a1,NODE a2) |
| |
{ |
| |
NODE t,t0; |
| |
|
| |
if ( !a1 ) |
| |
return a2; |
| |
else { |
| |
for ( t0 = 0; a1; a1 = NEXT(a1) ) { |
| |
NEXTNODE(t0,t); BDY(t) = BDY(a1); |
| |
} |
| |
NEXT(t) = a2; |
| |
return t0; |
| |
} |
| |
} |
| |
|
| |
int nfnode_match(FNODE f,FNODE pat,NODE *rp) |
| |
{ |
| |
NODE m,m1,m2,base,exp,fa,pa,n; |
| |
LIST l; |
| |
QUOTE qp,qf; |
| |
FNODE fbase,fexp,a,fh; |
| |
FUNC ff,pf; |
| |
int r; |
| |
|
| |
if ( !pat ) |
| |
if ( !f ) { |
| |
*rp = 0; |
| |
return 1; |
| |
} else |
| |
return 0; |
| |
else if ( !f ) |
| |
return 0; |
| |
switch ( pat->id ) { |
| |
case I_PVAR: |
| |
/* [[pat,f]] */ |
| |
*rp = mknode(1,mknode(2,(int)FA0(pat),f)); |
| |
return 1; |
| |
|
| |
case I_FORMULA: |
| |
if ( f->id == I_FORMULA && !arf_comp(CO,(Obj)FA0(f),(Obj)FA0(pat)) ) { |
| |
*rp = 0; return 1; |
| |
} else |
| |
return 0; |
| |
|
| |
case I_BOP: |
| |
/* OPNAME should be "^" */ |
| |
if ( !IS_BINARYPWR(pat) ) |
| |
error("nfnode_match : invalid BOP"); |
| |
if ( IS_BINARYPWR(f) ) { |
| |
fbase = FA1(f); fexp = FA2(f); |
| |
} else { |
| |
fbase = f; fexp = mkfnode(1,I_FORMULA,ONE); |
| |
} |
| |
if ( !nfnode_match(fbase,FA1(pat),&base) ) return 0; |
| |
a = rewrite_fnode(FA2(pat),base,0); |
| |
if ( !nfnode_match(fexp,a,&exp) ) return 0; |
| else { |
else { |
| NEXT(prev) = t; return r; |
*rp = append_node(base,exp); |
| |
return 1; |
| } |
} |
| } else if ( a == 0 ) { |
break; |
| addnum(0,cur->body1,c,&c1); |
|
| if ( !c1 ) { |
case I_FUNC: case I_IFUNC: |
| if ( !prev ) |
if ( f->id != I_FUNC ) return 0; |
| return NEXT(cur); |
ff = (FUNC)FA0(f); |
| else { |
if ( pat->id == I_FUNC ) { |
| NEXT(prev) = NEXT(cur); return r; |
pf = (FUNC)FA0(pat); |
| } |
if ( strcmp(ff->fullname,pf->fullname) ) return 0; |
| |
m = 0; |
| } else { |
} else { |
| cur->body1 = c1; return r; |
/* XXX : I_FUNC_HEAD is a dummy id to pass FUNC */ |
| |
fh = mkfnode(1,I_FUNC_HEAD,FA0(f)); |
| |
m = mknode(1,mknode(2,FA0((FNODE)FA0(pat)),fh),NULLP); |
| } |
} |
| |
/* FA1(f) and FA1(pat) are I_LIST */ |
| |
fa = (NODE)FA0((FNODE)FA1(f)); |
| |
pa = (NODE)FA0((FNODE)FA1(pat)); |
| |
while ( fa && pa ) { |
| |
a = rewrite_fnode(BDY(pa),m,0); |
| |
if ( !nfnode_match(BDY(fa),a,&m1) ) return 0; |
| |
m = append_node(m1,m); |
| |
fa = NEXT(fa); pa = NEXT(pa); |
| |
} |
| |
if ( fa || pa ) return 0; |
| |
else { |
| |
*rp = m; |
| |
return 1; |
| |
} |
| |
|
| |
case I_NARYOP: |
| |
if ( IS_NARYADD(pat) ) |
| |
return nfnode_match_naryadd(f,pat,rp); |
| |
else if ( IS_NARYMUL(pat) ) |
| |
return nfnode_match_narymul(f,pat,rp); |
| |
else |
| |
error("nfnode_match : invalid NARYOP"); |
| |
break; |
| |
|
| |
default: |
| |
error("nfnode_match : invalid pattern"); |
| |
} |
| |
} |
| |
|
| |
/* remove i-th element */ |
| |
|
| |
FNODE fnode_removeith_naryadd(FNODE p,int i) |
| |
{ |
| |
int k,l; |
| |
NODE t,r0,r,a; |
| |
|
| |
a = (NODE)FA1(p); |
| |
l = length(a); |
| |
if ( i < 0 || i >= l ) error("fnode_removeith_naryadd: invalid index"); |
| |
else if ( i == 0 ) |
| |
return fnode_node_to_nary(addfs,NEXT(a)); |
| |
else { |
| |
for ( r0 = 0, k = 0, t = a; k < i; k++, t = NEXT(t) ) { |
| |
NEXTNODE(r0,r); |
| |
BDY(r) = BDY(t); |
| } |
} |
| |
NEXT(r) = NEXT(t); |
| |
return fnode_node_to_nary(addfs,r0); |
| } |
} |
| MKNODE2(t,c,b,0); |
|
| if ( !r ) |
} |
| return t; |
|
| |
/* a0,...,a(i-1) */ |
| |
FNODE fnode_left_narymul(FNODE p,int i) |
| |
{ |
| |
int k,l; |
| |
NODE t,r0,r,a; |
| |
|
| |
a = (NODE)FA1(p); |
| |
l = length(a); |
| |
if ( i < 0 || i >= l ) error("fnode_left_narymul : invalid index"); |
| |
if ( i == 0 ) return 0; |
| |
else if ( i == 1 ) return (FNODE)BDY(a); |
| else { |
else { |
| NEXT(prev) = t; return r; |
for ( r0 = 0, k = 0, t = a; k < i; k++, t = NEXT(t) ) { |
| |
NEXTNODE(r0,r); |
| |
BDY(r) = BDY(t); |
| |
} |
| |
NEXT(r) = 0; |
| |
return fnode_node_to_nary(mulfs,r0); |
| } |
} |
| } |
} |
| |
|
| FNODE fnode_simplify_mul(FNODE f) |
/* a(i+1),...,a(l-1) */ |
| |
FNODE fnode_right_narymul(FNODE p,int i) |
| { |
{ |
| int l,i,j; |
NODE a,t; |
| FNODE *b; |
int l,k; |
| Obj *e; |
|
| NODE n,t,r,r1; |
|
| FNODE g,base; |
|
| QUOTE q; |
|
| Obj exp,exp1; |
|
| Num c,c1; |
|
| |
|
| n = (NODE)FA1(f); |
a = (NODE)FA1(p); |
| for ( l = 0, t = n; t; t = NEXT(t), l++ ); |
l = length(a); |
| b = (FNODE *)MALLOC(l*sizeof(FNODE)); |
if ( i < 0 || i >= l ) error("fnode_right_narymul : invalid index"); |
| e = (Obj *)MALLOC(l*sizeof(Obj)); |
if ( i == l-1 ) return 0; |
| c = (Num)ONE; |
else { |
| for ( i = 0, t = n; t; t = NEXT(t) ) { |
for ( k = 0, t = a; k <= i; k++, t = NEXT(t) ); |
| g = (FNODE)BDY(t); |
return fnode_node_to_nary(mulfs,t); |
| if ( fnode_is_number(g) ) { |
} |
| if ( fnode_is_zero(g) ) |
} |
| return mkfnode(1,I_FORMULA,0); |
|
| else { |
int nfnode_match_naryadd(FNODE f,FNODE p,NODE *rp) |
| mulnum(0,c,(Num)eval(g),&c1); c = c1; |
{ |
| |
int fl,pl,fi,pi; |
| |
NODE fa,pa,t,s,m,m1; |
| |
FNODE fr,pr,prr,pivot; |
| |
|
| |
f = to_naryadd(f); |
| |
fa = (NODE)FA1(f); fl = length(fa); |
| |
pa = (NODE)FA1(p); pl = length(pa); |
| |
if ( fl < pl ) return 0; |
| |
else if ( pl == 1 ) { |
| |
if ( fl == 1 ) |
| |
return nfnode_match(BDY(fa),BDY(pa),rp); |
| |
else |
| |
return 0; |
| |
} else { |
| |
for ( t = pa, pi = 0; t; t = NEXT(t), pi++ ) |
| |
if ( ((FNODE)BDY(t))->id != I_PVAR ) break; |
| |
if ( !t ) { |
| |
/* all are I_PVAR */ |
| |
m = 0; |
| |
for ( t = pa, s = fa; NEXT(t); t = NEXT(t), s = NEXT(s) ) { |
| |
nfnode_match(BDY(s),BDY(t),&m1); |
| |
m = append_node(m1,m); |
| } |
} |
| |
if ( !NEXT(s) ) |
| |
fr = (FNODE)BDY(s); |
| |
else |
| |
fr = mkfnode(2,I_NARYOP,FA0(f),s); |
| |
nfnode_match(fr,BDY(t),&m1); |
| |
*rp = append_node(m1,m); |
| |
return 1; |
| } else { |
} else { |
| if ( g->id == I_MINUS ) { |
pivot = (FNODE)BDY(t); |
| chsgnnum(c,&c1); c = c1; |
pr = fnode_removeith_naryadd(p,pi); |
| g = FA0(g); |
for ( s = fa, fi = 0; s; s = NEXT(s), fi++ ) { |
| |
if ( nfnode_match(BDY(s),pivot,&m) ) { |
| |
fr = fnode_removeith_naryadd(f,fi); |
| |
prr = rewrite_fnode(pr,m,0); |
| |
if ( nfnode_match(fr,prr,&m1) ) { |
| |
*rp = append_node(m,m1); |
| |
return 1; |
| |
} |
| |
} |
| } |
} |
| if ( g->id == I_BOP && ((ARF)FA0(g))->name[0] == '^' ) { |
return 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); |
int nfnode_match_narymul(FNODE f,FNODE p,NODE *rp) |
| return g; |
{ |
| |
int fl,pl,fi,pi; |
| |
NODE fa,pa,t,s,m,m1; |
| |
FNODE fr,pr,pleft,pleft1,pright,pright1,fleft,fright,pivot; |
| |
|
| |
f = to_narymul(f); |
| |
fa = (NODE)FA1(f); fl = length(fa); |
| |
pa = (NODE)FA1(p); pl = length(pa); |
| |
if ( fl < pl ) return 0; |
| |
else if ( pl == 1 ) { |
| |
if ( fl == 1 ) |
| |
return nfnode_match(BDY(fa),BDY(pa),rp); |
| |
else |
| |
return 0; |
| } else { |
} else { |
| r = 0; |
for ( t = pa, pi = 0; t; t = NEXT(t), pi++ ) |
| for ( j = i-1; j >= 0; j-- ) { |
if ( ((FNODE)BDY(t))->id != I_PVAR ) break; |
| if ( UNIQ(e[j]) ) |
if ( !t ) { |
| g = b[j]; |
/* all are I_PVAR */ |
| else { |
m = 0; |
| objtoquote(e[j],&q); |
for ( t = pa, s = fa; NEXT(t); t = NEXT(t), s = NEXT(s) ) { |
| g = mkfnode(3,I_BOP,pwrfs,b[j],BDY(q)); |
pr = rewrite_fnode(BDY(t),m,0); |
| |
if ( !nfnode_match(BDY(s),pr,&m1) ) return 0; |
| |
m = append_node(m1,m); |
| } |
} |
| MKNODE(r1,g,r); r = r1; |
if ( !NEXT(s) ) |
| |
fr = (FNODE)BDY(s); |
| |
else |
| |
fr = mkfnode(2,I_NARYOP,FA0(f),s); |
| |
pr = rewrite_fnode(BDY(t),m,0); |
| |
if ( !nfnode_match(fr,pr,&m1) ) return 0; |
| |
*rp = append_node(m1,m); |
| |
return 1; |
| |
} else { |
| |
pivot = (FNODE)BDY(t); |
| |
pleft = fnode_left_narymul(p,pi); |
| |
pright = fnode_right_narymul(p,pi); |
| |
/* XXX : incomplete */ |
| |
for ( s = fa, fi = 0; s; s = NEXT(s), fi++ ) { |
| |
if ( fi < pi ) continue; |
| |
if ( nfnode_match(BDY(s),pivot,&m) ) { |
| |
fleft = fnode_left_narymul(f,fi); |
| |
pleft1 = rewrite_fnode(pleft,m,0); |
| |
if ( nfnode_match(fleft,pleft1,&m1) ) { |
| |
m = append_node(m1,m); |
| |
fright = fnode_right_narymul(f,fi); |
| |
pright1 = rewrite_fnode(pright,m,0); |
| |
if ( nfnode_match(fright,pright1,&m1) ) { |
| |
*rp = append_node(m1,m); |
| |
return 1; |
| |
} |
| |
} |
| |
} |
| |
} |
| |
return 0; |
| } |
} |
| g = mkfnode(1,I_FORMULA,c); |
} |
| MKNODE(r1,g,r); r = r1; |
} |
| return mkfnode(2,I_NARYOP,FA0(f),r); |
|
| |
NODE nfnode_pvars(FNODE pat,NODE found) |
| |
{ |
| |
int ind; |
| |
NODE prev,t; |
| |
int *pair; |
| |
|
| |
switch ( pat->id ) { |
| |
case I_PVAR: |
| |
ind = (int)FA0(pat); |
| |
for ( prev = 0, t = found; t; prev = t, t = NEXT(t) ) { |
| |
pair = (int *)BDY(t); |
| |
if ( pair[0] == ind ) { |
| |
pair[1]++; |
| |
return found; |
| |
} |
| |
} |
| |
pair = (int *)MALLOC_ATOMIC(sizeof(int)*2); |
| |
pair[0] = ind; pair[1] = 1; |
| |
if ( !prev ) |
| |
MKNODE(found,pair,0); |
| |
else |
| |
MKNODE(NEXT(prev),pair,0); |
| |
return found; |
| |
|
| |
case I_FORMULA: |
| |
return found; |
| |
|
| |
case I_BOP: |
| |
/* OPNAME should be "^" */ |
| |
if ( !IS_BINARYPWR(pat) ) |
| |
error("nfnode_pvar : invalid BOP"); |
| |
found = nfnode_pvars(FA1(pat),found); |
| |
found = nfnode_pvars(FA2(pat),found); |
| |
return found; |
| |
|
| |
case I_FUNC: |
| |
t = (NODE)FA0((FNODE)FA1(pat)); |
| |
for ( ; t; t = NEXT(t) ) |
| |
found = nfnode_pvars(BDY(t),found); |
| |
return found; |
| |
|
| |
case I_NARYOP: |
| |
t = (NODE)FA1(pat); |
| |
for ( ; t; t = NEXT(t) ) |
| |
found = nfnode_pvars(BDY(t),found); |
| |
return found; |
| |
|
| |
default: |
| |
error("nfnode_match : invalid pattern"); |
| } |
} |
| } |
} |
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to strobj.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / builtin