Safe Haskell	None
Language	Haskell2010

Data.Geometry.Geos.Types

Synopsis

Documentation

class Relatable a where Source #

Minimal complete definition

contains, coveredBy, covers, crosses, disjoint, intersects, overlaps, touches, within

Methods

contains :: a -> Geometry b -> Bool Source #

coveredBy :: a -> Geometry b -> Bool Source #

covers :: a -> Geometry b -> Bool Source #

crosses :: a -> Geometry b -> Bool Source #

Returns True if the DE-9IM intersection matrix for the two Geometries is T*T****** (for a point and a curve,a point and an area or a line and an area) 0******** (for two curves).

disjoint :: a -> Geometry b -> Bool Source #

Returns True if the DE-9IM intersection matrix for the two geometries is FF*FF****.

intersects :: a -> Geometry b -> Bool Source #

Returns True if disjoint is False.

overlaps :: a -> Geometry b -> Bool Source #

Returns true if the DE-9IM intersection matrix for the two geometries is T*T***T** (for two points or two surfaces) 1*T***T** (for two curves).

touches :: a -> Geometry b -> Bool Source #

Returns True if the DE-9IM intersection matrix for the two geometries is FT*******, F**T***** or F***T****.

within :: a -> Geometry b -> Bool Source #

Returns True if the DE-9IM intersection matrix for the two geometries is T*F**F***.

type SRID = Maybe Int Source #

data Some :: (* -> *) -> * where Source #

Constructors

Some :: f a -> Some f

Instances

Show (Some Geometry) Source #
Methods showsPrec :: Int -> Some Geometry -> ShowS # show :: Some Geometry -> String # showList :: [Some Geometry] -> ShowS #

withSomeGeometry :: Some Geometry -> (forall a. Geometry a -> b) -> b Source #

data Geometry a where Source #

Constructors

PointGeometry :: Point -> SRID -> Geometry Point
LineStringGeometry :: LineString -> SRID -> Geometry LineString
LinearRingGeometry :: LinearRing -> SRID -> Geometry LinearRing
PolygonGeometry :: Polygon -> SRID -> Geometry Polygon
MultiPointGeometry :: MultiPoint -> SRID -> Geometry MultiPoint
MultiLineStringGeometry :: MultiLineString -> SRID -> Geometry MultiLineString
MultiPolygonGeometry :: MultiPolygon -> SRID -> Geometry MultiPolygon

Instances

Eq (Geometry a) Source #
Methods (==) :: Geometry a -> Geometry a -> Bool # (/=) :: Geometry a -> Geometry a -> Bool #
Show (Geometry a) Source #
Methods showsPrec :: Int -> Geometry a -> ShowS # show :: Geometry a -> String # showList :: [Geometry a] -> ShowS #
Show (Some Geometry) Source #
Methods showsPrec :: Int -> Some Geometry -> ShowS # show :: Some Geometry -> String # showList :: [Some Geometry] -> ShowS #

data Coordinate Source #

Constructors

Coordinate2 !Double !Double
Coordinate3 !Double !Double !Double

Instances

Eq Coordinate Source #
Methods (==) :: Coordinate -> Coordinate -> Bool # (/=) :: Coordinate -> Coordinate -> Bool #
Data Coordinate Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Coordinate -> c Coordinate # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Coordinate # toConstr :: Coordinate -> Constr # dataTypeOf :: Coordinate -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c Coordinate) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Coordinate) # gmapT :: (forall b. Data b => b -> b) -> Coordinate -> Coordinate # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Coordinate -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Coordinate -> r # gmapQ :: (forall d. Data d => d -> u) -> Coordinate -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Coordinate -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Coordinate -> m Coordinate # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Coordinate -> m Coordinate # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Coordinate -> m Coordinate #
Ord Coordinate Source #
Methods compare :: Coordinate -> Coordinate -> Ordering # (<) :: Coordinate -> Coordinate -> Bool # (<=) :: Coordinate -> Coordinate -> Bool # (>) :: Coordinate -> Coordinate -> Bool # (>=) :: Coordinate -> Coordinate -> Bool # max :: Coordinate -> Coordinate -> Coordinate # min :: Coordinate -> Coordinate -> Coordinate #
Read Coordinate Source #
Methods readsPrec :: Int -> ReadS Coordinate # readList :: ReadS [Coordinate] # readPrec :: ReadPrec Coordinate # readListPrec :: ReadPrec [Coordinate] #
Show Coordinate Source #
Methods showsPrec :: Int -> Coordinate -> ShowS # show :: Coordinate -> String # showList :: [Coordinate] -> ShowS #

dimensionsCoordinate :: Coordinate -> Int Source #

type CoordinateSequence = Vector Coordinate Source #

dimensionsCoordinateSequence :: CoordinateSequence -> Int Source #

newtype Point Source #

Constructors

Point Coordinate

Instances

Eq Point Source #
Methods (==) :: Point -> Point -> Bool # (/=) :: Point -> Point -> Bool #
Data Point Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Point -> c Point # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Point # toConstr :: Point -> Constr # dataTypeOf :: Point -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c Point) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Point) # gmapT :: (forall b. Data b => b -> b) -> Point -> Point # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Point -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Point -> r # gmapQ :: (forall d. Data d => d -> u) -> Point -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Point -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Point -> m Point # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Point -> m Point # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Point -> m Point #
Ord Point Source #
Methods compare :: Point -> Point -> Ordering # (<) :: Point -> Point -> Bool # (<=) :: Point -> Point -> Bool # (>) :: Point -> Point -> Bool # (>=) :: Point -> Point -> Bool # max :: Point -> Point -> Point # min :: Point -> Point -> Point #
Read Point Source #
Methods readsPrec :: Int -> ReadS Point # readList :: ReadS [Point] # readPrec :: ReadPrec Point # readListPrec :: ReadPrec [Point] #
Show Point Source #
Methods showsPrec :: Int -> Point -> ShowS # show :: Point -> String # showList :: [Point] -> ShowS #

newtype LinearRing Source #

Constructors

LinearRing CoordinateSequence

Instances

Eq LinearRing Source #
Methods (==) :: LinearRing -> LinearRing -> Bool # (/=) :: LinearRing -> LinearRing -> Bool #
Data LinearRing Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LinearRing -> c LinearRing # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LinearRing # toConstr :: LinearRing -> Constr # dataTypeOf :: LinearRing -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c LinearRing) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LinearRing) # gmapT :: (forall b. Data b => b -> b) -> LinearRing -> LinearRing # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LinearRing -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LinearRing -> r # gmapQ :: (forall d. Data d => d -> u) -> LinearRing -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LinearRing -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LinearRing -> m LinearRing # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LinearRing -> m LinearRing # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LinearRing -> m LinearRing #
Ord LinearRing Source #
Methods compare :: LinearRing -> LinearRing -> Ordering # (<) :: LinearRing -> LinearRing -> Bool # (<=) :: LinearRing -> LinearRing -> Bool # (>) :: LinearRing -> LinearRing -> Bool # (>=) :: LinearRing -> LinearRing -> Bool # max :: LinearRing -> LinearRing -> LinearRing # min :: LinearRing -> LinearRing -> LinearRing #
Read LinearRing Source #
Methods readsPrec :: Int -> ReadS LinearRing # readList :: ReadS [LinearRing] # readPrec :: ReadPrec LinearRing # readListPrec :: ReadPrec [LinearRing] #
Show LinearRing Source #
Methods showsPrec :: Int -> LinearRing -> ShowS # show :: LinearRing -> String # showList :: [LinearRing] -> ShowS #
Monoid LinearRing Source #
Methods mempty :: LinearRing # mappend :: LinearRing -> LinearRing -> LinearRing # mconcat :: [LinearRing] -> LinearRing #

newtype LineString Source #

Constructors

LineString CoordinateSequence

Instances

Eq LineString Source #
Methods (==) :: LineString -> LineString -> Bool # (/=) :: LineString -> LineString -> Bool #
Data LineString Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LineString -> c LineString # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LineString # toConstr :: LineString -> Constr # dataTypeOf :: LineString -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c LineString) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LineString) # gmapT :: (forall b. Data b => b -> b) -> LineString -> LineString # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LineString -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LineString -> r # gmapQ :: (forall d. Data d => d -> u) -> LineString -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LineString -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LineString -> m LineString # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LineString -> m LineString # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LineString -> m LineString #
Ord LineString Source #
Methods compare :: LineString -> LineString -> Ordering # (<) :: LineString -> LineString -> Bool # (<=) :: LineString -> LineString -> Bool # (>) :: LineString -> LineString -> Bool # (>=) :: LineString -> LineString -> Bool # max :: LineString -> LineString -> LineString # min :: LineString -> LineString -> LineString #
Read LineString Source #
Methods readsPrec :: Int -> ReadS LineString # readList :: ReadS [LineString] # readPrec :: ReadPrec LineString # readListPrec :: ReadPrec [LineString] #
Show LineString Source #
Methods showsPrec :: Int -> LineString -> ShowS # show :: LineString -> String # showList :: [LineString] -> ShowS #
Monoid LineString Source #
Methods mempty :: LineString # mappend :: LineString -> LineString -> LineString # mconcat :: [LineString] -> LineString #

newtype Polygon Source #

In a polygon, the fist LinearRing is the shell, and any following are holes.

Constructors

Polygon (Vector LinearRing)

Instances

Eq Polygon Source #
Methods (==) :: Polygon -> Polygon -> Bool # (/=) :: Polygon -> Polygon -> Bool #
Data Polygon Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Polygon -> c Polygon # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Polygon # toConstr :: Polygon -> Constr # dataTypeOf :: Polygon -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c Polygon) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Polygon) # gmapT :: (forall b. Data b => b -> b) -> Polygon -> Polygon # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Polygon -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Polygon -> r # gmapQ :: (forall d. Data d => d -> u) -> Polygon -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Polygon -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Polygon -> m Polygon # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Polygon -> m Polygon # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Polygon -> m Polygon #
Ord Polygon Source #
Methods compare :: Polygon -> Polygon -> Ordering # (<) :: Polygon -> Polygon -> Bool # (<=) :: Polygon -> Polygon -> Bool # (>) :: Polygon -> Polygon -> Bool # (>=) :: Polygon -> Polygon -> Bool # max :: Polygon -> Polygon -> Polygon # min :: Polygon -> Polygon -> Polygon #
Read Polygon Source #
Methods readsPrec :: Int -> ReadS Polygon # readList :: ReadS [Polygon] # readPrec :: ReadPrec Polygon # readListPrec :: ReadPrec [Polygon] #
Show Polygon Source #
Methods showsPrec :: Int -> Polygon -> ShowS # show :: Polygon -> String # showList :: [Polygon] -> ShowS #

newtype MultiPoint Source #

Constructors

MultiPoint (Vector Point)

Instances

Eq MultiPoint Source #
Methods (==) :: MultiPoint -> MultiPoint -> Bool # (/=) :: MultiPoint -> MultiPoint -> Bool #
Data MultiPoint Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MultiPoint -> c MultiPoint # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MultiPoint # toConstr :: MultiPoint -> Constr # dataTypeOf :: MultiPoint -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c MultiPoint) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MultiPoint) # gmapT :: (forall b. Data b => b -> b) -> MultiPoint -> MultiPoint # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MultiPoint -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MultiPoint -> r # gmapQ :: (forall d. Data d => d -> u) -> MultiPoint -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MultiPoint -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MultiPoint -> m MultiPoint # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MultiPoint -> m MultiPoint # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MultiPoint -> m MultiPoint #
Ord MultiPoint Source #
Methods compare :: MultiPoint -> MultiPoint -> Ordering # (<) :: MultiPoint -> MultiPoint -> Bool # (<=) :: MultiPoint -> MultiPoint -> Bool # (>) :: MultiPoint -> MultiPoint -> Bool # (>=) :: MultiPoint -> MultiPoint -> Bool # max :: MultiPoint -> MultiPoint -> MultiPoint # min :: MultiPoint -> MultiPoint -> MultiPoint #
Read MultiPoint Source #
Methods readsPrec :: Int -> ReadS MultiPoint # readList :: ReadS [MultiPoint] # readPrec :: ReadPrec MultiPoint # readListPrec :: ReadPrec [MultiPoint] #
Show MultiPoint Source #
Methods showsPrec :: Int -> MultiPoint -> ShowS # show :: MultiPoint -> String # showList :: [MultiPoint] -> ShowS #
Monoid MultiPoint Source #
Methods mempty :: MultiPoint # mappend :: MultiPoint -> MultiPoint -> MultiPoint # mconcat :: [MultiPoint] -> MultiPoint #

newtype MultiLineString Source #

Constructors

MultiLineString (Vector LineString)

Instances

Eq MultiLineString Source #
Methods (==) :: MultiLineString -> MultiLineString -> Bool # (/=) :: MultiLineString -> MultiLineString -> Bool #
Data MultiLineString Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MultiLineString -> c MultiLineString # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MultiLineString # toConstr :: MultiLineString -> Constr # dataTypeOf :: MultiLineString -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c MultiLineString) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MultiLineString) # gmapT :: (forall b. Data b => b -> b) -> MultiLineString -> MultiLineString # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MultiLineString -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MultiLineString -> r # gmapQ :: (forall d. Data d => d -> u) -> MultiLineString -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MultiLineString -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MultiLineString -> m MultiLineString # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MultiLineString -> m MultiLineString # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MultiLineString -> m MultiLineString #
Ord MultiLineString Source #
Methods compare :: MultiLineString -> MultiLineString -> Ordering # (<) :: MultiLineString -> MultiLineString -> Bool # (<=) :: MultiLineString -> MultiLineString -> Bool # (>) :: MultiLineString -> MultiLineString -> Bool # (>=) :: MultiLineString -> MultiLineString -> Bool # max :: MultiLineString -> MultiLineString -> MultiLineString # min :: MultiLineString -> MultiLineString -> MultiLineString #
Read MultiLineString Source #
Methods readsPrec :: Int -> ReadS MultiLineString # readList :: ReadS [MultiLineString] # readPrec :: ReadPrec MultiLineString # readListPrec :: ReadPrec [MultiLineString] #
Show MultiLineString Source #
Methods showsPrec :: Int -> MultiLineString -> ShowS # show :: MultiLineString -> String # showList :: [MultiLineString] -> ShowS #

newtype MultiPolygon Source #

Constructors

MultiPolygon (Vector Polygon)

Instances

Eq MultiPolygon Source #
Methods (==) :: MultiPolygon -> MultiPolygon -> Bool # (/=) :: MultiPolygon -> MultiPolygon -> Bool #
Data MultiPolygon Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MultiPolygon -> c MultiPolygon # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MultiPolygon # toConstr :: MultiPolygon -> Constr # dataTypeOf :: MultiPolygon -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c MultiPolygon) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MultiPolygon) # gmapT :: (forall b. Data b => b -> b) -> MultiPolygon -> MultiPolygon # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MultiPolygon -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MultiPolygon -> r # gmapQ :: (forall d. Data d => d -> u) -> MultiPolygon -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MultiPolygon -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MultiPolygon -> m MultiPolygon # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MultiPolygon -> m MultiPolygon # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MultiPolygon -> m MultiPolygon #
Ord MultiPolygon Source #
Methods compare :: MultiPolygon -> MultiPolygon -> Ordering # (<) :: MultiPolygon -> MultiPolygon -> Bool # (<=) :: MultiPolygon -> MultiPolygon -> Bool # (>) :: MultiPolygon -> MultiPolygon -> Bool # (>=) :: MultiPolygon -> MultiPolygon -> Bool # max :: MultiPolygon -> MultiPolygon -> MultiPolygon # min :: MultiPolygon -> MultiPolygon -> MultiPolygon #
Read MultiPolygon Source #
Methods readsPrec :: Int -> ReadS MultiPolygon # readList :: ReadS [MultiPolygon] # readPrec :: ReadPrec MultiPolygon # readListPrec :: ReadPrec [MultiPolygon] #
Show MultiPolygon Source #
Methods showsPrec :: Int -> MultiPolygon -> ShowS # show :: MultiPolygon -> String # showList :: [MultiPolygon] -> ShowS #