Safe Haskell | None |
---|---|
Language | Haskell2010 |
Primitive data structures and algorithms needed for both the pure (Data.BTree.Pure) and impure (Data.BTree.Impure) B+-tree implementation.
Documentation
module Data.BTree.Primitives.Height
module Data.BTree.Primitives.Ids
module Data.BTree.Primitives.Index
module Data.BTree.Primitives.Key
module Data.BTree.Primitives.Leaf
module Data.BTree.Primitives.Value