Class ConstraintFormulaSet
- java.lang.Object
-
- com.github.javaparser.symbolsolver.resolution.typeinference.ConstraintFormulaSet
-
public class ConstraintFormulaSet extends java.lang.Object
-
-
Field Summary
Fields Modifier and Type Field Description private java.util.List<ConstraintFormula>
constraintFormulas
private static ConstraintFormulaSet
EMPTY
-
Constructor Summary
Constructors Modifier Constructor Description private
ConstraintFormulaSet()
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description static ConstraintFormulaSet
empty()
boolean
isEmpty()
BoundSet
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.ConstraintFormulaSet
withConstraint(ConstraintFormula constraintFormula)
-
-
-
Field Detail
-
constraintFormulas
private java.util.List<ConstraintFormula> constraintFormulas
-
EMPTY
private static final ConstraintFormulaSet EMPTY
-
-
Method Detail
-
withConstraint
public ConstraintFormulaSet withConstraint(ConstraintFormula constraintFormula)
-
empty
public static ConstraintFormulaSet empty()
-
reduce
public BoundSet 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. 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()
-
-