Safe Haskell | None |
---|---|
Language | Haskell2010 |
- class STRTreeLike t where
- newtype STRTree a = STRTree (ForeignPtr GEOSSTRTree)
- newtype STRTreeBuilder a = STRTreeBuilder (ForeignPtr GEOSSTRTree)
- type Finalizer a b = Ptr a -> Ptr b -> IO ()
- wrap2 :: (Ptr a -> Ptr () -> IO ()) -> IO (GEOSQueryCallback a)
- unwrap :: FunPtr (Finalizer a b) -> Finalizer a b
- createSTRTreeBuilder :: Int -> Geos (STRTreeBuilder a)
- build :: STRTreeBuilder a -> Geos (STRTree a)
- insert :: (Storable b, Geometry a) => STRTreeBuilder b -> a -> b -> Geos ()
- foldr :: (STRTreeLike t, Storable a) => (a -> b -> b) -> b -> t a -> Geos b
- query :: (Storable b, Geometry a) => STRTree b -> a -> Geos (Vector b)
Documentation
class STRTreeLike t where Source #
withSTRTree :: t a -> (Ptr GEOSSTRTree -> IO b) -> IO b Source #
A query-only data structure
newtype STRTreeBuilder a Source #
A mutable data structure. Must build
into an STRTree before querying.
createSTRTreeBuilder :: Int -> Geos (STRTreeBuilder a) Source #
Create a new R-tree using the Sort-Tile-Recursive algorithm (STRtree) for two-dimensional spatial data.
@param nodeCapacity the maximum number of child nodes that a node may have. The minimum recommended capacity value is 4. If unsure, use a default node capacity of 10.
build :: STRTreeBuilder a -> Geos (STRTree a) Source #
Builds the STRTree by performing a trivial query on it.