Text.XML.Twiml.Internal

This module exports the machinery necessary to define TwiML in an extensible way.

Data types à la carte

The (:+:) data type and (:<:) type class come from Swierstra's Data types à la carte.

data (f :+: g) a infixr 7

Constructors

InL (f a)

InR (g a)

Instances

(Functor f, Functor g) => f :<: ((:+:) * f g)

Methods

inj :: f a -> (* :+: f) g a

prj :: (* :+: f) g a -> Maybe (f a)

(Functor f, Functor g, Functor h, (:<:) f g) => f :<: ((:+:) * h g)

Methods

inj :: f a -> (* :+: h) g a

prj :: (* :+: h) g a -> Maybe (f a)

(Functor g, Functor f) => Functor ((:+:) * f g)

Methods

fmap :: (a -> b) -> (* :+: f) g a -> (* :+: f) g b

(<$) :: a -> (* :+: f) g b -> (* :+: f) g a

(Eq (g a), Eq (f a)) => Eq ((:+:) k f g a)

Methods

(==) :: (k :+: f) g a -> (k :+: f) g a -> Bool

(/=) :: (k :+: f) g a -> (k :+: f) g a -> Bool

(Data a, Data (f a), Data (g a), Typeable (* -> *) f, Typeable (* -> *) g) => Data ((:+:) * f g a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall b. b -> c b) -> (* :+: f) g a -> c ((* :+: f) g a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ((* :+: f) g a)

toConstr :: (* :+: f) g a -> Constr

dataTypeOf :: (* :+: f) g a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c ((* :+: f) g a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ((* :+: f) g a))

gmapT :: (forall b. Data b => b -> b) -> (* :+: f) g a -> (* :+: f) g a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> (* :+: f) g a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> (* :+: f) g a -> r

gmapQ :: (forall d. Data d => d -> u) -> (* :+: f) g a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> (* :+: f) g a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> (* :+: f) g a -> m ((* :+: f) g a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> (* :+: f) g a -> m ((* :+: f) g a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> (* :+: f) g a -> m ((* :+: f) g a)

(Ord (g a), Ord (f a)) => Ord ((:+:) k f g a)

Methods

compare :: (k :+: f) g a -> (k :+: f) g a -> Ordering

(<) :: (k :+: f) g a -> (k :+: f) g a -> Bool

(<=) :: (k :+: f) g a -> (k :+: f) g a -> Bool

(>) :: (k :+: f) g a -> (k :+: f) g a -> Bool

(>=) :: (k :+: f) g a -> (k :+: f) g a -> Bool

max :: (k :+: f) g a -> (k :+: f) g a -> (k :+: f) g a

min :: (k :+: f) g a -> (k :+: f) g a -> (k :+: f) g a

(Read (g a), Read (f a)) => Read ((:+:) k f g a)

Methods

readsPrec :: Int -> ReadS ((k :+: f) g a)

readList :: ReadS [(k :+: f) g a]

readPrec :: ReadPrec ((k :+: f) g a)

readListPrec :: ReadPrec [(k :+: f) g a]

(Show (g a), Show (f a)) => Show ((:+:) k f g a)

Methods

showsPrec :: Int -> (k :+: f) g a -> ShowS

show :: (k :+: f) g a -> String

showList :: [(k :+: f) g a] -> ShowS

Generic ((:+:) k f g a)

Associated Types

type Rep ((:+:) k f g a) :: * -> *

Methods

from :: (k :+: f) g a -> Rep ((k :+: f) g a) x

to :: Rep ((k :+: f) g a) x -> (k :+: f) g a

(NFData (g a), NFData (f a)) => NFData ((:+:) k f g a)

Methods

rnf :: (k :+: f) g a -> ()

(ToXML (f a), ToXML (g a)) => ToXML ((:+:) k f g a)

Methods

toXML :: (k :+: f) g a -> [Element]

type Rep ((:+:) k f g a)

type Rep ((:+:) k f g a) = D1 (MetaData ":+:" "Text.XML.Twiml.Internal" "twiml-0.2.0.1-LqGlAW9ysp41vRhevhGKAu" False) ((:+:) (C1 (MetaCons "InL" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f a)))) (C1 (MetaCons "InR" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (g a)))))

class (Functor sub, Functor sup) => sub :<: sup where

Minimal complete definition

inj, prj

Methods

inj :: sub a -> sup a

prj :: sup a -> Maybe (sub a)

Instances

Functor f => f :<: f

Methods

inj :: f a -> f a

prj :: f a -> Maybe (f a)

(Functor f, Functor g) => f :<: ((:+:) * f g)

Methods

inj :: f a -> (* :+: f) g a

prj :: (* :+: f) g a -> Maybe (f a)

(Functor f, Functor g, Functor h, (:<:) f g) => f :<: ((:+:) * h g)

Methods

inj :: f a -> (* :+: h) g a

prj :: (* :+: h) g a -> Maybe (f a)

(Functor (f i), (:<:) (f i) ((:+:) * (ClientF i) ((:+:) * (ConferenceF i) ((:+:) * (NumberF i) ((:+:) * (QueueF i) (SipF i)))))) => (f i) :<: (DialNounF i)

Methods

inj :: f i a -> DialNounF i a

prj :: DialNounF i a -> Maybe (f i a)

(Functor (f i), (:<:) (f i) ((:+:) * (MessageF i) ((:+:) * (RedirectF i) ((:+:) * (SmsF i) (EndF i))))) => (f i) :<: (MessagingVerbsF i)

Methods

inj :: f i a -> MessagingVerbsF i a

prj :: MessagingVerbsF i a -> Maybe (f i a)

(Functor (f i), (:<:) (f i) ((:+:) * (SayF i) ((:+:) * (PlayF i) ((:+:) * (GatherF i) ((:+:) * (SmsF i) ((:+:) * (DialF i) ((:+:) * (EnqueueF i) ((:+:) * (LeaveF i) ((:+:) * (HangupF i) ((:+:) * (RecordF i) ((:+:) * (RedirectF i) ((:+:) * (RejectF i) ((:+:) * (PauseF i) (EndF i)))))))))))))) => (f i) :<: (VoiceVerbsF i)

Methods

inj :: f i a -> VoiceVerbsF i a

prj :: VoiceVerbsF i a -> Maybe (f i a)

Elem (∉)

type family Elem (t :: k) (ts :: [k]) :: Bool where ...

Elem is like a promoted elem: it allows us to check whether a type constructor t is present in a list of type constructors ts.

Equations

Elem t '[] = False

Elem t (t ': ts) = True

Elem t (u ': ts) = Elem t ts

type (∉) t ts = Elem t ts ~ False

t ∉ ts is shorthand for asserting that a type constructor t is not present in a list of types constructors ts.

Indexed

Everything in this section comes from Cirdec's excellent answer on a StackOverflow question about indexed free monads. Some names have been changed to follow the patterns established by indexed and indexed-free.

class Functor1 f where

Minimal complete definition

fmap1

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Instances

Functor1 [Type] ClientF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] ConferenceF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] NumberF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] QueueF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] DialNounF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] SipF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] DialF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] EndF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] EnqueueF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] HangupF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] LeaveF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] MessageF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] PauseF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] PlayF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] RecordF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] RedirectF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] RejectF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] SayF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] MessagingVerbsF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] VoiceVerbsF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] GatherF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [Type] SmsF

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [k] f => Functor1 [k] (IxFree k f)

Methods

fmap1 :: (a -> b) -> f i a -> f i b

class NFData1 f where

Minimal complete definition

rnf1

Methods

rnf1 :: NFData a => f i a -> ()

Instances

NFData1 [k] f => NFData1 [k] (IxFree k f)

Methods

rnf1 :: NFData a => f i a -> ()

class Show1 f where

Minimal complete definition

show1

Methods

show1 :: Show a => f i a -> String

Instances

Show1 [Type] DialNounF

Methods

show1 :: Show a => f i a -> String

Show1 [Type] MessagingVerbsF

Methods

show1 :: Show a => f i a -> String

Show1 [Type] VoiceVerbsF

Methods

show1 :: Show a => f i a -> String

Show1 [k] f => Show1 [k] (IxFree k f)

Methods

show1 :: Show a => f i a -> String

Applicative

class Functor1 f => IxApplicative f where

An applicative functor f indexed by a monoid (M,<>,Identity)

If you import Prelude hiding (<*>) and pure, you can redefine (<*>) and pure to use their indexed equivalents. For example,

import Prelude hiding ((<*>), pure)

pure :: IxApplicative f -> a -> f Identity a
pure = ipure

(<*>) :: IxApplicative f => f i (a -> b) -> f j a -> f (i <> j) b
(<*>) = iap

Minimal complete definition

ipure, iap

Associated Types

type Identity :: k

type (i :: k) <> (j :: k) :: k

Methods

ipure :: a -> f Identity a

The indexed equivalent of pure

iap :: f i (a -> b) -> f j a -> f (i <> j) b

The indexed equivalent of (<*>)

Instances

Functor1 [k] f => IxApplicative [k] (IxFree k f)

Associated Types

type Identity (IxFree k f) :: k

type ((IxFree k f) <> (i :: IxFree k f)) (j :: IxFree k f) :: k

Methods

ipure :: a -> f (Identity (IxFree k f)) a

iap :: f i (a -> b) -> f j a -> f ((IxFree k f <> i) j) b

Monad

class IxApplicative m => IxMonad m where

A monad m indexed by a monoid (M,<>,Identity)

You can use do-notation with IxMonad by enabling the RebindableSyntax extension and redefining (>>=), (>>), and return. For example,

{-#LANGUAGE RebindableSyntax #-}

import Prelude hiding ((>>=), (>>), return)

(>>=) :: IxMonad m => m i a -> (a -> m j b) -> m (i <> j) b
(>>=) = ibind

(>>) :: IxMonad m => m i a -> m j b -> m (i <> j) b
a >> b = a >>= const b

return :: IxApplicative m => a -> m Identity a
return = ipure

This is the technique employed by the Text.XML.Twiml.Syntax module.

Minimal complete definition

ibind

Methods

ibind :: m i a -> (a -> m j b) -> m (i <> j) b

The indexed equivalent of (>>=)

Instances

(Functor1 [k] m, IxApplicative [k] (IxFree k m)) => IxMonad [k] (IxFree k m)

Methods

ibind :: m i a -> (a -> m j b) -> m ((IxFree k m <> i) j) b

Free

data IxFree f i a where

A free monad indexed by a monoid (M,++,[])

Constructors

IxPure :: a -> IxFree f '[] a

IxFree :: WitnessList i => f i (IxFree f j a) -> IxFree f (i ++ j) a

Instances

NFData1 [k] f => NFData1 [k] (IxFree k f)

Methods

rnf1 :: NFData a => f i a -> ()

(Functor1 [k] m, IxApplicative [k] (IxFree k m)) => IxMonad [k] (IxFree k m)

Methods

ibind :: m i a -> (a -> m j b) -> m ((IxFree k m <> i) j) b

Functor1 [k] f => IxApplicative [k] (IxFree k f)

Associated Types

type Identity (IxFree k f) :: k

type ((IxFree k f) <> (i :: IxFree k f)) (j :: IxFree k f) :: k

Methods

ipure :: a -> f (Identity (IxFree k f)) a

iap :: f i (a -> b) -> f j a -> f ((IxFree k f <> i) j) b

Show1 [k] f => Show1 [k] (IxFree k f)

Methods

show1 :: Show a => f i a -> String

Functor1 [k] f => Functor1 [k] (IxFree k f)

Methods

fmap1 :: (a -> b) -> f i a -> f i b

Functor1 [k] f => Functor (IxFree k f i)

Methods

fmap :: (a -> b) -> IxFree k f i a -> IxFree k f i b

(<$) :: a -> IxFree k f i b -> IxFree k f i a

(Show1 [k] f, Show a) => Show (IxFree k f i a)

Methods

showsPrec :: Int -> IxFree k f i a -> ShowS

show :: IxFree k f i a -> String

showList :: [IxFree k f i a] -> ShowS

(NFData1 [k] f, NFData a) => NFData (IxFree k f i a)

Methods

rnf :: IxFree k f i a -> ()

ToXML (IxFree Type DialNounF i Void)

Methods

toXML :: IxFree Type DialNounF i Void -> [Element]

ToXML (IxFree Type MessagingVerbsF i Void)

Methods

toXML :: IxFree Type MessagingVerbsF i Void -> [Element]

ToXML (IxFree Type VoiceVerbsF i Void)

Methods

toXML :: IxFree Type VoiceVerbsF i Void -> [Element]

iliftF :: forall f i a. (WitnessList i, Functor1 f) => f i a -> IxFree f i a

Lift an indexed functor into IxFree

type family (a :: [k]) ++ (b :: [k]) :: [k] where ...

Promoted list concatenation

Equations

'[] ++ bs = bs

(a ': as) ++ bs = a ': (as ++ bs)

XML

The classes here simplify working with the xml package.

data SomeNode

Constructors

Node n => SomeNode n

Instances

Node SomeNode

Methods

node :: QName -> SomeNode -> Element

class ToSomeNode a where

Minimal complete definition

toSomeNode

Methods

toSomeNode :: a -> SomeNode

Instances

ToSomeNode ()

Methods

toSomeNode :: () -> SomeNode

ToSomeNode String

Methods

toSomeNode :: String -> SomeNode

ToSomeNode URL

Methods

toSomeNode :: URL -> SomeNode

ToSomeNode DialNoun

Methods

toSomeNode :: DialNoun -> SomeNode

ToSomeNode a => ToSomeNode (Maybe a)

Methods

toSomeNode :: Maybe a -> SomeNode

class ToXML a where

Minimal complete definition

toXML

Methods

toXML :: a -> [Element]

Instances

ToXML DialNoun

Methods

toXML :: DialNoun -> [Element]

ToXML (ClientF i a)

Methods

toXML :: ClientF i a -> [Element]

ToXML (ConferenceF i a)

Methods

toXML :: ConferenceF i a -> [Element]

ToXML (NumberF i a)

Methods

toXML :: NumberF i a -> [Element]

ToXML (QueueF i a)

Methods

toXML :: QueueF i a -> [Element]

ToXML (DialNounF i a)

Methods

toXML :: DialNounF i a -> [Element]

ToXML (SipF i a)

Methods

toXML :: SipF i a -> [Element]

ToXML a => ToXML (DialF i a)

Methods

toXML :: DialF i a -> [Element]

ToXML (EndF i a)

Methods

toXML :: EndF i a -> [Element]

ToXML a => ToXML (EnqueueF i a)

Methods

toXML :: EnqueueF i a -> [Element]

ToXML (HangupF i a)

Methods

toXML :: HangupF i a -> [Element]

ToXML (LeaveF i a)

Methods

toXML :: LeaveF i a -> [Element]

ToXML a => ToXML (MessageF i a)

Methods

toXML :: MessageF i a -> [Element]

ToXML a => ToXML (PauseF i a)

Methods

toXML :: PauseF i a -> [Element]

ToXML a => ToXML (PlayF i a)

Methods

toXML :: PlayF i a -> [Element]

ToXML a => ToXML (RecordF i a)

Methods

toXML :: RecordF i a -> [Element]

ToXML (RedirectF i a)

Methods

toXML :: RedirectF i a -> [Element]

ToXML (RejectF i a)

Methods

toXML :: RejectF i a -> [Element]

ToXML a => ToXML (SayF i a)

Methods

toXML :: SayF i a -> [Element]

ToXML a => ToXML (MessagingVerbsF i a)

Methods

toXML :: MessagingVerbsF i a -> [Element]

ToXML a => ToXML (VoiceVerbsF i a)

Methods

toXML :: VoiceVerbsF i a -> [Element]

ToXML a => ToXML (GatherF i a)

Methods

toXML :: GatherF i a -> [Element]

ToXML a => ToXML (SmsF i a)

Methods

toXML :: SmsF i a -> [Element]

ToXML (IxFree Type DialNounF i Void)

Methods

toXML :: IxFree Type DialNounF i Void -> [Element]

ToXML (IxFree Type MessagingVerbsF i Void)

Methods

toXML :: IxFree Type MessagingVerbsF i Void -> [Element]

ToXML (IxFree Type VoiceVerbsF i Void)

Methods

toXML :: IxFree Type VoiceVerbsF i Void -> [Element]

(ToXML (f a), ToXML (g a)) => ToXML ((:+:) k f g a)

Methods

toXML :: (k :+: f) g a -> [Element]

class ToElement a where

Minimal complete definition

toElement

Methods

toElement :: a -> Element

Instances

ToElement MessagingTwiml

Methods

toElement :: MessagingTwiml -> Element

ToElement VoiceTwiml

Methods

toElement :: VoiceTwiml -> Element

class ToAttrs a where

Minimal complete definition

toAttrs

Methods

toAttrs :: a -> [Attr]

Instances

ToAttrs ClientAttributes

Methods

toAttrs :: ClientAttributes -> [Attr]

ToAttrs ConferenceAttributes

Methods

toAttrs :: ConferenceAttributes -> [Attr]

ToAttrs NumberAttributes

Methods

toAttrs :: NumberAttributes -> [Attr]

ToAttrs QueueAttributes

Methods

toAttrs :: QueueAttributes -> [Attr]

ToAttrs SipAttributes

Methods

toAttrs :: SipAttributes -> [Attr]

ToAttrs DialAttributes

Methods

toAttrs :: DialAttributes -> [Attr]

ToAttrs EnqueueAttributes

Methods

toAttrs :: EnqueueAttributes -> [Attr]

ToAttrs MessageAttributes

Methods

toAttrs :: MessageAttributes -> [Attr]

ToAttrs PauseAttributes

Methods

toAttrs :: PauseAttributes -> [Attr]

ToAttrs PlayAttributes

Methods

toAttrs :: PlayAttributes -> [Attr]

ToAttrs RecordAttributes

Methods

toAttrs :: RecordAttributes -> [Attr]

ToAttrs RedirectAttributes

Methods

toAttrs :: RedirectAttributes -> [Attr]

ToAttrs RejectAttributes

Methods

toAttrs :: RejectAttributes -> [Attr]

ToAttrs SayAttributes

Methods

toAttrs :: SayAttributes -> [Attr]

ToAttrs GatherAttributes

Methods

toAttrs :: GatherAttributes -> [Attr]

ToAttrs SmsAttributes

Methods

toAttrs :: SmsAttributes -> [Attr]

class ToAttrValue a where

toAttrValue transforms a data type into a String that can be set as the value of an attribute.

Minimal complete definition

toAttrValue

Methods

toAttrValue :: a -> String

Instances

ToAttrValue Bool

Methods

toAttrValue :: Bool -> String

ToAttrValue String

Methods

toAttrValue :: String -> String

ToAttrValue Reason

Methods

toAttrValue :: Reason -> String

ToAttrValue ConferenceBeep

Methods

toAttrValue :: ConferenceBeep -> String

ToAttrValue Transport

Methods

toAttrValue :: Transport -> String

ToAttrValue LangAlice

Methods

toAttrValue :: LangAlice -> String

ToAttrValue Lang

Methods

toAttrValue :: Lang -> String

ToAttrValue Voice

Methods

toAttrValue :: Voice -> String

ToAttrValue URL

Methods

toAttrValue :: URL -> String

ToAttrValue Method

Methods

toAttrValue :: Method -> String

ToAttrValue Key

Methods

toAttrValue :: Key -> String

ToAttrValue Digit

Methods

toAttrValue :: Digit -> String

ToAttrValue [Digit]

Methods

toAttrValue :: [Digit] -> String

makeAttr :: ToAttrValue b => String -> (a -> Maybe b) -> a -> Maybe Attr

makeAttr' :: String -> (a -> Maybe b) -> (b -> String) -> a -> Maybe Attr

makeAttrs :: a -> [a -> Maybe Attr] -> [Attr]

makeElement :: Node t => String -> t -> [Attr] -> Element

Orphan instances

ToSomeNode n => Node n

Methods

node :: QName -> n -> Element