rwth.i2.ltlrv.afastate.base
Class CommutativeBinaryAFAState
java.lang.Object
rwth.i2.ltlrv.formula.base.AbstractFormula
rwth.i2.ltlrv.afastate.base.AbstractAFAState
rwth.i2.ltlrv.afastate.base.BinaryAFAState
rwth.i2.ltlrv.afastate.base.CommutativeBinaryAFAState
- All Implemented Interfaces:
- IAFAState, IBinaryAFAState, IBinaryTerm, IFormula
- Direct Known Subclasses:
- And, Or
public abstract class CommutativeBinaryAFAState
- extends BinaryAFAState
Represents a binary formula, which is commutative. This means, that
a formula phi(a,b) is always equal to phi(b,a). Also
their hashcodes match.
- Author:
- Eric Bodden
Method Summary |
boolean |
equals(Object oth)
Implements an equality check based on the assumption that this formula constructor
is commutative. |
int |
hashCode()
Calculates a hash code based on the assumption that this formula constructor
is commutative. |
Methods inherited from interface rwth.i2.ltlrv.formula.interfaze.IFormula |
symbol |
Methods inherited from interface rwth.i2.ltlrv.formula.interfaze.IFormula |
symbol |
CommutativeBinaryAFAState
public CommutativeBinaryAFAState(IFormula subformula1,
IFormula subformula2)
- Parameters:
subformula1
- subformula2
-
equals
public boolean equals(Object oth)
- Implements an equality check based on the assumption that this formula constructor
is commutative.
- Overrides:
equals
in class BinaryAFAState
- See Also:
Object.equals(java.lang.Object)
hashCode
public int hashCode()
- Calculates a hash code based on the assumption that this formula constructor
is commutative.
- Overrides:
hashCode
in class BinaryAFAState
- See Also:
Object.hashCode()