-
Notifications
You must be signed in to change notification settings - Fork 12.2k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Errors] Type argument inference from signatures infers fewer candidates #49
Comments
Treating this like other performance improvements that may have an impact on real world code. Please ensure this does not impact known code before we make this change to the spec. |
Keep in mind that this is also addressed by issue #248, which has a proposal for a third algorithm we are considering. |
Closing because we have a new algorithm to try out (namely the one proposed in issue #248) |
Anders, please change the spection 3.8.6 to reflect the new design (that is until we try the new proposal). |
Used to all succeed, but now they all fail. This is because when we collect candidates for U from testFunction11 and testFunction11P, we only use the last overload instead of all the overloads. This is an algorithmic change in the new compiler.
They used to all succeed, but they were Promise<{}>, which is not super meaningful anyway.
r11a has similar behavior in promisePermutations3.ts
The text was updated successfully, but these errors were encountered: