version 1.19, 2001/10/09 01:36:11 |
version 1.21, 2002/01/30 01:09:07 |
|
|
* 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/engine/dist.c,v 1.18 2001/09/13 03:04:28 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.20 2002/01/28 00:54:43 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
|
|
|
|
#define ORD_ELIM 9 |
#define ORD_ELIM 9 |
#define ORD_WEYL_ELIM 10 |
#define ORD_WEYL_ELIM 10 |
#define ORD_HOMO_WW_DRL 11 |
#define ORD_HOMO_WW_DRL 11 |
|
#define ORD_DRL_ZIGZAG 12 |
|
#define ORD_HOMO_WW_DRL_ZIGZAG 13 |
|
|
|
int cmpdl_drl_zigzag(), cmpdl_homo_ww_drl_zigzag(); |
|
|
int (*cmpdl)()=cmpdl_revgradlex; |
int (*cmpdl)()=cmpdl_revgradlex; |
int (*primitive_cmpdl[3])() = {cmpdl_revgradlex,cmpdl_gradlex,cmpdl_lex}; |
int (*primitive_cmpdl[3])() = {cmpdl_revgradlex,cmpdl_gradlex,cmpdl_lex}; |
|
|
Line 136 void initd(struct order_spec *spec) |
|
Line 140 void initd(struct order_spec *spec) |
|
cmpdl = cmpdl_weyl_elim; break; |
cmpdl = cmpdl_weyl_elim; break; |
case ORD_HOMO_WW_DRL: |
case ORD_HOMO_WW_DRL: |
cmpdl = cmpdl_homo_ww_drl; break; |
cmpdl = cmpdl_homo_ww_drl; break; |
|
case ORD_DRL_ZIGZAG: |
|
cmpdl = cmpdl_drl_zigzag; break; |
|
case ORD_HOMO_WW_DRL_ZIGZAG: |
|
cmpdl = cmpdl_homo_ww_drl_zigzag; break; |
case ORD_LEX: default: |
case ORD_LEX: default: |
cmpdl = cmpdl_lex; break; |
cmpdl = cmpdl_lex; break; |
} |
} |
Line 186 void ptod(VL vl,VL dvl,P p,DP *pr) |
|
Line 194 void ptod(VL vl,VL dvl,P p,DP *pr) |
|
|
|
for ( j = k-1, s = 0; j >= 0; j-- ) { |
for ( j = k-1, s = 0; j >= 0; j-- ) { |
ptod(vl,dvl,COEF(w[j]),&t); |
ptod(vl,dvl,COEF(w[j]),&t); |
NEWDL(d,n); d->td = QTOS(DEG(w[j])); d->d[i] = d->td; |
NEWDL(d,n); d->d[i] = QTOS(DEG(w[j])); |
|
d->td = MUL_WEIGHT(d->d[i],i); |
NEWMP(m); m->dl = d; C(m) = (P)ONE; NEXT(m) = 0; MKDP(n,m,u); u->sugar = d->td; |
NEWMP(m); m->dl = d; C(m) = (P)ONE; NEXT(m) = 0; MKDP(n,m,u); u->sugar = d->td; |
comm_muld(vl,t,u,&r); addd(vl,r,s,&t); s = t; |
comm_muld(vl,t,u,&r); addd(vl,r,s,&t); s = t; |
} |
} |
Line 253 void nodetod(NODE node,DP *dp) |
|
Line 262 void nodetod(NODE node,DP *dp) |
|
else if ( !NUM(e) || !RATN(e) || !INT(e) ) |
else if ( !NUM(e) || !RATN(e) || !INT(e) ) |
error("nodetod : invalid input"); |
error("nodetod : invalid input"); |
else { |
else { |
d->d[i] = QTOS((Q)e); td += d->d[i]; |
d->d[i] = QTOS((Q)e); td += MUL_WEIGHT(d->d[i],i); |
} |
} |
} |
} |
d->td = td; |
d->td = td; |
Line 681 void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rt |
|
Line 690 void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rt |
|
for ( i = 0; i < n2; i++ ) { |
for ( i = 0; i < n2; i++ ) { |
a = d0->d[i]; b = d1->d[n2+i]; |
a = d0->d[i]; b = d1->d[n2+i]; |
k = d0->d[n2+i]; l = d1->d[i]; |
k = d0->d[n2+i]; l = d1->d[i]; |
|
|
|
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
|
a += l; |
|
b += k; |
|
s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i); |
|
|
if ( !k || !l ) { |
if ( !k || !l ) { |
a += l; |
|
b += k; |
|
s = a+b; |
|
for ( j = 0, p = rtab; j < curlen; j++, p++ ) { |
for ( j = 0, p = rtab; j < curlen; j++, p++ ) { |
if ( p->c ) { |
if ( p->c ) { |
dt = p->d; |
dt = p->d; |
Line 703 void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rt |
|
Line 715 void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rt |
|
tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl)); |
tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl)); |
ctab = (Q *)MALLOC(tablen*sizeof(Q)); |
ctab = (Q *)MALLOC(tablen*sizeof(Q)); |
} |
} |
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
|
s = a+k+l+b; |
|
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
min = MIN(k,l); |
min = MIN(k,l); |
mkwc(k,l,ctab); |
mkwc(k,l,ctab); |
Line 712 void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rt |
|
Line 722 void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rt |
|
if ( n & 1 ) |
if ( n & 1 ) |
for ( j = 0; j <= min; j++ ) { |
for ( j = 0; j <= min; j++ ) { |
NEWDL(d,n); |
NEWDL(d,n); |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = a-j; d->d[n2+i] = b-j; |
d->td = s; |
d->td = s; |
d->d[n-1] = s-(d->d[i]+d->d[n2+i]); |
d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i)); |
tab[j].d = d; |
tab[j].d = d; |
tab[j].c = (P)ctab[j]; |
tab[j].c = (P)ctab[j]; |
} |
} |
else |
else |
for ( j = 0; j <= min; j++ ) { |
for ( j = 0; j <= min; j++ ) { |
NEWDL(d,n); |
NEWDL(d,n); |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = a-j; d->d[n2+i] = b-j; |
d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */ |
tab[j].d = d; |
tab[j].d = d; |
tab[j].c = (P)ctab[j]; |
tab[j].c = (P)ctab[j]; |
} |
} |
Line 1064 int cmpdl_weyl_elim(int n,DL d1,DL d2) |
|
Line 1074 int cmpdl_weyl_elim(int n,DL d1,DL d2) |
|
3. DRL for the first 2*m variables |
3. DRL for the first 2*m variables |
*/ |
*/ |
|
|
extern int *current_weight_vector; |
extern int *current_weyl_weight_vector; |
|
|
int cmpdl_homo_ww_drl(int n,DL d1,DL d2) |
int cmpdl_homo_ww_drl(int n,DL d1,DL d2) |
{ |
{ |
Line 1077 int cmpdl_homo_ww_drl(int n,DL d1,DL d2) |
|
Line 1087 int cmpdl_homo_ww_drl(int n,DL d1,DL d2) |
|
return -1; |
return -1; |
|
|
m = n>>1; |
m = n>>1; |
for ( i = 0, e1 = e2 = 0; i < m; i++ ) { |
for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) { |
e1 += current_weight_vector[i]*(d1->d[m+i] - d1->d[i]); |
e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]); |
e2 += current_weight_vector[i]*(d2->d[m+i] - d2->d[i]); |
e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]); |
} |
} |
if ( e1 > e2 ) |
if ( e1 > e2 ) |
return 1; |
return 1; |
Line 1098 int cmpdl_homo_ww_drl(int n,DL d1,DL d2) |
|
Line 1108 int cmpdl_homo_ww_drl(int n,DL d1,DL d2) |
|
return i < 0 ? 0 : (*p1 < *p2 ? 1 : -1); |
return i < 0 ? 0 : (*p1 < *p2 ? 1 : -1); |
} |
} |
|
|
|
int cmpdl_drl_zigzag(int n,DL d1,DL d2) |
|
{ |
|
int i,t,m; |
|
int *p1,*p2; |
|
|
|
if ( d1->td > d2->td ) |
|
return 1; |
|
else if ( d1->td < d2->td ) |
|
return -1; |
|
else { |
|
m = n>>1; |
|
for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) { |
|
if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1; |
|
if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1; |
|
} |
|
return 0; |
|
} |
|
} |
|
|
|
int cmpdl_homo_ww_drl_zigzag(int n,DL d1,DL d2) |
|
{ |
|
int e1,e2,m,i,t; |
|
int *p1,*p2; |
|
|
|
if ( d1->td > d2->td ) |
|
return 1; |
|
else if ( d1->td < d2->td ) |
|
return -1; |
|
|
|
m = n>>1; |
|
for ( i = 0, e1 = e2 = 0, p1 = d1->d, p2 = d2->d; i < m; i++ ) { |
|
e1 += current_weyl_weight_vector[i]*(p1[m+i] - p1[i]); |
|
e2 += current_weyl_weight_vector[i]*(p2[m+i] - p2[i]); |
|
} |
|
if ( e1 > e2 ) |
|
return 1; |
|
else if ( e1 < e2 ) |
|
return -1; |
|
|
|
e1 = d1->td - d1->d[n-1]; |
|
e2 = d2->td - d2->d[n-1]; |
|
if ( e1 > e2 ) |
|
return 1; |
|
else if ( e1 < e2 ) |
|
return -1; |
|
|
|
for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) { |
|
if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1; |
|
if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1; |
|
} |
|
return 0; |
|
} |
|
|
int cmpdl_order_pair(int n,DL d1,DL d2) |
int cmpdl_order_pair(int n,DL d1,DL d2) |
{ |
{ |
int e1,e2,i,j,l; |
int e1,e2,i,j,l; |
int *t1,*t2; |
int *t1,*t2; |
int len; |
int len,head; |
struct order_pair *pair; |
struct order_pair *pair; |
|
|
len = dp_current_spec.ord.block.length; |
len = dp_current_spec.ord.block.length; |
pair = dp_current_spec.ord.block.order_pair; |
pair = dp_current_spec.ord.block.order_pair; |
|
|
|
head = 0; |
for ( i = 0, t1 = d1->d, t2 = d2->d; i < len; i++ ) { |
for ( i = 0, t1 = d1->d, t2 = d2->d; i < len; i++ ) { |
l = pair[i].length; |
l = pair[i].length; |
switch ( pair[i].order ) { |
switch ( pair[i].order ) { |
case 0: |
case 0: |
for ( j = 0, e1 = e2 = 0; j < l; j++ ) { |
for ( j = 0, e1 = e2 = 0; j < l; j++ ) { |
e1 += t1[j]; e2 += t2[j]; |
e1 += MUL_WEIGHT(t1[j],head+j); |
|
e2 += MUL_WEIGHT(t2[j],head+j); |
} |
} |
if ( e1 > e2 ) |
if ( e1 > e2 ) |
return 1; |
return 1; |
Line 1127 int cmpdl_order_pair(int n,DL d1,DL d2) |
|
Line 1192 int cmpdl_order_pair(int n,DL d1,DL d2) |
|
break; |
break; |
case 1: |
case 1: |
for ( j = 0, e1 = e2 = 0; j < l; j++ ) { |
for ( j = 0, e1 = e2 = 0; j < l; j++ ) { |
e1 += t1[j]; e2 += t2[j]; |
e1 += MUL_WEIGHT(t1[j],head+j); |
|
e2 += MUL_WEIGHT(t2[j],head+j); |
} |
} |
if ( e1 > e2 ) |
if ( e1 > e2 ) |
return 1; |
return 1; |
Line 1147 int cmpdl_order_pair(int n,DL d1,DL d2) |
|
Line 1213 int cmpdl_order_pair(int n,DL d1,DL d2) |
|
default: |
default: |
error("cmpdl_order_pair : invalid order"); break; |
error("cmpdl_order_pair : invalid order"); break; |
} |
} |
t1 += l; t2 += l; |
t1 += l; t2 += l; head += l; |
} |
} |
return 0; |
return 0; |
} |
} |