Class ConstraintFormula
java.lang.Object
com.github.javaparser.symbolsolver.resolution.typeinference.ConstraintFormula
- Direct Known Subclasses:
ExpressionCompatibleWithType
,LambdaThrowsCompatibleWithType
,MethodReferenceThrowsCompatibleWithType
,TypeCompatibleWithType
,TypeContainedByType
,TypeSameAsType
,TypeSubtypeOfType
Constraint formulas are assertions of compatibility or subtyping that may involve inference variables.
- Author:
- Federico Tomassetti
-
Nested Class Summary
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionabstract ConstraintFormula.ReductionResult
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.
-
Constructor Details
-
ConstraintFormula
public ConstraintFormula()
-
-
Method Details
-
reduce
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.
-