AvlTree: Balanced binary trees using the AVL algorithm.

[ bsd3, data-structures, library ] [ Propose Tags ]

A comprehensive library 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
Change log CHANGELOG
Dependencies base, containers, COrdering (>=2.1) [details]
License BSD-3-Clause
Copyright (c) Adrian Hey 2004-2008
Author Adrian Hey
Maintainer http://homepages.nildram.co.uk/~ahey/em.png
Category Data Structures
Home page http://www.haskell.org/haskellwiki/AvlTree
Uploaded by AdrianHey at Mon Mar 17 16:51:30 UTC 2008
Distributions NixOS:4.2
Downloads 4909 total (105 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees