Make filter_out faster#650
Merged
Merged
Conversation
There was a problem hiding this comment.
Pull request overview
This PR optimizes the filter_out function by replacing Stream-based operations with direct tail recursion, achieving a reported 10x performance improvement. The optimization specifically targets the filtering of :text and :comment nodes from HTML trees.
Key changes:
- Replaces
Stream.filterandStream.mapwith a tail-recursivedo_mapperhelper function - Uses an accumulator pattern with a final reverse to maintain list order
- Eliminates Stream enumeration overhead while preserving identical behavior
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
Owner
|
🚀 🚀 🚀 thanks! |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
mapperis only called for[:text, :comment]cases and takes a list so it's safe to refactor the Stream into a recursion I believe.There is a 10x speedup in this benchmark: