Examples of bak.pcj.set.IntBitSet$SubSet

bak.pcj.set.IntBitSet

This class represents bit array based sets of int 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 IntSortedSet is supported from PCJ 1.2. Prior to 1.2, only IntSet 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

     */
    public IntBitSetBenchmark() {
        super(
            new IntSetFactory() {
                public IntSet create(int[] elements) {
                    IntSet s = new IntBitSet();
                    for (int i = 0; i < elements.length; i++)
                        s.add(elements[i]);
                    return s;
                }
            }
        );
    }

Examples of bak.pcj.set.IntBitSet$SubSet

Related Classes of bak.pcj.set.IntBitSet$SubSet