diff options
Diffstat (limited to 'libjava/classpath/java/util/BitSet.java')
| -rw-r--r-- | libjava/classpath/java/util/BitSet.java | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/libjava/classpath/java/util/BitSet.java b/libjava/classpath/java/util/BitSet.java index 13bf8a13cff..1072978a4fd 100644 --- a/libjava/classpath/java/util/BitSet.java +++ b/libjava/classpath/java/util/BitSet.java @@ -107,7 +107,7 @@ public class BitSet implements Cloneable, Serializable { if (nbits < 0) throw new NegativeArraySizeException(); - + int length = nbits >>> 6; if ((nbits & LONG_MASK) != 0) ++length; @@ -412,7 +412,7 @@ public class BitSet implements Cloneable, Serializable * Then the following definition of the hashCode method * would be a correct implementation of the actual algorithm: * - * + * <pre>public int hashCode() { long h = 1234; @@ -535,7 +535,7 @@ public class BitSet implements Cloneable, Serializable * Returns the index of the next true bit, from the specified bit * (inclusive). If there is none, -1 is returned. You can iterate over * all true bits with this loop:<br> - * + * <pre>for (int i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i + 1)) { // operate on i here @@ -750,8 +750,8 @@ public class BitSet implements Cloneable, Serializable { for (int i = other.bits.length - 1; i >= 0; i--) { - if ((bits[i] & other.bits[i]) != other.bits[i]) - return false; + if ((bits[i] & other.bits[i]) != other.bits[i]) + return false; } return true; } |