yeamer-0.1.2.0: Yesod-based server for interactive presentation slides

Copyright(c) Justus Sagemüller 2017
LicenseGPL v3
Maintainer(@) jsag $ hvl.no
Stabilityexperimental
Portabilityportable
Safe HaskellNone
LanguageHaskell2010

Presentation.Yeamer.Maths.Unicode.MathLatin_RomanGreek

Description

Convenience module, re-exporting the necessary LaTeX builders for writing maths in a Yeamer presentation.

Synopsis

Documentation

(<>) :: Semigroup a => a -> a -> a infixr 6 #

An associative operation.

class Semigroup a => Monoid a where #

The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following laws:

The method names refer to the monoid of lists under concatenation, but there are many other instances.

Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product.

NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

Minimal complete definition

mempty

Methods

mempty :: a #

Identity of mappend

mappend :: a -> a -> a #

An associative operation

NOTE: This method is redundant and has the default implementation mappend = '(<>)' since base-4.11.0.0.

mconcat :: [a] -> a #

Fold a list using the monoid.

For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

Instances
Monoid Ordering

Since: base-2.1

Instance details

Defined in GHC.Base

Monoid ()

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: () #

mappend :: () -> () -> () #

mconcat :: [()] -> () #

Monoid All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: All #

mappend :: All -> All -> All #

mconcat :: [All] -> All #

Monoid Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Any #

mappend :: Any -> Any -> Any #

mconcat :: [Any] -> Any #

Monoid ShortByteString 
Instance details

Defined in Data.ByteString.Short.Internal

Monoid ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Monoid ByteString 
Instance details

Defined in Data.ByteString.Internal

Monoid Builder 
Instance details

Defined in Data.ByteString.Builder.Internal

Monoid IntSet 
Instance details

Defined in Data.IntSet.Internal

Monoid Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Methods

mempty :: Doc #

mappend :: Doc -> Doc -> Doc #

mconcat :: [Doc] -> Doc #

Monoid Builder 
Instance details

Defined in Data.Text.Internal.Builder

Monoid Series 
Instance details

Defined in Data.Aeson.Encoding.Internal

Methods

mempty :: Series #

mappend :: Series -> Series -> Series #

mconcat :: [Series] -> Series #

Monoid More 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

mempty :: More #

mappend :: More -> More -> More #

mconcat :: [More] -> More #

Monoid Encoding 
Instance details

Defined in Flat.Encoder.Strict

Methods

mempty :: Encoding #

mappend :: Encoding -> Encoding -> Encoding #

mconcat :: [Encoding] -> Encoding #

Monoid CalendarDiffDays 
Instance details

Defined in Data.Time.Calendar.Compat

Methods

mempty :: CalendarDiffDays #

mappend :: CalendarDiffDays -> CalendarDiffDays -> CalendarDiffDays #

mconcat :: [CalendarDiffDays] -> CalendarDiffDays #

Monoid CalendarDiffTime 
Instance details

Defined in Data.Time.LocalTime.Compat

Methods

mempty :: CalendarDiffTime #

mappend :: CalendarDiffTime -> CalendarDiffTime -> CalendarDiffTime #

mconcat :: [CalendarDiffTime] -> CalendarDiffTime #

Monoid ByteArray 
Instance details

Defined in Data.Primitive.ByteArray

Methods

mempty :: ByteArray #

mappend :: ByteArray -> ByteArray -> ByteArray #

mconcat :: [ByteArray] -> ByteArray #

Monoid LiteApp 
Instance details

Defined in Yesod.Core.Internal.LiteApp

Methods

mempty :: LiteApp #

mappend :: LiteApp -> LiteApp -> LiteApp #

mconcat :: [LiteApp] -> LiteApp #

Monoid Enctype 
Instance details

Defined in Yesod.Form.Types

Methods

mempty :: Enctype #

mappend :: Enctype -> Enctype -> Enctype #

mconcat :: [Enctype] -> Enctype #

Monoid String 
Instance details

Defined in Basement.UTF8.Base

Methods

mempty :: String #

mappend :: String -> String -> String #

mconcat :: [String] -> String #

Monoid LogStr 
Instance details

Defined in System.Log.FastLogger.LogStr

Methods

mempty :: LogStr #

mappend :: LogStr -> LogStr -> LogStr #

mconcat :: [LogStr] -> LogStr #

Monoid Mixin 
Instance details

Defined in Text.Internal.Css

Methods

mempty :: Mixin #

mappend :: Mixin -> Mixin -> Mixin #

mconcat :: [Mixin] -> Mixin #

Monoid ChoiceString 
Instance details

Defined in Text.Blaze.Internal

Methods

mempty :: ChoiceString #

mappend :: ChoiceString -> ChoiceString -> ChoiceString #

mconcat :: [ChoiceString] -> ChoiceString #

Monoid Javascript 
Instance details

Defined in Text.Julius

Methods

mempty :: Javascript #

mappend :: Javascript -> Javascript -> Javascript #

mconcat :: [Javascript] -> Javascript #

Monoid Attribute 
Instance details

Defined in Text.Blaze.Internal

Methods

mempty :: Attribute #

mappend :: Attribute -> Attribute -> Attribute #

mconcat :: [Attribute] -> Attribute #

Monoid AttributeValue 
Instance details

Defined in Text.Blaze.Internal

Methods

mempty :: AttributeValue #

mappend :: AttributeValue -> AttributeValue -> AttributeValue #

mconcat :: [AttributeValue] -> AttributeValue #

Monoid LaTeX 
Instance details

Defined in Text.LaTeX.Base.Syntax

Methods

mempty :: LaTeX #

mappend :: LaTeX -> LaTeX -> LaTeX #

mconcat :: [LaTeX] -> LaTeX #

Monoid Meta 
Instance details

Defined in Text.Pandoc.Definition

Methods

mempty :: Meta #

mappend :: Meta -> Meta -> Meta #

mconcat :: [Meta] -> Meta #

Monoid Pandoc 
Instance details

Defined in Text.Pandoc.Definition

Methods

mempty :: Pandoc #

mappend :: Pandoc -> Pandoc -> Pandoc #

mconcat :: [Pandoc] -> Pandoc #

Monoid [a]

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: [a] #

mappend :: [a] -> [a] -> [a] #

mconcat :: [[a]] -> [a] #

Semigroup a => Monoid (Maybe a)

Lift a semigroup into Maybe forming a Monoid according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup S may be turned into a monoid simply by adjoining an element e not in S and defining e*e = e and e*s = s = s*e for all s ∈ S."

Since 4.11.0: constraint on inner a value generalised from Monoid to Semigroup.

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Maybe a #

mappend :: Maybe a -> Maybe a -> Maybe a #

mconcat :: [Maybe a] -> Maybe a #

Monoid a => Monoid (IO a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mempty :: IO a #

mappend :: IO a -> IO a -> IO a #

mconcat :: [IO a] -> IO a #

Monoid p => Monoid (Par1 p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: Par1 p #

mappend :: Par1 p -> Par1 p -> Par1 p #

mconcat :: [Par1 p] -> Par1 p #

(Ord a, Bounded a) => Monoid (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Min a #

mappend :: Min a -> Min a -> Min a #

mconcat :: [Min a] -> Min a #

(Ord a, Bounded a) => Monoid (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Max a #

mappend :: Max a -> Max a -> Max a #

mconcat :: [Max a] -> Max a #

Monoid m => Monoid (WrappedMonoid m)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Semigroup a => Monoid (Option a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Option a #

mappend :: Option a -> Option a -> Option a #

mconcat :: [Option a] -> Option a #

Monoid a => Monoid (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

mempty :: Identity a #

mappend :: Identity a -> Identity a -> Identity a #

mconcat :: [Identity a] -> Identity a #

Monoid (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

mempty :: First a #

mappend :: First a -> First a -> First a #

mconcat :: [First a] -> First a #

Monoid (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

mempty :: Last a #

mappend :: Last a -> Last a -> Last a #

mconcat :: [Last a] -> Last a #

Monoid a => Monoid (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Dual a #

mappend :: Dual a -> Dual a -> Dual a #

mconcat :: [Dual a] -> Dual a #

Monoid (Endo a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Endo a #

mappend :: Endo a -> Endo a -> Endo a #

mconcat :: [Endo a] -> Endo a #

Num a => Monoid (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Sum a #

mappend :: Sum a -> Sum a -> Sum a #

mconcat :: [Sum a] -> Sum a #

Num a => Monoid (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Product a #

mappend :: Product a -> Product a -> Product a #

mconcat :: [Product a] -> Product a #

Monoid a => Monoid (Down a)

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

mempty :: Down a #

mappend :: Down a -> Down a -> Down a #

mconcat :: [Down a] -> Down a #

Monoid (IntMap a) 
Instance details

Defined in Data.IntMap.Internal

Methods

mempty :: IntMap a #

mappend :: IntMap a -> IntMap a -> IntMap a #

mconcat :: [IntMap a] -> IntMap a #

Monoid (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

mempty :: Seq a #

mappend :: Seq a -> Seq a -> Seq a #

mconcat :: [Seq a] -> Seq a #

Ord a => Monoid (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

mempty :: Set a #

mappend :: Set a -> Set a -> Set a #

mconcat :: [Set a] -> Set a #

Monoid (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

mempty :: Doc a #

mappend :: Doc a -> Doc a -> Doc a #

mconcat :: [Doc a] -> Doc a #

Monoid (Result a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: Result a #

mappend :: Result a -> Result a -> Result a #

mconcat :: [Result a] -> Result a #

Monoid (IResult a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: IResult a #

mappend :: IResult a -> IResult a -> IResult a #

mconcat :: [IResult a] -> IResult a #

Monoid (DList a) 
Instance details

Defined in Data.DList.Internal

Methods

mempty :: DList a #

mappend :: DList a -> DList a -> DList a #

mconcat :: [DList a] -> DList a #

(Hashable a, Eq a) => Monoid (HashSet a) 
Instance details

Defined in Data.HashSet.Internal

Methods

mempty :: HashSet a #

mappend :: HashSet a -> HashSet a -> HashSet a #

mconcat :: [HashSet a] -> HashSet a #

Monoid (Parser a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: Parser a #

mappend :: Parser a -> Parser a -> Parser a #

mconcat :: [Parser a] -> Parser a #

Monoid (Vector a) 
Instance details

Defined in Data.Vector

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

Semigroup a => Monoid (Maybe a) 
Instance details

Defined in Data.Strict.Maybe

Methods

mempty :: Maybe a #

mappend :: Maybe a -> Maybe a -> Maybe a #

mconcat :: [Maybe a] -> Maybe a #

Storable a => Monoid (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

Monoid (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

mempty :: Array a #

mappend :: Array a -> Array a -> Array a #

mconcat :: [Array a] -> Array a #

Monoid (PrimArray a) 
Instance details

Defined in Data.Primitive.PrimArray

Methods

mempty :: PrimArray a #

mappend :: PrimArray a -> PrimArray a -> PrimArray a #

mconcat :: [PrimArray a] -> PrimArray a #

Monoid (SmallArray a) 
Instance details

Defined in Data.Primitive.SmallArray

Methods

mempty :: SmallArray a #

mappend :: SmallArray a -> SmallArray a -> SmallArray a #

mconcat :: [SmallArray a] -> SmallArray a #

Prim a => Monoid (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

Monoid (MergeSet a) 
Instance details

Defined in Data.Set.Internal

Methods

mempty :: MergeSet a #

mappend :: MergeSet a -> MergeSet a -> MergeSet a #

mconcat :: [MergeSet a] -> MergeSet a #

Monoid m => Monoid (FormResult m) 
Instance details

Defined in Yesod.Form.Types

Methods

mempty :: FormResult m #

mappend :: FormResult m -> FormResult m -> FormResult m #

mconcat :: [FormResult m] -> FormResult m #

Num a => Monoid (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: AlphaColour a #

mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a #

mconcat :: [AlphaColour a] -> AlphaColour a #

Num a => Monoid (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: Colour a #

mappend :: Colour a -> Colour a -> Colour a #

mconcat :: [Colour a] -> Colour a #

PrimType ty => Monoid (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

mempty :: UArray ty #

mappend :: UArray ty -> UArray ty -> UArray ty #

mconcat :: [UArray ty] -> UArray ty #

Monoid (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

mempty :: CountOf ty #

mappend :: CountOf ty -> CountOf ty -> CountOf ty #

mconcat :: [CountOf ty] -> CountOf ty #

PrimType ty => Monoid (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

mempty :: Block ty #

mappend :: Block ty -> Block ty -> Block ty #

mconcat :: [Block ty] -> Block ty #

Monoid a => Monoid (MarkupM a) 
Instance details

Defined in Text.Blaze.Internal

Methods

mempty :: MarkupM a #

mappend :: MarkupM a -> MarkupM a -> MarkupM a #

mconcat :: [MarkupM a] -> MarkupM a #

Monoid (GWData a) 
Instance details

Defined in Yesod.Core.Types

Methods

mempty :: GWData a #

mappend :: GWData a -> GWData a -> GWData a #

mconcat :: [GWData a] -> GWData a #

Monoid (Body url) 
Instance details

Defined in Yesod.Core.Types

Methods

mempty :: Body url #

mappend :: Body url -> Body url -> Body url #

mconcat :: [Body url] -> Body url #

Monoid (Head url) 
Instance details

Defined in Yesod.Core.Types

Methods

mempty :: Head url #

mappend :: Head url -> Head url -> Head url #

mconcat :: [Head url] -> Head url #

Monoid (UniqueList x) 
Instance details

Defined in Yesod.Core.Types

Methods

mempty :: UniqueList x #

mappend :: UniqueList x -> UniqueList x -> UniqueList x #

mconcat :: [UniqueList x] -> UniqueList x #

Monoid a => Monoid (Matrix a) 
Instance details

Defined in Data.Matrix

Methods

mempty :: Matrix a #

mappend :: Matrix a -> Matrix a -> Matrix a #

mconcat :: [Matrix a] -> Matrix a #

Monoid (Vault s) 
Instance details

Defined in Data.Vault.ST.Lazy

Methods

mempty :: Vault s #

mappend :: Vault s -> Vault s -> Vault s #

mconcat :: [Vault s] -> Vault s #

Monoid b => Monoid (a -> b)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: a -> b #

mappend :: (a -> b) -> (a -> b) -> a -> b #

mconcat :: [a -> b] -> a -> b #

Monoid (U1 p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: U1 p #

mappend :: U1 p -> U1 p -> U1 p #

mconcat :: [U1 p] -> U1 p #

(Monoid a, Monoid b) => Monoid (a, b)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b) #

mappend :: (a, b) -> (a, b) -> (a, b) #

mconcat :: [(a, b)] -> (a, b) #

Monoid a => Monoid (ST s a)

Since: base-4.11.0.0

Instance details

Defined in GHC.ST

Methods

mempty :: ST s a #

mappend :: ST s a -> ST s a -> ST s a #

mconcat :: [ST s a] -> ST s a #

Monoid (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

mempty :: Proxy s #

mappend :: Proxy s -> Proxy s -> Proxy s #

mconcat :: [Proxy s] -> Proxy s #

Ord k => Monoid (Map k v) 
Instance details

Defined in Data.Map.Internal

Methods

mempty :: Map k v #

mappend :: Map k v -> Map k v -> Map k v #

mconcat :: [Map k v] -> Map k v #

Monoid (Parser i a) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

mempty :: Parser i a #

mappend :: Parser i a -> Parser i a -> Parser i a #

mconcat :: [Parser i a] -> Parser i a #

(Eq k, Hashable k) => Monoid (HashMap k v) 
Instance details

Defined in Data.HashMap.Internal

Methods

mempty :: HashMap k v #

mappend :: HashMap k v -> HashMap k v -> HashMap k v #

mconcat :: [HashMap k v] -> HashMap k v #

(Monoid a, Monoid b) => Monoid (Pair a b) 
Instance details

Defined in Data.Strict.Tuple

Methods

mempty :: Pair a b #

mappend :: Pair a b -> Pair a b -> Pair a b #

mconcat :: [Pair a b] -> Pair a b #

Applicative f => Monoid (Traversed a f) 
Instance details

Defined in Lens.Micro

Methods

mempty :: Traversed a f #

mappend :: Traversed a f -> Traversed a f -> Traversed a f #

mconcat :: [Traversed a f] -> Traversed a f #

a ~ () => Monoid (WidgetFor site a) 
Instance details

Defined in Yesod.Core.Types

Methods

mempty :: WidgetFor site a #

mappend :: WidgetFor site a -> WidgetFor site a -> WidgetFor site a #

mconcat :: [WidgetFor site a] -> WidgetFor site a #

(Monad m, Monoid a) => Monoid (AForm m a) 
Instance details

Defined in Yesod.Form.Types

Methods

mempty :: AForm m a #

mappend :: AForm m a -> AForm m a -> AForm m a #

mconcat :: [AForm m a] -> AForm m a #

(Monoid a, MonadUnliftIO m) => Monoid (Conc m a) 
Instance details

Defined in UnliftIO.Internals.Async

Methods

mempty :: Conc m a #

mappend :: Conc m a -> Conc m a -> Conc m a #

mconcat :: [Conc m a] -> Conc m a #

(Semigroup a, Monoid a, MonadUnliftIO m) => Monoid (Concurrently m a) 
Instance details

Defined in UnliftIO.Internals.Async

Methods

mempty :: Concurrently m a #

mappend :: Concurrently m a -> Concurrently m a -> Concurrently m a #

mconcat :: [Concurrently m a] -> Concurrently m a #

(Monad m, Monoid a) => Monoid (LaTeXT m a) 
Instance details

Defined in Text.LaTeX.Base.Writer

Methods

mempty :: LaTeXT m a #

mappend :: LaTeXT m a -> LaTeXT m a -> LaTeXT m a #

mconcat :: [LaTeXT m a] -> LaTeXT m a #

(HasTrie a, Monoid b) => Monoid (a :->: b) 
Instance details

Defined in Data.MemoTrie

Methods

mempty :: a :->: b #

mappend :: (a :->: b) -> (a :->: b) -> a :->: b #

mconcat :: [a :->: b] -> a :->: b #

Monoid (f a) => Monoid (Indexing f a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

mempty :: Indexing f a #

mappend :: Indexing f a -> Indexing f a -> Indexing f a #

mconcat :: [Indexing f a] -> Indexing f a #

Monoid (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedFold s a #

mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

mconcat :: [ReifiedFold s a] -> ReifiedFold s a #

Monad m => Monoid (IPresentation m ()) Source # 
Instance details

Defined in Presentation.Yeamer

Monoid (f p) => Monoid (Rec1 f p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: Rec1 f p #

mappend :: Rec1 f p -> Rec1 f p -> Rec1 f p #

mconcat :: [Rec1 f p] -> Rec1 f p #

(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c) #

mappend :: (a, b, c) -> (a, b, c) -> (a, b, c) #

mconcat :: [(a, b, c)] -> (a, b, c) #

Monoid a => Monoid (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

mempty :: Const a b #

mappend :: Const a b -> Const a b -> Const a b #

mconcat :: [Const a b] -> Const a b #

(Applicative f, Monoid a) => Monoid (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

mempty :: Ap f a #

mappend :: Ap f a -> Ap f a -> Ap f a #

mconcat :: [Ap f a] -> Ap f a #

Alternative f => Monoid (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Alt f a #

mappend :: Alt f a -> Alt f a -> Alt f a #

mconcat :: [Alt f a] -> Alt f a #

(Semigroup a, Monoid a) => Monoid (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

mempty :: Tagged s a #

mappend :: Tagged s a -> Tagged s a -> Tagged s a #

mconcat :: [Tagged s a] -> Tagged s a #

Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s) 
Instance details

Defined in Data.Reflection

Methods

mempty :: ReflectedMonoid a s #

mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s #

mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s #

Monoid (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedIndexedFold i s a #

mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a #

Monoid c => Monoid (K1 i c p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: K1 i c p #

mappend :: K1 i c p -> K1 i c p -> K1 i c p #

mconcat :: [K1 i c p] -> K1 i c p #

(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: (f :*: g) p #

mappend :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p #

mconcat :: [(f :*: g) p] -> (f :*: g) p #

(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c, d) #

mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

mconcat :: [(a, b, c, d)] -> (a, b, c, d) #

Monad m => Monoid (ConduitT i o m ()) 
Instance details

Defined in Data.Conduit.Internal.Conduit

Methods

mempty :: ConduitT i o m () #

mappend :: ConduitT i o m () -> ConduitT i o m () -> ConduitT i o m () #

mconcat :: [ConduitT i o m ()] -> ConduitT i o m () #

Monoid (f p) => Monoid (M1 i c f p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: M1 i c f p #

mappend :: M1 i c f p -> M1 i c f p -> M1 i c f p #

mconcat :: [M1 i c f p] -> M1 i c f p #

Monoid (f (g p)) => Monoid ((f :.: g) p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: (f :.: g) p #

mappend :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #

mconcat :: [(f :.: g) p] -> (f :.: g) p #

(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c, d, e) #

mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

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

Monad m => Monoid (Pipe l i o u m ()) 
Instance details

Defined in Data.Conduit.Internal.Pipe

Methods

mempty :: Pipe l i o u m () #

mappend :: Pipe l i o u m () -> Pipe l i o u m () -> Pipe l i o u m () #

mconcat :: [Pipe l i o u m ()] -> Pipe l i o u m () #

newtype First a #

Maybe monoid returning the leftmost non-Nothing value.

First a is isomorphic to Alt Maybe a, but precedes it historically.

>>> getFirst (First (Just "hello") <> First Nothing <> First (Just "world"))
Just "hello"

Use of this type is discouraged. Note the following equivalence:

Data.Monoid.First x === Maybe (Data.Semigroup.First x)

In addition to being equivalent in the structural sense, the two also have Monoid instances that behave the same. This type will be marked deprecated in GHC 8.8, and removed in GHC 8.10. Users are advised to use the variant from Data.Semigroup and wrap it in Maybe.

Constructors

First 

Fields

Instances
Monad First

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Functor First

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Applicative First

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

pure :: a -> First a #

(<*>) :: First (a -> b) -> First a -> First b #

liftA2 :: (a -> b -> c) -> First a -> First b -> First c #

(*>) :: First a -> First b -> First b #

(<*) :: First a -> First b -> First a #

Foldable First

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => First m -> m #

foldMap :: Monoid m => (a -> m) -> First a -> m #

foldr :: (a -> b -> b) -> b -> First a -> b #

foldr' :: (a -> b -> b) -> b -> First a -> b #

foldl :: (b -> a -> b) -> b -> First a -> b #

foldl' :: (b -> a -> b) -> b -> First a -> b #

foldr1 :: (a -> a -> a) -> First a -> a #

foldl1 :: (a -> a -> a) -> First a -> a #

toList :: First a -> [a] #

null :: First a -> Bool #

length :: First a -> Int #

elem :: Eq a => a -> First a -> Bool #

maximum :: Ord a => First a -> a #

minimum :: Ord a => First a -> a #

sum :: Num a => First a -> a #

product :: Num a => First a -> a #

Traversable First

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> First a -> f (First b) #

sequenceA :: Applicative f => First (f a) -> f (First a) #

mapM :: Monad m => (a -> m b) -> First a -> m (First b) #

sequence :: Monad m => First (m a) -> m (First a) #

FromJSON1 First 
Instance details

Defined in Data.Aeson.Types.FromJSON

Methods

liftParseJSON :: (Value -> Parser a) -> (Value -> Parser [a]) -> Value -> Parser (First a)

liftParseJSONList :: (Value -> Parser a) -> (Value -> Parser [a]) -> Value -> Parser [First a]

ToJSON1 First 
Instance details

Defined in Data.Aeson.Types.ToJSON

Methods

liftToJSON :: (a -> Value) -> ([a] -> Value) -> First a -> Value

liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [First a] -> Value

liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> First a -> Encoding

liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [First a] -> Encoding

Eq a => Eq (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

(==) :: First a -> First a -> Bool #

(/=) :: First a -> First a -> Bool #

Ord a => Ord (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

compare :: First a -> First a -> Ordering #

(<) :: First a -> First a -> Bool #

(<=) :: First a -> First a -> Bool #

(>) :: First a -> First a -> Bool #

(>=) :: First a -> First a -> Bool #

max :: First a -> First a -> First a #

min :: First a -> First a -> First a #

Read a => Read (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Show a => Show (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

showsPrec :: Int -> First a -> ShowS #

show :: First a -> String #

showList :: [First a] -> ShowS #

Generic (First a) 
Instance details

Defined in Data.Monoid

Associated Types

type Rep (First a) :: Type -> Type #

Methods

from :: First a -> Rep (First a) x #

to :: Rep (First a) x -> First a #

Semigroup (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Monoid

Methods

(<>) :: First a -> First a -> First a #

sconcat :: NonEmpty (First a) -> First a #

stimes :: Integral b => b -> First a -> First a #

Monoid (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

mempty :: First a #

mappend :: First a -> First a -> First a #

mconcat :: [First a] -> First a #

FromJSON a => FromJSON (First a) 
Instance details

Defined in Data.Aeson.Types.FromJSON

Methods

parseJSON :: Value -> Parser (First a)

parseJSONList :: Value -> Parser [First a]

ToJSON a => ToJSON (First a) 
Instance details

Defined in Data.Aeson.Types.ToJSON

Methods

toJSON :: First a -> Value

toEncoding :: First a -> Encoding

toJSONList :: [First a] -> Value

toEncodingList :: [First a] -> Encoding

Default (First a) 
Instance details

Defined in Data.Default.Class

Methods

def :: First a

Newtype (First a) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (First a) :: Type

Methods

pack :: O (First a) -> First a

unpack :: First a -> O (First a)

Wrapped (First a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (First a) :: Type

Methods

_Wrapped' :: Iso' (First a) (Unwrapped (First a))

Generic1 First 
Instance details

Defined in Data.Monoid

Associated Types

type Rep1 First :: k -> Type #

Methods

from1 :: First a -> Rep1 First a #

to1 :: Rep1 First a -> First a #

t ~ First b => Rewrapped (First a) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep (First a)

Since: base-4.7.0.0

Instance details

Defined in Data.Monoid

type Rep (First a) = D1 (MetaData "First" "Data.Monoid" "base" True) (C1 (MetaCons "First" PrefixI True) (S1 (MetaSel (Just "getFirst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe a))))
type O (First a) 
Instance details

Defined in Control.Newtype.Generics

type O (First a) = Maybe a
type Unwrapped (First a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (First a) = Maybe a
type Rep1 First

Since: base-4.7.0.0

Instance details

Defined in Data.Monoid

type Rep1 First = D1 (MetaData "First" "Data.Monoid" "base" True) (C1 (MetaCons "First" PrefixI True) (S1 (MetaSel (Just "getFirst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 Maybe)))

newtype Last a #

Maybe monoid returning the rightmost non-Nothing value.

Last a is isomorphic to Dual (First a), and thus to Dual (Alt Maybe a)

>>> getLast (Last (Just "hello") <> Last Nothing <> Last (Just "world"))
Just "world"

Use of this type is discouraged. Note the following equivalence:

Data.Monoid.Last x === Maybe (Data.Semigroup.Last x)

In addition to being equivalent in the structural sense, the two also have Monoid instances that behave the same. This type will be marked deprecated in GHC 8.8, and removed in GHC 8.10. Users are advised to use the variant from Data.Semigroup and wrap it in Maybe.

Constructors

Last 

Fields

Instances
Monad Last

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Functor Last

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Applicative Last

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

pure :: a -> Last a #

(<*>) :: Last (a -> b) -> Last a -> Last b #

liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c #

(*>) :: Last a -> Last b -> Last b #

(<*) :: Last a -> Last b -> Last a #

Foldable Last

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Last m -> m #

foldMap :: Monoid m => (a -> m) -> Last a -> m #

foldr :: (a -> b -> b) -> b -> Last a -> b #

foldr' :: (a -> b -> b) -> b -> Last a -> b #

foldl :: (b -> a -> b) -> b -> Last a -> b #

foldl' :: (b -> a -> b) -> b -> Last a -> b #

foldr1 :: (a -> a -> a) -> Last a -> a #

foldl1 :: (a -> a -> a) -> Last a -> a #

toList :: Last a -> [a] #

null :: Last a -> Bool #

length :: Last a -> Int #

elem :: Eq a => a -> Last a -> Bool #

maximum :: Ord a => Last a -> a #

minimum :: Ord a => Last a -> a #

sum :: Num a => Last a -> a #

product :: Num a => Last a -> a #

Traversable Last

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) #

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) #

sequence :: Monad m => Last (m a) -> m (Last a) #

FromJSON1 Last 
Instance details

Defined in Data.Aeson.Types.FromJSON

Methods

liftParseJSON :: (Value -> Parser a) -> (Value -> Parser [a]) -> Value -> Parser (Last a)

liftParseJSONList :: (Value -> Parser a) -> (Value -> Parser [a]) -> Value -> Parser [Last a]

ToJSON1 Last 
Instance details

Defined in Data.Aeson.Types.ToJSON

Methods

liftToJSON :: (a -> Value) -> ([a] -> Value) -> Last a -> Value

liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Last a] -> Value

liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Last a -> Encoding

liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Last a] -> Encoding

Eq a => Eq (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

(==) :: Last a -> Last a -> Bool #

(/=) :: Last a -> Last a -> Bool #

Ord a => Ord (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

compare :: Last a -> Last a -> Ordering #

(<) :: Last a -> Last a -> Bool #

(<=) :: Last a -> Last a -> Bool #

(>) :: Last a -> Last a -> Bool #

(>=) :: Last a -> Last a -> Bool #

max :: Last a -> Last a -> Last a #

min :: Last a -> Last a -> Last a #

Read a => Read (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Show a => Show (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

showsPrec :: Int -> Last a -> ShowS #

show :: Last a -> String #

showList :: [Last a] -> ShowS #

Generic (Last a) 
Instance details

Defined in Data.Monoid

Associated Types

type Rep (Last a) :: Type -> Type #

Methods

from :: Last a -> Rep (Last a) x #

to :: Rep (Last a) x -> Last a #

Semigroup (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Monoid

Methods

(<>) :: Last a -> Last a -> Last a #

sconcat :: NonEmpty (Last a) -> Last a #

stimes :: Integral b => b -> Last a -> Last a #

Monoid (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

mempty :: Last a #

mappend :: Last a -> Last a -> Last a #

mconcat :: [Last a] -> Last a #

FromJSON a => FromJSON (Last a) 
Instance details

Defined in Data.Aeson.Types.FromJSON

Methods

parseJSON :: Value -> Parser (Last a)

parseJSONList :: Value -> Parser [Last a]

ToJSON a => ToJSON (Last a) 
Instance details

Defined in Data.Aeson.Types.ToJSON

Methods

toJSON :: Last a -> Value

toEncoding :: Last a -> Encoding

toJSONList :: [Last a] -> Value

toEncodingList :: [Last a] -> Encoding

Default (Last a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Last a

Newtype (Last a) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Last a) :: Type

Methods

pack :: O (Last a) -> Last a

unpack :: Last a -> O (Last a)

Wrapped (Last a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Last a) :: Type

Methods

_Wrapped' :: Iso' (Last a) (Unwrapped (Last a))

Generic1 Last 
Instance details

Defined in Data.Monoid

Associated Types

type Rep1 Last :: k -> Type #

Methods

from1 :: Last a -> Rep1 Last a #

to1 :: Rep1 Last a -> Last a #

t ~ Last b => Rewrapped (Last a) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep (Last a)

Since: base-4.7.0.0

Instance details

Defined in Data.Monoid

type Rep (Last a) = D1 (MetaData "Last" "Data.Monoid" "base" True) (C1 (MetaCons "Last" PrefixI True) (S1 (MetaSel (Just "getLast") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe a))))
type O (Last a) 
Instance details

Defined in Control.Newtype.Generics

type O (Last a) = Maybe a
type Unwrapped (Last a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Last a) = Maybe a
type Rep1 Last

Since: base-4.7.0.0

Instance details

Defined in Data.Monoid

type Rep1 Last = D1 (MetaData "Last" "Data.Monoid" "base" True) (C1 (MetaCons "Last" PrefixI True) (S1 (MetaSel (Just "getLast") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 Maybe)))

newtype Ap (f :: k -> Type) (a :: k) :: forall k. (k -> Type) -> k -> Type #

This data type witnesses the lifting of a Monoid into an Applicative pointwise.

Since: base-4.12.0.0

Constructors

Ap 

Fields

Instances
Generic1 (Ap f :: k -> Type) 
Instance details

Defined in Data.Monoid

Associated Types

type Rep1 (Ap f) :: k -> Type #

Methods

from1 :: Ap f a -> Rep1 (Ap f) a #

to1 :: Rep1 (Ap f) a -> Ap f a #

Monad f => Monad (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: Ap f a -> (a -> Ap f b) -> Ap f b #

(>>) :: Ap f a -> Ap f b -> Ap f b #

return :: a -> Ap f a #

fail :: String -> Ap f a #

Functor f => Functor (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> Ap f a -> Ap f b #

(<$) :: a -> Ap f b -> Ap f a #

MonadFail f => MonadFail (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

fail :: String -> Ap f a #

Applicative f => Applicative (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

pure :: a -> Ap f a #

(<*>) :: Ap f (a -> b) -> Ap f a -> Ap f b #

liftA2 :: (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c #

(*>) :: Ap f a -> Ap f b -> Ap f b #

(<*) :: Ap f a -> Ap f b -> Ap f a #

Foldable f => Foldable (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Ap f m -> m #

foldMap :: Monoid m => (a -> m) -> Ap f a -> m #

foldr :: (a -> b -> b) -> b -> Ap f a -> b #

foldr' :: (a -> b -> b) -> b -> Ap f a -> b #

foldl :: (b -> a -> b) -> b -> Ap f a -> b #

foldl' :: (b -> a -> b) -> b -> Ap f a -> b #

foldr1 :: (a -> a -> a) -> Ap f a -> a #

foldl1 :: (a -> a -> a) -> Ap f a -> a #

toList :: Ap f a -> [a] #

null :: Ap f a -> Bool #

length :: Ap f a -> Int #

elem :: Eq a => a -> Ap f a -> Bool #

maximum :: Ord a => Ap f a -> a #

minimum :: Ord a => Ap f a -> a #

sum :: Num a => Ap f a -> a #

product :: Num a => Ap f a -> a #

Traversable f => Traversable (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Ap f a -> f0 (Ap f b) #

sequenceA :: Applicative f0 => Ap f (f0 a) -> f0 (Ap f a) #

mapM :: Monad m => (a -> m b) -> Ap f a -> m (Ap f b) #

sequence :: Monad m => Ap f (m a) -> m (Ap f a) #

Alternative f => Alternative (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

empty :: Ap f a #

(<|>) :: Ap f a -> Ap f a -> Ap f a #

some :: Ap f a -> Ap f [a] #

many :: Ap f a -> Ap f [a] #

MonadPlus f => MonadPlus (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

mzero :: Ap f a #

mplus :: Ap f a -> Ap f a -> Ap f a #

(Applicative f, Bounded a) => Bounded (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

minBound :: Ap f a #

maxBound :: Ap f a #

Enum (f a) => Enum (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

succ :: Ap f a -> Ap f a #

pred :: Ap f a -> Ap f a #

toEnum :: Int -> Ap f a #

fromEnum :: Ap f a -> Int #

enumFrom :: Ap f a -> [Ap f a] #

enumFromThen :: Ap f a -> Ap f a -> [Ap f a] #

enumFromTo :: Ap f a -> Ap f a -> [Ap f a] #

enumFromThenTo :: Ap f a -> Ap f a -> Ap f a -> [Ap f a] #

Eq (f a) => Eq (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(==) :: Ap f a -> Ap f a -> Bool #

(/=) :: Ap f a -> Ap f a -> Bool #

(Applicative f, Num a) => Num (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(+) :: Ap f a -> Ap f a -> Ap f a #

(-) :: Ap f a -> Ap f a -> Ap f a #

(*) :: Ap f a -> Ap f a -> Ap f a #

negate :: Ap f a -> Ap f a #

abs :: Ap f a -> Ap f a #

signum :: Ap f a -> Ap f a #

fromInteger :: Integer -> Ap f a #

Ord (f a) => Ord (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

compare :: Ap f a -> Ap f a -> Ordering #

(<) :: Ap f a -> Ap f a -> Bool #

(<=) :: Ap f a -> Ap f a -> Bool #

(>) :: Ap f a -> Ap f a -> Bool #

(>=) :: Ap f a -> Ap f a -> Bool #

max :: Ap f a -> Ap f a -> Ap f a #

min :: Ap f a -> Ap f a -> Ap f a #

Read (f a) => Read (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

readsPrec :: Int -> ReadS (Ap f a) #

readList :: ReadS [Ap f a] #

readPrec :: ReadPrec (Ap f a) #

readListPrec :: ReadPrec [Ap f a] #

Show (f a) => Show (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

showsPrec :: Int -> Ap f a -> ShowS #

show :: Ap f a -> String #

showList :: [Ap f a] -> ShowS #

Generic (Ap f a) 
Instance details

Defined in Data.Monoid

Associated Types

type Rep (Ap f a) :: Type -> Type #

Methods

from :: Ap f a -> Rep (Ap f a) x #

to :: Rep (Ap f a) x -> Ap f a #

(Applicative f, Semigroup a) => Semigroup (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(<>) :: Ap f a -> Ap f a -> Ap f a #

sconcat :: NonEmpty (Ap f a) -> Ap f a #

stimes :: Integral b => b -> Ap f a -> Ap f a #

(Applicative f, Monoid a) => Monoid (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

mempty :: Ap f a #

mappend :: Ap f a -> Ap f a -> Ap f a #

mconcat :: [Ap f a] -> Ap f a #

Newtype (Ap f a) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Ap f a) :: Type

Methods

pack :: O (Ap f a) -> Ap f a

unpack :: Ap f a -> O (Ap f a)

Wrapped (Ap f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Ap f a) :: Type

Methods

_Wrapped' :: Iso' (Ap f a) (Unwrapped (Ap f a))

t ~ Ap g b => Rewrapped (Ap f a) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep1 (Ap f :: k -> Type)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

type Rep1 (Ap f :: k -> Type) = D1 (MetaData "Ap" "Data.Monoid" "base" True) (C1 (MetaCons "Ap" PrefixI True) (S1 (MetaSel (Just "getAp") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 f)))
type Rep (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

type Rep (Ap f a) = D1 (MetaData "Ap" "Data.Monoid" "base" True) (C1 (MetaCons "Ap" PrefixI True) (S1 (MetaSel (Just "getAp") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f a))))
type O (Ap f a) 
Instance details

Defined in Control.Newtype.Generics

type O (Ap f a) = f a
type Unwrapped (Ap f a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Ap f a) = f a

newtype Dual a #

The dual of a Monoid, obtained by swapping the arguments of mappend.

>>> getDual (mappend (Dual "Hello") (Dual "World"))
"WorldHello"

Constructors

Dual 

Fields

Instances
Monad Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Dual a -> (a -> Dual b) -> Dual b #

(>>) :: Dual a -> Dual b -> Dual b #

return :: a -> Dual a #

fail :: String -> Dual a #

Functor Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Dual a -> Dual b #

(<$) :: a -> Dual b -> Dual a #

Applicative Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

pure :: a -> Dual a #

(<*>) :: Dual (a -> b) -> Dual a -> Dual b #

liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c #

(*>) :: Dual a -> Dual b -> Dual b #

(<*) :: Dual a -> Dual b -> Dual a #

Foldable Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Dual m -> m #

foldMap :: Monoid m => (a -> m) -> Dual a -> m #

foldr :: (a -> b -> b) -> b -> Dual a -> b #

foldr' :: (a -> b -> b) -> b -> Dual a -> b #

foldl :: (b -> a -> b) -> b -> Dual a -> b #

foldl' :: (b -> a -> b) -> b -> Dual a -> b #

foldr1 :: (a -> a -> a) -> Dual a -> a #

foldl1 :: (a -> a -> a) -> Dual a -> a #

toList :: Dual a -> [a] #

null :: Dual a -> Bool #

length :: Dual a -> Int #

elem :: Eq a => a -> Dual a -> Bool #

maximum :: Ord a => Dual a -> a #

minimum :: Ord a => Dual a -> a #

sum :: Num a => Dual a -> a #

product :: Num a => Dual a -> a #

Traversable Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Dual a -> f (Dual b) #

sequenceA :: Applicative f => Dual (f a) -> f (Dual a) #

mapM :: Monad m => (a -> m b) -> Dual a -> m (Dual b) #

sequence :: Monad m => Dual (m a) -> m (Dual a) #

FromJSON1 Dual 
Instance details

Defined in Data.Aeson.Types.FromJSON

Methods

liftParseJSON :: (Value -> Parser a) -> (Value -> Parser [a]) -> Value -> Parser (Dual a)

liftParseJSONList :: (Value -> Parser a) -> (Value -> Parser [a]) -> Value -> Parser [Dual a]

ToJSON1 Dual 
Instance details

Defined in Data.Aeson.Types.ToJSON

Methods

liftToJSON :: (a -> Value) -> ([a] -> Value) -> Dual a -> Value

liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Dual a] -> Value

liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Dual a -> Encoding

liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Dual a] -> Encoding

Representable Dual 
Instance details

Defined in Data.Functor.Rep

Associated Types

type Rep Dual :: Type

Methods

tabulate :: (Rep Dual -> a) -> Dual a

index :: Dual a -> Rep Dual -> a

Unbox a => Vector Vector (Dual a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Dual a) -> m (Vector (Dual a))

basicUnsafeThaw :: PrimMonad m => Vector (Dual a) -> m (Mutable Vector (PrimState m) (Dual a))

basicLength :: Vector (Dual a) -> Int

basicUnsafeSlice :: Int -> Int -> Vector (Dual a) -> Vector (Dual a)

basicUnsafeIndexM :: Monad m => Vector (Dual a) -> Int -> m (Dual a)

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Dual a) -> Vector (Dual a) -> m ()

elemseq :: Vector (Dual a) -> Dual a -> b -> b

Unbox a => MVector MVector (Dual a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s (Dual a) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s (Dual a) -> MVector s (Dual a)

basicOverlaps :: MVector s (Dual a) -> MVector s (Dual a) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Dual a))

basicInitialize :: PrimMonad m => MVector (PrimState m) (Dual a) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Dual a -> m (MVector (PrimState m) (Dual a))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Dual a) -> Int -> m (Dual a)

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Dual a) -> Int -> Dual a -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) (Dual a) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) (Dual a) -> Dual a -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Dual a) -> MVector (PrimState m) (Dual a) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Dual a) -> MVector (PrimState m) (Dual a) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Dual a) -> Int -> m (MVector (PrimState m) (Dual a))

Bounded a => Bounded (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

minBound :: Dual a #

maxBound :: Dual a #

Eq a => Eq (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Dual a -> Dual a -> Bool #

(/=) :: Dual a -> Dual a -> Bool #

Ord a => Ord (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Dual a -> Dual a -> Ordering #

(<) :: Dual a -> Dual a -> Bool #

(<=) :: Dual a -> Dual a -> Bool #

(>) :: Dual a -> Dual a -> Bool #

(>=) :: Dual a -> Dual a -> Bool #

max :: Dual a -> Dual a -> Dual a #

min :: Dual a -> Dual a -> Dual a #

Read a => Read (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Show a => Show (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Dual a -> ShowS #

show :: Dual a -> String #

showList :: [Dual a] -> ShowS #

Generic (Dual a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Dual a) :: Type -> Type #

Methods

from :: Dual a -> Rep (Dual a) x #

to :: Rep (Dual a) x -> Dual a #

Semigroup a => Semigroup (Dual a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Dual a -> Dual a -> Dual a #

sconcat :: NonEmpty (Dual a) -> Dual a #

stimes :: Integral b => b -> Dual a -> Dual a #

Monoid a => Monoid (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Dual a #

mappend :: Dual a -> Dual a -> Dual a #

mconcat :: [Dual a] -> Dual a #

FromJSON a => FromJSON (Dual a) 
Instance details

Defined in Data.Aeson.Types.FromJSON

Methods

parseJSON :: Value -> Parser (Dual a)

parseJSONList :: Value -> Parser [Dual a]

ToJSON a => ToJSON (Dual a) 
Instance details

Defined in Data.Aeson.Types.ToJSON

Methods

toJSON :: Dual a -> Value

toEncoding :: Dual a -> Encoding

toJSONList :: [Dual a] -> Value

toEncodingList :: [Dual a] -> Encoding

Unbox a => Unbox (Dual a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Prim a => Prim (Dual a) 
Instance details

Defined in Data.Primitive.Types

Default a => Default (Dual a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Dual a

Newtype (Dual a) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Dual a) :: Type

Methods

pack :: O (Dual a) -> Dual a

unpack :: Dual a -> O (Dual a)

Wrapped (Dual a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Dual a) :: Type

Methods

_Wrapped' :: Iso' (Dual a) (Unwrapped (Dual a))

Generic1 Dual 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep1 Dual :: k -> Type #

Methods

from1 :: Dual a -> Rep1 Dual a #

to1 :: Rep1 Dual a -> Dual a #

t ~ Dual b => Rewrapped (Dual a) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep Dual 
Instance details

Defined in Data.Functor.Rep

type Rep Dual = ()
newtype MVector s (Dual a) 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s (Dual a) = MV_Dual (MVector s a)
type Rep (Dual a)

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep (Dual a) = D1 (MetaData "Dual" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Dual" PrefixI True) (S1 (MetaSel (Just "getDual") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
newtype Vector (Dual a) 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector (Dual a) = V_Dual (Vector a)
type O (Dual a) 
Instance details

Defined in Control.Newtype.Generics

type O (Dual a) = a
type Unwrapped (Dual a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Dual a) = a
type Rep1 Dual

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep1 Dual = D1 (MetaData "Dual" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Dual" PrefixI True) (S1 (MetaSel (Just "getDual") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Endo a #

The monoid of endomorphisms under composition.

>>> let computation = Endo ("Hello, " ++) <> Endo (++ "!")
>>> appEndo computation "Haskell"
"Hello, Haskell!"

Constructors

Endo 

Fields

Instances
Generic (Endo a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Endo a) :: Type -> Type #

Methods

from :: Endo a -> Rep (Endo a) x #

to :: Rep (Endo a) x -> Endo a #

Semigroup (Endo a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Endo a -> Endo a -> Endo a #

sconcat :: NonEmpty (Endo a) -> Endo a #

stimes :: Integral b => b -> Endo a -> Endo a #

Monoid (Endo a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Endo a #

mappend :: Endo a -> Endo a -> Endo a #

mconcat :: [Endo a] -> Endo a #

Default (Endo a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Endo a

Newtype (Endo a) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Endo a) :: Type

Methods

pack :: O (Endo a) -> Endo a

unpack :: Endo a -> O (Endo a)

Wrapped (Endo a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Endo a) :: Type

Methods

_Wrapped' :: Iso' (Endo a) (Unwrapped (Endo a))

t ~ Endo b => Rewrapped (Endo a) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep (Endo a)

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep (Endo a) = D1 (MetaData "Endo" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Endo" PrefixI True) (S1 (MetaSel (Just "appEndo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (a -> a))))
type O (Endo a) 
Instance details

Defined in Control.Newtype.Generics

type O (Endo a) = a -> a
type Unwrapped (Endo a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Endo a) = a -> a

newtype All #

Boolean monoid under conjunction (&&).

>>> getAll (All True <> mempty <> All False)
False
>>> getAll (mconcat (map (\x -> All (even x)) [2,4,6,7,8]))
False

Constructors

All 

Fields

Instances
Bounded All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

minBound :: All #

maxBound :: All #

Eq All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: All -> All -> Bool #

(/=) :: All -> All -> Bool #

Ord All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: All -> All -> Ordering #

(<) :: All -> All -> Bool #

(<=) :: All -> All -> Bool #

(>) :: All -> All -> Bool #

(>=) :: All -> All -> Bool #

max :: All -> All -> All #

min :: All -> All -> All #

Read All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Show All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> All -> ShowS #

show :: All -> String #

showList :: [All] -> ShowS #

Generic All 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep All :: Type -> Type #

Methods

from :: All -> Rep All x #

to :: Rep All x -> All #

Semigroup All

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: All -> All -> All #

sconcat :: NonEmpty All -> All #

stimes :: Integral b => b -> All -> All #

Monoid All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: All #

mappend :: All -> All -> All #

mconcat :: [All] -> All #

Unbox All 
Instance details

Defined in Data.Vector.Unboxed.Base

Default All 
Instance details

Defined in Data.Default.Class

Methods

def :: All

Newtype All 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O All :: Type

Methods

pack :: O All -> All

unpack :: All -> O All

Wrapped All 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped All :: Type

Methods

_Wrapped' :: Iso' All (Unwrapped All)

Vector Vector All 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) All -> m (Vector All)

basicUnsafeThaw :: PrimMonad m => Vector All -> m (Mutable Vector (PrimState m) All)

basicLength :: Vector All -> Int

basicUnsafeSlice :: Int -> Int -> Vector All -> Vector All

basicUnsafeIndexM :: Monad m => Vector All -> Int -> m All

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) All -> Vector All -> m ()

elemseq :: Vector All -> All -> b -> b

MVector MVector All 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s All -> Int

basicUnsafeSlice :: Int -> Int -> MVector s All -> MVector s All

basicOverlaps :: MVector s All -> MVector s All -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) All)

basicInitialize :: PrimMonad m => MVector (PrimState m) All -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> All -> m (MVector (PrimState m) All)

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) All -> Int -> m All

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) All -> Int -> All -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) All -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) All -> All -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) All -> MVector (PrimState m) All -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) All -> MVector (PrimState m) All -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) All -> Int -> m (MVector (PrimState m) All)

t ~ All => Rewrapped All t 
Instance details

Defined in Control.Lens.Wrapped

type Rep All

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep All = D1 (MetaData "All" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "All" PrefixI True) (S1 (MetaSel (Just "getAll") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Bool)))
newtype Vector All 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector All = V_All (Vector Bool)
type O All 
Instance details

Defined in Control.Newtype.Generics

type O All = Bool
type Unwrapped All 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped All = Bool
newtype MVector s All 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s All = MV_All (MVector s Bool)

newtype Any #

Boolean monoid under disjunction (||).

>>> getAny (Any True <> mempty <> Any False)
True
>>> getAny (mconcat (map (\x -> Any (even x)) [2,4,6,7,8]))
True

Constructors

Any 

Fields

Instances
Bounded Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

minBound :: Any #

maxBound :: Any #

Eq Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Any -> Any -> Bool #

(/=) :: Any -> Any -> Bool #

Ord Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Any -> Any -> Ordering #

(<) :: Any -> Any -> Bool #

(<=) :: Any -> Any -> Bool #

(>) :: Any -> Any -> Bool #

(>=) :: Any -> Any -> Bool #

max :: Any -> Any -> Any #

min :: Any -> Any -> Any #

Read Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Show Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Any -> ShowS #

show :: Any -> String #

showList :: [Any] -> ShowS #

Generic Any 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep Any :: Type -> Type #

Methods

from :: Any -> Rep Any x #

to :: Rep Any x -> Any #

Semigroup Any

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Any -> Any -> Any #

sconcat :: NonEmpty Any -> Any #

stimes :: Integral b => b -> Any -> Any #

Monoid Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Any #

mappend :: Any -> Any -> Any #

mconcat :: [Any] -> Any #

Unbox Any 
Instance details

Defined in Data.Vector.Unboxed.Base

Default Any 
Instance details

Defined in Data.Default.Class

Methods

def :: Any

Newtype Any 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O Any :: Type

Methods

pack :: O Any -> Any

unpack :: Any -> O Any

Wrapped Any 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped Any :: Type

Methods

_Wrapped' :: Iso' Any (Unwrapped Any)

Vector Vector Any 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Any -> m (Vector Any)

basicUnsafeThaw :: PrimMonad m => Vector Any -> m (Mutable Vector (PrimState m) Any)

basicLength :: Vector Any -> Int

basicUnsafeSlice :: Int -> Int -> Vector Any -> Vector Any

basicUnsafeIndexM :: Monad m => Vector Any -> Int -> m Any

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Any -> Vector Any -> m ()

elemseq :: Vector Any -> Any -> b -> b

MVector MVector Any 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Any -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Any -> MVector s Any

basicOverlaps :: MVector s Any -> MVector s Any -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Any)

basicInitialize :: PrimMonad m => MVector (PrimState m) Any -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Any -> m (MVector (PrimState m) Any)

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Any -> Int -> m Any

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Any -> Int -> Any -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) Any -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) Any -> Any -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Any -> MVector (PrimState m) Any -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Any -> MVector (PrimState m) Any -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Any -> Int -> m (MVector (PrimState m) Any)

t ~ Any => Rewrapped Any t 
Instance details

Defined in Control.Lens.Wrapped

type Rep Any

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep Any = D1 (MetaData "Any" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Any" PrefixI True) (S1 (MetaSel (Just "getAny") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Bool)))
newtype Vector Any 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector Any = V_Any (Vector Bool)
type O Any 
Instance details

Defined in Control.Newtype.Generics

type O Any = Bool
type Unwrapped Any 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped Any = Bool
newtype MVector s Any 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s Any = MV_Any (MVector s Bool)

newtype Sum a #

Monoid under addition.

>>> getSum (Sum 1 <> Sum 2 <> mempty)
3

Constructors

Sum 

Fields

Instances
Monad Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Sum a -> (a -> Sum b) -> Sum b #

(>>) :: Sum a -> Sum b -> Sum b #

return :: a -> Sum a #

fail :: String -> Sum a #

Functor Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Sum a -> Sum b #

(<$) :: a -> Sum b -> Sum a #

Applicative Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

pure :: a -> Sum a #

(<*>) :: Sum (a -> b) -> Sum a -> Sum b #

liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c #

(*>) :: Sum a -> Sum b -> Sum b #

(<*) :: Sum a -> Sum b -> Sum a #

Foldable Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Sum m -> m #

foldMap :: Monoid m => (a -> m) -> Sum a -> m #

foldr :: (a -> b -> b) -> b -> Sum a -> b #

foldr' :: (a -> b -> b) -> b -> Sum a -> b #

foldl :: (b -> a -> b) -> b -> Sum a -> b #

foldl' :: (b -> a -> b) -> b -> Sum a -> b #

foldr1 :: (a -> a -> a) -> Sum a -> a #

foldl1 :: (a -> a -> a) -> Sum a -> a #

toList :: Sum a -> [a] #

null :: Sum a -> Bool #

length :: Sum a -> Int #

elem :: Eq a => a -> Sum a -> Bool #

maximum :: Ord a => Sum a -> a #

minimum :: Ord a => Sum a -> a #

sum :: Num a => Sum a -> a #

product :: Num a => Sum a -> a #

Traversable Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Sum a -> f (Sum b) #

sequenceA :: Applicative f => Sum (f a) -> f (Sum a) #

mapM :: Monad m => (a -> m b) -> Sum a -> m (Sum b) #

sequence :: Monad m => Sum (m a) -> m (Sum a) #

Representable Sum 
Instance details

Defined in Data.Functor.Rep

Associated Types

type Rep Sum :: Type

Methods

tabulate :: (Rep Sum -> a) -> Sum a

index :: Sum a -> Rep Sum -> a

Unbox a => Vector Vector (Sum a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Sum a) -> m (Vector (Sum a))

basicUnsafeThaw :: PrimMonad m => Vector (Sum a) -> m (Mutable Vector (PrimState m) (Sum a))

basicLength :: Vector (Sum a) -> Int

basicUnsafeSlice :: Int -> Int -> Vector (Sum a) -> Vector (Sum a)

basicUnsafeIndexM :: Monad m => Vector (Sum a) -> Int -> m (Sum a)

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Sum a) -> Vector (Sum a) -> m ()

elemseq :: Vector (Sum a) -> Sum a -> b -> b

Unbox a => MVector MVector (Sum a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s (Sum a) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s (Sum a) -> MVector s (Sum a)

basicOverlaps :: MVector s (Sum a) -> MVector s (Sum a) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Sum a))

basicInitialize :: PrimMonad m => MVector (PrimState m) (Sum a) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Sum a -> m (MVector (PrimState m) (Sum a))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Sum a) -> Int -> m (Sum a)

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Sum a) -> Int -> Sum a -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) (Sum a) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) (Sum a) -> Sum a -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Sum a) -> MVector (PrimState m) (Sum a) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Sum a) -> MVector (PrimState m) (Sum a) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Sum a) -> Int -> m (MVector (PrimState m) (Sum a))

Bounded a => Bounded (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

minBound :: Sum a #

maxBound :: Sum a #

Eq a => Eq (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Sum a -> Sum a -> Bool #

(/=) :: Sum a -> Sum a -> Bool #

Num a => Num (Sum a)

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Sum a -> Sum a -> Sum a #

(-) :: Sum a -> Sum a -> Sum a #

(*) :: Sum a -> Sum a -> Sum a #

negate :: Sum a -> Sum a #

abs :: Sum a -> Sum a #

signum :: Sum a -> Sum a #

fromInteger :: Integer -> Sum a #

Ord a => Ord (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Sum a -> Sum a -> Ordering #

(<) :: Sum a -> Sum a -> Bool #

(<=) :: Sum a -> Sum a -> Bool #

(>) :: Sum a -> Sum a -> Bool #

(>=) :: Sum a -> Sum a -> Bool #

max :: Sum a -> Sum a -> Sum a #

min :: Sum a -> Sum a -> Sum a #

Read a => Read (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Show a => Show (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Sum a -> ShowS #

show :: Sum a -> String #

showList :: [Sum a] -> ShowS #

Generic (Sum a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Sum a) :: Type -> Type #

Methods

from :: Sum a -> Rep (Sum a) x #

to :: Rep (Sum a) x -> Sum a #

Num a => Semigroup (Sum a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Sum a -> Sum a -> Sum a #

sconcat :: NonEmpty (Sum a) -> Sum a #

stimes :: Integral b => b -> Sum a -> Sum a #

Num a => Monoid (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Sum a #

mappend :: Sum a -> Sum a -> Sum a #

mconcat :: [Sum a] -> Sum a #

Unbox a => Unbox (Sum a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Prim a => Prim (Sum a) 
Instance details

Defined in Data.Primitive.Types

Num a => Default (Sum a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Sum a

Newtype (Sum a) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Sum a) :: Type

Methods

pack :: O (Sum a) -> Sum a

unpack :: Sum a -> O (Sum a)

Wrapped (Sum a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Sum a) :: Type

Methods

_Wrapped' :: Iso' (Sum a) (Unwrapped (Sum a))

Generic1 Sum 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep1 Sum :: k -> Type #

Methods

from1 :: Sum a -> Rep1 Sum a #

to1 :: Rep1 Sum a -> Sum a #

t ~ Sum b => Rewrapped (Sum a) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep Sum 
Instance details

Defined in Data.Functor.Rep

type Rep Sum = ()
newtype MVector s (Sum a) 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s (Sum a) = MV_Sum (MVector s a)
type Rep (Sum a)

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep (Sum a) = D1 (MetaData "Sum" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Sum" PrefixI True) (S1 (MetaSel (Just "getSum") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
newtype Vector (Sum a) 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector (Sum a) = V_Sum (Vector a)
type O (Sum a) 
Instance details

Defined in Control.Newtype.Generics

type O (Sum a) = a
type Unwrapped (Sum a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Sum a) = a
type Rep1 Sum

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep1 Sum = D1 (MetaData "Sum" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Sum" PrefixI True) (S1 (MetaSel (Just "getSum") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Product a #

Monoid under multiplication.

>>> getProduct (Product 3 <> Product 4 <> mempty)
12

Constructors

Product 

Fields

Instances
Monad Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Product a -> (a -> Product b) -> Product b #

(>>) :: Product a -> Product b -> Product b #

return :: a -> Product a #

fail :: String -> Product a #

Functor Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Product a -> Product b #

(<$) :: a -> Product b -> Product a #

Applicative Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

pure :: a -> Product a #

(<*>) :: Product (a -> b) -> Product a -> Product b #

liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c #

(*>) :: Product a -> Product b -> Product b #

(<*) :: Product a -> Product b -> Product a #

Foldable Product

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Product m -> m #

foldMap :: Monoid m => (a -> m) -> Product a -> m #

foldr :: (a -> b -> b) -> b -> Product a -> b #

foldr' :: (a -> b -> b) -> b -> Product a -> b #

foldl :: (b -> a -> b) -> b -> Product a -> b #

foldl' :: (b -> a -> b) -> b -> Product a -> b #

foldr1 :: (a -> a -> a) -> Product a -> a #

foldl1 :: (a -> a -> a) -> Product a -> a #

toList :: Product a -> [a] #

null :: Product a -> Bool #

length :: Product a -> Int #

elem :: Eq a => a -> Product a -> Bool #

maximum :: Ord a => Product a -> a #

minimum :: Ord a => Product a -> a #

sum :: Num a => Product a -> a #

product :: Num a => Product a -> a #

Traversable Product

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Product a -> f (Product b) #

sequenceA :: Applicative f => Product (f a) -> f (Product a) #

mapM :: Monad m => (a -> m b) -> Product a -> m (Product b) #

sequence :: Monad m => Product (m a) -> m (Product a) #

Representable Product 
Instance details

Defined in Data.Functor.Rep

Associated Types

type Rep Product :: Type

Methods

tabulate :: (Rep Product -> a) -> Product a

index :: Product a -> Rep Product -> a

Unbox a => Vector Vector (Product a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Product a) -> m (Vector (Product a))

basicUnsafeThaw :: PrimMonad m => Vector (Product a) -> m (Mutable Vector (PrimState m) (Product a))

basicLength :: Vector (Product a) -> Int

basicUnsafeSlice :: Int -> Int -> Vector (Product a) -> Vector (Product a)

basicUnsafeIndexM :: Monad m => Vector (Product a) -> Int -> m (Product a)

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Product a) -> Vector (Product a) -> m ()

elemseq :: Vector (Product a) -> Product a -> b -> b

Unbox a => MVector MVector (Product a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s (Product a) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s (Product a) -> MVector s (Product a)

basicOverlaps :: MVector s (Product a) -> MVector s (Product a) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Product a))

basicInitialize :: PrimMonad m => MVector (PrimState m) (Product a) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Product a -> m (MVector (PrimState m) (Product a))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Product a) -> Int -> m (Product a)

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Product a) -> Int -> Product a -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) (Product a) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) (Product a) -> Product a -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Product a) -> MVector (PrimState m) (Product a) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Product a) -> MVector (PrimState m) (Product a) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Product a) -> Int -> m (MVector (PrimState m) (Product a))

Bounded a => Bounded (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Eq a => Eq (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Product a -> Product a -> Bool #

(/=) :: Product a -> Product a -> Bool #

Num a => Num (Product a)

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Product a -> Product a -> Product a #

(-) :: Product a -> Product a -> Product a #

(*) :: Product a -> Product a -> Product a #

negate :: Product a -> Product a #

abs :: Product a -> Product a #

signum :: Product a -> Product a #

fromInteger :: Integer -> Product a #

Ord a => Ord (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Product a -> Product a -> Ordering #

(<) :: Product a -> Product a -> Bool #

(<=) :: Product a -> Product a -> Bool #

(>) :: Product a -> Product a -> Bool #

(>=) :: Product a -> Product a -> Bool #

max :: Product a -> Product a -> Product a #

min :: Product a -> Product a -> Product a #

Read a => Read (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Show a => Show (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Product a -> ShowS #

show :: Product a -> String #

showList :: [Product a] -> ShowS #

Generic (Product a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Product a) :: Type -> Type #

Methods

from :: Product a -> Rep (Product a) x #

to :: Rep (Product a) x -> Product a #

Num a => Semigroup (Product a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Product a -> Product a -> Product a #

sconcat :: NonEmpty (Product a) -> Product a #

stimes :: Integral b => b -> Product a -> Product a #

Num a => Monoid (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Product a #

mappend :: Product a -> Product a -> Product a #

mconcat :: [Product a] -> Product a #

Unbox a => Unbox (Product a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Prim a => Prim (Product a) 
Instance details

Defined in Data.Primitive.Types

Num a => Default (Product a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Product a

Newtype (Product a) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Product a) :: Type

Methods

pack :: O (Product a) -> Product a

unpack :: Product a -> O (Product a)

Wrapped (Product a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Product a) :: Type

Methods

_Wrapped' :: Iso' (Product a) (Unwrapped (Product a))

Generic1 Product 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep1 Product :: k -> Type #

Methods

from1 :: Product a -> Rep1 Product a #

to1 :: Rep1 Product a -> Product a #

t ~ Product b => Rewrapped (Product a) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep Product 
Instance details

Defined in Data.Functor.Rep

type Rep Product = ()
newtype MVector s (Product a) 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s (Product a) = MV_Product (MVector s a)
type Rep (Product a)

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep (Product a) = D1 (MetaData "Product" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Product" PrefixI True) (S1 (MetaSel (Just "getProduct") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
newtype Vector (Product a) 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector (Product a) = V_Product (Vector a)
type O (Product a) 
Instance details

Defined in Control.Newtype.Generics

type O (Product a) = a
type Unwrapped (Product a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Product a) = a
type Rep1 Product

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep1 Product = D1 (MetaData "Product" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Product" PrefixI True) (S1 (MetaSel (Just "getProduct") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Alt (f :: k -> Type) (a :: k) :: forall k. (k -> Type) -> k -> Type #

Monoid under <|>.

Since: base-4.8.0.0

Constructors

Alt 

Fields

Instances
Generic1 (Alt f :: k -> Type) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep1 (Alt f) :: k -> Type #

Methods

from1 :: Alt f a -> Rep1 (Alt f) a #

to1 :: Rep1 (Alt f) a -> Alt f a #

Unbox (f a) => Vector Vector (Alt f a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Alt f a) -> m (Vector (Alt f a))

basicUnsafeThaw :: PrimMonad m => Vector (Alt f a) -> m (Mutable Vector (PrimState m) (Alt f a))

basicLength :: Vector (Alt f a) -> Int

basicUnsafeSlice :: Int -> Int -> Vector (Alt f a) -> Vector (Alt f a)

basicUnsafeIndexM :: Monad m => Vector (Alt f a) -> Int -> m (Alt f a)

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Alt f a) -> Vector (Alt f a) -> m ()

elemseq :: Vector (Alt f a) -> Alt f a -> b -> b

Unbox (f a) => MVector MVector (Alt f a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s (Alt f a) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s (Alt f a) -> MVector s (Alt f a)

basicOverlaps :: MVector s (Alt f a) -> MVector s (Alt f a) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Alt f a))

basicInitialize :: PrimMonad m => MVector (PrimState m) (Alt f a) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Alt f a -> m (MVector (PrimState m) (Alt f a))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Alt f a) -> Int -> m (Alt f a)

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Alt f a) -> Int -> Alt f a -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) (Alt f a) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) (Alt f a) -> Alt f a -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Alt f a) -> MVector (PrimState m) (Alt f a) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Alt f a) -> MVector (PrimState m) (Alt f a) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Alt f a) -> Int -> m (MVector (PrimState m) (Alt f a))

Monad f => Monad (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b #

(>>) :: Alt f a -> Alt f b -> Alt f b #

return :: a -> Alt f a #

fail :: String -> Alt f a #

Functor f => Functor (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Alt f a -> Alt f b #

(<$) :: a -> Alt f b -> Alt f a #

Applicative f => Applicative (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

pure :: a -> Alt f a #

(<*>) :: Alt f (a -> b) -> Alt f a -> Alt f b #

liftA2 :: (a -> b -> c) -> Alt f a -> Alt f b -> Alt f c #

(*>) :: Alt f a -> Alt f b -> Alt f b #

(<*) :: Alt f a -> Alt f b -> Alt f a #

Foldable f => Foldable (Alt f)

Since: base-4.12.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Alt f m -> m #

foldMap :: Monoid m => (a -> m) -> Alt f a -> m #

foldr :: (a -> b -> b) -> b -> Alt f a -> b #

foldr' :: (a -> b -> b) -> b -> Alt f a -> b #

foldl :: (b -> a -> b) -> b -> Alt f a -> b #

foldl' :: (b -> a -> b) -> b -> Alt f a -> b #

foldr1 :: (a -> a -> a) -> Alt f a -> a #

foldl1 :: (a -> a -> a) -> Alt f a -> a #

toList :: Alt f a -> [a] #

null :: Alt f a -> Bool #

length :: Alt f a -> Int #

elem :: Eq a => a -> Alt f a -> Bool #

maximum :: Ord a => Alt f a -> a #

minimum :: Ord a => Alt f a -> a #

sum :: Num a => Alt f a -> a #

product :: Num a => Alt f a -> a #

Traversable f => Traversable (Alt f)

Since: base-4.12.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Alt f a -> f0 (Alt f b) #

sequenceA :: Applicative f0 => Alt f (f0 a) -> f0 (Alt f a) #

mapM :: Monad m => (a -> m b) -> Alt f a -> m (Alt f b) #

sequence :: Monad m => Alt f (m a) -> m (Alt f a) #

Alternative f => Alternative (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

empty :: Alt f a #

(<|>) :: Alt f a -> Alt f a -> Alt f a #

some :: Alt f a -> Alt f [a] #

many :: Alt f a -> Alt f [a] #

MonadPlus f => MonadPlus (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

mzero :: Alt f a #

mplus :: Alt f a -> Alt f a -> Alt f a #

Enum (f a) => Enum (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

succ :: Alt f a -> Alt f a #

pred :: Alt f a -> Alt f a #

toEnum :: Int -> Alt f a #

fromEnum :: Alt f a -> Int #

enumFrom :: Alt f a -> [Alt f a] #

enumFromThen :: Alt f a -> Alt f a -> [Alt f a] #

enumFromTo :: Alt f a -> Alt f a -> [Alt f a] #

enumFromThenTo :: Alt f a -> Alt f a -> Alt f a -> [Alt f a] #

Eq (f a) => Eq (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Alt f a -> Alt f a -> Bool #

(/=) :: Alt f a -> Alt f a -> Bool #

Num (f a) => Num (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Alt f a -> Alt f a -> Alt f a #

(-) :: Alt f a -> Alt f a -> Alt f a #

(*) :: Alt f a -> Alt f a -> Alt f a #

negate :: Alt f a -> Alt f a #

abs :: Alt f a -> Alt f a #

signum :: Alt f a -> Alt f a #

fromInteger :: Integer -> Alt f a #

Ord (f a) => Ord (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Alt f a -> Alt f a -> Ordering #

(<) :: Alt f a -> Alt f a -> Bool #

(<=) :: Alt f a -> Alt f a -> Bool #

(>) :: Alt f a -> Alt f a -> Bool #

(>=) :: Alt f a -> Alt f a -> Bool #

max :: Alt f a -> Alt f a -> Alt f a #

min :: Alt f a -> Alt f a -> Alt f a #

Read (f a) => Read (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Alt f a) #

readList :: ReadS [Alt f a] #

readPrec :: ReadPrec (Alt f a) #

readListPrec :: ReadPrec [Alt f a] #

Show (f a) => Show (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Alt f a -> ShowS #

show :: Alt f a -> String #

showList :: [Alt f a] -> ShowS #

Generic (Alt f a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Alt f a) :: Type -> Type #

Methods

from :: Alt f a -> Rep (Alt f a) x #

to :: Rep (Alt f a) x -> Alt f a #

Alternative f => Semigroup (Alt f a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Alt f a -> Alt f a -> Alt f a #

sconcat :: NonEmpty (Alt f a) -> Alt f a #

stimes :: Integral b => b -> Alt f a -> Alt f a #

Alternative f => Monoid (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Alt f a #

mappend :: Alt f a -> Alt f a -> Alt f a #

mconcat :: [Alt f a] -> Alt f a #

Unbox (f a) => Unbox (Alt f a) 
Instance details

Defined in Data.Vector.Unboxed.Base

Newtype (Alt f a) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Alt f a) :: Type

Methods

pack :: O (Alt f a) -> Alt f a

unpack :: Alt f a -> O (Alt f a)

Wrapped (Alt f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Alt f a) :: Type

Methods

_Wrapped' :: Iso' (Alt f a) (Unwrapped (Alt f a))

t ~ Alt g b => Rewrapped (Alt f a) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep1 (Alt f :: k -> Type)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep1 (Alt f :: k -> Type) = D1 (MetaData "Alt" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Alt" PrefixI True) (S1 (MetaSel (Just "getAlt") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 f)))
newtype MVector s (Alt f a) 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s (Alt f a) = MV_Alt (MVector s (f a))
type Rep (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

type Rep (Alt f a) = D1 (MetaData "Alt" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Alt" PrefixI True) (S1 (MetaSel (Just "getAlt") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f a))))
newtype Vector (Alt f a) 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector (Alt f a) = V_Alt (Vector (f a))
type O (Alt f a) 
Instance details

Defined in Control.Newtype.Generics

type O (Alt f a) = f a
type Unwrapped (Alt f a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Alt f a) = f a

(===) :: SemigroupY g => g -> g -> g #

(|||) :: SemigroupX g => g -> g -> g #

(──) :: SemigroupY g => g -> g -> g #

(━━) :: SemigroupY g => g -> g -> g #

(│) :: SemigroupX g => g -> g -> g #

(┃) :: SemigroupX g => g -> g -> g #

(██) :: SemigroupZ g => g -> g -> g #

(■) :: SemigroupZ g => g -> g -> g #

class SemigroupNo (n :: Nat) g where #

Minimal complete definition

Nothing

Methods

sappendN :: proxy n -> g -> g -> g #

sconcatN :: proxy n -> NonEmpty g -> g #

stimesN :: (Integral b, HasCallStack) => proxy n -> b -> g -> g #

Instances
SemigroupNo n Void 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy n -> Void -> Void -> Void #

sconcatN :: proxy n -> NonEmpty Void -> Void #

stimesN :: (Integral b, HasCallStack) => proxy n -> b -> Void -> Void #

SemigroupNo n () 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy n -> () -> () -> () #

sconcatN :: proxy n -> NonEmpty () -> () #

stimesN :: (Integral b, HasCallStack) => proxy n -> b -> () -> () #

SemigroupNo n g => SemigroupNo n (Maybe g) 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy n -> Maybe g -> Maybe g -> Maybe g #

sconcatN :: proxy n -> NonEmpty (Maybe g) -> Maybe g #

stimesN :: (Integral b, HasCallStack) => proxy n -> b -> Maybe g -> Maybe g #

SemigroupNo 0 [Char] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [Char] -> [Char] -> [Char] #

sconcatN :: proxy 0 -> NonEmpty [Char] -> [Char] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [Char] -> [Char] #

SemigroupNo 0 [Double] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [Double] -> [Double] -> [Double] #

sconcatN :: proxy 0 -> NonEmpty [Double] -> [Double] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [Double] -> [Double] #

SemigroupNo 0 [Float] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [Float] -> [Float] -> [Float] #

sconcatN :: proxy 0 -> NonEmpty [Float] -> [Float] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [Float] -> [Float] #

SemigroupNo 0 [Int] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [Int] -> [Int] -> [Int] #

sconcatN :: proxy 0 -> NonEmpty [Int] -> [Int] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [Int] -> [Int] #

SemigroupNo 0 [Integer] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [Integer] -> [Integer] -> [Integer] #

sconcatN :: proxy 0 -> NonEmpty [Integer] -> [Integer] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [Integer] -> [Integer] #

SemigroupNo 0 [a] => SemigroupNo 0 [[a]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [[a]] -> [[a]] -> [[a]] #

sconcatN :: proxy 0 -> NonEmpty [[a]] -> [[a]] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [[a]] -> [[a]] #

SemigroupNo 0 [Maybe a] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [Maybe a] -> [Maybe a] -> [Maybe a] #

sconcatN :: proxy 0 -> NonEmpty [Maybe a] -> [Maybe a] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [Maybe a] -> [Maybe a] #

SemigroupNo 0 [Rational] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [Rational] -> [Rational] -> [Rational] #

sconcatN :: proxy 0 -> NonEmpty [Rational] -> [Rational] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [Rational] -> [Rational] #

SemigroupNo 0 [()] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [()] -> [()] -> [()] #

sconcatN :: proxy 0 -> NonEmpty [()] -> [()] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [()] -> [()] #

SemigroupNo 0 [Void] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 0 -> [Void] -> [Void] -> [Void] #

sconcatN :: proxy 0 -> NonEmpty [Void] -> [Void] #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> [Void] -> [Void] #

SemigroupNo 0 (Gridded a) Source # 
Instance details

Defined in Presentation.Yeamer.Internal.Grid

Methods

sappendN :: proxy 0 -> Gridded a -> Gridded a -> Gridded a #

sconcatN :: proxy 0 -> NonEmpty (Gridded a) -> Gridded a #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> Gridded a -> Gridded a #

SemigroupNo 1 [[Char]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[Char]] -> [[Char]] -> [[Char]] #

sconcatN :: proxy 1 -> NonEmpty [[Char]] -> [[Char]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[Char]] -> [[Char]] #

SemigroupNo 1 [[Double]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[Double]] -> [[Double]] -> [[Double]] #

sconcatN :: proxy 1 -> NonEmpty [[Double]] -> [[Double]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[Double]] -> [[Double]] #

SemigroupNo 1 [[Float]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[Float]] -> [[Float]] -> [[Float]] #

sconcatN :: proxy 1 -> NonEmpty [[Float]] -> [[Float]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[Float]] -> [[Float]] #

SemigroupNo 1 [[Int]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[Int]] -> [[Int]] -> [[Int]] #

sconcatN :: proxy 1 -> NonEmpty [[Int]] -> [[Int]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[Int]] -> [[Int]] #

SemigroupNo 1 [[Integer]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[Integer]] -> [[Integer]] -> [[Integer]] #

sconcatN :: proxy 1 -> NonEmpty [[Integer]] -> [[Integer]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[Integer]] -> [[Integer]] #

SemigroupNo 1 [[a]] => SemigroupNo 1 [[[a]]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[[a]]] -> [[[a]]] -> [[[a]]] #

sconcatN :: proxy 1 -> NonEmpty [[[a]]] -> [[[a]]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[[a]]] -> [[[a]]] #

SemigroupNo 1 [[Maybe a]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[Maybe a]] -> [[Maybe a]] -> [[Maybe a]] #

sconcatN :: proxy 1 -> NonEmpty [[Maybe a]] -> [[Maybe a]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[Maybe a]] -> [[Maybe a]] #

SemigroupNo 1 [[Rational]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[Rational]] -> [[Rational]] -> [[Rational]] #

sconcatN :: proxy 1 -> NonEmpty [[Rational]] -> [[Rational]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[Rational]] -> [[Rational]] #

SemigroupNo 1 [[()]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[()]] -> [[()]] -> [[()]] #

sconcatN :: proxy 1 -> NonEmpty [[()]] -> [[()]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[()]] -> [[()]] #

SemigroupNo 1 [[Void]] 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy 1 -> [[Void]] -> [[Void]] -> [[Void]] #

sconcatN :: proxy 1 -> NonEmpty [[Void]] -> [[Void]] #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> [[Void]] -> [[Void]] #

SemigroupNo 1 (Gridded a) Source # 
Instance details

Defined in Presentation.Yeamer.Internal.Grid

Methods

sappendN :: proxy 1 -> Gridded a -> Gridded a -> Gridded a #

sconcatN :: proxy 1 -> NonEmpty (Gridded a) -> Gridded a #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> Gridded a -> Gridded a #

SemigroupNo n (Proxy x) 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy n -> Proxy x -> Proxy x -> Proxy x #

sconcatN :: proxy n -> NonEmpty (Proxy x) -> Proxy x #

stimesN :: (Integral b, HasCallStack) => proxy n -> b -> Proxy x -> Proxy x #

SemigroupNo n g => SemigroupNo n (a -> g) 
Instance details

Defined in Data.Semigroup.Numbered

Methods

sappendN :: proxy n -> (a -> g) -> (a -> g) -> a -> g #

sconcatN :: proxy n -> NonEmpty (a -> g) -> a -> g #

stimesN :: (Integral b, HasCallStack) => proxy n -> b -> (a -> g) -> a -> g #

SemigroupNo 0 (IPresentation m ()) Source # 
Instance details

Defined in Presentation.Yeamer

Methods

sappendN :: proxy 0 -> IPresentation m () -> IPresentation m () -> IPresentation m () #

sconcatN :: proxy 0 -> NonEmpty (IPresentation m ()) -> IPresentation m () #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> IPresentation m () -> IPresentation m () #

SemigroupNo 1 (IPresentation m ()) Source # 
Instance details

Defined in Presentation.Yeamer

Methods

sappendN :: proxy 1 -> IPresentation m () -> IPresentation m () -> IPresentation m () #

sconcatN :: proxy 1 -> NonEmpty (IPresentation m ()) -> IPresentation m () #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> IPresentation m () -> IPresentation m () #

data Css #

Instances
HasContentType Css 
Instance details

Defined in Yesod.Core.Content

Methods

getContentType :: Monad m => m Css -> ContentType

ToContent Css 
Instance details

Defined in Yesod.Core.Content

Methods

toContent :: Css -> Content

ToTypedContent Css 
Instance details

Defined in Yesod.Core.Content

Methods

toTypedContent :: Css -> TypedContent

ToWidget site Css 
Instance details

Defined in Yesod.Core.Widget

Methods

toWidget :: (MonadWidget m, HandlerSite m ~ site) => Css -> m ()

ToWidgetHead site Css 
Instance details

Defined in Yesod.Core.Widget

Methods

toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => Css -> m ()

ToWidgetMedia site Css 
Instance details

Defined in Yesod.Core.Widget

Methods

toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> Css -> m ()

render ~ RY site => ToWidget site (render -> Css) 
Instance details

Defined in Yesod.Core.Widget

Methods

toWidget :: (MonadWidget m, HandlerSite m ~ site) => (render -> Css) -> m ()

render ~ RY site => ToWidgetHead site (render -> Css) 
Instance details

Defined in Yesod.Core.Widget

Methods

toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => (render -> Css) -> m ()

render ~ RY site => ToWidgetMedia site (render -> Css) 
Instance details

Defined in Yesod.Core.Widget

Methods

toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> (render -> Css) -> m ()

data IPresentation m r Source #

Instances
SemigroupNo 0 (IPresentation m ()) Source # 
Instance details

Defined in Presentation.Yeamer

Methods

sappendN :: proxy 0 -> IPresentation m () -> IPresentation m () -> IPresentation m () #

sconcatN :: proxy 0 -> NonEmpty (IPresentation m ()) -> IPresentation m () #

stimesN :: (Integral b, HasCallStack) => proxy 0 -> b -> IPresentation m () -> IPresentation m () #

SemigroupNo 1 (IPresentation m ()) Source # 
Instance details

Defined in Presentation.Yeamer

Methods

sappendN :: proxy 1 -> IPresentation m () -> IPresentation m () -> IPresentation m () #

sconcatN :: proxy 1 -> NonEmpty (IPresentation m ()) -> IPresentation m () #

stimesN :: (Integral b, HasCallStack) => proxy 1 -> b -> IPresentation m () -> IPresentation m () #

Monad (IPresentation m) Source # 
Instance details

Defined in Presentation.Yeamer

Methods

(>>=) :: IPresentation m a -> (a -> IPresentation m b) -> IPresentation m b #

(>>) :: IPresentation m a -> IPresentation m b -> IPresentation m b #

return :: a -> IPresentation m a #

fail :: String -> IPresentation m a #

Functor (IPresentation m) Source # 
Instance details

Defined in Presentation.Yeamer

Methods

fmap :: (a -> b) -> IPresentation m a -> IPresentation m b #

(<$) :: a -> IPresentation m b -> IPresentation m a #

Applicative (IPresentation m) Source # 
Instance details

Defined in Presentation.Yeamer

Methods

pure :: a -> IPresentation m a #

(<*>) :: IPresentation m (a -> b) -> IPresentation m a -> IPresentation m b #

liftA2 :: (a -> b -> c) -> IPresentation m a -> IPresentation m b -> IPresentation m c #

(*>) :: IPresentation m a -> IPresentation m b -> IPresentation m b #

(<*) :: IPresentation m a -> IPresentation m b -> IPresentation m a #

r ~ () => IsString (IPresentation m r) Source # 
Instance details

Defined in Presentation.Yeamer

Methods

fromString :: String -> IPresentation m r #

(Monad m, Monoid r, Sessionable r) => Semigroup (IPresentation m r) Source # 
Instance details

Defined in Presentation.Yeamer

Monad m => Monoid (IPresentation m ()) Source # 
Instance details

Defined in Presentation.Yeamer

data YeamerServerConfig Source #

Instances
Default YeamerServerConfig Source # 
Instance details

Defined in Presentation.Yeamer

(→│) :: Sessionable a => IPresentation m a -> IPresentation m b -> IPresentation m a infix 6 Source #

(↘──) :: Sessionable a => IPresentation m a -> IPresentation m b -> IPresentation m a infix 5 Source #

(│←) :: Sessionable b => IPresentation m a -> IPresentation m b -> IPresentation m b infix 6 Source #

(──↖) :: Sessionable b => IPresentation m a -> IPresentation m b -> IPresentation m b infix 5 Source #

(→│→) :: (Sessionable a, Monad m) => IPresentation m a -> (a -> IPresentation m ()) -> IPresentation m a infix 6 Source #

(↘──↘) :: (Sessionable a, Monad m) => IPresentation m a -> (a -> IPresentation m ()) -> IPresentation m a infix 5 Source #

(→│←) :: (Sessionable a, Sessionable b) => IPresentation m a -> IPresentation m b -> IPresentation m (a, b) infix 6 Source #

(↘──↖) :: (Sessionable a, Sessionable b) => IPresentation m a -> IPresentation m b -> IPresentation m (a, b) infix 5 Source #

feedback_ :: Sessionable a => (Maybe a -> IPresentation m a) -> IPresentation m () Source #

serverSide :: Sessionable a => m a -> IPresentation m a Source #

Run a monadic action and use the result in the presentation. Note that the action may not be re-run even if it depends to other values chosen at another point in the presentation, so use with care.

(======) :: Sessionable r => Html -> IPresentation m r -> IPresentation m r infixr 6 Source #

Infix synonym of addHeading. Intended to be used in do blocks, for headings of presentation slides.

addHeading :: Sessionable r => Html -> IPresentation m r -> IPresentation m r Source #

divClass :: Sessionable r => Text -> IPresentation m r -> IPresentation m r Source #

spanClass :: Sessionable r => Text -> IPresentation m r -> IPresentation m r Source #

divClasses :: Sessionable r => [(Text, IPresentation m r)] -> IPresentation m r Source #

(#%) :: Sessionable r => Text -> IPresentation m r -> IPresentation m r infix 8 Source #

Assign this content a CSS class attribute. If the content is inline, this will be a span, else a div.

tweakContent :: Sessionable r => (Html -> Html) -> IPresentation m r -> IPresentation m r Source #

inputBox :: forall i m. (Inputtable i, FromJSON i) => i -> IPresentation m i Source #

dropdownSelect :: forall a m. (a -> String) -> [a] -> Int -> IPresentation m a Source #

verbatim Source #

Arguments

:: QuasiQuoter

Value -> IPresentation m ()

Include a piece of plaintext, preserving all formatting. To be used in an oxford bracket.

In practice, you probably want to use this for monospace plaintext, which should appear in a pre or textarea tag. Use the specialised quoters for that.

verbatimWithin Source #

Arguments

:: Name

A function Html -> Html that should be used for presenting the (pre-escaped) plaintext.

-> QuasiQuoter

A specialised version of verbatim that will always use the wrapper.

Convenience wrapper to generate quasi-quoters that will wrap code in any suitable HTML environment.

plaintext Source #

Arguments

:: QuasiQuoter

Value -> IPresentation m ()

A simple version of verbatim that gives the HTML wrapped in pre tags, so it will (by default) appear in a monospace font.

imageFromFileSupplier Source #

Arguments

:: String

File extension

-> (FilePath -> IO ())

File-writer function. This will be called every time a slide with the image is requested.

-> IPresentation IO () 

Display an image generated on-the-fly in the server. The image will be stored temporarily, in a content-indexed fashion.

imageFromFile :: FilePath -> IPresentation IO () Source #

Display an image that lies on the server as any ordinary static file. This is a special case of useFile, wrapping the file in an img tag.

mediaFromFile :: FilePath -> IPresentation IO () Source #

More general form of imageFromFile. Takes a guess based on the file extension, as to whether the media is a standing image or a video. In the latter case, simple HTML5 controls are added.

useFile Source #

Arguments

:: FilePath

File that should be served to the client

-> (Url -> Html)

How it should be used in the presentation

-> IPresentation IO () 

useFileSupplier Source #

Arguments

:: String

File extension

-> (FilePath -> IO ())

Server-side file-providing action

-> (Url -> Html)

How to use the file client-side

-> IPresentation IO () 

class InteractiveShow a where Source #

Minimal complete definition

Nothing

Methods

display :: a -> Presentation Source #

displayOriented :: DisplayOrientation -> a -> Presentation Source #

displayOriented :: (Generic a, GInteractiveShow (Rep a)) => DisplayOrientation -> a -> Presentation Source #

displayList :: DisplayOrientation -> [a] -> Presentation Source #

Instances
InteractiveShow Char Source # 
Instance details

Defined in Presentation.Yeamer

Methods

display :: Char -> Presentation Source #

displayOriented :: DisplayOrientation -> Char -> Presentation Source #

displayList :: DisplayOrientation -> [Char] -> Presentation Source #

InteractiveShow Double Source # 
Instance details

Defined in Presentation.Yeamer

Methods

display :: Double -> Presentation Source #

displayOriented :: DisplayOrientation -> Double -> Presentation Source #

displayList :: DisplayOrientation -> [Double] -> Presentation Source #

InteractiveShow Int Source # 
Instance details

Defined in Presentation.Yeamer

Methods

display :: Int -> Presentation Source #

displayOriented :: DisplayOrientation -> Int -> Presentation Source #

displayList :: DisplayOrientation -> [Int] -> Presentation Source #

InteractiveShow Int16 Source # 
Instance details

Defined in Presentation.Yeamer

Methods

display :: Int16 -> Presentation Source #

displayOriented :: DisplayOrientation -> Int16 -> Presentation Source #

displayList :: DisplayOrientation -> [Int16] -> Presentation Source #

InteractiveShow Int32 Source # 
Instance details

Defined in Presentation.Yeamer

Methods

display :: Int32 -> Presentation Source #

displayOriented :: DisplayOrientation -> Int32 -> Presentation Source #

displayList :: DisplayOrientation -> [Int32] -> Presentation Source #

InteractiveShow Int64 Source # 
Instance details

Defined in Presentation.Yeamer

Methods

display :: Int64 -> Presentation Source #

displayOriented :: DisplayOrientation -> Int64 -> Presentation Source #

displayList :: DisplayOrientation -> [Int64] -> Presentation Source #

InteractiveShow a => InteractiveShow [a] Source # 
Instance details

Defined in Presentation.Yeamer

Methods

display :: [a] -> Presentation Source #

displayOriented :: DisplayOrientation -> [a] -> Presentation Source #

displayList :: DisplayOrientation -> [[a]] -> Presentation Source #

yeamer :: Presentation -> IO () Source #

Run a Yesod/Warp web server that will allow the presentation to be viewed in a web browser, on port 14910. This is a shorthand for yeamer' def.

(&) :: a -> (a -> b) -> b infixl 1 #

& is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $.

>>> 5 & (+1) & show
"6"

Since: base-4.8.0.0

(%$>) :: (SymbolClass σ, SCConstraint σ c) => (c -> c') -> CAS' γ s² s¹ (SymbolD σ c) -> CAS' γ s² s¹ (SymbolD σ c') #

continueExpr :: (Eq l, Monoid l) => (AlgebraExpr' γ σ l -> AlgebraExpr' γ σ l -> AlgebraExpr' γ σ l) -> (AlgebraExpr' γ σ l -> AlgebraExpr' γ σ l) -> AlgebraExpr' γ σ l -> AlgebraExpr' γ σ l #

don'tParenthesise :: Monoid s¹ => CAS' γ (Infix s²) (Encapsulation s¹) s⁰ -> CAS' γ (Infix s²) (Encapsulation s¹) s⁰ #

normaliseSymbols :: (SymbolClass σ, SCConstraint σ c) => CAS' γ s² s¹ (SymbolD σ c) -> CAS' γ s² s¹ (SymbolD σ c) #

symbolFunction :: Monoid s¹ => s¹ -> CAS' γ (Infix s²) (Encapsulation s¹) s⁰ -> CAS' γ (Infix s²) (Encapsulation s¹) s⁰ #

symbolInfix :: s² -> CAS' γ s² s¹ s⁰ -> CAS' γ s² s¹ s⁰ -> CAS' γ s² s¹ s⁰ #

class ASCIISymbols c where #

Instances
ASCIISymbols String 
Instance details

Defined in CAS.Dumb.Symbols

type AlgebraExpr σ l = CAS (Infix l) (Encapsulation l) (SymbolD σ l) #

type AlgebraExpr' γ σ l = CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

type AlgebraPattern σ l = AlgebraExpr' GapId σ l #

data Encapsulation s #

Instances
Eq (Encapsulation String) 
Instance details

Defined in CAS.Dumb.Symbols

(UnicodeSymbols c, RenderableEncapsulations c) => Show (Expression c) 
Instance details

Defined in CAS.Dumb.Symbols.Unicode.MathLatin_RomanGreek__BopomofoGaps

(UnicodeSymbols c, RenderableEncapsulations c) => Show (Pattern c) 
Instance details

Defined in CAS.Dumb.Symbols.Unicode.MathLatin_RomanGreek__BopomofoGaps

Methods

showsPrec :: Int -> Pattern c -> ShowS #

show :: Pattern c -> String #

showList :: [Pattern c] -> ShowS #

(SymbolClass σ, SCConstraint σ String) => Floating (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

(SymbolClass σ, SCConstraint σ String) => Fractional (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

(SymbolClass σ, SCConstraint σ String) => Num (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

type Scalar (LaTeXMath σ) 
Instance details

Defined in Math.LaTeX.Internal.MathExpr

type Scalar (LaTeXMath σ) = LaTeXMath σ

data Infix s #

Constructors

Infix 

Fields

Instances
Eq s => Eq (Infix s) 
Instance details

Defined in CAS.Dumb.Symbols

Methods

(==) :: Infix s -> Infix s -> Bool #

(/=) :: Infix s -> Infix s -> Bool #

(UnicodeSymbols c, RenderableEncapsulations c) => Show (Expression c) 
Instance details

Defined in CAS.Dumb.Symbols.Unicode.MathLatin_RomanGreek__BopomofoGaps

(UnicodeSymbols c, RenderableEncapsulations c) => Show (Pattern c) 
Instance details

Defined in CAS.Dumb.Symbols.Unicode.MathLatin_RomanGreek__BopomofoGaps

Methods

showsPrec :: Int -> Pattern c -> ShowS #

show :: Pattern c -> String #

showList :: [Pattern c] -> ShowS #

(SymbolClass σ, SCConstraint σ String) => Floating (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

(SymbolClass σ, SCConstraint σ String) => Fractional (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

(SymbolClass σ, SCConstraint σ String) => Num (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

type Scalar (LaTeXMath σ) 
Instance details

Defined in Math.LaTeX.Internal.MathExpr

type Scalar (LaTeXMath σ) = LaTeXMath σ

class Eq (SpecialEncapsulation c) => RenderableEncapsulations c where #

Methods

fixateAlgebraEncaps :: (SymbolClass σ, SCConstraint σ c) => CAS' γ (Infix c) (Encapsulation c) (SymbolD σ c) -> CAS' γ (Infix c) (Encapsulation c) (SymbolD σ c) #

type RenderingCombinator σ c r = Bool -> Maybe r -> SymbolD σ c -> Maybe r -> r #

type family SpecialEncapsulation s :: Type #

Instances
type SpecialEncapsulation String 
Instance details

Defined in CAS.Dumb.Symbols

type SpecialEncapsulation LaTeX 
Instance details

Defined in CAS.Dumb.LaTeX.Symbols

type SpecialEncapsulation LaTeX = LaTeXMathEncapsulation

data SymbolD σ c #

Instances
(UnicodeSymbols c, RenderableEncapsulations c) => Show (Expression c) 
Instance details

Defined in CAS.Dumb.Symbols.Unicode.MathLatin_RomanGreek__BopomofoGaps

(UnicodeSymbols c, RenderableEncapsulations c) => Show (Pattern c) 
Instance details

Defined in CAS.Dumb.Symbols.Unicode.MathLatin_RomanGreek__BopomofoGaps

Methods

showsPrec :: Int -> Pattern c -> ShowS #

show :: Pattern c -> String #

showList :: [Pattern c] -> ShowS #

Unwieldy c => Unwieldy (Symbol c) 
Instance details

Defined in CAS.Dumb.Symbols.Unicode.MathLatin_RomanGreek__BopomofoGaps

Methods

unwieldiness :: Symbol c -> Unwieldiness

(SymbolClass σ, SCConstraint σ c, Eq c) => Eq (SymbolD σ c) 
Instance details

Defined in CAS.Dumb.Symbols

Methods

(==) :: SymbolD σ c -> SymbolD σ c -> Bool #

(/=) :: SymbolD σ c -> SymbolD σ c -> Bool #

(SymbolClass σ, SCConstraint σ String) => Floating (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

(SymbolClass σ, SCConstraint σ String) => Fractional (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

(SymbolClass σ, SCConstraint σ String) => Num (AlgebraExpr' γ σ String) 
Instance details

Defined in CAS.Dumb.Symbols

type Scalar (LaTeXMath σ) 
Instance details

Defined in Math.LaTeX.Internal.MathExpr

type Scalar (LaTeXMath σ) = LaTeXMath σ

class UnicodeSymbols c where #

Instances
UnicodeSymbols String 
Instance details

Defined in CAS.Dumb.Symbols

(&~!) :: (Eq s⁰, Eq s¹, Eq s², Show (CAS s² s¹ s⁰), Show (CAS' GapId s² s¹ s⁰)) => CAS s² s¹ s⁰ -> Eqspattern s² s¹ s⁰ -> CAS s² s¹ s⁰ #

(&~:) :: (Eq s⁰, Eq s¹, Eq s²) => CAS s² s¹ s⁰ -> Eqspattern s² s¹ s⁰ -> CAS s² s¹ s⁰ #

(&~?) :: (Eq s⁰, Eq s¹, Eq s²) => CAS s² s¹ s⁰ -> Eqspattern s² s¹ s⁰ -> [CAS s² s¹ s⁰] #

underline :: LaTeXC l => l -> l #

bar :: LaTeXC l => l -> l #

dot :: LaTeXC l => l -> l #

hat :: LaTeXC l => l -> l #

tilde :: LaTeXC l => l -> l #

vec :: LaTeXC l => l -> l #

ddot :: LaTeXC l => l -> l #

dcalculation :: (LaTeXC (m ()), LaTeXSymbol σ, Functor m) => LaTeXMath σ -> String -> m (LaTeXMath σ) #

dmaths :: (LaTeXC r, LaTeXSymbol σ) => [[LaTeXMath σ]] -> String -> r #

equations :: (LaTeXC r, LaTeXSymbol σ, HasCallStack) => [(LaTeXMath σ, String)] -> String -> r #

(*..*) :: MathsInfix #

(+..+) :: MathsInfix #

(-\-) :: MathsInfix #

(-→) :: MathsInfix #

(...) :: MathsInfix #

(/⊂) :: MathsInfix #

(<.<) :: MathsInfix #

(<.≤) :: MathsInfix #

(<==) :: MathsInfix #

(<=>) :: MathsInfix #

(<،>) :: MathsInfix #

(==>) :: MathsInfix #

(=→) :: MathsInfix #

(=⸪) :: MathsInfix #

cases :: LaTeXC l => [(CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l), LaTeX)] -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

d :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ -> Integrand γ (Infix l) (Encapsulation l) s⁰ #

del :: (SymbolClass σ, SCConstraint σ LaTeX) => CAS' γ s² s¹ (SymbolD σ LaTeX) #

factorial :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

infty :: (SymbolClass σ, SCConstraint σ LaTeX) => CAS' γ s² s¹ (SymbolD σ LaTeX) #

intv :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

matrix :: LaTeXC l => [[CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l)]] -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

nabla :: (SymbolClass σ, SCConstraint σ LaTeX) => CAS' γ s² s¹ (SymbolD σ LaTeX) #

nobreaks :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

norm :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

set :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

setCompr :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

toMathLaTeX :: (l ~ LaTeX, SymbolClass σ, SCConstraint σ l) => CAS (Infix l) (Encapsulation l) (SymbolD σ l) -> l #

tup :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(|◝) :: LaTeXC s => CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s) -> CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s) -> CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s) #

(|◞) :: MathsInfix #

(|◞◝) :: LaTeXC s => CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s) -> (CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s), CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s)) -> CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s) #

(°) :: MathsInfix #

(±) :: MathsInfix #

(×) :: MathsInfix #

(،) :: MathsInfix #

(،..،) :: MathsInfix #

(⁀) :: MathsInfix #

(₌₌) :: MathsInfix #

(←-) :: MathsInfix #

(←=) :: MathsInfix #

(↦) :: MathsInfix #

(↪) :: MathsInfix #

(∀:) :: MathsInfix #

(∃:) :: MathsInfix #

(∄:) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ #

(∈) :: MathsInfix #

(∉) :: MathsInfix #

(∋) :: MathsInfix #

(∌) :: MathsInfix #

(∏) :: LaTeXC l => (CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l), CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l)) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(∑) :: LaTeXC l => (CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l), CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l)) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(∓) :: MathsInfix #

(∖) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ #

(∗) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ #

(∘) :: MathsInfix #

(∝) :: MathsInfix #

(∥) :: MathsInfix #

(∧) :: MathsInfix #

(∨) :: MathsInfix #

(∩) :: MathsInfix #

(∪) :: MathsInfix #

(∫) :: LaTeXC l => (CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l), CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l)) -> Integrand γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(∼) :: MathsInfix #

(≃) :: MathsInfix #

(≅) :: MathsInfix #

(≈) :: MathsInfix #

(≠) :: MathsInfix #

(≡) :: MathsInfix #

(≤) :: MathsInfix #

(≤.<) :: MathsInfix #

(≤.≤) :: MathsInfix #

(≥) :: MathsInfix #

(≪) :: MathsInfix #

(≫) :: MathsInfix #

(⊂) :: MathsInfix #

(⊃) :: MathsInfix #

(⊆) :: MathsInfix #

(⊇) :: MathsInfix #

(⊎) :: MathsInfix #

(⊕) :: MathsInfix #

(⊗) :: MathsInfix #

(⋂) :: LaTeXC l => (CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l), CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l)) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(⋃) :: LaTeXC l => (CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l), CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l)) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(⋆) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ -> CAS' γ (Infix l) (Encapsulation l) s⁰ #

(␣) :: MathsInfix #

(◝) :: MathsInfix #

(◝⁀) :: MathsInfix #

(◞) :: MathsInfix #

(◞∏) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(◞∑) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(◞∫) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> Integrand γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(◞∮) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> Integrand γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(◞⋂) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(◞⋃) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(◞◝) :: LaTeXC s => CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s) -> (CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s), CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s)) -> CAS' γ (Infix s) (Encapsulation s) (SymbolD σ s) #

(◞⨄) :: LaTeXC l => CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(⟂) :: MathsInfix #

(⧵) :: MathsInfix #

(⨄) :: LaTeXC l => (CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l), CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l)) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) -> CAS' γ (Infix l) (Encapsulation l) (SymbolD σ l) #

(⩵) :: MathsInfix #

(⩵!) :: MathsInfix #

(⪡) :: MathsInfix #

(⪢) :: MathsInfix #

(⸪) :: MathsInfix #

(⸪=) :: MathsInfix #

prime :: LaTeXC l => l -> l #

(|->) :: CAS' γ s² s¹ s⁰ -> CAS' γ s² s¹ s⁰ -> Equality' γ s² s¹ s⁰ #

pattern Α :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Β :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Γ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Δ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ε :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ζ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Η :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Θ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ι :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Κ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Λ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Μ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ν :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ξ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ο :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Π :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ρ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Σ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Τ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Υ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Φ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Χ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ψ :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern Ω :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

α :: Expression' γ s² s¹ ζ #

β :: Expression' γ s² s¹ ζ #

γ :: Expression' γ s² s¹ ζ #

δ :: Expression' γ s² s¹ ζ #

ε :: Expression' γ s² s¹ ζ #

ζ :: Expression' γ s² s¹ ζ #

η :: Expression' γ s² s¹ ζ #

θ :: Expression' γ s² s¹ ζ #

ι :: Expression' γ s² s¹ ζ #

κ :: Expression' γ s² s¹ ζ #

λ :: Expression' γ s² s¹ ζ #

μ :: Expression' γ s² s¹ ζ #

ν :: Expression' γ s² s¹ ζ #

ξ :: Expression' γ s² s¹ ζ #

ο :: Expression' γ s² s¹ ζ #

π :: Expression' γ s² s¹ ζ #

ρ :: Expression' γ s² s¹ ζ #

ς :: Expression' γ s² s¹ ζ #

σ :: Expression' γ s² s¹ ζ #

τ :: Expression' γ s² s¹ ζ #

υ :: Expression' γ s² s¹ ζ #

φ :: Expression' γ s² s¹ ζ #

χ :: Expression' γ s² s¹ ζ #

ψ :: Expression' γ s² s¹ ζ #

ω :: Expression' γ s² s¹ ζ #

ϑ :: Expression' γ s² s¹ ζ #

ϕ :: Expression' γ s² s¹ ζ #

ϱ :: Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

:: Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

:: CAS' GapId s² s¹ s⁰ #

pattern 𝐀 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐁 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐂 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐃 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐄 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐅 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐆 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐇 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐈 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐉 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐊 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐋 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐌 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐍 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐎 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐏 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐐 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐑 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐒 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐓 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐔 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐕 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐖 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐗 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐘 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐙 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

𝐚 :: Expression' γ s² s¹ ζ #

𝐛 :: Expression' γ s² s¹ ζ #

𝐜 :: Expression' γ s² s¹ ζ #

𝐝 :: Expression' γ s² s¹ ζ #

𝐞 :: Expression' γ s² s¹ ζ #

𝐟 :: Expression' γ s² s¹ ζ #

𝐠 :: Expression' γ s² s¹ ζ #

𝐡 :: Expression' γ s² s¹ ζ #

𝐢 :: Expression' γ s² s¹ ζ #

𝐣 :: Expression' γ s² s¹ ζ #

𝐤 :: Expression' γ s² s¹ ζ #

𝐥 :: Expression' γ s² s¹ ζ #

𝐦 :: Expression' γ s² s¹ ζ #

𝐧 :: Expression' γ s² s¹ ζ #

𝐨 :: Expression' γ s² s¹ ζ #

𝐩 :: Expression' γ s² s¹ ζ #

𝐪 :: Expression' γ s² s¹ ζ #

𝐫 :: Expression' γ s² s¹ ζ #

𝐬 :: Expression' γ s² s¹ ζ #

𝐭 :: Expression' γ s² s¹ ζ #

𝐮 :: Expression' γ s² s¹ ζ #

𝐯 :: Expression' γ s² s¹ ζ #

𝐰 :: Expression' γ s² s¹ ζ #

𝐱 :: Expression' γ s² s¹ ζ #

𝐲 :: Expression' γ s² s¹ ζ #

𝐳 :: Expression' γ s² s¹ ζ #

pattern 𝐴 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐵 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐶 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐷 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐸 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐹 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐺 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐻 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐼 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐽 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐾 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝐿 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑀 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑁 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑂 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑃 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑄 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑅 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑆 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑇 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑈 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑉 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑊 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑋 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑌 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝑍 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

𝑎 :: Expression' γ s² s¹ ζ #

𝑏 :: Expression' γ s² s¹ ζ #

𝑐 :: Expression' γ s² s¹ ζ #

𝑑 :: Expression' γ s² s¹ ζ #

𝑒 :: Expression' γ s² s¹ ζ #

𝑓 :: Expression' γ s² s¹ ζ #

𝑔 :: Expression' γ s² s¹ ζ #

𝑖 :: Expression' γ s² s¹ ζ #

𝑗 :: Expression' γ s² s¹ ζ #

𝑘 :: Expression' γ s² s¹ ζ #

𝑙 :: Expression' γ s² s¹ ζ #

𝑚 :: Expression' γ s² s¹ ζ #

𝑛 :: Expression' γ s² s¹ ζ #

𝑜 :: Expression' γ s² s¹ ζ #

𝑝 :: Expression' γ s² s¹ ζ #

𝑞 :: Expression' γ s² s¹ ζ #

𝑟 :: Expression' γ s² s¹ ζ #

𝑠 :: Expression' γ s² s¹ ζ #

𝑡 :: Expression' γ s² s¹ ζ #

𝑢 :: Expression' γ s² s¹ ζ #

𝑣 :: Expression' γ s² s¹ ζ #

𝑤 :: Expression' γ s² s¹ ζ #

𝑥 :: Expression' γ s² s¹ ζ #

𝑦 :: Expression' γ s² s¹ ζ #

𝑧 :: Expression' γ s² s¹ ζ #

pattern 𝒜 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒞 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒟 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒢 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒥 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒦 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒩 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒪 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒫 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒬 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒮 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒯 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒰 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒱 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒲 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒳 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒴 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝒵 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓐 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓑 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓒 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓓 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓔 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓕 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓖 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓗 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓘 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓙 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓚 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓛 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓜 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓝 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓞 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓟 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓠 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓡 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓢 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓣 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓤 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓥 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓦 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓧 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓨 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝓩 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔄 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔅 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔇 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔈 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔉 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔊 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔍 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔎 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔏 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔐 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔑 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔒 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔓 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔔 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔖 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔗 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔘 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔙 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔚 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔛 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔜 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔸 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔹 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔻 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔼 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔽 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝔾 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕀 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕁 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕂 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕃 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕄 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕆 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕊 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕋 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕌 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕍 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕎 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕏 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

pattern 𝕐 :: forall γ s² s¹ ζ. Expression' γ s² s¹ ζ #

type LaTeXMath σ = CAS (Infix LaTeX) (Encapsulation LaTeX) (SymbolD σ LaTeX) #

type LaTeXSymbol σ = (SymbolClass σ, SCConstraint σ LaTeX) #

type Expression' γ s² s¹ c = CAS' γ s² s¹ (Symbol c) #

type Pattern c = Expression' GapId (Infix c) (Encapsulation c) c #

maths :: r ~ () => [[CAS (Infix LaTeX) (Encapsulation LaTeX) (Symbol LaTeX)]] -> String -> IPresentation m r Source #

($<>) :: CAS (Infix LaTeX) (Encapsulation LaTeX) (Symbol LaTeX) -> Presentation -> Presentation Source #

type Math = Expression LaTeX Source #