version 1.1.1.1, 1999/12/03 07:39:07 |
version 1.5, 2000/05/29 08:54:45 |
|
|
/* $OpenXM: OpenXM/src/asir99/builtin/gr.c,v 1.2 1999/11/18 05:42:01 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/builtin/gr.c,v 1.4 2000/04/25 04:07:58 noro Exp $ */ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
#include "base.h" |
#include "base.h" |
Line 33 int TP,NBP,NMP,NFP,NDP,ZR,NZR; |
|
Line 33 int TP,NBP,NMP,NFP,NDP,ZR,NZR; |
|
#define NEWDP_pairs ((DP_pairs)MALLOC(sizeof(struct dp_pairs))) |
#define NEWDP_pairs ((DP_pairs)MALLOC(sizeof(struct dp_pairs))) |
|
|
extern int (*cmpdl)(); |
extern int (*cmpdl)(); |
|
extern int do_weyl; |
|
|
void Pdp_gr_flags(), Pdp_gr_print(); |
void Pdp_gr_flags(), Pdp_gr_print(); |
void Pdp_gr_main(),Pdp_gr_mod_main(),Pdp_f4_main(),Pdp_f4_mod_main(); |
void Pdp_gr_main(),Pdp_gr_mod_main(),Pdp_f4_main(),Pdp_f4_mod_main(); |
Line 93 void dp_gr_main(LIST,LIST,Num,int,struct order_spec *, |
|
Line 94 void dp_gr_main(LIST,LIST,Num,int,struct order_spec *, |
|
void dp_f4_main(LIST,LIST,struct order_spec *,LIST *); |
void dp_f4_main(LIST,LIST,struct order_spec *,LIST *); |
void dp_f4_mod_main(LIST,LIST,int,struct order_spec *,LIST *); |
void dp_f4_mod_main(LIST,LIST,int,struct order_spec *,LIST *); |
double get_rtime(); |
double get_rtime(); |
void dp_symb(DP,DP *); |
|
void _dpmod_to_vect(DP,DL *,int *); |
void _dpmod_to_vect(DP,DL *,int *); |
void dp_to_vect(DP,DL *,Q *); |
void dp_to_vect(DP,DL *,Q *); |
|
NODE dp_dllist(DP f),symb_merge(NODE,NODE,int); |
|
|
extern int dp_nelim; |
extern int dp_nelim; |
extern int dp_fcoeffs; |
extern int dp_fcoeffs; |
|
|
return 0; |
return 0; |
} |
} |
|
|
|
/* b[] should be cleared */ |
|
|
void _dpmod_to_vect(f,at,b) |
void _dpmod_to_vect(f,at,b) |
DP f; |
DP f; |
DL *at; |
DL *at; |
|
|
} |
} |
} |
} |
|
|
void dp_symb(f,rp) |
NODE dp_dllist(f) |
DP f; |
DP f; |
DP *rp; |
|
{ |
{ |
MP mp,mp0,m; |
MP m; |
DP r; |
NODE mp,mp0; |
|
|
if ( !f ) { |
if ( !f ) |
*rp = 0; return; |
return 0; |
} |
|
mp0 = 0; |
mp0 = 0; |
for ( m = BDY(f); m; m = NEXT(m) ) { |
for ( m = BDY(f); m; m = NEXT(m) ) { |
NEXTMP(mp0,mp); mp->dl = m->dl; mp->c = (P)ONE; |
NEXTNODE(mp0,mp); BDY(mp) = (pointer)m->dl; |
} |
} |
NEXT(mp) = 0; |
NEXT(mp) = 0; |
MKDP(f->nv,mp0,r); r->sugar = f->sugar; |
return mp0; |
*rp = r; |
|
} |
} |
|
|
|
void pdl(f) |
|
NODE f; |
|
{ |
|
while ( f ) { |
|
printdl(BDY(f)); f = NEXT(f); |
|
} |
|
fflush(stdout); |
|
printf("\n"); |
|
} |
|
|
void dp_gr_main(f,v,homo,modular,ord,rp) |
void dp_gr_main(f,v,homo,modular,ord,rp) |
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
|
|
int i; |
int i; |
struct order_spec ord1; |
struct order_spec ord1; |
VL fv,vv,vc; |
VL fv,vv,vc; |
DP b,c; |
DP b,c,c1; |
NODE fd,fd0,fi,fi0,r,r0,t,subst,x,s,xx; |
NODE fd,fd0,fi,fi0,r,r0,t,subst,x,s,xx; |
|
|
dp_fcoeffs = 0; |
dp_fcoeffs = 0; |
|
|
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
ptod(CO,vv,(P)BDY(t),&b); |
ptod(CO,vv,(P)BDY(t),&b); |
_dp_mod(b,m,0,&c); |
_dp_mod(b,m,0,&c); |
|
_dp_monic(c,m,&c1); |
if ( c ) { |
if ( c ) { |
NEXTNODE(fd0,fd); BDY(fd) = (pointer)c; |
NEXTNODE(fd0,fd); BDY(fd) = (pointer)c1; |
} |
} |
} |
} |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
|
|
{ |
{ |
int i,j,k,nh,row,col,nv; |
int i,j,k,nh,row,col,nv; |
NODE r,g,gall; |
NODE r,g,gall; |
|
NODE s,s0; |
DP_pairs d,dm,dr,t; |
DP_pairs d,dm,dr,t; |
DP h,nf,nf1,s,s0,s1,f1,f2,f21,f21r,sp,sp1,sd,sdm; |
DP h,nf,nf1,f1,f2,f21,f21r,sp,sp1,sd,sdm,tdp; |
MP mp,mp0; |
MP mp,mp0; |
NODE blist,bt,nt; |
NODE blist,bt,nt; |
DL *ht,*at; |
DL *ht,*at; |
|
|
dp_sp(ps[t->dp1],ps[t->dp2],&sp); |
dp_sp(ps[t->dp1],ps[t->dp2],&sp); |
if ( sp ) { |
if ( sp ) { |
MKNODE(bt,sp,blist); blist = bt; |
MKNODE(bt,sp,blist); blist = bt; |
dp_symb(sp,&sp1); |
s0 = symb_merge(s0,dp_dllist(sp),nv); |
symb_addd(s0,sp1,&s1); s0 = s1; |
|
} |
} |
} |
} |
/* s0 : all the terms appeared in symbolic redunction */ |
/* s0 : all the terms appeared in symbolic redunction */ |
s = s0; |
for ( s = s0, nred = 0; s; s = NEXT(s) ) { |
nred = 0; |
|
while ( s ) { |
|
for ( r = gall; r; r = NEXT(r) ) |
for ( r = gall; r; r = NEXT(r) ) |
if ( dp_redble(s,ps[(int)BDY(r)] ) ) |
if ( _dl_redble(BDY(ps[(int)BDY(r)])->dl,BDY(s),nv) ) |
break; |
break; |
if ( r ) { |
if ( r ) { |
dp_subd(s,ps[(int)BDY(r)],&sd); |
dltod(BDY(s),nv,&tdp); |
|
dp_subd(tdp,ps[(int)BDY(r)],&sd); |
muld(CO,sd,ps[(int)BDY(r)],&f2); |
muld(CO,sd,ps[(int)BDY(r)],&f2); |
MKNODE(bt,f2,blist); blist = bt; |
MKNODE(bt,f2,blist); blist = bt; |
dp_symb(f2,&f21); symb_addd(s0,f21,&s1); s0 = s1; |
s = symb_merge(s,dp_dllist(f2),nv); |
dp_rest(f21,&f21r); |
|
dp_rest(s,&s1); symb_addd(s1,f21r,&s); |
|
nred++; |
nred++; |
} else { |
|
dp_rest(s,&s1); s = s1; |
|
} |
} |
} |
} |
|
|
|
|
ht = (DL *)MALLOC(nred*sizeof(DL)); |
ht = (DL *)MALLOC(nred*sizeof(DL)); |
for ( r = blist, i = 0; i < nred; r = NEXT(r), i++ ) |
for ( r = blist, i = 0; i < nred; r = NEXT(r), i++ ) |
ht[i] = BDY((DP)BDY(r))->dl; |
ht[i] = BDY((DP)BDY(r))->dl; |
for ( mp = BDY(s0), col = 0; mp; mp = NEXT(mp), col++ ); |
for ( s = s0, col = 0; s; s = NEXT(s), col++ ); |
at = (DL *)MALLOC(col*sizeof(DL)); |
at = (DL *)MALLOC(col*sizeof(DL)); |
for ( mp = BDY(s0), i = 0; i < col; mp = NEXT(mp), i++ ) |
for ( s = s0, i = 0; i < col; s = NEXT(s), i++ ) |
at[i] = mp->dl; |
at[i] = (DL)BDY(s); |
MKMAT(mat,row,col); |
MKMAT(mat,row,col); |
for ( i = 0, r = blist; i < row; r = NEXT(r), i++ ) |
for ( i = 0, r = blist; i < row; r = NEXT(r), i++ ) |
dp_to_vect(BDY(r),at,(Q *)mat->body[i]); |
dp_to_vect(BDY(r),at,(Q *)mat->body[i]); |
|
|
fprintf(asir_out,"mat : %d x %d",row,col); |
fprintf(asir_out,"mat : %d x %d",row,col); |
fflush(asir_out); |
fflush(asir_out); |
} |
} |
|
#if 0 |
|
rank = generic_gauss_elim_hensel(mat,&nm,&dn,&rind,&cind); |
|
#else |
rank = generic_gauss_elim(mat,&nm,&dn,&rind,&cind); |
rank = generic_gauss_elim(mat,&nm,&dn,&rind,&cind); |
|
#endif |
if ( Print ) |
if ( Print ) |
fprintf(asir_out,"done rank = %d\n",rank,row,col); |
fprintf(asir_out,"done rank = %d\n",rank,row,col); |
for ( i = 0; i < rank; i++ ) { |
for ( i = 0; i < rank; i++ ) { |
|
|
return g; |
return g; |
} |
} |
|
|
|
/* initial bases are monic */ |
|
|
NODE gb_f4_mod(f,m) |
NODE gb_f4_mod(f,m) |
NODE f; |
NODE f; |
int m; |
int m; |
{ |
{ |
int i,j,k,nh,row,col,nv; |
int i,j,k,nh,row,col,nv; |
NODE r,g,gall; |
NODE r,g,gall; |
|
NODE s,s0; |
DP_pairs d,dm,dr,t; |
DP_pairs d,dm,dr,t; |
DP h,nf,s,s0,s1,f1,f2,f21,f21r,sp,sp1,sd,sdm; |
DP h,nf,f1,f2,f21,f21r,sp,sp1,sd,sdm,tdp; |
MP mp,mp0; |
MP mp,mp0; |
NODE blist,bt,nt; |
NODE blist,bt,nt; |
DL *ht,*at; |
DL *ht,*at,*st; |
int **mat; |
int **spmat,**redmat; |
int *colstat; |
int *colstat,*w; |
int rank,nred,nonzero; |
int rank,nred,nsp,nonzero,spcol; |
struct oEGT tmp0,tmp1,tmp2,eg_split_symb,eg_split_elim; |
int *indred,*isred,*ri; |
extern struct oEGT eg_symb,eg_elim; |
struct oEGT tmp0,tmp1,tmp2,eg_split_symb,eg_split_elim1,eg_split_elim2; |
|
extern struct oEGT eg_symb,eg_elim1,eg_elim2; |
|
|
init_eg(&eg_symb); init_eg(&eg_elim); |
init_eg(&eg_symb); init_eg(&eg_elim1); init_eg(&eg_elim2); |
for ( gall = g = 0, d = 0, r = f; r; r = NEXT(r) ) { |
for ( gall = g = 0, d = 0, r = f; r; r = NEXT(r) ) { |
i = (int)BDY(r); |
i = (int)BDY(r); |
d = updpairs(d,g,i); |
d = updpairs(d,g,i); |
|
|
_dp_sp_mod(ps[t->dp1],ps[t->dp2],m,&sp); |
_dp_sp_mod(ps[t->dp1],ps[t->dp2],m,&sp); |
if ( sp ) { |
if ( sp ) { |
MKNODE(bt,sp,blist); blist = bt; |
MKNODE(bt,sp,blist); blist = bt; |
dp_symb(sp,&sp1); |
s0 = symb_merge(s0,dp_dllist(sp),nv); |
addd(CO,s0,sp1,&s1); s0 = s1; |
|
} |
} |
} |
} |
/* s0 : all the terms appeared in symbolic redunction */ |
/* s0 : all the terms appeared in symbolic redunction */ |
s = s0; |
for ( s = s0, nred = 0; s; s = NEXT(s) ) { |
nred = 0; |
|
while ( s ) { |
|
for ( r = gall; r; r = NEXT(r) ) |
for ( r = gall; r; r = NEXT(r) ) |
if ( dp_redble(s,ps[(int)BDY(r)] ) ) |
if ( _dl_redble(BDY(ps[(int)BDY(r)])->dl,BDY(s),nv) ) |
break; |
break; |
if ( r ) { |
if ( r ) { |
dp_subd(s,ps[(int)BDY(r)],&sd); |
dltod(BDY(s),nv,&tdp); |
|
dp_subd(tdp,ps[(int)BDY(r)],&sd); |
_dp_mod(sd,m,0,&sdm); |
_dp_mod(sd,m,0,&sdm); |
_mulmd(CO,m,sdm,ps[(int)BDY(r)],&f2); |
_mulmd(CO,m,ps[(int)BDY(r)],sdm,&f2); |
MKNODE(bt,f2,blist); blist = bt; |
MKNODE(bt,f2,blist); blist = bt; |
dp_symb(f2,&f21); addd(CO,s0,f21,&s1); s0 = s1; |
s = symb_merge(s,dp_dllist(f2),nv); |
dp_rest(f21,&f21r); |
|
dp_rest(s,&s1); addd(CO,s1,f21r,&s); |
|
nred++; |
nred++; |
} else { |
|
dp_rest(s,&s1); s = s1; |
|
} |
} |
} |
} |
|
|
|
get_eg(&tmp1); add_eg(&eg_symb,&tmp0,&tmp1); |
|
init_eg(&eg_split_symb); add_eg(&eg_split_symb,&tmp0,&tmp1); |
|
|
/* the first nred polys in blist are reducers */ |
/* the first nred polys in blist are reducers */ |
/* row = the number of all the polys */ |
/* row = the number of all the polys */ |
for ( r = blist, row = 0; r; r = NEXT(r), row++ ); |
for ( r = blist, row = 0; r; r = NEXT(r), row++ ); |
|
|
|
/* head terms of reducers */ |
ht = (DL *)MALLOC(nred*sizeof(DL)); |
ht = (DL *)MALLOC(nred*sizeof(DL)); |
for ( r = blist, i = 0; i < nred; r = NEXT(r), i++ ) |
for ( r = blist, i = 0; i < nred; r = NEXT(r), i++ ) |
ht[i] = BDY((DP)BDY(r))->dl; |
ht[i] = BDY((DP)BDY(r))->dl; |
for ( mp = BDY(s0), col = 0; mp; mp = NEXT(mp), col++ ); |
|
|
/* col = number of all terms */ |
|
for ( s = s0, col = 0; s; s = NEXT(s), col++ ); |
|
|
|
/* head terms of all terms */ |
at = (DL *)MALLOC(col*sizeof(DL)); |
at = (DL *)MALLOC(col*sizeof(DL)); |
for ( mp = BDY(s0), i = 0; i < col; mp = NEXT(mp), i++ ) |
for ( s = s0, i = 0; i < col; s = NEXT(s), i++ ) |
at[i] = mp->dl; |
at[i] = (DL)BDY(s); |
mat = almat(row,col); |
|
for ( i = 0, r = blist; i < row; r = NEXT(r), i++ ) |
/* store coefficients separately in spmat and redmat */ |
_dpmod_to_vect(BDY(r),at,mat[i]); |
nsp = row-nred; |
colstat = (int *)MALLOC_ATOMIC(col*sizeof(int)); |
|
for ( i = 0, nonzero=0; i < row; i++ ) |
/* reducer matrix */ |
for ( j = 0; j < col; j++ ) |
redmat = (int **)almat(nred,col); |
if ( mat[i][j] ) |
for ( i = 0, r = blist; i < nred; r = NEXT(r), i++ ) |
|
_dpmod_to_vect(BDY(r),at,redmat[i]); |
|
/* XXX */ |
|
/* reduce_reducers_mod(redmat,nred,col,m); */ |
|
/* register the position of the head term */ |
|
indred = (int *)MALLOC(nred*sizeof(int)); |
|
bzero(indred,nred*sizeof(int)); |
|
isred = (int *)MALLOC(col*sizeof(int)); |
|
bzero(isred,col*sizeof(int)); |
|
for ( i = 0; i < nred; i++ ) { |
|
ri = redmat[i]; |
|
for ( j = 0; j < col && !ri[j]; j++ ); |
|
indred[i] = j; |
|
isred[j] = 1; |
|
} |
|
|
|
spcol = col-nred; |
|
/* head terms not in ht */ |
|
st = (DL *)MALLOC(spcol*sizeof(DL)); |
|
for ( j = 0, k = 0; j < col; j++ ) |
|
if ( !isred[j] ) |
|
st[k++] = at[j]; |
|
|
|
/* spoly matrix; stored in reduced form; terms in ht[] are omitted */ |
|
spmat = almat(nsp,spcol); |
|
w = (int *)MALLOC(col*sizeof(int)); |
|
for ( ; i < row; r = NEXT(r), i++ ) { |
|
bzero(w,col*sizeof(int)); |
|
_dpmod_to_vect(BDY(r),at,w); |
|
reduce_sp_by_red_mod(w,redmat,indred,nred,col,m); |
|
for ( j = 0, k = 0; j < col; j++ ) |
|
if ( !isred[j] ) |
|
spmat[i-nred][k++] = w[j]; |
|
} |
|
|
|
get_eg(&tmp0); add_eg(&eg_elim1,&tmp1,&tmp0); |
|
init_eg(&eg_split_elim1); add_eg(&eg_split_elim1,&tmp1,&tmp0); |
|
|
|
colstat = (int *)MALLOC_ATOMIC(spcol*sizeof(int)); |
|
for ( i = 0, nonzero=0; i < nsp; i++ ) |
|
for ( j = 0; j < spcol; j++ ) |
|
if ( spmat[i][j] ) |
nonzero++; |
nonzero++; |
if ( Print ) |
if ( Print ) |
fprintf(asir_out,"mat : %d x %d (nonzero=%f%%)...", |
fprintf(asir_out,"spmat : %d x %d (nonzero=%f%%)...", |
row,col,((double)nonzero*100)/(row*col)); |
nsp,spcol,((double)nonzero*100)/(nsp*spcol)); |
get_eg(&tmp1); add_eg(&eg_symb,&tmp0,&tmp1); |
rank = generic_gauss_elim_mod(spmat,nsp,spcol,m,colstat); |
init_eg(&eg_split_symb); add_eg(&eg_split_symb,&tmp0,&tmp1); |
|
rank = generic_gauss_elim_mod(mat,row,col,m,colstat); |
get_eg(&tmp1); add_eg(&eg_elim2,&tmp0,&tmp1); |
get_eg(&tmp2); add_eg(&eg_elim,&tmp1,&tmp2); |
init_eg(&eg_split_elim2); add_eg(&eg_split_elim2,&tmp0,&tmp1); |
init_eg(&eg_split_elim); add_eg(&eg_split_elim,&tmp1,&tmp2); |
|
if ( Print ) { |
if ( Print ) { |
fprintf(asir_out,"done rank = %d\n",rank,row,col); |
fprintf(asir_out,"done rank = %d\n",rank,row,col); |
print_eg("Symb",&eg_split_symb); |
print_eg("Symb",&eg_split_symb); |
print_eg("Elim",&eg_split_elim); |
print_eg("Elim1",&eg_split_elim1); |
|
print_eg("Elim2",&eg_split_elim2); |
fprintf(asir_out,"\n"); |
fprintf(asir_out,"\n"); |
} |
} |
for ( j = 0, i = 0; j < col; j++ ) |
for ( j = 0, i = 0; j < spcol; j++ ) |
if ( colstat[j] ) { |
if ( colstat[j] ) { |
for ( k = 0; k < nred; k++ ) |
mp0 = 0; |
if ( !cmpdl(nv,at[j],ht[k]) ) |
NEXTMP(mp0,mp); mp->dl = st[j]; mp->c = STOI(1); |
break; |
for ( k = j+1; k < spcol; k++ ) |
if ( k == nred ) { |
if ( !colstat[k] && spmat[i][k] ) { |
/* this is a new base */ |
NEXTMP(mp0,mp); mp->dl = st[k]; |
mp0 = 0; |
mp->c = STOI(spmat[i][k]); |
NEXTMP(mp0,mp); mp->dl = at[j]; mp->c = STOI(1); |
|
for ( k = j+1; k < col; k++ ) |
|
if ( !colstat[k] && mat[i][k] ) { |
|
NEXTMP(mp0,mp); mp->dl = at[k]; |
|
mp->c = STOI(mat[i][k]); |
|
} |
|
NEXT(mp) = 0; |
|
MKDP(nv,mp0,nf); nf->sugar = dm->sugar; |
|
nh = newps_mod(nf,m); |
|
d = updpairs(d,g,nh); |
|
g = updbase(g,nh); |
|
gall = append_one(gall,nh); |
|
} |
} |
|
NEXT(mp) = 0; |
|
MKDP(nv,mp0,nf); nf->sugar = dm->sugar; |
|
nh = newps_mod(nf,m); |
|
d = updpairs(d,g,nh); |
|
g = updbase(g,nh); |
|
gall = append_one(gall,nh); |
i++; |
i++; |
} |
} |
} |
} |
if ( Print ) { |
if ( Print ) { |
print_eg("Symb",&eg_symb); |
print_eg("Symb",&eg_symb); |
print_eg("Elim",&eg_elim); |
print_eg("Elim1",&eg_elim1); |
|
print_eg("Elim2",&eg_elim2); |
fflush(asir_out); |
fflush(asir_out); |
} |
} |
return g; |
return g; |
|
|
dl1 = DPPlength(d1); NFP += (dl-dl1); dl = dl1; |
dl1 = DPPlength(d1); NFP += (dl-dl1); dl = dl1; |
} else |
} else |
dl = 1; |
dl = 1; |
for ( dd = 0; d1; d1 = nd ) { |
if ( !do_weyl ) |
nd = NEXT(d1); |
for ( dd = 0; d1; d1 = nd ) { |
if ( !criterion_2( d1->dp1, d1->dp2 ) ) { |
nd = NEXT(d1); |
NEXT(d1) = dd; |
if ( !criterion_2( d1->dp1, d1->dp2 ) ) { |
dd = d1; |
NEXT(d1) = dd; |
|
dd = d1; |
|
} |
} |
} |
} |
else |
|
dd = d1; |
dl1 = DPPlength(dd); NDP += (dl-dl1); |
dl1 = DPPlength(dd); NDP += (dl-dl1); |
get_eg(&tup1); |
get_eg(&tup1); |
add_eg(&eg_up,&tup0,&tup1); |
add_eg(&eg_up,&tup0,&tup1); |
Line 2181 register int t; |
|
Line 2238 register int t; |
|
last = p; |
last = p; |
dp = p->dp1 = (int)BDY(r); p->dp2 = t; |
dp = p->dp1 = (int)BDY(r); p->dp2 = t; |
p->lcm = lcm_of_DL(CNVars, dl = psh[dp], tdl, (DL)0 ); |
p->lcm = lcm_of_DL(CNVars, dl = psh[dp], tdl, (DL)0 ); |
p->sugar = (ts > (s = pss[dp] - dl->td) ? ts : s) + p->lcm->td; |
#if 0 |
|
if ( do_weyl ) |
|
p->sugar = dl_weight(p->lcm); |
|
else |
|
#endif |
|
p->sugar = (ts > (s = pss[dp] - dl->td) ? ts : s) + p->lcm->td; |
} |
} |
return last; |
return last; |
} |
} |
|
|
for ( d1 = dl1->d, d2 = dl2->d, n = CNVars; --n >= 0; d1++, d2++ ) |
for ( d1 = dl1->d, d2 = dl2->d, n = CNVars; --n >= 0; d1++, d2++ ) |
if ( *d1 < *d2 ) return 0; |
if ( *d1 < *d2 ) return 0; |
return 1; |
return 1; |
|
} |
|
|
|
int dl_weight(dl) |
|
DL dl; |
|
{ |
|
int n,w,i; |
|
|
|
n = CNVars/2; |
|
for ( i = 0, w = 0; i < n; i++ ) |
|
w += (-dl->d[i]+dl->d[n+i]); |
|
return w; |
} |
} |
|
|
int gbcheck(f) |
int gbcheck(f) |