| version 1.33, 2003/07/18 10:13:11 |
version 1.51, 2004/04/30 08:25:38 |
|
|
| * 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.32 2003/06/19 07:08:18 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.50 2004/04/15 08:27:42 noro Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "base.h" |
#include "base.h" |
|
|
| 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; |
| |
|
| int do_weyl; |
int do_weyl; |
| |
|
| |
void Pdp_sort(); |
| void Pdp_mul_trunc(),Pdp_quo(); |
void Pdp_mul_trunc(),Pdp_quo(); |
| void Pdp_ord(), Pdp_ptod(), Pdp_dtop(); |
void Pdp_ord(), Pdp_ptod(), Pdp_dtop(); |
| 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(); |
| Line 89 void Pdp_weyl_set_weight(); |
|
| Line 90 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(); |
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); |
LIST remove_zero_from_list(LIST); |
| |
|
| struct ftab dp_tab[] = { |
struct ftab dp_tab[] = { |
| Line 126 struct ftab dp_tab[] = { |
|
| Line 136 struct ftab dp_tab[] = { |
|
| {"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",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 153 struct ftab dp_tab[] = { |
|
| Line 168 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 169 struct ftab dp_tab[] = { |
|
| Line 184 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}, |
| {"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 199 struct ftab dp_supp_tab[] = { |
|
| Line 215 struct ftab dp_supp_tab[] = { |
|
| {"dp_ht",Pdp_ht,1}, |
{"dp_ht",Pdp_ht,1}, |
| {"dp_hc",Pdp_hc,1}, |
{"dp_hc",Pdp_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}, |
| Line 217 struct ftab dp_supp_tab[] = { |
|
| Line 235 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; |
| Line 400 void Pdp_ord(arg,rp) |
|
| Line 425 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 ( ARG0(arg) && OID(ARG0(arg)) == O_OPTLIST ) |
| |
parse_gr_option(&f,BDY((OPTLIST)ARG0(arg)),&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; |
| } |
} |
| } |
} |
| |
|
|
|
| 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 ( argc(arg) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
| |
parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&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 ( argc(arg) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
| |
parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&v,&homo,&modular,&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) |
void Pdp_set_sugar(arg,rp) |
| NODE arg; |
NODE arg; |
| Q *rp; |
Q *rp; |
|
|
| case 1: |
case 1: |
| DP_Print = 1; |
DP_Print = 1; |
| break; |
break; |
| case 2: default: |
case 2: |
| DP_Print = 0; DP_PrintShort = 1; |
DP_Print = 0; DP_PrintShort = 1; |
| break; |
break; |
| |
default: |
| |
DP_Print = s; DP_PrintShort = 0; |
| |
break; |
| } |
} |
| } else { |
} else { |
| if ( DP_Print ) { |
if ( DP_Print ) { |
|
|
| *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"); |
|
| asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
|
| f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
| f = remove_zero_from_list(f); |
f = remove_zero_from_list(f); |
| if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
| *rp = f; return; |
*rp = f; return; |
| } |
} |
| homo = (Num)ARG2(arg); |
if ( argc(arg) == 5 ) { |
| m = (Q)ARG3(arg); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
| if ( !m ) |
asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
| modular = 0; |
asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
| else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) |
v = (LIST)ARG1(arg); |
| error("dp_gr_main : too large modulus"); |
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 ( (ac=argc(arg)) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
| |
parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&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; |
| int m,field,t; |
int m,field,t; |
| struct order_spec ord; |
struct order_spec *ord; |
| NODE n; |
NODE n; |
| |
|
| do_weyl = 0; |
do_weyl = 0; |
|
|
| m = QTOS((Q)ARG3(arg)); |
m = QTOS((Q)ARG3(arg)); |
| if ( m ) |
if ( m ) |
| error("dp_gr_f_main : trace lifting is not implemented yet"); |
error("dp_gr_f_main : trace lifting is not implemented yet"); |
| create_order_spec(ARG4(arg),&ord); |
create_order_spec(0,ARG4(arg),&ord); |
| #else |
#else |
| m = 0; |
m = 0; |
| create_order_spec(ARG3(arg),&ord); |
create_order_spec(0,ARG3(arg),&ord); |
| #endif |
#endif |
| field = 0; |
field = 0; |
| for ( n = BDY(f); n; n = NEXT(n) ) { |
for ( n = BDY(f); n; n = NEXT(n) ) { |
|
|
| else if ( t != field ) |
else if ( t != field ) |
| error("dp_gr_f_main : incosistent coefficients"); |
error("dp_gr_f_main : incosistent coefficients"); |
| } |
} |
| 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(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"); |
|
|
| if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
| *rp = f; return; |
*rp = f; return; |
| } |
} |
| create_order_spec(ARG2(arg),&ord); |
create_order_spec(0,ARG2(arg),&ord); |
| dp_f4_main(f,v,&ord,rp); |
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"); |
|
|
| } |
} |
| 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"); |
|
|
| 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) |
void Pnd_gr(arg,rp) |
| NODE arg; |
NODE arg; |
| LIST *rp; |
LIST *rp; |
| { |
{ |
| LIST f,v; |
LIST f,v; |
| int m; |
int m,homo; |
| struct order_spec ord; |
struct order_spec *ord; |
| |
|
| do_weyl = 0; |
do_weyl = 0; |
| asir_assert(ARG0(arg),O_LIST,"nd_gr"); |
asir_assert(ARG0(arg),O_LIST,"nd_gr"); |
| asir_assert(ARG1(arg),O_LIST,"nd_gr"); |
asir_assert(ARG1(arg),O_LIST,"nd_gr"); |
| asir_assert(ARG3(arg),O_N,"nd_gr"); |
asir_assert(ARG2(arg),O_N,"nd_gr"); |
| f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
| f = remove_zero_from_list(f); |
f = remove_zero_from_list(f); |
| if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
| *rp = f; return; |
*rp = f; return; |
| } |
} |
| m = QTOS((Q)ARG2(arg)); |
m = QTOS((Q)ARG2(arg)); |
| if ( !m ) |
create_order_spec(0,ARG3(arg),&ord); |
| error("nd_gr : invalid argument"); |
nd_gr(f,v,m,0,ord,rp); |
| create_order_spec(ARG3(arg),&ord); |
|
| nd_gr(f,v,m,&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"); |
|
| asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
|
| f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
| f = remove_zero_from_list(f); |
f = remove_zero_from_list(f); |
| if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
| *rp = f; return; |
*rp = f; return; |
| } |
} |
| homo = (Num)ARG2(arg); |
if ( argc(arg) == 5 ) { |
| m = (Q)ARG3(arg); |
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
| if ( !m ) |
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
| modular = 0; |
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
| else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) |
v = (LIST)ARG1(arg); |
| error("dp_gr_main : too large modulus"); |
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 ( (ac=argc(arg)) == 2 && OID(ARG1(arg)) == O_OPTLIST ) |
| |
parse_gr_option(f,BDY((OPTLIST)ARG1(arg)),&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"); |
|
|
| *rp = f; return; |
*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"); |
|
|
| if ( !BDY(f) ) { |
if ( !BDY(f) ) { |
| *rp = f; return; |
*rp = f; return; |
| } |
} |
| create_order_spec(ARG2(arg),&ord); |
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"); |
|
|
| } |
} |
| 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"); |
|
|
| 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)); |