version 1.19, 2011/03/30 05:07:01 |
version 1.20, 2014/09/05 11:55:19 |
|
|
/* $OpenXM: OpenXM/src/asir-contrib/testing/noro/ndbf.rr,v 1.18 2011/01/16 08:46:10 noro Exp $ */ |
/* $OpenXM: OpenXM/src/asir-contrib/testing/noro/ndbf.rr,v 1.19 2011/03/30 05:07:01 noro Exp $ */ |
/* requires 'primdec' */ |
/* requires 'primdec' */ |
|
|
#define TMP_H hhhhhhhh |
#define TMP_H hhhhhhhh |
|
|
if ( type(Vord) != 4 ) { |
if ( type(Vord) != 4 ) { |
for ( I = 0; I < N; I++ ) |
for ( I = 0; I < N; I++ ) |
D[I] = [deg(F,V[I]),V[I]]; |
D[I] = [deg(F,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) |
for ( V = [], I = 0; I < N; I++ ) |
V = cons(D[I][1],V); |
V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
|
|
} |
} |
for ( I = 0; I < N; I++ ) |
for ( I = 0; I < N; I++ ) |
D[I] = [deg(F1,V[I]),V[I]]; |
D[I] = [deg(F1,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) |
for ( V = [], I = 0; I < N; I++ ) |
V = cons(D[I][1],V); |
V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
|
|
F1 = subst(F1,VI,VI^WI); |
F1 = subst(F1,VI,VI^WI); |
} |
} |
for ( I = 0; I < N; I++ ) D[I] = [deg(F1,V[I]),V[I]]; |
for ( I = 0; I < N; I++ ) D[I] = [deg(F1,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) V = cons(D[I][1],V); |
for ( V = [], I = 0; I < N; I++ ) V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
for ( I = 0; I < N; I++ ) { |
for ( I = 0; I < N; I++ ) { |
Line 388 def in_gb_oaku(F) |
|
Line 388 def in_gb_oaku(F) |
|
F1 = subst(F1,VI,VI^WI); |
F1 = subst(F1,VI,VI^WI); |
} |
} |
for ( I = 0; I < N; I++ ) D[I] = [deg(F1,V[I]),V[I]]; |
for ( I = 0; I < N; I++ ) D[I] = [deg(F1,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) V = cons(D[I][1],V); |
for ( V = [], I = 0; I < N; I++ ) V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
for ( I = 0; I < N; I++ ) { |
for ( I = 0; I < N; I++ ) { |
|
|
|
|
for ( I = 0; I < N; I++ ) |
for ( I = 0; I < N; I++ ) |
D[I] = [deg(F,V[I]),V[I]]; |
D[I] = [deg(F,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) |
for ( V = [], I = 0; I < N; I++ ) |
V = cons(D[I][1],V); |
V = cons(D[I][1],V); |
for ( I = N-1, DV = []; I >= 0; I-- ) |
for ( I = N-1, DV = []; I >= 0; I-- ) |
Line 841 def bfct_via_gbfct(F) |
|
Line 841 def bfct_via_gbfct(F) |
|
|
|
for ( I = 0; I < N; I++ ) |
for ( I = 0; I < N; I++ ) |
D[I] = [deg(F,V[I]),V[I]]; |
D[I] = [deg(F,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) |
for ( V = [], I = 0; I < N; I++ ) |
V = cons(D[I][1],V); |
V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |