[Issue 15553] topN very inefficient [slower than sort, even for topN(0)] but should be O(n)

[via Digitalmars-d-bugs]

https://issues.dlang.org/show_bug.cgi?id=15553

--- Comment #6 from github-bugzilla at puremagic.com ---
Commit pushed to stable at https://github.com/D-Programming-Language/phobos

https://github.com/D-Programming-Language/phobos/commit/10da3381c1d8d92ba8f0ef96e157beb1ada83f49
Merge pull request #3921 from andralex/15553

--