• wade (4/4) Feb 12 2009 Hi all,
• Andrei Alexandrescu (7/14) Feb 13 2009 The function is called topN in std.algorithm and still exists as far as
• bearophile (7/8) Feb 13 2009 Do you mean to find the n-th ordered item, ranking? If so, there's a fun...

wade <swadenator gmail.com> writes:

Hi all,

Does anybody have an efficient nth_element implementation (ala the STL) for D
1.0.  I was using the version from algortihms.d in DMD 2.012 but that seems to
be non-existent anymore and was quite buggy.

thanks,
wade

Andrei Alexandrescu <SeeWebsiteForEmail erdani.org> writes:

wade wrote:
 Hi all,
 
 Does anybody have an efficient nth_element implementation (ala the
 STL) for D 1.0.  I was using the version from algortihms.d in DMD
 2.012 but that seems to be non-existent anymore and was quite buggy.
 
 thanks, wade

The function is called topN in std.algorithm and still exists as far as 
I know. I did temporarily comment it out while working on the new 
std.algorithm, but I don't think I ever checked that in.

If there are bugs pertinent to 2.0, I'd appreciate a bugzilla entry 
about it.


Andrei

bearophile <bearophileHUGS lycos.com> writes:

wade:

 Does anybody have an efficient nth_element implementation (ala the STL) for D
1.0.  I was using the version from algortihms.d in DMD 2.012 but that seems to
be non-existent anymore and was quite buggy.

Do you mean to find the n-th ordered item, ranking? If so, there's a function
in my dlibs too:
http://www.fantascienza.net/leonardo/so/dlibs/ranking.html
The code is for D1+Phobos:
http://www.fantascienza.net/leonardo/so/libs_d.zip

Bye,
bearophile