List of nextClearBit() Examples

Examples of nextClearBit()

java.util.BitSet.nextClearBit()
Returns the index of the first bit that is set to false that occurs on or after the specified starting index. @param fromIndex the index to start checking from (inclusive). @return the index of the next clear bit. @throws IndexOutOfBoundsException if the specified index is negative. @since 1.4
org.h2.util.BitField.nextClearBit()
Get the index of the next bit that is not set. @param fromIndex where to start searching @return the index of the next disabled bit
org.jgroups.util.FixedSizeBitSet.nextClearBit()
Returns the index of the first bit that is set to false that occurs on or after the specified starting index. @param fromIndex the index to start checking from (inclusive). @return the index of the next clear bit. @throws IndexOutOfBoundsException if the specified index is negative.

Examples of java.util.BitSet.nextClearBit()


        BitSet b = new BitSet( l + 1 );
        b.or( key );
        int x = key.nextSetBit( 0 );
        if ( x == 0 ) {
            int y = b.nextClearBit( 0 );
            b.set( x, y, false );
            b.set(y);
        } else {
            b.set(0);
        }

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

    BitSet nextKey( BitSet key ) {
        BitSet b = new BitSet();
        b.or( key );
        int x = key.nextSetBit( 0 );
        if ( x == 0 ) {
            int y = b.nextClearBit( 0 );
            b.set( x, y, false );
            b.set(y);
        } else {
            b.set(0);
        }

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

      pass = true;
    }
    harness.check(pass);
    
    bs.clear(7);
    harness.check(bs.nextClearBit(7), 7);
  }
  
  private void test3(TestHarness harness)
  {
    harness.checkPoint("(int, int)");

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

            int bitSetPtr = 0;  //bitSetPtr is start index pointer of bitset
            while ((nextOne = bits.nextSetBit(bitSetPtr)) != -1) {
                final int lengthToCopy = nextOne - bitSetPtr;
                System.arraycopy(values, start, temp, dest, lengthToCopy);
                dest += lengthToCopy;
                start = begin + (bitSetPtr = bits.nextClearBit(nextOne));
            }
            //Copy any residue past start index till begin+length
            if (start < begin + length) {
                System.arraycopy(values,start,temp,dest,begin + length - start);
            }

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

                boolean isKey = field.getAnnotation(TypeDeclaration.ATTR_KEY) != null;
                fieldDef.setKey(isKey);


                fieldDef.setDeclIndex(field.getIndex());
                if (field.getIndex() < 0) {
                    int freePos = occupiedPositions.nextClearBit(0);
                    if (freePos < maxDeclaredPos) {
                        occupiedPositions.set(freePos);
                    } else {
                        freePos = maxDeclaredPos + 1;
                    }

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

    boolean caseSensitive = viewer.getChainCaseSensitive();
    if (!caseSensitive)
      chainId = Character.toUpperCase(chainId);
    BitSet bs = new BitSet();
    BitSet bsDone = new BitSet(atomCount);
    for (int i = bsDone.nextClearBit(0); i < atomCount; i = bsDone.nextClearBit(i)) {
      Chain chain = atoms[i].getChain();
      if (chainId == (caseSensitive ? chain.chainID : Character.toUpperCase(chain.chainID))) {
        chain.setAtomBitSet(bs);
        bsDone.or(bs);
      } else {

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

    boolean caseSensitive = viewer.getChainCaseSensitive();
    if (!caseSensitive)
      chainId = Character.toUpperCase(chainId);
    BitSet bs = new BitSet();
    BitSet bsDone = new BitSet(atomCount);
    for (int i = bsDone.nextClearBit(0); i < atomCount; i = bsDone.nextClearBit(i)) {
      Chain chain = atoms[i].getChain();
      if (chainId == (caseSensitive ? chain.chainID : Character.toUpperCase(chain.chainID))) {
        chain.setAtomBitSet(bs);
        bsDone.or(bs);
      } else {

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

            r = -1;
            while (true) {


                /*-- LBZ2: find the next non-singleton bucket --*/
                k = r + 1;
                k = bhtab.nextClearBit(k);
                l = k - 1;
                if (l >= nblock) {
                    break;
                }
                k = bhtab.nextSetBit(k + 1);

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

        int failed = 0;
        while(true) {
            if (bs.cardinality() == leaves.length) {
                break;
            }
            for(int i=bs.nextClearBit(0); i<leaves.length; i=bs.nextClearBit(i+1)) {
                Result res = leaves[i].getNext(DUMMYTUPLE);
                switch(res.returnStatus) {
                case POStatus.STATUS_NULL:
                    // good null from store means keep at it.
                    continue;

View Full Code Here

Examples of java.util.BitSet.nextClearBit()

        int failed = 0;
        while(true) {
            if (bs.cardinality() == leaves.length) {
                break;
            }
            for(int i=bs.nextClearBit(0); i<leaves.length; i=bs.nextClearBit(i+1)) {
                Result res = leaves[i].getNext(DUMMYTUPLE);
                switch(res.returnStatus) {
                case POStatus.STATUS_NULL:
                    // good null from store means keep at it.
                    continue;

View Full Code Here

0 1 2 3 4 5

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.