Examples of com.carrotsearch.hppc.BitSet

com.carrotsearch.hppc.BitSet

An "open" BitSet implementation that allows direct access to the array of words storing the bits.

Unlike java.util.bitset, the fact that bits are packed into an array of longs is part of the interface. This allows efficient implementation of other algorithms by someone other than the author. It also allows one to efficiently implement alternate serialization or interchange formats.

The index range for a bitset can easily exceed positive int range in Java (0x7fffffff), so many methods in this class accept or return a long. There are adapter methods that return views compatible with {@link LongLookupContainer} and {@link IntLookupContainer} interfaces.

@see #asIntLookupContainer() @see #asLongLookupContainer() @author "Original implementation from the Lucene project."

    /**
     * Build label paths from a processing result and a list of clusters.
     */
    public static ClusterLabelPaths from(List<Cluster> topClusters, List<Cluster> clusters)
    {
        BitSet selected = new BitSet();
        for (Cluster c : clusters)
            selected.set(c.getId());
        
        ClusterLabelPaths clp = new ClusterLabelPaths();
        descend(topClusters, new ArrayList<String>(), selected, clp.paths);
        return clp;
    }

Examples of com.carrotsearch.hppc.BitSet

Related Classes of com.carrotsearch.hppc.BitSet