AvlTree: Balanced binary trees using the AVL algorithm.
A comprehensive and efficient implementation of AVL trees. The raw AVL API has been designed with efficiency and generality in mind, not elagance or safety. It contains all the stuff you really don't want to write yourself if you can avoid it. This library may be useful for rolling your own Sets, Maps, Sequences, Queues (for example).
|Versions [faq]||2.4, 3.0, 3.1, 3.2, 4.0, 4.1, 4.2|
|Dependencies||base, COrdering (>=2.2) [details]|
|Copyright||(c) Adrian Hey 2004-2008|
|Maintainer||Adrian Hey http://homepages.nildram.co.uk/~ahey/em.png|
|Uploaded||by AdrianHey at Wed Jul 23 19:07:03 UTC 2008|
|Downloads||5460 total (266 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees