pascal.taie.util.collection.IndexableSet Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of tai-e Show documentation
An easy-to-learn/use static analysis framework for Java
The newest version!
/*
 * Tai-e: A Static Analysis Framework for Java
 *
 * Copyright (C) 2022 Tian Tan 
 * Copyright (C) 2022 Yue Li 
 *
 * This file is part of Tai-e.
 *
 * Tai-e is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation, either version 3
 * of the License, or (at your option) any later version.
 *
 * Tai-e is distributed in the hope that it will be useful,but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
 * Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with Tai-e. If not, see .
 */

package pascal.taie.util.collection;

import pascal.taie.util.Indexable;

import java.util.Iterator;

/**
 * An efficient set implementation for {@link Indexable} objects.
 *
 * 
 * NOTE: this set is not a fully-functional set.
 * It does not actually store the elements (it only stores the indexes),
 * so it cannot support operations on the elements, e.g., iterations.
 * This set is suitable for fast check on presence/absence of certain elements.
 * If you need a fully-functional set backing by bit set,
 * please use {@link IndexerBitSet}.
 * 
 * This set extend {@link AbstractSetEx} so that it can be used
 * (as large set) to construct hybrid set.
 *
 * @param  type of elements whose indexes are stored in this set
 * @see Indexable
 */
public class IndexableSet extends AbstractSetEx {

    private final IBitSet bitSet;

    public IndexableSet(boolean isSparse) {
        this.bitSet = IBitSet.newBitSet(isSparse);
    }

    @Override
    public boolean contains(Object o) {
        return o instanceof Indexable i && bitSet.get(i.getIndex());
    }

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

    @Override
    public boolean remove(Object o) {
        return o instanceof Indexable i && bitSet.clear(i.getIndex());
    }

    @Override
    public Iterator iterator() {
        throw new UnsupportedOperationException(
                getClass() + " does not support iteration");
    }

    @Override
    public int size() {
        return bitSet.cardinality();
    }
}