haskey-btree

B+-tree implementation in Haskell.

https://github.com/haskell-haskey/haskey-btree

Version on this page:0.3.0.0
LTS Haskell 20.26:0.3.0.1
Stackage Nightly 2024-10-03:0.3.0.1@rev:1
Latest on Hackage:0.3.0.1@rev:1

See all snapshots haskey-btree appears in

BSD-3-Clause licensed by Henri Verroken, Steven Keuchel
Maintained by [email protected]
This version can be pinned in stack with:haskey-btree-0.3.0.0@sha256:a69896adcefeb863047c76b9a61a3a7d47126b12e4ab99c0d5f820fb77dcd5a7,4146

Module documentation for 0.3.0.0

Used by 2 packages in lts-12.26(full list with versions):
haskey, haskey-mtl

haskey-btree

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