Class ConstraintFormulaSet
java.lang.Object
com.github.javaparser.symbolsolver.resolution.typeinference.ConstraintFormulaSet
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate List
<ConstraintFormula> private static final ConstraintFormulaSet
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionstatic ConstraintFormulaSet
empty()
boolean
isEmpty()
reduce
(TypeSolver typeSolver) Takes a compatibility assertion about an expression or type, called a constraint formula, and reduces it to a set of bounds on inference variables.withConstraint
(ConstraintFormula constraintFormula)
-
Field Details
-
constraintFormulas
-
EMPTY
-
-
Constructor Details
-
ConstraintFormulaSet
private ConstraintFormulaSet()
-
-
Method Details
-
withConstraint
-
empty
-
reduce
Takes a compatibility assertion about an expression or type, called a constraint formula, and reduces it to a set of bounds on inference variables. Often, a constraint formula reduces to other constraint formulas, which must be recursively reduced. A procedure is followed to identify these additional constraint formulas and, ultimately, to express via a bound set the conditions under which the choices for inferred types would render each constraint formula true. -
isEmpty
public boolean isEmpty()
-