Pp=      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789: ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [\]^_`abcde 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 +6A monoid is a semigroup with a null element such that zero + a == a + zero == a -MThe 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:;<=>?@ABCDE      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDED10/2-.+,&'()*$%  !"#347 @6A98;<:?BCD=>5Ec   !"#$%&'()*+,-./0123456789:;<=>?@ABCDENoneFGHIJKLFGHIJKLFGHIJKLNoneRThe Composition functor UA motherflippin' functor XThe Constant Functor [The Identity Functor 7MNOPQRSTUVWXYZ[\]^_`abcdefghijk!KLMNOPQRSTUVWXYZ[\]^_`abcdefghijk!KL`a^_[\]XYZUVWRSTPQMNObcedhfgkij*MNOPQRSTUVWXYZ[\]^_`abcdefghijkNone&lmnopqrstuvwxyz{|}~lmnopqrstuvwxyz{|}~oplmnqrstuvwxyz{|}~#lmnopqrstuvwxyz{|}~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] J ZipList [x1,...,xn] == ZipList [f1 x1,...,fn xn] 6;IJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk{IJ{1None 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) W==RNone^IJKLMNOPQRSTUVWXYZ[\]^_`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       !"#$%&'()*+,-./0123456789      !"#$%&'()*+,-./0123456789:;FGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk{      !"#$%&'()*+,-./0123456789YFGH      !"$#%&'()*+,-./0341256789      !"#$%&'()*+,-./0123456789      !"#$%&'()*+,-./0123456789:; None:;<=>?@ABCDEFGHIJKLMN:;<=>?@ABCDEFGHIJKLMN;<:=>?@ABCDEFGHIJKLMN:;<=>?@ABCDEFGHIJKLMN NoneOPQRSTUVWXYZ<=>?@ABCFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk{      !"#$%&'()*+,-./0123456789OPQRSTUVWXYZTUWVRSYZX OPQOPQRSTUVWXYZ<=>?@ABCNoneDE[\]^_`abcdFGHIJKLMNO [\]^_`abcd ^_`[\]abcdDE[\]^_`abcdFGHIJKLMNONone      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789OPQRSTUVWXYZ Nonee>A type wrapper that adds a Bounded instance for types that don't possess one. efghPQRSTUVefghehgfehgfPQRSTUV NonejBA type wrappers for timestamps that can be compared unambiguously WThe Time ring where  (*) == min and one == maxBound XThe Time monoid where zero == minBound YThe Time semigroup where ta + tb == max ta tb ijZ[\]klm^n_`aWXYbcdijklmnjkilmnijZ[\]klm^n_`aWXYbcd Noneo*A Future value (a value with a timestamp) r:An event (a list of time-value pairs of increasing times) vThe 'splice' operator. Occurs when a occurs.  at t: a // b = (a,before t: b) wThe 'over' operator. Occurs only when a occurs. - at t: a <|*> (bi,b) = a <*> (minBound,bi):b ybGroup 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 (oefpqrghistuvwxyz{|}~jklmnopqrstuv efghijklmnopqrstuvwxyz{|}~rszpqtu|}{vxwy~o$oefpqrghistuvwxyz{|}~jklmnopqrstuvw  !""#$$%&&'(()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]]^_`aabccdeefghijklmnopqrstuuvwxyz{|}~       !"#$%&'()*+,-./0123456789:; < = = > ? @ A B C D E F G H I J K L M N O P P Q R S T U V W X Y Z[[\]^_`abc d e f g h i j k l m n o o p q r s t u v w x y z { | } ~          !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJ K L M N O P Q RSSTUVWXYZ[\] ^ _ ` a b c d e f g i h i j k l m n o p q n r p s t u v w x y z { | } ~    SimpleH-1.0 SimpleH.CoreSimpleH.Containers SimpleH.MonadSimpleH.ApplicativeSimpleH.FunctorSimpleH.Foldable SimpleH.LensSimpleH.TraversableSimpleH.Parser SimpleH.ArrowSimpleH.Reactive.TimeValSimpleH.Reactive.TimeSimpleH.ReactiveSimpleH.ClassesSimpleHbaseData.Ord comparingcontainers-0.5.0.0 Data.Map.BaseMap Data.Set.BaseSet Interleave interleave OrderableinOrderOrdList getOrdListDualgetDualMaxgetMaxAccumgetAccum StrictEndo runStrictEndoEndorunEndoProduct getProductSplit<#>Choice<|>Categoryid.UnitpureRingone*SubSemicastMonoidzero Semigroup+:+::*:Voidvd<<<>>> insertOrd&+++secondfirstguard ifThenElsebooltailSafeheadDeffailconstfixunitwhenunless invertOrdMonadjoin>>= Applicative<*>Functormap:++:SumgetSum:**::.:Compose getComposeFlipunFlipConstgetConstIdgetId Bifunctordimap Cofunctorcomap<$>|||<&><$leftrightvoidmap2map3promapSizedgetSizedFoldablefoldfoldMapconvertconcatsumsizecountlengthsplitpartitionEithers partitionfilterselectrefusecomposefoldrfoldl'toListfindorandallanyelem BackwardsforwardsZipTreeZipList getZipListap*><*<**> sequence_ traverse_for_foreverliftAliftA2liftA3liftA4plusAzeroAbetween IsoFunctor2mapIso2 IsoFunctormapIso Isomorphic_isoCompound_each:<->:Iso'Iso Traversal' TraversalGetter'GetterLens'Lens LensLike'LensLikeisofromlensgetterprism^.^..%~%%~%-%%-^?simple-..-atat'warpset_1_2_l_r_list_head_tail_mapping _mapping' _promapping_Id_OrdList_Dual_Const_Max_Endo_maybe_Flip_Compose _Backwardswarp2adding_thunk Contravariantcollect Traversablesequencetraverseforeach transposeflipEitherT MonadErrorthrowcatchListT MonadListforkContContTrunContT MonadContcallCCWriterWriterT MonadWritertelllistencensorReaderReaderT MonadReaderasklocalStateStateTIOLens MonadStategetputmodifyRWSRWSTrunRWSTKleisli runKleisli MonadTransliftMonadFixmfix_KleislifoldlMfoldrMwhileuntilbind2>>>=bind3>>>>=>>=<<<=<>=><*=return_ioref_mvar_stateTevalexec_state=-=~getssavingmapAccum mapAccum_ mapAccumR mapAccumR_pushpopwithPrevwithNext_readerT_readermute intercept_writerT_writer evalContTevalCont_listTtry_eitherTParserParserT_ParserT_parserT_parser remainingtokenmanymany1satisfysingleseveraloptioneoisepBy1sepBy<+>oneOfnoneOfchainListArunListAApplyapplyArrowarr^>>>>^dupcomapAappAListgetAListDataMaplookupaltermemberdeleteminsertinsertTimeValNeverSinceAlwaysSecondsTimetimeValtimeIOwaitTill currentTimeFutureReactiveEvent_eventatTimesmkEvent//<*|><|*>groupEheadE mapFutureswithTimetimesmasksinkevent_future_time_valuefutureIO$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 replicaterepeatiteratescanr1scanrfoldr1scanl1scanlnullinitlasttailhead 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(->)$fMonadWriterwStateT$fMonadReaderrStateT$fMonadStateIOIO$fMonadInternalRWST$fMonadTransRWST$fMonadErroreRWST$fTraversableRWST$fFoldableRWST$fMonadWriterwRWST$fMonadReaderrRWST$fMonadStatesRWST$fMonadContRWST$fMonadFixRWST $fMonadRWST$fApplicativeRWST $fFunctorRWST $fUnitRWST"$fIsomorphic(->)(->)KleisliKleisli$fSplitKleisli$fChoiceKleisli$fCategoryKleisli $fMonadFix:.: $fMonadFixIO$fMonadFixEither $fMonadFix[]$fMonadFix(->) $fMonadFixId $fMonad:.: $fArrowListA $fSplitListA $fChoiceListA$fCategoryListA$fArrowKleisli$fApplyKleisli $fApply(->) $fArrow(->)Bimap_inverse$fDataMapFlipba$fDataMapBimapab $fFunctorMap $fMonoidMap$fSemigroupMap $fMonoidSet$fSemigroupSet$fDataMapMapka$fDataMapSetaVoid$fBoundedTimeVal$fTraversableTimeVal$fFoldableTimeVal$fMonadTimeVal$fApplicativeTimeVal $fUnitTimeVal$fFunctorTimeVal $fRingTime $fMonoidTime$fSemigroupTimemapTambunambseconds $fUnitTime $fBoundedTime$fOrderableTime $fOrdTime$fEqTime $fShowTimeEventRepgetEvent_EventcmpFutltFut$fOrderableFuture $fOrdFuture $fEqFuture $fMonadEvent$fApplicativeEvent $fMonoidEvent$fSemigroupEvent $fShowEvent$fApplicativeReactive$fFunctorReactive$fUnitReactive