imp-frp-0.0.0: Experimental FRP system. Contents Index

FRP.Imp.PrimComb

Contents Functor and Applicative instances Primitive combinators

Description

Primitive combinators for events and reactive values. This module is re-exported by FRP.Imp, so you don't have to import it manually.

Synopsis

(>>>) :: Functor f => f a -> b -> f b (>>>=) :: Functor f => f a -> (a -> b) -> f b never :: Event a hold :: a -> Event a -> Reactive a changes :: Reactive a -> Event a mealyMaybe :: s -> (s -> a -> (s, Maybe b)) -> Event a -> Event (s, b) mealy :: s -> (s -> a -> (s, b)) -> Event a -> Event b mealy' :: s -> (s -> a -> (s, b)) -> Event a -> Event (s, b) mealy_ :: s -> (s -> a -> s) -> Event a -> Event s snapshotWith :: (a -> b -> c) -> Reactive a -> Event b -> Event c justWithE :: (a -> Maybe b) -> Event a -> Event b filterE :: (a -> Bool) -> Event a -> Event a eitherE :: Event a -> Event b -> Event (Either a b) mergeE :: Event a -> Event a -> Event a mergeWithE :: (Either a b -> c) -> Event a -> Event b -> Event c combineWithR :: (a -> b -> c) -> Reactive a -> Reactive b -> Reactive c switchE :: Reactive Bool -> Event a -> Event a -> Event a whenE :: Reactive Bool -> Event a -> Event a unlessE :: Reactive Bool -> Event a -> Event a

Functor and Applicative instances

(>>>) :: Functor f => f a -> b -> f b

(>>>=) :: Functor f => f a -> (a -> b) -> f b

Primitive combinators

never :: Event a

hold :: a -> Event a -> Reactive a

changes :: Reactive a -> Event a

mealyMaybe :: s -> (s -> a -> (s, Maybe b)) -> Event a -> Event (s, b)

mealy :: s -> (s -> a -> (s, b)) -> Event a -> Event b

mealy' :: s -> (s -> a -> (s, b)) -> Event a -> Event (s, b)

mealy_ :: s -> (s -> a -> s) -> Event a -> Event s

snapshotWith :: (a -> b -> c) -> Reactive a -> Event b -> Event c

justWithE :: (a -> Maybe b) -> Event a -> Event b

filterE :: (a -> Bool) -> Event a -> Event a

eitherE :: Event a -> Event b -> Event (Either a b)

mergeE :: Event a -> Event a -> Event a

mergeWithE :: (Either a b -> c) -> Event a -> Event b -> Event c

combineWithR :: (a -> b -> c) -> Reactive a -> Reactive b -> Reactive c

switchE :: Reactive Bool -> Event a -> Event a -> Event a

This is how you can do static branches (since we don't allow higher order events). True means that the first event survives, False that the second one.

whenE :: Reactive Bool -> Event a -> Event a

unlessE :: Reactive Bool -> Event a -> Event a

Produced by Haddock version 2.4.1