version 1.111, 2005/12/18 01:44:16 |
version 1.114, 2005/12/19 01:31:43 |
|
|
* 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.110 2005/12/14 09:06:54 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.113 2005/12/18 06:54:28 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 1538 void fnodetotex_tb(FNODE f,TB tb) |
|
Line 1538 void fnodetotex_tb(FNODE f,TB tb) |
|
for ( args = NEXT(args); args; args = NEXT(args) ) { |
for ( args = NEXT(args); args; args = NEXT(args) ) { |
write_tb("+",tb); |
write_tb("+",tb); |
f1 = (FNODE)BDY(args); |
f1 = (FNODE)BDY(args); |
if ( fnode_is_var(f1) || IS_MUL(f1) ) |
/* if ( fnode_is_var(f1) || IS_MUL(f1) ) |
fnodetotex_tb(f1,tb); |
fnodetotex_tb(f1,tb); |
else { |
else */ { |
write_tb("(",tb); |
write_tb("(",tb); |
fnodetotex_tb(f1,tb); |
fnodetotex_tb(f1,tb); |
write_tb(")",tb); |
write_tb(")",tb); |
Line 2593 void Pnqt_weight(NODE arg,Q *rp) |
|
Line 2593 void Pnqt_weight(NODE arg,Q *rp) |
|
|
|
q = (QUOTE)ARG0(arg); f = (FNODE)BDY(q); |
q = (QUOTE)ARG0(arg); f = (FNODE)BDY(q); |
f = fnode_normalize(f,0); |
f = fnode_normalize(f,0); |
w = nfnode_weight(f); |
w = nfnode_weight(qt_weight_tab,f); |
STOQ(w,*rp); |
STOQ(w,*rp); |
} |
} |
|
|
Line 3017 FNODE nfnode_mul(FNODE f1,FNODE f2,int expand) |
|
Line 3017 FNODE nfnode_mul(FNODE f1,FNODE f2,int expand) |
|
m = (FNODE *)ALLOCA(l*sizeof(FNODE)); |
m = (FNODE *)ALLOCA(l*sizeof(FNODE)); |
for ( r = n1, i = 0; i < l1; r = NEXT(r), i++ ) m[i] = BDY(r); |
for ( r = n1, i = 0; i < l1; r = NEXT(r), i++ ) m[i] = BDY(r); |
for ( r = n2; r; r = NEXT(r) ) { |
for ( r = n2; r; r = NEXT(r) ) { |
if ( i == 0 || (expand == 2) ) |
if ( i == 0 ) |
m[i++] = BDY(r); |
m[i++] = BDY(r); |
else { |
else { |
fnode_base_exp(m[i-1],&b1,&e1); fnode_base_exp(BDY(r),&b2,&e2); |
fnode_base_exp(m[i-1],&b1,&e1); fnode_base_exp(BDY(r),&b2,&e2); |
if ( compfnode(b1,b2) ) break; |
if ( compfnode(b1,b2) ) break; |
arf_add(CO,eval(e1),eval(e2),&e); |
arf_add(CO,eval(e1),eval(e2),&e); |
if ( !e ) i--; |
if ( !e ) i--; |
else if ( UNIQ(e) ) |
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; |
m[i-1] = b1; |
else |
else |
m[i-1] = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e)); |
m[i-1] = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e)); |
Line 3230 int nfnode_weight(struct wtab *tab,FNODE f) |
|
Line 3240 int nfnode_weight(struct wtab *tab,FNODE f) |
|
case I_FORMULA: |
case I_FORMULA: |
if ( fnode_is_coef(f) ) return 0; |
if ( fnode_is_coef(f) ) return 0; |
else if ( fnode_is_var(f) ) { |
else if ( fnode_is_var(f) ) { |
|
if ( !tab ) return 0; |
v = VR((P)FA0(f)); |
v = VR((P)FA0(f)); |
for ( i = 0; tab[i].v; i++ ) |
for ( i = 0; tab[i].v; i++ ) |
if ( v == tab[i].v ) return tab[i].w; |
if ( v == tab[i].v ) return tab[i].w; |
return w; |
return 0; |
} else return 0; |
} else return 0; |
|
|
/* XXX */ |
/* XXX */ |
Line 3290 int nfnode_comp_lex(FNODE f1,FNODE f2) |
|
Line 3301 int nfnode_comp_lex(FNODE f1,FNODE f2) |
|
NODE n1,n2; |
NODE n1,n2; |
int r,i1,i2,ret; |
int r,i1,i2,ret; |
char *nm1,*nm2; |
char *nm1,*nm2; |
FNODE b1,b2,e1,e2,g,a1,a2,fn1,fn2; |
FNODE b1,b2,e1,e2,g,a1,a2,fn1,fn2,h1,h2; |
Num ee,ee1; |
Num ee,ee1; |
Obj c1,c2; |
Obj c1,c2; |
int w1,w2; |
int w1,w2; |
Line 3298 int nfnode_comp_lex(FNODE f1,FNODE f2) |
|
Line 3309 int nfnode_comp_lex(FNODE f1,FNODE f2) |
|
if ( IS_NARYADD(f1) || IS_NARYADD(f2) ) { |
if ( IS_NARYADD(f1) || IS_NARYADD(f2) ) { |
f1 = to_naryadd(f1); f2 = to_naryadd(f2); |
f1 = to_naryadd(f1); f2 = to_naryadd(f2); |
n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2); |
n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2); |
while ( n1 && n2 ) |
for ( ; n1 && n2; n1 = NEXT(n1), n2 = NEXT(n2) ) { |
if ( r = nfnode_comp_lex(BDY(n1),BDY(n2)) ) return r; |
r = nfnode_comp_lex(BDY(n1),BDY(n2)); |
else { |
if ( r ) return r; |
n1 = NEXT(n1); n2 = NEXT(n2); |
} |
} |
if ( !n1 && !n2 ) return 0; |
return n1?1:(n2?-1:0); |
h1 = n1 ? (FNODE)BDY(n1) : mkfnode(1,I_FORMULA,0); |
|
h2 = n2 ? (FNODE)BDY(n2) : mkfnode(1,I_FORMULA,0); |
|
return nfnode_comp_lex(h1,h2); |
} |
} |
if ( IS_NARYMUL(f1) || IS_NARYMUL(f2) ) { |
if ( IS_NARYMUL(f1) || IS_NARYMUL(f2) ) { |
fnode_coef_body(f1,&c1,&b1); |
fnode_coef_body(f1,&c1,&b1); |
Line 3311 int nfnode_comp_lex(FNODE f1,FNODE f2) |
|
Line 3324 int nfnode_comp_lex(FNODE f1,FNODE f2) |
|
if ( !compfnode(b1,b2) ) return arf_comp(CO,c1,c2); |
if ( !compfnode(b1,b2) ) return arf_comp(CO,c1,c2); |
b1 = to_narymul(b1); b2 = to_narymul(b2); |
b1 = to_narymul(b1); b2 = to_narymul(b2); |
n1 = (NODE)FA1(b1); n2 = (NODE)FA1(b2); |
n1 = (NODE)FA1(b1); n2 = (NODE)FA1(b2); |
while ( 1 ) { |
for ( ; n1 && n2; n1 = NEXT(n1), n2 = NEXT(n2) ) { |
while ( n1 && n2 && !compfnode(BDY(n1),BDY(n2)) ) { |
r = nfnode_comp_lex(BDY(n1),BDY(n2)); |
n1 = NEXT(n1); n2 = NEXT(n2); |
if ( r ) return r; |
} |
|
if ( !n1 || !n2 ) { |
|
return n1?1:(n2?-1:0); |
|
} |
|
fnode_base_exp(BDY(n1),&b1,&e1); |
|
fnode_base_exp(BDY(n2),&b2,&e2); |
|
|
|
if ( r = nfnode_comp_lex(b1,b2) ) { |
|
if ( r > 0 ) |
|
return nfnode_comp_lex(e1,mkfnode(1,I_FORMULA,0)); |
|
else if ( r < 0 ) |
|
return nfnode_comp_lex(mkfnode(1,I_FORMULA,0),e2); |
|
} else { |
|
n1 = NEXT(n1); n2 = NEXT(n2); |
|
if ( fnode_is_number(e1) && fnode_is_number(e2) ) { |
|
/* f1 = t b^e1 ... , f2 = t b^e2 ... */ |
|
subnum(0,eval(e1),eval(e2),&ee); |
|
r = compnum(0,ee,0); |
|
if ( r > 0 ) { |
|
g = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,ee)); |
|
MKNODE(n1,g,n1); |
|
} else if ( r < 0 ) { |
|
chsgnnum(ee,&ee1); |
|
g = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,ee1)); |
|
MKNODE(n2,g,n2); |
|
} |
|
} else { |
|
r = nfnode_comp_lex(e1,e2); |
|
if ( r > 0 ) return 1; |
|
else if ( r < 0 ) return -1; |
|
} |
|
} |
|
} |
} |
|
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) ) { |
if ( IS_BINARYPWR(f1) || IS_BINARYPWR(f2) ) { |
fnode_base_exp(f1,&b1,&e1); |
fnode_base_exp(f1,&b1,&e1); |