public class PropagationCallGraphBuilder.FilterOperator extends com.ibm.wala.fixpoint.UnaryOperator<PointsToSetVariable> implements IPointerOperator
LHS U= (RHS n k)
Unary op: <lhs>:= Cast_k( <rhs>)
(Again, technically a binary op -- see note for Assign)
TODO: these need to be canonicalized.
| Modifier | Constructor and Description |
|---|---|
protected |
FilterOperator() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(java.lang.Object obj) |
byte |
evaluate(PointsToSetVariable lhs,
PointsToSetVariable rhs) |
int |
hashCode() |
boolean |
isComplex()
Is the operator complex; i.e., might it give rise to new constraints?
|
java.lang.String |
toString() |
public byte evaluate(PointsToSetVariable lhs, PointsToSetVariable rhs)
evaluate in class com.ibm.wala.fixpoint.UnaryOperator<PointsToSetVariable>public boolean isComplex()
IPointerOperatorisComplex in interface IPointerOperatorpublic java.lang.String toString()
toString in class com.ibm.wala.fixpoint.AbstractOperator<PointsToSetVariable>public boolean equals(java.lang.Object obj)
equals in class com.ibm.wala.fixpoint.AbstractOperator<PointsToSetVariable>public int hashCode()
hashCode in class com.ibm.wala.fixpoint.AbstractOperator<PointsToSetVariable>