Yampa-0.10.7: Library for programming hybrid systems.

Copyright(c) Antony Courtney and Henrik Nilsson Yale University 2003
LicenseBSD-style (see the LICENSE file in the distribution)
Maintainernilsson@cs.yale.edu
Stabilityprovisional
Portabilitynon-portable (GHC extensions)
Safe HaskellNone
LanguageHaskell98

FRP.Yampa.Task

Description

Task abstraction on top of signal transformers.

Documentation

data Task a b c Source #

Instances

Monad (Task a b) Source # 

Methods

(>>=) :: Task a b a -> (a -> Task a b b) -> Task a b b #

(>>) :: Task a b a -> Task a b b -> Task a b b #

return :: a -> Task a b a #

fail :: String -> Task a b a #

Functor (Task a b) Source # 

Methods

fmap :: (a -> b) -> Task a b a -> Task a b b #

(<$) :: a -> Task a b b -> Task a b a #

Applicative (Task a b) Source # 

Methods

pure :: a -> Task a b a #

(<*>) :: Task a b (a -> b) -> Task a b a -> Task a b b #

(*>) :: Task a b a -> Task a b b -> Task a b b #

(<*) :: Task a b a -> Task a b b -> Task a b a #

mkTask :: SF a (b, Event c) -> Task a b c Source #

runTask :: Task a b c -> SF a (Either b c) Source #

runTask_ :: Task a b c -> SF a b Source #

taskToSF :: Task a b c -> SF a (b, Event c) Source #

constT :: b -> Task a b c Source #

sleepT :: Time -> b -> Task a b () Source #

snapT :: Task a b a Source #

timeOut :: Task a b c -> Time -> Task a b (Maybe c) infixl 0 Source #

abortWhen :: Task a b c -> SF a (Event d) -> Task a b (Either c d) infixl 0 Source #

repeatUntil :: Monad m => m a -> (a -> Bool) -> m a infixl 0 Source #

for :: Monad m => a -> (a -> a) -> (a -> Bool) -> m b -> m () Source #

forAll :: Monad m => [a] -> (a -> m b) -> m () Source #

forEver :: Monad m => m a -> m b Source #