public boolean hasAncestorOrSelf(TypeNode typeNode) { if (typeNode == this) { return true; } return ancestors.get(typeNode.id); }
public boolean hasDescendantOrSelf(TypeNode typeNode) { if (typeNode == this) { return true; } return descendants.get(typeNode.id); }
public boolean hasAncestor(TypeNode typeNode) { return ancestors.get(typeNode.id); }
public boolean hasDescendant(TypeNode typeNode) { return descendants.get(typeNode.id); }
public boolean get(int bit) { return value.get(bit); }
/** Returns true iff the set contains n. */ public final boolean contains(Node n) { return bits.get(n.getNumber()); }
private boolean excluded(ListNode exclude, ListNode other, BitVector mask) { return (exclude != null && other.elem == exclude.elem) || (mask != null && (!(mask.get(other.elem.getNumber())))); }
/** Returns true iff the set contains n. */ public final boolean contains(Node n) { if (bits == null) { for (Node node : nodes) { if (node == n) { return true; } if (node == null) { break; } } return false; } else { return bits.get(n.getNumber()); } }
/** Adds the given node to the list of descendants of this node and its ancestors. **/ private void fixDescendants(int id) { if (descendants.get(id)) { return; } for (Iterator<TypeNode> parentIt = parents.iterator(); parentIt.hasNext();) { final TypeNode parent = parentIt.next(); parent.fixDescendants(id); } descendants.set(id); }
public boolean contains(Numberable o) { if (array != null) { return array[findPosition(o)] != null; } else { int number = o.getNumber(); if (number == 0) { throw new RuntimeException("unnumbered"); } return bits.get(number); } }
public boolean set(int bit) { expand(bit); boolean ret = !get(bit); bits[indexOf(bit)] |= mask(bit); return ret; }
public void removeIndirectRelations() { if (rep != this) { ecr().removeIndirectRelations(); return; } if (indirectAncestors == null) { fixAncestors(); } List<TypeVariable> parentsToRemove = new LinkedList<TypeVariable>(); for (TypeVariable parent : parents) { if (indirectAncestors.get(parent.id())) { parentsToRemove.add(parent); } } for (TypeVariable parent : parentsToRemove) { removeParent(parent); } }
newa[newi++] = mya[myi++]; } else if (myhc > ohc) { if ((type == null || typeMask == null || typeMask.get(ohc)) && (exclude == null || !exclude.contains(oa[oi]))) { newa[newi++] = oa[oi]; if (oi < osize) { int ohc = oa[oi].getNumber(); if ((type == null || typeMask == null || typeMask.get(ohc)) && (exclude == null || !exclude.contains(oa[oi]))) { newa[newi++] = oa[oi]; ret = true;
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())); } }
TypeVariableBV var = typeVariableForId(i.next()); if (single_child_not_null.get(var.id())) { TypeVariableBV var = typeVariableForId(i.next()); if (single_soft_parent.get(var.id())) { TypeVariableBV var = typeVariableForId(i.next()); if (single_hard_parent.get(var.id())) { TypeVariableBV var = typeVariableForId(i.next()); if (single_null_child.get(var.id())) {
makeMaskOfInterface(sc); if (!visitedTypes.get(t.getNumber()) && !rt.getSootClass().isPhantom()) { makeClassTypeMask(rt.getSootClass());
if (mask == null || mask.get(nodeToMaybeAdd.getNumber())) { add(nodeToMaybeAdd);
public boolean hasAncestorOrSelf(TypeNode typeNode) { if(typeNode == this) return true; return ancestors.get(typeNode.id); }
public boolean hasDescendantOrSelf(TypeNode typeNode) { if(typeNode == this) return true; return descendants.get(typeNode.id); }
public boolean hasDescendantOrSelf(TypeNode typeNode) { if(typeNode == this) return true; return descendants.get(typeNode.id); }