haskey-btree

B+-tree implementation in Haskell. https://github.com/haskell-haskey/haskey-btree

LTS Haskell 14.17:	0.3.0.1
Stackage Nightly 2019-12-12:	0.3.0.1
Latest on Hackage:	0.3.0.1

See all snapshots haskey-btree appears in

BSD-3-Clause licensed by Henri Verroken, Steven Keuchel

Maintained by steven.keuchel@gmail.com

Module documentation for 0.3.0.1

This version can be pinned in stack with:haskey-btree-0.3.0.1@sha256:6a287fba3279e6b83f6ae86ecb1a2f4b428b2ed906be14ce97f1f8cb4ed2299b,4146

haskey-btree

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.

Depends on 10 packages(full list with versions):

base, binary, bytestring, containers, hashable, mtl, semigroups, text, transformers, vector