Fix #8802: Use wildcards for result type approximation of implicits #8824
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Use wildcards for result type approximation of dependent implicit methods.
In a situation like
we need to go constrain the result type of
f
before doing the implicitsearch for
T
. Previously we created a fresh type variableparam(1)
withT & Singleton
as upper bound. That works well for other uses ofresult type approximation, but in this case, we miss constraining
param(1)
from below by the result of the implicit search. So in the endparam(1)
gets interpolated to its upper bound, which leads to problems.One possible solution is to add the missing lower constraint for the dependent
type variable. But it's easier to just use a Wildcard type, which is what
this PR does.