vectortiles-1.0.0: Geography/VectorTile.hs
{-# LANGUAGE StrictData #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE DeriveGeneric #-}
-- |
-- Module : Geography.VectorTile
-- Copyright : (c) Azavea, 2016
-- License : Apache 2
-- Maintainer: Colin Woodbury <cwoodbury@azavea.com>
--
-- GIS Vector Tiles, as defined by Mapbox.
--
-- This library implements version 2.1 of the official Mapbox spec, as defined
-- here: https://github.com/mapbox/vector-tile-spec/tree/master/2.1
--
-- Note that currently this library ignores top-level protobuf extensions,
-- /Value/ extensions, and /UNKNOWN/ geometries.
--
-- The order in which to explore the modules of this library is as follows:
--
-- 1. "Geography.VectorTile" (here)
-- 2. "Geography.VectorTile.Geometry"
-- 3. "Geography.VectorTile.Raw"
--
-- == Usage
--
-- This library reads and writes strict `ByteString`s. Given some legal
-- VectorTile file called @roads.mvt@:
--
-- > import qualified Data.ByteString as BS
-- > import Data.Text (Text)
-- > import Geography.VectorTile
-- > import qualified Geography.VectorTile.Raw as R
-- >
-- > -- | Read in raw protobuf data and decode it into a high-level type.
-- > roads :: IO (Either Text VectorTile)
-- > roads = do
-- > mvt <- BS.readFile "roads.mvt"
-- > pure $ R.decode mvt >>= tile
--
-- Or encode a `VectorTile` back into a `ByteString`:
--
-- > roadsBytes :: VectorTile -> BS.ByteString
-- > roadsBytes = R.encode . untile
module Geography.VectorTile
( -- * Types
VectorTile(..)
, Layer(..)
, Feature(..)
, Val(..)
-- * Protobuf Conversions
-- ** From Protobuf
-- | Generally the `tile` function is the only one needed here. Usage:
--
-- > import qualified Geography.VectorTile.Raw as R
-- >
-- > R.decode someBytes >>= tile
--
-- Note that since the "Data.ProtocolBuffers" library does not handle default
-- values, we handle those specifically defined in /vector_tile.proto/
-- explicitely here. See:
--
-- https://github.com/mapbox/vector-tile-spec/blob/master/2.1/vector_tile.proto
, tile
, layer
, features
, value
-- ** To Protobuf
-- | To convert from high-level data back into a form that can be encoded
-- into raw protobuf bytes, use:
--
-- > import qualified Geography.VectorTile.Raw as R
-- >
-- > R.encode $ untile someTile
--
-- This is a pure process and will succeed every time.
, untile
, unlayer
, unfeature
, unval
-- * Lenses
-- | This section can be safely ignored if one isn't concerned with lenses.
-- Otherwise, see the following for a good primer on Haskell lenses:
-- http://hackage.haskell.org/package/lens-tutorial-1.0.1/docs/Control-Lens-Tutorial.html
--
-- These lenses are written in a generic way to avoid taking a dependency
-- on one of the lens libraries.
, layers
, version
, name
, points
, linestrings
, polygons
, extent
, featureId
, metadata
, geometries
) where
import Control.Applicative ((<|>))
import Control.DeepSeq (NFData)
import Data.Foldable (foldrM)
import Data.Int
import Data.List (nub, elemIndex)
import qualified Data.Map.Lazy as M
import Data.Maybe (fromJust)
import Data.Monoid
import Data.ProtocolBuffers
import qualified Data.Set as S
import Data.Text (Text,pack)
import qualified Data.Vector as V
import Data.Word
import GHC.Generics (Generic)
import Geography.VectorTile.Geometry
import qualified Geography.VectorTile.Raw as R
import Geography.VectorTile.Util
---
{- Types -}
-- | A high-level representation of a Vector Tile. At its simplest, a tile
-- is just a list of `Layer`s.
--
-- There is potential to implement `_layers` as a `M.Map`, with its String-based
-- `name` as a key.
newtype VectorTile = VectorTile { _layers :: V.Vector Layer } deriving (Eq,Show,Generic)
-- | > Lens' VectorTile (Vector Layer)
layers :: Functor f => (V.Vector Layer -> f (V.Vector Layer)) -> VectorTile -> f VectorTile
layers f v = VectorTile <$> f (_layers v)
{-# INLINE layers #-}
instance NFData VectorTile
-- | A layer, which could contain any number of `Feature`s of any `Geometry` type.
-- This codec only respects the canonical three `Geometry` types, and we split
-- them here explicitely to allow for more fine-grained access to each type.
data Layer = Layer { _version :: Int -- ^ The version of the spec we follow. Should always be 2.
, _name :: Text
, _points :: V.Vector (Feature Point)
, _linestrings :: V.Vector (Feature LineString)
, _polygons :: V.Vector (Feature Polygon)
, _extent :: Int -- ^ Default: 4096
} deriving (Eq,Show,Generic)
-- | > Lens' Layer Int
version :: Functor f => (Layer -> f Int) -> Layer -> f Layer
version f l = fmap (\v -> l { _version = v }) $ f l
{-# INLINE version #-}
-- | > Lens' Layer Text
name :: Functor f => (Layer -> f Text) -> Layer -> f Layer
name f l = fmap (\v -> l { _name = v }) $ f l
{-# INLINE name #-}
-- | > Lens' Layer (Vector (Feature Point))
points :: Functor f => (Layer -> f (V.Vector (Feature Point))) -> Layer -> f Layer
points f l = fmap (\v -> l { _points = v }) $ f l
{-# INLINE points #-}
-- | > Lens' Layer (Vector (Feature LineString)))
linestrings :: Functor f => (Layer -> f (V.Vector (Feature LineString))) -> Layer -> f Layer
linestrings f l = fmap (\v -> l { _linestrings = v }) $ f l
{-# INLINE linestrings #-}
-- | > Lens' Layer (Vector (Feature Polygon)))
polygons :: Functor f => (Layer -> f (V.Vector (Feature Polygon))) -> Layer -> f Layer
polygons f l = fmap (\v -> l { _polygons = v }) $ f l
{-# INLINE polygons #-}
-- | > Lens' Layer Int
extent :: Functor f => (Layer -> f Int) -> Layer -> f Layer
extent f l = fmap (\v -> l { _extent = v }) $ f l
{-# INLINE extent #-}
instance NFData Layer
-- | A geographic feature. Features are a set of geometries that share
-- some common theme:
--
-- * Points: schools, gas station locations, etc.
-- * LineStrings: Roads, power lines, rivers, etc.
-- * Polygons: Buildings, water bodies, etc.
--
-- Where, for instance, all school locations may be stored as a single
-- `Feature`, and no `Point` within that `Feature` would represent anything
-- else.
--
-- Note: Each `Geometry` type and their /Multi*/ counterpart are considered
-- the same thing, as a `V.Vector` of that `Geometry`.
data Feature g = Feature { _featureId :: Int -- ^ Default: 0
, _metadata :: M.Map Text Val
, _geometries :: V.Vector g } deriving (Eq,Show,Generic)
-- | > Lens' (Feature g) Int
featureId :: Functor f => (Feature g -> f Int) -> Feature g -> f (Feature g)
featureId f l = fmap (\v -> l { _featureId = v }) $ f l
{-# INLINE featureId #-}
-- | > Lens' (Feature g) (Map Text Val)
metadata :: Functor f => (Feature g -> f (M.Map Text Val)) -> Feature g -> f (Feature g)
metadata f l = fmap (\v -> l { _metadata = v }) $ f l
{-# INLINE metadata #-}
-- | > Lens' (Feature g) (Vector g)
geometries :: Functor f => (Feature g -> f (V.Vector g)) -> Feature g -> f (Feature g)
geometries f l = fmap (\v -> l { _geometries = v }) $ f l
{-# INLINE geometries #-}
instance NFData g => NFData (Feature g)
-- | Legal Metadata /Value/ types. Note that `S64` are Z-encoded automatically
-- by the underlying "Data.ProtocolBuffers" library.
data Val = St Text | Fl Float | Do Double | I64 Int64 | W64 Word64 | S64 Int64 | B Bool
deriving (Eq,Show,Generic)
instance NFData Val
{- FROM PROTOBUF -}
-- | Convert a `R.RawVectorTile` of parsed protobuf data into a useable
-- `VectorTile`.
tile :: R.RawVectorTile -> Either Text VectorTile
tile = fmap (VectorTile . V.fromList) . mapM layer . getField . R.layers
-- | Convert a single `R.RawLayer` of parsed protobuf data into a useable
-- `Layer`.
layer :: R.RawLayer -> Either Text Layer
layer l = do
(ps,ls,polys) <- features keys vals . getField $ R.features l
pure Layer { _version = fromIntegral . getField $ R.version l
, _name = getField $ R.name l
, _points = ps
, _linestrings = ls
, _polygons = polys
, _extent = maybe 4096 fromIntegral (getField $ R.extent l) }
where keys = getField $ R.keys l
vals = getField $ R.values l
-- | Convert a list of `R.RawFeature`s of parsed protobuf data into `V.Vector`s
-- of each of the three legal `Geometry` types.
--
-- The long type signature is due to two things:
--
-- 1. `Feature`s are polymorphic at the high level, but not at the parsed
-- protobuf mid-level. In a @[RawFeature]@, there are features of points,
-- linestrings, and polygons all mixed together.
--
-- 2. `R.RawLayer`s and `R.RawFeature`s
-- are strongly coupled at the protobuf level. In order to achieve higher
-- compression ratios, `R.RawLayer`s contain all metadata in key/value lists
-- to be shared across their `R.RawFeature`s, while those `R.RawFeature`s store only
-- indices into those lists. As a result, this function needs to be passed
-- those key/value lists from the parent `R.RawLayer`, and a more isomorphic:
--
-- > feature :: Geometry g => RawFeature -> Either Text (Feature g)
--
-- is not possible.
features :: [Text] -> [R.RawVal] -> [R.RawFeature]
-> Either Text (V.Vector (Feature Point), V.Vector (Feature LineString), V.Vector (Feature Polygon))
features _ _ [] = Left "VectorTile.features: `[R.RawFeature]` empty"
features keys vals fs = (,,) <$> ps <*> ls <*> polys
where -- (_:ps':ls':polys':_) = groupBy sameGeom $ sortOn geomBias fs -- ok ok ok
ps = foldrM f V.empty $ filter (\fe -> getField (R.geom fe) == Just R.Point) fs
ls = foldrM f V.empty $ filter (\fe -> getField (R.geom fe) == Just R.LineString) fs
polys = foldrM f V.empty $ filter (\fe -> getField (R.geom fe) == Just R.Polygon) fs
f :: Geometry g => R.RawFeature -> V.Vector (Feature g) -> Either Text (V.Vector (Feature g))
f x acc = do
geos <- commands (getField $ R.geometries x) >>= fromCommands
meta <- getMeta keys vals . getField $ R.tags x
pure $ Feature { _featureId = maybe 0 fromIntegral . getField $ R.featureId x
, _metadata = meta
, _geometries = geos
} `V.cons` acc
-- | Convert a `R.RawVal` parsed from protobuf data into a useable
-- `Val`. The higher-level `Val` type better expresses the mutual exclusivity
-- of the /Value/ types.
value :: R.RawVal -> Either Text Val
value v = mtoe "Value decode: No legal Value type offered" $ fmap St (getField $ R.string v)
<|> fmap Fl (getField $ R.float v)
<|> fmap Do (getField $ R.double v)
<|> fmap I64 (getField $ R.int64 v)
<|> fmap W64 (getField $ R.uint64 v)
<|> fmap (\(Signed n) -> S64 n) (getField $ R.sint v)
<|> fmap B (getField $ R.bool v)
getMeta :: [Text] -> [R.RawVal] -> [Word32] -> Either Text (M.Map Text Val)
getMeta keys vals tags = do
kv <- map (both fromIntegral) <$> pairs tags
foldrM (\(k,v) acc -> (\v' -> M.insert (keys !! k) v' acc) <$> (value $ vals !! v)) M.empty kv
{- TO PROTOBUF -}
-- | Encode a high-level `VectorTile` back into its mid-level
-- `R.RawVectorTile` form.
untile :: VectorTile -> R.RawVectorTile
untile vt = R.RawVectorTile { R.layers = putField . V.toList . V.map unlayer $ _layers vt }
-- Has to get back all its metadata from its features
-- | Encode a high-level `Layer` back into its mid-level `R.RawLayer` form.
unlayer :: Layer -> R.RawLayer
unlayer l = R.RawLayer { R.version = putField . fromIntegral $ _version l
, R.name = putField $ _name l
, R.features = putField fs
, R.keys = putField ks
, R.values = putField $ map unval vs
, R.extent = putField . Just . fromIntegral $ _extent l }
where (ks,vs) = totalMeta (_points l) (_linestrings l) (_polygons l)
fs = V.toList $ V.concat [ V.map (unfeature ks vs) (_points l)
, V.map (unfeature ks vs) (_linestrings l)
, V.map (unfeature ks vs) (_polygons l) ]
totalMeta :: V.Vector (Feature Point) -> V.Vector (Feature LineString) -> V.Vector (Feature Polygon) -> ([Text], [Val])
totalMeta ps ls polys = (keys, vals)
where keys = S.toList . S.unions $ f ps <> f ls <> f polys
vals = nub . concat $ g ps <> g ls <> g polys -- `nub` is O(n^2)
f = V.foldr (\x acc -> M.keysSet (_metadata x) : acc) []
g = V.foldr (\x acc -> M.elems (_metadata x) : acc) []
-- | Encode a high-level `Feature` back into its mid-level `R.RawFeature` form.
unfeature :: R.Geom g => [Text] -> [Val] -> Feature g -> R.RawFeature
unfeature keys vals fe = R.RawFeature
{ R.featureId = putField . Just . fromIntegral $ _featureId fe
, R.tags = putField $ tags fe
, R.geom = putField . Just . R.geomType . V.head $ _geometries fe
, R.geometries = putField . uncommands . toCommands $ _geometries fe
}
where tags = unpairs . map f . M.toList . _metadata
f (k,v) = both (fromIntegral . fromJust) (k `elemIndex` keys, v `elemIndex` vals)
-- | Encode a high-level `Val` back into its mid-level `R.RawVal` form.
unval :: Val -> R.RawVal
unval (St v) = def { R.string = putField $ Just v }
unval (Fl v) = def { R.float = putField $ Just v }
unval (Do v) = def { R.double = putField $ Just v }
unval (I64 v) = def { R.int64 = putField $ Just v }
unval (W64 v) = def { R.uint64 = putField $ Just v }
unval (S64 v) = def { R.sint = putField . Just $ Signed v }
unval (B v) = def { R.bool = putField $ Just v }
-- | A `R.RawVal` with every entry set to `Nothing`.
def :: R.RawVal
def = R.RawVal { R.string = putField Nothing
, R.float = putField Nothing
, R.double = putField Nothing
, R.int64 = putField Nothing
, R.uint64 = putField Nothing
, R.sint = putField Nothing
, R.bool = putField Nothing }