Halogen.VDom

newtype VDomSpec a w

Widget machines recursively reference the configured spec to potentially enable recursive trees of Widgets.

Constructors

• VDomSpec { buildAttributes :: Element -> Machine a Unit, buildWidget :: VDomSpec a w -> Machine w Node, document :: Document }

buildVDom :: forall a w. VDomSpec a w -> VDomMachine a w

Starts an initial VDom machine by providing a VDomSpec.

main = do
  machine1 ← buildVDom spec vdomTree1
  machine2 ← Machine.step machine1 vdomTree2
  machine3 ← Machine.step machine2 vdomTree3
  ...

data Step' a b s

Constructors

• Step b s (EffectFn2 s a (Step a b)) (EffectFn1 s Unit)

data Step :: Type -> Type -> Type

type Machine a b = EffectFn1 a (Step a b)

unStep :: forall a b r. (forall s. Step' a b s -> r) -> Step a b -> r

step :: forall a b. EffectFn2 (Step a b) a (Step a b)

Runs the next step.

mkStep :: forall a b s. Step' a b s -> Step a b

halt :: forall a b. EffectFn1 (Step a b) Unit

Runs the finalizer associated with a Step

extract :: forall a b. Step a b -> b

Returns the output value of a Step.

data VDom a w

The core virtual-dom tree type, where a is the type of attributes, and w is the type of "widgets". Widgets are machines that have complete control over the lifecycle of some DOM.Node.

The Grafted constructor and associated machinery enables bimap fusion using a Coyoneda-like encoding.

Constructors

• Text String
• Elem (Maybe Namespace) ElemName a (Array (VDom a w))
• Keyed (Maybe Namespace) ElemName a (Array (Tuple String (VDom a w)))
• Widget w
• Grafted (Graft a w)

Instances

• Functor (VDom a)
• Bifunctor VDom

newtype Namespace

Constructors

• Namespace String

Instances

• Newtype Namespace _
• Eq Namespace
• Ord Namespace

data Graft :: Type -> Type -> Type

Instances

• Functor (Graft a)
• Bifunctor Graft

newtype ElemName

Constructors

• ElemName String

Instances

• Newtype ElemName _
• Eq ElemName
• Ord ElemName

runGraft :: forall a' w'. Graft a' w' -> VDom a' w'