data-r-tree-0.0.1.0: R-Tree is a spartial data structure similar to Quadtrees or B-Trees.

Index

areaData.RTree.MBB
containsMBBData.RTree.MBB
deleteData.RTree.Base, Data.RTree
emptyData.RTree.Base, Data.RTree
foldWithMBBData.RTree.Base
fromListData.RTree.Base, Data.RTree
getBrxData.RTree.MBB
getBryData.RTree.MBB
getC1Data.RTree.Base
getC2Data.RTree.Base
getC3Data.RTree.Base
getC4Data.RTree.Base
getMBBData.RTree.Base
getUlxData.RTree.MBB
getUlyData.RTree.MBB
insertData.RTree.Base, Data.RTree
intersectMBBData.RTree.MBB
isValidData.RTree.Base
keysData.RTree.Base, Data.RTree
lengthData.RTree.Base, Data.RTree
lookupData.RTree.Base, Data.RTree
lookupRangeData.RTree.Base, Data.RTree
mapMaybeData.RTree.Base
MBB 
1 (Type/Class)Data.RTree.MBB, Data.RTree
2 (Data Constructor)Data.RTree.MBB
mbbData.RTree.MBB, Data.RTree
nullData.RTree.Base, Data.RTree
ppData.RTree.Base
RTreeData.RTree.Base, Data.RTree
singletonData.RTree.Base, Data.RTree
toListData.RTree.Base, Data.RTree
unionData.RTree.Base, Data.RTree
unionDistinctData.RTree.Base
unionMBBData.RTree.MBB
valuesData.RTree.Base, Data.RTree