Examples of java.util.BitSet.clear()

java.util.BitSet.clear()
Sets the bit specified by the index to false. @param bitIndex the index of the bit to be cleared. @exception IndexOutOfBoundsException if the specified index is negative. @since JDK1.0

    if (atomTypes == null)
      atomTypes = getAtomTypes();
    if (atomTypes == null)
      return false;
    int nElements = atomTypes.size();
    bsElements.clear(0);
    for (int i = 0; i < nElements; i++) {
      String[] data = ((String[]) atomTypes.get(i));
      String smarts = data[0];
      if (smarts == null)
        continue;

View Full Code Here

            continue;
          for (int k = j + 1; k < ptCenter; k++) {
            if (points[i].distance(points[k]) > distMax
                || points[j].distance(points[k]) > distMax)
              continue;
            bs.clear(i);
            bs.clear(j);
            bs.clear(k);
          }
        }
      isOK = true;

View Full Code Here

          for (int k = j + 1; k < ptCenter; k++) {
            if (points[i].distance(points[k]) > distMax
                || points[j].distance(points[k]) > distMax)
              continue;
            bs.clear(i);
            bs.clear(j);
            bs.clear(k);
          }
        }
      isOK = true;
      for (int i = 0; i < ptCenter; i++)

View Full Code Here

            if (points[i].distance(points[k]) > distMax
                || points[j].distance(points[k]) > distMax)
              continue;
            bs.clear(i);
            bs.clear(j);
            bs.clear(k);
          }
        }
      isOK = true;
      for (int i = 0; i < ptCenter; i++)
        if (bs.get(i)) {

View Full Code Here


    switch (tokenIn.tok) {
    case bitset:
      if (isInputSelected) {
        if (i1 > 1)
          bs.clear();
        break;
      }
      int n = 0;
      for (int j = bs.nextSetBit(0); j >= 0; j = bs.nextSetBit(j + 1))
        if (++n < i1 || n > i2)

View Full Code Here

        break;
      }
      int n = 0;
      for (int j = bs.nextSetBit(0); j >= 0; j = bs.nextSetBit(j + 1))
        if (++n < i1 || n > i2)
          bs.clear(j);
      break;
    case string:
      if (i1 < 1 || i1 > len)
        tokenOut.value = "";
      else

View Full Code Here

    private BitSet initMask(final BitSet set) {
        BitSet result = set;
        if (set == null) {
            result = new BitSet();
        } else  {
            result.clear();
        }
        return result;
    }


    public void setPlaceholder(final String placeholder) {

View Full Code Here

                if ( oldBytes.length > 1 ) {
                    int clearIdx = oldBytes[0];
                    if( clearIdx < 0 ) {
                        clearIdx += 256;
                    }
                    bitSet.clear(clearIdx);
                }
            } 
        }
        return bitSet;
    }

View Full Code Here


          idx = rand.nextInt(sz);
          a.set(idx);
          b.fastSet(idx);
          idx = rand.nextInt(sz);
          a.clear(idx);
          b.fastClear(idx);
          idx = rand.nextInt(sz);
          a.flip(idx);
          b.fastFlip(idx);

View Full Code Here


      doIterate(aa,bb);   // a problem here is from flip or doIterate


      fromIndex = rand.nextInt(sz+80);
      toIndex = fromIndex + rand.nextInt((sz>>1)+1);
      aa = (BitSet)a.clone(); aa.clear(fromIndex,toIndex);
      bb = (OpenBitSet)b.clone(); bb.clear(fromIndex,toIndex);


      doNextSetBit(aa,bb);  // a problem here is from clear() or nextSetBit


      fromIndex = rand.nextInt(sz+80);

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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.