This repository was archived by the owner on Feb 2, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 65
Optimize series.rolling.sum() #608
Merged
AlexanderKalistratov
merged 17 commits into
IntelPython:master
from
densmirn:feature/series_rolling_sum_opt
Feb 20, 2020
Merged
Changes from all commits
Commits
Show all changes
17 commits
Select commit
Hold shift + click to select a range
b2a4d9d
Optimize series.rolling.sum()
densmirn c22c208
Enable scalability for series.rolling.sum
densmirn ae90d1a
Merge branch 'master' of https://github.com/IntelPython/sdc into feat…
densmirn 7c10fca
Move rolling part to separate place
densmirn 236ac8a
Merge branch 'master' of https://github.com/IntelPython/sdc into feat…
densmirn be0229f
Fix style issues
densmirn b18f5d3
Minor fixes for series.rolling.sum()
densmirn e0d92fd
Change perf test for series.rolling.sum()
densmirn 0e63d1a
Fix issue in case of multithreading
densmirn a8572f8
Minor changes in WindowSum
densmirn 6236a57
Merge branch 'master' of https://github.com/IntelPython/sdc into feat…
densmirn 713f623
Enable scalability for series.rolling.sum()
densmirn 111bf08
Merge branch 'master' of https://github.com/IntelPython/sdc into feat…
densmirn 5be165c
Change perf test on series.rolling.sum
densmirn ac675e5
Refuse class WindowSum
densmirn 86f3d5a
Refactor series.rolling.sum()
densmirn 48c88b6
Merge branch 'master' of https://github.com/IntelPython/sdc into feat…
densmirn File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
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
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
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
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
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.
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.
Please consider the following option:
It's not the most elegant one, but it could give us some performance (due to elimination of condition in loop and extra counter). If it doesn't, your solution is preferable.
Also, I've changed order of
put
andpop
(firstlyput
, thenpop
). It shouldn't affect sum, but could be useful for min and max - if we have added new min/max - we don't need to recalculate resultThere 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.
I didn't get visible result, but I like the code. So let me apply the patch.