A BitSet
represents an alternate representation of a
set. Given a finite number of n
objects, you can
associate a unique integer with each object. Then each possible
subset of the objects corresponds to an n
-bit vector,
with each bit "on" or "off" depending on
whether the object is in the subset. For small values of n
,
a bit vector might be an extremely compact representation.
However, for large values of n
, an actual bit vector
might be inefficient, when most of the bits are off.
There is no replacement to BitSet
in the new
framework.