úÎW§R,      !"#$%&'()*+NoneKL*Data type (a :|: b) that behaves all like Either<, except that has no tag in JSON representation as used by FromJSON and ToJSON. Convert to Either datatype. Convert from Either datatype.UDeconstruct the type with two functions corresponding to constructors. This is like either.,-,-Safe.¹Generic function for opening file if the filename is not empty nor "-", or using given handle otherwise (probably stdout, stderr, or stdin). TODO: Should it become utility function?/BGeneric function for choosing either file with given name or stdinstdout as inputgoutput. It accepts the function that takes the corresponding handle. Stdin/stdout is selected by "-".0!Check assertion within any monad../01./0./01None *0N23456782345678None+0357Union types for JSON values.%Dictionary of types indexed by names.9Type alias for HashMap2Make operation on a map to an operation on a Dict.Take all keys from dictionary. Empty type&Lookup the Type within the dictionary. Size of the  term.xCheck if this is nullable (Maybe) type, or not. Nullable type will always accept TNull or missing key that contains it.Null-ish types:Convert any type into union type (even if just singleton).$Is the top-level constructor a TObj?#Is it a simple (non-compound) Type?:&Is the top-level constructor a TUnion?SIs the top-level constructor a TArray? | Check if the given type has non-top TObj.)Check if the given type has non-top TObj.:Check if the given type has TObj on top or within array..  9:;<=>?   9:;<=>?None éCompute total number of nodes (and leaves) within the value tree. Each simple JavaScript type (including String) is counted as of size 1, whereas both Array or object types are counted as 1+sum of the sizes of their member values. &Compute total size of the type of the ValueÙ. For: * simple types it is always 1, * for arrays it is just 1+_maximum_ size of the (single) element type, * for objects it is _sum_ of the sizes of fields (since each field type is assumed to be different.)!‹Compute total depth of the value. For: * simple types it is 1 * for either Array or Object, it is 1 + maximum of depths of their members"Extract Type from the JSON Value2. Unifying types of array elements, if necessary.#+Type check the value with the derived type.$"Standard unification procedure on Types, with inclusion of Type unions.@;Unify sets of types (sets are union types of alternatives).A"Smart constructor for union types.B•Simplify TUnion's so there is no TUnion directly inside TUnion. If there is only one element of the set, then return this single element as a type.  !"#C$@AB  !"#$ ! "$#  !"#C$@ABNone 04NDïExplanatory type alias for making declarations First element of the triple is original JSON identifier, second element of the triple is the mapped identifier name in Haskell. third element of the triple shows the type in a formatted wayEWrap a type alias.FWrap a data type declarationG¯Make ToJSON declaration, given identifier (object name in Haskell) and mapping of its keys from JSON to Haskell identifiers *in the same order* as in *data type declaration*.H Make ToJSON declaration, given identifier (object name in Haskell) and mapping of its keys from JSON to Haskell identifiers in the same order as in declarationI Makes a generic identifier name.J!Add new type alias for Array typeK»Convert a JSON key name given by second argument, from within a dictionary keyed with first argument, into a name of Haskell record field (hopefully distinct from other such selectors.)LkFormat the type within DeclM monad, that records the separate declarations on which this one is dependent.%gSplits initial type with a given label, into a mapping of object type names and object type structures.&.Display an environment of types split by name.'ÿ[Normalize type name by: 1. Treating all characters that are not acceptable in Haskell variable name as end of word. 2. Capitalizing each word, but a first (camelCase). 3. Adding underscore if first character is non-alphabetic. 4. Escaping Haskell keywords if the whole identifier is such keyword. 5. If identifier is empty, then substituting  JsonEmptyKey for its name.MOTopological sorting of splitted types so that it is accepted declaration order.N4Computes all type labels referenced by a given type.(JFor a given splitted types, it returns candidates for extra unifications.)(Unifies candidates on a give input list.O"Remaps type labels according to a P.*QRSTUVWXDPYZ[\]EFGHI^_JK`aLbcde%f&'ghMN()O%&'()&%()''QRSTUVWXDPYZ[\]EFGHI^_JK`aLbcde%f&'ghMN()ONone*ŽDefault output filname is used, when there is no explicit output file path, or it is "-" (stdout). Default module name is consistent with it.+7Write a Haskell module to an output file, or stdout if i filename is given.*jkl+*++**jkl+m      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV@WWXYZ[\]^_`abcdefghijklmnoplqrsjsona_5pv9uWKRNi90OB1lY7G9BHData.Aeson.AutoType.AlternativeData.Aeson.AutoType.TypeData.Aeson.AutoType.ExtractData.Aeson.AutoType.FormatData.Aeson.AutoType.CodeGenData.Aeson.AutoType.UtilData.Aeson.AutoType.Pretty:|:AltLeftAltRighttoEither fromEitheraltTypeTNullTBoolTNumTStringTUnionTLabelTObjTArrayDictunDictwithDictkeys emptyTypegettypeSize isNullable emptySetLikes typeAsSetisObjectisSimpleisArray hasNonTopTObjhasTObj valueSize valueTypeSize valueDepth extractType typeCheck unifyTypessplitTypeByLabeldisplaySplitTypesnormalizeTypeNameunificationCandidatesunifyCandidatesdefaultOutputFilenamewriteHaskellModule $fFromJSON:|: $fToJSON:|:withFileOrHandlewithFileOrDefaultHandleassertM $fHashableSet formatPair $fOutText $fOutHashMap$fOutSet $fOutValue $fOutVector$fOutScientificMapisUnion$fUniplateType $fOutType $fOrdDict $fShowDict $fOutDict unifyUnionunion simplifyUnionallKeys MappedKey wrapAliaswrapDecl makeFromJSON makeToJSONgenericIdentifiernewAliasnormalizeFieldName formatTypetoposort allLabels remapLabels DeclState_decls_countertracefst3 TypeTreeMTypeTreeDeclMcounterdeclsstepMtShownewDecladdDeclkeywordsescapeKeywords emptyTypeReprrunDecladdTypesplitTypeByLabel'formatObjectType capitalize uncapitalizebaseGHC.Num-headerepilogue