haskey-btree

B+-tree implementation in Haskell.

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

LTS Haskell 24.28:0.3.0.1@rev:1
Stackage Nightly 2026-01-18: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.1@sha256:f269e44d89924a76eb88e7f1ae5b8e1637b1b9c6b1ab98d1f64aa0d2e1a88806,4302

Module documentation for 0.3.0.1

  • Data
    • Data.BTree
      • Data.BTree.Alloc
        • Data.BTree.Alloc.Class
        • Data.BTree.Alloc.Debug
      • Data.BTree.Impure
        • Data.BTree.Impure.Internal
          • Data.BTree.Impure.Internal.Delete
          • Data.BTree.Impure.Internal.Fold
          • Data.BTree.Impure.Internal.Insert
          • Data.BTree.Impure.Internal.Lookup
          • Data.BTree.Impure.Internal.Overflow
          • Data.BTree.Impure.Internal.Setup
          • Data.BTree.Impure.Internal.Structures
        • Data.BTree.Impure.NonEmpty
      • Data.BTree.Primitives
        • Data.BTree.Primitives.Exception
        • Data.BTree.Primitives.Height
        • Data.BTree.Primitives.Ids
        • Data.BTree.Primitives.Index
        • Data.BTree.Primitives.Key
        • Data.BTree.Primitives.Leaf
        • Data.BTree.Primitives.Value
      • Data.BTree.Pure
        • Data.BTree.Pure.Setup

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.