@Override public IntSet getPredNodeNumbers(CGNode node) { ExplicitNode n = (ExplicitNode) node; int y = getNumber(n); return predecessors.getRelated(y); }
@Override public IntSet getPredNodeNumbers(CGNode node) { ExplicitNode n = (ExplicitNode) node; int y = getNumber(n); return predecessors.getRelated(y); }
/** * @return set of d2 s.t. d1 -> d2 is a path edge for node n */ private IntSet getReachableFast(int n, int d1) { IBinaryNaturalRelation R = altPaths.get(d1); if (R != null) { return R.getRelated(n); } return null; }
@Override public IntSet getSuccNodeNumbers(T node) throws IllegalArgumentException { if (nodeManager.getNumber(node) < 0) { throw new IllegalArgumentException("Node not in graph " + node); } return successors.getRelated(nodeManager.getNumber(node)); }
@Override public IntSet getPredNodeNumbers(T node) throws IllegalArgumentException { if (nodeManager.getNumber(node) < 0) { throw new IllegalArgumentException("Node not in graph " + node); } return predecessors.getRelated(nodeManager.getNumber(node)); }
@Override public IntSet getSuccNodeNumbers(T node) throws IllegalArgumentException { if (nodeManager.getNumber(node) < 0) { throw new IllegalArgumentException("Node not in graph " + node); } return successors.getRelated(nodeManager.getNumber(node)); }
@Override public IntSet getPredNodeNumbers(T node) throws IllegalArgumentException { if (nodeManager.getNumber(node) < 0) { throw new IllegalArgumentException("Node not in graph " + node); } return predecessors.getRelated(nodeManager.getNumber(node)); }
@Override public IntSet getSuccNodeNumbers(T node) throws IllegalArgumentException { if (nodeManager.getNumber(node) < 0) { throw new IllegalArgumentException("Node not in graph " + node); } return successors.getRelated(nodeManager.getNumber(node)); }
@Override public IntSet getPredNodeNumbers(T node) throws IllegalArgumentException { if (nodeManager.getNumber(node) < 0) { throw new IllegalArgumentException("Node not in graph " + node); } return predecessors.getRelated(nodeManager.getNumber(node)); }
public Iterator<T> getSuccNodes(int number) { IntSet s = successors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
public Iterator<T> getSuccNodes(int number) { IntSet s = successors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
public Iterator<T> getSuccNodes(int number) { IntSet s = successors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
@Override public Iterator<T> getPredNodes(T N) throws IllegalArgumentException { int number = nodeManager.getNumber(N); if (number < 0) { throw new IllegalArgumentException(N + " is not in graph"); } IntSet s = predecessors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
@Override public Iterator<T> getSuccNodes(T N) throws IllegalArgumentException { int number = nodeManager.getNumber(N); if (number == -1) { throw new IllegalArgumentException(N + " is not in graph"); } IntSet s = successors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
@Override public Iterator<T> getPredNodes(T N) throws IllegalArgumentException { int number = nodeManager.getNumber(N); if (number < 0) { throw new IllegalArgumentException(N + " is not in graph"); } IntSet s = predecessors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
@Override public Iterator<T> getSuccNodes(T N) throws IllegalArgumentException { int number = nodeManager.getNumber(N); if (number == -1) { throw new IllegalArgumentException(N + " is not in graph"); } IntSet s = successors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
@Override public Iterator<T> getPredNodes(T N) throws IllegalArgumentException { int number = nodeManager.getNumber(N); if (number < 0) { throw new IllegalArgumentException(N + " is not in graph"); } IntSet s = predecessors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
@Override public Iterator<T> getSuccNodes(T N) throws IllegalArgumentException { int number = nodeManager.getNumber(N); if (number == -1) { throw new IllegalArgumentException(N + " is not in graph"); } IntSet s = successors.getRelated(number); Iterator<T> empty = EmptyIterator.instance(); return (s == null) ? empty : nodeManager.iterateNodes(s); }
private static IntSet getDomain(IBinaryNaturalRelation r) { MutableIntSet result = MutableSparseIntSet.makeEmpty(); int maxKeyValue = r.maxKeyValue(); for (int i = 0; i <= maxKeyValue; i++) { if (r.getRelated(i) != null) { result.add(i); } } return result; }
private static IntSet getDomain(IBinaryNaturalRelation r) { MutableIntSet result = MutableSparseIntSet.makeEmpty(); int maxKeyValue = r.maxKeyValue(); for (int i = 0; i <= maxKeyValue; i++) { if (r.getRelated(i) != null) { result.add(i); } } return result; }