-
Notifications
You must be signed in to change notification settings - Fork 1.2k
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
feat: Implement map_keys_by_top_n_values function in Velox #12209
base: main
Are you sure you want to change the base?
Conversation
✅ Deploy Preview for meta-velox canceled.
|
This pull request was exported from Phabricator. Differential Revision: D68812985 |
…or#12209) Summary: Implement map_keys_by_top_n_values function in Velox ; the function returns the top N keys of the given map in descending order according to the natural ordering of its values. Differential Revision: D68812985
b50ee28
to
bcd84eb
Compare
This pull request was exported from Phabricator. Differential Revision: D68812985 |
This pull request was exported from Phabricator. Differential Revision: D68812985 |
const size_t ttlSize = | ||
std::min(static_cast<size_t>(n), static_cast<size_t>(inputMap.size())); | ||
|
||
std::vector<It> container; |
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.
curious why do we need this container and another result?
Could you please add the doc for this function here: https://github.com/facebookincubator/velox/blob/main/velox/docs/functions/presto/map.rst |
Summary:
Implement map_keys_by_top_n_values function in Velox ;
the function returns the top N keys of the given map in descending order according to the natural ordering of its values.
Differential Revision: D68812985