Data.Geometry.Geos.STRTree

A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data.

The STR packed R-tree is simple to implement and maximizes space utilization; that is, as many leaves as possible are filled to capacity. Overlap between nodes is far less than in a basic R-tree. However, once the tree has been built (explicitly or on the first call to query), items may not be added or removed.

Described in: P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With Application To GIS. Morgan Kaufmann, San Francisco, 2002.

Documentation

foldr :: Storable a => (a -> b -> b) -> b -> STRTree a -> b

toList :: Storable a => STRTree a -> [a]

toVector :: Storable a => STRTree a -> Vector a

fromList :: Storable b => [(Geometry a, b)] -> STRTree b

unfoldr_ :: Storable a => Int -> (b -> Maybe ((Geometry g, a), b)) -> b -> STRTree a

unfoldr :: Storable a => (b -> Maybe ((Geometry g, a), b)) -> b -> STRTree a

fromFoldable :: (Foldable f, Storable b) => f (Geometry a, b) -> STRTree b

fromFoldable creates an STRTree with a default node capacity of 10. For finer-grained control over the node capacity, fromFoldable_ accepts a node-capacity argument.

fromFoldable_ :: (Foldable f, Storable b) => Int -> f (Geometry a, b) -> STRTree b

lookup :: Storable b => Geometry a -> STRTree b -> Vector b

Queries the index for all items whose extents intersect the given search Envelope. Note that some kinds of indexes may also return objects which do not in fact intersect the query envelope.

data STRTree a

A query-only data structure

Instances

STRTreeLike STRTree

Methods

withSTRTree :: STRTree a -> (Ptr GEOSSTRTree -> IO b) -> IO b

Eq (STRTree a)

Methods

(==) :: STRTree a -> STRTree a -> Bool

(/=) :: STRTree a -> STRTree a -> Bool

Show (STRTree a)

Methods

showsPrec :: Int -> STRTree a -> ShowS

show :: STRTree a -> String

showList :: [STRTree a] -> ShowS