-
-
Notifications
You must be signed in to change notification settings - Fork 18.4k
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
CLN: rank_1d #40546
CLN: rank_1d #40546
Conversation
Can you post ASVs? |
Added ASVs here:
|
this is a pure refactor right? |
Yeah, no behavior change |
kk lgtm. cc @jbrockmendel |
out[lexsort_indexer[j]] = j + 1 - grp_start | ||
elif tiebreak == TIEBREAK_FIRST_DESCENDING: | ||
for j in range(i - dups + 1, i + 1): | ||
out[lexsort_indexer[j]] = 2 * i - j - dups + 2 - grp_start |
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.
should it be obvious where 2 * i - j - dups + 2 - grp_start
comes from? looks like equivalent to (i - dups + 1) + (i - j + 1) - grp_start
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.
Agreed, good opportunity to clarify here, have added some commentary
Potential clarification, otherwise LGTM |
thanks @mzeitlin11 |
Long overdue followup to #38744. Only half the diff is relevant since the changes are duplicated over the if rank_t is object... else with no_gil... structure.