'V      !"#$%&'()*+,-./01234 5 6 789:;<=>?@ABC D E F G H I J K L MNOPQRST U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m nopqrstuvwxyz{|}~        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  Safe-Inferred),'()*+,-.`,`.'()*+,-  Safe-Inferred WXYZ[\]^_ _^]\[ZYXW  Safe-Inferred `abcdefghi c`abedifghNone  Safe-Inferred*+=QRS + Safe-Inferred)i)i 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  Safe-Inferred#3nopqrstuvwxyz{|}~ 3~}| Safe-Inferred AOP Safe-Inferred7MN_7MN_ Safe-Inferred/0123456789:;<=>?@ABCDEEDCBA@?>=<;:9876543210/ Safe-Inferred*P      !"#$%&'()*+,-./01234 Safe-Inferred56789:;<=>?@ABCDEF  Safe-Inferred*03JK?56GHIJCDEFGHIJKLMNOPQRSTUKLVWXYZ[\]^_`abcdefgCDEFGHIJ5K6L  Safe-Inferred 4hijklmjklm4mlkj Safe-InferredTest 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 ;. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.  "#$%&'()*+,-./0234789:;<=>?@ABMNOPQRSjklmnopqrstuvwxyz{|}      !"#$%&FGHIJKLMNOPQRSTUVWXYZ[\]^`abcdefghjmnopqrstuvwxyz{|}~`twuyx{nvzj ru|xzs~}tvwy{nmqpoIHKGFJcabd  o|}qprskjlm YZ[]^\     #"!%&$  SROLNQMPUTXVWgfh2 "ZY#^]\[$%     3}|&SR)'QPONML(*  +,-.&%$#"! /XWVUT0hgf4mlkj?89:;<@7MNAOP=QRS>`eB Safe-Inferred*no !2pqrst2 !no Safe-InferredStrict version of .Since: 4.8.0.0*uvw()1xyz{|}~ijkl (1lki Safe-InferredThe & function takes two lists and returns N8 if the first list is a subsequence of the second list. x y is equivalent to o 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]FalseRSort 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.0HDecompose 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.0s mnopqrstuvwxyz{|}~None'*0=B Monoid under .Since: 4.8.0.0  None*+=KConstruct tag-less Since: 4.8.0.0Since: 4.8.0.0 Safe-Inferred  Safe-Inferred Like / but memory is filled with bytes of value zero.Llike / but memory is filled with bytes of value zero.  Safe-InferredLike :, but allocated memory is filled with bytes of value zero.Like ;, but allocated memory is filled with bytes of value zero.None@      !None";#$%&'@()*+,-.      !/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRST/0123456789:;<=>?@ABCDE  Safe-InferredWrite given error message to U and terminate with U.@since 4.8.0.0TUVVUTV !"#$%&'&()*+,+-./0!123245678797:7;#<=#<>2?@ABCD5E5F5G5HIJIKIL7M7N#<OPQ5R5STU2V#<WXY5ZP[5\]^_`Iabcdefgfh#ij#ik#il#im#inopq#ir5s#it#iuvwxfyfzf{f|f}f~ffff#i#ivv#i#i#iddddbbbbbbbbbbbbbbbbbbbbbbIIIIIIIIIIIIIIIIII))))))))))))     fyffzff{ff|f f}f!f"ff#f$f%f&f'f(v)v*v+,-,-X.X/X0X1X2X3X4X5X6X7P8P9P:P;P<P=P>P?P@PAPBPCPDPEPFPGPHPIPJPKPLPMPNPOPPPQPRPSPTPUPVPWXkXxXYXZX[X\X]X^_`_a_b_c_d_e_f_g_h_i_j_k_l_m_n_o_p_q_r_s_t_u_v5w5x5y5z5{5|5}5~55555555555777777]]]]]]]]____&&&&&&&&&&&&&&&&&&&&&&&&&&&++22222#<#<#<#<#<#<#<#<#<#< ,b b b b b bbbbbbbvvv_____ !!"#"$"%"&"'"(")"*"+","-"."/"/"0"0"1"1"2"2"3"3"4"4"5"56789::;;<<==>>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^T_`abcdefghgigjgkglgmgngogpgqfrfsftfufvfwfxfyfzf{f|f}f~ffffffffffffffffffffddddddIIIII______________________ _______&   &&&&&&&&&&&      !"#$%&%'%(%)%*%+%,%-%.%/012324252607898:8;8<=>=?@ABCBDBEBFBGHIHJHKHLHMHNHO@P@Q@R@S@T@U@V@W@X@Y0Z0[0\0]=^=_=`=a=b=c=d=e=f8g8h8ijklbase-compat-0.7.1Prelude.CompatData.Bool.CompatData.Ord.CompatData.Functor.CompatControl.Applicative.CompatText.Read.CompatControl.Monad.CompatData.Foldable.CompatData.Traversable.CompatGHC.Generics.CompatSystem.Exit.CompatSystem.Environment.CompatSystem.Console.GetOpt.CompatDebug.Trace.CompatData.Version.CompatControl.Concurrent.MVar.CompatData.List.CompatForeign.Storable.CompatControl.Exception.CompatData.Monoid.CompatData.Either.CompatData.Bits.CompatData.Function.CompatForeign.Marshal.Alloc.CompatForeign.Marshal.Array.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<*>pure AlternativeBoundedEnumEq GHC.FloatFloating FractionalIntegralMonadFunctorNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShow Control.Monad MonadPlus Applicative Data.FoldableFoldableData.Traversable Traversable GHC.GenericsGenericGeneric1 GHC.TypesBoolCharDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerOrderingRationalIOWord Data.EitherEitherStringU1Par1Rec1K1M1:+::*::.:RepRep1FalseTrueLeftRightLTEQGT System.Exit exitSuccess exitFailureexitWithSystem.EnvironmentgetEnvironment withProgNamewithArgsunsetEnvsetEnv lookupEnvgetEnv getProgNamegetArgsSystem.Console.GetOpt RequireOrderPermute ReturnInOrderArgOrderOptionOptDescrNoArgReqArgOptArgArgDescrsequencemapM sequenceAtraversenotElemelemminimummaximumproductsumallanyorand concatMapconcat sequence_mapM_foldl1foldr1foldl'foldlfoldr'foldrfoldMapfold Debug.Trace traceShowMtraceM traceShowIdtraceId Data.Version versionTags versionBranchVersion<**>manysome<|>emptygetConstConst unwrapMonad WrapMonad WrappedMonad unwrapArrow WrapArrow WrappedArrow getZipListZipList$>Prelude$!readIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharControl.Concurrent.MVarwithMVarMaskedGHC.IO.ExceptionioError ExitSuccess ExitFailureExitCode Data.Listunwordswordsunlineslines dropWhileEndForeign.Storablepokepeek pokeByteOff peekByteOff pokeElemOff peekElemOff alignmentsizeOfStorableGHC.IOFilePath userErrorIOError GHC.Exception ErrorCall Text.Readread readMaybe readEitherreads Data.Monoid<>mconcatmappendmemptyMonoidgetDualDualappEndoEndogetAllAllgetAnyAnygetSumSum getProductProductgetFirstFirstgetLastLastunPar1unRec1unK1unM1L1R1unComp1Comp1tofromto1from1isRightisLefteitherData.OrdDownparenslexPlexreadListPrecDefaultreadListDefault readParen readListPrecreadPrecreadList readsPrecacoshatanhasinhcoshtanhsinhacosatanasincostansinlogBase**logsqrtexppiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadix Text.Read.LexPuncIdentSymbolNumberEOFLexeme Data.BitspopCountrotateRrotateL unsafeShiftRshiftR unsafeShiftLshiftLisSignedbitSize bitSizeMaybetestBit complementBitclearBitsetBitbitzeroBitsrotateshift complementxor.|..&.Bitslcmgcd^^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumpredsucc Data.BoolboolText.ParserCombinators.ReadPReadS showParen showStringshowCharshowsShowSshowListshow showsPrecvoid=<<mplusmzerounzip3unzipzipWith3zipWithzip3!!lookupreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlinitlasttailhead Data.MaybemaybeNothingJustMaybeuncurrycurrysubtractsignumabs*+asTypeOfuntilflip.constid<$/=compare<=&&||not<>maxmin&nulllength<$!>isSubsequenceOfsortOnunconsAltgetAlt makeVersioncalloc callocBytes callocArray callocArray0dieText.ParserCombinators.ReadPrec readS_to_Prec readPrec_to_S readP_to_Prec readPrec_to_Pchoicepfail<+++++lookgetprecresetstepliftminPrecReadPrecPrecgetOpt'getOpt usageInfo traceMarkerIO traceMarker traceEventIO traceEvent traceStack traceShowtrace putTraceMsgtraceIO comparing Data.Functiononfixfind minimumBy maximumBytoListmsumasum sequenceA_forM_for_ traverse_foldlMfoldrMpartitionEithersrightsleftspopCountDefaulttestBitDefault bitDefault finiteBitSize FiniteBitsassertControl.ExceptionallowInterruptcatchesHandlerControl.Exception.BasebracketOnErrorbracket_finallybracket onExceptiontryJusttry mapException handleJusthandle catchJustcatchPatternMatchFail RecSelError RecConError RecUpdError NoMethodErrorNonTerminationNestedAtomically GHC.Conc.SyncthrowToasyncExceptionFromExceptionasyncExceptionToExceptionBlockedIndefinitelyOnMVarBlockedIndefinitelyOnSTMDeadlockAssertionFailedSomeAsyncException StackOverflow HeapOverflow ThreadKilled UserInterruptAsyncExceptionIndexOutOfBoundsUndefinedElementArrayExceptionevaluateuninterruptibleMaskuninterruptibleMask_maskmask_getMaskingStatethrowIOUnmaskedMaskedInterruptibleMaskedUninterruptible MaskingState IOExceptionthrow SomeException fromException toException ExceptionOverflow UnderflowLossOfPrecision DivideByZeroDenormalRatioZeroDenominatorArithException mkWeakMVaraddMVarFinalizermodifyMVarMaskedmodifyMVarMasked_ modifyMVar modifyMVar_withMVarswapMVarGHC.MVar isEmptyMVar tryReadMVar tryPutMVar tryTakeMVarputMVarreadMVartakeMVarnewMVar newEmptyMVarMVarDatatype ConstructorSelectorV1RPDCSRec0Par0D1C1S1 NoSelector isNewtype moduleName datatypeNameselName conIsRecord conFixityconNameNoArityArityPrefixInfixFixityLeftAssociativeRightAssociativeNotAssociative AssociativityfoldMapDefault fmapDefault mapAccumR mapAccumLforMfor $fShowConst $fReadConstoptionalliftA3liftA2liftA<**>guardliftMjoinmfilterapliftM5liftM4liftM3liftM2unlesswhen replicateM_ replicateMfoldM_foldM zipWithM_zipWithM mapAndUnzipMforever<=<>=>filterM subsequencesfoldl1'unfoldrsortBysort permutationstailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLengthinsertByinsert partition transpose intercalate intersperse intersectBy intersectunionByunion\\deleteBydeletenubBynub isInfixOf isSuffixOf isPrefixOf findIndices findIndex elemIndices elemIndex stripPrefix $fMonoidAlt$fIsListVersion parseVersion showVersion$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