Text.Html.Nice.FreeMonad

A Free monad-based HTML markup monad. Unlike the writer-like monad in Text.Html.Nice.Writer, sequencing bits of markup together results in them being nested, rather than concatenated.

There is no kitchen-sink of HTML5 elements provided. Use OverloadedLabels instead: #div :: Markup n () and #div :: MakeNode n () .

Since the monad and applicative of Markup here nests rather than concatenates, the function nodes is provided to put a list of nodes in sequence. You can use OverloadedLists for convenient syntax here.

Example Markup:

#html >>
[ title >> "Title goes here"
, #body >>
  [ #h1 >> "heading goes here"
  , #p >> "i am a paragraph below the heading"
  , do i <- branch [0..100]
       builder (decimal i)
  ]
]

Markup

data Markup n a

Markup is a free monad based on the base functor to 'Markup\'F'

Beware: this is a wacky monad. >> does *not* sequence nodes together; instead, it nests them. To lay out nodes sequentially, use nodes.

Syntactic sugar

Markup supports OverloadedLabels, OverloadedStrings and OverloadedLists.

OverloadedStrings

("foo" :: Markup n a) = text "foo"

OverloadedLists

([a,b,c] :: Markup n a) = nodes [a,b,c]

OverloadedLabels

The IsLabel instances give a convenient way to write nodes.

Nodes without attributes

 (#foo :: Markup n a) = node "foo" []

Nodes with attributes

 attr #foo [a,b,c] = node "foo" [a,b,c]

Instances

Bifunctor Markup

Methods

bimap :: (a -> b) -> (c -> d) -> Markup a c -> Markup b d

first :: (a -> b) -> Markup a c -> Markup b c

second :: (b -> c) -> Markup a b -> Markup a c

((~) * a (), KnownSymbol s) => IsLabel s (Markup n a)

Methods

fromLabel :: Markup n a

Monad (Markup n)

Methods

(>>=) :: Markup n a -> (a -> Markup n b) -> Markup n b

(>>) :: Markup n a -> Markup n b -> Markup n b

return :: a -> Markup n a

fail :: String -> Markup n a

Functor (Markup n)

Methods

fmap :: (a -> b) -> Markup n a -> Markup n b

(<$) :: a -> Markup n b -> Markup n a

Applicative (Markup n)

Methods

pure :: a -> Markup n a

(<*>) :: Markup n (a -> b) -> Markup n a -> Markup n b

liftA2 :: (a -> b -> c) -> Markup n a -> Markup n b -> Markup n c

(*>) :: Markup n a -> Markup n b -> Markup n b

(<*) :: Markup n a -> Markup n b -> Markup n a

MonadFree (Markup'F n) (Markup n)

Methods

wrap :: Markup'F n (Markup n a) -> Markup n a

IsList (Markup n a)

Associated Types

type Item (Markup n a) :: *

Methods

fromList :: [Item (Markup n a)] -> Markup n a

fromListN :: Int -> [Item (Markup n a)] -> Markup n a

toList :: Markup n a -> [Item (Markup n a)]

IsString (Markup n a)

Methods

fromString :: String -> Markup n a

Monoid (Markup n a)

Methods

mempty :: Markup n a

mappend :: Markup n a -> Markup n a -> Markup n a

mconcat :: [Markup n a] -> Markup n a

Default (Markup n a)

Methods

def :: Markup n a

type Item (Markup n a)

type Item (Markup n a) = Markup n a

data FastMarkup a

Instances

Functor FastMarkup

Methods

fmap :: (a -> b) -> FastMarkup a -> FastMarkup b

(<$) :: a -> FastMarkup b -> FastMarkup a

Foldable FastMarkup

Methods

fold :: Monoid m => FastMarkup m -> m

foldMap :: Monoid m => (a -> m) -> FastMarkup a -> m

foldr :: (a -> b -> b) -> b -> FastMarkup a -> b

foldr' :: (a -> b -> b) -> b -> FastMarkup a -> b

foldl :: (b -> a -> b) -> b -> FastMarkup a -> b

foldl' :: (b -> a -> b) -> b -> FastMarkup a -> b

foldr1 :: (a -> a -> a) -> FastMarkup a -> a

foldl1 :: (a -> a -> a) -> FastMarkup a -> a

toList :: FastMarkup a -> [a]

null :: FastMarkup a -> Bool

length :: FastMarkup a -> Int

elem :: Eq a => a -> FastMarkup a -> Bool

maximum :: Ord a => FastMarkup a -> a

minimum :: Ord a => FastMarkup a -> a

sum :: Num a => FastMarkup a -> a

product :: Num a => FastMarkup a -> a

Eq a => Eq (FastMarkup a)

Methods

(==) :: FastMarkup a -> FastMarkup a -> Bool

(/=) :: FastMarkup a -> FastMarkup a -> Bool

Show a => Show (FastMarkup a)

Methods

showsPrec :: Int -> FastMarkup a -> ShowS

show :: FastMarkup a -> String

showList :: [FastMarkup a] -> ShowS

Generic (FastMarkup a)

Associated Types

type Rep (FastMarkup a) :: * -> *

Methods

from :: FastMarkup a -> Rep (FastMarkup a) x

to :: Rep (FastMarkup a) x -> FastMarkup a

Monoid (FastMarkup a)

Methods

mempty :: FastMarkup a

mappend :: FastMarkup a -> FastMarkup a -> FastMarkup a

mconcat :: [FastMarkup a] -> FastMarkup a

NFData a => NFData (FastMarkup a)

Methods

rnf :: FastMarkup a -> ()

ToFastMarkup (FastMarkup Void)

Methods

toFastMarkup :: FastMarkup Void -> FastMarkup b

(Render a m, Monad m) => Render (FastMarkup a) m

Methods

r :: FastMarkup a -> m Builder

type Rep (FastMarkup a)

type Rep (FastMarkup a) = D1 * (MetaData "FastMarkup" "Text.Html.Nice.Internal" "nice-html-0.4.1-CwW1bHm54io1dxKzvNIhVg" False) ((:+:) * ((:+:) * ((:+:) * (C1 * (MetaCons "Bunch" PrefixI False) (S1 * (MetaSel (Nothing Symbol) SourceUnpack SourceStrict DecidedStrict) (Rec0 * (Vector (FastMarkup a))))) (C1 * (MetaCons "FStream" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * (Stream a))))) ((:+:) * (C1 * (MetaCons "FHole" PrefixI False) ((:*:) * (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * IsEscaped)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * a)))) (C1 * (MetaCons "FLText" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Text))))) ((:+:) * ((:+:) * (C1 * (MetaCons "FSText" PrefixI False) (S1 * (MetaSel (Nothing Symbol) SourceUnpack SourceStrict DecidedStrict) (Rec0 * Text))) (C1 * (MetaCons "FBuilder" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * Builder)))) ((:+:) * (C1 * (MetaCons "FEmpty" PrefixI False) (U1 *)) (C1 * (MetaCons "FDeep" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (FastMarkup (FastMarkup a))))))))

runMarkup :: Markup n a -> Markup' n

Compiling

compile :: Markup n a -> FastMarkup n

Compile a Html for use with render and its friends.

See also: compile_.

Rendering

Rendering through some monad

renderM :: Monad m => (a -> m Builder) -> FastMarkup a -> m Builder

Render FastMarkup

renderMs :: Monad m => (a -> m (FastMarkup Void)) -> FastMarkup a -> m Builder

Render FastMarkup by recursively rendering any sub-markup.

Pure rendering

render :: FastMarkup Void -> Builder

Render FastMarkup that has no holes.

newtype Identity a :: * -> *

Identity functor and monad. (a non-strict monad)

Since: 4.8.0.0

Constructors

Identity

Fields

• runIdentity :: a

Instances

Monad Identity

Since: 4.8.0.0

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b

(>>) :: Identity a -> Identity b -> Identity b

return :: a -> Identity a

fail :: String -> Identity a

Functor Identity

Since: 4.8.0.0

Methods

fmap :: (a -> b) -> Identity a -> Identity b

(<$) :: a -> Identity b -> Identity a

MonadFix Identity

Since: 4.8.0.0

Methods

mfix :: (a -> Identity a) -> Identity a

Applicative Identity

Since: 4.8.0.0

Methods

pure :: a -> Identity a

(<*>) :: Identity (a -> b) -> Identity a -> Identity b

liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c

(*>) :: Identity a -> Identity b -> Identity b

(<*) :: Identity a -> Identity b -> Identity a

Foldable Identity

Since: 4.8.0.0

Methods

fold :: Monoid m => Identity m -> m

foldMap :: Monoid m => (a -> m) -> Identity a -> m

foldr :: (a -> b -> b) -> b -> Identity a -> b

foldr' :: (a -> b -> b) -> b -> Identity a -> b

foldl :: (b -> a -> b) -> b -> Identity a -> b

foldl' :: (b -> a -> b) -> b -> Identity a -> b

foldr1 :: (a -> a -> a) -> Identity a -> a

foldl1 :: (a -> a -> a) -> Identity a -> a

toList :: Identity a -> [a]

null :: Identity a -> Bool

length :: Identity a -> Int

elem :: Eq a => a -> Identity a -> Bool

maximum :: Ord a => Identity a -> a

minimum :: Ord a => Identity a -> a

sum :: Num a => Identity a -> a

product :: Num a => Identity a -> a

Traversable Identity

Methods

traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b)

sequenceA :: Applicative f => Identity (f a) -> f (Identity a)

mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b)

sequence :: Monad m => Identity (m a) -> m (Identity a)

Eq1 Identity

Since: 4.9.0.0

Methods

liftEq :: (a -> b -> Bool) -> Identity a -> Identity b -> Bool

Ord1 Identity

Since: 4.9.0.0

Methods

liftCompare :: (a -> b -> Ordering) -> Identity a -> Identity b -> Ordering

Read1 Identity

Since: 4.9.0.0

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Identity a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Identity a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Identity a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Identity a]

Show1 Identity

Since: 4.9.0.0

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Identity a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Identity a] -> ShowS

Comonad Identity

Methods

extract :: Identity a -> a

duplicate :: Identity a -> Identity (Identity a)

extend :: (Identity a -> b) -> Identity a -> Identity b

ComonadApply Identity

Methods

(<@>) :: Identity (a -> b) -> Identity a -> Identity b

(@>) :: Identity a -> Identity b -> Identity b

(<@) :: Identity a -> Identity b -> Identity a

NFData1 Identity

Since: 1.4.3.0

Methods

liftRnf :: (a -> ()) -> Identity a -> ()

Bounded a => Bounded (Identity a)

Methods

minBound :: Identity a

maxBound :: Identity a

Enum a => Enum (Identity a)

Methods

succ :: Identity a -> Identity a

pred :: Identity a -> Identity a

toEnum :: Int -> Identity a

fromEnum :: Identity a -> Int

enumFrom :: Identity a -> [Identity a]

enumFromThen :: Identity a -> Identity a -> [Identity a]

enumFromTo :: Identity a -> Identity a -> [Identity a]

enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a]

Eq a => Eq (Identity a)

Methods

(==) :: Identity a -> Identity a -> Bool

(/=) :: Identity a -> Identity a -> Bool

Floating a => Floating (Identity a)

Methods

pi :: Identity a

exp :: Identity a -> Identity a

log :: Identity a -> Identity a

sqrt :: Identity a -> Identity a

(**) :: Identity a -> Identity a -> Identity a

logBase :: Identity a -> Identity a -> Identity a

sin :: Identity a -> Identity a

cos :: Identity a -> Identity a

tan :: Identity a -> Identity a

asin :: Identity a -> Identity a

acos :: Identity a -> Identity a

atan :: Identity a -> Identity a

sinh :: Identity a -> Identity a

cosh :: Identity a -> Identity a

tanh :: Identity a -> Identity a

asinh :: Identity a -> Identity a

acosh :: Identity a -> Identity a

atanh :: Identity a -> Identity a

log1p :: Identity a -> Identity a

expm1 :: Identity a -> Identity a

log1pexp :: Identity a -> Identity a

log1mexp :: Identity a -> Identity a

Fractional a => Fractional (Identity a)

Methods

(/) :: Identity a -> Identity a -> Identity a

recip :: Identity a -> Identity a

fromRational :: Rational -> Identity a

Integral a => Integral (Identity a)

Methods

quot :: Identity a -> Identity a -> Identity a

rem :: Identity a -> Identity a -> Identity a

div :: Identity a -> Identity a -> Identity a

mod :: Identity a -> Identity a -> Identity a

quotRem :: Identity a -> Identity a -> (Identity a, Identity a)

divMod :: Identity a -> Identity a -> (Identity a, Identity a)

toInteger :: Identity a -> Integer

Num a => Num (Identity a)

Methods

(+) :: Identity a -> Identity a -> Identity a

(-) :: Identity a -> Identity a -> Identity a

(*) :: Identity a -> Identity a -> Identity a

negate :: Identity a -> Identity a

abs :: Identity a -> Identity a

signum :: Identity a -> Identity a

fromInteger :: Integer -> Identity a

Ord a => Ord (Identity a)

Methods

compare :: Identity a -> Identity a -> Ordering

(<) :: Identity a -> Identity a -> Bool

(<=) :: Identity a -> Identity a -> Bool

(>) :: Identity a -> Identity a -> Bool

(>=) :: Identity a -> Identity a -> Bool

max :: Identity a -> Identity a -> Identity a

min :: Identity a -> Identity a -> Identity a

Read a => Read (Identity a)

This instance would be equivalent to the derived instances of the Identity newtype if the runIdentity field were removed

Since: 4.8.0.0

Methods

readsPrec :: Int -> ReadS (Identity a)

readList :: ReadS [Identity a]

readPrec :: ReadPrec (Identity a)

readListPrec :: ReadPrec [Identity a]

Real a => Real (Identity a)

Methods

toRational :: Identity a -> Rational

RealFloat a => RealFloat (Identity a)

Methods

floatRadix :: Identity a -> Integer

floatDigits :: Identity a -> Int

floatRange :: Identity a -> (Int, Int)

decodeFloat :: Identity a -> (Integer, Int)

encodeFloat :: Integer -> Int -> Identity a

exponent :: Identity a -> Int

significand :: Identity a -> Identity a

scaleFloat :: Int -> Identity a -> Identity a

isNaN :: Identity a -> Bool

isInfinite :: Identity a -> Bool

isDenormalized :: Identity a -> Bool

isNegativeZero :: Identity a -> Bool

isIEEE :: Identity a -> Bool

atan2 :: Identity a -> Identity a -> Identity a

RealFrac a => RealFrac (Identity a)

Methods

properFraction :: Integral b => Identity a -> (b, Identity a)

truncate :: Integral b => Identity a -> b

round :: Integral b => Identity a -> b

ceiling :: Integral b => Identity a -> b

floor :: Integral b => Identity a -> b

Show a => Show (Identity a)

This instance would be equivalent to the derived instances of the Identity newtype if the runIdentity field were removed

Since: 4.8.0.0

Methods

showsPrec :: Int -> Identity a -> ShowS

show :: Identity a -> String

showList :: [Identity a] -> ShowS

Ix a => Ix (Identity a)

Methods

range :: (Identity a, Identity a) -> [Identity a]

index :: (Identity a, Identity a) -> Identity a -> Int

unsafeIndex :: (Identity a, Identity a) -> Identity a -> Int

inRange :: (Identity a, Identity a) -> Identity a -> Bool

rangeSize :: (Identity a, Identity a) -> Int

unsafeRangeSize :: (Identity a, Identity a) -> Int

IsString a => IsString (Identity a)

Methods

fromString :: String -> Identity a

Generic (Identity a)

Associated Types

type Rep (Identity a) :: * -> *

Methods

from :: Identity a -> Rep (Identity a) x

to :: Rep (Identity a) x -> Identity a

Semigroup a => Semigroup (Identity a)

Since: 4.9.0.0

Methods

(<>) :: Identity a -> Identity a -> Identity a

sconcat :: NonEmpty (Identity a) -> Identity a

stimes :: Integral b => b -> Identity a -> Identity a

Monoid a => Monoid (Identity a)

Methods

mempty :: Identity a

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

mconcat :: [Identity a] -> Identity a

Storable a => Storable (Identity a)

Methods

sizeOf :: Identity a -> Int

alignment :: Identity a -> Int

peekElemOff :: Ptr (Identity a) -> Int -> IO (Identity a)

pokeElemOff :: Ptr (Identity a) -> Int -> Identity a -> IO ()

peekByteOff :: Ptr b -> Int -> IO (Identity a)

pokeByteOff :: Ptr b -> Int -> Identity a -> IO ()

peek :: Ptr (Identity a) -> IO (Identity a)

poke :: Ptr (Identity a) -> Identity a -> IO ()

Bits a => Bits (Identity a)

Methods

(.&.) :: Identity a -> Identity a -> Identity a

(.|.) :: Identity a -> Identity a -> Identity a

xor :: Identity a -> Identity a -> Identity a

complement :: Identity a -> Identity a

shift :: Identity a -> Int -> Identity a

rotate :: Identity a -> Int -> Identity a

zeroBits :: Identity a

bit :: Int -> Identity a

setBit :: Identity a -> Int -> Identity a

clearBit :: Identity a -> Int -> Identity a

complementBit :: Identity a -> Int -> Identity a

testBit :: Identity a -> Int -> Bool

bitSizeMaybe :: Identity a -> Maybe Int

bitSize :: Identity a -> Int

isSigned :: Identity a -> Bool

shiftL :: Identity a -> Int -> Identity a

unsafeShiftL :: Identity a -> Int -> Identity a

shiftR :: Identity a -> Int -> Identity a

unsafeShiftR :: Identity a -> Int -> Identity a

rotateL :: Identity a -> Int -> Identity a

rotateR :: Identity a -> Int -> Identity a

popCount :: Identity a -> Int

FiniteBits a => FiniteBits (Identity a)

Methods

finiteBitSize :: Identity a -> Int

countLeadingZeros :: Identity a -> Int

countTrailingZeros :: Identity a -> Int

NFData a => NFData (Identity a)

Since: 1.4.0.0

Methods

rnf :: Identity a -> ()

Generic1 * Identity

Associated Types

type Rep1 Identity (f :: Identity -> *) :: k -> *

Methods

from1 :: f a -> Rep1 Identity f a

to1 :: Rep1 Identity f a -> f a

type Rep (Identity a)

type Rep (Identity a) = D1 * (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 * (MetaCons "Identity" PrefixI True) (S1 * (MetaSel (Just Symbol "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))

type Rep1 * Identity

type Rep1 * Identity = D1 * (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 * (MetaCons "Identity" PrefixI True) (S1 * (MetaSel (Just Symbol "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

Util

toLazyText :: Builder -> Text

O(n). Extract a lazy Text from a Builder with a default buffer size. The construction work takes place if and when the relevant part of the lazy Text is demanded.

Special HTML elements

doctype :: Markup n a

Basic node types

node :: Text -> [Attr n] -> Markup n ()

Make a node with some attributes.

data Attr a

Constructors

(:=)

Fields

• attrKey :: !AttrName
• attrVal :: !Text

(:-)

Fields

• attrKey :: !AttrName
• attrValHole :: a

Instances

Functor Attr

Methods

fmap :: (a -> b) -> Attr a -> Attr b

(<$) :: a -> Attr b -> Attr a

Foldable Attr

Methods

fold :: Monoid m => Attr m -> m

foldMap :: Monoid m => (a -> m) -> Attr a -> m

foldr :: (a -> b -> b) -> b -> Attr a -> b

foldr' :: (a -> b -> b) -> b -> Attr a -> b

foldl :: (b -> a -> b) -> b -> Attr a -> b

foldl' :: (b -> a -> b) -> b -> Attr a -> b

foldr1 :: (a -> a -> a) -> Attr a -> a

foldl1 :: (a -> a -> a) -> Attr a -> a

toList :: Attr a -> [a]

null :: Attr a -> Bool

length :: Attr a -> Int

elem :: Eq a => a -> Attr a -> Bool

maximum :: Ord a => Attr a -> a

minimum :: Ord a => Attr a -> a

sum :: Num a => Attr a -> a

product :: Num a => Attr a -> a

Traversable Attr

Methods

traverse :: Applicative f => (a -> f b) -> Attr a -> f (Attr b)

sequenceA :: Applicative f => Attr (f a) -> f (Attr a)

mapM :: Monad m => (a -> m b) -> Attr a -> m (Attr b)

sequence :: Monad m => Attr (m a) -> m (Attr a)

Eq a => Eq (Attr a)

Methods

(==) :: Attr a -> Attr a -> Bool

(/=) :: Attr a -> Attr a -> Bool

Show a => Show (Attr a)

Methods

showsPrec :: Int -> Attr a -> ShowS

show :: Attr a -> String

showList :: [Attr a] -> ShowS

attr :: MakeNode n a -> [Attr n] -> Markup n a

For use with OverloadedLabels.

 attr #x [a,b,c] = node "x" [a,b,c]

empty :: Markup n a

Empty node. Terminates Markup to this point

Text types

text :: Text -> Markup n a

Insert text and escape it

lazyText :: Text -> Markup n a

Insert text and escape it

builder :: Builder -> Markup n a

Insert text and escape it

unescape :: Text -> Markup n a

Insert text and don't escape it

string :: String -> Markup n a

Insert text and escape it

Dynamic nodes

dynamic :: n -> Markup n a

Insert a dynamic value.

hole :: Markup (a -> a) t

embed :: (t -> FastMarkup n) -> Markup (t -> FastMarkup n) a

Insert a sub-template.

Sequential nodes

nodes :: [Markup n a] -> Markup n a

For each element of a list, generate sequential markup

branch :: [a] -> Markup n a

For each element of a list of branches, generate sequential markup

Streamed dynamic nodes

stream :: Foldable f => Markup (a -> n) r' -> Markup (f a -> FastMarkup n) r

Combinators

sub :: Markup n a -> Markup (FastMarkup n) a

Insert a sub-template.

Useful exports

Useful Builder functions

decimal :: Integral a => a -> Builder

realFloat :: RealFloat a => a -> Builder

Show a signed RealFloat value to full precision, using standard decimal notation for arguments whose absolute value lies between 0.1 and 9,999,999, and scientific notation otherwise.

fromText :: Text -> Builder

O(1). A Builder taking a Text, satisfying

• toLazyText (fromText t) = fromChunks [t]

fromString :: String -> Builder

O(1). A Builder taking a String, satisfying

• toLazyText (fromString s) = fromChunks [S.pack s]

fromLazyText :: Text -> Builder

O(1). A Builder taking a lazy Text, satisfying

• toLazyText (fromLazyText t) = t

Text builder

data Builder :: *

A Builder is an efficient way to build lazy Text values. There are several functions for constructing builders, but only one to inspect them: to extract any data, you have to turn them into lazy Text values using toLazyText.

Internally, a builder constructs a lazy Text by filling arrays piece by piece. As each buffer is filled, it is 'popped' off, to become a new chunk of the resulting lazy Text. All this is hidden from the user of the Builder.

Instances

Eq Builder

Methods

(==) :: Builder -> Builder -> Bool

(/=) :: Builder -> Builder -> Bool

Ord Builder

Methods

compare :: Builder -> Builder -> Ordering

(<) :: Builder -> Builder -> Bool

(<=) :: Builder -> Builder -> Bool

(>) :: Builder -> Builder -> Bool

(>=) :: Builder -> Builder -> Bool

max :: Builder -> Builder -> Builder

min :: Builder -> Builder -> Builder

Show Builder

Methods

showsPrec :: Int -> Builder -> ShowS

show :: Builder -> String

showList :: [Builder] -> ShowS

IsString Builder

Methods

fromString :: String -> Builder

Semigroup Builder

Methods

(<>) :: Builder -> Builder -> Builder

sconcat :: NonEmpty Builder -> Builder

stimes :: Integral b => b -> Builder -> Builder

Monoid Builder

Methods

mempty :: Builder

mappend :: Builder -> Builder -> Builder

mconcat :: [Builder] -> Builder

ToMarkup Builder

Methods

toMarkup :: Builder -> Markup

preEscapedToMarkup :: Builder -> Markup

ToValue Builder

Methods

toValue :: Builder -> AttributeValue

preEscapedToValue :: Builder -> AttributeValue

ToFastMarkup Builder

Methods

toFastMarkup :: Builder -> FastMarkup b

Monad m => Render Builder m

Methods

r :: Builder -> m Builder

Void type

data Void :: *

Uninhabited data type

Since: 4.8.0.0

Instances

Eq Void

Since: 4.8.0.0

Methods

(==) :: Void -> Void -> Bool

(/=) :: Void -> Void -> Bool

Data Void

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Void -> c Void

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Void

toConstr :: Void -> Constr

dataTypeOf :: Void -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Void)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Void)

gmapT :: (forall b. Data b => b -> b) -> Void -> Void

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r

gmapQ :: (forall d. Data d => d -> u) -> Void -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Void -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Void -> m Void

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void

Ord Void

Since: 4.8.0.0

Methods

compare :: Void -> Void -> Ordering

(<) :: Void -> Void -> Bool

(<=) :: Void -> Void -> Bool

(>) :: Void -> Void -> Bool

(>=) :: Void -> Void -> Bool

max :: Void -> Void -> Void

min :: Void -> Void -> Void

Read Void

Reading a Void value is always a parse error, considering Void as a data type with no constructors. | @since 4.8.0.0

Methods

readsPrec :: Int -> ReadS Void

readList :: ReadS [Void]

readPrec :: ReadPrec Void

readListPrec :: ReadPrec [Void]

Show Void

Since: 4.8.0.0

Methods

showsPrec :: Int -> Void -> ShowS

show :: Void -> String

showList :: [Void] -> ShowS

Ix Void

Since: 4.8.0.0

Methods

range :: (Void, Void) -> [Void]

index :: (Void, Void) -> Void -> Int

unsafeIndex :: (Void, Void) -> Void -> Int

inRange :: (Void, Void) -> Void -> Bool

rangeSize :: (Void, Void) -> Int

unsafeRangeSize :: (Void, Void) -> Int

Generic Void

Associated Types

type Rep Void :: * -> *

Methods

from :: Void -> Rep Void x

to :: Rep Void x -> Void

Semigroup Void

Since: 4.9.0.0

Methods

(<>) :: Void -> Void -> Void

sconcat :: NonEmpty Void -> Void

stimes :: Integral b => b -> Void -> Void

Exception Void

Since: 4.8.0.0

Methods

toException :: Void -> SomeException

fromException :: SomeException -> Maybe Void

displayException :: Void -> String

NFData Void

Defined as rnf = absurd.

Since: 1.4.0.0

Methods

rnf :: Void -> ()

Monad m => Render Void m

Methods

r :: Void -> m Builder

ToFastMarkup (FastMarkup Void)

Methods

toFastMarkup :: FastMarkup Void -> FastMarkup b

type Rep Void

type Rep Void = D1 * (MetaData "Void" "Data.Void" "base" False) (V1 *)