version 1.17, 2002/09/03 09:57:51 |
version 1.19, 2003/10/20 00:58:47 |
|
|
* 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/lib/gr,v 1.16 2002/09/03 08:12:25 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/lib/gr,v 1.18 2003/06/21 02:09:17 noro Exp $ |
*/ |
*/ |
|
|
|
module gr $ |
|
/* Empty for now. It will be used in a future. */ |
|
endmodule $ |
|
|
extern INIT_COUNT,ITOR_FAIL$ |
extern INIT_COUNT,ITOR_FAIL$ |
extern REMOTE_MATRIX,REMOTE_NF,REMOTE_VARS$ |
extern REMOTE_MATRIX,REMOTE_NF,REMOTE_VARS$ |
|
|
Line 1077 def gb_comp(A,B) |
|
Line 1082 def gb_comp(A,B) |
|
LB = length(B); |
LB = length(B); |
if ( LA != LB ) |
if ( LA != LB ) |
return 0; |
return 0; |
A1 = qsort(newvect(LA,A)); |
A = newvect(LA,A); |
B1 = qsort(newvect(LB,B)); |
B = newvect(LB,B); |
|
for ( I = 0; I < LA; I++ ) |
|
A[I] *= headsgn(A[I]); |
|
for ( I = 0; I < LB; I++ ) |
|
B[I] *= headsgn(B[I]); |
|
A1 = qsort(A); |
|
B1 = qsort(B); |
for ( I = 0; I < LA; I++ ) |
for ( I = 0; I < LA; I++ ) |
if ( A1[I] != B1[I] && A1[I] != -B1[I] ) |
if ( A1[I] != B1[I] && A1[I] != -B1[I] ) |
break; |
break; |