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

Index

AllocMData.BTree.Alloc.Class, Data.BTree.Alloc
allocNodeData.BTree.Alloc.Class, Data.BTree.Alloc
allocOverflowData.BTree.Alloc.Class, Data.BTree.Alloc
AllocReaderMData.BTree.Alloc.Class, Data.BTree.Alloc
bindIndexData.BTree.Primitives.Index, Data.BTree.Primitives
bindIndexMData.BTree.Primitives.Index, Data.BTree.Primitives
castNodeData.BTree.Impure.Structures
castNode'Data.BTree.Impure.Structures
castValueData.BTree.Impure.Structures
DebugT 
1 (Type/Class)Data.BTree.Alloc.Debug
2 (Data Constructor)Data.BTree.Alloc.Debug
decrHeightData.BTree.Primitives.Height, Data.BTree.Primitives
deleteData.BTree.Pure
deleteRecData.BTree.Impure.Delete
deleteTreeData.BTree.Impure.Delete, Data.BTree.Impure
distributeData.BTree.Primitives.Index, Data.BTree.Primitives
empty 
1 (Function)Data.BTree.Pure
2 (Function)Data.BTree.Impure
emptyPagesData.BTree.Alloc.Debug
evalDebugData.BTree.Alloc.Debug
extendedIndexData.BTree.Primitives.Index, Data.BTree.Primitives
extendIndexPredData.BTree.Primitives.Index, Data.BTree.Primitives
findWithDefaultData.BTree.Pure
fixedSizeData.BTree.Primitives.Value, Data.BTree.Primitives
fixUpData.BTree.Impure.Insert
foldMapData.BTree.Impure.Fold, Data.BTree.Impure
foldrData.BTree.Impure.Fold, Data.BTree.Impure
foldrIdWithKeyMData.BTree.Impure.Fold
foldrLeafItemsWithKeyMData.BTree.Impure.Fold
foldrMData.BTree.Impure.Fold, Data.BTree.Impure
foldrNodeWithKeyMData.BTree.Impure.Fold
foldrWithKey 
1 (Function)Data.BTree.Pure
2 (Function)Data.BTree.Impure.Fold, Data.BTree.Impure
foldrWithKeyMData.BTree.Impure.Fold, Data.BTree.Impure
freeNodeData.BTree.Alloc.Class, Data.BTree.Alloc
freeOverflowData.BTree.Alloc.Class, Data.BTree.Alloc
fromHeightData.BTree.Primitives.Height, Data.BTree.Primitives
fromLeafItemsData.BTree.Impure.Overflow
fromLeafValueData.BTree.Impure.Overflow
fromList 
1 (Function)Data.BTree.Pure
2 (Function)Data.BTree.Impure
fromMapData.BTree.Impure
fromNodeIdData.BTree.Primitives.Ids, Data.BTree.Primitives
fromNonEmptyListData.BTree.Impure.NonEmpty
fromPageCountData.BTree.Primitives.Ids, Data.BTree.Primitives
fromPageIdData.BTree.Primitives.Ids, Data.BTree.Primitives
fromPageSizeData.BTree.Primitives.Ids, Data.BTree.Primitives
fromSingletonIndexData.BTree.Primitives.Index, Data.BTree.Primitives
fromTreeData.BTree.Impure.NonEmpty
fromTxIdData.BTree.Primitives.Ids, Data.BTree.Primitives
getIndexNodeData.BTree.Impure.Structures
getLeafNodeData.BTree.Impure.Structures
getSomeNodeData.BTree.Alloc.Debug
getSomeValData.BTree.Alloc.Debug
Height 
1 (Type/Class)Data.BTree.Primitives.Height, Data.BTree.Primitives
2 (Data Constructor)Data.BTree.Primitives.Height, Data.BTree.Primitives
Idx 
1 (Data Constructor)Data.BTree.Pure
2 (Data Constructor)Data.BTree.Impure.Structures, Data.BTree.Impure, Data.BTree.Impure.NonEmpty
idxChildren 
1 (Function)Data.BTree.Pure
2 (Function)Data.BTree.Impure.Structures, Data.BTree.Impure, Data.BTree.Impure.NonEmpty
incrHeightData.BTree.Primitives.Height, Data.BTree.Primitives
Index 
1 (Type/Class)Data.BTree.Primitives.Index, Data.BTree.Primitives
2 (Data Constructor)Data.BTree.Primitives.Index, Data.BTree.Primitives
IndexCtx 
1 (Type/Class)Data.BTree.Primitives.Index, Data.BTree.Primitives
2 (Data Constructor)Data.BTree.Primitives.Index, Data.BTree.Primitives
indexCtxLeftKeysData.BTree.Primitives.Index, Data.BTree.Primitives
indexCtxLeftValsData.BTree.Primitives.Index, Data.BTree.Primitives
indexCtxRightKeysData.BTree.Primitives.Index, Data.BTree.Primitives
indexCtxRightValsData.BTree.Primitives.Index, Data.BTree.Primitives
indexFromListData.BTree.Primitives.Index, Data.BTree.Primitives
indexNumKeysData.BTree.Primitives.Index, Data.BTree.Primitives
indexNumValsData.BTree.Primitives.Index, Data.BTree.Primitives
insertData.BTree.Pure
insertManyData.BTree.Pure
insertNonEmptyTreeData.BTree.Impure.NonEmpty
insertNonEmptyTreeManyData.BTree.Impure.NonEmpty
insertRecData.BTree.Impure.Insert
insertRecManyData.BTree.Impure.Insert
insertTreeData.BTree.Impure.Insert, Data.BTree.Impure
insertTreeManyData.BTree.Impure.Insert, Data.BTree.Impure
KeyData.BTree.Primitives.Key, Data.BTree.Primitives
KeyTooLargeError 
1 (Type/Class)Data.BTree.Primitives.Exception
2 (Data Constructor)Data.BTree.Primitives.Exception
Leaf 
1 (Data Constructor)Data.BTree.Pure
2 (Data Constructor)Data.BTree.Impure.Structures, Data.BTree.Impure, Data.BTree.Impure.NonEmpty
LeafItemsData.BTree.Impure.Structures
leafItems 
1 (Function)Data.BTree.Pure
2 (Function)Data.BTree.Impure.Structures, Data.BTree.Impure, Data.BTree.Impure.NonEmpty
LeafValueData.BTree.Impure.Structures
leftViewData.BTree.Primitives.Index, Data.BTree.Primitives
lookupData.BTree.Pure
lookupMaxTreeData.BTree.Impure.Lookup, Data.BTree.Impure
lookupMinTreeData.BTree.Impure.Lookup, Data.BTree.Impure
lookupRecData.BTree.Impure.Lookup
lookupTreeData.BTree.Impure.Lookup, Data.BTree.Impure
maxFanoutData.BTree.Pure.Setup, Data.BTree.Pure
maxIdxKeysData.BTree.Pure.Setup, Data.BTree.Pure
maxKeySizeData.BTree.Alloc.Class, Data.BTree.Alloc
maxLeafItemsData.BTree.Pure.Setup, Data.BTree.Pure
maxPageSizeData.BTree.Alloc.Class, Data.BTree.Alloc
maxValueSizeData.BTree.Alloc.Class, Data.BTree.Alloc
memberData.BTree.Pure
mergeIndexData.BTree.Primitives.Index, Data.BTree.Primitives
mergeNodesData.BTree.Impure.Delete
minFanout 
1 (Function)Data.BTree.Pure.Setup, Data.BTree.Pure
2 (Function)Data.BTree.Impure.Setup
minIdxKeys 
1 (Function)Data.BTree.Pure.Setup, Data.BTree.Pure
2 (Function)Data.BTree.Impure.Setup
minLeafItems 
1 (Function)Data.BTree.Pure.Setup, Data.BTree.Pure
2 (Function)Data.BTree.Impure.Setup
narrowData.BTree.Primitives.Key, Data.BTree.Primitives
NatData.BTree.Primitives.Height, Data.BTree.Primitives
Node 
1 (Type/Class)Data.BTree.Pure
2 (Type/Class)Data.BTree.Impure.Structures, Data.BTree.Impure, Data.BTree.Impure.NonEmpty
NodeId 
1 (Type/Class)Data.BTree.Primitives.Ids, Data.BTree.Primitives
2 (Data Constructor)Data.BTree.Primitives.Ids, Data.BTree.Primitives
nodeIdToPageIdData.BTree.Primitives.Ids, Data.BTree.Primitives
nodeNeedsMergeData.BTree.Impure.Delete
nodePageSizeData.BTree.Alloc.Class, Data.BTree.Alloc
nonEmptyToListData.BTree.Impure.NonEmpty
NonEmptyTree 
1 (Type/Class)Data.BTree.Impure.NonEmpty
2 (Data Constructor)Data.BTree.Impure.NonEmpty
notMemberData.BTree.Pure
nullData.BTree.Pure
OverflowIdData.BTree.Primitives.Ids, Data.BTree.Primitives
OverflowValueData.BTree.Impure.Structures
PageCount 
1 (Type/Class)Data.BTree.Primitives.Ids, Data.BTree.Primitives
2 (Data Constructor)Data.BTree.Primitives.Ids, Data.BTree.Primitives
PageId 
1 (Type/Class)Data.BTree.Primitives.Ids, Data.BTree.Primitives
2 (Data Constructor)Data.BTree.Primitives.Ids, Data.BTree.Primitives
pageIdToNodeIdData.BTree.Primitives.Ids, Data.BTree.Primitives
Pages 
1 (Type/Class)Data.BTree.Alloc.Debug
2 (Data Constructor)Data.BTree.Alloc.Debug
PageSize 
1 (Type/Class)Data.BTree.Primitives.Ids, Data.BTree.Primitives
2 (Data Constructor)Data.BTree.Primitives.Ids, Data.BTree.Primitives
pagesNodesData.BTree.Alloc.Debug
pagesOverflowData.BTree.Alloc.Debug
putIdxData.BTree.Primitives.Index, Data.BTree.Primitives
putIndexNodeData.BTree.Impure.Structures
putLeafNodeData.BTree.Impure.Structures
putValData.BTree.Primitives.Index, Data.BTree.Primitives
RawValueData.BTree.Impure.Structures
readNodeData.BTree.Alloc.Class, Data.BTree.Alloc
readOverflowData.BTree.Alloc.Class, Data.BTree.Alloc
rightViewData.BTree.Primitives.Index, Data.BTree.Primitives
runDebugData.BTree.Alloc.Debug
runDebugTData.BTree.Alloc.Debug
SData.BTree.Primitives.Height, Data.BTree.Primitives
setupWithMinimumDegreeOfData.BTree.Pure.Setup, Data.BTree.Pure
singletonData.BTree.Pure
singletonIndexData.BTree.Primitives.Index, Data.BTree.Primitives
sizeData.BTree.Pure
SomeNode 
1 (Type/Class)Data.BTree.Alloc.Debug
2 (Data Constructor)Data.BTree.Alloc.Debug
SomeVal 
1 (Type/Class)Data.BTree.Alloc.Debug
2 (Data Constructor)Data.BTree.Alloc.Debug
splitIndexData.BTree.Impure.Insert
splitIndexAtData.BTree.Primitives.Index, Data.BTree.Primitives
splitLeafData.BTree.Impure.Insert
splitLeafManyData.BTree.Primitives.Leaf, Data.BTree.Primitives
splitLeafManyPredData.BTree.Primitives.Leaf, Data.BTree.Primitives
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
UHeightData.BTree.Primitives.Height, Data.BTree.Primitives
USuccData.BTree.Primitives.Height, Data.BTree.Primitives
UZeroData.BTree.Primitives.Height, Data.BTree.Primitives
validIndexData.BTree.Primitives.Index, Data.BTree.Primitives
validIndexSizeData.BTree.Primitives.Index, Data.BTree.Primitives
ValueData.BTree.Primitives.Value, Data.BTree.Primitives
valViewData.BTree.Primitives.Index, Data.BTree.Primitives
valViewMaxData.BTree.Primitives.Index, Data.BTree.Primitives
valViewMinData.BTree.Primitives.Index, Data.BTree.Primitives
viewHeightData.BTree.Primitives.Height, Data.BTree.Primitives
ZData.BTree.Primitives.Height, Data.BTree.Primitives
zeroHeightData.BTree.Primitives.Height, Data.BTree.Primitives