7
7
import es .upv .mist .slicing .graphs .cfg .CFG ;
8
8
import es .upv .mist .slicing .graphs .pdg .PDG ;
9
9
import es .upv .mist .slicing .graphs .sdg .SDG ;
10
- import org .jetbrains .annotations .NotNull ;
11
10
12
11
import java .util .*;
13
12
@@ -31,22 +30,22 @@ public class GraphNode<N extends Node> implements Comparable<GraphNode<?>> {
31
30
protected final List <Resolvable <? extends ResolvedMethodLikeDeclaration >> methodCalls = new LinkedList <>();
32
31
33
32
/** Create a graph node, with id and variable actions generated automatically. */
34
- public GraphNode (String label , @ NotNull N astNode ) {
33
+ public GraphNode (String label , N astNode ) {
35
34
this (IdHelper .getInstance ().getNextId (), label , astNode );
36
35
}
37
36
38
37
/** Create a graph node, with variable actions generated automatically. */
39
- protected GraphNode (long id , String label , @ NotNull N astNode ) {
38
+ protected GraphNode (long id , String label , N astNode ) {
40
39
this (id , label , astNode , new LinkedList <>());
41
40
extractVariables ();
42
41
}
43
42
44
43
/** Create a graph node, with id generated automatically. */
45
- public GraphNode (String label , @ NotNull N astNode , List <VariableAction > variableActions ) {
44
+ public GraphNode (String label , N astNode , List <VariableAction > variableActions ) {
46
45
this (IdHelper .getInstance ().getNextId (), label , astNode , variableActions );
47
46
}
48
47
49
- protected GraphNode (long id , String label , @ NotNull N astNode , List <VariableAction > variableActions ) {
48
+ protected GraphNode (long id , String label , N astNode , List <VariableAction > variableActions ) {
50
49
this .id = id ;
51
50
this .label = label ;
52
51
this .astNode = astNode ;
@@ -173,7 +172,7 @@ public int hashCode() {
173
172
}
174
173
175
174
@ Override
176
- public int compareTo (@ NotNull GraphNode <?> o ) {
175
+ public int compareTo (GraphNode <?> o ) {
177
176
return Long .compare (id , o .id );
178
177
}
179
178
}
0 commit comments