version 1.35, 2003/08/01 08:38:05 |
version 1.45, 2003/12/25 08:46:19 |
|
|
* 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.34 2003/07/31 02:56:13 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.44 2003/11/27 07:53:53 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
Line 58 extern struct order_spec dp_current_spec; |
|
Line 58 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(); |
|
|
LIST remove_zero_from_list(LIST); |
LIST remove_zero_from_list(LIST); |
|
|
Line 130 struct ftab dp_tab[] = { |
|
Line 133 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_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 169 struct ftab dp_tab[] = { |
|
Line 177 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 217 struct ftab dp_supp_tab[] = { |
|
Line 226 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; |
|
|
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 ) { |
|
|
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(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) ) { |
|
|
} |
} |
m = QTOS((Q)ARG2(arg)); |
m = QTOS((Q)ARG2(arg)); |
create_order_spec(ARG3(arg),&ord); |
create_order_spec(ARG3(arg),&ord); |
if ( m >= 0 ) |
nd_gr(f,v,m,0,&ord,rp); |
nd_gr(f,v,m,&ord,rp); |
|
else |
|
nd_gr_trace(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(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(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(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(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) |
|
|
{ |
{ |
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)); |