21.2

java.util.BitSet

THE PACKAGE JAVA.UTIL

public synchronized int hashCode() {

long h = 1234;

for (int i = bits.length;   i >= 0; ) {

h ^= bits[i] * (i + 1);

}

return (int)((h >> 32) ^ h);

}

Note that the hash code value changes if the set of bits is altered.

Overrides the

hashCode

 method of

Object

 ( 20.1.4).

21.2.6

public Object clone()

Cloning this

BitSet

 produces a new

BitSet

 that is equal to it.

Overrides the

clone

 method of

Object

 ( 20.1.5).

21.2.7

public boolean get(int bitIndex)

The result is

true

 if the bit with index

bitIndex

 is currently set in this

BitSet

;

otherwise, the result is

false

.

If

bitIndex

 is negative, an

IndexOutOfBoundsException

 is thrown.

21.2.8

public void set(int bitIndex)

The bit with index

bitIndex

 in this

BitSet

 is changed to the  set  (

true

) state.

If

bitIndex

 is negative, an

IndexOutOfBoundsException

 is thrown.

If

bitIndex

 is not smaller than the value that would be returned by the

size

method ( 21.2.13), then the size of this

BitSet

 is increased to be larger than

bitIndex

.

21.2.9

public void clear(int bitIndex)

The bit with index

bitIndex

 in this

BitSet

 is changed to the  clear  (

false

)

state.

If

bitIndex

 is negative, an

IndexOutOfBoundsException

 is thrown.

If

bitIndex

 is not smaller than the value that would be returned by the

size

method ( 21.2.13), then the size of this

BitSet

 is increased to be larger than

bit 

Index

.

620