jZ(N      !" # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M Graph indexed functors(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>7unstable | experimental | provisional | stable | frozen"portable | non-portable (<reason>)Safe+6DRGraph indexed functor.The fmap operation (N) on the graph index.Default instance:  Fmap f i = iThe fconst operation (O) on the graph index.Default instance:  Fconst f i =  f i &Map a function over over the functor (N).$Replace all values with a constant (O).8Default implementation requires the default instance of .(Base type class for graph indexed types.(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe*+,DR6Base class that all Graph-indexed types may implement.The unit of our kind p."An invariant on combining indexes.%An elementary composition of indexes.wN.B.: This may be nonsensical if and only if type classes override the default definitions of their own type families.This exists for convenience."Graph indexed applicative functors(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe +DRTf Graph indexed pointed functor. $The pure element of the graph index. (Return a pointed functor indexed by the   type instance (P).-:t gpoint @_ @(GWrapped Maybe) "Hello, World":: GWrapped Maybe () [Char] +Return a pointed functor indexed by a type t in the domain of p.(Accessible with type applications, e.g.:$:t gpoint' @_ @(GWrapped Maybe) @Int>gpoint' @_ @(GWrapped Maybe) @Int :: a -> GWrapped Maybe Int a     "Graph indexed applicative functors(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe +6:<=DR "Graph indexed applicative functor.The apply operation (Q) on the graph index.Default instance: Apply f i j =  f i j The then operation (R) on the graph index.Default instance:  f i j =  f ( f i) j The but operation (S) on the graph index.Default instance:  But f i j =  f ( f (  f) i) j Sequential application (Q).>Sequence actions, discarding the value of the first argument (R).8Default implementation requires the default instance of .<Sequence actions, discarding values of the second argument (S).8Default implementation requires the default instance of .    Graph indexed monads(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe +6:<=DRGraph indexed monad.The apply operation (T) on the graph index.Default instance:  Bind m i j =  m i j The join operation ( ) on the graph index.Default instance:  Join m i j =  m i j ISequentially compose two actions, with the second dependent on the first.&Remove one level of nested structure. 8Default implementation requires the default instance of .!Graph indexed monads with failure(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe +6:<=DR)Graph indexed monad with a monoidal zero.See the typeclassopedia  (https://wiki.haskell.org/Typeclassopedia.The zero element (mzero, U) of the graph index.Identity element.!Graph indexed monads with failure(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe +6:<=DR!Graph indexed monad with failure.&The unit failure element of the index.Default instance:  Fail m =  mFail with a message.8Default implementation requires the default instance of .,Graph indexed monads with choice and failure(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe +6:<=DRLGraph indexed monad with a monoidal operation satisfying the left catch law.See the typeclassopedia  (https://wiki.haskell.org/Typeclassopedia. The or operation (<|>) on the graph index.Default instance:  Or m i j =  m i j !!An associative binary operation (<|>). ! ! ! ! ,Graph indexed monads with choice and failure(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe +6:<=DR"SGraph indexed monad with a monoidal operation satisfying the left distribution law.See the typeclassopedia  (https://wiki.haskell.org/Typeclassopedia.#The or operation (mplus) on the graph index.Default instance:  Plus m i j =  m i j $!An associative binary operation (mplus)."#$"#$"#$"#$Graph indexed types(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>7unstable | experimental | provisional | stable | frozen"portable | non-portable (<reason>)Safe%  !"#$ 6Wrapped type constructors (typically Monad), graphted.(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe%&+DQR%$Wrap a non-indexed type constructor:(Lift an object to %. %&'()*+,-./01%&'( %&'(10/.-,+*) %&'()*+,-./01 BPrelude with operators overridden by graph-indexed implementations(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com> experimentalportableSafe %&)+.:Dc23456789:;<=>?@ABCDEFGHIJKLM VWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~U      !"#$%&'()*+,-./0123456789:;<=>?@ABC23456789:;<=>?@ABCDEFGHIJKLM23456789:;@=<>?BCDEAFGHIJKLM23456789:;<=>?@ABCDEFGHIJKLM34647484:1;1@1B4D !"#$%&'()*+,-./0 1 2 3 4 4 5 6 7 8 9 : ; < = > ? @ 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[\@[\A[\C[\D[\E[\F[\H[\][\^_`a[bc[bd[ef[gh[gi[\j[\k[\l[mn[mo[pq[pr[ps[pt[pu[pv[pw[px[py[pz[p{[p|_}~_}_}[[[[[[[[[[[[[[[[[[[[m[m[m[m[m[m[m[m[m[m[m[m[\[\[[[[[[[[_}_}_}_}_}_}_}_}[[[[m[m[[[[[[[[[[[[[[[[m[m[m[m[m[m[[[[[\[[[[[[[[[[[[[[[[[[[\[\[\_______[\[\[\____[m__[[[[e[e[e[e[e [e [e [e [e [e[e[e[[[[[[[[[[[[[ [!["#["$["%["&['[([)*[m+[m,[m-[m.[m/[m0[1[2[3[4[5[b6[b7[b8[b9[b:[b;[b<[b=[b>[b?[b@[bA[bB[bC[bD[bE[bF[bG[bH[bI[bJ[bK[bL[bM[bN[bO[bP[QR[gS[gT[U[\V[\W[\X[\Y[\Z[\[[\\[\][^_[^`[^a_}b_}c_}de'graphted-0.1.0.2-AYySOiwM6DeI7Rmy28AYQZData.Functor.GraphControl.Graphted.ClassData.Pointed.GraphControl.Applicative.GraphControl.Monad.GraphControl.MonadZero.GraphControl.MonadFail.GraphControl.MonadOr.GraphControl.MonadPlus.Graph Data.GWrappedPrelude.Graphted Control.MonadjoinControl.GraphtedGFunctorFmapFconstgmapgconstGraphtedUnitInvCombineGPointedPuregpointgpoint' GApplicativeApplyThenButgapgthengbutGMonadBindJoingbindgjoin GMonadZeroZerogzero GMonadFailFailgfailGMonadOrOrgorelse GMonadPlusPlusgplusGWrappedunGliftG$fGMonadOrTYPEGWrapped$fGMonadPlusTYPEGWrapped$fGMonadZeroTYPEGWrapped$fGMonadFailTYPEGWrapped$fGMonadTYPEGWrapped$fGApplicativeTYPEGWrapped$fGFunctorTYPEGWrapped$fGPointedTYPEGWrapped$fGraphtedTYPEGWrappedfmap<$<$>pure<*>*><*return>>==<<zerofail<+><|>>><**>liftAliftA2liftA3liftMliftM2liftM3liftM4liftM5apmapM_ sequence_baseGHC.Basemempty++ghc-primGHC.PrimseqGHC.Listfilterzip System.IOprint Data.Tuplefstsnd otherwisemap$GHC.Real fromIntegral realToFracGHC.EnumBoundedminBoundmaxBoundEnumfromEnumtoEnumenumFrom enumFromThen enumFromToenumFromThenTosuccpred GHC.ClassesEq==/= GHC.FloatFloatingpiexplogsqrt**logBasesincostanasinacosatansinhcoshtanhasinhacoshatanh Fractional fromRational/recipIntegral toIntegerquotremdivmodquotRemdivModMonadFunctorGHC.NumNum fromInteger-negate*+abssignumOrd>=minmax><<=compareGHC.ReadRead readsPrecreadListReal toRational RealFloat floatRadix floatDigits floatRange decodeFloat encodeFloatexponent significand scaleFloatisNaN isInfiniteisDenormalizedisNegativeZeroisIEEEatan2RealFracproperFractiontruncateroundceilingfloorGHC.ShowShow showsPrecshowshowList Applicative Data.FoldableFoldablefoldMapfoldrnulllengthfoldlfoldl1sumproductfoldr1maximumminimumelemData.Traversable TraversabletraversemapM sequenceAsequenceMonoidmappendmconcat GHC.TypesBoolFalseTrueCharDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerMaybeNothingJustOrderingLTEQGTRationalIOWord Data.EitherEitherLeftRightreadIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputChar Text.ReadreadreadsGHC.IO.ExceptionioErrornotElemallanyorand concatMapconcatGHC.IOFilePath userErrorIOErroreither Data.OldListunwordswordsunlineslineslex readParenText.ParserCombinators.ReadPReadSlcmgcd^^^oddeven showParen showStringshowCharshowsShowSunzip3unzipzipWith3zipWithzip3!!lookupreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlinitlasttailhead Data.MaybemaybeuncurrycurrysubtractasTypeOfuntil$!flip.constidStringGHC.Err undefinederrorWithoutStackTraceerror&&||not