Examples of IntBitSet

bak.pcj.set.IntBitSet

This class represents bit array based sets of int values. When a bit in the underlying array is set, the value having the same number as the bit is contained in the array. This implies that bit sets cannot contain negative values.

Implementation of IntSortedSet is supported from PCJ 1.2. Prior to 1.2, only IntSet was implemented.

Note: There is no growth policy involved with bit sets. The number of bits to use depends on the value of the largest element and not the size of the set. While sizes are predictable (they grow), a new maximum element is generally not predictable making it meaningless to grow the array at a specific rate. @author Søren Bak @version 1.3 21-08-2003 19:54 @since 1.0

com.bpodgursky.set_query_lib.IntBitSet

Compact representation of a sparse set of integers

kodkod.util.ints.IntBitSet

An implementation of the IntSet interface based on a bit map. An IntBitSet can store only numbers in the half-open range [0..capacity) where capacity is a user-specified value. The implementation will allocated enough bits to explicitly represent all allowed integers; it performs better than a tree set when the stored integers are not clustered. @specfield capacity: [0..Integer.MAX_VALUE] @invariant all i: this.ints | 0 <= i < capacity @author Emina Torlak

    }
    
    posVars.retainAll(negVars);
    
    assert !posVars.isEmpty();
    final IntSet ret = new IntBitSet(posVars.max()+1);
    ret.addAll(posVars);
    
    return ret;
  }

Examples of kodkod.util.ints.IntBitSet

   */
  static IntSet clausesFor(ResolutionTrace trace, IntSet relevantVars) { 
//    System.out.println("relevant: " + relevantVars);
    final IntSet axioms = trace.axioms();


    final IntSet reachableVars = new IntBitSet(relevantVars.max()+1);
    reachableVars.addAll(relevantVars);


    final IntSet relevantAxioms = new IntBitSet(axioms.size());
    
    final Iterator<Clause> itr = trace.reverseIterator(axioms);
    for(int i = axioms.max(); i >= 0; i--) {
      Clause clause = itr.next();
      int maxVar = clause.maxVariable();
      if (reachableVars.contains(maxVar)) {
        for(IntIterator lits = clause.literals(); lits.hasNext(); ) {
          reachableVars.add(StrictMath.abs(lits.next()));
        }
        relevantAxioms.add(i);
      } 
    }
    
    return  relevantAxioms;
  }

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.