-
Notifications
You must be signed in to change notification settings - Fork 208
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
Adjust function literal return type inference to avoid spurious null #4210
base: main
Are you sure you want to change the base?
Changes from 1 commit
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -6,6 +6,11 @@ Status: Draft | |
|
||
## CHANGELOG | ||
|
||
2024.12.17 | ||
- Change the function literal return type inference rules to ignore | ||
`return;` statements in generators (it doesn't actually cause null to be | ||
returned). | ||
|
||
2022.05.12 | ||
- Define the notions of "constraint solution for a set of type variables" and | ||
"Grounded constraint solution for a set of type variables". These | ||
|
@@ -324,7 +329,8 @@ schema. | |
`e`, using the local type inference algorithm described below with typing | ||
context `K`, and update `T` to be `UP(flatten(S), T)` if the enclosing | ||
function is `async`, or `UP(S, T)` otherwise. | ||
- For each `return;` statement in the block, update `T` to be `UP(Null, T)`. | ||
- If the enclosing function is not marked `sync*` or `async*`: For each | ||
`return;` statement in the block, update `T` to be `UP(Null, T)`. | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I really think it should change the return type to There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Perhaps that's already covered pretty well? For function literal return type inference, the type void main() {
void Function() f = () { return; }; // Return type of function literal is `void`.
f = () { return 3; }; // Error, can't return an `int` from a void function.
} When the return type from the context type is any other type, the inferred return type of the function literal will not be void unless it actually returns an expression of that type. void main() {
Object? Function() f = () { return; };
print(f.runtimeType); // Something that means `Null Function()`.
f = () { return print('Hah!'); };
print(f.runtimeType); // Something that means `void Function()`.
} This means that the function will always be treated as a void function when this is what the context expects, and it will almost always be treated as a non-void function when this is what the context expects. In the case where a void main() {
int? Function(bool b) f = (bool b) {
if (b) {
return; // Error: The return value is missing after `return`.
} else {
return 1;
}
};
} I think this would already deal with the potential code smells that you were targeting. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Not: "in the block" is imprecise. It can be read to include the bodies of nested functions, and it can be read as only applying to immediate sub-statements of the block. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Right, done! |
||
- For each `yield e;` statement in the block, let `S` be the inferred type of | ||
`e`, using the local type inference algorithm described below with typing | ||
context `K`, and update `T` to be `UP(S, T)`. | ||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The "for each" seems redundant. How about "if the body contains any
return;
statement ..."?There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
All four items in this list use a similar quantifier (actually, they all use 'for each'). How would it be redundant? We're running an algorithm, and at this point it needs to iterate over the function body to find all occurrences of
return ...
. Do you think it would improve the overall text to use a natural language version of recursion, rather than the iteration-ish "for each"?