private boolean isSubsetInternal(BitVectorIntSet set) { for (int i = 0; i < size; i++) { if (!set.contains(elements[i])) { return false; } } return true; }
private boolean isSubsetInternal(BitVectorIntSet set) { for (int i = 0; i < size; i++) { if (!set.contains(elements[i])) { return false; } } return true; }
private boolean isSubsetInternal(BitVectorIntSet set) { for (int i = 0; i < size; i++) { if (!set.contains(elements[i])) { return false; } } return true; }
public void removeAll(BitVectorIntSet v) { if (v == null) { throw new IllegalArgumentException("null v"); } int ai = 0; for (int i = 0; i < size; i++) { if (!v.contains(elements[i])) { elements[ai++] = elements[i]; } } size = ai; }
public void removeAll(BitVectorIntSet v) { if (v == null) { throw new IllegalArgumentException("null v"); } int ai = 0; for (int i = 0; i < size; i++) { if (!v.contains(elements[i])) { elements[ai++] = elements[i]; } } size = ai; }
public void removeAll(BitVectorIntSet v) { if (v == null) { throw new IllegalArgumentException("null v"); } int ai = 0; for (int i = 0; i < size; i++) { if (!v.contains(elements[i])) { elements[ai++] = elements[i]; } } size = ai; }
@Override public boolean contains(int i) { if (privatePart != null && privatePart.contains(i)) { return true; } if (sharedPart != null && sharedPart.contains(i)) { return true; } return false; }
@Override public boolean contains(int i) { if (privatePart != null && privatePart.contains(i)) { return true; } if (sharedPart != null && sharedPart.contains(i)) { return true; } return false; }
@Override public boolean remove(int i) { if (contains(i)) { populationCount--; populationCount = (populationCount == UNDEFINED - 1) ? UNDEFINED : populationCount; bitVector.clear(i); return true; } else { return false; } }
@Override public boolean remove(int i) { if (contains(i)) { populationCount--; populationCount = (populationCount == UNDEFINED - 1) ? UNDEFINED : populationCount; bitVector.clear(i); return true; } else { return false; } }
@Override public boolean remove(int i) { if (contains(i)) { populationCount--; populationCount = (populationCount == UNDEFINED - 1) ? UNDEFINED : populationCount; bitVector.clear(i); return true; } else { return false; } }
@Override public boolean contains(int i) { if (privatePart != null && privatePart.contains(i)) { return true; } if (sharedPart != null && sharedPart.contains(i)) { return true; } return false; }
@Override public boolean hasSubgraphForNode(CGNode node) { return cgNodesVisited.contains(cg.getNumber(node)); }
@Override public boolean hasSubgraphForNode(CGNode node) { return cgNodesVisited.contains(cg.getNumber(node)); }
private void slowForeachExcluding(IntSet X, IntSetAction action) { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0, count = 0; count < populationCount; i++) { if (contains(i)) { if (!X.contains(i)) { action.act(i); } count++; } } }
private void slowForeachExcluding(IntSet X, IntSetAction action) { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0, count = 0; count < populationCount; i++) { if (contains(i)) { if (!X.contains(i)) { action.act(i); } count++; } } }
private void slowForeachExcluding(IntSet X, IntSetAction action) { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0, count = 0; count < populationCount; i++) { if (contains(i)) { if (!X.contains(i)) { action.act(i); } count++; } } }
public void addSubgraphForNode(CGNode node) { int n = cg.getNumber(node); if (!cgNodesVisited.contains(n)) { cgNodesVisited.add(n); unconditionallyAddConstraintsFromNode(node); addNodesForParameters(node); } }
public void addSubgraphForNode(CGNode node) { int n = cg.getNumber(node); if (!cgNodesVisited.contains(n)) { cgNodesVisited.add(n); unconditionallyAddConstraintsFromNode(node); addNodesForParameters(node); } }
@Override public void addSubgraphForNode(CGNode node) throws IllegalArgumentException { if (node == null) { throw new IllegalArgumentException("node == null"); } IR ir = node.getIR(); if (ir == null) { throw new IllegalArgumentException("no ir for node " + node); } int n = cg.getNumber(node); if (!cgNodesVisited.contains(n)) { cgNodesVisited.add(n); unconditionallyAddConstraintsFromNode(node, ir); addNodesForInvocations(node, ir); addNodesForParameters(node, ir); } }