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

Index - T

throwData.BTree.Primitives.Exception
toLeafItemsData.BTree.Impure.Overflow
toLeafValueData.BTree.Impure.Overflow
toList 
1 (Function)Data.BTree.Pure
2 (Function)Data.BTree.Impure.Fold, Data.BTree.Impure
toTreeData.BTree.Impure.NonEmpty
Tree 
1 (Type/Class)Data.BTree.Pure
2 (Data Constructor)Data.BTree.Pure
3 (Type/Class)Data.BTree.Impure.Structures, Data.BTree.Impure
4 (Data Constructor)Data.BTree.Impure.Structures, Data.BTree.Impure
TreeAlgorithmError 
1 (Type/Class)Data.BTree.Primitives.Exception
2 (Data Constructor)Data.BTree.Primitives.Exception
treeHeight 
1 (Function)Data.BTree.Impure.Structures, Data.BTree.Impure
2 (Function)Data.BTree.Impure.NonEmpty
treeRootId 
1 (Function)Data.BTree.Impure.Structures, Data.BTree.Impure
2 (Function)Data.BTree.Impure.NonEmpty
TreeSetup 
1 (Type/Class)Data.BTree.Pure.Setup, Data.BTree.Pure
2 (Data Constructor)Data.BTree.Pure.Setup, Data.BTree.Pure
twoThreeSetupData.BTree.Pure.Setup, Data.BTree.Pure
TxId 
1 (Type/Class)Data.BTree.Primitives.Ids, Data.BTree.Primitives
2 (Data Constructor)Data.BTree.Primitives.Ids, Data.BTree.Primitives