PERF: improve perf of variable window rolling_min/max #19521
Labels
Performance
Memory or execution speed performance
Reshaping
Concat, Merge/Join, Stack/Unstack, Explode
Milestone
The variable window implementation of rolling max/min
is O(n x w) rather than amortized O(n) with a deque
based algorithm
here is a possibility
we could easily use the cython c++ impl of deque. here is a suggestion to use a heap.
The text was updated successfully, but these errors were encountered: