version 1.87, 2012/08/27 05:38:00 |
version 1.92, 2014/08/19 06:35:01 |
|
|
* 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.86 2012/04/10 07:15:07 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.91 2013/09/12 06:46:16 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
Line 96 void Pdp_nf_f(),Pdp_weyl_nf_f(); |
|
Line 96 void Pdp_nf_f(),Pdp_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(); |
void Pnd_gr_recompute_trace(); |
void Pnd_gr_recompute_trace(), Pnd_btog(); |
void Pnd_weyl_gr(),Pnd_weyl_gr_trace(); |
void Pnd_weyl_gr(),Pnd_weyl_gr_trace(); |
void Pnd_nf(),Pnd_weyl_nf(); |
void Pnd_nf(),Pnd_weyl_nf(); |
void Pdp_initial_term(); |
void Pdp_initial_term(); |
Line 114 LIST dp_initial_term(); |
|
Line 114 LIST dp_initial_term(); |
|
LIST dp_order(); |
LIST dp_order(); |
void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo, |
void parse_gr_option(LIST f,NODE opt,LIST *v,Num *homo, |
int *modular,struct order_spec **ord); |
int *modular,struct order_spec **ord); |
|
NODE dp_inv_or_split(NODE gb,DP f,struct order_spec *spec, DP *inv); |
|
|
LIST remove_zero_from_list(LIST); |
LIST remove_zero_from_list(LIST); |
|
|
Line 165 struct ftab dp_tab[] = { |
|
Line 166 struct ftab dp_tab[] = { |
|
{"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_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_gr_recompute_trace(f,v,m,ord,tlist,rp); |
nd_gr_recompute_trace(f,v,m,ord,tlist,rp); |
} |
} |
|
|
|
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); |
|
|
|
void Pnd_btog(arg,rp) |
|
NODE arg; |
|
Obj *rp; |
|
{ |
|
LIST f,v,tlist; |
|
int m,ac,pos; |
|
struct order_spec *ord; |
|
|
|
do_weyl = 0; |
|
asir_assert(ARG0(arg),O_LIST,"nd_btog"); |
|
asir_assert(ARG1(arg),O_LIST,"nd_btog"); |
|
asir_assert(ARG2(arg),O_N,"nd_btog"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
m = QTOS((Q)ARG2(arg)); |
|
create_order_spec(0,ARG3(arg),&ord); |
|
tlist = (LIST)ARG4(arg); |
|
if ( (ac = argc(arg)) == 6 ) { |
|
asir_assert(ARG5(arg),O_N,"nd_btog"); |
|
pos = QTOS((Q)ARG5(arg)); |
|
*rp = nd_btog_one(f,v,m,ord,tlist,pos); |
|
} else if ( ac == 5 ) |
|
*rp = nd_btog(f,v,m,ord,tlist); |
|
else |
|
error("nd_btog : argument mismatch"); |
|
} |
|
|
void Pnd_weyl_gr_postproc(arg,rp) |
void Pnd_weyl_gr_postproc(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
|
|
} |
} |
} |
} |
|
|
VECT current_top_weight_vector_obj; |
Obj current_top_weight; |
N *current_top_weight_vector; |
extern Obj nd_top_weight; |
|
|
void Pdp_set_top_weight(arg,rp) |
void Pdp_set_top_weight(NODE arg,Obj *rp) |
NODE arg; |
|
VECT *rp; |
|
{ |
{ |
VECT v; |
VECT v; |
int i,n; |
MAT m; |
|
Obj obj; |
|
int i,j,n,id,row,col; |
|
Q *mi; |
NODE node; |
NODE node; |
|
|
if ( !arg ) |
if ( !arg ) |
*rp = current_top_weight_vector_obj; |
*rp = current_top_weight; |
else if ( !ARG0(arg) ) { |
else if ( !ARG0(arg) ) { |
current_top_weight_vector = 0; |
nd_top_weight = 0; |
current_top_weight_vector_obj = 0; |
current_top_weight = 0; |
*rp = 0; |
*rp = 0; |
} else { |
} else { |
if ( OID(ARG0(arg)) != O_VECT && OID(ARG0(arg)) != O_LIST ) |
id = OID(ARG0(arg)); |
|
if ( id != O_VECT && id != O_MAT && id != O_LIST ) |
error("dp_set_top_weight : invalid argument"); |
error("dp_set_top_weight : invalid argument"); |
if ( OID(ARG0(arg)) == O_VECT ) |
if ( id == O_LIST ) { |
v = (VECT)ARG0(arg); |
|
else { |
|
node = (NODE)BDY((LIST)ARG0(arg)); |
node = (NODE)BDY((LIST)ARG0(arg)); |
n = length(node); |
n = length(node); |
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; |
|
} else |
|
obj = ARG0(arg); |
|
if ( OID(obj) == O_VECT ) { |
|
v = (VECT)obj; |
|
for ( i = 0; i < v->len; i++ ) |
|
if ( !INT(BDY(v)[i]) || (BDY(v)[i] && SGN((Q)BDY(v)[i]) < 0) ) |
|
error("dp_set_top_weight : each element must be a non-negative integer"); |
|
} else { |
|
m = (MAT)obj; row = m->row; col = m->col; |
|
for ( i = 0; i < row; i++ ) |
|
for ( j = 0, mi = (Q *)BDY(m)[i]; j < col; j++ ) |
|
if ( !INT(mi[j]) || (mi[j] && SGN((Q)mi[j]) < 0) ) |
|
error("dp_set_top_weight : each element must be a non-negative integer"); |
} |
} |
for ( i = 0; i < v->len; i++ ) |
current_top_weight = obj; |
if ( !INT(BDY(v)[i]) || (BDY(v)[i] && SGN((Q)BDY(v)[i]) < 0) ) |
nd_top_weight = obj; |
error("dp_set_top_weight : each element must be a non-negative integer"); |
*rp = current_top_weight; |
current_top_weight_vector_obj = v; |
|
current_top_weight_vector = (N *)MALLOC(v->len*sizeof(N)); |
|
for ( i = 0; i < v->len; i++ ) { |
|
current_top_weight_vector[i] = !BDY(v)[i]?0:NM((Q)BDY(v)[i]); |
|
} |
|
*rp = current_top_weight_vector_obj; |
|
} |
} |
} |
} |
|
|
Line 2937 int get_opt(char *key0,Obj *r) { |
|
Line 2976 int get_opt(char *key0,Obj *r) { |
|
} |
} |
return 0; |
return 0; |
} |
} |
|
|