Skip to content
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

leaderboard rank cache improvements #1050

Merged
merged 1 commit into from
Jul 12, 2023
Merged

leaderboard rank cache improvements #1050

merged 1 commit into from
Jul 12, 2023

Conversation

syhpoon
Copy link
Contributor

@syhpoon syhpoon commented Jul 6, 2023

No description provided.

@syhpoon syhpoon requested review from zyro and sesposito July 6, 2023 13:14
Copy link
Member

@sesposito sesposito left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I've only left a minor suggestion but otherwise 💯 👍

assert.EqualValues(t, 2, cache.Get("lid", order, 44, 45, 0, u4))
assert.EqualValues(t, 3, cache.Get("lid", order, 33, 34, 0, u3))
assert.EqualValues(t, 4, cache.Get("lid", order, 22, 23, 0, u2))
assert.EqualValues(t, 5, cache.Get("lid", order, 11, 12, 0, u1))
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Should we also add a test for tied scores that are untied by the subscore?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Good idea! Will do 👍

@syhpoon syhpoon force-pushed the lb-rank-cache-opt branch 4 times, most recently from 9d03c60 to e5e796c Compare July 12, 2023 08:39
@syhpoon syhpoon merged commit 63ac64a into master Jul 12, 2023
@syhpoon syhpoon deleted the lb-rank-cache-opt branch July 12, 2023 08:56
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants