Tiny optimization to reverse()

git-svn-id: https://zxing.googlecode.com/svn/trunk@880 59b500cc-1b3d-0410-9834-0bbf25fbcc57
This commit is contained in:
srowen 2009-03-09 15:56:08 +00:00
parent 04ff9c43b5
commit 7561941341

View file

@ -133,11 +133,7 @@ public final class BitArray {
* Reverses all bits in the array. * Reverses all bits in the array.
*/ */
public void reverse() { public void reverse() {
int[] newBits = makeArray(size); int[] newBits = new int[bits.length];
int max = newBits.length;
for (int i = 0; i < max; i++) {
newBits[i] = 0;
}
int size = this.size; int size = this.size;
for (int i = 0; i < size; i++) { for (int i = 0; i < size; i++) {
if (get(size - i - 1)) { if (get(size - i - 1)) {
@ -158,7 +154,7 @@ public final class BitArray {
public String toString() { public String toString() {
StringBuffer result = new StringBuffer(size); StringBuffer result = new StringBuffer(size);
for (int i = 0; i < size; i++) { for (int i = 0; i < size; i++) {
if (i % 8 == 0) { if ((i & 0x07) == 0) {
result.append(' '); result.append(' ');
} }
result.append(get(i) ? 'X' : '.'); result.append(get(i) ? 'X' : '.');