Hello Joel,
Tuesday, December 06, 2005, 2:46:24 PM, you wrote:
JR> I need to implement a mailbox where messages can be pulled out based
JR> on a predicate or in order of arrival. I'm thinking of using a Map
JR> keyed on ClockTime.
JR> Do you have any suggestions?
it depends. what is the usage
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 que
Jones
| Cc: Haskell Cafe
| Subject: [Haskell-cafe] Re: TChan implementation: Why TVarList
|
| Well, I meant more like TVar [a] but I see that you are pulling from
| the front and appending to the rear.
|
| I need to implement a mailbox where messages can be pulled out based
| on a predicate or i
Well, I meant more like TVar [a] but I see that you are pulling from
the front and appending to the rear.
I need to implement a mailbox where messages can be pulled out based
on a predicate or in order of arrival. I'm thinking of using a Map
keyed on ClockTime.
Do you have any suggestions
The mutable cell is in the tail. A [TVar a] would be quite different.
You can read about a very similar impl (based on MVars) in the original
"Concurrent Haskell" paper (on my papers page)
S
| -Original Message-
| From: Joel Reymont [mailto:[EMAIL PROTECTED]
| Sent: 06 December 2005 11:2
