btree-concurrent: A backend agnostic, concurrent BTree

[ data-structures, library ] [ Propose Tags ]

A backend agnostic, concurrent BTree


[Skip to Readme]

Modules

[Last Documentation]

  • Data
    • BTree
      • Data.BTree.BTree
      • Cache
        • Data.BTree.Cache.Class
        • Data.BTree.Cache.STM
      • Data.BTree.Class
      • HashTable
        • Data.BTree.HashTable.STM
      • KVBackend
        • Data.BTree.KVBackend.Class
        • Data.BTree.KVBackend.Files
        • Data.BTree.KVBackend.Util
      • Data.BTree.Types

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0, 0.1.1, 0.1.3, 0.1.4, 0.1.5
Dependencies array (>=0.4 && <0.5), base (>=4 && <5), base16-bytestring (>=0.1 && <0.2), base64-bytestring (>=0.1 && <0.2), bytestring (>=0.9 && <0.10), cereal (>=0.3 && <0.4), containers (>=0.4 && <0.5), cprng-aes (>=0.2 && <0.3), directory (>=1 && <2), entropy (>=0.2), filepath (>=1 && <2), hashable (>=1 && <2), mtl (>=2 && <3), old-time (>=1 && <2), random (>=1 && <2), snappy (>=0.2 && <0.3), stm (>=2.2 && <2.3), time (>=1 && <2) [details]
License LicenseRef-LGPL
Author Morten Brøns, Johan Brinch
Maintainer brinchj@gmail.com
Category Data Structures
Home page https://github.com/brinchj/btree-concurrent
Uploaded by JohanBrinch at 2012-10-29T09:34:34Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 4197 total (12 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-23 [all 7 reports]

Readme for btree-concurrent-0.1.1

[back to package description]

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.