Class TypeCompatibleWithType
java.lang.Object
com.github.javaparser.symbolsolver.resolution.typeinference.ConstraintFormula
com.github.javaparser.symbolsolver.resolution.typeinference.constraintformulas.TypeCompatibleWithType
A type S is compatible in a loose invocation context with type T
- Author:
- Federico Tomassetti
-
Nested Class Summary
Nested classes/interfaces inherited from class com.github.javaparser.symbolsolver.resolution.typeinference.ConstraintFormula
ConstraintFormula.ReductionResult
-
Constructor Summary
ConstructorDescriptionTypeCompatibleWithType(TypeSolver typeSolver, ResolvedType s, ResolvedType t)
-
Method Summary
-
Constructor Details
-
TypeCompatibleWithType
-
-
Method Details
-
reduce
Description copied from class:ConstraintFormula
A formula is reduced to one or both of: i) A bound or bound set, which is to be incorporated with the "current" bound set. Initially, the current bound set is empty. ii) Further constraint formulas, which are to be reduced recursively.- Specified by:
reduce
in classConstraintFormula
-
equals
-
hashCode
public int hashCode() -
toString
-