sS|=      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~         !"#$%&'()* + , -./0123456789:;< Safe-Inferred)+=>?@ABCDEFGHIJKLM+ Safe-Inferred GHIJKLMNO ONMLKJIHGNone NOPQRpqrSsTUVsrqp  Safe-InferredWXYZ[\]^_`abcdefghijklmn Safe-Inferred(vw(v  Safe-Inferred** 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  .Since: 4.8.0.0* op****  Safe-Inferred >BCqrs  Safe-Inferred4@A#$%  Safe-Inferred+Test 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.,4Returns 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.+,%2WXYZ[\]^_`abcdetfugvhiwxyzjklm{no|+,,++, Safe-Inferred  !"#$%&'()*+,-./123456789:;<=>?@ABCDEFSTUVXY[]^_`abcdegijkmnotuwxyz{|}~      !"#$%&'()+,``caediXbgwx      {~}yz|#%$  Yomjnk,][+^_TSUVut   &"'!()1 ut!"# $2onmkj%(&')  *!&'"()+,-./3VUTS<56789=4@A>BC:DEF;? Safe-Inferred-Construct tag-less }Since: 4.8.0.0-~}--- Safe-Inferred .Like / but memory is filled with bytes of value zero./Llike / but memory is filled with bytes of value zero../ ./././ Safe-Inferred0Like :, but allocated memory is filled with bytes of value zero.1Like 1;, but allocated memory is filled with bytes of value zero.01010101None@./01None8=     ./01 Safe-Inferred2Write given error message to  and terminate with .@since 4.8.0.02222 Safe-Inferred3The 3& function takes two lists and returns A8 if the first list is a subsequence of the second list.3 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]False4RSort 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.05HDecompose 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.06#A strictly accumulating version of  3456t PQWXYZ[\]^_`abcdejklmn!"#$% &'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRST     +,3456`caedYWmljnk,]\[ZX+b^_QP34563456 Safe-Inferred7Conditional 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.88 b is   () if b is A, and U if b is @.9The reverse of 7.:The : function is analogous to m?, 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 y;Like :, but discards the result.<Strict version of .Since: 4.8.0.0789:;<*VW'(0RSTfghiXYZ[\]^_`abcdef789:;<'0:;Rh8TifSg97<789:;<< Safe-Inferredghijklmnopqrstuvwxy !"#$#%&'()*+*,-./0/1/2/34546*789:;<-=->-?-@ABAC/D/E4FGH-I-JKL*M4NOP-QGR-STUVWAXYZ[\]^]_]`]a]bcde]f-g]h]ijkl]m]njojp]q]r]stutvtwtxtytzt{t|t}[~[[[[[[YYYYYYYYYYYYYYYYYYYYYYYYYAA!!!!!!!!!!!!jjjOOOOOOOOOOGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG_l---------- - - - - -----//////TTTT T!T"T#T$V%V&V'V()*+,-./0123456789:;<=>?@ABCDEDFDGDH#I#J*K*L*M*N*OPQRSTUV4W4X4Y4Z4[4\4]4^4_4` a b cdefghijklmnopqrstutvtwtxtytzt{t|t}t~tttttttjjjYYYYYYYYY%      ! " # $ % & ' ( )*+,-./0123456789:;:<:=:>:?:@:A:B:C:D:E:F:G:H:I:J:K:L:M:N:O:P:Q:R:S:T:U:VWXYZY[Y\]^_`abcdefghijklmnopqrstuvwxyz{|}~AVVVVVVVVVVVVVVVVVbase-compat-0.8.0Prelude.CompatData.Functor.CompatText.Read.CompatControl.Monad.CompatSystem.Environment.CompatData.List.CompatDebug.Trace.CompatControl.Concurrent.MVar.CompatData.Monoid.CompatData.Either.CompatData.Bool.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<>mconcatmappendmemptyMonoidisRightisLefteitherparenslexPlexreadListPrecDefaultreadListDefault readParen readListPrecreadPrecreadList readsPrecacoshatanhasinhcoshtanhsinhacosatanasincostansinlogBase**logsqrtexppiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadix Text.Read.LexPuncIdentSymbolNumberEOFLexemelcmgcd^^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumpredsucc Data.BoolboolText.ParserCombinators.ReadPReadS showParen showStringshowCharshowsShowSshowListshow showsPrecvoid=<<mplusmzerounzip3unzipzipWith3zipWithzip3!!lookupreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlinitlasttailhead Data.MaybemaybeNothingJustMaybeuncurrycurrysubtractsignumabs*+asTypeOfuntilflip.constid<$/=compare<=&&||not<>maxmin&nulllength makeVersioncalloc callocBytes callocArray callocArray0dieisSubsequenceOfsortOnunconsscanl'whenguardunlessfoldMfoldM_<$!>Text.ParserCombinators.ReadPrec readS_to_Prec readPrec_to_S readP_to_Prec readPrec_to_Pchoicepfail<+++++lookgetprecresetstepliftminPrecReadPrecPrec traceMarkerIO traceMarker traceEventIO traceEvent traceStack traceShowtrace putTraceMsgtraceIOgetDualDualappEndoEndogetAllAllgetAnyAnygetSumSum getProductProductgetFirstFirstgetLastLast Data.FunctiononfixpartitionEithersrightsleftstoListasum 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_throwIfForeign.Marshal.Utils moveBytes copyByteswithMany maybePeek maybeWithmaybeNewtoBoolfromBoolwithnew GHC.Stable newStablePtrGHC.IntInt8Int16Int32Int64 StablePtrGHC.WordWord8Word16Word32Word64GHC.PtrPtrFunPtrGHC.ForeignPtr ForeignPtrForeign.ForeignPtr.ImpmallocForeignPtrArray0mallocForeignPtrArraynewForeignPtrEnvwithForeignPtr newForeignPtr Foreign.Ptr intPtrToPtr ptrToIntPtr wordPtrToPtr ptrToWordPtrfreeHaskellFunPtrWordPtrIntPtrfinalizeForeignPtrcastForeignPtrtouchForeignPtrnewForeignPtr_addForeignPtrFinalizerEnvaddForeignPtrFinalizermallocForeignPtrBytesmallocForeignPtr FinalizerPtrFinalizerEnvPtrForeign.Storablepokepeek pokeByteOff peekByteOff pokeElemOff peekElemOff alignmentsizeOfStorablecastPtrToStablePtrcastStablePtrToPtrdeRefStablePtr freeStablePtrcastPtrToFunPtrcastFunPtrToPtr castFunPtr nullFunPtrminusPtralignPtrplusPtrcastPtrnullPtr byteSwap64 byteSwap32 byteSwap16 Data.BitspopCountDefaulttestBitDefault bitDefaultpopCountrotateRrotateL unsafeShiftRshiftR unsafeShiftLshiftLisSignedbitSize bitSizeMaybetestBit complementBitclearBitsetBitbitzeroBitsrotateshift complementxor.|..&.Bits finiteBitSize FiniteBitsGHC.IO.Handle.FDstderr System.Exit exitFailure exitSuccessexitWith ExitSuccess ExitFailureExitCode subsequencesfoldl1'unfoldrsortBysort permutationstailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLengthinsertByinsert partition transpose intercalate intersperse intersectBy intersectunionByunion\\deleteBydeletenubBynub 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