Cloneable, java.io.Serializable

Creates a new bit set. All bits are initially false.

Creates a bit set whose initial size is large enough to explicitly represent bits with indices in the range 0 through nbits-1. All bits are initially false.

Sets the bit at the specified index to the complement of its current value.

Sets each bit from the specified fromIndex (inclusive) to the specified toIndex (exclusive) to the complement of its current value.

Sets the bit at the specified index to true.

Sets the bit at the specified index to the specified value.

Sets the bits from the specified fromIndex (inclusive) to the specified toIndex (exclusive) to true.

Sets the bits from the specified fromIndex (inclusive) to the specified toIndex (exclusive) to the specified value.

Sets the bit specified by the index to false.

Sets the bits from the specified fromIndex (inclusive) to the specified toIndex (exclusive) to false.

Sets all of the bits in this BitSet to false.

Returns the value of the bit with the specified index. The value is true if the bit with the index bitIndex is currently set in this BitSet; otherwise, the result is false.

Returns a new BitSet composed of bits from this BitSet from fromIndex (inclusive) to toIndex (exclusive).

Returns the index of the first bit that is set to true that occurs on or after the specified starting index. If no such bit exists then -1 is returned. To iterate over the true bits in a BitSet, use the following loop:

 for (int i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i+1)) {
     // operate on index i here
 }

Returns the index of the first bit that is set to false that occurs on or after the specified starting index.

Returns the "logical size" of this BitSet: the index of the highest set bit in the BitSet plus one. Returns zero if the BitSet contains no set bits.

Returns true if this BitSet contains no bits that are set to true.

Returns true if the specified BitSet has any bits set to true that are also set to true in this BitSet.

Returns the number of bits set to true in this BitSet.

Performs a logical AND of this target bit set with the argument bit set. This bit set is modified so that each bit in it has the value true if and only if it both initially had the value true and the corresponding bit in the bit set argument also had the value true.

Performs a logical OR of this bit set with the bit set argument. This bit set is modified so that a bit in it has the value true if and only if it either already had the value true or the corresponding bit in the bit set argument has the value true.

Performs a logical XOR of this bit set with the bit set argument. This bit set is modified so that a bit in it has the value true if and only if one of the following statements holds:

• The bit initially has the value true, and the corresponding bit in the argument has the value false.
• The bit initially has the value false, and the corresponding bit in the argument has the value true.

Clears all of the bits in this BitSet whose corresponding bit is set in the specified BitSet.

Returns a hash code value for this bit set. The hash code depends only on which bits have been set within this BitSet. The algorithm used to compute it may be described as follows.

Suppose the bits in the BitSet were to be stored in an array of long integers called, say, words, in such a manner that bit k is set in the BitSet (for nonnegative values of k) if and only if the expression

((k>>6) < words.length) && ((words[k>>6] & (1L << (bit & 0x3F))) != 0)

is true. Then the following definition of the hashCode method would be a correct implementation of the actual algorithm:

 public int hashCode() {
      long h = 1234;
      for (int i = words.length; --i >= 0; ) {
           h ^= words[i] * (i + 1);
      }
      return (int)((h >> 32) ^ h);
 }

Note that the hash code values change if the set of bits is altered.

Overrides the hashCode method of Object.

Returns the number of bits of space actually in use by this BitSet to represent bit values. The maximum element in the set is the size - 1st element.

Compares this object against the specified object. The result is true if and only if the argument is not null and is a Bitset object that has exactly the same set of bits set to true as this bit set. That is, for every nonnegative int index k,

((BitSet)obj).get(k) == this.get(k)

must be true. The current sizes of the two bit sets are not compared.

Overrides the equals method of Object.

Cloning this BitSet produces a new BitSet that is equal to it. The clone of the bit set is another bit set that has exactly the same bits set to true as this bit set.

Overrides the clone method of Object.

Returns a string representation of this bit set. For every index for which this BitSet contains a bit in the set state, the decimal representation of that index is included in the result. Such indices are listed in order from lowest to highest, separated by ", " (a comma and a space) and surrounded by braces, resulting in the usual mathematical notation for a set of integers.

Overrides the toString method of Object.

Example:

 BitSet drPepper = new BitSet();

Now drPepper.toString() returns "{}".

 drPepper.set(2);

Now drPepper.toString() returns "{2}".

 drPepper.set(4);
 drPepper.set(10);

Now drPepper.toString() returns "{2, 4, 10}".