version 1.6, 2001/08/20 09:03:27 |
version 1.19, 2005/02/08 18:06:05 |
|
|
* 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/parse/arith.c,v 1.5 2000/12/11 09:28:03 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/arith.c,v 1.18 2004/12/18 16:50:10 saito Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 84 struct oAFUNC afunc[] = { |
|
Line 84 struct oAFUNC afunc[] = { |
|
/* O_GFMMAT=15 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
/* O_GFMMAT=15 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
/* O_BYTEARRAY=16 */ {notdef,notdef,notdef,notdef,notdef,notdef,compbytearray}, |
/* O_BYTEARRAY=16 */ {notdef,notdef,notdef,notdef,notdef,notdef,compbytearray}, |
/* O_QUOTE=17 */ {addquote,subquote,mulquote,divquote,pwrquote,chsgnquote,(int(*)())notdef}, |
/* O_QUOTE=17 */ {addquote,subquote,mulquote,divquote,pwrquote,chsgnquote,(int(*)())notdef}, |
|
/* O_OPTLIST=18 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
|
/* O_SYMBOL=19 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
|
/* O_RANGE=20 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
|
/* O_TB=21 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
|
/* O_DPV=22 */ {adddv,subdv,muldv,notdef,notdef,chsgndv,compdv}, |
|
/* ???=23 */ {0,0,0,0,0,0,0}, |
|
/* O_MAT=24 */ {AddMatI,SubMatI,MulMatG,notdef,notdef,ChsgnI,(int(*)())notdef}, |
}; |
}; |
|
|
void arf_init() { |
void arf_init() { |
|
|
(*afunc[OID(a)].add)(vl,a,b,r); |
(*afunc[OID(a)].add)(vl,a,b,r); |
else if ( (mid = MAX(OID(a),OID(b))) <= O_R ) |
else if ( (mid = MAX(OID(a),OID(b))) <= O_R ) |
(*afunc[mid].add)(vl,a,b,r); |
(*afunc[mid].add)(vl,a,b,r); |
|
else if ( (mid = MAX(OID(a),OID(b))) == O_DP && MIN(OID(a),OID(b)) <= O_R ) |
|
(*afunc[mid].add)(vl,a,b,r); |
else |
else |
notdef(vl,a,b,r); |
notdef(vl,a,b,r); |
} |
} |
|
|
(*afunc[OID(a)].sub)(vl,a,b,r); |
(*afunc[OID(a)].sub)(vl,a,b,r); |
else if ( (mid = MAX(OID(a),OID(b))) <= O_R ) |
else if ( (mid = MAX(OID(a),OID(b))) <= O_R ) |
(*afunc[mid].sub)(vl,a,b,r); |
(*afunc[mid].sub)(vl,a,b,r); |
|
else if ( (mid = MAX(OID(a),OID(b))) == O_DP && MIN(OID(a),OID(b)) <= O_R ) |
|
(*afunc[mid].sub)(vl,a,b,r); |
else |
else |
notdef(vl,a,b,r); |
notdef(vl,a,b,r); |
} |
} |
Line 138 void arf_mul(vl,a,b,r) |
|
Line 149 void arf_mul(vl,a,b,r) |
|
VL vl; |
VL vl; |
Obj a,b,*r; |
Obj a,b,*r; |
{ |
{ |
int mid; |
int mid,aid,bid; |
|
|
if ( !a || !b ) |
if ( !a && !b ) |
*r = 0; |
*r = 0; |
else if ( OID(a) == OID(b) ) |
else if ( !a || !b ) { |
(*(afunc[OID(a)].mul))(vl,a,b,r); |
if ( !a ) a = b; |
else if ( (mid = MAX(OID(a),OID(b))) <= O_R || |
/* compute a*0 */ |
(mid == O_MAT) || (mid == O_VECT) || (mid == O_DP) ) |
if ( OID(a) == O_MAT || OID(a) == O_VECT ) |
|
(*(afunc[O_MAT].mul))(vl,a,0,r); |
|
else if ( OID(a) == O_IMAT ) |
|
(*(afunc[O_IMAT].mul))(vl,0,a,r); |
|
else |
|
*r = 0; |
|
} else if ( (aid = OID(a)) == (bid = OID(b)) ) |
|
(*(afunc[aid].mul))(vl,a,b,r); |
|
else if ( (mid = MAX(aid,bid)) <= O_R ) |
(*afunc[mid].mul)(vl,a,b,r); |
(*afunc[mid].mul)(vl,a,b,r); |
else |
else { |
notdef(vl,a,b,r); |
switch ( aid ) { |
|
case O_N: case O_P: |
|
(*afunc[mid].mul)(vl,a,b,r); |
|
break; |
|
case O_R: |
|
/* rat * something; bid > O_R */ |
|
if ( bid == O_VECT || bid == O_MAT ) |
|
(*afunc[mid].mul)(vl,a,b,r); |
|
else |
|
notdef(vl,a,b,r); |
|
break; |
|
case O_MAT: |
|
if ( bid <= O_R || bid == O_VECT || bid == O_DP ) |
|
(*afunc[O_MAT].mul)(vl,a,b,r); |
|
else |
|
notdef(vl,a,b,r); |
|
break; |
|
case O_VECT: |
|
if ( bid <= O_R || bid == O_DP ) |
|
(*afunc[O_VECT].mul)(vl,a,b,r); |
|
else if ( bid == O_MAT ) |
|
(*afunc[O_MAT].mul)(vl,a,b,r); |
|
else |
|
notdef(vl,a,b,r); |
|
break; |
|
case O_DP: |
|
if ( bid <= O_P ) |
|
(*afunc[O_DP].mul)(vl,a,b,r); |
|
else if ( bid == O_MAT || bid == O_VECT || bid == O_DPV ) |
|
(*afunc[bid].mul)(vl,a,b,r); |
|
else |
|
notdef(vl,a,b,r); |
|
break; |
|
case O_IMAT: |
|
(*afunc[O_IMAT].mul)(vl,a,b,r); |
|
break; |
|
default: |
|
notdef(vl,a,b,r); |
|
break; |
|
} |
|
} |
} |
} |
|
|
void arf_div(vl,a,b,r) |
void arf_div(vl,a,b,r) |
|
|
notdef(vl,a,b,r); |
notdef(vl,a,b,r); |
} |
} |
|
|
|
int allow_laurent; |
|
|
void arf_pwr(vl,a,e,r) |
void arf_pwr(vl,a,e,r) |
VL vl; |
VL vl; |
Obj a,e,*r; |
Obj a,e,*r; |
{ |
{ |
R t; |
R t; |
|
|
if ( !a ) |
if ( !a ) { |
*r = 0; |
if ( !e ) |
else if ( OID(a) == O_QUOTE ) |
*r = (pointer)ONE; |
|
else if ( RATN(e) && SGN((Q)e)>0 ) |
|
*r = 0; |
|
else |
|
mkpow(vl,a,e,r); |
|
} else if ( OID(a) == O_QUOTE ) |
(*(afunc[O_QUOTE].pwr))(vl,a,e,r); |
(*(afunc[O_QUOTE].pwr))(vl,a,e,r); |
else if ( !e ) |
else if ( !e ) { |
*r = (pointer)ONE; |
if ( OID(a) == O_MAT ) |
else if ( (OID(e) <= O_N) && INT(e) ) { |
(*(afunc[O_MAT].pwr))(vl,a,e,r); |
|
else |
|
*r = (pointer)ONE; |
|
} else if ( (OID(e) <= O_N) && INT(e) ) { |
if ( (OID(a) == O_P) && (SGN((Q)e) < 0) ) { |
if ( (OID(a) == O_P) && (SGN((Q)e) < 0) ) { |
MKRAT((P)a,(P)ONE,1,t); |
if ( allow_laurent ) |
(*(afunc[O_R].pwr))(vl,t,e,r); |
(*(afunc[O_P].pwr))(vl,a,e,r); |
|
else { |
|
MKRAT((P)a,(P)ONE,1,t); |
|
(*(afunc[O_R].pwr))(vl,t,e,r); |
|
} |
} else |
} else |
(*(afunc[OID(a)].pwr))(vl,a,e,r); |
(*(afunc[OID(a)].pwr))(vl,a,e,r); |
|
} else if ( (OID(e) <= O_N) && RATN(e) ) { |
|
if ( (OID(a) == O_P) && allow_laurent ) |
|
(*(afunc[O_P].pwr))(vl,a,e,r); |
|
else if ( OID(a) <= O_R ) |
|
mkpow(vl,a,e,r); |
|
else |
|
notdef(vl,a,e,r); |
} else if ( OID(a) <= O_R ) |
} else if ( OID(a) <= O_R ) |
mkpow(vl,a,e,r); |
mkpow(vl,a,e,r); |
else |
else |
Line 238 int complist(vl,a,b) |
|
Line 318 int complist(vl,a,b) |
|
VL vl; |
VL vl; |
LIST a,b; |
LIST a,b; |
{ |
{ |
int i,t; |
int t; |
NODE an,bn; |
NODE an,bn; |
|
|
if ( !a ) |
if ( !a ) |