BitSet

The java.util.BitSet class implements a vector of bits that grows as needed. Each component of the bit set has a boolean value, which is 'false' by default. The bits of a BitSet are indexed by nonnegative integers i.e. from 0 to (length - 1).

A BitSet can be defined in any of the following ways.
1) BitSet bitSet = new BitSet();
2) BitSet bitSet = new BitSet(size);

These are some of the BitSet methods. If b is a BitSet,

Method	Description
b.size()	Size of b
b.length()	Logical Size (Index of highest set bit plus 1)
b.cardinality()	Number of bits set to 'true'
b.set(int bitIndex)	Sets bit at 'bitIndex' to 'true'
b.set(int fromIndex, int toIndex)	Sets bits from 'fromIndex' till 'toIndex' to 'true'
b.get(int bitIndex)	Gets bit at 'bitIndex'
b.get(int fromIndex, int toIndex)	Gets bits from 'fromIndex' till 'toIndex'
b.flip(int bitIndex)	Complements bit at 'bitIndex'
b.flip(int fromIndex, int toIndex)	Complements bits from 'fromIndex' till 'toIndex'
b.clear(int bitIndex)	Sets bit at 'bitIndex' to 'false'
b.clear(int fromIndex, int toIndex)	Sets bits from 'fromIndex' till 'toIndex' to 'false'
b.clear()	Sets all bits to 'false'

Fill in the Blanks

The java. implements a vector of bits that grows as needed.

BitSet Operations

Here is a list of some operations which can be applied on BitSet objects.

Operation	Description
b1.and(b2)	AND of b1 and b2
b1.or(b2)	OR of b1 and b2
b1.xor(b2)	XOR of b1 and b2
b1.andNot(b2)	Clears all bits in b1 where corresponding bit is set in b2
b1.intersects(b2)	'true' if b2 has any bits set to 'true' that are also set to 'true' in b1

Here, b1 and b2 are two BitSet objects. Using these, logical operations on BitSets (Try It Yourself!) can be performed.

Fill in the Blanks to output the result obtained when BitSet 'b1' is XORed with BitSet 'b2'.

System.out.println();