On 27-Apr-1999, Hans Aberg <[EMAIL PROTECTED]> wrote:
> >Has anyone done any work on comings up with an STL like collection of
> >Containers and Algorithms for Haskell.
> >
> >In partially I would like to see the following containers:
> >
> >Hash map, set, and bags which behave like arrays do.
> >Truly mutable hash map set and bags.
> >Truly mutable arrays and references.
> >Ordered map, set, and bags with efficient purely functional updates as
> >well as array style updates for efficiently updating a bunch of elements
> >at once.
>
> Is not mutable taboo in Haskell, which is supposed to be dogmatically pure?
No, mutable data structures are not taboo in Haskell; you just need
to embed them in some appropriate Monad, e.g. the IO Monad.
--
Fergus Henderson <[EMAIL PROTECTED]> | "I have always known that the pursuit
WWW: <http://www.cs.mu.oz.au/~fjh> | of excellence is a lethal habit"
PGP: finger [EMAIL PROTECTED] | -- the last words of T. S. Garp.
