https://issues.dlang.org/show_bug.cgi?id=15401
Infiltrator <[email protected]> changed: What |Removed |Added ---------------------------------------------------------------------------- CC| |[email protected] --- Comment #1 from Infiltrator <[email protected]> --- Once issue 15421 is fixed, this is a simple matter of topN(l, r); sort(l); Which brings us to the question of: should partialSort(Range, index) be changed to call partialSort(r[0..n], r[n..$]) to reduce duplication or is there a large performance difference in the two topNs? --
