AvlTree: Balanced binary trees using AVL algorithm.

[ bsd3, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

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).

Modules

[Index]

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

Downloads

AvlTree-2.4.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

AdrianHey

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	2.4, 3.0, 3.1, 3.2, 4.0, 4.1, 4.2
Change log	CHANGELOG
Dependencies	base, containers, COrdering (>=2.1) [details]
Tested with	ghc ==6.8.2, ghc ==6.8.1
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 2008-01-21T19:04:14Z
Distributions
Reverse Dependencies	2 direct, 0 indirect [details]
Downloads	7747 total (3 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]