![]() ![]() | ![]() |
version 1.71, 2005/10/12 14:43:36 | version 1.77, 2005/10/15 07:40:59 | ||
---|---|---|---|
|
|
||
* 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.76 2005/10/15 02:34:13 noro Exp $ | ||
*/ | */ | ||
#include "ca.h" | #include "ca.h" | ||
#include "parse.h" | #include "parse.h" | ||
|
|
||
}; | }; | ||
#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)=='*')) | |||
extern char *parse_strp; | extern char *parse_strp; | ||
|
|
||
{"quote_is_function",Pquote_is_function,1}, | {"quote_is_function",Pquote_is_function,1}, | ||
{"quote_is_dependent",Pquote_is_dependent,2}, | {"quote_is_dependent",Pquote_is_dependent,2}, | ||
{"quote_normalize",Pquote_normalize,1}, | {"quote_normalize",Pquote_normalize,-2}, | ||
{"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}, | ||
|
|
||
} | } | ||
FNODE partial_eval(FNODE), fnode_to_nary(FNODE), fnode_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) | ||
{ | { | ||
|
|
||
MKQUOTE(*rp,f); | MKQUOTE(*rp,f); | ||
} | } | ||
FNODE fnode_apply(FNODE f,FNODE (*func)()); | FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand); | ||
FNODE fnode_normalize(FNODE f); | FNODE fnode_normalize(FNODE f,int expand); | ||
FNODE fnode_normalize_nary(FNODE f); | |||
void Pquote_normalize(NODE arg,QUOTE *rp) | void Pquote_normalize(NODE arg,QUOTE *rp) | ||
{ | { | ||
QUOTE q,r; | QUOTE q,r; | ||
FNODE f; | FNODE f; | ||
int expand,ac; | |||
ac = argc(arg); | |||
if ( !ac ) error("quote_normalize : invalid argument"); | |||
q = (QUOTE)ARG0(arg); | q = (QUOTE)ARG0(arg); | ||
expand = ac==2 && ARG1(arg); | |||
if ( !q || OID(q) != O_QUOTE ) { | if ( !q || OID(q) != O_QUOTE ) { | ||
*rp = q; | *rp = q; | ||
return; | return; | ||
} else { | } else { | ||
#if 0 | f = fnode_normalize(BDY(q),expand); | ||
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; | ||
} | } | ||
|
|
||
} | } | ||
} | } | ||
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; | ||
|
|
||
} | } | ||
} | } | ||
FNODE fnode_normalize(FNODE f) | FNODE fnode_normalize_add(FNODE a1,FNODE a2,int expand); | ||
FNODE fnode_normalize_mul(FNODE a1,FNODE a2,int expand); | |||
FNODE fnode_normalize_pwr(FNODE a1,FNODE a2,int expand); | |||
FNODE fnode_normalize_mul_coef(Num c,FNODE f,int expand); | |||
FNODE fnode_expand_pwr(FNODE f,int n); | |||
FNODE to_narymul(FNODE f); | |||
FNODE to_naryadd(FNODE f); | |||
FNODE fnode_node_to_naryadd(NODE n); | |||
FNODE fnode_node_to_narymul(NODE n); | |||
void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep); | |||
void fnode_coef_body(FNODE f,Num *cp,FNODE *bp); | |||
FNODE fnode_normalize(FNODE f,int expand) | |||
{ | { | ||
FNODE a2,mone; | FNODE a1,a2,mone,r,b2; | ||
Q q; | |||
NODE n; | NODE n; | ||
Q q; | |||
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)); | return fnode_normalize(FA0(f),expand); | ||
case I_MINUS: | case I_MINUS: | ||
f = fnode_normalize(FA0(f)); | return fnode_normalize_mul_coef((Num)q, | ||
return f->id==I_MINUS ? FA0(f) : mkfnode(1,I_MINUS,f); | fnode_normalize(FA0(f),expand),expand); | ||
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 '+': | |||
return fnode_normalize_add(a1,a2,expand); | |||
case '-': | case '-': | ||
a2 = mkfnode(1,I_MINUS,FA2(f)); | a2 = fnode_normalize_mul_coef((Num)q,a2,expand); | ||
return mkfnode(3,I_BOP,addfs,FA1(f),a2); | return fnode_normalize_add(a1,a2,expand); | ||
case '*': | |||
return fnode_normalize_mul(a1,a2,expand); | |||
case '/': | case '/': | ||
STOQ(-1,q); | a2 = fnode_normalize_pwr(a2,mone,expand); | ||
mone = mkfnode(1,I_FORMULA,q); | return fnode_normalize_mul(a1,a2,expand); | ||
a2 = mkfnode(3,I_BOP,pwrfs,FA2(f),mone); | case '^': | ||
return mkfnode(3,I_BOP,mulfs,FA1(f),a2); | return fnode_normalize_pwr(a1,a2,expand); | ||
default: | default: | ||
return f; | return mkfnode(3,I_BOP,FA0(f),a1,a2); | ||
} | } | ||
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 = fnode_normalize_add(r,a1,expand); | |||
} | |||
return r; | |||
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 = fnode_normalize_mul(r,a1,expand); | |||
} | |||
return r; | |||
default: | default: | ||
return f; | error("fnode_normallize : cannot happen"); | ||
} | } | ||
break; | |||
default: | default: | ||
return fnode_apply(f,fnode_normalize_nary); | return fnode_apply(f,fnode_normalize,expand); | ||
break; | |||
} | } | ||
} | } | ||
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; | ||
|
|
||
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; | ||
|
|
||
return r; | return r; | ||
} | } | ||
NODE2 fnode_add_monomial(NODE2 s0,FNODE g); | FNODE fnode_normalize_add(FNODE f1,FNODE f2,int expand) | ||
FNODE fnode_simplify_add(FNODE f) | |||
{ | { | ||
NODE n; | NODE n1,n2,r0,r; | ||
NODE r0,r,t,u; | FNODE b1,b2; | ||
NODE2 s,s0; | int s; | ||
FNODE g,m; | Num c1,c2,c; | ||
QUOTE q; | |||
n = (NODE)FA1(f); | if ( IS_ZERO(f1) ) return f2; | ||
s0 = 0; | else if ( IS_ZERO(f2) ) return f1; | ||
for ( t = n; t; t = NEXT(t) ) { | f1 = to_naryadd(f1); f2 = to_naryadd(f2); | ||
g = (FNODE)BDY(t); | n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2); | ||
s0 = fnode_add_monomial(s0,g); | r0 = 0; | ||
} | while ( n1 && n2 ) { | ||
if ( !s0 ) | fnode_coef_body(BDY(n1),&c1,&b1); fnode_coef_body(BDY(n2),&c2,&b2); | ||
return mkfnode(1,I_FORMULA,0); | if ( (s = compfnode(b1,b2)) > 0 ) { | ||
else { | NEXTNODE(r0,r); BDY(r) = BDY(n1); n1 = NEXT(n1); | ||
for ( s = s0, r0 = 0; s; s = NEXT(s) ) { | } else if ( s < 0 ) { | ||
NEXTNODE(r0,r); | NEXTNODE(r0,r); BDY(r) = BDY(n2); n2 = NEXT(n2); | ||
if ( UNIQ(s->body1) ) | } else { | ||
BDY(r) = s->body2; | addnum(0,c1,c2,&c); | ||
else if ( MUNIQ(s->body1) ) | if ( c ) { | ||
BDY(r) = mkfnode(1,I_MINUS,s->body2); | NEXTNODE(r0,r); BDY(r) = fnode_normalize_mul_coef(c,b1,expand); | ||
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); | |||
} | |||
} | } | ||
n1 = NEXT(n1); n2 = NEXT(n2); | |||
} | } | ||
if ( r0 ) NEXT(r) = 0; | |||
if ( length(r0) == 1 ) | |||
return (FNODE)BDY(r0); | |||
else | |||
return mkfnode(2,I_NARYOP,FA0(f),r0); | |||
} | } | ||
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_naryadd(r0); | |||
} | } | ||
NODE2 fnode_add_monomial(NODE2 r,FNODE g) | FNODE fnode_node_to_naryadd(NODE n) | ||
{ | { | ||
Num c,c1; | if ( !n ) return mkfnode(1,I_FORMULA,0); | ||
FNODE b; | else if ( !NEXT(n) ) return BDY(n); | ||
NODE arg; | else return mkfnode(2,I_NARYOP,addfs,n); | ||
NODE2 prev,cur,t; | } | ||
int a; | |||
if ( fnode_is_number(g) ) { | FNODE fnode_node_to_narymul(NODE n) | ||
c = (Num)eval(g); | { | ||
b = mkfnode(1,I_FORMULA,ONE); | if ( !n ) return mkfnode(1,I_FORMULA,ONE); | ||
} else if ( g->id == I_NARYOP && OPNAME(g) == '*' ) { | else if ( !NEXT(n) ) return BDY(n); | ||
arg = (NODE)FA1(g); | else return mkfnode(2,I_NARYOP,mulfs,n); | ||
if ( fnode_is_number(BDY(arg)) ) { | } | ||
c = (Num)eval(BDY(arg)); | |||
if ( length(arg) > 2 ) | FNODE fnode_normalize_mul(FNODE f1,FNODE f2,int expand) | ||
b = mkfnode(2,I_NARYOP,FA0(g),NEXT(arg)); | { | ||
else | NODE n1,n2,r0,r,r1; | ||
b = BDY(NEXT(arg)); | FNODE b1,b2,e1,e2,cc,t,t1; | ||
} else { | FNODE *m; | ||
c = (Num)ONE; | int s; | ||
b = g; | Num c1,c2,c,e; | ||
int l1,l,i,j; | |||
if ( IS_ZERO(f1) || IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,0); | |||
else if ( fnode_is_number(f1) ) | |||
return fnode_normalize_mul_coef((Num)eval(f1),f2,expand); | |||
else if ( fnode_is_number(f2) ) | |||
return fnode_normalize_mul_coef((Num)eval(f2),f1,expand); | |||
if ( expand && IS_NARYADD(f1) ) { | |||
t = mkfnode(1,I_FORMULA,0); | |||
for ( n1 = (NODE)FA1(f1); n1; n1 = NEXT(n1) ) { | |||
t1 = fnode_normalize_mul(BDY(n1),f2,expand); | |||
t = fnode_normalize_add(t,t1,expand); | |||
} | } | ||
} else { | return t; | ||
c = (Num)ONE; | |||
b = g; | |||
} | } | ||
if ( expand && IS_NARYADD(f2) ) { | |||
t = mkfnode(1,I_FORMULA,0); | |||
for ( n2 = (NODE)FA1(f2); n2; n2 = NEXT(n2) ) { | |||
t1 = fnode_normalize_mul(f1,BDY(n2),expand); | |||
t = fnode_normalize_add(t,t1,expand); | |||
} | |||
return t; | |||
} | |||
for ( prev = 0, cur = r; cur; prev = cur, cur = NEXT(cur) ) { | fnode_coef_body(f1,&c1,&b1); fnode_coef_body(f2,&c2,&b2); | ||
a = compfnode(b,cur->body2); | mulnum(0,c1,c2,&c); | ||
if ( a > 0 ) { | if ( !c ) return mkfnode(1,I_FORMULA,0); | ||
MKNODE2(t,c,b,cur); | |||
if ( !prev ) | |||
return t; | n1 = (NODE)FA1(to_narymul(b1)); n2 = (NODE)FA1(to_narymul(b2)); | ||
else { | l1 = length(n1); l = l1+length(n2); | ||
NEXT(prev) = t; return r; | m = (FNODE *)ALLOCA(l*sizeof(FNODE)); | ||
} | for ( r = n1, i = 0; i < l1; r = NEXT(r), i++ ) m[i] = BDY(r); | ||
} else if ( a == 0 ) { | for ( r = n2; r; r = NEXT(r) ) { | ||
addnum(0,cur->body1,c,&c1); | if ( i == 0 ) | ||
if ( !c1 ) { | m[i++] = BDY(r); | ||
if ( !prev ) | else { | ||
return NEXT(cur); | fnode_base_exp(m[i-1],&b1,&e1); fnode_base_exp(BDY(r),&b2,&e2); | ||
else { | if ( compfnode(b1,b2) ) break; | ||
NEXT(prev) = NEXT(cur); return r; | addnum(0,eval(e1),eval(e2),&e); | ||
} | if ( !e ) i--; | ||
} else { | else if ( UNIQ(e) ) | ||
cur->body1 = c1; return r; | m[i-1] = b1; | ||
} | else | ||
m[i-1] = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e)); | |||
} | } | ||
} | } | ||
MKNODE2(t,c,b,0); | for ( j = i-1; j >= 0; j-- ) { | ||
if ( !r ) | MKNODE(r1,m[j],r); r = r1; | ||
return t; | |||
else { | |||
NEXT(prev) = t; return r; | |||
} | } | ||
if ( !UNIQ(c) ) { | |||
cc = mkfnode(1,I_FORMULA,c); MKNODE(r1,cc,r); r = r1; | |||
} | |||
return fnode_node_to_narymul(r); | |||
} | } | ||
FNODE fnode_simplify_mul(FNODE f) | FNODE fnode_normalize_pwr(FNODE f1,FNODE f2,int expand) | ||
{ | { | ||
int l,i,j; | FNODE b,b1,e1,e,cc,r; | ||
FNODE *b; | |||
Obj *e; | |||
NODE n,t,r,r1; | |||
FNODE g,base; | |||
QUOTE q; | |||
Obj exp,exp1; | |||
Num c,c1; | Num c,c1; | ||
NODE arg,n; | |||
Q q; | |||
n = (NODE)FA1(f); | if ( IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,ONE); | ||
for ( l = 0, t = n; t; t = NEXT(t), l++ ); | else if ( IS_ZERO(f1) ) return mkfnode(1,I_FORMULA,0); | ||
b = (FNODE *)MALLOC(l*sizeof(FNODE)); | else if ( fnode_is_one(f2) ) return f1; | ||
e = (Obj *)MALLOC(l*sizeof(Obj)); | else if ( fnode_is_number(f1) ) | ||
c = (Num)ONE; | if ( fnode_is_integer(f2) ) { | ||
for ( i = 0, t = n; t; t = NEXT(t) ) { | pwrnum(0,(Num)eval(f1),(Num)eval(f2),&c); | ||
g = (FNODE)BDY(t); | return mkfnode(1,I_FORMULA,c); | ||
if ( fnode_is_number(g) ) { | } else | ||
if ( fnode_is_zero(g) ) | return mkfnode(3,I_BOP,pwrfs,f1,f2); | ||
return mkfnode(1,I_FORMULA,0); | else if ( IS_BINARYPWR(f1) ) { | ||
else { | b1 = FA1(f1); e1 = FA2(f1); | ||
mulnum(0,c,(Num)eval(g),&c1); c = c1; | e = fnode_normalize_mul(e1,f2,expand); | ||
} | if ( fnode_is_one(e) ) | ||
} else { | return b1; | ||
if ( g->id == I_MINUS ) { | else | ||
chsgnnum(c,&c1); c = c1; | return mkfnode(3,I_BOP,FA0(f1),b1,e); | ||
g = FA0(g); | } else if ( IS_NARYMUL(f1) && fnode_is_integer(f2) ) { | ||
} | fnode_coef_body(f1,&c1,&b1); | ||
if ( g->id == I_BOP && ((ARF)FA0(g))->name[0] == '^' ) { | pwrnum(0,(Num)c1,(Num)eval(f2),&c); | ||
base = FA1(g); | cc = mkfnode(1,I_FORMULA,c); | ||
exp = (Obj)eval(FA2(g)); | b = fnode_normalize_pwr(b1,f2,expand); | ||
} else { | if ( fnode_is_one(cc) ) | ||
base = g; exp = (Obj)ONE; | return b; | ||
} | else | ||
if ( i > 0 && !compfnode(b[i-1],base) ) { | return fnode_node_to_narymul(mknode(2,cc,b)); | ||
arf_add(CO,e[i-1],exp,&exp1); | } else if ( expand && fnode_is_nonnegative_integer(f2) ) { | ||
if ( !exp1 ) | q = (Q)eval(f2); | ||
i--; | if ( PL(NM(q)) > 1 ) error("fnode_normalize_pwr : exponent too large"); | ||
return fnode_expand_pwr(f1,QTOS(q)); | |||
} else | |||
return mkfnode(3,I_BOP,pwrfs,f1,f2); | |||
} | |||
FNODE fnode_expand_pwr(FNODE f,int n) | |||
{ | |||
int n1; | |||
FNODE f1,f2; | |||
if ( !n ) return mkfnode(1,I_FORMULA,ONE); | |||
else if ( IS_ZERO(f) ) return mkfnode(1,I_FORMULA,0); | |||
else if ( n == 1 ) return f; | |||
else { | |||
n1 = n/2; | |||
f1 = fnode_expand_pwr(f,n1); | |||
f2 = fnode_normalize_mul(f1,f1,1); | |||
if ( n%2 ) f2 = fnode_normalize_mul(f2,f,1); | |||
return f2; | |||
} | |||
} | |||
/* f = b^e */ | |||
void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep) | |||
{ | |||
if ( IS_BINARYPWR(f) ) { | |||
*bp = FA1(f); *ep = FA2(f); | |||
} else { | |||
*bp = f; *ep = mkfnode(1,I_FORMULA,ONE); | |||
} | |||
} | |||
FNODE to_naryadd(FNODE f) | |||
{ | |||
FNODE r; | |||
NODE n; | |||
if ( IS_NARYADD(f) ) return f; | |||
NEWFNODE(r,2); r->id = I_NARYOP; | |||
FA0(r) = addfs; MKNODE(n,f,0); FA1(r) = n; | |||
return r; | |||
} | |||
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 fnode_normalize_mul_coef(Num c,FNODE f,int expand) | |||
{ | |||
FNODE b1,cc; | |||
Num c1,c2; | |||
NODE n,r,r0; | |||
if ( !c ) | |||
return mkfnode(I_FORMULA,0); | |||
else { | |||
fnode_coef_body(f,&c1,&b1); | |||
mulnum(0,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("fnode_normalize_mul_coef : cannot happen"); | |||
else | else | ||
e[i-1] = exp1; | return cc; | ||
} else { | } else if ( IS_NARYMUL(b1) ) { | ||
b[i] = base; | MKNODE(n,cc,FA1(b1)); | ||
e[i] = exp; | return fnode_node_to_narymul(n); | ||
i++; | } else if ( expand && IS_NARYADD(b1) ) { | ||
} | for ( r0 = 0, n = (NODE)FA1(b1); n; n = NEXT(n) ) { | ||
NEXTNODE(r0,r); | |||
BDY(r) = fnode_normalize_mul_coef(c2,BDY(n),expand); | |||
} | |||
if ( r0 ) NEXT(r) = 0; | |||
return fnode_node_to_naryadd(r0); | |||
} else | |||
return fnode_node_to_narymul(mknode(2,cc,b1)); | |||
} | } | ||
} | } | ||
if ( !i ) { | } | ||
/* coeff only */ | |||
g = mkfnode(1,I_FORMULA,c); | void fnode_coef_body(FNODE f,Num *cp,FNODE *bp) | ||
return g; | { | ||
} else { | FNODE c; | ||
r = 0; | |||
for ( j = i-1; j >= 0; j-- ) { | if ( fnode_is_number(f) ) { | ||
if ( UNIQ(e[j]) ) | *cp = eval(f); *bp = mkfnode(1,I_FORMULA,ONE); | ||
g = b[j]; | } else if ( IS_NARYMUL(f) ) { | ||
else { | c=(FNODE)BDY((NODE)FA1(f)); | ||
objtoquote(e[j],&q); | if ( fnode_is_number(c) ) { | ||
g = mkfnode(3,I_BOP,pwrfs,b[j],BDY(q)); | *cp = eval(c); | ||
} | *bp = fnode_node_to_narymul(NEXT((NODE)FA1(f))); | ||
MKNODE(r1,g,r); r = r1; | } else { | ||
*cp = (Num)ONE; *bp = f; | |||
} | } | ||
g = mkfnode(1,I_FORMULA,c); | } else { | ||
MKNODE(r1,g,r); r = r1; | *cp = (Num)ONE; *bp = f; | ||
return mkfnode(2,I_NARYOP,FA0(f),r); | |||
} | } | ||
} | } |