{-# LANGUAGE TypeFamilies #-}
module Diagrams.TwoD.Path.Metafont.Combinators
(
(.-), (-.), (.--.)
, endpt, cyclePath
, simpleJoin
, tension, tensions, controls
, leaving, arriving
) where
import Diagrams.Prelude
import Diagrams.TwoD.Path.Metafont.Types
type Join n = PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
(.-) :: P2 n -> MFPathData J n -> MFPathData P n
.- :: forall n. P2 n -> MFPathData J n -> MFPathData P n
(.-) = P2 n -> MFPathData J n -> MFPathData P n
forall n. P2 n -> MFPathData J n -> MFPathData P n
MFPathPt
(-.) :: Join n -> MFPathData P n -> MFPathData J n
-. :: forall n. Join n -> MFPathData P n -> MFPathData J n
(-.) = PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> MFPathData P n -> MFPathData J n
forall n. Join n -> MFPathData P n -> MFPathData J n
MFPathJoin
infixr 5 .-
infixr 5 -.
endpt :: P2 n -> MFPathData P n
endpt :: forall n. P2 n -> MFPathData P n
endpt = P2 n -> MFPathData P n
forall n. P2 n -> MFPathData P n
MFPathEnd
cyclePath :: MFPathData P n
cyclePath :: forall n. MFPathData P n
cyclePath = MFPathData P n
forall n. MFPathData P n
MFPathCycle
(.--.) :: P2 n -> MFPathData P n -> MFPathData P n
P2 n
p .--. :: forall n. P2 n -> MFPathData P n -> MFPathData P n
.--. MFPathData P n
q = P2 n
p P2 n -> MFPathData J n -> MFPathData P n
forall n. P2 n -> MFPathData J n -> MFPathData P n
.- Join n
forall a. Monoid a => a
mempty Join n -> MFPathData P n -> MFPathData J n
forall n. Join n -> MFPathData P n -> MFPathData J n
-. MFPathData P n
q
infixr 5 .--.
simpleJoin :: Join n
simpleJoin :: forall n. Join n
simpleJoin = Join n
forall a. Monoid a => a
mempty
tension :: n -> Join n
tension :: forall n. n -> Join n
tension n
t = Maybe (PathDir n)
-> Maybe (BasicJoin n)
-> Maybe (PathDir n)
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
forall d j. d -> j -> d -> PathJoin d j
PJ Maybe (PathDir n)
forall a. Maybe a
Nothing (BasicJoin n -> Maybe (BasicJoin n)
forall a. a -> Maybe a
Just (BasicJoin n -> Maybe (BasicJoin n))
-> (TensionJoin n -> BasicJoin n)
-> TensionJoin n
-> Maybe (BasicJoin n)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. TensionJoin n -> BasicJoin n
forall a b. a -> Either a b
Left (TensionJoin n -> Maybe (BasicJoin n))
-> TensionJoin n -> Maybe (BasicJoin n)
forall a b. (a -> b) -> a -> b
$ Tension n -> Tension n -> TensionJoin n
forall n. Tension n -> Tension n -> TensionJoin n
TJ (n -> Tension n
forall n. n -> Tension n
TensionAmt n
t) (n -> Tension n
forall n. n -> Tension n
TensionAmt n
t)) Maybe (PathDir n)
forall a. Maybe a
Nothing
tensions :: n -> n -> Join n
tensions :: forall n. n -> n -> Join n
tensions n
tl n
tr = Maybe (PathDir n)
-> Maybe (BasicJoin n)
-> Maybe (PathDir n)
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
forall d j. d -> j -> d -> PathJoin d j
PJ Maybe (PathDir n)
forall a. Maybe a
Nothing (BasicJoin n -> Maybe (BasicJoin n)
forall a. a -> Maybe a
Just (BasicJoin n -> Maybe (BasicJoin n))
-> (TensionJoin n -> BasicJoin n)
-> TensionJoin n
-> Maybe (BasicJoin n)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. TensionJoin n -> BasicJoin n
forall a b. a -> Either a b
Left (TensionJoin n -> Maybe (BasicJoin n))
-> TensionJoin n -> Maybe (BasicJoin n)
forall a b. (a -> b) -> a -> b
$ Tension n -> Tension n -> TensionJoin n
forall n. Tension n -> Tension n -> TensionJoin n
TJ (n -> Tension n
forall n. n -> Tension n
TensionAmt n
tl) (n -> Tension n
forall n. n -> Tension n
TensionAmt n
tr)) Maybe (PathDir n)
forall a. Maybe a
Nothing
controls :: P2 n -> P2 n -> Join n
controls :: forall n. P2 n -> P2 n -> Join n
controls P2 n
u P2 n
v = Join n
forall n. Join n
simpleJoin Join n -> (Join n -> Join n) -> Join n
forall a b. a -> (a -> b) -> b
& (Maybe (BasicJoin n) -> Identity (Maybe (BasicJoin n)))
-> Join n -> Identity (Join n)
forall d j1 j2 (f :: * -> *).
Functor f =>
(j1 -> f j2) -> PathJoin d j1 -> f (PathJoin d j2)
j((Maybe (BasicJoin n) -> Identity (Maybe (BasicJoin n)))
-> Join n -> Identity (Join n))
-> Maybe (BasicJoin n) -> Join n -> Join n
forall s t a b. ASetter s t a b -> b -> s -> t
.~ (BasicJoin n -> Maybe (BasicJoin n)
forall a. a -> Maybe a
Just (BasicJoin n -> Maybe (BasicJoin n))
-> (ControlJoin n -> BasicJoin n)
-> ControlJoin n
-> Maybe (BasicJoin n)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ControlJoin n -> BasicJoin n
forall a b. b -> Either a b
Right (ControlJoin n -> Maybe (BasicJoin n))
-> ControlJoin n -> Maybe (BasicJoin n)
forall a b. (a -> b) -> a -> b
$ P2 n -> P2 n -> ControlJoin n
forall n. P2 n -> P2 n -> ControlJoin n
CJ P2 n
u P2 n
v)
leaving :: V2 n -> Join n
leaving :: forall n. V2 n -> Join n
leaving V2 n
d = PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
forall a. Monoid a => a
mempty PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> (PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n)))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
forall a b. a -> (a -> b) -> b
& (Maybe (PathDir n) -> Identity (Maybe (PathDir n)))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> Identity (PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n)))
forall d j (f :: * -> *).
Functor f =>
(d -> f d) -> PathJoin d j -> f (PathJoin d j)
d1((Maybe (PathDir n) -> Identity (Maybe (PathDir n)))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> Identity (PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))))
-> Maybe (PathDir n)
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
forall s t a b. ASetter s t a b -> b -> s -> t
.~ (PathDir n -> Maybe (PathDir n)
forall a. a -> Maybe a
Just (PathDir n -> Maybe (PathDir n))
-> (V2 n -> PathDir n) -> V2 n -> Maybe (PathDir n)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Dir n -> PathDir n
forall n. Dir n -> PathDir n
PathDirDir (Dir n -> PathDir n) -> (V2 n -> Dir n) -> V2 n -> PathDir n
forall b c a. (b -> c) -> (a -> b) -> a -> c
. V2 n -> Dir n
forall (v :: * -> *) n. v n -> Direction v n
direction (V2 n -> Maybe (PathDir n)) -> V2 n -> Maybe (PathDir n)
forall a b. (a -> b) -> a -> b
$ V2 n
d)
arriving :: V2 n -> Join n
arriving :: forall n. V2 n -> Join n
arriving V2 n
d = PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
forall a. Monoid a => a
mempty PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> (PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n)))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
forall a b. a -> (a -> b) -> b
& (Maybe (PathDir n) -> Identity (Maybe (PathDir n)))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> Identity (PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n)))
forall d j (f :: * -> *).
Functor f =>
(d -> f d) -> PathJoin d j -> f (PathJoin d j)
d2((Maybe (PathDir n) -> Identity (Maybe (PathDir n)))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> Identity (PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))))
-> Maybe (PathDir n)
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
-> PathJoin (Maybe (PathDir n)) (Maybe (BasicJoin n))
forall s t a b. ASetter s t a b -> b -> s -> t
.~ (PathDir n -> Maybe (PathDir n)
forall a. a -> Maybe a
Just (PathDir n -> Maybe (PathDir n))
-> (V2 n -> PathDir n) -> V2 n -> Maybe (PathDir n)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Dir n -> PathDir n
forall n. Dir n -> PathDir n
PathDirDir (Dir n -> PathDir n) -> (V2 n -> Dir n) -> V2 n -> PathDir n
forall b c a. (b -> c) -> (a -> b) -> a -> c
. V2 n -> Dir n
forall (v :: * -> *) n. v n -> Direction v n
direction (V2 n -> Maybe (PathDir n)) -> V2 n -> Maybe (PathDir n)
forall a b. (a -> b) -> a -> b
$ V2 n
d)