Safe Haskell	None
Language	Haskell2010

Chart

Synopsis

Documentation

data SVG :: * #

SVG is simply a token used to identify this rendering backend (to aid type inference).

Instances

Show SVG
Methods showsPrec :: Int -> SVG -> ShowS # show :: SVG -> String # showList :: [SVG] -> ShowS #
SVGFloat n => Backend SVG V2 n
Associated Types data Render SVG (V2 :: * -> ) n :: # type Result SVG (V2 :: * -> ) n :: # data Options SVG (V2 :: * -> ) n :: # Methods adjustDia :: (Additive V2, Monoid' m, Num n) => SVG -> Options SVG V2 n -> QDiagram SVG V2 n m -> (Options SVG V2 n, Transformation V2 n, QDiagram SVG V2 n m) # renderRTree :: SVG -> Options SVG V2 n -> RTree SVG V2 n Annotation -> Result SVG V2 n #
SVGFloat n => Renderable (Text n) SVG
Methods render :: SVG -> Text n -> Render SVG (V (Text n)) (N (Text n)) #
SVGFloat n => Renderable (DImage n Embedded) SVG
Methods render :: SVG -> DImage n Embedded -> Render SVG (V (DImage n Embedded)) (N (DImage n Embedded)) #
SVGFloat n => Renderable (DImage n (Native Img)) SVG
Methods render :: SVG -> DImage n (Native Img) -> Render SVG (V (DImage n (Native Img))) (N (DImage n (Native Img))) #
SVGFloat n => Renderable (Path V2 n) SVG
Methods render :: SVG -> Path V2 n -> Render SVG (V (Path V2 n)) (N (Path V2 n)) #
Monoid (Render SVG V2 n)
Methods mempty :: Render SVG V2 n # mappend :: Render SVG V2 n -> Render SVG V2 n -> Render SVG V2 n # mconcat :: [Render SVG V2 n] -> Render SVG V2 n #
Hashable n => Hashable (Options SVG V2 n)
Methods hashWithSalt :: Int -> Options SVG V2 n -> Int # hash :: Options SVG V2 n -> Int #
type V SVG
type V SVG = V2
type N SVG
type N SVG = Double
data Options SVG V2
data Options SVG V2 = SVGOptions { _size :: SizeSpec V2 n _svgDefinitions :: Maybe Element _idPrefix :: Text _svgAttributes :: [Attribute] _generateDoctype :: Bool }
data Render SVG V2
data Render SVG V2 = R (SvgRenderM n)
type Result SVG V2 n
type Result SVG V2 n = Element

data V4 a :: * -> * #

A 4-dimensional vector.

Constructors

V4 ~a ~a ~a ~a

Instances

Monad V4
Methods (>>=) :: V4 a -> (a -> V4 b) -> V4 b # (>>) :: V4 a -> V4 b -> V4 b # return :: a -> V4 a # fail :: String -> V4 a #
Functor V4
Methods fmap :: (a -> b) -> V4 a -> V4 b # (<$) :: a -> V4 b -> V4 a #
MonadFix V4
Methods mfix :: (a -> V4 a) -> V4 a #
Applicative V4
Methods pure :: a -> V4 a # (<>) :: V4 (a -> b) -> V4 a -> V4 b # (>) :: V4 a -> V4 b -> V4 b # (<*) :: V4 a -> V4 b -> V4 a #
Foldable V4
Methods fold :: Monoid m => V4 m -> m # foldMap :: Monoid m => (a -> m) -> V4 a -> m # foldr :: (a -> b -> b) -> b -> V4 a -> b # foldr' :: (a -> b -> b) -> b -> V4 a -> b # foldl :: (b -> a -> b) -> b -> V4 a -> b # foldl' :: (b -> a -> b) -> b -> V4 a -> b # foldr1 :: (a -> a -> a) -> V4 a -> a # foldl1 :: (a -> a -> a) -> V4 a -> a # toList :: V4 a -> [a] # null :: V4 a -> Bool # length :: V4 a -> Int # elem :: Eq a => a -> V4 a -> Bool # maximum :: Ord a => V4 a -> a # minimum :: Ord a => V4 a -> a # sum :: Num a => V4 a -> a # product :: Num a => V4 a -> a #
Traversable V4
Methods traverse :: Applicative f => (a -> f b) -> V4 a -> f (V4 b) # sequenceA :: Applicative f => V4 (f a) -> f (V4 a) # mapM :: Monad m => (a -> m b) -> V4 a -> m (V4 b) # sequence :: Monad m => V4 (m a) -> m (V4 a) #
Generic1 V4
Associated Types type Rep1 (V4 :: * -> ) :: -> * # Methods from1 :: V4 a -> Rep1 V4 a # to1 :: Rep1 V4 a -> V4 a #
Apply V4
Methods (<.>) :: V4 (a -> b) -> V4 a -> V4 b # (.>) :: V4 a -> V4 b -> V4 b # (<.) :: V4 a -> V4 b -> V4 a #
Distributive V4
Methods distribute :: Functor f => f (V4 a) -> V4 (f a) # collect :: Functor f => (a -> V4 b) -> f a -> V4 (f b) # distributeM :: Monad m => m (V4 a) -> V4 (m a) # collectM :: Monad m => (a -> V4 b) -> m a -> V4 (m b) #
Representable V4
Associated Types type Rep (V4 :: * -> ) :: # Methods tabulate :: (Rep V4 -> a) -> V4 a # index :: V4 a -> Rep V4 -> a #
Eq1 V4
Methods liftEq :: (a -> b -> Bool) -> V4 a -> V4 b -> Bool #
Ord1 V4
Methods liftCompare :: (a -> b -> Ordering) -> V4 a -> V4 b -> Ordering #
Read1 V4
Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (V4 a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [V4 a] #
Show1 V4
Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V4 a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V4 a] -> ShowS #
MonadZip V4
Methods mzip :: V4 a -> V4 b -> V4 (a, b) # mzipWith :: (a -> b -> c) -> V4 a -> V4 b -> V4 c # munzip :: V4 (a, b) -> (V4 a, V4 b) #
Serial1 V4
Methods serializeWith :: MonadPut m => (a -> m ()) -> V4 a -> m () # deserializeWith :: MonadGet m => m a -> m (V4 a) #
Additive V4
Methods zero :: Num a => V4 a # (^+^) :: Num a => V4 a -> V4 a -> V4 a # (^-^) :: Num a => V4 a -> V4 a -> V4 a # lerp :: Num a => a -> V4 a -> V4 a -> V4 a # liftU2 :: (a -> a -> a) -> V4 a -> V4 a -> V4 a # liftI2 :: (a -> b -> c) -> V4 a -> V4 b -> V4 c #
Metric V4
Methods dot :: Num a => V4 a -> V4 a -> a # quadrance :: Num a => V4 a -> a # qd :: Num a => V4 a -> V4 a -> a # distance :: Floating a => V4 a -> V4 a -> a # norm :: Floating a => V4 a -> a # signorm :: Floating a => V4 a -> V4 a #
Affine V4
Associated Types type Diff (V4 :: * -> ) :: -> * # Methods (.-.) :: Num a => V4 a -> V4 a -> Diff V4 a # (.+^) :: Num a => V4 a -> Diff V4 a -> V4 a # (.-^) :: Num a => V4 a -> Diff V4 a -> V4 a #
Traversable1 V4
Methods traverse1 :: Apply f => (a -> f b) -> V4 a -> f (V4 b) # sequence1 :: Apply f => V4 (f b) -> f (V4 b) #
R1 V4
Methods _x :: Functor f => (a -> f a) -> V4 a -> f (V4 a) #
R2 V4
Methods _y :: Functor f => (a -> f a) -> V4 a -> f (V4 a) # _xy :: Functor f => (V2 a -> f (V2 a)) -> V4 a -> f (V4 a) #
R3 V4
Methods _z :: Functor f => (a -> f a) -> V4 a -> f (V4 a) # _xyz :: Functor f => (V3 a -> f (V3 a)) -> V4 a -> f (V4 a) #
R4 V4
Methods _w :: Functor f => (a -> f a) -> V4 a -> f (V4 a) # _xyzw :: Functor f => (V4 a -> f (V4 a)) -> V4 a -> f (V4 a) #
Finite V4
Associated Types type Size (V4 :: * -> *) :: Nat # Methods toV :: V4 a -> V Nat (Size V4) a # fromV :: V Nat (Size V4) a -> V4 a #
Bind V4
Methods (>>-) :: V4 a -> (a -> V4 b) -> V4 b # join :: V4 (V4 a) -> V4 a #
Foldable1 V4
Methods fold1 :: Semigroup m => V4 m -> m # foldMap1 :: Semigroup m => (a -> m) -> V4 a -> m #
Unbox a => Vector Vector (V4 a)
Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V4 a) -> m (Vector (V4 a)) # basicUnsafeThaw :: PrimMonad m => Vector (V4 a) -> m (Mutable Vector (PrimState m) (V4 a)) # basicLength :: Vector (V4 a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (V4 a) -> Vector (V4 a) # basicUnsafeIndexM :: Monad m => Vector (V4 a) -> Int -> m (V4 a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V4 a) -> Vector (V4 a) -> m () # elemseq :: Vector (V4 a) -> V4 a -> b -> b #
Unbox a => MVector MVector (V4 a)
Methods basicLength :: MVector s (V4 a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (V4 a) -> MVector s (V4 a) # basicOverlaps :: MVector s (V4 a) -> MVector s (V4 a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V4 a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (V4 a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> V4 a -> m (MVector (PrimState m) (V4 a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V4 a) -> Int -> m (V4 a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V4 a) -> Int -> V4 a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (V4 a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (V4 a) -> V4 a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V4 a) -> MVector (PrimState m) (V4 a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V4 a) -> MVector (PrimState m) (V4 a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V4 a) -> Int -> m (MVector (PrimState m) (V4 a)) #
Bounded a => Bounded (V4 a)
Methods minBound :: V4 a # maxBound :: V4 a #
Eq a => Eq (V4 a)
Methods (==) :: V4 a -> V4 a -> Bool # (/=) :: V4 a -> V4 a -> Bool #
Floating a => Floating (V4 a)
Methods pi :: V4 a # exp :: V4 a -> V4 a # log :: V4 a -> V4 a # sqrt :: V4 a -> V4 a # (**) :: V4 a -> V4 a -> V4 a # logBase :: V4 a -> V4 a -> V4 a # sin :: V4 a -> V4 a # cos :: V4 a -> V4 a # tan :: V4 a -> V4 a # asin :: V4 a -> V4 a # acos :: V4 a -> V4 a # atan :: V4 a -> V4 a # sinh :: V4 a -> V4 a # cosh :: V4 a -> V4 a # tanh :: V4 a -> V4 a # asinh :: V4 a -> V4 a # acosh :: V4 a -> V4 a # atanh :: V4 a -> V4 a # log1p :: V4 a -> V4 a # expm1 :: V4 a -> V4 a # log1pexp :: V4 a -> V4 a # log1mexp :: V4 a -> V4 a #
Fractional a => Fractional (V4 a)
Methods (/) :: V4 a -> V4 a -> V4 a # recip :: V4 a -> V4 a # fromRational :: Rational -> V4 a #
Data a => Data (V4 a)
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> V4 a -> c (V4 a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (V4 a) # toConstr :: V4 a -> Constr # dataTypeOf :: V4 a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (V4 a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V4 a)) # gmapT :: (forall b. Data b => b -> b) -> V4 a -> V4 a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V4 a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V4 a -> r # gmapQ :: (forall d. Data d => d -> u) -> V4 a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> V4 a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> V4 a -> m (V4 a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> V4 a -> m (V4 a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> V4 a -> m (V4 a) #
Num a => Num (V4 a)
Methods (+) :: V4 a -> V4 a -> V4 a # (-) :: V4 a -> V4 a -> V4 a # (*) :: V4 a -> V4 a -> V4 a # negate :: V4 a -> V4 a # abs :: V4 a -> V4 a # signum :: V4 a -> V4 a # fromInteger :: Integer -> V4 a #
Ord a => Ord (V4 a)
Methods compare :: V4 a -> V4 a -> Ordering # (<) :: V4 a -> V4 a -> Bool # (<=) :: V4 a -> V4 a -> Bool # (>) :: V4 a -> V4 a -> Bool # (>=) :: V4 a -> V4 a -> Bool # max :: V4 a -> V4 a -> V4 a # min :: V4 a -> V4 a -> V4 a #
Read a => Read (V4 a)
Methods readsPrec :: Int -> ReadS (V4 a) # readList :: ReadS [V4 a] # readPrec :: ReadPrec (V4 a) # readListPrec :: ReadPrec [V4 a] #
Show a => Show (V4 a)
Methods showsPrec :: Int -> V4 a -> ShowS # show :: V4 a -> String # showList :: [V4 a] -> ShowS #
Ix a => Ix (V4 a)
Methods range :: (V4 a, V4 a) -> [V4 a] # index :: (V4 a, V4 a) -> V4 a -> Int # unsafeIndex :: (V4 a, V4 a) -> V4 a -> Int inRange :: (V4 a, V4 a) -> V4 a -> Bool # rangeSize :: (V4 a, V4 a) -> Int # unsafeRangeSize :: (V4 a, V4 a) -> Int
Generic (V4 a)
Associated Types type Rep (V4 a) :: * -> * # Methods from :: V4 a -> Rep (V4 a) x # to :: Rep (V4 a) x -> V4 a #
Storable a => Storable (V4 a)
Methods sizeOf :: V4 a -> Int # alignment :: V4 a -> Int # peekElemOff :: Ptr (V4 a) -> Int -> IO (V4 a) # pokeElemOff :: Ptr (V4 a) -> Int -> V4 a -> IO () # peekByteOff :: Ptr b -> Int -> IO (V4 a) # pokeByteOff :: Ptr b -> Int -> V4 a -> IO () # peek :: Ptr (V4 a) -> IO (V4 a) # poke :: Ptr (V4 a) -> V4 a -> IO () #
Binary a => Binary (V4 a)
Methods put :: V4 a -> Put # get :: Get (V4 a) # putList :: [V4 a] -> Put #
Serial a => Serial (V4 a)
Methods serialize :: MonadPut m => V4 a -> m () # deserialize :: MonadGet m => m (V4 a) #
Serialize a => Serialize (V4 a)
Methods put :: Putter (V4 a) # get :: Get (V4 a) #
NFData a => NFData (V4 a)
Methods rnf :: V4 a -> () #
Ixed (V4 a)
Methods ix :: Index (V4 a) -> Traversal' (V4 a) (IxValue (V4 a)) #
Coordinates (V4 n)
Associated Types type FinalCoord (V4 n) :: * # type PrevDim (V4 n) :: * # type Decomposition (V4 n) :: * # Methods (^&) :: PrevDim (V4 n) -> FinalCoord (V4 n) -> V4 n # pr :: PrevDim (V4 n) -> FinalCoord (V4 n) -> V4 n # coords :: V4 n -> Decomposition (V4 n) #
Hashable a => Hashable (V4 a)
Methods hashWithSalt :: Int -> V4 a -> Int # hash :: V4 a -> Int #
Unbox a => Unbox (V4 a)

Epsilon a => Epsilon (V4 a)
Methods nearZero :: V4 a -> Bool #
TraversableWithIndex (E V4) V4
Methods itraverse :: Applicative f => (E V4 -> a -> f b) -> V4 a -> f (V4 b) # itraversed :: (Indexable (E V4) p, Applicative f) => p a (f b) -> V4 a -> f (V4 b) #
FoldableWithIndex (E V4) V4
Methods ifoldMap :: Monoid m => (E V4 -> a -> m) -> V4 a -> m # ifolded :: (Indexable (E V4) p, Contravariant f, Applicative f) => p a (f a) -> V4 a -> f (V4 a) # ifoldr :: (E V4 -> a -> b -> b) -> b -> V4 a -> b # ifoldl :: (E V4 -> b -> a -> b) -> b -> V4 a -> b # ifoldr' :: (E V4 -> a -> b -> b) -> b -> V4 a -> b # ifoldl' :: (E V4 -> b -> a -> b) -> b -> V4 a -> b #
FunctorWithIndex (E V4) V4
Methods imap :: (E V4 -> a -> b) -> V4 a -> V4 b # imapped :: (Indexable (E V4) p, Settable f) => p a (f b) -> V4 a -> f (V4 b) #
Each (V4 a) (V4 b) a b
Methods each :: Traversal (V4 a) (V4 b) a b #
type Rep1 V4
type Rep1 V4 = D1 (MetaData "V4" "Linear.V4" "linear-1.20.6-4xseta4cakqLwwBWyZMmSa" False) (C1 (MetaCons "V4" PrefixI False) ((::) ((::) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1))))
type Rep V4
type Rep V4 = E V4
type Diff V4
type Diff V4 = V4
type Size V4
type Size V4 = 4
data MVector s (V4 a)
data MVector s (V4 a) = MV_V4 ~Int ~(MVector s a)
type Rep (V4 a)
type Rep (V4 a) = D1 (MetaData "V4" "Linear.V4" "linear-1.20.6-4xseta4cakqLwwBWyZMmSa" False) (C1 (MetaCons "V4" PrefixI False) ((::) ((::) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a))) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a)))))
type IxValue (V4 a)
type IxValue (V4 a) = a
type Index (V4 a)
type Index (V4 a) = E V4
data Vector (V4 a)
data Vector (V4 a) = V_V4 ~Int ~(Vector a)
type Decomposition (V4 n)
type Decomposition (V4 n) = (:&) ((:&) ((:&) n n) n) n
type PrevDim (V4 n)
type PrevDim (V4 n) = V3 n
type FinalCoord (V4 n)
type FinalCoord (V4 n) = n

zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e] #

The zipWith4 function takes a function which combines four elements, as well as four lists and returns a list of their point-wise combination, analogous to zipWith.

module Diagrams.Prelude