Examples of BitSet

antlr.collections.impl.BitSet
A BitSet to replace java.util.BitSet. Primary differences are that most set operators return new sets as opposed to oring and anding "in place". Further, a number of operations were added. I cannot contain a BitSet because there is no way to access the internal bits (which I need for speed) and, because it is final, I cannot subclass to add functionality. Consider defining set degree. Without access to the bits, I must call a method n times to test the ith bit...ack! Also seems like or() from util is wrong when size of incoming set is bigger than this.bits.length. @author Terence Parr @author
Pete Wells
beaver.comp.util.BitSet
A set for elements 0..N
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."
com.salesforce.phoenix.util.BitSet
BitSet that can be initialized with primitive types, which is only available in Java 7 or above. @author jtaylor @since 2.1.0
java.util.BitSet
This class implements a vector of bits that grows as needed. Each component of the bit set has a boolean value. The bits of a BitSet are indexed by nonnegative integers. Individual indexed bits can be examined, set, or cleared. One BitSet may be used to modify the contents of another BitSet through logical AND, logical inclusive OR, and logical exclusive OR operations.
By default, all bits in the set initially have the value false.
Every bit set has a current size, which is the number of bits of space currently in use by the bit set. Note that the size is related to the implementation of a bit set, so it may change with implementation. The length of a bit set relates to logical length of a bit set and is defined independently of implementation.
Unless otherwise noted, passing a null parameter to any of the methods in a BitSet will result in a NullPointerException.
A BitSet is not safe for multithreaded use without external synchronization. @author Arthur van Hoff @author Michael McCloskey @author Martin Buchholz @version 1.67, 04/07/06 @since JDK1.0
macromedia.asc.util.BitSet
The methods in java.util.BitSet modify the internal values. The class does not offer methods that return new values as BitSet. This simple class does that. @author Clement Wong
net.sf.jcontracts.antlr.collections.impl.BitSet
org.antlr.misc.BitSet
A BitSet to replace java.util.BitSet. Primary differences are that most set operators return new sets as opposed to oring and anding "in place". Further, a number of operations were added. I cannot contain a BitSet because there is no way to access the internal bits (which I need for speed) and, because it is final, I cannot subclass to add functionality. Consider defining set degree. Without access to the bits, I must call a method n times to test the ith bit...ack! Also seems like or() from util is wrong when size of incoming set is bigger than this.bits.length. @author Terence Parr
org.antlr.runtime.BitSet
A stripped-down version of org.antlr.misc.BitSet that is just good enough to handle runtime requirements such as FOLLOW sets for automatic error recovery.
org.apache.lucene.util.BitSet
org.apache.phoenix.util.BitSet
BitSet that can be initialized with primitive types, which is only available in Java 7 or above. @since 2.1.0
org.fastlsh.util.BitSet
A simplified and streamlined version of {@link java.util.BitSet}.
org.joni.BitSet
org.jostraca.comp.antlr.collections.impl.BitSet
A BitSet to replace java.util.BitSet. Primary differences are that most set operators return new sets as opposed to oring and anding "in place". Further, a number of operations were added. I cannot contain a BitSet because there is no way to access the internal bits (which I need for speed) and, because it is final, I cannot subclass to add functionality. Consider defining set degree. Without access to the bits, I must call a method n times to test the ith bit...ack! Also seems like or() from util is wrong when size of incoming set is bigger than this.bits.length. @author Terence Parr @author
Pete Wells
org.rascalmpl.parser.gtd.util.BitSet
persistence.antlr.collections.impl.BitSet
A BitSet to replace java.util.BitSet. Primary differences are that most set operators return new sets as opposed to oring and anding "in place". Further, a number of operations were added. I cannot contain a BitSet because there is no way to access the internal bits (which I need for speed) and, because it is final, I cannot subclass to add functionality. Consider defining set degree. Without access to the bits, I must call a method n times to test the ith bit...ack! Also seems like or() from util is wrong when size of incoming set is bigger than this.bits.length. @author Terence Parr @author
Pete Wells

Examples of org.apache.phoenix.util.BitSet

        boolean indexWALDisabled = index.isWALDisabled();
        int indexPosOffset = (index.getBucketNum() == null ? 0 : 1) + (this.isMultiTenant ? 1 : 0) + (this.viewIndexId == null ? 0 : 1);
        int nIndexColumns = index.getColumns().size() - indexPosOffset;
        int nIndexPKColumns = index.getPKColumns().size() - indexPosOffset;
        this.rowKeyMetaData = newRowKeyMetaData(nIndexPKColumns);
        BitSet bitSet = this.rowKeyMetaData.getViewConstantColumnBitSet();


        int dataPosOffset = (isDataTableSalted ? 1 : 0) + (this.isMultiTenant ? 1 : 0);
        int nDataPKColumns = dataRowKeySchema.getFieldCount() - dataPosOffset;
        // For indexes on views, we need to remember which data columns are "constants"
        // These are the values in a VIEW where clause. For these, we don't put them in the
        // index, as they're the same for every row in the index.
        if (dataTable.getType() == PTableType.VIEW) {
            List<PColumn>dataPKColumns = dataTable.getPKColumns();
            for (int i = dataPosOffset; i < dataPKColumns.size(); i++) {
                PColumn dataPKColumn = dataPKColumns.get(i);
                if (dataPKColumn.getViewConstant() != null) {
                    bitSet.set(i);
                    nDataPKColumns--;
                }
            }
        }
        this.indexTableName = indexTableName;

View Full Code Here

Examples of org.fastlsh.util.BitSet

      }
    
    @Test 
    public void stuff()
    {
        BitSet b1 = new BitSet(64);
        b1.set(0);          
        BitSet b2 = new BitSet(64);
        b2.set(1);        
        BitSet b3 = new BitSet(64);
        b3.set(2);        
        BitSet b4 = new BitSet(64);
        b4.set(0);          
        b4.set(63);          
        long l1 = b1.bits[0];
        long l2 = b2.bits[0];
        long l3 = b3.bits[0];
        long l4 = b4.bits[0];

View Full Code Here

Examples of org.joni.BitSet

    }


    // and_cclass
    public void and(CClassNode other, Encoding enc) {
        boolean not1 = isNot();
        BitSet bsr1 = bs;
        CodeRangeBuffer buf1 = mbuf;
        boolean not2 = other.isNot();
        BitSet bsr2 = other.bs;
        CodeRangeBuffer buf2 = other.mbuf;


        if (not1) {
            BitSet bs1 = new BitSet();
            bsr1.invertTo(bs1);
            bsr1 = bs1;
        }


        if (not2) {
            BitSet bs2 = new BitSet();
            bsr2.invertTo(bs2);
            bsr2 = bs2;
        }


        bsr1.and(bsr2);

View Full Code Here

Examples of org.jostraca.comp.antlr.collections.impl.BitSet

     * @return The position of the bitset in the list.
     */
    protected int markBitsetForGen(BitSet p) {
        // Is the bitset (or an identical one) already marked for gen?
        for (int i = 0; i < bitsetsUsed.size(); i++) {
            BitSet set = (BitSet)bitsetsUsed.elementAt(i);
            if (p.equals(set)) {
                // Use the identical one already stored
                return i;
            }
        }

View Full Code Here

Examples of org.rascalmpl.parser.gtd.util.BitSet

    int edgesMapSize = edgesMap.size();
    int possibleMaxSize = edgesMapSize + potentialNewEdges;
    if(prefixesMap == null){
      prefixesMap = new ArrayList[possibleMaxSize];
      
      propagatedPrefixes = new BitSet();
    }else{
      if(prefixesMap.length < possibleMaxSize){
        ArrayList<Link>[] oldPrefixesMap = prefixesMap;
        prefixesMap = new ArrayList[possibleMaxSize];
        System.arraycopy(oldPrefixesMap, 0, prefixesMap, 0, edgesMapSize);
      }
      
      if(propagatedPrefixes == null){
        propagatedPrefixes = new BitSet();
      }else{
        propagatedPrefixes.enlargeTo(possibleMaxSize);
      }
    }

View Full Code Here

Examples of persistence.antlr.collections.impl.BitSet

     */
    protected String filterRule = null;


    LexerGrammar(String className_, Tool tool_, String superClass) {
        super(className_, tool_, superClass);
        charVocabulary = new BitSet();


        // Lexer usually has no default error handling
        defaultErrorHandler = false;
    }

View Full Code Here

0 1 2 3 4 5 6

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.