GiST-0.0.1: A Haskell implementation of a Generalized Search Tree (GiST)

Index

betweenData.GiST.BTree
consistentData.GiST.GiST
Contains 
1 (Data Constructor)Data.GiST.BTree
2 (Data Constructor)Data.GiST.RTree
deleteData.GiST.GiST
emptyData.GiST.GiST
EntryData.GiST.GiST
entryPredicateData.GiST.GiST
Equals 
1 (Data Constructor)Data.GiST.BTree
2 (Data Constructor)Data.GiST.RTree
getDataData.GiST.GiST
GiSTData.GiST.GiST
insertData.GiST.GiST
LeafEntry 
1 (Type/Class)Data.GiST.GiST
2 (Data Constructor)Data.GiST.GiST
loadData.GiST.GiST
NodeEntry 
1 (Type/Class)Data.GiST.GiST
2 (Data Constructor)Data.GiST.GiST
PenaltyData.GiST.GiST
penaltyData.GiST.GiST
pickSplitData.GiST.GiST
Predicate 
1 (Type/Class)Data.GiST.BTree
2 (Type/Class)Data.GiST.RTree
PredicatesData.GiST.GiST
saveData.GiST.GiST
searchData.GiST.GiST
sizeData.GiST.GiST
unionData.GiST.GiST