Commit db50e427 by Bryce McKinlay

Re-indent in preparation for diff.

From-SVN: r37114
parent 7d3af72b
...@@ -4,9 +4,9 @@ ...@@ -4,9 +4,9 @@
This file is part of libgcj. This file is part of libgcj.
This software is copyrighted work licensed under the terms of the This software is copyrighted work licensed under the terms of the
Libgcj License. Please consult the file "LIBGCJ_LICENSE" for Libgcj License. Please consult the file "LIBGCJ_LICENSE" for
details. */ details. */
package java.util; package java.util;
import java.io.Serializable; import java.io.Serializable;
...@@ -24,11 +24,11 @@ public final class BitSet implements Cloneable, Serializable ...@@ -24,11 +24,11 @@ public final class BitSet implements Cloneable, Serializable
{ {
public void and (BitSet bs) public void and (BitSet bs)
{ {
int max = Math.min(bits.length, bs.bits.length); int max = Math.min (bits.length, bs.bits.length);
int i; int i;
for (i = 0; i < max; ++i) for (i = 0; i < max; ++i)
bits[i] &= bs.bits[i]; bits[i] &= bs.bits[i];
for ( ; i < bits.length; ++i) for (; i < bits.length; ++i)
bits[i] = 0; bits[i] = 0;
} }
...@@ -54,22 +54,22 @@ public final class BitSet implements Cloneable, Serializable ...@@ -54,22 +54,22 @@ public final class BitSet implements Cloneable, Serializable
int bit = pos % 64; int bit = pos % 64;
int offset = pos / 64; int offset = pos / 64;
ensure (offset); ensure (offset);
bits[offset] &= ~ (1L << bit); bits[offset] &= ~(1L << bit);
} }
public Object clone () public Object clone ()
{ {
BitSet bs = new BitSet (bits.length * 64); BitSet bs = new BitSet (bits.length * 64);
System.arraycopy(bits, 0, bs.bits, 0, bits.length); System.arraycopy (bits, 0, bs.bits, 0, bits.length);
return bs; return bs;
} }
public boolean equals (Object obj) public boolean equals (Object obj)
{ {
if (! (obj instanceof BitSet)) if (!(obj instanceof BitSet))
return false; return false;
BitSet bs = (BitSet) obj; BitSet bs = (BitSet) obj;
int max = Math.min(bits.length, bs.bits.length); int max = Math.min (bits.length, bs.bits.length);
int i; int i;
for (i = 0; i < max; ++i) for (i = 0; i < max; ++i)
if (bits[i] != bs.bits[i]) if (bits[i] != bs.bits[i])
...@@ -141,16 +141,16 @@ public final class BitSet implements Cloneable, Serializable ...@@ -141,16 +141,16 @@ public final class BitSet implements Cloneable, Serializable
{ {
if ((word & bit) != 0) if ((word & bit) != 0)
{ {
if (! first) if (!first)
result.append(", "); result.append (", ");
result.append(64 * i + j); result.append (64 * i + j);
first = false; first = false;
} }
bit <<= 1; bit <<= 1;
} }
} }
return result.append("}").toString(); return result.append ("}").toString ();
} }
public void xor (BitSet bs) public void xor (BitSet bs)
...@@ -167,7 +167,7 @@ public final class BitSet implements Cloneable, Serializable ...@@ -167,7 +167,7 @@ public final class BitSet implements Cloneable, Serializable
if (lastElt + 1 > bits.length) if (lastElt + 1 > bits.length)
{ {
long[] nd = new long[lastElt + 1]; long[] nd = new long[lastElt + 1];
System.arraycopy(bits, 0, nd, 0, bits.length); System.arraycopy (bits, 0, nd, 0, bits.length);
bits = nd; bits = nd;
} }
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment