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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

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.

For more information on how to use this package, visit https://github.com/haskell-haskey/haskey-btree


[Skip to ReadMe]

Properties

Versions0.1.0.0, 0.2.0.0, 0.2.0.0, 0.2.0.1, 0.3.0.0
Change logNone available
Dependenciesbase (>=4.7 && <5), binary (>=0.6 && <0.9 || >0.9 && <1), bytestring (>=0.10 && <1), containers (>=0.5 && <1), hashable (==1.2.*), mtl (>=2.1 && <3), semigroups (>=0.12 && <1), text (>=1.2 && <2), transformers (>=0.3 && <1), vector (>=0.10 && <1) [details]
LicenseBSD-3-Clause
CopyrightCopyright (c) 2017, Henri Verroken, Steven Keuchel
AuthorHenri Verroken, Steven Keuchel
Maintainersteven.keuchel@gmail.com
CategoryDatabase
Home pagehttps://github.com/haskell-haskey/haskey-btree
Source repositoryhead: git clone https://github.com/haskell-haskey/haskey-btree
UploadedWed Sep 13 14:29:52 UTC 2017 by hverr

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees


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.