Concur.Core

mkLeafWidget :: forall a v. ((a -> Effect Unit) -> v) -> Widget v a

Construct a widget with just props

mkNodeWidget :: forall a v. ((a -> Effect Unit) -> v -> v) -> Widget v a -> Widget v a

Construct a widget, by wrapping an existing widget in a view event

mkNodeWidget' :: forall a v. ((a -> Effect Unit) -> v -> v) -> Free (WidgetStep v) a -> Free (WidgetStep v) a

class (Monad m, Monoid v, ShiftMap (Widget v) m, LiftWidget v m, MultiAlternative m) <= IsWidget v m 

A Nice way to bring into scope all needed functionality which we need to write widgets

Instances

• (Monoid v) => IsWidget v (Widget v)

class LiftWidget v m  where

A way to lift widgets into higher monads

Members

• liftWidget :: forall a. Widget v a -> m a

Instances

• LiftWidget v (Widget v)
• (Monad m, LiftWidget v m) => LiftWidget v (ExceptT e m)
• (Monoid w, Monad m, LiftWidget v m) => LiftWidget v (RWST r w s m)
• (Monad m, LiftWidget v m) => LiftWidget v (ReaderT r m)
• (Monad m, LiftWidget v m) => LiftWidget v (StateT s m)
• (Monoid s, Monad m, LiftWidget v m) => LiftWidget v (WriterT s m)

newtype WidgetStep v a

Constructors

• WidgetStep (Either (Effect a) (WidgetStepRecord v a))

Instances

• Functor (WidgetStep v)

newtype Widget v a

Constructors

• Widget (Free (WidgetStep v) a)

Instances

• Functor (Widget v)
• Bind (Widget v)
• Applicative (Widget v)
• Apply (Widget v)
• Monad (Widget v)
• MonadRec (Widget v)
• ShiftMap (Widget v) (Widget v)
• (Monoid v) => MultiAlternative (Widget v)
• (Monoid v) => Semigroup (Widget v a)
• (Monoid v) => Monoid (Widget v a)
• (Monoid v) => Alt (Widget v)
• (Monoid v) => Plus (Widget v)
• (Monoid v) => Alternative (Widget v)
• (Monoid v) => MonadEffect (Widget v)
• (Monoid v) => MonadAff (Widget v)

unWidget :: forall v a. Widget v a -> Free (WidgetStep v) a

resume :: forall f a. Functor f => Free f a -> Either a (f (Free f a))