version 1.95, 2015/01/26 13:48:31 |
version 1.107, 2017/09/14 01:34:53 |
|
|
* 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 * only a limited right to use the SOFTWARE hereunder, and FLL or any |
* conditions of this Agreement. For the avoidance of doubt, you acquire |
|
* 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.94 2015/01/13 00:54:54 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.106 2017/09/06 06:25:26 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
Line 69 void Pdp_set_sugar(); |
|
Line 70 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(),Pdp_true_nf_marked(),Pdp_true_nf_marked_mod(); |
void Pdp_nf(),Pdp_true_nf(),Pdp_true_nf_marked(),Pdp_true_nf_marked_mod(); |
|
|
|
void Pdp_true_nf_and_quotient(),Pdp_true_nf_and_quotient_mod(); |
void Pdp_true_nf_and_quotient_marked(),Pdp_true_nf_and_quotient_marked_mod(); |
void Pdp_true_nf_and_quotient_marked(),Pdp_true_nf_and_quotient_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(); |
Line 84 void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), P |
|
Line 88 void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), P |
|
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_ltod(),Pdpv_ord(),Pdpv_ht(),Pdpv_hm(),Pdpv_hc(); |
|
void Pdpm_ltod(),Pdpm_dtol(),Pdpm_ord(),Pdpm_nf(),Pdpm_weyl_nf(),Pdpm_sp(),Pdpm_weyl_sp(); |
|
void Pdpm_hm(),Pdpm_ht(),Pdpm_hc(); |
|
|
void Pdp_weyl_red(); |
void Pdp_weyl_red(); |
void Pdp_weyl_sp(); |
void Pdp_weyl_sp(); |
|
|
void Pdp_weyl_nf(),Pdp_weyl_nf_mod(); |
void Pdp_weyl_nf(),Pdp_weyl_nf_mod(); |
|
void Pdp_weyl_true_nf_and_quotient(),Pdp_weyl_true_nf_and_quotient_mod(); |
|
void Pdp_weyl_true_nf_and_quotient_marked(),Pdp_weyl_true_nf_and_quotient_marked_mod(); |
|
|
void Pdp_weyl_gr_main(),Pdp_weyl_gr_mod_main(),Pdp_weyl_gr_f_main(); |
void Pdp_weyl_gr_main(),Pdp_weyl_gr_mod_main(),Pdp_weyl_gr_f_main(); |
void Pdp_weyl_f4_main(),Pdp_weyl_f4_mod_main(),Pdp_weyl_f4_f_main(); |
void Pdp_weyl_f4_main(),Pdp_weyl_f4_mod_main(),Pdp_weyl_f4_f_main(); |
void Pdp_weyl_mul(),Pdp_weyl_mul_mod(); |
void Pdp_weyl_mul(),Pdp_weyl_mul_mod(),Pdp_weyl_act(); |
void Pdp_weyl_set_weight(); |
void Pdp_weyl_set_weight(); |
void Pdp_set_weight(),Pdp_set_top_weight(),Pdp_set_module_weight(); |
void Pdp_set_weight(),Pdp_set_top_weight(),Pdp_set_module_weight(); |
void Pdp_nf_f(),Pdp_weyl_nf_f(); |
void Pdp_nf_f(),Pdp_weyl_nf_f(); |
|
void Pdpm_nf_f(),Pdpm_weyl_nf_f(); |
void Pdp_lnf_f(); |
void Pdp_lnf_f(); |
void Pnd_gr(),Pnd_gr_trace(),Pnd_f4(),Pnd_f4_trace(); |
void Pnd_gr(),Pnd_gr_trace(),Pnd_f4(),Pnd_f4_trace(); |
void Pnd_gr_postproc(), Pnd_weyl_gr_postproc(); |
void Pnd_gr_postproc(), Pnd_weyl_gr_postproc(); |
Line 143 struct ftab dp_tab[] = { |
|
Line 154 struct ftab dp_tab[] = { |
|
|
|
/* normal form */ |
/* normal form */ |
{"dp_nf",Pdp_nf,4}, |
{"dp_nf",Pdp_nf,4}, |
|
{"dp_nf_mod",Pdp_nf_mod,5}, |
{"dp_nf_f",Pdp_nf_f,4}, |
{"dp_nf_f",Pdp_nf_f,4}, |
|
{"dpm_nf_f",Pdpm_nf_f,4}, |
|
{"dpm_weyl_nf_f",Pdpm_weyl_nf_f,4}, |
|
{"dpm_nf",Pdpm_nf,4}, |
|
{"dpm_sp",Pdpm_sp,2}, |
|
{"dpm_weyl_sp",Pdpm_weyl_sp,2}, |
|
|
{"dp_true_nf",Pdp_true_nf,4}, |
{"dp_true_nf",Pdp_true_nf,4}, |
|
{"dp_true_nf_mod",Pdp_true_nf_mod,5}, |
{"dp_true_nf_marked",Pdp_true_nf_marked,4}, |
{"dp_true_nf_marked",Pdp_true_nf_marked,4}, |
|
{"dp_true_nf_marked_mod",Pdp_true_nf_marked_mod,5}, |
|
|
|
{"dp_true_nf_and_quotient",Pdp_true_nf_and_quotient,3}, |
|
{"dp_true_nf_and_quotient_mod",Pdp_true_nf_and_quotient_mod,4}, |
{"dp_true_nf_and_quotient_marked",Pdp_true_nf_and_quotient_marked,4}, |
{"dp_true_nf_and_quotient_marked",Pdp_true_nf_and_quotient_marked,4}, |
{"dp_true_nf_and_quotient_marked_mod",Pdp_true_nf_and_quotient_marked_mod,5}, |
{"dp_true_nf_and_quotient_marked_mod",Pdp_true_nf_and_quotient_marked_mod,5}, |
{"dp_true_nf_marked_mod",Pdp_true_nf_marked_mod,5}, |
|
{"dp_nf_mod",Pdp_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}, |
{"dp_nf_tab_f",Pdp_nf_tab_f,2}, |
{"dp_nf_tab_f",Pdp_nf_tab_f,2}, |
{"dp_nf_tab_mod",Pdp_nf_tab_mod,3}, |
{"dp_nf_tab_mod",Pdp_nf_tab_mod,3}, |
Line 162 struct ftab dp_tab[] = { |
|
Line 183 struct ftab dp_tab[] = { |
|
{"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_f4_trace",Pnd_f4_trace,-5}, |
{"nd_gr_postproc",Pnd_gr_postproc,5}, |
{"nd_gr_postproc",Pnd_gr_postproc,5}, |
{"nd_gr_recompute_trace",Pnd_gr_recompute_trace,5}, |
{"nd_gr_recompute_trace",Pnd_gr_recompute_trace,5}, |
{"nd_btog",Pnd_btog,-6}, |
{"nd_btog",Pnd_btog,-6}, |
{"nd_weyl_gr_postproc",Pnd_weyl_gr_postproc,5}, |
{"nd_weyl_gr_postproc",Pnd_weyl_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}, |
{"nd_weyl_nf",Pnd_weyl_nf,5}, |
{"nd_weyl_nf",Pnd_weyl_nf,5}, |
|
|
Line 183 struct ftab dp_tab[] = { |
|
Line 204 struct ftab dp_tab[] = { |
|
/* multiplication */ |
/* multiplication */ |
{"dp_weyl_mul",Pdp_weyl_mul,2}, |
{"dp_weyl_mul",Pdp_weyl_mul,2}, |
{"dp_weyl_mul_mod",Pdp_weyl_mul_mod,3}, |
{"dp_weyl_mul_mod",Pdp_weyl_mul_mod,3}, |
|
{"dp_weyl_act",Pdp_weyl_act,2}, |
|
|
/* s-poly */ |
/* s-poly */ |
{"dp_weyl_sp",Pdp_weyl_sp,2}, |
{"dp_weyl_sp",Pdp_weyl_sp,2}, |
Line 192 struct ftab dp_tab[] = { |
|
Line 214 struct ftab dp_tab[] = { |
|
|
|
/* normal form */ |
/* normal form */ |
{"dp_weyl_nf",Pdp_weyl_nf,4}, |
{"dp_weyl_nf",Pdp_weyl_nf,4}, |
|
{"dpm_weyl_nf",Pdpm_weyl_nf,4}, |
{"dp_weyl_nf_mod",Pdp_weyl_nf_mod,5}, |
{"dp_weyl_nf_mod",Pdp_weyl_nf_mod,5}, |
{"dp_weyl_nf_f",Pdp_weyl_nf_f,4}, |
{"dp_weyl_nf_f",Pdp_weyl_nf_f,4}, |
|
|
|
{"dp_weyl_true_nf_and_quotient",Pdp_weyl_true_nf_and_quotient,3}, |
|
{"dp_weyl_true_nf_and_quotient_mod",Pdp_weyl_true_nf_and_quotient_mod,4}, |
|
{"dp_weyl_true_nf_and_quotient_marked",Pdp_weyl_true_nf_and_quotient_marked,4}, |
|
{"dp_weyl_true_nf_and_quotient_marked_mod",Pdp_weyl_true_nf_and_quotient_marked_mod,5}, |
|
|
|
|
/* Buchberger algorithm */ |
/* Buchberger algorithm */ |
{"dp_weyl_gr_main",Pdp_weyl_gr_main,-5}, |
{"dp_weyl_gr_main",Pdp_weyl_gr_main,-5}, |
{"dp_weyl_gr_mod_main",Pdp_weyl_gr_mod_main,5}, |
{"dp_weyl_gr_mod_main",Pdp_weyl_gr_mod_main,5}, |
Line 219 struct ftab dp_supp_tab[] = { |
|
Line 248 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}, |
|
{"dpm_ord",Pdpm_ord,-1}, |
{"dpv_ord",Pdpv_ord,-2}, |
{"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}, |
Line 239 struct ftab dp_supp_tab[] = { |
|
Line 269 struct ftab dp_supp_tab[] = { |
|
{"dp_rat",Pdp_rat,1}, |
{"dp_rat",Pdp_rat,1}, |
{"dp_ltod",Pdp_ltod,-2}, |
{"dp_ltod",Pdp_ltod,-2}, |
|
|
|
{"dpm_ltod",Pdpm_ltod,2}, |
|
{"dpm_dtol",Pdpm_dtol,3}, |
|
|
/* criteria */ |
/* criteria */ |
{"dp_cri1",Pdp_cri1,2}, |
{"dp_cri1",Pdp_cri1,2}, |
{"dp_cri2",Pdp_cri2,2}, |
{"dp_cri2",Pdp_cri2,2}, |
Line 253 struct ftab dp_supp_tab[] = { |
|
Line 286 struct ftab dp_supp_tab[] = { |
|
{"dpv_hm",Pdpv_hm,1}, |
{"dpv_hm",Pdpv_hm,1}, |
{"dpv_ht",Pdpv_ht,1}, |
{"dpv_ht",Pdpv_ht,1}, |
{"dpv_hc",Pdpv_hc,1}, |
{"dpv_hc",Pdpv_hc,1}, |
|
{"dpm_hm",Pdpm_hm,1}, |
|
{"dpm_ht",Pdpm_ht,1}, |
|
{"dpm_hc",Pdpm_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 360 void Pdp_compute_essential_df(NODE arg,LIST *rp) |
|
Line 396 void Pdp_compute_essential_df(NODE arg,LIST *rp) |
|
MKLIST(*rp,r); |
MKLIST(*rp,r); |
} |
} |
|
|
void Pdp_inv_or_split(arg,rp) |
void Pdp_inv_or_split(NODE arg,Obj *rp) |
NODE arg; |
|
Obj *rp; |
|
{ |
{ |
NODE gb,newgb; |
NODE gb,newgb; |
DP f,inv; |
DP f,inv; |
|
|
} |
} |
} |
} |
|
|
void Pdp_sort(arg,rp) |
void Pdp_sort(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
dp_sort((DP)ARG0(arg),rp); |
dp_sort((DP)ARG0(arg),rp); |
} |
} |
|
|
void Pdp_mdtod(arg,rp) |
void Pdp_mdtod(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
DP p; |
DP p; |
|
|
*rp = 0; |
*rp = 0; |
else { |
else { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
mptop(m->c,&t); NEXTMP(mr0,mr); mr->c = t; mr->dl = m->dl; |
mptop((P)m->c,&t); NEXTMP(mr0,mr); mr->c = (Obj)t; mr->dl = m->dl; |
} |
} |
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
} |
} |
} |
} |
|
|
void Pdp_sep(arg,rp) |
void Pdp_sep(NODE arg,VECT *rp) |
NODE arg; |
|
VECT *rp; |
|
{ |
{ |
DP p,r; |
DP p,r; |
MP m,t; |
MP m,t; |
|
|
} |
} |
} |
} |
|
|
void Pdp_idiv(arg,rp) |
void Pdp_idiv(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
dp_idiv((DP)ARG0(arg),(Q)ARG1(arg),rp); |
dp_idiv((DP)ARG0(arg),(Q)ARG1(arg),rp); |
} |
} |
|
|
void Pdp_cont(arg,rp) |
void Pdp_cont(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
dp_cont((DP)ARG0(arg),rp); |
dp_cont((DP)ARG0(arg),rp); |
} |
} |
|
|
void Pdp_dtov(arg,rp) |
void Pdp_dtov(NODE arg,VECT *rp) |
NODE arg; |
|
VECT *rp; |
|
{ |
{ |
dp_dtov((DP)ARG0(arg),rp); |
dp_dtov((DP)ARG0(arg),rp); |
} |
} |
|
|
void Pdp_mbase(arg,rp) |
void Pdp_mbase(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE mb; |
NODE mb; |
|
|
|
|
MKLIST(*rp,mb); |
MKLIST(*rp,mb); |
} |
} |
|
|
void Pdp_etov(arg,rp) |
void Pdp_etov(NODE arg,VECT *rp) |
NODE arg; |
|
VECT *rp; |
|
{ |
{ |
DP dp; |
DP dp; |
int n,i; |
int n,i; |
|
|
*rp = v; |
*rp = v; |
} |
} |
|
|
void Pdp_vtoe(arg,rp) |
void Pdp_vtoe(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP dp; |
DP dp; |
DL dl; |
DL dl; |
|
|
d[i] = QTOS((Q)(v->body[i])); td += MUL_WEIGHT(d[i],i); |
d[i] = QTOS((Q)(v->body[i])); td += MUL_WEIGHT(d[i],i); |
} |
} |
dl->td = td; |
dl->td = td; |
NEWMP(m); m->dl = dl; m->c = (P)ONE; NEXT(m) = 0; |
NEWMP(m); m->dl = dl; m->c = (Obj)ONE; NEXT(m) = 0; |
MKDP(n,m,dp); dp->sugar = td; |
MKDP(n,m,dp); dp->sugar = td; |
*rp = dp; |
*rp = dp; |
} |
} |
|
|
void Pdp_lnf_mod(arg,rp) |
void Pdp_lnf_mod(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
DP r1,r2; |
DP r1,r2; |
NODE b,g,n; |
NODE b,g,n; |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_lnf_f(arg,rp) |
void Pdp_lnf_f(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
DP r1,r2; |
DP r1,r2; |
NODE b,g,n; |
NODE b,g,n; |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_nf_tab_mod(arg,rp) |
void Pdp_nf_tab_mod(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_nf_tab_mod"); |
asir_assert(ARG0(arg),O_DP,"dp_nf_tab_mod"); |
asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_mod"); |
asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_mod"); |
|
|
QTOS((Q)ARG2(arg)),rp); |
QTOS((Q)ARG2(arg)),rp); |
} |
} |
|
|
void Pdp_nf_tab_f(arg,rp) |
void Pdp_nf_tab_f(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_nf_tab_f"); |
asir_assert(ARG0(arg),O_DP,"dp_nf_tab_f"); |
asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_f"); |
asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_f"); |
dp_nf_tab_f((DP)ARG0(arg),(LIST *)BDY((VECT)ARG1(arg)),rp); |
dp_nf_tab_f((DP)ARG0(arg),(LIST *)BDY((VECT)ARG1(arg)),rp); |
} |
} |
|
|
void Pdp_ord(arg,rp) |
void Pdp_ord(NODE arg,Obj *rp) |
NODE arg; |
|
Obj *rp; |
|
{ |
{ |
struct order_spec *spec; |
struct order_spec *spec; |
LIST v; |
LIST v; |
|
|
} |
} |
} |
} |
|
|
void Pdp_ptod(arg,rp) |
void Pdp_ptod(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
P p; |
P p; |
NODE n; |
NODE n; |
|
|
ptod(CO,vl,p,rp); |
ptod(CO,vl,p,rp); |
} |
} |
|
|
void Phomogenize(arg,rp) |
void Phomogenize(NODE arg,Obj *rp) |
NODE arg; |
|
P *rp; |
|
{ |
{ |
P p; |
P p; |
DP d,h; |
DP d,h; |
|
|
dtop(CO,vl,h,rp); |
dtop(CO,vl,h,rp); |
} |
} |
|
|
void Pdp_ltod(arg,rp) |
void Pdp_ltod(NODE arg,DPV *rp) |
NODE arg; |
|
DPV *rp; |
|
{ |
{ |
NODE n; |
NODE n; |
VL vl,tvl; |
VL vl,tvl; |
|
|
MKDPV(len,e,*rp); |
MKDPV(len,e,*rp); |
} |
} |
|
|
void Pdp_dtop(arg,rp) |
void Pdpm_ltod(NODE arg,DPM *rp) |
NODE arg; |
|
P *rp; |
|
{ |
{ |
NODE n; |
NODE n; |
VL vl,tvl; |
VL vl,tvl; |
|
LIST f,v; |
|
int i,len; |
|
NODE nd; |
|
NODE t; |
|
DP d; |
|
DPM s,u,w; |
|
|
|
f = (LIST)ARG0(arg); |
|
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); |
|
for ( i = 0, t = nd, s = 0; i < len; i++, t = NEXT(t) ) { |
|
ptod(CO,vl,(P)BDY(t),&d); |
|
dtodpm(d,i,&u); |
|
adddpm(CO,s,u,&w); s = w; |
|
} |
|
*rp = s; |
|
} |
|
|
|
void Pdpm_dtol(NODE arg,LIST *rp) |
|
{ |
|
DPM a; |
|
NODE nd,nd1; |
|
VL vl,tvl; |
|
int n,len,i,pos,nv; |
|
MP *w; |
|
DMM t; |
|
DMM *wa; |
|
MP m; |
|
DP u; |
|
Obj s; |
|
|
|
a = (DPM)ARG0(arg); |
|
for ( vl = 0, nd = BDY((LIST)ARG1(arg)), nv = 0; nd; nd = NEXT(nd), nv++ ) { |
|
if ( !vl ) { |
|
NEWVL(vl); tvl = vl; |
|
} else { |
|
NEWVL(NEXT(tvl)); tvl = NEXT(tvl); |
|
} |
|
VR(tvl) = VR((P)BDY(nd)); |
|
} |
|
if ( vl ) |
|
NEXT(tvl) = 0; |
|
n = QTOS((Q)ARG2(arg)); |
|
w = (MP *)CALLOC(n,sizeof(MP)); |
|
for ( t = BDY(a), len = 0; t; t = NEXT(t) ) len++; |
|
wa = (DMM *)MALLOC(len*sizeof(DMM)); |
|
for ( t = BDY(a), i = 0; t; t = NEXT(t), i++ ) wa[i] = t; |
|
for ( i = len-1; i >= 0; i-- ) { |
|
NEWMP(m); m->dl = wa[i]->dl; C(m) = C(wa[i]); |
|
pos = wa[i]->pos; |
|
NEXT(m) = w[pos]; |
|
w[pos] = m; |
|
} |
|
nd = 0; |
|
for ( i = n-1; i >= 0; i-- ) { |
|
MKDP(nv,w[i],u); u->sugar = a->sugar; /* XXX */ |
|
dtop(CO,vl,u,&s); |
|
MKNODE(nd1,s,nd); nd = nd1; |
|
} |
|
MKLIST(*rp,nd); |
|
} |
|
|
|
void Pdp_dtop(NODE arg,Obj *rp) |
|
{ |
|
NODE n; |
|
VL vl,tvl; |
|
|
asir_assert(ARG0(arg),O_DP,"dp_dtop"); |
asir_assert(ARG0(arg),O_DP,"dp_dtop"); |
asir_assert(ARG1(arg),O_LIST,"dp_dtop"); |
asir_assert(ARG1(arg),O_LIST,"dp_dtop"); |
for ( vl = 0, n = BDY((LIST)ARG1(arg)); n; n = NEXT(n) ) { |
for ( vl = 0, n = BDY((LIST)ARG1(arg)); n; n = NEXT(n) ) { |
|
|
|
|
extern LIST Dist; |
extern LIST Dist; |
|
|
void Pdp_ptozp(arg,rp) |
void Pdp_ptozp(NODE arg,Obj *rp) |
NODE arg; |
|
Obj *rp; |
|
{ |
{ |
Q t; |
Q t; |
NODE tt,p; |
NODE tt,p; |
|
|
*rp = (Obj)pp; |
*rp = (Obj)pp; |
} |
} |
|
|
void Pdp_ptozp2(arg,rp) |
void Pdp_ptozp2(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
DP p0,p1,h,r; |
DP p0,p1,h,r; |
NODE n0; |
NODE n0; |
|
|
MKLIST(*rp,n0); |
MKLIST(*rp,n0); |
} |
} |
|
|
void Pdp_prim(arg,rp) |
void Pdp_prim(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP t; |
DP t; |
|
|
|
|
dp_prim((DP)ARG0(arg),&t); dp_ptozp(t,rp); |
dp_prim((DP)ARG0(arg),&t); dp_ptozp(t,rp); |
} |
} |
|
|
void Pdp_mod(arg,rp) |
void Pdp_mod(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p; |
DP p; |
int mod; |
int mod; |
|
|
dp_mod(p,mod,subst,rp); |
dp_mod(p,mod,subst,rp); |
} |
} |
|
|
void Pdp_rat(arg,rp) |
void Pdp_rat(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_rat"); |
asir_assert(ARG0(arg),O_DP,"dp_rat"); |
dp_rat((DP)ARG0(arg),rp); |
dp_rat((DP)ARG0(arg),rp); |
|
|
|
|
extern int DP_Multiple; |
extern int DP_Multiple; |
|
|
void Pdp_nf(arg,rp) |
void Pdp_nf(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
NODE b; |
NODE b; |
DP *ps; |
DP *ps; |
|
|
dp_nf_z(b,g,ps,full,DP_Multiple,rp); |
dp_nf_z(b,g,ps,full,DP_Multiple,rp); |
} |
} |
|
|
void Pdp_weyl_nf(arg,rp) |
void Pdp_weyl_nf(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
NODE b; |
NODE b; |
DP *ps; |
DP *ps; |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
|
void Pdpm_nf(NODE arg,DP *rp) |
|
{ |
|
NODE b; |
|
DPM *ps; |
|
DPM g; |
|
int full; |
|
|
|
if ( !(g = (DPM)ARG1(arg)) ) { |
|
*rp = 0; return; |
|
} |
|
do_weyl = 0; dp_fcoeffs = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dpm_nf"); |
|
asir_assert(ARG1(arg),O_DPM,"dpm_nf"); |
|
asir_assert(ARG2(arg),O_VECT,"dpm_nf"); |
|
asir_assert(ARG3(arg),O_N,"dpm_nf"); |
|
b = BDY((LIST)ARG0(arg)); ps = (DPM *)BDY((VECT)ARG2(arg)); |
|
full = (Q)ARG3(arg) ? 1 : 0; |
|
dpm_nf_z(b,g,ps,full,DP_Multiple,rp); |
|
} |
|
|
|
void Pdpm_weyl_nf(NODE arg,DPM *rp) |
|
{ |
|
NODE b; |
|
DPM *ps; |
|
DPM g; |
|
int full; |
|
|
|
if ( !(g = (DPM)ARG1(arg)) ) { |
|
*rp = 0; return; |
|
} |
|
asir_assert(ARG0(arg),O_LIST,"dpm_weyl_nf"); |
|
asir_assert(ARG1(arg),O_DPM,"dpm_weyl_nf"); |
|
asir_assert(ARG2(arg),O_VECT,"dpm_weyl_nf"); |
|
asir_assert(ARG3(arg),O_N,"dpm_weyl_nf"); |
|
b = BDY((LIST)ARG0(arg)); ps = (DPM *)BDY((VECT)ARG2(arg)); |
|
full = (Q)ARG3(arg) ? 1 : 0; |
|
do_weyl = 1; |
|
dpm_nf_z(b,g,ps,full,DP_Multiple,rp); |
|
do_weyl = 0; |
|
} |
|
|
/* nf computation using field operations */ |
/* nf computation using field operations */ |
|
|
void Pdp_nf_f(arg,rp) |
void Pdp_nf_f(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
NODE b; |
NODE b; |
DP *ps; |
DP *ps; |
|
|
dp_nf_f(b,g,ps,full,rp); |
dp_nf_f(b,g,ps,full,rp); |
} |
} |
|
|
void Pdp_weyl_nf_f(arg,rp) |
void Pdp_weyl_nf_f(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
NODE b; |
NODE b; |
DP *ps; |
DP *ps; |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_nf_mod(arg,rp) |
void Pdpm_nf_f(NODE arg,DPM *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
NODE b; |
NODE b; |
|
DPM *ps; |
|
DPM g; |
|
int full; |
|
|
|
if ( !(g = (DPM)ARG1(arg)) ) { |
|
*rp = 0; return; |
|
} |
|
asir_assert(ARG0(arg),O_LIST,"dpm_nf_f"); |
|
asir_assert(ARG1(arg),O_DPM,"dpm_nf_f"); |
|
asir_assert(ARG2(arg),O_VECT,"dpm_nf_f"); |
|
asir_assert(ARG3(arg),O_N,"dpm_nf_f"); |
|
b = BDY((LIST)ARG0(arg)); ps = (DPM *)BDY((VECT)ARG2(arg)); |
|
full = (Q)ARG3(arg) ? 1 : 0; |
|
dpm_nf_f(b,g,ps,full,rp); |
|
} |
|
|
|
void Pdpm_weyl_nf_f(NODE arg,DPM *rp) |
|
{ |
|
NODE b; |
|
DPM *ps; |
|
DPM g; |
|
int full; |
|
|
|
if ( !(g = (DPM)ARG1(arg)) ) { |
|
*rp = 0; return; |
|
} |
|
asir_assert(ARG0(arg),O_LIST,"dpm_weyl_nf_f"); |
|
asir_assert(ARG1(arg),O_DP,"dpm_weyl_nf_f"); |
|
asir_assert(ARG2(arg),O_VECT,"dpm_weyl_nf_f"); |
|
asir_assert(ARG3(arg),O_N,"dpm_weyl_nf_f"); |
|
b = BDY((LIST)ARG0(arg)); ps = (DPM *)BDY((VECT)ARG2(arg)); |
|
full = (Q)ARG3(arg) ? 1 : 0; |
|
do_weyl = 1; |
|
dpm_nf_f(b,g,ps,full,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
|
|
void Pdp_nf_mod(NODE arg,DP *rp) |
|
{ |
|
NODE b; |
DP g; |
DP g; |
DP *ps; |
DP *ps; |
int mod,full,ac; |
int mod,full,ac; |
|
|
dp_nf_mod(n0,g,ps,mod,full,rp); |
dp_nf_mod(n0,g,ps,mod,full,rp); |
} |
} |
|
|
void Pdp_true_nf(arg,rp) |
void Pdp_true_nf(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE b,n; |
NODE b,n; |
DP *ps; |
DP *ps; |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_true_nf_marked(arg,rp) |
DP *dp_true_nf_and_quotient_marked(NODE b,DP g,DP *ps,DP *hps,DP *rp,P *dnp); |
NODE arg; |
|
LIST *rp; |
void Pdp_true_nf_and_quotient_marked(NODE arg,LIST *rp) |
{ |
{ |
NODE b,n; |
NODE b,n; |
DP *ps,*hps; |
DP *ps,*hps; |
DP g; |
DP g; |
DP nm; |
DP nm; |
Q cont; |
VECT quo; |
P dn; |
P dn; |
int full; |
int full; |
|
|
do_weyl = 0; dp_fcoeffs = 0; |
do_weyl = 0; dp_fcoeffs = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf_marked"); |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf_and_quotient_marked"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf_marked"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf_and_quotient_marked"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf_marked"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf_and_quotient_marked"); |
asir_assert(ARG3(arg),O_VECT,"dp_true_nf_marked"); |
asir_assert(ARG3(arg),O_VECT,"dp_true_nf_and_quotient_marked"); |
if ( !(g = (DP)ARG1(arg)) ) { |
if ( !(g = (DP)ARG1(arg)) ) { |
nm = 0; dn = (P)ONE; |
nm = 0; dn = (P)ONE; |
} else { |
} else { |
b = BDY((LIST)ARG0(arg)); |
b = BDY((LIST)ARG0(arg)); |
ps = (DP *)BDY((VECT)ARG2(arg)); |
ps = (DP *)BDY((VECT)ARG2(arg)); |
hps = (DP *)BDY((VECT)ARG3(arg)); |
hps = (DP *)BDY((VECT)ARG3(arg)); |
dp_true_nf_marked(b,g,ps,hps,&nm,&cont,&dn); |
NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len; |
|
quo->body = (pointer *)dp_true_nf_and_quotient_marked(b,g,ps,hps,&nm,&dn); |
} |
} |
n = mknode(3,nm,cont,dn); |
n = mknode(3,nm,dn,quo); |
MKLIST(*rp,n); |
MKLIST(*rp,n); |
} |
} |
|
|
DP *dp_true_nf_and_quotient_marked (NODE b,DP g,DP *ps,DP *hps,DP *rp,P *dnp); |
void Pdp_true_nf_and_quotient(NODE arg,LIST *rp) |
|
{ |
|
NODE narg = mknode(4,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg)); |
|
Pdp_true_nf_and_quotient_marked(narg,rp); |
|
} |
|
|
void Pdp_true_nf_and_quotient_marked(arg,rp) |
|
NODE arg; |
DP *dp_true_nf_and_quotient_marked_mod (NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp); |
LIST *rp; |
|
|
void Pdp_true_nf_and_quotient_marked_mod(NODE arg,LIST *rp) |
{ |
{ |
NODE b,n; |
NODE b,n; |
DP *ps,*hps; |
DP *ps,*hps; |
|
|
DP nm; |
DP nm; |
VECT quo; |
VECT quo; |
P dn; |
P dn; |
int full; |
int full,mod; |
|
|
do_weyl = 0; dp_fcoeffs = 0; |
do_weyl = 0; dp_fcoeffs = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf_and_quotient_marked"); |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf_and_quotient_marked_mod"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf_and_quotient_marked"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf_and_quotient_marked_mod"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf_and_quotient_marked"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf_and_quotient_marked_mod"); |
asir_assert(ARG3(arg),O_VECT,"dp_true_nf_and_quotient_marked"); |
asir_assert(ARG3(arg),O_VECT,"dp_true_nf_and_quotient_marked_mod"); |
|
asir_assert(ARG4(arg),O_N,"dp_true_nf_and_quotient_marked_mod"); |
if ( !(g = (DP)ARG1(arg)) ) { |
if ( !(g = (DP)ARG1(arg)) ) { |
nm = 0; dn = (P)ONE; |
nm = 0; dn = (P)ONE; |
} else { |
} else { |
b = BDY((LIST)ARG0(arg)); |
b = BDY((LIST)ARG0(arg)); |
ps = (DP *)BDY((VECT)ARG2(arg)); |
ps = (DP *)BDY((VECT)ARG2(arg)); |
hps = (DP *)BDY((VECT)ARG3(arg)); |
hps = (DP *)BDY((VECT)ARG3(arg)); |
|
mod = QTOS((Q)ARG4(arg)); |
NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len; |
NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len; |
quo->body = (pointer *)dp_true_nf_and_quotient_marked(b,g,ps,hps,&nm,&dn); |
quo->body = (pointer *)dp_true_nf_and_quotient_marked_mod(b,g,ps,hps,mod,&nm,&dn); |
} |
} |
n = mknode(3,nm,dn,quo); |
n = mknode(3,nm,dn,quo); |
MKLIST(*rp,n); |
MKLIST(*rp,n); |
} |
} |
|
|
DP *dp_true_nf_and_quotient_marked_mod (NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp); |
void Pdp_true_nf_and_quotient_mod(NODE arg,LIST *rp) |
|
{ |
|
NODE narg = mknode(5,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg),ARG3(arg)); |
|
Pdp_true_nf_and_quotient_marked_mod(narg,rp); |
|
} |
|
|
void Pdp_true_nf_and_quotient_marked_mod(arg,rp) |
void Pdp_true_nf_marked(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE b,n; |
NODE b,n; |
DP *ps,*hps; |
DP *ps,*hps; |
DP g; |
DP g; |
DP nm; |
DP nm; |
VECT quo; |
Q cont; |
P dn; |
P dn; |
int full,mod; |
int full; |
|
|
do_weyl = 0; dp_fcoeffs = 0; |
do_weyl = 0; dp_fcoeffs = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf_and_quotient_marked_mod"); |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf_marked"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf_and_quotient_marked_mod"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf_marked"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf_and_quotient_marked_mod"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf_marked"); |
asir_assert(ARG3(arg),O_VECT,"dp_true_nf_and_quotient_marked_mod"); |
asir_assert(ARG3(arg),O_VECT,"dp_true_nf_marked"); |
asir_assert(ARG4(arg),O_N,"dp_true_nf_and_quotient_marked_mod"); |
|
if ( !(g = (DP)ARG1(arg)) ) { |
if ( !(g = (DP)ARG1(arg)) ) { |
nm = 0; dn = (P)ONE; |
nm = 0; dn = (P)ONE; |
} else { |
} else { |
b = BDY((LIST)ARG0(arg)); |
b = BDY((LIST)ARG0(arg)); |
ps = (DP *)BDY((VECT)ARG2(arg)); |
ps = (DP *)BDY((VECT)ARG2(arg)); |
hps = (DP *)BDY((VECT)ARG3(arg)); |
hps = (DP *)BDY((VECT)ARG3(arg)); |
mod = QTOS((Q)ARG4(arg)); |
dp_true_nf_marked(b,g,ps,hps,&nm,(P *)&cont,(P *)&dn); |
NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len; |
|
quo->body = (pointer *)dp_true_nf_and_quotient_marked_mod(b,g,ps,hps,mod,&nm,&dn); |
|
} |
} |
n = mknode(3,nm,dn,quo); |
n = mknode(3,nm,cont,dn); |
MKLIST(*rp,n); |
MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_true_nf_marked_mod(arg,rp) |
void Pdp_true_nf_marked_mod(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE b,n; |
NODE b,n; |
DP *ps,*hps; |
DP *ps,*hps; |
|
|
MKLIST(*rp,n); |
MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_weyl_nf_mod(arg,rp) |
void Pdp_weyl_nf_mod(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
NODE b; |
NODE b; |
DP g; |
DP g; |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_true_nf_mod(arg,rp) |
void Pdp_true_nf_mod(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE b; |
NODE b; |
DP g,nm; |
DP g,nm; |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_tdiv(arg,rp) |
void Pdp_weyl_true_nf_and_quotient_marked(NODE arg,LIST *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
|
NODE b,n; |
|
DP *ps,*hps; |
|
DP g; |
|
DP nm; |
|
VECT quo; |
|
P dn; |
|
int full; |
|
|
|
do_weyl = 1; dp_fcoeffs = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_true_nf_and_quotient_marked"); |
|
asir_assert(ARG1(arg),O_DP,"dp_weyl_true_nf_and_quotient_marked"); |
|
asir_assert(ARG2(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked"); |
|
asir_assert(ARG3(arg),O_VECT,"dp_weyl_true_nf_and_quotient_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)); |
|
NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len; |
|
quo->body = (pointer *)dp_true_nf_and_quotient_marked(b,g,ps,hps,&nm,&dn); |
|
} |
|
n = mknode(3,nm,dn,quo); |
|
MKLIST(*rp,n); |
|
} |
|
|
|
void Pdp_weyl_true_nf_and_quotient(NODE arg,LIST *rp) |
|
{ |
|
NODE narg = mknode(4,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg)); |
|
Pdp_weyl_true_nf_and_quotient_marked(narg,rp); |
|
} |
|
|
|
|
|
void Pdp_weyl_true_nf_and_quotient_marked_mod(NODE arg,LIST *rp) |
|
{ |
|
NODE b,n; |
|
DP *ps,*hps; |
|
DP g; |
|
DP nm; |
|
VECT quo; |
|
P dn; |
|
int full,mod; |
|
|
|
do_weyl = 1; dp_fcoeffs = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_true_nf_and_quotient_marked_mod"); |
|
asir_assert(ARG1(arg),O_DP,"dp_weyl_true_nf_and_quotient_marked_mod"); |
|
asir_assert(ARG2(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked_mod"); |
|
asir_assert(ARG3(arg),O_VECT,"dp_weyl_true_nf_and_quotient_marked_mod"); |
|
asir_assert(ARG4(arg),O_N,"dp_weyl_true_nf_and_quotient_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)); |
|
NEWVECT(quo); quo->len = ((VECT)ARG2(arg))->len; |
|
quo->body = (pointer *)dp_true_nf_and_quotient_marked_mod(b,g,ps,hps,mod,&nm,&dn); |
|
} |
|
n = mknode(3,nm,dn,quo); |
|
MKLIST(*rp,n); |
|
} |
|
|
|
void Pdp_weyl_true_nf_and_quotient_mod(NODE arg,LIST *rp) |
|
{ |
|
NODE narg = mknode(5,ARG0(arg),ARG1(arg),ARG2(arg),ARG2(arg),ARG3(arg)); |
|
Pdp_weyl_true_nf_and_quotient_marked_mod(narg,rp); |
|
} |
|
|
|
|
|
void Pdp_tdiv(NODE arg,DP *rp) |
|
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
DP p; |
DP p; |
Q c; |
Q c; |
|
|
*rp = 0; return; |
*rp = 0; return; |
} else { |
} else { |
NEXTMP(mr0,mr); NTOQ(q,SGN((Q)m->c)*sgn,c); |
NEXTMP(mr0,mr); NTOQ(q,SGN((Q)m->c)*sgn,c); |
mr->c = (P)c; mr->dl = m->dl; |
mr->c = (Obj)c; mr->dl = m->dl; |
} |
} |
} |
} |
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
} |
} |
} |
} |
|
|
void Pdp_red_coef(arg,rp) |
void Pdp_red_coef(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
P q,r; |
P q,r; |
|
|
*rp = 0; |
*rp = 0; |
else { |
else { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
divsrp(CO,m->c,mod,&q,&r); |
divsrp(CO,(P)m->c,mod,&q,&r); |
if ( r ) { |
if ( r ) { |
NEXTMP(mr0,mr); mr->c = r; mr->dl = m->dl; |
NEXTMP(mr0,mr); mr->c = (Obj)r; mr->dl = m->dl; |
} |
} |
} |
} |
if ( mr0 ) { |
if ( mr0 ) { |
|
|
} |
} |
} |
} |
|
|
void Pdp_redble(arg,rp) |
void Pdp_redble(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_redble"); |
asir_assert(ARG0(arg),O_DP,"dp_redble"); |
asir_assert(ARG1(arg),O_DP,"dp_redble"); |
asir_assert(ARG1(arg),O_DP,"dp_redble"); |
|
|
*rp = 0; |
*rp = 0; |
} |
} |
|
|
void Pdp_red_mod(arg,rp) |
void Pdp_red_mod(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
DP h,r; |
DP h,r; |
P dmy; |
P dmy; |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_subd(arg,rp) |
void Pdp_subd(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p1,p2; |
DP p1,p2; |
|
|
|
|
dp_subd(p1,p2,rp); |
dp_subd(p1,p2,rp); |
} |
} |
|
|
void Pdp_symb_add(arg,rp) |
void Pdp_symb_add(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p1,p2,r; |
DP p1,p2,r; |
NODE s0; |
NODE s0; |
|
|
nv = p1->nv; |
nv = p1->nv; |
s0 = symb_merge(dp_dllist(p1),dp_dllist(p2),nv); |
s0 = symb_merge(dp_dllist(p1),dp_dllist(p2),nv); |
for ( mp0 = 0; s0; s0 = NEXT(s0) ) { |
for ( mp0 = 0; s0; s0 = NEXT(s0) ) { |
NEXTMP(mp0,mp); mp->dl = (DL)BDY(s0); mp->c = (P)ONE; |
NEXTMP(mp0,mp); mp->dl = (DL)BDY(s0); mp->c = (Obj)ONE; |
} |
} |
NEXT(mp) = 0; |
NEXT(mp) = 0; |
MKDP(nv,mp0,r); r->sugar = MAX(p1->sugar,p2->sugar); |
MKDP(nv,mp0,r); r->sugar = MAX(p1->sugar,p2->sugar); |
*rp = r; |
*rp = r; |
} |
} |
|
|
void Pdp_mul_trunc(arg,rp) |
void Pdp_mul_trunc(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p1,p2,p; |
DP p1,p2,p; |
|
|
|
|
comm_muld_trunc(CO,p1,p2,BDY(p)->dl,rp); |
comm_muld_trunc(CO,p1,p2,BDY(p)->dl,rp); |
} |
} |
|
|
void Pdp_quo(arg,rp) |
void Pdp_quo(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p1,p2; |
DP p1,p2; |
|
|
|
|
comm_quod(CO,p1,p2,rp); |
comm_quod(CO,p1,p2,rp); |
} |
} |
|
|
void Pdp_weyl_mul(arg,rp) |
void Pdp_weyl_mul(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p1,p2; |
DP p1,p2; |
|
|
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_weyl_mul_mod(arg,rp) |
void Pdp_weyl_act(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p1,p2; |
DP p1,p2; |
|
|
|
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
|
asir_assert(p1,O_DP,"dp_weyl_act"); asir_assert(p2,O_DP,"dp_weyl_act"); |
|
weyl_actd(CO,p1,p2,rp); |
|
} |
|
|
|
|
|
void Pdp_weyl_mul_mod(NODE arg,DP *rp) |
|
{ |
|
DP p1,p2; |
Q m; |
Q m; |
|
|
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); m = (Q)ARG2(arg); |
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); m = (Q)ARG2(arg); |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_red(arg,rp) |
void Pdp_red(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE n; |
NODE n; |
DP head,rest,dmy1; |
DP head,rest,dmy1; |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_weyl_red(arg,rp) |
void Pdp_weyl_red(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE n; |
NODE n; |
DP head,rest,dmy1; |
DP head,rest,dmy1; |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_sp(arg,rp) |
void Pdp_sp(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p1,p2; |
DP p1,p2; |
|
|
|
|
dp_sp(p1,p2,rp); |
dp_sp(p1,p2,rp); |
} |
} |
|
|
void Pdp_weyl_sp(arg,rp) |
void Pdp_weyl_sp(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p1,p2; |
DP p1,p2; |
|
|
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
asir_assert(p1,O_DP,"dp_weyl_sp"); asir_assert(p2,O_DP,"dp_sp"); |
asir_assert(p1,O_DP,"dp_weyl_sp"); asir_assert(p2,O_DP,"dp_weyl_sp"); |
do_weyl = 1; |
do_weyl = 1; |
dp_sp(p1,p2,rp); |
dp_sp(p1,p2,rp); |
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_sp_mod(arg,rp) |
void Pdpm_sp(NODE arg,DPM *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
|
DPM p1,p2; |
|
|
|
do_weyl = 0; |
|
p1 = (DPM)ARG0(arg); p2 = (DPM)ARG1(arg); |
|
asir_assert(p1,O_DPM,"dpm_sp"); asir_assert(p2,O_DPM,"dpm_sp"); |
|
dpm_sp(p1,p2,rp); |
|
} |
|
|
|
void Pdpm_weyl_sp(NODE arg,DPM *rp) |
|
{ |
|
DPM p1,p2; |
|
|
|
p1 = (DPM)ARG0(arg); p2 = (DPM)ARG1(arg); |
|
asir_assert(p1,O_DPM,"dpm_weyl_sp"); asir_assert(p2,O_DPM,"dpm_weyl_sp"); |
|
do_weyl = 1; |
|
dpm_sp(p1,p2,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
void Pdp_sp_mod(NODE arg,DP *rp) |
|
{ |
DP p1,p2; |
DP p1,p2; |
int mod; |
int mod; |
|
|
|
|
dp_sp_mod(p1,p2,mod,rp); |
dp_sp_mod(p1,p2,mod,rp); |
} |
} |
|
|
void Pdp_lcm(arg,rp) |
void Pdp_lcm(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
int i,n,td; |
int i,n,td; |
DL d1,d2,d; |
DL d1,d2,d; |
|
|
d->d[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(d->d[i],i); |
d->d[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(d->d[i],i); |
} |
} |
d->td = td; |
d->td = td; |
NEWMP(m); m->dl = d; m->c = (P)ONE; NEXT(m) = 0; |
NEWMP(m); m->dl = d; m->c = (Obj)ONE; NEXT(m) = 0; |
MKDP(n,m,*rp); (*rp)->sugar = td; /* XXX */ |
MKDP(n,m,*rp); (*rp)->sugar = td; /* XXX */ |
} |
} |
|
|
void Pdp_hm(arg,rp) |
void Pdp_hm(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p; |
DP p; |
|
|
|
|
dp_hm(p,rp); |
dp_hm(p,rp); |
} |
} |
|
|
void Pdp_ht(arg,rp) |
void Pdp_ht(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
DP p; |
DP p; |
MP m,mr; |
MP m,mr; |
|
|
dp_ht(p,rp); |
dp_ht(p,rp); |
} |
} |
|
|
void Pdp_hc(arg,rp) |
void Pdp_hc(NODE arg,Obj *rp) |
NODE arg; |
|
P *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_hc"); |
asir_assert(ARG0(arg),O_DP,"dp_hc"); |
if ( !ARG0(arg) ) |
if ( !ARG0(arg) ) |
|
|
*rp = BDY((DP)ARG0(arg))->c; |
*rp = BDY((DP)ARG0(arg))->c; |
} |
} |
|
|
void Pdp_rest(arg,rp) |
void Pdp_rest(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_rest"); |
asir_assert(ARG0(arg),O_DP,"dp_rest"); |
if ( !ARG0(arg) ) |
if ( !ARG0(arg) ) |
|
|
dp_rest((DP)ARG0(arg),rp); |
dp_rest((DP)ARG0(arg),rp); |
} |
} |
|
|
void Pdp_td(arg,rp) |
void Pdp_td(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
DP p; |
DP p; |
|
|
|
|
STOQ(BDY(p)->dl->td,*rp); |
STOQ(BDY(p)->dl->td,*rp); |
} |
} |
|
|
void Pdp_sugar(arg,rp) |
void Pdp_sugar(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
DP p; |
DP p; |
|
|
|
|
STOQ(p->sugar,*rp); |
STOQ(p->sugar,*rp); |
} |
} |
|
|
void Pdp_initial_term(arg,rp) |
void Pdp_initial_term(NODE arg,Obj *rp) |
NODE arg; |
|
Obj *rp; |
|
{ |
{ |
struct order_spec *ord; |
struct order_spec *ord; |
Num homo; |
Num homo; |
|
|
*rp = (Obj)initiallist; |
*rp = (Obj)initiallist; |
} |
} |
|
|
void Pdp_order(arg,rp) |
void Pdp_order(NODE arg,Obj *rp) |
NODE arg; |
|
Obj *rp; |
|
{ |
{ |
struct order_spec *ord; |
struct order_spec *ord; |
Num homo; |
Num homo; |
|
|
*rp = (Obj)ordlist; |
*rp = (Obj)ordlist; |
} |
} |
|
|
void Pdp_set_sugar(arg,rp) |
void Pdp_set_sugar(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
DP p; |
DP p; |
Q q; |
Q q; |
|
|
*rp = 0; |
*rp = 0; |
} |
} |
|
|
void Pdp_cri1(arg,rp) |
void Pdp_cri1(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
DP p1,p2; |
DP p1,p2; |
int *d1,*d2; |
int *d1,*d2; |
|
|
*rp = i == n ? ONE : 0; |
*rp = i == n ? ONE : 0; |
} |
} |
|
|
void Pdp_cri2(arg,rp) |
void Pdp_cri2(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
DP p1,p2; |
DP p1,p2; |
int *d1,*d2; |
int *d1,*d2; |
|
|
*rp = i == n ? ONE : 0; |
*rp = i == n ? ONE : 0; |
} |
} |
|
|
void Pdp_minp(arg,rp) |
void Pdp_minp(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE tn,tn1,d,dd,dd0,p,tp; |
NODE tn,tn1,d,dd,dd0,p,tp; |
LIST l,minp; |
LIST l,minp; |
|
|
MKLIST(l,dd0); MKNODE(tn,l,0); MKNODE(tn1,minp,tn); MKLIST(*rp,tn1); |
MKLIST(l,dd0); MKNODE(tn,l,0); MKNODE(tn1,minp,tn); MKLIST(*rp,tn1); |
} |
} |
|
|
void Pdp_criB(arg,rp) |
void Pdp_criB(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
NODE d,ij,dd,ddd; |
NODE d,ij,dd,ddd; |
int i,j,s,n; |
int i,j,s,n; |
|
|
} |
} |
} |
} |
|
|
void Pdp_nelim(arg,rp) |
void Pdp_nelim(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
if ( arg ) { |
if ( arg ) { |
asir_assert(ARG0(arg),O_N,"dp_nelim"); |
asir_assert(ARG0(arg),O_N,"dp_nelim"); |
|
|
STOQ(dp_nelim,*rp); |
STOQ(dp_nelim,*rp); |
} |
} |
|
|
void Pdp_mag(arg,rp) |
void Pdp_mag(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
DP p; |
DP p; |
int s; |
int s; |
|
|
*rp = 0; |
*rp = 0; |
else { |
else { |
for ( s = 0, m = BDY(p); m; m = NEXT(m) ) |
for ( s = 0, m = BDY(p); m; m = NEXT(m) ) |
s += p_mag(m->c); |
s += p_mag((P)m->c); |
STOQ(s,*rp); |
STOQ(s,*rp); |
} |
} |
} |
} |
|
|
extern int kara_mag; |
extern int kara_mag; |
|
|
void Pdp_set_kara(arg,rp) |
void Pdp_set_kara(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
if ( arg ) { |
if ( arg ) { |
asir_assert(ARG0(arg),O_N,"dp_set_kara"); |
asir_assert(ARG0(arg),O_N,"dp_set_kara"); |
|
|
STOQ(kara_mag,*rp); |
STOQ(kara_mag,*rp); |
} |
} |
|
|
void Pdp_homo(arg,rp) |
void Pdp_homo(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_homo"); |
asir_assert(ARG0(arg),O_DP,"dp_homo"); |
dp_homo((DP)ARG0(arg),rp); |
dp_homo((DP)ARG0(arg),rp); |
} |
} |
|
|
void Pdp_dehomo(arg,rp) |
void Pdp_dehomo(NODE arg,DP *rp) |
NODE arg; |
|
DP *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_dehomo"); |
asir_assert(ARG0(arg),O_DP,"dp_dehomo"); |
dp_dehomo((DP)ARG0(arg),rp); |
dp_dehomo((DP)ARG0(arg),rp); |
} |
} |
|
|
void Pdp_gr_flags(arg,rp) |
void Pdp_gr_flags(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
Obj name,value; |
Obj name,value; |
NODE n; |
NODE n; |
|
|
|
|
extern int DP_Print, DP_PrintShort; |
extern int DP_Print, DP_PrintShort; |
|
|
void Pdp_gr_print(arg,rp) |
void Pdp_gr_print(NODE arg,Q *rp) |
NODE arg; |
|
Q *rp; |
|
{ |
{ |
Q q; |
Q q; |
int s; |
int s; |
Line 1936 void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo |
|
Line 2104 void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo |
|
else |
else |
*modular = QTOS(m); |
*modular = QTOS(m); |
modular_is_set = 1; |
modular_is_set = 1; |
|
} else if ( !strcmp(key,"dp") ) { |
|
/* XXX : ignore */ |
} else |
} else |
error("parse_gr_option : not implemented"); |
error("parse_gr_option : not implemented"); |
} |
} |
Line 1944 void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo |
|
Line 2114 void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo |
|
if ( !homo_is_set ) *homo = 0; |
if ( !homo_is_set ) *homo = 0; |
} |
} |
|
|
void Pdp_gr_main(arg,rp) |
void Pdp_gr_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
VL vl; |
VL vl; |
|
|
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) |
void Pdp_interreduce(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
VL vl; |
VL vl; |
|
|
dp_interreduce(f,v,0,ord,rp); |
dp_interreduce(f,v,0,ord,rp); |
} |
} |
|
|
void Pdp_gr_f_main(arg,rp) |
void Pdp_gr_f_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
|
|
dp_gr_main(f,v,homo,m?1:0,field,ord,rp); |
dp_gr_main(f,v,homo,m?1:0,field,ord,rp); |
} |
} |
|
|
void Pdp_f4_main(arg,rp) |
void Pdp_f4_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
|
|
/* dp_gr_checklist(list of dp) */ |
/* dp_gr_checklist(list of dp) */ |
|
|
void Pdp_gr_checklist(arg,rp) |
void Pdp_gr_checklist(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
VECT g; |
VECT g; |
LIST dp; |
LIST dp; |
|
|
MKLIST(*rp,r); |
MKLIST(*rp,r); |
} |
} |
|
|
void Pdp_f4_mod_main(arg,rp) |
void Pdp_f4_mod_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m; |
int m; |
|
|
dp_f4_mod_main(f,v,m,ord,rp); |
dp_f4_mod_main(f,v,m,ord,rp); |
} |
} |
|
|
void Pdp_gr_mod_main(arg,rp) |
void Pdp_gr_mod_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
|
|
dp_gr_mod_main(f,v,homo,m,ord,rp); |
dp_gr_mod_main(f,v,homo,m,ord,rp); |
} |
} |
|
|
void Pnd_f4(arg,rp) |
void Pnd_f4(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo,retdp; |
int m,homo,retdp,ac; |
Obj val; |
Obj val; |
|
Q mq; |
|
Num nhomo; |
|
NODE node; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
nd_rref2 = 0; |
nd_rref2 = 0; |
asir_assert(ARG0(arg),O_LIST,"nd_f4"); |
retdp = 0; |
asir_assert(ARG1(arg),O_LIST,"nd_f4"); |
if ( (ac = argc(arg)) == 4 ) { |
asir_assert(ARG2(arg),O_N,"nd_f4"); |
asir_assert(ARG0(arg),O_LIST,"nd_f4"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
asir_assert(ARG1(arg),O_LIST,"nd_f4"); |
f = remove_zero_from_list(f); |
asir_assert(ARG2(arg),O_N,"nd_f4"); |
if ( !BDY(f) ) { |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
*rp = f; return; |
f = remove_zero_from_list(f); |
} |
if ( !BDY(f) ) { |
m = QTOS((Q)ARG2(arg)); |
*rp = f; return; |
create_order_spec(0,ARG3(arg),&ord); |
} |
homo = retdp = 0; |
mq = (Q)ARG2(arg); |
if ( get_opt("homo",&val) && val ) homo = 1; |
if ( mq && (PL(NM(mq)) > 1 || BD(NM(mq))[0] >= (1<<31)) ) { |
if ( get_opt("dp",&val) && val ) retdp = 1; |
node = mknode(1,mq); |
if ( get_opt("rref2",&val) && val ) nd_rref2 = 1; |
Psetmod_ff(node,&val); |
|
m = -2; |
|
} else |
|
m = QTOS(mq); |
|
create_order_spec(0,ARG3(arg),&ord); |
|
homo = 0; |
|
if ( get_opt("homo",&val) && val ) homo = 1; |
|
if ( get_opt("dp",&val) && val ) retdp = 1; |
|
if ( get_opt("rref2",&val) && val ) nd_rref2 = 1; |
|
} else if ( ac == 1 ) { |
|
f = (LIST)ARG0(arg); |
|
parse_gr_option(f,current_option,&v,&nhomo,&m,&ord); |
|
homo = QTOS((Q)nhomo); |
|
if ( get_opt("dp",&val) && val ) retdp = 1; |
|
if ( get_opt("rref2",&val) && val ) nd_rref2 = 1; |
|
} else |
|
error("nd_f4 : invalid argument"); |
nd_gr(f,v,m,homo,retdp,1,ord,rp); |
nd_gr(f,v,m,homo,retdp,1,ord,rp); |
} |
} |
|
|
void Pnd_gr(arg,rp) |
void Pnd_gr(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo,retdp; |
int m,homo,retdp,ac; |
Obj val; |
Obj val; |
|
Q mq; |
|
Num nhomo; |
|
NODE node; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"nd_gr"); |
retdp = 0; |
asir_assert(ARG1(arg),O_LIST,"nd_gr"); |
if ( (ac=argc(arg)) == 4 ) { |
asir_assert(ARG2(arg),O_N,"nd_gr"); |
asir_assert(ARG0(arg),O_LIST,"nd_gr"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
asir_assert(ARG1(arg),O_LIST,"nd_gr"); |
f = remove_zero_from_list(f); |
asir_assert(ARG2(arg),O_N,"nd_gr"); |
if ( !BDY(f) ) { |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
*rp = f; return; |
f = remove_zero_from_list(f); |
} |
if ( !BDY(f) ) { |
m = QTOS((Q)ARG2(arg)); |
*rp = f; return; |
create_order_spec(0,ARG3(arg),&ord); |
} |
homo = retdp = 0; |
mq = (Q)ARG2(arg); |
if ( get_opt("homo",&val) && val ) homo = 1; |
if ( mq && (PL(NM(mq)) > 1 || BD(NM(mq))[0] >= (1<<30)) ) { |
if ( get_opt("dp",&val) && val ) retdp = 1; |
node = mknode(1,mq); |
|
Psetmod_ff(node,&val); |
|
m = -2; |
|
} else |
|
m = QTOS(mq); |
|
create_order_spec(0,ARG3(arg),&ord); |
|
homo = 0; |
|
if ( get_opt("homo",&val) && val ) homo = 1; |
|
if ( get_opt("dp",&val) && val ) retdp = 1; |
|
} else if ( ac == 1 ) { |
|
f = (LIST)ARG0(arg); |
|
parse_gr_option(f,current_option,&v,&nhomo,&m,&ord); |
|
homo = QTOS((Q)nhomo); |
|
if ( get_opt("dp",&val) && val ) retdp = 1; |
|
} else |
|
error("nd_gr : invalid argument"); |
nd_gr(f,v,m,homo,retdp,0,ord,rp); |
nd_gr(f,v,m,homo,retdp,0,ord,rp); |
} |
} |
|
|
void Pnd_gr_postproc(arg,rp) |
void Pnd_gr_postproc(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,do_check; |
int m,do_check; |
|
Q mq; |
|
Obj val; |
|
NODE node; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
|
|
if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
*rp = f; return; |
*rp = f; return; |
} |
} |
m = QTOS((Q)ARG2(arg)); |
mq = (Q)ARG2(arg); |
|
if ( mq && (PL(NM(mq)) > 1 || BD(NM(mq))[0] >= (1<<30)) ) { |
|
node = mknode(1,mq); |
|
Psetmod_ff(node,&val); |
|
m = -2; |
|
} else |
|
m = QTOS(mq); |
create_order_spec(0,ARG3(arg),&ord); |
create_order_spec(0,ARG3(arg),&ord); |
do_check = ARG4(arg) ? 1 : 0; |
do_check = ARG4(arg) ? 1 : 0; |
nd_gr_postproc(f,v,m,ord,do_check,rp); |
nd_gr_postproc(f,v,m,ord,do_check,rp); |
} |
} |
|
|
void Pnd_gr_recompute_trace(arg,rp) |
void Pnd_gr_recompute_trace(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v,tlist; |
LIST f,v,tlist; |
int m; |
int m; |
|
|
Obj nd_btog_one(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,int pos); |
Obj nd_btog_one(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,int pos); |
Obj nd_btog(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist); |
Obj nd_btog(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist); |
|
|
void Pnd_btog(arg,rp) |
void Pnd_btog(NODE arg,Obj *rp) |
NODE arg; |
|
Obj *rp; |
|
{ |
{ |
LIST f,v,tlist; |
LIST f,v,tlist; |
int m,ac,pos; |
int m,ac,pos; |
|
|
error("nd_btog : argument mismatch"); |
error("nd_btog : argument mismatch"); |
} |
} |
|
|
void Pnd_weyl_gr_postproc(arg,rp) |
void Pnd_weyl_gr_postproc(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,do_check; |
int m,do_check; |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pnd_gr_trace(arg,rp) |
void Pnd_gr_trace(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo; |
int m,homo,ac; |
|
Num nhomo; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"nd_gr_trace"); |
if ( (ac = argc(arg)) == 5 ) { |
asir_assert(ARG1(arg),O_LIST,"nd_gr_trace"); |
asir_assert(ARG0(arg),O_LIST,"nd_gr_trace"); |
asir_assert(ARG2(arg),O_N,"nd_gr_trace"); |
asir_assert(ARG1(arg),O_LIST,"nd_gr_trace"); |
asir_assert(ARG3(arg),O_N,"nd_gr_trace"); |
asir_assert(ARG2(arg),O_N,"nd_gr_trace"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
asir_assert(ARG3(arg),O_N,"nd_gr_trace"); |
f = remove_zero_from_list(f); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
if ( !BDY(f) ) { |
f = remove_zero_from_list(f); |
*rp = f; return; |
if ( !BDY(f) ) { |
} |
*rp = f; return; |
homo = QTOS((Q)ARG2(arg)); |
} |
m = QTOS((Q)ARG3(arg)); |
homo = QTOS((Q)ARG2(arg)); |
create_order_spec(0,ARG4(arg),&ord); |
m = QTOS((Q)ARG3(arg)); |
|
create_order_spec(0,ARG4(arg),&ord); |
|
} else if ( ac == 1 ) { |
|
f = (LIST)ARG0(arg); |
|
parse_gr_option(f,current_option,&v,&nhomo,&m,&ord); |
|
homo = QTOS((Q)nhomo); |
|
} else |
|
error("nd_gr_trace : invalid argument"); |
nd_gr_trace(f,v,m,homo,0,ord,rp); |
nd_gr_trace(f,v,m,homo,0,ord,rp); |
} |
} |
|
|
void Pnd_f4_trace(arg,rp) |
void Pnd_f4_trace(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo; |
int m,homo,ac; |
|
Num nhomo; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"nd_gr_trace"); |
if ( (ac = argc(arg))==5 ) { |
asir_assert(ARG1(arg),O_LIST,"nd_gr_trace"); |
asir_assert(ARG0(arg),O_LIST,"nd_f4_trace"); |
asir_assert(ARG2(arg),O_N,"nd_gr_trace"); |
asir_assert(ARG1(arg),O_LIST,"nd_f4_trace"); |
asir_assert(ARG3(arg),O_N,"nd_gr_trace"); |
asir_assert(ARG2(arg),O_N,"nd_f4_trace"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
asir_assert(ARG3(arg),O_N,"nd_f4_trace"); |
f = remove_zero_from_list(f); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
if ( !BDY(f) ) { |
f = remove_zero_from_list(f); |
*rp = f; return; |
if ( !BDY(f) ) { |
} |
*rp = f; return; |
homo = QTOS((Q)ARG2(arg)); |
} |
m = QTOS((Q)ARG3(arg)); |
homo = QTOS((Q)ARG2(arg)); |
create_order_spec(0,ARG4(arg),&ord); |
m = QTOS((Q)ARG3(arg)); |
|
create_order_spec(0,ARG4(arg),&ord); |
|
} else if ( ac == 1 ) { |
|
f = (LIST)ARG0(arg); |
|
parse_gr_option(f,current_option,&v,&nhomo,&m,&ord); |
|
homo = QTOS((Q)nhomo); |
|
} else |
|
error("nd_gr_trace : invalid argument"); |
nd_gr_trace(f,v,m,homo,1,ord,rp); |
nd_gr_trace(f,v,m,homo,1,ord,rp); |
} |
} |
|
|
void Pnd_weyl_gr(arg,rp) |
void Pnd_weyl_gr(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo,retdp; |
int m,homo,retdp,ac; |
Obj val; |
Obj val; |
|
Num nhomo; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 1; |
do_weyl = 1; |
asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr"); |
retdp = 0; |
asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr"); |
if ( (ac = argc(arg)) == 4 ) { |
asir_assert(ARG2(arg),O_N,"nd_weyl_gr"); |
asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr"); |
f = remove_zero_from_list(f); |
asir_assert(ARG2(arg),O_N,"nd_weyl_gr"); |
if ( !BDY(f) ) { |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
*rp = f; do_weyl = 0; return; |
f = remove_zero_from_list(f); |
} |
if ( !BDY(f) ) { |
m = QTOS((Q)ARG2(arg)); |
*rp = f; do_weyl = 0; return; |
create_order_spec(0,ARG3(arg),&ord); |
} |
homo = retdp = 0; |
m = QTOS((Q)ARG2(arg)); |
if ( get_opt("homo",&val) && val ) homo = 1; |
create_order_spec(0,ARG3(arg),&ord); |
if ( get_opt("dp",&val) && val ) retdp = 1; |
homo = 0; |
|
if ( get_opt("homo",&val) && val ) homo = 1; |
|
if ( get_opt("dp",&val) && val ) retdp = 1; |
|
} else if ( ac == 1 ) { |
|
f = (LIST)ARG0(arg); |
|
parse_gr_option(f,current_option,&v,&nhomo,&m,&ord); |
|
homo = QTOS((Q)nhomo); |
|
if ( get_opt("dp",&val) && val ) retdp = 1; |
|
} else |
|
error("nd_weyl_gr : invalid argument"); |
nd_gr(f,v,m,homo,retdp,0,ord,rp); |
nd_gr(f,v,m,homo,retdp,0,ord,rp); |
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pnd_weyl_gr_trace(arg,rp) |
void Pnd_weyl_gr_trace(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m,homo; |
int m,homo,ac; |
|
Num nhomo; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 1; |
do_weyl = 1; |
asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr_trace"); |
if ( (ac = argc(arg)) == 5 ) { |
asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr_trace"); |
asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr_trace"); |
asir_assert(ARG2(arg),O_N,"nd_weyl_gr_trace"); |
asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr_trace"); |
asir_assert(ARG3(arg),O_N,"nd_weyl_gr_trace"); |
asir_assert(ARG2(arg),O_N,"nd_weyl_gr_trace"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
asir_assert(ARG3(arg),O_N,"nd_weyl_gr_trace"); |
f = remove_zero_from_list(f); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
if ( !BDY(f) ) { |
f = remove_zero_from_list(f); |
*rp = f; do_weyl = 0; return; |
if ( !BDY(f) ) { |
} |
*rp = f; do_weyl = 0; return; |
homo = QTOS((Q)ARG2(arg)); |
} |
m = QTOS((Q)ARG3(arg)); |
homo = QTOS((Q)ARG2(arg)); |
create_order_spec(0,ARG4(arg),&ord); |
m = QTOS((Q)ARG3(arg)); |
|
create_order_spec(0,ARG4(arg),&ord); |
|
} else if ( ac == 1 ) { |
|
f = (LIST)ARG0(arg); |
|
parse_gr_option(f,current_option,&v,&nhomo,&m,&ord); |
|
homo = QTOS((Q)nhomo); |
|
} else |
|
error("nd_weyl_gr_trace : invalid argument"); |
nd_gr_trace(f,v,m,homo,0,ord,rp); |
nd_gr_trace(f,v,m,homo,0,ord,rp); |
do_weyl = 0; |
do_weyl = 0; |
} |
} |
Line 2433 void Pnd_weyl_nf(NODE arg,Obj *rp) |
|
Line 2649 void Pnd_weyl_nf(NODE arg,Obj *rp) |
|
|
|
/* for Weyl algebra */ |
/* for Weyl algebra */ |
|
|
void Pdp_weyl_gr_main(arg,rp) |
void Pdp_weyl_gr_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_weyl_gr_f_main(arg,rp) |
void Pdp_weyl_gr_f_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_weyl_f4_main(arg,rp) |
void Pdp_weyl_f4_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
struct order_spec *ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_weyl_f4_mod_main(arg,rp) |
void Pdp_weyl_f4_mod_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m; |
int m; |
|
|
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
void Pdp_weyl_gr_mod_main(arg,rp) |
void Pdp_weyl_gr_mod_main(NODE arg,LIST *rp) |
NODE arg; |
|
LIST *rp; |
|
{ |
{ |
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
|
|
|
|
VECT current_dl_weight_vector_obj; |
VECT current_dl_weight_vector_obj; |
int *current_dl_weight_vector; |
int *current_dl_weight_vector; |
|
int dp_negative_weight; |
|
|
void Pdp_set_weight(arg,rp) |
void Pdp_set_weight(NODE arg,VECT *rp) |
NODE arg; |
|
VECT *rp; |
|
{ |
{ |
VECT v; |
VECT v; |
int i,n; |
int i,n; |
|
|
else if ( !ARG0(arg) ) { |
else if ( !ARG0(arg) ) { |
current_dl_weight_vector_obj = 0; |
current_dl_weight_vector_obj = 0; |
current_dl_weight_vector = 0; |
current_dl_weight_vector = 0; |
|
dp_negative_weight = 0; |
*rp = 0; |
*rp = 0; |
} else { |
} else { |
if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST ) |
if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST ) |
|
|
current_dl_weight_vector = (int *)CALLOC(n,sizeof(int)); |
current_dl_weight_vector = (int *)CALLOC(n,sizeof(int)); |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
current_dl_weight_vector[i] = QTOS((Q)v->body[i]); |
current_dl_weight_vector[i] = QTOS((Q)v->body[i]); |
|
for ( i = 0; i < n; i++ ) |
|
if ( current_dl_weight_vector[i] < 0 ) break; |
|
if ( i < n ) |
|
dp_negative_weight = 1; |
|
else |
|
dp_negative_weight = 0; |
*rp = v; |
*rp = v; |
} |
} |
} |
} |
|
|
VECT current_module_weight_vector_obj; |
VECT current_module_weight_vector_obj; |
int *current_module_weight_vector; |
int *current_module_weight_vector; |
|
|
void Pdp_set_module_weight(arg,rp) |
void Pdp_set_module_weight(NODE arg,VECT *rp) |
NODE arg; |
|
VECT *rp; |
|
{ |
{ |
VECT v; |
VECT v; |
int i,n; |
int i,n; |
Line 2673 void Pdp_set_top_weight(NODE arg,Obj *rp) |
|
Line 2883 void Pdp_set_top_weight(NODE arg,Obj *rp) |
|
MKVECT(v,n); |
MKVECT(v,n); |
for ( i = 0; i < n; i++, node = NEXT(node) ) |
for ( i = 0; i < n; i++, node = NEXT(node) ) |
BDY(v)[i] = BDY(node); |
BDY(v)[i] = BDY(node); |
obj = v; |
obj = (Obj)v; |
} else |
} else |
obj = ARG0(arg); |
obj = ARG0(arg); |
if ( OID(obj) == O_VECT ) { |
if ( OID(obj) == O_VECT ) { |
Line 2704 void Pdp_get_denomlist(LIST *rp) |
|
Line 2914 void Pdp_get_denomlist(LIST *rp) |
|
static VECT current_weyl_weight_vector_obj; |
static VECT current_weyl_weight_vector_obj; |
int *current_weyl_weight_vector; |
int *current_weyl_weight_vector; |
|
|
void Pdp_weyl_set_weight(arg,rp) |
void Pdp_weyl_set_weight(NODE arg,VECT *rp) |
NODE arg; |
|
VECT *rp; |
|
{ |
{ |
VECT v; |
VECT v; |
NODE node; |
NODE node; |
Line 2756 void Pdp_mono_raddec(NODE arg,LIST *rp) |
|
Line 2964 void Pdp_mono_raddec(NODE arg,LIST *rp) |
|
else { |
else { |
t = BDY((LIST)ARG1(arg)); |
t = BDY((LIST)ARG1(arg)); |
nv = length(t); |
nv = length(t); |
v = (P)MALLOC(nv*sizeof(P)); |
v = (P *)MALLOC(nv*sizeof(P)); |
for ( vl0 = 0, i = 0; t; t = NEXT(t), i++ ) { |
for ( vl0 = 0, i = 0; t; t = NEXT(t), i++ ) { |
NEXTVL(vl0,vl); VR(vl) = VR((P)BDY(t)); |
NEXTVL(vl0,vl); VR(vl) = VR((P)BDY(t)); |
MKV(VR(vl),v[i]); |
MKV(VR(vl),v[i]); |
Line 2898 void Pdp_rref2(NODE arg,VECT *rp) |
|
Line 3106 void Pdp_rref2(NODE arg,VECT *rp) |
|
if ( v[j/BLEN] & (1L<<(j%BLEN)) ) { |
if ( v[j/BLEN] & (1L<<(j%BLEN)) ) { |
NEXTMP(m0,m); |
NEXTMP(m0,m); |
m->dl = t[j]; |
m->dl = t[j]; |
m->c = (P)ONE; |
m->c = (Obj)ONE; |
td = MAX(td,m->dl->td); |
td = MAX(td,m->dl->td); |
} |
} |
} |
} |
Line 2969 NODE sumi_criFMD(int nv,DP *f,int m) |
|
Line 3177 NODE sumi_criFMD(int nv,DP *f,int m) |
|
for ( k2 = 0; k2 < nv; k2++ ) |
for ( k2 = 0; k2 < nv; k2++ ) |
if ( dl1->d[k2] && dl2->d[k2] ) break; |
if ( dl1->d[k2] && dl2->d[k2] ) break; |
if ( k2 < nv ) { |
if ( k2 < nv ) { |
NEWMP(mp); mp->dl = l1; C(mp) = (P)ONE; |
NEWMP(mp); mp->dl = l1; C(mp) = (Obj)ONE; |
NEXT(mp) = 0; MKDP(nv,mp,u); u->sugar = l1->td; |
NEXT(mp) = 0; MKDP(nv,mp,u); u->sugar = l1->td; |
STOQ(i,iq); STOQ(m,mq); |
STOQ(i,iq); STOQ(m,mq); |
nd = mknode(3,iq,mq,u); |
nd = mknode(3,iq,mq,u); |
Line 3032 DP dltodp(int nv,DL d) |
|
Line 3240 DP dltodp(int nv,DL d) |
|
MP mp; |
MP mp; |
DP dp; |
DP dp; |
|
|
NEWMP(mp); mp->dl = d; C(mp) = (P)ONE; |
NEWMP(mp); mp->dl = d; C(mp) = (Obj)ONE; |
NEXT(mp) = 0; MKDP(nv,mp,dp); dp->sugar = d->td; |
NEXT(mp) = 0; MKDP(nv,mp,dp); dp->sugar = d->td; |
return dp; |
return dp; |
} |
} |
Line 3213 void Pdpv_ord(NODE arg,Obj *rp) |
|
Line 3421 void Pdpv_ord(NODE arg,Obj *rp) |
|
*rp = dp_current_modspec->obj; |
*rp = dp_current_modspec->obj; |
} |
} |
|
|
|
extern int dpm_ispot; |
|
|
|
void Pdpm_ord(NODE arg,LIST *rp) |
|
{ |
|
Q q; |
|
NODE nd; |
|
struct order_spec *spec; |
|
|
|
if ( arg ) { |
|
nd = BDY((LIST)ARG0(arg)); |
|
if ( !create_order_spec(0,(Obj)ARG1(nd),&spec) ) |
|
error("dpm_ord : invalid order specification"); |
|
initdpm(spec,QTOS((Q)ARG0(nd))); |
|
} |
|
STOQ(dpm_ispot,q); |
|
nd = mknode(2,q,dp_current_spec->obj); |
|
MKLIST(*rp,nd); |
|
} |
|
|
|
void Pdpm_hm(NODE arg,DPM *rp) |
|
{ |
|
DPM p; |
|
|
|
p = (DPM)ARG0(arg); asir_assert(p,O_DPM,"dpm_hm"); |
|
dpm_hm(p,rp); |
|
} |
|
|
|
void Pdpm_ht(NODE arg,DPM *rp) |
|
{ |
|
DPM p; |
|
|
|
p = (DPM)ARG0(arg); asir_assert(p,O_DPM,"dp_ht"); |
|
dpm_ht(p,rp); |
|
} |
|
|
|
void Pdpm_hc(NODE arg,Obj *rp) |
|
{ |
|
asir_assert(ARG0(arg),O_DPM,"dpm_hc"); |
|
if ( !ARG0(arg) ) |
|
*rp = 0; |
|
else |
|
*rp = BDY((DPM)ARG0(arg))->c; |
|
} |
|
|
|
|
void Pdpv_ht(NODE arg,LIST *rp) |
void Pdpv_ht(NODE arg,LIST *rp) |
{ |
{ |
NODE n; |
NODE n; |
Line 3267 void Pdpv_hc(NODE arg,LIST *rp) |
|
Line 3520 void Pdpv_hc(NODE arg,LIST *rp) |
|
if ( pos < 0 ) |
if ( pos < 0 ) |
hc = 0; |
hc = 0; |
else |
else |
hc = BDY(BDY(p)[pos])->c; |
hc = (P)BDY(BDY(p)[pos])->c; |
STOQ(pos,q); |
STOQ(pos,q); |
n = mknode(2,q,hc); |
n = mknode(2,q,hc); |
MKLIST(*rp,n); |
MKLIST(*rp,n); |