kP      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOSafe PQRSTUVWXYZ[\QWXYZ[\ PQRSTUVWXYZ[\ (C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone%&B5]CA mapping of type variable Names to their auxiliary function Names.^EWhether a type is not of kind *, is of kind *, or is a kind variable._BExpands all type synonyms in a type. Written by Dan Rosn in the  genifunctors package (licensed under BSD3).`8Does a Type have kind * or k (for some kind variable k)?aReturns b the kind variable c of a ^# if it exists. Otherwise, returns d.ejConcat together all of the StarKindStatuses that are IsKindVar and extract the kind variables' Names out.f"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.g6Deduces the instance context and head for an instance.hAttempt 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.iMThe given datatype has no constructors, and we don't know what to do with it.jEither the given data type doesn't have enough type variables, or one of the type variables to be eta-reduced cannot realize kind *.kSThe last type variable appeared in a contravariant position when deriving Functor.lUA constructor has a function argument in a derived Foldable or Traversable instance.m}One of the last type variables cannot be eta-reduced (see the canEtaReduce function for the criteria it would have to meet).nZThe data type has a DatatypeContext which mentions one of the eta-reduced type variables.obThe data type has an existential constraint which mentions one of the eta-reduced type variables.pThe 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.qTemplate 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.r Test if an s value is the t= constructor. Provided as standard with GHC 7.8 and above.uPull the value out of an s/ where both alternatives have the same type. ?\x -> fromEither (Left x ) == x \x -> fromEither (Right x) == xvv 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.ww 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 x;, then it takes an element from the former list. If it is y~, 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.zz takes a list of Bools and a list of some elements and partitions the list according to the list of Bools. Elements corresponding to x+ go to the left; elements corresponding to y 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.{ Apply an Either Exp Exp expression to an | expression, preserving the s-ness.}"Returns True if a Type has kind *.~GGets all of the type/kind variable names mentioned somewhere in a Type.GGets all of the type/kind variable names mentioned somewhere in a Kind.hasKindVarChain 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.EIf a Type is a SigT, returns its kind signature. Otherwise, return *.KIf 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.Checks 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 typesgExtract the Name from a type constructor. If the argument Type is not a type variable, throw an error.iExtract Just the Name from a type variable. If the argument Type is not a type variable, return Nothing.dExtract the Name from a type variable. If the argument Type is not a type variable, throw an error.6Peel off a kind signature from a Type (if it has one).Is the given type a variable?PIs the given type a type family constructor (and not a data family constructor)?AAre all of the items in a list (which have an ordering) distinct?HThis uses Set (as opposed to nub) for better asymptotic time complexity.9Does the given type mention any of the Names in the list?@Does an instance predicate mention any of the Names in the list?)Construct a type via curried application.7Fully applies a type constructor to its type variables.HSplit an applied type into its individual components. For example, this: Either Int Char would split to this: [Either, Int, Char] ESplit 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, ()]) )Like uncurryType, except on a kind level. Checks if a c6 represents a tuple type constructor (other than '()') Checks if a % represents a tuple (other than '()')]^_`aefg5The 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 declarationb; the types used to instantiate a data family instance, or d 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 otherwisehijklmnopqruvwz{}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|]^_`aefghijklmnopqruvwz{}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|]^_`aefghijklmnopqruvwz{}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{| (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 x, 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 (#).8 that match the behavior of the most recent GHC release.9 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 a  argument.1Generates a lambda expression which behaves like  (without requiring a ~ instance).Like , but takes a  argument. 1Generates a lambda expression which behaves like  (without requiring a ~ instance). Like  , but takes a  argument. 1Generates a lambda expression which behaves like  (without requiring a ~ instance). Like  , but takes a  argument.  Generates a G instance declaration for the given data type or data family instance.Like  , but takes a  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 a  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 a  argument.$This function is not available with transformers-0.4.Like , but takes a  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 a  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 a  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 a  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 a  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)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?).0} |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%&A representation of which Read variant is being derived.4Options that further configure how the functions in Text.Read.Deriving should behave.If x:Derived  instances will implement readPrec, not 2, and will provide a default implementation of  readListPrec in terms of readPrec.If built against  base-4.10 or later, derived 'Read1'/'Read2' instances will implement 'liftReadPrec'/'liftReadPrec2' , not  'liftReadsPrec'/'liftReadsPrec2'1, and will provide default implementations of &'liftReadListPrec'/'liftReadListPrec2' in terms of 'liftReadPrec'/'liftReadPrec2',. If built against an earlier version of base , derived 'Read1'/'Read2'F instances are not affected, so they will act as if this flag were y.If y:Derived  instances will implement .Derived  instances will implement  readsPrec1 (if built against transformers-0.4) or  liftReadsPrec& (otherwise). If not built against transformers-0.4 , derived  instances will implement liftReadsPrec2.8It's generally a good idea to enable this option, since readPrec& and friends are more efficient than 2 and friends, since the former use the efficient ReadPrec> parser datatype while the latter use the slower, list-based  type.  that favor readPrec over .! Generates a G instance declaration for the given data type or data family instance."Like !, but takes a  argument.#1Generates a lambda expression which behaves like  (without requiring a  instance).$1Generates a lambda expression which behaves like readPrec (without requiring a  instance).% Generates a G instance declaration for the given data type or data family instance.&Like %, but takes a  argument.'1Generates a lambda expression which behaves like  liftReadsPrec (without requiring a  instance).$This function is not available with transformers-0.4.(1Generates a lambda expression which behaves like  readsPrec1 (without requiring a  instance).) 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 a  argument.$This function is not available with transformers-0.4.+1Generates a lambda expression which behaves like liftReadsPrec2 (without requiring a  instance).$This function is not available with transformers-0.4.,1Generates a lambda expression which behaves like  readsPrec2 (without requiring a  instance).$This function is not available with transformers-0.4.XDerive a Read(1)(2) instance declaration (depending on the ReadClass argument's value).Generates a declaration defining the primary function corresponding to a particular class (read(s)Prec for Read, liftRead(s)Prec for Read1, and liftRead(s)Prec2 for Read2).Generates a lambda expression which behaves like read(s)Prec (for Read), liftRead(s)Prec (for Read1), or liftRead(s)Prec2 (for Read2).-Generates a lambda expression for read(s)PrecliftRead(s)PrecNetc. for the given constructors. All constructors must be from the same type.8 !"#$%&'()*+,-readsListName if True, readsPrecName if False/readListPrecName if True, readPrecName if False8readPrecOrListName if True, readsPrecOrListName if False7read(s)List(Prec)Name if True, read(s)PrecName if False !"#$%&'()*+,3 !"#$%&'()*+, (C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone%&A representation of which Ord variant is being derived.- Generates an G instance declaration for the given data type or data family instance..1Generates a lambda expression which behaves like  (without requiring an  instance)./NGenerates a lambda expression which behaves like '(<)' (without requiring an  instance).0OGenerates a lambda expression which behaves like '(<=)' (without requiring an  instance).1NGenerates a lambda expression which behaves like '(>)' (without requiring an  instance).2OGenerates a lambda expression which behaves like '(>=)' (without requiring an  instance).31Generates a lambda expression which behaves like  (without requiring an  instance).41Generates a lambda expression which behaves like  (without requiring an  instance).5 Generates an G instance declaration for the given data type or data family instance.61Generates a lambda expression which behaves like  liftCompare (without requiring an  instance).$This function is not available with transformers-0.4.71Generates a lambda expression which behaves like compare1 (without requiring an  instance).8 Generates an G instance declaration for the given data type or data family instance.$This function is not available with transformers-0.4.91Generates a lambda expression which behaves like  liftCompare2 (without requiring an  instance).$This function is not available with transformers-0.4.:1Generates a lambda expression which behaves like compare2 (without requiring an  instance).$This function is not available with transformers-0.4.WDerive an Ord(1)(2) instance declaration (depending on the OrdClass argument's value).Generates a declaration defining the primary function(s) corresponding to a particular class (compare for Ord, liftCompare for Ord1, and liftCompare2 for Ord2).Generates a lambda expression which behaves like the OrdFun value. This function uses heuristics to determine whether to implement the OrdFun from scratch or define it in terms of compare.gGenerates a lambda expression for the given constructors. All constructors must be from the same type.Like (, only it reverses the sense of the test7-./0123456789:-./0123456789:--./0123456789: (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.A1Generates a lambda expression which behaves like  (without requiring a  instance).B Generates a G instance declaration for the given data type or data family instance.C1Generates a lambda expression which behaves like  (without requiring a  instance).D1Generates a lambda expression which behaves like  (without requiring a  instance).E1Generates a lambda expression which behaves like  (without requiring a  instance).F1Generates 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 tA if its type mentions the last type parameter. Otherwise, it is .JGenerates a lambda expression for a specific type. The returned value is tA if its type mentions the last type parameter. Otherwise, it is .+ ;<=>?@ABCDEF     ;<=>?@ABCDEF$ ;<=>?@ABCDEF    (C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone%&A representation of which Eq variant is being derived.G Generates an G instance declaration for the given data type or data family instance.HOGenerates a lambda expression which behaves like '(==)' (without requiring an  instance).IOGenerates a lambda expression which behaves like '(/=)' (without requiring an  instance).J Generates an G instance declaration for the given data type or data family instance.K1Generates a lambda expression which behaves like liftEq (without requiring an  instance).$This function is not available with transformers-0.4.L1Generates a lambda expression which behaves like eq1 (without requiring an  instance).M Generates an G instance declaration for the given data type or data family instance.$This function is not available with transformers-0.4.N1Generates a lambda expression which behaves like liftEq2 (without requiring an  instance).$This function is not available with transformers-0.4.O1Generates a lambda expression which behaves like eq2 (without requiring an  instance).$This function is not available with transformers-0.4.UDerive an Eq(1)(2) instance declaration (depending on the EqClass argument's value).Generates a declaration defining the primary function corresponding to a particular class ((==) for Eq, liftEq for Eq1, and liftEq2 for Eq2).hGenerates a lambda expression which behaves like (==) (for Eq), liftEq (for Eq1), or liftEq2 (for Eq2).&Generates a lambda expression for (==)liftEqNetc. for the given constructors. All constructors must be from the same type. GHIJKLMNO!"#$%&'() GHIJKLMNO GHIJKLMNO!"#$%&'()(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 HaskellNoneBCDEFBCDEF(C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone-./0123456789:-./0123456789:(C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNone@A@A(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 GHIJKLMNO GHIJKLMNO(C) 2015-2016 Ryan Scott BSD-style (see the file LICENSE) Ryan ScottTemplate HaskellNoneP  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNO*                  ! " # $ % & ' ( ) * + , , - . / 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 TUVWXYZ[\]^_`abcdefghij k l m n opqrstupqv w x y z { | } ~  pp  st pq                                               ! " # $ % & ' ( ) * + , - . / 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 k l m n o p q r s t u v w x y z { | } ~                    p  ppp                 pp  p                                             p                                   ppp p pq pq p p p p p        p          ! " # $ % & ' ( ) * + , -./012345/6789:;<=>?*deriving-compat-0.3-6L7KWBCc5jkBJoC0Di5ayfText.Show.DerivingText.Read.DerivingData.Ord.DerivingData.Foldable.DerivingData.Functor.DerivingData.Traversable.DerivingData.Eq.DerivingPaths_deriving_compatData.Deriving.InternalText.Show.Deriving.InternalText.Read.Deriving.InternalData.Ord.Deriving.InternalData.Functor.Deriving.InternalData.Eq.Deriving.Internal Data.Deriving ShowOptionsghc8ShowBehaviordefaultShowOptionslegacyShowOptions deriveShowderiveShowOptionsmakeShowmakeShowOptions makeShowsPrecmakeShowsPrecOptions makeShowListmakeShowListOptions deriveShow1deriveShow1OptionsmakeShowsPrec1makeLiftShowsPrecmakeLiftShowsPrecOptionsmakeLiftShowListmakeLiftShowListOptionsmakeShowsPrec1Options deriveShow2deriveShow2OptionsmakeLiftShowsPrec2makeLiftShowsPrec2OptionsmakeLiftShowList2makeLiftShowList2OptionsmakeShowsPrec2makeShowsPrec2Options ReadOptions useReadPrecdefaultReadOptions deriveReadderiveReadOptions makeReadsPrec makeReadPrec deriveRead1deriveRead1OptionsmakeLiftReadsPrecmakeReadsPrec1 deriveRead2deriveRead2OptionsmakeLiftReadsPrec2makeReadsPrec2 deriveOrd makeComparemakeLTmakeLEmakeGTmakeGEmakeMaxmakeMin deriveOrd1makeLiftCompare makeCompare1 deriveOrd2makeLiftCompare2 makeCompare2deriveFoldable makeFoldMap makeFoldrmakeFold makeFoldl deriveFunctormakeFmapderiveTraversable makeTraverse makeSequenceAmakeMapM makeSequencederiveEqmakeEq makeNotEq deriveEq1 makeLiftEqmakeEq1 deriveEq2 makeLiftEq2makeEq2catchIOversionbindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNameTyVarMapStarKindStatus expandSyncanRealizeKindStarstarKindStatusToNamebaseGHC.BaseJusttemplate-haskellLanguage.Haskell.TH.SyntaxNameNothingcatKindVarNameswithTypebuildTypeInstancederiveConstraintnoConstructorsErrorderivingKindErrorcontravarianceErrornoFunctionsErroretaReductionErrordatatypeContextErrorexistentialContextErroroutOfPlaceTyVarError dataConIErrorisRight Data.EitherEitherRight fromEither filterByList filterByListsghc-prim GHC.TypesTrueFalsepartitionByList appEitherEExp hasKindStartyVarNamesOfTypetyVarNamesOfKindhasKindVarChaintyKindstealKindForType concatMapMconstructorName newNameListtvbKind tvbToType applyClass canEtaReduce conTToNamevarTToName_maybe varTToNameunSigTisTyVar isTyFamily allDistinct mentionsNamepredMentionsNameapplyTy applyTyCon unapplyTy uncurryTy uncurryKindisNonUnitTupleisNonUnitTupleStringStringTwoOne OneOrTwoNamesOneNameTwoNames TyVarMap2 TyVarMap1ClassReparity allowExQuant fullClassNameclassConstraint NotKindStarKindStar IsKindVar KindSubst TypeSubst expandSynKind expandSynAppmkSubst substType substKindsubstNameWithKindsubstNamesWithKindStar fmapConst foldrConst foldMapConst traverseConsteqConsteq1Const liftEqConst liftEq2Const compareConstltConst compare1ConstliftCompareConstliftCompare2ConstreadsPrecConst readPrecConstreadsPrec1ConstliftReadsPrecConstliftReadPrecConstliftReadsPrec2ConstliftReadPrec2ConstshowsPrecConstshowsPrec1ConstliftShowsPrecConstliftShowsPrec2ConstbuildTypeInstanceFromTys reifyConTys reifyConTys1 reifyConTys2 interleave tagToEnumintegerE isStarOrVarzipWithAndUnzipMzipWith3AndUnzipMthd3 isNullaryConcreateKindChain untagExpr primOpAppExprderivingCompatPackageKeymkDerivingCompatName_vfmapConstValNamefoldrConstValNamefoldMapConstValNametraverseConstValNameeqConstValNameeq1ConstValNameliftEqConstValNameliftEq2ConstValNamecompareConstValNameltConstValNamecompare1ConstValNameliftCompareConstValNameliftCompare2ConstValNamereadsPrecConstValNamereadPrecConstValNamereadsPrec1ConstValNameliftReadsPrecConstValNameliftReadPrecConstValNameliftReadsPrec2ConstValNameliftReadPrec2ConstValNameshowsPrecConstValNameshowsPrec1ConstValNameliftShowsPrecConstValNameliftShowsPrec2ConstValNametagToEnumValName cHashDataName dHashDataName dualDataName endoDataName fHashDataName identDataName iHashDataName puncDataNamesymbolDataNamewrapMonadDataNameaddrHashTypeNamecharHashTypeNamedoubleHashTypeNamefloatHashTypeNamefoldableTypeNamefunctorTypeNameintHashTypeName readTypeName showTypeNametraversableTypeNamewordHashTypeName altValNameappEndoValName chooseValNamecomposeValName constValNameeqAddrHashValNameeqCharHashValNameeqDoubleHashValNameeqFloatHashValNameeqIntHashValNameeqWordHashValName errorValName flipValName fmapValName foldrValNamefoldMapValNamegeAddrHashValNamegeCharHashValNamegeDoubleHashValNamegeFloatHashValNamegeIntHashValNamegetDualValName getTagValNamegeWordHashValNamegtAddrHashValNamegtCharHashValNamegtDoubleHashValNamegtFloatHashValNamegtIntHashValNamegtWordHashValName idValNameleAddrHashValNameleCharHashValNameleDoubleHashValNameleFloatHashValNameleIntHashValNameleWordHashValNameliftReadListPrecDefaultValNameliftReadListPrec2DefaultValNameliftReadListPrecValNameliftReadListPrec2ValNameliftReadPrecValNameliftReadPrec2ValName listValNameltAddrHashValNameltCharHashValNameltDoubleHashValNameltFloatHashValNameltIntHashValNameltWordHashValName parenValName parensValName pfailValName precValNamereadListValNamereadListPrecDefaultValNamereadListPrecValNamereadPrec_to_SValNamereadPrecValNamereadS_to_PrecValNamereadsPrecValName resetValName returnValNameshowCharValNameshowListValNameshowListWithValNameshowParenValNameshowsPrecValNameshowSpaceValNameshowStringValName stepValNametraverseValNameunwrapMonadValName boolTypeName falseDataName trueDataName eqDataName gtDataName ltDataName eqTypeName ordTypeName andValNamecompareValName eqValName geValName gtValName leValName ltValName notValName wHashDataNameexpectPValName pureValName apValNamemappendValName memptyValName eq1TypeName eq2TypeName liftEqValNameliftEq2ValName ord1TypeName ord2TypeNameliftCompareValNameliftCompare2ValName read1TypeName read2TypeNameliftReadsPrecValNameliftReadListValNameliftReadsPrec2ValNameliftReadList2ValName show1TypeName show2TypeNameliftShowListValNameliftShowsPrecValNameliftShowList2ValNameliftShowsPrec2ValName ShowClassGHC.ShowShowShow1Show2show showsPrecshowListderiveShowClass showsPrecDecsmakeShowsPrecClassmakeShowForConsmakeShowForConmakeShowForArgmakeShowForTypeparenInfixConNameisInfixTypeConshowsPrecConstName showsPrecName showListNameshowsPrecOrListNamecharE$fClassRepShowClass ReadClassGHC.ReadRead readsPrecRead1Read2Text.ParserCombinators.ReadPReadSderiveReadClass readPrecDecsmakeReadPrecClassmakeReadForConsmakeReadForConmakeReadForArgmakeReadForFieldmakeReadForTypereadsPrecConstNamereadPrecConstName readsPrecName readPrecNamereadListPrecDefaultNamereadListPrecName readListNamereadsPrecOrListNamereadPrecOrListNamereadsOrReadNamemkParser mkDoStmts resultExprisSym startsVarSym startsConSymstartsVarSymASCII identHPatbindLexidentPat symbolPatreadPuncsnocView dataConStr readPrefixCon wrapReadSshouldDefineReadPrec$fClassRepReadClassOrdClass GHC.ClassesOrdcomparemaxminOrd1Ord2deriveOrdClass ordFunDecs makeOrdFunmakeOrdFunForCons filterOutGHC.ListfilterOrdFun OrdCompareOrdLTOrdLEOrdGEOrdGTOrd1LiftCompareOrd2LiftCompare2 makeMinMaxmakeOrdFunForConmakeOrdFunForFieldsmakeOrdFunForTypecompareConstNameordClassToCompare ordFunName ordFunToClasseqResultgtResultltResult ltTagExpr eqTagExpr gtTagExpr falseExprtrueExpr otherFunsunliftedOrdFununliftedCompare primOrdFuns primOrdFunTblisSupportedUnliftedType isSingleton$fClassRepOrdClass FunctorFun FunctorClass Data.FoldableFoldablefoldMapfoldrfoldlFunctorfmapData.Traversable Traversabletraverse sequenceAmapMsequencederiveFunctorClassfunctorFunDecsmakeFunctorFunmakeFunctorFunForConsmakeFunctorFunForConmakeFunctorFunForArgsmakeFunctorFunForArgLeftmakeFunctorFunForTypeFmapFoldrFoldMapTraversefunctorFunConstNamefunctorFunNamefunctorClassToFunsfunctorFunToClass allowFunTysfunctorFunTriv functorFunAppfunctorFunCombine fmapCombine foldrCombinefoldMapCombinetraverseCombine$fShowFunctorFun$fClassRepFunctorClassEqClassEqEq1Eq2 deriveEqClasseqDecs makeEqClass makeEqForCons makeTagCasemakeFallThroughCasemakeCaseForConmakeCaseForArgsmakeCaseForArgmakeCaseForType eqConstNameeqName$fClassRepEqClass