blob: 0dfb65ec41c8f16c02c7e2f99ad90b5fda8e0dbf (
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
|
package org.checkerframework.dataflow.cfg.node;
import com.sun.source.tree.BinaryTree;
import com.sun.source.tree.Tree.Kind;
import org.checkerframework.dataflow.util.HashCodeUtils;
/**
* A node for the less than or equal comparison:
*
* <pre>
* <em>expression</em> <= <em>expression</em>
* </pre>
*
* @author Stefan Heule
* @author Charlie Garrett
*/
public class LessThanOrEqualNode extends BinaryOperationNode {
public LessThanOrEqualNode(BinaryTree tree, Node left, Node right) {
super(tree, left, right);
assert tree.getKind() == Kind.LESS_THAN_EQUAL;
}
@Override
public <R, P> R accept(NodeVisitor<R, P> visitor, P p) {
return visitor.visitLessThanOrEqual(this, p);
}
@Override
public String toString() {
return "(" + getLeftOperand() + " <= " + getRightOperand() + ")";
}
@Override
public boolean equals(Object obj) {
if (obj == null || !(obj instanceof LessThanOrEqualNode)) {
return false;
}
LessThanOrEqualNode other = (LessThanOrEqualNode) obj;
return getLeftOperand().equals(other.getLeftOperand())
&& getRightOperand().equals(other.getRightOperand());
}
@Override
public int hashCode() {
return HashCodeUtils.hash(getLeftOperand(), getRightOperand());
}
}
|