Chris Okasaki is working on just such a thing.
He'll be ready soon...
Simon
> -----Original Message-----
> From: Kevin Atkinson [mailto:[EMAIL PROTECTED]]
> Sent: Tuesday, April 27, 1999 5:20 PM
> To: [EMAIL PROTECTED]
> Subject: STL Like Library For Haskell
>
>
> 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.
>
> queue and deque implanted with both amortized and constant
> time updates.
>
> And all of this should me implanted in a consistent fashion
> with a nice
> class heritage.
>
> I release that bits and pieces exist however I have not seen a nice
> collection with clean abstraction. That is one that has a heritage
> similar to the heritage of the STL.
>
> --
> Kevin Atkinson
> [EMAIL PROTECTED]
> http://metalab.unc.edu/kevina/
>
