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

Implement a topK() function #399

Closed
juliusv opened this Issue Aug 3, 2014 · 3 comments

Comments

Projects
None yet
2 participants
@juliusv
Copy link
Member

juliusv commented Aug 3, 2014

/cc @grobie

@brian-brazil

This comment has been minimized.

Copy link
Member

brian-brazil commented Aug 3, 2014

We should also add bottomK while we're at it.

@juliusv

This comment has been minimized.

Copy link
Member Author

juliusv commented Aug 3, 2014

Yep, definitely! Like we have a sort_desc() to our sort().

@juliusv juliusv closed this in 200d02e Aug 5, 2014

juliusv added a commit that referenced this issue Nov 25, 2014

Implement topk() and bottomk() functions.
To achieve O(log n * k) runtime, this uses a heap to track the current
bottom-k or top-k elements while iterating over the full set of
available elements.

It would be possible to reuse more code between topk and bottomk, but I
decided for some more duplication for the sake of clarity.

This fixes #399

Change-Id: I7487ddaadbe7acb22ca2cf2283ba6e7915f2b336

simonpasquier pushed a commit to simonpasquier/prometheus that referenced this issue Oct 12, 2017

Merge pull request prometheus#399 from prometheus/improve-layout
Improve landing page layout on smaller screens.
@lock

This comment has been minimized.

Copy link

lock bot commented Mar 24, 2019

This thread has been automatically locked since there has not been any recent activity after it was closed. Please open a new issue for related bugs.

@lock lock bot locked and limited conversation to collaborators Mar 24, 2019

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
You can’t perform that action at this time.