-
-
Notifications
You must be signed in to change notification settings - Fork 1.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
Reduce visit recursion for large binary expressions? #9122
Comments
Are you fine with a solution based on Also, can you list the SWC passes used by Deno? IIRC, I added an in-tree testing for transforms used by a team, but I'm not sure if it was Deno or Parcel. I'll add one more in-tree test suite for it and for stack size. |
An older issue for the same problem: #1627 |
Nope, wasn't us.
I think it's good to use stacker generally, but I feel like scenarios like this could be optimized to not use so much stack? It will probably run a lot faster.
|
Did you enable |
Deno isn't using it. https://github.com/denoland/deno/blob/147411e64b22fe74cb258125acab83f9182c9f81/Cargo.lock#L6544-L6561 It should have |
Describe the feature
In certain transforms, it might be good to not use recursion. For example, it's fairly common for people to write code like the following:
It might be good for transforms like the resolver to special case these scenarios in its transformers and instead of visiting the expressions recursively it could visit them one by one in a loop so that it doesn't overflow the stack.
Babel plugin or link to the feature description
No response
Additional context
denoland/deno#24325 (comment)
The text was updated successfully, but these errors were encountered: