btree-concurrent: A backend agnostic, concurrent BTree

[ data-structures, library ] [ Propose Tags ]

A backend agnostic, concurrent BTree


[Skip to Readme]
Versions 0.1.0, 0.1.1, 0.1.3, 0.1.4, 0.1.5
Dependencies array (==0.4.*), base (==4.*), base64-bytestring (==1.*), bytestring (>=0.9), cereal (>=0.3), containers (>=0.5), directory (==1.*), filepath (==1.*), hashable (==1.*), mtl (==2.*), random (==1.*), snappy (==0.2.*), stm (==2.2.*), time (==1.*) [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
Source repo head: git clone https://github.com/brinchj/btree-concurrent.git
Uploaded by JohanBrinch at Tue Oct 30 12:37:20 UTC 2012
Distributions NixOS:0.1.5
Downloads 2005 total (12 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-23 [all 8 reports]
Hackage Matrix CI

Modules

  • 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

For package maintainers and hackage trustees


Readme for btree-concurrent-0.1.4

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