t      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw x y z { | } ~                                                                                 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None*123468>BEHJKM -A range of shape (min,max) of ordered values.{Such ranges may be multiplied to create n-dimensional ranges for which equivalence means sharing an n-dimensional subrange. They may be very useful in creating Maps that partition an n-dimensional space in which we may query for subrange membership with logarithmic complexity for any point P (a point is a subrange of volume 0, or `(pure x0,...,pure xn) where (x0,..,xn) = p`).FIndeed, a point is equivalent to a range iff it belongs to that range.hAn ordered list. The semigroup instance merges two lists so that the result remains in ascending order.JThe dual of a monoid is the same as the original, with arguments reversed The Min monoid, where  (+) =~ min The Max monoid, where  (+) =~ max The Identity Functor EA monoid on Maybes, where the sum is the leftmost non-Nothing value. &5A monoid on category endomorphisms under composition )The Product monoid B6A monoid is a semigroup with a null element such that zero + a == a + zero == aDThe class of all types that have a binary operation. Note that the operation isn't necesarily commutative (in the case of lists, for example)Range equivalence. Two ranges are equivalent iff they share a common subrange (equivalence in this case is not transitive, so beware of unintended consequences)r < r' iff all values of r are below any value of r'  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|     2 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|zISVY\JTWZ]UX[^HGFDEBC=>?;<9:678@A45&'(#$%)*+ !"2301_`g./,-KLMNOPQRpezfqihkldjorstmnywvxbcua {|   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|      -/3 <E_`egwNone%*123468>BEHJKM,The class of all monads that have a fixpoint.}~.}~.}~}~None%*123468>BEHJKMThe Composition functorA motherflippin' functorA functor for ordered listsThe Constant FunctorThe Contravariant version of traverseM..=None%*23468>BEHJKMMA wrapper for applicative functors with actions executed in the reverse orderGA wrapper type for lists with zipping Applicative instances, such that Zip [f1,...,fn] ) Zip [x1,...,xn] == Zip [f1 x1,...,fn xn]4   F0   None %*23468>BEGHJKM  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)8An infix synonym for         !"#$%&'()*+,-./0123456789:;<=>? !"#$%&'()*+,-./0123456789:V      !"#$%&'()*+,-./0123456789:;<=>?V     "#? !$9%&;<6+,.-021/345=>:7'()*8x        !"#$%&'()*+,-./0123456789:;<=>? !"#$%&'()*+,-./0123456789:   8 None%*23468>BEHJKMdHLazily counts the number of elements in a structure up to a certain size7@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuv%@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd7vutsrqponmlkjihgfe@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd7@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuv None%*23468>BEHJKMwxyz{|};<=>?@ABCDEFGHIt@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdwxyz{|} z{}|xywwxyz{|};<=>?@ABCDEFGHI None%*23468>BEHJKM?~JKLMNOPQRSTUVWXYZ[\]^_`abcdefghij> !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdwxyz{|}~~<~JKLMNOPQRSTUVWXYZ[\]^_`abcdefghij None%*23468>BEHJKM!klmnopqrstuvwxyz{klmnopqrstuvwxyz{ None%*23468>BEHJKM$|}~"|}~ None%*23468>BEHJKMA simple Reader monad  None%*23468>BEHJKM3The canonical representsation of a WriterAcc Monad A simple Writer monad None%*23468>BEHJKM,A simple continuation monad implementation    None%*23468>BEHJKM  None%*23468>BEHJKM    None%*23468>BEHJKM6      !"#6#"!      .      !"#None%*23468>BEHJKM$%&'()*+,-./0123456789 $%&'()*+,-'()9876543210/$%&.*+,-$%&'()*+,-./0123456789None%*23468>BEHJKM !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdwxyz{|}~$%&'()*+,-None%*123468>BEHJKM:;<=>?@ABCDE !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdwxyz{|}~$%&'()*+,-:;<=>?@ABCDE?@BA=>DEC:;<:;<=>?@ABCDEABNone%*23468>BEHJKM !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdwxyz{|}~$%&'()*+,-:;<=>?@ABCDENone %*23468>BEHJKMHAn invertible mapd(Define a Relation from its ranges. O(1)  - O(1,n*ln(n)) eADefine a Relation from its domain (uses the Commutative instance)HFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk(FGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk(PQNOJKLMWXVY\Z]^_`[ijRTSUHIabFGcedfghkBFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkNone%*23468>BEHJKM*lmnopqrstuvwxyz{|}~ lmnopqrstuvwxyz{|}~qrnopstmlwxuvz y{|}~#lmnopqrstuvwxyz{|}~None%*23468>BEHJKM !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdwxyz{|}~$%&'()*+,-:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None%*23468>BEHJKMMA type wrapper that adds a Bounded instance for types that don't possess one.    None%*23468>BEHJKM None%*23468>BEHJKM     !"!#!$%&'()'*+,-.//0112233455677899:;;<==>??@AABCCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                        !"#$%&'()*+,-./00123456789:;<=>?@ABBCDEFGHIJKLMMNNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      ! "#$%&'()(*(+(,-.-/&0&1&2&3(4(5-678&9&:$;-<=>&?7@&ABCDEDFDGDHDIJKLDM&NDOPQ RDSDTPUPVDWDXDYZ[\]^_`abcdefghijkjljmjnjopqhrhstutvPw=x=y=z={7|7}7~77777777777777777777777777777&&&&&&&&&&&&&&&&&((((((BBBBBBBBZZZ$$$  ----------      !"#$%&&''()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ R S T U V W X Y Z [ \ ] ^ _ ` 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 { | } ~                                      q     definitive-base-2.3 Algebra.CoreData.ContainersData.Containers.SequenceAlgebra.ClassesAlgebra.FunctorAlgebra.Applicative Algebra.LensAlgebra.FoldableAlgebra.TraversableAlgebra.Monad.BaseAlgebra.Monad.RWSAlgebra.Monad.StateAlgebra.Monad.ReaderAlgebra.Monad.WriterAlgebra.Monad.ContAlgebra.Monad.FoldableAlgebra.Monad.ErrorAlgebra.Monad.FreeAlgebra.Monad.Logic Algebra.Arrow Definitive Data.TimeVal Data.QueueData.Probability Algebra.MonadDefinitive.Basebase Data.String fromStringIsStringGHC.IO.Handle.TypesHandleGHC.IO.Handle.FDstderrstdinstdoutData.Ord comparingcontainers-0.5.5.1 Data.Map.BaseMap Data.Set.BaseSetvector-0.10.12.1Data.Vector.Storable unsafeWith Interleave interleaveRangeAssocOrdList getOrdListDualgetDualMingetMinMaxgetMaxIdgetIdAccumgetAccum StrictEndo runStrictEndoEndorunEndoProduct getProductSplit<#>Choice<|>Categoryid Deductive.Unitpure Invertiblerecip/RingoneSemiring* Disjonctivenegate-SubSemicastMonoidzero Semigroup+:+::*:VoidBytesChunk Constraintc'listOfc'listc'intc'charc'stringc'floatc'_ readBytes readChunk readString writeBytes writeChunk writeString readHBytes readHChunk readHString writeHBytes writeHChunk writeHString<<<>>>associnOrder insertOrdextreme&is+++secondfirstguard ifThenElsebooltailSafeheadDeffailconstfixunitwhenunless invertOrdinsidermodswap fromMaybe$^ambunamb MonadFuturefuture MonadErrorthrowcatch MonadContcallCC MonadListforkMonadIOliftIO MonadCounter getCounter MonadWritertelllistencensor MonadReaderasklocal MonadStategetputmodify ConcreteMonad generalize MonadTransliftMonadFixmfix TraversablesequenceFoldablefoldComonad duplicate=>>CounitextractMonadjoin>>= Applicative<*>Functormap:++:SumgetSum:**::.:Compose getComposeFlipunFlip IncreasingConstgetConstStrictlazy Commutativecommute Bifunctordimap Contravariantcollect Cofunctorcomapflipprojectfactoremerge<$>|||<&><$leftrightvoidmap2map3promap BackwardsforwardsZipdeZipc'zipzipWithzipWith3 c'backwardsap*><*<**>foreverliftAliftA2liftA3liftA4plusAzeroAbetween IsoFunctor2mapIso2 IsoFunctormapIso Isomorphici'_CompoundeachTrav2t'rTrav1t'lLens5l'5Lens4l'4Lens3l'3Lens2l'2Lens1l'1:<->:Iso'IsoFold'Fold Traversal' TraversalGetter'GetterLens'LensLensLikeisofromlensgetterprismsimplesat.+^.^..%~%%~%-%%-^?^??-..-byybwarpsetforlforl_i'listt'headt'tailmappingmapping' promappingapplyingi'Id i'OrdListi'Duali'Consti'Maxi'Endoi'maybei'Flip i'Compose i'Backwardsi'Accumcurriedwarp2<.>i'pairaddingthunkchunknegatedcommutedhasfoldMapconvertconcatsumproductnzsumsizelengthmaximum maximumByminimum minimumBy sequence_ traverse_for_splitpartitionEithers partitionselectrefusecompose composingiterfoldrfoldr1foldl'foldl1'toListfindorandallanyelememptynonemptysizeTo$fMonadInterleave$fApplicativeInterleave $fMonadMaybe$fApplicativeMaybe $fMonad[]$fApplicative[]$fFoldable:++:$fFoldable:**: $fSubSeminf $fFoldable:.:$fFoldableAssoc$fFoldableTree $fFoldable[] $fFoldable(,)$fFoldableMaybe$fFoldableEither$fFoldableStrict $fFoldableId coerceSeq convertedfoldedtraversefordoTimes transposeCompose'Kleisli runKleisliAction'Actionmfix_mfixing i'KleislifoldlMfoldrMfindMwhileuntilbind2>>>=bind3>>>>=>>=<<<=<>=><*=onlyreturnjoinMap coerceJoincoerceDuplicate i'Compose' MonadInternalinternalRWSRWSTrunRWST_RWSTget_put_modify_ask_local_tell_listen_censor_ getCounter_PrevNextStateAStateStateTstateTevalexecstate=-=~^>=getsusesavingstateAmapAccum mapAccum_ mapAccumR mapAccumR_pushpopwithPrevwithNextReaderReaderTreaderTreaderCounterCounterTWriterWriterTmute intercept eavesdrop intercept'writerTwriter pureWriter i'counterT i'counterContContTrunContT>>~contTcontStrictTMaybeTTreeTListTlistTtreeTmaybeTstrictTEitherTtryoptional!+eitherTthrowIOContCrunContCBifreeColistInfiniteCofreeStep MonadFreestepperformliftFFreePureJoinconcreteunliftFmapF coerceStep coercePerform coerceLiftFcontC$fCategoryContC$fDeductiveContC $fMonadCofree$fApplicativeCofree $fUnitCofree$fTraversableCofree$fFoldableCofree$fComonadCofree$fCounitCofree$fFunctorCofree$fMonadFreemFree$fMonadErroreFree$fMonadFuturemFree$fMonadListFree $fMonadIOFree$fMonadCounterwaFree$fMonadWriterwFree$fMonadReaderrFree$fMonadStatesFree$fConcreteMonadFree$fMonadTransFree$fTraversableFree$fFoldableFree$fMonadFixFree $fOrdFree$fEqFree $fComonadFree $fCounitFree $fMonadFree$fApplicativeFree $fUnitFree $fFunctorFree MonadLogicdeduceinduceLogicT runLogicT listLogic deduceMany deduceAllchoose$fMonadLogicLogicTm$fMonadStatesLogicT $fRingLogicT$fSemiringLogicT$fMonoidLogicT$fSemigroupLogicT$fMonadTransLogicT$fMonadFixLogicT $fMonadLogicT$fApplicativeLogicT $fUnitLogicT$fFunctorLogicTListArunListAApplyapplyArrowarr^>>>>^dupcomapAappRelationBimap OrderedMapascList ContainerweightIndexedkeyedDataMapatc'setOfc'mapOfc'setc'mapmemberlookupresidesdeleteinsert#touch singleton singleton' fromAList fromKListtoMapkeysSet i'Relationi'ranges i'domainsl'domainl'rangelink#?cached*>>>SlicesSliceStreamunconsconsSequencesplitAttakedrop i'storables_SlicessliceslicessliceEltbreadthspanbreak takeWhile dropWhile takeUntil dropUntilpry++i'elemstracetrace2mtracedebugcliTimeValNeverSinceAlways DirectionisFrontQueuedequeDeQueBackFrontc'queuec'frontc'backqueue$fStreamaQueue$fDirectionBack$fDirectionFront$fTraversableQueue$fTraversableDeQue$fFoldableDeQue$fFunctorDeQue$fSemigroupDeQueProbProbTi'ProbTprobTprobc'probsample$fMonadListProbT $fMonadProbT $fEqRange $fOrdRangec'couple$fSemigroupInterleave $fUnitRange $fOrdAssoc $fEqAssoc$fSemigroupOrdList $fRingDual$fSemiringDual$fSemigroupDual $fRingMin $fSemiringMin $fMonoidMin$fSemigroupMin $fBoundedMin$fOrdMin $fRingMax $fSemiringMax $fMonoidMax$fSemigroupMax $fSemigroupId$fUnitId$fShowId $fUnitAccum $fMonoidAccum$fSemigroupAccum$fSemigroupStrictEndo $fMonoidEndo$fSemigroupEndo$fMonoidProduct$fSemigroupProduct $fSplit(->) $fChoice(->)$fCategory(->)$fDeductive(->)$fUnitIO $fUnitTree$fUnit[] $fUnit(->) $fUnit(,) $fUnitMaybe $fUnitEither$fInvertibleDouble$fInvertibleFloat$fInvertibleRatio $fRing(,) $fSemiring(,)$fRing[] $fSemiring[] $fRingDouble$fSemiringDouble $fRingFloat$fSemiringFloat $fRingInteger$fSemiringInteger $fRingRatio$fSemiringRatio $fRingInt $fSemiringInt $fRingBool$fSemiringBool$fDisjonctive(,)$fDisjonctiveBool$fDisjonctiveDouble$fDisjonctiveFloat$fDisjonctiveRatio$fDisjonctiveInteger$fDisjonctiveInt $fSubSemiaa$fSubSemiaVoid $fSubSemia() $fMonoidMaybe $fMonoidBool$fMonoidEither $fMonoid(,,) $fMonoid(,) $fMonoid[]$fMonoidByteString$fMonoidByteString0$fMonoidDouble $fMonoidFloat $fMonoidRatio$fMonoidInteger $fMonoidInt $fMonoid() $fMonoidVoid$fSemigroupMaybe$fSemigroupEither$fSemigroup(,,)$fSemigroup(,) $fSemigroup[]$fSemigroupByteString$fSemigroupByteString0$fSemigroupDouble$fSemigroupFloat$fSemigroupRatio$fSemigroupInteger$fSemigroupInt$fSemigroupBool $fSemigroup()$fSemigroupVoidGHC.Errerrorghc-primGHC.PrimseqGHC.Listzip System.IOprint Data.TuplefstsndGHC.Base otherwise$ undefinedGHC.Num fromIntegerGHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>= fromIntegral realToFrac toInteger toRationalBoundedEnumEq GHC.FloatFloating FractionalIntegralNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShow GHC.TypesBoolCharDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerOrderingRationalIO Data.EitherEitherStringFalseTrueLeftRightLTEQGT Data.MaybeNothingPrelude$!readIOreadLn appendFileinteract getContentsgetLinegetCharputStrLnputStrputCharGHC.IO.ExceptionioError Data.Listunwordswordsunlineslinesfoldl1GHC.IOFilePath userErrorIOError Text.Readreadreadseitherlex readParenreadList readsPrecacoshatanhasinhcoshtanhsinhacosatanasincostansinlogBase**logsqrtexppiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadixlcmgcd^^^oddevendivModquotRemmoddivremquotfloorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumpredsuccText.ParserCombinators.ReadPReadS showParen showStringshowCharshowsShowSshowListshow showsPrecunzip3unzipzip3!! concatMapnotElemreversecycle replicaterepeatiteratescanr1scanrscanl1scanlnullinitlasttailheadmaybeJustMaybeuncurrycurrysubtractsignumabsasTypeOf/=compare<=&&||not<>maxmin $fMonadIO$fApplicativeIO $fFunctorIO $fFunctor(->) $fFunctor(,)$fFunctorMaybe$fFunctorEither $fFunctor:++: $fFunctor:**:$fContravariant:.: $fFunctor:.: $fUnit:.:$fMonoidIncreasing$fSemigroupIncreasing$fFunctorAssoc$fApplicativeConst $fUnitConst$fFunctorConst $fMonoidConst$fSemigroupConst $fMonadStrict$fApplicativeStrict$fFunctorStrict $fUnitStrict $fMonadId$fApplicativeId $fFunctorId $fFunctorTree $fFunctor[]$fCommutative(,)$fContravariant(->)$fContravariantStrict$fContravariantId$fBifunctor(->)$fCofunctorFlip$fCofunctor:.:oneAtimesA $fMonoid:.:$fSemigroup:.:$fApplicativeBackwards$fApplicativeZip $fUnitZip$fApplicativeZip0 $fUnitZip0 $fFunctorZip $fMonoidZip$fSemigroupZip$fApplicative:.: $fMonadTree$fApplicativeTree$fApplicative:**: $fUnit:**:$fMonadIncreasing$fApplicativeIncreasing $fUnitAssoc $fMonad(,)$fApplicative(,) $fMonad(->) $fRing(->)$fSemiring(->) $fMonoid(->)$fSemigroup(->)$fApplicative(->) $fMonadEither$fApplicativeEitherTestIsoTSimpleisoTunIsoT$fIsoFunctor2Either$fIsoFunctor2(,)$fIsoFunctor2(->)$fIsoFunctor(->)$fIsomorphicab(,)(,)$fIsomorphicff':.::.:$fIsomorphicBoolBoolMaybeMaybe$fIsomorphicffFlipFlip$fIsomorphickkEndoEndo$fIsomorphicabMaxMax$fIsomorphicabProductProduct$fIsomorphicabDualDual$fIsomorphicabConstConst$fIsomorphic[][]OrdListOrdList$fIsomorphicabIdId$fCompoundabEitherEither$fCompoundab(,,)(,,)$fCompoundab(,)(,)$fTrav2abMaybeMaybe$fTrav2abEitherEither $fTrav1ab[][]$fTrav1abEitherEither$fLens5ab(,,,,)(,,,,)$fLens4ab(,,,,)(,,,,)$fLens4ab(,,,)(,,,)$fLens3ab(,,,,)(,,,,)$fLens3ab(,,,)(,,,)$fLens3ab(,,)(,,)$fLens2ab(,,,,)(,,,,)$fLens2ab(,,,)(,,,)$fLens2ab(,,)(,,)$fLens2ab(,)(,)$fLens1ab(,,,,)(,,,,)$fLens1ab(,,,)(,,,)$fLens1ab(,,)(,,)$fLens1ab(,)(,) $fLens1aa[][]$fBifunctorIsoT $fFunctorIsoT$fCompoundab[][]$fTraversableStrict$fTraversableMaybe$fTraversable:++:$fTraversable:**:$fTraversable:.:$fTraversableTree$fTraversableZip$fTraversableAssoc$fTraversableIncreasing$fTraversableOrdList$fTraversableInterleave$fTraversable[]$fTraversableEither$fTraversable(,)cfixfolding$fTraversableCompose'$fMonadCompose'$fConcreteMonadCompose'$fMonadTransCompose'"$fIsomorphic(->)(->)KleisliKleisli$fSplitKleisli$fChoiceKleisli$fCategoryKleisli$fDeductiveKleisli$fContravariantKleisli$fFunctorKleisli$fConcreteMonadBackwards$fMonadTransBackwards$fMonadFixBackwards$fMonadFuturemBackwards$fMonadBackwards$fMonadReaderr:.:$fMonadWriterw:.:$fMonadStates:.:$fConcreteMonad:.:$fMonadTrans:.: $fMonadFix:.: $fMonad:.: $fMonadFixIO$fMonadFixEither $fMonadFix[]$fMonadFix(->)$fMonadFixStrict $fMonadFixId $fMonadIOt $fMonadIOIO$fMonadFuturenRWST$fMonadInternalRWST$fConcreteMonadRWST$fMonadTransRWST$fMonadListRWST$fMonadErroreRWST$fTraversableRWST$fFoldableRWST$fMonadWriterwRWST$fMonadReaderrRWST$fMonadStatesRWST$fMonadContRWST$fMonadFixRWST $fMonadRWST$fApplicativeRWST $fFunctorRWST $fUnitRWST_StateT$fChoiceStateA $fSplitStateA$fCategoryStateA$fDeductiveStateA$fMonadCounterwaccStateT$fMonadWriterwStateT$fMonadReaderrStateT $fMonadStateT$fMonadStateIOIO$fMonadCounterwaccReaderT$fMonadWriterwReaderT$fMonadStatesReaderT$fMonadReaderT$fMonadReaderr(->)WArunWA i'CounterT$fMonadStatesCounterT$fMonadCounterwaccCounterT$fMonadWriterwCounterT$fMonadCounterT$fMonadStaterWriterT$fMonadReaderrWriterT$fTraversableWriterT$fMonadWriterT$fMonadWriterw(,)$fMonadFixContT$fMonadContContT$fMonadTransContT $fMonadContT$fApplicativeContT$fFunctorContT $fUnitContT$fTraversableStrictT$fMonadStrictT$fTraversableMaybeT $fMonadMaybeT$fTraversableTreeT $fMonadTreeT$fMonadErrorVoidListT$fMonadWriterwListT$fMonadStatesListT$fMonadFixListT$fMonadListListT$fTraversableListT $fMonadListT $fMonadList[]$fMonadErrorSomeExceptionIO$fMonadErrorVoidMaybe$fTraversableEitherT$fMonadEitherT$fMonadErrorVoid[]$fMonadErroreEither $fArrowListA $fSplitListA $fChoiceListA$fCategoryListA$fDeductiveListA$fArrowKleisli$fApplyKleisli $fApply(->) $fArrowStateA $fArrow(->)may$fDataMapRelationkSet$fCommutativeRelation$fSemiringRelation$fSemigroupRelation$fOrderedMapBimapabBimapcd$fDataMapFlipba$fDataMapBimapab$fCommutativeBimap $fIndexedMapk$fTraversableMap $fFoldableMap $fFunctorMap $fSemiringMap$fDisjonctiveMap $fMonoidMap$fSemigroupMap $fFoldableSet $fFunctorSet $fSemiringSet$fDisjonctiveSet $fMonoidSet$fSemigroupSet$fOrderedMapMapkaMapk'a' $fDataMap[]ka$fDataMapMapka$fOrderedMapSetaVoidSetbVoid$fDataMapSetaVoid$fContainerMap$fContainerSet $fContainer[]$fIndexed[]IntStreamCPMonad runPMonad$fStreamaStreamC$fDataMapVectorInta $fMonadPMonad$fFunctorPMonad$fSequenceSlices$fStreamCharByteString $fStreama[]$fSequenceVector$fSequenceByteString $fSequence[]$fMonoidVector$fSemigroupVectorBooleanBoolNodeTruthMinimumMaximum shortCircuit$fTraversableBoolean$fMonadBoolean $fOrdBoolNode $fEqBoolNode$fTraversableBoolNode$fFoldableBoolNode$fFunctorBoolNode$fUnitBoolNode$fBoundedTimeVal$fTraversableTimeVal$fFoldableTimeVal$fMonadTimeVal$fApplicativeTimeVal $fUnitTimeVal$fFunctorTimeVal