
org.checkerframework.dataflow.cfg.node.IntegerDivisionNode Maven / Gradle / Ivy
package org.checkerframework.dataflow.cfg.node;
import com.sun.source.tree.BinaryTree;
import com.sun.source.tree.Tree;
import org.checkerframework.checker.nullness.qual.Nullable;
import java.util.Objects;
/**
* A node for the integer division:
*
*
* expression / expression
*
*/
public class IntegerDivisionNode extends BinaryOperationNode {
/**
* Constructs an {@link IntegerDivisionNode}.
*
* @param tree the binary tree
* @param left the left operand
* @param right the right operand
*/
public IntegerDivisionNode(BinaryTree tree, Node left, Node right) {
super(tree, left, right);
assert tree.getKind() == Tree.Kind.DIVIDE;
}
@Override
public R accept(NodeVisitor visitor, P p) {
return visitor.visitIntegerDivision(this, p);
}
@Override
public String toString() {
return "(" + getLeftOperand() + " / " + getRightOperand() + ")";
}
@Override
public boolean equals(@Nullable Object obj) {
if (!(obj instanceof IntegerDivisionNode)) {
return false;
}
IntegerDivisionNode other = (IntegerDivisionNode) obj;
return getLeftOperand().equals(other.getLeftOperand())
&& getRightOperand().equals(other.getRightOperand());
}
@Override
public int hashCode() {
return Objects.hash(getLeftOperand(), getRightOperand());
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy