- Timestamp:
- 03/14/07 10:27:52 (2 years ago)
- Files:
-
- 1 modified
-
tests/test-invert.C (modified) (4 diffs)
Legend:
- Unmodified
- Added
- Removed
-
tests/test-invert.C
r1 r9 27 27 int n; 28 28 int nbit=atoi(argv[3]); // number of times the product is performed 29 long alphalong=1, betalong=0;30 29 cerr<<setprecision(10); 31 Field::Element alpha,beta;32 30 Field::Element zero, one; 33 31 … … 45 43 A = read_field(F,argv[2],&n,&n); 46 44 Ab = new Field::Element[n*n]; 47 for ( size_t i=0; i<n*n;++i)45 for (int i=0; i<n*n;++i) 48 46 F.assign(*(Ab+i),*(A+i)); 49 47 Field::Element * X = new Field::Element[n*n]; 50 48 51 49 Timer tim,t; t.clear();tim.clear(); 52 int nullity; 50 int nullity=0; 51 53 52 for(int i = 0;i<nbit;++i){ 54 53 t.clear(); … … 58 57 tim+=t; 59 58 if (i+1<nbit) 60 for ( size_t i=0; i<n*n;++i)59 for (int i=0; i<n*n;++i) 61 60 F.assign(*(A+i),*(Ab+i)); 62 61 } … … 68 67 bool wrong = false; 69 68 70 for ( size_t i=0;i<n;++i)71 for ( size_t j=0;j<n;++j)69 for (int i=0;i<n;++i) 70 for (int j=0;j<n;++j) 72 71 if ( ((i!=j) && !F.areEqual(*(I+i*n+j),zero)) 73 72 ||((i==j) &&!F.areEqual(*(I+i*n+j),one)))
