version 1.80, 2010/01/19 06:17:22 |
version 1.82, 2010/05/01 02:17:49 |
|
|
* 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/builtin/dp.c,v 1.79 2009/10/09 04:02:11 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.81 2010/04/16 07:13:42 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
Line 106 void Pdp_compute_last_w(); |
|
Line 106 void Pdp_compute_last_w(); |
|
void Pdp_compute_essential_df(); |
void Pdp_compute_essential_df(); |
void Pdp_get_denomlist(); |
void Pdp_get_denomlist(); |
void Pdp_symb_add(); |
void Pdp_symb_add(); |
|
void Pdp_mono_raddec(); |
|
|
LIST dp_initial_term(); |
LIST dp_initial_term(); |
LIST dp_order(); |
LIST dp_order(); |
Line 265 struct ftab dp_supp_tab[] = { |
|
Line 266 struct ftab dp_supp_tab[] = { |
|
{"dp_compute_last_w",Pdp_compute_last_w,5}, |
{"dp_compute_last_w",Pdp_compute_last_w,5}, |
{"dp_compute_last_t",Pdp_compute_last_t,5}, |
{"dp_compute_last_t",Pdp_compute_last_t,5}, |
{"dp_compute_essential_df",Pdp_compute_essential_df,2}, |
{"dp_compute_essential_df",Pdp_compute_essential_df,2}, |
|
{"dp_mono_raddec",Pdp_mono_raddec,2}, |
|
|
{0,0,0} |
{0,0,0} |
}; |
}; |
|
|
LIST *rp; |
LIST *rp; |
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo; |
int m,find; |
|
Obj homo; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
|
|
} |
} |
m = QTOS((Q)ARG2(arg)); |
m = QTOS((Q)ARG2(arg)); |
create_order_spec(0,ARG3(arg),&ord); |
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) |
void Pnd_gr(arg,rp) |
|
|
LIST *rp; |
LIST *rp; |
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo; |
int m,find; |
|
Obj homo; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
|
|
} |
} |
m = QTOS((Q)ARG2(arg)); |
m = QTOS((Q)ARG2(arg)); |
create_order_spec(0,ARG3(arg),&ord); |
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) |
void Pnd_gr_postproc(arg,rp) |
|
|
LIST *rp; |
LIST *rp; |
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo; |
int m,find; |
|
Obj homo; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 1; |
do_weyl = 1; |
|
|
} |
} |
m = QTOS((Q)ARG2(arg)); |
m = QTOS((Q)ARG2(arg)); |
create_order_spec(0,ARG3(arg),&ord); |
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; |
do_weyl = 0; |
} |
} |
|
|
|
|
} |
} |
} |
} |
|
|
|
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) |
LIST remove_zero_from_list(LIST l) |
{ |
{ |
NODE n,r0,r; |
NODE n,r0,r; |
Line 2790 int dpv_hp(DPV p) |
|
Line 2839 int dpv_hp(DPV p) |
|
break; |
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; |
|
} |
|
|