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

Index

areaData.RTree.MBB
areaIncreasesWithData.RTree.Base
containsMBBData.RTree.MBB
createNodeWithChildrenData.RTree.Base
delete 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
depthData.RTree.Base
EmptyData.RTree.Base
empty 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
foldWithMBBData.RTree.Base
fromList 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
fromList'Data.RTree.Base
getBrxData.RTree.MBB
getBryData.RTree.MBB
getC1Data.RTree.Base
getC2Data.RTree.Base
getC3Data.RTree.Base
getC4Data.RTree.Base
getChildrenData.RTree.Base
getChildren'Data.RTree.Base
getElemData.RTree.Base
getMBBData.RTree.Base
getUlxData.RTree.MBB
getUlyData.RTree.MBB
insert 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
insertWith 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
intersect 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
intersectMBBData.RTree.MBB
intersectWithKey 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
isPointMBBData.RTree.MBB
isValidData.RTree.Base
isValidMBBData.RTree.MBB
keys 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
LeafData.RTree.Base
length 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
lookup 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
lookupContainsRange 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
lookupContainsRangeWithKey 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
lookupRange 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
lookupRangeWithKey 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
mapMaybe 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
MBB 
1 (Type/Class)Data.RTree.MBB, Data.RTree, Data.RTree.Strict
2 (Data Constructor)Data.RTree.MBB
mbbData.RTree.MBB, Data.RTree, Data.RTree.Strict
nData.RTree.Base
NodeData.RTree.Base
nodeData.RTree.Base
Node2Data.RTree.Base
Node3Data.RTree.Base
Node4Data.RTree.Base
null 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
partitionData.RTree.Base
ppData.RTree.Base
RTree 
1 (Type/Class)Data.RTree.Base, Data.RTree
2 (Type/Class)Data.RTree.Strict
singleton 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
splitNodeData.RTree.Base
toLazyData.RTree.Strict
toList 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
toStrictData.RTree.Strict
union 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
unionDistinctData.RTree.Base
unionDistinctSplitData.RTree.Base
unionDistinctWithData.RTree.Base
unionMBBData.RTree.MBB
unionMBB'Data.RTree.Base
unionsMBBData.RTree.MBB
unionWith 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict
values 
1 (Function)Data.RTree.Base, Data.RTree
2 (Function)Data.RTree.Strict