-
-
Notifications
You must be signed in to change notification settings - Fork 5.6k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implement optimizations for sparse findnext/findprev #28313
Conversation
These were basically lying around, unused. Just a few minor modifications were required to generalize them for any predicate function
Good to go? |
Bumpie |
Will do some spot benchmarks here and if it looks good + CI will merge. |
I realized that these functions I repurposed aren't entirely unused — they're intended to form the basis of an abstract interface for sparse arrays. I can just add these definitions instead of replacing |
For reference, this was originally this pull request. I don't know what happened in the mean time to make it appear "almost unused". |
Nothing happened, I just had initially searched the |
Closing with #31354 |
@KlausC Just bringing this PR to your attention. |
These were basically lying around,
unused. Just a few minor modifications were required to generalize them for any predicate function and update them to return CartesianIndexes.Now that #26022 hashes more elements, this preserves the performance of the sparse case.