[snip]
Really interesting. Thanks for sharing.
I have recently been spending some spare time learning more about D's topN and pivotPartition implementation, which led me to your paper on fast deterministic selection.
Would you consider changing the pivotPartition implementation based on this?
Would the insights gleamed from this paper mean that a branchless version of topN could be faster?
