AVL Trees available

[Simon Marlow]

On 18 May 2004 07:23, Adrian Hey wrote:

> I've put my candidate for Data.Trees.AVL up here..
> 
>  http://homepages.nildram.co.uk/~ahey/HLibs/Local.Data.Trees.AVL/
> 
> It's not finished, but in the absence of any other AVL tree
> offerings that I'm aware of, I would like to strike the Local
> prefix from this library name and claim the currently vacant
> Data.Trees.AVL slot in Simon M's hierarchy.

I'm happy for this to be "the" Data.Trees.AVL library.  I'm sure others
will want to comment on the details.  I wonder whether it would make
sense to have a specialised AVLMap type, which would let you optimise
the representation of AVL-based finite maps?

The library infrastructure team will shortly provide you with a ship
vehicle for your library.  I promise ;-)

> If you look at the code you'll see this is not Haskell at it's
> most elegant. Most of tt's like assembler written in Haskell,
> but it's fast :-)
> 
> I'd also like to book "Data.COrdering" too, if that's OK.

Data.COrdering is less obviously the right thing.  Can you give some
motivation for the design here?

Cheers,
	Simon