M        !"#$%& ' () * + ,- ./0123456789: ;<=>?@ABCDEFGHIJKLM NOPQRS TUVW XYZ[ \]^_`abcdefg h!i"j"k"l"m"n#o#p$qrst%uvw&x&y&z&{&|}'~ ()*+++++,,-....""""""""""""""""""""""""""########## ''-- /####"""""""""""""""""00         1 ! " #$%&'()*+,-. / 0 1 2 3 4 5 6%7 8 9 : ;<=>?@ABC2D2E2F3G3H3I3J3K3L3M3N3O3PQRSTU4V4W5X6Y6Z6[6\]^_'`'a'b'c'd'e'f'g'hijklmnopqrstuvwxyz{|}~%%0((()7))8888%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%   999 9 : : : ::::::::::::::::::: :!:":#:$:%:&:':(:):*:+:,:-:.:/:0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ;[;\;];^;_;`;a;b;c;d;e;f;g;h;i;j;k;l;m;n;o;p;q;r;s;t;u;v;w;x;y;z;{;|;};~;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<=======================%%%%%%%            >>>>>>>>>>>>>>> >!>">#*$*%*&*'*(*)***+*,*-*.*/*0*1*2*3*4*5*6*7-8-9-:-;-<-=->-?-@-A-B-C-D?E?F?G?H?I?J?K?L?M?N?O?P?Q?R?S?TUVWXY#Z#[#\#]#^#_#`#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o+p+qrs+tuvwxyz{|}~////@@AAAAABB)77CDEEEEEEEEEE,,,,,,,,,""""""""""""" " " " " """"""""""""""""""" "!"""#"$"%"&"'"(")"*"+","-"."/"0"1"2"3"4"5"6"7"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"]"^"_"`"a"b"c"d"e"f"g"h"i"j"k"l"m"n"o"p"q"r"s"t"u"v"w"x"y"z"{"|"}"~"""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd e f g h i j k l m n o p q r s t u v w x y z { | } ~                                      FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIII I I I I IIIIIIIIIIIIIIIIIII I!I"I#I$I%I&I'I(I)I*I+I,I-I.I/I0I1I2I3I4I5I6I7I8I9I:I;I<I=I>I?I@IAIBICIDIEIFIGIHIIIJIKILIMINIOIPIQIRISITIUIVIWIXIYIZI[I\I]I^I_I`IaIbIcIdIeIfIgIhIiIjIkIlImInIoIpIqIrIsItIuIvIwIxIyIzI{I|I}I~IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII I I I I IIIIIIIIIIIIIIIIIII I!I"I#I$I%I&I'I(I)I*I+I,I-I.I/I0I1I2I3I4I5I6I7I8I9I:I;I<I=I>I?I@IAIBICIDIEIFIGIHIIIJIKILIMINIOIPIQIRISIT,U,V,W,X,Y,Z,[,\,],^,_,`,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,sJtJuJvJwJxJyJzJ{J|K}J~JLLJJJJJMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOPPPQQQQQQQQQQQQQQQQBRRRSSSSSSSSS S S T T TTTTTTTTTUUUUUUUUUU U!U"U#U$U%U&U'U(U)U*U+U,V-V.V/V0V1V2W3W4W5W6W7W8W9W:W;W<W=W>W?W@WAXBXCXDXEXFXGXHYIYJYKYLYMYNYOYPYQYRYSYTYUYVYWYXYYYZY[Y\Y]Y^Y_Y`YaYbYcYdYeZfZgZhZiZjZkZlZmZnZoZpZqZrZsZtZuZvZwZxZyZzZ{Z|Z}Z~ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[\\\\\\\\\\\]]]]] ] ] ] ] ] ] ] ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ _ _ _ _ Q ` a a a a a a a a !a "a #a $a %a &a 'a (a )b *a +c ,c -c .c /b 0b 1b 2b 3a 4b 5b 6a 7a 8a 9b : ;b <b =a >a ?a @a Aa Bb Cb Da Ea Fa Ga Ha Ia Ja Ka La Ma Na Oa Pa Qa Rd Sd Ta Ua Va Wa Xd Yd Zd [d \d ]d ^d _d `d ad bd cd dd ed fd ge he ie je ke le me ne oe pe qe re se te ue ve we xe ye ze {e |e }e ~e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e !e "e #e $e %e &e 'e (e )e *e +e ,e -e .e /e 0f 1f 2f 3f 4f 5f 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g hB iB jB kB lB mB nB oB pB qB rB sB tB uB vB wB xB yB zB {B |B }B ~B B B B B B B B B B B B B B B B B C C C C C 2 P P P P P P P P P P P P P P P P P g Q Q Q 5 5 5 5 5 5 5 5 5 5 5 5 5     3 3 3 3 3 3 3 3 3 h h h h h f f f f f f f f f f f f f f f f f a a a a a a a b a Q Q Q Q Q Q  Q Q Q  Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q ` ` ` ` ` ` ` ` `          ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = >@ ?@ @@ Ai Bi Ci Di Ei Fi Gi Hi I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                  ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! j j j j j j j j j j j j j j j j j j j j j j j j k   l l l l l l l l l l l l l m m m m m m m m m m n n n n o o o o b b b b b b b b b b b p p p                ! " #q $q %q &q 'q (q )q *q +q ,q -q .q /q 0( 18 28 3r 4r 5r 6r 7r 8s 9s :s ;s <s =s >s ?s @s As Bs Cs Ds Es Fs Gs Ht It Ju Ku Lv Mv Nv Ov Pv Qv Rv Sv Tv Uv Vv Wv Xv Yv Zv [v \R ]R ^R _R `c ac bc cw dw ew fw gw h6 i6 j6 kx lx mx nx oy pz qz rz sz tz uz v{ w{ x| y| z| {| |} }} ~} } } } } } } } ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~                                                                                                                                                ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNO$PQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~1Malcolm Wallace 20064BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimentalportableUnsafeB"(c) The University of Glasgow 2015see libraries/ghc-prim/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) Trustworthy*+DOT J  The empty .K  Push a call-site onto the stack.(This function has no effect on a frozen .Zs are a lightweight method of obtaining a partial call-stack at any point in the program..A function can request its call-site with the ( constraint. For example, we can define 2errorWithCallStack :: HasCallStack => String -> a as a variant of errorC that will get its call-site. We can access the call-stack inside errorWithCallStack with . {errorWithCallStack :: HasCallStack => String -> a errorWithCallStack msg = error (msg ++ "n" ++ prettyCallStack callStack) Thus, if we call errorWithCallStackA we will get a formatted call-stack alongside our error message.errorWithCallStack "die"*** Exception: dieCallStack (from HasCallStack):F errorWithCallStack, called at <interactive>:2:1 in interactive:Ghci1 GHC solves  constraints in three steps: If there is a 3 in scope -- i.e. the enclosing function has a E constraint -- GHC will append the new call-site to the existing .If there is no  in scope -- e.g. in the GHCi session above -- and the enclosing definition does not have an explicit type signature, GHC will infer a W constraint for the enclosing definition (subject to the monomorphism restriction).If there is no ^ in scope and the enclosing definition has an explicit type signature, GHC will solve the " constraint for the singleton + containing just the current call-site.Ds do not interact with the RTS and do not require compilation with -prof>. On the other hand, as they are built up explicitly via the v constraints, they will generally not contain as much information as the simulated call-stacks maintained by the RTS.A  is a [(String, SrcLoc)]. The String/ is the name of function that was called, the [ is the call-site. The list is ordered with the most recently called function at the head.(NOTE: The intrepid user may notice that - is just an alias for an implicit parameter ?callStack :: CallStack(. This is an implementation detail and  should not be considered part of the @ API, we may decide to change the implementation in the future.%A single location in the source code.Freeze the stack at the given  CallStack?, preventing any further call-sites from being pushed onto it. Request a CallStack.NOTE: The implicit parameter ?callStack :: CallStack" is an implementation detail and  should not be considered part of the @ API, we may decide to change the implementation in the future.&Extract a list of call-sites from the .(The list is ordered by most recent call. "Convert a list of call-sites to a . KFreeze a call-stack, preventing any further call-sites from being appended.NpushCallStack callSite (freezeCallStack callStack) = freezeCallStack callStackJKJKJK((c) The University of Glasgow, 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions) Trustworthy+,BDOT/ stops execution and displays an error message.  A variant of % that does not produce a stack trace.A special case of . It is expected that compilers will recognize this and insert error messages which are more appropriate to the context in which  appears.PUsed for compiler-generated error message; encoding saves bytes of string junk.((c) The University of Glasgow, 1992-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions)UnsafeABOTA'A list producer that can be fused with . This function is merely  augment g xs = g (:) xs?but GHC's simplifier will transform an expression of the form  k z ( g xs)&, which may arise after inlining, to g k ( k z xs)., which avoids producing an intermediate list.Append two lists, i.e., q[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn] [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]>If the first list is not finite, the result is the first list.'A list producer that can be fused with . This function is merely  build g = g (:) []?but GHC's simplifier will transform an expression of the form  k z ( g)%, which may arise after inlining, to g k z/, which avoids producing an intermediate list., applied to a binary operator, a starting value (typically the right-identity of the operator), and a list, reduces the list using the binary operator, from right to left: @foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)This M equality predicate is used when desugaring pattern-matches against strings. is defined as the value /. It helps to make guards more readable. eg. - f x | x < 0 = ... | otherwise = ...#If the first argument evaluates to 9, then the result is the second argument. Otherwise an AssertionFailed$ exception is raised, containing a 6 with the source file and line number of the call to .Assertions can normally be turned on or off with a compiler flag (for GHC, assertions are normally on unless optimisation is turned on with -O or the -fignore-assertsL option is given). When assertions are turned off, the first argument to @ is ignored, and the second argument is returned as the result. f xs" is the list obtained by applying f to each element of xs, i.e., [map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn] map f [x1, x2, ...] == [f x1, f x2, ...]OApplication operator. This operator is redundant, since ordinary application (f x) means the same as (f  x) . However, p has low, right-associative binding precedence, so it sometimes allows parentheses to be omitted; for example:  f $ g $ h x = f (g (h x))6It is also useful in higher-order situations, such as  ( 0) xs, or k () fs xs.)Fail with a message. This operation is not part of the mathematical definition of a monad, but is invoked on pattern-match failure in a do expression.RAs part of the MonadFail proposal (MFP), this function is moved to its own class  MonadFail (see Control.Monad.FailN for more details). The definition here will be removed in a future release.*hSequentially compose two actions, passing any value produced by the first as an argument to the second.+Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.-%Inject a value into the monadic type.G Identity of HHAn associative operationIJFold a list using the monoid. For most types, the default definition for I will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.MThe M function is the conventional monad join operator. It is used to remove one level of monadic structure, projecting its bound argument into the outer level.NSequential application.O Lift a value.P=Sequence actions, discarding the value of the first argument.WThe W+ class defines the basic operations over a monad2, a concept from a branch of mathematics known as category theory^. From the perspective of a Haskell programmer, however, it is best to think of a monad as an abstract datatype of actions. Haskell's doI expressions provide a convenient syntax for writing monadic expressions. Instances of W# should satisfy the following laws: - a * k = k a m * - = m m * (x -> k x * h) = (m * k) * hFurthermore, the W and f% operations should relate as follows: O = - (N) = 5The above laws imply: , f xs = xs * - . f (+) = (P) and that O and (N') satisfy the applicative functor laws.The instances of W for lists, ' and  defined in the Prelude satisfy these laws.YThe Y? class is used for types that can be mapped over. Instances of Y# should satisfy the following laws: 1fmap id == id fmap (f . g) == fmap f . fmap gThe instances of Y for lists, ' and  satisfy these laws.f3A functor with application, providing operations toembed pure expressions (O), and1sequence computations and combine their results (N).mA minimal complete definition must include implementations of these functions satisfying the following laws: identity O 7 N v = v composition O (.) N u N v N w = u N (v N w) homomorphism O f N O x = O (f x) interchange u N O y = O ( y) N uThe other methods have the following default definitions, which may be overridden with equivalent specialized implementations: u P v = O (8 7) N u N v u ( v = O 8 N u N v$As a consequence of these laws, the Y instance for f will satisfy , f x = O f N xIf f is also a W, it should satisfy O = - (N) = 5(which implies that O and N' satisfy the applicative functor laws).rThe class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following laws: mappend mempty x = x mappend x mempty = x 1mappend x (mappend y z) = mappend (mappend x y) z  mconcat =  mappend memptygThe method names refer to the monoid of lists under concatenation, but there are many other instances.Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of r, e.g. Sum and Product.}The }8 type encapsulates an optional value. A value of type } a! either contains a value of type a (represented as  a#), or it is empty (represented as  ). Using }h is a good way to deal with errors or exceptional cases without resorting to drastic measures such as .The }a type is also a monad. It is a simple kind of error monad, where all errors are represented by 0. A richer error monad can be built using the - type.A K is a list of characters. String constants in Haskell are values of type . ,Monads that also support choice and failure.!the identity of "'. It should also satisfy the equations +mzero >>= f = mzero v >> mzero = mzero"an associative operation#!A monoid on applicative functors. If defined, & and '1 should be the least solutions of the equations:  some v = (:) <$> v N many v many v = some v % O []$The identity of %%An associative binary operation& One or more.' Zero or more.(>Sequence actions, discarding the value of the second argument.)SReplace all locations in the input with the same value. The default definition is , . 8<, but this may be overridden with a more efficient version.* A variant of N with the arguments reversed.+FLift a function to actions. This function may be used as a value for , in a Y instance.,"Lift a binary function to actions.-#Lift a ternary function to actions..Same as *&, but with the arguments interchanged./Conditional execution of f expressions. For example, !when debug (putStrLn "Debugging")will output the string  Debugging if the Boolean value debug is , and otherwise do nothing.REvaluate each action in the sequence from left to right, and collect the results. f is equivalent to  .  f.0Promote a function to a monad.1`Promote a function to a monad, scanning the monadic arguments from left to right. For example, N liftM2 (+) [0,1] [0,2] = [0,2,1,3] liftM2 (+) (Just 1) Nothing = Nothing2WPromote a function to a monad, scanning the monadic arguments from left to right (cf. 1).3WPromote a function to a monad, scanning the monadic arguments from left to right (cf. 1).4WPromote a function to a monad, scanning the monadic arguments from left to right (cf. 1).5In many situations, the 0' operations can be replaced by uses of 5&, which promotes function application. ' return f `ap` x1 `ap` ... `ap` xnis equivalent to  liftMn f x1 x2 ... xn6The  method restricted to the type %.7Identity function.8const x( is a unary function which evaluates to x for all inputs. For instance,map (const 42) [0..3] [42,42,42,42]9Function composition.:: f9 takes its (first) two arguments in the reverse order of f.;Strict (call-by-value) application operator. It takes a function and an argument, evaluates the argument to weak head normal form (WHNF), then calls the function with that value.<< p f yields the result of applying f until p holds.==! is a type-restricted version of 8. It is usually used as an infix operator, and its typing forces its first argument (which is usually overloaded) to have the same type as the second. Returns the tag_ of a constructor application; this function is used by the deriving code for Eq, Ord and Enum.The primitive dataToTag# requires an evaluated constructor application as its argument, so we provide getTag as a wrapper that performs the evaluation before calling dataToTag. We could have dataToTagD evaluate its argument, but we prefer to do it this way because (a) dataToTag# can be an inline primop if it doesn't need to do any evaluation, and (b) we want to expose the evaluation to the simplifier, because it might be possible to eliminate the evaluation in the case when the argument is already known to be evaluated.>VShift the argument left by the specified number of bits (which must be non-negative).?]Shift the argument right by the specified number of bits (which must be non-negative). The RL} means "right, logical" (as opposed to RA for arithmetic) (although an arithmetic right shift wouldn't make sense for Word#)@VShift the argument left by the specified number of bits (which must be non-negative).AfShift the argument right (signed) by the specified number of bits (which must be non-negative). The RA9 means "right, arithmetic" (as opposed to RL for logical)BhShift the argument right (unsigned) by the specified number of bits (which must be non-negative). The RL9 means "right, logical" (as opposed to RA for arithmetic)Lift a semigroup into } forming a r according to  #http://en.wikipedia.org/wiki/Monoid: "Any semigroup S= may be turned into a monoid simply by adjoining an element e not in S and defining e*e = e and  e*s = s = s*e for all s " S;." Since there is no "Semigroup" typeclass providing just H , we use r instead.u)*+,-GHIMNOPWYfr} !"#$%&'()*+,-./012345 6  789:;<=  >?@AB !"#$%&'()*+,-./01123456789:;<MS& W*+-)Y,)[  'fONP(rGHI=>?@sABtCuDvEwFG}HIJ~KLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~   !"#'$%&*+,-./012345 6  789:;<=  >?@AB_MW*+-)Y,)fONP(rGHI} !"#$%&'*+,-./012345 6  789:;<=  >?@AB !"#$%&'()*+,-./01 50*1+1N4P4%3(4)4*4.199 ;0(c) The University of Glasgowsee libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions) Trustworthy Trustworthy(c) Daniel Fischer 2010see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyB"(c) The University of Glasgow 2012see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)NonehA monad that can execute GHCi statements by lifting them out of m into the IO monad. (e.g state monads)"A monad that doesn't allow any IO.  TrustworthyBX'(c) The University of Glasgow 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)UnsafeBC!This is the "back door" into the  monad, allowing D computation to be performed at any time. For this to be safe, the O computation should be free of side effects and independent of its environment."If the I/O computation wrapped in C performs side effects, then the relative order in which those side effects take place (relative to the main I/O trunk, or other calls to C-) is indeterminate. Furthermore, when using C to cause side-effects, you should take the following precautions to ensure the side effects are performed as many times as you expect them to be. Note that these precautions are necessary for GHC, but may not be sufficient, and other compilers may require different precautions:Use {-# NOINLINE foo #-} as a pragma on any function foo that calls CK. If the call is inlined, the I/O may be performed more than once.Use the compiler flag -fno-cse to prevent common sub-expression elimination being performed on the module, which might combine two side effects that were meant to be separate. A good example is using multiple global variables (like test in the example below).7Make sure that the either you switch off let-floating (-fno-full-laziness), or that the call to CJ cannot float outside a lambda. For example, if you say: 8 f x = unsafePerformIO (newIORef []) I you may get only one reference cell shared between all calls to f". Better would be 9 f x = unsafePerformIO (newIORef [x]) 7 because now it can't float outside the lambda.It is less well known that C is not type safe. For example:  test :: IORef [a] test = unsafePerformIO $ newIORef [] main = do writeIORef test [42] bang <- readIORef test print (bang :: [Char])This program will core dump. This problem with polymorphic references is well known in the ML community, and does not arise with normal monadic use of references. There is no easy way to make it impossible once you use C#. Indeed, it is possible to write coerce :: a -> b with the help of C. So be careful!DThis version of C{ is more efficient because it omits the check that the IO is only being performed by a single thread. Hence, when you use D], there is a possibility that the IO action may be performed multiple times (on a multiprocessor), and you should therefore ensure that it gives the same results each time. It may even happen that one of the duplicated IO actions is only run partially, and then interrupted in the middle without an exception being raised. Therefore, functions like bracket cannot be used safely within D.EE allows @ computation to be deferred lazily. When passed a value of type IO a, the . will only be performed when the value of the a@ is demanded. This is used to implement lazy file reading, see .Ensures that the suspensions under evaluation by the current thread are unique; that is, the current thread is not evaluating anything that is also under evaluation by another thread that has also executed .,This operation is used in the definition of C[ to prevent the IO action from being executed multiple times, which is usually undesirable.CDECDECDE"(c) The University of Glasgow 2008see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)UnsafeB FAn F (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.G Create an F which is initially empty.H Create an F# which contains the supplied value.IReturn the contents of the F . If the F is currently empty, I& will wait until it is full. After a I, the F is left empty..There are two further important properties of I:IK is single-wakeup. That is, if there are multiple threads blocked in I , and the Fw becomes full, only one thread will be woken up. The runtime guarantees that the woken thread completes its I operation.(When multiple threads are blocked on an F{, they are woken up in FIFO order. This is useful for providing fairness properties of abstractions built using Fs.J#Atomically read the contents of an F . If the F is currently empty, J will wait until its full. J# is guaranteed to receive the next K.JA is multiple-wakeup, so when multiple readers are blocked on an F,, all of them are woken up at the same time.Compatibility note: Prior to base 4.7, J was a combination of I and KB. This mean that in the presence of other threads attempting to K, J could block. Furthermore, J would not receive the next K3 if there was already a pending thread blocked on IK. The old behavior can be recovered by implementing 'readMVar as follows: l readMVar :: MVar a -> IO a readMVar m = mask_ $ do a <- takeMVar m putMVar m a return a KPut a value into an F . If the F is currently full, K" will wait until it becomes empty..There are two further important properties of K:KK is single-wakeup. That is, if there are multiple threads blocked in K , and the Fx becomes empty, only one thread will be woken up. The runtime guarantees that the woken thread completes its K operation.(When multiple threads are blocked on an F{, they are woken up in FIFO order. This is useful for providing fairness properties of abstractions built using Fs.LA non-blocking version of I. The L% function returns immediately, with  if the F was empty, or  a if the F was full with contents a . After L, the F is left empty.MA non-blocking version of K. The M% function attempts to put the value a into the F , returning  if it was successful, or  otherwise.NA non-blocking version of J. The N% function returns immediately, with  if the F was empty, or  a if the F was full with contents a.OCheck whether a given F 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 L instead if possible.Add a finalizer to an F (GHC only). See Foreign.ForeignPtr and System.Mem.Weak for more about finalizers. FGHIJKLMNO FGHIJKLMNO FGHIJKLMNO'(c) The University of Glasgow 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyBConversion from an |B. An integer literal represents the application of the function " to the appropriate value of type |, so such literals have type (Z a) => a.(Unary negation.ZBasic numeric class.RAbsolute value.S!Sign of a number. The functions R and S should satisfy the law: abs x * signum x == xFor real numbers, the S is either -1 (negative), 0 (zero) or 1 (positive).T the same as : ( ).Because -/ is treated specially in the Haskell grammar, (- e)D is not a section, but an application of prefix negation. However, (T exp)) is equivalent to the disallowed section.  (ZPQRST5ZQP (RS|TZP Q(RST 6P6Q7(c) Daniel Fischer 2010see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyB               ,(c) 2001-2011 The Data Parallel Haskell teamsee libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyBF4 TrustworthyUVUVVUUV((c) The University of Glasgow, 1998-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)Unsafe/BXBA weak pointer object with a key and a value. The value has type v.AA weak pointer expresses a relationship between two objects, the key and the value: if the key is considered to be alive by the garbage collector, then the value is also alive. A reference from the value to the key does not keep the key alive.1A weak pointer may also have a finalizer of type IO (); if it does, then the finalizer will be run at most once, at a time after the key has become unreachable by the program ("dead"). The storage manager attempts to run the finalizer(s) for an object soon after the object dies, but promptness is not guaranteed.+It is not guaranteed that a finalizer will eventually run, and no attempt is made to run outstanding finalizers when the program exits. Therefore finalizers should not be relied on to clean up resources - other methods (eg. exception handlers) should be employed, possibly in addition to finalizers.References from the finalizer to the key are treated in the same way as references from the value to the key: they do not keep the key alive. A finalizer may therefore ressurrect the key, perhaps by storing it in the same data structure.The finalizer, and the relationship between the key and the value, exist regardless of whether the program keeps a reference to the X object or not.There may be multiple weak pointers with the same key. In this case, the finalizers for each of these weak pointers will all be run in some arbitrary order, or perhaps concurrently, when the key dies. If the programmer specifies a finalizer that assumes it has the only reference to an object (for example, a file that it wishes to close), then the programmer must ensure that there is only one such finalizer.If there are no other threads to run, the runtime system will check for runnable finalizers before declaring the system to be deadlocked.WARNING: weak pointers to ordinary non-primitive Haskell types are particularly fragile, because the compiler is free to optimise away or duplicate the underlying data structure. Therefore attempting to place a finalizer on an ordinary Haskell type may well result in the finalizer running earlier than you expected. This is not a problem for caches and memo tables where early finalization is benign. Finalizers canS be used reliably for types that are created explicitly and have identity, such as IORef and MVar{. However, to place a finalizer on one of these types, you should use the specific operation provided for that type, e.g.  mkWeakIORef and addMVarFinalizer respectively (the non-uniformity is accidental). These operations attach the finalizer to the primitive object inside the box (e.g. MutVar# in the case of IORefp), because attaching the finalizer to the box itself fails when the outer box is optimised away by the compiler.YEstablishes a weak pointer to k , with value v and a finalizer.?This is the most general interface for building a weak pointer.Z>Dereferences a weak pointer. If the key is still alive, then  v is returned (where v is the value! in the weak pointer), otherwise  is returned.The return value of Z@ depends on when the garbage collector runs, hence it is in the  monad.[MCauses a the finalizer associated with a weak pointer to be run immediately.XYkeyvalue finalizerreturns: a weak pointer objectZ[XYZ[XYZ[NoneB !"# !"# !"#"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthy&Extract the first component of a pair.'Extract the second component of a pair.\\6 converts an uncurried function to a curried function.]]4 converts a curried function to a function on pairs.^Swap the components of a pair.\]^\]^\]^\]^'"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable Trustworthy _The _3 function takes a default value, a function, and a } value. If the } value is h, the function returns the default value. Otherwise, it applies the function to the value inside the  and returns the result.Examples Basic usage:maybe False odd (Just 3)Truemaybe False odd NothingFalse$Read an integer from a string using  readMaybe;. If we succeed, return twice the integer; that is, apply (*2)8 to it. If instead we fail to parse an integer, return 0 by default:import Text.Read ( readMaybe )maybe 0 (*2) (readMaybe "5")10maybe 0 (*2) (readMaybe "")0Apply show to a  Maybe Int . If we have Just n", we want to show the underlying w n. But if we have A, we return the empty string instead of (for example) "Nothing":maybe "" show (Just 5)"5"maybe "" show Nothing""`The ` function returns " iff its argument is of the form Just _.Examples Basic usage:isJust (Just 3)TrueisJust (Just ())TrueisJust NothingFalse7Only the outer constructor is taken into consideration:isJust (Just Nothing)TrueaThe a function returns  iff its argument is .Examples Basic usage:isNothing (Just 3)FalseisNothing (Just ())FalseisNothing NothingTrue7Only the outer constructor is taken into consideration:isNothing (Just Nothing)FalsebThe b( function extracts the element out of a ) and throws an error if its argument is .Examples Basic usage:fromJust (Just 1)12 * (fromJust (Just 10))202 * (fromJust Nothing)&*** Exception: Maybe.fromJust: NothingcThe c( function takes a default value and and } value. If the } is S, it returns the default values; otherwise, it returns the value contained in the }.Examples Basic usage:#fromMaybe "" (Just "Hello, World!")"Hello, World!"fromMaybe "" Nothing""$Read an integer from a string using  readMaybe5. If we fail to parse an integer, we want to return 0 by default:import Text.Read ( readMaybe )fromMaybe 0 (readMaybe "5")5fromMaybe 0 (readMaybe "")0dThe d, function returns an empty list when given $ or a singleton list when not given .Examples Basic usage:maybeToList (Just 7)[7]maybeToList Nothing[] One can use dW to avoid pattern matching when combined with a function that (safely) works on lists:import Text.Read ( readMaybe )!sum $ maybeToList (readMaybe "3")3 sum $ maybeToList (readMaybe "")0eThe e function returns  on an empty list or  a where a" is the first element of the list.Examples Basic usage:listToMaybe []NothinglistToMaybe [9]Just 9listToMaybe [1,2,3]Just 1 Composing d with e2 should be the identity on singleton/empty lists:maybeToList $ listToMaybe [5][5]maybeToList $ listToMaybe [][],But not on lists with more than one element:!maybeToList $ listToMaybe [1,2,3][1]fThe f function takes a list of }!s and returns a list of all the  values.Examples Basic usage:#catMaybes [Just 1, Nothing, Just 3][1,3]When constructing a list of } values, fV can be used to return all of the "success" results (if the list is the result of a , then g would be more appropriate):import Text.Read ( readMaybe )4[readMaybe x :: Maybe Int | x <- ["1", "Foo", "3"] ][Just 1,Nothing,Just 3]@catMaybes $ [readMaybe x :: Maybe Int | x <- ["1", "Foo", "3"] ][1,3]gThe g function is a version of c which can throw out elements. In particular, the functional argument returns something of type } b. If this is 8, no element is added on to the result list. If it is  b, then b! is included in the result list.ExamplesUsing g f x is a shortcut for f $  f x in most cases:import Text.Read ( readMaybe )3let readMaybeInt = readMaybe :: String -> Maybe Int'mapMaybe readMaybeInt ["1", "Foo", "3"][1,3].catMaybes $ map readMaybeInt ["1", "Foo", "3"][1,3]If we map the 1 constructor, the entire list should be returned:mapMaybe Just [1,2,3][1,2,3] _`abcdefg$ }_`abcdefg }_`abcedfg _`abcdefg$'(c) The University of Glasgow 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyBT2Concatenate a list of lists.j, applied to a predicate and a list, returns the list of those elements that satisfy the predicate; i.e., !filter p xs = [ x | x <- xs, p x] takes two lists and returns a list of corresponding pairs. If one input list is short, excess elements of the longer list are discarded. is right-lazy: zip [] _|_ = []h=Extract the first element of a list, which must be non-empty.iHDecompose a list into its head and tail. If the list is empty, returns $. If the list is non-empty, returns  (x, xs) , where x is the head of the list and xs its tail.jGExtract the elements after the head of a list, which must be non-empty.kGExtract the last element of a list, which must be finite and non-empty.lSReturn all the elements of a list except the last one. The list must be non-empty.mTest whether a list is empty.nO(n). n+ returns the length of a finite list as an w). It is an instance of the more general k6, the result type of which may be any kind of number.oo, applied to a binary operator, a starting value (typically the left-identity of the operator), and a list, reduces the list using the binary operator, from left to right: Efoldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xnThe list must be finite.pA strict version of o.qq is a variant of oS that has no starting value argument, and thus must be applied to non-empty lists.rA strict version of qsThe s7 function computes the sum of a finite list of numbers.tThe t; function computes the product of a finite list of numbers.uu is similar to oA, but returns a list of successive reduced values from the left: @scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...] Note that $last (scanl f z xs) == foldl f z xs.vv is a variant of u% that has no starting value argument: .scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]w#A strictly accumulating version of uxx is a variant of S that has no starting value argument, and thus must be applied to non-empty lists.yy is the right-to-left dual of u . Note that $head (scanr f z xs) == foldr f z xs.zz is a variant of y% that has no starting value argument.{{{ returns the maximum value from a list, which must be non-empty, finite, and of an ordered type. It is a special case of kG, which allows the programmer to supply their own comparison function.||{ returns the minimum value from a list, which must be non-empty, finite, and of an ordered type. It is a special case of kG, which allows the programmer to supply their own comparison function.}} f x7 returns an infinite list of repeated applications of f to x: %iterate f x == [x, f x, f (f x), ...]~~ x is an infinite list, with x the value of every element. n x is a list of length n with xE the value of every element. It is an instance of the more general k , in which n may be of any integral type. ties a finite list into a circular one, or equivalently, the infinite repetition of the original list. It is the identity on infinite lists., applied to a predicate p and a list xs2, returns the longest prefix (possibly empty) of xs of elements that satisfy p: ktakeWhile (< 3) [1,2,3,4,1,2,3,4] == [1,2] takeWhile (< 9) [1,2,3] == [1,2,3] takeWhile (< 0) [1,2,3] == [] p xs$ returns the suffix remaining after  p xs: sdropWhile (< 3) [1,2,3,4,5,1,2,3] == [3,4,5,1,2,3] dropWhile (< 9) [1,2,3] == [] dropWhile (< 0) [1,2,3] == [1,2,3] n, applied to a list xs, returns the prefix of xs of length n, or xs itself if n > n xs: take 5 "Hello World!" == "Hello" take 3 [1,2,3,4,5] == [1,2,3] take 3 [1,2] == [1,2] take 3 [] == [] take (-1) [1,2] == [] take 0 [1,2] == []&It is an instance of the more general k , in which n may be of any integral type. n xs returns the suffix of xs after the first n elements, or [] if n > n xs: drop 6 "Hello World!" == "World!" drop 3 [1,2,3,4,5] == [4,5] drop 3 [1,2] == [] drop 3 [] == [] drop (-1) [1,2] == [1,2] drop 0 [1,2] == [1,2]&It is an instance of the more general k , in which n may be of any integral type. n xs( returns a tuple where first element is xs prefix of length n1 and second element is the remainder of the list: splitAt 6 "Hello World!" == ("Hello ","World!") splitAt 3 [1,2,3,4,5] == ([1,2,3],[4,5]) splitAt 1 [1,2,3] == ([1],[2,3]) splitAt 3 [1,2,3] == ([1,2,3],[]) splitAt 4 [1,2,3] == ([1,2,3],[]) splitAt 0 [1,2,3] == ([],[1,2,3]) splitAt (-1) [1,2,3] == ([],[1,2,3])It is equivalent to ( n xs,  n xs) when n is not _|_ (splitAt _|_ xs = _|_). $ is an instance of the more general k , in which n may be of any integral type., applied to a predicate p and a list xsM, returns a tuple where first element is longest prefix (possibly empty) of xs of elements that satisfy p1 and second element is the remainder of the list: {span (< 3) [1,2,3,4,1,2,3,4] == ([1,2],[3,4,1,2,3,4]) span (< 9) [1,2,3] == ([1,2,3],[]) span (< 0) [1,2,3] == ([],[1,2,3]) p xs is equivalent to ( p xs,  p xs), applied to a predicate p and a list xsM, returns a tuple where first element is longest prefix (possibly empty) of xs of elements that do not satisfy p1 and second element is the remainder of the list: ~break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4]) break (< 9) [1,2,3] == ([],[1,2,3]) break (> 9) [1,2,3] == ([1,2,3],[]) p is equivalent to  ( . p). xs returns the elements of xs in reverse order. xs must be finite.C returns the conjunction of a Boolean list. For the result to be , the list must be finite; , however, results from a 7 value at a finite index of a finite or infinite list.C returns the disjunction of a Boolean list. For the result to be , the list must be finite; , however, results from a 7 value at a finite index of a finite or infinite list.#Applied to a predicate and a list, X determines if any element of the list satisfies the predicate. For the result to be , the list must be finite; , however, results from a _ value for the predicate applied to an element at a finite index of a finite or infinite list.#Applied to a predicate and a list, V determines if all elements of the list satisfy the predicate. For the result to be , the list must be finite; , however, results from a _ value for the predicate applied to an element at a finite index of a finite or infinite list.I is the list membership predicate, usually written in infix form, e.g.,  x `elem` xs. For the result to be , the list must be finite; -, however, results from an element equal to x6 found at a finite index of a finite or infinite list. is the negation of .  key assocs' looks up a key in an association list.7Map a function over a list and concatenate the results.YList index (subscript) operator, starting from 0. It is an instance of the more general k-, which takes an index of any integral type.@ takes three lists and returns a list of triples, analogous to . generalises i by zipping with the function given as the first argument, instead of a tupling function. For example,  (+)D is applied to two lists to produce the list of corresponding sums. is right-lazy: zipWith f [] _|_ = []The  function takes a function which combines three elements, as well as three lists and returns a list of their point-wise combination, analogous to .] transforms a list of pairs into a list of first components and a list of second components.The I function takes a list of triples and returns three lists, analogous to .Lh%ijk&lmn'()*opqrstu+,vw-.xy/0z{|}1~23456789:;<=>6hijklmnopqrstuvwxyz{|}~=Lh%ijk&lmn'()*opqrstu+,vw-.xy/0z{|}1~23456789:;<=>449 ((c) The University of Glasgow, 1992-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) Trustworthy/B `!Conversion of values to readable s.Derived instances of `P have the following properties, which are compatible with derived instances of :The result of j is a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used.?If the constructor is defined to be an infix operator, then 4 will produce infix applications of the constructor.hthe representation will be enclosed in parentheses if the precedence of the top-level constructor in x is less than d* (associativity is ignored). Thus, if d is 0; then the result is never surrounded in parentheses; if d is 11N it is always surrounded in parentheses, unless it is an atomic expression.8If the constructor is defined using record syntax, then p will produce the record-syntax form, with the fields given in the same order as the original declaration.#For example, given the declarations 8infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree athe derived instance of ` is equivalent to ~instance (Show a) => Show (Tree a) where showsPrec d (Leaf m) = showParen (d > app_prec) $ showString "Leaf " . showsPrec (app_prec+1) m where app_prec = 10 showsPrec d (u :^: v) = showParen (d > up_prec) $ showsPrec (up_prec+1) u . showString " :^: " . showsPrec (up_prec+1) v where up_prec = 5!Note that right-associativity of :^: is ignored. For example, (Leaf 1 :^: Leaf 2 :^: Leaf 3) produces the string  "Leaf 1 :^: (Leaf 2 :^: Leaf 3)".Convert a value to a readable . should satisfy the law 0showsPrec d x r ++ s == showsPrec d x (r ++ s)Derived instances of  and ` satisfy the following:(x,"") is an element of ( d ( d x "")). That is,  parses the string produced by , and delivers the value that  started with.A specialised variant of <, using precedence context zero, and returning an ordinary . The method  is provided to allow the programmer to give a specialised way of showing lists of values. For example, this is used by the predefined ` instance of the t type, where values of type H should be shown in double quotes, rather than between square brackets.The shows7 functions return a function that prepends the output  to an existing R. This allows constant-time concatenation of results using function composition.equivalent to  with a precedence of 0.utility function converting a tB to a show function that simply prepends the character unchanged.utility function converting a ? to a show function that simply prepends the string unchanged.Sutility function that surrounds the inner show function with parentheses when the s parameter is .Convert a character to a string using only printable characters, using Haskell source-language escape conventions. For example: !showLitChar '\n' s = "\\n" ++ s?Same as O, but for strings It converts the string to a string using Haskell escape conventions for non-printable characters. Does not add double-quotes around the whole thing; the caller should do that. The main difference from showLitChar (apart from the fact that the argument is a string not a list) is that we must escape double-quotes@Like ? (expand escape characters using Haskell escape conventions), but * break the string into multiple lines * wrap the entire thing in double quotes Example: (showMultiLineString "hellongoodbyenblah" returns %[""hello\n\", "\goodbyen\", "\blah""] Convert an w in the range 0..15$ to the corresponding single digit tU. This function fails on other inputs, and generates lower-case hexadecimal digits.0`ABCDEF?@GHIJKLMNOPQRSTUVWXYZ[\]^_`abc`ABCF?@HIJ-`ABCDEF?@GHIJKLMNOPQRSTUVWXYZ[\]^_`abc0 TrustworthyBThe  method restricted to the type %.((c) The University of Glasgow, 1992-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions) TrustworthyB "!Used in Haskell's translation of [n..].#!Used in Haskell's translation of [n,n'..].$!Used in Haskell's translation of [n..m].%!Used in Haskell's translation of  [n,n'..m].QThe Q? class is used to name the upper and lower limits of a type. [ is not a superclass of QP since types that are not totally ordered may also have upper and lower bounds.The Q1 class may be derived for any enumeration type; ( is the first constructor listed in the data declaration and  is the last. QV may also be derived for single-constructor datatypes whose constituent types are in Q.RClass R2 defines operations on sequentially ordered types.The enumFromG... methods are used in Haskell's translation of arithmetic sequences. Instances of R may be derived for any enumeration type (types whose constructors have no fields). The nullary constructors are assumed to be numbered left-to-right by  from 0 through n-1. See Chapter 10 of the Haskell Report for more details.*For any type that is an instance of class Q as well as R, the following should hold: The calls   and  % should result in a runtime error. and m should give a runtime error if the result value is not representable in the result type. For example,  7 :: s is an error." and #3 should be defined with an implicit bound, thus:  enumFrom x = enumFromTo x maxBound enumFromThen x y = enumFromThenTo x y bound where bound | fromEnum y >= fromEnum x = maxBound | otherwise = minBound.the successor of a value. For numeric types,  adds 1.0the predecessor of a value. For numeric types,  subtracts 1.Convert from an w.Convert to an w'. It is implementation-dependent what A returns when applied to a value that is too large to fit in an w.M"#$%QRdefghijklmnopqrstuvwxyz{|}~QR"#%$defghiCQR"#$%defghijklmnopqrstuvwxyz{|}~((c) The University of Glasgow, 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyB !Conversion from a  (that is  |4). A floating literal stands for an application of ! to a value of type , so such literals have type (U a) => a.6$general coercion from integral types7$general coercion to fractional types8conversion to |9@the rational equivalent of its real argument with full precisionU-Fractional numbers, supporting real division.V.Integral numbers, supporting integer division._#Extracting components of fractions.9Rational numbers, with numerator and denominator of some V type.EArbitrary-precision rational numbers, represented as a ratio of two |: values. A rational number may be constructed using the  operator. The function  takes a real fractional number x and returns a pair (n,f) such that x = n+f, and:n- is an integral number with the same sign as x; andf. is a fraction with the same type and sign as x', and with absolute value less than 1.The default definitions of the , ,  and  functions are in terms of . x returns the integer nearest x between zero and x x returns the nearest integer to x; the even integer if x$ is equidistant between two integers x) returns the least integer not less than x x/ returns the greatest integer not greater than xfractional divisionreciprocal fraction&integer division truncated toward zerointeger remainder, satisfying !(x `quot` y)*y + (x `rem` y) == x3integer division truncated toward negative infinityinteger modulus, satisfying  (x `div` y)*y + (x `mod` y) == x simultaneous  and  simultaneous  and  is a subsidiary function used only in this module. It normalises a ratio by dividing both numerator and denominator by their greatest common divisor.(Forms the ratio of two integral numbers.Extract the numerator of the ratio in reduced form: the numerator and denominator have no common factor and the denominator is positive.Extract the denominator of the ratio in reduced form: the numerator and denominator have no common factor and the denominator is positive.Converts a possibly-negative ] value to a string./raise a number to a non-negative integral power#raise a number to an integral power x y$ is the non-negative factor of both x and y" of which every common factor of x and y is also a factor; for example  4 2 = 2,  (-4) 6 = 2,  0 4 = 4.  0 0 = 0U. (That is, the common divisor that is "greatest" in the divisibility preordering.)2Note: Since for signed fixed-width integer types, R  < 09, the result may be negative if one of the arguments is & (and necessarily is if the other is 0 or ) for such types. x y, is the smallest positive integer that both x and y divide.D!6789UV]_(a function that can show unsigned values'the precedence of the enclosing contextthe value to show767U!V8]9_367U!V8]9_77777788((c) The University of Glasgow, 1992-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)UnsafeBOT;The strict state-transformer monad. A computation of type  s a* transforms an internal state indexed by s, and returns a value of type a. The s parameter is either7an uninstantiated type variable (inside invocations of ), or (inside invocations of )).CIt serves to keep the internal states of different invocations of 3 separate from each other and from invocations of ).The * and +^ operations are strict in the state (though not in values stored in the state). For example,  (writeSTRef _|_ v >>= f) = _|_oAllow the result of a state transformer computation to be used (lazily) inside the computation. Note that if f is strict,  f = _|_.CReturn the value computed by a state transformer computation. The forall- ensures that the internal state used by the 9 computation is inaccessible to the rest of the program.   ((c) The University of Glasgow, 1994-2000see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions)UnsafeBEaThe a 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)q of each of these operations is a pair specifying the lower and upper bounds of a contiguous subrange of values.SAn implementation is entitled to assume the following laws about these operations: (l,u) i ==  i ( (l,u))   (l,u)   (l,u) i == i, when  (l,u) i ( (l,u)) ( (l,u))) == [0.. (l,u)-1]   (l,u) == n ( (l,u))  )Mutable, boxed, non-strict arrays in the , monad. The type arguments are as follows:s&: the state variable argument for the  typei8: the index type of the array (should be an instance of a)e : the element type of the array.AThe type of immutable non-strict (boxed) arrays with indices in i and elements in e.>The list of values in the subrange defined by a bounding pair.,The position of a subscript in the subrange.Like 2, but without checking that the value is in range.Returns B the given subscript lies in the range defined the bounding pair.4The size of the subrange defined by a bounding pair.like 9, but without checking that the upper bound is in range.jConstruct an array with the specified bounds and containing values for given indices within these bounds.uThe array is undefined (i.e. bottom) if any index in the list is out of bounds. The Haskell 2010 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.6Because the indices must be checked for these errors,  is strict in the bounds argument and in the indices of the association list, but non-strict 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 ? still yields the bounds with which the array was constructed.NConstruct an array from a pair of bounds and a list of values in index order.)The value at the given index in an array./The bounds with which an array was constructed.$The number of elements in the array.3The list of indices of an array in ascending order.0The list of elements of an array in index order.A right fold over the elementsA left fold over the elements%A strict right fold over the elements$A strict left fold over the elements4A left fold over the elements with no starting value5A right fold over the elements with no starting value4The list of associations of an array in index order.The H function deals with repeated indices in the association list using an accumulating functionz 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: xhist :: (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 v is strict in the values, as well as the indices, in the association list. Thus, unlike ordinary arrays built with 9, accumulated arrays should not in general be recursive.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]]4is the same matrix, except with the diagonal zeroed.<Repeated indices in the association list are handled as for : Haskell 2010 specifies that the resulting array is undefined (i.e. bottom), but GHC's implementation uses the last association for each index. f{ takes an array and an association list and accumulates pairs from the list into the array with the accumulating function f. Thus  can be defined using : <accumArray f z b = accum f (array b [(i, z) | i <- range b]) 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 , from the  instance of the Y class.Na a pair of bounds, each of the index type of the array. These bounds are the lowest and highest indices in the array, in that order. For example, a one-origin vector of length '10'' has bounds '(1,10)', and a one-origin '10' by '10'% matrix has bounds '((1,1),(10,10))'. a list of  associations of the form (index, value). Typically, this list will be expressed as a comprehension. An association '(i, x)' defines the value of the array at index i to be x.accumulating function initial valuebounds of the arrayassociation list     >aFa     9 9 ((c) The University of Glasgow, 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)UnsafeBa value of type  STRef s a' is a mutable variable in state thread s, containing a value of type a Build a new  in the current state threadRead the value of an Write a new value into an #(c) The University of Glasgow, 2003see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions) Trustworthy/3Unicode General Categories (column 2 of the UnicodeData table) in the order they are listed in the Unicode standard (the Unicode Character Database, in particular).Examples Basic usage::t OtherLetterOtherLetter :: GeneralCategoryS instance:"UppercaseLetter == UppercaseLetterTrue"UppercaseLetter == LowercaseLetterFalse[ instance:NonSpacingMark <= MathSymbolTrueR instance:.enumFromTo ModifierLetter SpacingCombiningMark@[ModifierLetter,OtherLetter,NonSpacingMark,SpacingCombiningMark]Read instance:)read "DashPunctuation" :: GeneralCategoryDashPunctuationread "17" :: GeneralCategory%*** Exception: Prelude.read: no parse` instance:show EnclosingMark"EnclosingMark"Q instance:minBound :: GeneralCategoryUppercaseLettermaxBound :: GeneralCategory NotAssigneda instance:import Data.Ix ( index )&index (OtherLetter,Control) FinalQuote12"index (OtherLetter,Control) Format#*** Exception: Error in array indexLu: Letter, UppercaseLl: Letter, LowercaseLt: Letter, TitlecaseLm: Letter, ModifierLo: Letter, OtherMn: Mark, Non-SpacingMc: Mark, Spacing CombiningMe: Mark, EnclosingNd: Number, DecimalNl: Number, LetterNo: Number, OtherPc: Punctuation, ConnectorPd: Punctuation, DashPs: Punctuation, OpenPe: Punctuation, ClosePi: Punctuation, Initial quotePf: Punctuation, Final quotePo: Punctuation, OtherSm: Symbol, MathSc: Symbol, CurrencySk: Symbol, ModifierSo: Symbol, OtherZs: Separator, SpaceZl: Separator, LineZp: Separator, ParagraphCc: Other, ControlCf: Other, FormatCs: Other, SurrogateCo: Other, Private UseCn: Other, Not AssignedCThe Unicode general category of the character. This relies on the R instance of `, which must remain in the same order as the categories are presented in the Unicode standard.Examples Basic usage:generalCategory 'a'LowercaseLettergeneralCategory 'A'UppercaseLettergeneralCategory '0' DecimalNumbergeneralCategory '%'OtherPunctuationgeneralCategory '&e' OtherSymbolgeneralCategory '\31'ControlgeneralCategory ' 'SpaceiSelects the first 128 characters of the Unicode character set, corresponding to the ASCII character set.xSelects the first 256 characters of the Unicode character set, corresponding to the ISO 8859-1 (Latin-1) character set.CSelects ASCII lower-case letters, i.e. characters satisfying both  and .CSelects ASCII upper-case letters, i.e. characters satisfying both  and .Returns > for any Unicode space character, and the control characters \t, \n, \r, \f, \v.Selects ASCII digits, i.e. '0'..'9'.!Selects ASCII octal digits, i.e. '0'..'7'.(Selects ASCII hexadecimal digits, i.e. '0'..'9', 'a'..'f', 'A'..'F'.dSelects Unicode punctuation characters, including various kinds of connectors, brackets and quotes.This function returns + if its argument has one of the following s, or  otherwise:"These classes are defined in the  @http://www.unicode.org/reports/tr44/tr44-14.html#GC_Values_TableUnicode Character Database_, part of the Unicode standard. The same document defines what is and is not a "Punctuation".Examples Basic usage:isPunctuation 'a'FalseisPunctuation '7'FalseisPunctuation '&e'FalseisPunctuation '"'TrueisPunctuation '?'TrueisPunctuation ' 'TruePSelects Unicode symbol characters, including mathematical and currency symbols.This function returns + if its argument has one of the following s, or  otherwise:"These classes are defined in the  @http://www.unicode.org/reports/tr44/tr44-14.html#GC_Values_TableUnicode Character DatabaseZ, part of the Unicode standard. The same document defines what is and is not a "Symbol".Examples Basic usage: isSymbol 'a'False isSymbol '6'False isSymbol '='TrueaThe definition of "math symbol" may be a little counter-intuitive depending on one's background: isSymbol '+'True isSymbol '-'FalseSelects alphabetic Unicode characters (lower-case, upper-case and title-case letters, plus letters of caseless scripts and modifiers letters). This function is equivalent to %.7Selects alphabetic or numeric digit Unicode characters.[Note that numeric digits outside the ASCII range are selected by this function but not by k. Such digits may be part of identifiers but are not used by the printer and reader to represent numbers.dSelects control characters, which are the non-printing characters of the Latin-1 subset of Unicode.aSelects printable Unicode characters (letters, numbers, marks, punctuation, symbols and spaces).Selects upper-case or title-case alphabetic Unicode characters (letters). Title case is used by a small number of letter ligatures like the single-character form of Lj.;Selects lower-case alphabetic Unicode characters (letters).lConvert a letter to the corresponding lower-case letter, if any. Any other character is returned unchanged.lConvert a letter to the corresponding upper-case letter, if any. Any other character is returned unchanged.Convert a letter to the corresponding title-case or upper-case letter, if any. (Title case differs from upper case only for a small number of ligature letters.) Any other character is returned unchanged.> !"#$%4  !"#$%"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportableSafeWShow a list (using square brackets and commas), given a function for showing elements. ` `"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportable TrustworthyAn infix synonym for ,.,The name of this operator is an allusion to $-. Note the similarities between their types: Y ($) :: (a -> b) -> a -> b (<$>) :: Functor f => (a -> b) -> f a -> f bWhereas $ is function application, ( is function application lifted over a Y.ExamplesConvert from a Maybe Int to a Maybe String using show:show <$> NothingNothingshow <$> Just 3Just "3"Convert from an Either Int Int to an Either Int String using show:show <$> Left 17Left 17show <$> Right 17 Right "17"Double each element of a list:(*2) <$> [1,2,3][2,4,6]Apply even! to the second element of a pair:even <$> (2,2)(2,True)Flipped version of ).ExamplesReplace the contents of a Maybe Int with a constant String:Nothing $> "foo"NothingJust 90210 $> "foo" Just "foo"Replace the contents of an Either Int Int with a constant String, resulting in an Either Int String:Left 8675309 $> "foo" Left 8675309Right 8675309 $> "foo" Right "foo"/Replace each element of a list with a constant String:[1,2,3] $> "foo"["foo","foo","foo"]5Replace the second element of a pair with a constant String:(1,2) $> "foo" (1,"foo") valueO discards or ignores the result of evaluation, such as the return value of an  action.ExamplesReplace the contents of a Maybe Int with unit: void NothingNothing void (Just 3)Just ()Replace the contents of an Either Int Int with unit, resulting in an Either Int '()':void (Left 8675309) Left 8675309void (Right 8675309)Right ()*Replace every element of a list with unit: void [1,2,3] [(),(),()]/Replace the second element of a pair with unit: void (1,2)(1,())Discard the result of an  action:mapM print [1,2]12[(),()]void $ mapM print [1,2]12Y),Y,))44 GNils Anders Danielsson 2006 , Alexander Berntsen 20144BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimentalportable Trustworthy f* is the least fixed point of the function f, i.e. the least defined x such that f x = x.(*) `on` f = \x y -> f x * f y.Typical usage: k (compare `on` fst).Algebraic properties: (*) `on` 7 = (*) (if  (*) " {", 8 "}) &((*) `on` f) `on` g = (*) `on` (f . g) : on f . : on g = : on (g . f) is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator , which allows  to be nested in .789:789:01 "(c) The University of Glasgow 2005/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable TrustworthyS& S& "(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportableUnsafe"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable TrustworthyCase analysis for the s type.  x y p evaluates to x when p is , and evaluates to y when p is .This is equivalent to if p then y else x[; that is, one can think of it as an if-then-else construct with its arguments reordered.Examples Basic usage:bool "foo" "bar" True"bar"bool "foo" "bar" False"foo" Confirm that  x y p and if p then y else x are equivalent:"let p = True; x = "bar"; y = "foo" bool x y p == if p then y else xTrue let p = False bool x y p == if p then y else xTrues s 94BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimental not portableSafe+,DQRType-level "not"Type-level "or"Type-level "and"  Type-level If.  If True a b ==> a;  If False a b ==> b    23:"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable TrustworthyB  The  9 class denotes types with a finite, fixed number of bits. oReturn the number of bits in the type of the argument. The actual value of the argument is ignored. Moreover,  * is total, in contrast to the deprecated  function it replaces.   =   =  .    ACount number of zero bits preceding the most significant set bit.   ( :: a) = finiteBitSize ( :: a)  & can be used to compute log base 2 via  logBase2 x =   x - 1 -   x Note: The default implementation for this method is intentionally naive. However, the instances provided for the primitive integral types are implemented using CPU specific machine instructions. BCount number of zero bits following the least significant set bit.   ( :: a) = finiteBitSize ( :: a)   . ( =    The related  +http://en.wikipedia.org/wiki/Find_first_setfind-first-set operation can be expressed in terms of   as follows findFirstSet x = 1 +   x Note: The default implementation for this method is intentionally naive. However, the instances provided for the primitive integral types are implemented using CPU specific machine instructions.The 6 class defines bitwise operations over integral types.GBits are numbered from 0 with bit 0 being the least significant bit. Bitwise "and" Bitwise "or" Bitwise "xor"%Reverse all the bits in the argument  x i shifts x left by i bits if i" is positive, or right by -i bits otherwise. Right shifts perform sign extension on signed number types; i.e. they fill the top bits with 1 if the x* is negative and with 0 otherwise.+An instance can define either this unified  or  and  J, depending on which is more convenient for the type in question.  x i rotates x left by i bits if i" is positive, or right by -i bits otherwise.For unbounded types like |,  is equivalent to .+An instance can define either this unified  or " and #J, depending on which is more convenient for the type in question. " is the value with all bits unset.<The following laws ought to hold (for all valid bit indices n):   n ==    n ==  n   n == False $  == 0This method uses  ( 0) 0A as its default implementation (which ought to be equivalent to % for types which possess a 0th bit).bit i is a value with the i$th bit set and all other bits clear.Can be implemented using % if a is also an instance of Z. See also . x `setBit` i is the same as  x .|. bit ix `clearBit` i is the same as x .&. complement (bit i)x `complementBit` i is the same as  x `xor` bit iReturn  if the nth bit of the argument is 1Can be implemented using & if a is also an instance of Z.Return the number of bits in the type of the argument. The actual value of the argument is ignored. Returns Nothing for types that do not have a fixed bitsize, like |.{Return the number of bits in the type of the argument. The actual value of the argument is ignored. The function G is undefined for types that do not have a fixed bitsize, like |.Return X if the argument is a signed type. The actual value of the argument is ignored ]Shift the argument left by the specified number of bits (which must be non-negative).'An instance can define either this and   or the unified J, depending on which is more convenient for the type in question. Shift the argument left by the specified number of bits. The result is undefined for negative shift amounts and shift amounts greater or equal to the . Defaults to * unless defined explicitly by an instance. Shift the first argument right by the specified number of bits. The result is undefined for negative shift amounts and shift amounts greater or equal to the .nRight shifts perform sign extension on signed number types; i.e. they fill the top bits with 1 if the x* is negative and with 0 otherwise.'An instance can define either this and  or the unified J, depending on which is more convenient for the type in question. !Shift the first argument right by the specified number of bits, which must be non-negative an smaller than the number of bits in the type.nRight shifts perform sign extension on signed number types; i.e. they fill the top bits with 1 if the x* is negative and with 0 otherwise. Defaults to  * unless defined explicitly by an instance."^Rotate the argument left by the specified number of bits (which must be non-negative).'An instance can define either this and # or the unified J, depending on which is more convenient for the type in question. #_Rotate the argument right by the specified number of bits (which must be non-negative).'An instance can define either this and " or the unified J, depending on which is more convenient for the type in question. ${Return the number of set bits in the argument. This number is known as the population count or the Hamming weight.Can be implemented using ' if a is also an instance of Z.%Default implementation for . Note that: bitDefault i = 1  i&Default implementation for . Note that: 'testBitDefault x i = (x .&. bit i) /= 0'Default implementation for $.zThis implementation is intentionally naive. Instances are expected to provide an optimized implementation for their size.(Attempt to convert an V type a to an V type b- using the size of the types as measured by  methods.&A simpler version of this function is: toIntegral :: (Integral a, Integral b) => a -> Maybe b toIntegral x | toInteger x == y = Just (fromInteger y) | otherwise = Nothing where y = toInteger x$This version requires going through |&, which can be inefficient. However, toIntegralSized\ is optimized to allow GHC to statically determine the relative type sizes (as measured by  and ) and avoid going through |+ for many types. (The implementation uses 6+, which is itself optimized with rules for base types but may go through | for some type pairs.)& if the size of a is <= the size of b, where size is measured by  and .'     !"#$%&'(&)*+,-./     !"#$%&'( !"#$    %&'(     !"#$%&'(&)*+,-./ 756888 8"8#8i(c) The University of Glasgow 1994-2002 Portions obtained from hbc (c) Lennart Augusstsonsee libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) Trustworthy BT=Trigonometric and hyperbolic functions and related functions.^TEfficient, machine-independent access to the components of a floating-point number.0Ga constant function, returning the radix of the representation (often 2)18a constant function, returning the number of digits of 0 in the significand2Ua constant function, returning the lowest and highest values the exponent may assume3 The function 3R applied to a real floating-point number returns the significand expressed as an |+ and an appropriately scaled exponent (an w). If 3 x yields (m,n), then x is equal in value to m*b^^n, where b7 is the floating-point radix, and furthermore, either m and n are both zero or else  b^(d-1) <= R m < b^d, where d is the value of 1 x. In particular, 3 0 = (0,0).. If the type contains a negative zero, also 3 (-0.0) = (0,0).  The result of 3 x is unspecified if either of 8 x or 9 x is .44 performs the inverse of 3 in the sense that for finite x with the exception of -0.0, uncurry 4 (3 x) = x. 4 m nD is one of the two closest representable floating-point numbers to m*b^^n (or  Infinity2 if overflow occurs); usually the closer, but if mK contains too many bits, the result may be rounded in the wrong direction.55( corresponds to the second component of 3. 5 0 = 0 and for finite nonzero x, 5 x = snd (3 x) + 1 x. If x= is a finite floating-point number, it is equal in value to 6 x * b ^^ 5 x, where bL is the floating-point radix. The behaviour is unspecified on infinite or NaN values.6The first component of 3', scaled to lie in the open interval (-1,1 ), either 0.0 or of absolute value >= 1/b , where bK is the floating-point radix. The behaviour is unspecified on infinite or NaN values.7Cmultiplies a floating-point number by an integer power of the radix86 if the argument is an IEEE "not-a-number" (NaN) value99 if the argument is an IEEE infinity or negative infinity:E if the argument is too small to be represented in normalized format;) if the argument is an IEEE negative zero<1 if the argument is an IEEE floating point number=Ua version of arctangent taking two real floating-point arguments. For real floating x and y, = y x\ computes the angle (from the positive x-axis) of the vector from the origin to the point (x,y). = y x returns a value in the range [-pi, pi\]. It follows the Common Lisp semantics for the origin when signed zeroes are supported. = y 1, with y in a type that is ^", should return the same value as I y. A default definition of =K is provided, but implementors can provide a more accurate implementation.P P x computes @ (1 + x)D, but provides more precise results for small (absolute) values of x if possible.Q Q x computes ? x - 1D, but provides more precise results for small (absolute) values of x if possible.R R x computes @ (1 + ? x)1, but provides more precise results if possible. Examples:if x is a large negative number, @ (1 + ? x)/ will be imprecise for the reasons given in P.if ? x is close to -1, @ (1 + ? x)/ will be imprecise for the reasons given in Q.S S x computes @ (1 - ? x)1, but provides more precise results if possible. Examples:if x is a large negative number, @ (1 - ? x)/ will be imprecise for the reasons given in P.if ? x is close to 1, @ (1 - ? x)/ will be imprecise for the reasons given in Q.TShow a signed ^k value to full precision using standard decimal notation for arguments whose absolute value lies between 0.1 and  9,999,999$, and scientific notation otherwise.UU! takes a base and a non-negative ^K number, and returns a list of digits and an exponent. In particular, if x>=0, and *floatToDigits base x = ([d1,d2,...,dn], e)then  n >= 1 x = 0.d1d2...dn * (base**e) 0 <= di <= base-1V Converts a  value into any type in class ^.'(T^)*+,0123456789:;<=>?@ABCDEFGHIJKLMNOPQRS-./0123456789:T;<=UV>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw(a function that can show unsigned values'the precedence of the enclosing contextthe value to showxyz{|}~'(T>?@ABCDEFGHIJKLMNOPQRS^0123456789:<;=CuDv),*+-./0123456789:T;<=UV>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxd'(T>?@ABCDEFGHIJKLMNOPQRS^0123456789:;<=)*+,-./0123456789:T;<=UV>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~B8M(C) 2015 David Luposchainsky, (C) 2015 Herbert Valerio Riedel BSD-style (see the file LICENSE)libraries@haskell.org provisionalportable Trustworthyd When a value is bound in do1-notation, the pattern on the left hand side of <-K might not match. In this case, this class provides a function to recover.A W without a d instance may only be used in conjunction with pattern that always match, such as newtypes, tuples, data types with only a single data constructor, and irrefutable patterns (~pat). Instances of d# should satisfy the following law: fail s should be a left zero for >>=, fail s >>= f = fail s If your W is also  MonadPlus, a popular definition is fail _ = mzero /dWXYd/d/d/WXY;"(c) The University of Glasgow 2002/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional-non-portable (local universal quantification) Trustworthy2BOT"[A parser for a type a*, represented as a function that takes a * and returns a list of possible parses as (a,) pairs.qNote that this kind of backtracking parser is very inefficient; reading a large structure may be quite slow (cf Z).\LConsumes and returns the next character. Fails if there is no input left.]PLook-ahead: returns the part of the input that is left, without consuming it.^ Always fails._Symmetric choice.`}Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.azTransforms a parser into one that does the same, but in addition returns the exact characters read. IMPORTANT NOTE: a] gives a runtime error if its first argument is built using any occurrences of readS_to_P.bTConsumes and returns the next character, if it satisfies the specified predicate.c+Parses and returns the specified character.d'Succeeds iff we are at the end of inpute(Parses and returns the specified string.fParses the first zero or more characters satisfying the predicate. Always succeds, exactly once having consumed all the characters Hence NOT the same as (many (satisfy p))gParses the first one or more characters satisfying the predicate. Fails if none, else succeeds exactly once having consumed all the characters Hence NOT the same as (many1 (satisfy p))h+Combines all parsers in the specified list.iSkips all whitespace.j count n p parses n occurrences of p/ in sequence. A list of results is returned.kbetween open close p parses open, followed by p and finally close. Only the value of p is returned.l option x p will either parse p or return x without consuming any input.m optional p optionally parses p and always returns ().n4Parses zero or more occurrences of the given parser.o3Parses one or more occurrences of the given parser.pLike n, but discards the result.qLike o, but discards the result.r sepBy p sep$ parses zero or more occurrences of p, separated by sep*. Returns a list of values returned by p.s sepBy1 p sep# parses one or more occurrences of p, separated by sep*. Returns a list of values returned by p.t endBy p sep$ parses zero or more occurrences of p, separated and ended by sep.u endBy p sep# parses one or more occurrences of p, separated and ended by sep.v chainr p op x$ parses zero or more occurrences of p, separated by op#. Returns a value produced by a right9 associative application of all functions returned by op!. If there are no occurrences of p, x is returned.w chainl p op x$ parses zero or more occurrences of p, separated by op#. Returns a value produced by a left9 associative application of all functions returned by op!. If there are no occurrences of p, x is returned.xLike v(, but parses one or more occurrences of p.yLike w(, but parses one or more occurrences of p.zmanyTill p end$ parses zero or more occurrences of p, until end3 succeeds. Returns a list of values returned by p.{hConverts a parser into a Haskell ReadS-style function. This is the main way in which you can "run" a Z" parser: the expanded type is 1 readP_to_S :: ReadP a -> String -> [(a,String)] |Converts a Haskell ReadS-style function into a parser. Warning: This introduces local backtracking in the resulting parser, and therefore a possible inefficiency.7Z[\]^_`abcdefghijklmnopqrstuvwxyz{|}~#Z[\]^_`abcdefghijklmnopqrstuvwxyz{|#Z\]_`a^dbcefgihjklmnopqrstuvwyxz[{|1Z[\]^_`abcdefghijklmnopqrstuvwxyz{|}~_5`5<"(c) The University of Glasgow 2002/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional0non-portable (uses Text.ParserCombinators.ReadP) TrustworthyCharacter literal(String literal, with escapes interpreted%Punctuation or reserved symbol, e.g. (, ::Haskell identifier, e.g. foo, BazHaskell symbol, e.g. >>, :%Haskell lexemes. b is - () if b is , and ! if b is .?Haskell lexer: returns the lexed string, rather than the lexemeThe special2 character class as defined in the Haskell Report.3*="(c) The University of Glasgow 2002/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional0non-portable (uses Text.ParserCombinators.ReadP) Trustworthy Lift a precedence-insensitive Z to a .(Increases the precedence context by one.&Resets the precedence context to zero. (prec n p)C checks whether the precedence context is less than or equal to n, and if not, failsif so, parses p in context n.LConsumes and returns the next character. Fails if there is no input left.PLook-ahead: returns the part of the input that is left, without consuming it.Symmetric choice.}Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used. Always fails.+Combines all parsers in the specified list.((c) The University of Glasgow, 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) Trustworthy/T\ Parsing of s, producing values.Derived instances of \= make the following assumptions, which derived instances of  obey:KIf the constructor is defined to be an infix operator, then the derived \Y instance will parse only infix applications of the constructor (not the prefix form).aAssociativity is not used to reduce the occurrence of parentheses, although precedence may be.?If the constructor is defined using record syntax, the derived \ will parse only the record-syntax form, and furthermore, the fields must be given in the same order as the original declaration. The derived \| instance allows arbitrary Haskell whitespace between tokens of the input string. Extra parentheses are also allowed.#For example, given the declarations 8infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree athe derived instance of \! in Haskell 2010 is equivalent to ^instance (Read a) => Read (Tree a) where readsPrec d r = readParen (d > app_prec) (\r -> [(Leaf m,t) | ("Leaf",s) <- lex r, (m,t) <- readsPrec (app_prec+1) s]) r ++ readParen (d > up_prec) (\r -> [(u:^:v,w) | (u,s) <- readsPrec (up_prec+1) r, (":^:",t) <- lex s, (v,w) <- readsPrec (up_prec+1) t]) r where app_prec = 10 up_prec = 5!Note that right-associativity of :^: is unused.,The derived instance in GHC is equivalent to Zinstance (Read a) => Read (Tree a) where readPrec = parens $ (prec app_prec $ do Ident "Leaf" <- lexP m <- step readPrec return (Leaf m)) +++ (prec up_prec $ do u <- step readPrec Symbol ":^:" <- lexP v <- step readPrec return (u :^: v)) where app_prec = 10 up_prec = 5 readListPrec = readListPrecDefaultattempts to parse a value from the front of the string, returning a list of (parsed value, remaining string) pairs. If there is no successful parse, the returned list is empty.Derived instances of \ and  satisfy the following:(x,"") is an element of ( d ( d x "")). That is,  parses the string produced by , and delivers the value that  started with. The method  is provided to allow the programmer to give a specialised way of parsing lists of values. For example, this is used by the predefined \ instance of the t type, where values of type K should be are expected to use double quotes, rather than square brackets.Proposed replacement for $ using new-style parsers (GHC only).Proposed replacement for B using new-style parsers (GHC only). The default definition uses . Instances that define  should also define  as .  p parses what p* parses, but surrounded with parentheses.  p parses what p5 parses, but optionally surrounded with parentheses.*A possible replacement definition for the K method (GHC only). This is only needed for GHC, and even then only for \ instances where  isn't defined as .*A possible replacement definition for the  method, defined using  (GHC only).The  function reads a single lexeme from the input, discarding initial white space, and returning the characters that constitute the lexeme. If the input string contains only white space, O returns a single successful `lexeme' consisting of the empty string. (Thus  "" = [("","")]G.) If there is no legal lexeme at the beginning of the input string,  fails (i.e. returns [])._This lexer is not completely faithful to the Haskell lexical syntax in the following respects:(Qualified names are not handled properlyCOctal and hexadecimal numerics are not recognized as a single token!Comments are not treated properlymRead a string representation of a character, using Haskell source-language escape conventions. For example: -lexLitChar "\\nHello" = [("\\n", "Hello")]Read a string representation of a character, using Haskell source-language escape conventions, and convert it to the character that it encodes. For example: ,readLitChar "\\nHello" = [('\n', "Hello")]+Reads a non-empty string of decimal digits.Parse a single lexeme (paren p) parses "(P0)" where p' parses "P0" in precedence context zero (parens p)0 parses "P", "(P0)", "((P0))", etc, where pc parses "P" in the current precedence context and parses "P0" in precedence context zero(list p)# parses a list of things parsed by p), using the usual square-bracket syntax.eParse the specified lexeme and continue as specified. Esp useful for nullary constructors; e.g. )choose [("A", return A), ("B", return B)]R We match both Ident and Symbol because the constructor might be an operator eg (:~:)6\\[2\%"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable TrustworthyConvert a single digit t to the corresponding w6. This function fails unless its argument satisfies K, but recognises both upper- and lower-case hexadecimal digits (that is, '0'..'9', 'a'..'f', 'A'..'F').Examples Characters '0' through '9' are converted properly to 0..9:map digitToInt ['0'..'9'][0,1,2,3,4,5,6,7,8,9]Both upper- and lower-case 'A' through 'F' are converted as well, to 10..15.map digitToInt ['a'..'f'][10,11,12,13,14,15]map digitToInt ['A'..'F'][10,11,12,13,14,15]"Anything else throws an exception:digitToInt 'G'/*** Exception: Char.digitToInt: not a digit 'G'digitToInt '&e'3*** Exception: Char.digitToInt: not a digit '\9829'Selects alphabetic Unicode characters (lower-case, upper-case and title-case letters, plus letters of caseless scripts and modifiers letters). This function is equivalent to %.This function returns + if its argument has one of the following s, or  otherwise:"These classes are defined in the  @http://www.unicode.org/reports/tr44/tr44-14.html#GC_Values_TableUnicode Character DatabaseZ, part of the Unicode standard. The same document defines what is and is not a "Letter".Examples Basic usage: isLetter 'a'True isLetter 'A'True isLetter '0'False isLetter '%'False isLetter '&e'FalseisLetter '\31'False Ensure that  and  are equivalent.let chars = [(chr 0)..] let letters = map isLetter charslet alphas = map isAlpha charsletters == alphasTruelSelects Unicode mark characters, for example accents and the like, which combine with preceding characters.This function returns + if its argument has one of the following s, or  otherwise:"These classes are defined in the  @http://www.unicode.org/reports/tr44/tr44-14.html#GC_Values_TableUnicode Character DatabaseX, part of the Unicode standard. The same document defines what is and is not a "Mark".Examples Basic usage: isMark 'a'False isMark '0'FalseqCombining marks such as accent characters usually need to follow another character before they become printable:map isMark "o" [False,True]#Puns are not necessarily supported: isMark '''FalsefSelects Unicode numeric characters, including digits from various scripts, Roman numerals, et cetera.This function returns + if its argument has one of the following s, or  otherwise:"These classes are defined in the  @http://www.unicode.org/reports/tr44/tr44-14.html#GC_Values_TableUnicode Character DatabaseZ, part of the Unicode standard. The same document defines what is and is not a "Number".Examples Basic usage: isNumber 'a'False isNumber '%'False isNumber '3'TrueASCII '0' through '9' are all numbers:and $ map isNumber ['0'..'9']True-Unicode Roman numerals are "numbers" as well: isNumber '!h'True/Selects Unicode space and separator characters.This function returns + if its argument has one of the following s, or  otherwise:"These classes are defined in the  @http://www.unicode.org/reports/tr44/tr44-14.html#GC_Values_TableUnicode Character Database], part of the Unicode standard. The same document defines what is and is not a "Separator".Examples Basic usage:isSeparator 'a'FalseisSeparator '6'FalseisSeparator ' 'TrueDWarning: newlines and tab characters are not considered separators.isSeparator '\n'FalseisSeparator '\t'False1But some more exotic characters are (like HTML's &nbsp;):isSeparator '\160'True?t6?t6 "(c) The University of Glasgow 2005/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable TrustworthyThe G type allows you to reverse sort order conveniently. A value of type  a contains a value of type a (represented as  a). If a has an [ 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  x Provides ` and \ instances (since: 4.7.0.0). %comparing p x y = compare (p x) (p y)2Useful combinator for use in conjunction with the xxxBy family of functions from  Data.List, for example:  ... sortBy (comparing fst) ...[  '~[  '~"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable TrustworthyBT?The p function drops the largest suffix of a list in which the given predicate holds for all elements. For example: dropWhileEnd isSpace "foo\n" == "foo" dropWhileEnd isSpace "foo bar" == "foo bar" dropWhileEnd isSpace ("foo\n" ++ undefined) == "foo" ++ undefinedThe : function drops the given prefix from a list. It returns 6 if the list did not start with the prefix given, or ' the list after the prefix, if it does. stripPrefix "foo" "foobar" == Just "bar" stripPrefix "foo" "foo" == Just "" stripPrefix "foo" "barfoo" == Nothing stripPrefix "foo" "barfoobaz" == NothingThe W function returns the index of the first element in the given list which is equal (by &) to the query element, or  if there is no such element.The  function extends [, by returning the indices of all elements equal to the query element, in ascending order.The m function takes a predicate and a list and returns the first element in the list matching the predicate, or  if there is no such element.The } function takes a predicate and a list and returns the index of the first element in the list satisfying the predicate, or  if there is no such element.The  function extends Y, by returning the indices of all elements satisfying the predicate, in ascending order.The & function takes two lists and returns / iff the first list is a prefix of the second.The & function takes two lists and returns P iff the first list is a suffix of the second. The second list must be finite.The & function takes two lists and returns R iff the first list is contained, wholly and intact, anywhere within the second.Example: fisInfixOf "Haskell" "I really like Haskell." == True isInfixOf "Ial" "I really like Haskell." == FalseO(n^2). The  function removes duplicate elements from a list. In particular, it keeps only the first occurrence of each element. (The name , means `essence'.) It is a special case of A, which allows the programmer to supply their own equality test.The  function behaves just like O, except it uses a user-supplied equality predicate instead of the overloaded & function. x! removes the first occurrence of x& from its list argument. For example, delete 'a' "banana" == "bnana"It is a special case of A, which allows the programmer to supply their own equality test.The  function behaves like 0, but takes a user-supplied equality predicate.The B function is list difference (non-associative). In the result of xs  ys+, the first occurrence of each element of ys( in turn (if any) has been removed from xs. Thus (xs ++ ys) \\ xs == ys.It is a special case of A, which allows the programmer to supply their own equality test.The @ function returns the list union of the two lists. For example, "dog" `union` "cow" == "dogcw"Duplicates, and elements of the first list, are removed from the the second list, but if the first list contains duplicates, so will the result. It is a special case of A, which allows the programmer to supply their own equality test.The + function is the non-overloaded version of .The A function takes the list intersection of two lists. For example, ([1,2,3,4] `intersect` [2,4,6,8] == [2,4]:If the first list contains duplicates, so will the result. ,[1,2,2,3,4] `intersect` [6,4,4,2] == [2,2,4]It is a special case of , which allows the programmer to supply their own equality test. If the element is found in both the first and the second list, the element from the first list will be used.The + function is the non-overloaded version of .The v function takes an element and a list and `intersperses' that element between the elements of the list. For example, &intersperse ',' "abcde" == "a,b,c,d,e" xs xss is equivalent to ( ( xs xss)). It inserts the list xs in between the lists in xss and concatenates the result.The H function transposes the rows and columns of its argument. For example, 2transpose [[1,2,3],[4,5,6]] == [[1,4],[2,5],[3,6]]TIf some of the rows are shorter than the following rows, their elements are skipped: Ctranspose [[10,11],[20],[],[30,31,32]] == [[10,20,30],[11,31],[32]]The  function takes a predicate a list and returns the pair of lists of elements which do and do not satisfy the predicate, respectively; i.e., 4partition p xs == (filter p xs, filter (not . p) xs)The ( function behaves like a combination of  and o; it applies a function to each element of a list, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new list.The ( function behaves like a combination of  and ; it applies a function to each element of a list, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new list.The  function takes an element and a list and inserts the element into the list at the first position where it is less than or equal to the next element. In particular, if the list is sorted before the call, the result will also be sorted. It is a special case of G, which allows the programmer to supply their own comparison function.The non-overloaded version of .The  function takes a comparison function and a list and returns the greatest element of the list by the comparison function. The list must be finite and non-empty.The  function takes a comparison function and a list and returns the least element of the list by the comparison function. The list must be finite and non-empty.The & function is an overloaded version of n+. In particular, instead of returning an w/, it returns any type which is an instance of Z'. It is, however, less efficient than n.The & function is an overloaded version of , which accepts any V) value as the number of elements to take.The & function is an overloaded version of , which accepts any V) value as the number of elements to drop.The & function is an overloaded version of , which accepts any V) value as the position at which to split.The & function is an overloaded version of , which accepts any V value as the index.The & function is an overloaded version of , which accepts any V, value as the number of repetitions to make.The K function takes four lists and returns a list of quadruples, analogous to .The L function takes five lists and returns a list of five-tuples, analogous to .The J function takes six lists and returns a list of six-tuples, analogous to .The N function takes seven lists and returns a list of seven-tuples, analogous to .The  function takes a function which combines four elements, as well as four lists and returns a list of their point-wise combination, analogous to .The  function takes a function which combines five elements, as well as five lists and returns a list of their point-wise combination, analogous to .The  function takes a function which combines six elements, as well as six lists and returns a list of their point-wise combination, analogous to .The  function takes a function which combines seven elements, as well as seven lists and returns a list of their point-wise combination, analogous to .The K function takes a list of quadruples and returns four lists, analogous to .The L function takes a list of five-tuples and returns five lists, analogous to .The J function takes a list of six-tuples and returns six lists, analogous to .The N function takes a list of seven-tuples and returns seven lists, analogous to .The  function takes a predicate and two lists and returns the first list with the first occurrence of each element of the second list removed.The  function takes a list and returns a list of lists such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result contains only equal elements. For example, :group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]It is a special case of A, which allows the programmer to supply their own equality test.The + function is the non-overloaded version of .The V function returns all initial segments of the argument, shortest first. For example, "inits "abc" == ["","a","ab","abc"] Note that ) has the following strictness property: #inits (xs ++ _|_) = inits xs ++ _|_In particular, inits _|_ = [] : _|_The S function returns all final segments of the argument, longest first. For example, $tails "abc" == ["abc", "bc", "c",""] Note that ) has the following strictness property: tails _|_ = _|_ : _|_The ? function returns the list of all subsequences of the argument. ;subsequences "abc" == ["","a","b","ab","c","ac","bc","abc"]The ] function returns the list of all subsequences of the argument, except for the empty list. @nonEmptySubsequences "abc" == ["a","b","ab","c","ac","bc","abc"]The ? function returns the list of all permutations of the argument. ;permutations "abc" == ["abc","bac","cba","bca","cab","acb"] The  J function implements a stable sorting algorithm. It is a special case of  G, which allows the programmer to supply their own comparison function. The  + function is the non-overloaded version of  . RSort a list by comparing the results of a key function applied to each element. sortOn f is equivalent to sortBy (comparing f)8, but has the performance advantage of only evaluating f| once for each element in the input list. This is called the decorate-sort-undecorate paradigm, or Schwartzian transform. The   function is a `dual' to : while % reduces a list to a summary value,  O builds a list from a seed value. The function takes the element and returns . if it is done producing the list or returns  (a,b), in which case, a is a prepended to the list and b@ is used as the next element in a recursive call. For example, *iterate f == unfoldr (\x -> Just (x, f x))In some cases,   can undo a  operation: unfoldr f' (foldr f z xs) == xsif the following holds: ,f' (f x y) = Just (x,y) f' z = NothingA simple use of unfoldr: Tunfoldr (\b -> if b == 0 then Nothing else Just (b, b-1)) 10 [10,9,8,7,6,5,4,3,2,1]  r breaks a string up into a list of strings at newline characters. The resulting strings do not contain newlines.Note that after splitting the string at newline characters, the last part of the string is considered a line even if it doesn't end with a newline. For example, lines "" == [] lines "\n" == [""] lines "one" == ["one"] lines "one\n" == ["one"] lines "one\n\n" == ["one",""] lines "one\ntwo" == ["one","two"] lines "one\ntwo\n" == ["one","two"]Thus   s3 contains at least as many elements as newlines in s. is an inverse operation to  A. It joins lines, after appending a terminating newline to each.O breaks a string up into a list of words, which were delimited by white space. is an inverse operation to ). It joins words with separating spaces.P     shijklmnopqrstuvwxyz{|}~     O     5"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafeshijklmnopqrstuvwxyz{|}~     shkjlimnopqrxst{|uwvyz}~     >4BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimentalportable Trustworthy+DA concrete, promotable proxy type, for use at the kind level There are no instances for this because it is intended at the kind level only"A concrete, poly-kinded proxy type! is a type-restricted version of 8. It is usually used as an infix operator, and its typing forces its first argument (which is usually overloaded) to have the same type as the tag of the second. !" !"*4BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimental not portable Trustworthy%&+,/59;<=?DOQRT |Lifted, homogeneous equality. By lifted, we mean that it can be bogus (deferred type error). By homogeneous, the two types a and b must have the same kind.#LA type family to compute Boolean equality. Instances are provided only for open kinds, such as *o and function kinds. Instances are also provided for datatypes exported from base. A poly-kinded instance is notS provided, as a recursive definition for algebraic kinds is generally more useful.$gThis class contains types where you can learn the equality of two types from information contained in terms=. Typically, only singleton types should inhabit this class.%$Conditionally prove the equality of a and b.&Propositional equality. If a :~: b8 is inhabited by some terminating value, then the type a is the same as the type b:. To use this equality in practice, pattern-match on the a :~: b to get out the ReflI constructor; in the body of the pattern-match, the compiler knows that a ~ b.(Symmetry of equality)Transitivity of equality*,Type-safe cast, using propositional equality+?Generalized form of type-safe cast using propositional equality,+Apply one equality to another, respectively-EExtract equality of the arguments from an equality of a applied types.GExtract equality of type constructors from an equality of applied types'#$%&'()*+,-./0123 #$%&'()*+,-. &'()*+,-.$%#%#$%&'()*+,-./0123#4&4-"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthy +,/DQRThe @ type represents values with two possibilities: a value of type  a b is either  a or  b.The e type is sometimes used to represent a value which is either correct or an error; by convention, the 4 constructor is used to hold an error value and the V constructor is used to hold a correct value (mnemonic: "right" also means "correct").Examples The type   w- is the type of values which can be either a  or an w. The ! constructor can be used only on  s, and the ! constructor can be used only on ws:'let s = Left "foo" :: Either String Ints Left "foo"$let n = Right 3 :: Either String IntnRight 3:type ss :: Either String Int:type nn :: Either String IntThe , from our Y instance will ignore G values, but will apply the supplied function to values contained in a :'let s = Left "foo" :: Either String Int$let n = Right 3 :: Either String Int fmap (*2) s Left "foo" fmap (*2) nRight 6The W instance for  allows us to chain together multiple actions which may fail, and fail overall if any of the individual steps failed. First we'll write a function that can either parse an w from a t , or fail.(import Data.Char ( digitToInt, isDigit ):{0 let parseEither :: Char -> Either String Int parseEither c, | isDigit c = Right (digitToInt c)* | otherwise = Left "parse error":}&The following should work, since both '1' and '2' can be parsed as ws.:{* let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y):} parseMultipleRight 3[But the following should fail overall, since the first operation where we attempt to parse 'm' as an w will fail::{* let parseMultiple :: Either String Int parseMultiple = do x <- parseEither 'm' y <- parseEither '2' return (x + y):} parseMultipleLeft "parse error"7Case analysis for the  type. If the value is  a, apply the first function to a ; if it is  b, apply the second function to b.ExamplesWe create two values of type   w, one using the # constructor and another using the * constructor. Then we apply "either" the length function (if we have a .) or the "times-two" function (if we have an w):'let s = Left "foo" :: Either String Int$let n = Right 3 :: Either String Inteither length (*2) s3either length (*2) n68Extracts from a list of  all the  elements. All the ! elements are extracted in order.Examples Basic usage:Clet list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ] lefts list["foo","bar","baz"]9Extracts from a list of  all the  elements. All the ! elements are extracted in order.Examples Basic usage:Clet list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ] rights list[3,7]:Partitions a list of  into two lists. All the Y elements are extracted, in order, to the first component of the output. Similarly the ? elements are extracted to the second component of the output.Examples Basic usage:Clet list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ]partitionEithers list(["foo","bar","baz"],[3,7])The pair returned by : x should be the same pair as (8 x, 9 x):Clet list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ]2partitionEithers list == (lefts list, rights list)True;Return  if the given value is a -value,  otherwise.Examples Basic usage:isLeft (Left "foo")TrueisLeft (Right 3)False Assuming a 1 value signifies some sort of error, we can use ; to write a very simple error-reporting function that does absolutely nothing in the case of success, and outputs "ERROR" if any error occurred.This example shows how ;o might be used to avoid pattern matching when one does not care about the value contained in the constructor:import Control.Monad ( when )1let report e = when (isLeft e) $ putStrLn "ERROR"report (Right 1)report (Left "parse error")ERROR<Return  if the given value is a -value,  otherwise.Examples Basic usage:isRight (Left "foo")FalseisRight (Right 3)True Assuming a 1 value signifies some sort of error, we can use <i to write a very simple reporting function that only outputs "SUCCESS" when a computation has succeeded.This example shows how <o might be used to avoid pattern matching when one does not care about the value contained in the constructor:import Control.Monad ( when )4let report e = when (isRight e) $ putStrLn "SUCCESS"report (Left "parse error")report (Right 1)SUCCESS 789:;<=>? 789:;< 789;<: 789:;<=>??4BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimental not portableNone%&+/59;DQRTDgThis class contains types where you can learn the equality of two types from information contained in terms=. Typically, only singleton types should inhabit this class.E5Conditionally prove the representational equality of a and b.FRepresentational equality. If  Coercion a b8 is inhabited by some terminating value, then the type a4 has the same underlying representation as the type b.7To use this equality in practice, pattern-match on the  Coercion a b to get out the  Coercible a b instance, and then use  to apply it.H/Type-safe cast, using representational equalityI%Symmetry of representational equalityJ)Transitivity of representational equalityKEConvert propositional (nominal) equality to representational equality DEFGHIJKLMNOPDEFGHIJKFGHIJKDE DEFGHIJKLMNOP((c) The University of Glasgow, 1994-2008see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyTSee TUVWXTUVWXTUVWX# Trustworthy*+,9:;ABDOQRTnThis class gives the integer associated with a type-level natural. There are instances of the class for every concrete literal: 0, 1, 2, etc.oThis class gives the string associated with a type-level symbol. There are instances of the class for every concrete literal: "hello", etc. Addition of type-level naturals.&Multiplication of type-level naturals.&Exponentiation of type-level naturals.rComparison of type-level naturals, as a function. NOTE: The functionality for this function should be subsumed by k, so this might go away in the future. Please let us know, if you encounter discrepancies between the two. #Subtraction of type-level naturals.0Comparison of type-level symbols, as a function.1Comparison of type-level naturals, as a function. The type-level equivalent of error.The polymorphic kind of this type allows it to be used in several settings. For instance, it can be used as a constraint, e.g. to provide a better error message for a non-existant instance, 1-- in a context instance TypeError (Text "Cannot ` functions." :$$: Text "Perhaps there is a missing argument?") => Show (a -> b) where showsPrec = error "unreachable" oIt can also be placed on the right-hand side of a type-level function to provide an error for an invalid case, type family ByteSize x where ByteSize Word16 = 2 ByteSize Word8 = 1 ByteSize a = TypeError (Text "The type " :<>: ShowType a :<>: Text " is not exportable.") Show the text as is.4Put two pieces of error message next to each other.8Stack two pieces of error message on top of each other.Pretty print the type. ShowType :: k -> ErrorMessageY%A description of a custom type error.Z3Comparison of type-level naturals, as a constraint.[0This type represents unknown type-level symbols.\]8This type represents unknown type-level natural numbers.^_`abc6Convert an integer into an unknown type-level natural.d3Convert a string into an unknown type-level symbol.eaWe either get evidence that this function was instantiated with the same type-level numbers, or .faWe either get evidence that this function was instantiated with the same type-level symbols, or .2noYZ  [\]^  _`abcdef ghijklmnnoYZ[\]^_`abcdefn_ao`b]^[\cdefZY&n o YZ  [\]^_`abcdef ghijklmn6784665Z4((c) The University of Glasgow, 1997-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyB8-bit unsigned integer type16-bit unsigned integer type32-bit unsigned integer type64-bit unsigned integer typeoSwap bytes in .pReverse order of bytes in .sReverse order of bytes in .Uo !"#$p%&'()*qrs+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ-o !"#$p%&'()*qrsQo !"#$p%&'()*qrs+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ+"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafeopsops Trustworthy[GReturn monotonic time in seconds, since some unspecified starting point\[[\['(c) The University of Glasgow 1997-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) Trustworthy/B^x8-bit signed integer typey16-bit signed integer typez32-bit signed integer type{64-bit signed integer typeRxyz{]^_`abcdefghijklmnopqrstuvwxtuyz{|}~*wx`y_z^{]abcdefghijklmnopqrstuvwxtuNx`y_z^{]abcdefghijklmnopqrstuvwxtuyz{|}~&"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthywxyz{wxyz{"(c) The University of Glasgow 2002/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportable TrustworthyBv Reads an unsigned V value in an arbitrary base.w*Read an unsigned number in octal notation.x,Read an unsigned number in decimal notation.y_Read an unsigned number in hexadecimal notation. Both upper or lower case letters are allowed.z Reads an unsigned _2 value, expressed in decimal scientific notation.{Reads a signed ]- value, given a reader for an unsigned value.|Show  non-negative V numbers in base 10.}Show a signed ^6 value using scientific (exponential) notation (e.g. 2.45e2, 1.5e-3). In the call } digs val, if digs is ,, the value is shown to full precision; if digs is  d, then at most d* digits after the decimal point are shown.~Show a signed ^. value using standard decimal notation (e.g. 245000, 0.0015). In the call ~ digs val, if digs is ,, the value is shown to full precision; if digs is  d, then at most d* digits after the decimal point are shown.Show a signed ^Y value using standard decimal notation for arguments whose absolute value lies between 0.1 and  9,999,999$, and scientific notation otherwise. In the call  digs val, if digs is ,, the value is shown to full precision; if digs is  d, then at most d* digits after the decimal point are shown.Show a signed ^. value using standard decimal notation (e.g. 245000, 0.0015).This behaves as ~H, except that a decimal point is always guaranteed, even if not needed.Show a signed ^Y value using standard decimal notation for arguments whose absolute value lies between 0.1 and  9,999,999$, and scientific notation otherwise.This behaves as ~H, except that a decimal point is always guaranteed, even if not needed.Shows a  non-negative Vr number using the base specified by the first argument, and the character representation specified by the second.Show  non-negative V numbers in base 16.Show  non-negative V numbers in base 8.vthe base4a predicate distinguishing valid digits in this base4a function converting a valid digit character to an wwxyz{|}~+T>?@ABCDEFGHIJKLMNOPQRSTUVvwxyz{|}~+|}~TU{vxwyzVT>?@ABCDEFGHIJKLMNOPQRSvwxyz{|}~/ Trustworthy-(c) The University of Glasgow, CWI 2001--2011/BSD-style (see the file libraries/base/LICENSE) Trustworthy*+,/9;BDTf@MApplies a kind-polymorphic type constructor to a sequence of kinds and typesA%Adds a TypeRep argument to a TypeRep.BUsed to make `b instance for things of kind NatCUsed to make `b# instance for things of kind Symbolb The class b> allows a concrete representation of a type to be calculated.4A concrete representation of a (monomorphic) type. ( supports reasonably efficient equality.0Observe string encoding of a type representationHelper to fully evaluate  for use as  NFData(rnf) implementation Observe the  of a type representationBApplies a kind-monomorphic type constructor to a sequence of typesA special case of B, which applies the function type constructor to a pair of types.Splits a type constructor application. Note that if the type constructor is polymorphic, this will not return the kinds that were used. See  if you need all parts.$Split a type constructor application-Applies a type to a function type. Returns:  u6 if the first argument represents a function of type t -> u8 and the second argument represents a function of type t. Otherwise, returns .5Observe the type constructor of a type representation3Observe the argument types of a type representation3Observe the argument kinds of a type representationTakes a value of type a5 and returns a concrete representation of that type.Helper to fully evaluate  for use as  NFData(rnf) implementation@An internal function, to make representations for type literals.=@ABCDb package name module name the name of the type constructor A unique  object package name module name the name of the type constructor A unique Y object Used when the strings are dynamically allocated, eg from binary deserialisation4@ABCbD4@AbDCB;@ABCbDA-(c) The University of Glasgow, CWI 2001--2004/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthy %&+DQRTThe type-safe cast operation*Extract a witness of equality of two types8A flexible variation parameterised in a type constructor Cast over k1 -> k2 Cast over k1 -> k2 -> k3-Ab&'-b&'A((c) The University of Glasgow, 1998-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions) Trustworthy!"ABTb The  SomeExceptionM type is the root of the exception type hierarchy. When an exception of type e6 is thrown, behind the scenes it is encapsulated in a  SomeException.Arithmetic exceptions.#This is thrown when the user calls . The String is the argument given to .TAny type that you wish to throw or catch as an exception must be an instance of the  ExceptionJ class. The simplest case is a new exception type directly below the root: ndata MyException = ThisException | ThatException deriving (Show, Typeable) instance Exception MyException&The default method definitions in the  ExceptionA class do what we need in this case. You can now throw and catch  ThisException and  ThatException as exceptions: n*Main> throw ThisException `catch` \e -> putStrLn ("Caught " ++ show (e :: MyException)) Caught ThisException UIn more complicated examples, you may wish to define a whole hierarchy of exceptions: #--------------------------------------------------------------------- -- Make the root exception type for all the exceptions in a compiler data SomeCompilerException = forall e . Exception e => SomeCompilerException e deriving Typeable instance Show SomeCompilerException where show (SomeCompilerException e) = show e instance Exception SomeCompilerException compilerExceptionToException :: Exception e => e -> SomeException compilerExceptionToException = toException . SomeCompilerException compilerExceptionFromException :: Exception e => SomeException -> Maybe e compilerExceptionFromException x = do SomeCompilerException a <- fromException x cast a --------------------------------------------------------------------- -- Make a subhierarchy for exceptions in the frontend of the compiler data SomeFrontendException = forall e . Exception e => SomeFrontendException e deriving Typeable instance Show SomeFrontendException where show (SomeFrontendException e) = show e instance Exception SomeFrontendException where toException = compilerExceptionToException fromException = compilerExceptionFromException frontendExceptionToException :: Exception e => e -> SomeException frontendExceptionToException = toException . SomeFrontendException frontendExceptionFromException :: Exception e => SomeException -> Maybe e frontendExceptionFromException x = do SomeFrontendException a <- fromException x cast a --------------------------------------------------------------------- -- Make an exception type for a particular frontend compiler exception data MismatchedParentheses = MismatchedParentheses deriving (Typeable, Show) instance Exception MismatchedParentheses where toException = frontendExceptionToException fromException = frontendExceptionFromExceptionWe can now catch a MismatchedParentheses exception as MismatchedParentheses, SomeFrontendException or SomeCompilerException, but not other types, e.g.  IOException: #*Main> throw MismatchedParentheses catch e -> putStrLn ("Caught " ++ show (e :: MismatchedParentheses)) Caught MismatchedParentheses *Main> throw MismatchedParentheses catch e -> putStrLn ("Caught " ++ show (e :: SomeFrontendException)) Caught MismatchedParentheses *Main> throw MismatchedParentheses catch e -> putStrLn ("Caught " ++ show (e :: SomeCompilerException)) Caught MismatchedParentheses *Main> throw MismatchedParentheses catch[ e -> putStrLn ("Caught " ++ show (e :: IOException)) *** Exception: MismatchedParentheses 7Render this exception value in a human-friendly manner.Default implementation: .nThrow an exception. Exceptions may be thrown from purely functional code, but may only be caught within the  monad. Pretty print a . Pretty print a . &"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthy/E3Converts an arbitrary value into an object of type . .The type of the object must be an instance of bN, which ensures that only monomorphically-typed objects may be converted to (. To convert a polymorphic object into 6, give it a monomorphic type signature. For example:  toDyn (id :: Int -> Int)A value of type 2 is an object encapsulated together with its type.A P may only represent a monomorphic value; an attempt to create a value of type R from a polymorphically-typed expression will result in an ambiguity error (see E).`ing a value of type V returns a pretty-printed representation of the object's type; useful for debugging. Converts a L object back into an ordinary Haskell value of the correct type. See also . Converts a L object back into an ordinary Haskell value of the correct type. See also . Ethe dynamically-typed objecta default value sreturns: the value of the first argument, if it has the correct type, otherwise the value of the second argument.the dynamically-typed object returns:  a=, if the dynamically-typed object has the correct type (and a is its value), or  otherwise.4AEb&'E E'(c) The University of Glasgow 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)UnsafeBOTPDescribes the behaviour of a thread when an asynchronous exception is received.7asynchronous exceptions are unmasked (the normal state)the state during V: asynchronous exceptions are masked, but blocking operations may still be interruptedthe state during T: asynchronous exceptions are masked, and blocking operations may not be interrupted,File and directory names are values of type , whose precise meaning is operating system dependent. Files can be opened, yielding a handle which can then be used to operate on the contents of that file.?A monad transformer embedding strict state transformers in the  monad. The : parameter indicates that the internal state used by the . computation is a special one supplied by the = monad, and thus distinct from those used by invocations of .Catch an exception in the  monad.Note that this function is strict in the action. That is, !catchException undefined b == _|_. See exceptions_and_strictness for details. Catch any  type in the  monad.Note that this function is strict in the action. That is, !catchException undefined b == _|_. See exceptions_and_strictness for details. A variant of " that can only be used within the  monad. Although / has a type that is an instance of the type of *, the two functions are subtly different: 9throw e `seq` x ===> throw e throwIO e `seq` x ===> x+The first example will cause the exception e8 to be raised, whereas the second one won't. In fact, G will only cause an exception to be raised when it is used within the  monad. The ) variant should be used in preference to # to raise an exception within the = monad because it guarantees ordering with respect to other  operations, whereas  does not. 7Allow asynchronous exceptions to be raised even inside \, making the operation interruptible (see the discussion of "Interruptible operations" in ).When called outside  , or inside , this function has no effect. Returns the  for the current thread.Like , but does not pass a restore action to the argument.9Executes an IO computation with asynchronous exceptions maskedX. That is, any thread which attempts to raise an exception in the current thread with CC will be blocked until asynchronous exceptions are unmasked again.The argument passed to  is a function that takes as its argument another function, which can be used to restore the prevailing masking state within the context of the masked computation. For example, a common way to use . is to protect the acquisition of a resource: jmask $ \restore -> do x <- acquire restore (do_something_with x) `onException` release releaseThis code guarantees that acquire is paired with release, by masking asynchronous exceptions for the critical parts. (Rather than write this code yourself, it would be better to use C& which abstracts the general pattern).Note that the restore" action passed to the argument to  does not necessarily unmask asynchronous exceptions, it just restores the masking state to that of the enclosing context. Thus if asynchronous exceptions are already masked, B cannot be used to unmask exceptions again. This is so that if you call a library function with exceptions masked, you can be sure that the library call will not be able to unmask exceptions again. If you are writing library code and need to use asynchronous exceptions, the only way is to create a new thread; see b.^Asynchronous exceptions may still be received while in the masked state if the masked thread blocks in certain ways; see Control.Exception#interruptible.Threads created by b inherit the 5 from the parent; that is, to start a thread in the  state, use mask_ $ forkIO .... This is particularly useful if you need to establish an exception handler in the forked thread before any asynchronous exceptions are received. To create a a new thread in an unmasked state use b.Like , but does not pass a restore action to the argument.Like 8, but the masked computation is not interruptible (see Control.Exception#interruptibleK). THIS SHOULD BE USED WITH GREAT CARE, because if a thread executing in U blocks for any reason, then the thread (and possibly the program, if this is the main thread) will be unresponsive and unkillable. This function should only be necessary if you need to mask exceptions around an interruptible operation, and you can guarantee that the interruptible operation will only block for a short period of time./Evaluate the argument to weak head normal form.f is typically used to uncover any exceptions that a lazy value may contain, and possibly handle them. only evaluates to weak head normal form'. If deeper evaluation is needed, the force function from Control.DeepSeq may be handy: evaluate $ force x%There is a subtle difference between  x and - ; x', analogous to the difference between  and . If the lazy value x throws an exception, - ; x will fail to return an - action and will throw an exception instead.  x), on the other hand, always produces an 3 action; that action will throw an exception upon  execution iff x throws an exception upon  evaluation.AThe practical implication of this difference is that due to the imprecise exceptions semantics, &(return $! error "foo") >> error "bar"may throw either "foo" or "bar"O, depending on the optimizations performed by the compiler. On the other hand, %evaluate (error "foo") >> error "bar"is guaranteed to throw "foo".The rule of thumb is to use  to force or handle exceptions in lazy values. If, on the other hand, you are forcing a lazy value for efficiency reasons only and do not care about exceptions, you may use - ; x.-computation to run first ("acquire resource"),computation to run last ("release resource")computation to run in-betweencomputation to run first?computation to run afterward (even if an exception was raised)"T CDED(c) The FFI task force 2003/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportableUnsafe|Sometimes an external entity is a pure function, except that it passes arguments and/or results via pointers. The function unsafeLocalState< permits the packaging of such entities as pure functions. :The only IO operations allowed in the IO action passed to unsafeLocalState are (a) local allocation (alloca,  allocaBytes and derived operations such as  withArray and  withCString), and (b) pointer operations (Foreign.Storable and  Foreign.Ptr) on the pointers to local storage, and (c) foreign functions whose only observable effect is to read and/or write the locally allocated memory. Passing an IO operation that does not obey these rules results in undefined behaviour.TIt is expected that this operation will be replaced in a future revision of Haskell."(c) The University of Glasgow 2008see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)UnsafeEAn . is a mutable, boxed, non-strict array in the + monad. The type arguments are as follows:i8: the index type of the array (should be an instance of a)e : the element type of the array. Build a new Read a value from an Write a new value into an Read a value from an Write a new value into an  "(c) The University of Glasgow 2008see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)UnsafeBA mutable variable in the  monad Build a new Read the value of an Write a new value into an E"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable TrustworthyBMake a X pointer to an 8, using the second argument as a finalizer to run when  is garbage-collectedMutate the contents of an .Be warned that I does not apply the function strictly. This means if the program calls  many times, but seldomly uses the value, thunks will pile up in memory resulting in a space leak. This is a common mistake made when using an IORef as a counter. For example, the following will likely produce a stack overflow: Tref <- newIORef 0 replicateM_ 1000000 $ modifyIORef ref (+1) readIORef ref >>= printTo avoid this problem, use  instead.Strict version of 'Atomically modifies the contents of an ."This function is useful for using B in a safe way in a multithreaded program. If you only have one  , then using 7 to access and modify it will prevent race conditions.$Extending the atomicity to multiple es is problematic, so it is recommended that if you need to do anything more complicated then using 3 instead is a good idea. does not apply the function strictly. This is important to know even if all you are doing is replacing the value. For example, this will leak memory: Eref <- newIORef '1' forever $ atomicModifyIORef ref (\_ -> ('2', ()))Use  or  to avoid this problem.Strict version of -. This forces both the value stored in the  as well as the value returned. Variant of 1 with the "barrier to reordering" property that  has.  !(c) The FFI Task Force, 2000-2002see libraries/base/LICENSEffi@haskell.orginternalnon-portable (GHC Extensions)UnsafeBE A value of type  ax 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 G 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.A value of type  aC is a pointer to a function callable from foreign code. The type a will normally be a  foreign type4, a function type with zero or more arguments wherethe argument types are marshallable foreign types , i.e. t, w, u, v, s, &, &, &, &, +, +, +, +,  a,  a,  a( or a renaming of any of these using newtype.Ithe return type is either a marshallable foreign type or has the form  t where t# is a marshallable foreign type or ().A value of type  a may be a pointer to a foreign function, either returned by another foreign function or imported with a a static address import like Iforeign import ccall "stdlib.h &free" p_free :: FunPtr (Ptr a -> IO ())3or a pointer to a Haskell function created using a wrapper stub declared to produce a # of the correct type. For example: ntype Compare = Int -> Int -> Bool foreign import ccall "wrapper" mkCompare :: Compare -> IO (FunPtr Compare)Calls to wrapper stubs like  mkCompare2 allocate storage, which should be released with , when no longer required. To convert > values to corresponding Haskell functions, one can define a dynamic) stub for the specific foreign type, e.g. ltype IntFunction = CInt -> IO () foreign import ccall "dynamic" mkFun :: FunPtr IntFunction -> IntFunction The constant # contains a distinguished value of 6 that is not associated with a valid memory location.The 3 function casts a pointer from one type to another.8Advances the given address by the given offset in bytes.9Given an arbitrary address and an alignment constraint, b yields the next higher address that fulfills the alignment constraint. An alignment constraint x+ is fulfilled by any address divisible by x . This operation is idempotent.TComputes the offset required to get from the second to the first argument. We have %p2 == p1 `plusPtr` (p2 `minusPtr` p1) The constant $ contains a distinguished value of 6 that is not associated with a valid memory location.Casts a  to a  of a different type.Casts a  to a .Note: this is valid only on architectures where data and function pointers range over the same set of addresses, and should only be used for bindings to external libraries whose interface already relies on this assumption.Casts a  to a .Note: this is valid only on architectures where data and function pointers range over the same set of addresses, and should only be used for bindings to external libraries whose interface already relies on this assumption.  "B(c) Universiteit Utrecht 2010-2011, University of Oxford 2012-2014see libraries/base/LICENSElibraries@haskell.orginternal non-portable Trustworthy%&+,/259:;BDQRTBi^Representable types of kind *. This class is derivable in GHC with the DeriveGeneric flag on.jcRepresentable types of kind * -> *. This class is derivable in GHC with the DeriveGeneric flag on.k,Class for datatypes that represent datatypesl4Class for datatypes that represent data constructorsm*Class for datatypes that represent records-Void: used for datatypes without constructors-Unit: used for constructors without arguments-Used for marking occurrences of the parameterRecursive calls of kind * -> *8Constants, additional parameters and recursion of kind **Meta-information (constructor names, etc.)(Sums: encode choice between constructors3Products: encode multiple arguments to constructorsComposition of functors!Tag for K1: recursion (of kind *)Tag for M1: datatypeTag for M1: constructorTag for M1: record selector/Type synonym for encoding recursion (of kind *)8Type synonym for encoding meta-information for datatypes;Type synonym for encoding meta-information for constructors?Type synonym for encoding meta-information for record selectorsGeneric representation typeGeneric representation typeConstants of kind #Type synonym for : ?Type synonym for : BType synonym for : CType synonym for : DType synonym for : EType synonym for : VThe  class is essentially a kind class. It classifies all kinds for which singletons are defined. The class supports converting between a singleton type and the base (unrefined) type which it is built from.BGet a base type from a proxy for the promoted kind. For example, "DemoteRep ('KProxy :: KProxy Bool) will be the type Bool.-Convert a singleton to its unrefined version.A  constraint is essentially an implicitly-passed singleton. If you need to satisfy this constraint with an explicit singleton, please see  withSingI.;Produce the singleton explicitly. You will likely need the ScopedTypeVariables0 extension to use this method the way you want.'The singleton kind-indexed data family.;Datatype to represent metadata associated with a datatype (MetaData), constructor (MetaCons), or field selector (MetaSel).In MetaData n m p nt, n is the datatype's name, m4 is the module in which the datatype is defined, p9 is the package in which the datatype is defined, and nt is 'True if the datatype is a newtype.In MetaCons n f s, n is the constructor's name, f is its fixity, and s is 'True. if the constructor contains record selectors.In MetaSel mn su ss ds+, if the field is uses record syntax, then mn is  the record name. Otherwise, mn is 'Nothing. su and ssA are the field's unpackedness and strictness annotations, and ds4 is the strictness that GHC infers for the field./Convert from the datatype to its representation/Convert from the representation to the datatype/Convert from the datatype to its representation/Convert from the representation to the datatypeThe name of the selector/The selector's unpackedness annotation (if any)-The selector's strictness annotation (if any):The strictness that the compiler inferred for the selectorqThe strictness that GHC infers for a field during compilation. Whereas there are nine different combinations of  and , the strictness that GHC decides will ultimately be one of lazy, strict, or unpacked. What GHC decides is affected both by what the user writes in the source code and by GHC flags. As an example, consider this data type: 9data E = ExampleConstructor {-# UNPACK #-} !Int !Int Int UIf compiled without optimization or other language extensions, then the fields of ExampleConstructor will have ,  , and , respectively.If compiled with  -XStrictData' enabled, then the fields will have , , and , respectively.If compiled with -O2$ enabled, then the fields will have , , and , respectively.lThe strictness of a field as the user wrote it in the source code. For example, in the following data type: *data E = ExampleConstructor Int ~Int !Int The fields of ExampleConstructor have , , and , respectively.nThe unpackedness of a field as the user wrote it in the source code. For example, in the following data type: ddata E = ExampleConstructor Int {-# NOUNPACK #-} Int {-# UNPACK #-} Int The fields of ExampleConstructor have , , and , respectively.8Datatype to represent the associativity of a constructor This variant of   appears at the type level. uDatatype to represent the fixity of a constructor. An infix | declaration directly corresponds to an application of  . The name of the constructorThe fixity of the constructor%Marks if this constructor is a record&The name of the datatype (unqualified)AThe fully-qualified name of the module where the type is declared9The package name of the module where the type is declared+Marks if the datatype is actually a newtype"%Get the precedence of a fixity value. Used for marking occurrences of V Used for marking occurrences of E Used for marking occurrences of D Used for marking occurrences of C Used for marking occurrences of B Used for marking occurrences of ?ijklm      !   "#$%& '()* +,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYcijkl m!        "W! kl m    "ijmijkl m!     "#$%& '()* +,-./0123456789:;<=>?@   ABCDEFGHIJKLMNOPQRSTUVWXY5676a(c) Andy Gill 2001, (c) Oregon Graduate Institute of Science and Technology, 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthy+5DIT  Monoid under %.7Maybe monoid returning the rightmost non-Nothing value. a is isomorphic to   ( a), and thus to   ( } a)6Maybe monoid returning the leftmost non-Nothing value. a is isomorphic to  } a , but precedes it historically.Monoid under multiplication.Monoid under addition."Boolean monoid under disjunction ()."Boolean monoid under conjunction ( )..The monoid of endomorphisms under composition. The dual of a r(, obtained by swapping the arguments of H.An infix synonym for H..      rGHI      rGHI           6 Ross Paterson 20054BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimentalportable Trustworthy/49;QRT%g#Data structures that can be folded.For example, given a data type 7data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)a suitable instance would be instance Foldable Tree where foldMap f Empty = mempty foldMap f (Leaf x) = f x foldMap f (Node l k r) = foldMap f l `mappend` f k `mappend` foldMap f rThis is suitable even for abstract types, as the monoid is assumed to satisfy the monoid laws. Alternatively, one could define foldr: instance Foldable Tree where foldr f z Empty = z foldr f z (Leaf x) = f x z foldr f z (Node l k r) = foldr f (f k (foldr f z r)) lFoldable6 instances are expected to satisfy the following laws: /foldr f z t = appEndo (foldMap (Endo . f) t ) z Dfoldl f z t = appEndo (getDual (foldMap (Dual . Endo . flip f) t)) z fold = foldMap idsum, product, maximum, and minimum* should all be essentially equivalent to foldMap forms, such as sum = getSum . foldMap Sumbut may be less defined.If the type is also a Y instance, it should satisfy foldMap f = fold . fmap fwhich implies that $foldMap f . fmap g = foldMap (f . g)d3Combine the elements of a structure using a monoid.eHMap each element of the structure to a monoid, and combine the results.f&Right-associative fold of a structure.In the case of lists, f, when applied to a binary operator, a starting value (typically the right-identity of the operator), and a list, reduces the list using the binary operator, from right to left: @foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)Note that, since the head of the resulting expression is produced by an application of the operator to the first element of the list, f< can produce a terminating expression from an infinite list.For a general g5 structure this should be semantically identical to,  foldr f z =  f z . lgTRight-associative fold of a structure, but with strict application of the operator.h%Left-associative fold of a structure.In the case of lists, h, when applied to a binary operator, a starting value (typically the left-identity of the operator), and a list, reduces the list using the binary operator, from left to right: Efoldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xnyNote that to produce the outermost application of the operator the entire input list must be traversed. This means that i) will diverge if given an infinite list.MAlso note that if you want an efficient left-fold, you probably want to use i instead of hO. The reason for this is that latter does not force the "inner" results (e.g. z f x1F in the above example) before applying them to the operator (e.g. to (f x2)"). This results in a thunk chain O(n)B elements long, which then must be evaluated from the outside-in.For a general g5 structure this should be semantically identical to,  foldl f z = o f z . liRLeft-associative fold of a structure but with strict application of the operator.This ensures that each step of the fold is forced to weak head normal form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite list to a single, monolithic result (e.g. n).For a general g5 structure this should be semantically identical to,  foldl f z = p f z . lj A variant of fN that has no base case, and thus may only be applied to non-empty structures. j f = x f . lk A variant of hN that has no base case, and thus may only be applied to non-empty structures. k f = q f . ll4List of elements of a structure, from left to right.mTest whether the structure is empty. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.n4Returns the size/length of a finite structure as an w. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.o(Does the element occur in the structure?p-The largest element of a non-empty structure.q+The least element of a non-empty structure.rThe r9 function computes the sum of the numbers of a structure.sThe s> function computes the product of the numbers of a structure.tbMonadic fold over the elements of a structure, associating to the right, i.e. from right to left.uaMonadic fold over the elements of a structure, associating to the left, i.e. from left to right.vMap each element of a structure to an action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see !.ww is vP with its arguments flipped. For a version that doesn't ignore the results see !.for_ [1..4] print1234xMap each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see !.As of base 4.8.0.0, x is just v, specialized to W.yy is xP with its arguments flipped. For a version that doesn't ignore the results see !.As of base 4.8.0.0, y is just w, specialized to W.zEvaluate each action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see !.{Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see !.As of base 4.8.0.0, { is just z, specialized to W.|1The sum of a collection of actions, generalizing ~.}1The sum of a collection of actions, generalizing ~. As of base 4.8.0.0, } is just |, specialized to  .~>The concatenation of all the elements of a container of lists.YMap a function over all the elements of a container and concatenate the resulting lists.I returns the conjunction of a container of Bools. For the result to be  , the container must be finite; , however, results from a & value finitely far from the left end.I returns the disjunction of a container of Bools. For the result to be  , the container must be finite; , however, results from a & value finitely far from the left end.HDetermines whether any element of the structure satisfies the predicate.GDetermines whether all elements of the structure satisfy the predicate.\The largest element of a non-empty structure with respect to the given comparison function.ZThe least element of a non-empty structure with respect to the given comparison function. is the negation of o.The { function takes a predicate and a structure and returns the leftmost element of the structure matching the predicate, or  if there is no such element.:gdefghijklmnopqrstuvwxyz{|}~%glfemnhikjrspqodgtuvwxyz{|}~%gdefghijklmnopqrstuvwz|xy{}~&gdefghijklmnopqrstuvwxyz{|}~o44F((c) The University of Glasgow, 1994-2008see libraries/base/LICENSElibraries@haskell.orginternal non-portable Trustworthy%A mode that determines the effect of hSeek  hdl mode i.the position of hdl is set to i.the position of hdl is set to offset i from the current position.the position of hdl is set to offset i from the end of the file.-Type of a device that can be used to back a Q (see also Q/). The standard libraries provide creation of Q9s via Posix file operations with file descriptors (see ` ) with FD being the underlying  instance.&Users may provide custom instances of 4 which are expected to conform the following rules:The standard libraries do not have direct support for this device type, but a user implementation is expected to provide a list of file names in the directory, in any order, separated by '\0' characters, excluding the "." and ".." names. See also X. Seek operations are not supported on directories (other than to the zero position).BA duplex communications channel (results in creation of a duplex Q?). The standard libraries use this device type when creating Qs for open sockets.>A file that may be read or written, and also may be seekable.A "raw" (disk) device which supports block binary read and write operations and may be seekable only to positions of certain granularity (block- aligned).+I/O operations required for implementing a Handle.ready dev write msecs returns % if the device has data to read (if write is ") or space to write new data (if write is ). msecs. specifies how long to wait, in milliseconds.Pcloses the device. Further operations on the device should produce exceptions.returns ( if the device is a terminal or console.returns  if the device supports  operations.+seek to the specified position in the data.(return the current position in the data.return the size of the data.change the size of the data.Kfor terminal devices, changes whether characters are echoed on the device.#returns the current echoing status.some devices (e.g. terminals) support a "raw" mode where characters entered are immediately made available to the program. If available, this operations enables raw mode. returns the  corresponding to this device.}duplicates the device, if possible. The new device is expected to share a file pointer with the original device (like Unix dup).dup2 source target replaces the target device with the source device. The target device is closed first, if necessary, and then it is made into a duplicate of the first device (like Unix dup2).;A low-level I/O provider where the data is bytes in memory.bRead up to the specified number of bytes, returning the number of bytes actually read. This function should only block if there is no data available. If there is not enough data available, then the function should just return the available data. A return value of zero indicates that the end of the data stream (e.g. end of file) has been reached.[Read up to the specified number of bytes, returning the number of bytes actually read, or , if the end of the stream has been reached.$Write the specified number of bytes.iWrite up to the specified number of bytes without blocking. Returns the actual number of bytes written.'(c) The University of Glasgow 1997-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)UnsafeB  !"#$%&'45 !  !"#$%&'((c) The University of Glasgow, 1992-2004see libraries/base/LICENSEffi@haskell.orginternalnon-portable (GHC Extensions)UnsafeB=Create a stable pointer referring to the given Haskell value.A stable pointer is a reference to a Haskell expression that is guaranteed not to be affected by garbage collection, i.e., it will neither be deallocated nor will the value of the stable pointer itself change during garbage collection (ordinary references may be relocated during garbage collection). Consequently, stable pointers can be passed to foreign code, which can treat it as an opaque reference to a Haskell value.A value of type  StablePtr a5 is a stable pointer to a Haskell expression of type a.|Dissolve the association between the stable pointer and the Haskell value. Afterwards, if the stable pointer is passed to  or T, the behaviour is undefined. However, the stable pointer may still be passed to  , but the , () value returned by 8, in this case, is undefined (in particular, it may be ,). Nevertheless, the call to  is guaranteed not to diverge.}Obtain the Haskell value referenced by a stable pointer, i.e., the same value that was passed to the corresponding call to  makeStablePtr. If the argument to  has already been freed using , the behaviour of  is undefined.Coerce a stable pointer to an address. No guarantees are made about the resulting value, except that the original stable pointer can be recovered by . In particular, the address may not refer to an accessible memory location and any attempt to pass it to the member functions of the class G leads to undefined behaviour.The inverse of , i.e., we have the identity 0sp == castPtrToStablePtr (castStablePtrToPtr sp)for any stable pointer sp on which ( has not been executed yet. Moreover, > may only be applied to pointers that have been produced by .()(()"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable Trustworthy!(c) The FFI task force, 2000-2002see libraries/base/LICENSEffi@haskell.orginternalnon-portable (GHC Extensions) TrustworthyB *+,-./0123456789:;<=>?@ABCDEFGHI *+,-./0123456789:;<=>?@ABCDEFGHI *+,-./0123456789:;<=>?@ABCDEFGHIG(c) The FFI task force 2001see libraries/base/LICENSEffi@haskell.org provisionalportable TrustworthyT LThe member functions of this class facilitate writing values of primitive types to raw memory (which may have been allocated with the above mentioned routines) and reading values from blocks of raw memory. The class, furthermore, includes support for computing the storage requirements and alignment restrictions of storable types.3Memory addresses are represented as values of type  a , for some a which is an instance of class . The type argument to  helps provide some valuable type safety in FFI code (you can't mix pointers of different types without an explicit cast), while helping the Haskell type system figure out which marshalling method is needed for a given pointer.gAll marshalling between Haskell and a foreign language ultimately boils down to translating Haskell data structures into the binary representation of a corresponding data structure of the foreign language and vice versa. To code this marshalling in Haskell, it is necessary to manipulate primitive data types stored in unstructured memory blocks. The class  facilitates this manipulation on all types for which it is instantiated, which are the standard basic types of Haskell, the fixed size Int types (x, y, z, {), the fixed size Word types (, , , ), , all types from Foreign.C.Types , as well as .eComputes the storage requirements (in bytes) of the argument. The value of the argument is not used.MComputes the alignment constraint of the argument. An alignment constraint x+ is fulfilled by any address divisible by x). The value of the argument is not used.Read a value from a memory area regarded as an array of values of the same kind. The first argument specifies the start address of the array and the second the index into the array (the first element of the array has index 0!). The following equality holds, ^peekElemOff addr idx = IOExts.fixIO $ \result -> peek (addr `plusPtr` (idx * sizeOf result))vNote that this is only a specification, not necessarily the concrete implementation of the function.wWrite a value to a memory area regarded as an array of values of the same kind. The following equality holds: DpokeElemOff addr idx x = poke (addr `plusPtr` (idx * sizeOf x)) xoRead a value from a memory location given by a base address and offset. The following equality holds: 0peekByteOff addr off = peek (addr `plusPtr` off)nWrite a value to a memory location given by a base address and offset. The following equality holds: 4pokeByteOff addr off x = poke (addr `plusPtr` off) x,Read a value from the given memory location.Note that the peek and poke functions might require properly aligned addresses to function correctly. This is architecture dependent; thus, portable code should ensure that when peeking or poking values of some type a!, the alignment constraint for a, as given by the function  is fulfilled.^Write the given value to the given memory location. Alignment restrictions might apply; see .JK  JKH$Conor McBride and Ross Paterson 20054BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimentalportable Trustworthy+5DITThe  functor.CThis instance would be equivalent to the derived instances of the  newtype if the runConst field were removedCThis instance would be equivalent to the derived instances of the  newtype if the runConst field were removedI(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable Trustworthy/BI  Haskell type representing the C jmp_buf type.  Haskell type representing the C fpos_t type.  Haskell type representing the C FILE type. Haskell type representing the C  suseconds_t type. Haskell type representing the C  useconds_t type. Haskell type representing the C time_t type. Haskell type representing the C clock_t type. Haskell type representing the C  sig_atomic_t type. Haskell type representing the C wchar_t type. Haskell type representing the C size_t type. Haskell type representing the C  ptrdiff_t type. Haskell type representing the C double type.  Haskell type representing the C float type." Haskell type representing the C unsigned long long type.$ Haskell type representing the C  long long type.& Haskell type representing the C  unsigned long type.( Haskell type representing the C long type.* Haskell type representing the C  unsigned int type., Haskell type representing the C int type.. Haskell type representing the C unsigned short type.0 Haskell type representing the C short type.2 Haskell type representing the C  unsigned char type.4 Haskell type representing the C  signed char type.6 Haskell type representing the C char type.j   L M N !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi5      !"#$%&'()*+,-./01234567567452301./,-*+()&'$%"#   !   N   L M N !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi,(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable Trustworthy/BITEA signed integral type that can be losslessly converted to and from Ptr2. This type is also compatible with the C99 type intptr_t6, and can be marshalled to and from that type safely.UHAn unsigned integral type that can be losslessly converted to and from Ptr1. This type is also compatible with the C99 type  uintptr_t6, and can be marshalled to and from that type safely.V.Release the storage associated with the given , which must have been obtained from a wrapper stub. This should be called whenever the return value from a foreign import wrapper function is no longer required; otherwise, the storage it uses will leak.Wcasts a Ptr to a WordPtrXcasts a WordPtr to a PtrYcasts a Ptr to an IntPtrZ casts an IntPtr to a Ptr TOUPVWXYZ[\]^TUVWXYZVTYZUWX TOUPVWXYZ[\]^((c) The University of Glasgow, 1992-2003see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions)Unsafe/BQ+A box around Weak#, private to this module.tA finalizer is represented as a pointer to a foreign function that, at finalisation time, gets as an argument a plain pointer variant of the foreign pointer that the finalizer is associated with.Note that the foreign function must use the ccall calling convention.u The type u represents references to objects that are maintained in a foreign language, i.e., that are not part of the data structures usually managed by the Haskell storage manager. The essential difference between u)s and vanilla memory references of type Ptr a, is that the former may be associated with  finalizers. A finalizer is a routine that is invoked when the Haskell storage manager detects that - within the Haskell heap and stack - there are no more references left that are pointing to the u. Typically, the finalizer will, then, invoke routines in the foreign language that free the resources bound by the foreign object.The u% is parameterised in the same way as . The type argument of u* should normally be an instance of class .RTurns a plain memory reference into a foreign object by associating a finalizer - given by the monadic operation - with the reference. The storage manager will start the finalizer, in a separate thread, some time after the last reference to the  ForeignPtr is dropped. There is no guarantee of promptness, and in fact there is no guarantee that the finalizer will eventually run at all.Note that references from a finalizer do not necessarily prevent another object from being finalized. If A's finalizer refers to B (perhaps using {, then the only guarantee is that B's finalizer will never be started before A's. If both A and B are unreachable, then both finalizers will start together. See { for more on finalizer ordering.v"Allocate some memory and return a u= to it. The memory will be released automatically when the u is discarded.v is equivalent to 4 do { p <- malloc; newForeignPtr finalizerFree p }galthough it may be implemented differently internally: you may not assume that the memory returned by v has been allocated with S. GHC notes: vo has a heavily optimised implementation in GHC. It uses pinned memory in the garbage collected heap, so the u; does not require a finalizer to free the memory. Use of vD and associated functions is strongly recommended in preference to  newForeignPtr with a finalizer.wThis function is similar to vX, except that the size of the memory required is given explicitly as a number of bytes.SThis function is similar to wf, except that the size and alignment of the memory required is given explicitly as numbers of bytes.T"Allocate some memory and return a u= to it. The memory will be released automatically when the u is discarded. GHC notes: T$ has a heavily optimised implementation in GHC. It uses pinned memory in the garbage collected heap, as for mallocForeignPtr. Unlike mallocForeignPtr, a ForeignPtr created with mallocPlainForeignPtr carries no finalizers. It is not possible to add a finalizer to a ForeignPtr created with mallocPlainForeignPtr. This is useful for ForeignPtrs that will live only inside Haskell (such as those created for packed strings). Attempts to add a finalizer to a ForeignPtr created this way, or to finalize such a pointer, will throw an exception.UThis function is similar to w, except that the internally an optimised ForeignPtr representation with no finalizer is used. Attempts to add a finalizer will cause an exception to be thrown.VThis function is similar to S, except that the internally an optimised ForeignPtr representation with no finalizer is used. Attempts to add a finalizer will cause an exception to be thrown.xUThis function adds a finalizer to the given foreign object. The finalizer will run beforeN all other finalizers for the same object which have already been registered.yLike y but allows the finalizer to be passed an additional environment parameter to be passed to the finalizer. The environment passed to the finalizer is fixed by the second argument to yW,This function adds a finalizer to the given  ForeignPtr. The finalizer will run beforeN all other finalizers for the same object which have already been registered.This is a variant of addForeignPtrFinalizer', where the finalizer is an arbitrary IOF action. When it is invoked, the finalizer will run in a new thread.NB. Be very careful with these finalizers. One common trap is that if a finalizer references another finalized value, it does not prevent that value from being finalized. In particular, Handle?s are finalized objects, so a finalizer should not refer to a Handle (including stdout, stdin or stderr).zgTurns a plain memory reference into a foreign pointer that may be associated with finalizers by using x.{This function ensures that the foreign object in question is alive at the given place in the sequence of IO actions. In particular J does a {$ after it executes the user action.ZNote that this function should not be used to express dependencies between finalizers on u)s. For example, if the finalizer for a u F1 calls { on a second u F25, then the only guarantee is that the finalizer for F2+ is never started before the finalizer for F17. They might be started together if for example both F1 and F2d are otherwise unreachable, and in that case the scheduler might end up running the finalizer for F2 first.In general, it is not recommended to use finalizers on separate objects with ordering constraints between them. To express the ordering robustly requires explicit synchronisation using MVars between the finalizers, but even then the runtime sometimes runs multiple finalizers sequentially in a single thread (for performance reasons), so synchronisation between finalizers could result in artificial deadlock. Another alternative is to use explicit reference counting.|This function extracts the pointer component of a foreign pointer. This is a potentially dangerous operations, as if the argument to | is the last usage occurrence of the given foreign pointer, then its finalizer(s) will be run, which potentially invalidates the plain pointer just obtained. Hence, {p must be used wherever it has to be guaranteed that the pointer lives on - i.e., has another usage occurrence.TTo avoid subtle coding errors, hand written marshalling code should preferably use J rather than combinations of | and {_. However, the latter routines are occasionally preferred in tool generated marshalling code.}This function casts a u. parameterised by one type into another type.~OCauses the finalizers associated with a foreign pointer to be run immediately.'QXstYZ[\]^_`uaRvwSTUVxyWbcdefgz{h|}~ijkstYZ[\uaRvwSTUVxyWz{|}~QXstYZ[\]^_`uaRvwSTUVxyWbcdefgz{h|}~ijkL"(c) The University of Glasgow 2003/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisional#non-portable (requires concurrency) Trustworthy\Turns a plain memory reference into a foreign object by associating a finalizer - given by the monadic operation - with the reference. The finalizer will be executed after the last reference to the foreign object is dropped. There is no guarantee of promptness, and in fact there is no guarantee that the finalizer will eventually run at all.,This function adds a finalizer to the given uZ. The finalizer will run after the last reference to the foreign object is dropped, but before; all previously registered finalizers for the same object."(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportableUnsafe*Turns a plain memory reference into a foreign pointer, and associates a finalizer with the reference. The finalizer will be executed after the last reference to the foreign object is dropped. There is no guarantee of promptness, however the finalizer will be executed before the program exits.This is a way to look at the pointer living inside a foreign object. This function takes a function which is applied to that pointer. The resulting  action is then executed. The foreign object is kept alive at least during the whole action, even if it is not used directly inside. Note that it is not safe to return the pointer from the action and use it after the action completes. All uses of the pointer should be inside the ? bracket. The reason for this unsafeness is the same as for |h below: the finalizer may run earlier than expected, because the compiler can only track usage of the u object, not a  object made from it.^This function is normally used for marshalling data to or from the object pointed to by the u!, using the operations from the  class.This variant of  adds a finalizer that expects an environment in addition to the finalized pointer. The environment that will be passed to the finalizer is fixed by the second argument to .This function is similar to Uc, but yields a memory area that has a finalizer attached that releases the memory area. As with vB, it is not guaranteed that the block of memory was allocated by S.This function is similar to Uc, but yields a memory area that has a finalizer attached that releases the memory area. As with vB, it is not guaranteed that the block of memory was allocated by S.stuvwxyz{|}~J"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable Trustworthystuvwxyz{}~utszxy~{}vwM"(c) The University of Glasgow 2008see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyAA mutable array of bytes that can be passed to foreign functions.The buffer is represented by a record, where the record contains the raw buffer and the start/end points of the filled portion. The buffer contents itself is mutable, but the rest of the record is immutable. This is a slightly odd mix, but it turns out to be quite practical: by making all the buffer metadata immutable, we can have operations on buffer metadata outside of the IO monad.8The "live" elements of the buffer are those between the  and  offsets. In an empty buffer,  is equal to s, but they might not be zero: for exmaple, the buffer might correspond to a memory-mapped file and in which case e will point to the next location to be written, which is not necessarily the beginning of the file.2slides the contents of the buffer to the beginning*lm(("lmN"(c) The University of Glasgow 2008see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyThe purpose of { is to provide a common interface for I/O devices that can read and write data through a buffer. Devices that implement f include ordinary files, memory-mapped files, and bytestrings. The underlying device implementing a Handle must provide .allocate a new buffer. The size of the buffer is at the discretion of the device; e.g. for a memory-mapped file the buffer will probably cover the entire file.reads bytes into the buffer, blocking if there are no bytes available. Returns the number of bytes read (zero indicates end-of-file), and the new buffer.reads bytes into the buffer without blocking. Returns the number of bytes read (Nothing indicates end-of-file), and the new buffer.Prepares an empty write buffer. This lets the device decide how to set up a write buffer: the buffer may need to point to a specific location in memory, for example. This is typically used by the client when switching from reading to writing on a buffered read/write device.jThere is no corresponding operation for read buffers, because before reading the client will always call .Flush all the data from the supplied write buffer out to the device. The returned buffer should be empty, and ready for writing.Flush data from the supplied write buffer out to the device without blocking. Returns the number of bytes written and the remaining buffer.   O((c) The University of Glasgow, 2008-2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyAT Stopped because the input contains insufficient available elements, or all of the input sequence has been successfully translated.>Stopped because the output contains insufficient free elementsStopped because there are sufficient free elements in the output to output at least one encoded ASCII character, but the input contains an invalid or unrepresentable sequenceA k is a specification of a conversion scheme between sequences of bytes and sequences of Unicode characters.XFor example, UTF-8 is an encoding of Unicode characters into a sequence of bytes. The  for UTF-8 is utf8.a string that can be passed to mkTextEncoding to create an equivalent .Creates a means of decoding bytes into characters: the result must not be shared between several byte sequences or simultaneously across threadsCreates a means of encode characters into bytes: the result must not be shared between several character sequences or simultaneously across threadsThe encode, function translates elements of the buffer from to the buffer to. It should translate as many elements as possible given the sizes of the buffers, including translating zero elements if there is either not enough room in to, or from1 does not contain a complete multibyte sequence.If multiple CodingProgress returns are possible, OutputUnderflow must be preferred to InvalidSequence. This allows GHC's IO library to assume that if we observe InvalidSequence there is at least a single element available in the output buffer.The fact that as many elements as possible are translated is used by the IO library in order to report translation errors at the point they actually occur, rather than when the buffer is translated.The recover function is used to continue decoding in the presence of invalid or unrepresentable sequences. This includes both those detected by encode returning InvalidSequenceO and those that occur because the input byte sequence appears to be truncated.CProgress will usually be made by skipping the first element of the fromo buffer. This function should only be called if you are certain that you wish to do this skipping and if the to buffer has at least one element of free space. Because this function deals with decoding failure, it assumes that the from buffer has at least one element.recover6 may raise an exception rather than skipping anything.#Currently, some implementations of recover` may mutate the input buffer. In particular, this feature is used to implement transliteration.AResources associated with the encoding may now be released. The encode1 function may not be called again after calling close.&Return the current state of the codec. Many codecs are not stateful, and in these case the state can be represented as '()'. Other codecs maintain a state. For example, UTF-16 recognises a BOM (byte-order-mark) character at the beginning of the input, and remembers thereafter whether to use big-endian or little-endian mode. In this case, the state of the codec would include two pieces of information: whether we are at the beginning of the stream (the BOM only occurs at the beginning), and if not, whether to use the big or little-endian encoding. ((c) The University of Glasgow, 1994-2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyATSpecifies the translation, if any, of newline characters between internal Strings and the external file or stream. Haskell Strings are assumed to represent newlines with the '\n'9 character; the newline mode specifies how to translate '\n'( on output, and what to translate into '\n' on input.'the representation of newlines on input(the representation of newlines on output?The representation of a newline in the external file or stream.'\n''\r\n'Three kinds of buffering are supported: line-buffering, block-buffering or no-buffering. These modes have the following effects. For output, items are written out, or flushed9, from the internal buffer according to the buffer mode:line-bufferingd: the entire output buffer is flushed whenever a newline is output, the buffer overflows, a $ is issued, or the handle is closed.block-buffering@: the entire buffer is written out whenever it overflows, a $ is issued, or the handle is closed. no-bufferingD: output is written immediately, and never stored in the buffer.An implementation is free to flush the buffer more frequently, but not less frequently, than specified above. The output buffer is emptied as soon as it has been written out.DSimilarly, input occurs according to the buffer mode for the handle:line-buffering?: when the buffer for the handle is not empty, the next item is obtained from the buffer; otherwise, when the buffer is empty, characters up to and including the next newline character are read into the buffer. No characters are available until the newline character is available or the buffer is full.block-bufferingc: when the buffer for the handle becomes empty, the next block of data is read into the buffer. no-buffering4: the next input item is read and returned. The Y operation implies that even a no-buffered handle may require a one-character buffer.The default buffering mode when a handle is opened is implementation-dependent and may depend on the file system object which is attached to that handle. For most implementations, physical files will normally be block-buffered and terminals will normally be line-buffered."buffering is disabled if possible.-line-buffering should be enabled if possible.Jblock-buffering should be enabled if possible. The size of the buffer is n items if the argument is  n+ and is otherwise implementation-dependent.jHaskell defines operations to read and write characters from and to files, represented by values of type Handle!. Each value of this type is a handle2: a record used by the Haskell run-time system to manageP I/O with file system objects. A handle has at least the following properties:+whether it manages input or output or both;whether it is open, closed or  semi-closed;whether the object is seekable;Cwhether buffering is disabled, or enabled on a line or block basis;$a buffer (whose length may be zero).Most handles will also have a current I/O position indicating where the next input or output operation will occur. A handle is readableE if it manages only input or both input and output; likewise, it is writableC if it manages only output or both input and output. A handle is open when first allocated. Once it is closed it can no longer be used for either input or output, though an implementation cannot re-use its storage while references remain to it. Handles are in the ` and S classes. The string produced by showing a handle is system dependent; it should include enough information to identify the handle for debugging. A handle is equal according to &e only to itself; no attempt is made to compare the internal state of different handles for equality.<The native newline representation for the current platform:  on Unix systems,  on Windows.Map '\r\n' into '\n' on input, and '\n' to the native newline represetnation on output. This mode can be used on any platform, and works with text files using any newline convention. The downside is that readFile >>= writeFile might yield a different file. wuniversalNewlineMode = NewlineMode { inputNL = CRLF, outputNL = nativeNewline }>Use the native newline representation on both input and output ynativeNewlineMode = NewlineMode { inputNL = nativeNewline outputNL = nativeNewline }!Do no newline translation at all. DnoNewlineTranslation = NewlineMode { inputNL = LF, outputNL = LF }3nopqrstuvwxyz{|}~7nopqrstuvwxyz{|}~nopqrstuvwxyz{|}~#(c) The University of Glasgow, 2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable Trustworthy5ABT,The Haskell 2010 type for exceptions in the ( monad. Any I/O operation may raise an z instead of returning a result. For a more general type of exception, including also those that arise in pure code, see C.(In Haskell 2010, this is an opaque type.Exceptions that occur in the IO monad. An  IOExceptionz records a more specific error type, a descriptive string and maybe the handle that was used when the error was flagged. Construct an 0 value with a string describing the error. The ) method of the  instance of the W class raises a , thus: >instance Monad IO where ... fail s = ioError (userError s);An abstract type that contains a value for each variant of .1Defines the exit codes that a program can return.!indicates successful termination;indicates program failure with an exit code. The exact interpretation of the code is operating-system dependent. In particular, some values may be prohibited (e.g. 0 on a POSIX-compliant system).(Exceptions generated by array operationsCAn attempt was made to index an array outside its declared bounds.VAn attempt was made to evaluate an element of an array that had not been initialized.Asynchronous exceptions.The current thread's stack exceeded its limit. Since an exception has been raised, the thread's stack will certainly be below its limit again, but the programmer should take remedial action immediately.The program's heap is reaching its limit, and the program should take action to reduce the amount of live data it has. Notes:5It is undefined which thread receives this exception.GHC currently does not throw  exceptions.4This exception is raised by another thread calling bI, or by the system if it needs to terminate the thread for some reason.This exception is raised by default in the main thread of the program when the user requests to terminate the program via the usual mechanism(s) (e.g. Control-C in the console).'Superclass for asynchronous exceptions. was applied to .5This thread has exceeded its allocation limit. See c and c.BThere are no runnable threads, so the program is deadlocked. The Deadlock- exception is raised in the main thread only.]The thread is waiting to retry an STM transaction, but there are no other references to any TVar&s involved, so it can't ever continue.The thread is blocked on an MVar,, but there are no other references to the MVar so it can't ever continue. Raise an  in the  monad.WA/S(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable TrustworthyB .A pointer to a foreign function equivalent to  (, which may be used as a finalizer (cf J) for storage allocated with , ,  or  .FAllocate a block of memory that is sufficient to hold values of type a7. The size of the area allocated is determined by the  method from the instance of  for the appropriate type.$The memory may be deallocated using   or  when no longer required.Like / but memory is filled with bytes of value zero.Allocate a block of memory of the given number of bytes. The block of memory is sufficiently aligned for any of the basic foreign types that fits into a memory block of the allocated size.$The memory may be deallocated using   or  when no longer required.Llike / but memory is filled with bytes of value zero. f executes the computation fo, passing as argument a pointer to a temporarily allocated block of memory sufficient to hold values of type a.The memory is freed when fM terminates (either normally or via an exception), so the pointer passed to f must not be used after this. n f executes the computation fO, passing as argument a pointer to a temporarily allocated block of memory of n bytes. The block of memory is sufficiently aligned for any of the basic foreign types that fits into a memory block of the allocated size.The memory is freed when fM terminates (either normally or via an exception), so the pointer passed to f must not be used after this.-Resize a memory area that was allocated with  or - to the size needed to store values of type b~. The returned pointer may refer to an entirely different memory area, but will be suitably aligned to hold values of type b. The contents of the referenced memory area will be the same as of the original pointer up to the minimum of the original size and the size of values of type b.If the argument to  is ,  behaves like . -Resize a memory area that was allocated with  or f to the given size. The returned pointer may refer to an entirely different memory area, but will be sufficiently aligned for any of the basic foreign types that fits into a memory block of the given size. The contents of the referenced memory area will be the same as of the original pointer up to the minimum of the original size and the given size.If the pointer argument to   is ,   behaves like . If the requested size is 0,   behaves like  . /Free a block of memory that was allocated with , , ,  , T or any of the newX functions in Foreign.Marshal.Array or Foreign.C.String.         T(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable Trustworthy *Basic C routines needed for memory copying LAllocate a block of memory and marshal a value into it (the combination of  and 8). The size of the area allocated is determined by the G method from the instance of  for the appropriate type.$The memory may be deallocated using S or S when no longer required.   val f executes the computation fX, passing as argument a pointer to a temporarily allocated block of memory into which val) has been marshalled (the combination of  and ).The memory is freed when fM terminates (either normally or via an exception), so the pointer passed to f must not be used after this. Convert a Haskell s to its numeric representation>Convert a Boolean in numeric representation to a Haskell value=Allocate storage and marshal a storable value wrapped into a }the  is used to represent  Converts a withXXX9 combinator into one marshalling a value wrapped into a }, using  to represent ./Convert a peek combinator into a one returning  if applied to a   Replicates a withXXXJ combinator over a list of objects, yielding a list of marshalled objectssCopies the given number of bytes from the second area (source) into the first (destination); the copied areas may not overlapoCopies the given number of bytes from the second area (source) into the first (destination); the copied areas may overlap>Fill a given number of bytes in memory area with a byte value.              U(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable TrustworthyBLAllocate storage for the given number of elements of a storable type (like S, but for multiple elements).Like C, but add an extra position to hold a special termination element.Like :, but allocated memory is filled with bytes of value zero.Like ;, but allocated memory is filled with bytes of value zero.CTemporarily allocate space for the given number of elements (like S, but for multiple elements).Like C, but add an extra position to hold a special termination element.Adjust the size of an arrayKAdjust the size of an array including an extra position for the end marker.~Convert an array of given length into a Haskell list. The implementation is tail-recursive and so uses constant stack space.GConvert an array terminated by the given end marker into a Haskell list /Write the list elements consecutive into memory!aWrite the list elements consecutive into memory and terminate them with the given marker element"jWrite a list of storable elements into a newly allocated, consecutive sequence of storable values (like T, but for multiple elements).#Write a list of storable elements into a newly allocated, consecutive sequence of storable values, where the end is fixed by the given end marker$=Temporarily store a list of storable values in memory (like T, but for multiple elements).%Like $F, but the action gets the number of values as an additional parameter&Like $1, but a terminator indicates where the array ends'Like %1, but a terminator indicates where the array ends({Copy the given number of elements from the second array (source) into the first array (destination); the copied areas may not overlap)wCopy the given number of elements from the second array (source) into the first array (destination); the copied areas may overlap*CReturn the number of elements in an array, excluding the terminator+?Advance a pointer into an array by the given number of elements !"#$%&'()*+ !"#$%&'()*+ !"#$&%'()*+ !"#$%&'()*+V(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable Trustworthy, Execute an  action, throwing a  if the predicate yields , when applied to the result returned by the J action. If no exception is raised, return the result of the computation.-Like ,, but discarding the result.%Guards against negative result values/Like ., but discarding the result0Guards against null pointers1Discard the return value of an  action,%error condition on the result of the  action9computes an error message from erroneous results of the  actionthe  action to be executed-./01,-./01,-./01,-./01W(c) Sven Panne 2002-2004/BSD-style (see the file libraries/base/LICENSE)sven.panne@aedion.de provisionalportable Trustworthy2A memory pool.3Allocate a fresh memory pool.4UDeallocate a memory pool and everything which has been allocated in the pool itself.5Execute an action with a fresh memory pool, which gets automatically deallocated (including its contents) after the action has finished.6iAllocate space for storable type in the given pool. The size of the area allocated is determined by the  method from the instance of  for the appropriate type.7:Allocate the given number of bytes of storage in the pool.8[Adjust the storage area for an element in the pool to the given size of the required type.9EAdjust the storage area for an element in the pool to the given size.:RAllocate storage for the given number of elements of a storable type in the pool.;Allocate storage for the given number of elements of a storable type in the pool, but leave room for an extra element to signal the end of the array.<.Adjust the size of an array in the given pool.=AAdjust the size of an array with an end marker in the given pool.>XAllocate storage for a value in the given pool and marshal the value into this storage.?fAllocate consecutive storage for a list of values in the given pool and marshal these values into it.@Allocate consecutive storage for a list of values in the given pool and marshal these values into it, terminating the end with the given marker.23456789:;<=>?@23456789:;<=>?@23456789:;<=>?@23456789:;<=>?@(c) The FFI task force 2003/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportableSafeA      !"#$%&'()*+,-./0123456789:;<=>?@(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportableSafewxyz{     !"#$%&'(opsTUVWXYZstuvwxyz{}~      !"#$%&'()*+,-./0123456789:;<=>?@(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportableSafewxyz{     !"#$%&'(opsTUVWXYZstuvwxyz{}~      !"#$%&'()*+,-./0123456789:;<=>?@(c) The FFI task force 2003/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportableSafeA      !"#$%&'()*+,-./0123456789:;<=>?@X((c) The University of Glasgow, 2008-2011see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyA8Marshal a NUL terminated C string into a Haskell string.B>Marshal a C string with explicit length into a Haskell string.C8Marshal a Haskell string into a NUL terminated C string.the Haskell string may not contain any NUL charactersPnew storage is allocated for the C string and must be explicitly freed using   or .DaMarshal a Haskell string into a C string (ie, character array) with explicit length information.Pnew storage is allocated for the C string and must be explicitly freed using   or .EQMarshal a Haskell string into a NUL terminated C string using temporary storage.the Haskell string may not contain any NUL charactersthe memory is freed when the subcomputation terminates (either normally or via an exception), so the pointer to the temporary storage must not be used after this.FwMarshal a Haskell string into a C string (ie, character array) in temporary storage, with explicit length information.the memory is freed when the subcomputation terminates (either normally or via an exception), so the pointer to the temporary storage must not be used after this.G>Determines whether a character can be accurately encoded in a .Pretty much anyone who uses this function is in a state of sin because whether or not a character is encodable will, in general, depend on the context in which it occurs.ABCDEFGEncoding of CStringString in Haskell termsEncoding of CString to createNull-terminate?String to encode/Worker that can safely use the allocated memoryEncoding of CString to createNull-terminate?String to encodeABCDEFGABCDEFGABCDEFGY(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable TrustworthyH<A wide character string with explicit length information in Ws instead of a terminating NUL (allowing NUL characters in the middle of the string).ISA C wide string is a reference to an array of C wide characters terminated by NUL.JA string with explicit length information in bytes instead of a terminating NUL (allowing NUL characters in the middle of the string).KHA C string is a reference to an array of C characters terminated by NUL.L8Marshal a NUL terminated C string into a Haskell string.M>Marshal a C string with explicit length into a Haskell string.N8Marshal a Haskell string into a NUL terminated C string.the Haskell string may not contain any NUL charactersPnew storage is allocated for the C string and must be explicitly freed using S or S.OaMarshal a Haskell string into a C string (ie, character array) with explicit length information.Pnew storage is allocated for the C string and must be explicitly freed using S or S.PQMarshal a Haskell string into a NUL terminated C string using temporary storage.the Haskell string may not contain any NUL charactersthe memory is freed when the subcomputation terminates (either normally or via an exception), so the pointer to the temporary storage must not be used after this.QwMarshal a Haskell string into a C string (ie, character array) in temporary storage, with explicit length information.the memory is freed when the subcomputation terminates (either normally or via an exception), so the pointer to the temporary storage must not be used after this.S\Convert a C byte, representing a Latin-1 character, to the corresponding Haskell character.TfConvert a Haskell character to a C character. This function is only safe on the first 256 characters.U Convert a C  unsigned charL, representing a Latin-1 character, to the corresponding Haskell character.V#Convert a Haskell character to a C  unsigned char:. This function is only safe on the first 256 characters.W Convert a C  signed charL, representing a Latin-1 character, to the corresponding Haskell character.X#Convert a Haskell character to a C  signed char:. This function is only safe on the first 256 characters.Y8Marshal a NUL terminated C string into a Haskell string.Z>Marshal a C string with explicit length into a Haskell string.[8Marshal a Haskell string into a NUL terminated C string.the Haskell string may not contain any NUL charactersPnew storage is allocated for the C string and must be explicitly freed using S or S.\aMarshal a Haskell string into a C string (ie, character array) with explicit length information.Pnew storage is allocated for the C string and must be explicitly freed using S or S.]QMarshal a Haskell string into a NUL terminated C string using temporary storage.the Haskell string may not contain any NUL charactersthe memory is freed when the subcomputation terminates (either normally or via an exception), so the pointer to the temporary storage must not be used after this.^wMarshal a Haskell string into a C string (ie, character array) in temporary storage, with explicit length information.the memory is freed when the subcomputation terminates (either normally or via an exception), so the pointer to the temporary storage must not be used after this._=Marshal a NUL terminated C wide string into a Haskell string.`CMarshal a C wide string with explicit length into a Haskell string.a=Marshal a Haskell string into a NUL terminated C wide string.the Haskell string may not contain any NUL charactersUnew storage is allocated for the C wide string and must be explicitly freed using S or S.bkMarshal a Haskell string into a C wide string (ie, wide character array) with explicit length information.Unew storage is allocated for the C wide string and must be explicitly freed using S or S.cVMarshal a Haskell string into a NUL terminated C wide string using temporary storage.the Haskell string may not contain any NUL charactersthe memory is freed when the subcomputation terminates (either normally or via an exception), so the pointer to the temporary storage must not be used after this.dMarshal a Haskell string into a C wide string (i.e. wide character array) in temporary storage, with explicit length information.the memory is freed when the subcomputation terminates (either normally or via an exception), so the pointer to the temporary storage must not be used after this.$HIJKLMNOPQRSTUVWXYZ[\]^_`abcdHIJKLMNOPQRSTUVWXYZ[\]^_`abcdKJLMNOPQRTSVUXWYZ[\]^IH_`abcd$HIJKLMNOPQRSTUVWXYZ[\]^_`abcdZ(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable TrustworthyeHaskell representation for errnof values. The implementation is deliberately exposed, to allow users to add their own definitions of e values.Yield  if the given e6 value is valid on the system. This implies that the S instance of eE is also system dependent as it is only defined for valid values of e.Get the current value of errno in the current thread.Reset the current thread's errno value to g. Throw an ' corresponding to the current value of . Throw an ' corresponding to the current value of  if the result value of the " action meets the given predicate.as !, but discards the result of the  action after error handling.as , but retry the ' action when it yields the error code O - this amounts to the standard retry loop for interrupted POSIX system calls.as ;, but additionally if the operation yields the error code n or 5, an alternative action is executed before retrying.as , but discards the result.as , but discards the result. Throw an ' corresponding to the current value of  if the  action returns a result of -1.as , but discards the result. Throw an ' corresponding to the current value of  if the  action returns a result of -13, but retries in case of an interrupted operation.as , but discards the result.as -, but checks for operations that would block.as , but discards the result. Throw an ' corresponding to the current value of  if the  action returns . Throw an ' corresponding to the current value of  if the  action returns 1, but retry in case of an interrupted operation.as -, but checks for operations that would block.as 9, but exceptions include the given path when appropriate.as <, but exceptions include the given path when appropriate.as <, but exceptions include the given path when appropriate.as <, but exceptions include the given path when appropriate.as <, but exceptions include the given path when appropriate.as <, but exceptions include the given path when appropriate. Construct an  based on the given eY value. The optional information can be used to improve the accuracy of error messages.efghijklmnopqrstuvwxyz{|}~)textual description of the error location/predicate to apply to the result value of the  operation#textual description of the locationthe  operation to be executed/predicate to apply to the result value of the  operation#textual description of the locationthe  operation to be executedDaction to execute before retrying if an immediate retry would block%the location where the error occurredthe error number)optional handle associated with the error+optional filename associated with the errorefghijklmnopqrstuvwxyz{|}~efghijklmnopqrstuvwxyz{|}~efghijklmnopqrstuvwxyz{|}~(c) The FFI task force 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportableSafe      !"#$%&'()*+,-./01234567HIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~[((c) The University of Glasgow, 2008-2011see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyThe  is used to construct  TextEncoding4s, and specifies how they handle illegal sequences.6Throw an error when an illegal sequence is encounteredDAttempt to ignore and recover if an illegal sequence is encountered?Replace with the closest visual match upon an illegal sequence_Use the private-use escape mechanism to attempt to allow illegal sequences to be roundtripped.JIn transliterate mode, we use this character when decoding unknown bytes.4This is the defined Unicode replacement character: <http://www.fileformat.info/info/unicode/char/0fffd/index.htmSome characters are actually "surrogate" codepoints defined for use in UTF-16. We need to signal an invalid character if we detect them when encoding a sequence of ts into )s because they won't give valid Unicode._We may also need to signal an invalid character if we detect them when encoding a sequence of ts into s because the N mode creates these to round-trip bytes through our internal UTF-16 encoding.   \#(c) The University of Glasgow, 2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyX    ]#(c) The University of Glasgow, 2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyBX                              ^#(c) The University of Glasgow, 2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyBX                                         _#(c) The University of Glasgow, 2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyBX      ! byte to check lower bound upper bound"#             !"#d((c) The University of Glasgow, 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions)Unsafe /BOT1 @Shared memory locations that support atomic memory transactions. .A monad supporting atomic memory transactions. The current status of a thread +the thread is currently runnable or running the thread has finished &the thread is blocked on some resource !)the thread received an uncaught exception # blocked on F $6blocked on a computation in progress by another thread % blocked in  : & blocked in  F in an STM transaction 'currently in a foreign call ()blocked on some other resource. Without  -threaded , I/O and  threadDelay show up as  (, with  -threaded they show up as  #. )A  )8 is an abstract type representing a handle to a thread.  ) is an instance of S, [ and ` , where the [6 instance implements an arbitrary total ordering over  )s. The `/ instance lets you convert an arbitrary-valued  ) to string form; showing a  )a value is occasionally useful when debugging or diagnosing the behaviour of a concurrent program.Note: in GHC, if you have a  ), you essentially have a pointer to the thread itself. This means the thread itself can't be garbage collected until you drop the  )>. This misfeature will hopefully be corrected at a later date. +Every thread has an allocation counter that tracks how much memory has been allocated by the thread. The counter is initialized to zero, and  +a sets the current value. The allocation counter counts *down*, so in the absence of a call to  +U its value is the negation of the number of bytes of memory allocated by the thread.7There are two things that you can do with this counter:0Use it as a simple profiling mechanism, with  ,.!Use it as a resource limit. See  -.8Allocation accounting is accurate only to about 4Kbytes. ,KReturn the current value of the allocation counter for the current thread. -Enables the allocation counter to be treated as a limit for the current thread. When the allocation limit is enabled, if the allocation counter counts down below zero, the thread will be sent the v asynchronous exception. When this happens, the counter is reinitialised (by default to 100K, but tunable with the +RTS -xq option) so that it can handle the exception and perform any necessary clean up. If it exhausts this additional allowance, another M exception is sent, and so forth. Like other asynchronous exceptions, the 3 exception is deferred while the thread is inside  or an exception handler in catch.,Note that memory allocation is unrelated to  live memory, also known as heap residency. A thread can allocate a large amount of memory and retain anything between none and all of it. It is better to think of the allocation limit as a limit on CPU time , rather than a limit on memory.bCompared to using timeouts, allocation limits don't count time spent blocked or in foreign calls. .;Disable allocation limit processing for the current thread. / Creates a new thread to run the ; computation passed as the first argument, and returns the  ) of the newly created thread.&The new thread will be a lightweight, unbound thread. Foreign calls made by this thread are not guaranteed to be made by any particular OS thread; if you need foreign calls to be made by a particular OS thread, then use b instead.The new thread inherits the masked state of the parent (see C).OThe newly created thread has an exception handler that discards the exceptions , , and D, and passes all other exceptions to the uncaught exception handler. 0Like  /, but the child thread is passed a function that can be used to unmask asynchronous exceptions. This function is typically used in the following way U ... mask_ $ forkIOWithUnmask $ \unmask -> catch (unmask ...) handlerso that the exception handler in the child thread is established with asynchronous exceptions masked, meanwhile the main body of the child thread is executed in the unmasked state.Note that the unmask function passed to the child thread should only be used in that thread; the behaviour is undefined if it is invoked in a different thread. 1Like  /L, but lets you specify on which capability the thread should run. Unlike a  / thread, a thread created by  1; will stay on the same capability for its entire lifetime ( /P threads can migrate between capabilities according to the scheduling policy).  1l is useful for overriding the scheduling policy when you know in advance how best to distribute the threads.The w argument specifies a capability number (see  4). Typically capabilities correspond to physical processors, but the exact behaviour is implementation-dependent. The value passed to  1G is interpreted modulo the total number of capabilities as returned by  4.9GHC note: the number of capabilities is specified by the +RTS -N_ option when the program is started. Capabilities can be fixed to actual processor cores with +RTS -qa if the underlying operating system supports that, although in practice this is usually unnecessary (and may actually degrade performance in some cases - experimentation is recommended). 2Like  0<, but the child thread is pinned to the given CPU, as with  1. 3the 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 processor cores on the machine.&Strictly speaking it is better to use  4<, because the number of capabilities might vary at runtime. 4Returns the number of Haskell threads that can run truly simultaneously (on separate physical processors) at any given time. To change this value, use  5. 5Set the number of Haskell threads that can run truly simultaneously (on separate physical processors) at any given time. The number passed to  1F is interpreted modulo this value. The initial value is given by the +RTS -N runtime flag.KThis is also the number of threads that will participate in parallel garbage collection. It is strongly recommended that the number of capabilities is not set larger than the number of physical processor cores, and it may often be beneficial to leave one or more cores free to avoid contention with other processes in the machine. 6/Returns the number of CPUs that the machine has 7>Returns the number of sparks currently in the local spark pool 9 9 raises the * exception in the given thread (GHC only). )killThread tid = throwTo tid ThreadKilled : :? raises an arbitrary exception in the target thread (GHC only).FException delivery synchronizes between the source and target thread:  : 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. Exception delivery is also atomic with respect to other exceptions. Atomicity is a useful property to have when dealing with race conditions: e.g. 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.Whatever work the target thread was doing when the exception was raised is not lost: the computation is suspended until required by another thread.jIf the target thread is currently making a foreign call, then the exception will not be raised (and hence  :m will not return) until the call has completed. This is the case regardless of whether the call is inside a = or not. However, in GHC a foreign call can be annotated as  interruptible, in which case a  :g will cause the RTS to attempt to cause the call to return; see the GHC documentation for more details.!Important note: the behaviour of  :P differs from that described in the paper "Asynchronous exceptions in Haskell" ( =http://research.microsoft.com/~simonpj/Papers/asynch-exns.htm). In the paper,  :[ is non-blocking; but the library implementation adopts a more synchronous design in which  : does not return until the exception is received by the target thread. The trade-off is discussed in Section 9 of the paper. Like any blocking operation,  :m is therefore interruptible (see Section 5.3 of the paper). Unlike other interruptible operations, however,  : is always3 interruptible, even if it does not actually block.There is no guarantee that the exception will be delivered promptly, although the runtime will endeavour to ensure that arbitrary delays don't occur. In GHC, an exception can only be raised when a thread reaches a  safe point, where a safe point is where memory allocation occurs. Some loops do not perform any memory allocation inside the loop and therefore cannot be interrupted by a  :.If the target of  :: is the calling thread, then the behaviour is the same as C, except that the exception is thrown as an asynchronous exception. This means that if there is an enclosing pure computation, which would be the case if the current IO operation is inside C or E, that computation is not permanently replaced by the exception, but is suspended as if it had received an asynchronous exception. Note that if  :v is called with the current thread as the target, the exception will be thrown even if the thread is currently inside  or . ; Returns the  )" of the calling thread (GHC only). <The  < 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. = = 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).COther applications like the graphical Concurrent Haskell Debugger ( +http://www.informatik.uni-kiel.de/~fhu/chd/) may choose to overload  = for their purposes as well. @0Internal function used by the RTS to run sparks. Breturns the number of the capability on which the thread is currently running, and a boolean indicating whether the thread is locked to that capability or not. A thread is locked to a capability if it was created with forkOn. Cmake a weak pointer to a  )H. It can be important to do this if you want to hold a reference to a  )1 while still allowing the thread to receive the BlockedIndefinitely family of exceptions (e.g. ). Holding a normal  )) reference will prevent the delivery of BlockedIndefinitelyB exceptions because the reference could be used as the target of  :. at any time, which would unblock the thread. Holding a  Weak ThreadIdA, on the other hand, will not prevent the thread from receiving BlockedIndefinitely? exceptions. It is still possible to throw an exception to a  Weak ThreadId, but the caller must use  deRefWeak5 first to determine whether the thread still exists. DXUnsafely performs IO in the STM monad. Beware: this is a highly dangerous thing to do.The STM implementation will often run transactions multiple times, so you need to be prepared for this if your IO has any side effects.The STM implementation will abort transactions that are known to be invalid and need to be restarted. This may happen in the middle of  D, so make sure you don't acquire any resources that need releasing (exception handlers are ignored when aborting the transaction). That includes doing any IO using Handles, for example. Getting this wrong will probably lead to random deadlocks.5The transaction may have seen an inconsistent view of memory when the IO runs. Invariants that you expect to be true throughout your program may not be true inside a transaction, due to the way transactions are implemented. Normally this wouldn't be visible to the programmer, but using  D can expose it. E+Perform a series of STM actions atomically.You cannot use  E inside an C or E. 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  M, which can be called inside C4, and which allows top-level TVars to be allocated. F1Retry 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) GCompose 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. H A variant of " that can only be used within the   monad.Throwing an exception in STM6 aborts the transaction and propagates the exception. Although  H/ has a type that is an instance of the type of *, the two functions are subtly different: ;throw e `seq` x ===> throw e throwSTM e `seq` x ===> x+The first example will cause the exception e8 to be raised, whereas the second one won't. In fact,  HG will only cause an exception to be raised when it is used within the   monad. The  H) variant should be used in preference to # to raise an exception within the  = monad because it guarantees ordering with respect to other   operations, whereas  does not. I&Exception handling within STM actions.$Low-level primitive on which always and alwaysSucceeds are built. checkInv differs form these in that (i) the invariant is not checked when checkInv is called, only at the end of this and subsequent transcations, (ii) the invariant failure is indicated by raising an exception. J9alwaysSucceeds 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. Kalways 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. L*Create a new TVar holding a value supplied MIO version of  L*. This is useful for creating top-level  s using 2 , because using  E inside 2  isn't possible. NAReturn the current value stored in a TVar. This is equivalent to # readTVarIO = atomically . readTVarrbut works much faster, because it doesn't perform a complete transaction, it just reads the current value of the  . O)Return the current value stored in a TVar P$Write the supplied value into a TVar\        ! " # $ % & ' ( ) *%&'()*+,-./01 + , - . / 0 1 2 3 4 5 6 7 82 9 : ; < = > ? @ A B C3456 D E F G H I$ J K L M N O P Q R S T U7 V W X Y Z [ \ ] ^ _ `?        ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W? ) * / 0 1 2 3 4 5 6 7 8 ; 9 : ? > @ < = C    ! " # $ % & ' ( A B + , - .   E F G H I J K   L M O N P D Q R V W U T SO        ! " # $ % & ' ( ) *%&'()*+,-./01 + , - . / 0 1 2 3 4 5 6 7 82 9 : ; < = > ? @ A B C3456 D E F G H I$ J K L M N O P Q R S T U7 V W X Y Z [ \ ] ^ _ ` >0 ?0  TrustworthyI89:;<=>?89:;=>89:;<=>?  Trustworthy@A mapping from keys k to priorites p.AE k p binds the key k with the priority p.BO(1)# The number of elements in a queue.CO(1) True if the queue is empty.DO(log n)L The priority and value of a given key, or Nothing if the key is not bound.EO(1) Build a queue with one element.FO(log n) Insert a new key, priority and value in the queue. If the key is already present in the queue, the associated priority and value are replaced with the supplied priority and value.GO(log n) Delete a key and its priority and value from the queue. When the key is not a member of the queue, the original queue is returned.HO(log n) Update a priority at a specific key with the result of the provided function. When the key is not a member of the queue, the original queue is returned.I O(n*log n)! Build a queue from a list of keypriorityvalue tuples. If the list contains more than one priority and value for the same key, the last priority and value for the key is retained.JO(n) Convert to a list of keypriority value tuples.KO(n) Convert to an ascending list.LO(n) Convert to a descending list.MO(1)& The element with the lowest priority.NO(log n)] Delete the element with the lowest priority. Returns an empty queue if the queue is empty.OO(log n)c Retrieve the binding with the least priority, and the rest of the queue stripped of that binding.PO(r*(log n - log r))H Return a list of elements ordered by key whose priorities are at most pt.QBalance factorRTake two pennants and returns a new pennant that is the union of the two with the precondition that the keys in the rst tree are strictly smaller than the keys in the second tree.S A version of Rc that can be used if the shape of the tree has not changed or if the tree is known to be balanced.GTUVWXYZ[\]^_`ab@AcdefBCDgEFGHIJKhLiMNOjPklmnopqQrstuvwxyz{|}~RS_b@AcfdeBCDgEFGHIJKLMNOP:TUVWXYZ[\]^_`ab@AcdefBCDgEFGHIJKhLiMNOjPklmnopqQrstuvwxyz{|}~RS5 "(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportable Trustworthystuvwxyz{}~utszxy~{}vwK"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)ffi@haskell.org provisionalportableUnsafe||  TrustworthypCopy part of the source array into the destination array. The destination array is resized if not large enough.pCopy part of the source array into the destination array. The destination array is resized if not large enough.BComputes the next-highest power of two for a particular integer, n. If n$ is already a power of two, returns n. If n@ is zero, returns zero, even though zero is not a power of two. Trustworthy!"insertWith f k v table inserts k into table with value v. If k already appears in table with value v0, the value is updated to f v0 v and Just v0 is returned..Used to undo the effect of a prior insertWith.DRemove the given key from the table and return its associated value. e"(c) The University of Glasgow 2002/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalnon-portable (requires POSIX) Trustworthy/BIE g h i j k l m n o p q r s t u v w x y z { | } ~  ) g h i j k l m n o p q r s t u v w x y z { | } ~  ) ~  | } z { x y v w t u s r q p o n i j h m l k g7 g h i j k l m n o p q r s t u v w x y z { | } ~          ((c) The University of Glasgow, 1992-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (requires POSIX) Trustworthy v      !"#$%&'()*+,-./v      !"#$%&'()*+,-./v      !"#$%&'()*+,-./UnsafeAT0Event notification backend.1hPoll backend for new events. The provided callback is called once per file descriptor with new events.2[Register, modify, or unregister interest in the given events on the given file descriptor.3iRegister interest in new events on a given file descriptor, set to be deactivated after the first event.40A type alias for timeouts, specified in seconds.5A pair of an event and lifetimeVHere we encode the event in the bottom three bits and the lifetime in the fourth bit. 0&The lifetime of an event registration. 13the registration will be active for only one event 2,the registration will trigger multiple times 3 An I/O event. 4Data is available to be read. 5/The file descriptor is ready to accept a write.6*Another thread closed the file descriptor.7The longer of two lifetimes.8Returns ) if the modification succeeded. Returns L if this backend does not support event notifications on this type of file.9Returns ) if the modification succeeded. Returns L if this backend does not support event notifications on this type of file.: Throw an IOError( corresponding to the current value of  if the result value of the  action is -1 and  is not ". If the result value is -1 and  returns 9 0 is returned. Otherwise the result value is returned.;mappend ==  elSupremum&0<=123>4?@5A 0 1 2 3BC 4 56DEF7GHIJK89L:M;NO04?@5 0 1 2 3 4 56DGHIJK89L:0<=123>4?@5A 0 1 2 3BC 4 56DEF7GHIJK89L:M;NO TrustworthyIPCreate a new epoll backend.QKChange the set of events we are interested in for a given file descriptor.RNSelect a set of file descriptors which are ready for I/O operations and call fD for all ready file descriptors, passing the events that are ready.SCreate a new epoll context, returning a file descriptor associated with the context. The fd may be used for subsequent calls to this epoll context.RThe size parameter to epoll_create is a hint about the expected number of handles.uThe file descriptor returned from epoll_create() should be destroyed via a call to close() after polling is finished+TUVWXYZ[\]^_`abcdefghPiQjRstatetimeout in milliseconds I/O callbackklmnopqSrstuvwxyzhP TUVWXYZ[\]^_`abcdefghPiQjRklmnopqSrstuvwxyz Trustworthy !"I{|{|{|"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional0non-portable (uses Text.ParserCombinators.ReadP) Trustworthy 6equivalent to  with a precedence of 0. 7Parse a string using the \> instance. Succeeds if there is exactly one valid result. A  value indicates a parse error. 8Parse a string using the \: instance. Succeeds if there is exactly one valid result. 9The  9] function reads input from a string, which must be completely consumed by the input process. 6 7 8 9)\[ 6 7 8 9\[ 6 9 7 8 6 7 8 9"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental"non-portable (extended exceptions) Trustworthy/B :)Thrown when the program attempts to call  atomically , from the stm" package, inside another call to  atomically. <Thrown when the runtime system detects that the computation is guaranteed not to terminate. Note that there is no guarantee that the runtime system will notice whether any given computation is guaranteed to terminate or not. > yAn expression that didn't typecheck during compile time was called. This is only possible with -fdefer-type-errors. The String, gives details about the failed type check. @A class method without a definition (neither a default definition, nor a definition in the appropriate instance) was called. The String- gives information about which method it was. BA record update was performed on a constructor without the appropriate field. This can only happen with a datatype with multiple constructors, where some fields are in one constructor but not another. The StringC gives information about the source location of the record update. D,An uninitialised record field was used. The StringP gives information about the source location where the record was constructed. FA record selector was applied to a constructor without the appropriate field. This can only happen with a datatype with multiple constructors, where some fields are in one constructor but not another. The StringE gives information about the source location of the record selector. HA pattern match failed. The String= gives information about the source location of the pattern. JThis is the simplest of the exception-catching functions. It takes a single argument, runs it, and if an exception is raised the "handler" is executed, with the value of the exception passed as an argument. Otherwise, the result is returned as normal. For example:  catch (readFile f) (\e -> do let err = show (e :: IOException) hPutStr stderr ("Warning: Couldn't open " ++ f ++ ": " ++ err) return "").Note that we have to give a type signature to e, or the program will not typecheck as the type is ambiguous. While it is possible to catch exceptions of any type, see the section "Catching all exceptions" (in Control.Exception3) for an explanation of the problems with doing so.%For catching exceptions in pure (non-!) expressions, see the function .Note that due to Haskell's unspecified evaluation order, an expression may throw one of several possible exceptions: consider the expression (error "urk") + (1 `div` 0). Does the expression throw ErrorCall "urk", or  DivideByZero?The answer is "it might throw either"; the choice is non-deterministic. If you are catching any type of exception then you might catch either. If you are calling catch with type .IO Int -> (ArithException -> IO Int) -> IO Int$ then the handler may get run with  DivideByZero as an argument, or an ErrorCall "urk"} exception may be propogated further up. If you call it again, you might get a the opposite behaviour. This is ok, because  J is an  computation. K The function  K is like  J., but it takes an extra argument which is an exception predicateI, a function which selects which type of exceptions we're interested in. catchJust (\e -> if isDoesNotExistErrorType (ioeGetErrorType e) then Just () else Nothing) (readFile f) (\_ -> do hPutStrLn stderr ("No such file: " ++ show f) return "")oAny other exceptions which are not matched by the predicate are re-raised, and may be caught by an enclosing  J,  K, etc. L A version of  Jr with the arguments swapped around; useful in situations where the code for the handler is shorter. For example: D do handle (\NonTermination -> exitWith (ExitFailure 1)) $ ... M A version of  K) with the arguments swapped around (see  L). NoThis function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions". O Similar to  J, but returns an  result which is ( a) if no exception of type e was raised, or ( ex) if an exception of type e was raised and its value is exs. If any other type of exception is raised than it will be propogated up to the next enclosing exception handler. 0 try a = catch (Right `liftM` a) (return . Left) P A variant of  OP that takes an exception predicate to select which exceptions are caught (c.f.  KD). If the exception does not match the predicate, it is re-thrown. QLike  SZ, but only performs the final action if there was an exception raised by the computation. RtWhen you want to acquire a resource, do some work with it, and then release the resource, it is a good idea to use  R , because  R will install the necessary exception handler to release the resource in the event that an exception is raised during the computation. If an exception is raised, then  R= will re-raise the exception (after performing the release).#A common example is opening a file: Qbracket (openFile "filename" ReadMode) (hClose) (\fileHandle -> do { ... })The arguments to  R< are in this order so that we can partially apply it, e.g.: 8withFile name mode = bracket (openFile name mode) hClose SA specialised variant of  R+ with just a computation to run afterward. T A variant of  RD where the return value from the first computation is not required. ULike  Re, but only performs the final action if there was an exception raised by the in-between computation.7 : ; < = > ? @ A B C D E F G H I JThe computation to run+Handler to invoke if an exception is raised KPredicate to select exceptionsComputation to runHandler L M N O P Q R-computation to run first ("acquire resource"),computation to run last ("release resource")computation to run in-between Scomputation to run first?computation to run afterward (even if an exception was raised) T U-computation to run first ("acquire resource"),computation to run last ("release resource")computation to run in-between V W X Y Z [ \ ] ^ _ ` a b c d e f g]  : : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W\ < = : ; @ A H I D E F G B C > ? : J K L M O P Q N R T U S   V W/ : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f gB"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportable Trustworthy hThe construct  h compV exposes IO errors which occur within a computation, and which are not fully handled.QNon-I/O exceptions are not caught by this variant; to catch all exceptions, use C from Control.Exception. i Construct an  of the given type where the second argument describes the error location and the third and fourth argument contain the file handle and file path of the file involved in the error if applicable. jAn error indicating that an ? operation failed because one of its arguments already exists. kAn error indicating that an ? operation failed because one of its arguments does not exist. lAn error indicating that an  operation failed because one of its arguments is a single-use resource, which is already being used (for example, opening the same file twice for writing might give this error). mAn error indicating that an . operation failed because the device is full. nAn error indicating that an < operation failed because the end of file has been reached. oAn error indicating that an ] operation failed because the operation was not possible. Any computation which returns an  result may fail with  o. In some cases, an implementation will not be able to distinguish between the possible error causes. In this case it should fail with  o. pAn error indicating that an s operation failed because the user does not have sufficient operating system privilege to perform that operation. q3A programmer-defined error value constructed using . rRI/O error where the operation failed because one of its arguments already exists. sRI/O error where the operation failed because one of its arguments does not exist. tyI/O error where the operation failed because one of its arguments is a single-use resource, which is already being used. u@I/O error where the operation failed because the device is full. vOI/O error where the operation failed because the end of file has been reached. w.I/O error where the operation is not possible. xI/O error where the operation failed because the user does not have sufficient operating system privilege to perform that operation. y%I/O error that is programmer-defined. zRI/O error where the operation failed because one of its arguments already exists. {RI/O error where the operation failed because one of its arguments does not exist. |yI/O error where the operation failed because one of its arguments is a single-use resource, which is already being used. }@I/O error where the operation failed because the device is full. ~OI/O error where the operation failed because the end of file has been reached. .I/O error where the operation is not possible. I/O error where the operation failed because the user does not have sufficient operating system privilege to perform that operation. %I/O error that is programmer-defined.  Catch any > that occurs in the computation and throw a modified version. IAdds a location description and maybe a file path and file handle to an W. If any of the file handle or file path is not given the corresponding value in the  remains unaltered. The  3 function establishes a handler that receives any # raised in the action protected by  . An  is caught by the most recent handler established by one of the exception handling functions. These handlers are not selective: all s are caught. Exception propagation must be explicitly provided in a handler by re-raising any unwanted exceptions. For example, in Kf = catchIOError g (\e -> if IO.isEOFError e then return [] else ioError e) the function f returns []% when an end-of-file exception (cf.  n ) occurs in gD; otherwise, the exception is propagated to the next outer handler.aWhen an exception propagates outside the main program, the Haskell system prints the associated  value and exits the program.QNon-I/O exceptions are not caught by this variant; to catch all exceptions, use C from Control.Exception.' h i j k l m n o p q r s t u v w x y z { | } ~  + h i j k l m n o p q r s t u v w x y z { | } ~  + i j k l m n o p q  r s t u v w x y z { | } ~   h ' h i j k l m n o p q r s t u v w x y z { | } ~  C"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental"non-portable (extended exceptions) TrustworthyAT You need this when using  . YSometimes you want to catch two different sorts of exception. You could do something like wf = expr `catch` \ (ex :: ArithException) -> handleArith ex `catch` \ (ex :: IOException) -> handleIO exHowever, there are a couple of problems with this approach. The first is that having two exception handlers is inefficient. However, the more serious issue is that the second exception handler will catch exceptions in the first, e.g. in the example above, if  handleArith throws an  IOException1 then the second exception handler will catch it.Instead, we provide a function  , which would be used thus: f = expr `catches` [Handler (\ (ex :: ArithException) -> handleArith ex), Handler (\ (ex :: IOException) -> handleIO ex)] When invoked inside , this function allows a masked asynchronous exception to be raised, if one exists. It is equivalent to performing an interruptible operation (see #interruptible), but does not involve any actual blocking.When called outside  , or inside , this function has no effect. } W : : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V < = : ; @ A H I D E F G B C > ? : J K L M O P N  R T U S Q  } 2"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportableUnsafe A slightly faster version of _ that may not be safe to use with multiple threads. The unsafety arises when used like this: = unsafeFixIO $ \r -> do forkIO (print r) return (...).In this case, the child thread will receive a NonTermination0 exception instead of waiting for the value of r to be computed. CDE CDE  ((c) The University of Glasgow, 2008-2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyX~Construct an iconv-based " for the given character set and .As iconv is missing in some minimal environments (e.g. #10298), this checks to ensure that iconv is working properly before returning the encoding, returning  if not.~~~P((c) The University of Glasgow, 2008-2009see libraries/base/LICENSElibraries@haskell.orginternal non-portable Trustworthy*The Unicode encoding of the current localeuThe Unicode encoding of the current locale, but allowing arbitrary undecodable bytes to be round-tripped through it.This i is used to decode and encode command line arguments and environment variables on non-Windows platforms.On Windows, this encoding *should not* be used if possible because the use of code pages is deprecated: Strings should be retrieved via the "wide" W-family of UTF-16 APIs insteadThe Unicode encoding of the current locale, but where undecodable bytes are replaced with their closest visual match. Used for the CString marshalling functions in Foreign.C.String The Latin1 (ISO8859-1) encoding. This encoding maps bytes directly to the first 256 Unicode code points, and is thus not a complete Unicode encoding. An attempt to write a character greater than '\255' to a Handle using the  " encoding will result in an error. The UTF-8 Unicode encoding yThe UTF-8 Unicode encoding, with a byte-order-mark (BOM; the byte sequence 0xEF 0xBB 0xBF). This encoding behaves like  , except that on input, the BOM sequence is ignored at the beginning of the stream, and on output, the BOM sequence is prepended.pThe byte-order-mark is strictly unnecessary in UTF-8, but is sometimes used to identify the encoding of a file. WThe UTF-16 Unicode encoding (a byte-order-mark should be used to indicate endianness). *The UTF-16 Unicode encoding (litte-endian) (The UTF-16 Unicode encoding (big-endian) WThe UTF-32 Unicode encoding (a byte-order-mark should be used to indicate endianness). *The UTF-32 Unicode encoding (litte-endian) (The UTF-32 Unicode encoding (big-endian)     An encoding in which Unicode code points are translated to bytes by taking the code point modulo 256. When decoding, bytes are translated directly into the equivalent code point.This encoding never fails in either direction. However, encoding discards information, so encode followed by decode is not the identity. 2Look up the named Unicode encoding. May fail withisDoesNotExistError if the encoding is unknownFThe set of known encodings is system-dependent, but includes at least: UTF-8UTF-16, UTF-16BE, UTF-16LEUTF-32, UTF-32BE, UTF-32LEjThere is additional notation (borrowed from GNU iconv) for specifying how illegal characters are handled: a suffix of //IGNORE, e.g.  UTF-8//IGNORE, will cause all illegal sequences on input to be ignored, and on output will drop all code points that have no representation in the target encoding. a suffix of  //TRANSLITN will choose a replacement character for illegal sequences or code points. a suffix of  //ROUNDTRIP. will use a PEP383-style escape mechanism to represent any invalid bytes in the input as Unicode codepoints (specifically, as lone surrogates, which are normally invalid in UTF-32). Upon output, these special codepoints are detected and turned back into the corresponding original byte.MIn theory, this mechanism allows arbitrary data to be roundtripped via a Q with no loss of data. In practice, there are two limitations to be aware of: \This only stands a chance of working for an encoding which is an ASCII superset, as for security reasons we refuse to escape any bytes smaller than 128. Many encodings of interest are ASCII supersets (in particular, you can assume that the locale encoding is an ASCII superset) but many (such as UTF-16) are not.gIf the underlying encoding is not itself roundtrippable, this mechanism can fail. Roundtrippable encodings are those which have an injective mapping into Unicode. Almost all encodings meet this criteria, but some do not. Notably, Shift-JIS (CP932) and Big5 contain several different encodings of the same Unicode codepoint.AOn Windows, you can access supported code pages with the prefix CP; for example, "CP1250".    & &      g Trustworthy  Computation   is the "raw" version of getArgs, similar to argv in other languages. It returns a list of the program's command line arguments, starting with the program name, and including those normally eaten by the RTS (+RTS ... -RTS).    ((c) The University of Glasgow, 1994-2001see libraries/base/LICENSElibraries@haskell.orginternal non-portable Trustworthy!"OTX Just like , but interleaves calls to  with calls to . in order to make as much progress as possiblesyncs the file with the buffer, including moving the file pointer backwards in the case of a read buffer. This can fail on a non-seekable read Handle.4flushes the Char buffer only. Works on all Handles.  makes a new  like  , except that a  is created with two independent buffers, one for reading and one for writing. Used for full-duplex streams, such as network sockets.< .the underlying IO device, which must support ,  and ba string describing the :, e.g. the file path for a file. Used in error messages.  (  <  5"(c) The University of Glasgow 2011see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyBW Returns a [String]I representing the current call stack. This can be useful for debugging.The implementation uses the call-stack simulation maintined by the profiler, so it only works if the program was compiled with -prof7 and contains suitable SCC annotations (e.g. by using  -fprof-autoI). Otherwise, the list returned is likely to be empty or uninformative. *Get the stack trace attached to an object.W W W W "(c) The University of Glasgow 2011see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyBOT Like the function F, but appends a stack trace to the error message if one is available.  &Pop the most recent call-site off the .This function, like K, has no effect on a frozen .  Return the current .$Does *not* include the call-site of  .  ;Perform some computation without adding new entries to the . $JKW $ W  J K   3"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalnon-portable (concurrency) TrustworthyB Take a value from an F, put a new value into the Fg and return the value taken. This function is atomic only if there are no other producers for this F.  D is an exception-safe wrapper for operating on the contents of an FT. This operation is exception-safe: it will replace the original contents of the F" if an exception is raised (see Control.ExceptionJ). However, it is only atomic if there are no other producers for this F. Like   , but the IOQ action in the second argument is executed with asynchronous exceptions masked. ;An exception-safe wrapper for modifying the contents of an F . Like  ,  - will replace the original contents of the F| if an exception is raised during the operation. This function is only atomic if there are no other producers for this F. A slight variation on  ' that allows a value to be returned (b+) in addition to the modified value of the F. Like   , but the IOQ action in the second argument is executed with asynchronous exceptions masked. Like   , but the IOQ action in the second argument is executed with asynchronous exceptions masked. Make a X pointer to an F8, using the second argument as a finalizer to run when F is garbage-collected FGHIJKLMNO FGHIKJ LMO N h Trustworthy     UnsafeT<The structure used to tell the IO manager thread what to do.dCreate the structure (usually a pipe) used for waking up the IO manager thread from another thread.2Close the control structure used by the IO manager thread. N.B. If this Control is the Control whose wakeup file was registered with the RTS, then *BEFORE* the wakeup file is closed, we must call c_setIOManagerWakeupFd (-1), so that the RTS does not try to use the wakeup file after it has been closed.(  Trustworthy!"9;AT The event manager state. Callback invoked on I/O events. &A file descriptor registration cookie. Create a new event manager. Create a new   with the given polling backend.8Asynchronously shuts down the event manager, if running.IAsynchronously tell the thread executing the event manager loop to exit.GStart handling events. This function loops until told to stop, using .Note%: This loop can only be run once per  >, as it closes all of its control resources when it finishes."To make a step, we first do a non-blocking poll, in case there are already events ready to handle. This improves performance because we can make an unsafe foreign C call, thereby avoiding forcing the current Task to release the Capability and forcing a context switch. If the poll fails to find events, we yield, putting the poll loop thread at end of the Haskell run queue. When it comes back around, we do one more non-blocking poll, in case we get lucky and have ready events. If that also returns no events, then we do a blocking poll.VRegister interest in the given events, without waking the event manager thread. The sE return value indicates whether the event manager ought to be woken.QNote that the event manager is generally implemented in terms of the platform's select or epoll system call, which tend to vary in what sort of fds are permitted. For instance, waiting on regular files is not allowed on many platforms. registerFd mgr cb fd evs lt" registers interest in the events evs on the file descriptor fd for lifetime lt. cbQ is called for each event that occurs. Returns a cookie that can be handed to  .Wake up the event manager. Drop a previous file descriptor registration, without waking the event manager thread. The return value indicates whether the event manager ought to be woken. -Drop a previous file descriptor registration. +Close a file descriptor in a race-safe way.Close a file descriptor in a race-safe way. It assumes the caller will update the callback tables and that the caller holds the callback table lock for the fd. It must hold this lock because this command executes a backend command on the fd.>Call the callbacks corresponding to the given file descriptor.3           0 1 2 3 4 5                 TrustworthyI !"#$%&'()*+,  !"#$%&'()*+, Trustworthy9;AT The event manager state.-An edit to apply to a ...5A priority search queue, with timeouts as priorities. #Callback invoked on timeout events. A timeout registration cookie./Create a new event manager.08Asynchronously shuts down the event manager, if running.1GStart handling events. This function loops until told to stop, using 0.Note%: This loop can only be run once per  >, as it closes all of its control resources when it finishes.2Wake up the event manager. GRegister a timeout in the given number of microseconds. The returned   can be used to later unregister or update the timeout. The timeout is automatically unregistered after the given time has passed. Unregister an active timeout. FUpdate an active timeout to fire in the given number of microseconds. 345678-.9:;<= >?@/A0BC1D2 E 8 @/A0BC1D2  345678-.9:;<= >?@/A0BC1D2 E Trustworthy FKSuspends 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.GSet the value of returned TVar to True after a given number of microseconds. The caveats associated with threadDelay also apply.HYBlock the current thread until data is available to read from the given file descriptor.This will throw an IOError if the file descriptor was closed while this thread was blocked. To safely close a file descriptor that has been used with H, use I.JSBlock the current thread until the given file descriptor can accept data to write.This will throw an IOError if the file descriptor was closed while this thread was blocked. To safely close a file descriptor that has been used with J, use I.I2Close a file descriptor in a concurrency-safe way.9Any threads that are blocked on the file descriptor via H or J3 will be unblocked by having IO exceptions thrown.KAllows a thread to use an STM action to wait for a file descriptor to be readable. The STM action will retry until the file descriptor has data ready. The second element of the return value pair is an IO action that can be used to deregister interest in the file descriptor.The STM action will throw an IOError if the file descriptor was closed while the STM action is being executed. To safely close a file descriptor that has been used with K, use I.L4Allows a thread to use an STM action to wait until a file descriptor can accept a write. The STM action will retry while the file until the given file descriptor can accept a write. The second element of the return value pair is an IO action that can be used to deregister interest in the file descriptor.The STM action will throw an IOError if the file descriptor was closed while the STM action is being executed. To safely close a file descriptor that has been used with L, use I. ]Retrieve the system event manager for the capability on which the calling thread is running.This function always returns E the current thread's event manager when using the threaded RTS and  otherwise.MThe ioManagerLock protects the NH value: Only one thread at a time can start or shutdown event managers. OPQRSTUFGHJIAction that performs the close.File descriptor to close.VWXKL YNZM [\]^_`abc FGHJIWKL ]c OPQRSTUFGHJIVWXKL YNZM [\]^_`abc((c) The University of Glasgow, 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions) TrustworthyB bBlock the current thread until data is available to read on the given file descriptor (GHC only).This will throw an IOError if the file descriptor was closed while this thread was blocked. To safely close a file descriptor that has been used with  , use  . \Block the current thread until data can be written to the given file descriptor (GHC only).This will throw an IOError if the file descriptor was closed while this thread was blocked. To safely close a file descriptor that has been used with  , use  . Returns an STM action that can be used to wait for data to read from a file descriptor. The second returned value is an IO action that can be used to deregister interest in the file descriptor. Returns an STM action that can be used to wait until data can be written to a file descriptor. The second returned value is an IO action that can be used to deregister interest in the file descriptor. QClose a file descriptor in a concurrency-safe way (GHC only). If you are using   or   to perform blocking I/O, you mustS use this function to close file descriptors, or blocked threads may not be woken.9Any threads that are blocked on the file descriptor via   or  3 will be unblocked by having IO exceptions thrown. KSuspends 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. Set the value of returned TVar to True after a given number of microseconds. The caveats associated with threadDelay also apply. d .Low-level action that performs the real close.File descriptor to close.  d a((c) The University of Glasgow, 1994-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions)UnsafeJ        ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q T U V W J ) * / 0 1 2 3 4 5 6 7 8 ; 9 : ? > @ < = C    ! " # $ % & ' ( A B + , - .   E F G H I J K   L M O N P D Q V W U T((c) The University of Glasgow, 1994-2008see libraries/base/LICENSElibraries@haskell.orginternal non-portable TrustworthyeOpen a file and make an f4 for it. Truncates the file to zero size when the T is V.gMake a fi from an existing file descriptor. Fails if the FD refers to a directory. If the FD refers to a file, gy locks the file according to the Haskell 2010 single writer/multiple reader locking semantics (this is why we need the T argument too).9fhijklmnopqrse file to openmode in which to open the file#open the file in non-blocking mode?tuvwxyzgis a socket (on Windows)is in non-blocking mode on Unix{|}~fhijeg}~6fhijklmnopqrsetuvwxyzg{|}~((c) The University of Glasgow, 1992-2008see libraries/base/LICENSElibraries@haskell.orginternal non-portable Trustworthy!"BX  Computation   hdl t+ waits until input is available on handle hdl. It returns " as soon as input is available on hdl, or ! if no input is available within t milliseconds. Note that   waits until one or more full  characterse are available, which means that it needs to do decoding, and hence may fail with a decoding error.If t is less than zero, then  hWaitForInput waits indefinitely.This operation may fail with: n% if the end of file has been reached.ba decoding error, if the input begins with an invalid byte sequence in this Handle's encoding.'NOTE for GHC users: unless you use the  -threaded flag, hWaitForInput hdl t where t >= 0Y will block all other Haskell threads for the duration of the call. It behaves like a safe foreign call in this respect.  Computation   hdl8 reads a character from the file or channel managed by hdl*, blocking until a character is available.This operation may fail with: n% if the end of file has been reached.  Computation   hdl3 reads a line from the file or channel managed by hdl.This operation may fail with: n8 if the end of file is encountered when reading the first character of the line.If   encounters end-of-file at any other point while reading in a line, it is treated as a line terminator and the (partial) line is returned.  Computation   hdlh returns the list of characters corresponding to the unread portion of the channel or file managed by hdl+, which is put into an intermediate state,  semi-closed. In this state, hdl1 is effectively closed, but items are read from hdl: on demand and accumulated in a special list returned by   hdl.tAny operation that fails because a handle is closed, also fails if a handle is semi-closed. The only exception is hClose'. A semi-closed handle becomes closed:if hClose is applied to it;<if an I/O error occurs when reading an item from the handle;8or once the entire contents of the handle has been read. Once a semi-closed handle becomes closed, the contents of the associated list becomes fixed. The contents of this final list is only partially specified: it will contain at least all the items of the stream that were evaluated prior to the handle becoming closed.OAny I/O errors encountered while a handle is semi-closed are simply discarded.This operation may fail with: n% if the end of file has been reached.  Computation   hdl ch writes the character ch$ to the file or channel managed by hdl;. Characters may be buffered if buffering is enabled for hdl.This operation may fail with: m if the device is full; or p4 if another system resource limit would be exceeded.  Computation   hdl s writes the string s# to the file or channel managed by hdl.This operation may fail with: m if the device is full; or p4 if another system resource limit would be exceeded.  The same as  , but adds a newline character.    hdl buf count writes count 8-bit bytes from the buffer buf to the handle hdl. It returns (). / ignores any text encoding that applies to the ?, writing the bytes directly to the underlying file or device.  ignores the prevailing  TextEncoding and  on the , and writes bytes directly.This operation may fail with: if the handle is a pipe or socket, and the reading end is closed. (If this is a POSIX system, and the program has not asked to ignore SIGPIPE, then a SIGPIPE may be delivered instead, whose default action is to terminate the program).    hdl buf count reads data from the handle hdl into the buffer buf! until either EOF is reached or count 8-bit bytes have been read. It returns the number of bytes actually read. This may be zero if EOF was reached before any data was read (or if count is zero). I never raises an EOF exception, instead it returns a value smaller than count.CIf the handle is a pipe or socket, and the writing end is closed,  # will behave as if EOF was reached.  ignores the prevailing  TextEncoding and  on the , and reads bytes directly.    hdl buf count reads data from the handle hdl into the buffer buf1. If there is any data available to read, then  H returns it immediately; it only blocks if there is no data to be read.tIt returns the number of bytes actually read. This may be zero if EOF was reached before any data was read (or if count is zero). I never raises an EOF exception, instead it returns a value smaller than count.CIf the handle is a pipe or socket, and the writing end is closed,  # will behave as if EOF was reached.  ignores the prevailing  TextEncoding and  on the , and reads bytes directly.    hdl buf count reads data from the handle hdl into the buffer buf" until either EOF is reached, or countU 8-bit bytes have been read, or there is no more data available to read immediately.  is identical to  , except that it will never block waiting for data to become available, instead it returns only whatever data is available. To wait for data to arrive before calling  , use  .CIf the handle is a pipe or socket, and the writing end is closed,  # will behave as if EOF was reached.  ignores the prevailing  TextEncoding and  on the , and reads bytes directly.TNOTE: on Windows, this function does not work correctly; it behaves identically to  .(          (        Q((c) The University of Glasgow, 1994-2009see libraries/base/LICENSElibraries@haskell.org provisional non-portable Trustworthy!"X  The action   hdl1 causes any items buffered for output in handle hdl0 to be sent immediately to the operating system.This operation may fail with: isFullError if the device is full;isPermissionError if a system resource limit would be exceeded. It is unspecified whether the characters in the buffer are discarded or retained under these circumstances.  Computation   hdl makes handle hdl/ closed. Before the computation finishes, if hdl+ is writable its buffer is flushed as for  . Performing   on a handle that has already been closed has no effect; doing so is not an error. All other operations on a closed handle will fail. If  ; fails for any reason, any further operations (apart from  &) on the handle will still fail as if hdl had been successfully closed.  For a handle hdl% which attached to a physical file,   hdl. returns the size of that file in 8-bit bytes.   hdl size) truncates the physical file with handle hdl to size bytes. For a readable handle hdl,   hdl returns ' if no further input can be taken from hdlr or for a physical file, if the current I/O position is equal to the length of the file. Otherwise, it returns .NOTE:  v may block, because it has to attempt to read from the stream to determine whether there is any more data to be read.  Computation   returns the next character from the handle without removing it from the input buffer, blocking until a character is available.This operation may fail with: isEOFError% if the end of file has been reached.  Computation   hdl mode( sets the mode of buffering for handle hdl on subsequent reads and writes.#If the buffer mode is changed from  or  to , thenif hdl+ is writable, the buffer is flushed as for  ;if hdl: is not writable, the contents of the buffer is discarded.This operation may fail with:isPermissionError if the handle has already been used for reading or writing and the implementation does not allow the buffering mode to be changed.  The action   hdl encoding+ changes the text encoding for the handle hdl to encoding. The default encoding when a  is created is localeEncoding6, namely the default encoding for the current locale. To create a  with no encoding at all, use openBinaryFile8. To stop further encoding or decoding on an existing , use  . B may need to flush buffered data in order to change the encoding. Return the current  for the specified , or  if the  is in binary mode.Note that the J remembers nothing about the state of the encoder/decoder in use on this >. For example, if the encoding in use is UTF-16, then using   and  d to save and restore the encoding may result in an extra byte-order-mark being written to the file.  The action   hdl flushes all buffered data in hdl, including any buffered read data. Buffered read data is flushed by seeking the file position back to the point before the bufferred data was read, and hence only works if hdl is seekable (see  ).This operation may fail with: isFullError if the device is full;isPermissionError if a system resource limit would be exceeded. It is unspecified whether the characters in the buffer are discarded or retained under these circumstances;isIllegalOperation if hdl1 has buffered read data, and is not seekable.  Computation   hdl& returns the current I/O position of hdl! as a value of the abstract type  .  If a call to   hdl returns a position p, then computation   p sets the position of hdl5 to the position it held at the time of the call to  .This operation may fail with:isPermissionError. if a system resource limit would be exceeded.  Computation    hdl mode i sets the position of handle hdl depending on mode. The offset i" is given in terms of 8-bit bytes.If hdl is block- or line-buffered, then seeking to a position which is not in the current buffer will first cause any items in the output buffer to be written to the device, and then cause the input buffer to be discarded. Some handles may not be seekable (see  H), or only support a subset of the possible positioning operations (for instance, it may only be possible to seek to the end of a tape, or to a positive offset from the beginning or current position). It is not possible to set a negative I/O position, or for a physical file, an I/O position beyond the current end-of-file.This operation may fail with:isIllegalOperationErrorQ if the Handle is not seekable, or does not support the requested seek mode.isPermissionError. if a system resource limit would be exceeded.  Computation   hdl- returns the current position of the handle hdlm, as the number of bytes from the beginning of the file. The value returned may be subsequently passed to  2 to reposition the handle to the current position.This operation may fail with:isIllegalOperationError if the Handle is not seekable.  Computation   hdl) returns the current buffering mode for hdl. ;Set the echoing status of a handle connected to a terminal. ;Get the echoing status of a handle connected to a terminal. &Is the handle connected to a terminal? Select binary mode () or text mode () on a open handle. (See also openBinaryFile.)$This has the same effect as calling   with  , together with   with . Set the  on the specified '. All buffered data is flushed first. Returns a duplicate of the original handle, with its own buffer. The two Handles will share a file pointer, however. The original handle's buffer is flushed, including discarding any input data, before the handle is duplicated. wMakes the second handle a duplicate of the first handle. The second handle will be closed first, if it is not already.?This can be used to retarget the standard Handles, for example: >do h <- openFile "mystdout" WriteMode hDuplicateTo h stdout   is in the I monad, and gives more comprehensive output than the (pure) instance of ` for .)              @          @            (               `((c) The University of Glasgow, 1994-2008see libraries/base/LICENSElibraries@haskell.orginternal non-portable Trustworthy JA handle managing output to the Haskell program's standard output channel. JA handle managing input from the Haskell program's standard input channel. IA handle managing output to the Haskell program's standard error channel. The computation   is identical to   , except that it works only on  .  Computation    file mode> allocates and returns a new, open handle to manage the file file. It manages input if mode is U , output if mode is V or W(, and both input and output if mode is X.aIf the file does not exist and it is opened for output, it should be created as a new file. If mode is V and the file already exists, then it should be truncated to zero length. Some operating systems delete empty files, so there is no guarantee that the file will exist following an   with mode Vh unless it is subsequently written to successfully. The handle is positioned at the end of the file if mode is W, and otherwise at the beginning (in which case its internal position is 0). The initial buffer mode is implementation-dependent.This operation may fail with:isAlreadyInUseError4 if the file is already open and cannot be reopened;isDoesNotExistError if the file does not exist; orisPermissionError7 if the user does not have permission to open the file.YNote: if you will be working with files containing binary data, you'll want to be using  . Like  , but opens the file in ordinary blocking mode. This can be useful for opening a FIFO for writing: if we open in non-blocking mode then the open will fail if there are no readers, whereas a blocking open will block until a reader appear. Like  , but open the file in binary mode. On Windows, reading a file in text mode (which is the default) will translate CRLF to LF, and writing will translate LF to CRLF. This is usually what you want with text files. With binary files this is undesirable; also, as usual under Microsoft operating systems, text mode treats control-Z as EOF. Binary mode turns off all special treatment of end-of-line and end-of-file characters. (See also  .) &Old API kept to avoid breaking clients mTurn an existing file descriptor into a Handle. This is used by various external libraries to make Handles.Makes a binary Handle. This is for historical reasons; it should probably be a text Handle with the default encoding and newline translation instead.                                         ((c) The University of Glasgow, 2001-2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions) TrustworthyB is wrapped around !" (or whatever main is called in the program). It catches otherwise uncaught exceptions, and also flushes stdout/stderr before exiting. is wrapped around every foreign export and foreign import "wrapper"B to mop up any uncaught exceptions. Thus, the result of running R#_ in a foreign-exported function is the same as in the main thread: it terminates the program.Like (, but in the event of an exception that causes an exit, we don't shut down the system cleanly, we just exit. This is useful in some cases, because the safe exit version will give other threads a chance to clean up first, which might shut down the system in a different way. For example, tryEmain = forkIO (runIO (exitWith (ExitFailure 1))) >> threadDelay 10000This will sometimes exit with "interrupted" and code 0, because the main thread is given a chance to shut down when the child thread calls safeExit. There is a race to shut down between the main and child threads. The same as 3, but for non-IO computations. Used for wrapping foreign export and foreign import "wrapper"D when these are used to export Haskell functions with non-IO types.  T U"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable Trustworthy The  function outputs a value of any printable type to the standard output device. Printable types are those that are instances of class `; 2 converts values to strings for output using the  operation and adds a newline.aFor example, a program to print the first 20 integers and their powers of 2 could be written as: (main = print ([(n, 2^n) | n <- [0..19]]) :Write a character to the standard output device (same as    ). 7Write a string to the standard output device (same as    ).  The same as  , but adds a newline character. :Read a character from the standard input device (same as    ). 5Read a line from the standard input device (same as    ). The  f operation returns all user input as a single string, which is read lazily as it is needed (same as    ). The  # function takes a function of type String->String as its argument. The entire input from the standard input device is passed to this function as its argument, and the resulting string is output on the standard output device. The  w function reads a file and returns the contents of the file as a string. The file is read lazily, on demand, as with  . The computation   file str function writes the string str, to the file file. !The computation  ! file str function appends the string str, to the file file. Note that   and  !U write a literal string to a file. To write a value of any printable type, as with  , use the 1 function to convert the value to a string first. >main = appendFile "squares" (show [(x,x*x) | x <- [0,0.1..2]]) "The  " function combines   and  #. #The  # function is similar to  9. except that it signals parse failure to the * monad instead of terminating the program. $*The Unicode encoding of the current localeMThis is the initial locale encoding: if it has been subsequently changed by  ) this value will not reflect that change. % Computation  % hdlI indicates whether at least one item is available for input from handle hdl.This operation may fail with:B$% if the end of file has been reached. & Computation  & hdl t% writes the string representation of t given by the , function to the file or channel managed by hdl and appends a newline.This operation may fail with:B% if the device is full; orB&4 if another system resource limit would be exceeded. ' ' name mode act opens a file using  5 and passes the resulting handle to the computation act+. The handle will be closed on exit from  ', whether by normal termination or by raising an exception. If closing the handle raises an exception, then this exception will be raised by  '& rather than any exception raised by act. ( ( name mode act opens a file using  5 and passes the resulting handle to the computation act+. The handle will be closed on exit from  (<, whether by normal termination or by raising an exception. *The function creates a temporary file in ReadWrite mode. The created file isn't deleted automatically, so you need to delete it manually.XThe file is creates with permissions such that only the current user can read/write it.<With some exceptions (see below), the file will be created securely in the sense that an attacker should not be able to cause openTempFile to overwrite another file on the filesystem using your credentials, by putting symbolic links (on Unix) in the place where the temporary file is to be created. On Unix the O_CREAT and O_EXCL7 flags are used to prevent this attack, but note that O_EXCL{ is sometimes not supported on NFS filesystems, so if you rely on this behaviour it is best to use local filesystems only. +Like  *), but opens the file in binary mode. See   for more comments. ,Like  *', but uses the default file permissions -Like  +', but uses the default file permissions#         ! " # $ % & ' ( ) *%Directory in which to create the file~File name template. If the template is "foo.ext" then the created file will be "fooXXX.ext" where XXX is some random number. + , -jTUVWX                        ! " # $ % & ' ( ) * + , -j )    ' TUVWX  !           % &        # " (   * + , -  $           ! " # $ % & ' ( ) * + , -a(c) Andy Gill 2001, (c) Oregon Graduate Institute of Science and Technology, 2002/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable TrustworthyQR.+The fixed point of a monadic computation. . f executes the action fD only once, with the eventual output fed back as the input. Hence f! should not be strict, for then . f would diverge.cHMonads having fixed points with a 'knot-tying' semantics. Instances of c# should satisfy the following laws: purity. (return . h) = return ( h)left shrinking (or  tightening).+ (\x -> a >>= \y -> f x y) = a >>= \y -> . (\x -> f x y)sliding. ( ' h . f) =  ' h (. (f . h)), for strict h.nesting. (\x -> . (\y -> f x y)) = . (\x -> f x x)7This class is used in the translation of the recursive do% notation supported by GHC and Hugs..c . / 0 1 2 3 4 5 6 7 8 9 : ; < =c.c.c. . / 0 1 2 3 4 5 6 7 8 9 : ; < =@ Trustworthy @dComputes the hash of a given file. This function loops over the handle, running in constant memory.  > ? @ > ? @ > ? @  > ? @f Trustworthy 0 1 2 3 4 5  3 4 5 0 1 2 i(c) Ashley Yakeley 20074BSD-style (see the LICENSE file in the distribution)ashley@semantic.org experimentalportable Trustworthy%&+D A9A class for categories. id and (.) must form a monoid. Bthe identity morphism Cmorphism composition DRight-to-left composition ELeft-to-right composition A B C D E F G H A C B D E A B C H G F D E A B C D E F G H C9  D1 E1(c) Ross Paterson 20024BSD-style (see the LICENSE file in the distribution)libraries@haskell.org provisionalportable Trustworthy0Lift a function to an arrow.1oSend the first component of the input through the argument arrow, and copy the rest unchanged to the output.3RFanin: Split the input between the two argument arrows and merge their outputs.UThe default definition may be overridden with a more efficient version if desired. IThe 4 operator expresses computations in which an output value is fed back as input, although the computation occurs only once. It underlies the rec/ value recursion construct in arrow notation. 4# should satisfy the following laws:  extension4 (0 f) = 0 (\ b ->  ( (\ (c,d) -> f (b,d))))left tightening4 (1 h >>> f) = h >>> 4 fright tightening4 (f >>> 1 h) = 4 f >>> hsliding4 (f >>> 0 ( B *** k)) = 4 (0 ( B *** k) >>> f) vanishing4 (4 f) = 4 (0 unassoc >>> f >>> 0 assoc) superposing Y (4 f) = 4 (0 assoc >>>  Y f >>> 0 unassoc)where 9assoc ((a,b),c) = (a,(b,c)) unassoc (a,(b,c)) = ((a,b),c) JThe  L class is equivalent to W: any monad gives rise to a  U arrow, and any instance of  L defines a monad. LlSome arrows allow application of arrow inputs to other inputs. Instances should satisfy the following laws: 1 (0 (\x -> 0 (\y -> (x,y)))) >>> 2 =  B 1 (0 (g >>>)) >>> 2 =  Y g >>> 2 1 (0 (>>> h)) >>> 2 = 2 >>> h*Such arrows are equivalent to monads (see  J). M?Choice, for arrows that support it. This class underlies the if and case constructs in arrow notation.,Instances should satisfy the following laws:  N (0 f) = 0 ( N f)  N (f >>> g) =  N f >>>  N g f >>> 0  = 0  >>>  N f  N f >>> 0 ( B +++ g) = 0 ( B +++ g) >>>  N f  N ( N f) >>> 0 assocsum = 0 assocsum >>>  N fwhere qassocsum (Left (Left x)) = Left x assocsum (Left (Right y)) = Right (Left y) assocsum (Right z) = Right (Right z)aThe other combinators have sensible default definitions, which may be overridden for efficiency. NcFeed marked inputs through the argument arrow, passing the rest through unchanged to the output. OA mirror image of  N.UThe default definition may be overridden with a more efficient version if desired. PSplit the input between the two argument arrows, retagging and merging their outputs. Note that this is in general not a functor.UThe default definition may be overridden with a more efficient version if desired. QA monoid on arrows. R'An associative operation with identity  T. UKleisli arrows of a monad. XThe basic arrow class.,Instances should satisfy the following laws: 0 id =  B 0 (f >>> g) = 0 f >>> 0 g 1 (0 f) = 0 (1 f) 1 (f >>> g) = 1 f >>> 1 g 1 f >>> 0  = 0  >>> f 1 f >>> 0 ( B *** g) = 0 ( B *** g) >>> 1 f 1 (1 f) >>> 0 assoc = 0 assoc >>> 1 fwhere assoc ((a,b),c) = (a,(b,c))aThe other combinators have sensible default definitions, which may be overridden for efficiency. YA mirror image of 1.UThe default definition may be overridden with a more efficient version if desired. ZySplit the input between the two argument arrows and combine their output. Note that this is in general not a functor.UThe default definition may be overridden with a more efficient version if desired. [KFanout: send the input to both argument arrows and combine their output.UThe default definition may be overridden with a more efficient version if desired. \,The identity arrow, which plays the role of - in arrow notation. ]$Precomposition with a pure function. ^%Postcomposition with a pure function. _<Precomposition with a pure function (right-to-left variant). `=Postcomposition with a pure function (right-to-left variant). aAny instance of  L$ can be made into an instance of  M by defining  N =  a. b1Beware that for many monads (those for which the ** operation is strict) this instance will not3 satisfy the right-tightening law required by the  I class..01234 I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q D E I4 J K L2 M3 P N O Q R S T U V W X01 Z [ Y \ ] ^ _ ` a X01 Y Z [ U V W \ ] ^ E D _ ` S T Q R M N O P3 L2 J K a I4 I4 J K L2 M N O P3 Q R S T U V W X01 Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q 32 P2 R5 Z3 [3 ]1 ^1 _1 `1$Conor McBride and Ross Paterson 20054BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimentalportable Trustworthy5I rLists, but with an f" functor based on zipping, so that f   r xs1 N ... N  r xsn =  r (zipWithn f xs1 ... xsn) { One or none. r s t u v w x y z { | } ~  )fONP(#'$%&*+,- r s t u v w x y z {fONP(#$%&' x y z u v w r s t)*+,- { r s t u v w x y z { | } ~  !$Conor McBride and Ross Paterson 20054BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimentalportable Trustworthy/2349;QR hPFunctors representing data structures that can be traversed from left to right.A definition of  ! must satisfy the following laws:  naturalityt .   f =   (t . f)) for every applicative transformation tidentity  Identity = Identity composition  (Compose . , g . f) = Compose . , (  g) .   fA definition of  ! must satisfy the following laws:  naturalityt .   =   . , t) for every applicative transformation tidentity  . , Identity = Identity composition  . , Compose = Compose . ,   .   where an applicative transformation is a function 1t :: (Applicative f, Applicative g) => f a -> g apreserving the f operations, i.e. t (O x) = O x t (x N y) = t x N t yand the identity functor Identity and composition of functors Compose are defined as * newtype Identity a = Identity a instance Functor Identity where fmap f (Identity x) = Identity (f x) instance Applicative Identity where pure x = Identity x Identity f <*> Identity x = Identity (f x) newtype Compose f g a = Compose (f (g a)) instance (Functor f, Functor g) => Functor (Compose f g) where fmap f (Compose x) = Compose (fmap (fmap f) x) instance (Applicative f, Applicative g) => Applicative (Compose f g) where pure x = Compose (pure (pure x)) Compose f <*> Compose x = Compose ((<*>) <$> f <*> x)1(The naturality law is implied by parametricity.)Instances are similar to Y, e.g. given a data type 7data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)a suitable instance would be instance Traversable Tree where traverse f Empty = pure Empty traverse f (Leaf x) = Leaf <$> f x traverse f (Node l k r) = Node <$> traverse f l <*> f k <*> traverse f r:This is suitable even for abstract types, as the laws for N imply a form of associativity.6The superclass instances should satisfy the following:In the Y instance, ,N should be equivalent to traversal with the identity applicative functor ( ).In the g instance,  (P should be equivalent to traversal with a constant applicative functor ( ). Map each element of a structure to an action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see  ). Evaluate each action in the structure from left to right, and and collect the results. For a version that ignores the results see  *. Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see  +. Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see  ,.   is  I with its arguments flipped. For a version that ignores the results see  -.   is  I with its arguments flipped. For a version that ignores the results see  .. The  ( function behaves like a combination of , and foldl; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure. The  ( function behaves like a combination of , and foldr; it applies a function to each element of a structure, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new structure. )This function may be used as a value for , in a Y instance, provided that   is defined. (Using   with a h instance defined only by  $ will result in infinite recursion.) )This function may be used as a value for  ( in a g instance.(h h h h  "(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportable Trustworthy:: b is O () if b is , and $ if b is .  This generalizes the list-based filter function. ,Left-to-right Kleisli composition of monads. -Right-to-left Kleisli composition of monads. ( ), with the arguments flipped.6Note how this operator resembles function composition (9): q(.) :: (b -> c) -> (a -> b) -> a -> c (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c   act repeats the action infinitely. The   function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state-transforming monad. The   function generalizes # to arbitrary applicative functors.   is the extension of   which ignores the final result. The   function is analogous to foldl?, except that its result is encapsulated in a monad. Note that  P works from left-to-right over the list arguments. This could be an issue where (+)/ and the `folded function' are not commutative. " foldM f a1 [x1, x2, ..., xm]== P do a2 <- f a1 x1 a3 <- f a2 x2 ... f am xmKIf right-to-left evaluation is required, the input list should be reversed.Note:   is the same as u Like  , but discards the result.   n act performs the action n times, gathering the results. Like  , but discards the result. The reverse of /. Strict version of . Direct   equivalent of filter filter = $(mfilter:: (a -> Bool) -> [a] -> [a] applicable to any  , for example mfilter odd (Just 1) == Just 1 mfilter odd (Just 2) == Nothing: *:MW*+-)Y,  !"./012345xy{} *Y,W*+-) !" x y {. M} :/ 012345 :  1 1 4j Trustworthy!" EStatistics about memory usage and the garbage collector. Apart from   and  6 all are cumulative values since the program started. Total number of bytes allocated JNumber of garbage collections performed (any generation, major and minor) (Maximum number of live bytes seen so far WNumber of byte usage samples taken, or equivalently the number of major GCs performed. 1Sum of all byte usage samples, can be used with  c to calculate averages with arbitrary weighting (if you are sampling this record multiple times).  Number of bytes copied during GC 4Number of live bytes at the end of the last major GC $Current number of bytes lost to slop ;Maximum number of bytes lost to slop at any one time so far %Maximum number of megabytes allocated iCPU time spent running mutator threads. This does not include any profiling overhead or initialization. VWall clock time spent running mutator threads. This does not include initialization. CPU time spent running GC  Wall clock time spent running GC *Total CPU time elapsed since program start )Total wall clock time elapsed since start rNumber of bytes copied during GC, minus space held by mutable lists held by the capabilities. Can be used with  7 to determine how well parallel GC utilized all cores. [Sum of number of bytes copied each GC by the most active GC thread each GC. The ratio of   divided by  i approaches 1 for a maximally sequential run and approaches the number of threads (set by the RTS flag -N) for a maximally parallel run. 1Returns whether GC stats have been enabled (with +RTS -T, for example). Retrieves garbage collection and memory statistics as of the last garbage collection. If you would like your statistics as recent as possible, first run a c/.       k"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable Trustworthy The  & function takes two lists and returns y if all the elements of the first list occur, in order, in the second. The elements do not have to occur consecutively.  x y is equivalent to o x ( y).Examples5isSubsequenceOf "GHC" "The Glorious Haskell Compiler"True)isSubsequenceOf ['a','d'..'z'] ['a'..'z']True!isSubsequenceOf [1..10] [10,9..0]False toqpsrjfkihnmhijklruvwyz}~     ~ thkjlimnhikrfj~rspquwvyz }~  o     "(c) The University of Glasgow 2007/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthy9;DRenClass for string-like datastructures; used by the overloaded string extension (-XOverloadedStrings in GHC).5e e5 e5 e5 l"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportableUnsafeB The  s function outputs the trace message from the IO monad. This sequences the output with respect to other IO actions. The  t function outputs the trace message given as its first argument, before returning the second argument as its result.'For example, this returns the value of f x but first outputs the message. -trace ("calling f with x = " ++ show x) (f x)The   function should only be used for debugging, or for monitoring execution. The function is not referentially transparent: its type indicates that it is a pure function but it has the side effect of outputting the trace message. Like  2 but returns the message instead of a third value. Like   , but uses $ on the argument to convert it to a .This makes it convenient for printing the values of interesting variables or expressions inside a function. For example here we print the value of the variables x and z: Af x y = traceShow (x, z) $ result where z = ... ... Like  6 but returns the shown value instead of a third value. Like  $ but returning unit in an arbitrary f3 context. Allows for convenient use in do-notation.Note that the application of   is not an action in the f context, as   is in the H type. While the fresh bindings in the following example will force the  * expressions to be reduced every time the do-block is executed, traceM "not crashed"^ would only be reduced once, and the message would only be printed once. If your monad is in MonadIO, liftIO . traceIO may be a better option. T... = do x <- ... traceM $ "x: " ++ show x y <- ... traceM $ "y: " ++ show y Like   , but uses $ on the argument to convert it to a . D... = do x <- ... traceShowM $ x y <- ... traceShowM $ x + y like  <, but additionally prints a call stack if one is available.fIn the current GHC implementation, the call stack is only available if the program was compiled with -prof ; otherwise   behaves exactly like  ,. Entries in the call stack correspond to SCC+ annotations, so it is a good idea to use  -fprof-auto or -fprof-auto-calls& to add SCC annotations automatically. The   function behaves like  ~ with the difference that the message is emitted to the eventlog, if eventlog profiling is available and enabled at runtime.:It is suitable for use in pure code. In an IO context use   instead.Note that when using GHC's SMP runtime, it is possible (but rare) to get duplicate events emitted if two CPUs simultaneously evaluate the same thunk that uses  . The  f function emits a message to the eventlog, if eventlog profiling is available and enabled at runtime. Compared to  ,  7 sequences the event with respect to other IO actions. The  j function emits a marker to the eventlog, if eventlog profiling is available and enabled at runtime. The Stringx is the name of the marker. The name is just used in the profiling tools to help you keep clear which marker is which.FThis function is suitable for use in pure code. In an IO context use   instead.Note that when using GHC's SMP runtime, it is possible (but rare) to get duplicate events emitted if two CPUs simultaneously evaluate the same thunk that uses  . The  e function emits a marker to the eventlog, if eventlog profiling is available and enabled at runtime. Compared to  ,  7 sequences the event with respect to other IO actions.  "(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable Trustworthy67QR"#$%S& T>?@ABCDEFGHIJKLMNOU!V8W*+-)Y,)ZP Q(RS[  '\]9^0123456789:<;=_`fONP(gnmoefhjkpqsrh rGHIstuvw|}~ .789:;<=T\]_hjkluvyz}~[ 7x{~ 6 9         ! " #s }_7~t\]S& [  'R"#$%Qw|vuZP Q(RS]9V8U!T>?@ABCDEFGHIJKLMNO_^0123456789:;<=T67rGHIY,)fONP(W*+-)x{.gefhjkmnopqrsh 789:<=;hkjlmn~uvyz}~ `[\ 6 9         ! # "m"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalnon-portable (concurrency) Trustworthy/  < is an abstract type representing an unbounded FIFO channel. $Build and returns a new instance of  . Write a value to a  . Read the next value from the  .  Duplicate a  : the duplicate channel begins empty, but data written to either channel from then on will be available from both. Hence this creates a kind of broadcast channel, where data written by anyone is seen by everyone else.C(Note that a duplicated channel is not equal to its original. So: fmap (c /=) $ dupChan c returns True for all c.) IPut a data item back onto a channel, where it will be the next item read. Returns  if the supplied   is empty. >Return a lazy list representing the contents of the supplied   , much like . #Write an entire list of items to a  .     n"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalnon-portable (concurrency)Safe   is a quantity semaphore in which the resource is aqcuired and released in units of one. It provides guaranteed FIFO ordering for satisfying blocked   calls. The pattern $ bracket_ waitQSem signalQSem (...)/is safe; it never loses a unit of the resource.  Build a new  M with a supplied initial quantity. The initial quantity must be at least 0. #Wait for a unit to become available Signal that a unit of the   is available      o"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalnon-portable (concurrency)Safe   is a quantity semaphore in which the resource is aqcuired and released in units of one. It provides guaranteed FIFO ordering for satisfying blocked   calls. The pattern . bracket_ (waitQSemN n) (signalQSemN n) (...),is safe; it never loses any of the resource.  Build a new  M with a supplied initial quantity. The initial quantity must be at least 0. 3Wait for the specified quantity to become available 7Signal that a given quantity is now available from the  .              b"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalnon-portable (concurrency) TrustworthyBOT % if bound threads are supported. If rtsSupportsBoundThreads is ,   will always return  and both   and   will fail. Fork a thread and call the supplied function when the thread is about to terminate, with an exception or a returned value. The function is called with asynchronous exceptions masked. aforkFinally action and_then = mask $ \restore -> forkIO $ try (restore action) >>= and_thenWThis function is useful for informing the parent when a child terminates, for example. Like  /*, this sparks off a new thread to run the ; computation passed as the first argument, and returns the  ) of the newly created thread. However,   creates a bound thread, which is necessary if you need to call foreign (non-Haskell) libraries that make use of thread-local state, such as OpenGL (see Control.Concurrent#boundthreads).Using   instead of  / makes no difference at all to the scheduling behaviour of the Haskell runtime system. It is a common misconception that you need to use   instead of  / to avoid blocking all the Haskell threads when making a foreign call; this isn't the case. To allow foreign calls to be made without blocking all the Haskell threads (with GHC), it is only necessary to use the  -threadedU option when linking your program, and to make sure the foreign import is not marked unsafe. Like  03, but the child thread is a bound thread, as with  . Returns  if the calling thread is boundl, that is, if it is safe to use foreign libraries that rely on thread-local state from the calling thread. Run the H computation passed as the first argument. If the calling thread is not bound), a bound thread is created temporarily. runInBoundThread doesn't finish until the  computation finishes.UYou can wrap a series of foreign function calls that rely on thread-local state with runInBoundThreadH so that you can use them without knowing whether the current thread is bound. Run the D computation passed as the first argument. If the calling thread is bound1, an unbound thread is created temporarily using  /. runInBoundThread doesn't finish until the  computation finishes.Use this function only in the rare case that you have actually observed a performance loss due to the use of bound threads. A program that doesn't need its main thread to be bound and makes heavy@ use of concurrency (e.g. a web server), might want to wrap its main action in runInUnboundThread.Note that exceptions which are thrown to the current thread are thrown in turn to the thread that is executing the given computation. This ensures there's always a way of killing the forked thread. bBlock the current thread until data is available to read on the given file descriptor (GHC only).This will throw an  if the file descriptor was closed while this thread was blocked. To safely close a file descriptor that has been used with  , use  . \Block the current thread until data can be written to the given file descriptor (GHC only).This will throw an  if the file descriptor was closed while this thread was blocked. To safely close a file descriptor that has been used with  , use  . Returns an STM action that can be used to wait for data to read from a file descriptor. The second returned value is an IO action that can be used to deregister interest in the file descriptor. Returns an STM action that can be used to wait until data can be written to a file descriptor. The second returned value is an IO action that can be used to deregister interest in the file descriptor.       =FGHIJKLMNO ) / 0 1 2 4 5 9 : ; < B C          ) ; /  0 9 : 1 2 4 5 B <      C       0"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportableSafeW*+-)Y,)Y,)W*+-)pa(c) Andy Gill 2001, (c) Oregon Graduate Institute of Science and Technology, 2001 BSD-style (see the file LICENSE)R.Paterson@city.ac.uk experimentalportableSafe Monads in which e computations may be embedded. Any monad built by applying a sequence of monad transformers to the ) monad will be an instance of this class.>Instances should satisfy the following laws, which state that   is a transformer of monads:   . - = -   (m >>= f) =   m >>= (  . f) Lift a computation from the  monad.          s(c) Nils Schweinsberg 2011, (c) George Giorgidze 2011 (c) University Tuebingen 2011/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafeQR  ! type class. Minimal definition: ; or  "Instances should satisfy the laws: Naturality : =liftM (f *** g) (mzip ma mb) = mzip (liftM f ma) (liftM g mb)Information Preservation: LliftM (const ()) ma = liftM (const ()) mb ==> munzip (mzip ma mb) = (ma, mb);               ! " ;   ;   " !            ;              ! "q(C) 2008-2014 Edward Kmett, BSD-style (see the file LICENSE)libraries@haskell.org provisionalportableSafe #Formally, the class  # represents a bifunctor from Hask -> Hask.WIntuitively it is a bifunctor where both the first and second arguments are covariant.You can define a  # by either defining  $ or by defining both  % and  &.If you supply  $, you should ensure that:  $ 7 7 "a 7If you supply  % and  & , ensure:  % 7 "a 7  & 7 "a 7 +If you supply both, you should also ensure:  $ f g "a  % f 9  & gThese ensure by parametricity:  $ (f 9 g) (h 9 i) "a  $ f h 9  $ g i  % (f 9 g) "a  % f 9  % g  & (f 9 g) "a  & f 9  & g $)Map over both arguments at the same time.  $ f g "a  % f 9  & g %(Map covariantly over the first argument.  % f "a  $ f 7 &)Map covariantly over the second argument.  & "a  $ 7 # $ % & ' ( ) * + , - . / # % & $ # $ % & # $ % & ' ( ) * + , - . /"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportable Trustworthyaa.4BSD-style (see the LICENSE file in the distribution)libraries@haskell.org experimental not portable TrustworthyR("(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.orgstableportableSafe 0 0), applied to two real fractional numbers x and epsilon/, returns the simplest rational number within epsilon of x. A rational number y is said to be simpler than another y' ifR ( y) <= R ( y'), and y <=  y'.QAny real interval contains a unique simplest rational; in particular, note that 0/1! is the simplest rational of all. 0 0 0 08"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental$non-portable (uses Control.Monad.ST) Trustworthy 1Mutate the contents of an .Be warned that  1I does not apply the function strictly. This means if the program calls  1 many times, but seldomly uses the value, thunks will pile up in memory resulting in a space leak. This is a common mistake made when using an STRef as a counter. For example, the following will leak memory and likely produce a stack overflow: iprint $ runST $ do ref <- newSTRef 0 replicateM_ 1000000 $ modifySTRef ref (+1) readSTRef refTo avoid this problem, use  2 instead. 2Strict version of  1 1 2 1 2 1 2 1 21"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional+non-portable (uses Control.Monad.ST.Strict)Safe 1 2r"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental non-portable TrustworthyB 3,An abstract unique object. Objects of type  3< may be compared for equality and ordering and hashed into w. 4Creates a new object of type  3I. The value returned will not compare equal to any other value of type  3 returned by previous calls to  4-. There is no limit on the number of times  4 may be called. 5 Hashes a  3 into an w. Two  3Ks may hash to the same value, although in practice this is unlikely. The w! returned makes a good hash key. 3 4 5 3 4 5 3 4 5 3 4 5s'(c) The University of Glasgow 2013-2015see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)None\&A LibdwSession from the runtime system An address 8 The state of the execution stackA chunk of backtrace frames 98Location information about an addresss from a backtrace. >*A location in the original program source. C#How many stack frames in the given  8 UReturn a list of the chunks of a backtrace, from the outer-most to inner-most chunk. Unpack the given  9 in the Haskell representation The size in bytes of a  D!List the frames of a stack trace. EGet an execution stack. FFree the cached debug data. GRender a stacktrace as a string  Render a  9 as a string$ 8  9 : ; < = > ? @ A B C   D E F G  8 9 : ; < = > ? @ A B C D E F G 9 : ; < = > ? @ A B 8 D C E G F 8  9 : ; < = > ? @ A B C   D E F G t'(c) The University of Glasgow 2013-2015see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)None H1Get a trace of the current execution stack state.Returns Nothing8 if stack trace support isn't available on host machine. IAGet a string representation of the current execution stack state. H I 9 : ; < = > ? @ A B H I 9 : ; < = > ? @ A B H I H Iu"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportable Trustworthy X J Computation  J returns the number of picoseconds CPU time used by the current program. The precision of this result is implementation-dependent. KThe  K constant is the smallest measurable difference in CPU time that the implementation can record, and is given as an integral number of picoseconds. J K J K J K J Kv(c) Sven Panne 2002-2005/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafe LsDescribes whether an option takes an argument or not, and if so how the argument is injected into a value of type a. Mno argument expected Noption requires argument Ooptional argument PEach  P describes a single option.The arguments to  Q are:list of short option characters*list of long option strings (without "--")argument descriptorexplanation of option for user R-What to do with options following non-options S+no option processing after first non-option T*freely intersperse options and non-options Uwrap non-options into options VReturn a string describing the usage of a command, derived from the header (first argument) and the options described by the second argument. WpProcess the command-line, and return the list of values that matched (and those that didn't). The arguments are:The order requirements (see  R)The option descriptions (see  P):The actual command line arguments (presumably got from }2). Wj returns a triple consisting of the option arguments, a list of non-options, and a list of error messages. XThis is almost the same as  W, but returns a quadruple consisting of the option arguments, a list of non-options, a list of unrecognized options, and a list of error messages.  !"#$ L M N O P Q R S T U V%&' W X()*+,-. Y Z [ L M N O P Q R S T U V W X W X V R S T U P Q L M N O !"#$ L M N O P Q R S T U V%&' W X()*+,-. Y Z [R"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportable Trustworthy \ Computation  \ code throws  code3. Normally this terminates the program, returning code to the program's caller.%On program termination, the standard s   and  / are flushed automatically; any other buffered Os need to be flushed manually, otherwise the buffered data will be discarded.FA program that fails in any other way is treated as if it had called  ]:. A program that terminates successfully without calling  \, explicitly is treated as it it had called  \ .As an  is not an ,  \% bypasses the error handling in the % monad and cannot be intercepted by catch from the Prelude. However it is a  SomeException,, and can be caught using the functions of Control.Exception4. This means that cleanup computations added with C (from Control.Exception ) are also executed properly on  \.Note: in GHC,  \q should be called from the main program thread in order to exit the process. When called from another thread,  \ will throw an  ExitExceptionI as normal, but the exception will not cause the process itself to exit. ]The computation  ] is equivalent to  \ ( exitfail) , where exitfail is implementation-dependent. ^The computation  ^ is equivalent to  \ *, It terminates the program successfully. _Write given error message to   and terminate with  ]. \ ] ^ _ \ ] ^ _ \ ] ^ _ \ ] ^ _c"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportable Trustworthy `/Triggers an immediate minor garbage collection. a/Triggers an immediate major garbage collection. b/Triggers an immediate major garbage collection. ` a b + , - . ` a b b a ` + , - . ` a bw"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental non-portable Trustworthy/B cCAn abstract name for an object, that supports equality and hashing.)Stable names have the following property:If sn1 :: StableName and sn2 :: StableName and  sn1 == sn2 then sn1 and sn2 were created by calls to makeStableName on the same object.The reverse is not necessarily true: if two stable names are not equal, then the objects they name may still be equal. Note in particular that  mkStableName may return a different  c after an object is evaluated.-Stable Names are similar to Stable Pointers (Foreign.StablePtr&), but differ in the following ways: There is no freeStableName operation, unlike Foreign.StablePtr[s. Stable names are reclaimed by the runtime system when they are no longer needed. There is no deRefStableName operation. You can't get back from a stable name to the original Haskell object. The reason for this is that the existence of a stable name for an object does not guarantee the existence of the object itself; it can still be garbage collected. dMakes a  cX for an arbitrary object. The object passed as the first argument is not evaluated by  d. e Convert a  c to an w. The w. returned is not necessarily unique; several  cs may map to the same wI (in practice however, the chances of this are small, so the result of  e makes a good hash key). f Equality on  c> that does not require that the types of the arguments match. c/ d e f g c d e f c d e f c/ d e f g6"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental non-portable Trustworthy hA specialised version of Y3, where the key and the value are the same object: 2mkWeakPtr key finalizer = mkWeak key key finalizer iA specialised version of  h , where the X object returned is simply thrown away (however the finalizer will be remembered by the garbage collector, and will still be run when the key becomes unreachable).Note: adding a finalizer to a J using  i+ won't work; use the specialised version J3$ instead. For discussion see the X type. . jA specialised version of YD where the value is actually a pair of the key and value passed to  j: =mkWeakPair key val finalizer = mkWeak key (key,val) finalizer:The advantage of this is that the key can be retrieved by Z in addition to the value. h i jXYZ[ h i jXYZ[ h i j h i jx"(c) The University of Glasgow 2007/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental non-portableSafe/ kWrap an $ computation to time out and return Nothing( in case no result is available within n microseconds (1/10^6F seconds). In case a result is available before the timeout expires, Just a is returned. A negative timeout interval means "wait indefinitely". When specifying long timeouts, be careful not to exceed maxBound :: Int.?The design of this combinator was guided by the objective that  timeout n f$ should behave exactly the same as f as long as f$ doesn't time out. This means that f has the same  ;< it would have without the timeout wrapper. Any exceptions fP might throw cancel the timeout and propagate further up. It also possible for f7 to receive exceptions thrown to it by another thread.BA tricky implementation detail is the question of how to abort an IO computation. This combinator relies on asynchronous exceptions internally. The technique works very well for computations executing inside of the Haskell runtime system, but it doesn't work at all for non-Haskell code. Foreign function calls, for example, cannot be timed out with this combinator simply because an arbitrary C function cannot receive asynchronous exceptions. When timeout is used to wrap an FFI call that blocks, no timeout event can be delivered until the FFI call returns, which pretty much negates the purpose of the combinator. In practice, however, this limitation is less severe than it may sound. Standard I/O functions like 4, 5, Network.Socket.accept, or 6j appear to be blocking, but they really don't because the runtime system uses scheduling mechanisms like  select(2)u to perform asynchronous I/O, so it is possible to interrupt standard socket I/O or file I/O using this combinator.01 k l m k k01 k l my"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportableSafe o o7"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental:non-portable (requires universal quantification for runST)Unsafe)"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental:non-portable (requires universal quantification for runST) Trustworthy8"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional:non-portable (requires universal quantification for runST)Safe9"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental:non-portable (requires universal quantification for runST) Trustworthy7"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental:non-portable (requires universal quantification for runST)Unsafe:"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional:non-portable (requires universal quantification for runST)UnsafeBOT p9The lazy state-transformer monad. A computation of type  p s a* transforms an internal state indexed by s, and returns a value of type a. The s parameter is either5an unstantiated type variable (inside invocations of  q), or (inside invocations of  u).CIt serves to keep the internal states of different invocations of  q2 separate from each other and from invocations of  u.The * and +6 operations are not strict in the state. For example,  q5 (writeSTRef _|_ v >>= readSTRef _|_ >> return 2) = 2 qCReturn the value computed by a state transformer computation. The forall- ensures that the internal state used by the  p9 computation is inaccessible to the rest of the program. roAllow the result of a state transformer computation to be used (lazily) inside the computation. Note that if f is strict,  r f = _|_. sConvert a strict  pA computation into a lazy one. The strict state thread passed to  sS is not performed until the result of the lazy state thread it returns is demanded. tConvert a lazy  p computation into a strict one. u=A monad transformer embedding lazy state transformers in the  monad. The : parameter indicates that the internal state used by the  p. computation is a special one supplied by the = monad, and thus distinct from those used by invocations of  q.23 p4 q r s t u v w5678 p q r s t u v w 23 p4 q r s t u v w5678z"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional:non-portable (requires universal quantification for runST) Trustworthy p q r s t u p q r s t u|"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental)non-portable (uses Control.Monad.ST.Lazy)Safe x y z { x y z { x y z { x y z {;"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional:non-portable (requires universal quantification for runST) Trustworthy p q r s t u p q r s t u{"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisional:non-portable (requires universal quantification for runST)Unsafe v w v w<"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportableSafe9 Reads the FilePath1 pointed to by the symbolic link and returns it.See readlink(2) |8Returns the absolute pathname of the current executable.aNote that for scripts and interactive sessions, this is the path to the interpreter (e.g. ghci.):9 | |:9 |}"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportableSafe } Computation  }Z returns a list of the program's command line arguments (not including the program name). ~ Computation  ~3 returns the name of the program as it was invoked.!However, this is hard-to-impossible to implement on some non-Unix OSes, so instead, for maximum portability, we just return the leafname of the program as invoked. Even then there are some differences between platforms: on Windows, for example, a program invoked as foo is probably really FOO.EXE, and that is what  ~ will return.  Computation   var0 returns the value of the environment variable var(. For the inverse, POSIX users can use =>.This computation may fail with:B?0 if the environment variable does not exist. -Return the value of the environment variable var, or Nothing if there is no such value.'For POSIX users, this is equivalent to =@. setEnv name value, sets the specified environment variable to value.2On Windows setting an environment variable to the  empty string removes that environment variable from the environment. For the sake of compatibility we adopt that behavior. In particular setEnv name "" has the same effect as   name iIf you don't care about Windows support and want to set an environment variable to the empty string use System.Posix.Env.setEnv from the unix package instead.Throws CA if name1 is the empty string or contains an equals sign.  unSet nameY removes the specified environment variable from the environment of the current process.Throws CA if name1 is the empty string or contains an equals sign.   args act - while executing action act, have  } return args.   name act - while executing action act, have  ~ return name.  0 retrieves the entire environment as a list of  (key,value) pairs.,If an environment entry does not contain an '=' character, the key is the whole entry and the value is the empty string.;<=>?@ } ~AB  C DE FGHI J | } ~  } ~ |  ;<=>?@ } ~AB  C DE FGHI J~"(c) The University of Glasgow 2004/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental6non-portable (local universal quantification in ReadP)Safe5 A  - represents the version of a software entity.An instance of SS is provided, which implements exact equality modulo reordering of the tags in the   field.An instance of [= is also provided, which gives lexicographic ordering on the   fields (i.e. 2.1 > 2.0, 1.2.3 > 1.2.2, etc.). This is expected to be sufficient for many uses, but note that you may need to use a more specific ordering for your versioning scheme. For example, some versioning schemes may include pre-releases which have tags "pre1", "pre2", and so on, and these would need to be taken into account when determining ordering. In some cases, date ordering may be more appropriate, so the application would have to look for date tags in the  G field and compare those. The bottom line is, don't always assume that   and other [* operations are the right thing for every  .sSimilarly, concrete representations of versions may differ. One possible concrete representation is provided (see   and  `), but depending on the application a different concrete representation may be more appropriate. The numeric branch for this version. This reflects the fact that most software versions are tree-structured; there is a main trunk which is tagged with versions at various points (1,2,3...), and the first branch off the trunk after version 3 is 3.1, the second branch off the trunk after version 3 is 3.2, and so on. The tree can be branched arbitrarily, just by adding more digits.%We represent the branch as a list of w\, so version 3.2.1 becomes [3,2,1]. Lexicographic ordering (i.e. the default instance of [ for [Int]*) gives the natural ordering of branches. A version can be tagged with an arbitrary list of strings. The interpretation of the list of tags is entirely dependent on the entity that this version applies to. 2Provides one possible concrete representation for  . For a version with    = [1,2,3] and   = ["tag1","tag2"], the output will be 1.2.3-tag1-tag2. 0A parser for versions in the format produced by  . Construct tag-less      -(c) The University of Glasgow, CWI 2001--2004/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimental-non-portable (local universal quantification) Trustworthy%&+/9:;DOQRT7XThe X+ class comprehends a fundamental primitive   for folding over constructor applications, say terms. This primitive can be instantiated in several ways to map over the immediate subterms of a term; see the gmap combinators later in this class. Indeed, a generic programmer does not necessarily need to use the ingenious gfoldl primitive but rather the intuitive gmap combinators. The   primitive is completed by means to query top-level constructors, to turn constructor representations into proper terms, and to list all possible datatype constructors. This completion allows us to serve generic programming scenarios like read, show, equality, term generation.The combinators  ,  ,  <, etc are all provided with default definitions in terms of  _, leaving open the opportunity to provide datatype-specific definitions. (The inclusion of the gmap! combinators as members of class Xk allows the programmer or the compiler to derive specialised, and maybe more efficient code per datatype. Note:   is more higher-order than the gmap` combinators. This is subject to ongoing benchmarking experiments. It might turn out that the gmap, combinators will be moved out of the class X.)$Conceptually, the definition of the gmap' combinators in terms of the primitive  $ requires the identification of the  Q function arguments. Technically, we also need to identify the type constructor cC for the construction of the result type from the folded term type.In the definition of gmapQx7 combinators, we use phantom type constructors for the c in the type of  w because the result type of a query does not involve the (polymorphic) type of the term argument. In the definition of  ; we simply use the plain constant type constructor because  J is left-associative anyway and so it is readily suited to fold a left-associative binary operation over the immediate subterms. In the definition of gmapQr, extra effort is needed. We use a higher-order accumulation trick to mediate between left-associative constructor application vs. right-associative binary operation (e.g., (:)7). When the query is meant to compute a value of type r2, then the result type withing generic folding is r -> rQ. So the result of folding is a function to which we finally pass the right unit. With the -XDeriveDataTypeable+ option, GHC can generate instances of the X9 class automatically. For example, given the declaration 2data T a b = C1 a b | C2 deriving (Typeable, Data)3GHC will generate an instance that is equivalent to instance (Data a, Data b) => Data (T a b) where gfoldl k z (C1 a b) = z C1 `k` a `k` b gfoldl k z C2 = z C2 gunfold k z c = case constrIndex c of 1 -> k (k (z C1)) 2 -> z C2 toConstr (C1 _ _) = con_C1 toConstr C2 = con_C2 dataTypeOf _ = ty_T con_C1 = mkConstr ty_T "C1" [] Prefix con_C2 = mkConstr ty_T "C2" [] Prefix ty_T = mkDataType "Module.T" [con_C1, con_C2]?This is suitable for datatypes that are exported transparently. Fixity of constructors iUnique index for datatype constructors, counting from 1 in the order they are given in the program text. %Public representation of constructors "Public representation of datatypes Representation of constructors. Note that equality on constructors with different types may not work -- i.e. the constructors for  and  may compare equal. eRepresentation of datatypes. A package of constructor representations with names of type and module.K1The type constructor used in definition of gmapMpL1The type constructor used in definition of gmapQrM/Type constructor for adding counters to queriesNAThe constant type constructor needed for the definition of gmapQlO@The identity type constructor needed for the definition of gmapT =Left-associative fold operation for constructor applications. The type of  P is a headache, but operationally it is a simple generalisation of a list fold.The default definition for   is 8 7B, which is suitable for abstract datatypes with no substructures. "Unfolding constructor applications Obtaining the constructor from a given datum. For proper terms, this is meant to be the top-level constructor. Primitive datatypes are here viewed as potentially infinite sets of values (i.e., constructors). &The outer type constructor of the type /Mediate types and unary type constructors. In X instances of the form T a,   should be defined as .The default definition is 8 8, which is appropriate for non-unary type constructors. 0Mediate types and binary type constructors. In X instances of the form T a b,   should be defined as .The default definition is 8 9, which is appropriate for non-binary type constructors. >A generic transformation that maps over the immediate subterms9The default definition instantiates the type constructor c in the type of  ^ to an identity datatype constructor, using the isomorphism pair as injection and projection. 7A generic query with a left-associative binary operator 8A generic query with a right-associative binary operator A generic query that processes the immediate subterms and returns a list of results. The list is given in the same order as originally specified in the declaration of the data constructors. >A generic query that processes one child by index (zero-based) FA generic monadic transformation that maps over the immediate subterms9The default definition instantiates the type constructor c in the type of  M to the monad datatype constructor, defining injection and projection using - and *. >Transformation of at least one immediate subterm does not fail 4Transformation of one immediate subterm with success Build a term skeleton 4Build a term and use a generic function for subterms Monadic variation on  .Gets the type constructor including the module *Gets the public presentation of a datatype "Gets the datatype of a constructor ,Gets the public presentation of constructors +Look up a constructor by its representation  Constructs an algebraic datatype Constructs a constructor .Gets the constructors of an algebraic datatype Gets the field labels of a constructor. The list of labels is returned in the same order as they were given in the original constructor declaration.  Gets the fixity of a constructor !Gets the string for a constructor !Lookup a constructor via a string Test for an algebraic type <Gets the constructor for an index (algebraic datatypes only) :Gets the index of a constructor (algebraic datatypes only) ;Gets the maximum constructor index of an algebraic datatype Constructs the w type Constructs the v type Constructs the t typeP Helper for  ,  Makes a constructor for t. <Constructs a non-representation for a non-representable type !Test for a non-representable type AGets the unqualified type constructor: drop *.*.*... before name AGets the module of a type constructor: take *.*.*... before name Equality of constructorsX QRSTUV WXYKZ[L\]M^N_`Oab Pc defghijklmnopqrstuvwxyz{|}~       jAX b&' =X X    QRSTUV WXYKZ[L\]M^N_`Oab Pc defghijklmnopqrstuvwxyz{|}~       "(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org provisionalportable Trustworthy/02345 &Complex numbers are an algebraic type.For a complex number z, R z# is a number with the magnitude of z8, but oriented in the positive real direction, whereas S z has the phase of z, but unit magnitude.The g and h( instances traverse the real part first. Kforms a complex number from its real and imaginary rectangular components. +Extracts the real part of a complex number. 0Extracts the imaginary part of a complex number. "The conjugate of a complex number. CForm a complex number from polar components of magnitude and phase.   t# is a complex value with magnitude 1 and phase t (modulo 2*>).  The function   takes a complex number and returns a (magnitude, phase) pair in canonical form: the magnitude is nonnegative, and the phase in the range (->, >]2; if the magnitude is zero, then so is the phase. .The nonnegative magnitude of a complex number. ,The phase of a complex number, in the range (->, >]2. If the magnitude is zero, then so is the phase.                                                     6#(c) Ashley Yakeley 2005, 2006, 2009/BSD-style (see the file libraries/base/LICENSE)$Ashley Yakeley <ashley@semantic.org> experimentalportable TrustworthyT ($resolution of 10^-12 = .000000000001 * resolution of 10^-9 = .000000001 ,resolution of 10^-6 = .000001 .resolution of 10^-3 = .001 0>resolution of 10^-2 = .01, useful for many monetary currencies 2resolution of 10^-1 = .1 4/resolution of 1, this works the same as Integer 8,The type parameter should be an instance of  6. 9 :generalisation of  to any instance of Real ;generalisation of  to any instance of Real <generalisation of  to any instance of Real =/First arg is whether to chop off trailing zeros- ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = : < ; 8 9 6 7 = 5 4 3 2 1 0 / . - , + * ) (+ ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L(C) 2008-2014 Edward Kmett/BSD-style (see the file libraries/base/LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportableSafe/05a OUninhabited data type PSince  Ob values logically don't exist, this witnesses the logical reasoning tool of "ex falso quodlibet". QIf  O is uninhabited then any Y! that holds only values of type  O is holding no values. U Reading a  O- value is always a parse error, considering  O% as a data type with no constructors. O P Q R S T U V W O P Q O P Q O P Q R S T U V WB#(c) The University of Glasgow, 2007see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions) TrustworthyAOTF(C) 2014 Herbert Valerio Riedel, (C) 2011 Edward Kmettsee libraries/base/LICENSElibraries@haskell.orginternalnon-portable (GHC Extensions)UnsafeBI Z<Type representing arbitrary-precision non-negative integers.+Operations whose result would be negative  ( :: ). [in [0, maxBound::Word] \in ]maxBound::Word, +inf[ Invariant:  \ is used iff value doesn't fit in  [ constructor. ]6Test whether all internal invariants are satisfied by  Z valueNThis operation is mostly useful for test-suites and/or code which constructs | values directly. Compute greatest common divisor. compute least common multiplier. Z Addition Z multiplication Z subtraction. May  . ^ Z subtraction. Returns s for non-positive results.Convert  to  Z . Throws  if passed a .Convert w to  Z . Throws  when passed a negative w. _ Construct  Z from  value. `Try downcasting  Z to  value. Returns  if value doesn't fit in . a" a b e m" computes base b raised to exponent e modulo m. Z [ \ ] ^ _ ` a b c d e f g h i j Z [ \ ] ^ _ ` a Z [ \ ] _ ` ^ a Z [ \ ] ^ _ ` a b c d e f g h i jF(C) 2014 Herbert Valerio Riedel, (C) 2011 Edward Kmettsee libraries/base/LICENSElibraries@haskell.org provisionalportable Trustworthy Z Z+(c) Lennart Augustsson and Bart Massey 20135BSD-style (see the file LICENSE in this distribution)Bart Massey <bart@cs.pdx.edu> provisionalportableSafe%&% mOType of a function that will parse modifier characters from the format string. nAThis is the type of a field formatter reified over its argument. oThe "format parser" walks over argument-type-specific modifier characters to find the primary format character. This is the type of its result. qAny modifiers found. rPrimary format character. sRest of the format string. t$Description of field formatting for   . See UNIX  5(3) for a description of how field formatting works. vTotal width of the field. w Secondary field width specifier. x)Kind of filling or padding to be done. y8Whether to insist on a plus sign for positive numbers. z`Indicates an "alternate format". See printf(3) for the details, which vary by argument spec. {6Characters that appeared immediately to the left of  |1 in the format and were accepted by the type's  . Normally the empty string. |The format character   was invoked with.   should fail unless this character matches the type. It is normal to handle many different format characters for a single type. }PHow to handle the sign of a numeric field. These are mutually exclusive, with  ~ taking precedence. PWhether to left-adjust or zero-pad a field. These are mutually exclusive, with   taking precedence. SThis class, with only the one instance, is used as a workaround for the fact that A, as a concrete type, is not allowable as a typeclass instance.  ) is exported for backward-compatibility.    Typeclass of  -formattable values. The  m method takes a value and a field format descriptor and either fails due to a bad descriptor or produces a  as the result. The default  C expects no modifiers: this is the normal case. Minimal instance:  .   The  1 class provides the variable argument magic for  E. Its implementation is intentionally not visible from this module. The  1 class provides the variable argument magic for  . Its implementation is intentionally not visible from this module. If you attempt to pass an argument of a type which is not an instance of this class to   or  =, then the compiler will report it as a missing instance of  . fFormat a variable number of arguments with the C-style formatting string. The return value is either  or ( a) (which should be ( '()')., but Haskell's type system makes this hard).7The format string consists of ordinary characters and conversion specifications7, which specify how to format one of the arguments to  D in the output string. A format specification is introduced by the %N character; this character can be self-escaped into the format string using %%1. A format specification ends with a /format character/ that provides the primary information about how to format the value. The rest of the conversion specification is optional. In order, one may have flag characters, a width specifier, a precision specifier, and type-specific modifier characters. Unlike C  printf(3), the formatting of this  W is driven by the argument type; formatting is type specific. The types formatted by   "out of the box" are:V types, including t^ types 6 is also extensible to support other types: see below.6A conversion specification begins with the character %2, followed by zero or more of the following flags:  - left adjust (default is right adjust) + always use a sign (+ or -) for signed conversions space leading space for positive numbers in signed conversions 0 pad with zeros rather than spaces # use an \"alternate form\": see belowWhen both flags are given, - overrides 0 and +3 overrides space. A negative width specifier in a *E conversion is treated as positive but implies the left adjust flag.@The "alternate form" for unsigned radix conversions is as in C  printf(3):  %o prefix with a leading 0 if needed %x prefix with a leading 0x if nonzero %X prefix with a leading 0X if nonzero %b prefix with a leading 0b if nonzero %[eEfFgG] ensure that the number contains a decimal point3Any flags are followed optionally by a field width: D num field width * as num, but taken from argument listhThe field width is a minimum, not a maximum: it will be expanded as needed to avoid mutilating a value.6Any field width is followed optionally by a precision: W .num precision . same as .0 .* as num, but taken from argument list_Negative precision is taken as 0. The meaning of the precision depends on the conversion type.  Integral minimum number of digits to show RealFloat number of digits after the decimal point String maximum number of charactersThe precision for Integral types is accomplished by zero-padding. If both precision and zero-pad are given for an Integral field, the zero-pad is ignored.Any precision is followed optionally for Integral types by a width modifier; the only use of this modifier being to set the implicit size of the operand for conversion of a negative operand to unsigned: N hh Int8 h Int16 l Int32 ll Int64 L Int64/The specification ends with a format character:  c character Integral d decimal Integral o octal Integral x hexadecimal Integral X hexadecimal Integral b binary Integral u unsigned decimal Integral f floating point RealFloat F floating point RealFloat g general format float RealFloat G general format float RealFloat e exponent format float RealFloat E exponent format float RealFloat s string String v default format any typeThe "%v" specifier is provided for all built-in types, and should be provided for user-defined type formatters as well. It picks a "best" representation for the given type. For the built-in types the "%v" specifier is converted as follows: u c Char u other unsigned Integral d other signed Integral g RealFloat s StringMismatch between the argument types and the format string, as well as any other syntactic or semantic errors in the format string, will cause an exception to be thrown at runtime.Note that the formatting for ^4 types is currently a bit different from that of C  printf(3), conforming instead to }, ~ and  (and their alternate versions  and ). This is hard to fix: the fixed versions would format in a backward-incompatible way. In any case the Haskell behavior is generally more sensible than the C behavior. A brief summary of some key differences:Haskell  @ never uses the default "6-digit" precision used by C printf.Haskell  ` treats the "precision" specifier as indicating the number of digits after the decimal point.Haskell  ~ prints the exponent of e-format numbers without a gratuitous plus sign, and with the minimum possible number of digits.Haskell  : will place a zero after a decimal point when possible.Examples q > printf "%d\n" (23::Int) 23 > printf "%s %s\n" "Hello" "World" Hello World > printf "%.2f\n" pi 3.14  Similar to  +, except that output is via the specified $. The return type is restricted to ( a). RSubstitute a 'v' format character with the given default format character in the  tH. A convenience for user-implemented types, which should support "%v". Formatter for t values. Formatter for  values. Formatter for w values. Formatter for | values. Formatter for ^ values.  Raises an 6 with a printf-specific prefix on the message string. Calls  8 to indicate an unknown format letter for a given type. Calls  1 to indicate that the format string ended early. Calls  D to indicate that there is a missing argument in the argument list. Calls  J to indicate that there is a type error or similar in the given argument.U m n o p q r s t u v w x y z { | } ~        + m n o p q r s t u v w x y z { | } ~  + n t u v w x y z { | } ~  m o p q r s ? m n o p q r s t u v w x y z { | } ~           "(c) The University of Glasgow 2002see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)Unsafe 09;<=BDR The  function uses the user supplied function which projects an element out of every list element in order to first sort the input list and then to form groups by equality on these projected elements<The <d class and its methods are intended to be used in conjunction with the OverloadedLists extension.=The =# function constructs the structure l from the given list of Item l>The >\ function takes the input list's length as a hint. Its behaviour should be equivalent to =5. The hint can be used to construct the structure l more efficiently compared to =U. If the given hint does not equal to the input list's length the behaviour of > is not specified.?The ? function extracts a list of Item l from the structure l.. It should satisfy fromList . toList = id. The  = type function returns the type of items of the structure l.  ^ ensures that all the elements of the list are identical and then returns that unique element The  m function sorts a list of elements using the user supplied function to project something out of each element  9Be aware that 'fromList . toList = id' only for unfrozen  s, since ? removes frozenness information. <=>?  2678;< =>?<e5?@ABtCuDvEwFGHIJKLMNOPQRSUVWXYZ[\`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ >?@ABWqrtu Twvut >?@ABqrtu e5 W< =>? < =>?   e(C) 2011-2015 Edward Kmett, (C) 2010 Tony Morris, Oliver Taylor, Eelis van der Weegen BSD-style (see the file LICENSE)libraries@haskell.org provisionalportable Trustworthy05DR:  %Non-empty (and non-strict) list type. Number of elements in   list. .Compute n-ary logic exclusive OR operation on   list.  v produces a new stream by repeatedly applying the unfolding function to the seed value to produce an element of type b= and a new seed value. When the unfolding function returns / instead of a new seed value, the stream ends.  ( efficiently turns a normal list into a   stream, producing  if the input is empty.  [ produces the first element of the stream, and a stream of the remaining elements, if any. The   function is analogous to  Data.List's kC operation. (Extract the first element of the stream. .Extract the possibly-empty tail of the stream. 'Extract the last element of the stream. 9Extract everything except the last element of the stream. !Prepend an element to the stream.  Synonym for  . Sort a stream. Converts a normal list to a   stream.'Raises an error if given an empty list. .Convert a stream to a normal list efficiently."Lift list operations to work on a   stream.BewareL: If the provided function returns an empty list, this will raise an error. Map a function over a   stream. The   function takes a stream xs) and returns all the finite prefixes of xs. The   function takes a stream xs" and returns all the suffixes of xs.   x xs inserts x into the last position in xs where it is still less than or equal to the next element. In particular, if the list is sorted beforehand, the result will also be sorted.   x sequences x one or more times.   is similar to hC, but returns a stream of successive reduced values from the left: Bscanl f z [x1, x2, ...] == z :| [z `f` x1, (z `f` x1) `f` x2, ...] Note that $last (scanl f z xs) == foldl f z xs.   is the right-to-left dual of   . Note that $head (scanr f z xs) == foldr f z xs.   is a variant of  % that has no starting value argument: Dscanl1 f [x1, x2, ...] == x1 :| [x1 `f` x2, x1 `f` (x2 `f` x3), ...]   is a variant of  % that has no starting value argument. B'intersperse x xs' alternates elements of the list with copies of x. ,intersperse 0 (1 :| [2,3]) == 1 :| [0,2,0,3]   f x= produces the infinite sequence of repeated applications of f to x. %iterate f x = x :| [f x, f (f x), ..]   xs$ returns the infinite repetition of xs: )cycle (1 :| [2,3]) = 1 :| [2,3,1,2,3,...]   a finite NonEmpty stream.   x= returns a constant stream, where all elements are equal to x.   n xs returns the first n elements of xs.   n xs drops the first n) elements off the front of the sequence xs.   n xs, returns a pair consisting of the prefix of xs of length n< and the remaining stream immediately following this prefix. ['splitAt' n xs == ('take' n xs, 'drop' n xs) xs == ys ++ zs where (ys, zs) = 'splitAt' n xs   p xs+ returns the longest prefix of the stream xs for which the predicate p holds.   p xs% returns the suffix remaining after   p xs.   p xs returns the longest prefix of xs that satisfies p,, together with the remainder of the stream. _'span' p xs == ('takeWhile' p xs, 'dropWhile' p xs) xs == ys ++ zs where (ys, zs) = 'span' p xs The   p function is equivalent to   (not . p).   p xs removes any elements from xs that do not satisfy p. The   function takes a predicate p and a stream xsN, and returns a pair of lists. The first list corresponds to the elements of xs for which p3 holds; the second corresponds to the elements of xs for which p does not hold. 9'partition' p xs = ('filter' p xs, 'filter' (not . p) xs) The   function takes a stream and returns a list of streams such that flattening the resulting list is equal to the argument. Moreover, each stream in the resulting list contains only equal elements. For example, in list notation: f'group' $ 'cycle' "Mississippi" = "M" : "i" : "ss" : "i" : "ss" : "i" : "pp" : "i" : "M" : "i" : ...   operates like  7, but uses the provided equality predicate instead of &.   operates like  ?, but uses the provided projection when comparing for equality   operates like  `, but sorts the list first so that each equivalence class has, at most, one list in the output   operates like  ], but uses the knowledge that its input is non-empty to produce guaranteed non-empty output.   is to   as   is to  .   is to   as   is to    is to   as   is to  The isPrefix function returns True2 if the first argument is a prefix of the second. xs !! n# returns the element of the stream xs at index n/. Note that the head of the stream has index 0.Beware8: a negative or out-of-bounds index will cause an error. The  I function takes two streams and returns a stream of corresponding pairs. The   function generalizes  p. Rather than tupling the elements, the elements are combined using the function passed as the first argument. The   function is the inverse of the   function. The   function removes duplicate elements from a list. In particular, it keeps only the first occurence of each element. (The name  , means 'essence'.) It is a special case of  C, which allows the programmer to supply their own inequality test. The   function behaves just like  O, except it uses a user-supplied equality predicate instead of the overloaded & function.   for  , behaves the same as kD\ The rows/columns need not be the same length, in which case > transpose . transpose /= id   for  , behaves the same as k   for  , behaves the same as: sortBy . comparingC  : : B    5 5(C) 2011-2015 Edward Kmett BSD-style (see the file LICENSE)libraries@haskell.org provisionalportable Trustworthy +056:DQRTFAn associative operation. (a F b) F c = a F (b F c) If a is also a r we further require (F) = H q EThe class of semigroups (types with an associative binary operation). is effectively } with a better instance of r, built off of an underlying q instead of an underlying r.EIdeally, this type would not exist at all and we would just fix the r instance of },Provide a Semigroup for an arbitrary Monoid. Use  (  a) to get the behavior of E from  Data.Monoid Use  (  a) to get the behavior of F from  Data.Monoid. isn't itself a q0 in its own right, but it can be placed inside  and " to compute an arg min or arg max.Reduce a non-empty list with <>XThe default definition should be sufficient, but this can be overridden for efficiency.Repeat a value n times.Given that this works on a qf it is allowed to fail if you request 0 or fewer repetitions, and the default definition will do so.hBy making this a member of the class, idempotent semigroups and monoids can upgrade this to execute in O(1) by picking stimes = stimesIdempotent or stimes = stimesIdempotentMonoid respectively.A generalization of kG to an arbitrary q<. May fail to terminate for some values in some semigroups.This is a valid definition of  for a r.!Unlike the default definition of D, it is defined for 0 and so it should be preferred where possible.This is a valid definition of  for an idempotent r.When mappend x x = x<, this definition should be preferred, because it works in O(1) rather than O(log n)This is a valid definition of  for an idempotent q.When  x <> x = x<, this definition should be preferred, because it works in O(1) rather than O(log n). Repeat a value n times. ?mtimesDefault n a = a <> a <> ... <> a -- using <> (n-1) timesImplemented using  and G.%This is a suitable definition for an mtimes member of r.!Fold an  case-wise, just like _.")This lets you use a difference list of a q as a r.tFq      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstu7qFrGHI           !"8qFF      rGHI     !"dqFF      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuF6`(c) Andy Gill 2001, (c) Oregon Graduate Institute of Science and Technology 2001 BSD-style (see the file LICENSE)ross@soi.city.ac.uk experimentalportable Trustworthy02345I0Identity functor and monad. (a non-strict monad)Internal (non-exported)  helper for o See Note [Function coercion] in  Data.Foldable for more details.CThis instance would be equivalent to the derived instances of the  newtype if the  field were removedCThis instance would be equivalent to the derived instances of the  newtype if the  field were removed  (c) Ross Paterson 2013 BSD-style (see the file LICENSE)libraries@haskell.org experimentalportableSafe,Lifting of the `# class to binary type constructors.? function for an application of the type constructor based on  and " functions for the argument types.? function for an application of the type constructor based on  and u functions for the argument types. The default implementation using standard list syntax is correct for most types.Lifting of the \# class to binary type constructors.? function for an application of the type constructor based on  and " functions for the argument types.? function for an application of the type constructor based on  and u functions for the argument types. The default implementation using standard list syntax is correct for most types.Lifting of the [# class to binary type constructors.Lift  ( functions through the type constructor.The function will usually be applied to comparison functions, but the more general type ensures that the implementation uses them to compare elements of the first container with elements of the second.Lifting of the S# class to binary type constructors.1Lift equality tests through the type constructor.The function will usually be applied to equality functions, but the more general type ensures that the implementation uses them to compare elements of the first container with elements of the second.Lifting of the `" class to unary type constructors.? function for an application of the type constructor based on  and ! functions for the argument type.? function for an application of the type constructor based on  and t functions for the argument type. The default implementation using standard list syntax is correct for most types.Lifting of the \" class to unary type constructors.? function for an application of the type constructor based on  and ! functions for the argument type.? function for an application of the type constructor based on  and t functions for the argument type. The default implementation using standard list syntax is correct for most types.Lifting of the [" class to unary type constructors.Lift a  ' function through the type constructor.The function will usually be applied to a comparison function, but the more general type ensures that the implementation uses it to compare elements of the first container with elements of the second.Lifting of the S" class to unary type constructors.3Lift an equality test through the type constructor.The function will usually be applied to an equality function, but the more general type ensures that the implementation uses it to compare elements of the first container with elements of the second.Lift the standard (&)' function through the type constructor.Lift the standard  ' function through the type constructor.WRead a list (using square brackets and commas), given a function for reading elements.Lift the standard  and ) functions through the type constructor.Lift the standard  and ) functions through the type constructor.Lift the standard (&)' function through the type constructor.Lift the standard  ' function through the type constructor.Lift the standard ' function through the type constructor.Lift the standard ' function through the type constructor. p d is a parser for datatypes where each alternative begins with a data constructor. It parses the constructor and passes it to p=. Parsers for various constructors can be constructed with ,  and , and combined with mappend from the Monoid class. rp n c n'R matches the name of a unary data constructor and then parses its argument using rp. rp1 rp2 n c n'T matches the name of a binary data constructor and then parses its arguments using rp1 and rp2 respectively. sp n d xK produces the string representation of a unary data constructor with name n and argument x, in precedence context d. sp1 sp2 n d x yL produces the string representation of a binary data constructor with name n and arguments x and y, in precedence context d. n c n'R matches the name of a unary data constructor and then parses its argument using . n c n'R matches the name of a unary data constructor and then parses its argument using . n c n'T matches the name of a binary data constructor and then parses its arguments using . n d xK produces the string representation of a unary data constructor with name n and argument x, in precedence context d. n d xK produces the string representation of a unary data constructor with name n and argument x, in precedence context d. n d x yL produces the string representation of a binary data constructor with name n and arguments x and y, in precedence context d.    P     ''D     (c) Ross Paterson 2010 BSD-style (see the file LICENSE)libraries@haskell.org experimentalportableSafe+05DRight-to-left composition of functors. The composition of applicative functors is always applicative, but the composition of monads is not always a monad. !"#$ !"#$9 9 (c) Ross Paterson 2010 BSD-style (see the file LICENSE)libraries@haskell.org experimentalportableSafe+05D(Lifted product of functors.()*+,-./0123456789:()()()*+,-./0123456789:(c) Ross Paterson 2014 BSD-style (see the file LICENSE)libraries@haskell.org experimentalportableSafe+05D>Lifted sum of functors.>?@ABCDEFGHIJK>?@>?@ >?@ABCDEFGHIJK$(c) Adam Gundry 2015see libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC extensions)None,<=BDpOpOpOpO(C) 2014 I/O Tweagsee libraries/base/LICENSEcvs-ghc@haskell.orginternalnon-portable (GHC Extensions)NoneABT A reference to a value of type a.P:Miscelaneous information available for debugging purposes.Q>Package key of the package where the static pointer is definedR6Name of the module where the static pointer is definedSVAn internal name that is distinct for every static pointer defined in a given module.T>Source location of the definition of the static pointer as a (Line, Column) pair.U2A class for things buildable from static pointers.V A key for  StaticPtrs' that can be serialized and used with Y.WDereferences a static pointer.XThe V' that can be used to look up the given .Y Looks up a  by its V.If the  is not found returns Nothing._This function is unsafe because the program behavior is undefined if the type of the returned ! does not match the expected one.ZP of the given .[A list of all known keys.LPQRSTUVWXYZ[\PQRSTULVWXYZ[WVXYPQRSTZ[UL PQRSTULVWXYZ[\"(c) The University of Glasgow 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafe^The version of a> with which the program was compiled or is being interpreted._5The operating system on which the program is running.`9The machine architecture on which the program is running.aXThe Haskell implementation with which the program was compiled or is being interpreted.^_`a^_`a_`a^^_`aNone!".b Parameters of the runtime systeml-Parameters pertaining to ticky-ticky profilerp&Parameters pertaining to event tracingsshow timestamp in stderr outputttrace scheduler eventsutrace GC eventsv&trace spark events by a sampled methodw"trace spark events 100% accuratelyx-trace user events (emitted from Haskell code)yIs event tracing enabled?z no tracing{$send tracing events to the event log|send tracing events to stderr}&Parameters of the cost-center profilertime between samplesticks between samples (derived),What sort of heap profile are we collecting?2Parameters pertaining to the cost-center profiler.-Should the RTS produce a cost-center summary?JFlags to control debugging output & extra checking in various subsystems.siwGgbStpl the object linkeramz# stack squeezing & lazy blackholingc coveragerMiscellaneous parameters:address to ask the OS for memory for the linker, 0 ==> off'Parameters concerning context switching$Parameters of the garbage collector.True  = "compact all the time"Duse "mostly mark-sweep" instead of copying for the oldest generation address to ask the OS for memory^Should we produce a summary of the garbage collector statistics after the program has exited?nat defined in  rts/Types.hTime is defined as a  StgWord64 in  stg/Types.hGRead a NUL terminated string. Return Nothing in case of a NULL pointer.bcdefghijklmnopqrstuvwxyz{|}~     bcdefghijklmnopqrstuvwxyz{|}~bcdefghijk}~yz{|pqrstuvwxlmno&b cdefghijklmnopqrstuvwxyz{|}~     HIJKLMNOPQRSTUVWXYZ[\]^_`NabcdNaefghNOijklmnopNqrNqstuvwxyzu{|}~ NqNq !"""""##$NNNNNNNONNN-NNONNNNNN""""""""""""""""""""""""""NN#####k###NNNNNNNN--NNN/ N N # # ##""""""""""""""""" N!N"N#N$N%N&N'N(N)N*N+N,N-N.N/N0N1N2N3N4N5N6N7N8N9N:N;N<Nq=Nq>Nq?Nq@NqANqBNqCNqDNqENqFNqGNqHNI1J KLMNOPQRSTUVWXYZ[\]^_`abcdefghij'klmnopqrstuvwxyz{| }~445'''''''''G0      !"#$%&'()*+,-./ 0 1 23949D9E95:6:7:8:9:::;:<:=:>:?:@:A:B:C:D:E:F:G:H:I:J:K:L:M:N:O:P:Q:R:S:T:U:V:W:X:Y:Z:[\]^_`abcdefghijklmnopqrstuvwxyz{|}~;;;;;;;;;;;;;;;;;;;;;b;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<Z<<<<<<<<<<<<<<<<<<<<<<=======================%%%%%       D     C !">#>#>$>$>%>&>'>(>)>*>+>,>->.>/>0>1>2*r*3*4*5*6*7*8*9*:*;*<*=*>*?*@*A*B*C*D*E-F-G-H-I-J-K-L-M-N-O-P-Q-R?S?T?U?U?V?7?8?W?X?Y?Z?[?\?]?^?_`abcd#e#F#f#f#g#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#wxyz{|}~////@@AAAAAVADEEEEEE"""""""""""""""" " " " " """"""""""""""""""""""""""" "!"""#"$"%"&"'"(")"*"+","-"."/"0"1"2"3"4"5"6"7"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"]"^"_"`"a"b"c"d"e"f"g"h"i"j"k"l"m"n"o"p"q"r"s"t"u"v"w"x"y"z"{"|"}"~""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""EEFF      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLM N ( L O             P Q ) - + . * , R S X        T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n oFpFqFrFsFtFuFvFwFxFyFzF{F|F}F~FFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII I I I I IIIIIIIIIIIIIIIIIII I!I"I#I$I%I&I'I(I)I*I+I,I-I.I/I0I1I2I3I4I5I6I7I8I9I:I;I<I=I>I?I@IAIBICIDIEIFIGIHIIIJIKILIMINIOIPIQIRISITIUIVIWIXIYIZI[I\I]I^I_I`IaIbIcIdIeIfIgIhIiIjIkIlImInIoIpIqIrIsItIuIvIwIxIyIzI{I|I}I~IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII,,,,,,, , , , , ,,,,,,,,,,,,,,,,,,, ,!"#$%3&'()*+L,L3,-./M0M1M2M3M4M4M5M6M7M8M9M:M;M<M=M>M?M@MAMBMCMDMEMFMGMHMIMJMKMLMMMNMOMPMQMRMSMTMUMVMWNXNSNYNZN[N\N]N^N_N`NaObOcOdOeOfOfOgOhOiOjOkOlOmOnOoOoOpOqO{OrOsOtOuOvPwPxPyzz{|}~SSSSSSSSSSSTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUVVVVVV/WWWWWWWWWWWWWWWXXXXXXXYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZZZZZZ Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z !Z "Z #Z $Z %Z &Z 'Z (Z )Z *Z +Z ,Z -Z .Z /Z 0Z 1Z 2Z 3Z 4Z 5Z 6Z 7Z 8Z 9Z :Z ;Z <Z =Z >Z ?Z @Z AZ BZ CZ DZ EZ FZ GZ HZ IZ JZ KZ LZ MZ NZ OZ PZ QZ RZ SZ TZ UZ VZ WZ XZ YZ ZZ [Z \Z ]Z ^Z _Z `Z aZ bZ cZ dZ eZ fZ gZ hZ iZ jZ kZ lZ mZ nZ oZ pZ q[ r[ s[ t[ u[ v[ w[ x[ y[ z[ {\ |\ }\ ~\ \ \ \ \ \ \ \ ] ] ] ] ] ] ] ] ] ] ] ] ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ _ _ _ _ Q` d d d d d d d d d d d d d d d d d d dd dd ddd d d d d d d d ddd d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e !e "e #e $e %e &e 'e (e )e *e +e ,e -e .e /e 0e 1e 2e 3e 4e 5e 6e 7e 8e 9e :e ;e <e =e >e ?e @e Ae Be Ce De Ee Fe Ge He Ie Je Ke Le Me Ne Oe Pe Qe Re Se Te Ue Ve We Xe Ye Ze [e \e ]e ^e _e `e ae be ce de ee fe ge he ie je ke le me ne oe pe qe re se te ue ve we xe ye ze {e |e }e ~e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e                                                   B B B B?B B%B$B B&B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B C C C C C 2 P |P P P P P P P P P P P P P P P P g   5 5 5 5 5 5 5 5 5 5 5 5 5    3 3 3 3 3 3 3 3 3 h h h h h       ! " # $ % & ' ( ) * + , - . / 0 1 2 3 46 5 6 7 8 95 :4 ; <Q =Q >Q >Q ?Q @Q AQ BQQ CQ DQ EQ FQ GQ HQ IQ JQ KQ LQ MQ NQ OQ PQ QQ RQ SQ TQ UQ VQ WQ XQ YQ Z` [` \` ]`` ^` _`` `` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~        @ @ @ i iqisi i i i i                                                                      !!!!!!!!! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! !   j j j j j j j j j j j j j j j j j j j j j j j j k   l l l l !l "l #l $l %l &l 'l (l )l *m +m ,m -m .m /m 0m 1m 2m 3m 4n 5n 6n 7n 8o 9o :o ;o <b =b >bb ?b @b Ab Bb .b /b 0b 1p Cp Dp E F G H I J K L M N O P Q R S T U Vq Wq Xq|q q Yq Zq [q \q ]q ^q _q `q a( b8 c8 dr er fr gr hr is js ks ks ls ms ns s s os ps qs rs ss ts us vt wt xu yu zv {v |v }v ~v v v v v v v v v v v v R#R R R c c c/w w w w w 6 6 6 x x x x y :::: : :::|||| c< }2} }@} } } } } } ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~           %*                                                                                                        ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                          '       = C f GYg ZD       EEFF                         |@? W> }76 X5 V!"#$%&'()*U+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV/021 3489;: <=WXYZ[\]^_`abcdeefghijklmnopqrstuvwxyz{|}~ S ~ Y*)(' ,- Z"!  $%$      !"#$%&'()*+,-./01234556789:;<=>??@ABCDEFGHI;JKLMNNOPQRSSTUVVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~1NONNNNONONONaNaNONONqNqNONONONONONONONONONONONONONONONONONONONONONNONONONONONONONONNNNONONONONONONONONONONONONONONONONONONONONO NO NO NO NO NONONONONONONON N NNNNONONONONONONONONO NO!NO"NO#NO$NO%NO&NO'NO(NO)NO*NO+NO,NO-NO.NO/NO0NO1NO2NO3NO4NO5NO6NO7NO8NO9NO:NO;NO<NO=NO>NO?NO@NOANOBNOCNODNOENOFNOGNOHNOINOJNOKNOLNOMNONNOONOPNOQNORNOSNOTNOUNOVNOWNOXNOYNOZNO[NO\NO]NO^NO_NO`NOaNObNOcNOdNOeNOfNOgNOhNOiNOjNOkNOlNOmNOnNOoNOpNOqNOrNOsNOtNOuNOvNOwNOxNOyNOzNO{NO|NO}NO~NONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONO NO NO NO NO NONONONONONONONONONONONONONONONONONONO NO!NO"NO#NO$NO%NO&NO'NO(NO)NO*NO+NO,NO-NO.NO/NO0NO1NO2NO3NO4NO5NO6NO7NO8NO9NO:NO;NO<NO=NO>NO?NO@NOANOBNOCNODNOENOFNOGNOHNOINOJNOKNOLNOMNONNOONOPNOQNORNOSNOTNOUNOVNOWNOXNOYNOZNO[NO\NO]NO^NO_NO`NOaNObNOcNOdNOeNOfNOgNOhNOiNOjNOkNOlNOmNOnNOoNOpNOqNOrNOsNOtNOuNOvNOwNOxNOyNOzNO{NO|NO}NO~NONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONO NO NO NO NO NONONONONONONONONONONONONONONONONONONO NO!NO"NO#NO$NO%NO&NO'NO(NO)NO*NO+NO,NO-NO.NO/NO0NO1NO2NO3NO4NO5NO6NO7NO8NO9NO:NO;NO<NO=NO>NO?NO@NOANOBNOCNODNOENOFNOGNOHNOINOJNOKNOLNOMNONNOONOPNOQNORNOSNOTNOUNOVNOWNOXNOYNOZNO[NO\NO]NO^NO_NO`NOaNObNOcNOdNOeNOfNOgNOhNOiNOjNOkNOlNOmNOnNOoNOpNOqNOrNOsNOtNOuNOvNOwNOxNOyNOzNO{NO|NO}NO~NONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONO NO NO NO NO NONONONONONONONONONONONONONONONONONONO NO!NO"NO#NO$NO%NO&NO'NO(NO)NO*NO+NO,NO-NO.NO/NO0NO1NO2NO3NO4NO5NO6NO7NO8NO9NO:NO;NO<NO=NO>NO?NO@NOANOBNOCNODNOENOFNOGNOHNOINOJNOKNOLNOMNONNOONOPNOQNORNOSNOTNOUNOVNOWNOXNOYNOZNO[NO\NO]NO^NO_NO`NOaNObNOcNOdNOeNOfNOgNOhNOiNOjNOkNOlNOmNOnNOoNOpNOqNOrNOsNOtNOuNOvNOwNOxNOyNOzNO{NO|NO}NO~NONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONONO NO NO NO NO NONONONONONONONONONONONONONONONONONONO NO!NO"NO#NO$NO%NO&NO'NO(NO)NO*NO+NO,NO-NO.NO/NO0NO1NO2NO3NO4Nq5Nq6Nq7Nq8Nq9Nq:Nq;Nq<Nq=Nq>Nq?Nq@NqANqBNqCNqDNqENqFNqGNqHNINJKKLMNOPQRSTSUVWXYZ[\ ]^_`abcdefghijklmnopqrstuvwxyz{|}~~}'      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNNOPQRSTUVWXYZ[\]^_`abcdefghijUVklmnopqrstuvwxyz{|}~:  ;; ; ; ; ;;;;<<<<<<<<<<<<<<<<< <!<"<#<<$<%<&<'<(<)<*<+= ,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUUVWXYZ[\]^_`abcd*e*f*g*h*i*j*k*l*m*n*o*p*q*r**s*t*u*v*w*x*y-z#{#{#|#|#}#}#~#~######      !"#$%&'()*+,-./0123456789:;<= D>?@AB CDEFGHCIJKLM"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"]"^"_"`"a"b"c"d"e"f"g"h"i"j"k"l""m""n""o""p""q""r"s"t"u"v"w"x"y"z     {F|}}~~GGIII,,MM     SSS S!S"T#T$TWXXX%X&X'X(X)X*X+X,Y'Y-Y.Y/Y0Y1Y2Z3Z4Z5[6[7[8[9[:\;\<\=\>\?\@]A]B]C]D]E]F]G]H]I]J]K]L]M]N]O^P^Q^R^G^H^S^T^U^V^W^X^Y^Z^[^\_]_^___`_a_b_R_G_H_c_d_e_f_[_M_g_Z__h_idjdkdldmdndodpdqdrdsdtdudvdwdxdydzd{d|d}  e  e ~    f          z                         h       _                                     V V  # _                .   X       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZO[\S]^ _`abcdefghijWgkllmnn  opqqrsstuvwxyzX{|}~zC%PPPPPg%\hhhh           zWXg !"#$% $&' ( 3 4 . 2 / 0 1)*+,-./012345678 ,9:;<= -->?@AB-CD%EFGHIJKLMNOP [  \{}~Qz|RSTUVWXYZ[\]^_#`abcdefghijklmnopqrstuvwxyzQ{Q|Q}Q~QQQQ`````       k     x         HIL@@@@!!!!!!!!!jlmmmvm +n 5no 9obbbbbr erssssssss jssssssssssssuuuuuvvvvvvvvvvvvvvvvw xSxS:::: :R:S:T<<}}}}}}}}}}}>}}}}}        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuB BvBwBwxyz{|}~z{CbaseControl.Exception.BaseGHC.Exts GHC.OldListPreludeForeign.StablePtr System.IO Data.Tuple Data.Bool Data.Function Data.CoerceData.EqData.Ord Control.Monad Data.FunctorControl.Monad.FixControl.Monad.Fail Control.Arrow Data.StringControl.Monad.ZipData.Typeable.Internal Data.DynamicData.Semigroup Data.Monoid GHC.Stack GHC.StaticPtrControl.ApplicativeNumeric Data.Data Text.Read Text.ShowData.Ix Data.FoldableData.Traversable GHC.Generics GHC.TypeLitsGHC.OverloadedLabels Data.CharData.Int Data.Maybe Data.RatioControl.Monad.STData.Type.Equality Data.Word Foreign.Ptr Data.Either Data.KindGHC.Fingerprint.TypeGHC.Char Unsafe.CoerceSystem.IO.UnsafeControl.Concurrent.MVar GHC.Profiling GHC.Stack.CCSSystem.Mem.WeakControl.Monad.ST.Unsafe Data.STRefData.Type.Bool Data.BitsText.ParserCombinators.ReadP Text.Read.LexText.ParserCombinators.ReadPrec Data.ProxyData.Type.CoercionGHC.Fingerprint Data.TypeableSystem.IO.ErrorControl.ExceptionForeign.Marshal.Unsafe Data.IORef GHC.IO.DeviceForeign.StorableData.Functor.ConstForeign.C.TypesForeign.ForeignPtrForeign.ForeignPtr.UnsafeForeign.Concurrent GHC.IO.BufferGHC.IO.BufferedIOGHC.IO.Encoding.TypesGHC.IO.Encoding GHC.IO.Handle System.ExitForeign.Marshal.AllocForeign.Marshal.UtilsForeign.Marshal.ArrayForeign.Marshal.ErrorForeign.Marshal.Pool GHC.ForeignForeign.C.StringForeign.C.ErrorGHC.IO.Encoding.FailureGHC.IO.Encoding.Latin1GHC.IO.Encoding.UTF16GHC.IO.Encoding.UTF32GHC.IO.Encoding.UTF8GHC.IO.Handle.FDGHC.ConcControl.Concurrent System.Mem GHC.Conc.SyncSystem.Posix.Types GHC.EventGHC.EnvironmentGHC.Conc.SignalControl.Category GHC.Stats Data.List Debug.TraceControl.Concurrent.ChanControl.Concurrent.QSemControl.Concurrent.QSemNControl.Monad.IO.ClassData.Bifunctor Data.UniqueGHC.ExecutionStack.InternalGHC.ExecutionStackSystem.CPUTimeSystem.Console.GetOptSystem.Mem.StableNameSystem.TimeoutText.Show.FunctionsControl.Monad.ST.LazyControl.Monad.ST.Lazy.UnsafeData.STRef.LazySystem.Environment Data.Version Data.Complex Data.Fixed Data.VoidNumeric.Natural GHC.Natural Text.PrintfData.List.NonEmptyData.Functor.IdentityData.Functor.ClassesData.Functor.ComposeData.Functor.ProductData.Functor.Sum System.Info GHC.RTS.FlagsGHC.Stack.Types callStackGHC.ErrGHC.BasezipWithMaybeIOEitherfromEnumCharGHC.ConsoleHandler GHC.ConstantsGHC.Float.ConversionUtilsGHC.GHCiGHC.IO.Encoding.CodePage GHC.IO.Unsafe hGetContentsGHC.MVarGHC.NumGHC.Float.RealFracMethodsGHC.PArrGHC.Weak GHC.Event.ArrGHC.List genericLength maximumBy minimumBygenericReplicate genericTake genericDropgenericSplitAt genericIndexGHC.ShowRead readsPrectoEnumGHC.EnumGHC.RealGHC.STstToIOGHC.Arr GHC.STRef GHC.UnicodeisLettersortBy GHC.FloatGHC.ReadShow showsPrecisAlpha Data.OldList GHC.IO.IOModeopenFileGHC.WordGHC.Event.ClockGHC.Int GHC.ExceptionGHC.IOControl ExceptionthrowTobracketforkIOWithUnmaskforkIOforkIOUnmasked GHC.IOArray GHC.IORefMVarGHC.PtrStorableInt8Int16Int32Int64Word8Word16Word32Word64 StablePtrfreeHaskellFunPtrtraverseformapMforM sequenceAsequenceHandle mkFileHandlemkHandleFromFDSystem.DirectorygetDirectoryContentsGHC.Pack GHC.StablePtrnullPtr GHC.StorableGHC.ForeignPtrmallocwithForeignPtrForeign.ForeignPtr.Imp mallocArray mallocArray0GHC.IO.Handle.TypeshFlush hLookAheadGHC.IO.Exception killThreadsetAllocationCounterenableAllocationLimit ForeignPtrnewsizeOffree finalizerFreeallocawithForeign.MarshalForeign Foreign.SafeForeign.Marshal.Safe Foreign.CforkOSmaskthrowIOunsafePerformIOGHC.Event.Unique GHC.Event.PSQForeign.ForeignPtr.SafeGHC.Event.ArrayGHC.Event.IntTableSystem.Posix.InternalsGHC.Event.InternalGHC.Event.EPollGHC.Event.KQueuetrycatchfixIOGHC.IO.Encoding.IconvGHC.IO.Handle.InternalsGHC.Event.ControlGHC.Event.ManagerGHC.Event.PollGHC.Event.TimerManagerGHC.Event.Thread GHC.Conc.IO GHC.IO.FDGHC.IO.Handle.TextGHC.TopHandlerMainmainexitWith isEOFError isFullErrorisPermissionErrorliftMfoldMap traverse_ sequenceA_mapM_ sequence_for_forM_ performGCControl.Monad.InstancesData.STRef.StrictgetArgsaddForeignPtrFinalizerhGetBufhPutBuf hWaitForInputControl.Monad.ST.ImpControl.Monad.ST.StrictControl.Monad.ST.SafeControl.Monad.ST.Lazy.ImpControl.Monad.ST.Lazy.Safe!System.Environment.ExecutablePathSystem.Posix.EnvputEnvisDoesNotExistErrorgetEnv IOException GHC.Desugarunfoldr transposeLastFirstcycle absentErroraugment++buildfoldr recSelErrorghc-primGHC.PrimseqirrefutPatErrornoMethodBindingErrornonExhaustiveGuardsError runtimeErrorpatError recConError typeErrorconcatfilterzip newStablePtrprintfstsnd otherwiseassert GHC.Magiclazy breakpointbreakpointCondinlinemap groupWith$coerce fromInteger- fromRationalenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negatefail>>=>>fmapreturnmfixarrfirstapp|||loop fromString fromIntegral realToFrac toInteger toRationalguardmzipIsListfromList fromListNtoListmkPolyTyConAppmkAppTytypeNatTypeReptypeSymbolTypeReptypeRep#toDyn<>memptymappendmconcatemptyCallStack pushCallStack fromStaticPtrjoin<*>pure*>BoundedEnumEqFloating FractionalIntegralMonadDataFunctorNumOrdReal RealFloatRealFracIxTypeableMonadFix MonadFailIsString ApplicativeFoldable TraversableGenericGeneric1Datatype ConstructorSelectorKnownNat KnownSymbolIsLabel SemigroupMonoid GHC.TypesBoolDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerOrderingRatioRational RealWorld~~WordFunPtrTypeTYPE Constraint*★ RuntimeRepVecCountVecElemV1U1Par1Rec1K1M1:+::*::.:RDCSRec0D1C1S1RepRep1URecUAddrUCharUDoubleUFloatUIntUWordNatSymbol+^<=? CmpSymbolCmpNat TypeError Coercible StaticPtr CallStackTypeRepC#D#FalseF#I#NothingJustTrueW#LeftRightLTEQGT StaticPtrInfo FingerprintSrcLocTyConModuleText:<>::$$:ShowTypePrefixIInfixILeftAssociativeRightAssociativeNotAssociative SourceUnpackSourceNoUnpackNoSourceUnpackedness SourceLazy SourceStrictNoSourceStrictness DecidedLazy DecidedStrict DecidedUnpackMetaDataMetaConsMetaSelVecRep PtrRepLiftedPtrRepUnliftedVoidRepIntRepWordRepInt64Rep Word64RepAddrRepFloatRep DoubleRepUnboxedTupleRepVec2Vec4Vec8Vec16Vec32Vec64 Int8ElemRep Int16ElemRep Int32ElemRep Int64ElemRep Word8ElemRep Word16ElemRep Word32ElemRep Word64ElemRep FloatElemRep DoubleElemRepneChareqCharminmax><not||&&<=compare/=isTrue# unsafeCoerce srcLocPackage srcLocModule srcLocFilesrcLocStartLinesrcLocStartCol srcLocEndLine srcLocEndCol HasCallStack getCallStackfromCallSiteListfreezeCallStack SomeExceptionerrorerrorWithoutStackTrace undefinedString MonadPlusmzeromplus Alternativeempty<|>somemany<*<$<**>liftAliftA2liftA3=<<whenliftM2liftM3liftM4liftM5apordidconst.flip$!untilasTypeOfshiftL#shiftRL#iShiftL# iShiftRA# iShiftRL#unsafeDupablePerformIOunsafeInterleaveIO newEmptyMVarnewMVartakeMVarreadMVarputMVar tryTakeMVar tryPutMVar tryReadMVar isEmptyMVarabssignumsubtract stopProfTimerstartProfTimercurrentCallStackWeakmkWeak deRefWeakfinalizecurryuncurryswapmaybeisJust isNothingfromJust fromMaybe maybeToList listToMaybe catMaybesmapMaybeheadunconstaillastinitnulllengthfoldlfoldl'foldl1foldl1'sumproductscanlscanl1scanl'foldr1scanrscanr1maximumminimumiteraterepeat replicate takeWhile dropWhiletakedropsplitAtspanbreakreverseandoranyallelemnotElemlookup concatMap!!zip3zipWith3unzipunzip3showshowListShowSshowsshowChar showString showParen showLitChar intToDigitchrsuccpredminBoundmaxBoundproperFractiontruncateroundceilingfloor/recipquotremdivmodquotRemdivMod% numerator denominator showSignedevenodd^^gcdlcmSTunsafeInterleaveSTfixSTrunSTrangeindexinRange rangeSizeSTRefnewSTRef readSTRef writeSTRefGeneralCategoryUppercaseLetterLowercaseLetterTitlecaseLetterModifierLetter OtherLetterNonSpacingMarkSpacingCombiningMark EnclosingMark DecimalNumber LetterNumber OtherNumberConnectorPunctuationDashPunctuationOpenPunctuationClosePunctuation InitialQuote FinalQuoteOtherPunctuation MathSymbolCurrencySymbolModifierSymbol OtherSymbolSpace LineSeparatorParagraphSeparatorFormat Surrogate PrivateUse NotAssignedgeneralCategoryisAsciiisLatin1 isAsciiLower isAsciiUpperisSpaceisDigit isOctDigit isHexDigit isPunctuationisSymbol isAlphaNum isControlisPrintisUpperisLowertoLowertoUppertoTitle showListWith<$>$>voidfixon&boolNotIf FiniteBits finiteBitSizecountLeadingZeroscountTrailingZerosBits.&..|.xor complementshiftrotatezeroBitsbitsetBitclearBit complementBittestBit bitSizeMaybebitSizeisSignedshiftL unsafeShiftLshiftR unsafeShiftRrotateLrotateRpopCount bitDefaulttestBitDefaultpopCountDefaulttoIntegralSized $fBitsInteger$fFiniteBitsWord $fBitsWord$fFiniteBitsInt $fBitsInt$fFiniteBitsBool $fBitsBool floatRadix floatDigits floatRange decodeFloat encodeFloatexponent significand scaleFloatisNaN isInfiniteisDenormalizedisNegativeZeroisIEEEatan2piexplogsqrt**logBasesincostanasinacosatansinhcoshtanhasinhacoshatanhlog1pexpm1log1pexplog1mexp showFloat floatToDigitsfromRat $fMonadFailIO $fMonadFail[]$fMonadFailMaybeReadPReadSgetlookpfail+++<++gathersatisfychareofstringmunchmunch1choice skipSpacescountbetweenoptionoptionalmany1skipMany skipMany1sepBysepBy1endByendBy1chainrchainlchainr1chainl1manyTill readP_to_S readS_to_P$fMonadPlusReadP$fAlternativeReadP$fMonadFailReadP $fMonadReadP$fApplicativeReadP$fFunctorReadP$fAlternativeP $fMonadFailP$fMonadP $fMonadPlusP$fApplicativeP $fFunctorPNumberLexemePuncIdentEOFnumberToInteger numberToFixednumberToRangedRationalnumberToRationallexexpecthsLex isSymbolCharlexCharreadIntPreadOctPreadDecPreadHexP $fEqNumber $fShowNumber $fEqLexeme $fShowLexemePrecReadPrecminPrecliftstepresetprec readPrec_to_P readP_to_Prec readPrec_to_S readS_to_Prec$fAlternativeReadPrec$fMonadPlusReadPrec$fMonadFailReadPrec$fMonadReadPrec$fApplicativeReadPrec$fFunctorReadPrecreadListreadPrec readListPrec readParenreadListDefaultreadListPrecDefault lexLitChar readLitChar lexDigitslexPparens digitToIntisMarkisNumber isSeparatorDown comparing $fOrdDown$fEqDown $fShowDown $fReadDown dropWhileEnd stripPrefix elemIndex elemIndicesfind findIndex findIndices isPrefixOf isSuffixOf isInfixOfnubnubBydeletedeleteBy\\unionunionBy intersect intersectBy intersperse intercalate partition mapAccumL mapAccumRinsertinsertByzip4zip5zip6zip7zipWith4zipWith5zipWith6zipWith7unzip4unzip5unzip6unzip7deleteFirstsBygroupgroupByinitstails subsequences permutationssortsortOnlinesunlineswordsunwordsKProxyProxy asProxyTypeOf$fMonadPlusProxy $fMonadProxy$fAlternativeProxy$fApplicativeProxy$fFunctorProxy $fMonoidProxy$fBoundedProxy $fIxProxy $fEnumProxy $fReadProxy $fShowProxy $fOrdProxy $fEqProxy TestEquality testEquality:~:ReflsymtranscastWith gcastWithapplyinnerouter$fTestEqualityk:~: $fBounded:~: $fEnum:~: $fRead:~:$f~kab$fOrd:~: $fShow:~:$fEq:~:eitherleftsrightspartitionEithersisLeftisRight $fMonadEither$fApplicativeEither$fFunctorEither $fEqEither $fOrdEither $fReadEither $fShowEither TestCoercion testCoercionCoercion coerceWithrepr$fTestCoercionkCoercion$fTestCoercionk:~:$fBoundedCoercion$fEnumCoercion$fReadCoercion $fOrdCoercion$fShowCoercion $fEqCoercionIOModeReadMode WriteMode AppendMode ReadWriteMode ErrorMessage SomeSymbolSomeNatnatVal symbolValnatVal' symbolVal' someNatVal someSymbolValsameNat sameSymbol$fReadSomeSymbol$fShowSomeSymbol$fOrdSomeSymbol$fEqSomeSymbol $fReadSomeNat $fShowSomeNat $fOrdSomeNat $fEqSomeNat byteSwap16 byteSwap32uncheckedShiftL64#uncheckedShiftRL64# byteSwap64uncheckedIShiftL64#uncheckedIShiftRA64#readIntreadOctreadDecreadHex readFloat readSignedshowInt showEFloat showFFloat showGFloat showFFloatAlt showGFloatAlt showIntAtBaseshowHexshowOct$fShowFingerprint$fEqFingerprint$fOrdFingerprintfingerprintStringfingerprintFingerprints Typeable7 Typeable6 Typeable5 Typeable4 Typeable3 Typeable2 Typeable1KindRep modulePackage moduleName tyConPackage tyConModule tyConName tyConStringtyConFingerprint mkTyCon3#mkTyCon3rnfTyContypeRepFingerprint mkTyConAppmkFunTy splitTyConAppsplitPolyTyConApp funResultTy typeRepTyCon typeRepArgs typeRepKindstypeReptypeOftypeOf1typeOf2typeOf3typeOf4typeOf5typeOf6typeOf7 showsTypeRep rnfTypeRep $fShowTypeRep $fOrdTypeRep $fEqTypeRepcasteqTgcastgcast1gcast2ArithExceptionOverflow UnderflowLossOfPrecision DivideByZeroDenormalRatioZeroDenominator ErrorCallErrorCallWithLocation toException fromExceptiondisplayExceptionthrow prettySrcLocprettyCallStackDynamicfromDyn fromDynamicdynApplydynApp dynTypeRep$fExceptionDynamic $fShowDynamicIOError userError MaskingStateUnmaskedMaskedInterruptibleMaskedUninterruptibleFilePath unsafeIOToST unsafeSTToIO interruptiblegetMaskingStatemask_uninterruptibleMask_uninterruptibleMaskevaluateunsafeLocalStateIORefnewIORef readIORef writeIORef mkWeakIORef modifyIORef modifyIORef'atomicModifyIORefatomicModifyIORef'atomicWriteIORefcastPtrplusPtralignPtrminusPtr nullFunPtr castFunPtrcastFunPtrToPtrcastPtrToFunPtrMetafrom1to1fromtoselNameselSourceUnpackednessselSourceStrictnessselDecidedStrictnessDecidedStrictnessSourceStrictnessSourceUnpackedness AssociativityFixityIFixityPrefixInfixconName conFixity conIsRecord datatypeName packageName isNewtypeComp1unComp1L1R1unM1unK1unRec1unPar1!$fSingKindDecidedStrictnessKProxy%$fSingIDecidedStrictnessDecidedUnpack%$fSingIDecidedStrictnessDecidedStrict#$fSingIDecidedStrictnessDecidedLazy $fSingKindSourceStrictnessKProxy#$fSingISourceStrictnessSourceStrict!$fSingISourceStrictnessSourceLazy)$fSingISourceStrictnessNoSourceStrictness"$fSingKindSourceUnpackednessKProxy%$fSingISourceUnpackednessSourceUnpack'$fSingISourceUnpackednessSourceNoUnpack-$fSingISourceUnpackednessNoSourceUnpackedness$fSingKindAssociativityKProxy"$fSingIAssociativityNotAssociative$$fSingIAssociativityRightAssociative#$fSingIAssociativityLeftAssociative$fSingKindFixityIKProxy$fSingIFixityIInfixI$fSingIFixityIPrefixI$fSingKindMaybeKProxy$fSingIMaybeJust$fSingIMaybeNothing$fSingKindBoolKProxy$fSingIBoolFalse$fSingIBoolTrue$fSingKindSymbolKProxy$fSingISymbola$fSelectorMetaMetaSel$fConstructorMetaMetaCons$fDatatypeMetaMetaData$fAlternative:.:$fApplicative:.:$fMonadPlus:*: $fMonad:*:$fAlternative:*:$fApplicative:*: $fMonadPlusM1 $fMonadM1$fAlternativeM1$fApplicativeM1$fMonadPlusRec1 $fMonadRec1$fAlternativeRec1$fApplicativeRec1 $fMonadPar1$fApplicativePar1 $fMonadPlusU1 $fMonadU1$fAlternativeU1$fApplicativeU1 $fFunctorU1$fShowU1$fReadU1$fOrdU1$fEqU1$fEqURec $fOrdURec $fShowURec $fFunctorURec $fGenericURec$fGeneric1URec $fEqURec0 $fOrdURec0 $fShowURec0$fFunctorURec0$fGenericURec0$fGeneric1URec0 $fEqURec1 $fOrdURec1 $fShowURec1$fFunctorURec1$fGenericURec1$fGeneric1URec1 $fEqURec2 $fOrdURec2 $fShowURec2$fFunctorURec2$fGenericURec2$fGeneric1URec2 $fEqURec3 $fOrdURec3 $fShowURec3$fFunctorURec3$fGenericURec3$fGeneric1URec3 $fEqURec4 $fOrdURec4$fFunctorURec4$fGenericURec4$fGeneric1URec4$fEqDecidedStrictness$fShowDecidedStrictness$fOrdDecidedStrictness$fReadDecidedStrictness$fEnumDecidedStrictness$fBoundedDecidedStrictness$fIxDecidedStrictness$fGenericDecidedStrictness$fEqSourceStrictness$fShowSourceStrictness$fOrdSourceStrictness$fReadSourceStrictness$fEnumSourceStrictness$fBoundedSourceStrictness$fIxSourceStrictness$fGenericSourceStrictness$fEqSourceUnpackedness$fShowSourceUnpackedness$fOrdSourceUnpackedness$fReadSourceUnpackedness$fEnumSourceUnpackedness$fBoundedSourceUnpackedness$fIxSourceUnpackedness$fGenericSourceUnpackedness$fEqAssociativity$fShowAssociativity$fOrdAssociativity$fReadAssociativity$fEnumAssociativity$fBoundedAssociativity$fIxAssociativity$fGenericAssociativity $fEqFixity $fShowFixity $fOrdFixity $fReadFixity$fGenericFixity$fEq:.:$fOrd:.: $fRead:.: $fShow:.: $fFunctor:.: $fGeneric:.: $fGeneric1:.:$fEq:*:$fOrd:*: $fRead:*: $fShow:*: $fFunctor:*: $fGeneric:*: $fGeneric1:*:$fEq:+:$fOrd:+: $fRead:+: $fShow:+: $fFunctor:+: $fGeneric:+: $fGeneric1:+:$fEqK1$fOrdK1$fReadK1$fShowK1 $fFunctorK1 $fGenericK1 $fGeneric1K1$fEqRec1 $fOrdRec1 $fReadRec1 $fShowRec1 $fFunctorRec1 $fGenericRec1$fGeneric1Rec1$fEqPar1 $fOrdPar1 $fReadPar1 $fShowPar1 $fFunctorPar1 $fGenericPar1$fGeneric1Par1 $fGenericU1 $fGeneric1U1 $fFunctorV1 $fGenericV1 $fGeneric1V1$fEqM1$fOrdM1$fReadM1$fShowM1 $fFunctorM1 $fGenericM1 $fGeneric1M1$fGeneric1(,,,,,,)$fGeneric1(,,,,,)$fGeneric1(,,,,)$fGeneric1(,,,)$fGeneric1(,,) $fGeneric1(,)$fGeneric1Proxy$fGeneric1Either$fGeneric1Maybe $fGeneric1[]$fGeneric(,,,,,,)$fGeneric(,,,,,)$fGeneric(,,,,)$fGeneric(,,,) $fGeneric(,,) $fGeneric(,) $fGeneric()$fGenericProxy$fGenericOrdering $fGenericBool$fGenericEither$fGenericMaybe $fGeneric[]$fShowV1$fReadV1$fOrdV1$fEqV1AltgetAltgetLastgetFirstProduct getProductSumgetSumAnygetAnyAllgetAllEndoappEndoDualgetDual $fMonoidAlt $fMonoidLast $fMonoidFirst$fMonadProduct$fApplicativeProduct$fFunctorProduct$fMonoidProduct $fMonadSum$fApplicativeSum $fFunctorSum $fMonoidSum $fMonoidAny $fMonoidAll $fMonoidEndo $fMonadDual$fApplicativeDual $fFunctorDual $fMonoidDual$fEqDual $fOrdDual $fReadDual $fShowDual $fBoundedDual $fGenericDual$fGeneric1Dual $fGenericEndo$fEqAll$fOrdAll $fReadAll $fShowAll $fBoundedAll $fGenericAll$fEqAny$fOrdAny $fReadAny $fShowAny $fBoundedAny $fGenericAny$fEqSum$fOrdSum $fReadSum $fShowSum $fBoundedSum $fGenericSum $fGeneric1Sum$fNumSum $fEqProduct $fOrdProduct $fReadProduct $fShowProduct$fBoundedProduct$fGenericProduct$fGeneric1Product $fNumProduct $fEqFirst $fOrdFirst $fReadFirst $fShowFirst$fGenericFirst$fGeneric1First$fFunctorFirst$fApplicativeFirst $fMonadFirst$fEqLast $fOrdLast $fReadLast $fShowLast $fGenericLast$fGeneric1Last $fFunctorLast$fApplicativeLast $fMonadLast $fGenericAlt $fGeneric1Alt $fReadAlt $fShowAlt$fEqAlt$fOrdAlt$fNumAlt $fEnumAlt $fMonadAlt$fMonadPlusAlt$fApplicativeAlt$fAlternativeAlt $fFunctorAltfoldfoldr'foldrMfoldlMasummsum $fFoldableU1 $fMonoidMin $fMonoidMax$fFoldableLast$fFoldableFirst$fFoldableProduct $fFoldableSum$fFoldableDual$fFoldableProxy$fFoldableArray $fFoldable(,)$fFoldableEither $fFoldable[]$fFoldableMaybe$fFoldableURec$fFoldableURec0$fFoldableURec1$fFoldableURec2$fFoldableURec3$fFoldableURec4 $fFoldable:.: $fFoldable:*: $fFoldable:+: $fFoldableM1 $fFoldableK1$fFoldableRec1$fFoldablePar1 $fFoldableV1SeekMode AbsoluteSeek RelativeSeek SeekFromEnd IODeviceType DirectoryStream RegularFile RawDeviceIODevicereadyclose isTerminal isSeekableseektellgetSizesetSizesetEchogetEchosetRawdevTypedupdup2RawIOreadreadNonBlockingwritewriteNonBlocking$fEqIODeviceType $fEqSeekMode $fOrdSeekMode $fIxSeekMode$fEnumSeekMode$fReadSeekMode$fShowSeekMode freeStablePtrdeRefStablePtrcastStablePtrToPtrcastPtrToStablePtr alignment peekElemOff pokeElemOff peekByteOff pokeByteOffpeekpoke$fStorableFingerprint$fStorableRatio$fStorableInt64$fStorableInt32$fStorableInt16$fStorableInt8$fStorableWord64$fStorableWord32$fStorableWord16$fStorableWord8$fStorableDouble$fStorableFloat$fStorableStablePtr$fStorableFunPtr $fStorablePtr$fStorableWord $fStorableInt$fStorableChar$fStorableBool $fStorable()ConstgetConst$fApplicativeConst$fFunctorConst$fFoldableConst $fShowConst $fReadConst $fBitsConst$fBoundedConst $fEnumConst $fEqConst$fFiniteBitsConst$fFloatingConst$fFractionalConst$fGenericConst$fGeneric1Const$fIntegralConst $fIxConst $fMonoidConst $fNumConst $fOrdConst $fRealConst$fRealFracConst$fRealFloatConst$fStorableConstCUIntMaxCIntMaxCUIntPtrCIntPtrCJmpBufCFposCFile CSUSeconds CUSecondsCTimeCClock CSigAtomicCWcharCSizeCPtrdiffCDoubleCFloatCULLongCLLongCULongCLongCUIntCIntCUShortCShortCUCharCSCharCChar$fShowCUIntMax$fReadCUIntMax $fShowCIntMax $fReadCIntMax$fShowCUIntPtr$fReadCUIntPtr $fShowCIntPtr $fReadCIntPtr$fShowCSUSeconds$fReadCSUSeconds$fShowCUSeconds$fReadCUSeconds $fShowCTime $fReadCTime $fShowCClock $fReadCClock$fShowCSigAtomic$fReadCSigAtomic $fShowCWchar $fReadCWchar $fShowCSize $fReadCSize$fShowCPtrdiff$fReadCPtrdiff $fShowCDouble $fReadCDouble $fShowCFloat $fReadCFloat $fShowCULLong $fReadCULLong $fShowCLLong $fReadCLLong $fShowCULong $fReadCULong $fShowCLong $fReadCLong $fShowCUInt $fReadCUInt $fShowCInt $fReadCInt $fShowCUShort $fReadCUShort $fShowCShort $fReadCShort $fShowCUChar $fReadCUChar $fShowCSChar $fReadCSChar $fShowCChar $fReadCChar $fEqCChar $fOrdCChar $fNumCChar $fEnumCChar$fStorableCChar $fRealCChar$fBoundedCChar$fIntegralCChar $fBitsCChar$fFiniteBitsCChar $fEqCSChar $fOrdCSChar $fNumCSChar $fEnumCSChar$fStorableCSChar $fRealCSChar$fBoundedCSChar$fIntegralCSChar $fBitsCSChar$fFiniteBitsCSChar $fEqCUChar $fOrdCUChar $fNumCUChar $fEnumCUChar$fStorableCUChar $fRealCUChar$fBoundedCUChar$fIntegralCUChar $fBitsCUChar$fFiniteBitsCUChar $fEqCShort $fOrdCShort $fNumCShort $fEnumCShort$fStorableCShort $fRealCShort$fBoundedCShort$fIntegralCShort $fBitsCShort$fFiniteBitsCShort $fEqCUShort $fOrdCUShort $fNumCUShort $fEnumCUShort$fStorableCUShort $fRealCUShort$fBoundedCUShort$fIntegralCUShort $fBitsCUShort$fFiniteBitsCUShort$fEqCInt $fOrdCInt $fNumCInt $fEnumCInt$fStorableCInt $fRealCInt $fBoundedCInt$fIntegralCInt $fBitsCInt$fFiniteBitsCInt $fEqCUInt $fOrdCUInt $fNumCUInt $fEnumCUInt$fStorableCUInt $fRealCUInt$fBoundedCUInt$fIntegralCUInt $fBitsCUInt$fFiniteBitsCUInt $fEqCLong $fOrdCLong $fNumCLong $fEnumCLong$fStorableCLong $fRealCLong$fBoundedCLong$fIntegralCLong $fBitsCLong$fFiniteBitsCLong $fEqCULong $fOrdCULong $fNumCULong $fEnumCULong$fStorableCULong $fRealCULong$fBoundedCULong$fIntegralCULong $fBitsCULong$fFiniteBitsCULong $fEqCLLong $fOrdCLLong $fNumCLLong $fEnumCLLong$fStorableCLLong $fRealCLLong$fBoundedCLLong$fIntegralCLLong $fBitsCLLong$fFiniteBitsCLLong $fEqCULLong $fOrdCULLong $fNumCULLong $fEnumCULLong$fStorableCULLong $fRealCULLong$fBoundedCULLong$fIntegralCULLong $fBitsCULLong$fFiniteBitsCULLong $fEqCFloat $fOrdCFloat $fNumCFloat $fEnumCFloat$fStorableCFloat $fRealCFloat$fFractionalCFloat$fFloatingCFloat$fRealFracCFloat$fRealFloatCFloat $fEqCDouble $fOrdCDouble $fNumCDouble $fEnumCDouble$fStorableCDouble $fRealCDouble$fFractionalCDouble$fFloatingCDouble$fRealFracCDouble$fRealFloatCDouble $fEqCPtrdiff $fOrdCPtrdiff $fNumCPtrdiff$fEnumCPtrdiff$fStorableCPtrdiff$fRealCPtrdiff$fBoundedCPtrdiff$fIntegralCPtrdiff$fBitsCPtrdiff$fFiniteBitsCPtrdiff $fEqCSize $fOrdCSize $fNumCSize $fEnumCSize$fStorableCSize $fRealCSize$fBoundedCSize$fIntegralCSize $fBitsCSize$fFiniteBitsCSize $fEqCWchar $fOrdCWchar $fNumCWchar $fEnumCWchar$fStorableCWchar $fRealCWchar$fBoundedCWchar$fIntegralCWchar $fBitsCWchar$fFiniteBitsCWchar$fEqCSigAtomic$fOrdCSigAtomic$fNumCSigAtomic$fEnumCSigAtomic$fStorableCSigAtomic$fRealCSigAtomic$fBoundedCSigAtomic$fIntegralCSigAtomic$fBitsCSigAtomic$fFiniteBitsCSigAtomic $fEqCClock $fOrdCClock $fNumCClock $fEnumCClock$fStorableCClock $fRealCClock $fEqCTime $fOrdCTime $fNumCTime $fEnumCTime$fStorableCTime $fRealCTime $fEqCUSeconds$fOrdCUSeconds$fNumCUSeconds$fEnumCUSeconds$fStorableCUSeconds$fRealCUSeconds$fEqCSUSeconds$fOrdCSUSeconds$fNumCSUSeconds$fEnumCSUSeconds$fStorableCSUSeconds$fRealCSUSeconds $fEqCIntPtr $fOrdCIntPtr $fNumCIntPtr $fEnumCIntPtr$fStorableCIntPtr $fRealCIntPtr$fBoundedCIntPtr$fIntegralCIntPtr $fBitsCIntPtr$fFiniteBitsCIntPtr $fEqCUIntPtr $fOrdCUIntPtr $fNumCUIntPtr$fEnumCUIntPtr$fStorableCUIntPtr$fRealCUIntPtr$fBoundedCUIntPtr$fIntegralCUIntPtr$fBitsCUIntPtr$fFiniteBitsCUIntPtr $fEqCIntMax $fOrdCIntMax $fNumCIntMax $fEnumCIntMax$fStorableCIntMax $fRealCIntMax$fBoundedCIntMax$fIntegralCIntMax $fBitsCIntMax$fFiniteBitsCIntMax $fEqCUIntMax $fOrdCUIntMax $fNumCUIntMax$fEnumCUIntMax$fStorableCUIntMax$fRealCUIntMax$fBoundedCUIntMax$fIntegralCUIntMax$fBitsCUIntMax$fFiniteBitsCUIntMaxIntPtrWordPtr ptrToWordPtr wordPtrToPtr ptrToIntPtr intPtrToPtr $fShowIntPtr $fReadIntPtr $fShowWordPtr $fReadWordPtr $fEqWordPtr $fOrdWordPtr $fNumWordPtr $fEnumWordPtr$fStorableWordPtr $fRealWordPtr$fBoundedWordPtr$fIntegralWordPtr $fBitsWordPtr$fFiniteBitsWordPtr $fEqIntPtr $fOrdIntPtr $fNumIntPtr $fEnumIntPtr$fStorableIntPtr $fRealIntPtr$fBoundedIntPtr$fIntegralIntPtr $fBitsIntPtr$fFiniteBitsIntPtrFinalizerEnvPtr FinalizerPtrmallocForeignPtrmallocForeignPtrBytesaddForeignPtrFinalizerEnvnewForeignPtr_touchForeignPtrunsafeForeignPtrToPtrcastForeignPtrfinalizeForeignPtr newForeignPtrnewForeignPtrEnvmallocForeignPtrArraymallocForeignPtrArray0 BufferState ReadBuffer WriteBuffer CharBufferBufferbufRawbufStatebufSizebufLbufR RawCharBuffer CharBufElem RawBuffer readWord8Buf writeWord8Buf peekCharBuf readCharBuf writeCharBufreadCharBufPtrwriteCharBufPtrcharSize withBuffer withRawBuffer isEmptyBuffer isFullBufferisFullCharBuffer isWriteBuffer bufferElemsbufferAvailable bufferRemove bufferAdjustL bufferAdd emptyBuffer newByteBuffer newCharBuffer newBuffer slideContents summaryBuffer checkBuffer$fEqBufferState BufferedIOfillReadBufferfillReadBuffer0emptyWriteBufferflushWriteBufferflushWriteBuffer0readBufreadBufNonBlockingwriteBufwriteBufNonBlockingCodingProgressInputUnderflowOutputUnderflowInvalidSequence TextEncodingtextEncodingName mkTextDecoder mkTextEncoder TextEncoder TextDecoder EncodeBuffer DecodeBuffer CodeBuffer BufferCodecencoderecovergetStatesetState$fShowTextEncoding$fEqCodingProgress$fShowCodingProgressgetLocaleEncodinggetFileSystemEncodinggetForeignEncoding NewlineModeinputNLoutputNLNewlineLFCRLF BufferMode NoBuffering LineBufferingBlockBuffering nativeNewlineuniversalNewlineModenativeNewlineModenoNewlineTranslation IOErrorTypeExitCode ExitSuccess ExitFailureArrayExceptionIndexOutOfBoundsUndefinedElementAsyncException StackOverflow HeapOverflow ThreadKilled UserInterruptSomeAsyncExceptionAssertionFailedAllocationLimitExceededDeadlockBlockedIndefinitelyOnSTMBlockedIndefinitelyOnMVarasyncExceptionToExceptionasyncExceptionFromExceptionioErrorcalloc mallocBytes callocBytes allocaBytesallocaBytesAlignedrealloc reallocBytesfromBooltoBoolmaybeNew maybeWith maybePeekwithMany copyBytes moveBytes fillBytes callocArray callocArray0 allocaArray allocaArray0 reallocArray reallocArray0 peekArray peekArray0 pokeArray pokeArray0newArray newArray0 withArray withArrayLen withArray0 withArrayLen0 copyArray moveArray lengthArray0 advancePtrthrowIfthrowIf_ throwIfNeg throwIfNeg_ throwIfNullPoolnewPoolfreePoolwithPool pooledMallocpooledMallocBytes pooledReallocpooledReallocBytespooledMallocArraypooledMallocArray0pooledReallocArraypooledReallocArray0 pooledNewpooledNewArraypooledNewArray0 peekCStringpeekCStringLen newCString newCStringLen withCStringwithCStringLencharIsRepresentable CWStringLenCWString CStringLenCStringcastCCharToCharcastCharToCCharcastCUCharToCharcastCharToCUCharcastCSCharToCharcastCharToCSChar peekCAStringpeekCAStringLen newCAStringnewCAStringLen withCAStringwithCAStringLen peekCWStringpeekCWStringLen newCWStringnewCWStringLen withCWStringwithCWStringLenErrnoeOKe2BIGeACCES eADDRINUSE eADDRNOTAVAILeADV eAFNOSUPPORTeAGAINeALREADYeBADFeBADMSGeBADRPCeBUSYeCHILDeCOMM eCONNABORTED eCONNREFUSED eCONNRESETeDEADLK eDESTADDRREQeDIRTYeDOMeDQUOTeEXISTeFAULTeFBIGeFTYPE eHOSTDOWN eHOSTUNREACHeIDRMeILSEQ eINPROGRESSeINTReINVALeIOeISCONNeISDIReLOOPeMFILEeMLINKeMSGSIZE eMULTIHOP eNAMETOOLONGeNETDOWN eNETRESET eNETUNREACHeNFILEeNOBUFSeNODATAeNODEVeNOENTeNOEXECeNOLCKeNOLINKeNOMEMeNOMSGeNONET eNOPROTOOPTeNOSPCeNOSReNOSTReNOSYSeNOTBLKeNOTCONNeNOTDIR eNOTEMPTYeNOTSOCKeNOTSUPeNOTTYeNXIO eOPNOTSUPPePERM ePFNOSUPPORTePIPEePROCLIM ePROCUNAVAIL ePROGMISMATCH ePROGUNAVAILePROTOePROTONOSUPPORT ePROTOTYPEeRANGEeREMCHGeREMOTEeROFS eRPCMISMATCHeRREMOTE eSHUTDOWNeSOCKTNOSUPPORTeSPIPEeSRCHeSRMNTeSTALEeTIME eTIMEDOUT eTOOMANYREFSeTXTBSYeUSERS eWOULDBLOCKeXDEV isValidErrnogetErrno resetErrno throwErrno throwErrnoIf throwErrnoIf_throwErrnoIfRetrythrowErrnoIfRetryMayBlockthrowErrnoIfRetry_throwErrnoIfRetryMayBlock_throwErrnoIfMinus1throwErrnoIfMinus1_throwErrnoIfMinus1RetrythrowErrnoIfMinus1Retry_throwErrnoIfMinus1RetryMayBlock throwErrnoIfMinus1RetryMayBlock_throwErrnoIfNullthrowErrnoIfNullRetrythrowErrnoIfNullRetryMayBlockthrowErrnoPaththrowErrnoPathIfthrowErrnoPathIf_throwErrnoPathIfNullthrowErrnoPathIfMinus1throwErrnoPathIfMinus1_errnoToIOError $fEqErrnoCodingFailureModeErrorOnCodingFailureIgnoreCodingFailureTransliterateCodingFailureRoundtripFailurecodingFailureModeSuffix isSurrogate recoverDecode recoverEncode$fShowCodingFailureModelatin1mkLatin1latin1_checkedmkLatin1_checkedasciimkAscii latin1_decode ascii_decode latin1_encodelatin1_checked_encode ascii_encodeutf16mkUTF16 utf16_encode utf16_decodeutf16be mkUTF16beutf16le mkUTF16leutf16be_decodeutf16le_decodeutf16be_encodeutf16le_encodeutf32mkUTF32 utf32_encode utf32_decodeutf32be mkUTF32beutf32le mkUTF32leutf32be_decodeutf32le_decodeutf32be_encodeutf32le_encodeutf8mkUTF8utf8_bom mkUTF8_bomstdoutTVarSTM ThreadStatus ThreadRunningThreadFinished ThreadBlocked ThreadDied BlockReason BlockedOnMVarBlockedOnBlackHoleBlockedOnException BlockedOnSTMBlockedOnForeignCallBlockedOnOtherThreadIdgetAllocationCounterdisableAllocationLimitforkOnforkOnWithUnmasknumCapabilitiesgetNumCapabilitiessetNumCapabilitiesgetNumProcessors numSparks childHandler myThreadIdyield labelThreadpseqpar runSparks threadStatusthreadCapabilitymkWeakThreadId unsafeIOToSTM atomicallyretryorElsethrowSTMcatchSTMalwaysSucceedsalwaysnewTVar newTVarIO readTVarIOreadTVar writeTVarwithMVar modifyMVar_ sharedCAFreportStackOverflow reportErrorsetUncaughtExceptionHandlergetUncaughtExceptionHandler$fEqTVar$fMonadPlusSTM$fAlternativeSTM $fMonadSTM$fApplicativeSTM $fFunctorSTM $fOrdThreadId $fEqThreadId$fShowThreadId$fEqBlockReason$fOrdBlockReason$fShowBlockReason$fEqThreadStatus$fOrdThreadStatus$fShowThreadStatusLimitProcessGroupID FileOffset ProcessIDFileModeFileIDDeviceID EpochTime ClockTick ByteCountGroupIDUserID LinkCountFdCRLimCTcflagCSpeedCCcCUidCNlinkCGidCSsizeCPidCOffCModeCInoCDev$fShowFd$fReadFd $fShowCRLim $fReadCRLim $fShowCTcflag $fReadCTcflag $fShowCSpeed $fReadCSpeed $fShowCCc $fReadCCc $fShowCUid $fReadCUid $fShowCNlink $fReadCNlink $fShowCGid $fReadCGid $fShowCSsize $fReadCSsize $fShowCPid $fReadCPid $fShowCOff $fReadCOff $fShowCMode $fReadCMode $fShowCIno $fReadCIno $fShowCDev $fReadCDev$fEqCDev $fOrdCDev $fNumCDev $fEnumCDev$fStorableCDev $fRealCDev $fBoundedCDev$fIntegralCDev $fBitsCDev$fFiniteBitsCDev$fEqCIno $fOrdCIno $fNumCIno $fEnumCIno$fStorableCIno $fRealCIno $fBoundedCIno$fIntegralCIno $fBitsCIno$fFiniteBitsCIno $fEqCMode $fOrdCMode $fNumCMode $fEnumCMode$fStorableCMode $fRealCMode$fBoundedCMode$fIntegralCMode $fBitsCMode$fFiniteBitsCMode$fEqCOff $fOrdCOff $fNumCOff $fEnumCOff$fStorableCOff $fRealCOff $fBoundedCOff$fIntegralCOff $fBitsCOff$fFiniteBitsCOff$fEqCPid $fOrdCPid $fNumCPid $fEnumCPid$fStorableCPid $fRealCPid $fBoundedCPid$fIntegralCPid $fBitsCPid$fFiniteBitsCPid $fEqCSsize $fOrdCSsize $fNumCSsize $fEnumCSsize$fStorableCSsize $fRealCSsize$fBoundedCSsize$fIntegralCSsize $fBitsCSsize$fFiniteBitsCSsize$fEqCGid $fOrdCGid $fNumCGid $fEnumCGid$fStorableCGid $fRealCGid $fBoundedCGid$fIntegralCGid $fBitsCGid$fFiniteBitsCGid $fEqCNlink $fOrdCNlink $fNumCNlink $fEnumCNlink$fStorableCNlink $fRealCNlink$fBoundedCNlink$fIntegralCNlink $fBitsCNlink$fFiniteBitsCNlink$fEqCUid $fOrdCUid $fNumCUid $fEnumCUid$fStorableCUid $fRealCUid $fBoundedCUid$fIntegralCUid $fBitsCUid$fFiniteBitsCUid$fEqCCc$fOrdCCc$fNumCCc $fEnumCCc $fStorableCCc $fRealCCc $fEqCSpeed $fOrdCSpeed $fNumCSpeed $fEnumCSpeed$fStorableCSpeed $fRealCSpeed $fEqCTcflag $fOrdCTcflag $fNumCTcflag $fEnumCTcflag$fStorableCTcflag $fRealCTcflag$fBoundedCTcflag$fIntegralCTcflag $fBitsCTcflag$fFiniteBitsCTcflag $fEqCRLim $fOrdCRLim $fNumCRLim $fEnumCRLim$fStorableCRLim $fRealCRLim$fBoundedCRLim$fIntegralCRLim $fBitsCRLim$fFiniteBitsCRLim$fEqFd$fOrdFd$fNumFd$fEnumFd $fStorableFd$fRealFd $fBoundedFd $fIntegralFd$fBitsFd$fFiniteBitsFdLifetimeOneShot MultiShotEventevtReadevtWritereads readEither readMaybeNestedAtomicallyNonTermination NoMethodError RecUpdError RecConError RecSelErrorPatternMatchFail catchJusthandle handleJust mapExceptiontryJust onExceptionfinallybracket_bracketOnErrornonTerminationnestedAtomically$fExceptionNestedAtomically$fShowNestedAtomically$fExceptionNonTermination$fShowNonTermination$fExceptionTypeError$fShowTypeError$fExceptionNoMethodError$fShowNoMethodError$fExceptionRecUpdError$fShowRecUpdError$fExceptionRecConError$fShowRecConError$fExceptionRecSelError$fShowRecSelError$fExceptionPatternMatchFail$fShowPatternMatchFail tryIOError mkIOErrorisAlreadyExistsErrorisAlreadyInUseErrorisIllegalOperation isUserErroralreadyExistsErrorTypedoesNotExistErrorTypealreadyInUseErrorType fullErrorType eofErrorTypeillegalOperationErrorTypepermissionErrorType userErrorTypeisAlreadyExistsErrorTypeisDoesNotExistErrorTypeisAlreadyInUseErrorTypeisFullErrorTypeisEOFErrorTypeisIllegalOperationErrorTypeisPermissionErrorTypeisUserErrorTypeioeGetErrorTypeioeGetErrorStringioeGetLocation ioeGetHandleioeGetFileNameioeSetErrorTypeioeSetErrorStringioeSetLocation ioeSetHandleioeSetFileName modifyIOErrorannotateIOError catchIOErrorHandlercatchesallowInterrupt$fFunctorHandler unsafeFixIOsetLocaleEncodingsetFileSystemEncodingsetForeignEncodinginitLocaleEncodingchar8mkTextEncoding getFullArgsmkDuplexHandle hClose_help CostCentreCostCentreStack getCurrentCCSgetCCSOfclearCCSccsCC ccsParentccLabelccModule ccSrcSpan ccsToStrings whoCreated renderStackerrorWithStackTrace popCallStackwithFrozenCallStackswapMVarwithMVarMasked modifyMVarmodifyMVarMasked_modifyMVarMaskedaddMVarFinalizer mkWeakMVar HandlerFunSignal setHandler runHandlersrunHandlersPtr EventManager IOCallbackFdKeykeyFd registerFd unregisterFd_ unregisterFdcloseFd TimerManagerTimeoutCallback TimeoutKeyregisterTimeoutunregisterTimeout updateTimeoutgetSystemEventManagergetSystemTimerManagerensureIOManagerIsRunningioManagerCapabilitiesChangedthreadWaitReadthreadWaitWritethreadWaitReadSTMthreadWaitWriteSTM closeFdWith threadDelay registerDelayhGetCharhGetLinehPutCharhPutStr hPutStrLnhPutBufNonBlocking hGetBufSomehGetBufNonBlockingHandlePosition HandlePosnhClose hFileSize hSetFileSizehIsEOF hSetBuffering hSetEncoding hGetEncoding hFlushAllhGetPosnhSetPosnhSeekhTellhIsOpen hIsClosed hIsReadable hIsWritable hGetBuffering hIsSeekablehSetEchohGetEchohIsTerminalDevicehSetBinaryModehSetNewlineMode hDuplicate hDuplicateTohShow$fShowHandlePosn$fEqHandlePosnstdinstderrisEOFopenFileBlockingopenBinaryFile fdToHandle' fdToHandleputCharputStrputStrLngetChargetLine getContentsinteractreadFile writeFile appendFilereadLnreadIOlocaleEncodinghReadyhPrintwithFilewithBinaryFile openTempFileopenBinaryTempFile"openTempFileWithDefaultPermissions(openBinaryTempFileWithDefaultPermissions $fMonadFix:*: $fMonadFixM1$fMonadFixRec1$fMonadFixPar1 $fMonadFixAlt$fMonadFixLast$fMonadFixFirst$fMonadFixProduct $fMonadFixSum$fMonadFixDual $fMonadFixST$fMonadFixEither$fMonadFix(->) $fMonadFixIO $fMonadFix[]$fMonadFixMaybe fingerprint0fingerprintData getFileHashCategory<<<>>>$fCategorykCoercion$fCategoryk:~:$fCategoryTYPE(->) ArrowLoop ArrowMonad ArrowApply ArrowChoiceleftright ArrowPlus<+> ArrowZero zeroArrowKleisli runKleisliArrowsecond***&&&returnA^>>>>^<<^^<<leftApp$fArrowLoopKleisli$fArrowLoop(->)$fMonadPlusArrowMonad$fAlternativeArrowMonad$fMonadArrowMonad$fApplicativeArrowMonad$fFunctorArrowMonad$fArrowApplyKleisli$fArrowApply(->)$fArrowChoiceKleisli$fArrowChoice(->)$fArrowPlusKleisli$fArrowZeroKleisli$fArrowKleisli$fCategoryTYPEKleisli $fArrow(->)ZipList getZipList WrappedArrow WrapArrow unwrapArrow WrappedMonad WrapMonad unwrapMonad$fApplicativeZipList$fAlternativeWrappedArrow$fApplicativeWrappedArrow$fFunctorWrappedArrow$fAlternativeWrappedMonad$fApplicativeWrappedMonad$fFunctorWrappedMonad$fGenericWrappedMonad$fGeneric1WrappedMonad$fMonadWrappedMonad$fGenericWrappedArrow$fGeneric1WrappedArrow $fShowZipList $fEqZipList $fOrdZipList $fReadZipList$fFunctorZipList$fFoldableZipList$fGenericZipList$fGeneric1ZipList fmapDefaultfoldMapDefault$fApplicativeId $fFunctorId$fApplicativeStateR$fFunctorStateR$fApplicativeStateL$fFunctorStateL$fTraversableU1$fTraversableZipList$fTraversableLast$fTraversableFirst$fTraversableProduct$fTraversableSum$fTraversableDual$fTraversableConst$fTraversableProxy$fTraversableArray$fTraversable(,)$fTraversableEither$fTraversable[]$fTraversableMaybe$fTraversableURec$fTraversableURec0$fTraversableURec1$fTraversableURec2$fTraversableURec3$fTraversableURec4$fTraversable:.:$fTraversable:*:$fTraversable:+:$fTraversableM1$fTraversableK1$fTraversableRec1$fTraversablePar1$fTraversableV1filterM>=><=<forever mapAndUnzipMzipWithM zipWithM_foldMfoldM_ replicateM replicateM_unless<$!>mfilterGCStatsbytesAllocatednumGcs maxBytesUsednumByteUsageSamplescumulativeBytesUsed bytesCopiedcurrentBytesUsedcurrentBytesSlop maxBytesSloppeakMegabytesAllocatedmutatorCpuSecondsmutatorWallSeconds gcCpuSeconds gcWallSeconds cpuSeconds wallSecondsparTotBytesCopiedparMaxBytesCopiedgetGCStatsEnabled getGCStats $fShowGCStats $fReadGCStatsisSubsequenceOf$fIsStringConst $fIsString[]traceIO putTraceMsgtracetraceId traceShow traceShowIdtraceM traceShowM traceStack traceEvent traceEventIO traceMarker traceMarkerIOChannewChan writeChanreadChandupChan unGetChan isEmptyChangetChanContentswriteList2Chan$fEqChanQSemnewQSemwaitQSem signalQSemQSemNnewQSemN waitQSemN signalQSemNrtsSupportsBoundThreads forkFinallyforkOSWithUnmaskisCurrentThreadBoundrunInBoundThreadrunInUnboundThreadMonadIOliftIO $fMonadIOIOMonadZipmzipWithmunzip $fMonadZip:*: $fMonadZipM1$fMonadZipRec1$fMonadZipPar1 $fMonadZipU1$fMonadZipProxy $fMonadZipAlt$fMonadZipLast$fMonadZipFirst$fMonadZipMaybe$fMonadZipProduct $fMonadZipSum$fMonadZipDual $fMonadZip[] Bifunctorbimap $fBifunctorK1$fBifunctorConst$fBifunctorEither$fBifunctor(,,,,,,)$fBifunctor(,,,,,)$fBifunctor(,,,,)$fBifunctor(,,,)$fBifunctor(,,)$fBifunctor(,)approxRational modifySTRef modifySTRef'Unique newUnique hashUnique $fEqUnique $fOrdUnique StackTraceLocation objectName functionNamesrcLoc sourceFile sourceLine sourceColumn stackDepth stackFramescollectStackTraceinvalidateDebugCacheshowStackFrames getStackTraceshowStackTrace getCPUTimecpuTimePrecisionArgDescrNoArgReqArgOptArgOptDescrOptionArgOrder RequireOrderPermute ReturnInOrder usageInfogetOptgetOpt'$fFunctorArgDescr$fFunctorOptDescr$fFunctorArgOrder exitFailure exitSuccessdieperformMinorGCperformMajorGC StableNamemakeStableNamehashStableName eqStableName$fEqStableName mkWeakPtr addFinalizer mkWeakPairtimeout$fExceptionTimeout $fShowTimeout $fEqTimeout $fShow(->)strictToLazySTlazyToStrictSTgetExecutablePath getProgName lookupEnvsetEnvunsetEnvwithArgs withProgNamegetEnvironmentVersion versionBranch versionTags showVersion parseVersion makeVersion $fOrdVersion $fEqVersion $fReadVersion $fShowVersion$fGenericVersionConIndex ConstrRep AlgConstr IntConstr FloatConstr CharConstrDataRepAlgRepCharRepNoRepConstrDataTypegfoldlgunfoldtoConstr dataTypeOf dataCast1 dataCast2gmapTgmapQlgmapQrgmapQgmapQigmapMgmapMpgmapMo fromConstr fromConstrB fromConstrM dataTypeName dataTypeRep constrType constrRep repConstr mkDataTypemkConstrdataTypeConstrs constrFields constrFixity showConstr readConstr isAlgType indexConstr constrIndexmaxConstrIndex mkIntType mkFloatType mkCharTypemkIntegralConstr mkRealConstr mkCharConstr mkNoRepType isNorepType tyconUQname tyconModule$fDataDecidedStrictness$fDataSourceStrictness$fDataSourceUnpackedness$fDataAssociativity $fDataFixity $fData:*:$fDataV1 $fData:.: $fData:+:$fDataM1$fDataK1 $fDataRec1 $fDataPar1$fDataU1 $fDataAlt $fDataLast $fDataFirst $fDataProduct $fDataSum $fDataAny $fDataAll $fDataDual $fDataVersion$fDataCoercion $fData:~: $fDataProxy $fDataArray$fDataForeignPtr $fDataPtr$fData(,,,,,,) $fData(,,,,,) $fData(,,,,) $fData(,,,) $fData(,,) $fData(,)$fData() $fDataEither$fDataOrdering $fDataMaybe$fData[] $fDataRatio $fDataWord64 $fDataWord32 $fDataWord16 $fDataWord8 $fDataWord $fDataInt64 $fDataInt32 $fDataInt16 $fDataInt8 $fDataInteger $fDataInt $fDataDouble $fDataFloat $fDataChar $fDataBool $fEqConstr $fShowConstr $fEqConstrRep$fShowConstrRep$fShowDataType $fEqDataRep $fShowDataRepComplex:+realPartimagPart conjugatemkPolarcispolar magnitudephase$fMonadComplex$fApplicativeComplex$fStorableComplex$fFloatingComplex$fFractionalComplex $fNumComplex $fEqComplex $fShowComplex $fReadComplex $fDataComplex$fGenericComplex$fGeneric1Complex$fFunctorComplex$fFoldableComplex$fTraversableComplexPicoE12NanoE9MicroE6MilliE3CentiE2DeciE1UniE0 HasResolution resolutionFixedMkFixeddiv'divMod'mod' showFixed$fHasResolutionE12$fHasResolutionE9$fHasResolutionE6$fHasResolutionE3$fHasResolutionE2$fHasResolutionE1$fHasResolutionE0 $fReadFixed $fShowFixed$fRealFracFixed$fFractionalFixed $fRealFixed $fNumFixed $fEnumFixed $fDataFixed $fEqFixed $fOrdFixedVoidabsurdvacuous$fExceptionVoid$fIxVoid $fShowVoid $fReadVoid $fOrdVoid$fEqVoid $fGenericVoid $fDataVoidNaturalNatS#NatJ#isValidNaturalminusNaturalMaybe wordToNaturalnaturalToWordMaybe powModNatural $fDataNatural $fBitsNatural $fIxNatural$fIntegralNatural $fEnumNatural $fRealNatural $fNumNatural $fReadNatural $fShowNatural $fEqNatural $fOrdNaturalModifierParserFieldFormatter FormatParse fpModifiersfpCharfpRest FieldFormatfmtWidth fmtPrecision fmtAdjustfmtSign fmtAlternate fmtModifiersfmtChar FormatSignSignPlus SignSpaceFormatAdjustment LeftAdjustZeroPadIsChartoCharfromChar PrintfArg formatArg parseFormat HPrintfType PrintfTypeprintfhPrintfvFmt formatChar formatString formatInt formatIntegerformatRealFloatperrorerrorBadFormaterrorShortFormaterrorMissingArgumenterrorBadArgument $fIsCharChar$fPrintfArgDouble$fPrintfArgFloat$fPrintfArgNatural$fPrintfArgInteger$fPrintfArgWord64$fPrintfArgWord32$fPrintfArgWord16$fPrintfArgWord8$fPrintfArgWord$fPrintfArgInt64$fPrintfArgInt32$fPrintfArgInt16$fPrintfArgInt8$fPrintfArgInt $fPrintfArg[]$fPrintfArgChar$fHPrintfType(->)$fPrintfType(->)$fHPrintfTypeIO$fPrintfTypeIO$fPrintfType[]ItemSpecConstrAnnotation NoSpecConstrForceSpecConstr maxTupleSizethesortWith$fIsListCallStack$fIsListVersion $fIsList[]$fDataSpecConstrAnnotation$fEqSpecConstrAnnotationNonEmpty:|unfoldnonEmpty<|conssome1 groupAllWithgroup1groupBy1 groupWith1 groupAllWith1$fFoldableNonEmpty$fTraversableNonEmpty$fMonadNonEmpty$fApplicativeNonEmpty$fFunctorNonEmpty$fMonadZipNonEmpty$fMonadFixNonEmpty$fIsListNonEmpty $fEqNonEmpty $fOrdNonEmpty$fShowNonEmpty$fReadNonEmpty$fDataNonEmpty$fGenericNonEmpty$fGeneric1NonEmpty getOption WrappedMonoid WrapMonoid unwrapMonoidArgMaxArgMinArgMaxgetMaxMingetMinsconcatstimescycle1 stimesMonoidstimesIdempotentMonoidstimesIdempotent mtimesDefaultdiff$fSemigroupProxy$fMonoidOption$fSemigroupOption$fTraversableOption$fFoldableOption$fMonadFixOption$fMonadPlusOption$fAlternativeOption $fMonadOption$fApplicativeOption$fFunctorOption$fEnumWrappedMonoid$fBoundedWrappedMonoid$fMonoidWrappedMonoid$fSemigroupWrappedMonoid$fSemigroupLast $fEnumLast $fBoundedLast$fSemigroupFirst $fEnumFirst$fBoundedFirst$fBifunctorArg$fOrdArg$fEqArg$fTraversableArg $fFoldableArg $fFunctorArg$fNumMax $fMonadFixMax $fMonadMax$fApplicativeMax$fTraversableMax $fFoldableMax $fFunctorMax$fSemigroupMax $fEnumMax $fBoundedMax$fNumMin $fMonadFixMin $fMonadMin$fApplicativeMin$fTraversableMin $fFoldableMin $fFunctorMin$fSemigroupMin $fEnumMin $fBoundedMin$fSemigroupNonEmpty$fSemigroupVoid$fSemigroupAlt$fSemigroupLast0$fSemigroupFirst0$fSemigroupConst$fSemigroupProduct$fSemigroupSum$fSemigroupAny$fSemigroupAll$fSemigroupEndo$fSemigroupDual$fSemigroupOrdering$fSemigroup(,,,,)$fSemigroup(,,,)$fSemigroup(,,)$fSemigroup(,)$fSemigroupEither$fSemigroupMaybe $fSemigroup[]$fSemigroup(->) $fSemigroup()$fEqMin$fOrdMin $fShowMin $fReadMin $fDataMin $fGenericMin $fGeneric1Min$fEqMax$fOrdMax $fShowMax $fReadMax $fDataMax $fGenericMax $fGeneric1Max $fShowArg $fReadArg $fDataArg $fGenericArg $fGeneric1Arg$fEqWrappedMonoid$fOrdWrappedMonoid$fShowWrappedMonoid$fReadWrappedMonoid$fDataWrappedMonoid$fGenericWrappedMonoid$fGeneric1WrappedMonoid $fEqOption $fOrdOption $fShowOption $fReadOption $fDataOption$fGenericOption$fGeneric1OptionIdentity runIdentity$fMonadZipIdentity$fMonadFixIdentity$fMonadIdentity$fApplicativeIdentity$fFunctorIdentity$fFoldableIdentity$fShowIdentity$fReadIdentity$fBitsIdentity$fBoundedIdentity$fDataIdentity$fEnumIdentity $fEqIdentity$fFiniteBitsIdentity$fFloatingIdentity$fFractionalIdentity$fGenericIdentity$fGeneric1Identity$fIntegralIdentity$fIsStringIdentity $fIxIdentity$fMonoidIdentity $fNumIdentity $fOrdIdentity$fRealIdentity$fRealFracIdentity$fRealFloatIdentity$fSemigroupIdentity$fStorableIdentity$fTraversableIdentityShow2liftShowsPrec2 liftShowList2Read2liftReadsPrec2 liftReadList2Ord2 liftCompare2Eq2liftEq2Show1 liftShowsPrec liftShowListRead1 liftReadsPrec liftReadListOrd1 liftCompareEq1liftEqeq1compare1 readsPrec1 showsPrec1eq2compare2 readsPrec2 showsPrec2 readsDatareadsUnaryWithreadsBinaryWithshowsUnaryWithshowsBinaryWith readsUnary readsUnary1 readsBinary1 showsUnary showsUnary1 showsBinary1 $fRead1Proxy $fShow1Proxy $fOrd1Proxy $fEq1Proxy $fShow1Const $fRead1Const $fOrd1Const $fEq1Const $fShow2Const $fRead2Const $fOrd2Const $fEq2Const$fShow1Identity$fRead1Identity$fOrd1Identity $fEq1Identity $fShow1Either $fRead1Either $fOrd1Either $fEq1Either $fShow2Either $fRead2Either $fOrd2Either $fEq2Either $fShow1(,) $fRead1(,) $fOrd1(,)$fEq1(,) $fShow2(,) $fRead2(,) $fOrd2(,)$fEq2(,) $fShow1[] $fRead1[]$fOrd1[]$fEq1[] $fShow1Maybe $fRead1Maybe $fOrd1Maybe $fEq1MaybeCompose getCompose$fAlternativeCompose$fApplicativeCompose$fTraversableCompose$fFoldableCompose$fFunctorCompose $fShowCompose $fReadCompose $fOrdCompose $fEqCompose$fShow1Compose$fRead1Compose $fOrd1Compose $fEq1Compose $fDataCompose$fGenericCompose$fGeneric1ComposePair$fMonadPlusProduct$fAlternativeProduct$fShow1Product$fRead1Product $fOrd1Product $fEq1ProductInLInR $fShow1Sum $fRead1Sum $fOrd1Sum$fEq1Sum fromLabel spInfoUnitIdspInfoModuleName spInfoName spInfoSrcLocIsStatic StaticKeydeRefStaticPtr staticKeyunsafeLookupStaticPtr staticPtrInfo staticPtrKeys$fIsStaticStaticPtr$fShowStaticPtrInfocompilerVersionosarch compilerNameRTSFlagsgcFlagsconcurrentFlags miscFlags debugFlagscostCentreFlagsprofilingFlags traceFlags tickyFlags TickyFlagsshowTickyStats tickyFile TraceFlagstracing timestamptraceSchedulertraceGc sparksSampled sparksFulluserDoTrace TraceNone TraceEventLog TraceStderr ProfFlags doHeapProfileheapProfileIntervalheapProfileIntervalTicks includeTSOsshowCCSOnExceptionmaxRetainerSetSize ccsLength modSelector descrSelector typeSelector ccSelector ccsSelectorretainerSelector bioSelector DoHeapProfileNoHeapProfiling HeapByCCS HeapByMod HeapByDescr HeapByTypeHeapByRetainer HeapByLDVHeapByClosureTypeCCFlags doCostCentres profilerTicks msecsPerTick DoCostCentresCostCentresNoneCostCentresSummaryCostCentresVerboseCostCentresAllCostCentresXML DebugFlags scheduler interpreterweakgccafsgc block_allocsanitystableproflinkerstmsqueezehpcsparks MiscFlags tickIntervalinstallSignalHandlersmachineReadable linkerMemBase ConcFlagsctxtSwitchTimectxtSwitchTicksGCFlags statsFile giveStats maxStkSizeinitialStkSize stkChunkSizestkChunkBufferSize maxHeapSizeminAllocAreaSize minOldGenSizeheapSizeSuggestionheapSizeSuggestionAuto oldGenFactor pcFreeHeap generationsstepssqueezeUpdFramescompactcompactThresholdsweepringBell frontpanelidleGCDelayTimedoIdleGCheapBaseallocLimitGrace GiveGCStats NoGCStatsCollectGCStatsOneLineGCStatsSummaryGCStatsVerboseGCStatsRtsNatRtsTime getRTSFlags getGCFlags getConcFlags getMiscFlags getDebugFlags getCCFlags getProfFlags getTraceFlags getTickyFlags $fEnumDoTrace$fEnumDoHeapProfile$fEnumDoCostCentres$fEnumGiveGCStats$fShowGiveGCStats $fShowGCFlags$fShowConcFlags$fShowMiscFlags$fShowDebugFlags$fShowDoCostCentres $fShowCCFlags$fShowDoHeapProfile$fShowProfFlags $fShowDoTrace$fShowTraceFlags$fShowTickyFlags$fShowRTSFlagslocal_idFreezeCallStackEmptyCallStack PushCallStack absentErreqStringgetTag $fMonoidMaybebindIOreturnIOthenIOOpaqueOmapFB unsafeChrminIntmaxIntunIOquotIntremIntdivIntmodInt quotRemInt divModInt divModInt# $fMonadPlusIO$fAlternativeIO $fMonadIO$fApplicativeIO $fFunctorIO $fMonadPlus[]$fAlternative[] $fMonad[]$fApplicative[] $fFunctor[]$fMonadPlusMaybe$fAlternativeMaybe $fMonadMaybe$fApplicativeMaybe$fFunctorMaybe $fFunctor(,) $fMonad(->)$fApplicative(->) $fFunctor(->) $fMonoidIO $fMonad(,)$fApplicative(,)$fMonoidOrdering$fMonoid(,,,,) $fMonoid(,,,) $fMonoid(,,) $fMonoid(,) $fMonoid() $fMonoid(->) $fMonoid[] realWorld# GHC.CStringunpackCStringUtf8#unpackFoldrCString#unpackCString#void# unsafeCoerce# nullAddr#oneShotrunRW# magicDictproxy#IPipAddr#Array# ByteArray#Char#Double#Float#Int#Int32#Int64#Weak# MutableArray#MutableByteArray#MVar# StablePtr# ArrayArray#MutableArrayArray#State# StableName#~#MutVar#Void#Word#Word32#Word64# ThreadId#BCO#TVar#Proxy#SPECSPEC2 SmallArray#SmallMutableArray#Int8X16#Int16X8#Int32X4#Int64X2#Int8X32# Int16X16#Int32X8#Int64X4#Int8X64# Int16X32# Int32X16#Int64X8# Word8X16# Word16X8# Word32X4# Word64X2# Word8X32# Word16X16# Word32X8# Word64X4# Word8X64# Word16X32# Word32X16# Word64X8#FloatX4# DoubleX2#FloatX8# DoubleX4# FloatX16# DoubleX8#TrNameTrNameSTrNameDgtChar#geChar#eqChar#neChar#ltChar#leChar#ord#+#-#*#mulIntMayOflo#quotInt#remInt# quotRemInt#andI#orI#xorI#notI# negateInt#addIntC#subIntC#>#>=#==#/=#<#<=#chr# int2Word# int2Float# int2Double# word2Float# word2Double#uncheckedIShiftL#uncheckedIShiftRA#uncheckedIShiftRL# plusWord# subWordC# plusWord2# minusWord# timesWord# timesWord2# quotWord#remWord# quotRemWord# quotRemWord2#and#or#xor#not#uncheckedShiftL#uncheckedShiftRL# word2Int#gtWord#geWord#eqWord#neWord#ltWord#leWord#popCnt8# popCnt16# popCnt32# popCnt64#popCnt#clz8#clz16#clz32#clz64#clz#ctz8#ctz16#ctz32#ctz64#ctz# byteSwap16# byteSwap32# byteSwap64# byteSwap# narrow8Int# narrow16Int# narrow32Int# narrow8Word# narrow16Word# narrow32Word#>##>=##==##/=##<##<=##+##-##*##/## negateDouble# double2Int# double2Float# expDouble# logDouble# sqrtDouble# sinDouble# cosDouble# tanDouble# asinDouble# acosDouble# atanDouble# sinhDouble# coshDouble# tanhDouble#**##decodeDouble_2Int#decodeDouble_Int64#gtFloat#geFloat#eqFloat#neFloat#ltFloat#leFloat# plusFloat# minusFloat# timesFloat# divideFloat# negateFloat# float2Int# expFloat# logFloat# sqrtFloat# sinFloat# cosFloat# tanFloat# asinFloat# acosFloat# atanFloat# sinhFloat# coshFloat# tanhFloat# powerFloat# float2Double#decodeFloat_Int# newArray#sameMutableArray# readArray# writeArray# sizeofArray#sizeofMutableArray# indexArray#unsafeFreezeArray#unsafeThawArray# copyArray#copyMutableArray# cloneArray#cloneMutableArray# freezeArray# thawArray# casArray#newSmallArray#sameSmallMutableArray#readSmallArray#writeSmallArray#sizeofSmallArray#sizeofSmallMutableArray#indexSmallArray#unsafeFreezeSmallArray#unsafeThawSmallArray#copySmallArray#copySmallMutableArray#cloneSmallArray#cloneSmallMutableArray#freezeSmallArray#thawSmallArray#casSmallArray# newByteArray#newPinnedByteArray#newAlignedPinnedByteArray#byteArrayContents#sameMutableByteArray#shrinkMutableByteArray#resizeMutableByteArray#unsafeFreezeByteArray#sizeofByteArray#sizeofMutableByteArray#getSizeofMutableByteArray#indexCharArray#indexWideCharArray#indexIntArray#indexWordArray#indexAddrArray#indexFloatArray#indexDoubleArray#indexStablePtrArray#indexInt8Array#indexInt16Array#indexInt32Array#indexInt64Array#indexWord8Array#indexWord16Array#indexWord32Array#indexWord64Array#readCharArray#readWideCharArray# readIntArray#readWordArray#readAddrArray#readFloatArray#readDoubleArray#readStablePtrArray#readInt8Array#readInt16Array#readInt32Array#readInt64Array#readWord8Array#readWord16Array#readWord32Array#readWord64Array#writeCharArray#writeWideCharArray#writeIntArray#writeWordArray#writeAddrArray#writeFloatArray#writeDoubleArray#writeStablePtrArray#writeInt8Array#writeInt16Array#writeInt32Array#writeInt64Array#writeWord8Array#writeWord16Array#writeWord32Array#writeWord64Array#copyByteArray#copyMutableByteArray#copyByteArrayToAddr#copyMutableByteArrayToAddr#copyAddrToByteArray# setByteArray#atomicReadIntArray#atomicWriteIntArray# casIntArray#fetchAddIntArray#fetchSubIntArray#fetchAndIntArray#fetchNandIntArray#fetchOrIntArray#fetchXorIntArray#newArrayArray#sameMutableArrayArray#unsafeFreezeArrayArray#sizeofArrayArray#sizeofMutableArrayArray#indexByteArrayArray#indexArrayArrayArray#readByteArrayArray#readMutableByteArrayArray#readArrayArrayArray#readMutableArrayArrayArray#writeByteArrayArray#writeMutableByteArrayArray#writeArrayArrayArray#writeMutableArrayArrayArray#copyArrayArray#copyMutableArrayArray# plusAddr# minusAddr#remAddr# addr2Int# int2Addr#gtAddr#geAddr#eqAddr#neAddr#ltAddr#leAddr#indexCharOffAddr#indexWideCharOffAddr#indexIntOffAddr#indexWordOffAddr#indexAddrOffAddr#indexFloatOffAddr#indexDoubleOffAddr#indexStablePtrOffAddr#indexInt8OffAddr#indexInt16OffAddr#indexInt32OffAddr#indexInt64OffAddr#indexWord8OffAddr#indexWord16OffAddr#indexWord32OffAddr#indexWord64OffAddr#readCharOffAddr#readWideCharOffAddr#readIntOffAddr#readWordOffAddr#readAddrOffAddr#readFloatOffAddr#readDoubleOffAddr#readStablePtrOffAddr#readInt8OffAddr#readInt16OffAddr#readInt32OffAddr#readInt64OffAddr#readWord8OffAddr#readWord16OffAddr#readWord32OffAddr#readWord64OffAddr#writeCharOffAddr#writeWideCharOffAddr#writeIntOffAddr#writeWordOffAddr#writeAddrOffAddr#writeFloatOffAddr#writeDoubleOffAddr#writeStablePtrOffAddr#writeInt8OffAddr#writeInt16OffAddr#writeInt32OffAddr#writeInt64OffAddr#writeWord8OffAddr#writeWord16OffAddr#writeWord32OffAddr#writeWord64OffAddr# newMutVar# readMutVar# writeMutVar# sameMutVar#atomicModifyMutVar# casMutVar#catch#raise#raiseIO#maskAsyncExceptions#maskUninterruptible#unmaskAsyncExceptions#getMaskingState# atomically#retry# catchRetry# catchSTM#check#newTVar# readTVar# readTVarIO# writeTVar# sameTVar#newMVar# takeMVar# tryTakeMVar#putMVar# tryPutMVar# readMVar# tryReadMVar# sameMVar# isEmptyMVar#delay# waitRead# waitWrite#fork#forkOn# killThread#yield# myThreadId# labelThread#isCurrentThreadBound# noDuplicate# threadStatus#mkWeak#mkWeakNoFinalizer#addCFinalizerToWeak# deRefWeak# finalizeWeak#touch#makeStablePtr#deRefStablePtr# eqStablePtr#makeStableName# eqStableName#stableNameToInt#reallyUnsafePtrEquality#par#spark#seq# getSpark# numSparks# dataToTag# tagToEnum# addrToAny# mkApUpd0#newBCO#unpackClosure#getApStackVal# getCCSOf#getCurrentCCS# clearCCS# traceEvent# traceMarker#broadcastInt8X16#broadcastInt16X8#broadcastInt32X4#broadcastInt64X2#broadcastInt8X32#broadcastInt16X16#broadcastInt32X8#broadcastInt64X4#broadcastInt8X64#broadcastInt16X32#broadcastInt32X16#broadcastInt64X8#broadcastWord8X16#broadcastWord16X8#broadcastWord32X4#broadcastWord64X2#broadcastWord8X32#broadcastWord16X16#broadcastWord32X8#broadcastWord64X4#broadcastWord8X64#broadcastWord16X32#broadcastWord32X16#broadcastWord64X8#broadcastFloatX4#broadcastDoubleX2#broadcastFloatX8#broadcastDoubleX4#broadcastFloatX16#broadcastDoubleX8# packInt8X16# packInt16X8# packInt32X4# packInt64X2# packInt8X32# packInt16X16# packInt32X8# packInt64X4# packInt8X64# packInt16X32# packInt32X16# packInt64X8# packWord8X16# packWord16X8# packWord32X4# packWord64X2# packWord8X32#packWord16X16# packWord32X8# packWord64X4# packWord8X64#packWord16X32#packWord32X16# packWord64X8# packFloatX4# packDoubleX2# packFloatX8# packDoubleX4# packFloatX16# packDoubleX8#unpackInt8X16#unpackInt16X8#unpackInt32X4#unpackInt64X2#unpackInt8X32#unpackInt16X16#unpackInt32X8#unpackInt64X4#unpackInt8X64#unpackInt16X32#unpackInt32X16#unpackInt64X8#unpackWord8X16#unpackWord16X8#unpackWord32X4#unpackWord64X2#unpackWord8X32#unpackWord16X16#unpackWord32X8#unpackWord64X4#unpackWord8X64#unpackWord16X32#unpackWord32X16#unpackWord64X8#unpackFloatX4#unpackDoubleX2#unpackFloatX8#unpackDoubleX4#unpackFloatX16#unpackDoubleX8#insertInt8X16#insertInt16X8#insertInt32X4#insertInt64X2#insertInt8X32#insertInt16X16#insertInt32X8#insertInt64X4#insertInt8X64#insertInt16X32#insertInt32X16#insertInt64X8#insertWord8X16#insertWord16X8#insertWord32X4#insertWord64X2#insertWord8X32#insertWord16X16#insertWord32X8#insertWord64X4#insertWord8X64#insertWord16X32#insertWord32X16#insertWord64X8#insertFloatX4#insertDoubleX2#insertFloatX8#insertDoubleX4#insertFloatX16#insertDoubleX8# plusInt8X16# plusInt16X8# plusInt32X4# plusInt64X2# plusInt8X32# plusInt16X16# plusInt32X8# plusInt64X4# plusInt8X64# plusInt16X32# plusInt32X16# plusInt64X8# plusWord8X16# plusWord16X8# plusWord32X4# plusWord64X2# plusWord8X32#plusWord16X16# plusWord32X8# plusWord64X4# plusWord8X64#plusWord16X32#plusWord32X16# plusWord64X8# plusFloatX4# plusDoubleX2# plusFloatX8# plusDoubleX4# plusFloatX16# plusDoubleX8# minusInt8X16# minusInt16X8# minusInt32X4# minusInt64X2# minusInt8X32#minusInt16X16# minusInt32X8# minusInt64X4# minusInt8X64#minusInt16X32#minusInt32X16# minusInt64X8#minusWord8X16#minusWord16X8#minusWord32X4#minusWord64X2#minusWord8X32#minusWord16X16#minusWord32X8#minusWord64X4#minusWord8X64#minusWord16X32#minusWord32X16#minusWord64X8# minusFloatX4#minusDoubleX2# minusFloatX8#minusDoubleX4#minusFloatX16#minusDoubleX8# timesInt8X16# timesInt16X8# timesInt32X4# timesInt64X2# timesInt8X32#timesInt16X16# timesInt32X8# timesInt64X4# timesInt8X64#timesInt16X32#timesInt32X16# timesInt64X8#timesWord8X16#timesWord16X8#timesWord32X4#timesWord64X2#timesWord8X32#timesWord16X16#timesWord32X8#timesWord64X4#timesWord8X64#timesWord16X32#timesWord32X16#timesWord64X8# timesFloatX4#timesDoubleX2# timesFloatX8#timesDoubleX4#timesFloatX16#timesDoubleX8#divideFloatX4#divideDoubleX2#divideFloatX8#divideDoubleX4#divideFloatX16#divideDoubleX8# quotInt8X16# quotInt16X8# quotInt32X4# quotInt64X2# quotInt8X32# quotInt16X16# quotInt32X8# quotInt64X4# quotInt8X64# quotInt16X32# quotInt32X16# quotInt64X8# quotWord8X16# quotWord16X8# quotWord32X4# quotWord64X2# quotWord8X32#quotWord16X16# quotWord32X8# quotWord64X4# quotWord8X64#quotWord16X32#quotWord32X16# quotWord64X8# remInt8X16# remInt16X8# remInt32X4# remInt64X2# remInt8X32# remInt16X16# remInt32X8# remInt64X4# remInt8X64# remInt16X32# remInt32X16# remInt64X8# remWord8X16# remWord16X8# remWord32X4# remWord64X2# remWord8X32# remWord16X16# remWord32X8# remWord64X4# remWord8X64# remWord16X32# remWord32X16# remWord64X8#negateInt8X16#negateInt16X8#negateInt32X4#negateInt64X2#negateInt8X32#negateInt16X16#negateInt32X8#negateInt64X4#negateInt8X64#negateInt16X32#negateInt32X16#negateInt64X8#negateFloatX4#negateDoubleX2#negateFloatX8#negateDoubleX4#negateFloatX16#negateDoubleX8#indexInt8X16Array#indexInt16X8Array#indexInt32X4Array#indexInt64X2Array#indexInt8X32Array#indexInt16X16Array#indexInt32X8Array#indexInt64X4Array#indexInt8X64Array#indexInt16X32Array#indexInt32X16Array#indexInt64X8Array#indexWord8X16Array#indexWord16X8Array#indexWord32X4Array#indexWord64X2Array#indexWord8X32Array#indexWord16X16Array#indexWord32X8Array#indexWord64X4Array#indexWord8X64Array#indexWord16X32Array#indexWord32X16Array#indexWord64X8Array#indexFloatX4Array#indexDoubleX2Array#indexFloatX8Array#indexDoubleX4Array#indexFloatX16Array#indexDoubleX8Array#readInt8X16Array#readInt16X8Array#readInt32X4Array#readInt64X2Array#readInt8X32Array#readInt16X16Array#readInt32X8Array#readInt64X4Array#readInt8X64Array#readInt16X32Array#readInt32X16Array#readInt64X8Array#readWord8X16Array#readWord16X8Array#readWord32X4Array#readWord64X2Array#readWord8X32Array#readWord16X16Array#readWord32X8Array#readWord64X4Array#readWord8X64Array#readWord16X32Array#readWord32X16Array#readWord64X8Array#readFloatX4Array#readDoubleX2Array#readFloatX8Array#readDoubleX4Array#readFloatX16Array#readDoubleX8Array#writeInt8X16Array#writeInt16X8Array#writeInt32X4Array#writeInt64X2Array#writeInt8X32Array#writeInt16X16Array#writeInt32X8Array#writeInt64X4Array#writeInt8X64Array#writeInt16X32Array#writeInt32X16Array#writeInt64X8Array#writeWord8X16Array#writeWord16X8Array#writeWord32X4Array#writeWord64X2Array#writeWord8X32Array#writeWord16X16Array#writeWord32X8Array#writeWord64X4Array#writeWord8X64Array#writeWord16X32Array#writeWord32X16Array#writeWord64X8Array#writeFloatX4Array#writeDoubleX2Array#writeFloatX8Array#writeDoubleX4Array#writeFloatX16Array#writeDoubleX8Array#indexInt8X16OffAddr#indexInt16X8OffAddr#indexInt32X4OffAddr#indexInt64X2OffAddr#indexInt8X32OffAddr#indexInt16X16OffAddr#indexInt32X8OffAddr#indexInt64X4OffAddr#indexInt8X64OffAddr#indexInt16X32OffAddr#indexInt32X16OffAddr#indexInt64X8OffAddr#indexWord8X16OffAddr#indexWord16X8OffAddr#indexWord32X4OffAddr#indexWord64X2OffAddr#indexWord8X32OffAddr#indexWord16X16OffAddr#indexWord32X8OffAddr#indexWord64X4OffAddr#indexWord8X64OffAddr#indexWord16X32OffAddr#indexWord32X16OffAddr#indexWord64X8OffAddr#indexFloatX4OffAddr#indexDoubleX2OffAddr#indexFloatX8OffAddr#indexDoubleX4OffAddr#indexFloatX16OffAddr#indexDoubleX8OffAddr#readInt8X16OffAddr#readInt16X8OffAddr#readInt32X4OffAddr#readInt64X2OffAddr#readInt8X32OffAddr#readInt16X16OffAddr#readInt32X8OffAddr#readInt64X4OffAddr#readInt8X64OffAddr#readInt16X32OffAddr#readInt32X16OffAddr#readInt64X8OffAddr#readWord8X16OffAddr#readWord16X8OffAddr#readWord32X4OffAddr#readWord64X2OffAddr#readWord8X32OffAddr#readWord16X16OffAddr#readWord32X8OffAddr#readWord64X4OffAddr#readWord8X64OffAddr#readWord16X32OffAddr#readWord32X16OffAddr#readWord64X8OffAddr#readFloatX4OffAddr#readDoubleX2OffAddr#readFloatX8OffAddr#readDoubleX4OffAddr#readFloatX16OffAddr#readDoubleX8OffAddr#writeInt8X16OffAddr#writeInt16X8OffAddr#writeInt32X4OffAddr#writeInt64X2OffAddr#writeInt8X32OffAddr#writeInt16X16OffAddr#writeInt32X8OffAddr#writeInt64X4OffAddr#writeInt8X64OffAddr#writeInt16X32OffAddr#writeInt32X16OffAddr#writeInt64X8OffAddr#writeWord8X16OffAddr#writeWord16X8OffAddr#writeWord32X4OffAddr#writeWord64X2OffAddr#writeWord8X32OffAddr#writeWord16X16OffAddr#writeWord32X8OffAddr#writeWord64X4OffAddr#writeWord8X64OffAddr#writeWord16X32OffAddr#writeWord32X16OffAddr#writeWord64X8OffAddr#writeFloatX4OffAddr#writeDoubleX2OffAddr#writeFloatX8OffAddr#writeDoubleX4OffAddr#writeFloatX16OffAddr#writeDoubleX8OffAddr#indexInt8ArrayAsInt8X16#indexInt16ArrayAsInt16X8#indexInt32ArrayAsInt32X4#indexInt64ArrayAsInt64X2#indexInt8ArrayAsInt8X32#indexInt16ArrayAsInt16X16#indexInt32ArrayAsInt32X8#indexInt64ArrayAsInt64X4#indexInt8ArrayAsInt8X64#indexInt16ArrayAsInt16X32#indexInt32ArrayAsInt32X16#indexInt64ArrayAsInt64X8#indexWord8ArrayAsWord8X16#indexWord16ArrayAsWord16X8#indexWord32ArrayAsWord32X4#indexWord64ArrayAsWord64X2#indexWord8ArrayAsWord8X32#indexWord16ArrayAsWord16X16#indexWord32ArrayAsWord32X8#indexWord64ArrayAsWord64X4#indexWord8ArrayAsWord8X64#indexWord16ArrayAsWord16X32#indexWord32ArrayAsWord32X16#indexWord64ArrayAsWord64X8#indexFloatArrayAsFloatX4#indexDoubleArrayAsDoubleX2#indexFloatArrayAsFloatX8#indexDoubleArrayAsDoubleX4#indexFloatArrayAsFloatX16#indexDoubleArrayAsDoubleX8#readInt8ArrayAsInt8X16#readInt16ArrayAsInt16X8#readInt32ArrayAsInt32X4#readInt64ArrayAsInt64X2#readInt8ArrayAsInt8X32#readInt16ArrayAsInt16X16#readInt32ArrayAsInt32X8#readInt64ArrayAsInt64X4#readInt8ArrayAsInt8X64#readInt16ArrayAsInt16X32#readInt32ArrayAsInt32X16#readInt64ArrayAsInt64X8#readWord8ArrayAsWord8X16#readWord16ArrayAsWord16X8#readWord32ArrayAsWord32X4#readWord64ArrayAsWord64X2#readWord8ArrayAsWord8X32#readWord16ArrayAsWord16X16#readWord32ArrayAsWord32X8#readWord64ArrayAsWord64X4#readWord8ArrayAsWord8X64#readWord16ArrayAsWord16X32#readWord32ArrayAsWord32X16#readWord64ArrayAsWord64X8#readFloatArrayAsFloatX4#readDoubleArrayAsDoubleX2#readFloatArrayAsFloatX8#readDoubleArrayAsDoubleX4#readFloatArrayAsFloatX16#readDoubleArrayAsDoubleX8#writeInt8ArrayAsInt8X16#writeInt16ArrayAsInt16X8#writeInt32ArrayAsInt32X4#writeInt64ArrayAsInt64X2#writeInt8ArrayAsInt8X32#writeInt16ArrayAsInt16X16#writeInt32ArrayAsInt32X8#writeInt64ArrayAsInt64X4#writeInt8ArrayAsInt8X64#writeInt16ArrayAsInt16X32#writeInt32ArrayAsInt32X16#writeInt64ArrayAsInt64X8#writeWord8ArrayAsWord8X16#writeWord16ArrayAsWord16X8#writeWord32ArrayAsWord32X4#writeWord64ArrayAsWord64X2#writeWord8ArrayAsWord8X32#writeWord16ArrayAsWord16X16#writeWord32ArrayAsWord32X8#writeWord64ArrayAsWord64X4#writeWord8ArrayAsWord8X64#writeWord16ArrayAsWord16X32#writeWord32ArrayAsWord32X16#writeWord64ArrayAsWord64X8#writeFloatArrayAsFloatX4#writeDoubleArrayAsDoubleX2#writeFloatArrayAsFloatX8#writeDoubleArrayAsDoubleX4#writeFloatArrayAsFloatX16#writeDoubleArrayAsDoubleX8#indexInt8OffAddrAsInt8X16#indexInt16OffAddrAsInt16X8#indexInt32OffAddrAsInt32X4#indexInt64OffAddrAsInt64X2#indexInt8OffAddrAsInt8X32#indexInt16OffAddrAsInt16X16#indexInt32OffAddrAsInt32X8#indexInt64OffAddrAsInt64X4#indexInt8OffAddrAsInt8X64#indexInt16OffAddrAsInt16X32#indexInt32OffAddrAsInt32X16#indexInt64OffAddrAsInt64X8#indexWord8OffAddrAsWord8X16#indexWord16OffAddrAsWord16X8#indexWord32OffAddrAsWord32X4#indexWord64OffAddrAsWord64X2#indexWord8OffAddrAsWord8X32#indexWord16OffAddrAsWord16X16#indexWord32OffAddrAsWord32X8#indexWord64OffAddrAsWord64X4#indexWord8OffAddrAsWord8X64#indexWord16OffAddrAsWord16X32#indexWord32OffAddrAsWord32X16#indexWord64OffAddrAsWord64X8#indexFloatOffAddrAsFloatX4#indexDoubleOffAddrAsDoubleX2#indexFloatOffAddrAsFloatX8#indexDoubleOffAddrAsDoubleX4#indexFloatOffAddrAsFloatX16#indexDoubleOffAddrAsDoubleX8#readInt8OffAddrAsInt8X16#readInt16OffAddrAsInt16X8#readInt32OffAddrAsInt32X4#readInt64OffAddrAsInt64X2#readInt8OffAddrAsInt8X32#readInt16OffAddrAsInt16X16#readInt32OffAddrAsInt32X8#readInt64OffAddrAsInt64X4#readInt8OffAddrAsInt8X64#readInt16OffAddrAsInt16X32#readInt32OffAddrAsInt32X16#readInt64OffAddrAsInt64X8#readWord8OffAddrAsWord8X16#readWord16OffAddrAsWord16X8#readWord32OffAddrAsWord32X4#readWord64OffAddrAsWord64X2#readWord8OffAddrAsWord8X32#readWord16OffAddrAsWord16X16#readWord32OffAddrAsWord32X8#readWord64OffAddrAsWord64X4#readWord8OffAddrAsWord8X64#readWord16OffAddrAsWord16X32#readWord32OffAddrAsWord32X16#readWord64OffAddrAsWord64X8#readFloatOffAddrAsFloatX4#readDoubleOffAddrAsDoubleX2#readFloatOffAddrAsFloatX8#readDoubleOffAddrAsDoubleX4#readFloatOffAddrAsFloatX16#readDoubleOffAddrAsDoubleX8#writeInt8OffAddrAsInt8X16#writeInt16OffAddrAsInt16X8#writeInt32OffAddrAsInt32X4#writeInt64OffAddrAsInt64X2#writeInt8OffAddrAsInt8X32#writeInt16OffAddrAsInt16X16#writeInt32OffAddrAsInt32X8#writeInt64OffAddrAsInt64X4#writeInt8OffAddrAsInt8X64#writeInt16OffAddrAsInt16X32#writeInt32OffAddrAsInt32X16#writeInt64OffAddrAsInt64X8#writeWord8OffAddrAsWord8X16#writeWord16OffAddrAsWord16X8#writeWord32OffAddrAsWord32X4#writeWord64OffAddrAsWord64X2#writeWord8OffAddrAsWord8X32#writeWord16OffAddrAsWord16X16#writeWord32OffAddrAsWord32X8#writeWord64OffAddrAsWord64X4#writeWord8OffAddrAsWord8X64#writeWord16OffAddrAsWord16X32#writeWord32OffAddrAsWord32X16#writeWord64OffAddrAsWord64X8#writeFloatOffAddrAsFloatX4#writeDoubleOffAddrAsDoubleX2#writeFloatOffAddrAsFloatX8#writeDoubleOffAddrAsDoubleX4#writeFloatOffAddrAsFloatX16#writeDoubleOffAddrAsDoubleX8#prefetchByteArray3#prefetchMutableByteArray3#prefetchAddr3#prefetchValue3#prefetchByteArray2#prefetchMutableByteArray2#prefetchAddr2#prefetchValue2#prefetchByteArray1#prefetchMutableByteArray1#prefetchAddr1#prefetchValue1#prefetchByteArray0#prefetchMutableByteArray0#prefetchAddr0#prefetchValue0#modInt#divInt# compareWord# compareWordleWordltWordgeWordgtWord compareInt# compareIntleIntltIntgeIntgtIntneInteqInteqDoubleeqFloatneWordeqWord unpackNBytes#unpackAppendCString#BAelim64#elimZerosInteger elimZerosInt# zeroCounttoByte# zeroCountArr GHCiSandboxIONoIO ghciStepIOnoio$fGHCiSandboxIONoIO $fMonadNoIO$fApplicativeNoIO $fFunctorNoIO$fGHCiSandboxIOIO noDuplicateunsafeDupableInterleaveIO$fEqMVar $fNumInteger $fNumWord$fNumInt mkInteger smallInteger integerToWord integerToInt plusInteger timesInteger minusInteger negateInteger eqInteger# neqInteger# absInteger signumInteger leInteger# gtInteger# ltInteger# geInteger#compareInteger quotInteger remInteger divInteger modInteger divModIntegerquotRemIntegerfloatFromIntegerdoubleFromIntegerencodeFloatIntegerencodeDoubleInteger andInteger orInteger xorIntegercomplementInteger shiftLInteger shiftRInteger wordToIntegerdecodeDoubleIntegertestBitInteger geInteger gtInteger ltInteger leInteger eqInteger neqInteger hashInteger c_rintFloat c_rintDoubleproperFractionFloatInt floorFloatIntceilingFloatInt roundFloatIntproperFractionFloatIntegertruncateFloatIntegerfloorFloatIntegerceilingFloatIntegerroundFloatIntegerproperFractionDoubleIntfloorDoubleIntceilingDoubleIntroundDoubleIntproperFractionDoubleIntegertruncateDoubleIntegerfloorDoubleIntegerceilingDoubleIntegerroundDoubleInteger double2Int int2Double float2Int int2Floatdouble2Integer float2Integer[::]PArrrunFinalizerBatchArrsize mapMaybeFBbadHead lastErrorlenAcclengthFBidLengthfilterFBscanlFB constScanlscanlFB' flipSeqScanl'strictUncurryScanrscanrFB iterateFBrepeatFB takeWhileFB unsafeTake flipSeqTaketakeFBtooLargenegIndexfoldr2 foldr2_leftzipFB zipWithFBerrorEmptyList prel_list_str showLitStringshowMultiLineString showList__appPrecappPrec1showWord show_tuple showSpaceisDec protectEscasciiTab showSignedIntitosintegerToString $fShowInteger$fShow(,,,,,,,,,,,,,,)$fShow(,,,,,,,,,,,,,)$fShow(,,,,,,,,,,,,)$fShow(,,,,,,,,,,,)$fShow(,,,,,,,,,,)$fShow(,,,,,,,,,)$fShow(,,,,,,,,)$fShow(,,,,,,,)$fShow(,,,,,,) $fShow(,,,,,) $fShow(,,,,) $fShow(,,,) $fShow(,,) $fShow(,)$fShowCallStack $fShowModule $fShowTrName $fShowTyCon $fShowWord $fShowInt $fShowChar$fShow[]boundedEnumFromboundedEnumFromThen toEnumError fromEnumError succError predError eftCharFBeftChar efdCharFBefdChar efdtCharFBefdtChar go_up_char_fb go_dn_char_fbgo_up_char_listgo_dn_char_listeftInteftIntFBefdIntefdtInt efdtIntFB efdtIntUp efdtIntUpFB efdtIntDn efdtIntDnFB maxIntWordintegerToWordXwordToIntegerXenumDeltaIntegerFBenumDeltaIntegerenumDeltaToIntegerFBenumDeltaToInteger1FBenumDeltaToIntegerenumDeltaToInteger1up_fbdn_fbup_listdn_list $fEnumInteger $fEnumWord $fBoundedWord $fEnumInt $fBoundedInt $fEnumChar $fBoundedChar$fEnumOrdering$fBoundedOrdering $fEnumBool $fBoundedBool$fBounded(,,,,,,,,,,,,,,)$fBounded(,,,,,,,,,,,,,)$fBounded(,,,,,,,,,,,,)$fBounded(,,,,,,,,,,,)$fBounded(,,,,,,,,,,)$fBounded(,,,,,,,,,)$fBounded(,,,,,,,,)$fBounded(,,,,,,,)$fBounded(,,,,,,)$fBounded(,,,,,)$fBounded(,,,,)$fBounded(,,,) $fBounded(,,) $fBounded(,)$fEnum() $fBounded()reduce:% divZeroErrorratioZeroDenominatorError overflowError ratioPrec ratioPrec1infinity notANumbernumericEnumFromnumericEnumFromThennumericEnumFromTonumericEnumFromThenTo^%^^^%^^gcdInt'gcdWord'integralEnumFromintegralEnumFromThenintegralEnumFromTointegralEnumFromThenTo $fEnumRatio $fShowRatio$fRealFracRatio $fRealRatio$fFractionalRatio $fNumRatio $fOrdRatio$fIntegralInteger $fRealInteger$fIntegralWord $fRealWord $fIntegralInt $fRealIntSTretSTRepliftST$fShowST $fMonadST$fApplicativeST $fFunctorSTSTArrayArray unsafeIndexunsafeRangeSizearraybounds listArray! numElementsindiceselems foldrElems foldlElems foldrElems' foldlElems' foldl1Elems foldr1Elemsassocs accumArray//accumixmap indexErrorhopelessIndexError arrEleBottom unsafeArray unsafeArray'filldone safeRangeSizenegRange safeIndex lessSafeIndex badSafeIndexunsafeAtunsafeAccumArrayunsafeAccumArray'adjust unsafeReplace unsafeAccumamapeqArraycmpArray cmpIntArray newSTArray boundsSTArraynumElementsSTArray readSTArrayunsafeReadSTArray writeSTArrayunsafeWriteSTArray freezeSTArrayunsafeFreezeSTArray thawSTArrayunsafeThawSTArray $fShowArray $fOrdArray $fEqArray$fFunctorArray $fEqSTArray $fIx(,,,,) $fIx(,,,)$fIx(,,)$fIx(,)$fIx() $fIxOrdering$fIxBool $fIxInteger$fIxWord$fIxInt$fIxChar $fEqSTRefwgencattowtitletowuppertowloweriswupperiswloweriswprintiswspaceiswcntrliswalnumiswalpha isBitSubTyperationalToFloatrationalToDoubleFFFormat FFExponentFFFixed FFGeneric expm1Float log1pFloat expm1Double log1pDoubleisDoubleFiniteisDoubleNegativeZeroisDoubleDenormalizedisDoubleInfinite isDoubleNaN isFloatFiniteisFloatNegativeZeroisFloatDenormalizedisFloatInfinite isFloatNaNformatRealFloatAltroundTofromRat'minExptmaxExptexptexpts maxExpt10expts10integerLogBase fromRat'' plusFloat minusFloat timesFloat divideFloat negateFloatgtFloatgeFloatltFloatleFloatexpFloatlogFloat sqrtFloatsinFloatcosFloattanFloat asinFloat acosFloat atanFloat sinhFloat coshFloat tanhFloat powerFloat plusDouble minusDouble timesDouble divideDouble negateDoublegtDoublegeDoubleltDoubleleDouble double2Float float2Double expDouble logDouble sqrtDouble sinDouble cosDouble tanDouble asinDouble acosDouble atanDouble sinhDouble coshDouble tanhDouble powerDouble word2Double word2FloatshowSignedFloatclamp $fEnumDouble $fEnumFloat $fShowDouble$fRealFloatDouble$fRealFracDouble$fFloatingDouble$fFractionalDouble $fRealDouble $fNumDouble $fShowFloat$fRealFloatFloat$fFloatingFloat$fRealFracFloat$fFractionalFloat $fRealFloat $fNumFloatPGetLookFailResultFinalfinalrun isPuncCharDigitsBaseMkNumber MkDecimallexTokenlexEOFlexPunc lexSymbollexIdlexCharE lexString lexNumber lexHexOct lexBaseChar lexDecNumberlexFraclexExp lexIntegerval valSimple valIntegerfracExpvalDig valDecDig readIntP'parenlistchooseexpectP readNumber convertInt convertFracwrap_tup read_comma read_tup2 read_tup4 read_tup8$fRead(,,,,,,,,,,,,,,)$fRead(,,,,,,,,,,,,,)$fRead(,,,,,,,,,,,,)$fRead(,,,,,,,,,,,)$fRead(,,,,,,,,,,)$fRead(,,,,,,,,,)$fRead(,,,,,,,,)$fRead(,,,,,,,)$fRead(,,,,,,) $fRead(,,,,,) $fRead(,,,,) $fRead(,,,) $fRead(,,) $fRead(,)$fRead() $fReadRatio $fReadDouble $fReadFloat $fReadInteger $fReadWord $fReadInt $fReadLexeme $fReadArray$fRead[] $fReadMaybe$fReadOrdering $fReadBool $fReadCharnonEmptySubsequences SnocBuilder dropLengthdropLengthMaybeelem_by prependToAllselect pairWithNil mapAccumLFstrictGenericLengthwordsFB tailUnwords unwordsFBsbemptySBsnocSBtoListSB~Eq15Eq14Eq13Eq12Eq11Eq10Eq9Eq8Eq7Eq6Eq5Eq4Eq3EqMaybeEqListEqUnit EqOrderingEqBoolEqArrowEqStarEqEitherWrapSWrapNSSymbolSNatEqSymbolEqNat symbolSingnatSingwithSNat withSSymbolW8#W64#W32#W16#eqWord8neWord8gtWord8geWord8ltWord8leWord8eqWord16neWord16gtWord16geWord16ltWord16leWord16eqWord32neWord32gtWord32geWord32ltWord32leWord32eqWord64neWord64gtWord64geWord64ltWord64leWord64 $fReadWord64 $fIxWord64$fBoundedWord64 $fRealWord64 $fShowWord64$fFiniteBitsWord64 $fBitsWord64$fIntegralWord64 $fEnumWord64 $fNumWord64 $fOrdWord64 $fEqWord64 $fReadWord32 $fIxWord32$fBoundedWord32 $fRealWord32 $fShowWord32$fFiniteBitsWord32 $fBitsWord32$fIntegralWord32 $fEnumWord32 $fNumWord32 $fOrdWord32 $fEqWord32$fFiniteBitsWord16 $fBitsWord16 $fReadWord16 $fIxWord16$fBoundedWord16$fIntegralWord16 $fEnumWord16 $fRealWord16 $fNumWord16 $fShowWord16 $fOrdWord16 $fEqWord16$fFiniteBitsWord8 $fBitsWord8 $fReadWord8 $fIxWord8$fBoundedWord8$fIntegralWord8 $fEnumWord8 $fRealWord8 $fNumWord8 $fShowWord8 $fOrdWord8 $fEqWord8getMonotonicTimegetMonotonicNSecI64#I32#I16#I8#eqInt8neInt8gtInt8geInt8ltInt8leInt8eqInt16neInt16gtInt16geInt16ltInt16leInt16eqInt32neInt32gtInt32geInt32ltInt32leInt32eqInt64neInt64gtInt64geInt64ltInt64leInt64 $fIxInt64$fBoundedInt64 $fRealInt64$fFiniteBitsInt64 $fBitsInt64 $fReadInt64$fIntegralInt64 $fEnumInt64 $fNumInt64 $fShowInt64 $fOrdInt64 $fEqInt64 $fIxInt32$fBoundedInt32 $fRealInt32$fFiniteBitsInt32 $fBitsInt32 $fReadInt32$fIntegralInt32 $fEnumInt32 $fNumInt32 $fShowInt32 $fOrdInt32 $fEqInt32$fFiniteBitsInt16 $fBitsInt16 $fReadInt16 $fIxInt16$fBoundedInt16$fIntegralInt16 $fEnumInt16 $fRealInt16 $fNumInt16 $fShowInt16 $fOrdInt16 $fEqInt16$fFiniteBitsInt8 $fBitsInt8 $fReadInt8$fIxInt8 $fBoundedInt8$fIntegralInt8 $fEnumInt8 $fRealInt8 $fNumInt8 $fShowInt8 $fOrdInt8$fEqInt8 readFloatP rnfModuletypeLitTypeRep trNameString isTupleTyCon rnfTrName rnfStringtypeRepFingerprintstyConOftcFunshowArgs showTuplemkTypeLitTyConerrorCallWithCallStackExceptionerrorCallExceptiondivZeroExceptionoverflowExceptionratioZeroDenomException showCCSStackprettyCallStackLines$fShowArithException$fExceptionArithException$fShowErrorCall$fExceptionErrorCall$fExceptionSomeException$fShowSomeExceptionObjcatchExceptioncatchAnyfailIOmplusIOioToSTblockunblock unsafeUnmaskblockUninterruptibleIOArray newIOArrayunsafeReadIOArrayunsafeWriteIOArray readIOArray writeIOArray boundsIOArray $fEqIOArray $fEqIORef $fShowFunPtr $fShowPtrSingKind DemoteRepfromSingSingIsingSingD:R:URecWordp0 D:R:URecIntp0D:R:URecFloatp0D:R:URecDoublep0D:R:URecCharp0 D:R:URecPtrp0 SDecidedLazySDecidedStrictSDecidedUnpackSNoSourceStrictness SSourceLazy SSourceStrictSNoSourceUnpackednessSSourceNoUnpack SSourceUnpackSLeftAssociativeSRightAssociativeSNotAssociativeSPrefixSInfixSNothingSJustSTrueSFalseSSymuWord#uInt#uFloat#uDouble#uChar#uAddr#D:R:SingDecidedStrictnessa0D:R:SingSourceStrictnessa0D:R:SingSourceUnpackednessa0D:R:SingAssociativitya0D:R:SingFixityIa0D:R:SingMaybeb0D:R:SingBoola0D:R:SingSymbols0#.ioe_unsupportedOperationMutableByteArray ByteArray unpackCString packCString# packString packStringST packNBytesST new_ps_arraywrite_ps_arrayfreeze_ps_array $fEqStablePtrreadWideCharOffPtr readIntOffPtrreadWordOffPtr readPtrOffPtrreadFunPtrOffPtrreadFloatOffPtrreadDoubleOffPtrreadStablePtrOffPtrreadInt8OffPtrreadWord8OffPtrreadInt16OffPtrreadWord16OffPtrreadInt32OffPtrreadWord32OffPtrreadInt64OffPtrreadWord64OffPtrwriteWideCharOffPtrwriteIntOffPtrwriteWordOffPtrwritePtrOffPtrwriteFunPtrOffPtrwriteFloatOffPtrwriteDoubleOffPtrwriteStablePtrOffPtrwriteInt8OffPtrwriteWord8OffPtrwriteInt16OffPtrwriteWord16OffPtrwriteInt32OffPtrwriteWord32OffPtrwriteInt64OffPtrwriteWord64OffPtrpeekFingerprintpokeFingerprintMyWeaknewConcForeignPtrmallocForeignPtrAlignedBytesmallocPlainForeignPtrmallocPlainForeignPtrBytes!mallocPlainForeignPtrAlignedBytesaddForeignPtrConcFinalizerForeignPtrContentsPlainForeignPtr MallocPtrPlainPtr Finalizers NoFinalizers CFinalizersHaskellFinalizersaddForeignPtrConcFinalizer_insertHaskellFinalizerinsertCFinalizerensureCFinalizerWeak noMixingErrorforeignPtrFinalizertouch$fShowForeignPtr$fOrdForeignPtr$fEqForeignPtrmemmovecheck HandleType ClosedHandleSemiClosedHandle ReadHandle WriteHandle AppendHandleReadWriteHandle BufferList BufferListNilBufferListConsHandle__haDevicehaType haByteBuffer haBufferMode haLastDecode haCharBuffer haBuffers haEncoder haDecoderhaCodec haInputNL haOutputNL haOtherSide FileHandle DuplexHandleisReadableHandleTypeisWritableHandleTypeisReadWriteHandleTypecheckHandleInvariants showHandle $fShowHandle$fShowHandleType $fEqHandle assertErrorunsupportedOperation AlreadyExists NoSuchThing ResourceBusyResourceExhaustedIllegalOperationPermissionDenied UserErrorUnsatisfiedConstraints SystemError ProtocolError OtherErrorInvalidArgumentInappropriateType HardwareFaultUnsupportedOperation TimeExpiredResourceVanished Interrupted ioe_handleioe_type ioe_locationioe_description ioe_errno ioe_filenameblockedIndefinitelyOnMVarblockedIndefinitelyOnSTMallocationLimitExceeded stackOverflow heapOverflow ioExceptionuntangle$fShowIOException$fShowIOErrorType$fEqIOErrorType$fEqIOException$fExceptionIOException$fExceptionExitCode$fShowArrayException$fShowAsyncException$fExceptionArrayException$fExceptionAsyncException$fExceptionSomeAsyncException$fShowSomeAsyncException$fShowAssertionFailed$fExceptionAssertionFailed$fShowAllocationLimitExceeded"$fExceptionAllocationLimitExceeded$fShowDeadlock$fExceptionDeadlock$fShowBlockedIndefinitelyOnSTM#$fExceptionBlockedIndefinitelyOnSTM$fShowBlockedIndefinitelyOnMVar$$fExceptionBlockedIndefinitelyOnMVar_free_realloc_calloc_malloc failWhenNULLmemcpymemset c_DEBUG_DUMP putDebugMsgnUL cCharSizepeekEncodedCStringwithEncodedCStringnewEncodedCStringtryFillBufferAndCall newArrayLenwNULcWcharsToCharscharsToCWcharscastCWcharToCharcastCharToCWcharstrerror set_errno get_errnounrepresentableChar#escapeToRoundtripCharacterSurrogate#unescapeRoundtripCharacterSurrogateioe_decodingErrorioe_encodingError latin1_DF latin1_EFlatin1_checked_EFascii_DFascii_EFsingle_byte_checked_encodeutf16_DFutf16_EFbomBbomLutf16_native_decodeutf16_native_encodebom1bom2 utf16be_DF utf16be_EF utf16le_DF utf16le_EFchr2 validate1 validate2utf32_DFutf32_EFbom0bom3utf32_native_decodeutf32_native_encode utf32be_DF utf32be_EF utf32le_DF utf32le_EFchr4ord4validateutf8_DFutf8_EF utf8_bom_DF utf8_bom_EFutf8_bom_decodeutf8_bom_encode utf8_decode utf8_encodeord2ord3chr3 validate3 validate4checkInv errorBelchcallStackOverflowHookenabled_capabilitiesc_getNumberOfProcessorsc_setNumCapabilities rts_disableThreadAllocationLimitrts_enableThreadAllocationLimitrts_getThreadAllocationCounterrts_setThreadAllocationCounter cmp_thread getThreadIdid2TSO cmpThread real_handlerunSTMbindSTMthenSTM returnSTMuncaughtExceptionHandlerasInt64 UniqueSourceUS newSource $fShowUniquePrioElem singleton toAscList toDescListfindMin deleteMinminViewatMostomegaplay unsafePlaySequTourViewNullSinglePlayLTreeStartLLoserRLoserSizePSQWinnerKeyEkeypriovalue toAscLists toDescLists secondBestatMostssize'maxKeylloserrloserlbalancerbalance lbalanceLeft lbalanceRight rbalanceLeft rbalanceRight lsingleLeft rsingleLeft lsingleRight rsingleRight ldoubleLeft ldoubleRight rdoubleLeft rdoubleRighttourView moduleError emptySequ singleSequ seqToList $fShowSequcopycopy' firstPowerOf2AC allocArray duplicatecapacity unsafeRead unsafeWrite unsafeWrite' unsafeLoadensureCapacityensureCapacity'useAsPtrsnocclearremoveAt insertWithBucketEmpty bucketKey bucketValue bucketNextITtabArrtabSizeIntTablenew_growindexOf updateWith CFilePathFDCUtsnameCUtimbufCTmsCTmCTermiosCStatCSigset CSigactionCPasswdCLconvCGroupCFLocksEEK_ENDsEEK_SETsEEK_CURdEFAULT_BUFFER_SIZE c_s_issockptr_c_cc poke_c_lflagc_lflagsizeof_sigset_tsizeof_termiosconst_fd_cloexec const_f_setfd const_f_setfl const_f_getflconst_sig_setmaskconst_sig_block const_sigttou const_vtime const_vmin const_icanon const_tcsanow const_echost_inost_devst_modest_sizest_mtime sizeof_stat c_s_isfifo c_s_isdir c_s_isblk c_s_ischr c_s_isrego_BINARY o_NONBLOCKo_NOCTTYo_TRUNCo_EXCLo_CREATo_APPENDo_RDWRo_WRONLYo_RDONLY c_waitpid c_tcsetattr c_tcgetattr c_sigprocmask c_sigaddset c_sigemptysetc_mkfifoc_linkc_fork c_fcntl_lock c_fcntl_write c_fcntl_read c_ftruncatec_statc_getpidc_utimec_pipec_unlink c_safe_writec_writec_umask c_safe_readc_readc_isattyc_dup2c_dupc_creatc_closec_chmodc_accessc_lseeklstatc_fstat c_safe_openc_openset_saved_termiosget_saved_termiosputs fdFileSizefileTypefdStatfdType statGetTypeioe_unknownfiletype fdGetMode withFilePath newFilePath peekFilePathpeekFilePathLen setCooked tcSetAttrsetNonBlockingFDsetCloseOnExecs_isregs_ischrs_isblks_isdirs_isfifos_issockBackend_bePoll _beModifyFd_beModifyFdOnceTimeout EventLifetimeevtClose elSupremummodifyFd modifyFdOncethrowErrnoIfMinus1NoRetry$fMonoidLifetime_beState _beDeleteForeverEL evtNothingeventIs evtCombine evtConcat eventLifetime elLifetimeelEventbackendpoll$fMonoidEventLifetime $fMonoidEvent $fShowEvent epollOneShot EventType unEventType ControlOp eventTypeseventFdEPollFd fromEPollFdEPollepollFd epollEventsc_epoll_wait_unsafe c_epoll_wait c_epoll_ctlc_epoll_create available controlOpAddcontrolOpModifycontrolOpDeleteepollInepollOutepollErrepollHup epollCreate epollControl epollControl_ epollWaitepollWaitNonBlock fromEventtoEvent fromTimeout$fStorableEventcatchesHandlermkIconvEncodingIConvc_localeEncodinghs_iconvhs_iconv_close hs_iconv_open iconv_tracelocaleEncodingName haskellChar char_shift iconvEncodingnewIConv iconvDecode iconvEncode iconvRecodeinitFileSystemEncodinginitForeignEncodingmkGlobalmkTextEncoding'unknownEncodingErrgetFullProgArgvrecoveringEncode flushBufferflushCharBufferHandleFinalizer newFileHandle withHandle withHandle' withHandle_ withHandle_'withAllHandles__ withHandle__' do_operationaugmentIOErrorwantWritableHandlewantWritableHandle'checkWritableHandlewantReadableHandlewantReadableHandle_wantReadableHandle'checkReadableHandlewantSeekableHandlecheckSeekableHandleioe_closedHandleioe_semiclosedHandleioe_EOFioe_notReadableioe_notWritableioe_notSeekableioe_cannotFlushNotSeekableioe_finalizedHandle ioe_bufsiz streamEncodehandleFinalizerdEFAULT_CHAR_BUFFER_SIZE getCharBuffer mkUnBufferflushByteWriteBufferwriteCharBufferflushCharReadBufferflushByteReadBuffermkHandleioModeToHandleTypeinitBufferStateopenTextEncodingcloseTextCodecstrymaybehClose_handle_ noCharBuffer noByteBuffer hLookAhead_debugIOreadTextDevicereadTextDevice'readTextDeviceNonBlocking decodeByteBuf'getOrSetGHCConcSignalSignalHandlerStoremaxSigsignal_handlers newControl closeControlW controlReadFdcontrolWriteFdcontrolEventFddidRegisterWakeupFdControlMessage CMsgWakeupCMsgDie CMsgSignalc_setIOManagerWakeupFdc_eventfd_write c_eventfdsizeof_siginfo_t wakeupReadFdio_MANAGER_WAKEUPio_MANAGER_DIEreadControlMessage sendWakeupsendDie sendMessagenewWithshutdownrelease registerFd_ wakeManagercloseFd_ onFdEvent emBackendemFdsemStateemUniqueSource emControlemLockStateCreatedRunningDying ReleasingFinished keyUniqueFdDatafdKeyfdEvents _fdCallbackcallbackArraySizehashFdcallbackTableVar haveOneShothandleControlEventnewDefaultBackendfailOnInvalidFileregisterControlFdfinishedcleanupeventsOf nullToNothingPollFdpfdFd pfdEvents pfdReventsPoll pollChangespollFd c_poll_unsafec_pollreworkFdpollInpollOutpollErrpollHup$fStorablePollFd TimeoutEdit TimeoutQueue emTimeoutsTK editTimeouts ioManagerLock eventManagerc_setTimerManagerControlFdc_setIOManagerControlFdthreaded-getOrSetSystemTimerThreadIOManagerThreadStore*getOrSetSystemTimerThreadEventManagerStore-getOrSetSystemEventThreadIOManagerThreadStore*getOrSetSystemEventThreadEventManagerStore threadWaitblockedOnBadFD threadWaitSTMgetSystemEventManager_numEnabledEventManagers timerManagertimerManagerThreadVarstartIOManagerThreadsshow_intrestartPollLoopstartIOManagerThreadstartTimerManagerThreadmkFDfdFDfdIsNonBlocking unlockFilelockFileunsafe_fdReadyfdReadydEFAULT_FD_BUFFER_SIZEreadBuf' writeBuf' std_flags output_flags read_flags write_flagsrw_flags append_flagsnonblock_flagsgetUniqueFileInfostdFDsetNonBlockingModefdReadfdReadNonBlockingfdWritefdWriteNonBlockingreadRawBufferPtrreadRawBufferPtrNoBlockwriteRawBufferPtrwriteRawBufferPtrNoBlock isNonBlockingthrowErrnoIfMinus1RetryOnBlock$fBufferedIOFD $fIODeviceFD $fRawIOFD$fShowFDhGetLineBufferedhGetLineBufferedLoopmaybeFillReadBufferunpack unpack_nllazyReadlazyReadBufferedgetSomeCharacters hPutcBufferedhPutStr' hPutCharsgetSpareBuffer writeBlocks commitBuffer commitBuffer'hPutBuf'bufWrite writeChunkwriteChunkNonBlockingbufReadNonEmpty bufReadEmptyhaFDbufReadNBEmptybufReadNBNonEmptycopyToRawBuffercopyFromRawBufferillegalBufferSizehClose_maybethrowhClose_rethrowhClose' dupHandle dupHandle_ioe_dupHandlesNotCompatible dupHandleTo showHandle'stdHandleFinalizer setBinaryModeaddFilePathToIOError openFile'dEFAULT_OPEN_IN_BINARY_MODE runMainIOrunIO runIOFastExitrunNonIOshutdownHaskellAndExitshutdownHaskellAndSignalstg_sig_installinstall_interrupt_handler topHandlertopHandlerFastExitdisasterHandlerflushStdHandlessafeExitfastExit unreachable exitHelperexitInterrupted useFastExit useSafeExitOpenNewFileResultNewFileCreated FileExists OpenNewErrorc_rand openTempFile' rand_string openNewFile pathSeparator MD5Context c_MD5Final c_MD5Update c_MD5InitIdgetIdStateR runStateRStateL runStateL getGCStats_ debugBelchChItemsignalforkOS_createThreadforkOS_entry_reimported forkOS_entryfailNonThreaded unsafeResult uniqSourceSessionAddrChunk chunksList peekLocation locationSize showLocation chunkFrames chunkNextchunkFirstFramebacktrace_freelibdw_get_backtracelibdw_lookup_locationlibdw_pool_clearlibdw_pool_releaselibdw_pool_take withSession peekChunkCRUsageclk_tck getrusage realToInteger clockTicksOptKindOptUnreqOptNonOpt EndOfOptsOptErrfmtOptfmtShortfmtLonggetNextlongOptshortOpterrAmbigerrReqerrUnrecerrNoArgS#readSymbolicLink c_readlink getEnvBlock c_setProgArgv c_unsetenvc_putenvc_getenv getProgArgvunpackProgNamebasenameioe_missingEnvVarsetEnv_withArgv withProgArgv freeProgArgv setProgArgvdivvyMpQrQiCONSTID mkPrimTypeconrep constring confields confixitydatatypetycondatarepunMpunQrunCONSTunID mkPrimCon falseConstr trueConstr boolDataTypecharType floatType doubleTypeintType integerTypeint8Type int16Type int32Type int64TypewordType word8Type word16Type word32Type word64Type ratioConstr ratioDataType nilConstr consConstr listDataType nothingConstr justConstr maybeDataTypeltConstreqConstrgtConstrorderingDataType leftConstr rightConstreitherDataType tuple0Constrtuple0DataType tuple2Constrtuple2DataType tuple3Constrtuple3DataType tuple4Constrtuple4DataType tuple5Constrtuple5DataType tuple6Constrtuple6DataType tuple7Constrtuple7DataType proxyConstr proxyDataType reflConstrequalityDataTypecoercionConstrcoercionDataType versionConstrversionDataType dualConstr dualDataType allConstr allDataType anyConstr anyDataType sumConstr sumDataType productConstrproductDataType firstConstr firstDataType lastConstr lastDataType altConstr altDataTypeu1Constr u1DataType par1Constr par1DataType rec1Constr rec1DataTypek1Constr k1DataTypem1Constr m1DataType sum1DataTypel1Constrr1Constr comp1Constr comp1DataType v1DataType prod1DataType prod1Constr prefixConstr infixConstrfixityDataTypeleftAssociativeConstrrightAssociativeConstrnotAssociativeConstrassociativityDataTypenoSourceUnpackednessConstrsourceNoUnpackConstrsourceUnpackConstrsourceUnpackednessDataTypenoSourceStrictnessConstrsourceLazyConstrsourceStrictConstrsourceStrictnessDataTypedecidedLazyConstrdecidedStrictConstrdecidedUnpackConstrdecidedStrictnessDataTypetyFixed conMkFixedwithTypewithResolution chopZerosshowIntegerZeroswithDot convertFixedtoAnnotationWrapperAnnotationWrapper gcdNatural lcmNatural plusNatural timesNatural minusNaturalbigNatToNaturalBigNat nullBigNat intToNaturalenumDeltaNaturalenumDeltaToNaturalenumNegDeltaToNaturalnaturalToBigNat naturalToWord naturalToInt naturalTypeUPrintfhsprsprintModifierMapparseIntFormat fixupModsformatIntegraluprintfuprintfsfmt adjustSignedfmtifmtu integral_precstoi adjustmentgetSpecsgetStardfmt groupByFB readListWith hs_spt_keyshs_spt_key_count hs_spt_lookupcompilerVersionRawpeekCStringOptgetTickyFlagsPtrgetTraceFlagsPtrgetProfFlagsPtr getCcFlagsPtrgetDebugFlagsPtrgetMiscFlagsPtrgetConcFlagsPtr getGcFlagsPtr