Re: Trivial Haskell Concurrency problem

[Marcin 'Qrczak' Kowalczyk]

Tue, 15 Feb 2000 11:20:45 +0100, George Russell <[EMAIL PROTECTED]> pisze:

> In this case it could be filled by having a supply of guaranteed
> distinct elements from a linear order, which doesn't have to require
> a central dispatch centre.  (For example, you could allocate them
> on each processor and append a processor id.)

If the IO monad can maintain a random number generator, it can as
well mainain unique Integer supply. The interface is clean.

And what about having unsafePtrCompare in addition to IOExts.unsafePtrEq?

-- 
 __("<    Marcin Kowalczyk * [EMAIL PROTECTED] http://qrczak.ids.net.pl/
 \__/              GCS/M d- s+:-- a22 C+++$ UL++>++++$ P+++ L++>++++$ E-
  ^^                  W++ N+++ o? K? w(---) O? M- V? PS-- PE++ Y? PGP+ t
QRCZAK                  5? X- R tv-- b+>++ DI D- G+ e>++++ h! r--%>++ y-