[OT] Finding longest documents

[Klaus Oberhofer]

Andrei Alexandrescu schrieb:
>
> There are heap primitives in std.algorithm, just not published yet. 
> Anyhow, in case you or anyone would be interested in putting your 
> ideas in Phobos, I encourage you to share some code with me so I can 
> look over it.
>
> Andrei

Some time ago I implemented a binary heap because I needed it to create 
Huffman codes  (Warning: Maybe the code does not catch up to the current 
Tango library.).  Parts of the code are inspired by the MINTL library, 
which contains an implementation, too. See my code at

http://www.dsource.org/projects/nova/browser/trunk/nova/ds/priorityqueue.d

MINTL seems to be abandoned, but I found it in the necrophilia repos:

http://necrophilia.googlecode.com/svn/trunk/tests/shared/mintl/arrayheap.d


KlausO