Package com.github.javaparser.symbolsolver.resolution.typeinference

Class ConstraintFormula

java.lang.Object

com.github.javaparser.symbolsolver.resolution.typeinference.ConstraintFormula

Direct Known Subclasses:

ExpressionCompatibleWithType, LambdaThrowsCompatibleWithType, MethodReferenceThrowsCompatibleWithType, TypeCompatibleWithType, TypeContainedByType, TypeSameAsType, TypeSubtypeOfType

public abstract class ConstraintFormula
extends Object

Constraint formulas are assertions of compatibility or subtyping that may involve inference variables.

Author:

Federico Tomassetti

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	ConstraintFormula.ReductionResult

Constructor Summary

Constructors

Constructor	Description
ConstraintFormula()

Method Summary

Modifier and Type	Method	Description
abstract ConstraintFormula.ReductionResult	reduce(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.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ConstraintFormula

public ConstraintFormula()

Method Detail

reduce

public abstract ConstraintFormula.ReductionResult reduce(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. Initially, the current bound set is empty. ii) Further constraint formulas, which are to be reduced recursively.