Text.LaTeX.Base.Class

Documentation

class (Monoid l, IsString l) => LaTeXC l where

Methods

liftListL :: ([LaTeX] -> LaTeX) -> [l] -> l

Instances

LaTeXC LaTeX

Monad m => LaTeXC (LaTeXT m a)

class Monoid a where

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

• mappend mempty x = x

• mappend x mempty = x

• mappend x (mappend y z) = mappend (mappend x y) z

• mconcat = foldr mappend mempty

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

Minimal complete definition: mempty and mappend.

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.

Methods

mempty :: a

Identity of mappend

mappend :: a -> a -> a

An associative operation

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

Monoid ()

Monoid All

Monoid Any

Monoid ByteString

Monoid ByteString

Monoid Text

Monoid LaTeX

Method mappend is strict in both arguments (except in the case when the first argument is TeXEmpty).

Monoid TeXCheck

Monoid [a]

Monoid a => Monoid (Dual a)

Monoid (Endo a)

Num a => Monoid (Sum a)

Num a => Monoid (Product a)

Monoid (First a)

Monoid (Last a)

Monoid 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 there is no "Semigroup" typeclass providing just mappend, we use Monoid instead.

Monoid b => Monoid (a -> b)

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

Monad m => Monoid (LaTeXT m a)

mappend = >>.

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

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

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

Combinators

fromLaTeX :: LaTeXC l => LaTeX -> l

liftL :: LaTeXC l => (LaTeX -> LaTeX) -> l -> l

liftL2 :: LaTeXC l => (LaTeX -> LaTeX -> LaTeX) -> l -> l -> l

comm0 :: LaTeXC l => String -> l

A simple (without arguments) command generator, given the name of the command.

 comm0 str = fromLaTeX $ TeXComm str []

commS :: LaTeXC l => String -> l

braces :: LaTeXC l => l -> l