blob: 24ef689ee9abd387e08d9d68f14440978c8e0e3d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
package org.checkerframework.dataflow.cfg.node;
import com.sun.source.tree.ArrayAccessTree;
import com.sun.source.tree.Tree;
import java.util.Collection;
import java.util.LinkedList;
import org.checkerframework.dataflow.util.HashCodeUtils;
import org.checkerframework.javacutil.InternalUtils;
/**
* A node for an array access:
*
* <pre>
* <em>arrayref</em> [ <em>index</em> ]
* </pre>
*
* We allow array accesses without corresponding AST {@link Tree}s.
*
* @author Stefan Heule
* @author Charlie Garrett
*/
public class ArrayAccessNode extends Node {
protected Tree tree;
protected Node array;
protected Node index;
public ArrayAccessNode(Tree t, Node array, Node index) {
super(InternalUtils.typeOf(t));
assert t instanceof ArrayAccessTree;
this.tree = t;
this.array = array;
this.index = index;
}
public Node getArray() {
return array;
}
public Node getIndex() {
return index;
}
@Override
public Tree getTree() {
return tree;
}
@Override
public <R, P> R accept(NodeVisitor<R, P> visitor, P p) {
return visitor.visitArrayAccess(this, p);
}
@Override
public String toString() {
String base = getArray().toString() + "[" + getIndex().toString() + "]";
return base;
}
@Override
public boolean equals(Object obj) {
if (obj == null || !(obj instanceof ArrayAccessNode)) {
return false;
}
ArrayAccessNode other = (ArrayAccessNode) obj;
return getArray().equals(other.getArray()) && getIndex().equals(other.getIndex());
}
@Override
public int hashCode() {
return HashCodeUtils.hash(getArray(), getIndex());
}
@Override
public Collection<Node> getOperands() {
LinkedList<Node> list = new LinkedList<Node>();
list.add(getArray());
list.add(getIndex());
return list;
}
}
|
