public final void testGenerateSeedint03(){
  byte[] myBytes1;
  byte[] myBytes2;
  for (int i=0; i < LENGTH; i+=INCR) {
    int n=0;
    myBytes1=sr.generateSeed(i);
    myBytes2=sr.generateSeed(i);
    for (int j=0; j < i; j++) {
      if (myBytes1[j] == myBytes2[j]) {
        n++;
      }
    }
    assertFalse("unexpected: n*2 > i  :: i=" + i + " n="+ n,n * 2 > i);
  }
}

public final void testGenerateSeedint03 ( ) { byte [ ] myBytes1 ; byte [ ] myBytes2 ; for ( int i = 0 ; i < LENGTH ; i += INCR ) { int n = 0 ; myBytes1 = sr . generateSeed ( i ) ; myBytes2 = sr . generateSeed ( i ) ; for ( int j = 0 ; j < i ; j ++ ) { if ( myBytes1 [ j ] == myBytes2 [ j ] ) { n ++ ; } } assertFalse ( "unexpected: n*2 > i  :: i=" + i + " n=" + n , n * 2 > i ) ; } }
test against the " void generateseed ( int ) " method ; it checks out the quality of entropy ( # of different bytes in sequential calls is more or equal to 50 % )
