{PP\      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqr s t u v w x yz{|}~         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRS T U VWXYZ[ Safe-Inferred)+\]^_`abcdefghijkl +  Safe-Inferred IJKLMNOPQ QPONMLKJI Safe-Inferred mnopqrstuvwxyNone z{|}~lmnoonml Safe-Inferred**9CDEFGKLMNNone*B  Safe-Inferred(xyDx Safe-InferredOO is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator  , which allows O to be nested in  .Since: 4.8.0.0O @ABCOOOO Safe-Inferred#1VWXYZ[\]^_`abcdefghijk 1kjihgfed Safe-Inferred =AB Safe-Inferred3?@ HIJ3?@HIJ  Safe-Inferred Safe-Inferred*P  Safe-Inferred      Safe-Inferred*03JK? !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR Safe-Inferred 2STUVWXRSTU2UTSR Safe-InferredPTest 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.Q4Returns the size/length of a finite structure as an 7. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.PQ  !"#$%&'()*+,-./0123456789:;<=>?@ABCDERSTUVWXYZ[\]^_`abcdegijpqyz{|}~     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNPQ`\_]a`cV^by387zA>B@C ? '#%2/*0)(.-,+!"1$&9}{|~HJI  WjgdieQYXPZ[SRTUqp D   <= ;:EKGLFMN0 qp!"   #E$1jiged%(D&')=< ;: *FKLGMN+,-./2UTSR;45678<3?@=AB6459CDE: >PQ  Safe-Inferred*YZ [0\]^_`pqabcdrstuvwefghijyDtsrwvuYZ Safe-InferredRStrict version of .Since: 4.8.0.0R*klm'(nopqrstuvwxyz{|}~RRRR  Safe-InferredSThe S& function takes two lists and returns @8 if the first list is a subsequence of the second list.S x y is equivalent to W 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]FalseTRSort 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.0UHDecompose a list into its head and tail. If the list is empty, returns 4$. If the list is non-empty, returns 5 (x, xs) , where x is the head of the list and xs its tail.Since: 4.8.0.0STUs  !"#$%&'()*+,-./012STUSTUSTUNone*+=KVConstruct tag-less Since: 4.8.0.0Since: 4.8.0.0VVVV  Safe-Inferred  Safe-Inferred WLike / but memory is filled with bytes of value zero.XLlike / but memory is filled with bytes of value zero.WX WXWXWX Safe-InferredYLike :, but allocated memory is filled with bytes of value zero.ZLike Z;, but allocated memory is filled with bytes of value zero.YZYZYZYZNone@     WXYZNone7 !"#<$%&'()*     +,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPWXYZ Safe-Inferred[Write given error message to Q and terminate with G.@since 4.8.0.0[FGH[HGF[[R !"#$%&'&()*+,+-./0!123245678797:7;#<=#<>2?@ABCD5E5F5G5HIJIK7L7M#<NOP5Q5RST2U#<VWX5YOZ5[\]I^_`ab#cd#ce#cf#cg#chijk#cl5m#cn#copqr#cs#ctpupv#cw#cx#cyz{z|z}~~~~~~~~~aaaa______________________IIIIIIII))))))))))))pppWWWWWWWWWWOOOOOOOOOO O O O O OOOOOOOOOOOOOOOOOO e r ! " # $ % &5'5(5)5*5+5,5-5.5/505152535455565758597:7;7<7=7>7?@ABC\D\E\F\G\H\I\J\KLMLN&O&P&Q&R&S&T&U&V&W&X&Y&Z&[&\&]&^&_&`&a&b&c&d&e&f&g&h&ijkjljmjn+o+p2q2r2s2t2uvwxyz{|#<}#<~#<#<#<#<#<#<#<#<   ____________ppp        !"#$%&%'%(%)%*%+%+%,%-%.%/%0%1%2%'3456789:;<;=;>;?;@;A;B;C;D;EFGFHFIFJFKFLFMFNFOFPFQFRFSFTFUFVFWFXFYFZF[F\F]F^F_F`FaFFMFbFNFcFOFdFPFeFQFfFgFSFhFiFjFkFlFmFnFoFpFqFrFrFsFtFuFvFwFxFyFzF{F|F}a~aaaaa  IIIIIIIIIIIIIIIILLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL&&&&&&&&&&&&                     M !"#"$"%"&"'"(")"*"+",-./0/1/2/3-456575859:;:<=>?@?A?B?C?DEFEGEHEIEJEKEL=M=N=O=P=Q=R=S=T=U=V-W-X-Y-Z:[:\:]:^:_:`:a:b:c5d5e5fghibase-compat-0.7.0Prelude.CompatData.Bool.CompatText.Read.CompatData.Foldable.CompatData.Traversable.CompatSystem.Exit.CompatSystem.Environment.CompatDebug.Trace.CompatControl.Applicative.CompatData.Functor.CompatControl.Concurrent.MVar.CompatData.List.CompatForeign.Storable.CompatData.Monoid.CompatData.Either.CompatData.Function.CompatControl.Monad.CompatData.Version.CompatForeign.Marshal.Alloc.CompatForeign.Marshal.Array.CompatSystem.Console.GetOpt.CompatData.Ord.CompatData.Bits.CompatControl.Exception.CompatGHC.Generics.Compat Data.Functor<$>Foreign.Marshal.CompatForeign.CompatbaseGHC.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 Applicative Data.FoldableFoldableData.Traversable Traversable GHC.TypesBoolCharDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerOrderingRationalIOWord Data.EitherEitherStringFalseTrueLeftRightLTEQGT System.Exit exitSuccess exitFailureexitWithSystem.EnvironmentgetEnvironment withProgNamewithArgsunsetEnvsetEnv lookupEnvgetEnv getProgNamegetArgssequencemapM sequenceAtraversenotElemelemminimummaximumproductsumallanyorand concatMapconcat sequence_mapM_foldl1foldr1foldl'foldlfoldr'foldrfoldMapfold Debug.Trace traceShowMtraceM traceShowIdtraceId<**>getConstConst unwrapMonad WrapMonad WrappedMonad$>Prelude$!readIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharControl.Concurrent.MVarwithMVarMaskedGHC.IO.ExceptionioError ExitSuccess ExitFailureExitCode Data.Listunwordswordsunlineslines dropWhileEndForeign.Storablepokepeek pokeByteOff peekByteOff pokeElemOff peekElemOff alignmentsizeOfStorableGHC.IOFilePath userErrorIOError Text.Readread readMaybe readEitherreads Data.Monoid<>mconcatmappendmemptyMonoidgetDualDualappEndoEndogetAllAllgetAnyAnygetSumSum getProductProductgetFirstFirstgetLastLastisRightisLefteitherparenslexPlexreadListPrecDefaultreadListDefault readParen readListPrecreadPrecreadList readsPrecacoshatanhasinhcoshtanhsinhacosatanasincostansinlogBase**logsqrtexppiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadix Text.Read.LexPuncIdentSymbolNumberEOFLexemelcmgcd^^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumpredsucc Data.BoolboolText.ParserCombinators.ReadPReadS showParen showStringshowCharshowsShowSshowListshow showsPrec Control.Monadvoid=<<unzip3unzipzipWith3zipWithzip3!!lookupreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlinitlasttailhead Data.MaybemaybeNothingJustMaybeuncurrycurrysubtractsignumabs*+asTypeOfuntilflip.constid<$/=compare<=&&||not<>maxmin&nulllength<$!>isSubsequenceOfsortOnuncons makeVersioncalloc callocBytes callocArray callocArray0dieText.ParserCombinators.ReadPrec readS_to_Prec readPrec_to_S readP_to_Prec readPrec_to_Pchoicepfail<+++++lookgetprecresetstepliftminPrecReadPrecPrecSystem.Console.GetOptgetOpt'getOpt usageInfo RequireOrderPermute ReturnInOrderArgOrderOptionOptDescrNoArgReqArgOptArgArgDescr traceMarkerIO traceMarker traceEventIO traceEvent traceStack traceShowtrace putTraceMsgtraceIOData.Ord comparingDown Data.Functiononfixfind minimumBy maximumBytoListmsumasum sequenceA_forM_for_ traverse_foldlMfoldrMpartitionEithersrightslefts Data.BitspopCountDefaulttestBitDefault bitDefaultpopCountrotateRrotateL unsafeShiftRshiftR unsafeShiftLshiftLisSignedbitSize bitSizeMaybetestBit complementBitclearBitsetBitbitzeroBitsrotateshift complementxor.|..&.Bits finiteBitSize FiniteBitsassertControl.ExceptionallowInterruptcatchesHandlerControl.Exception.BasebracketOnErrorbracket_finallybracket onExceptiontryJusttry mapException handleJusthandle catchJustcatchPatternMatchFail RecSelError RecConError RecUpdError NoMethodErrorNonTerminationNestedAtomically GHC.Conc.SyncthrowToasyncExceptionFromExceptionasyncExceptionToExceptionBlockedIndefinitelyOnMVarBlockedIndefinitelyOnSTMDeadlockAssertionFailedSomeAsyncException StackOverflow HeapOverflow ThreadKilled UserInterruptAsyncExceptionIndexOutOfBoundsUndefinedElementArrayExceptionevaluateuninterruptibleMaskuninterruptibleMask_maskmask_getMaskingStatethrowIOUnmaskedMaskedInterruptibleMaskedUninterruptible MaskingState IOException GHC.Exceptionthrow SomeException fromException toException Exception ErrorCallOverflow UnderflowLossOfPrecision DivideByZeroDenormalRatioZeroDenominatorArithException mkWeakMVaraddMVarFinalizermodifyMVarMaskedmodifyMVarMasked_ modifyMVar modifyMVar_withMVarswapMVarGHC.MVar isEmptyMVar tryReadMVar tryPutMVar tryTakeMVarputMVarreadMVartakeMVarnewMVar newEmptyMVarMVar GHC.GenericsGenericGeneric1Datatype ConstructorSelectorV1U1Par1Rec1K1M1:+::*::.:RPDCSRec0Par0D1C1S1 NoSelectorRepRep1unPar1unRec1unK1unM1L1R1unComp1Comp1 isNewtype moduleName datatypeNameselName conIsRecord conFixityconNameNoArityArityPrefixInfixFixityLeftAssociativeRightAssociativeNotAssociative Associativitytofromto1from1foldMapDefault fmapDefault mapAccumR mapAccumLforMfor $fShowConst $fReadConst AlternativeoptionalliftA3liftA2liftA<**>manysome<|>empty unwrapArrow WrapArrow WrappedArrow getZipListZipListguardliftMjoin MonadPlusmfilterapliftM5liftM4liftM3liftM2unlesswhen replicateM_ replicateMfoldM_foldM zipWithM_zipWithM mapAndUnzipMforever<=<>=>filterMmplusmzero subsequencesfoldl1'unfoldrsortBysort permutationstailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLengthinsertByinsert partition transpose intercalate intersperse intersectBy intersectunionByunion\\deleteBydeletenubBynub isInfixOf isSuffixOf isPrefixOf findIndices findIndex elemIndices elemIndex stripPrefix Data.VersionVersion$fIsListVersion parseVersion showVersion versionTags versionBranch$fStorableRatio$fStorableComplexForeign.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 FinalizerPtrFinalizerEnvPtrcastPtrToStablePtrcastStablePtrToPtrdeRefStablePtr freeStablePtrcastPtrToFunPtrcastFunPtrToPtr castFunPtr nullFunPtrminusPtralignPtrplusPtrcastPtrnullPtr byteSwap64 byteSwap32 byteSwap16GHC.IO.Handle.FDstderr