| version 1.51, 2004/04/30 08:25:38 |
version 1.53, 2004/05/14 09:20:56 |
|
|
| * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
| * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
| * |
* |
| * $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.50 2004/04/15 08:27:42 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.52 2004/05/14 06:02:54 noro Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "base.h" |
#include "base.h" |
| Line 55 extern int dp_nelim; |
|
| Line 55 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; |
| |
|
| Line 79 void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_md |
|
| Line 80 void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_md |
|
| 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 186 struct ftab dp_supp_tab[] = { |
|
| Line 188 struct ftab dp_supp_tab[] = { |
|
| /* setting flags */ |
/* setting flags */ |
| {"dp_sort",Pdp_sort,1}, |
{"dp_sort",Pdp_sort,1}, |
| {"dp_ord",Pdp_ord,-1}, |
{"dp_ord",Pdp_ord,-1}, |
| |
{"dpv_ord",Pdpv_ord,-2}, |
| {"dp_set_kara",Pdp_set_kara,-1}, |
{"dp_set_kara",Pdp_set_kara,-1}, |
| {"dp_nelim",Pdp_nelim,-1}, |
{"dp_nelim",Pdp_nelim,-1}, |
| {"dp_gr_flags",Pdp_gr_flags,-1}, |
{"dp_gr_flags",Pdp_gr_flags,-1}, |
| {"dp_gr_print",Pdp_gr_print,-1}, |
{"dp_gr_print",Pdp_gr_print,-1}, |
| |
|
| /* converters */ |
/* converters */ |
| {"dp_ptod",Pdp_ptod,2}, |
{"dp_ptod",Pdp_ptod,-2}, |
| {"dp_dtop",Pdp_dtop,2}, |
{"dp_dtop",Pdp_dtop,2}, |
| {"dp_homo",Pdp_homo,1}, |
{"dp_homo",Pdp_homo,1}, |
| {"dp_dehomo",Pdp_dehomo,1}, |
{"dp_dehomo",Pdp_dehomo,1}, |
| Line 202 struct ftab dp_supp_tab[] = { |
|
| Line 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 214 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_initial_term",Pdp_initial_term,1}, |
| {"dp_order",Pdp_order,1}, |
{"dp_order",Pdp_order,1}, |
|
|
| if ( !arg ) |
if ( !arg ) |
| *rp = dp_current_spec->obj; |
*rp = dp_current_spec->obj; |
| else { |
else { |
| if ( ARG0(arg) && OID(ARG0(arg)) == O_OPTLIST ) |
if ( current_option ) |
| parse_gr_option(&f,BDY((OPTLIST)ARG0(arg)),&v,&homo,&modular,&spec); |
parse_gr_option(&f,current_option,&v,&homo,&modular,&spec); |
| else if ( !create_order_spec(0,(Obj)ARG0(arg),&spec) ) |
else if ( !create_order_spec(0,(Obj)ARG0(arg),&spec) ) |
| error("dp_ord : invalid order specification"); |
error("dp_ord : invalid order specification"); |
| initd(spec); *rp = spec->obj; |
initd(spec); *rp = spec->obj; |
| Line 447 void Pdp_ptod(arg,rp) |
|
| Line 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); |
| |
dp_current_spec = 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); |
| |
dp_current_spec = 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; |
|
|
| MP m,mr; |
MP m,mr; |
| |
|
| p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_ht"); |
p = (DP)ARG0(arg); asir_assert(p,O_DP,"dp_ht"); |
| if ( !p ) |
dp_ht(p,rp); |
| *rp = 0; |
|
| else { |
|
| m = BDY(p); |
|
| NEWMP(mr); mr->dl = m->dl; mr->c = (P)ONE; NEXT(mr) = 0; |
|
| MKDP(p->nv,mr,*rp); (*rp)->sugar = mr->dl->td; /* XXX */ |
|
| } |
|
| } |
} |
| |
|
| void Pdp_hc(arg,rp) |
void Pdp_hc(arg,rp) |
|
|
| n = mknode(1,f); MKLIST(l,n); f = l; |
n = mknode(1,f); MKLIST(l,n); f = l; |
| is_list = 0; |
is_list = 0; |
| } |
} |
| if ( argc(arg) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
if ( current_option ) |
| parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); |
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
| else |
else |
| ord = dp_current_spec; |
ord = dp_current_spec; |
| initiallist = dp_initial_term(f,ord); |
initiallist = dp_initial_term(f,ord); |
|
|
| n = mknode(1,f); MKLIST(l,n); f = l; |
n = mknode(1,f); MKLIST(l,n); f = l; |
| is_list = 0; |
is_list = 0; |
| } |
} |
| if ( argc(arg) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
if ( current_option ) |
| parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); |
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
| else |
else |
| ord = dp_current_spec; |
ord = dp_current_spec; |
| ordlist = dp_order(f,ord); |
ordlist = dp_order(f,ord); |
|
|
| if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
| *rp = f; return; |
*rp = f; return; |
| } |
} |
| if ( argc(arg) == 5 ) { |
if ( (ac = argc(arg)) == 5 ) { |
| asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
| asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
| asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
|
|
| else |
else |
| modular = QTOS(m); |
modular = QTOS(m); |
| create_order_spec(0,ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
| } else if ( (ac=argc(arg)) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
} else if ( current_option ) |
| parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); |
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
| else if ( ac == 1 ) |
else if ( ac == 1 ) |
| parse_gr_option(f,0,&v,&homo,&modular,&ord); |
parse_gr_option(f,0,&v,&homo,&modular,&ord); |
| else |
else |
|
|
| if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
| *rp = f; return; |
*rp = f; return; |
| } |
} |
| if ( argc(arg) == 5 ) { |
if ( (ac = argc(arg)) == 5 ) { |
| asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
| asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
| asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
|
|
| else |
else |
| modular = QTOS(m); |
modular = QTOS(m); |
| create_order_spec(0,ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
| } else if ( (ac=argc(arg)) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
} else if ( current_option ) |
| parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&ord); |
parse_gr_option(f,current_option,&v,&homo,&modular,&ord); |
| else if ( ac == 1 ) |
else if ( ac == 1 ) |
| parse_gr_option(f,0,&v,&homo,&modular,&ord); |
parse_gr_option(f,0,&v,&homo,&modular,&ord); |
| else |
else |
| Line 2062 int get_field_type(P p) |
|
| Line 2131 int get_field_type(P p) |
|
| return -1; |
return -1; |
| } |
} |
| return type; |
return type; |
| |
} |
| |
} |
| |
|
| |
void Pdpv_ord(NODE arg,Obj *rp) |
| |
{ |
| |
int ac,id; |
| |
LIST shift; |
| |
|
| |
ac = argc(arg); |
| |
if ( ac ) { |
| |
id = QTOS((Q)ARG0(arg)); |
| |
if ( ac > 1 && ARG1(arg) && OID((Obj)ARG1(arg))==O_LIST ) |
| |
shift = (LIST)ARG1(arg); |
| |
else |
| |
shift = 0; |
| |
create_modorder_spec(id,shift,&dp_current_modspec); |
| |
} |
| |
*rp = dp_current_modspec->obj; |
| |
} |
| |
|
| |
void Pdpv_ht(NODE arg,LIST *rp) |
| |
{ |
| |
NODE n; |
| |
DP ht; |
| |
int pos; |
| |
DPV p; |
| |
Q q; |
| |
|
| |
asir_assert(ARG0(arg),O_DPV,"dpv_ht"); |
| |
p = (DPV)ARG0(arg); |
| |
pos = dpv_hp(p); |
| |
if ( pos < 0 ) |
| |
ht = 0; |
| |
else |
| |
dp_ht(BDY(p)[pos],&ht); |
| |
STOQ(pos,q); |
| |
n = mknode(2,q,ht); |
| |
MKLIST(*rp,n); |
| |
} |
| |
|
| |
void Pdpv_hm(NODE arg,LIST *rp) |
| |
{ |
| |
NODE n; |
| |
DP ht; |
| |
int pos; |
| |
DPV p; |
| |
Q q; |
| |
|
| |
asir_assert(ARG0(arg),O_DPV,"dpv_hm"); |
| |
p = (DPV)ARG0(arg); |
| |
pos = dpv_hp(p); |
| |
if ( pos < 0 ) |
| |
ht = 0; |
| |
else |
| |
dp_hm(BDY(p)[pos],&ht); |
| |
STOQ(pos,q); |
| |
n = mknode(2,q,ht); |
| |
MKLIST(*rp,n); |
| |
} |
| |
|
| |
void Pdpv_hc(NODE arg,LIST *rp) |
| |
{ |
| |
NODE n; |
| |
P hc; |
| |
int pos; |
| |
DPV p; |
| |
Q q; |
| |
|
| |
asir_assert(ARG0(arg),O_DPV,"dpv_hc"); |
| |
p = (DPV)ARG0(arg); |
| |
pos = dpv_hp(p); |
| |
if ( pos < 0 ) |
| |
hc = 0; |
| |
else |
| |
hc = BDY(BDY(p)[pos])->c; |
| |
STOQ(pos,q); |
| |
n = mknode(2,q,hc); |
| |
MKLIST(*rp,n); |
| |
} |
| |
|
| |
int dpv_hp(DPV p) |
| |
{ |
| |
int len,i,maxp,maxw,w,slen; |
| |
int *shift; |
| |
DP *e; |
| |
|
| |
len = p->len; |
| |
e = p->body; |
| |
slen = dp_current_modspec->len; |
| |
shift = dp_current_modspec->degree_shift; |
| |
switch ( dp_current_modspec->id ) { |
| |
case ORD_REVGRADLEX: |
| |
for ( maxp = -1, i = 0; i < len; i++ ) |
| |
if ( !e[i] ) continue; |
| |
else if ( maxp < 0 ) { |
| |
maxw = BDY(e[i])->dl->td+(i<slen?shift[i]:0); maxp = i; |
| |
} else { |
| |
w = BDY(e[i])->dl->td+(i<slen?shift[i]:0); |
| |
if ( w >= maxw ) { |
| |
maxw = w; maxp = i; |
| |
} |
| |
} |
| |
return maxp; |
| |
case ORD_GRADLEX: |
| |
for ( maxp = -1, i = 0; i < len; i++ ) |
| |
if ( !e[i] ) continue; |
| |
else if ( maxp < 0 ) { |
| |
maxw = BDY(e[i])->dl->td+(i<slen?shift[i]:0); maxp = i; |
| |
} else { |
| |
w = BDY(e[i])->dl->td+(i<slen?shift[i]:0); |
| |
if ( w > maxw ) { |
| |
maxw = w; maxp = i; |
| |
} |
| |
} |
| |
return maxp; |
| |
break; |
| |
case ORD_LEX: |
| |
for ( i = 0; i < len; i++ ) |
| |
if ( e[i] ) return i; |
| |
return -1; |
| |
break; |
| } |
} |
| } |
} |