DASCA
/
WALA
2
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

tweak comments 

git-svn-id: https://wala.svn.sourceforge.net/svnroot/wala/trunk@3427 f5eafffb-2e1d-0410-98e4-8ec43c5233c4
This commit is contained in:
sjfink 2009-04-09 20:01:41 +00:00
parent 12e82138b7
commit 2cf3601efe
6 changed files with 3 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
com.ibm.wala.core/src/com/ibm/wala/util/graph/impl/DelegatingNumberedEdgeManager.java
View File

@ -22,8 +22,7 @@ import com.ibm.wala.util.intset.IntSet;
import com.ibm.wala.util.intset.SparseIntSet;
/**
* An object that delegates edge management to the nodes, INodeWithNumberedEdges
*
* An object that delegates edge management to the nodes, {@link INodeWithNumberedEdges}
*/
public class DelegatingNumberedEdgeManager<T extends INodeWithNumberedEdges> implements NumberedEdgeManager<T> {

6
com.ibm.wala.core/src/com/ibm/wala/util/graph/impl/InvertedGraph.java
View File

@ -14,10 +14,9 @@ import com.ibm.wala.util.graph.AbstractGraph;
import com.ibm.wala.util.graph.EdgeManager;
import com.ibm.wala.util.graph.Graph;
import com.ibm.wala.util.graph.NodeManager;
/**
* A graph view that reverses the edges in a graph
*
* @author Julian Dolby
*/
public class InvertedGraph<T> extends AbstractGraph<T> {
@ -38,7 +37,6 @@ public class InvertedGraph<T> extends AbstractGraph<T> {
public InvertedGraph(Graph<T> G) {
nodes = G;
edges = new InvertingEdgeManager<T>(G);
}
}
}

2
com.ibm.wala.core/src/com/ibm/wala/util/graph/impl/InvertedNumberedGraph.java
View File

@ -19,8 +19,6 @@ import com.ibm.wala.util.graph.NumberedNodeManager;
/**
* A graph view that reverses the edges in a graph
*
* @author Julian Dolby
*/
public class InvertedNumberedGraph<T> extends AbstractNumberedGraph<T> {

2
com.ibm.wala.core/src/com/ibm/wala/util/graph/impl/NumberedNodeIterator.java
View File

@ -19,8 +19,6 @@ import com.ibm.wala.util.intset.IntIterator;
import com.ibm.wala.util.intset.IntSet;
/**
* @author sfink
*
*/
public class NumberedNodeIterator<T> implements Iterator<T> {
final IntIterator numbers;

3
com.ibm.wala.core/src/com/ibm/wala/util/graph/impl/SlowSparseNumberedGraph.java
View File

@ -19,10 +19,7 @@ import com.ibm.wala.util.graph.NodeManager;
import com.ibm.wala.util.intset.BasicNaturalRelation;
/**
*
* A graph of numbered nodes, expected to have a fairly sparse edge structure.
*
* @author sfink
*/
public class SlowSparseNumberedGraph<T> extends AbstractNumberedGraph<T> {

2
com.ibm.wala.core/src/com/ibm/wala/util/graph/impl/SparseNumberedEdgeManager.java
View File

@ -24,8 +24,6 @@ import com.ibm.wala.util.intset.IntSetAction;
/**
* An object which tracks edges for nodes that have numbers.
*
* @author sfink
*/
public final class SparseNumberedEdgeManager<T> implements NumberedEdgeManager<T> {