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.
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
Versions | 0.1.0.0, 0.2.0.0, 0.2.0.0, 0.2.0.1, 0.3.0.0, 0.3.0.1 |
---|---|
Change log | None available |
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:29:52Z |
Modules
[Index]
Downloads
- haskey-btree-0.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees