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

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