Edison library

[David Feuer]

I'm sorry if I was confusing, but by "efficient" I meant "something other
than unbalanced trees".  Since the library provides a fairly large variety
of heaps, it is surprising that it only provides a toy implementation of
sets.  It is particularly surprising because I know that Okasaki has
written about balanced tree implementations before (e.g. in Purely
Functional Data Structures).

On Tue, 12 Feb 2002, Peter White wrote:

> 
> There is an unbalanced set implementation of the Set class in there....
> Cheers
> Peter White
> Galois Connections
> 
> -----Original Message-----
> From: glasgow-haskell-users-admin@haskell.org
> [mailto:glasgow-haskell-users-admin@haskell.org]On Behalf Of David Feuer
> Sent: Tuesday, February 12, 2002 3:16 PM
> To: glasgow-haskell-users@haskell.org
> Subject: Edison library
> 
> 
> Anyone know if Okasaki plans to expand Edison to include efficient sets
> and/or other non-heap collections?  It looks like the library hasn't
> changed for 2 years...
> 
> David Feuer
> 
> _______________________________________________
> Glasgow-haskell-users mailing list
> Glasgow-haskell-users@haskell.org
> http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
> 
> 
>