Message378739
I'm doing a couple more timing tests to try to understand exactly when the cutoff should be applied (based on some combination of needle and haystack lengths).
Can the rolling hash algorithm be made to go sublinear like O(n/m)? It looked like it was pretty essential that it hash/unhash each and every haystack character. You could probably do a bloom-like check where you jump ahead by the needle length sometimes, but you'd then have to re-hash the m characters in the new window anyway. |
|
Date |
User |
Action |
Args |
2020-10-16 19:39:53 | Dennis Sweeney | set | recipients:
+ Dennis Sweeney, tim.peters, gregory.p.smith, vstinner, pmpp, serhiy.storchaka, josh.r, ammar2, corona10, Zeturic |
2020-10-16 19:39:53 | Dennis Sweeney | set | messageid: <1602877193.0.0.682607769203.issue41972@roundup.psfhosted.org> |
2020-10-16 19:39:52 | Dennis Sweeney | link | issue41972 messages |
2020-10-16 19:39:52 | Dennis Sweeney | create | |
|