public String toString() { StringBuffer ret = new StringBuffer(); ret.append('{'); boolean start = true; BitSetIterator it = new BitSetIterator(bits); while (it.hasNext()) { int bit = it.next(); if (!start) { ret.append(", "); } start = false; ret.append(bit); } ret.append('}'); return ret.toString(); }
public BitSetIterator iterator() { return new BitSetIterator(bits); } }
public final Object next() { return universe.get( iter.next() ); }
public final boolean hasNext() { return iter.hasNext(); } public void remove() {
private void dfsg_visit(TypeVariableBV var) { BitVector parents = var.parents(); for (BitSetIterator i = parents.iterator(); i.hasNext();) { TypeVariableBV parent = resolver.typeVariableForId(i.next()); if (!black.contains(parent)) { black.add(parent); dfsg_visit(parent); } } finished.add(0, var); }
public BitSetIterator iterator() { return new BitSetIterator(bits); } }
public final Object next() { return universe.get( iter.next() ); }
public final boolean hasNext() { return iter.hasNext(); } public void remove() {
private void dfsgt_visit(TypeVariableBV var) { current_tree.add(var); BitVector children = var.children(); for (BitSetIterator i = children.iterator(); i.hasNext();) { TypeVariableBV child = resolver.typeVariableForId(i.next()); if (!black.contains(child)) { black.add(child); dfsgt_visit(child); } } } }
public String toString() { StringBuffer ret = new StringBuffer(); ret.append('{'); boolean start = true; BitSetIterator it = new BitSetIterator( bits ); while( it.hasNext() ) { int bit = it.next(); if( !start ) ret.append( ", " ); start = false; ret.append(bit); } ret.append('}'); return ret.toString(); } /*
public BitSetIterator iterator() { return new BitSetIterator(bits); } }
public OverflowList(PointsToBitVector bv) { BitSetIterator it = bv.iterator(); // Iterates over only the 1 bits while (it.hasNext()) { // Get the next node in the bitset by looking it up in the // pointer assignment graph. // Ripped from BitPointsToSet. Node n = (Node) (pag.getAllocNodeNumberer().get(it.next())); add(n); } }
public String toString() { StringBuffer ret = new StringBuffer(); ret.append('{'); boolean start = true; BitSetIterator it = new BitSetIterator( bits ); while( it.hasNext() ) { int bit = it.next(); if( !start ) ret.append( ", " ); start = false; ret.append(bit); } ret.append('}'); return ret.toString(); } /*
public void removeIndirectRelations() { if (rep != this) { ecr().removeIndirectRelations(); return; } if (indirectAncestors == null) { fixAncestors(); } BitVector parentsToRemove = new BitVector(); for (BitSetIterator parentIt = parents.iterator(); parentIt.hasNext();) { final int parent = parentIt.next(); if (indirectAncestors.get(parent)) { parentsToRemove.set(parent); } } for (BitSetIterator i = parentsToRemove.iterator(); i.hasNext();) { removeParent(resolver.typeVariableForId(i.next())); } }
private void remove_transitive_constraints() throws TypeException { refresh_solved(); BitVector list = new BitVector(); list.or(solved); list.or(unsolved); for (BitSetIterator varIt = list.iterator(); varIt.hasNext();) { final TypeVariableBV var = typeVariableForId(varIt.next()); var.removeIndirectRelations(); } }
public boolean forall(P2SetVisitor v) { // Iterate through the bit vector. Ripped from BitPointsToSet again. // It seems there should be a way to share code between BitPointsToSet // and // SharedHybridSet, but I don't know how at the moment. if (bitVector != null) { for (BitSetIterator it = bitVector.iterator(); it.hasNext();) { v.visit((Node) pag.getAllocNodeNumberer().get(it.next())); } } // Iterate through the overflow list for (OverflowList.ListNode i = overflow.overflow; i != null; i = i.next) { v.visit(i.elem); } return v.getReturnValue(); }