{-# LANGUAGE CPP                        #-}

--------------------------------------------------------------------

-- |

-- Module    : Graphics.SVG.ReadPath

-- Copyright : (c) 2011 Tillmann Vogt

-- License   : BSD3

--

-- Maintainer: Tillmann Vogt <tillk.vogt@googlemail.com>

-- Stability : stable

-- Portability: portable

--

-- Parsing the SVG path command, see <http://www.w3.org/TR/SVG/paths.html#PathData> :


module Graphics.SVGFonts.ReadPath
 ( pathFromString,
   pathFromByteString,
   PathCommand(..),
 )
 where

import           Control.Applicative

import qualified Data.Attoparsec.ByteString.Char8 as P
import Data.Attoparsec.ByteString.Char8 (Parser, skipMany, space, many1, try, char)
import Data.ByteString.Char8 (ByteString)
import qualified Data.ByteString.Char8 as BS

data PathCommand n =
  M_abs !(n, n) | -- ^Establish a new current point (with absolute coords)

  M_rel !(n, n) | -- ^Establish a new current point (with coords relative to the current point)

  Z | -- ^Close current subpath by drawing a straight line from current point to current subpath's initial point

  L_abs !(n, n) | -- ^A line from the current point to (n, n) which becomes the new current point

  L_rel !(n, n) |
  H_abs !n | -- ^A horizontal line from the current point (cpx, cpy) to (x, cpy)

  H_rel !n |
  V_abs !n | -- ^A vertical line from the current point (cpx, cpy) to (cpx, y)

  V_rel !n |
  C_abs !(n,n,n,n,n,n) | -- ^Draws a cubic Bézier curve from the current point to (x,y) using (x1,y1) as the

  -- ^control point at the beginning of the curve and (x2,y2) as the control point at the end of the curve.

  C_rel !(n,n,n,n,n,n) |
  S_abs !(n,n,n,n) | -- ^Draws a cubic Bézier curve from the current point to (x,y). The first control point is

-- assumed to be the reflection of the second control point on the previous command relative to the current point.

-- (If there is no previous command or if the previous command was not an C, c, S or s, assume the first control

-- point is coincident with the current point.) (x2,y2) is the second control point (i.e., the control point at

-- the end of the curve).

  S_rel !(n,n,n,n) |
  Q_abs !(n,n,n,n) | -- ^A quadr. Bézier curve from the curr. point to (x,y) using (x1,y1) as the control point

  Q_rel !(n,n,n,n) | -- ^Nearly the same as cubic, but with one point less

  T_abs !(n, n) | -- ^T_Abs = Shorthand/smooth quadratic Bezier curveto

  T_rel !(n, n) |
  A_abs | -- ^A = Elliptic arc (not used)

  A_rel
  deriving Int -> PathCommand n -> ShowS
[PathCommand n] -> ShowS
PathCommand n -> String
(Int -> PathCommand n -> ShowS)
-> (PathCommand n -> String)
-> ([PathCommand n] -> ShowS)
-> Show (PathCommand n)
forall n. Show n => Int -> PathCommand n -> ShowS
forall n. Show n => [PathCommand n] -> ShowS
forall n. Show n => PathCommand n -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: forall n. Show n => Int -> PathCommand n -> ShowS
showsPrec :: Int -> PathCommand n -> ShowS
$cshow :: forall n. Show n => PathCommand n -> String
show :: PathCommand n -> String
$cshowList :: forall n. Show n => [PathCommand n] -> ShowS
showList :: [PathCommand n] -> ShowS
Show

-- | Convert a SVG path string into a list of commands

pathFromString :: Fractional n => String -> Either String [PathCommand n]
pathFromString :: forall n. Fractional n => String -> Either String [PathCommand n]
pathFromString = ByteString -> Either String [PathCommand n]
forall n.
Fractional n =>
ByteString -> Either String [PathCommand n]
pathFromByteString (ByteString -> Either String [PathCommand n])
-> (String -> ByteString)
-> String
-> Either String [PathCommand n]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> ByteString
BS.pack

pathFromByteString :: Fractional n => ByteString -> Either String [PathCommand n]
pathFromByteString :: forall n.
Fractional n =>
ByteString -> Either String [PathCommand n]
pathFromByteString ByteString
str = case Parser [PathCommand n]
-> ByteString -> Either String [PathCommand n]
forall a. Parser a -> ByteString -> Either String a
P.parseOnly Parser [PathCommand n]
forall n. Fractional n => Parser [PathCommand n]
path ByteString
str of
  Left  String
err -> String -> Either String [PathCommand n]
forall a b. a -> Either a b
Left  (ShowS
forall a. Show a => a -> String
show String
err)
  Right [PathCommand n]
p   -> [PathCommand n] -> Either String [PathCommand n]
forall a b. b -> Either a b
Right [PathCommand n]
p

spaces :: Parser ()
spaces :: Parser ()
spaces = Parser ByteString Char -> Parser ()
forall (f :: * -> *) a. Alternative f => f a -> f ()
skipMany Parser ByteString Char
space

path :: Fractional n => Parser [PathCommand n]
path :: forall n. Fractional n => Parser [PathCommand n]
path = do{ l <- Parser ByteString [PathCommand n]
-> Parser ByteString [[PathCommand n]]
forall a. Parser ByteString a -> Parser ByteString [a]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many Parser ByteString [PathCommand n]
forall n. Fractional n => Parser [PathCommand n]
pathElement
         ; P.endOfInput
         ; return (concat l)
         }

pathElement :: Fractional n => Parser [PathCommand n]
pathElement :: forall n. Fractional n => Parser [PathCommand n]
pathElement =
  Parser ()
whiteSpace Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*>
  (  String -> Parser ()
symbol String
"M" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n) -> PathCommand n
forall n. (n, n) -> PathCommand n
M_abs ((n, n) -> PathCommand n)
-> Parser ByteString (n, n) -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n)
forall n. Fractional n => Parser (n, n)
tupel2)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"m" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n) -> PathCommand n
forall n. (n, n) -> PathCommand n
M_rel ((n, n) -> PathCommand n)
-> Parser ByteString (n, n) -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n)
forall n. Fractional n => Parser (n, n)
tupel2)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"z" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> [PathCommand n] -> Parser ByteString [PathCommand n]
forall a. a -> Parser ByteString a
forall (f :: * -> *) a. Applicative f => a -> f a
pure [PathCommand n
forall n. PathCommand n
Z]
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"Z" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> [PathCommand n] -> Parser ByteString [PathCommand n]
forall a. a -> Parser ByteString a
forall (f :: * -> *) a. Applicative f => a -> f a
pure [PathCommand n
forall n. PathCommand n
Z]
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"L" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n) -> PathCommand n
forall n. (n, n) -> PathCommand n
L_abs ((n, n) -> PathCommand n)
-> Parser ByteString (n, n) -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n)
forall n. Fractional n => Parser (n, n)
tupel2)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"l" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n) -> PathCommand n
forall n. (n, n) -> PathCommand n
L_rel ((n, n) -> PathCommand n)
-> Parser ByteString (n, n) -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n)
forall n. Fractional n => Parser (n, n)
tupel2)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"H" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 (n -> PathCommand n
forall n. n -> PathCommand n
H_abs (n -> PathCommand n)
-> Parser ByteString n -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString n
forall n. Fractional n => Parser n
myfloat)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"h" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 (n -> PathCommand n
forall n. n -> PathCommand n
H_rel (n -> PathCommand n)
-> Parser ByteString n -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString n
forall n. Fractional n => Parser n
myfloat)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"V" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 (n -> PathCommand n
forall n. n -> PathCommand n
V_abs (n -> PathCommand n)
-> Parser ByteString n -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString n
forall n. Fractional n => Parser n
myfloat)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"v" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 (n -> PathCommand n
forall n. n -> PathCommand n
V_rel (n -> PathCommand n)
-> Parser ByteString n -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString n
forall n. Fractional n => Parser n
myfloat)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"C" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n, n, n, n, n) -> PathCommand n
forall n. (n, n, n, n, n, n) -> PathCommand n
C_abs ((n, n, n, n, n, n) -> PathCommand n)
-> Parser ByteString (n, n, n, n, n, n)
-> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n, n, n, n, n)
forall n. Fractional n => Parser (n, n, n, n, n, n)
tupel6)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"c" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n, n, n, n, n) -> PathCommand n
forall n. (n, n, n, n, n, n) -> PathCommand n
C_rel ((n, n, n, n, n, n) -> PathCommand n)
-> Parser ByteString (n, n, n, n, n, n)
-> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n, n, n, n, n)
forall n. Fractional n => Parser (n, n, n, n, n, n)
tupel6)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"S" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n, n, n) -> PathCommand n
forall n. (n, n, n, n) -> PathCommand n
S_abs ((n, n, n, n) -> PathCommand n)
-> Parser ByteString (n, n, n, n)
-> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n, n, n)
forall n. Fractional n => Parser (n, n, n, n)
tupel4)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"s" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n, n, n) -> PathCommand n
forall n. (n, n, n, n) -> PathCommand n
S_rel ((n, n, n, n) -> PathCommand n)
-> Parser ByteString (n, n, n, n)
-> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n, n, n)
forall n. Fractional n => Parser (n, n, n, n)
tupel4)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"Q" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n, n, n) -> PathCommand n
forall n. (n, n, n, n) -> PathCommand n
Q_abs ((n, n, n, n) -> PathCommand n)
-> Parser ByteString (n, n, n, n)
-> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n, n, n)
forall n. Fractional n => Parser (n, n, n, n)
tupel4)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"q" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n, n, n) -> PathCommand n
forall n. (n, n, n, n) -> PathCommand n
Q_rel ((n, n, n, n) -> PathCommand n)
-> Parser ByteString (n, n, n, n)
-> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n, n, n)
forall n. Fractional n => Parser (n, n, n, n)
tupel4)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"T" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n) -> PathCommand n
forall n. (n, n) -> PathCommand n
T_abs ((n, n) -> PathCommand n)
-> Parser ByteString (n, n) -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n)
forall n. Fractional n => Parser (n, n)
tupel2)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"t" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 ((n, n) -> PathCommand n
forall n. (n, n) -> PathCommand n
T_rel ((n, n) -> PathCommand n)
-> Parser ByteString (n, n) -> Parser ByteString (PathCommand n)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString (n, n)
forall n. Fractional n => Parser (n, n)
tupel2)
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"A" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 (PathCommand n
forall n. PathCommand n
A_abs PathCommand n
-> Parser ByteString (Double, Double)
-> Parser ByteString (PathCommand n)
forall a b. a -> Parser ByteString b -> Parser ByteString a
forall (f :: * -> *) a b. Functor f => a -> f b -> f a
<$  (Parser ByteString (Double, Double)
forall n. Fractional n => Parser (n, n)
tupel2::Parser (Double,Double)))
 Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> String -> Parser ()
symbol String
"a" Parser ()
-> Parser ByteString [PathCommand n]
-> Parser ByteString [PathCommand n]
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> Parser ByteString (PathCommand n)
-> Parser ByteString [PathCommand n]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many1 (PathCommand n
forall n. PathCommand n
A_rel PathCommand n
-> Parser ByteString (Double, Double)
-> Parser ByteString (PathCommand n)
forall a b. a -> Parser ByteString b -> Parser ByteString a
forall (f :: * -> *) a b. Functor f => a -> f b -> f a
<$  (Parser ByteString (Double, Double)
forall n. Fractional n => Parser (n, n)
tupel2::Parser (Double,Double)))
  )

comma :: Parser ()
comma :: Parser ()
comma = Parser ()
spaces Parser () -> Parser () -> Parser ()
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> (Parser () -> Parser ()
forall i a. Parser i a -> Parser i a
try (() () -> Parser ByteString Char -> Parser ()
forall a b. a -> Parser ByteString b -> Parser ByteString a
forall (f :: * -> *) a b. Functor f => a -> f b -> f a
<$ Char -> Parser ByteString Char
char Char
',' ) Parser () -> Parser () -> Parser ()
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> Parser ()
spaces)

tupel2 :: Fractional n => Parser (n,n)
tupel2 :: forall n. Fractional n => Parser (n, n)
tupel2 = do{ x <- Parser n
forall n. Fractional n => Parser n
myfloat; comma; y <- myfloat; spaces;
             return (x, y)
           }

tupel4 :: Fractional n => Parser (n,n,n,n)
tupel4 :: forall n. Fractional n => Parser (n, n, n, n)
tupel4 = do{ x1 <- Parser n
forall n. Fractional n => Parser n
myfloat; comma; y1 <- myfloat; spaces;
              x <- myfloat; comma;  y <- myfloat; spaces;
             return (x1, y1, x, y)
           }

tupel6 :: Fractional n => Parser (n,n,n,n,n,n)
tupel6 :: forall n. Fractional n => Parser (n, n, n, n, n, n)
tupel6 = do{ x1 <- Parser n
forall n. Fractional n => Parser n
myfloat; comma; y1 <- myfloat; spaces;
             x2 <- myfloat; comma; y2 <- myfloat; spaces;
              x <- myfloat; comma;  y <- myfloat; spaces;
             return (x1, y1, x2, y2, x, y)
           }

myfloat :: Fractional n => Parser n
myfloat :: forall n. Fractional n => Parser n
myfloat = Parser ByteString n -> Parser ByteString n
forall i a. Parser i a -> Parser i a
try (do{ _ <- String -> Parser ()
symbol String
"-"; n <- float; return (negate n) }) Parser ByteString n -> Parser ByteString n -> Parser ByteString n
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|>
          Parser ByteString n -> Parser ByteString n
forall i a. Parser i a -> Parser i a
try Parser ByteString n
forall n. Fractional n => Parser n
float Parser ByteString n -> Parser ByteString n -> Parser ByteString n
forall a.
Parser ByteString a -> Parser ByteString a -> Parser ByteString a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
<|> -- 0 is not recognized as a float, so recognize it as an integer and then convert to float

              do { i<-Parser Integer
integer; return(fromIntegral i) }

whiteSpace :: Parser ()
whiteSpace :: Parser ()
whiteSpace      = Parser ()
P.skipSpace

symbol :: String -> Parser ()
symbol :: String -> Parser ()
symbol String
s        = ByteString -> Parser ByteString
P.string (String -> ByteString
BS.pack String
s) Parser ByteString -> Parser () -> Parser ()
forall a b.
Parser ByteString a -> Parser ByteString b -> Parser ByteString b
forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> Parser ()
whiteSpace

integer :: Parser Integer
integer :: Parser Integer
integer         = Parser Integer
forall a. Integral a => Parser a
P.decimal

float :: Fractional n => Parser n
float :: forall n. Fractional n => Parser n
float           = Double -> n
forall a b. (Real a, Fractional b) => a -> b
realToFrac (Double -> n) -> Parser ByteString Double -> Parser ByteString n
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parser ByteString Double
P.double