=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/dp.c,v retrieving revision 1.79 retrieving revision 1.82 diff -u -p -r1.79 -r1.82 --- OpenXM_contrib2/asir2000/builtin/dp.c 2009/10/09 04:02:11 1.79 +++ OpenXM_contrib2/asir2000/builtin/dp.c 2010/05/01 02:17:49 1.82 @@ -44,7 +44,7 @@ * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. * - * $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.78 2009/09/09 08:13:24 noro Exp $ + * $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.81 2010/04/16 07:13:42 noro Exp $ */ #include "ca.h" #include "base.h" @@ -105,6 +105,8 @@ void Pdp_compute_last_t(); void Pdp_compute_last_w(); void Pdp_compute_essential_df(); void Pdp_get_denomlist(); +void Pdp_symb_add(); +void Pdp_mono_raddec(); LIST dp_initial_term(); LIST dp_order(); @@ -246,6 +248,7 @@ struct ftab dp_supp_tab[] = { {"dp_rest",Pdp_rest,1}, {"dp_initial_term",Pdp_initial_term,1}, {"dp_order",Pdp_order,1}, + {"dp_symb_add",Pdp_symb_add,2}, /* degree and size */ {"dp_td",Pdp_td,1}, @@ -263,6 +266,7 @@ struct ftab dp_supp_tab[] = { {"dp_compute_last_w",Pdp_compute_last_w,5}, {"dp_compute_last_t",Pdp_compute_last_t,5}, {"dp_compute_essential_df",Pdp_compute_essential_df,2}, + {"dp_mono_raddec",Pdp_mono_raddec,2}, {0,0,0} }; @@ -1259,6 +1263,30 @@ DP *rp; dp_subd(p1,p2,rp); } +void Pdp_symb_add(arg,rp) +NODE arg; +DP *rp; +{ + DP p1,p2,r; + NODE s0; + MP mp0,mp; + int nv; + + p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); + asir_assert(p1,O_DP,"dp_symb_add"); + asir_assert(p2,O_DP,"dp_symb_add"); + if ( p1->nv != p2->nv ) + error("dp_sumb_add : invalid input"); + nv = p1->nv; + s0 = symb_merge(dp_dllist(p1),dp_dllist(p2),nv); + for ( mp0 = 0; s0; s0 = NEXT(s0) ) { + NEXTMP(mp0,mp); mp->dl = (DL)BDY(s0); mp->c = (P)ONE; + } + NEXT(mp) = 0; + MKDP(nv,mp0,r); r->sugar = MAX(p1->sugar,p2->sugar); + *rp = r; +} + void Pdp_mul_trunc(arg,rp) NODE arg; DP *rp; @@ -2104,7 +2132,8 @@ NODE arg; LIST *rp; { LIST f,v; - int m,homo; + int m,find; + Obj homo; struct order_spec *ord; do_weyl = 0; @@ -2118,7 +2147,8 @@ LIST *rp; } m = QTOS((Q)ARG2(arg)); create_order_spec(0,ARG3(arg),&ord); - nd_gr(f,v,m,1,ord,rp); + find = get_opt("homo",&homo); + nd_gr(f,v,m,find&&homo,1,ord,rp); } void Pnd_gr(arg,rp) @@ -2126,7 +2156,8 @@ NODE arg; LIST *rp; { LIST f,v; - int m,homo; + int m,find; + Obj homo; struct order_spec *ord; do_weyl = 0; @@ -2140,7 +2171,8 @@ LIST *rp; } m = QTOS((Q)ARG2(arg)); create_order_spec(0,ARG3(arg),&ord); - nd_gr(f,v,m,0,ord,rp); + find = get_opt("homo",&homo); + nd_gr(f,v,m,find&&homo,0,ord,rp); } void Pnd_gr_postproc(arg,rp) @@ -2181,12 +2213,13 @@ LIST *rp; f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); f = remove_zero_from_list(f); if ( !BDY(f) ) { - *rp = f; return; + *rp = f; do_weyl = 0; return; } m = QTOS((Q)ARG2(arg)); create_order_spec(0,ARG3(arg),&ord); do_check = ARG4(arg) ? 1 : 0; nd_gr_postproc(f,v,m,ord,do_check,rp); + do_weyl = 0; } void Pnd_gr_trace(arg,rp) @@ -2242,7 +2275,8 @@ NODE arg; LIST *rp; { LIST f,v; - int m,homo; + int m,find; + Obj homo; struct order_spec *ord; do_weyl = 1; @@ -2252,11 +2286,13 @@ LIST *rp; f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); f = remove_zero_from_list(f); if ( !BDY(f) ) { - *rp = f; return; + *rp = f; do_weyl = 0; return; } m = QTOS((Q)ARG2(arg)); create_order_spec(0,ARG3(arg),&ord); - nd_gr(f,v,m,0,ord,rp); + find = get_opt("homo",&homo); + nd_gr(f,v,m,find&&homo,0,ord,rp); + do_weyl = 0; } void Pnd_weyl_gr_trace(arg,rp) @@ -2275,12 +2311,13 @@ LIST *rp; f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); f = remove_zero_from_list(f); if ( !BDY(f) ) { - *rp = f; return; + *rp = f; do_weyl = 0; return; } homo = QTOS((Q)ARG2(arg)); m = QTOS((Q)ARG3(arg)); create_order_spec(0,ARG4(arg),&ord); nd_gr_trace(f,v,m,homo,0,ord,rp); + do_weyl = 0; } void Pnd_nf(arg,rp) @@ -2597,6 +2634,47 @@ VECT *rp; } } +NODE mono_raddec(NODE ideal); + +void Pdp_mono_raddec(NODE arg,LIST *rp) +{ + NODE ideal,rd,t,t1,r,r1,u; + VL vl0,vl; + int nv,i,bpi; + int *s; + DP dp; + P *v; + LIST l; + + ideal = BDY((LIST)ARG0(arg)); + if ( !ideal ) *rp = (LIST)ARG0(arg); + else { + t = BDY((LIST)ARG1(arg)); + nv = length(t); + v = (P)MALLOC(nv*sizeof(P)); + for ( vl0 = 0, i = 0; t; t = NEXT(t), i++ ) { + NEXTVL(vl0,vl); VR(vl) = VR((P)BDY(t)); + MKV(VR(vl),v[i]); + } + if ( vl0 ) NEXT(vl) = 0; + for ( t = 0, r = ideal; r; r = NEXT(r) ) { + ptod(CO,vl0,BDY(r),&dp); MKNODE(t1,dp,t); t = t1; + } + rd = mono_raddec(t); + r = 0; + bpi = (sizeof(int)/sizeof(char))*8; + for ( u = rd; u; u = NEXT(u) ) { + s = (int *)BDY(u); + for ( i = nv-1, t = 0; i >= 0; i-- ) + if ( s[i/bpi]&(1<<(i%bpi)) ) { + MKNODE(t1,v[i],t); t = t1; + } + MKLIST(l,t); MKNODE(r1,l,r); r = r1; + } + MKLIST(*rp,r); + } +} + LIST remove_zero_from_list(LIST l) { NODE n,r0,r; @@ -2761,3 +2839,22 @@ int dpv_hp(DPV p) break; } } + +int get_opt(char *key0,Obj *r) { + NODE tt,p; + char *key; + + if ( current_option ) { + for ( tt = current_option; tt; tt = NEXT(tt) ) { + p = BDY((LIST)BDY(tt)); + key = BDY((STRING)BDY(p)); + /* value = (Obj)BDY(NEXT(p)); */ + if ( !strcmp(key,key0) ) { + *r = (Obj)BDY(NEXT(p)); + return 1; + } + } + } + return 0; +} +