բ̷      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None 09:;<=AOT, async callsexecutes the second operand even if the frist return empty. A normal imperative (monadic) sequence uses the operator (>>) which in the Transient monad does not execute the next operand if the previous one return empty. forces the execution of the second operand even if the first stop. It does not execute the second operand as result of internal events occuring in the first operand. Return the first result forces the execution of the second operand even if the first stop. Return the first result. The second operand is executed also when internal events happens in the first operand and it returns something%dynamic serializable data for logging20run the transient computation with a blank state3+run the transient computation with an state4Mget the continuation context: closure, continuation, state, child threads etc5Orun the closure and the continuation using the state data of the calling thread6=run the closure and the continuation using his own state data73warning: radiactive untyped stuff. handle with care8compose a list of continuations9run the closure (the x. in 'x >>= f') of the current bind operation.:run the continuation (the f, in 'x >>= f') of the current bind operation<run a chain of continuations. It is up to the programmer to assure by construction that each continuation type-check with the next, that the parameter type match the input of the first continuation. Normally this makes sense if it stop the current flow with @ after the invocation@a sinonym of empty that can be used in a monadic expression. it stop the computation and execute the next alternative computation (composed with )Awhen the first operand is an asynchronous operation, the second operand is executed once (one single time) when the first completes his first asyncronous operation.This is useful for spawning asynchronous or distributed tasks that are singletons and that should start when the first one is set up.Rfor example a streaming where the event receivers are acivated before the senders.BBset the current closure and continuation for the current statementCreset the closure and continuation. remove inner binds than the previous computations may have stacked in the list of continuations. resetEventCont :: Maybe a -> EventF -> StateIO (TransIO b -> TransIO b)Hzset the maximun number of threads for a procedure. It is useful to limit the parallelization of transient code that uses Z Y and VI|delete all the previous childs generated by the expression taken as parameter and continue execution of the current thread.KFadd n threads to the limit of threads. If there is no limit, it set itL2assure that at least there are n threads availableMOThe threads generated in the process passed as parameter will not be killed by `kill*` primitivesNzThe threads will be killed when the parent thread dies. That is the default. This can be invoked to revert the effect of MO0kill all the child threads of the current threadP8Get the state data for the desired type if there is any.QdgetData specialized for the Transient monad. if Nothing, the monadic computation does not continue.If there is no such data, Q silently stop the computation. That may or may not be the desired behaviour. To make sure that this does not get unnoticed, use this construction:  getSData <|> error "no data"/To have the same semantics and guarantees than , use a default value: &getInt= getSData <|> return (0 :: Int)The default value (0 in this case) has the same role than the initial value in a state monad. The difference is that you can define as many % as you need for all your data types.DTo distingish two data with the same types, use newtype definitions.R-set session data for this type. retrieved with getData or getSData Note that this is data in a state monad, that means that the update only affect downstream in the monad execution. it is not a global state neither a per user or per thread state it is a monadic state like the one of a state monad.Txgenerator of identifiers that are unique withing the current monadic sequence They are not unique in the whole program.V variant of ZS that repeatedly executes the IO computation and kill the previously created childsnIt is useful in single threaded problems where each event discard the computations spawned by previous eventsX variant of ZJ that execute the IO computation once, and kill the previous child threadsYQvariant that spawn free threads. Since there is no thread control, this is fasterZreturn empty to the current thread, in new thread, execute the IO action, this IO action modify an internal buffer. then, executes the closure where Z@ is located In this new execution, since the buffer is filled, Zz return the content of this buffer. Then it launch the continuation after it with this new value returned by the closure.+If the maximum number of threads, set with H has been reached Z< perform the work sequentially, in the current thread. So ZB means that 'it can be parallelized if there are thread available'uif there is a limitation of threads, when a thread finish, the counter of threads available is increased so another Z can make use of it.The behaviour of Z depend on ; If , Z( will excute again the IO action. with ,  and , Z' will not repeat the IO action anymore._Dkill all the child threads associated with the continuation context`deinvert an event handler.The first parameter is the setter of the event handler to be deinverted. Usually it is the primitive provided by a framework to set an event handlerZthe second parameter is the value to return to the event handler. Usually it is `return()`iit configures the event handler by calling the setter of the event handler with the current continuationcfinstall a event receiver that wait for a string and trigger the continuation when this string arrives.dvalidates an input entered in the keyboard in non blocking mode. non blocking means that the user can enter also anything else to activate other option unlike cA, wich watch continuously, input only wait for one valid responsee non blocking  with a validatorjwait for the execution of m and return the resultknkeep the main thread running, initiate the non blocking keyboard input and execute the transient computation.@It also read a slash-separated list of string that are read by c and d( as if they were entered by the keyboard 0 foo -p options/to/be/read/by/option/and/inputl same than kJbut do not initiate the asynchronous keyboard input. Useful for debuggingm{force the finalization of the main thread and thus, all the Transient block (and the application if there is no more code)o:alternative operator for maybe values. Used in infix mode|  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{p  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno|/01.-, !"#$%&'()*+{23456789:;<zy=>?xwv u@ tAsBCDErqFGHIJKLMNOPQRSTUpVWXYZ[\]^_`abcdefghijklmno\  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{1 1 1NoneT# ,/01@AHILMNOPQRSTVXYZ`cdklm#/01,kl@cdmXVYZ`RPQSHLMNIO ATNone0 creates an EVar.Evars are event vars. C trigger the execution of all the continuations associated to the 1 of this variable (the code that is after them).It is like the publish-subscribe pattern but without inversion of control, since a readEVar can be inserted at any place in the Transient flow.wEVars are created upstream and can be used to communicate two sub-threads of the monad. Following the Transient philosophy they do not block his own thread if used with alternative operators, unlike the IORefs and TVars. And unlike STM vars, that are composable, they wait for their respective events, while TVars execute the whole expression when any variable is modified.TThe execution continues after the writeEVar when all subscribers have been executed./Now the continuations are executed in parallel.see Yhttps://www.fpcomplete.com/user/agocorona/publish-subscribe-variables-transient-effects-v(delete al the subscriptions for an evar.read the EVar. It only succeed when the EVar is being updated The continuation gets registered to be executed whenever the variable is updated.if readEVar is re-executed in any kind of loop, since each continuation is different, this will register again. The effect is that the continuation will be executed multiple times To avoid multiple registrations, use Qupdate the EVar and execute all readEVar blocks with "last in-first out" priority write the EVar and drop all the  handlers.It is like a combination of  and initialize the event variable for finalization. all the following computations in different threads will share it it also isolate this event from other branches that may have his own finish variable<set a computation to be called when the finish event happens3trigger the event, so this closes all the resourcesZderegister all the finalization actions. A initFinish is needed to register actions againJkill all the processes generated by the parameter when finish event occurs0trigger finish when the stream data return SDoneNonefslurp a list of values and process them in parallel . To limit the number of processing threads, use HMgroup the output of a possible multithreaded process in groups of n elements.0group result for a time interval, measured with Falternative definition with more parallelism, as the composition of n X sentencesexecute a process and get at least the first n solutions (they could be more). if the process end without finding the number of solutions requested, it return the found ones if he find the number of solutions requested, it kill the non-free threads of the process and return It works monitoring the solutions found and the number of active threads. If the first parameter is 0, collect will return all the resultssearch also between two time intervals. If the first interval has passed and there is no result, it stops. After the second interval, it stop unconditionally and return the current results. It also stops as soon as there are enough results specified in the first parameter.None9;ATwrite the result of the computation in the log and return it. but if there is data in the internal log, it read the data from the log and do not execute the computation.!It accept nested step's. The effect is that if the outer step is executed completely the log of the inner steps are erased. If it is not the case, the inner steps are logged this reduce the log of large computations to the minimum. That is a feature not present in the package Workflow.  r <- logged $ do logged this :: TransIO () logged that :: TransIO () logged thatOther liftIO $ print rwhen - is executed, the log is just the value of r. but at the  thatOther$ execution the log is: [Exec,(), ()]None0TStream the input to a fileslurp input from a file a line at a time. It creates as much threads as possible. to allow single threaded processing, use it with `threads 0`is the general operation for processing a streamed input, with opening resources before processing and closing them when finish is called. The process statements suscribe to the  EVar.=When this variable is updated, the close procedure is called.When the processing return  or , the X variable is updated so all the subscribed code, that close the resources, is executed.input computationGopen computation that gives resources to be used during the computation*close computation that frees the resourcesprocess to be doneNone0AT2assures that backtracking will not go further back6the secod parameter will be executed when backtracking:register an action that will be executed when backtracking+restart the flow forward from this point onIexecute backtracking. It execute the registered actions in reverse order.QIf the backtracking flag is changed the flow proceed forward from that point on.8If the backtrack stack is finished or undoCut executed,  will stop.       !"!#$%%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&transient-0.4.2-1s35QZ5PPxLFVnls2RC97MTransient.InternalsTransient.EVarsTransient.IndeterminismTransient.LoggedTransient.Stream.ResourceTransient.BacktrackTransient.BaseToReturn EventSetter StreamDataSMoreSLastSDoneSErrorAdditionalOperators**><**atEnd'<***atEnd RemoteStatus WasRemote WasParallelNoRemoteLogLogElemWaitExecVar LogEntriesCurrentPointerRecoverIDynamicIDynsStateIOEffectsEventFmeffectseventxcompfcompmfData mfSequencethreadIdfreeThparentchildren maxThread TransientIOEventIdSDataTransIO TransientrunTrans runTransient runTransStategetContrunContrunCont'getContinuationscompose runClosurerunContinuationsetContinuationrunContinuations restoreStack readWithErr readsPrec'stop<| setEventContresetEventConttailsafe baseEffects waitQSemB signalQSemBthreads oneThread showThreads addThreads' addThreads freeThreads hookedThreads killChildsgetDatagetSDatasetDatadelDatagenId getPrevId waitEvents waitEvents'asyncspawnparallelloop forkFinally1free hangThread killChildrenreact getLineRefroptionoptioninputgetLine'reads1 inputLoop processLinerexitstaykeepkeep'exitexit' onNothing$fReadSomeException$fMonadIOTransIO$fMonadTransIO$fMonoidTransIO$fAdditionalOperatorsTransIO$fMonadPlusTransIO$fAlternativeTransIO$fReadIDynamic$fShowIDynamic$fApplicativeTransIO$fFunctorTransIO$fMonadStateEventFTransIO $fReadLogElem $fShowLogElem$fEqRemoteStatus$fShowRemoteStatus$fShowStreamData$fReadStreamDataFinish FinishReasonEVarnewEVar cleanEVarreadEVar writeEVar lastWriteEVar initFinishonFinishfinishunFinish killOnFinish checkFinalizechoosegroup groupByTimechoose'collectcollect'LoggablefromIDyntoIDynlogged $fLoggableasinkFile sourceFileprocessundoCutonUndo registerUndoretryundobaseGHC.Base<|> mtl-2.2.1-6qsR1PHUy5lL47Hpoa4jCMControl.Monad.State.Classget System.IOgetLine time-1.6.0.1Data.Time.Clock.UTCDiff diffUTCTimetoDataprint Backtrack backtracking backStack