Optimize scanr for improved performance
#29
Merged
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.
This pull request addresses the TODO comment in the code to further optimize the
scanralgorithm. The function has been refactored to runfoldlon a reversed version of the input list, rather than usefoldras did the previous implementation. The optimized version also makes use ofconsto add to the accumulator list, rather than call convert the added element to a separate list and usingappend.The performance analysis detail is below. The test was performed by calling the
scanrfunction on a 2,000,000 element list for 50 cycles.All
racounit tests have been run successfully.Note: The original implementation made use of the
firstfunction. The testing showed that this increased execution time by about 26%. However, I want to acknowledge that there may be a reason that this is preferred that I am not aware of. I believe the difference is due tofirstimplementing a guard to ensure it is only called on lists whilecaris missing the same guard.Please do with this request as you like. I am a fan of this library, and I was hoping to help.