===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/engine/dist.c,v
retrieving revision 1.16
retrieving revision 1.21
diff -u -p -r1.16 -r1.21
--- OpenXM_contrib2/asir2000/engine/dist.c	2001/05/02 09:03:53	1.16
+++ OpenXM_contrib2/asir2000/engine/dist.c	2002/01/30 01:09:07	1.21
@@ -45,7 +45,7 @@
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *
- * $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.15 2001/03/29 09:49:57 noro Exp $ 
+ * $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.20 2002/01/28 00:54:43 noro Exp $ 
 */
 #include "ca.h"
 
@@ -61,32 +61,21 @@
 #define ORD_ELIM 9
 #define ORD_WEYL_ELIM 10
 #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 (*primitive_cmpdl[3])() = {cmpdl_revgradlex,cmpdl_gradlex,cmpdl_lex};
 
-void comm_muld(VL,DP,DP,DP *);
-void weyl_muld(VL,DP,DP,DP *);
-void weyl_muldm(VL,MP,DP,DP *);
-void weyl_mulmm(VL,MP,MP,int,struct cdl *,int);
-void comm_muld_tab(VL,int,struct cdl *,int,struct cdl *,int,struct cdl *);
-
-void mkwc(int,int,Q *);
-
-int cmpdl_weyl_elim();
-int cmpdl_homo_ww_drl();
-
 int do_weyl;
 
 int dp_nelim,dp_fcoeffs;
 struct order_spec dp_current_spec;
 int *dp_dl_work;
 
-int has_fcoef(DP);
-int has_fcoef_p(P);
-
-int has_fcoef(f)
-DP f;
+int has_fcoef(DP f)
 {
 	MP t;
 
@@ -98,8 +87,7 @@ DP f;
 	return t ? 1 : 0;
 }
 
-int has_fcoef_p(f)
-P f;
+int has_fcoef_p(P f)
 {
 	DCP dc;
 
@@ -118,8 +106,7 @@ P f;
 	}
 }
 
-void initd(spec)
-struct order_spec *spec;
+void initd(struct order_spec *spec)
 {
 	switch ( spec->id ) {
 		case 2:
@@ -153,6 +140,10 @@ struct order_spec *spec;
 					cmpdl = cmpdl_weyl_elim; break;
 				case ORD_HOMO_WW_DRL:
 					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:
 					cmpdl = cmpdl_lex; break;
 			}
@@ -161,10 +152,7 @@ struct order_spec *spec;
 	dp_current_spec = *spec;
 }
 
-void ptod(vl,dvl,p,pr)
-VL vl,dvl;
-P p;
-DP *pr;
+void ptod(VL vl,VL dvl,P p,DP *pr)
 {
 	int isconst = 0;
 	int n,i,j,k;
@@ -206,7 +194,8 @@ DP *pr;
 
 				for ( j = k-1, s = 0; j >= 0; j-- ) {
 					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;
 					comm_muld(vl,t,u,&r); addd(vl,r,s,&t); s = t;
 				}
@@ -214,14 +203,13 @@ DP *pr;
 			}
 		}
 	}
+#if 0
 	if ( !dp_fcoeffs && has_fcoef(*pr) )
 		dp_fcoeffs = 1;
+#endif
 }
 
-void dtop(vl,dvl,p,pr)
-VL vl,dvl;
-DP p;
-P *pr;
+void dtop(VL vl,VL dvl,DP p,P *pr)
 {
 	int n,i,j,k;
 	DL d;
@@ -256,9 +244,7 @@ P *pr;
 	}
 }
 
-void nodetod(node,dp)
-NODE node;
-DP *dp;
+void nodetod(NODE node,DP *dp)
 {
 	NODE t;
 	int len,i,td;
@@ -276,7 +262,7 @@ DP *dp;
 		else if ( !NUM(e) || !RATN(e) || !INT(e) )
 			error("nodetod : invalid input");
 		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;
@@ -284,8 +270,7 @@ DP *dp;
 	MKDP(len,m,u); u->sugar = td; *dp = u;
 }
 
-int sugard(m)
-MP m;
+int sugard(MP m)
 {
 	int s;
 
@@ -294,9 +279,7 @@ MP m;
 	return s;
 }
 
-void addd(vl,p1,p2,pr)
-VL vl;
-DP p1,p2,*pr;
+void addd(VL vl,DP p1,DP p2,DP *pr)
 {
 	int n;
 	MP m1,m2,mr,mr0;
@@ -345,12 +328,10 @@ DP p1,p2,*pr;
 
 /* for F4 symbolic reduction */
 
-void symb_addd(p1,p2,pr)
-DP p1,p2,*pr;
+void symb_addd(DP p1,DP p2,DP *pr)
 {
 	int n;
 	MP m1,m2,mr,mr0;
-	P t;
 
 	if ( !p1 )
 		*pr = p2;
@@ -399,9 +380,7 @@ DP p1,p2,*pr;
  * return : a merged list
  */
 
-NODE symb_merge(m1,m2,n)
-NODE m1,m2;
-int n;
+NODE symb_merge(NODE m1,NODE m2,int n)
 {
 	NODE top,prev,cur,m,t;
 
@@ -445,10 +424,47 @@ int n;
 	}
 }
 
-void subd(vl,p1,p2,pr)
-VL vl;
-DP p1,p2,*pr;
+DLBUCKET symb_merge_bucket(DLBUCKET m1,DLBUCKET m2,int n)
 {
+	DLBUCKET top,prev,cur,m,t;
+
+	if ( !m1 )
+		return m2;
+	else if ( !m2 )
+		return m1;
+	else {
+		if ( m1->td == m2->td ) {
+			top = m1;
+			BDY(top) = symb_merge(BDY(top),BDY(m2),n);
+			m = NEXT(m2);
+		} else if ( m1->td > m2->td ) {
+			top = m1; m = m2;
+		} else {
+			top = m2; m = m1;
+		}
+		prev = top; cur = NEXT(top);
+		/* prev->td > m->td always holds */
+		while ( cur && m ) {
+			if ( cur->td == m->td ) {
+				BDY(cur) = symb_merge(BDY(cur),BDY(m),n);
+				m = NEXT(m);
+				prev = cur; cur = NEXT(cur);
+			} else if ( cur->td > m->td ) {
+				t = NEXT(cur); NEXT(cur) = m; m = t;
+				prev = cur; cur = NEXT(cur);
+			} else {
+				NEXT(prev) = m; m = cur;
+				prev = NEXT(prev); cur = NEXT(prev);
+			}
+		}
+		if ( !cur )
+			NEXT(prev) = m;
+		return top;
+	}
+}
+
+void subd(VL vl,DP p1,DP p2,DP *pr)
+{
 	DP t;
 
 	if ( !p2 )
@@ -458,8 +474,7 @@ DP p1,p2,*pr;
 	}
 }
 
-void chsgnd(p,pr)
-DP p,*pr;
+void chsgnd(DP p,DP *pr)
 {
 	MP m,mr,mr0;
 
@@ -475,9 +490,7 @@ DP p,*pr;
 	}
 }
 
-void muld(vl,p1,p2,pr)
-VL vl;
-DP p1,p2,*pr;
+void muld(VL vl,DP p1,DP p2,DP *pr)
 {
 	if ( ! do_weyl )
 		comm_muld(vl,p1,p2,pr);
@@ -485,9 +498,7 @@ DP p1,p2,*pr;
 		weyl_muld(vl,p1,p2,pr);
 }
 
-void comm_muld(vl,p1,p2,pr)
-VL vl;
-DP p1,p2,*pr;
+void comm_muld(VL vl,DP p1,DP p2,DP *pr)
 {
 	MP m;
 	DP s,t,u;
@@ -523,11 +534,7 @@ DP p1,p2,*pr;
 	}
 }
 
-void muldm(vl,p,m0,pr)
-VL vl;
-DP p;
-MP m0;
-DP *pr;
+void muldm(VL vl,DP p,MP m0,DP *pr)
 {
 	MP m,mr,mr0;
 	P c;
@@ -552,9 +559,7 @@ DP *pr;
 	}
 }
 
-void weyl_muld(vl,p1,p2,pr)
-VL vl;
-DP p1,p2,*pr;
+void weyl_muld(VL vl,DP p1,DP p2,DP *pr)
 {
 	MP m;
 	DP s,t,u;
@@ -587,11 +592,7 @@ DP p1,p2,*pr;
 
 /* monomial * polynomial */
 
-void weyl_muldm(vl,m0,p,pr)
-VL vl;
-MP m0;
-DP p;
-DP *pr;
+void weyl_muldm(VL vl,MP m0,DP p,DP *pr)
 {
 	DP r,t,t1;
 	MP m;
@@ -649,16 +650,9 @@ DP *pr;
 /* m0 = x0^d0*x1^d1*... * dx0^e0*dx1^e1*... */
 /* rtab : array of length (e0+1)*(e1+1)*... */
 
-void weyl_mulmm(vl,m0,m1,n,rtab,rtablen)
-VL vl;
-MP m0,m1;
-int n;
-struct cdl *rtab;
-int rtablen;
+void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rtab,int rtablen)
 {
-	MP m,mr,mr0;
-	DP r,t,t1;
-	P c,c0,c1,cc;
+	P c,c0,c1;
 	DL d,d0,d1,dt;
 	int i,j,a,b,k,l,n2,s,min,curlen;
 	struct cdl *p;
@@ -696,10 +690,13 @@ int rtablen;
 	for ( i = 0; i < n2; i++ ) {
 		a = d0->d[i]; b = d1->d[n2+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 ) {
-			a += l;
-			b += k;
-			s = a+b;
 			for ( j = 0, p = rtab; j < curlen; j++, p++ ) {
 				if ( p->c ) {
 					dt = p->d;
@@ -718,8 +715,6 @@ int rtablen;
 			tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl));
 			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 */
 		min = MIN(k,l);
 		mkwc(k,l,ctab);
@@ -727,17 +722,17 @@ int rtablen;
 		if ( n & 1 )
 			for ( j = 0; j <= min; j++ ) {
 				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->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].c = (P)ctab[j];
 			}
 		else
 			for ( j = 0; j <= min; j++ ) {
 				NEWDL(d,n);
-				d->d[i] = l-j+a; d->d[n2+i] = k-j+b;
-				d->td = d->d[i]+d->d[n2+i]; /* XXX */
+				d->d[i] = a-j; d->d[n2+i] = b-j;
+				d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */
 				tab[j].d = d;
 				tab[j].c = (P)ctab[j];
 			}
@@ -757,14 +752,7 @@ int rtablen;
   ]
 */
 
-void comm_muld_tab(vl,nv,t,n,t1,n1,rt)
-VL vl;
-int nv;
-struct cdl *t;
-int n;
-struct cdl *t1;
-int n1;
-struct cdl *rt;
+void comm_muld_tab(VL vl,int nv,struct cdl *t,int n,struct cdl *t1,int n1,struct cdl *rt)
 {
 	int i,j;
 	struct cdl *p;
@@ -786,11 +774,7 @@ struct cdl *rt;
 	}
 }
 
-void muldc(vl,p,c,pr)
-VL vl;
-DP p;
-P c;
-DP *pr;
+void muldc(VL vl,DP p,P c,DP *pr)
 {
 	MP m,mr,mr0;
 
@@ -815,11 +799,7 @@ DP *pr;
 	}
 }
 
-void divsdc(vl,p,c,pr)
-VL vl;
-DP p;
-P c;
-DP *pr;
+void divsdc(VL vl,DP p,P c,DP *pr)
 {
 	MP m,mr,mr0;
 
@@ -837,10 +817,7 @@ DP *pr;
 	}
 }
 
-void adddl(n,d1,d2,dr)
-int n;
-DL d1,d2;
-DL *dr;
+void adddl(int n,DL d1,DL d2,DL *dr)
 {
 	DL dt;
 	int i;
@@ -859,11 +836,8 @@ DL *dr;
 
 /* d1 += d2 */
 
-void adddl_destructive(n,d1,d2)
-int n;
-DL d1,d2;
+void adddl_destructive(int n,DL d1,DL d2)
 {
-	DL dt;
 	int i;
 
 	d1->td += d2->td;
@@ -871,9 +845,7 @@ DL d1,d2;
 		d1->d[i] += d2->d[i];
 }
 
-int compd(vl,p1,p2)
-VL vl;
-DP p1,p2;
+int compd(VL vl,DP p1,DP p2)
 {
 	int n,t;
 	MP m1,m2;
@@ -897,9 +869,7 @@ DP p1,p2;
 	}
 }
 
-int cmpdl_lex(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_lex(int n,DL d1,DL d2)
 {
 	int i;
 
@@ -907,9 +877,7 @@ DL d1,d2;
 	return i == n ? 0 : (d1->d[i] > d2->d[i] ? 1 : -1);
 }
 
-int cmpdl_revlex(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_revlex(int n,DL d1,DL d2)
 {
 	int i;
 
@@ -917,9 +885,7 @@ DL d1,d2;
 	return i < 0 ? 0 : (d1->d[i] < d2->d[i] ? 1 : -1);
 }
 
-int cmpdl_gradlex(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_gradlex(int n,DL d1,DL d2)
 {
 	if ( d1->td > d2->td )
 		return 1;
@@ -929,9 +895,7 @@ DL d1,d2;
 		return cmpdl_lex(n,d1,d2);
 }
 
-int cmpdl_revgradlex(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_revgradlex(int n,DL d1,DL d2)
 {
 	register int i;
 	register int *p1,*p2;
@@ -947,9 +911,7 @@ DL d1,d2;
 	}
 }
 
-int cmpdl_blex(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_blex(int n,DL d1,DL d2)
 {
 	int c;
 
@@ -961,9 +923,7 @@ DL d1,d2;
 	}
 }
 
-int cmpdl_bgradlex(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_bgradlex(int n,DL d1,DL d2)
 {
 	int e1,e2,c;
 
@@ -981,9 +941,7 @@ DL d1,d2;
 	}
 }
 
-int cmpdl_brevgradlex(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_brevgradlex(int n,DL d1,DL d2)
 {
 	int e1,e2,c;
 
@@ -1001,9 +959,7 @@ DL d1,d2;
 	}
 }
 
-int cmpdl_brevrev(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_brevrev(int n,DL d1,DL d2)
 {
 	int e1,e2,f1,f2,c,i;
 
@@ -1030,9 +986,7 @@ DL d1,d2;
 	}
 }
 
-int cmpdl_bgradrev(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_bgradrev(int n,DL d1,DL d2)
 {
 	int e1,e2,f1,f2,c,i;
 
@@ -1059,9 +1013,7 @@ DL d1,d2;
 	}
 }
 
-int cmpdl_blexrev(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_blexrev(int n,DL d1,DL d2)
 {
 	int e1,e2,f1,f2,c,i;
 
@@ -1082,9 +1034,7 @@ DL d1,d2;
 	}
 }
 
-int cmpdl_elim(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_elim(int n,DL d1,DL d2)
 {
 	int e1,e2,i;
 
@@ -1099,9 +1049,7 @@ DL d1,d2;
 		return cmpdl_revgradlex(n,d1,d2);
 }
 
-int cmpdl_weyl_elim(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_weyl_elim(int n,DL d1,DL d2)
 {
 	int e1,e2,i;
 
@@ -1126,11 +1074,9 @@ DL d1,d2;
 	3. DRL for the first 2*m variables
 */
 
-extern int *current_weight_vector;
+extern int *current_weyl_weight_vector;
 
-int cmpdl_homo_ww_drl(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_homo_ww_drl(int n,DL d1,DL d2)
 {
 	int e1,e2,m,i;
 	int *p1,*p2;
@@ -1141,9 +1087,9 @@ DL d1,d2;
 		return -1;
 
 	m = n>>1;
-	for ( i = 0, e1 = e2 = 0; i < m; i++ ) {
-		e1 += current_weight_vector[i]*(d1->d[m+i] - d1->d[i]);
-		e2 += current_weight_vector[i]*(d2->d[m+i] - d2->d[i]);
+	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;
@@ -1162,24 +1108,77 @@ DL d1,d2;
 	return i < 0 ? 0 : (*p1 < *p2 ? 1 : -1);
 }
 
-int cmpdl_order_pair(n,d1,d2)
-int n;
-DL d1,d2;
+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 e1,e2,i,j,l;
 	int *t1,*t2;
-	int len;
+	int len,head;
 	struct order_pair *pair;
 
 	len = dp_current_spec.ord.block.length;
 	pair = dp_current_spec.ord.block.order_pair;
 
+	head = 0;
 	for ( i = 0, t1 = d1->d, t2 = d2->d; i < len; i++ ) {
 		l = pair[i].length;
 		switch ( pair[i].order ) {
 			case 0:
 				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 )
 					return 1;
@@ -1193,7 +1192,8 @@ DL d1,d2;
 				break;
 			case 1:
 				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 )
 					return 1;
@@ -1213,14 +1213,12 @@ DL d1,d2;
 			default:
 				error("cmpdl_order_pair : invalid order"); break;
 		}
-		t1 += l; t2 += l;
+		t1 += l; t2 += l; head += l;
 	}
 	return 0;
 }
 
-int cmpdl_matrix(n,d1,d2)
-int n;
-DL d1,d2;
+int cmpdl_matrix(int n,DL d1,DL d2)
 {
 	int *v,*w,*t1,*t2;
 	int s,i,j,len;