⚡️ Speed up function function_has_return_statement
by 41%
#451
+19
−5
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.
📄 41% (0.41x) speedup for
function_has_return_statement
incodeflash/discovery/functions_to_optimize.py
⏱️ Runtime :
3.69 milliseconds
→2.62 milliseconds
(best of67
runs)📝 Explanation and details
Here's an optimized version of your program focusing on reducing per-node overhead and the significant cost of calling
ast.iter_child_nodes(node)
inside your traversal loop (which accounts for almost 80% of total runtime).Optimization Strategies
ast.iter_child_nodes
instead of calling the function for every node. This saves significant overhead (as the stdlib implementation usesgetattr
, a generator and repeated attribute accesses).stack_pop = stack.pop
trick) to avoid repeated attribute access on the hot path.Summary of improvements
fast_iter_child_nodes
is inlined and avoids unnecessary attribute access inside collections.Return
.This rewrite will make a significant speed difference especially for large function bodies.
✅ Correctness verification report:
🌀 Generated Regression Tests and Runtime
To edit these changes
git checkout codeflash/optimize-function_has_return_statement-mcfagouq
and push.