qAK      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~          !"#$%&'()*+,-./01234 56789:;<=>?@ABCDEFGHIJ Safe-Inferred)+KLMNOPQRSTUVWXYZ[+ Safe-Inferred GHIJKLMNO ONMLKJIHG  Safe-Inferred\]^_`abcdefghijklm Safe-Inferred 2>Fill a given number of bytes in memory area with a byte value.Since: 4.8.0.0n2 opqrstuvwx22n2None yz{|}pqr~ssrqp  Safe-Inferred=  Safe-Inferred Safe-Inferred(vw'('v Safe-Inferred33 is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator  , which allows 3 to be nested in  .Since: 4.8.0.03 #$%&3333  Safe-Inferred >BC Safe-Inferred4@A+,-  Safe-InferredF4Attempt to convert an & type a to an & 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 9&, 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 9+ for many types. (The implementation uses +, which is itself optimized with rules for base types but may go through 9 for some type pairs.)Since: 4.8.0.0A if the size of a is <= the size of b, where size is measured by  and .4444 Safe-Inferred5Test 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.64Returns the size/length of a finite structure as an 8. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.56%2WXYZ[\]^_`abcdefghijklmno566556 Safe-Inferred  !"#$%&'()*+,-./123456789:;<=>?@ABCDEFSTUVXY[]^_`abcdegijkmnotuwxyz{|}~      !"#$%&'()*+,-./0156``caediXbgwx$!%#& "     {~}yz|+-,  Yomjnk6][5^_TSUVut ' (.*/)011 ut!"#($2onmkj%('&')   *)./*01+,-./3VUTS<56789=4@A>BC:DEF;? Safe-Inferred7Construct tag-less Since: 4.8.0.07777 Safe-Inferred 8Like / but memory is filled with bytes of value zero.9Llike / but memory is filled with bytes of value zero.89 898989 Safe-Inferred:Like :, but allocated memory is filled with bytes of value zero.;Like ;;, but allocated memory is filled with bytes of value zero.:;:;:;:;NoneAopqrstuvwx289:;None8=opqrstuvwx      !"#$%&'()*+,-./01234289:; Safe-Inferred<Write given error message to 5 and terminate with 6.@since 4.8.0.0<7689:;<<< Safe-Inferred=The =& function takes two lists and returns A8 if the first list is a subsequence of the second list.= x y is equivalent to Y x (< y).Since: 4.8.0.0Examples5isSubsequenceOf "GHC" "The Glorious Haskell Compiler"True)isSubsequenceOf ['a','d'..'z'] ['a'..'z']True!isSubsequenceOf [1..10] [10,9..0]False>RSort a list by comparing the results of a key function applied to each element. sortOn f is equivalent to sortBy . comparing f8, 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.Since: 4.8.0.0?HDecompose 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.Since: 4.8.0.0@#A strictly accumulating version of AO(n^2). The A function removes duplicate elements from a list. In particular, it keeps only the first occurrence of each element. (The name A, means `essence'.) It is a special case of BA, which allows the programmer to supply their own equality test.BThe B function behaves just like AO, except it uses a user-supplied equality predicate instead of the overloaded  function.CThe C@ 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 DA, which allows the programmer to supply their own equality test.DThe D+ function is the non-overloaded version of C. =>?@AB=CDt PQWXYZ[\]^_`abcdejklmn>?@AB<CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklm     56=>?@ABCD `caedYWmljnk6]\[ZXAB5b^_CDQP=>?@ =>?@AB=CD Safe-InferredEConditional execution of 1 expressions. For example, !when debug (putStrLn "Debugging")will output the string  Debugging if the Boolean value debug is A, and otherwise do nothing.FF b is   () if b is A, and n if b is @.GThe reverse of E.HThe H function is analogous to m?, except that its result is encapsulated in a monad. Note that HP 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: H is the same as ILike H, but discards the result.JStrict version of .Since: 4.8.0.0EFGHIJ*op'(0RSTfghiqrstuvwxyz{|}~EFGHIJ'0HIRhFTifSgGEJEFGHIJJ Safe-Inferred !"#"$%&'(')*+,-./.01234353637898:.;<=>?@1A1B1C1DEFEG3H3I8JKL1M1NOP.Q8RST1UKV1WXYZ[E\]^_`abacadaeafghiaj1kalamnopaqarnsntauavawxyxzx{x|x}x~xxx_______]]]]]]]]]]]]]]]]]]]]]]]]]EE%%%%%%%%%%%%nnnSSSSSSSSSSKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKcp       111111111111111111 1!3"3#3$3%3&3'()*+X,X-X.X/X0X1X2X3Z4Z5Z6Z7"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"RSTSUSVSW'X'Y.Z.[.\.].^_`abcde8f8g8h8i8j8k8l8m8n8opq rstuvwxyz{|}~SKKK1nnn                          ]]]]]]]]]      !"#$%&'&(&)&*&+&,&-&.&/&0&1&2&3&4&5646768696:6;<=>?>@>A>B<CDEDFGHIJIKILIMINOPOQOROSOTOUOVGWGXGYGZG[G\G]G^G_G`abacadaeafagahaiaj<k<l<m<nDoDpDqDrDsDtDuDvDwxyz{z|z}~EZZZZZZZZZZZZZZZZZbase-compat-0.8.2Prelude.CompatData.Functor.CompatText.Read.CompatControl.Monad.CompatSystem.Environment.CompatData.List.CompatDebug.Trace.CompatControl.Concurrent.MVar.CompatData.Monoid.CompatData.Either.CompatNumeric.CompatData.Word.CompatData.Bits.CompatData.Bool.CompatForeign.Marshal.Utils.CompatData.Function.CompatData.Foldable.CompatData.Version.CompatForeign.Marshal.Alloc.CompatForeign.Marshal.Array.CompatSystem.Exit.CompatForeign.Marshal.CompatForeign.Compat Data.Functor<$>baseGHC.Base++GHC.Errerrorghc-primGHC.PrimseqGHC.Listfilterzip System.IOprint Data.Tuplefstsnd otherwisemap$ undefinedGHC.Num fromInteger-GHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negatefail>>=>>fmapreturn fromIntegral realToFrac toInteger toRationalControl.Applicative<*>pureBoundedEnumEq GHC.FloatFloating FractionalIntegralMonadFunctorNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShow Control.Monad MonadPlus Applicative Data.FoldableFoldableData.Traversable Traversable GHC.TypesBoolCharDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerOrderingRationalIOWord Data.EitherEitherStringFalseTrueLeftRightLTEQGTSystem.EnvironmentgetEnvironment withProgNamewithArgsunsetEnvsetEnv lookupEnvgetEnv getProgNamegetArgs mapAccumR mapAccumLforMsequencemapM sequenceAtraversefindnotElemelem minimumByminimum maximumBymaximumproductsumallanyorand concatMapconcatmsum sequence_forM_mapM_foldl1foldr1foldl'foldlfoldrfoldMap Debug.Trace traceShowMtraceM traceShowIdtraceId<**>$>Prelude$!readIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharControl.Concurrent.MVarwithMVarMaskedGHC.IO.ExceptionioError Data.ListunwordswordsunlineslinesGHC.IOFilePath userErrorIOError Text.Readread readMaybe readEitherreads Data.Monoid<>mconcatmappendmemptyMonoidisRightisLefteitherNumeric showGFloatAlt showFFloatAltGHC.Word byteSwap64 byteSwap32 byteSwap16parenslexPlexreadListPrecDefaultreadListDefault readParen readListPrecreadPrecreadList readsPrecacoshatanhasinhcoshtanhsinhacosatanasincostansinlogBase**logsqrtexppiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadix Text.Read.LexPuncIdentSymbolNumberEOFLexeme Data.BitspopCountDefaulttestBitDefault bitDefaultlcmgcd^^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumpredsucc Data.BoolboolText.ParserCombinators.ReadPReadS showParen showStringshowCharshowsShowSshowListshow showsPrecvoid=<<mplusmzerounzip3unzipzipWith3zipWithzip3!!lookupreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlinitlasttailhead Data.MaybemaybeNothingJustMaybeuncurrycurrysubtractsignumabs*+asTypeOfuntilflip.constid<$/=compare<=&&||not<>maxmin fillBytes&toIntegralSizednulllength makeVersioncalloc callocBytes callocArray callocArray0dieisSubsequenceOfsortOnunconsscanl'nubnubByunionunionBywhenguardunlessfoldMfoldM_<$!>Text.ParserCombinators.ReadPrec readS_to_Prec readPrec_to_S readP_to_Prec readPrec_to_Pchoicepfail<+++++lookgetprecresetstepliftminPrecReadPrecPrecshowOctshowHex showIntAtBase showGFloat showFFloat showEFloatshowInt readSigned readFloatreadHexreadDecreadOctreadInt lexDigitsfromRat floatToDigits showFloat showSignedmemsetForeign.Marshal.Utils moveBytes copyByteswithMany maybePeek maybeWithmaybeNewtoBoolfromBoolwithnew traceMarkerIO traceMarker traceEventIO traceEvent traceStack traceShowtrace putTraceMsgtraceIOWord8Word16Word32Word64getDualDualappEndoEndogetAllAllgetAnyAnygetSumSum getProductProductgetFirstFirstgetLastLast Data.FunctiononfixpartitionEithersrightsleftsBits bitSizeMaybeisSigned isBitSubTypepopCountrotateRrotateL unsafeShiftRshiftR unsafeShiftLshiftLbitSizetestBit complementBitclearBitsetBitbitzeroBitsrotateshift complementxor.|..&. finiteBitSize FiniteBitstoListasum sequenceA_for_ traverse_foldlMfoldrMfoldr'fold Data.VersionVersion parseVersion showVersion versionTags versionBranchForeign.Marshal.Allocmalloc mallocBytes_calloc failWhenNULLfree reallocBytesreallocallocaBytesAligned allocaBytesalloca finalizerFreeForeign.Marshal.Array mallocArray advancePtr lengthArray0 moveArray copyArray withArrayLen0 withArray0 withArrayLen withArray newArray0newArray pokeArray0 pokeArray peekArray0 peekArray reallocArray0 reallocArray allocaArray0 allocaArray mallocArray0Foreign.Marshal.PoolpooledNewArray0pooledNewArray pooledNewpooledReallocArray0pooledReallocArraypooledMallocArray0pooledMallocArraypooledReallocBytes pooledReallocpooledMallocBytes pooledMallocwithPoolfreePoolnewPoolPoolForeign.Marshal.Error throwIfNull throwIfNeg_ throwIfNegthrowIf_throwIf GHC.Stable newStablePtrGHC.IntInt8Int16Int32Int64 StablePtrGHC.PtrPtrFunPtrGHC.ForeignPtr ForeignPtrForeign.ForeignPtr.ImpmallocForeignPtrArray0mallocForeignPtrArraynewForeignPtrEnvwithForeignPtr newForeignPtr Foreign.Ptr intPtrToPtr ptrToIntPtr wordPtrToPtr ptrToWordPtrfreeHaskellFunPtrWordPtrIntPtrfinalizeForeignPtrcastForeignPtrtouchForeignPtrnewForeignPtr_addForeignPtrFinalizerEnvaddForeignPtrFinalizermallocForeignPtrBytesmallocForeignPtr FinalizerPtrFinalizerEnvPtrForeign.Storablepokepeek pokeByteOff peekByteOff pokeElemOff peekElemOff alignmentsizeOfStorablecastPtrToStablePtrcastStablePtrToPtrdeRefStablePtr freeStablePtrcastPtrToFunPtrcastFunPtrToPtr castFunPtr nullFunPtrminusPtralignPtrplusPtrcastPtrnullPtrGHC.IO.Handle.FDstderr System.Exit exitFailure exitSuccessexitWith ExitSuccess ExitFailureExitCode subsequenceselem_byfoldl1'unfoldrsortBysort permutationstailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLengthinsertByinsert partition transpose intercalate intersperse intersectBy intersect\\deleteBydelete isInfixOf isSuffixOf isPrefixOf findIndices findIndex elemIndices elemIndex stripPrefix dropWhileEndemptyliftMjoinmfilterapliftM5liftM4liftM3liftM2 replicateM_ replicateM zipWithM_zipWithM mapAndUnzipMforever<=<>=>filterM mkWeakMVaraddMVarFinalizermodifyMVarMaskedmodifyMVarMasked_ modifyMVar modifyMVar_withMVarswapMVarGHC.MVar isEmptyMVar tryReadMVar tryPutMVar tryTakeMVarputMVarreadMVartakeMVarnewMVar newEmptyMVarMVar