Data.RTree.Base

Internal implementations. Use Data.RTree instead

Documentation

data RTree a

Instances

Functor RTree

Typeable1 RTree

Eq a => Eq (RTree a)

Show a => Show (RTree a)

Generic (RTree a)

Binary a => Binary (RTree a)

NFData a => NFData (RTree a)

empty :: RTree a

creates an empty tree

singleton :: MBB -> a -> RTree a

creates a single element tree

insert :: MBB -> a -> RTree a -> RTree a

inserts an element whith the given MBB and a value in a tree

union :: RTree a -> RTree a -> RTree a

unifies the first and the second tree into one.

lookup :: MBB -> RTree a -> Maybe a

returns the value if it exists in the tree

lookupRange :: MBB -> RTree a -> [a]

returns all values, which are located in the given bounding box.

fromList :: [(MBB, a)] -> RTree a

creates a tree out of pairs

toList :: RTree a -> [(MBB, a)]

creates a list of pairs out of a tree

toList t = zip (keys t) (values t)

delete :: MBB -> RTree a -> RTree a

Delete a key and its value from the RTree. When the key is not a member of the tree, the original tree is returned.

length :: RTree a -> Int

returns the number of elements in a tree

null :: RTree a -> Bool

returns True, if empty

null empty = True

keys :: RTree a -> [MBB]

returns all keys in this tree

toList t = zip (keys t) (values t)

values :: RTree a -> [a]

returns all values in this tree

toList t = zip (keys t) (values t)

mapMaybe :: (a -> Maybe b) -> RTree a -> RTree b

map, which also filters Nothing values

foldWithMBB :: (MBB -> a -> b) -> (MBB -> [b] -> b) -> b -> RTree a -> b

getMBB :: RTree a -> MBB

testing

pp :: Show a => RTree a -> IO ()

isValid :: Show b => b -> RTree a -> Bool

unionDistinct :: RTree a -> RTree a -> RTree a

unifies left and right RTeee. Works only, if they don't contain common keys. Much faster than union, though.

getC1 :: RTree a -> RTree a

getC2 :: RTree a -> RTree a

getC3 :: RTree a -> RTree a

getC4 :: RTree a -> RTree a