)      !"#$%&'( Safe )*+,-./012345*012345 )*+,-./012345(C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone%&16CA mapping of type variable Names to their auxiliary function Names.7EWhether a type is not of kind *, is of kind *, or is a kind variable.8BExpands all type synonyms in a type. Written by Dan Rosn in the  genifunctors package (licensed under BSD3).98Does a Type have kind * or k (for some kind variable k)?:Returns ; the kind variable < of a 7# if it exists. Otherwise, returns =.>jConcat together all of the StarKindStatuses that are IsKindVar and extract the kind variables' Names out.?"Boilerplate for top level splices.-The given Name must meet one of two criteria: JIt must be the name of a type constructor of a plain data type or newtype.NIt must be the name of a data family instance or newtype instance constructor.,Any other value will result in an exception.@6Deduces the instance context and head for an instance.AAttempt to derive a constraint on a Type. If successful, return Just the constraint and any kind variable names constrained to *. Otherwise, return Nothing and the empty list.dSee Note [Type inference in derived instances] for the heuristics used to come up with constraints.BEither the given data type doesn't have enough type variables, or one of the type variables to be eta-reduced cannot realize kind *.CSThe last type variable appeared in a contravariant position when deriving Functor.DUA constructor has a function argument in a derived Foldable or Traversable instance.E}One of the last type variables cannot be eta-reduced (see the canEtaReduce function for the criteria it would have to meet).FZThe data type has a DatatypeContext which mentions one of the eta-reduced type variables.GbThe data type has an existential constraint which mentions one of the eta-reduced type variables.HThe data type mentions one of the n eta-reduced type variables in a place other than the last nth positions of a data type in a constructor's field.ITemplate Haskell didn't list all of a data family's instances upon reification until template-haskell-2.7.0.0, which is necessary for a derived instance to work.J Test if an K value is the L= constructor. Provided as standard with GHC 7.8 and above.MPull the value out of an K/ where both alternatives have the same type. ?\x -> fromEither (Left x ) == x \x -> fromEither (Right x) == xNN takes a list of Bools and a list of some elements and filters out these elements for which the corresponding value in the list of Bools is False. This function does not check whether the lists have equal length.OO takes a list of Bools and two lists as input, and outputs a new list consisting of elements from the last two input lists. For each Bool in the list, if it is P;, then it takes an element from the former list. If it is Q~, it takes an element from the latter list. The elements taken correspond to the index of the Bool in its list. For example: @filterByLists [True, False, True, False] "abcd" "wxyz" = "axcz" AThis function does not check whether the lists have equal length.RR takes a list of Bools and a list of some elements and partitions the list according to the list of Bools. Elements corresponding to P+ go to the left; elements corresponding to Q go to the right. For example, ;partitionByList [True, False, True] [1,2,3] == ([1,3], [2])D This function does not check whether the lists have equal length.S Apply an Either Exp Exp expression to an T expression, preserving the K-ness.U"Returns True if a Type has kind *.VGGets all of the type/kind variable names mentioned somewhere in a Type.WGGets all of the type/kind variable names mentioned somewhere in a Kind.XhasKindVarChain n kind Checks if kindj is of the form k_0 -> k_1 -> ... -> k_(n-1), where k0, k1, ..., and k_(n-1) can be * or kind variables.YEIf a Type is a SigT, returns its kind signature. Otherwise, return *.ZKIf a VarT is missing an explicit kind signature, steal it from a TyVarBndr.[Monadic version of concatMap\#Extracts the name of a constructor.]KGenerate a list of fresh names with a common prefix, and numbered suffixes.^#Extracts the kind from a TyVarBndr._Convert a TyVarBndr to a Type.`)Applies a typeclass constraint to a type.aChecks to see if the last types in a data family instance can be safely eta- reduced (i.e., dropped), given the other types. This checks for three conditions: +All of the dropped types are type variables%All of the dropped types are distinct<None of the remaining types mention any of the dropped typesbiExtract Just the Name from a type variable. If the argument Type is not a type variable, return Nothing.cdExtract the Name from a type variable. If the argument Type is not a type variable, throw an error.d6Peel off a kind signature from a Type (if it has one).eIs the given type a variable?fPIs the given type a type family constructor (and not a data family constructor)?gAAre all of the items in a list (which have an ordering) distinct?HThis uses Set (as opposed to nub) for better asymptotic time complexity.h9Does the given type mention any of the Names in the list?i@Does an instance predicate mention any of the Names in the list?j)Construct a type via curried application.k7Fully applies a type constructor to its type variables.lHSplit an applied type into its individual components. For example, this: Either Int Char would split to this: [Either, Int, Char] mESplit a type signature by the arrows on its spine. For example, this: .forall a b. (a ~ b) => (a -> b) -> Char -> () would split to this: (a ~ b, [a -> b, Char, ()]) n)Like uncurryType, except on a kind level.opqrstu6vwxyz7{|}~89:>?@5The typeclass for which an instance should be derived(The type constructor or data family nameThe datatype context=The type variables from the data type/data family declaration;; the types used to instantiate a data family instance, or = if it's a plain data type5The typeclass for which an instance should be derived(The type constructor or data family nameThe datatype context*The types to instantiate the instance with+True if it's a data family, False otherwiseABCDEFGHIJMNORSUVWXYZ[\]^_`abcdefghijklmnopqrstu6vwxyz7{|}~89:>?@ABCDEFGHIJMNORSUVWXYZ[\]^_`abcdefghijklmnopqrstu6vwxyz7{|}~89:>?@ABCDEFGHIJMNORSUVWXYZ[\]^_`abcdefghijklmn(C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone%&(A representation of which Show variant is being derived.4Options that further configure how the functions in Text.Show.Deriving should behave.If P, the derived , , or  instance will not surround the output of showing fields of unlifted types with parentheses, and the output will be suffixed with hash signs (#).?Options that match the behavior of the most recent GHC release.@Options that match the behavior of the installed version of GHC. Generates a G instance declaration for the given data type or data family instance.Like , but takes an  argument.1Generates a lambda expression which behaves like  (without requiring a  instance).Like , but takes an  argument. 1Generates a lambda expression which behaves like  (without requiring a  instance). Like  , but takes an  argument. 1Generates a lambda expression which behaves like  (without requiring a  instance). Like  , but takes an  argument.  Generates a G instance declaration for the given data type or data family instance.Like  , but takes an  argument.1Generates a lambda expression which behaves like  showsPrec1 (without requiring a  instance).1Generates a lambda expression which behaves like  liftShowsPrec (without requiring a  instance).$This function is not available with transformers-0.4.Like , but takes an  argument.$This function is not available with transformers-0.4.1Generates a lambda expression which behaves like  liftShowList (without requiring a  instance).$This function is not available with transformers-0.4.Like , but takes an  argument.$This function is not available with transformers-0.4.Like , but takes an  argument. Generates a G instance declaration for the given data type or data family instance.$This function is not available with transformers-0.4.Like , but takes an  argument.$This function is not available with transformers-0.4.1Generates a lambda expression which behaves like liftShowsPrec2 (without requiring a  instance).$This function is not available with transformers-0.4.Like , but takes an  argument.$This function is not available with transformers-0.4.1Generates a lambda expression which behaves like  liftShowList2 (without requiring a  instance).$This function is not available with transformers-0.4.Like , but takes an  argument.$This function is not available with transformers-0.4.1Generates a lambda expression which behaves like  showsPrec2 (without requiring a  instance).$This function is not available with transformers-0.4.Like , but takes an  argument.$This function is not available with transformers-0.4.XDerive a Show(1)(2) instance declaration (depending on the ShowClass argument's value).Generates a declaration defining the primary function corresponding to a particular class (showsPrec for Show, liftShowsPrec for Show1, and liftShowsPrec2 for Show2).Generates a lambda expression which behaves like showsPrec (for Show), liftShowsPrec (for Show1), or liftShowsPrec2 (for Show2).+Generates a lambda expression for showsPrec liftShowsPrecNetc. for the given constructors. All constructors must be from the same type.+Generates a lambda expression for showsPrec liftShowsPrecetc. for a single constructor.+Generates a lambda expression for showsPrec liftShowsPrec'etc. for an argument of a constructor.+Generates a lambda expression for showsPrec liftShowsPrec\etc. for a specific type. The generated expression depends on the number of type variables. .If the type is of kind * (T), apply showsPrec.MIf the type is of kind * -> * (T a), apply liftShowsPrec $(makeShowForType a)nIf the type is of kind * -> * -> * (T a b), apply liftShowsPrec2 $(makeShowForType a) $(makeShowForType b) Checks if a <6 represents a tuple type constructor (other than '()')qParenthesize an infix constructor name if it is being applied as a prefix function (e.g., data Amp a = (:&) a a) Checks if a S names a valid Haskell infix type constructor (i.e., does it begin with a colon?). Checks if a % represents a tuple (other than '()')1 |True if we are using the function of type ([a] -> ShowS), False if we are using the function of type (Int -> a -> ShowS).,showListName if True, showsPrecName if False , (C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone%&6A representation of which function is being generated.1A representation of which class is being derived. Generates a G instance declaration for the given data type or data family instance.1Generates a lambda expression which behaves like  (without requiring a  instance).1Generates a lambda expression which behaves like  (without requiring a  instance). 1Generates a lambda expression which behaves like fold (without requiring a  instance).!1Generates a lambda expression which behaves like  (without requiring a  instance)." Generates a G instance declaration for the given data type or data family instance.#1Generates a lambda expression which behaves like  (without requiring a  instance).$ Generates a G instance declaration for the given data type or data family instance.%1Generates a lambda expression which behaves like  (without requiring a  instance).&1Generates a lambda expression which behaves like  (without requiring a  instance).'1Generates a lambda expression which behaves like  (without requiring a  instance).(1Generates a lambda expression which behaves like  (without requiring a  instance).UDerive a class instance declaration (depending on the FunctorClass argument's value).Generates a declaration defining the primary function(s) corresponding to a particular class (fmap for Functor, foldr and foldMap for Foldable, and traverse for Traversable).HFor why both foldr and foldMap are derived for Foldable, see Trac #7436.IGenerates a lambda expression which behaves like the FunctorFun argument.gGenerates a lambda expression for the given constructors. All constructors must be from the same type.7Generates a lambda expression for a single constructor.CGenerates a lambda expression for a single constructor's arguments.^Generates a lambda expression for a single argument of a constructor. The returned value is LA if its type mentions the last type parameter. Otherwise, it is .JGenerates a lambda expression for a specific type. The returned value is LA if its type mentions the last type parameter. Otherwise, it is .+ !"#$%&'(       !"#$%&'($ !"#$%&'(     (C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone   (C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone$%&'($%&'((C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone"#"#(C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone ! ! (C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone)  !"#$%&'(      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIDEJKLMNOPQRSTUVWDXYDXZ[\]^_`^_abcGHdefghijklmnopqrstuvwxyz{|}~DDDDDEDDDDDEDEDDDDD     DX !",deriving-compat-0.2.2-2BGQ0pwVqb0K8yiLVKTrV9Text.Show.DerivingData.Foldable.DerivingData.Functor.DerivingData.Traversable.DerivingPaths_deriving_compatData.Deriving.InternalText.Show.Deriving.InternalData.Functor.Deriving.Internal Data.DerivingOptionsghc8ShowBehaviordefaultOptions legacyOptions deriveShowderiveShowOptionsmakeShowmakeShowOptions makeShowsPrecmakeShowsPrecOptions makeShowListmakeShowListOptions deriveShow1deriveShow1OptionsmakeShowsPrec1makeLiftShowsPrecmakeLiftShowsPrecOptionsmakeLiftShowListmakeLiftShowListOptionsmakeShowsPrec1Options deriveShow2deriveShow2OptionsmakeLiftShowsPrec2makeLiftShowsPrec2OptionsmakeLiftShowList2makeLiftShowList2OptionsmakeShowsPrec2makeShowsPrec2OptionsderiveFoldable makeFoldMap makeFoldrmakeFold makeFoldl deriveFunctormakeFmapderiveTraversable makeTraverse makeSequenceAmakeMapM makeSequencecatchIOversionbindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNameTyVarMapStarKindStatus expandSyncanRealizeKindStarstarKindStatusToNamebaseGHC.BaseJusttemplate-haskellLanguage.Haskell.TH.SyntaxNameNothingcatKindVarNameswithTypebuildTypeInstancederiveConstraintderivingKindErrorcontravarianceErrornoFunctionsErroretaReductionErrordatatypeContextErrorexistentialContextErroroutOfPlaceTyVarError dataConIErrorisRight Data.EitherEitherRight fromEither filterByList filterByListsghc-prim GHC.TypesTrueFalsepartitionByList appEitherEExp hasKindStartyVarNamesOfTypetyVarNamesOfKindhasKindVarChaintyKindstealKindForType concatMapMconstructorName newNameListtvbKind tvbToType applyClass canEtaReducevarTToName_maybe varTToNameunSigTisTyVar isTyFamily allDistinct mentionsNamepredMentionsNameapplyTy applyTyCon unapplyTy uncurryTy uncurryKindTwoOne OneOrTwoNamesOneNameTwoNames TyVarMap2 TyVarMap1ClassReparity allowExQuant fullClassNameclassConstraint NotKindStarKindStar IsKindVar KindSubst TypeSubst expandSynKind expandSynAppmkSubst substType substKindsubstNameWithKindsubstNamesWithKindStar fmapConst foldrConst foldMapConst traverseConstshowsPrecConstshowsPrec1ConstliftShowsPrecConstliftShowsPrec2ConstbuildTypeInstanceFromTys reifyConTys reifyConTys1 reifyConTys2 interleave isStarOrVarthd3createKindChainderivingCompatPackageKeymkDerivingCompatName_vfmapConstValNamefoldrConstValNamefoldMapConstValNametraverseConstValNameshowsPrecConstValNameshowsPrec1ConstValNameliftShowsPrecConstValNameliftShowsPrec2ConstValName cHashDataName dHashDataName dualDataName endoDataName fHashDataName iHashDataNamewrapMonadDataNamecharHashTypeNamedoubleHashTypeNamefloatHashTypeNamefoldableTypeNamefunctorTypeNameintHashTypeName showTypeNametraversableTypeNamewordHashTypeNameappEndoValNamecomposeValName errorValName flipValName fmapValName foldrValNamefoldMapValNamegetDualValName idValNameshowCharValNameshowListValNameshowListWithValNameshowParenValNameshowsPrecValNameshowSpaceValNameshowStringValNametraverseValNameunwrapMonadValName ltValName wHashDataName pureValName apValNamemappendValName memptyValName show1TypeName show2TypeNameliftShowListValNameliftShowsPrecValNameliftShowList2ValNameliftShowsPrec2ValName ShowClassGHC.ShowShowShow1Show2show showsPrecshowListderiveShowClass showsPrecDecsmakeShowsPrecClassmakeShowForConsmakeShowForConmakeShowForArgmakeShowForTypeisNonUnitTupleparenInfixConNameisInfixTypeConString isTupleStringshowsPrecConstName showsPrecName showListNameshowsPrecOrListName$fClassRepShowClass FunctorFun FunctorClass Data.FoldableFoldablefoldMapfoldrfoldlFunctorfmapData.Traversable Traversabletraverse sequenceAmapMsequencederiveFunctorClassfunctorFunDecsmakeFunctorFunmakeFunctorFunForConsmakeFunctorFunForConmakeFunctorFunForArgsmakeFunctorFunForArgLeftmakeFunctorFunForTypeFmapFoldrFoldMapTraversefunctorFunConstNamefunctorFunNamefunctorClassToFunsfunctorFunToClass allowFunTysfunctorFunTriv functorFunAppfunctorFunCombine fmapCombine foldrCombinefoldMapCombinetraverseCombine$fShowFunctorFun$fClassRepFunctorClass