fVK      ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ 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 fconst operation (L) on the graph index.Default instance:  Fconst 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>unstableportableNone*+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>unstableportableNone +DRT Graph indexed pointed functor. $The pure element of the graph index. (Return a pointed functor indexed by the   type instance (M).-:t gpoint @_ @(GWrapped Maybe) "Hello, World":: GWrapped Maybe () [Char]     "Graph indexed applicative functors(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableNone +6:<=DR "Graph indexed applicative functor. The apply operation (N) on the graph index.Default instance: Apply f i j =  f i j The then operation (O) on the graph index.Default instance:  f i j =   f ( f i) j The but operation (P) on the graph index.Default instance:  But f i j =   f (  f (  f) i) j Sequential application (N).>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>unstableportableNone +6:<=DRGraph indexed monad.The apply operation (Q) 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>unstableportableNone +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>unstableportableNone +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>unstableportableNone +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>unstableportableNone +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>)None$  !"# 6Wrapped type constructors (typically Monad), graphted.(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com>unstableportableNone %&+DQR$$Wrap a non-indexed type constructor:'Lift an object to $. $%&'()*+,-./0$%&' $%&'0/.-,+*)( $%&'()*+,-./0 BPrelude with operators overridden by graph-indexed implementations(c) Aaron FrielBSD-3%Aaron Friel <mayreply@aaronfriel.com> experimentalportableNone %&)+:Dc123456789:;<=>?@ABCDEFGHIJ STUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~R      !"#$%&'()*+,-./0123456789:;<=>?@123456789:;<=>?@ABCDEFGHIJ123456789:?<;=>ABCD@EFGHIJ123456789:;<=>?@ABCDEFGHIJ2454647491:1?1A4A !"#$%&'()*+,-./ 0 1 2 3 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 WXY?XY@XYBXYCXYDXYEXYGXYZXY[\]^X_`X_aXbcXdeXdfXYgXYhXYiXjkXjlXmnXmoXmpXmqXmrXmsXmtXmuXmvXmwXmxXmy\z{\z|\z}X~X~X~X~X~X~X~X~X~X~X~X~X~X~X~X~X~X~X~XjXjXjXjXjXjXjXjXjXjXjXjXYXYXXXXXXXX\z\z\z\z\z\z\z\zXXXXjXjX~X~X~X~X~X~X~X~X~X~X~X~X~X~X~XjXjXjXjXjXjXXXXXYXXXXXXXXXXXXXXXXXXXYXYXY\\\\\\\XYXYXY\\\\Xj\\XXXXbXbXbXbXbXbXbXb Xb Xb Xb Xb XXXXXXXXXXXXXXX X!X"X#X$X%X&'Xj(Xj)Xj*Xj+Xj,Xj-X.X/X0X1X2X_3X_4X_5X_6X_7X_8X_9X_:X_;X_<X_=X_>X_?X_@X_AX_BX_CX_DX_EX_FX_GX_HX_IX_JX_KX_LX_MXNOXdPXdQXRXYSXYTXYUXYVXYWXYXXYYXYZX[\X[]X[^\z_\z`\zab'graphted-0.1.5.0-CvqLncrz3noJt9ydbMi3QVData.Functor.GraphControl.Graphted.ClassData.Pointed.GraphControl.Applicative.GraphControl.Monad.GraphControl.MonadZero.GraphControl.MonadFail.GraphControl.MonadOr.GraphControl.MonadPlus.Graph Data.GWrappedPrelude.Graphted Control.MonadjoinControl.GraphtedGFunctorFmapFconstgmapgconstGraphtedUnitInvCombineGPointedPuregpoint GApplicativeApplyThenButgapgthengbutGMonadBindJoingbindgjoin GMonadZeroZerogzero GMonadFailFailgfailGMonadOrOrgorelse GMonadPlusPlusgplusGWrappedunGliftG$fGMonadOrTYPEGWrapped$fGMonadPlusTYPEGWrapped$fGMonadZeroTYPEGWrapped$fGMonadFailTYPEGWrapped$fGMonadTYPEGWrapped$fGApplicativeTYPEGWrapped$fGFunctorTYPEGWrapped$fGPointedTYPEGWrapped$fGraphtedTYPEGWrappedfmap<$<$>pure<*>*><*return>>==<<zerofail<+><|>>><**>liftAliftA2liftA3liftMliftM2liftM3liftM4liftM5apbaseGHC.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