Copyright	(c) 2013 Ertugrul Soeylemez
License	BSD3
Maintainer	Ertugrul Soeylemez <es@ertes.de>
Safe Haskell	None
Language	Haskell2010

Control.Wire.Core

Contents

Wires
Constructing wires
Data flow and dependencies
Utilities

Description

Synopsis

Wires

data Wire s e m a b where #

A wire is a signal function. It maps a reactive value to another reactive value.

Constructors

WArr :: (Either e a -> Either e b) -> Wire s e m a b
WConst :: Either e b -> Wire s e m a b
WGen :: (s -> Either e a -> m (Either e b, Wire s e m a b)) -> Wire s e m a b
WId :: Wire s e m a a
WPure :: (s -> Either e a -> (Either e b, Wire s e m a b)) -> Wire s e m a b

Instances

Monad m => Category * (Wire s e m) #
Methods id :: cat a a # (.) :: cat b c -> cat a b -> cat a c #
Monad m => Arrow (Wire s e m) #
Methods arr :: (b -> c) -> Wire s e m b c # first :: Wire s e m b c -> Wire s e m (b, d) (c, d) # second :: Wire s e m b c -> Wire s e m (d, b) (d, c) # (***) :: Wire s e m b c -> Wire s e m b' c' -> Wire s e m (b, b') (c, c') # (&&&) :: Wire s e m b c -> Wire s e m b c' -> Wire s e m b (c, c') #
(Monad m, Monoid e) => ArrowZero (Wire s e m) #
Methods zeroArrow :: Wire s e m b c #
(Monad m, Monoid e) => ArrowPlus (Wire s e m) #
Methods (<+>) :: Wire s e m b c -> Wire s e m b c -> Wire s e m b c #
(Monad m, Monoid e) => ArrowChoice (Wire s e m) #
Methods left :: Wire s e m b c -> Wire s e m (Either b d) (Either c d) # right :: Wire s e m b c -> Wire s e m (Either d b) (Either d c) # (+++) :: Wire s e m b c -> Wire s e m b' c' -> Wire s e m (Either b b') (Either c c') # (\|\|\|) :: Wire s e m b d -> Wire s e m c d -> Wire s e m (Either b c) d #
MonadFix m => ArrowLoop (Wire s e m) #
Methods loop :: Wire s e m (b, d) (c, d) -> Wire s e m b c #
(Monad m, Monoid e) => Choice (Wire s e m) #
Methods left' :: Wire s e m a b -> Wire s e m (Either a c) (Either b c) # right' :: Wire s e m a b -> Wire s e m (Either c a) (Either c b) #
(Monad m, Monoid e) => Strong (Wire s e m) #
Methods first' :: Wire s e m a b -> Wire s e m (a, c) (b, c) # second' :: Wire s e m a b -> Wire s e m (c, a) (c, b) #
Monad m => Profunctor (Wire s e m) #
Methods dimap :: (a -> b) -> (c -> d) -> Wire s e m b c -> Wire s e m a d # lmap :: (a -> b) -> Wire s e m b c -> Wire s e m a c # rmap :: (b -> c) -> Wire s e m a b -> Wire s e m a c # (#.) :: Coercible * c b => (b -> c) -> Wire s e m a b -> Wire s e m a c # (.#) :: Coercible * b a => Wire s e m b c -> (a -> b) -> Wire s e m a c #
Monad m => Functor (Wire s e m a) #
Methods fmap :: (a -> b) -> Wire s e m a a -> Wire s e m a b # (<$) :: a -> Wire s e m a b -> Wire s e m a a #
Monad m => Applicative (Wire s e m a) #
Methods pure :: a -> Wire s e m a a # (<>) :: Wire s e m a (a -> b) -> Wire s e m a a -> Wire s e m a b # (>) :: Wire s e m a a -> Wire s e m a b -> Wire s e m a b # (<*) :: Wire s e m a a -> Wire s e m a b -> Wire s e m a a #
(Monad m, Monoid e) => Alternative (Wire s e m a) #
Methods empty :: Wire s e m a a # (<\|>) :: Wire s e m a a -> Wire s e m a a -> Wire s e m a a # some :: Wire s e m a a -> Wire s e m a [a] # many :: Wire s e m a a -> Wire s e m a [a] #
(Monad m, Floating b) => Floating (Wire s e m a b) #
Methods pi :: Wire s e m a b # exp :: Wire s e m a b -> Wire s e m a b # log :: Wire s e m a b -> Wire s e m a b # sqrt :: Wire s e m a b -> Wire s e m a b # (**) :: Wire s e m a b -> Wire s e m a b -> Wire s e m a b # logBase :: Wire s e m a b -> Wire s e m a b -> Wire s e m a b # sin :: Wire s e m a b -> Wire s e m a b # cos :: Wire s e m a b -> Wire s e m a b # tan :: Wire s e m a b -> Wire s e m a b # asin :: Wire s e m a b -> Wire s e m a b # acos :: Wire s e m a b -> Wire s e m a b # atan :: Wire s e m a b -> Wire s e m a b # sinh :: Wire s e m a b -> Wire s e m a b # cosh :: Wire s e m a b -> Wire s e m a b # tanh :: Wire s e m a b -> Wire s e m a b # asinh :: Wire s e m a b -> Wire s e m a b # acosh :: Wire s e m a b -> Wire s e m a b # atanh :: Wire s e m a b -> Wire s e m a b # log1p :: Wire s e m a b -> Wire s e m a b # expm1 :: Wire s e m a b -> Wire s e m a b # log1pexp :: Wire s e m a b -> Wire s e m a b # log1mexp :: Wire s e m a b -> Wire s e m a b #
(Monad m, Fractional b) => Fractional (Wire s e m a b) #
Methods (/) :: Wire s e m a b -> Wire s e m a b -> Wire s e m a b # recip :: Wire s e m a b -> Wire s e m a b # fromRational :: Rational -> Wire s e m a b #
(Monad m, Num b) => Num (Wire s e m a b) #
Methods (+) :: Wire s e m a b -> Wire s e m a b -> Wire s e m a b # (-) :: Wire s e m a b -> Wire s e m a b -> Wire s e m a b # (*) :: Wire s e m a b -> Wire s e m a b -> Wire s e m a b # negate :: Wire s e m a b -> Wire s e m a b # abs :: Wire s e m a b -> Wire s e m a b # signum :: Wire s e m a b -> Wire s e m a b # fromInteger :: Integer -> Wire s e m a b #
(Monad m, IsString b) => IsString (Wire s e m a b) #
Methods fromString :: String -> Wire s e m a b #
(Monad m, Semigroup b) => Semigroup (Wire s e m a b) #
Methods (<>) :: Wire s e m a b -> Wire s e m a b -> Wire s e m a b # sconcat :: NonEmpty (Wire s e m a b) -> Wire s e m a b # stimes :: Integral b => b -> Wire s e m a b -> Wire s e m a b #
(Monad m, Monoid b) => Monoid (Wire s e m a b) #
Methods mempty :: Wire s e m a b # mappend :: Wire s e m a b -> Wire s e m a b -> Wire s e m a b # mconcat :: [Wire s e m a b] -> Wire s e m a b #

stepWire :: Monad m => Wire s e m a b -> s -> Either e a -> m (Either e b, Wire s e m a b) #

Perform one step of the given wire.

Constructing wires

mkConst :: Either e b -> Wire s e m a b #

Construct a stateless wire from the given signal mapping function.

mkEmpty :: Monoid e => Wire s e m a b #

Construct the empty wire, which inhibits forever.

mkGen :: (Monad m, Monoid s) => (s -> a -> m (Either e b, Wire s e m a b)) -> Wire s e m a b #

Construct a stateful wire from the given transition function.

mkGen_ :: Monad m => (a -> m (Either e b)) -> Wire s e m a b #

Construct a stateless wire from the given transition function.

mkGenN :: Monad m => (a -> m (Either e b, Wire s e m a b)) -> Wire s e m a b #

Construct a stateful wire from the given transition function.

mkId :: Wire s e m a a #

Construct the identity wire.

mkPure :: Monoid s => (s -> a -> (Either e b, Wire s e m a b)) -> Wire s e m a b #

Construct a pure stateful wire from the given transition function.

mkPure_ :: (a -> Either e b) -> Wire s e m a b #

Construct a pure stateless wire from the given transition function.

mkPureN :: (a -> (Either e b, Wire s e m a b)) -> Wire s e m a b #

Construct a pure stateful wire from the given transition function.

mkSF :: Monoid s => (s -> a -> (b, Wire s e m a b)) -> Wire s e m a b #

Construct a pure stateful wire from the given signal function.

mkSF_ :: (a -> b) -> Wire s e m a b #

Construct a pure stateless wire from the given function.

mkSFN :: (a -> (b, Wire s e m a b)) -> Wire s e m a b #

Construct a pure stateful wire from the given signal function.

Data flow and dependencies

delay :: a -> Wire s e m a a #

This wire delays its input signal by the smallest possible (semantically infinitesimal) amount of time. You can use it when you want to use feedback (ArrowLoop): If the user of the feedback depends on now, delay the value before feeding it back. The argument value is the replacement signal at the beginning.

Depends: before now.

evalWith :: Strategy a -> Wire s e m a a #

Evaluate the input signal using the given Strategy here. This wire evaluates only produced values.

Depends: now.

force :: Wire s e m a a #

Force the input signal to WHNF here. This wire forces both produced values and inhibition values.

Depends: now.

forceNF :: NFData a => Wire s e m a a #

Force the input signal to NF here. This wire forces only produced values.

Depends: now.

Utilities

(&&&!) :: (a -> b) -> (a -> c) -> a -> (b, c) #

Left-strict version of &&& for functions.

(***!) :: (a -> c) -> (b -> d) -> (a, b) -> (c, d) #

Left-strict version of *** for functions.

lstrict :: (a, b) -> (a, b) #

Left-strict tuple.

mapWire :: (Monad m', Monad m) => (forall a. m' a -> m a) -> Wire s e m' a b -> Wire s e m a b #

Apply the given monad morphism to the wire's underlying monad.