Q2      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN O P Q R S T U V W X Y Z[\]^_`abcd e f g h i j k l m n o p q r s t u v w x y z { | } ~        NoneAAn ordered list. The semigroup instance merges two lists so that ( the result remains in ascending order. KThe dual of a monoid is the same as the original, with arguments reversed The Max monoid, where  (+) =~ max FA monoid on Maybes, where the sum is the leftmost non-Nothing value. 6A monoid on category endomorphisms under composition "The Product monoid 36A monoid is a semigroup with a null element such that zero + a == a + zero == a 5MThe class of all types that have a binary operation. Note that the operation isn'=t necesarily commutative (in the case of lists, for example) }  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKL       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLC9875634./012,- !"#$ )*+:;>'(%&G=H@?BCAFIJKDE<Lb   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLNoneMNOPQRSMNOPQRSMNOPQRSNoneYThe Composition functor \A motherflippin' functor _The Constant Functor bThe Identity Functor 7TUVWXYZ[\]^_`abcdefghijklmnopqr!RSTUVWXYZ[\]^_`abcdefghijklmnopqr!RSghefbcd_`a\]^YZ[WXTUVijlkomnrpq*TUVWXYZ[\]^_`abcdefghijklmnopqrNone(stuvwxyz{|}~stuvwxyz{|}~vwstuxyz{|}~%stuvwxyz{|}~NoneNA wrapper for applicative functors with actions executed in the reverse order The Tree equivalent to ZipList GA wrapper type for lists with zipping Applicative instances, such that ZipList [f1,...,fn] Q ZipList [x1,...,xn] == ZipList [f1 x1,...,fn xn] 6;PQRSTUVWXYZ[\]^_`abcdefghijklmnopqrPQ1 None Create an  from two inverse functions.  Reverse an    from ::  a b ->  b a  Create a $ from a getter and setter function.  & lens :: (a -> b) -> (a -> b -> a) ->  a b  Create a * from a maybe getter and setter function.  - prism :: (a -> (a:+:b)) -> (a -> b -> a) ->  a b *Retrieve a value from a structure using a  (or ) !_promapping :: Bifunctor f => Iso' a b -> Iso' (f a c) (f b c) An infix synonym for  ^ DDY None    `PQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~    None-A simple continuation monad implementation A simple Writer monad A simple Reader monad A simple State Monad -The class of all monads that have a fixpoint       !"#$%&'()*+,-./0 !"123456789:;<=>?@A#$BC%&'DEFGHIJKLM()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqr      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLM]MNO *+,)-.!"#$%'&(/012346578:;<=>?@A  9   BCFGDEHIJKLM      !"#$%&'()*+,-./0 !"123456789:;<=>?@A#$BC%&'DEFGHIJKLM()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abc NoneNOPQRSTUVWXYdefghijklMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqr      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYSTVUQRXYWNOPNOPQRSTUVWXYdefghijklNonemnZ[\]^_`abcopqrstuvwx  Z[\]^_`abc ]^_Z[\ `abcmnZ[\]^_`abcopqrstuvwxNone      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXY NonepThe (+) operator with lower priority sThe remaining Stream to parse t Consume a token from the Stream u;Parse zero, one or more successive occurences of a parser. v6Parse one or more successive occurences of a parser. w7Consume a token and succeed if it verifies a predicate x&Consume a single fixed token or fail. y*Consume a structure of characters or fail y?Try to consume a parser. Return a default value when it fails. z,Succeed only if we are at the End Of Input. {AParse one or more successive occurences of a parser separated by  occurences of a second parser. |BParse zero or more successive occurences of a parser separated by  occurences of a second parser. }"Parse a member of a set of values ~%Parse anything but a member of a set AChain an operator with an initial value and several tail values. (Chain an operator with an initial value Test if a Stream is empty +z{|defghijk}lmnopqr~stuvwxyyz{|}~7      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYdefghijklmnopqrstuvwxyz{|}~jkighrdeflmnopqtws}~xyzuv|{%z{|defghijk}lmnopqr~stuvwxyyz{|}~None>Create a Parser that preprocesses the command-line arguments, @ splitting options and their arguments into a user-defined data  type. ?      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYdefghijklmnopqrstuvwxyz{|}~ None>A type wrapper that adds a Bounded instance for types that don't possess one. NoneBA type wrappers for timestamps that can be compared unambiguously A Time'.s pure value. May not be defined immediately. JConstructs a Time representing the time at which the argument terminates. ;Warning: This function executes its argument, ignoring its @ value. Thus, it would be wise to use it on repeatable blocking  actions, such as readMVar. The Time ring where  (*) == min and one == maxBound The Time monoid where zero == minBound The Time semigroup where ta + tb == max ta tb None*A Future value (a value with a timestamp) :An event (a list of time-value pairs of increasing times) The 'splice' operator. Occurs when a occurs.  at t: a // b = (a,before t: b) The 'over' operator. Occurs only when a occurs. - at t: a <|*> (bi,b) = a <*> (minBound,bi):b bGroup the occurences of an event by equality. Occurs when the first occurence of a group occurs. DSinks an action event into the Real World. Actions are evaluated as # closely to their time as possible ( $None "      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXY  !"#$%%&'())*++,--.//0112334556789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghiijklmmnoopqqrstuvwxyz{|}~                           !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRS T T U V W X Y Z [ \ ] ^__`abcdefg h i j k k l m m n o p q r s t u v w x y z { | } ~                !"#$%&"'"()*+,-./0123456789:;<=<>"?@A@B@C@D@E@F@G@HIJKLMN 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 nop:q:rstuvwxyz{|}~                            ! " # $ % & ' ( ) *+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst u v w x y z { | }~~                     SimpleH-1.0.1SimpleH.Parser.CmdArgs SimpleH.CoreSimpleH.Containers SimpleH.File SimpleH.MonadSimpleH.ApplicativeSimpleH.FunctorSimpleH.Foldable SimpleH.LensSimpleH.Traversable SimpleH.ArrowSimpleH.ParserSimpleH.Reactive.TimeValSimpleH.Reactive.TimeSimpleH.ReactiveSimpleH.ClassesSimpleHbaseSystem.Console.GetOpt usageInfoOptionOptDescrNoArgReqArgOptArgArgDescrData.Ord comparingcontainers-0.5.0.0 Data.Map.BaseMap Data.Set.BaseSetdirectory-1.2.0.1System.DirectorygetCurrentDirectory Interleave interleave OrderableinOrderOrdList getOrdListDualgetDualMaxgetMaxAccumgetAccum StrictEndo runStrictEndoEndorunEndoProduct getProductSplit<#>Choice<|>Categoryid.UnitpureRingone*SubSemicastMonoidzero Semigroup+:+::*:Void<<<>>> insertOrd&+++secondfirstguard ifThenElsebooltailSafeheadDeffailconstfixunitwhenunless invertOrdMonadjoin>>= Applicative<*>Functormap:++:SumgetSum:**::.:Compose getComposeFlipunFlipConstgetConstIdgetId Bifunctordimap Cofunctorcomap<$>|||<&><$leftrightvoidmap2map3promapSizedgetSizedFoldablefoldfoldMapconvertconcatsumsizecountlengthsplitpartitionEithers partitionfilterselectrefusecomposefoldrfoldr1foldl'foldl1'toListfindorandallanyelem BackwardsforwardsZipTreeZipList getZipListap*><*<**> sequence_ traverse_for_foreverliftAliftA2liftA3liftA4plusAzeroAbetween IsoFunctor2mapIso2 IsoFunctormapIso Isomorphic_isoCompound_each:<->:Iso'IsoFold'Fold Traversal' TraversalGetter'GetterLens'Lens LensLike'LensLikeisofromlensgetterprismsat.+^.^..%~%%~%-%%-^?^??simple-..-atat'warpset_1_2_l_r_Just_list_head_tail_mapping _mapping' _promapping_Id_OrdList_Dual_Const_Max_Endo_maybe_Flip_Compose _Backwardswarp2<.>adding_thunk Contravariantcollect Traversablesequencetraverseforeach transposeflipEitherT MonadErrorthrowcatchListT MonadListforkContContTrunContT MonadContcallCCWriterWriterT MonadWritertelllistencensorReaderReaderT MonadReaderasklocalStateAStateStateTIOLens MonadStategetputmodifyRWSRWSTrunRWSTKleisli runKleisli MonadTransliftMonadFixmfix_KleislifoldlMfoldrMwhileuntilbind2>>>=bind3>>>>=>>=<<<=<>=><*=return_ioref_mvarstateTevalexecstate=-=~getssavingstateAmapAccum mapAccum_ mapAccumR mapAccumR_pushpopwithPrevwithNext_readerT_readermute intercept_writerT_writer evalContTevalCont_listTtrytryMay_eitherTListArunListAApplyapplyArrowarr^>>>>^dupcomapAappAListgetAListDataMaplookupaltermemberdeleteminsertinsertStreamunconsconsParserAParserParserTparserTparser runParser pureParser<+>>*>_ParserA remainingtokenmanymany1satisfysingleseveraleoisepBy1sepByoneOfnoneOfchainrchainlemptytokenizeTimeValNeverSinceAlwaysSecondsTimetimeValtimeIOwaitTill currentTimeFutureReactiveEvent_eventatTimesmkEvent//<*|><|*>groupEheadE mapFutureswithTimetimesmasksinkevent_future_time_valuefutureIOFile DirectorygetFileshowFile_file _directory$fSemigroupInterleave$fOrderableMax$fSemigroupOrdList $fRingDual$fSemigroupDual $fRingMax $fMonoidMax$fSemigroupMax $fUnitAccum $fMonoidAccum$fSemigroupAccum$fSemigroupStrictEndo $fMonoidEndo$fSemigroupEndo$fMonoidProduct$fSemigroupProduct $fSplit(->) $fChoice(->)$fCategory(->)$fUnitIO $fUnitTree$fUnit[] $fUnit(->) $fUnit(,) $fUnitMaybe $fUnitEither $fRing(,)$fRing[] $fRingDouble $fRingFloat $fRingInteger $fRingInt $fRingBool$fSubSemiaVoid $fSubSemia() $fMonoidMaybe $fMonoidBool$fMonoidEither $fMonoid(,,) $fMonoid(,) $fMonoid[]$fMonoidDouble $fMonoidFloat$fMonoidInteger $fMonoidInt $fMonoid() $fMonoidVoid$fSemigroupMaybe$fSemigroupEither$fSemigroup(,,)$fSemigroup(,) $fSemigroup[]$fSemigroupInteger$fSemigroupDouble$fSemigroupFloat$fSemigroupInt$fSemigroupBool $fSemigroup()$fSemigroupVoidGHC.Errerrorghc-primGHC.PrimseqGHC.Listzip System.IOprint Data.TuplefstsndGHC.Base otherwise$GHC.Num fromInteger-GHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negate fromIntegral realToFrac toInteger toRationalBoundedEnumEq GHC.FloatFloating FractionalIntegralNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShow GHC.TypesBoolCharDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerOrderingRationalIO Data.EitherEitherStringFalseTrueLeftRightLTEQGTPrelude$!readIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharGHC.IO.ExceptionioError Text.Readreadreadseither Data.Listunwordswordsunlineslinesproductfoldl1minimummaximumlex readParenreadList readsPrecText.ParserCombinators.ReadPReadSacoshatanhasinhcoshtanhsinhacosatanasincostansinlogBase**logsqrtexppiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadixGHC.IOFilePath userErrorIOErrorlcmgcd^^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFraction undefinedmaxBoundminBoundfromEnumtoEnumpredsucc showParen showStringshowCharshowsShowSshowListshow showsPrecunzip3unzipzipWith3zipWithzip3!! concatMapnotElemreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlnullinitlasttailhead Data.MaybemaybeNothingJustMaybeuncurrycurrysubtractsignumabsasTypeOf/=compare<=&&||not<>maxmin $fMonadIO$fApplicativeIO $fFunctorIO $fFunctor(->) $fFunctor(,)$fFunctorMaybe$fFunctorEither $fFunctor:++: $fFunctor:**: $fFunctor:.: $fUnit:.:$fApplicativeConst $fUnitConst$fFunctorConst$fSemigroupConst $fMonadId$fApplicativeId $fFunctorId$fUnitId $fFunctorTree $fFunctor[]$fBifunctor(->)$fCofunctorFlip$fCofunctor:.:$fFoldable:++:$fFoldable:**:$fSubSeminSized $fFoldable:.:$fFoldableTree $fFoldable[] $fFoldable(,)$fFoldableMaybe$fFoldableEither $fFoldableIdoneAtimesA $fMonoid:.:$fSemigroup:.:$fApplicativeBackwards$fApplicativeZipTree $fUnitZipTree$fFunctorZipTree$fApplicativeZipList $fUnitZipList$fFunctorZipList$fMonoidZipList$fSemigroupZipList$fMonadInterleave$fApplicativeInterleave$fApplicative:.: $fMonadTree$fApplicativeTree$fApplicative:**: $fUnit:**: $fMonad[]$fApplicative[] $fMonad(,)$fApplicative(,) $fMonad(->) $fRing(->) $fMonoid(->)$fSemigroup(->)$fApplicative(->) $fMonadEither$fApplicativeEitherIsoTisoTunIsoTswapE_Accum$fIsoFunctor2Either$fIsoFunctor2(,)$fIsoFunctor2(->)$fIsoFunctor(->)$fIsomorphicab(,)(,)$fIsomorphicff':.::.:$fIsomorphicBoolBoolMaybeMaybe$fIsomorphicffFlipFlip$fIsomorphickkEndoEndo$fIsomorphicabMaxMax$fIsomorphicabDualDual$fIsomorphicabConstConst$fIsomorphic[][]OrdListOrdList$fIsomorphicabIdId$fCompoundabEitherEither$fCompoundab(,,)(,,)$fCompoundab(,)(,)$fBifunctorIsoT $fFunctorIsoT$fCompoundab[][]$fContravariant(->)$fContravariantId$fTraversable:++:$fTraversable:**:$fTraversable:.:$fTraversableTree$fTraversable[]$fTraversableEither$fTraversable(,) MonadInternalinternalcfixmfixingfolding_RWSTget_put_modify__StateTask_local_tell_listen_censor_$fMonadErroreIO$fMonadErrorVoidMaybe $fMonadMaybe$fApplicativeMaybe$fMonadTransEitherT$fMonadErrorVoid[]$fMonadErroreEither$fMonadErrorVoidListT$fMonadWriterwListT$fMonadStatesListT$fMonadTransListT$fMonadFixListT$fMonadListListT $fMonadList[]$fMonadBackwards$fMonadTransBackwards$fMonadContContT$fMonadTransContT $fMonadContT$fApplicativeContT$fFunctorContT $fUnitContT$fMonadStaterWriterT$fMonadReaderrWriterT$fMonadWriterw(,)$fMonadWriterwReaderT$fMonadStatesReaderT$fMonadReaderr(->)$fChoiceStateA $fSplitStateA$fCategoryStateA$fMonadWriterwStateT$fMonadReaderrStateT$fMonadStateIOIO$fMonadInternalRWST$fMonadTransRWST$fMonadErroreRWST$fTraversableRWST$fFoldableRWST$fMonadWriterwRWST$fMonadReaderrRWST$fMonadStatesRWST$fMonadContRWST$fMonadFixRWST $fMonadRWST$fApplicativeRWST $fFunctorRWST $fUnitRWST"$fIsomorphic(->)(->)KleisliKleisli$fSplitKleisli$fChoiceKleisli$fCategoryKleisli $fMonadFix:.:$fMonadFixBackwards $fMonadFixIO$fMonadFixEither $fMonadFix[]$fMonadFix(->) $fMonadFixId $fMonad:.: $fArrowListA $fSplitListA $fChoiceListA$fCategoryListA$fArrowKleisli$fApplyKleisli $fArrowStateA $fApply(->) $fArrow(->)Bimap_inverse$fDataMapFlipba$fDataMapBimapab $fFunctorMap $fMonoidMap$fSemigroupMap $fMonoidSet$fSemigroupSet$fDataMapMapka$fDataMapSetaVoidoption Serializableencodedecode_ParserTparserA$fSerializableByteString $fStreama[]$fArrowParserA$fChoiceParserA$fSplitParserA$fCategoryParserA$fMonadTransParserT$fBoundedTimeVal$fTraversableTimeVal$fFoldableTimeVal$fMonadTimeVal$fApplicativeTimeVal $fUnitTimeVal$fFunctorTimeVal $fRingTime $fMonoidTime$fSemigroupTimeFreezedmapTambunambseconds $fUnitTime $fBoundedTime$fOrderableTime $fOrdTime$fEqTime $fShowTime$fExceptionFreezedEventRepgetEvent_EventcmpFutltFut$fOrderableFuture $fOrdFuture $fEqFuture $fMonadEvent$fApplicativeEvent $fMonoidEvent$fSemigroupEvent $fShowEvent$fApplicativeReactive$fFunctorReactive$fUnitReactiveil_Filefilepath-1.3.0.1System.FilePath.Posix