haskey-btree: B+-tree implementation in Haskell.

[ bsd3, database, library ] [ Propose Tags ]
Versions [RSS] 0.1.0.0, 0.2.0.0, 0.2.0.1, 0.3.0.0, 0.3.0.1 (info)
Dependencies base (>=4.7 && <5), binary (>=0.6 && <0.9 || >0.9 && <1), bytestring (>=0.10 && <1), containers (>=0.5 && <1), hashable (>=1.2 && <1.3), mtl (>=2.1 && <3), semigroups (>=0.12 && <1), text (>=1.2 && <2), transformers (>=0.3 && <1), vector (>=0.10 && <1) [details]
License BSD-3-Clause
Copyright Copyright (c) 2017, Henri Verroken, Steven Keuchel
Author Henri Verroken, Steven Keuchel
Maintainer steven.keuchel@gmail.com
Category Database
Home page https://github.com/haskell-haskey/haskey-btree
Source repo head: git clone https://github.com/haskell-haskey/haskey-btree
Uploaded by hverr at 2017-09-13T14:30:22Z
Distributions Stackage:0.3.0.1
Reverse Dependencies 2 direct, 1 indirect [details]
Downloads 3281 total (29 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-09-13 [all 1 reports]

Readme for haskey-btree-0.2.0.0

[back to package description]

haskey-btree

Travis Coverage Hackage Stackage Nightly Stackage LTS

B+-tree implementation in Haskell.

This package provides two B+-tree implementations. The first one is a pure B+-tree of a specific order, while the second one is an impure one backed by a page allocator.

This project is part of the haskey project. The haskey repository contains more information on how to use this library.