version 1.51, 2004/04/30 08:25:38 |
version 1.70, 2007/09/15 10:17:08 |
|
|
* non-exclusive and royalty-free license to use, copy, modify and |
* non-exclusive and royalty-free license to use, copy, modify and |
* redistribute, solely for non-commercial and non-profit purposes, the |
* redistribute, solely for non-commercial and non-profit purposes, the |
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
* conditions of this Agreement. For the avoidance of doubt, you acquire |
* conditions of this Agreement. For the avoidance of doubt, you acquire * only a limited right to use the SOFTWARE hereunder, and FLL or any |
* only a limited right to use the SOFTWARE hereunder, and FLL or any |
|
* third party developer retains all rights, including but not limited to |
* third party developer retains all rights, including but not limited to |
* copyrights, in and to the SOFTWARE. |
* copyrights, in and to the SOFTWARE. |
* |
* |
|
|
* 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.50 2004/04/15 08:27:42 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.69 2007/09/07 00:45:50 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
#include "parse.h" |
#include "parse.h" |
|
|
|
extern int dp_fcoeffs; |
extern int dp_nelim; |
extern int dp_nelim; |
extern int dp_order_pair_length; |
extern int dp_order_pair_length; |
extern struct order_pair *dp_order_pair; |
extern struct order_pair *dp_order_pair; |
extern struct order_spec *dp_current_spec; |
extern struct order_spec *dp_current_spec; |
|
extern struct modorder_spec *dp_current_modspec; |
|
|
int do_weyl; |
int do_weyl; |
|
|
void Pdp_sort(); |
void Pdp_sort(); |
void Pdp_mul_trunc(),Pdp_quo(); |
void Pdp_mul_trunc(),Pdp_quo(); |
void Pdp_ord(), Pdp_ptod(), Pdp_dtop(); |
void Pdp_ord(), Pdp_ptod(), Pdp_dtop(), Phomogenize(); |
void Pdp_ptozp(), Pdp_ptozp2(), Pdp_red(), Pdp_red2(), Pdp_lcm(), Pdp_redble(); |
void Pdp_ptozp(), Pdp_ptozp2(), Pdp_red(), Pdp_red2(), Pdp_lcm(), Pdp_redble(); |
void Pdp_sp(), Pdp_hm(), Pdp_ht(), Pdp_hc(), Pdp_rest(), Pdp_td(), Pdp_sugar(); |
void Pdp_sp(), Pdp_hm(), Pdp_ht(), Pdp_hc(), Pdp_rest(), Pdp_td(), Pdp_sugar(); |
void Pdp_set_sugar(); |
void Pdp_set_sugar(); |
void Pdp_cri1(),Pdp_cri2(),Pdp_subd(),Pdp_mod(),Pdp_red_mod(),Pdp_tdiv(); |
void Pdp_cri1(),Pdp_cri2(),Pdp_subd(),Pdp_mod(),Pdp_red_mod(),Pdp_tdiv(); |
void Pdp_prim(),Pdp_red_coef(),Pdp_mag(),Pdp_set_kara(),Pdp_rat(); |
void Pdp_prim(),Pdp_red_coef(),Pdp_mag(),Pdp_set_kara(),Pdp_rat(); |
void Pdp_nf(),Pdp_true_nf(); |
void Pdp_nf(),Pdp_true_nf(),Pdp_true_nf_marked(),Pdp_true_nf_marked_mod(); |
void Pdp_nf_mod(),Pdp_true_nf_mod(); |
void Pdp_nf_mod(),Pdp_true_nf_mod(); |
void Pdp_criB(),Pdp_nelim(); |
void Pdp_criB(),Pdp_nelim(); |
void Pdp_minp(),Pdp_sp_mod(); |
void Pdp_minp(),Pdp_sp_mod(); |
void Pdp_homo(),Pdp_dehomo(); |
void Pdp_homo(),Pdp_dehomo(); |
void Pdp_gr_mod_main(),Pdp_gr_f_main(); |
void Pdp_gr_mod_main(),Pdp_gr_f_main(); |
void Pdp_gr_main(),Pdp_gr_hm_main(),Pdp_gr_d_main(),Pdp_gr_flags(); |
void Pdp_gr_main(),Pdp_gr_hm_main(),Pdp_gr_d_main(),Pdp_gr_flags(); |
|
void Pdp_interreduce(); |
void Pdp_f4_main(),Pdp_f4_mod_main(),Pdp_f4_f_main(); |
void Pdp_f4_main(),Pdp_f4_mod_main(),Pdp_f4_f_main(); |
void Pdp_gr_print(); |
void Pdp_gr_print(); |
void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_mdtod(), Pdp_nf_tab_f(); |
void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_mdtod(), Pdp_nf_tab_f(); |
void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), Pdp_sep(); |
void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), Pdp_sep(); |
void Pdp_cont(); |
void Pdp_cont(); |
void Pdp_gr_checklist(); |
void Pdp_gr_checklist(); |
|
void Pdp_ltod(),Pdpv_ord(),Pdpv_ht(),Pdpv_hm(),Pdpv_hc(); |
|
|
void Pdp_weyl_red(); |
void Pdp_weyl_red(); |
void Pdp_weyl_sp(); |
void Pdp_weyl_sp(); |
Line 90 void Pdp_weyl_set_weight(); |
|
Line 93 void Pdp_weyl_set_weight(); |
|
void Pdp_set_weight(); |
void Pdp_set_weight(); |
void Pdp_nf_f(),Pdp_weyl_nf_f(); |
void Pdp_nf_f(),Pdp_weyl_nf_f(); |
void Pdp_lnf_f(); |
void Pdp_lnf_f(); |
void Pnd_gr(),Pnd_gr_trace(),Pnd_f4(); |
void Pnd_gr(),Pnd_gr_trace(),Pnd_f4(),Pnd_f4_trace(); |
|
void Pnd_gr_postproc(); |
void Pnd_weyl_gr(),Pnd_weyl_gr_trace(); |
void Pnd_weyl_gr(),Pnd_weyl_gr_trace(); |
void Pnd_nf(); |
void Pnd_nf(); |
void Pdp_initial_term(); |
void Pdp_initial_term(); |
void Pdp_order(); |
void Pdp_order(); |
|
void Pdp_inv_or_split(); |
|
void Pdp_compute_last_w(); |
|
void Pdp_compute_essential_df(); |
|
|
LIST dp_initial_term(); |
LIST dp_initial_term(); |
LIST dp_order(); |
LIST dp_order(); |
Line 128 struct ftab dp_tab[] = { |
|
Line 135 struct ftab dp_tab[] = { |
|
{"dp_nf",Pdp_nf,4}, |
{"dp_nf",Pdp_nf,4}, |
{"dp_nf_f",Pdp_nf_f,4}, |
{"dp_nf_f",Pdp_nf_f,4}, |
{"dp_true_nf",Pdp_true_nf,4}, |
{"dp_true_nf",Pdp_true_nf,4}, |
|
{"dp_true_nf_marked",Pdp_true_nf_marked,4}, |
|
{"dp_true_nf_marked_mod",Pdp_true_nf_marked_mod,5}, |
{"dp_nf_mod",Pdp_nf_mod,5}, |
{"dp_nf_mod",Pdp_nf_mod,5}, |
{"dp_true_nf_mod",Pdp_true_nf_mod,5}, |
{"dp_true_nf_mod",Pdp_true_nf_mod,5}, |
{"dp_lnf_mod",Pdp_lnf_mod,3}, |
{"dp_lnf_mod",Pdp_lnf_mod,3}, |
Line 137 struct ftab dp_tab[] = { |
|
Line 146 struct ftab dp_tab[] = { |
|
|
|
/* Buchberger algorithm */ |
/* Buchberger algorithm */ |
{"dp_gr_main",Pdp_gr_main,-5}, |
{"dp_gr_main",Pdp_gr_main,-5}, |
|
{"dp_interreduce",Pdp_interreduce,3}, |
{"dp_gr_mod_main",Pdp_gr_mod_main,5}, |
{"dp_gr_mod_main",Pdp_gr_mod_main,5}, |
{"dp_gr_f_main",Pdp_gr_f_main,4}, |
{"dp_gr_f_main",Pdp_gr_f_main,4}, |
{"dp_gr_checklist",Pdp_gr_checklist,2}, |
{"dp_gr_checklist",Pdp_gr_checklist,2}, |
{"nd_f4",Pnd_f4,4}, |
{"nd_f4",Pnd_f4,4}, |
{"nd_gr",Pnd_gr,4}, |
{"nd_gr",Pnd_gr,4}, |
{"nd_gr_trace",Pnd_gr_trace,5}, |
{"nd_gr_trace",Pnd_gr_trace,5}, |
|
{"nd_f4_trace",Pnd_f4_trace,5}, |
|
{"nd_gr_postproc",Pnd_gr_postproc,5}, |
{"nd_weyl_gr",Pnd_weyl_gr,4}, |
{"nd_weyl_gr",Pnd_weyl_gr,4}, |
{"nd_weyl_gr_trace",Pnd_weyl_gr_trace,5}, |
{"nd_weyl_gr_trace",Pnd_weyl_gr_trace,5}, |
{"nd_nf",Pnd_nf,5}, |
{"nd_nf",Pnd_nf,5}, |
Line 177 struct ftab dp_tab[] = { |
|
Line 189 struct ftab dp_tab[] = { |
|
{"dp_weyl_f4_mod_main",Pdp_weyl_f4_mod_main,4}, |
{"dp_weyl_f4_mod_main",Pdp_weyl_f4_mod_main,4}, |
|
|
/* misc */ |
/* misc */ |
|
{"dp_inv_or_split",Pdp_inv_or_split,3}, |
{"dp_set_weight",Pdp_set_weight,-1}, |
{"dp_set_weight",Pdp_set_weight,-1}, |
{"dp_weyl_set_weight",Pdp_weyl_set_weight,-1}, |
{"dp_weyl_set_weight",Pdp_weyl_set_weight,-1}, |
{0,0,0}, |
{0,0,0}, |
Line 186 struct ftab dp_supp_tab[] = { |
|
Line 199 struct ftab dp_supp_tab[] = { |
|
/* setting flags */ |
/* setting flags */ |
{"dp_sort",Pdp_sort,1}, |
{"dp_sort",Pdp_sort,1}, |
{"dp_ord",Pdp_ord,-1}, |
{"dp_ord",Pdp_ord,-1}, |
|
{"dpv_ord",Pdpv_ord,-2}, |
{"dp_set_kara",Pdp_set_kara,-1}, |
{"dp_set_kara",Pdp_set_kara,-1}, |
{"dp_nelim",Pdp_nelim,-1}, |
{"dp_nelim",Pdp_nelim,-1}, |
{"dp_gr_flags",Pdp_gr_flags,-1}, |
{"dp_gr_flags",Pdp_gr_flags,-1}, |
{"dp_gr_print",Pdp_gr_print,-1}, |
{"dp_gr_print",Pdp_gr_print,-1}, |
|
|
/* converters */ |
/* converters */ |
{"dp_ptod",Pdp_ptod,2}, |
{"homogenize",Phomogenize,3}, |
|
{"dp_ptod",Pdp_ptod,-2}, |
{"dp_dtop",Pdp_dtop,2}, |
{"dp_dtop",Pdp_dtop,2}, |
{"dp_homo",Pdp_homo,1}, |
{"dp_homo",Pdp_homo,1}, |
{"dp_dehomo",Pdp_dehomo,1}, |
{"dp_dehomo",Pdp_dehomo,1}, |
Line 202 struct ftab dp_supp_tab[] = { |
|
Line 217 struct ftab dp_supp_tab[] = { |
|
{"dp_mdtod",Pdp_mdtod,1}, |
{"dp_mdtod",Pdp_mdtod,1}, |
{"dp_mod",Pdp_mod,3}, |
{"dp_mod",Pdp_mod,3}, |
{"dp_rat",Pdp_rat,1}, |
{"dp_rat",Pdp_rat,1}, |
|
{"dp_ltod",Pdp_ltod,-2}, |
|
|
/* criteria */ |
/* criteria */ |
{"dp_cri1",Pdp_cri1,2}, |
{"dp_cri1",Pdp_cri1,2}, |
Line 214 struct ftab dp_supp_tab[] = { |
|
Line 230 struct ftab dp_supp_tab[] = { |
|
{"dp_hm",Pdp_hm,1}, |
{"dp_hm",Pdp_hm,1}, |
{"dp_ht",Pdp_ht,1}, |
{"dp_ht",Pdp_ht,1}, |
{"dp_hc",Pdp_hc,1}, |
{"dp_hc",Pdp_hc,1}, |
|
{"dpv_hm",Pdpv_hm,1}, |
|
{"dpv_ht",Pdpv_ht,1}, |
|
{"dpv_hc",Pdpv_hc,1}, |
{"dp_rest",Pdp_rest,1}, |
{"dp_rest",Pdp_rest,1}, |
{"dp_initial_term",Pdp_initial_term,1}, |
{"dp_initial_term",Pdp_initial_term,1}, |
{"dp_order",Pdp_order,1}, |
{"dp_order",Pdp_order,1}, |
Line 231 struct ftab dp_supp_tab[] = { |
|
Line 250 struct ftab dp_supp_tab[] = { |
|
{"dp_idiv",Pdp_idiv,2}, |
{"dp_idiv",Pdp_idiv,2}, |
{"dp_tdiv",Pdp_tdiv,2}, |
{"dp_tdiv",Pdp_tdiv,2}, |
{"dp_minp",Pdp_minp,2}, |
{"dp_minp",Pdp_minp,2}, |
|
{"dp_compute_last_w",Pdp_compute_last_w,5}, |
|
{"dp_compute_essential_df",Pdp_compute_essential_df,2}, |
|
|
{0,0,0} |
{0,0,0} |
}; |
}; |
|
|
|
NODE compute_last_w(NODE g,NODE gh,int n,int **v,int row1,int **m1,int row2,int **m2); |
|
|
|
void Pdp_compute_last_w(NODE arg,LIST *rp) |
|
{ |
|
NODE g,gh,r; |
|
VECT w,rv; |
|
LIST l; |
|
MAT w1,w2; |
|
int row1,row2,i,j,n; |
|
int *v; |
|
int **m1,**m2; |
|
Q q; |
|
|
|
g = (NODE)BDY((LIST)ARG0(arg)); |
|
gh = (NODE)BDY((LIST)ARG1(arg)); |
|
w = (VECT)ARG2(arg); |
|
w1 = (MAT)ARG3(arg); |
|
w2 = (MAT)ARG4(arg); |
|
n = w1->col; |
|
row1 = w1->row; |
|
row2 = w2->row; |
|
if ( w ) { |
|
v = W_ALLOC(n); |
|
for ( i = 0; i < n; i++ ) v[i] = QTOS((Q)w->body[i]); |
|
} else v = 0; |
|
m1 = almat(row1,n); |
|
for ( i = 0; i < row1; i++ ) |
|
for ( j = 0; j < n; j++ ) m1[i][j] = QTOS((Q)w1->body[i][j]); |
|
m2 = almat(row2,n); |
|
for ( i = 0; i < row2; i++ ) |
|
for ( j = 0; j < n; j++ ) m2[i][j] = QTOS((Q)w2->body[i][j]); |
|
r = compute_last_w(g,gh,n,&v,row1,m1,row2,m2); |
|
if ( !r ) *rp = 0; |
|
else { |
|
MKVECT(rv,n); |
|
for ( i = 0; i < n; i++ ) { |
|
STOQ(v[i],q); rv->body[i] = (pointer)q; |
|
} |
|
MKLIST(l,r); |
|
r = mknode(2,rv,l); |
|
MKLIST(*rp,r); |
|
} |
|
} |
|
|
|
NODE compute_essential_df(DP *g,DP *gh,int n); |
|
|
|
void Pdp_compute_essential_df(NODE arg,LIST *rp) |
|
{ |
|
VECT g,gh; |
|
NODE r; |
|
|
|
g = (VECT)ARG0(arg); |
|
gh = (VECT)ARG1(arg); |
|
r = (NODE)compute_essential_df((DP *)BDY(g),(DP *)BDY(gh),g->len); |
|
MKLIST(*rp,r); |
|
} |
|
|
|
void Pdp_inv_or_split(arg,rp) |
|
NODE arg; |
|
Obj *rp; |
|
{ |
|
NODE gb,newgb; |
|
DP f,inv; |
|
struct order_spec *spec; |
|
LIST list; |
|
|
|
do_weyl = 0; dp_fcoeffs = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_inv_or_split"); |
|
asir_assert(ARG1(arg),O_DP,"dp_inv_or_split"); |
|
if ( !create_order_spec(0,(Obj)ARG2(arg),&spec) ) |
|
error("dp_inv_or_split : invalid order specification"); |
|
gb = BDY((LIST)ARG0(arg)); |
|
f = (DP)ARG1(arg); |
|
newgb = (NODE)dp_inv_or_split(gb,f,spec,&inv); |
|
if ( !newgb ) { |
|
/* invertible */ |
|
*rp = (Obj)inv; |
|
} else { |
|
MKLIST(list,newgb); |
|
*rp = (Obj)list; |
|
} |
|
} |
|
|
void Pdp_sort(arg,rp) |
void Pdp_sort(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
|
|
int modular; |
int modular; |
|
|
f.id = O_LIST; f.body = 0; |
f.id = O_LIST; f.body = 0; |
if ( !arg ) |
if ( !arg && !current_option ) |
*rp = dp_current_spec->obj; |
*rp = dp_current_spec->obj; |
else { |
else { |
if ( ARG0(arg) && OID(ARG0(arg)) == O_OPTLIST ) |
if ( current_option ) |
parse_gr_option(&f,BDY((OPTLIST)ARG0(arg)),&v,&homo,&modular,&spec); |
parse_gr_option(&f,current_option,&v,&homo,&modular,&spec); |
else if ( !create_order_spec(0,(Obj)ARG0(arg),&spec) ) |
else if ( !create_order_spec(0,(Obj)ARG0(arg),&spec) ) |
error("dp_ord : invalid order specification"); |
error("dp_ord : invalid order specification"); |
initd(spec); *rp = spec->obj; |
initd(spec); *rp = spec->obj; |
Line 447 void Pdp_ptod(arg,rp) |
|
Line 551 void Pdp_ptod(arg,rp) |
|
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
{ |
{ |
|
P p; |
NODE n; |
NODE n; |
VL vl,tvl; |
VL vl,tvl; |
|
struct oLIST f; |
|
int ac; |
|
LIST v; |
|
Num homo; |
|
int modular; |
|
struct order_spec *ord; |
|
|
asir_assert(ARG0(arg),O_P,"dp_ptod"); |
asir_assert(ARG0(arg),O_P,"dp_ptod"); |
asir_assert(ARG1(arg),O_LIST,"dp_ptod"); |
p = (P)ARG0(arg); |
for ( vl = 0, n = BDY((LIST)ARG1(arg)); n; n = NEXT(n) ) { |
ac = argc(arg); |
|
if ( ac == 1 ) { |
|
if ( current_option ) { |
|
f.id = O_LIST; f.body = mknode(1,p); |
|
parse_gr_option(&f,current_option,&v,&homo,&modular,&ord); |
|
initd(ord); |
|
} else |
|
error("dp_ptod : invalid argument"); |
|
} else { |
|
asir_assert(ARG1(arg),O_LIST,"dp_ptod"); |
|
v = (LIST)ARG1(arg); |
|
} |
|
for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) { |
if ( !vl ) { |
if ( !vl ) { |
NEWVL(vl); tvl = vl; |
NEWVL(vl); tvl = vl; |
} else { |
} else { |
|
|
} |
} |
if ( vl ) |
if ( vl ) |
NEXT(tvl) = 0; |
NEXT(tvl) = 0; |
ptod(CO,vl,(P)ARG0(arg),rp); |
ptod(CO,vl,p,rp); |
} |
} |
|
|
|
void Phomogenize(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
P p; |
|
DP d,h; |
|
NODE n; |
|
V hv; |
|
VL vl,tvl,last; |
|
struct oLIST f; |
|
LIST v; |
|
|
|
asir_assert(ARG0(arg),O_P,"homogenize"); |
|
p = (P)ARG0(arg); |
|
asir_assert(ARG1(arg),O_LIST,"homogenize"); |
|
v = (LIST)ARG1(arg); |
|
asir_assert(ARG2(arg),O_P,"homogenize"); |
|
hv = VR((P)ARG2(arg)); |
|
for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) { |
|
if ( !vl ) { |
|
NEWVL(vl); tvl = vl; |
|
} else { |
|
NEWVL(NEXT(tvl)); tvl = NEXT(tvl); |
|
} |
|
VR(tvl) = VR((P)BDY(n)); |
|
} |
|
if ( vl ) { |
|
last = tvl; |
|
NEXT(tvl) = 0; |
|
} |
|
ptod(CO,vl,p,&d); |
|
dp_homo(d,&h); |
|
NEWVL(NEXT(last)); last = NEXT(last); |
|
VR(last) = hv; NEXT(last) = 0; |
|
dtop(CO,vl,h,rp); |
|
} |
|
|
|
void Pdp_ltod(arg,rp) |
|
NODE arg; |
|
DPV *rp; |
|
{ |
|
NODE n; |
|
VL vl,tvl; |
|
LIST f,v; |
|
int sugar,i,len,ac,modular; |
|
Num homo; |
|
struct order_spec *ord; |
|
DP *e; |
|
NODE nd,t; |
|
|
|
ac = argc(arg); |
|
asir_assert(ARG0(arg),O_LIST,"dp_ptod"); |
|
f = (LIST)ARG0(arg); |
|
if ( ac == 1 ) { |
|
if ( current_option ) { |
|
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
|
initd(ord); |
|
} else |
|
error("dp_ltod : invalid argument"); |
|
} else { |
|
asir_assert(ARG1(arg),O_LIST,"dp_ptod"); |
|
v = (LIST)ARG1(arg); |
|
} |
|
for ( vl = 0, n = BDY(v); n; n = NEXT(n) ) { |
|
if ( !vl ) { |
|
NEWVL(vl); tvl = vl; |
|
} else { |
|
NEWVL(NEXT(tvl)); tvl = NEXT(tvl); |
|
} |
|
VR(tvl) = VR((P)BDY(n)); |
|
} |
|
if ( vl ) |
|
NEXT(tvl) = 0; |
|
|
|
nd = BDY(f); |
|
len = length(nd); |
|
e = (DP *)MALLOC(len*sizeof(DP)); |
|
sugar = 0; |
|
for ( i = 0, t = nd; i < len; i++, t = NEXT(t) ) { |
|
ptod(CO,vl,(P)BDY(t),&e[i]); |
|
if ( e[i] ) |
|
sugar = MAX(sugar,e[i]->sugar); |
|
} |
|
MKDPV(len,e,*rp); |
|
} |
|
|
void Pdp_dtop(arg,rp) |
void Pdp_dtop(arg,rp) |
NODE arg; |
NODE arg; |
P *rp; |
P *rp; |
Line 491 extern LIST Dist; |
|
Line 700 extern LIST Dist; |
|
|
|
void Pdp_ptozp(arg,rp) |
void Pdp_ptozp(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
Obj *rp; |
{ |
{ |
|
Q t; |
|
NODE tt,p; |
|
NODE n,n0; |
|
char *key; |
|
DP pp; |
|
LIST list; |
|
int get_factor=0; |
|
|
asir_assert(ARG0(arg),O_DP,"dp_ptozp"); |
asir_assert(ARG0(arg),O_DP,"dp_ptozp"); |
dp_ptozp((DP)ARG0(arg),rp); |
|
|
/* analyze the option */ |
|
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,"factor") ) get_factor=1; |
|
else { |
|
error("ptozp: unknown option."); |
|
} |
|
} |
|
} |
|
|
|
dp_ptozp3((DP)ARG0(arg),&t,&pp); |
|
|
|
/* printexpr(NULL,t); */ |
|
/* if the option factor is given, then it returns the answer |
|
in the format [zpoly, num] where num*zpoly is equal to the argument.*/ |
|
if (get_factor) { |
|
n0 = mknode(2,pp,t); |
|
MKLIST(list,n0); |
|
*rp = (Obj)list; |
|
} else |
|
*rp = (Obj)pp; |
} |
} |
|
|
void Pdp_ptozp2(arg,rp) |
void Pdp_ptozp2(arg,rp) |
|
|
DP g; |
DP g; |
int full; |
int full; |
|
|
do_weyl = 0; |
do_weyl = 0; dp_fcoeffs = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_nf"); |
asir_assert(ARG0(arg),O_LIST,"dp_nf"); |
asir_assert(ARG1(arg),O_DP,"dp_nf"); |
asir_assert(ARG1(arg),O_DP,"dp_nf"); |
asir_assert(ARG2(arg),O_VECT,"dp_nf"); |
asir_assert(ARG2(arg),O_VECT,"dp_nf"); |
|
|
P dn; |
P dn; |
int full; |
int full; |
|
|
do_weyl = 0; |
do_weyl = 0; dp_fcoeffs = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf"); |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf"); |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
|
void Pdp_true_nf_marked(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
NODE b,n; |
|
DP *ps,*hps; |
|
DP g; |
|
DP nm; |
|
Q cont; |
|
P dn; |
|
int full; |
|
|
|
do_weyl = 0; dp_fcoeffs = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_true_nf_marked"); |
|
asir_assert(ARG1(arg),O_DP,"dp_true_nf_marked"); |
|
asir_assert(ARG2(arg),O_VECT,"dp_true_nf_marked"); |
|
asir_assert(ARG3(arg),O_VECT,"dp_true_nf_marked"); |
|
if ( !(g = (DP)ARG1(arg)) ) { |
|
nm = 0; dn = (P)ONE; |
|
} else { |
|
b = BDY((LIST)ARG0(arg)); |
|
ps = (DP *)BDY((VECT)ARG2(arg)); |
|
hps = (DP *)BDY((VECT)ARG3(arg)); |
|
dp_true_nf_marked(b,g,ps,hps,&nm,&cont,&dn); |
|
} |
|
n = mknode(3,nm,cont,dn); |
|
MKLIST(*rp,n); |
|
} |
|
|
|
void Pdp_true_nf_marked_mod(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
NODE b,n; |
|
DP *ps,*hps; |
|
DP g; |
|
DP nm; |
|
P dn; |
|
int mod; |
|
|
|
do_weyl = 0; dp_fcoeffs = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_true_nf_marked_mod"); |
|
asir_assert(ARG1(arg),O_DP,"dp_true_nf_marked_mod"); |
|
asir_assert(ARG2(arg),O_VECT,"dp_true_nf_marked_mod"); |
|
asir_assert(ARG3(arg),O_VECT,"dp_true_nf_marked_mod"); |
|
asir_assert(ARG4(arg),O_N,"dp_true_nf_marked_mod"); |
|
if ( !(g = (DP)ARG1(arg)) ) { |
|
nm = 0; dn = (P)ONE; |
|
} else { |
|
b = BDY((LIST)ARG0(arg)); |
|
ps = (DP *)BDY((VECT)ARG2(arg)); |
|
hps = (DP *)BDY((VECT)ARG3(arg)); |
|
mod = QTOS((Q)ARG4(arg)); |
|
dp_true_nf_marked_mod(b,g,ps,hps,mod,&nm,&dn); |
|
} |
|
n = mknode(2,nm,dn); |
|
MKLIST(*rp,n); |
|
} |
|
|
void Pdp_weyl_nf_mod(arg,rp) |
void Pdp_weyl_nf_mod(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
|
|
MP m,mr; |
MP m,mr; |
|
|
p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_ht"); |
p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_ht"); |
if ( !p ) |
dp_ht(p,rp); |
*rp = 0; |
|
else { |
|
m = BDY(p); |
|
NEWMP(mr); mr->dl = m->dl; mr->c = (P)ONE; NEXT(mr) = 0; |
|
MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */ |
|
} |
|
} |
} |
|
|
void Pdp_hc(arg,rp) |
void Pdp_hc(arg,rp) |
|
|
n = mknode(1,f); MKLIST(l,n); f = l; |
n = mknode(1,f); MKLIST(l,n); f = l; |
is_list = 0; |
is_list = 0; |
} |
} |
if ( argc(arg) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
if ( current_option ) { |
parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); |
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
else |
initd(ord); |
|
} else |
ord = dp_current_spec; |
ord = dp_current_spec; |
initiallist = dp_initial_term(f,ord); |
initiallist = dp_initial_term(f,ord); |
if ( !is_list ) |
if ( !is_list ) |
|
|
n = mknode(1,f); MKLIST(l,n); f = l; |
n = mknode(1,f); MKLIST(l,n); f = l; |
is_list = 0; |
is_list = 0; |
} |
} |
if ( argc(arg) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
if ( current_option ) { |
parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); |
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
else |
initd(ord); |
|
} else |
ord = dp_current_spec; |
ord = dp_current_spec; |
ordlist = dp_order(f,ord); |
ordlist = dp_order(f,ord); |
if ( !is_list ) |
if ( !is_list ) |
|
|
if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
*rp = f; return; |
*rp = f; return; |
} |
} |
if ( argc(arg) == 5 ) { |
if ( (ac = argc(arg)) == 5 ) { |
asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
|
|
else |
else |
modular = QTOS(m); |
modular = QTOS(m); |
create_order_spec(0,ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
} else if ( (ac=argc(arg)) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
} else if ( current_option ) |
parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); |
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
else if ( ac == 1 ) |
else if ( ac == 1 ) |
parse_gr_option(f,0,&v,&homo,&modular,&ord); |
parse_gr_option(f,0,&v,&homo,&modular,&ord); |
else |
else |
|
|
dp_gr_main(f,v,homo,modular,0,ord,rp); |
dp_gr_main(f,v,homo,modular,0,ord,rp); |
} |
} |
|
|
|
void Pdp_interreduce(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
VL vl; |
|
int ac; |
|
struct order_spec *ord; |
|
|
|
do_weyl = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_interreduce"); |
|
f = (LIST)ARG0(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
if ( (ac = argc(arg)) == 3 ) { |
|
asir_assert(ARG1(arg),O_LIST,"dp_interreduce"); |
|
v = (LIST)ARG1(arg); |
|
create_order_spec(0,ARG2(arg),&ord); |
|
} |
|
dp_interreduce(f,v,0,ord,rp); |
|
} |
|
|
void Pdp_gr_f_main(arg,rp) |
void Pdp_gr_f_main(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
|
|
nd_gr(f,v,m,0,ord,rp); |
nd_gr(f,v,m,0,ord,rp); |
} |
} |
|
|
|
void Pnd_gr_postproc(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
int m,do_check; |
|
struct order_spec *ord; |
|
|
|
do_weyl = 0; |
|
asir_assert(ARG0(arg),O_LIST,"nd_gr"); |
|
asir_assert(ARG1(arg),O_LIST,"nd_gr"); |
|
asir_assert(ARG2(arg),O_N,"nd_gr"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; 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); |
|
} |
|
|
void Pnd_gr_trace(arg,rp) |
void Pnd_gr_trace(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
|
|
homo = QTOS((Q)ARG2(arg)); |
homo = QTOS((Q)ARG2(arg)); |
m = QTOS((Q)ARG3(arg)); |
m = QTOS((Q)ARG3(arg)); |
create_order_spec(0,ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
nd_gr_trace(f,v,m,homo,ord,rp); |
nd_gr_trace(f,v,m,homo,0,ord,rp); |
} |
} |
|
|
|
void Pnd_f4_trace(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
int m,homo; |
|
struct order_spec *ord; |
|
|
|
do_weyl = 0; |
|
asir_assert(ARG0(arg),O_LIST,"nd_gr_trace"); |
|
asir_assert(ARG1(arg),O_LIST,"nd_gr_trace"); |
|
asir_assert(ARG2(arg),O_N,"nd_gr_trace"); |
|
asir_assert(ARG3(arg),O_N,"nd_gr_trace"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; 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,1,ord,rp); |
|
} |
|
|
void Pnd_weyl_gr(arg,rp) |
void Pnd_weyl_gr(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
|
|
homo = QTOS((Q)ARG2(arg)); |
homo = QTOS((Q)ARG2(arg)); |
m = QTOS((Q)ARG3(arg)); |
m = QTOS((Q)ARG3(arg)); |
create_order_spec(0,ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
nd_gr_trace(f,v,m,homo,ord,rp); |
nd_gr_trace(f,v,m,homo,0,ord,rp); |
} |
} |
|
|
void Pnd_nf(arg,rp) |
void Pnd_nf(arg,rp) |
|
|
if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
*rp = f; return; |
*rp = f; return; |
} |
} |
if ( argc(arg) == 5 ) { |
if ( (ac = argc(arg)) == 5 ) { |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
|
|
else |
else |
modular = QTOS(m); |
modular = QTOS(m); |
create_order_spec(0,ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
} else if ( (ac=argc(arg)) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
} else if ( current_option ) |
parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); |
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
else if ( ac == 1 ) |
else if ( ac == 1 ) |
parse_gr_option(f,0,&v,&homo,&modular,&ord); |
parse_gr_option(f,0,&v,&homo,&modular,&ord); |
else |
else |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
static VECT current_dl_weight_vector_obj; |
VECT current_dl_weight_vector_obj; |
int *current_dl_weight_vector; |
int *current_dl_weight_vector; |
|
|
void Pdp_set_weight(arg,rp) |
void Pdp_set_weight(arg,rp) |
Line 2062 int get_field_type(P p) |
|
Line 2429 int get_field_type(P p) |
|
return -1; |
return -1; |
} |
} |
return type; |
return type; |
|
} |
|
} |
|
|
|
void Pdpv_ord(NODE arg,Obj *rp) |
|
{ |
|
int ac,id; |
|
LIST shift; |
|
|
|
ac = argc(arg); |
|
if ( ac ) { |
|
id = QTOS((Q)ARG0(arg)); |
|
if ( ac > 1 && ARG1(arg) && OID((Obj)ARG1(arg))==O_LIST ) |
|
shift = (LIST)ARG1(arg); |
|
else |
|
shift = 0; |
|
create_modorder_spec(id,shift,&dp_current_modspec); |
|
} |
|
*rp = dp_current_modspec->obj; |
|
} |
|
|
|
void Pdpv_ht(NODE arg,LIST *rp) |
|
{ |
|
NODE n; |
|
DP ht; |
|
int pos; |
|
DPV p; |
|
Q q; |
|
|
|
asir_assert(ARG0(arg),O_DPV,"dpv_ht"); |
|
p = (DPV)ARG0(arg); |
|
pos = dpv_hp(p); |
|
if ( pos < 0 ) |
|
ht = 0; |
|
else |
|
dp_ht(BDY(p)[pos],&ht); |
|
STOQ(pos,q); |
|
n = mknode(2,q,ht); |
|
MKLIST(*rp,n); |
|
} |
|
|
|
void Pdpv_hm(NODE arg,LIST *rp) |
|
{ |
|
NODE n; |
|
DP ht; |
|
int pos; |
|
DPV p; |
|
Q q; |
|
|
|
asir_assert(ARG0(arg),O_DPV,"dpv_hm"); |
|
p = (DPV)ARG0(arg); |
|
pos = dpv_hp(p); |
|
if ( pos < 0 ) |
|
ht = 0; |
|
else |
|
dp_hm(BDY(p)[pos],&ht); |
|
STOQ(pos,q); |
|
n = mknode(2,q,ht); |
|
MKLIST(*rp,n); |
|
} |
|
|
|
void Pdpv_hc(NODE arg,LIST *rp) |
|
{ |
|
NODE n; |
|
P hc; |
|
int pos; |
|
DPV p; |
|
Q q; |
|
|
|
asir_assert(ARG0(arg),O_DPV,"dpv_hc"); |
|
p = (DPV)ARG0(arg); |
|
pos = dpv_hp(p); |
|
if ( pos < 0 ) |
|
hc = 0; |
|
else |
|
hc = BDY(BDY(p)[pos])->c; |
|
STOQ(pos,q); |
|
n = mknode(2,q,hc); |
|
MKLIST(*rp,n); |
|
} |
|
|
|
int dpv_hp(DPV p) |
|
{ |
|
int len,i,maxp,maxw,w,slen; |
|
int *shift; |
|
DP *e; |
|
|
|
len = p->len; |
|
e = p->body; |
|
slen = dp_current_modspec->len; |
|
shift = dp_current_modspec->degree_shift; |
|
switch ( dp_current_modspec->id ) { |
|
case ORD_REVGRADLEX: |
|
for ( maxp = -1, i = 0; i < len; i++ ) |
|
if ( !e[i] ) continue; |
|
else if ( maxp < 0 ) { |
|
maxw = BDY(e[i])->dl->td+(i<slen?shift[i]:0); maxp = i; |
|
} else { |
|
w = BDY(e[i])->dl->td+(i<slen?shift[i]:0); |
|
if ( w >= maxw ) { |
|
maxw = w; maxp = i; |
|
} |
|
} |
|
return maxp; |
|
case ORD_GRADLEX: |
|
for ( maxp = -1, i = 0; i < len; i++ ) |
|
if ( !e[i] ) continue; |
|
else if ( maxp < 0 ) { |
|
maxw = BDY(e[i])->dl->td+(i<slen?shift[i]:0); maxp = i; |
|
} else { |
|
w = BDY(e[i])->dl->td+(i<slen?shift[i]:0); |
|
if ( w > maxw ) { |
|
maxw = w; maxp = i; |
|
} |
|
} |
|
return maxp; |
|
break; |
|
case ORD_LEX: |
|
for ( i = 0; i < len; i++ ) |
|
if ( e[i] ) return i; |
|
return -1; |
|
break; |
} |
} |
} |
} |