HOOG''_C$!#eg'+/1KLOO23:>a#!!##%(*,./12446689BBFFSSWXZZabddffjmoortv|b)llc !((*7JJXX__d  "#(),,448>KPXXZZ\_bbklwwe! !$(,-348:<<>GIJSSWXZbddklnnttw}f 88CDHW^^egppg99BBUUWY[[aahhnnpph*,44>>CCJJXZbbegklnnwwi!'),,//>>BBEEHIQRUUXY[koosuww||jk !%(QRkkqql  !)),-3588>@HPWXZZ``bbeeggkqtt}m  $$++./1166<<?ETUddjjry}}n #'(,,/5:;BEJJRRUVXXZbhhnnuuxo#'(--07:;=>BEJRTUXY[[]^pq|}p% $$&(./1267<?AACDIIKPTTVVXY^^cdjjnnquxx}qFFr#!!#(,,./4799<>BFIIO[]]adfhkloov|s$  #++--346799@@BBGGJJSSUUWW__bbdhoottzzt( #$'(*+//135588<<AACEGGIISSUYbbdhklnottwxz}u "$))89<<BDJJVYqqsu~v33EEddvvxy{|w ;;>>YYx|x GGXX\^ijsty ##./AAFFSSddmmoowxzzz SSmmtts8+~!yW!% ()S BlockReasonFBoolBChar> ConsoleEventIntIntegerOrderingSTMTVarThreadId ThreadStatus[::]FunctorMonadShowOrdEqShowEqOrdTypeable Typeable1 Typeable1FunctorMonadIxIxIxReadShowEnumOrdEqTypeableIxIxShowOrdEqIx[IPrg(,)IntInt(k![7!a bvcd5efIhi(lmno9prs=t w#ordWord#Word#Wordhvy1p8e?aFbMlTe[Typeable1r Typeable1arTVar#TVar#readbdfifr*statu s ThreadStatusu1n8n?iFnMgT ThreadStatusdmThreadId# ThreadId#inished ThreadStatusied ThreadStatuslocke$d+ ThreadStatushjotNSTamrieiun|gStringpSTRepSTMrte#State#raySTArraym eex"c)e0p7t>iEoLnS SomeExceptionouvt}down ConsoleEventwShoweadlworld RealWorldReadt%r,Ptrr@dGOrdeYr`ignnguOrderingumNumaouvarMVar#MVar#table aqbyt%e,a3r:rAaHyO#VMutableByteArray#rxray# MutableArray#nadMonadybeMaybeogoff ConsoleEventgnopsTxHIxs[tbriipnwg~IsStringrIPrIOtInt#Int#noreHandlerandle#Handler8HandlerduUn\cphtorvFunPtrtorFunctorFdnq xception ExceptionEqu m'Enume]oAwHnODownfdakurlytHandleraTl-onstrolc ConsoleEventoleeve nt ConsoleEvento4s;eB ConsoleEventt[cbhiHandlerloreak ConsoleEventolBoolocke#reason BlockReasond*o1n8bj e! fmowsXt_mf BlockReasont~her BlockReasonvar BlockReasonoreignca l l  BlockReasonx( c/ e6 p= tD iK oR nY  BlockReasonlq ax c k h o l e  BlockReasond!r r a o w Arrowy Array#!Array#d!r!!#(!Addr#:O!]C![]:V!]]![::])r!()! k* *))r)%&%%$t$($F" BlockReason BoolyNF ConsoleEvent Handler IntO6& Int#gOrderingThreadIdo ThreadStatusY WordqWord#pa zjZURQPb}e('()IO ConsoleEventMVar()IO SomeExceptionIOeisSTArray()sST:8asSTRep3biArraybsSTRepcaarrVeiArray ~#!esST97ii(,)4eisSTArraysST eiArraysST5eiArraysSTRep()IO nmkh_\[0-()STMA=;BoolIO1. ConsoleEventMaybeuHandlerIO]IntIO)Int[::]ThreadIdIO`* ThreadStatusIOlaDownraFunPtrWaIOi</aMVar2aPtrXaSTM@?>+aTVarBa[::] |{xfbTJIEa[]MbMaybewb[::]c[::]d[::]e[::]cHGe[]$i[]%cba(,,)[::]LIntInt(,)IOedba(,)[::]SKei(,)[]"c[::]b[::]a[::](,,)Da[::]a[::](,)ab[::]a[::](,)CBoolTVarIO^String[]IOaMVarIOsaMaybeIO,aTVarIOtaTVarSTMva[][]+Y87}7l4111.-G-,(,,+bbbbadcbaaaaababbacbaeaeeeeBoolabaji()IO ConsoleEvent()IO SomeExceptionaSTM SomeException?b[::]aSa RealWorldState#(#,#) RealWorldState#Addr#XW BlockReasonYBoolZFd[Handle\Handler]Int~feeeedddccba`_^P87'Int#pgg SomeExceptionihStringmjThreadIdnmlk ThreadId#oWord#qpa}|||{{zyxwvutsrfZA10b}en:8i ~~:9(IntIOaPtrFunPtr)eisSTArray:987654aInt(,)a RealWorldMVar#2a RealWorldTVar#Baa(,)aiArrayasSTRep3baarrVbsSTRepcbarrVeInt(,)3eIntArrayeiArray('&%$#"! ejArrayes MutableArray#3ii(,) ()IO`-*BoolSTM;Bool[::]FInt[::]HG RealWorldMutableByteArray#eaIO+aMVar10/.-,aPtrd)aSTM?>>=<aTVarA@a[::]ybaSRQPONMLKJJIa[]UTb[::]LKc[::]LeArray#~e[::]cHHGe[]cba(,,)[::]DaInt(,)[]ai(,)[]ba(,)[::]wCeInt(,)[]!ei(,)[]#a[::][::]ECCCyCnCcCXCMCBC#CBBBBBBBBpB^BNB>B.BBBAAAAAAAyAiAYAIA9A)AA A@@@@@@@@@@@@u@a@V@F@6@&@@ @@???????????t?i?^?O?D?9?.?#???>>>>>>>>>x>m>b>W>L>A>6>'>> >=========|=q=b=W=L=A=6=%== =<<<<<<<<<t<i<^<S<D<9<&<<<;;;;;;;;;;z;j;Z;O;?;/;;; ;::"2VSIxiIxiIxi IxiIxiXUOrdbbOrdb|IxiTWHQg/:3CIxiMEnumaNEnuma0ivIEqa{EqaNumaE Exceptioneut]IsStringa5nop GZkR1_ ArrowarrEqa@}OrdaNuma w\A F,;4!IxiIxiIxiIxi[Ixi+PmYIxiIxiIxihIxiJIxi IxiIxiIxiIxi8IxiOrdeOEqeIxi*Ixi9OrdesIxiIxjIxiIxiIxiIxixIxiIxiIxifShowaeIxajIxaIxaIxa~Bd -.67>?yz#$%&'(KaL`______v_J_2___^^^^^k^G^/^ ^]]]]i]O];] ]\\\Y\5\\[[[[[e[=['[[ZZZZyZeZEZ+ZZYYYYkYQY=Y%YYXXXXXQX'XXWWWWWcWKW1WWWVVVVwVaVAV%VVUUUqU[U;UUUTTTTwT[T=TTTSSSSSmSOS3SSSRRRRqRMR3RRQQQQQ]Q-QQQPPPPP{PaPKP-P POOOOUO?O#OONNNN{N9NNNMMMMyM]M?M)MMLLLLLiLGL'LKKKK[K1KKKJJJyJWJ+JIIIIiIGI!IHHHuHEH+HHHGGG{GeGOG;GGGzipwithpGzipWithP zipwith3p+G zipWith3PzippDGzipPzip3pYGzip3PyieldoGyield writetvarG writeTVar writestarrayG writeSTArraywordGWordwin32consolehandlerGwin32ConsoleHandlerw# HW#unzippHunzipPunzip3p7Hunzip3Punsafewritestarray\HunsafeWriteSTArrayunsafethawstarrayHunsafeThawSTArray unsafereplaceH unsafeReplaceunsafereadstarrayHunsafeReadSTArrayunsaferangesize IunsafeRangeSize unsafeiotostm3I unsafeIOToSTM unsafeindexWI unsafeIndexunsafefreezestarrayIunsafeFreezeSTArrayunsafeatIunsafeAt unsafearray'I unsafeArray' unsafearrayI unsafeArrayunsafeaccumarray'JunsafeAccumArray'unsafeaccumarray@JunsafeAccumArray unsafeaccumgJ unsafeAccumtvarJTVar trytakemvarJ tryTakeMVar tryputmvarJ tryPutMVartowin32consoleeventJtoWin32ConsoleEventtop KtoPthrowto#KthrowTothreadwaitwriteEKthreadWaitWritethreadwaitreadnKthreadWaitRead threadstatusK ThreadStatus threadStatus threadrunningK ThreadRunningthreadidKThreadIdthreadfinishedLThreadFinished threaddied6L ThreadDied threaddelayWL threadDelay threadblocked{L ThreadBlockedtheLthe thawstarrayL thawSTArray takewhilepL takeWhilePtakepLtakePtakemvarMtakeMVarsumpMsumPstm1MSTMstarrayKMSTArraysplitatpjMsplitAtPspanpMspanPsortwithMsortWithslicepMsliceP singletonpM singletonPshutdownMShutdownshiftrl#NshiftRL#shiftl#+NshiftL#setuncaughtexceptionhandlerYNsetUncaughtExceptionHandlerscanrpNscanrPscanr1pNscanr1PscanlpNscanlPscanl1pNscanl1P saferangesizeN safeRangeSize safeindexO safeIndexreversep0OreversePretryIOretryreportstackoverflowmOreportStackOverflow reporterrorO reportError replicatepO replicateP registerdelayO registerDelayreadtvarOreadTVar readstarrayP readSTArray rangesize;P rangeSizerangeUPrangeputmvarmPputMVarptrPPtrpseqPpseqproductpPproductPpermutepPpermutePparrPPArrparPparorp QorPorelse QorElsenumelementsstarrayDQnumElementsSTArray numelementsmQ numElementsnumcapabilitiesQnumCapabilitiesnullpQnullPnotelempQnotElemP newtvarioQ newTVarIOnewtvarRnewTVar newstarray"R newSTArraynewmvar?RnewMVar newemptymvar^R newEmptyMVar mythreadidR myThreadIdmvarRMVarminimumpRminimumP maxtuplesizeR maxTupleSize~maximumpRmaximumP}mappSmapP|lookupp%SlookupP{logoff>SLogoffyz listarray]S listArrayxlengthpySlengthPwlazySlazyv labelthreadS labelThreadu killthreadS killThreadtixmapSixmapsixSIxrisstringTIsStringq ishiftrl#-T iShiftRL#p ishiftra#KT iShiftRA#oishiftl#hTiShiftL#n isemptymvarT isEmptyMVarmiprTIPrlinstallhandlerTinstallHandlerkinrangeTinRangejinlineTinlineiindicesUindiceshindexofp,UindexOfPg indexerrorJU indexErrorfindexeUindexeignore|UIgnoredhandlerUHandlerc groupwithU groupWithbgetuncaughtexceptionhandlerUgetUncaughtExceptionHandlera getfullargsV getFullArgs`funptr0VFunPtr^_ fromstringPV fromString]frompkVfromP\ freezestarrayV freezeSTArray[forkonioVforkOnIOZforkioVforkIOYfoldrpVfoldrPXfoldr1pVfoldr1PWfoldp WfoldPVfoldlp$WfoldlPUfoldl1p=Wfoldl1PTfold1pVWfold1PS flushconsoletW flushConsoleRfilterpWfilterPQfillWfillPextsWExtseqarrayWeqArrayO environmentW Environment enumfromtopX enumFromToPNenumfromthentop;XenumFromThenToPMensureiomanagerisrunningnXensureIOManagerIsRunningLemptypXemptyPKelemsXelemsJelempXelemPI dropwhilepX dropWhilePHdroppXdropPG dpermutepY dpermutePFdown.YDownDEdoneFYdoneCdesugar]YDesugardefaultwYDefaultBcrosspYcrossPA crossmappY crossMapP@controlcYControlC>?consolehandlerYConsoleHandler consoleeventZ ConsoleEvent<=concatp7ZconcatP; concatmappTZ concatMapP:concnZConc cmpintarrayZ cmpIntArray9cmparrayZcmpArray8closeZClose67 childhandlerZ childHandler5catchstm[catchSTM4catch[Catch3build1[build2breakpointcondP[breakpointCond1 breakpointt[ breakpoint0breakp[breakP/break[Break-. bpermutep[ bpermuteP, boundsstarray[ boundsSTArray+bounds\bounds* blockreason#\ BlockReason) blockedonstmF\ BlockedOnSTM(blockedonotherl\BlockedOnOther' blockedonmvar\ BlockedOnMVar&blockedonforeigncall\BlockedOnForeignCall%blockedonexception\BlockedOnException$blockedonblackhole"]BlockedOnBlackHole#baseD]baseaugment[]augment" atomicallyx] atomically! asyncwriteba] asyncWriteBA asyncwrite] asyncWrite asyncreadba] asyncReadBA asyncread] asyncRead asyncdoproc^ asyncDoProcassocs:^assocs arrelebottomX^ arrEleBottomarrayu^Arrayarrayarr^Arranyp^anyPandp^andPamap^amapalwayssucceeds^alwaysSucceedsalways_alwaysallp'_allPadjust=_adjustaddmvarfinalizer__addMVarFinalizer accumarray_ accumArrayaccum_accum >>>_>>> //_// +:+_+:+ !:_!: !_!;'&&%%g%$$$#:# >-B_    g n   'x1p&p-G:r+JHH>$h`.rJ;:jie4׼b X {3dnίMc"Ϋfqel0Ġ`ʟPʞ6pA]R$^bT 0O΅D{}%}|D{yAyxwwuMuttMsrnnXmlk,kjii$ihg[g;fee>dczipWithP zipWithP ::  (a -> b -> c) -> [:a:] -> [:b:] -> [:c:]:d dabc[::]a[::]b[::]c zipWith3P  zipWith3P :: (a -> b -> c -> d) -> [:a:] -> [:b:] -> [:c:] -> [:d:]edabcd[::]a[::]b[::]c[::]dzipPzipP :: [:a:] -> [:b:] ->  [:(a, b):]e]e[::]a[::]b[::](,)abzip3P zip3P :: [:a:] -> [:b:] -> [:c:] ->  [:(a, b, c):]7fe[::]a[::]b[::]c[::](,,)abcyieldyield :: IO ()vfkfIO()The yield action allows (forces, in a co-operative multitasking implementation) a context-switch to any other currently runnable threads (if any), and is occasionally useful when implementing concurrency abstractions.  writeTVar writeTVar :: TVar a -> a -> STM ()ggTVaraaSTM()%Write the supplied value into a TVar  writeSTArray  writeSTArray :: Ix i =>  STArray s i e -> i -> e -> ST s ()hshIxiSTArraysieieSTs()Worddata WordhNA Word is an unsigned integral type, with the same size as Int. win32ConsoleHandlerwin32ConsoleHandler :: MVar (ConsoleEvent -> IO ())iiMVar ConsoleEventIO()W#W# :: Word# -> WordiiWord#WordunzipPunzipP ::  [:(a, b):] -> ([:a:], [:b:])jMj[::](,)ab(,)[::]a[::]bunzip3Punzip3P ::  [:(a, b, c):] -> ([:a:], [:b:], [:c:])(kj[::](,,)abc(,,)[::]a[::]b[::]cunsafeWriteSTArray unsafeWriteSTArray :: Ix i =>  STArray s i e -> Int -> e -> ST s ()kkIxiSTArraysieInteSTs()unsafeThawSTArrayunsafeThawSTArray :: Ix i =>  Array i e -> ST s (STArray s i e)lblIxiArrayieSTsSTArraysie unsafeReplace unsafeReplace :: Ix i =>  Array i e ->  [(Int, e)] ->  Array i eTmmIxiArrayie[](,)InteArrayieunsafeReadSTArrayunsafeReadSTArray :: Ix i =>  STArray s i e -> Int -> ST s enmIxiSTArraysieIntSTseunsafeRangeSizeunsafeRangeSize :: Ix a => (a, a) -> IntnbnIxa(,)aaInt unsafeIOToSTM unsafeIOToSTM :: IO a -> STM annIOaSTMaUnsafely performs IO in the STM monad. Beware: this is a highly dangerous thing to do.  unsafeIndex unsafeIndex :: Ix a => (a, a) -> a -> IntIs(sIxa(,)aaaIntunsafeFreezeSTArrayunsafeFreezeSTArray :: Ix i =>  STArray s i e -> ST s (Array i e)ssIxiSTArraysieSTsArrayieunsafeAtunsafeAt :: Ix i =>  Array i e -> Int -> et_tIxiArrayieInte unsafeArray'  unsafeArray' :: Ix i => (i, i) -> Int ->  [(Int, e)] ->  Array i eIuuIxi(,)iiInt[](,)InteArrayie unsafeArray unsafeArray :: Ix i => (i, i) ->  [(Int, e)] ->  Array i euuIxi(,)ii[](,)InteArrayieunsafeAccumArray'unsafeAccumArray' :: Ix i =>  (e -> a -> e) -> e -> (i, i) -> Int ->  [(Int, a)] ->  Array i evvIxieaee(,)iiInt[](,)IntaArrayieunsafeAccumArray unsafeAccumArray :: Ix i =>  (e -> a -> e) -> e -> (i, i) ->  [(Int, a)] ->  Array i ewwIxieaee(,)ii[](,)IntaArrayie unsafeAccum  unsafeAccum :: Ix i =>  (e -> a -> e) ->  Array i e ->  [(Int, a)] ->  Array i ex~xIxieaeArrayie[](,)IntaArrayieTVarTVar :: TVar# RealWorld a -> TVar a=yyTVar# RealWorldaTVaraTVardata TVar akyAShared memory locations that support atomic memory transactions.  tryTakeMVar tryTakeMVar :: MVar a ->  IO (Maybe a)%zzMVaraIOMaybeaA non-blocking version of takeMVar. The tryTakeMVar function returns immediately, with Nothing if the MVar was empty, or Just a if the MVar was full with contents a. After tryTakeMVar, the MVar is left empty.  tryPutMVar tryPutMVar :: MVar a -> a -> IO Bool{{MVaraaIOBoolA non-blocking version of putMVar. The tryPutMVar function attempts to put the value a into the MVar, returning True if it was successful, or False otherwise. toWin32ConsoleEventtoWin32ConsoleEvent ::  Num a => a -> Maybe ConsoleEvent!}|NumaaMaybe ConsoleEventtoPtoP :: [a] -> [:a:]w}`}[]a[::]athrowTothrowTo :: Exception e => ThreadId -> e -> IO () ~} ExceptioneThreadIdeIO()7throwTo raises an arbitrary exception in the target thread (GHC only). throwTo does not return until the exception has been raised in the target thread. The calling thread can thus be certain that the target thread has received the exception. This is a useful property to know when dealing with race conditions: eg. if there are two threads that can kill each other, it is guaranteed that only one of the threads will get to kill the other. If the target thread is currently making a foreign call, then the exception will not be raised (and hence throwTo will not return) until the call has completed. This is the case regardless of whether the call is inside a block or not. Important note: the behaviour of throwTo differs from that described in the paper "Asynchronous exceptions in Haskell" (http://research.microsoft.com/~simonpj/Papers/asynch-exns.htm). In the paper, throwTo is non-blocking; but the library implementation adopts a more synchronous design in which throwTo does not return until the exception is received by the target thread. The trade-off is discussed in Section 8 of the paper. Like any blocking operation, throwTo is therefore interruptible (see Section 4.3 of the paper). There is currently no guarantee that the exception delivered by throwTo will be delivered at the first possible opportunity. In particular, if a thread may unblock and then re-block exceptions (using unblock and block) without receiving a pending throwTo. This is arguably undesirable behaviour. threadWaitWritethreadWaitWrite :: Fd -> IO ()FdIO()\Block the current thread until data can be written to the given file descriptor (GHC only). threadWaitReadthreadWaitRead :: Fd -> IO ()hWFdIO()bBlock the current thread until data is available to read on the given file descriptor (GHC only).  threadStatus threadStatus :: ThreadId -> IO ThreadStatusK*ThreadIdIO ThreadStatus ThreadStatusdata  ThreadStatusThe current status of a thread  ThreadRunning ThreadRunning ::  ThreadStatus ThreadStatus,the thread is currently runnable or running ThreadIdThreadId ::  ThreadId# -> ThreadId~ ThreadId#ThreadIdThreadIddata ThreadIdʇ?A ThreadId is an abstract type representing a handle to a thread. ThreadId is an instance of Eq, Ord and Show, where the Ord instance implements an arbitrary total ordering over ThreadIds. The Show instance lets you convert an arbitrary-valued ThreadId to string form; showing a ThreadId value is occasionally useful when debugging or diagnosing the behaviour of a concurrent program. Note: in GHC, if you have a ThreadId, you essentially have a pointer to the thread itself. This means the thread itself can't be garbage collected until you drop the ThreadId. This misfeature will hopefully be corrected at a later date. Note: Hugs does not provide any operations on other threads; it defines ThreadId as a synonym for (). ThreadFinishedThreadFinished ::  ThreadStatuseV ThreadStatusthe thread has finished  ThreadDied ThreadDied ::  ThreadStatusы‹ ThreadStatus*the thread received an uncaught exception  threadDelay threadDelay :: Int -> IO ()\JIntIO()Suspends the current thread for a given number of microseconds (GHC only). There is no guarantee that the thread will be rescheduled promptly when the delay has expired, but the thread will never continue to run earlier than specified.  ThreadBlocked ThreadBlocked ::  BlockReason ->  ThreadStatusЍ BlockReason ThreadStatus'the thread is blocked on some resource thethe :: Eq a => [a] -> aR:Eqa[]aahthe ensures that all the elements of the list are identical and then returns that unique element  thawSTArray thawSTArray :: Ix i =>  Array i e -> ST s (STArray s i e)^&IxiArrayieSTsSTArraysie takeWhileP takeWhileP ::  (a -> Bool) -> [:a:] -> [:a:]ďaBool[::]a[::]atakePtakeP :: Int -> [:a:] -> [:a:]Z<Int[::]a[::]atakeMVartakeMVar :: MVar a -> IO aMVaraIOaReturn the contents of the MVar. If the MVar is currently empty, takeMVar will wait until it is full. After a takeMVar, the MVar is left empty. There are two further important properties of takeMVar: sumPsumP ::  Num a => [:a:] -> aœNuma[::]aaSTMSTM :: /(State# RealWorld -> (# State# RealWorld, a #)) -> STM aKState# RealWorld(#,#)State# RealWorldaSTMaSTMnewtype STM a/A monad supporting atomic memory transactions. STArray STArray :: i -> i -> Int -> MutableArray# s e ->  STArray s i etiiInt MutableArray#seSTArraysieSTArraydata STArray s i e;Mutable, boxed, non-strict arrays in the ST monad. The type arguments are as follows: splitAtPsplitAtP :: Int -> [:a:] -> ([:a:], [:a:])Int[::]a(,)[::]a[::]aspanPspanP ::  (a -> Bool) -> [:a:] -> ([:a:], [:a:])NaBool[::]a(,)[::]a[::]asortWithsortWith ::  Ord b => (a -> b) -> [a] -> [a]٘Ordbab[]a[]aThe sortWith function sorts a list of elements using the user supplied function to project something out of each element sliceP sliceP :: Int -> Int -> [:e:] -> [:e:]IntInt[::]e[::]e singletonP singletonP :: a -> [:a:]=,a[::]aShutdownShutdown ::  ConsoleEvent~ ConsoleEventShutdownShutdown ::  ConsoleEventݚΚ ConsoleEventshiftRL#shiftRL# :: Word# -> Int# -> Word#O8Word#Int#Word#WShift the argument right by the specified number of bits (which must be non-negative). shiftL#shiftL# :: Word# -> Int# -> Word#Word#Int#Word#VShift the argument left by the specified number of bits (which must be non-negative). setUncaughtExceptionHandlersetUncaughtExceptionHandler :: (SomeException -> IO ()) -> IO () SomeExceptionIO()IO()scanrP scanrP ::  (a -> b -> b) -> b -> [:a:] -> [:b:]abbb[::]a[::]bscanr1Pscanr1P ::  (a -> a -> a) -> [:a:] -> [:a:]2aaa[::]a[::]ascanlP scanlP ::  (a -> b -> a) -> a -> [:b:] -> [:a:]ƞabaa[::]b[::]ascanl1Pscanl1P ::  (a -> a -> a) -> [:a:] -> [:a:]L(aaa[::]a[::]a safeRangeSize safeRangeSize :: Ix i => (i, i) -> IntƟIxi(,)iiInt safeIndex  safeIndex :: Ix i => (i, i) -> Int -> i -> Int\6Ixi(,)iiIntiIntreversePreverseP :: [:a:] -> [:a:][::]a[::]aretryretry :: STM aSTMa-Retry execution of the current memory transaction because it has seen values in TVars which mean that it should not continue (e.g. the TVars represent a shared buffer that is now empty). The implementation may block the thread until one of the TVars that it has read from has been udpated. (GHC only) reportStackOverflowreportStackOverflow :: IO a{IOa reportError reportError ::  SomeException -> IO aݢ SomeExceptionIOa replicateP replicateP :: Int -> a -> [:a:]hRInta[::]a registerDelay registerDelay :: Int -> IO (TVar Bool)ģIntIOTVarBoolSet the value of returned TVar to True after a given number of microseconds. The caveats associated with threadDelay also apply. readTVarreadTVar :: TVar a -> STM aŤTVaraSTMa*Return the current value stored in a TVar  readSTArray readSTArray :: Ix i =>  STArray s i e -> i -> ST s e^IxiSTArraysieiSTse rangeSize rangeSize :: Ix a => (a, a) -> IntIxa(,)aaIntrangerange :: Ix a => (a, a) -> [a]mKIxa(,)aa[]aputMVarputMVar :: MVar a -> a -> IO ()ߦĦMVaraaIO()Put a value into an MVar. If the MVar is currently full, putMVar will wait until it becomes empty. There are two further important properties of putMVar: PtrPtr :: Addr# -> Ptr aAddr#PtraPtrdata Ptr aA value of type Ptr a represents a pointer to an object, or an array of objects, which may be marshalled to or from Haskell values of type a. The type a will often be an instance of class Foreign.Storable.Storable which provides the marshalling operations. However this is not essential, and you can provide your own operations to access the pointer. For example you might write small foreign functions to get or set the fields of a C struct. pseqpseq :: a -> b -> babbproductPproductP ::  Num a => [:a:] -> anNuma[::]aapermutePpermuteP :: [:Int:] -> [:e:] -> [:e:] [::]Int[::]e[::]eparpar :: a -> b -> b_SabborPorP :: [:Bool:] -> Bool[::]BoolBoolorElseorElse :: STM a -> STM a -> STM a2STMaSTMaSTMaCompose two alternative STM actions (GHC only). If the first action completes without retrying then it forms the result of the orElse. Otherwise, if the first action retries, then the second action is tried in its place. If both actions retry then the orElse as a whole retries. numElementsSTArraynumElementsSTArray ::  STArray s i e -> IntʯSTArraysieInt numElements numElements :: Ix i =>  Array i e -> IntE%IxiArrayieInt%The number of elements in the array. numCapabilitiesnumCapabilities :: IntIntthe value passed to the +RTS -N flag. This is the number of Haskell threads that can run truly simultaneously at any given time, and is typically set to the number of physical CPU cores on the machine. nullPnullP :: [:a:] -> Boolͱ[::]aBoolnotElemPnotElemP :: Eq a => a -> [:a:] -> Bool`@Eqaa[::]aBool newTVarIO newTVarIO :: a ->  IO (TVar a)ƲaIOTVaraIO version of newTVar. This is useful for creating top-level TVars using System.IO.Unsafe.unsafePerformIO, because using atomically inside System.IO.Unsafe.unsafePerformIO isn't possible. newTVarnewTVar :: a ->  STM (TVar a)aSTMTVara+Create a new TVar holding a value supplied  newSTArray newSTArray :: Ix i => (i, i) -> e -> ST s (STArray s i e)ܴIxi(,)iieSTsSTArraysienewMVarnewMVar :: a ->  IO (MVar a)>'aIOMVara9Create an MVar which contains the supplied value.  newEmptyMVar newEmptyMVar ::  IO (MVar a)ѵIOMVara0Create an MVar which is initially empty.  myThreadId myThreadId ::  IO ThreadIdVEIOThreadId>Returns the ThreadId of the calling thread (GHC only). MVarMVar :: MVar# RealWorld a -> MVar a MVar# RealWorldaMVaraMVardata MVar a7An MVar (pronounced "em-var") is a synchronising variable, used for communication between concurrent threads. It can be thought of as a a box, which may be empty or full. minimumPminimumP ::  Ord a => [:a:] -> aT9Orda[::]aa maxTupleSize maxTupleSize :: IntIntmaximumPmaximumP ::  Ord a => [:a:] -> aOrda[::]aamapPmapP :: (a -> b) -> [:a:] -> [:b:]}\ab[::]a[::]blookupPlookupP :: Eq a => a ->  [:(a, b):] -> Maybe bEqaa[::](,)abMaybebLogoffLogoff ::  ConsoleEvent^O ConsoleEventLogoffLogoff ::  ConsoleEvent ConsoleEvent listArray listArray :: Ix i => (i, i) -> [e] ->  Array i eDIxi(,)ii[]eArrayieNConstruct an array from a pair of bounds and a list of values in index order. lengthPlengthP :: [:a:] -> Intٻ[::]aIntlazylazy :: a -> a0'aaThe call '(lazy e)' means the same as e, but lazy has a magical strictness property: it is lazy in its first argument, even though its semantics is strict.  labelThread labelThread :: ThreadId -> String -> IO ()X9ThreadIdStringIO()labelThread stores a string as identifier for this thread if you built a RTS with debugging support. This identifier will be used in the debugging output to make distinction of different threads easier (otherwise you only have the thread state object's address in the heap). Other applications like the graphical Concurrent Haskell Debugger (http://www.informatik.uni-kiel.de/~fhu/chd/) may choose to overload labelThread for their purposes as well.  killThread killThread :: ThreadId -> IO ()ThreadIdIO()killThread terminates the given thread (GHC only). Any work already done by the thread isn't lost: the computation is suspended until required by another thread. The memory used by the thread will be garbage collected if it isn't referenced from anywhere. The killThread function is defined in terms of throwTo: 
killThread tid = throwTo tid ThreadKilled
Killthread is a no-op if the target thread has already completed. ixmap ixmap :: (Ix i, Ix j) => (i, i) -> (i -> j) ->  Array j e ->  Array i e,IxiIxj(,)iiijArrayjeArrayie9ixmap allows for transformations on array indices. It may be thought of as providing function composition on the right with the mapping that the original array embodies. A similar transformation of array values may be achieved using fmap from the Array instance of the Functor class. Ixclass  Ord a => Ix aWThe Ix class is used to map a contiguous subrange of values in a type onto integers. It is used primarily for array indexing (see the array package). The first argument (l,u) of each of these operations is a pair specifying the lower and upper bounds of a contiguous subrange of values. An implementation is entitled to assume the following laws about these operations: Minimal complete instance: range, index and inRange. IsStringclass IsString a'mClass for string-like datastructures; used by the overloaded string extension (-foverloaded-strings in GHC).  iShiftRL# iShiftRL# :: Int# -> Int# -> Int#Int#Int#Int#bShift the argument right (unsigned) by the specified number of bits (which must be non-negative).  iShiftRA# iShiftRA# :: Int# -> Int# -> Int#Int#Int#Int#`Shift the argument right (signed) by the specified number of bits (which must be non-negative). iShiftL#iShiftL# :: Int# -> Int# -> Int#Int#Int#Int#VShift the argument left by the specified number of bits (which must be non-negative).  isEmptyMVar isEmptyMVar :: MVar a -> IO BoolhNMVaraIOBool9Check whether a given MVar is empty. Notice that the boolean value returned is just a snapshot of the state of the MVar. By the time you get to react on its result, the MVar may have been filled (or emptied) - so be extremely careful when using this operation. Use tryTakeMVar instead if possible. IPrtype IPr = (Int, Int)installHandlerinstallHandler :: Handler ->  IO HandlerS8HandlerIOHandlerdAllows Windows console events to be caught and handled. To handle a console event, call installHandler passing the appropriate Handler value. When the event is received, if the Handler value is Catch f, then a new thread will be spawned by the system to execute f e, where e is the ConsoleEvent that was received. Note that console events can only be received by an application running in a Windows console. Certain environments that look like consoles do not support console events, these include: In order for your application to receive console events, avoid running it in one of these environments. inRangeinRange :: Ix a => (a, a) -> a -> Bool7Ixa(,)aaaBoolinlineinline :: a -> avaaThe call '(inline f)' reduces to f, but inline has a BuiltInRule that tries to inline f (if it has an unfolding) unconditionally The NOINLINE pragma arranges that inline only gets inlined (and hence eliminated) late in compilation, after the rule has had a god chance to fire. indicesindices :: Ix i =>  Array i e -> [i]IxiArrayie[]i4The list of indices of an array in ascending order. indexOfPindexOfP ::  (a -> Bool) -> [:a:] -> [:Int:]aBool[::]a[::]Int indexError  indexError ::  Show a => (a, a) -> a -> String -> bnEShowa(,)aaaStringbindexindex :: Ix a => (a, a) -> a -> IntIxa(,)aaaIntIgnoreIgnore :: Handler* HandlerHandlerdata Handler\ groupWith groupWith ::  Ord b => (a -> b) -> [a] -> [[a]]Ordbab[]a[][]aThe groupWith function uses the user supplied function which projects an element out of every list element in order to to first sort the input list and then to form groups by equality on these projected elements getUncaughtExceptionHandlergetUncaughtExceptionHandler :: IO (SomeException -> IO ())dBIO SomeExceptionIO() getFullArgs getFullArgs ::  IO [String]IO[]StringFunPtrFunPtr :: Addr# -> FunPtr a  Addr#FunPtraFunPtrdata FunPtr aRA value of type FunPtr a is a pointer to a function callable from foreign code. The type a will normally be a foreign type, a function type with zero or more arguments where A value of type FunPtr a may be a pointer to a foreign function, either returned by another foreign function or imported with a a static address import like 
foreign import ccall "stdlib.h &free"
  p_free :: FunPtr (Ptr a -> IO ())
or a pointer to a Haskell function created using a wrapper stub declared to produce a FunPtr of the correct type. For example: 
type Compare = Int -> Int -> Bool
foreign import ccall "wrapper"
  mkCompare :: Compare -> IO (FunPtr Compare)
Calls to wrapper stubs like mkCompare allocate storage, which should be released with Foreign.Ptr.freeHaskellFunPtr when no longer required. To convert FunPtr values to corresponding Haskell functions, one can define a dynamic stub for the specific foreign type, e.g. 
type IntFunction = CInt -> IO ()
foreign import ccall "dynamic" 
  mkFun :: FunPtr IntFunction -> IntFunction
 fromString fromString :: IsString a => String -> aIsStringaStringafromPfromP :: [:a:] -> [a] [::]a[]a freezeSTArray freezeSTArray :: Ix i =>  STArray s i e -> ST s (Array i e){IxiSTArraysieSTsArrayieforkOnIOforkOnIO :: Int -> IO () ->  IO ThreadId5IntIO()IOThreadId{Like forkIO, but lets you specify on which CPU the thread is created. Unlike a forkIO thread, a thread created by forkOnIO will stay on the same CPU for its entire lifetime (forkIO threads can migrate between CPUs according to the scheduling policy). forkOnIO is useful for overriding the scheduling policy when you know in advance how best to distribute the threads. The Int argument specifies the CPU number; it is interpreted modulo numCapabilities (note that it actually specifies a capability number rather than a CPU number, but to a first approximation the two are equivalent). forkIOforkIO :: IO () ->  IO ThreadIdIO()IOThreadIdSparks off a new thread to run the IO computation passed as the first argument, and returns the ThreadId of the newly created thread. The new thread will be a lightweight thread; if you want to use a foreign library that uses thread-local storage, use Control.Concurrent.forkOS instead. GHC note: the new thread inherits the blocked state of the parent (see Control.Exception.block). The newly created thread has an exception handler that discards the exceptions BlockedOnDeadMVar, BlockedIndefinitely, and ThreadKilled, and passes all other exceptions to the uncaught exception handler (see setUncaughtExceptionHandler). foldrP foldrP ::  (a -> b -> b) -> b -> [:a:] -> bD%abbb[::]abfoldr1Pfoldr1P ::  (a -> a -> a) -> [:a:] -> aaaa[::]aafoldP foldP ::  (e -> e -> e) -> e -> [:e:] -> eD%eeee[::]eefoldlP foldlP ::  (a -> b -> a) -> a -> [:b:] -> aabaa[::]bafoldl1Pfoldl1P ::  (a -> a -> a) -> [:a:] -> aF*aaa[::]aafold1Pfold1P ::  (e -> e -> e) -> [:e:] -> eeee[::]ee flushConsole flushConsole :: Handle -> IO ()'HandleIO()filterPfilterP ::  (a -> Bool) -> [:a:] -> [:a:]aBool[::]a[::]afill fill :: MutableArray# s e -> (Int, e) ->  STRep s a ->  STRep s an' MutableArray#se(,)InteSTRepsaSTRepsaeqArrayeqArray :: (Ix i, Eq e) =>  Array i e ->  Array i e -> BoolIxiEqeArrayieArrayieBool enumFromToP enumFromToP ::  Enum a => a -> a -> [:a:]|Enumaaa[::]aenumFromThenToP enumFromThenToP ::  Enum a => a -> a -> a -> [:a:]6Enumaaaa[::]aensureIOManagerIsRunningensureIOManagerIsRunning :: IO ()IO()emptyPemptyP :: [:a:][::]aelemselems :: Ix i =>  Array i e -> [e]P,IxiArrayie[]e1The list of elements of an array in index order. elemPelemP :: Eq a => a -> [:a:] -> BoolEqaa[::]aBool dropWhileP dropWhileP ::  (a -> Bool) -> [:a:] -> [:a:]`aBool[::]a[::]adropPdropP :: Int -> [:a:] -> [:a:]Int[::]a[::]a dpermuteP  dpermuteP :: [:Int:] -> [:e:] -> [:e:] -> [:e:]g[::]Int[::]e[::]e[::]eDownDown :: a -> Down aaDownaDownnewtype Down aThe Down type allows you to reverse sort order conveniently. A value of type Down a contains a value of type a (represented as Down a). If a has an Ord instance associated with it then comparing two values thus wrapped will give you the opposite of their normal sort order. This is particularly useful when sorting in generalised list comprehensions, as in: then sortWith by Down x done done :: Ix i => i -> i -> Int -> MutableArray# s e -> STRep s (Array i e)IxiiiInt MutableArray#seSTRepsArrayieDefaultDefault :: Handler HandlercrossPcrossP :: [:a:] -> [:b:] ->  [:(a, b):]i[::]a[::]b[::](,)ab crossMapP crossMapP :: [:a:] ->  (a -> [:b:]) ->  [:(a, b):]4[::]aa[::]b[::](,)aboCompute a cross of an array and the arrays produced by the given function for the elements of the first array. ControlCControlC ::  ConsoleEvent ConsoleEventControlCControlC ::  ConsoleEventC4 ConsoleEvent ConsoleEventdata  ConsoleEvent ConsoleEventdata  ConsoleEventconcatPconcatP ::  [:[:a:]:] -> [:a:])[::][::]a[::]a concatMapP concatMapP ::  (a -> [:b:]) -> [:a:] -> [:b:]a[::]b[::]a[::]b cmpIntArray cmpIntArray ::  Ord e =>  Array Int e ->  Array Int e -> Orderingl3OrdeArrayInteArrayInteOrderingcmpArraycmpArray :: (Ix i, Ord e) =>  Array i e ->  Array i e -> Ordering"IxiOrdeArrayieArrayieOrderingCloseClose ::  ConsoleEventl] ConsoleEventCloseClose ::  ConsoleEvent ConsoleEvent childHandler childHandler ::  SomeException -> IO ()- SomeExceptionIO()catchSTMcatchSTM :: STM a -> (SomeException -> STM a) -> STM aSTMa SomeExceptionSTMaSTMa'Exception handling within STM actions. CatchCatch :: (ConsoleEvent -> IO ()) -> HandlertN ConsoleEventIO()Handlerbuildbuild :: ((a -> b -> b) -> b -> b) -> [a]abbbb[]a9A list producer that can be fused with foldr. This function is merely 
build g = g (:) []
but GHC's simplifier will transform an expression of the form foldr k z (build g), which may arise after inlining, to g k z, which avoids producing an intermediate list. breakpointCondbreakpointCond :: Bool -> a -> aBoolaa breakpoint breakpoint :: a -> aaabreakPbreakP ::  (a -> Bool) -> [:a:] -> ([:a:], [:a:])~HaBool[::]a(,)[::]a[::]aBreakBreak ::  ConsoleEvent ConsoleEventBreakBreak ::  ConsoleEvent ConsoleEvent bpermuteP bpermuteP :: [:Int:] -> [:e:] -> [:e:]r[::]Int[::]e[::]e boundsSTArray boundsSTArray ::  STArray s i e -> (i, i)STArraysie(,)iiboundsbounds :: Ix i =>  Array i e -> (i, i)nIxiArrayie(,)ii0The bounds with which an array was constructed.  BlockReasondata  BlockReason BlockedOnSTM BlockedOnSTM ::  BlockReasonVH BlockReason.blocked in retry in an STM transaction BlockedOnOtherBlockedOnOther ::  BlockReason BlockReasonblocked on some other resource. Without -threaded, I/O and threadDelay show up as BlockedOnOther, with -threaded they show up as BlockedOnMVar.  BlockedOnMVar BlockedOnMVar ::  BlockReason BlockReasonblocked on on MVar BlockedOnForeignCallBlockedOnForeignCall ::  BlockReasonm_ BlockReasoncurrently in a foreign call BlockedOnExceptionBlockedOnException ::  BlockReason BlockReasonblocked in throwTo BlockedOnBlackHoleBlockedOnBlackHole ::  BlockReasongY BlockReason7blocked on a computation in progress by another thread augmentaugment :: ((a -> b -> b) -> b -> b) -> [a] -> [a]0abbbb[]a[]aWA list producer that can be fused with foldr. This function is merely 
augment g xs = g (:) xs
but GHC's simplifier will transform an expression of the form foldr k z (augment g xs), which may arise after inlining, to g k (foldr k z xs), which avoids producing an intermediate list.  atomically atomically :: STM a -> IO aSTMaIOaPerform a series of STM actions atomically. You cannot use atomically inside an unsafePerformIO or unsafeInterleaveIO. Any attempt to do so will result in a runtime error. (Reason: allowing this would effectively allow a transaction inside a transaction, depending on exactly when the thunk is evaluated.) However, see newTVarIO, which can be called inside unsafePerformIO, and which allows top-level TVars to be allocated.  asyncWriteBA asyncWriteBA :: Int -> Int -> Int -> Int -> MutableByteArray# RealWorld ->  IO (Int, Int)eIntIntIntIntMutableByteArray# RealWorldIO(,)IntInt asyncWrite  asyncWrite :: Int -> Int -> Int -> Ptr a ->  IO (Int, Int)j 7 IntIntIntPtraIO(,)IntInt asyncReadBA asyncReadBA :: Int -> Int -> Int -> Int -> MutableByteArray# RealWorld ->  IO (Int, Int)c  IntIntIntIntMutableByteArray# RealWorldIO(,)IntInt asyncRead  asyncRead :: Int -> Int -> Int -> Ptr a ->  IO (Int, Int)  IntIntIntPtraIO(,)IntInt asyncDoProc asyncDoProc :: FunPtr (Ptr a -> IO Int) -> Ptr a -> IO Int  FunPtrPtraIOIntPtraIOIntassocsassocs :: Ix i =>  Array i e -> [(i, e)]K  IxiArrayie[](,)ie5The list of associations of an array in index order.  arrEleBottom arrEleBottom :: a  aarrayarray :: Ix i => (i, i) -> [(i, e)] ->  Array i ec ( Ixi(,)ii[](,)ieArrayieConstruct an array with the specified bounds and containing values for given indices within these bounds. The array is undefined (i.e. bottom) if any index in the list is out of bounds. The Haskell 98 Report further specifies that if any two associations in the list have the same index, the value at that index is undefined (i.e. bottom). However in GHC's implementation, the value at such an index is the value part of the last association with that index in the list. Because the indices must be checked for these errors, array is strict in the bounds argument and in the indices of the association list, but nonstrict in the values. Thus, recurrences such as the following are possible: 
a = array (1,100) ((1,1) : [(i, i * a!(i-1)) | i <- [2..100]])
Not every index within the bounds of the array need appear in the association list, but the values associated with indices that do not appear will be undefined (i.e. bottom). If, in any dimension, the lower bound is greater than the upper bound, then the array is legal, but empty. Indexing an empty array always gives an array-bounds error, but bounds still yields the bounds with which the array was constructed. Array Array :: i -> i -> Int -> Array# e ->  Array i eiiIntArray#eArrayieArraydata Ix i => Array i eThe type of immutable non-strict (boxed) arrays with indices in i and elements in e. The Int is the number of elements in the Array. anyPanyP ::  (a -> Bool) -> [:a:] -> BoolaBool[::]aBoolandPandP :: [:Bool:] -> Bool[D[::]BoolBoolamapamap :: Ix i => (a -> b) ->  Array i a ->  Array i bIxiabArrayiaArrayibalwaysSucceedsalwaysSucceeds :: STM a -> STM ()dLSTMaSTM()5alwaysSucceeds adds a new invariant that must be true when passed to alwaysSucceeds, at the end of the current transaction, and at the end of every subsequent transaction. If it fails at any of those points then the transaction violating it is aborted and the exception raised by the invariant is propagated. alwaysalways :: STM Bool -> STM ()STMBoolSTM()always is a variant of alwaysSucceeds in which the invariant is expressed as an STM Bool action that must return True. Returning False or raising an exception are both treated as invariant failures. allPallP ::  (a -> Bool) -> [:a:] -> Bool>aBool[::]aBooladjust adjust ::  (e -> a -> e) -> MutableArray# s e -> (Int, a) ->  STRep s b ->  STRep s b)eae MutableArray#se(,)IntaSTRepsbSTRepsbaddMVarFinalizeraddMVarFinalizer :: MVar a -> IO () -> IO ()MVaraIO()IO()Add a finalizer to an MVar (GHC only). See Foreign.ForeignPtr and System.Mem.Weak for more about finalizers.  accumArray  accumArray :: Ix i =>  (e -> a -> e) -> e -> (i, i) -> [(i, a)] ->  Array i eIxieaee(,)ii[](,)iaArrayieThe accumArray deals with repeated indices in the association list using an accumulating function which combines the values of associations with the same index. For example, given a list of values of some index type, hist produces a histogram of the number of occurrences of each index within a specified range: 
hist :: (Ix a, Num b) => (a,a) -> [a] -> Array a b
hist bnds is = accumArray (+) 0 bnds [(i, 1) | i<-is, inRange bnds i]
If the accumulating function is strict, then accumArray is strict in the values, as well as the indices, in the association list. Thus, unlike ordinary arrays built with array, accumulated arrays should not in general be recursive. accum accum :: Ix i =>  (e -> a -> e) ->  Array i e -> [(i, a)] ->  Array i etIxieaeArrayie[](,)iaArrayie%accum f takes an array and an association list and accumulates pairs from the list into the array with the accumulating function f. Thus accumArray can be defined using accum: 
accumArray f z b = accum f (array b [(i, z) | i <- range b])
>>> (>>>) ::  Arrow arr => arr a b -> arr b c -> arr a c L Arrowarrarrabarrbcarrac// (//) :: Ix i =>  Array i e -> [(i, e)] ->  Array i e*! IxiArrayie[](,)ieArrayie Constructs an array identical to the first argument except that it has been updated by the associations in the right argument. For example, if m is a 1-origin, n by n matrix, then 
m//[((i,i), 0) | i <- [1..n]]
is the same matrix, except with the diagonal zeroed. Repeated indices in the association list are handled as for array: Haskell 98 specifies that the resulting array is undefined (i.e. bottom), but GHC's implementation uses the last association for each index. +:+ (+:+) :: [:a:] -> [:a:] -> [:a:]##[::]a[::]a[::]a!: (!:) :: [:a:] -> Int -> a$$[::]aInta! (!) :: Ix i =>  Array i e -> i -> e$p$IxiArrayieie*The value at the given index in an array. PArrmodule GHC.PArr$Extsmodule GHC.Exts%LGHC Extensions: this is the Approved Way to get at GHC-specific extensions.  Environmentmodule GHC. Environment%Desugarmodule GHC.Desugar%#Support code for desugaring in GHC ConsoleHandlermodule GHC.ConsoleHandler8&cNB. the contents of this module are only available on Windows. Installing Win32 console handlers. Concmodule GHC.Conc&Basic concurrency stuff. basepackage base '.GHC modules that are part of the base library Arrmodule GHC.Arrc'GHC's array implementation. '''''''GHCPArrGHCDesugarGHC EnvironmentGHCConsoleHandlerGHCExtsGHCConcGHCArr(base4.0.0.07http://haskell.org/ghc/docs/latest/html/libraries/base/2http://haskell.org/ghc/docs/latest/html/libraries/