PR #11019 implements SelectKUnstable.
Some previous result of SelectKUnstable using StableHeap is shown here: #11019 (comment)
So, implementation of SelectKStable should explore how to implement this algorithm using StablePartition + stable_sorting.
Final note: As mentioned here: #11019 (comment)
.e. instead of select_k_options.is_top_k() have 1) a check that there are sort keys and then 2) check select_k_options.sort_keys[0].order == Descending instead, inside the function definition.
1
Reporter: Alexander Ocsa / @aocsa
Note: This issue was originally created as ARROW-13969. Please see the migration documentation for further details.
PR #11019 implements SelectKUnstable.
Some previous result of SelectKUnstable using StableHeap is shown here: #11019 (comment)
So, implementation of SelectKStable should explore how to implement this algorithm using StablePartition + stable_sorting.
Final note: As mentioned here: #11019 (comment)
.e. instead of
1
select_k_options.is_top_k()have 1) a check that there are sort keys and then 2) checkselect_k_options.sort_keys[0].order == Descendinginstead, inside the function definition.Reporter: Alexander Ocsa / @aocsa
Note: This issue was originally created as ARROW-13969. Please see the migration documentation for further details.