ConstraintFormulaSet (javaparser-symbol-solver-core 3.8.3 API)

java.lang.Object
- com.github.javaparser.symbolsolver.resolution.typeinference.ConstraintFormulaSet

public class ConstraintFormulaSet
extends Object

Author:: Federico Tomassetti

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`static ConstraintFormulaSet`	`empty()`
`boolean`	`isEmpty()`
`BoundSet`	`reduce(com.github.javaparser.symbolsolver.model.resolution.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)`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Method Detail
  - withConstraint
```
public ConstraintFormulaSet withConstraint(ConstraintFormula constraintFormula)
```
  - empty
```
public static ConstraintFormulaSet empty()
```
  - reduce
```
public BoundSet reduce(com.github.javaparser.symbolsolver.model.resolution.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()
```