Class GenericBitSet

src/main/java/pascal/taie/util/collection/GenericBitSet.java:55–264

Bit set based implementation of java.util.Set. To store objects in bit set, the subclasses need to take care of the mappings between objects and indexes by implementing #getIndex and #getElement. The objects stored in the same bit set s should preserve the invaria

 * @param <E> type of elements
 */
public abstract class GenericBitSet<E> extends AbstractSetEx<E>
        implements Serializable {

    protected IBitSet bitSet;

    protected GenericBitSet(boolean isSparse) {
        bitSet = IBitSet.newBitSet(isSparse);
    }

    @Override
    public boolean contains(Object o) {
        checkInvariant(o);
        return bitSet.get(getIndex((E) o));
    }

    @Override
    public boolean add(E e) {
        checkInvariant(e);
        return bitSet.set(getIndex(e));
    }

    @Override
    public boolean remove(Object o) {
        checkInvariant(o);
        return bitSet.clear(getIndex((E) o));
    }

    /**
     * The objects passed to this set should preserve this invariant.
     */
    private void checkInvariant(Object o) {
        assert o.equals(getElement(getIndex((E) o)));
    }

    @Override
    public boolean containsAll(@Nonnull Collection<?> c) {
        if (c instanceof GenericBitSet s) {
            checkContext(s);
            return bitSet.contains(s.bitSet);
        } else {
            return super.containsAll(c);
        }
    }

    @Override
    public boolean addAll(@Nonnull Collection<? extends E> c) {
        if (c instanceof GenericBitSet s) {
            checkContext(s);
            return bitSet.or(s.bitSet);
        } else {
            return super.addAll(c);
        }
    }

    @Override
    public boolean removeAll(Collection<?> c) {
        if (c instanceof GenericBitSet s) {
            checkContext(s);