{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE CPP #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE EmptyDataDecls #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
module Diagrams.Core.Types
(
Annotation(Href, OpacityGroup, KeyVal)
, applyAnnotation, href, opacityGroup, groupOpacity, keyVal
, UpAnnots, DownAnnots, transfToAnnot, transfFromAnnot
, QDiaLeaf(..), withQDiaLeaf
, QDiagram(..), Diagram
, mkQD, mkQD', pointDiagram
, envelope, trace, subMap, names, query
, atop
, nameSub
, lookupName
, withName
, withNameAll
, withNames
, localize
, setEnvelope
, setTrace
, Subdiagram(..), mkSubdiagram
, getSub, rawSub
, location
, subPoint
, SubMap(..)
, fromNames, rememberAs, lookupSub
, Prim(..)
, _Prim
, Backend(..)
, DTree
, DNode(..)
, RTree
, RNode(..)
, _RStyle
, _RAnnot
, _RPrim
, _REmpty
, NullBackend, D
, TypeableFloat
, Renderable(..)
) where
import Control.Arrow (first, second, (***))
import Control.Lens (Lens', Prism', Rewrapped,
Wrapped (..), iso, lens, over,
prism', view, (^.), _Wrapped,
_Wrapping)
import Control.Monad (mplus)
import Data.Kind (Type)
import Data.List (isSuffixOf)
import qualified Data.Map as M
import Data.Maybe (fromMaybe, listToMaybe)
import Data.Semigroup
import qualified Data.Traversable as T
import Data.Tree
import Data.Typeable
import Data.Monoid.Action
import Data.Monoid.Coproduct
import Data.Monoid.Deletable
import Data.Monoid.MList
import Data.Monoid.WithSemigroup
import qualified Data.Tree.DUAL as D
import Diagrams.Core.Envelope
import Diagrams.Core.HasOrigin
import Diagrams.Core.Juxtapose
import Diagrams.Core.Names
import Diagrams.Core.Points
import Diagrams.Core.Query
import Diagrams.Core.Style
import Diagrams.Core.Trace
import Diagrams.Core.Transform
import Diagrams.Core.V
import Linear.Affine
import Linear.Metric
import Linear.Vector
type TypeableFloat n = (Typeable n, RealFloat n)
type UpAnnots b v n m = Deletable (Envelope v n)
::: Deletable (Trace v n)
::: Deletable (SubMap b v n m)
::: Query v n m
::: ()
type DownAnnots v n = (Transformation v n :+: Style v n)
::: Name
::: ()
transfToAnnot :: Transformation v n -> DownAnnots v n
transfToAnnot :: forall (v :: * -> *) n. Transformation v n -> DownAnnots v n
transfToAnnot
= forall l a. (l :>: a) => a -> l
inj
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (forall m n. m -> m :+: n
inL :: Transformation v n -> Transformation v n :+: Style v n)
transfFromAnnot :: (Additive v, Num n) => DownAnnots v n -> Transformation v n
transfFromAnnot :: forall (v :: * -> *) n.
(Additive v, Num n) =>
DownAnnots v n -> Transformation v n
transfFromAnnot = forall b a. b -> (a -> b) -> Maybe a -> b
maybe forall a. Monoid a => a
mempty forall m n. Monoid m => (m :+: n) -> m
killR forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a, b) -> a
fst
data QDiaLeaf b v n m
= PrimLeaf (Prim b v n)
| DelayedLeaf (DownAnnots v n -> n -> n -> QDiagram b v n m)
deriving forall a b. a -> QDiaLeaf b v n b -> QDiaLeaf b v n a
forall a b. (a -> b) -> QDiaLeaf b v n a -> QDiaLeaf b v n b
forall b (v :: * -> *) n a b.
a -> QDiaLeaf b v n b -> QDiaLeaf b v n a
forall b (v :: * -> *) n a b.
(a -> b) -> QDiaLeaf b v n a -> QDiaLeaf b v n b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> QDiaLeaf b v n b -> QDiaLeaf b v n a
$c<$ :: forall b (v :: * -> *) n a b.
a -> QDiaLeaf b v n b -> QDiaLeaf b v n a
fmap :: forall a b. (a -> b) -> QDiaLeaf b v n a -> QDiaLeaf b v n b
$cfmap :: forall b (v :: * -> *) n a b.
(a -> b) -> QDiaLeaf b v n a -> QDiaLeaf b v n b
Functor
withQDiaLeaf :: (Prim b v n -> r)
-> ((DownAnnots v n -> n -> n -> QDiagram b v n m) -> r)
-> QDiaLeaf b v n m -> r
withQDiaLeaf :: forall b (v :: * -> *) n r m.
(Prim b v n -> r)
-> ((DownAnnots v n -> n -> n -> QDiagram b v n m) -> r)
-> QDiaLeaf b v n m
-> r
withQDiaLeaf Prim b v n -> r
f (DownAnnots v n -> n -> n -> QDiagram b v n m) -> r
_ (PrimLeaf Prim b v n
p) = Prim b v n -> r
f Prim b v n
p
withQDiaLeaf Prim b v n -> r
_ (DownAnnots v n -> n -> n -> QDiagram b v n m) -> r
g (DelayedLeaf DownAnnots v n -> n -> n -> QDiagram b v n m
dgn) = (DownAnnots v n -> n -> n -> QDiagram b v n m) -> r
g DownAnnots v n -> n -> n -> QDiagram b v n m
dgn
data Annotation
= Href String
| OpacityGroup Double
| KeyVal (String, String)
deriving Int -> Annotation -> ShowS
[Annotation] -> ShowS
Annotation -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Annotation] -> ShowS
$cshowList :: [Annotation] -> ShowS
show :: Annotation -> String
$cshow :: Annotation -> String
showsPrec :: Int -> Annotation -> ShowS
$cshowsPrec :: Int -> Annotation -> ShowS
Show
applyAnnotation
:: (Metric v, OrderedField n, Semigroup m)
=> Annotation -> QDiagram b v n m -> QDiagram b v n m
applyAnnotation :: forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Annotation -> QDiagram b v n m -> QDiagram b v n m
applyAnnotation Annotation
an (QD DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
dt) = forall b (v :: * -> *) n m.
DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
-> QDiagram b v n m
QD (forall u d a l.
(Semigroup u, Action d u) =>
a -> DUALTree d u a l -> DUALTree d u a l
D.annot Annotation
an DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
dt)
href :: (Metric v, OrderedField n, Semigroup m)
=> String -> QDiagram b v n m -> QDiagram b v n m
href :: forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
String -> QDiagram b v n m -> QDiagram b v n m
href = forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Annotation -> QDiagram b v n m -> QDiagram b v n m
applyAnnotation forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> Annotation
Href
opacityGroup, groupOpacity :: (Metric v, OrderedField n, Semigroup m)
=> Double -> QDiagram b v n m -> QDiagram b v n m
opacityGroup :: forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Double -> QDiagram b v n m -> QDiagram b v n m
opacityGroup = forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Annotation -> QDiagram b v n m -> QDiagram b v n m
applyAnnotation forall b c a. (b -> c) -> (a -> b) -> a -> c
. Double -> Annotation
OpacityGroup
groupOpacity :: forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Double -> QDiagram b v n m -> QDiagram b v n m
groupOpacity = forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Annotation -> QDiagram b v n m -> QDiagram b v n m
applyAnnotation forall b c a. (b -> c) -> (a -> b) -> a -> c
. Double -> Annotation
OpacityGroup
keyVal :: (Metric v, OrderedField n, Semigroup m)
=> (String, String) -> QDiagram b v n m -> QDiagram b v n m
keyVal :: forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
(String, String) -> QDiagram b v n m -> QDiagram b v n m
keyVal = forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Annotation -> QDiagram b v n m -> QDiagram b v n m
applyAnnotation forall b c a. (b -> c) -> (a -> b) -> a -> c
. (String, String) -> Annotation
KeyVal
newtype QDiagram b v n m
= QD (D.DUALTree (DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m))
#if __GLASGOW_HASKELL__ >= 707
deriving Typeable
#else
instance forall b v. (Typeable b, Typeable1 v) => Typeable2 (QDiagram b v) where
typeOf2 _ = mkTyConApp (mkTyCon3 "diagrams-core" "Diagrams.Core.Types" "QDiagram") [] `mkAppTy`
typeOf (undefined :: b) `mkAppTy`
typeOf1 (undefined :: v n)
#endif
instance Wrapped (QDiagram b v n m) where
type Unwrapped (QDiagram b v n m) =
D.DUALTree (DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
_Wrapped' :: Iso' (QDiagram b v n m) (Unwrapped (QDiagram b v n m))
_Wrapped' = forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
iso (\(QD DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
d) -> DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
d) forall b (v :: * -> *) n m.
DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
-> QDiagram b v n m
QD
instance Rewrapped (QDiagram b v n m) (QDiagram b' v' n' m')
type instance V (QDiagram b v n m) = v
type instance N (QDiagram b v n m) = n
type Diagram b = QDiagram b (V b) (N b) Any
pointDiagram :: (Metric v, Fractional n)
=> Point v n -> QDiagram b v n m
pointDiagram :: forall (v :: * -> *) n b m.
(Metric v, Fractional n) =>
Point v n -> QDiagram b v n m
pointDiagram Point v n
p = forall b (v :: * -> *) n m.
DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
-> QDiagram b v n m
QD forall a b. (a -> b) -> a -> b
$ forall u d a l. u -> DUALTree d u a l
D.leafU (forall l a. (l :>: a) => a -> l
inj forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall m. m -> Deletable m
toDeletable forall a b. (a -> b) -> a -> b
$ forall n (v :: * -> *).
(Fractional n, Metric v) =>
Point v n -> Envelope v n
pointEnvelope Point v n
p)
getU' :: (Monoid u', u :>: u') => D.DUALTree d u a l -> u'
getU' :: forall u' u d a l. (Monoid u', u :>: u') => DUALTree d u a l -> u'
getU' = forall b a. b -> (a -> b) -> Maybe a -> b
maybe forall a. Monoid a => a
mempty (forall b a. b -> (a -> b) -> Maybe a -> b
maybe forall a. Monoid a => a
mempty forall a. a -> a
id forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l a. (l :>: a) => l -> Maybe a
get) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall d u a l. DUALTree d u a l -> Maybe u
D.getU
envelope :: (OrderedField n, Metric v, Monoid' m)
=> Lens' (QDiagram b v n m) (Envelope v n)
envelope :: forall n (v :: * -> *) m b.
(OrderedField n, Metric v, Monoid' m) =>
Lens' (QDiagram b v n m) (Envelope v n)
envelope = forall s a b t. (s -> a) -> (s -> b -> t) -> Lens s t a b
lens (forall m. Deletable m -> m
unDelete forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall u' u d a l. (Monoid u', u :>: u') => DUALTree d u a l -> u'
getU' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall s (m :: * -> *) a. MonadReader s m => Getting a s a -> m a
view forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped') (forall a b c. (a -> b -> c) -> b -> a -> c
flip forall b (v :: * -> *) n m.
(OrderedField n, Metric v, Monoid' m) =>
Envelope v n -> QDiagram b v n m -> QDiagram b v n m
setEnvelope)
setEnvelope :: forall b v n m. ( OrderedField n, Metric v
, Monoid' m)
=> Envelope v n -> QDiagram b v n m -> QDiagram b v n m
setEnvelope :: forall b (v :: * -> *) n m.
(OrderedField n, Metric v, Monoid' m) =>
Envelope v n -> QDiagram b v n m -> QDiagram b v n m
setEnvelope Envelope v n
e =
forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' ( forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpre (forall l a. (l :>: a) => a -> l
inj forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall m. m -> Deletable m
toDeletable forall a b. (a -> b) -> a -> b
$ Envelope v n
e)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpre (forall l a. (l :>: a) => a -> l
inj (forall m. Monoid m => Deletable m
deleteL :: Deletable (Envelope v n)))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpost (forall l a. (l :>: a) => a -> l
inj (forall m. Monoid m => Deletable m
deleteR :: Deletable (Envelope v n)))
)
trace :: (Metric v, OrderedField n, Semigroup m) =>
Lens' (QDiagram b v n m) (Trace v n)
trace :: forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Lens' (QDiagram b v n m) (Trace v n)
trace = forall s a b t. (s -> a) -> (s -> b -> t) -> Lens s t a b
lens (forall m. Deletable m -> m
unDelete forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall u' u d a l. (Monoid u', u :>: u') => DUALTree d u a l -> u'
getU' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall s (m :: * -> *) a. MonadReader s m => Getting a s a -> m a
view forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped') (forall a b c. (a -> b -> c) -> b -> a -> c
flip forall b (v :: * -> *) n m.
(OrderedField n, Metric v, Semigroup m) =>
Trace v n -> QDiagram b v n m -> QDiagram b v n m
setTrace)
setTrace :: forall b v n m. ( OrderedField n, Metric v
, Semigroup m)
=> Trace v n -> QDiagram b v n m -> QDiagram b v n m
setTrace :: forall b (v :: * -> *) n m.
(OrderedField n, Metric v, Semigroup m) =>
Trace v n -> QDiagram b v n m -> QDiagram b v n m
setTrace Trace v n
t = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' ( forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpre (forall l a. (l :>: a) => a -> l
inj forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall m. m -> Deletable m
toDeletable forall a b. (a -> b) -> a -> b
$ Trace v n
t)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpre (forall l a. (l :>: a) => a -> l
inj (forall m. Monoid m => Deletable m
deleteL :: Deletable (Trace v n)))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpost (forall l a. (l :>: a) => a -> l
inj (forall m. Monoid m => Deletable m
deleteR :: Deletable (Trace v n)))
)
subMap :: (Metric v, Semigroup m, OrderedField n)
=> Lens' (QDiagram b v n m) (SubMap b v n m)
subMap :: forall (v :: * -> *) m n b.
(Metric v, Semigroup m, OrderedField n) =>
Lens' (QDiagram b v n m) (SubMap b v n m)
subMap = forall s a b t. (s -> a) -> (s -> b -> t) -> Lens s t a b
lens (forall m. Deletable m -> m
unDelete forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall u' u d a l. (Monoid u', u :>: u') => DUALTree d u a l -> u'
getU' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall s (m :: * -> *) a. MonadReader s m => Getting a s a -> m a
view forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped') (forall a b c. (a -> b -> c) -> b -> a -> c
flip forall (v :: * -> *) m n b.
(Metric v, Semigroup m, OrderedField n) =>
SubMap b v n m -> QDiagram b v n m -> QDiagram b v n m
setMap)
where
setMap :: (Metric v, Semigroup m, OrderedField n) =>
SubMap b v n m -> QDiagram b v n m -> QDiagram b v n m
setMap :: forall (v :: * -> *) m n b.
(Metric v, Semigroup m, OrderedField n) =>
SubMap b v n m -> QDiagram b v n m -> QDiagram b v n m
setMap SubMap b v n m
m = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' ( forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpre forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l a. (l :>: a) => a -> l
inj forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall m. m -> Deletable m
toDeletable forall a b. (a -> b) -> a -> b
$ SubMap b v n m
m)
names :: (Metric v, Semigroup m, OrderedField n)
=> QDiagram b v n m -> [(Name, [Point v n])]
names :: forall (v :: * -> *) m n b.
(Metric v, Semigroup m, OrderedField n) =>
QDiagram b v n m -> [(Name, [Point v n])]
names = (forall a b. (a -> b) -> [a] -> [b]
map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (d, b) (d, c)
second forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a -> b) -> [a] -> [b]
map) forall (v :: * -> *) n b m.
(Additive v, Num n) =>
Subdiagram b v n m -> Point v n
location forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall k a. Map k a -> [(k, a)]
M.assocs forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall s (m :: * -> *) a. MonadReader s m => Getting a s a -> m a
view (forall (v :: * -> *) m n b.
(Metric v, Semigroup m, OrderedField n) =>
Lens' (QDiagram b v n m) (SubMap b v n m)
subMap forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped')
nameSub :: (IsName nm , Metric v, OrderedField n, Semigroup m)
=> (QDiagram b v n m -> Subdiagram b v n m) -> nm -> QDiagram b v n m -> QDiagram b v n m
nameSub :: forall nm (v :: * -> *) n m b.
(IsName nm, Metric v, OrderedField n, Semigroup m) =>
(QDiagram b v n m -> Subdiagram b v n m)
-> nm -> QDiagram b v n m -> QDiagram b v n m
nameSub QDiagram b v n m -> Subdiagram b v n m
s nm
n QDiagram b v n m
d = QDiagram b v n m
d'
where d' :: QDiagram b v n m
d' = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' (forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpre forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l a. (l :>: a) => a -> l
inj forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall m. m -> Deletable m
toDeletable forall a b. (a -> b) -> a -> b
$ forall a b (v :: * -> *) n m.
IsName a =>
[(a, Subdiagram b v n m)] -> SubMap b v n m
fromNames [(nm
n,QDiagram b v n m -> Subdiagram b v n m
s QDiagram b v n m
d')]) QDiagram b v n m
d
lookupName :: (IsName nm, Metric v, Semigroup m, OrderedField n)
=> nm -> QDiagram b v n m -> Maybe (Subdiagram b v n m)
lookupName :: forall nm (v :: * -> *) m n b.
(IsName nm, Metric v, Semigroup m, OrderedField n) =>
nm -> QDiagram b v n m -> Maybe (Subdiagram b v n m)
lookupName nm
n QDiagram b v n m
d = forall nm b (v :: * -> *) n m.
IsName nm =>
nm -> SubMap b v n m -> Maybe [Subdiagram b v n m]
lookupSub (forall a. IsName a => a -> Name
toName nm
n) (QDiagram b v n m
dforall s a. s -> Getting a s a -> a
^.forall (v :: * -> *) m n b.
(Metric v, Semigroup m, OrderedField n) =>
Lens' (QDiagram b v n m) (SubMap b v n m)
subMap) forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= forall a. [a] -> Maybe a
listToMaybe
withName :: (IsName nm, Metric v
, Semigroup m, OrderedField n)
=> nm -> (Subdiagram b v n m -> QDiagram b v n m -> QDiagram b v n m)
-> QDiagram b v n m -> QDiagram b v n m
withName :: forall nm (v :: * -> *) m n b.
(IsName nm, Metric v, Semigroup m, OrderedField n) =>
nm
-> (Subdiagram b v n m -> QDiagram b v n m -> QDiagram b v n m)
-> QDiagram b v n m
-> QDiagram b v n m
withName nm
n Subdiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
f QDiagram b v n m
d = forall b a. b -> (a -> b) -> Maybe a -> b
maybe forall a. a -> a
id Subdiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
f (forall nm (v :: * -> *) m n b.
(IsName nm, Metric v, Semigroup m, OrderedField n) =>
nm -> QDiagram b v n m -> Maybe (Subdiagram b v n m)
lookupName nm
n QDiagram b v n m
d) QDiagram b v n m
d
withNameAll :: (IsName nm, Metric v
, Semigroup m, OrderedField n)
=> nm -> ([Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m)
-> QDiagram b v n m -> QDiagram b v n m
withNameAll :: forall nm (v :: * -> *) m n b.
(IsName nm, Metric v, Semigroup m, OrderedField n) =>
nm
-> ([Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m)
-> QDiagram b v n m
-> QDiagram b v n m
withNameAll nm
n [Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m
f QDiagram b v n m
d = [Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m
f (forall a. a -> Maybe a -> a
fromMaybe [] (forall nm b (v :: * -> *) n m.
IsName nm =>
nm -> SubMap b v n m -> Maybe [Subdiagram b v n m]
lookupSub (forall a. IsName a => a -> Name
toName nm
n) (QDiagram b v n m
dforall s a. s -> Getting a s a -> a
^.forall (v :: * -> *) m n b.
(Metric v, Semigroup m, OrderedField n) =>
Lens' (QDiagram b v n m) (SubMap b v n m)
subMap))) QDiagram b v n m
d
withNames :: (IsName nm, Metric v
, Semigroup m, OrderedField n)
=> [nm] -> ([Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m)
-> QDiagram b v n m -> QDiagram b v n m
withNames :: forall nm (v :: * -> *) m n b.
(IsName nm, Metric v, Semigroup m, OrderedField n) =>
[nm]
-> ([Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m)
-> QDiagram b v n m
-> QDiagram b v n m
withNames [nm]
ns [Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m
f QDiagram b v n m
d = forall b a. b -> (a -> b) -> Maybe a -> b
maybe forall a. a -> a
id [Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m
f Maybe [Subdiagram b v n m]
ns' QDiagram b v n m
d
where
nd :: SubMap b v n m
nd = QDiagram b v n m
dforall s a. s -> Getting a s a -> a
^.forall (v :: * -> *) m n b.
(Metric v, Semigroup m, OrderedField n) =>
Lens' (QDiagram b v n m) (SubMap b v n m)
subMap
ns' :: Maybe [Subdiagram b v n m]
ns' = forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
T.sequence (forall a b. (a -> b) -> [a] -> [b]
map ((forall a. [a] -> Maybe a
listToMaybeforall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<<) forall b c a. (b -> c) -> (a -> b) -> a -> c
. (forall a b. (a -> b) -> a -> b
$ SubMap b v n m
nd) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall nm b (v :: * -> *) n m.
IsName nm =>
nm -> SubMap b v n m -> Maybe [Subdiagram b v n m]
lookupSub forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. IsName a => a -> Name
toName) [nm]
ns)
localize :: forall b v n m. (Metric v, OrderedField n, Semigroup m)
=> QDiagram b v n m -> QDiagram b v n m
localize :: forall b (v :: * -> *) n m.
(Metric v, OrderedField n, Semigroup m) =>
QDiagram b v n m -> QDiagram b v n m
localize = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' ( forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpre (forall l a. (l :>: a) => a -> l
inj (forall m. Monoid m => Deletable m
deleteL :: Deletable (SubMap b v n m)))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall u d a l.
(Semigroup u, Action d u) =>
u -> DUALTree d u a l -> DUALTree d u a l
D.applyUpost (forall l a. (l :>: a) => a -> l
inj (forall m. Monoid m => Deletable m
deleteR :: Deletable (SubMap b v n m)))
)
query :: Monoid m => QDiagram b v n m -> Query v n m
query :: forall m b (v :: * -> *) n.
Monoid m =>
QDiagram b v n m -> Query v n m
query = forall u' u d a l. (Monoid u', u :>: u') => DUALTree d u a l -> u'
getU' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall s (m :: * -> *) a. MonadReader s m => Getting a s a -> m a
view forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped'
mkQD :: Prim b v n -> Envelope v n -> Trace v n -> SubMap b v n m -> Query v n m
-> QDiagram b v n m
mkQD :: forall b (v :: * -> *) n m.
Prim b v n
-> Envelope v n
-> Trace v n
-> SubMap b v n m
-> Query v n m
-> QDiagram b v n m
mkQD Prim b v n
p = forall b (v :: * -> *) n m.
QDiaLeaf b v n m
-> Envelope v n
-> Trace v n
-> SubMap b v n m
-> Query v n m
-> QDiagram b v n m
mkQD' (forall b (v :: * -> *) n m. Prim b v n -> QDiaLeaf b v n m
PrimLeaf Prim b v n
p)
mkQD' :: QDiaLeaf b v n m -> Envelope v n -> Trace v n -> SubMap b v n m -> Query v n m
-> QDiagram b v n m
mkQD' :: forall b (v :: * -> *) n m.
QDiaLeaf b v n m
-> Envelope v n
-> Trace v n
-> SubMap b v n m
-> Query v n m
-> QDiagram b v n m
mkQD' QDiaLeaf b v n m
l Envelope v n
e Trace v n
t SubMap b v n m
n Query v n m
q
= forall b (v :: * -> *) n m.
DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
-> QDiagram b v n m
QD forall a b. (a -> b) -> a -> b
$ forall u l d a. u -> l -> DUALTree d u a l
D.leaf (forall m. m -> Deletable m
toDeletable Envelope v n
e forall a l. a -> l -> a ::: l
*: forall m. m -> Deletable m
toDeletable Trace v n
t forall a l. a -> l -> a ::: l
*: forall m. m -> Deletable m
toDeletable SubMap b v n m
n forall a l. a -> l -> a ::: l
*: Query v n m
q forall a l. a -> l -> a ::: l
*: ()) QDiaLeaf b v n m
l
instance (Metric v, OrderedField n, Semigroup m)
=> Monoid (QDiagram b v n m) where
mempty :: QDiagram b v n m
mempty = forall b (v :: * -> *) n m.
DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
-> QDiagram b v n m
QD forall d u a l. DUALTree d u a l
D.empty
mappend :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
mappend = forall a. Semigroup a => a -> a -> a
(<>)
instance (Metric v, OrderedField n, Semigroup m)
=> Semigroup (QDiagram b v n m) where
(QD DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
d1) <> :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
<> (QD DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
d2) = forall b (v :: * -> *) n m.
DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
-> QDiagram b v n m
QD (DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
d2 forall a. Semigroup a => a -> a -> a
<> DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
d1)
atop :: (OrderedField n, Metric v, Semigroup m)
=> QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
atop :: forall n (v :: * -> *) m b.
(OrderedField n, Metric v, Semigroup m) =>
QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
atop = forall a. Semigroup a => a -> a -> a
(<>)
infixl 6 `atop`
instance Functor (QDiagram b v n) where
fmap :: forall a b. (a -> b) -> QDiagram b v n a -> QDiagram b v n b
fmap a -> b
f = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over (forall s t.
Rewrapping s t =>
(Unwrapped s -> s) -> Iso s t (Unwrapped s) (Unwrapped t)
_Wrapping forall b (v :: * -> *) n m.
DUALTree
(DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)
-> QDiagram b v n m
QD)
( (forall u u' d a l.
(u -> u') -> DUALTree d u a l -> DUALTree d u' a l
D.mapU forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (d, b) (d, c)
second forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (d, b) (d, c)
second)
( (forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (b, d) (c, d)
first forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap) a -> b
f
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (d, b) (d, c)
second forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (a :: * -> * -> *) b c d.
Arrow a =>
a b c -> a (b, d) (c, d)
first forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap) a -> b
f
)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap) a -> b
f
)
instance (Metric v, OrderedField n, Semigroup m)
=> HasStyle (QDiagram b v n m) where
applyStyle :: Style (V (QDiagram b v n m)) (N (QDiagram b v n m))
-> QDiagram b v n m -> QDiagram b v n m
applyStyle = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall d u a l.
(Semigroup d, Semigroup u, Action d u) =>
d -> DUALTree d u a l -> DUALTree d u a l
D.applyD forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l a. (l :>: a) => a -> l
inj
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (forall n m. n -> m :+: n
inR :: Style v n -> Transformation v n :+: Style v n)
instance (Metric v, OrderedField n, Monoid' m)
=> Juxtaposable (QDiagram b v n m) where
juxtapose :: Vn (QDiagram b v n m)
-> QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
juxtapose = forall a. (Enveloped a, HasOrigin a) => Vn a -> a -> a -> a
juxtaposeDefault
instance (Metric v, OrderedField n, Monoid' m)
=> Enveloped (QDiagram b v n m) where
getEnvelope :: QDiagram b v n m
-> Envelope (V (QDiagram b v n m)) (N (QDiagram b v n m))
getEnvelope = forall s (m :: * -> *) a. MonadReader s m => Getting a s a -> m a
view forall n (v :: * -> *) m b.
(OrderedField n, Metric v, Monoid' m) =>
Lens' (QDiagram b v n m) (Envelope v n)
envelope
instance (Metric v, OrderedField n, Semigroup m)
=> Traced (QDiagram b v n m) where
getTrace :: QDiagram b v n m
-> Trace (V (QDiagram b v n m)) (N (QDiagram b v n m))
getTrace = forall s (m :: * -> *) a. MonadReader s m => Getting a s a -> m a
view forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Lens' (QDiagram b v n m) (Trace v n)
trace
instance (Metric v, OrderedField n, Semigroup m)
=> HasOrigin (QDiagram b v n m) where
moveOriginTo :: Point (V (QDiagram b v n m)) (N (QDiagram b v n m))
-> QDiagram b v n m -> QDiagram b v n m
moveOriginTo = forall t. Transformable t => Vn t -> t -> t
translate forall b c a. (b -> c) -> (a -> b) -> a -> c
. (forall (f :: * -> *) a. (Additive f, Num a) => Point f a
origin forall (p :: * -> *) a. (Affine p, Num a) => p a -> p a -> Diff p a
.-.)
instance (OrderedField n, Metric v, Semigroup m)
=> Transformable (QDiagram b v n m) where
transform :: Transformation (V (QDiagram b v n m)) (N (QDiagram b v n m))
-> QDiagram b v n m -> QDiagram b v n m
transform = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall d u a l.
(Semigroup d, Semigroup u, Action d u) =>
d -> DUALTree d u a l -> DUALTree d u a l
D.applyD forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (v :: * -> *) n. Transformation v n -> DownAnnots v n
transfToAnnot
instance (Metric v, OrderedField n, Semigroup m)
=> Qualifiable (QDiagram b v n m) where
.>> :: forall a. IsName a => a -> QDiagram b v n m -> QDiagram b v n m
(.>>) = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall d u a l.
(Semigroup d, Semigroup u, Action d u) =>
d -> DUALTree d u a l -> DUALTree d u a l
D.applyD forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall l a. (l :>: a) => a -> l
inj forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. IsName a => a -> Name
toName
data Subdiagram b v n m = Subdiagram (QDiagram b v n m) (DownAnnots v n)
type instance V (Subdiagram b v n m) = v
type instance N (Subdiagram b v n m) = n
mkSubdiagram :: QDiagram b v n m -> Subdiagram b v n m
mkSubdiagram :: forall b (v :: * -> *) n m. QDiagram b v n m -> Subdiagram b v n m
mkSubdiagram QDiagram b v n m
d = forall b (v :: * -> *) n m.
QDiagram b v n m -> DownAnnots v n -> Subdiagram b v n m
Subdiagram QDiagram b v n m
d forall l. MList l => l
empty
subPoint :: (Metric v, OrderedField n)
=> Point v n -> Subdiagram b v n m
subPoint :: forall (v :: * -> *) n b m.
(Metric v, OrderedField n) =>
Point v n -> Subdiagram b v n m
subPoint Point v n
p = forall b (v :: * -> *) n m.
QDiagram b v n m -> DownAnnots v n -> Subdiagram b v n m
Subdiagram
(forall (v :: * -> *) n b m.
(Metric v, Fractional n) =>
Point v n -> QDiagram b v n m
pointDiagram forall (f :: * -> *) a. (Additive f, Num a) => Point f a
origin)
(forall (v :: * -> *) n. Transformation v n -> DownAnnots v n
transfToAnnot forall a b. (a -> b) -> a -> b
$ forall (v :: * -> *) n. v n -> Transformation v n
translation (Point v n
p forall (p :: * -> *) a. (Affine p, Num a) => p a -> p a -> Diff p a
.-. forall (f :: * -> *) a. (Additive f, Num a) => Point f a
origin))
instance Functor (Subdiagram b v n) where
fmap :: forall a b. (a -> b) -> Subdiagram b v n a -> Subdiagram b v n b
fmap a -> b
f (Subdiagram QDiagram b v n a
d DownAnnots v n
a) = forall b (v :: * -> *) n m.
QDiagram b v n m -> DownAnnots v n -> Subdiagram b v n m
Subdiagram (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> b
f QDiagram b v n a
d) DownAnnots v n
a
instance (OrderedField n, Metric v, Monoid' m)
=> Enveloped (Subdiagram b v n m) where
getEnvelope :: Subdiagram b v n m
-> Envelope (V (Subdiagram b v n m)) (N (Subdiagram b v n m))
getEnvelope (Subdiagram QDiagram b v n m
d DownAnnots v n
a) = forall t. Transformable t => Transformation (V t) (N t) -> t -> t
transform (forall (v :: * -> *) n.
(Additive v, Num n) =>
DownAnnots v n -> Transformation v n
transfFromAnnot DownAnnots v n
a) forall a b. (a -> b) -> a -> b
$ forall a. Enveloped a => a -> Envelope (V a) (N a)
getEnvelope QDiagram b v n m
d
instance (OrderedField n, Metric v, Semigroup m)
=> Traced (Subdiagram b v n m) where
getTrace :: Subdiagram b v n m
-> Trace (V (Subdiagram b v n m)) (N (Subdiagram b v n m))
getTrace (Subdiagram QDiagram b v n m
d DownAnnots v n
a) = forall t. Transformable t => Transformation (V t) (N t) -> t -> t
transform (forall (v :: * -> *) n.
(Additive v, Num n) =>
DownAnnots v n -> Transformation v n
transfFromAnnot DownAnnots v n
a) forall a b. (a -> b) -> a -> b
$ forall a. Traced a => a -> Trace (V a) (N a)
getTrace QDiagram b v n m
d
instance (Metric v, OrderedField n)
=> HasOrigin (Subdiagram b v n m) where
moveOriginTo :: Point (V (Subdiagram b v n m)) (N (Subdiagram b v n m))
-> Subdiagram b v n m -> Subdiagram b v n m
moveOriginTo = forall t. Transformable t => Vn t -> t -> t
translate forall b c a. (b -> c) -> (a -> b) -> a -> c
. (forall (f :: * -> *) a. (Additive f, Num a) => Point f a
origin forall (p :: * -> *) a. (Affine p, Num a) => p a -> p a -> Diff p a
.-.)
instance Transformable (Subdiagram b v n m) where
transform :: Transformation (V (Subdiagram b v n m)) (N (Subdiagram b v n m))
-> Subdiagram b v n m -> Subdiagram b v n m
transform Transformation (V (Subdiagram b v n m)) (N (Subdiagram b v n m))
t (Subdiagram QDiagram b v n m
d DownAnnots v n
a) = forall b (v :: * -> *) n m.
QDiagram b v n m -> DownAnnots v n -> Subdiagram b v n m
Subdiagram QDiagram b v n m
d (forall (v :: * -> *) n. Transformation v n -> DownAnnots v n
transfToAnnot Transformation (V (Subdiagram b v n m)) (N (Subdiagram b v n m))
t forall a. Semigroup a => a -> a -> a
<> DownAnnots v n
a)
location :: (Additive v, Num n) => Subdiagram b v n m -> Point v n
location :: forall (v :: * -> *) n b m.
(Additive v, Num n) =>
Subdiagram b v n m -> Point v n
location (Subdiagram QDiagram b v n m
_ DownAnnots v n
a) = forall t. Transformable t => Transformation (V t) (N t) -> t -> t
transform (forall (v :: * -> *) n.
(Additive v, Num n) =>
DownAnnots v n -> Transformation v n
transfFromAnnot DownAnnots v n
a) forall (f :: * -> *) a. (Additive f, Num a) => Point f a
origin
getSub :: (Metric v, OrderedField n, Semigroup m)
=> Subdiagram b v n m -> QDiagram b v n m
getSub :: forall (v :: * -> *) n m b.
(Metric v, OrderedField n, Semigroup m) =>
Subdiagram b v n m -> QDiagram b v n m
getSub (Subdiagram QDiagram b v n m
d DownAnnots v n
a) = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' (forall d u a l.
(Semigroup d, Semigroup u, Action d u) =>
d -> DUALTree d u a l -> DUALTree d u a l
D.applyD DownAnnots v n
a) QDiagram b v n m
d
rawSub :: Subdiagram b v n m -> QDiagram b v n m
rawSub :: forall b (v :: * -> *) n m. Subdiagram b v n m -> QDiagram b v n m
rawSub (Subdiagram QDiagram b v n m
d DownAnnots v n
_) = QDiagram b v n m
d
newtype SubMap b v n m = SubMap (M.Map Name [Subdiagram b v n m])
instance Wrapped (SubMap b v n m) where
type Unwrapped (SubMap b v n m) = M.Map Name [Subdiagram b v n m]
_Wrapped' :: Iso' (SubMap b v n m) (Unwrapped (SubMap b v n m))
_Wrapped' = forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
iso (\(SubMap Map Name [Subdiagram b v n m]
m) -> Map Name [Subdiagram b v n m]
m) forall b (v :: * -> *) n m.
Map Name [Subdiagram b v n m] -> SubMap b v n m
SubMap
instance Rewrapped (SubMap b v n m) (SubMap b' v' n' m')
type instance V (SubMap b v n m) = v
type instance N (SubMap b v n m) = n
instance Functor (SubMap b v n) where
fmap :: forall a b. (a -> b) -> SubMap b v n a -> SubMap b v n b
fmap = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s t. Rewrapping s t => Iso s t (Unwrapped s) (Unwrapped t)
_Wrapped forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a -> b) -> [a] -> [b]
map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap
instance Semigroup (SubMap b v n m) where
SubMap Map Name [Subdiagram b v n m]
s1 <> :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m
<> SubMap Map Name [Subdiagram b v n m]
s2 = forall b (v :: * -> *) n m.
Map Name [Subdiagram b v n m] -> SubMap b v n m
SubMap forall a b. (a -> b) -> a -> b
$ forall k a. Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a
M.unionWith forall a. [a] -> [a] -> [a]
(++) Map Name [Subdiagram b v n m]
s1 Map Name [Subdiagram b v n m]
s2
instance Monoid (SubMap b v n m) where
mempty :: SubMap b v n m
mempty = forall b (v :: * -> *) n m.
Map Name [Subdiagram b v n m] -> SubMap b v n m
SubMap forall k a. Map k a
M.empty
mappend :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m
mappend = forall a. Semigroup a => a -> a -> a
(<>)
instance (OrderedField n, Metric v)
=> HasOrigin (SubMap b v n m) where
moveOriginTo :: Point (V (SubMap b v n m)) (N (SubMap b v n m))
-> SubMap b v n m -> SubMap b v n m
moveOriginTo = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall t. HasOrigin t => Point (V t) (N t) -> t -> t
moveOriginTo
instance Transformable (SubMap b v n m) where
transform :: Transformation (V (SubMap b v n m)) (N (SubMap b v n m))
-> SubMap b v n m -> SubMap b v n m
transform = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall t. Transformable t => Transformation (V t) (N t) -> t -> t
transform
instance Qualifiable (SubMap b v n m) where
a
a .>> :: forall a. IsName a => a -> SubMap b v n m -> SubMap b v n m
.>> (SubMap Map Name [Subdiagram b v n m]
m) = forall b (v :: * -> *) n m.
Map Name [Subdiagram b v n m] -> SubMap b v n m
SubMap forall a b. (a -> b) -> a -> b
$ forall k2 k1 a. Ord k2 => (k1 -> k2) -> Map k1 a -> Map k2 a
M.mapKeys (a
a forall q a. (Qualifiable q, IsName a) => a -> q -> q
.>>) Map Name [Subdiagram b v n m]
m
fromNames :: IsName a => [(a, Subdiagram b v n m)] -> SubMap b v n m
fromNames :: forall a b (v :: * -> *) n m.
IsName a =>
[(a, Subdiagram b v n m)] -> SubMap b v n m
fromNames = forall b (v :: * -> *) n m.
Map Name [Subdiagram b v n m] -> SubMap b v n m
SubMap forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall k a. Ord k => (a -> a -> a) -> [(k, a)] -> Map k a
M.fromListWith forall a. [a] -> [a] -> [a]
(++) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a -> b) -> [a] -> [b]
map (forall a. IsName a => a -> Name
toName forall (a :: * -> * -> *) b c b' c'.
Arrow a =>
a b c -> a b' c' -> a (b, b') (c, c')
*** (forall a. a -> [a] -> [a]
:[]))
rememberAs :: IsName a => a -> QDiagram b v n m -> SubMap b v n m -> SubMap b v n m
rememberAs :: forall a b (v :: * -> *) n m.
IsName a =>
a -> QDiagram b v n m -> SubMap b v n m -> SubMap b v n m
rememberAs a
n QDiagram b v n m
b = forall s t a b. ASetter s t a b -> (a -> b) -> s -> t
over forall s. Wrapped s => Iso' s (Unwrapped s)
_Wrapped' forall a b. (a -> b) -> a -> b
$ forall k a. Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a
M.insertWith forall a. [a] -> [a] -> [a]
(++) (forall a. IsName a => a -> Name
toName a
n) [forall b (v :: * -> *) n m. QDiagram b v n m -> Subdiagram b v n m
mkSubdiagram QDiagram b v n m
b]
instance Action Name (SubMap b v n m) where
act :: Name -> SubMap b v n m -> SubMap b v n m
act = forall q a. (Qualifiable q, IsName a) => a -> q -> q
(.>>)
instance Action Name a => Action Name (Deletable a) where
act :: Name -> Deletable a -> Deletable a
act Name
n (Deletable Int
l a
a Int
r) = forall m. Int -> m -> Int -> Deletable m
Deletable Int
l (forall m s. Action m s => m -> s -> s
act Name
n a
a) Int
r
instance Action Name (Query v n m)
instance Action Name (Envelope v n)
instance Action Name (Trace v n)
lookupSub :: IsName nm => nm -> SubMap b v n m -> Maybe [Subdiagram b v n m]
lookupSub :: forall nm b (v :: * -> *) n m.
IsName nm =>
nm -> SubMap b v n m -> Maybe [Subdiagram b v n m]
lookupSub nm
a (SubMap Map Name [Subdiagram b v n m]
m)
= forall k a. Ord k => k -> Map k a -> Maybe a
M.lookup Name
n Map Name [Subdiagram b v n m]
m forall (m :: * -> *) a. MonadPlus m => m a -> m a -> m a
`mplus`
(forall {a} {b}. [(a, [b])] -> Maybe [b]
flattenNames forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. (a -> Bool) -> [a] -> [a]
filter ((Name
n Name -> Name -> Bool
`nameSuffixOf`) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a, b) -> a
fst) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall k a. Map k a -> [(k, a)]
M.assocs forall a b. (a -> b) -> a -> b
$ Map Name [Subdiagram b v n m]
m)
where (Name [AName]
n1) nameSuffixOf :: Name -> Name -> Bool
`nameSuffixOf` (Name [AName]
n2) = [AName]
n1 forall a. Eq a => [a] -> [a] -> Bool
`isSuffixOf` [AName]
n2
flattenNames :: [(a, [b])] -> Maybe [b]
flattenNames [] = forall a. Maybe a
Nothing
flattenNames [(a, [b])]
xs = forall a. a -> Maybe a
Just forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap forall a b. (a, b) -> b
snd forall a b. (a -> b) -> a -> b
$ [(a, [b])]
xs
n :: Name
n = forall a. IsName a => a -> Name
toName nm
a
data Prim b v n where
Prim :: (Transformable p, Typeable p, Renderable p b) => p -> Prim b (V p) (N p)
_Prim :: (Typeable p, Renderable p b) => Prism' (Prim b (V p) (N p)) p
_Prim :: forall p b.
(Typeable p, Renderable p b) =>
Prism' (Prim b (V p) (N p)) p
_Prim = forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' forall p b.
(Transformable p, Typeable p, Renderable p b) =>
p -> Prim b (V p) (N p)
Prim (\(Prim p
p) -> forall a b. (Typeable a, Typeable b) => a -> Maybe b
cast p
p)
type instance V (Prim b v n) = v
type instance N (Prim b v n) = n
instance Transformable (Prim b v n) where
transform :: Transformation (V (Prim b v n)) (N (Prim b v n))
-> Prim b v n -> Prim b v n
transform Transformation (V (Prim b v n)) (N (Prim b v n))
t (Prim p
p) = forall p b.
(Transformable p, Typeable p, Renderable p b) =>
p -> Prim b (V p) (N p)
Prim (forall t. Transformable t => Transformation (V t) (N t) -> t -> t
transform Transformation (V (Prim b v n)) (N (Prim b v n))
t p
p)
instance Renderable (Prim b v n) b where
render :: b -> Prim b v n -> Render b (V (Prim b v n)) (N (Prim b v n))
render b
b (Prim p
p) = forall t b. Renderable t b => b -> t -> Render b (V t) (N t)
render b
b p
p
type DTree b v n a = Tree (DNode b v n a)
data DNode b v n a = DStyle (Style v n)
| DTransform (Transformation v n)
| DAnnot a
| DDelay
| DPrim (Prim b v n)
| DEmpty
type RTree b v n a = Tree (RNode b v n a)
data RNode b v n a = RStyle (Style v n)
| RAnnot a
| RPrim (Prim b v n)
| REmpty
_RStyle :: Prism' (RNode b v n a) (Style v n)
_RStyle :: forall b (v :: * -> *) n a. Prism' (RNode b v n a) (Style v n)
_RStyle = forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' forall b (v :: * -> *) n a. Style v n -> RNode b v n a
RStyle forall a b. (a -> b) -> a -> b
$ \RNode b v n a
n -> case RNode b v n a
n of RStyle Style v n
s -> forall a. a -> Maybe a
Just Style v n
s; RNode b v n a
_ -> forall a. Maybe a
Nothing
_RAnnot :: Prism' (RNode b v n a) a
_RAnnot :: forall b (v :: * -> *) n a. Prism' (RNode b v n a) a
_RAnnot = forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' forall b (v :: * -> *) n a. a -> RNode b v n a
RAnnot forall a b. (a -> b) -> a -> b
$ \RNode b v n a
n -> case RNode b v n a
n of RAnnot a
a -> forall a. a -> Maybe a
Just a
a; RNode b v n a
_ -> forall a. Maybe a
Nothing
_RPrim :: Prism' (RNode b v n a) (Prim b v n)
_RPrim :: forall b (v :: * -> *) n a. Prism' (RNode b v n a) (Prim b v n)
_RPrim = forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' forall b (v :: * -> *) n a. Prim b v n -> RNode b v n a
RPrim forall a b. (a -> b) -> a -> b
$ \RNode b v n a
n -> case RNode b v n a
n of RPrim Prim b v n
p -> forall a. a -> Maybe a
Just Prim b v n
p; RNode b v n a
_ -> forall a. Maybe a
Nothing
_REmpty :: Prism' (RNode b v n a) ()
_REmpty :: forall b (v :: * -> *) n a. Prism' (RNode b v n a) ()
_REmpty = forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (forall a b. a -> b -> a
const forall b (v :: * -> *) n a. RNode b v n a
REmpty) forall a b. (a -> b) -> a -> b
$ \RNode b v n a
n -> case RNode b v n a
n of RNode b v n a
REmpty -> forall a. a -> Maybe a
Just (); RNode b v n a
_ -> forall a. Maybe a
Nothing
class Backend b v n where
data Render b v n :: Type
type Result b v n :: Type
data Options b v n :: Type
adjustDia :: (Additive v, Monoid' m, Num n) => b -> Options b v n
-> QDiagram b v n m -> (Options b v n, Transformation v n, QDiagram b v n m)
adjustDia b
_ Options b v n
o QDiagram b v n m
d = (Options b v n
o,forall a. Monoid a => a
mempty,QDiagram b v n m
d)
renderRTree :: b -> Options b v n -> RTree b v n Annotation -> Result b v n
type D v n = QDiagram NullBackend v n Any
data NullBackend
deriving Typeable
instance Semigroup (Render NullBackend v n) where
Render NullBackend v n
_ <> :: Render NullBackend v n
-> Render NullBackend v n -> Render NullBackend v n
<> Render NullBackend v n
_ = forall (v :: * -> *) n. Render NullBackend v n
NullBackendRender
instance Monoid (Render NullBackend v n) where
mempty :: Render NullBackend v n
mempty = forall (v :: * -> *) n. Render NullBackend v n
NullBackendRender
#if !MIN_VERSION_base(4,11,0)
mappend = (<>)
#endif
instance Backend NullBackend v n where
data Render NullBackend v n = NullBackendRender
type Result NullBackend v n = ()
data Options NullBackend v n
renderRTree :: NullBackend
-> Options NullBackend v n
-> RTree NullBackend v n Annotation
-> Result NullBackend v n
renderRTree NullBackend
_ Options NullBackend v n
_ RTree NullBackend v n Annotation
_ = ()
class Transformable t => Renderable t b where
render :: b -> t -> Render b (V t) (N t)