version 1.24, 2002/01/28 00:54:41 |
version 1.54, 2004/05/31 00:38:44 |
|
|
* 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.23 2001/11/19 01:40:04 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.53 2004/05/14 09:20:56 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_mul_trunc(),Pdp_quo(); |
void Pdp_ord(), Pdp_ptod(), Pdp_dtop(); |
void Pdp_ord(), Pdp_ptod(), Pdp_dtop(); |
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_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(); |
Line 73 void Pdp_gr_mod_main(),Pdp_gr_f_main(); |
|
Line 76 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_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(); |
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 88 void Pdp_weyl_set_weight(); |
|
Line 92 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_weyl_gr(),Pnd_weyl_gr_trace(); |
|
void Pnd_nf(); |
|
void Pdp_initial_term(); |
|
void Pdp_order(); |
|
|
|
LIST dp_initial_term(); |
|
LIST dp_order(); |
|
void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo, |
|
int *modular,struct order_spec **ord); |
|
|
|
LIST remove_zero_from_list(LIST); |
|
|
struct ftab dp_tab[] = { |
struct ftab dp_tab[] = { |
/* content reduction */ |
/* content reduction */ |
{"dp_ptozp",Pdp_ptozp,1}, |
{"dp_ptozp",Pdp_ptozp,1}, |
Line 98 struct ftab dp_tab[] = { |
|
Line 114 struct ftab dp_tab[] = { |
|
{"dp_cont",Pdp_cont,1}, |
{"dp_cont",Pdp_cont,1}, |
|
|
/* polynomial ring */ |
/* polynomial ring */ |
|
/* special operations */ |
|
{"dp_mul_trunc",Pdp_mul_trunc,3}, |
|
{"dp_quo",Pdp_quo,2}, |
|
|
/* s-poly */ |
/* s-poly */ |
{"dp_sp",Pdp_sp,2}, |
{"dp_sp",Pdp_sp,2}, |
{"dp_sp_mod",Pdp_sp_mod,3}, |
{"dp_sp_mod",Pdp_sp_mod,3}, |
Line 113 struct ftab dp_tab[] = { |
|
Line 133 struct ftab dp_tab[] = { |
|
{"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}, |
|
{"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}, |
{"dp_lnf_f",Pdp_lnf_f,2}, |
{"dp_lnf_f",Pdp_lnf_f,2}, |
|
|
/* Buchberger algorithm */ |
/* Buchberger algorithm */ |
{"dp_gr_main",Pdp_gr_main,5}, |
{"dp_gr_main",Pdp_gr_main,-5}, |
{"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_gr",Pnd_gr,4}, |
|
{"nd_gr_trace",Pnd_gr_trace,5}, |
|
{"nd_weyl_gr",Pnd_weyl_gr,4}, |
|
{"nd_weyl_gr_trace",Pnd_weyl_gr_trace,5}, |
|
{"nd_nf",Pnd_nf,5}, |
|
|
/* F4 algorithm */ |
/* F4 algorithm */ |
{"dp_f4_main",Pdp_f4_main,3}, |
{"dp_f4_main",Pdp_f4_main,3}, |
Line 143 struct ftab dp_tab[] = { |
|
Line 170 struct ftab dp_tab[] = { |
|
{"dp_weyl_nf_f",Pdp_weyl_nf_f,4}, |
{"dp_weyl_nf_f",Pdp_weyl_nf_f,4}, |
|
|
/* 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}, |
{"dp_weyl_gr_f_main",Pdp_weyl_gr_f_main,4}, |
{"dp_weyl_gr_f_main",Pdp_weyl_gr_f_main,4}, |
|
|
Line 159 struct ftab dp_tab[] = { |
|
Line 186 struct ftab dp_tab[] = { |
|
|
|
struct ftab dp_supp_tab[] = { |
struct ftab dp_supp_tab[] = { |
/* setting flags */ |
/* setting flags */ |
|
{"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}, |
{"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 176 struct ftab dp_supp_tab[] = { |
|
Line 205 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 188 struct ftab dp_supp_tab[] = { |
|
Line 218 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_order",Pdp_order,1}, |
|
|
/* degree and size */ |
/* degree and size */ |
{"dp_td",Pdp_td,1}, |
{"dp_td",Pdp_td,1}, |
{"dp_mag",Pdp_mag,1}, |
{"dp_mag",Pdp_mag,1}, |
{"dp_sugar",Pdp_sugar,1}, |
{"dp_sugar",Pdp_sugar,1}, |
|
{"dp_set_sugar",Pdp_set_sugar,2}, |
|
|
/* misc */ |
/* misc */ |
{"dp_mbase",Pdp_mbase,1}, |
{"dp_mbase",Pdp_mbase,1}, |
Line 206 struct ftab dp_supp_tab[] = { |
|
Line 242 struct ftab dp_supp_tab[] = { |
|
{0,0,0} |
{0,0,0} |
}; |
}; |
|
|
|
void Pdp_sort(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
dp_sort((DP)ARG0(arg),rp); |
|
} |
|
|
void Pdp_mdtod(arg,rp) |
void Pdp_mdtod(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
|
|
QTOS((Q)ARG2(arg)),rp); |
QTOS((Q)ARG2(arg)),rp); |
} |
} |
|
|
|
void Pdp_nf_tab_f(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
asir_assert(ARG0(arg),O_DP,"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); |
|
} |
|
|
void Pdp_ord(arg,rp) |
void Pdp_ord(arg,rp) |
NODE arg; |
NODE arg; |
Obj *rp; |
Obj *rp; |
{ |
{ |
struct order_spec spec; |
struct order_spec *spec; |
|
LIST v; |
|
struct oLIST f; |
|
Num homo; |
|
int modular; |
|
|
|
f.id = O_LIST; f.body = 0; |
if ( !arg ) |
if ( !arg ) |
*rp = dp_current_spec.obj; |
*rp = dp_current_spec->obj; |
else if ( !create_order_spec((Obj)ARG0(arg),&spec) ) |
|
error("dp_ord : invalid order specification"); |
|
else { |
else { |
initd(&spec); *rp = spec.obj; |
if ( current_option ) |
|
parse_gr_option(&f,current_option,&v,&homo,&modular,&spec); |
|
else if ( !create_order_spec(0,(Obj)ARG0(arg),&spec) ) |
|
error("dp_ord : invalid order specification"); |
|
initd(spec); *rp = spec->obj; |
} |
} |
} |
} |
|
|
Line 395 void Pdp_ptod(arg,rp) |
|
Line 454 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 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; |
|
|
dp_subd(p1,p2,rp); |
dp_subd(p1,p2,rp); |
} |
} |
|
|
|
void Pdp_mul_trunc(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
DP p1,p2,p; |
|
|
|
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); p = (DP)ARG2(arg); |
|
asir_assert(p1,O_DP,"dp_mul_trunc"); |
|
asir_assert(p2,O_DP,"dp_mul_trunc"); |
|
asir_assert(p,O_DP,"dp_mul_trunc"); |
|
comm_muld_trunc(CO,p1,p2,BDY(p)->dl,rp); |
|
} |
|
|
|
void Pdp_quo(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
DP p1,p2; |
|
|
|
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
|
asir_assert(p1,O_DP,"dp_quo"); |
|
asir_assert(p2,O_DP,"dp_quo"); |
|
comm_quod(CO,p1,p2,rp); |
|
} |
|
|
void Pdp_weyl_mul(arg,rp) |
void Pdp_weyl_mul(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
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_mul"); asir_assert(p2,O_DP,"dp_mul"); |
asir_assert(p1,O_DP,"dp_weyl_mul"); asir_assert(p2,O_DP,"dp_weyl_mul"); |
do_weyl = 1; |
do_weyl = 1; |
muld(CO,p1,p2,rp); |
muld(CO,p1,p2,rp); |
do_weyl = 0; |
do_weyl = 0; |
|
|
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) |
|
|
STOQ(p->sugar,*rp); |
STOQ(p->sugar,*rp); |
} |
} |
|
|
|
void Pdp_initial_term(arg,rp) |
|
NODE arg; |
|
Obj *rp; |
|
{ |
|
struct order_spec *ord; |
|
Num homo; |
|
int modular,is_list; |
|
LIST v,f,l,initiallist; |
|
NODE n; |
|
|
|
f = (LIST)ARG0(arg); |
|
if ( f && OID(f) == O_LIST ) |
|
is_list = 1; |
|
else { |
|
n = mknode(1,f); MKLIST(l,n); f = l; |
|
is_list = 0; |
|
} |
|
if ( current_option ) { |
|
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
|
initd(ord); |
|
} else |
|
ord = dp_current_spec; |
|
initiallist = dp_initial_term(f,ord); |
|
if ( !is_list ) |
|
*rp = (Obj)BDY(BDY(initiallist)); |
|
else |
|
*rp = (Obj)initiallist; |
|
} |
|
|
|
void Pdp_order(arg,rp) |
|
NODE arg; |
|
Obj *rp; |
|
{ |
|
struct order_spec *ord; |
|
Num homo; |
|
int modular,is_list; |
|
LIST v,f,l,ordlist; |
|
NODE n; |
|
|
|
f = (LIST)ARG0(arg); |
|
if ( f && OID(f) == O_LIST ) |
|
is_list = 1; |
|
else { |
|
n = mknode(1,f); MKLIST(l,n); f = l; |
|
is_list = 0; |
|
} |
|
if ( current_option ) { |
|
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
|
initd(ord); |
|
} else |
|
ord = dp_current_spec; |
|
ordlist = dp_order(f,ord); |
|
if ( !is_list ) |
|
*rp = (Obj)BDY(BDY(ordlist)); |
|
else |
|
*rp = (Obj)ordlist; |
|
} |
|
|
|
void Pdp_set_sugar(arg,rp) |
|
NODE arg; |
|
Q *rp; |
|
{ |
|
DP p; |
|
Q q; |
|
int i; |
|
|
|
p = (DP)ARG0(arg); |
|
q = (Q)ARG1(arg); |
|
if ( p && q) { |
|
asir_assert(p,O_DP,"dp_set_sugar"); |
|
asir_assert(q,O_N, "dp_set_sugar"); |
|
i = QTOS(q); |
|
if (p->sugar < i) { |
|
p->sugar = i; |
|
} |
|
} |
|
*rp = 0; |
|
} |
|
|
void Pdp_cri1(arg,rp) |
void Pdp_cri1(arg,rp) |
NODE arg; |
NODE arg; |
Q *rp; |
Q *rp; |
|
|
dp_make_flaglist(rp); |
dp_make_flaglist(rp); |
} |
} |
|
|
extern int DP_Print; |
extern int DP_Print, DP_PrintShort; |
|
|
void Pdp_gr_print(arg,rp) |
void Pdp_gr_print(arg,rp) |
NODE arg; |
NODE arg; |
Q *rp; |
Q *rp; |
{ |
{ |
Q q; |
Q q; |
|
int s; |
|
|
if ( arg ) { |
if ( arg ) { |
asir_assert(ARG0(arg),O_N,"dp_gr_print"); |
asir_assert(ARG0(arg),O_N,"dp_gr_print"); |
q = (Q)ARG0(arg); DP_Print = QTOS(q); |
q = (Q)ARG0(arg); |
} else |
s = QTOS(q); |
STOQ(DP_Print,q); |
switch ( s ) { |
|
case 0: |
|
DP_Print = 0; DP_PrintShort = 0; |
|
break; |
|
case 1: |
|
DP_Print = 1; |
|
break; |
|
case 2: |
|
DP_Print = 0; DP_PrintShort = 1; |
|
break; |
|
default: |
|
DP_Print = s; DP_PrintShort = 0; |
|
break; |
|
} |
|
} else { |
|
if ( DP_Print ) { |
|
STOQ(1,q); |
|
} else if ( DP_PrintShort ) { |
|
STOQ(2,q); |
|
} else |
|
q = 0; |
|
} |
*rp = q; |
*rp = q; |
} |
} |
|
|
|
void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo, |
|
int *modular,struct order_spec **ord) |
|
{ |
|
NODE t,p; |
|
Q m; |
|
char *key; |
|
Obj value,dmy; |
|
int ord_is_set = 0; |
|
int modular_is_set = 0; |
|
int homo_is_set = 0; |
|
VL vl,vl0; |
|
LIST vars; |
|
char xiname[BUFSIZ]; |
|
NODE x0,x; |
|
DP d; |
|
P xi; |
|
int nv,i; |
|
|
|
/* extract vars */ |
|
vars = 0; |
|
for ( t = opt; t; t = NEXT(t) ) { |
|
p = BDY((LIST)BDY(t)); |
|
key = BDY((STRING)BDY(p)); |
|
value = (Obj)BDY(NEXT(p)); |
|
if ( !strcmp(key,"v") ) { |
|
/* variable list */ |
|
vars = (LIST)value; |
|
break; |
|
} |
|
} |
|
if ( vars ) { |
|
*v = vars; pltovl(vars,&vl); |
|
} else { |
|
for ( t = BDY(f); t; t = NEXT(t) ) |
|
if ( BDY(t) && OID((Obj)BDY(t))==O_DP ) |
|
break; |
|
if ( t ) { |
|
/* f is DP list */ |
|
/* create dummy var list */ |
|
d = (DP)BDY(t); |
|
nv = NV(d); |
|
for ( i = 0, vl0 = 0, x0 = 0; i < nv; i++ ) { |
|
NEXTVL(vl0,vl); |
|
NEXTNODE(x0,x); |
|
sprintf(xiname,"x%d",i); |
|
makevar(xiname,&xi); |
|
x->body = (pointer)xi; |
|
vl->v = VR((P)xi); |
|
} |
|
if ( vl0 ) { |
|
NEXT(vl) = 0; |
|
NEXT(x) = 0; |
|
} |
|
MKLIST(vars,x0); |
|
*v = vars; |
|
vl = vl0; |
|
} else { |
|
get_vars((Obj)f,&vl); vltopl(vl,v); |
|
} |
|
} |
|
|
|
for ( t = opt; t; t = NEXT(t) ) { |
|
p = BDY((LIST)BDY(t)); |
|
key = BDY((STRING)BDY(p)); |
|
value = (Obj)BDY(NEXT(p)); |
|
if ( !strcmp(key,"v") ) { |
|
/* variable list; ignore */ |
|
} else if ( !strcmp(key,"order") ) { |
|
/* order spec */ |
|
if ( !vl ) |
|
error("parse_gr_option : variables must be specified"); |
|
create_order_spec(vl,value,ord); |
|
ord_is_set = 1; |
|
} else if ( !strcmp(key,"block") ) { |
|
create_order_spec(0,value,ord); |
|
ord_is_set = 1; |
|
} else if ( !strcmp(key,"matrix") ) { |
|
create_order_spec(0,value,ord); |
|
ord_is_set = 1; |
|
} else if ( !strcmp(key,"sugarweight") ) { |
|
/* weight */ |
|
Pdp_set_weight(NEXT(p),&dmy); |
|
} else if ( !strcmp(key,"homo") ) { |
|
*homo = (Num)value; |
|
homo_is_set = 1; |
|
} else if ( !strcmp(key,"trace") ) { |
|
m = (Q)value; |
|
if ( !m ) |
|
*modular = 0; |
|
else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 |
|
&& BD(NM(m))[0] >= 0x80000000) ) |
|
error("parse_gr_option : too large modulus"); |
|
else |
|
*modular = QTOS(m); |
|
modular_is_set = 1; |
|
} else |
|
error("parse_gr_option : not implemented"); |
|
} |
|
if ( !ord_is_set ) create_order_spec(0,0,ord); |
|
if ( !modular_is_set ) *modular = 0; |
|
if ( !homo_is_set ) *homo = 0; |
|
} |
|
|
void Pdp_gr_main(arg,rp) |
void Pdp_gr_main(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
{ |
{ |
LIST f,v; |
LIST f,v; |
|
VL vl; |
Num homo; |
Num homo; |
Q m; |
Q m; |
int modular; |
int modular,ac; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
f = (LIST)ARG0(arg); |
asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
f = remove_zero_from_list(f); |
asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
if ( !BDY(f) ) { |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
*rp = f; return; |
homo = (Num)ARG2(arg); |
} |
m = (Q)ARG3(arg); |
if ( (ac = argc(arg)) == 5 ) { |
if ( !m ) |
asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
modular = 0; |
asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) |
asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
error("dp_gr_main : too large modulus"); |
v = (LIST)ARG1(arg); |
|
homo = (Num)ARG2(arg); |
|
m = (Q)ARG3(arg); |
|
if ( !m ) |
|
modular = 0; |
|
else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) |
|
error("dp_gr_main : too large modulus"); |
|
else |
|
modular = QTOS(m); |
|
create_order_spec(0,ARG4(arg),&ord); |
|
} else if ( current_option ) |
|
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
|
else if ( ac == 1 ) |
|
parse_gr_option(f,0,&v,&homo,&modular,&ord); |
else |
else |
modular = QTOS(m); |
error("dp_gr_main : invalid argument"); |
create_order_spec(ARG4(arg),&ord); |
dp_gr_main(f,v,homo,modular,0,ord,rp); |
dp_gr_main(f,v,homo,modular,0,&ord,rp); |
|
} |
} |
|
|
void Pdp_gr_f_main(arg,rp) |
void Pdp_gr_f_main(arg,rp) |
|
|
{ |
{ |
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
struct order_spec ord; |
int m,field,t; |
|
struct order_spec *ord; |
|
NODE n; |
|
|
do_weyl = 0; |
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_gr_f_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_gr_f_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_f_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_f_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_f_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_f_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
homo = (Num)ARG2(arg); |
homo = (Num)ARG2(arg); |
create_order_spec(ARG3(arg),&ord); |
#if 0 |
dp_gr_main(f,v,homo,0,1,&ord,rp); |
asir_assert(ARG3(arg),O_N,"dp_gr_f_main"); |
|
m = QTOS((Q)ARG3(arg)); |
|
if ( m ) |
|
error("dp_gr_f_main : trace lifting is not implemented yet"); |
|
create_order_spec(0,ARG4(arg),&ord); |
|
#else |
|
m = 0; |
|
create_order_spec(0,ARG3(arg),&ord); |
|
#endif |
|
field = 0; |
|
for ( n = BDY(f); n; n = NEXT(n) ) { |
|
t = get_field_type(BDY(n)); |
|
if ( !t ) |
|
continue; |
|
if ( t < 0 ) |
|
error("dp_gr_f_main : incosistent coefficients"); |
|
if ( !field ) |
|
field = t; |
|
else if ( t != field ) |
|
error("dp_gr_f_main : incosistent coefficients"); |
|
} |
|
dp_gr_main(f,v,homo,m?1:0,field,ord,rp); |
} |
} |
|
|
void Pdp_f4_main(arg,rp) |
void Pdp_f4_main(arg,rp) |
|
|
LIST *rp; |
LIST *rp; |
{ |
{ |
LIST f,v; |
LIST f,v; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_f4_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_f4_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
create_order_spec(ARG2(arg),&ord); |
f = remove_zero_from_list(f); |
dp_f4_main(f,v,&ord,rp); |
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
create_order_spec(0,ARG2(arg),&ord); |
|
dp_f4_main(f,v,ord,rp); |
} |
} |
|
|
/* dp_gr_checklist(list of dp) */ |
/* dp_gr_checklist(list of dp) */ |
|
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m; |
int m; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_f4_mod_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_f4_mod_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_f4_mod_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_f4_mod_main"); |
asir_assert(ARG2(arg),O_N,"dp_f4_mod_main"); |
asir_assert(ARG2(arg),O_N,"dp_f4_mod_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
if ( !m ) |
if ( !m ) |
error("dp_f4_mod_main : invalid argument"); |
error("dp_f4_mod_main : invalid argument"); |
create_order_spec(ARG3(arg),&ord); |
create_order_spec(0,ARG3(arg),&ord); |
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(arg,rp) |
|
|
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
int m; |
int m; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
do_weyl = 0; |
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_gr_mod_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_gr_mod_main"); |
|
|
asir_assert(ARG2(arg),O_N,"dp_gr_mod_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_mod_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_mod_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_mod_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); |
homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); |
if ( !m ) |
if ( !m ) |
error("dp_gr_mod_main : invalid argument"); |
error("dp_gr_mod_main : invalid argument"); |
create_order_spec(ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
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) |
|
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"); |
|
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); |
|
nd_gr(f,v,m,1,ord,rp); |
|
} |
|
|
|
void Pnd_gr(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"); |
|
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); |
|
nd_gr(f,v,m,0,ord,rp); |
|
} |
|
|
|
void Pnd_gr_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,ord,rp); |
|
} |
|
|
|
void Pnd_weyl_gr(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
int m,homo; |
|
struct order_spec *ord; |
|
|
|
do_weyl = 1; |
|
asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr"); |
|
asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr"); |
|
asir_assert(ARG2(arg),O_N,"nd_weyl_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); |
|
nd_gr(f,v,m,0,ord,rp); |
|
} |
|
|
|
void Pnd_weyl_gr_trace(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
int m,homo; |
|
struct order_spec *ord; |
|
|
|
do_weyl = 1; |
|
asir_assert(ARG0(arg),O_LIST,"nd_weyl_gr_trace"); |
|
asir_assert(ARG1(arg),O_LIST,"nd_weyl_gr_trace"); |
|
asir_assert(ARG2(arg),O_N,"nd_weyl_gr_trace"); |
|
asir_assert(ARG3(arg),O_N,"nd_weyl_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,ord,rp); |
|
} |
|
|
|
void Pnd_nf(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
P f; |
|
LIST g,v; |
|
struct order_spec *ord; |
|
|
|
do_weyl = 0; |
|
asir_assert(ARG0(arg),O_P,"nd_nf"); |
|
asir_assert(ARG1(arg),O_LIST,"nd_nf"); |
|
asir_assert(ARG2(arg),O_LIST,"nd_nf"); |
|
asir_assert(ARG4(arg),O_N,"nd_nf"); |
|
f = (P)ARG0(arg); |
|
g = (LIST)ARG1(arg); g = remove_zero_from_list(g); |
|
if ( !BDY(g) ) { |
|
*rp = f; return; |
|
} |
|
v = (LIST)ARG2(arg); |
|
create_order_spec(0,ARG3(arg),&ord); |
|
nd_nf_p(f,g,v,QTOS((Q)ARG4(arg)),ord,rp); |
|
} |
|
|
/* for Weyl algebra */ |
/* for Weyl algebra */ |
|
|
void Pdp_weyl_gr_main(arg,rp) |
void Pdp_weyl_gr_main(arg,rp) |
|
|
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
Q m; |
Q m; |
int modular; |
int modular,ac; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
f = (LIST)ARG0(arg); |
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
f = remove_zero_from_list(f); |
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
if ( !BDY(f) ) { |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
*rp = f; return; |
homo = (Num)ARG2(arg); |
} |
m = (Q)ARG3(arg); |
if ( (ac = argc(arg)) == 5 ) { |
if ( !m ) |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
modular = 0; |
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) |
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
error("dp_gr_main : too large modulus"); |
v = (LIST)ARG1(arg); |
|
homo = (Num)ARG2(arg); |
|
m = (Q)ARG3(arg); |
|
if ( !m ) |
|
modular = 0; |
|
else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) |
|
error("dp_weyl_gr_main : too large modulus"); |
|
else |
|
modular = QTOS(m); |
|
create_order_spec(0,ARG4(arg),&ord); |
|
} else if ( current_option ) |
|
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
|
else if ( ac == 1 ) |
|
parse_gr_option(f,0,&v,&homo,&modular,&ord); |
else |
else |
modular = QTOS(m); |
error("dp_weyl_gr_main : invalid argument"); |
create_order_spec(ARG4(arg),&ord); |
|
do_weyl = 1; |
do_weyl = 1; |
dp_gr_main(f,v,homo,modular,0,&ord,rp); |
dp_gr_main(f,v,homo,modular,0,ord,rp); |
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
|
|
{ |
{ |
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main"); |
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"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
homo = (Num)ARG2(arg); |
homo = (Num)ARG2(arg); |
create_order_spec(ARG3(arg),&ord); |
create_order_spec(0,ARG3(arg),&ord); |
do_weyl = 1; |
do_weyl = 1; |
dp_gr_main(f,v,homo,0,1,&ord,rp); |
dp_gr_main(f,v,homo,0,1,ord,rp); |
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
|
|
LIST *rp; |
LIST *rp; |
{ |
{ |
LIST f,v; |
LIST f,v; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
create_order_spec(ARG2(arg),&ord); |
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
create_order_spec(0,ARG2(arg),&ord); |
do_weyl = 1; |
do_weyl = 1; |
dp_f4_main(f,v,&ord,rp); |
dp_f4_main(f,v,ord,rp); |
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
|
|
{ |
{ |
LIST f,v; |
LIST f,v; |
int m; |
int m; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main"); |
asir_assert(ARG2(arg),O_N,"dp_f4_main"); |
asir_assert(ARG2(arg),O_N,"dp_f4_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
if ( !m ) |
if ( !m ) |
error("dp_weyl_f4_mod_main : invalid argument"); |
error("dp_weyl_f4_mod_main : invalid argument"); |
create_order_spec(ARG3(arg),&ord); |
create_order_spec(0,ARG3(arg),&ord); |
do_weyl = 1; |
do_weyl = 1; |
dp_f4_mod_main(f,v,m,&ord,rp); |
dp_f4_mod_main(f,v,m,ord,rp); |
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
|
|
LIST f,v; |
LIST f,v; |
Num homo; |
Num homo; |
int m; |
int m; |
struct order_spec ord; |
struct order_spec *ord; |
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_mod_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_mod_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_mod_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_mod_main"); |
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_mod_main"); |
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_mod_main"); |
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_mod_main"); |
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_mod_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); |
homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); |
if ( !m ) |
if ( !m ) |
error("dp_weyl_gr_mod_main : invalid argument"); |
error("dp_weyl_gr_mod_main : invalid argument"); |
create_order_spec(ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
do_weyl = 1; |
do_weyl = 1; |
dp_gr_mod_main(f,v,homo,m,&ord,rp); |
dp_gr_mod_main(f,v,homo,m,ord,rp); |
do_weyl = 0; |
do_weyl = 0; |
} |
} |
|
|
|
|
{ |
{ |
VECT v; |
VECT v; |
int i,n; |
int i,n; |
|
NODE node; |
|
|
if ( !arg ) |
if ( !arg ) |
*rp = current_dl_weight_vector_obj; |
*rp = current_dl_weight_vector_obj; |
|
|
current_dl_weight_vector = 0; |
current_dl_weight_vector = 0; |
*rp = 0; |
*rp = 0; |
} else { |
} else { |
asir_assert(ARG0(arg),O_VECT,"dp_set_weight"); |
if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST ) |
v = (VECT)ARG0(arg); |
error("dp_set_weight : invalid argument"); |
|
if ( OID(ARG0(arg)) == O_VECT ) |
|
v = (VECT)ARG0(arg); |
|
else { |
|
node = (NODE)BDY((LIST)ARG0(arg)); |
|
n = length(node); |
|
MKVECT(v,n); |
|
for ( i = 0; i < n; i++, node = NEXT(node) ) |
|
BDY(v)[i] = BDY(node); |
|
} |
current_dl_weight_vector_obj = v; |
current_dl_weight_vector_obj = v; |
n = v->len; |
n = v->len; |
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_weyl_weight_vector[i] = QTOS((Q)v->body[i]); |
current_weyl_weight_vector[i] = QTOS((Q)v->body[i]); |
*rp = v; |
*rp = v; |
|
} |
|
} |
|
|
|
LIST remove_zero_from_list(LIST l) |
|
{ |
|
NODE n,r0,r; |
|
LIST rl; |
|
|
|
asir_assert(l,O_LIST,"remove_zero_from_list"); |
|
n = BDY(l); |
|
for ( r0 = 0; n; n = NEXT(n) ) |
|
if ( BDY(n) ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = BDY(n); |
|
} |
|
if ( r0 ) |
|
NEXT(r) = 0; |
|
MKLIST(rl,r0); |
|
return rl; |
|
} |
|
|
|
int get_field_type(P p) |
|
{ |
|
int type,t; |
|
DCP dc; |
|
|
|
if ( !p ) |
|
return 0; |
|
else if ( NUM(p) ) |
|
return NID((Num)p); |
|
else { |
|
type = 0; |
|
for ( dc = DC(p); dc; dc = NEXT(dc) ) { |
|
t = get_field_type(COEF(dc)); |
|
if ( !t ) |
|
continue; |
|
if ( t < 0 ) |
|
return t; |
|
if ( !type ) |
|
type = t; |
|
else if ( t != type ) |
|
return -1; |
|
} |
|
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; |
} |
} |
} |
} |