The btree-concurrent package

[Tags: lgpl, library]

A backend agnostic, concurrent BTree


[Skip to ReadMe]

Properties

Versions0.1.0, 0.1.1, 0.1.3, 0.1.4, 0.1.5
Change logNone available
Dependenciesarray (==0.4.*), base (==4.*), base16-bytestring (==0.1.*), base64-bytestring (==0.1.*), bytestring (==0.9.*), cereal (==0.3.*), containers (==0.4.*), cprng-aes (==0.2.*), directory (==1.*), entropy (>=0.2), filepath (==1.*), hashable (==1.*), mtl (==2.*), old-time (==1.*), random (==1.*), snappy (==0.2.*), stm (==2.2.*), time (==1.*) [details]
LicenseLGPL
AuthorMorten Brøns, Johan Brinch
Maintainerbrinchj@gmail.com
StabilityExperimental
CategoryData Structures
Home pagehttps://github.com/brinchj/btree-concurrent
UploadedMon Oct 29 09:26:31 UTC 2012 by JohanBrinch
DistributionsNixOS:0.1.5
Downloads798 total (30 in last 30 days)
Votes
0 []
StatusDocs not available [build log]
All reported builds failed as of 2015-05-24 [all 1 reports]

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for btree-concurrent-0.1.0

btree-concurrent

A backend agnostic, concurrent BTree written in Haskell.

Although the code does work, it is neither production-ready nor complete. See the TODO.org file for more details on missing parts.