com.ibm.wala.util.graph.Graph.iterator()方法的使用及代码示例

x33g5p2x  于2022-01-20 转载在 其他  
字(4.1k)|赞(0)|评价(0)|浏览(104)

本文整理了Java中com.ibm.wala.util.graph.Graph.iterator()方法的一些代码示例,展示了Graph.iterator()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Graph.iterator()方法的具体详情如下:
包路径:com.ibm.wala.util.graph.Graph
类名称:Graph
方法名:iterator

Graph.iterator介绍

暂无

代码示例

代码示例来源:origin: wala/WALA

/**
 * @throws NullPointerException if G is null
 */
public SlowDFSFinishTimeIterator(Graph<T> G) throws NullPointerException {
 this(G, G == null ? null : G.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * Constructor DFSFinishTimeIterator.
 * 
 * @throws NullPointerException if G is null
 */
public BFSIterator(Graph<T> G) throws NullPointerException {
 this(G, G == null ? null : G.iterator());
}

代码示例来源:origin: wala/WALA

@Override
public Iterator<T> iterator() {
 return delegate.iterator();
}

代码示例来源:origin: com.ibm.wala/com.ibm.wala.util

/**
 * Constructor DFSFinishTimeIterator.
 * 
 * @throws NullPointerException if G is null
 */
public BFSIterator(Graph<T> G) throws NullPointerException {
 this(G, G == null ? null : G.iterator());
}

代码示例来源:origin: com.ibm.wala/com.ibm.wala.util

@Override
public Iterator<T> iterator() {
 return delegate.iterator();
}

代码示例来源:origin: wala/WALA

/**
 * Constructor DFSFinishTimeIterator.
 * 
 * @throws NullPointerException if G is null
 */
public BFSIterator(Graph<T> G) throws NullPointerException {
 this(G, G == null ? null : G.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * @throws NullPointerException if G is null
 */
public SlowDFSFinishTimeIterator(Graph<T> G) throws NullPointerException {
 this(G, G == null ? null : G.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * Construct an enumeration across the SCCs of a given graph.
 * 
 * @param G
 *          The graph over which to construct SCCs
 * @throws NullPointerException  if G is null
 */
public SCCIterator(Graph<T> G) throws NullPointerException {
 this(G, G == null ? null : G.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * Construct an enumeration across the SCCs of a given graph.
 * 
 * @param G
 *          The graph over which to construct SCCs
 * @throws NullPointerException  if G is null
 */
public SCCIterator(Graph<T> G) throws NullPointerException {
 this(G, G == null ? null : G.iterator());
}

代码示例来源:origin: wala/WALA

@Override
public Iterator<T> iterator() {
 return delegate.iterator();
}

代码示例来源:origin: wala/WALA

@Override
public Iterator<T> iterator() {
 return delegate.iterator();
}

代码示例来源:origin: com.ibm.wala/com.ibm.wala.util

/**
 * Compute the nodes to visualize
 */
private static <T> Collection<T> computeDotNodes(Graph<T> g) {
 return Iterator2Collection.toSet(g.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * Constructor SlowDFSDiscoverTimeIterator.
 * 
 * @throws NullPointerException if G is null
 */
public SlowDFSDiscoverTimeIterator(Graph<T> G) throws NullPointerException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 init(G, G.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * Compute the nodes to visualize
 */
private static <T> Collection<T> computeDotNodes(Graph<T> g) {
 return Iterator2Collection.toSet(g.iterator());
}

代码示例来源:origin: wala/WALA

@Override
public Iterator<T> iterator() {
 return new FilterIterator<>(g.iterator(), p);
}

代码示例来源:origin: wala/WALA

@Override
public Iterator<T> iterator() {
 return new FilterIterator<>(g.iterator(), p);
}

代码示例来源:origin: wala/WALA

/**
 * Constructor SlowDFSDiscoverTimeIterator.
 * 
 * @throws NullPointerException if G is null
 */
public SlowDFSDiscoverTimeIterator(Graph<T> G) throws NullPointerException {
 if (G == null) {
  throw new IllegalArgumentException("G is null");
 }
 init(G, G.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * Compute the nodes to visualize
 */
private static <T> Collection<T> computeDotNodes(Graph<T> g) {
 return Iterator2Collection.toSet(g.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * Compute the nodes to visualize
 */
private static <T> Collection<T> computeDotNodes(Graph<T> g) {
 return Iterator2Collection.toSet(g.iterator());
}

代码示例来源:origin: wala/WALA

/**
 * @param g call graph to analyze
 * @param filter "interesting" node definition
 * @throws IllegalArgumentException if g is null
 */
public GraphReachability(Graph<T> g, Predicate<? super T> filter) {
 if (g == null) {
  throw new IllegalArgumentException("g is null");
 }
 this.g = g;
 Iterator<T> i = new FilterIterator<>(g.iterator(), filter);
 domain = new MutableMapping<>((Iterator2Collection.toSet(i)).toArray());
}

相关文章