Class ExpressionCompatibleWithType
- java.lang.Object
-
- com.github.javaparser.symbolsolver.resolution.typeinference.ConstraintFormula
-
- com.github.javaparser.symbolsolver.resolution.typeinference.constraintformulas.ExpressionCompatibleWithType
-
public class ExpressionCompatibleWithType extends ConstraintFormula
An expression 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
Constructors Constructor Description ExpressionCompatibleWithType(TypeSolver typeSolver, Expression expression, ResolvedType T)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description booleanequals(Object o)inthashCode()ConstraintFormula.ReductionResultreduce(BoundSet currentBoundSet)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.StringtoString()
-
-
-
Constructor Detail
-
ExpressionCompatibleWithType
public ExpressionCompatibleWithType(TypeSolver typeSolver, Expression expression, ResolvedType T)
-
-
Method Detail
-
reduce
public ConstraintFormula.ReductionResult reduce(BoundSet currentBoundSet)
Description copied from class:ConstraintFormulaA 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:
reducein classConstraintFormula
-
-