Safe Haskell | None |
---|---|
Language | Haskell2010 |
See http://github.com/agocorona/transient Everything in this module is exported in order to allow extensibility.
- tshow :: Show a => a -> x -> x
- (!>) :: a -> b -> a
- type StateIO = StateT EventF IO
- newtype TransIO a = Transient {}
- type SData = ()
- type EventId = Int
- type TransientIO = TransIO
- data LifeCycle
- data EventF = EventF {}
- noTrans :: StateIO x -> TransIO x
- emptyEventF :: ThreadId -> IORef (LifeCycle, ByteString) -> MVar [EventF] -> EventF
- runTransient :: TransIO a -> IO (Maybe a, EventF)
- runTransState :: EventF -> TransIO x -> IO (Maybe x, EventF)
- getCont :: TransIO EventF
- runCont :: EventF -> StateIO (Maybe a)
- runCont' :: EventF -> IO (Maybe a, EventF)
- getContinuations :: StateIO [a -> TransIO b]
- compose :: [a -> TransIO a] -> a -> TransIO b
- runClosure :: EventF -> StateIO (Maybe a)
- runContinuation :: EventF -> a -> StateIO (Maybe b)
- setContinuation :: TransIO a -> (a -> TransIO b) -> [c -> TransIO c] -> StateIO ()
- withContinuation :: b -> TransIO a -> TransIO a
- restoreStack :: MonadState EventF m => [a -> TransIO a] -> m ()
- runContinuations :: [a -> TransIO b] -> c -> TransIO d
- readWithErr :: (Typeable a, Read a) => Int -> String -> IO [(a, String)]
- read' :: (Typeable * p, Read p) => String -> p
- readsPrec' :: (Read a, Typeable * a) => Int -> String -> [(a, String)]
- type Loggable a = (Show a, Read a, Typeable a)
- data IDynamic
- type Recover = Bool
- type CurrentPointer = [LogElem]
- type LogEntries = [LogElem]
- type Hash = Int
- data LogElem
- data Log = Log Recover CurrentPointer LogEntries Hash
- data RemoteStatus
- stop :: Alternative m => m stopped
- class AdditionalOperators m where
- (<|) :: TransIO a -> TransIO b -> TransIO a
- setEventCont :: TransIO a -> (a -> TransIO b) -> StateIO ()
- resetEventCont :: MonadState EventF m => Maybe t -> m ()
- tailsafe :: [a] -> [a]
- waitQSemB :: (Num a, Ord a) => IORef a -> IO Bool
- signalQSemB :: Num a => IORef a -> IO ()
- threads :: Int -> TransIO a -> TransIO a
- oneThread :: TransIO a -> TransIO a
- labelState :: (MonadIO m, MonadState EventF m) => String -> m ()
- printBlock :: MVar ()
- showThreads :: MonadIO m => EventF -> m ()
- topState :: TransIO EventF
- showState :: (Typeable a, MonadIO m, Alternative m) => String -> EventF -> m (Maybe a)
- processStates :: Typeable a => (a -> TransIO ()) -> EventF -> TransIO ()
- addThreads' :: Int -> TransIO ()
- addThreads :: Int -> TransIO ()
- freeThreads :: TransIO a -> TransIO a
- hookedThreads :: TransIO a -> TransIO a
- killChilds :: TransIO ()
- killBranch :: TransIO ()
- killBranch' :: EventF -> IO ()
- getData :: (MonadState EventF m, Typeable a) => m (Maybe a)
- getSData :: Typeable a => TransIO a
- getState :: Typeable a => TransIO a
- setData :: (MonadState EventF m, Typeable a) => a -> m ()
- modifyData :: (MonadState EventF m, Typeable a) => (Maybe a -> Maybe a) -> m ()
- modifyData' :: (MonadState EventF m, Typeable a) => (a -> a) -> a -> m a
- modifyState :: (MonadState EventF m, Typeable a) => (Maybe a -> Maybe a) -> m ()
- setState :: (MonadState EventF m, Typeable a) => a -> m ()
- delData :: (MonadState EventF m, Typeable a) => a -> m ()
- delState :: (MonadState EventF m, Typeable a) => a -> m ()
- newtype Ref a = Ref (IORef a)
- setRState :: Typeable a => a -> TransIO ()
- getRState :: Typeable a => TransIO a
- delRState :: (Typeable * a, MonadState EventF m) => a -> m ()
- try :: TransIO a -> TransIO a
- sandbox :: TransIO a -> TransIO a
- genGlobalId :: MonadIO m => m Int
- rglobalId :: IORef Int
- genId :: MonadState EventF m => m Int
- getPrevId :: MonadState EventF m => m Int
- data StreamData a
- = SMore a
- | SLast a
- | SDone
- | SError SomeException
- waitEvents :: IO a -> TransIO a
- async :: IO a -> TransIO a
- sync :: TransIO a -> TransIO a
- spawn :: IO a -> TransIO a
- sample :: Eq a => IO a -> Int -> TransIO a
- parallel :: IO (StreamData b) -> TransIO (StreamData b)
- loop :: EventF -> IO (StreamData t) -> IO ()
- free :: ThreadId -> EventF -> IO ()
- hangThread :: EventF -> EventF -> IO ()
- killChildren :: MVar [EventF] -> IO ()
- react :: Typeable eventdata => ((eventdata -> IO response) -> IO ()) -> IO response -> TransIO eventdata
- abduce :: TransIO ()
- option :: (Typeable b, Show b, Read b, Eq b) => b -> String -> TransIO b
- option1 :: (Typeable b, Show b, Read b, Eq b) => b -> String -> TransIO b
- optionf :: (Typeable b, Show b, Read b, Eq b) => Bool -> b -> String -> TransIO b
- inputf :: (Typeable * a, Read a, Show a) => Bool -> String -> p -> Maybe a -> (a -> Bool) -> TransIO a
- input :: (Typeable a, Read a, Show a) => (a -> Bool) -> String -> TransIO a
- input' :: (Typeable a, Read a, Show a) => Maybe a -> (a -> Bool) -> String -> TransIO a
- rcb :: IORef (Map String (String -> IO ()))
- addListener :: String -> (String -> IO ()) -> IO ()
- delListener :: String -> IO ()
- reads1 :: (Read a, Typeable * a) => String -> [(a, String)]
- inputLoop :: IO b
- rconsumed :: IORef Bool
- processLine :: String -> IO ()
- stay :: MVar (Maybe a) -> IO (Maybe a)
- newtype Exit a = Exit a
- keep :: Typeable a => TransIO a -> IO (Maybe a)
- keep' :: Typeable a => TransIO a -> IO (Maybe a)
- execCommandLine :: IO ()
- exit :: Typeable a => a -> TransIO a
- onNothing :: Monad m => m (Maybe b) -> m b -> m b
- data Backtrack b = Show b => Backtrack {
- backtracking :: Maybe b
- backStack :: [EventF]
- backCut :: (Typeable b, Show b) => b -> TransientIO ()
- undoCut :: TransientIO ()
- onBack :: (Typeable b, Show b) => TransientIO a -> (b -> TransientIO a) -> TransientIO a
- onUndo :: TransientIO a -> TransientIO a -> TransientIO a
- registerBack :: (Typeable b, Show b) => b -> TransientIO a -> TransientIO a
- registerUndo :: TransientIO a -> TransientIO a
- forward :: (Typeable b, Show b) => b -> TransIO ()
- retry :: TransIO ()
- noFinish :: TransIO ()
- back :: (Typeable b, Show b) => b -> TransientIO a
- backStateOf :: (Show a, Typeable a) => a -> Backtrack a
- undo :: TransIO a
- newtype Finish = Finish String
- onFinish :: (Finish -> TransIO ()) -> TransIO ()
- onFinish' :: TransIO a -> (Finish -> TransIO a) -> TransIO a
- initFinish :: TransIO ()
- finish :: String -> TransIO ()
- checkFinalize :: StreamData a -> TransIO a
- onException :: Exception e => (e -> TransIO ()) -> TransIO ()
- onException' :: Exception e => TransIO a -> (e -> TransIO a) -> TransIO a
- exceptBack :: EventF -> SomeException -> IO (Maybe a, EventF)
- cutExceptions :: TransIO ()
- continue :: TransIO ()
- catcht :: Exception e => TransIO b -> (e -> TransIO b) -> TransIO b
- throwt :: Exception e => e -> TransIO a
Documentation
Monad TransIO Source # | |
Functor TransIO Source # | |
Applicative TransIO Source # | |
MonadIO TransIO Source # | |
Alternative TransIO Source # | |
MonadPlus TransIO Source # | |
AdditionalOperators TransIO Source # | |
MonadState EventF TransIO Source # | |
(Num a, Eq a, Fractional a) => Fractional (TransIO a) Source # | |
(Num a, Eq a) => Num (TransIO a) Source # | |
Monoid a => Monoid (TransIO a) Source # | |
type TransientIO = TransIO Source #
EventF describes the context of a TransientIO computation:
EventF | |
|
noTrans :: StateIO x -> TransIO x Source #
Run a "non transient" computation within the underlying state monad, so it is guaranteed that the computation neither can stop neither can trigger additional events/threads.
emptyEventF :: ThreadId -> IORef (LifeCycle, ByteString) -> MVar [EventF] -> EventF Source #
runTransient :: TransIO a -> IO (Maybe a, EventF) Source #
Run a transient computation with a default initial state
runTransState :: EventF -> TransIO x -> IO (Maybe x, EventF) Source #
Run a transient computation with a given initial state
getCont :: TransIO EventF Source #
Get the continuation context: closure, continuation, state, child threads etc
runCont :: EventF -> StateIO (Maybe a) Source #
Run the closure and the continuation using the state data of the calling thread
runCont' :: EventF -> IO (Maybe a, EventF) Source #
Run the closure and the continuation using its own state data.
getContinuations :: StateIO [a -> TransIO b] Source #
Warning: Radically untyped stuff. handle with care
runClosure :: EventF -> StateIO (Maybe a) Source #
Run the closure (the x
in 'x >>= f') of the current bind operation.
runContinuation :: EventF -> a -> StateIO (Maybe b) Source #
Run the continuation (the f
in 'x >>= f') of the current bind operation with the current state.
setContinuation :: TransIO a -> (a -> TransIO b) -> [c -> TransIO c] -> StateIO () Source #
Save a closure and a continuation (x
and f
in 'x >>= f').
withContinuation :: b -> TransIO a -> TransIO a Source #
Save a closure and continuation, run the closure, restore the old continuation. | NOTE: The old closure is discarded.
restoreStack :: MonadState EventF m => [a -> TransIO a] -> m () Source #
Restore the continuations to the provided ones. | NOTE: Events are also cleared out.
runContinuations :: [a -> TransIO b] -> c -> TransIO d Source #
Run a chain of continuations.
WARNING: It is up to the programmer to assure that each continuation typechecks
with the next, and that the parameter type match the input of the first
continuation.
NOTE: Normally this makes sense to stop the current flow with stop
after the
invocation.
type Loggable a = (Show a, Read a, Typeable a) Source #
Constraint type synonym for a value that can be logged.
Dynamic serializable data for logging.
type CurrentPointer = [LogElem] Source #
type LogEntries = [LogElem] Source #
data RemoteStatus Source #
stop :: Alternative m => m stopped Source #
A synonym of empty
that can be used in a monadic expression. It stops
the computation, which allows the next computation in an Alternative
(<|>
) composition to run.
class AdditionalOperators m where Source #
(**>) :: m a -> m b -> m b infixr 1 Source #
Run m a
discarding its result before running m b
.
(<**) :: m a -> m b -> m a infixr 1 Source #
Run m b
discarding its result, after the whole task set m a
is
done.
atEnd' :: m a -> m b -> m a Source #
(<***) :: m a -> m b -> m a infixr 1 Source #
Run m b
discarding its result, once after each task in m a
, and
once again after the whole task set is done.
(<|) :: TransIO a -> TransIO b -> TransIO a Source #
Run b
once, discarding its result when the first task in task set a
has finished. Useful to start a singleton task after the first task has been
setup.
setEventCont :: TransIO a -> (a -> TransIO b) -> StateIO () Source #
Set the current closure and continuation for the current statement
resetEventCont :: MonadState EventF m => Maybe t -> m () Source #
Reset the closure and continuation. Remove inner binds than the previous computations may have stacked in the list of continuations. resetEventCont :: Maybe a -> EventF -> StateIO ()
tailsafe :: [a] -> [a] Source #
Total variant of tail
that returns an empty list when given an empty list.
Threads
threads :: Int -> TransIO a -> TransIO a Source #
Sets the maximum number of threads that can be created for the given task
set. When set to 0, new tasks start synchronously in the current thread.
New threads are created by parallel
, and APIs that use parallel.
oneThread :: TransIO a -> TransIO a Source #
Terminate all the child threads in the given task set and continue execution in the current thread. Useful to reap the children when a task is done.
labelState :: (MonadIO m, MonadState EventF m) => String -> m () Source #
Add a label to the current passing threads so it can be printed by debugging calls like showThreads
printBlock :: MVar () Source #
showThreads :: MonadIO m => EventF -> m () Source #
Show the tree of threads hanging from the state.
topState :: TransIO EventF Source #
Return the state of the thread that initiated the transient computation
showState :: (Typeable a, MonadIO m, Alternative m) => String -> EventF -> m (Maybe a) Source #
Return the state variable of the type desired with which a thread, identified by his number in the treee was initiated
processStates :: Typeable a => (a -> TransIO ()) -> EventF -> TransIO () Source #
return all the states of the type desired that are created by direct child threads
addThreads' :: Int -> TransIO () Source #
Add n threads to the limit of threads. If there is no limit, the limit is set.
addThreads :: Int -> TransIO () Source #
Ensure that at least n threads are available for the current task set.
freeThreads :: TransIO a -> TransIO a Source #
Disable tracking and therefore the ability to terminate the child threads. By default, child threads are terminated automatically when the parent thread dies, or they can be terminated using the kill primitives. Disabling it may improve performance a bit, however, all threads must be well-behaved to exit on their own to avoid a leak.
hookedThreads :: TransIO a -> TransIO a Source #
Enable tracking and therefore the ability to terminate the child threads.
This is the default but can be used to re-enable tracking if it was
previously disabled with freeThreads
.
killChilds :: TransIO () Source #
Kill all the child threads of the current thread.
killBranch :: TransIO () Source #
Kill the current thread and the childs.
killBranch' :: EventF -> IO () Source #
Kill the childs and the thread of an state
Extensible State: Session Data Management
getSData :: Typeable a => TransIO a Source #
Retrieve a previously stored data item of the given data type from the
monad state. The data type to retrieve is implicitly determined by the data type.
If the data item is not found, empty is executed, so the alternative computation will be executed, if any, or
Otherwise, the computation will stop..
If you want to print an error message or a default value, you can use an Alternative
composition. For example:
getSData <|> error "no data of the type desired" getInt = getSData <|> return (0 :: Int)
setData :: (MonadState EventF m, Typeable a) => a -> m () Source #
setData
stores a data item in the monad state which can be retrieved
later using getData
or getSData
. Stored data items are keyed by their
data type, and therefore only one item of a given type can be stored. A
newtype wrapper can be used to distinguish two data items of the same type.
import Control.Monad.IO.Class (liftIO) import Transient.Base import Data.Typeable data Person = Person { name :: String , age :: Int } deriving Typeable main = keep $ do setData $ Person Alberto 55 Person name age <- getSData liftIO $ print (name, age)
modifyData :: (MonadState EventF m, Typeable a) => (Maybe a -> Maybe a) -> m () Source #
Accepts a function that takes the current value of the stored data type
and returns the modified value. If the function returns Nothing
the value
is deleted otherwise updated.
modifyData' :: (MonadState EventF m, Typeable a) => (a -> a) -> a -> m a Source #
Either modify according with the first parameter or insert according with the second, depending on if the data exist or not.
runTransient $ do modifyData1 (\h -> h ++ " world") "hello new" ; r <- getSData ; liftIO $ putStrLn r -- > "hello new" runTransient $ do setData "hello" ; modifyData1 (\h -> h ++ " world") "hello new" ; r <- getSData ; liftIO $ putStrLn r -- > "hello world"
modifyState :: (MonadState EventF m, Typeable a) => (Maybe a -> Maybe a) -> m () Source #
Same as modifyData
delData :: (MonadState EventF m, Typeable a) => a -> m () Source #
Delete the data item of the given type from the monad state.
setRState :: Typeable a => a -> TransIO () Source #
mutable state reference that can be updated (similar to STRef in the state monad)
Initialized the first time it is set.
try :: TransIO a -> TransIO a Source #
Run an action, if it does not succeed, undo any state changes that it might have caused and allow aternative actions to run with the original state
sandbox :: TransIO a -> TransIO a Source #
Executes the computation and reset the state either if it fails or not.
genGlobalId :: MonadIO m => m Int Source #
generates an identifier that is unique within the current program execution
genId :: MonadState EventF m => m Int Source #
Generator of identifiers that are unique within the current monadic sequence They are not unique in the whole program.
data StreamData a Source #
StreamData
represents a task in a task stream being generated.
SMore a | More tasks to come |
SLast a | This is the last task |
SDone | No more tasks, we are done |
SError SomeException | An error occurred |
Read a => Read (StreamData a) Source # | |
Show a => Show (StreamData a) Source # | |
waitEvents :: IO a -> TransIO a Source #
A task stream generator that produces an infinite stream of tasks by
running an IO computation in a loop. A task is triggered carrying the output
of the computation. See parallel
for notes on the return value.
async :: IO a -> TransIO a Source #
Run an IO computation asynchronously and generate a single task carrying
the result of the computation when it completes. See parallel
for notes on
the return value.
sync :: TransIO a -> TransIO a Source #
Force an async computation to run synchronously. It can be useful in an
Alternative
composition to run the alternative only after finishing a
computation. Note that in Applicatives it might result in an undesired
serialization.
sample :: Eq a => IO a -> Int -> TransIO a Source #
A task stream generator that produces an infinite stream of tasks by
running an IO computation periodically at the specified time interval. The
task carries the result of the computation. A new task is generated only if
the output of the computation is different from the previous one. See
parallel
for notes on the return value.
parallel :: IO (StreamData b) -> TransIO (StreamData b) Source #
Run an IO action one or more times to generate a stream of tasks. The IO
action returns a StreamData
. When it returns an SMore
or SLast
a new
task is triggered with the result value. If the return value is SMore
, the
action is run again to generate the next task, otherwise task creation
stops.
Unless the maximum number of threads (set with threads
) has been reached,
the task is generated in a new thread and the current thread returns a void
task.
killChildren :: MVar [EventF] -> IO () Source #
kill all the child threads associated with the continuation context
react :: Typeable eventdata => ((eventdata -> IO response) -> IO ()) -> IO response -> TransIO eventdata Source #
Make a transient task generator from an asynchronous callback handler.
The first parameter is a callback. The second parameter is a value to be
returned to the callback; if the callback expects no return value it
can just be a return ()
. The callback expects a setter function taking the
eventdata
as an argument and returning a value to the callback; this
function is supplied by react
.
Callbacks from foreign code can be wrapped into such a handler and hooked
into the transient monad using react
. Every time the callback is called it
generates a new task for the transient monad.
Runs the rest of the computation in a new thread. Returns empty
to the current thread
Non-blocking keyboard input
option :: (Typeable b, Show b, Read b, Eq b) => b -> String -> TransIO b Source #
listen stdin and triggers a new task every time the input data matches the first parameter. The value contained by the task is the matched value i.e. the first argument itself. The second parameter is a message to the user for the user. The label is displayed in the console when the option match.
inputf :: (Typeable * a, Read a, Show a) => Bool -> String -> p -> Maybe a -> (a -> Bool) -> TransIO a Source #
input :: (Typeable a, Read a, Show a) => (a -> Bool) -> String -> TransIO a Source #
Waits on stdin and return a value when a console input matches the predicate specified in the first argument. The second parameter is a string to be displayed on the console before waiting.
delListener :: String -> IO () Source #
processLine :: String -> IO () Source #
stay :: MVar (Maybe a) -> IO (Maybe a) Source #
Wait for the execution of exit
and return the result or the exhaustion of thread activity
keep :: Typeable a => TransIO a -> IO (Maybe a) Source #
Runs the transient computation in a child thread and keeps the main thread
running until all the user threads exit or some thread invokes exit
.
The main thread provides facilities for accepting keyboard input in a
non-blocking but line-oriented manner. The program reads the standard input
and feeds it to all the async input consumers (e.g. option
and input
).
All async input consumers contend for each line entered on the standard
input and try to read it atomically. When a consumer consumes the input
others do not get to see it, otherwise it is left in the buffer for others
to consume. If nobody consumes the input, it is discarded.
A /
in the input line is treated as a newline.
When using asynchronous input, regular synchronous IO APIs like getLine cannot be used as they will contend for the standard input along with the asynchronous input thread. Instead you can use the asynchronous input APIs provided by transient.
A built-in interactive command handler also reads the stdin asynchronously. All available options waiting for input are displayed when the program is run. The following commands are available:
ps
: show threadslog
: inspect the log of a threadend
,exit
: terminate the program
An input not handled by the command handler can be handled by the program.
The program's command line is scanned for -p
or --path
command line
options. The arguments to these options are injected into the async input
channel as keyboard input to the program. Each line of input is separated by
a /
. For example:
foo -p ps/end
keep' :: Typeable a => TransIO a -> IO (Maybe a) Source #
Same as keep
but does not read from the standard input, and therefore
the async input APIs (option
and input
) cannot be used in the monad.
However, keyboard input can still be passed via command line arguments as
described in keep
. Useful for debugging or for creating background tasks,
as well as to embed the Transient monad inside another computation. It
returns either the value returned by exit
. or Nothing, when there are no
more threads running
execCommandLine :: IO () Source #
exit :: Typeable a => a -> TransIO a Source #
Exit the main thread, and thus all the Transient threads (and the application if there is no more code)
onNothing :: Monad m => m (Maybe b) -> m b -> m b Source #
If the first parameter is Nothing
return the second parameter otherwise
return the first parameter..
backCut :: (Typeable b, Show b) => b -> TransientIO () Source #
Delete all the undo actions registered till now for the given track id.
undoCut :: TransientIO () Source #
backCut
for the default track; equivalent to backCut ()
.
onBack :: (Typeable b, Show b) => TransientIO a -> (b -> TransientIO a) -> TransientIO a Source #
Run the action in the first parameter and register the second parameter as
the undo action. On undo (back
) the second parameter is called with the
undo track id as argument.
onUndo :: TransientIO a -> TransientIO a -> TransientIO a Source #
onBack
for the default track; equivalent to onBack ()
.
registerBack :: (Typeable b, Show b) => b -> TransientIO a -> TransientIO a Source #
Register an undo action to be executed when backtracking. The first parameter is a "witness" whose data type is used to uniquely identify this backtracking action. The value of the witness parameter is not used.
registerUndo :: TransientIO a -> TransientIO a Source #
forward :: (Typeable b, Show b) => b -> TransIO () Source #
For a given undo track id, stop executing more backtracking actions and resume normal execution in the forward direction. Used inside an undo action.
noFinish :: TransIO () Source #
Abort finish. Stop executing more finish actions and resume normal
execution. Used inside onFinish
actions.
onFinish' :: TransIO a -> (Finish -> TransIO a) -> TransIO a Source #
Run the action specified in the first parameter and register the second
parameter as a finish action to be run when finish
is called. Used in
infix style.
initFinish :: TransIO () Source #
Execute all the finalization actions registered up to the last
initFinish
, in reverse order and continue the execution. Either an exception or Nothing
can be
checkFinalize :: StreamData a -> TransIO a Source #
trigger finish when the stream of data ends
onException :: Exception e => (e -> TransIO ()) -> TransIO () Source #
Install an exception handler. Handlers are executed in reverse (i.e. last in, first out) order when such exception happens in the continuation. Note that multiple handlers can be installed for the same exception type.
The semantic is, thus, very different than the one of onException
exceptBack :: EventF -> SomeException -> IO (Maybe a, EventF) Source #
cutExceptions :: TransIO () Source #
Delete all the exception handlers registered till now.
continue :: TransIO () Source #
Use it inside an exception handler. it stop executing any further exception handlers and resume normal execution from this point on.
catcht :: Exception e => TransIO b -> (e -> TransIO b) -> TransIO b Source #
catch an exception in a Transient block
The semantic is the same than catch
but the computation and the exception handler can be multirhreaded