RBTree: Pure haskell Red-Black-Tree implemetation

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

This package implemets Red-Black tree data-structure.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5
Dependencies base (>3 && <5) [details]
License BSD-3-Clause
Copyright 2011 Wu Xingbo (wuxb45@gmail.com)
Author Wu Xingbo
Maintainer Wu Xingbo
Category Data Structures
Home page git://github.com/wuxb45/Haskell-RBTree.git
Bug tracker mailto:wuxb45@gmail.com
Uploaded by XingboWu at 2011-03-26T07:01:04Z
Distributions NixOS:0.0.5
Reverse Dependencies 2 direct, 3 indirect [details]
Downloads 4914 total (16 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]

Readme for RBTree-0.0.3

[back to package description]
Pure haskell implementation from Wu Xingbo (wuxb45@gmail.com) 2011

to build & install for yourself:
shell> runhaskell Setup.lhs configure --user
shell> runhaskell Setup.lhs build
shell> runhaskell Setup.lhs install

on any problem, you may try this:
shell> runhaskell Setup.lhs register

for system, replace '--user' with '--ghc'

run simple test:
ghci> :m + Data.Tree.RBTreeTest
ghci> testRB
It takes seconds to run. Then you will see "just xxxx True"s for success.

read Data.Tree.RBTreeTest.lhs for usage of RBTree.

change log (0.0.2):
add bangpatterns to some data field.
add ghc optimization flags to .cabal
be careful of memory usage. insert 10MiB Int values takes 3 seconds and 800MiB memory space.

change log (0.0.3):
add function "searchFast".
rename 'remove*' functions to 'delete*'s.