use of com.github.javaparser.symbolsolver.resolution.typeinference.constraintformulas.ExpressionCompatibleWithType in project javaparser by javaparser.
the class TypeInference method constraintSetFromArgumentsSubstitution.
private ConstraintFormulaSet constraintSetFromArgumentsSubstitution(List<ResolvedType> Fs, List<Expression> es, Substitution theta, int k) {
ConstraintFormulaSet constraintFormulaSet = ConstraintFormulaSet.empty();
for (int i = 0; i < k; i++) {
Expression ei = es.get(i);
ResolvedType fi = Fs.get(i);
ResolvedType fiTheta = typeWithSubstitution(fi, theta);
constraintFormulaSet = constraintFormulaSet.withConstraint(new ExpressionCompatibleWithType(typeSolver, ei, fiTheta));
}
return constraintFormulaSet;
}
Aggregations