Examples of FastBitSet

javolution.util.FastBitSet

This class represents either a table of bits or a set of non-negative numbers.

This class is integrated with the collection framework (as a set of {@link Index indices} and obeys the collection semanticfor methods such as {@link #size} (cardinality) or {@link #equals}(same set of indices).
@author Jean-Marie Dautelle @version 5.3, February 24, 2008
net.timewalker.ffmq3.utils.FastBitSet

Simplistic version of the jdk {@link BitSet}
No bound-checking, internal capacity must be extended explicitely.
org.jmol.util.FastBitSet

Examples of javolution.util.FastBitSet

  transient int numEntriesHashTable;
  transient int countAfterReport;   // report or forward
  transient int heartbeatInterval;


  public static FastBitSet groupingSet2BitSet(int value) {
    FastBitSet bits = new FastBitSet();
    int index = 0;
    while (value != 0) {
      if (value % 2 != 0) {
        bits.set(index);
      }
      ++index;
      value = value >>> 1;
    }
    return bits;

View Full Code Here

Examples of javolution.util.FastBitSet

        for (int groupingSetPos = 0; groupingSetPos < groupingSets.size(); groupingSetPos++) {
          for (int keyPos = 0; keyPos < groupingSetsPosition; keyPos++) {
            newKeysArray[keyPos] = null;
          }


          FastBitSet bitset = groupingSetsBitSet.get(groupingSetPos);
          // Some keys need to be left to null corresponding to that grouping set.
          for (int keyPos = bitset.nextSetBit(0); keyPos >= 0;
            keyPos = bitset.nextSetBit(keyPos+1)) {
            newKeysArray[keyPos] = cloneNewKeysArray[keyPos];
          }


          newKeysArray[groupingSetsPosition] = newKeysGroupingSets.get(groupingSetPos);
          processKey(row, rowInspector);

View Full Code Here

Examples of javolution.util.FastBitSet

  transient int numEntriesHashTable;
  transient int countAfterReport;
  transient int heartbeatInterval;


  public static FastBitSet groupingSet2BitSet(int value) {
    FastBitSet bits = new FastBitSet();
    int index = 0;
    while (value != 0) {
      if (value % 2 != 0) {
        bits.set(index);
      }
      ++index;
      value = value >>> 1;
    }
    return bits;

View Full Code Here

Examples of javolution.util.FastBitSet

        for (int groupingSetPos = 0; groupingSetPos < groupingSets.size(); groupingSetPos++) {
          for (int keyPos = 0; keyPos < groupingSetsPosition; keyPos++) {
            newKeysArray[keyPos] = null;
          }


          FastBitSet bitset = groupingSetsBitSet.get(groupingSetPos);
          // Some keys need to be left to null corresponding to that grouping set.
          for (int keyPos = bitset.nextSetBit(0); keyPos >= 0;
            keyPos = bitset.nextSetBit(keyPos+1)) {
            newKeysArray[keyPos] = cloneNewKeysArray[keyPos];
          }


          newKeysArray[groupingSetsPosition] = newKeysGroupingSets.get(groupingSetPos);
          processKey(row, rowInspector);

View Full Code Here

Examples of javolution.util.FastBitSet

  protected transient int numEntriesHashTable;
  transient int countAfterReport;   // report or forward
  transient int heartbeatInterval;


  public static FastBitSet groupingSet2BitSet(int value) {
    FastBitSet bits = new FastBitSet();
    int index = 0;
    while (value != 0) {
      if (value % 2 != 0) {
        bits.set(index);
      }
      ++index;
      value = value >>> 1;
    }
    return bits;

View Full Code Here

Examples of javolution.util.FastBitSet

        for (int groupingSetPos = 0; groupingSetPos < groupingSets.size(); groupingSetPos++) {
          for (int keyPos = 0; keyPos < groupingSetsPosition; keyPos++) {
            newKeysArray[keyPos] = null;
          }


          FastBitSet bitset = groupingSetsBitSet.get(groupingSetPos);
          // Some keys need to be left to null corresponding to that grouping set.
          for (int keyPos = bitset.nextSetBit(0); keyPos >= 0;
            keyPos = bitset.nextSetBit(keyPos+1)) {
            newKeysArray[keyPos] = cloneNewKeysArray[keyPos];
          }


          newKeysArray[groupingSetsPosition] = newKeysGroupingSets.get(groupingSetPos);
          processKey(row, rowInspector);

View Full Code Here

Examples of javolution.util.FastBitSet

   */
  public NumDistinctValueEstimator(int numBitVectors) {
    this.numBitVectors = numBitVectors;
    bitVector = new FastBitSet[numBitVectors];
    for (int i=0; i< numBitVectors; i++) {
      bitVector[i] = new FastBitSet(bitVectorSize);
    }


    a = new int[numBitVectors];
    b = new int[numBitVectors];

View Full Code Here

Examples of javolution.util.FastBitSet

      }
    }
  }


  public NumDistinctValueEstimator(String s, int numBitVectors) {
    FastBitSet b[] = deserialize(s, numBitVectors);
    bitVector = new FastBitSet[numBitVectors];
    for(int i=0; i <numBitVectors; i++) {
       bitVector[i] = new FastBitSet(bitVectorSize);
       bitVector[i].clear();
       bitVector[i].or(b[i]);
    }
  }

View Full Code Here

Examples of javolution.util.FastBitSet

   */


  private FastBitSet[] deserialize(String s, int numBitVectors) {
    FastBitSet[] b = new FastBitSet[numBitVectors];
    for (int j=0; j < numBitVectors; j++) {
      b[j] = new FastBitSet(bitVectorSize);
      b[j].clear();
    }


    int vectorIndex =0;

View Full Code Here

Examples of javolution.util.FastBitSet

  protected transient int numEntriesHashTable;
  transient int countAfterReport;   // report or forward
  transient int heartbeatInterval;


  public static FastBitSet groupingSet2BitSet(int value) {
    FastBitSet bits = new FastBitSet();
    int index = 0;
    while (value != 0) {
      if (value % 2 != 0) {
        bits.set(index);
      }
      ++index;
      value = value >>> 1;
    }
    return bits;

View Full Code Here

0 1 2 3

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.