Re: Improving containers library

Hi, if I understand the function "fusing" correctly, you use the multi-pass variant of a pairing heap? Personally I thought more in the lines of a two-pass lazy variant of pairing heap mentioned in Okasaki's book. And there are skew heaps... Well, we'll let a benchmark do the judging :) Thanks, Milan

Yo,

If you're interested in adding priority queues to containers, shameless plug: I've got a good implementation of pairing heaps in http://hackage.haskell.org/package/queuelike. It's a bit obfuscated right now, but I'd definitely be interested in producing something that's actually readable and usable enough to be put into containers...

Louis Wasserman wasserman.louis@gmail.com http://profiles.google.com/wasserman.louis

On Wed, Mar 3, 2010 at 11:28 AM, wrote:

...

Re: Improving containers library

_______________________________________________ Libraries mailing list Libraries@haskell.org http://www.haskell.org/mailman/listinfo/libraries