| This class represents bit array based sets of short values. When a
bit in the underlying array is set, the value having the same
number as the bit is contained in the array. This implies that
bit sets cannot contain negative values.
Implementation of
ShortSortedSet is supported from PCJ 1.2. Prior to 1.2, only ShortSet
was implemented.
Note: There is no growth policy involved with bit sets. The number
of bits to use depends on the value of the largest element and not
the size of the set. While sizes are predictable (they grow), a
new maximum element is generally not predictable making it
meaningless to grow the array at a specific rate.
author:
Søren Bak
version:
1.3 21-08-2003 19:54
since:
1.0 | 