úÎ…€zīO      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN non-portable experimentallibraries@haskell.org TrustworthyGeneralized version of O. CNote that when the given computation times out any side effects of m are E discarded. When the computation completes within the given time the & side-effects are restored on return.  experimental#Bas van Dijk <v.dijk.bas@gmail.com> Trustworthy Generalized version of P. Generalized version of Q. Generalized version of R. Generalized version of S. Generalized version of T. Generalized version of U. Generalized version of V. Generalized version of W. Generalized version of X. !Note any monadic side effects in m of the " finalizer" computation  are discarded.         experimental#Bas van Dijk <v.dijk.bas@gmail.com> TrustworthyGeneralized version of Y. Generalized version of Z. Generalized version of [. Generalized version of \. Generalized version of ]. Generalized version of ^.  experimental#Bas van Dijk <v.dijk.bas@gmail.com> TrustworthyGeneralized version of _. Generalized version of `. Generalized version of a. Generalized version of b. Generalized version of c. Generalized version of d. Generalized version of e. Generalized version of f. Generalized version of g. Generalized version of h. Generalized version of i. Generalized version of j. !Generalized version of k. "Generalized version of l. #Generalized version of m. !Note any monadic side effects in m of the " finalizer" computation are  discarded.  !"# !"# !"# !"#"non-portable (extended exceptions) experimental#Bas van Dijk <v.dijk.bas@gmail.com> Trustworthy$Generalized version of n. &Generalized version of o. 'Generalized version of p. (Generalized version of q. )Generalized version of r. ANote, when the given computation throws an exception any monadic  side effects in m will be discarded. *Generalized version of s. ANote, when the given computation throws an exception any monadic  side effects in m will be discarded. +Generalized version of t. ANote, when the given computation throws an exception any monadic  side effects in m will be discarded. ,Generalized version of u. ANote, when the given computation throws an exception any monadic  side effects in m will be discarded. -Generalized version of v. ANote, when the given computation throws an exception any monadic  side effects in m will be discarded. .Generalized version of w. ANote, when the given computation throws an exception any monadic  side effects in m will be discarded. /Generalized version of x. ANote, when the given computation throws an exception any monadic  side effects in m will be discarded. 0Generalized version of y. 1Generalized version of z. 2Generalized version of {. 3Generalized version of |. 4Generalized version of }. 5Generalized version of ~. 6Generalized version of . 7Generalized version of €. Note:  When the "acquire" or "release" computations throw exceptions  any monadic side effects in m will be discarded.  When the " in-between"% computation throws an exception any  monadic side effects in m& produced by that computation will be ) discarded but the side effects of the "acquire" or "release" " computations will be retained. # Also, any monadic side effects in m of the "release" > computation will be discarded; it is run only for its side  effects in IO. Note that when your acquire and release computations are of type  % it will be more efficient to write: ‚ (€ acquire release)8Generalized version of ƒ. !Note any monadic side effects in m of both the "acquire" and  "release"5 computations will be discarded. To keep the monadic  side effects of the "acquire" computation, use 7 with  constant functions instead. Note that when your acquire and release computations are of type  % it will be more efficient to write: „ (ƒ acquire release)9Generalized version of …. Note:  When the "acquire" or "release" computations throw exceptions  any monadic side effects in m will be discarded.  When the " in-between"% computation throws an exception any  monadic side effects in m& produced by that computation will be ) discarded but the side effects of the "acquire" computation  will be retained. # Also, any monadic side effects in m of the "release" > computation will be discarded; it is run only for its side  effects in IO. Note that when your acquire and release computations are of  type % it will be more efficient to write: ‚ (… acquire release):Generalized version of †. "Note, any monadic side effects in m of the " afterward"  computation will be discarded. ;Generalized version of ‡. "Note, any monadic side effects in m of the " afterward"  computation will be discarded. $%&'()The computation to run ,Handler to invoke if an exception is raised *+Predicate to select exceptions Computation to run Handler ,-ˆ./01‰234567computation to run first ("acquire resource") computation to run last ("release resource") computation to run in-between 8computation to run first ("acquire resource") computation to run last ("release resource") computation to run in-between 9computation to run first ("acquire resource") computation to run last ("release resource") computation to run in-between :computation to run first ?computation to run afterward (even if an exception was raised) ;OŠ‹ŒŽ‘’“”•–—˜™š›œžŸ ĄĒĢĪĨĶ§ĻĐŠŦŽ­ŪŊ°ąēģīĩķ·ļđšŧž―ūŋĀ$%&'()*+,-./0123456789:;&'()*$%+,-./0123456789:;$%&'()*+,-ˆ./01‰23456789:; experimental#Bas van Dijk <v.dijk.bas@gmail.com> Trustworthy<Generalized version of Á. =Generalized version of Â. (Note that, while the forked computation m () has access to the captured  state, all its side-effects in m' are discarded. It is run only for its  side-effects in . >Generalized version of Ã. (Note that, while the forked computation m () has access to the captured  state, all its side-effects in m' are discarded. It is run only for its  side-effects in . ?Generalized version of Ä.  Note that in forkFinally action and_then, while the forked  action and the and_then& function have access to the captured " state, all their side-effects in m are discarded. They're run  only for their side-effects in . @Generalized version of Å. AGeneralized version of Æ. (Note that, while the forked computation m () has access to the captured  state, all its side-effects in m' are discarded. It is run only for its  side-effects in . BGeneralized version of Į. (Note that, while the forked computation m () has access to the captured  state, all its side-effects in m' are discarded. It is run only for its  side-effects in . CGeneralized version of Č. DGeneralized version of É. EGeneralized version of Ę. FGeneralized version of Ë. GGeneralized version of Ė. HGeneralized version of Í. IGeneralized version of Î. JGeneralized version of Ï. (Note that, while the forked computation m () has access to the captured  state, all its side-effects in m' are discarded. It is run only for its  side-effects in . KGeneralized version of Ð. LGeneralized version of Ņ. MGeneralized version of Ō. NGeneralized versio of Ó. <=>?@ABCDEFGHIJKLMN- !"#(<=>?@ABCDEFGHIJKLMN<=>?@(ABCDEFGHIJKLMN<=>?@ABCDEFGHIJKLMNÔ      !"#$%&'()*+,-./01123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\\\      !"#$%]&]'()*]+],]-].]/]0^1_2`3 4a5^6a7a8a9a:a;_<_=_>_?_@_A^BaCbcdefgaDefhaEaFaGijklamananaoaoapapaqaqararasasatat`u`u`v`v`w`w`x`x`y`z`{`|`}`~``€__‚_ƒ_„_…_†_‡`ˆ‰Š‰‹‰‹‰Œ‰‰Ž‰‰‰‰‘‰’‰“‰”‰•‰– H — ˜K L M N O P Q R™STUVWXY Zšlifted-base-0.2.1.0Control.Concurrent.LiftedControl.Concurrent.Chan.LiftedData.IORef.LiftedControl.Concurrent.MVar.LiftedSystem.Timeout.LiftedControl.Exception.LiftedbaseControl.ConcurrentrtsSupportsBoundThreadsControl.Concurrent.ChanChan GHC.Conc.SyncThreadId GHC.IORefIORefGHC.MVarMVartimeoutnewIORef readIORef writeIORef modifyIORefatomicModifyIORef modifyIORef'atomicModifyIORef'atomicWriteIORef mkWeakIORefnewChan writeChanreadChandupChangetChanContentswriteList2Chan newEmptyMVarnewMVartakeMVarputMVarreadMVarswapMVar tryTakeMVar tryPutMVar isEmptyMVarwithMVar modifyMVar_ modifyMVarmodifyMVarMasked_modifyMVarMasked mkWeakMVarHandlerthrowIOioErrorthrowTocatchcatches catchJusthandle handleJusttrytryJustevaluatemaskmask_uninterruptibleMaskuninterruptibleMask_getMaskingStateallowInterruptbracketbracket_bracketOnErrorfinally onException myThreadIdforkforkWithUnmask forkFinally killThreadforkOnforkOnWithUnmaskgetNumCapabilitiessetNumCapabilitiesthreadCapabilityyield threadDelaythreadWaitReadthreadWaitWriteforkOSisCurrentThreadBoundrunInBoundThreadrunInUnboundThreadmkWeakThreadIdSystem.Timeout Data.IORefControl.Concurrent.MVarControl.ExceptionGHC.IOGHC.IO.ExceptionControl.Exception.Baseghc-prim GHC.TypesIOmonad-control-0.3.2.1Control.Monad.Trans.Control liftBaseOp liftBaseOp_sequenceEither liftRestoreGHC.Baseassert mapExceptionPatternMatchFail RecSelError RecConError RecUpdError NoMethodErrorNonTerminationNestedAtomicallyBlockedIndefinitelyOnMVarBlockedIndefinitelyOnSTMDeadlockAssertionFailed StackOverflow HeapOverflow ThreadKilled UserInterruptAsyncExceptionIndexOutOfBoundsUndefinedElementArrayExceptionblockedunblockblockUnmaskedMaskedInterruptibleMaskedUninterruptible MaskingState IOException GHC.Exceptionthrow SomeException fromException toException Exception ErrorCallOverflow UnderflowLossOfPrecision DivideByZeroDenormalRatioZeroDenominatorArithExceptionforkIOforkIOWithUnmask GHC.Conc.IO