[Haskell-cafe] Re: TChan implementation: Why TVarList

[Joel Reymont]

I think I could fake it on top of Data.Map keyed on ClockTime.

findMax :: Map k a -> (k, a)	
O(log n). The maximal key of the map.

This would give me the maximum key which I can then proceed to remove.

On Dec 6, 2005, at 12:35 PM, Simon Peyton-Jones wrote:

> sounds as if you need a priority queue, so you can say "give me the
> message with the earliest time" but otherwise yes.
>

--
http://wagerlabs.com/