n h      !"#$%&'()*+ , - . / 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 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 (h) on the graph index.Default instance:  Fmap f i = iThe fconst operation (i) on the graph index.Default instance:  Fconst f i =  f i &Map a function over over the functor (h).$Replace all values with a constant (i).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 (j).,: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 (k) 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 then operation (l) 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 (m) on the graph index.Default instance:  But f i j =  f ( f (  f) i) j An invariant on the indexes of .Default instance: ButInv m i j =  m i jSequential application (k).>Sequence actions, discarding the value of the first argument (l).8Default implementation requires the default instance of .<Sequence actions, discarding values of the second argument (m).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 (n) 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 jThe 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 jISequentially 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, o) 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 j-An invariant on the indexes of ,.Default instance: PlusInv 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 %&+DQR1$Wrap a non-indexed type constructor:4Lift an object to 1./0123456789:;<=/01234123/04=<;:98765 /0123456789:;<= 6Wrapped type constructors (typically Monad), graphted.(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableNone%&*+,-DQRT@.Wrap a two-parameter-indexed type constructor:CLift an object to @.>?@ABCDEFGHIJK>?@ABC@AB?>KCJIHGFED >?@ABCDEFGHIJK BPrelude with operators overridden by graph-indexed implementations(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com> experimentalportableSafe %&)+.:DcLMNOPQRSTUVWXYZ[\]^_`abcdefg pqrstuvwxyz{|}~o      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]LMNOPQRSTUVWXYZ[\]^_`abcdefgLMNOPQRSTUZWVXY\]^_[`abcdefgLMNOPQRSTUVWXYZ[\]^_`abcdefgM4P4Q4R4T1U1Z1\4^ !"#$%&'()*+,-./0123456789:;< = > ? @ A A B 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 [ \ ] ^ _ ` a b c d e f g h i  j k l m n o p q r s t uvw[vw\vw^vw_vw`vwavwcvwxvwyz{v|}v|~vvvvwvwvwvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvwvwvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvwvvvvvvvvvvvvvvvvvvvwvwvw     vwvwvwvvvvvvv v!v"v#v$v%v&v'v(v)v*+v*,v-.v/v0v1v2v3v4v5v67v-8v-9v:v;<v;=v;>v;?v@vAvBCvDvEvFvGvHvIvJvKvLvMvNv|Ov|Pv|Qv|Rv|Sv|Tv|Uv|Vv|Wv|Xv|Yv|Zv|[v|\v|]v|^v|_v|`v|av|bv|cv|dv|ev|fv|gv|hv|ivjkvlvmvnvwovwpvwqvwrvwsvwtvwuvwvvwxvwyvwz{|}~'graphted-0.2.5.1-3tnb5jVebdu2LOz8RnxvH8Control.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 ConstraintGFunctorFmapFconstgmapgconstGraphtedUnitInvCombineGPointedPurePureCxtgpuregpure'gpureAt GApplicativeApplyApplyInvThenThenInvButButInvgapgthengbutGMonadBindBindInvJoinJoinInvgbindgjoin 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