17
17
package boa .graphs .cfg ;
18
18
19
19
import java .util .HashMap ;
20
+ import java .util .Set ;
20
21
import java .util .LinkedHashSet ;
21
22
22
23
import boa .types .Ast .Expression ;
@@ -41,7 +42,7 @@ public class CFGNode implements Comparable<CFGNode> {
41
42
private int objectNameId ;
42
43
private int classNameId ;
43
44
private int numOfParameters = 0 ;
44
- private LinkedHashSet <Integer > parameters ;
45
+ private Set <Integer > parameters ;
45
46
private int kind = TYPE_OTHER ;
46
47
private String pid ;
47
48
private Statement stmt ;
@@ -52,8 +53,8 @@ public class CFGNode implements Comparable<CFGNode> {
52
53
public static HashMap <String , Integer > idOfLabel = new HashMap <String , Integer >();
53
54
public static HashMap <Integer , String > labelOfID = new HashMap <Integer , String >();
54
55
55
- public LinkedHashSet <CFGEdge > inEdges = new LinkedHashSet <CFGEdge >();
56
- public LinkedHashSet <CFGEdge > outEdges = new LinkedHashSet <CFGEdge >();
56
+ public Set <CFGEdge > inEdges = new LinkedHashSet <CFGEdge >();
57
+ public Set <CFGEdge > outEdges = new LinkedHashSet <CFGEdge >();
57
58
58
59
public java .util .ArrayList <CFGNode > predecessors = new java .util .ArrayList <CFGNode >();
59
60
public java .util .ArrayList <CFGNode > successors = new java .util .ArrayList <CFGNode >();
@@ -84,7 +85,7 @@ public CFGNode(String methodName, int kind, String className,
84
85
}
85
86
86
87
public CFGNode (String methodName , int kind , String className ,
87
- String objectName , int numOfParameters , LinkedHashSet <Integer > datas ) {
88
+ String objectName , int numOfParameters , Set <Integer > datas ) {
88
89
this .id = ++numOfNodes ;
89
90
this .methodId = convertLabel (methodName );
90
91
this .kind = kind ;
@@ -114,8 +115,8 @@ public Statement getStmt() {
114
115
return this .stmt ;
115
116
}
116
117
117
- public LinkedHashSet <String > getDefUse () {
118
- LinkedHashSet <String > defUse = new LinkedHashSet <String >(useVariables );
118
+ public Set <String > getDefUse () {
119
+ Set <String > defUse = new LinkedHashSet <String >(useVariables );
119
120
defUse .add (defVariables );
120
121
return defUse ;
121
122
}
@@ -182,11 +183,11 @@ public int getNumOfParameters() {
182
183
return numOfParameters ;
183
184
}
184
185
185
- public void setParameters (LinkedHashSet <Integer > parameters ) {
186
+ public void setParameters (Set <Integer > parameters ) {
186
187
this .parameters = parameters ;
187
188
}
188
189
189
- public LinkedHashSet <Integer > getParameters () {
190
+ public Set <Integer > getParameters () {
190
191
return parameters ;
191
192
}
192
193
@@ -230,11 +231,11 @@ public boolean hasFalseBranch() {
230
231
return false ;
231
232
}
232
233
233
- public LinkedHashSet <CFGEdge > getInEdges () {
234
+ public Set <CFGEdge > getInEdges () {
234
235
return inEdges ;
235
236
}
236
237
237
- public LinkedHashSet <CFGEdge > getOutEdges () {
238
+ public Set <CFGEdge > getOutEdges () {
238
239
return outEdges ;
239
240
}
240
241
@@ -255,7 +256,7 @@ public void setSuccessors(java.util.ArrayList<CFGNode> successors) {
255
256
}
256
257
257
258
public java .util .ArrayList <CFGNode > getInNodes () {
258
- LinkedHashSet <CFGNode > nodes = new LinkedHashSet <CFGNode >();
259
+ Set <CFGNode > nodes = new LinkedHashSet <CFGNode >();
259
260
for (CFGEdge e : inEdges )
260
261
nodes .add (e .getSrc ());
261
262
java .util .ArrayList <CFGNode > pred = new java .util .ArrayList <CFGNode >(nodes );
@@ -264,7 +265,7 @@ public java.util.ArrayList<CFGNode> getInNodes() {
264
265
}
265
266
266
267
public java .util .ArrayList <CFGNode > getOutNodes () {
267
- LinkedHashSet <CFGNode > nodes = new LinkedHashSet <CFGNode >();
268
+ Set <CFGNode > nodes = new LinkedHashSet <CFGNode >();
268
269
for (CFGEdge e : outEdges )
269
270
nodes .add (e .getDest ());
270
271
java .util .ArrayList <CFGNode > succ = new java .util .ArrayList <CFGNode >(nodes );
0 commit comments