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).
Downloads
- AvlTree-4.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 2.4, 3.0, 3.1, 3.2, 4.0, 4.1, 4.2 |
---|---|
Change log | CHANGELOG |
Dependencies | base, COrdering (>=2.3) [details] |
Tested with | ghc ==6.8.3, ghc ==6.8.2, ghc ==6.8.1 |
License | BSD-3-Clause |
Copyright | (c) Adrian Hey 2004-2008 |
Author | Adrian Hey |
Maintainer | Adrian Hey http://homepages.nildram.co.uk/~ahey/em.png |
Category | Data Structures |
Uploaded | by AdrianHey at 2008-08-29T05:59:00Z |
Distributions | |
Reverse Dependencies | 2 direct, 0 indirect [details] |
Downloads | 7672 total (14 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |