@Override public int getNumberOfNodes() { if (nodeCount == -1) { nodeCount = IteratorUtil.count(iterator()); } return nodeCount; }
@Override public int getNumberOfNodes() { if (count == -1) { count = IteratorUtil.count(iterator()); } return count; }
@Override public int getNumberOfNodes() { if (count == -1) { count = IteratorUtil.count(iterator()); } return count; }
@Override public int getNumberOfNodes() { if (count == -1) { count = IteratorUtil.count(iterator()); } return count; }
@Override public int getNumberOfNodes() { if (nodeCount == -1) { nodeCount = IteratorUtil.count(iterator()); } return nodeCount; }
@Override public int getPredNodeCount(T n) { return IteratorUtil.count(getPredNodes(n)); }
@Override public int getNumberOfTargets(CGNode node, CallSiteReference site) { return IteratorUtil.count(getPossibleTargets(site)); }
@Override public int getSuccNodeCount(Statement N) { return IteratorUtil.count(getSuccNodes(N)); }
@Override public int getSuccNodeCount(T N) { return IteratorUtil.count(getSuccNodes(N)); }
@Override public int getSuccNodeCount(T N) { return IteratorUtil.count(getSuccNodes(N)); }
@Override public int getNumberOfTargets(CGNode node, CallSiteReference site) { return IteratorUtil.count(getPossibleTargets(site)); }
@Override public int getSuccNodeCount(CGNode N) { return IteratorUtil.count(getSuccNodes(N)); }
@Override public int getPredNodeCount(T n) { return IteratorUtil.count(getPredNodes(n)); }
@Override public int getPredNodeCount(T n) { return IteratorUtil.count(getPredNodes(n)); }
@Override public int getSuccNodeCount(CGNode N) { return IteratorUtil.count(getSuccNodes(N)); }
@Override public int getPredNodeCount(Statement N) { return IteratorUtil.count(getPredNodes(N)); }
@Override public int getNumberOfNodes() { if (nodeCount == -1) { nodeCount = IteratorUtil.count(iterator()); } return nodeCount; }
private int countImplicitEdges() { return IteratorUtil.count(new GlobalImplicitIterator()); }
@Override public int getPredNodeCount(MethodReference N) { return IteratorUtil.count(getPredNodes(N)); }
private static <T> void checkEdgeCounts(Graph<T> G) throws UnsoundGraphException { for (T N : G) { int count1 = G.getSuccNodeCount(N); int count2 = IteratorUtil.count(G.getSuccNodes(N)); if (count1 != count2) { throw new UnsoundGraphException("getSuccNodeCount " + count1 + " is wrong for node " + N); } int count3 = G.getPredNodeCount(N); int count4 = IteratorUtil.count(G.getPredNodes(N)); if (count3 != count4) { throw new UnsoundGraphException("getPredNodeCount " + count1 + " is wrong for node " + N); } } }