Gracjan Polak <[EMAIL PROTECTED]> 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 _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
