blob: 379bb9202423a7ec45974a0ec0f59ee45b3cda13 (
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
|
package org.checkerframework.dataflow.cfg.node;
import com.sun.source.tree.PrimitiveTypeTree;
import com.sun.source.tree.Tree;
import java.util.Collection;
import java.util.Collections;
import org.checkerframework.dataflow.util.HashCodeUtils;
import org.checkerframework.javacutil.InternalUtils;
/**
* A node representing a primitive type used in an expression such as a field access
*
* <p><em>type</em> .class
*
* @author Stefan Heule
* @author Charlie Garrett
*/
public class PrimitiveTypeNode extends Node {
protected final PrimitiveTypeTree tree;
public PrimitiveTypeNode(PrimitiveTypeTree tree) {
super(InternalUtils.typeOf(tree));
this.tree = tree;
}
@Override
public Tree getTree() {
return tree;
}
@Override
public <R, P> R accept(NodeVisitor<R, P> visitor, P p) {
return visitor.visitPrimitiveType(this, p);
}
@Override
public String toString() {
return tree.toString();
}
@Override
public boolean equals(Object obj) {
if (obj == null || !(obj instanceof PrimitiveTypeNode)) {
return false;
}
PrimitiveTypeNode other = (PrimitiveTypeNode) obj;
return getType().equals(other.getType());
}
@Override
public int hashCode() {
return HashCodeUtils.hash(getType());
}
@Override
public Collection<Node> getOperands() {
return Collections.emptyList();
}
}
|