8 Jun
2005
8 Jun
'05
2:26 p.m.
On 6/8/05, Gracjan Polak
Tomasz Zielonka wrote:
On Tue, Jun 07, 2005 at 12:25:50PM +0200, Gracjan Polak wrote:
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 to look at Chris Okasaki's _Purely_Functional_Data_Structures_ (code available at his website). Pairing heaps and splay heaps (when bootstrapped) are said to have O(1) in everything but removeMin (new, insert, merge, findMin) and good constant factors. Colin DeVilbiss