WidgetRattus.Channels

Documentation

timer :: Int -> Box (O ())

timer n produces a delayed computation that ticks every n milliseconds. In particular mkSig (timer n) is a signal that produces a new value every milliseconds.

class Producer p a | p -> a where

A type p satisfying Producer p a is essentially a signal that produces values of type a but it might not produce such values at each tick.

Methods

getCurrent :: p -> Maybe' a

Get the current value of the producer if any.

getNext :: p -> (forall q. Producer q a => O q -> b) -> b

Get the next state of the producer. Morally, the type of this method should be

getNext :: p -> (exists q. Producer q a => O q)

We encode the existential type using continuation-passing style.

Instances

Producer p a => Producer (F p) a

Defined in WidgetRattus.Future

Methods

getCurrent :: F p -> Maybe' a

getNext :: F p -> (forall q. Producer q a => O q -> b) -> b

Producer (SigF a) a

Defined in WidgetRattus.Future

Methods

getCurrent :: SigF a -> Maybe' a

getNext :: SigF a -> (forall q. Producer q a => O q -> b) -> b

Producer p a => Producer (Box p) a

Defined in WidgetRattus.Channels

Methods

getCurrent :: Box p -> Maybe' a

getNext :: Box p -> (forall q. Producer q a => O q -> b) -> b

Producer p a => Producer (O p) a

Defined in WidgetRattus.Channels

Methods

getCurrent :: O p -> Maybe' a

getNext :: O p -> (forall q. Producer q a => O q -> b) -> b

Producer (Sig a) a

Defined in WidgetRattus.Signal

Methods

getCurrent :: Sig a -> Maybe' a

getNext :: Sig a -> (forall q. Producer q a => O q -> b) -> b

chan :: C (Chan a)

newtype C a

Constructors

C

Fields

• unC :: IO a

Instances

Applicative C

Defined in WidgetRattus.Channels

Methods

pure :: a -> C a

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

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

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

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

Functor C

Defined in WidgetRattus.Channels

Methods

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

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

Monad C

Defined in WidgetRattus.Channels

Methods

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

(>>) :: C a -> C b -> C b

return :: a -> C a

delayC :: O (C a) -> C (O a)

wait :: Chan a -> O a

data Chan a