The AvlTree package

A comprehensive library and efficient implementation of AVL trees. The raw AVL API has been designed with efficiency and generality in mind, not elagance. 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).

Properties

Versions	2.4, 3.0, 3.1, 3.2, 4.0, 4.1, 4.2
Dependencies	base, containers, COrdering (≥2.1)
License	BSD3
Copyright	(c) Adrian Hey 2004-2008
Author	Adrian Hey
Maintainer	http://homepages.nildram.co.uk/~ahey/em.png
Stability	Stable
Category	Data Structures
Home page	http://www.haskell.org/haskellwiki/AvlTree
Upload date	Mon Jan 21 19:04:14 UTC 2008
Uploaded by	AdrianHey
Built on	ghc-6.10, ghc-6.12, ghc-6.8

Modules

Data
- Tree
  - Data.Tree.AVL
    - Test
      - Data.Tree.AVL.Test.AllTests
      - Data.Tree.AVL.Test.Counter

Downloads

AvlTree-2.4.tar.gz (Cabal source package)
package description (included in the package)