[Haskell-cafe] Priority Queues from Rabhi & Lapalme's Algorithms was Re: class Ref...

Shae Matijs Erisson shae at ScannedInAvian.com
Wed Jun 8 15:21:30 EDT 2005


Gracjan Polak <gracjan at acchsh.com> writes:

> To put it another way: is Data.Map only workaround to get something done, or
> is it The Right Way of doing PQs in Haskell?

Another option is the priority queues from the Rabhi & Lapalme book:
http://www.iro.umontreal.ca/~lapalme/Algorithms-functional.html
-- 
It seems I've been living two lives. One life is a self-employed web developer
In the other life, I'm shapr, functional programmer.  | www.ScannedInAvian.com
One of these lives has futures (and subcontinuations!)|  --Shae Matijs Erisson



More information about the Haskell-Cafe mailing list