87 lines
1.8 KiB
Haskell
87 lines
1.8 KiB
Haskell
{-# LANGUAGE OverloadedStrings #-}
|
|
|
|
module Track (
|
|
Track,
|
|
Pos(..),
|
|
pos,
|
|
elevation,
|
|
parse,
|
|
Track.length
|
|
) where
|
|
import Data.Time
|
|
import qualified Data.List
|
|
import Text.XML
|
|
import Text.XML.Cursor as Cursor
|
|
import qualified Data.Text
|
|
import Data.Text.Lazy as T
|
|
import Debug.Trace (trace, traceShow)
|
|
import Data.List as List
|
|
import Data.Map as Map
|
|
import Control.Exception
|
|
|
|
data Pos = Pos Float Float deriving (Show, Eq)
|
|
type Power = Maybe Int
|
|
type Cadence = Maybe Int
|
|
type HeartRate = Maybe Int
|
|
|
|
data Point = Point {
|
|
pos :: Pos,
|
|
elevation :: Maybe Float,
|
|
time :: UTCTime,
|
|
power :: Power,
|
|
cadence :: Cadence,
|
|
heartRate :: HeartRate
|
|
} deriving (Show)
|
|
|
|
-- TODO do we even need this type?
|
|
type Track = [Point]
|
|
|
|
mkPoint pos =
|
|
Point
|
|
pos
|
|
(Just 0)
|
|
(UTCTime (toEnum 60631) 43200)
|
|
(Just 0)
|
|
(Just 0)
|
|
(Just 0)
|
|
|
|
elToPoint :: Cursor -> Point
|
|
elToPoint n =
|
|
case node n of
|
|
NodeElement (Element _ attrs _) ->
|
|
let
|
|
lat = getAttr "lat"
|
|
lon = getAttr "lon"
|
|
in mkPoint (Pos lat lon)
|
|
where getAttr name =
|
|
case (Map.lookup name attrs) of
|
|
Just v -> (read (Data.Text.unpack v) :: Float)
|
|
_ -> 0
|
|
_ -> mkPoint (Pos 0 0)
|
|
|
|
getPoints :: Cursor -> [Point]
|
|
getPoints c =
|
|
let
|
|
trkpts =
|
|
child c >>=
|
|
element "trk" >>= descendant >>=
|
|
element "trkpt"
|
|
in
|
|
List.map elToPoint trkpts
|
|
|
|
|
|
-- TODO am sure we could use some amazing monad thing to reduce
|
|
-- the amount of pattern matching here
|
|
parse :: String -> Either SomeException [Point]
|
|
parse str =
|
|
case parseText def (T.pack str) of
|
|
Right gpx ->
|
|
let
|
|
points = getPoints $ fromDocument gpx
|
|
in Right points
|
|
Left err ->
|
|
Left err
|
|
|
|
length :: Track -> Int
|
|
length trk = Data.List.length trk
|