qk      !"#$%&'()*+,-. / 0 1 2 3 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 b c d e f g h i j 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 (k) on the graph index.Default instance:  Fmap f i = iThe Replace operation (l) on the graph index.Default instance: Replace f i =  f i &Map a function over over the functor (k).$Replace all values with a constant (l).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*+6DOPRTf Graph indexed pointed functor. $The pure element of the graph index. OA constraint on generating a pure index from a free variable. Default is empty. (Return a pointed functor indexed by the   type instance (m).,:t gpure @_ @(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 gpure' @_ @(GWrapped Maybe) @Int=gpure' @_ @(GWrapped Maybe) @Int :: a -> GWrapped Maybe Int a8Return a pointed functor with a given type in the index.(Accessible with type applications, e.g.::t gpureAt @Int;gpureAt @Int :: (GPointed f, PureCxt f Int) => a -> f Int a     "Graph indexed applicative functors(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe+6:<=DOPRT "Graph indexed applicative functor.The apply operation (n) on the graph index.Default instance: Apply f i j =   f i j An invariant on the indexes of .Default instance: ApplyInv m i j =  m i jThe liftA2 operation on the graph index.Default instance:  Lift f i j =  f ( f (  f) i) j An invariant on the indexes of .Default instance: ButInv m i j =  m i jThe then operation (o) on the graph index.Default instance:  f i j =  f ( f i) j An invariant on the indexes of .Default instance: ThenInv m i j =  m i jThe but operation (p) on the graph index.Default instance:  But f i j =  f i j An invariant on the indexes of .Default instance: ButInv m i j =  m i jSequential application (n)."Lift a binary function to actions.>Sequence actions, discarding the value of the first argument (o).8Default implementation requires the default instance of .<Sequence actions, discarding values of the second argument (p).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 (q) on the graph index.Default instance:  Bind m i j =   m i j An invariant on the indexes of .Default instance: BindInv m i j =  m i j The join operation ( ) on the graph index.Default instance:  Join m i j =  m i j !An invariant on the indexes of  .Default instance: JoinInv 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, r) 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 =  m)Fail 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:<=DR*LGraph 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 invariant on the indexes of +.Default instance: OrInv 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 j0An invariant on the indexes of /.Default instance: PlusInv m i j =  m i j1!An associative binary operation (mplus)../01./01./01./01Graph indexed types(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>7unstable | experimental | provisional | stable | frozen"portable | non-portable (<reason>)Safe2  !"#$%&'()*+,-./01 6Wrapped type constructors (typically Monad), graphted.(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableSafe %&+DQR4$Wrap a non-indexed type constructor:7Lift an object to 4.23456789:;<=>?@234567456237@?>=<;:98 23456789:;<=>?@ 6Wrapped type constructors (typically Monad), graphted.(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableNone%&*+,-DQRTC.Wrap a two-parameter-indexed type constructor:FLift an object to C.ABCDEFGHIJKLMNABCDEFCDEBANFMLKJIHG ABCDEFGHIJKLMN BPrelude with operators overridden by graph-indexed implementations(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com> experimentalportableSafe %&)+.:DcOPQRSTUVWXYZ[\]^_`abcdefghij stuvwxyz{|}~r      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`OPQRSTUVWXYZ[\]^_`abcdefghijOPQRSTUVWX]ZY[\_`ab^cdefghijOPQRSTUVWXYZ[\]^_`abcdefghijP4S4T4U4W1X1]1_4a !"#$%&'()*+,-./0123456789:;<=>? @ A B C D D E E F G H I J K L M N O P Q R S 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 xyz^yz_yzayzbyzcyzdyzfyz{yz|}~yyyyyyzyzyzyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzyzyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzyyyyyyyyyyyyyyyyyyyzyzyz     yzyzyzyyyy y!y"y#y$y%y&y'y(y)y*y+y,y-.y-/y01y2y3y4y5y6y7y8y9:y0;y0<y=y>?y>@y>Ay>ByCyDyEFyGyHyIyJyKyLyMyNyOyPyQyRySyTyUyVyWyXyYyZy[y\y]y^y_y`yaybycydyeyfygyhyiyjykylymnyoypyqyzryzsyztyzuyzvyzwyzxyzyyz{yz|yz}~'graphted-0.3.0.0-Fu71xDVTQ8fLYYXjSjuK45Control.Graphted.ClassData.Functor.GraphData.Pointed.GraphControl.Applicative.GraphControl.Monad.GraphControl.MonadZero.GraphControl.MonadFail.GraphControl.MonadOr.GraphControl.MonadPlus.Graph Data.GWrappedData.GWrappedIxPrelude.Graphted Control.MonadjoinControl.Graphtedghc-prim GHC.Types ConstraintGFunctorFmapReplacegmapgreplaceGraphtedUnitInvCombineGPointedPurePureCxtgpuregpure'gpureAt GApplicativeApplyApplyInvLiftA2 LiftA2InvThenThenInvButButInvgapgliftA2gthengbutGMonadBindBindInvJoinJoinInvgbindgjoin GMonadZeroZerogzero GMonadFailFailgfailGMonadOrOrOrInvgorelse GMonadPlusPlusPlusInvgplus SingletonGWrappedunGliftG$fGMonadOrTYPEGWrapped$fGMonadPlusTYPEGWrapped$fGMonadZeroTYPEGWrapped$fGMonadFailTYPEGWrapped$fGMonadTYPEGWrapped$fGApplicativeTYPEGWrapped$fGFunctorTYPEGWrapped$fGPointedTYPEGWrapped$fGraphtedTYPEGWrappedSndIxFstIx WrappedIxunIxliftIx$fGMonadPlus(,)WrappedIx$fGMonadZero(,)WrappedIx$fGMonadFail(,)WrappedIx$fGMonad(,)WrappedIx$fGApplicative(,)WrappedIx$fGFunctor(,)WrappedIx$fGPointed(,)WrappedIx$fGraphted(,)WrappedIxfmap<$<$>pure<*>*><*return>>==<<zerofail<+><|>>><**>liftAliftA2liftA3liftMliftM2liftM3liftM4liftM5apmapM_ sequence_baseGHC.Basemempty++GHC.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 sequenceAsequenceMonoidmappendmconcatBoolFalseTrueCharDoubleFloatInt 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