164 |
|
Map<Integer,Integer> intMap = (Map<Integer,Integer>)s; |
165 |
|
timer.start(nm, n); |
166 |
|
for (int i = 0; i < n; i++) { |
167 |
< |
if ((Integer) (intMap.get(i)) != i) ++sum; |
167 |
> |
if (intMap.get(i) != i) ++sum; |
168 |
|
} |
169 |
|
timer.finish(); |
170 |
|
reallyAssert (sum == expect); |
610 |
|
abs[ai++] = s; |
611 |
|
break; |
612 |
|
} |
613 |
< |
sb.append((char)c); |
613 |
> |
sb.append((char) c); |
614 |
|
} |
615 |
|
} |
616 |
|
in.close(); |
629 |
|
char[] c = new char[len * 4 + 1]; |
630 |
|
for (int j = 1; j < len; ++j) { |
631 |
|
int r = srng.next(); |
632 |
< |
c[k++] = (char)(' ' + (r & 0x7f)); |
632 |
> |
c[k++] = (char) (' ' + (r & 0x7f)); |
633 |
|
r >>>= 8; |
634 |
< |
c[k++] = (char)(' ' + (r & 0x7f)); |
634 |
> |
c[k++] = (char) (' ' + (r & 0x7f)); |
635 |
|
r >>>= 8; |
636 |
< |
c[k++] = (char)(' ' + (r & 0x7f)); |
636 |
> |
c[k++] = (char) (' ' + (r & 0x7f)); |
637 |
|
r >>>= 8; |
638 |
< |
c[k++] = (char)(' ' + (r & 0x7f)); |
638 |
> |
c[k++] = (char) (' ' + (r & 0x7f)); |
639 |
|
} |
640 |
< |
c[k++] = (char)((i & 31) | 1); // never == to any testword |
640 |
> |
c[k++] = (char) ((i & 31) | 1); // never == to any testword |
641 |
|
ws[i] = new String(c); |
642 |
|
} |
643 |
|
} |
663 |
|
else |
664 |
|
s = stats.sum; |
665 |
|
|
666 |
< |
double t = ((double)s) / n; |
666 |
> |
double t = ((double) s) / n; |
667 |
|
long nano = Math.round(t); |
668 |
|
System.out.printf("%6d", + nano); |
669 |
|
System.out.println(); |