Context Navigation

-              r1390
+              r1391
    * of <code>k</code>) if and only if
+   *
    * <pre>
    * ((k/64) < bits.length) && ((bits[k/64] & (1L << (bit % 64))) != 0)
    * </pre>
+   * <
+   *  (bit % 64))) != 0)
+   * </e>
+   *
    * Then the following definition of the hashCode method
    * would be a correct implementation of the actual algorithm:
+   *
+   * <pre>
+   * public int hashCode() {
+   *     long h = 1234;
+   *     for (int i = bits.length-1; i>=0; i--) {
+   *         h ^= bits[i] * (i + 1);
+   *     }
+   *     return (int)((h >> 32) ^ h);
+   * }
+   * </pre>
+   *
+<pre>public int hashCode()
+{
+  long h = 1234;
+  for (int i = bits.length-1; i &gt;= 0; i--)
+  {
+    h ^= bits[i] * (i + 1);
+  }
+  return (int)((h >> 32) ^ h);
+}</pre>
+   *
    * Note that the hash code values changes, if the set is changed.
 …
    * (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 }
+   * </pre>
+   *
+<pre>for (int i = bs.nextSetBit(0); i &gt;= 0; i = bs.nextSetBit(i + 1))
+{
+  // operate on i here
+}</pre>
+   *
    * @param from the start location

Note: See TracChangeset for help on using the changeset viewer.

Changeset 1391 for branches/GNU/src/gcc/libjava/java/util/BitSet.java