&      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                    7 None%Convert a GADT to a normal data type.NoneThe CPP's parsing state.Parse some Fay code.KApply incredibly simplistic CPP handling. It only recognizes the following: +#if FAY #ifdef FAY #ifndef FAY #else #endiflNote that this implementation replaces all removed lines with blanks, so that line numbers remain accurate.The parse mode for Fay.None3Alias of liftIO, I hate typing it. Hate reading it.)Do any of the (monadic) predicates match?3Read from a process returning both std err and out. !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&' None;=FKT2~($A standard module monad transformer.i is the type of module info, m is the underlying monad.)tDifferent libraries (Cabal, haskell-src-exts, ...) use different types to represent module names. Hence this class.*1This class defines the interface that is used by +/, so that you can use it in monads other than (.tYou don't typically have to define your own instances of this class, but here are a couple of cases when you might: A pure (non-,*) mockup module monad for testing purposesA transformer over (7You need a more complex way to retrieve the module info-The type of module info.GRead the module info, given a list of search paths and the module name/@Convert module name from arbitrary representation to Cabal's one+~Tries to find the module in the current set of packages, then find the module's info file, and reads and caches its contents.Returns  if the module could not be found in the current set of packages. If the module is found, but something else goes wrong (e.g. there's no info file for it), an exception is thrown.0Run a ( action0the monadic action to run~return value, plus all cached module infos (that is, the initial set plus all infos that have been read by the action itself) ()1*-23.+0(4)1*-23.56None5{7.Extract the module name from a qualified name.8Extract the name from a QName.9(Change or add the ModuleName of a QName.:Extract the string from a Name.78;9<=:NoneM&DConfiguration of the compiler. The fields with a leading underscoreRun optimizationsFlatten function application?Export the runtime? Export the stdlib? Export only the stdlib?>5Possibly a fay package name, and a include directory. Pretty print the JS output? -Output a HTML file including the produced JS. (Output a source map file as outfile.map.$Any JS files to link to in the HTML.%Don't invoke main in the produced JS.3Warn on dubious stuff, not related to typechecking.File path to output to.Typecheck with GHC.Typecheck with -Wall.&Run Google Closure on the produced JS.(The package config e.g. packages-6.12.3.?Included Fay packages.#Custom source location for fay-baseProduce strict and uncurried JavaScript callable wrappers for all exported functions with type signatures in the given module:Only invoke GHC for typechecking, don't produce any output#Optimize away newtype constructors?Use pretty thunk names?Use pretty operators?Print commands sent to GHC?Output a TypeScript file.!/Reading _configDirectoryIncludes is safe to do."8Get all include directories without the package mapping.#:Get all include directories not included through packages.$:Add a mapping from (maybe) a package to a source directory% Add several include directories.&;Add several include directories without package references.'&Reading _configPackages is safe to do.(Add a package to compilation)#Add several packages to compilation*5Should a strict wrapper be generated for this module?+Default configuration.&  !"#$%&'()*&  !"#$%&'()*@ > ?None%OQVc-xConvert a Haskell value to a Fay json value. This can fail when primitive values aren't handled by explicit cases. .& can be used to resolve this issue..Convert a Haskell value to a Fay json value. This can fail when primitive values aren't handled by explicit cases. When this happens, you can add additional cases via the first parameter.qThe first parameter is a function that can be used to override the conversion. This usually looks like using A' to additional type- specific cases./,Convert a Fay json value to a Haskell value.0~Convert a Fay json value to a Haskell value. This is like readFromFay, except it yields helpful error messages on failure.1,Convert a Fay json value to a Haskell value.qThe first parameter is a function that can be used to override the conversion. This usually looks like using B' to additional type- specific cases.C%Parse a data type or record or tuple.DParse a tuple.E(Parse a data constructor from an object.FRMake a simple ADT constructor from an object: { "slot1": 1, "slot2": 2} -> Foo 1 2G;Make a record from a key-value: { "x": 1 } -> Foo { x = 1 }HParse a float.IParse a double.J Parse an int.K Parse a bool.LParse a string.M Parse a char.N Parse a Text.OParse an array.P Parse unit.-./01-/0.1Noned3)QRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyNone;=fz.Helpful for writing qualified symbols (Fay.*).{Helpful for some things.|Helpful for some things.$}~None%k/Make an identifier from the built-in HJ module.<Mapping from unqualified names to qualified primitive names.:Lookup a primop that was resolved to a Prelude definition.[If this is resolved to a Prelude identifier or if it's unqualified, check if it's a primopNonelGet the default runtime source.Safel234562345623456Nonet8The serialization context indicates whether we're currently serializing some value or a particular field in a user-defined data type.;IThese are the data types that are serializable directly to native JS data types. Strings, floating points and arrays. The others are: actions in the JS monad, which are thunks that shouldn't be forced when serialized but wrapped up as JS zero-arg functions, and unknown types can't be converted but should at least be forced.89:;BAI<=>?@CDEFGHJ89:;<=>?@ABCDEFGHIJNonezK;The name of a module split into a list for code generation.M4Construct the complete ModulePath from a ModuleName.NFConstruct intermediate module paths from a ModuleName. mkModulePaths A.B => [[A], [A,B]]OpConverting a QName to a ModulePath is only relevant for constructors since they can conflict with module names.KLMNOKLNone|mPLiteral value type.VA name of some kind.bExpression type.Statement type.Just handy to have.?PQRSTUVWXYZ[\]^_`abgcdefhijklmnopqrstuvwxyz{|}~PQRSTUV WXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None<Print some value. The printer. The state of the pretty printer.The current line.Current column.Current indentation level.Just outputted a newline?Output of printerSource mappings.The current output.Global options of the printerAre we to pretty print?Use pretty thunk names?Use pretty operators?-default printer options (non-pretty printing)Default state.!Print the given printer indented.kOutput a newline and makes next line indented when prPretty is True. Does nothing when prPretty is FalsegWrite out a raw string, respecting the indentation Note: if you pass a string with newline characters, it will print them out even if prPretty is set to False. Also next line won't be indented. If you want write a smart newline (that is the one which will be written out only if prPretty is true, and after which the line will be indented) use )7exec one of Printers depending on PrintReader property.PGenerate a mapping from the Haskell location to the current point in the output.Output concatenation>Write out a string, updating the current position information.None+;=>?aNone01345k*name is not in scopename is ambiguous+type is used where a type class is expected+type class is used where a type is expectedlAttempt to explicitly import a name which is not exported (or, possibly, does not even exist). For example: import Prelude(Bool(Right))The fields are: )optional parent in the import list, e.g. Bool in  Bool(Right)the name which is not exported)the module which does not export the namemodule not foundinternal error global value global type+local value, and location where it is bound-type variable, and location where it is boundhere the value name is boundhere the type name is definedimport: declaration, and the table of symbols that it introduces part of an import declarationexport( declaration, and the symbols it exportsxwildcard in a record pattern. The list contains resolved names of the fields that are brought in scope by this pattern.wildcard in a record construction expression. The list contains resolved names of the fields and information about values assigned to those fields. no annotation scope error\A pair of the name information and original annotation. Used as an annotation type for AST.Qualified name, where ] points to the module where the name was originally defined. The module part is never empty.MAlso contains name and version of the package where it was defined. If it's 6, then the entity is defined in the "current" package.8Possibly qualified name. If the name is not qualified,  is the empty string.!String representing a module name.String representing an unqualified entity nameuThe set of symbols (entities) exported by a single module. Contains the sets of value-level and type-level entities.'Information about a type-level entitity type synonym data typenewtype type family data family type class(Information about a value-level entitityvalue or function class methodrecord field selectordata constructorRepesents the symbol's fixity Display a  Display an Display an error.@Note: can span multiple lines; the trailing newline is included.A  NoneCompute the extension set for the given module, based on the global preferences (e.g. specified on the command line) and module's LANGUAGE pragmas. base languageglobal extensions NoneK1Local symbol table  contains locally bound namesNone1 +Global symbol table  contains global names  None If < ("qualified"), then only the qualified names are inserted.If :, then both qualified and unqualified names are insterted. error for "not found" condition error for "not found" condition   None$NO")Information about a field in the wildcardthe field's simple namethe field's original nameowhether there is a global value in scope with the same name as the field but different from the field selectorAInformation about the names being introduced by a record wildcardDuring resolving traversal, we always (lazily) construct this list when we process PRec or RecConstr, even if it doesn't contain a wildcard.]Then, if the pattern or construction actually contains a wildcard, we use the computed value.NoneFOTl)This function takes care of the possible hiding clause all symbolsmentioned symbolsimported symbolsNone $;=>?AV=Get bound value identifiers.sFor record wildcards we need to know which fields the given constructor has. So we pass the global table for that. None-7;<=>?FQVh\Contains information about the node's enclosing scope. Can be accessed through the lenses: , ,  , !.":Describes how we should treat names in the current context#A type that implements #< provides a way to perform a shallow scope-aware traversal.$The algebra for %L. It's newtype-wrapped because an implicit parameter cannot be polymorphic.&Create an initial scope']Merge local tables of two scopes. The other fields of the scopes are assumed to be the same.( Analogous to ) , but for # *+,-."/0123#%$45 !&'67(89:;<=*+,-."0123/#%>?$45!None ;<=>?QV@Chain a sequence of nodes where every node may introduce some variables into scope for the subsequent nodes. Examples: patterns (see note [Nested pattern scopes]), statements.A4B5"None%V޸CvCompute module's global table. It contains both the imported entities and the global entities defined in this module.D9Compute the symbols that are defined in the given module.[The import table is needed to resolve possible top-level record wildcard bindings, such as  A {..} = fooC the import table for this moduleD the import table for this moduleE the import table for this moduleCD#NoneFTF$None &'<>?OSTV߾G%NoneFTVHTake a set of modules and return a list of sets, where each sets for a strongly connected component in the import graph. The boolean determines if imports using SOURCE are taken into account.IAnnotate a module with scoping information. This assumes that all module dependencies have been resolved and cached  usually you need to run J1 first, unless you have one module in isolation.KCompute interfaces for a set of mutually recursive modules and write the results to the cache. Return the set of import/export errors.JJ takes a list of possibly recursive modules and computes the interface of each module. The computed interfaces are written into the mB's cache and are available to further computations in this monad.Returns the set of import/export errors. Note that the interfaces are registered in the cache regardless of whether there are any errors, but if there are errors, the interfaces may be incomplete.LLike JN, but also returns a list of interfaces, one per module and in the same orderI base language6global extensions (e.g. specified on the command line) input moduleoutput (annotated) moduleK@module and all extensions with which it is to be compiled. Use  to build this list.J base language6global extensions (e.g. specified on the command line) input modules errors in export or import listsL base language6global extensions (e.g. specified on the command line) input modules4output modules, and errors in export or import listsIJL&None''IL'None$MNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopNone Error type.NoneFKT%The JavaScript FFI interfacing monad.Compile monad.Uns the compiler+Configuration and globals for the compiler.The compilation configuration.#Things written out by the compiler. Constructors.Fay to JS dispatchers.JS to Fay dispatchers.State of the compiler.$Exported identifiers for all modulesMap types to constructorsMap constructors to fields3Newtype constructor, destructor, wrapped type tuple7Map of all imported modules and their source locations.LDepth of the current lexical scope, used for creating unshadowing variables.,Name of the module currently being compiled./Module paths that have code generated for them.5Use JS Strings instead of [Char] for string literals?9Module level declarations having explicit type signaturesSimple concatenating instance.Simple concatenating instance. 2345689:;BAI<=>?@CDEFGHJKLMNOPQRSTUVWXYZ[\]^_`abgcdefhijklmnopqrstuvwxyz{|}~bcdefghijklmnopqrstuvwxyz{|}~PQRSTUVWXYZ[\]^_`a23456 ;<=>?@ABCDEFGHIJ89:KLMNOq None;The opposite of Ptr+. Serialize the specified polymorphic type. foo :: Automatic a -> String=Do not serialize the specified type. This is useful for, e.g. &foo :: String -> String foo = ffi "%1"`This would normally serialize and unserialize the string, for no reason, in this case. Instead: foo :: Ptr String -> Ptr String$Will just give an identity function.Values that may be undefined Defined x encodes to x, Undefined decodes to undefined. An undefined property in a record will be removed when encoding.HValues that may be null Nullable x decodes to x, Null decodes to null.Declare a foreign action.The foreign value.Bottom. (None0WrPrint the JS to a flat string.s Print the JS to a pretty string.tEEncode String to JS-format lterals. Could use the Text.JSON library.uPrints pretty operators. prPrettyOperator flag determines the way of accessing operators (e.g. `($)`) and identifiers with apostrophes (e.g. length'H). If prPrettyOperators is set true, then these will be accessed with square brackets (e.g. Prelude["$"] or Prelude["length'"]). Otherwise special characters will be escaped and accessed with dot (e.g. Prelude.$36$ or Prelude.length$39$). Alphanumeric_ identifiers are always accessed with dot operator (e.g. Prelude.length)vPrint a list of statements.wUnqualify a JsName.x'Print a constructor name given a QName.yPrint an unqualified name.z<Print a constructor name given a Name. Helper for printCons.{bWords reserved in haskell as well are not needed here: case, class, do, else, if, import, in, let|eThis is a hack for names generated in the Haskell AST. Should be removed once it's no longer needed.$Encode a Haskell name to JavaScript.}3Normalize the given name to JavaScript-valid names.~Intercalate monoids. Print one of the kinds of names.Print an expression.Print a module path.Print a single statement./Print special constructors (tuples, list, etc.)#Print (and properly encode) a name.Print module name.3Print (and properly encode to JS) a qualified name.Print literals.rstuvwxyz{|}~)None3<>?K0*None5|Generate a temporary, SCOPED name for testing conditions and such. We don't have name tracking yet, so instead we use this.9Generates temporary names where the scope doesn't matter.LDon't call this directly, use withScopedTmpName or unscopedTmpNames instead.+None"#%<NWrap an expression in a thunk.Wrap an expression in a thunk.Generate unique names.>Resolve a given maybe-qualified name to a fully qualifed name.lResolve a given maybe-qualified name to a fully qualifed name. Use this when a resolution failure is a bug.Resolve a newtype constructor.Resolve a newtype destructor.&Qualify a name for the current module.6Qualify a QName for the current module if unqualified.Make a top-level binding.Force an expression in a thunk.(Is a JS expression a literal (constant)?7Deconstruct a parse result (a la maybe, foldr, either).Get a config option.Optimize pattern matching conditions by merging conditions in common. TODO This is buggy and no longer used. Fails on tests/case3Throw a JS exception.(Throw a JS exception (in an expression).Is an alt a wildcard?Is a pattern a wildcard?4Return formatter string if expression is a FFI call.CGenerate a temporary, SCOPED name for testing conditions and such.|Generate a temporary, SCOPED name for testing conditions and such. We don't have name tracking yet, so instead we use this.Print out a compiler warning.Pretty print a source location.(Lookup the record for a given type name. Get the fields for a given type.Get the flag used for GHC, this differs between GHC-7.6.0 and GHC-everything-else so we need to specially test for that. It's lame, but that's random flag name changes for you..Run the top level compilation for all modules.%Runs compilation for a single module.4Check if the given language pragmas are all present.if then else for when .',None$UMGet all non local identifiers that should be exported in the JS module scope.=Is this *resolved* name a new type constructor or destructor?.Is this *resolved* name a new type destructor?/Is this *resolved* name a new type constructor?>Add a ModulePath to CompileState, meaning it has been printed.'Has this ModulePath been added/printed?+Find the type signature of a top level name-None%Z7Compile the given pattern against the given expression."Compile a pattern variable e.g. x.Compile a record field pattern.-Compile a literal value from a pattern match.#Compile as binding in pattern match%Compile a pattern match on a newtype.Compile a pattern application.Compile a pattern list..None<NOjState.Optimize monad.The arity of a function. Arity here is defined to be the number of arguments that can be directly uncurried from a curried lambda abstraction. So x y z -> if x then (a -> a) else (a -> a) has an arity of 3, not 4.9Run an optimizer, which may output additional statements.&Inline x >> y to x;y in the JS output.Flatten a a>>(b>>c) to [a,b,c]. Try to collect nested a>>(b>>c).RPerform any top-level cross-module optimizations and GO DEEP to optimize further.Perform tail-call optimization.6Strip redundant forcing from the whole generated code.8Strip redundant forcing from an application if possible.OApply the given function to the top-level expressions in the given statements.NApply the given function to the top-level expressions in the given statement.9Collect functions and their arity from the whole codeset.Get the arity of an expression.'Change foo(x)(y) to foo$uncurried(x,y)./Rename an uncurried copy of a curried function./None%No}$Start the compilation process using  compileModule to compile a file.Compile a module$Compile a module given its file path5Lookup a module from include directories and compile.Compile an import.<Find an import's filepath and contents from its module name.0None%<NKCompile an FFI expression (also used when compiling top level definitions).LWarn about uses of naked x.y which will not play nicely with Google Closure.Make a Fay!JS encoder.A name used for transcoding.?The name used for the forced version of a transcoding variable.!Get arg types of a function type.9Convert a Haskell type to an internal FFI representation.Expand a type application.Generate a user-defined type.Translate: JS ! Fay.Translate: Fay ! JS.Make a translator.DGet a JS-representation of a fundamental type for encoding/decoding.Get the arity of a type.7Format the FFI format string with the given arguments..Generate n name-typ pairs from the given list.Generate Fay!JS encoding.Generate JS!Fay decoding.Make a JS!Fay decoder.LThe argument types used in serialization of parametrized user-defined types.@Get the index of a name from the set of type variables bindings..Extract the name from a possibly-kinded tyvar.Source Location.The format string. Arguments. The JS code. None<>?E;Top level, desugar a whole module possibly returning errorsDesugar with the option to specify a prefix for generated names. Useful if you want to provide valid haskell names that HSE can print.(a f ) => b -> a f b (f b) => a -> a f b)Convert do notation into binds and thens.7(,) => x y -> (x,y) (,,) => x y z -> (x,y,z) etc*case { ... } => foo -> case foo of { ... }6if | p -> x | q -> y => case () of _ | p -> x | q -> y(a,) => b -> (a,b)!{a} => {a=a} for R{a} expressions{a} => {a=a} for R{a} patternsDesugar list comprehensions.We only have Enum instance for Int, but GHC hard codes [x..y] syntax to GHC.Base.Enum instead of using our Enum class so we check for obviously incorrect usages and throw an error on them. This can only checks literals, but it helps a bit.;Adds an explicit import Prelude statement when appropriate.For each toplevel FFI pattern binding, search the module for the relevant type declaration; if found, add a type signature to the ffi expression. e.g. foo :: Int foo = ffi "3" becomes foo :: Int foo = ffi "3" :: Inta / b => op a b a + b => (+) a b for expressionsa : b => (:) a b for patterns(a) => a for patterns1None% EPreprocess and collect all information needed during code generation. 3Preprocess a module given its filepath and content. Preprocess from an AST  PreprocessingFind newtype declarations Add new types to the state$Add record declarations to the state 2None%;=>?Compile Haskell expression.Compile variable.Compile Haskell literal.Compile simple application.Helper for compileApp.Compile a negate applicationCompile a let expression.Compile let declaration.Compile a list expression.Compile an if.Compile case expressions.7Compile the given pattern against the given expression.Compile a guarded alt.Compile guardsCompile a lambda.$Compile [e1..] arithmetic sequences.&Compile [e1..e3] arithmetic sequences.'Compile [e1,e2..] arithmetic sequences. )Compile [e1,e2..e3] arithmetic sequences.!wCompile a record construction with named fields | GHC will warn on uninitialized fields, they will be undefined in JS."Compile a record update.#Make a Fay list.$5Optimize short literal [e1..e3] arithmetic sequences.%8Optimize short literal [e1,e2..e3] arithmetic sequences.&[Maximum number of elements to allow in strict list representation of arithmetic sequences.3None%;=>?'Compile Haskell declaration.Compile a declaration.(!Compile a top-level pattern bind.)(Compile a normal simple pattern binding.*FCompile a data declaration (or a GADT, latter is converted to former).+CCompile a function which pattern matches (causing a case analysis).,%Compile a right-hand-side expression.'-()*+,4SafeT./0123455NoneN6uGiven a configuration, resolve any packages specified to their data file directories for importing the *.hs sources.7Resolve package.8?Does a directory exist and does it contain any Haskell sources?9Describe the given package.:5Get the package version from the package description.;!Make a share directory generator.6789:;6None< The data-files source directory.="The default compiler reader value.>The default compiler state.<=>7None?'Call out to GHC to type-check the file.? None "#%;=>?V@ >Compile a Haskell source string to a JavaScript source string.!Compile the top-level Fay module.Compile a source string.@-Compile given the location and source string. Compile a parse HSE module.A6For a module A.B, generate | var A = {}; | A.B = {};BZGenerate exports for non local names, local exports have already been added to the module.C7Generate strict wrappers for the exports of the module.DsIs the module a standard module, i.e., one that we'd rather not output code for if we're compiling separate files.   None%;=>?  \Compile the given file and write the output to the given path, or if nothing given, stdout. fCompile the given file and write to the output, also generates HTML and sourcemap files if configured. Compile the given file. 7Compile a file returning additional generated metadata.Compile a file returning the resulting internal state of the compiler. Don't use this directly, it's only exposed for the test suite.E.Compile the given module to a runnable module.,Convert a Haskell filename to a JS filename.4Convert a Haskell filename to a TypeScript filename.,Print a compile error for human consumption.TGet the JS runtime source. This will return the user supplied runtime if it exists.]  !"#$%&'()*23456    723456    F89:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijjklmnopqrstuvwxyz{|}~       !xx"yy#$+%/& ' ( ) *2+3, - . / 0 1 2 3 4 5 6 7 8 9 :;<=>?@ABCDEFAGHAGIAJKALMALNABOABPABQARSARTABUAVWAVXAVYAVZAV[AV\AV]AV^AV_AV`AVaAVbDcdDceDcfAghAgiAgjAgkAglAgmAgnAgoAgpAgqAgrAgsAgtAguAgvAgwAgxAgyARzAR{AR|AR}AR~ARARARARARARABABABABABAAAAAAAAAAAAAAAABABABAAAAAAAADcDcDcDcDcDcDcDcAAAARARAgAgAgAgAgAgAgAgAgAgAgAgAgAgAgARARARARARARAAAAAABABABABABABAAAAAAAAAAAAAAAAAAAAAABABABABDDDDDDDABABABDDDDARDDAA A A  AB AAAAAABABABABABABABABAAA A!A"A#A$A%A&A'A(A)A*A+A,-A.A/A0A1A2A3A45A46A47A48A49A4:A4;A4<A4<A4=A>?A>@A>AA>BA>CA>DAJEAJFAJGAJHAJIAJJAJKAJLAJMAJNAJOAJPAQRASTAQUAQVAWXAWXAWYAZA[A\A]A^A_A`AaAbAcAdAeAfAgAhiAhjAhkAhlAhmAhnAhoAhpAhqAhrAhsAhtAhuAhvAhwAhxAhyAhzAh{Ah|Ah}Ah~AhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAhAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA ARARARARARARAAAAAAAAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAAAAAAAAAALALAABABAB AB AB AB AB ABABABABABABABABABABABABAAADcDcDc !"#$%&$%'$%($%)$%*$%+$%,$%-$%.$%/$%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 { |A}~        y  =      !"#$%##&&'%()*+,#-./0123456789:4;<=> ? @ A B C D E F G H I JKLM ? N O P Q R S T U V F 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({(|(}(~((((((()))))))))***++++++++++++++++++++++++++++++++++++++,,,,,,,,--------..................../////0000000000000000000000              111111 2 2 2 2 2222222222222222222 2!3"3#3$3%3&3'3(4)4*4+4,4-4.4/405152535455566768697: ; < = > ? @A#fay-0.24.0.1-FNX8qPEYw4V4Y9yWZ3SvCnFay.Compiler.ParseFay.Compiler.Prelude Fay.Config Fay.ConvertFay.Types.CompileResult Fay.TypesFay.Types.CompileErrorFay.FFI Fay.CompilerFay.Compiler.DesugarFayFay.Compiler.GADTFay.Compiler.ModuleTFay.Compiler.QNameFay.ExtsFay.Exts.NoAnnotationFay.Compiler.PrimOp Fay.Runtime Fay.Types.FFIFay.Types.ModulePath Fay.Types.JsFay.Types.Printer#Language.Haskell.Names.Open.DerivedLanguage.Haskell.Names.Types"Language.Haskell.Names.SyntaxUtils'Language.Haskell.Names.LocalSymbolTable(Language.Haskell.Names.GlobalSymbolTable!Language.Haskell.Names.ScopeUtils&Language.Haskell.Names.RecordWildcardsLanguage.Haskell.Names.ImportsLanguage.Haskell.Names.GetBound Language.Haskell.Names.Open.Base%Language.Haskell.Names.Open.Instances$Language.Haskell.Names.ModuleSymbolsLanguage.Haskell.Names.Exports Language.Haskell.Names.Annotated Language.Haskell.Names.RecursiveLanguage.Haskell.NamesFay.Exts.ScopedFay.Compiler.PrintFay.Compiler.Desugar.TypesFay.Compiler.Desugar.NameFay.Compiler.MiscFay.Compiler.StateFay.Compiler.PatternFay.Compiler.OptimizerFay.Compiler.ImportFay.Compiler.FFIFay.Compiler.InitialPassFay.Compiler.ExpFay.Compiler.Decl Paths_fayFay.Compiler.PackagesFay.Compiler.DefaultsFay.Compiler.TypecheckparseFaydefaultExtensionsioanyMreadAllFromProcessConfigconfigOptimizeconfigFlattenAppsconfigExportRuntimeconfigExportStdlibconfigExportStdlibOnlyconfigPrettyPrintconfigHtmlWrapperconfigSourceMapconfigHtmlJSLibs configLibrary configWarnconfigFilePathconfigTypecheck configWallconfigGClosureconfigPackageConfconfigBasePath configStrictconfigTypecheckOnlyconfigRuntimePathconfigOptimizeNewtypesconfigPrettyThunksconfigPrettyOperatorsconfigShowGhcCallsconfigTypeScript defaultConfigdefaultConfigWithSandboxconfigDirectoryIncludesconfigDirectoryIncludePaths%nonPackageConfigDirectoryIncludePathsaddConfigDirectoryIncludeaddConfigDirectoryIncludesaddConfigDirectoryIncludePathsconfigPackagesaddConfigPackageaddConfigPackagesshouldExportStrictWrapper$fDefaultConfig $fShowConfig showToFay encodeFay readFromFay readFromFay' decodeFay CompileResult resOutput resImportedresSourceMappings$fShowCompileResultSerializeContextSerializeAnywhereSerializeUserArgFundamentalType FunctionTypeJsTypeListType TupleType UserDefinedDefinedNullableDateType StringType DoubleTypeIntTypeBoolTypePtrType Automatic UnknownType ModulePath unModulePath mkModulePath mkModulePathsmkModulePathFromQNameJsLitJsCharJsStrJsInt JsFloatingJsBoolJsName JsNameVarJsThisJsParametrizedTypeJsThunkJsForceJsApplyJsParamJsTmp JsConstructor JsBuiltIn JsModuleNameJsExpJsRawExpJsSeqJsFunJsAppJsNegApp JsTernaryIfJsNullJsParen JsGetPropJsLookup JsUpdatePropJsGetPropExternJsUpdatePropExternJsListJsNew JsThrowExp JsInstanceOfJsIndexJsEqJsNeqJsInfixJsObjJsLitObj JsUndefinedJsAndJsOrJsStmtJsVarJsMapVarJsIf JsEarlyReturnJsThrowJsWhileJsUpdate JsSetProp JsSetQName JsSetModuleJsSetConstructorJsSetPropExtern JsContinueJsBlock JsExpStmt PrintableprintJSPrinter runPrinter PrintStatepsLinepsColumn psIndentLevel psNewline PrintWriter pwMappingspwOutput PrintReaderprPrettyprPrettyThunksprPrettyOperatorsdefaultPrintReaderpwOutputStringdefaultPrintState execPrinterindentednewlinewriteaskIfmapping CompileErrorCouldn'tFindImport EmptyDoBlockFfiFormatBadCharsFfiFormatIncompleteArgFfiFormatInvalidJavaScriptFfiFormatNoSuchArgFfiNeedsTypeSigGHCErrorInvalidDoBlock ParseErrorShouldBeDesugaredUnableResolveQualifiedUnsupportedDeclarationUnsupportedEnumUnsupportedExportSpecUnsupportedExpressionUnsupportedFieldPatternUnsupportedImportUnsupportedLetUnsupportedLetBindingUnsupportedLiteralUnsupportedModuleSyntaxUnsupportedPatternUnsupportedQualStmtUnsupportedRecursiveDoUnsupportedRhsUnsupportedWhereInAltUnsupportedWhereInMatch$fShowCompileError CompileModuleCompile unCompile CompileReader readerConfigreaderCompileLitreaderCompileDecls CompileWriter writerCons writerFayToJs writerJsToFay CompileStatestateInterfacesstateRecordTypes stateRecords stateNewtypes stateImportedstateNameDepthstateModuleNamestateJsModulePathsstateUseFromString stateTypeSigs$fMonoidCompileWriter$fSemigroupCompileWriter$fMonadModuleCompile$fShowCompileState$fShowCompileWriter$fApplicativeCompile$fFunctorCompile$fMonadCompile$fMonadErrorCompile$fMonadIOCompile$fMonadReaderCompile$fMonadStateCompile$fMonadWriterCompile$fApplicativeFay $fFunctorFay $fMonadFayPtr UndefinedNullffirunCompileModule compileWithdesugardesugar'desugarPatParendesugarExpParen compileExp compileDecl compileViaStrcompileToplevelModulecompileModuleFromContentscompileModuleFromAST compileFromTocompileFromToAndGenerateHtml compileFilecompileFileWithResultcompileFileWithStatetoJsNametoTsNameshowCompileErrorreadConfigRuntime convertGADTCPPStateapplyCPP parseModeNoCPPCPPIfCPPElsebaseGHC.Base++ghc-primGHC.PrimseqGHC.Listfilterzip System.IOprint Data.Tuplefstsnd otherwisemap$GHC.Real fromIntegral realToFracjoinGHC.EnumBoundedminBoundmaxBoundEnumenumFrom enumFromThenenumFromThenTo enumFromTofromEnumtoEnumsuccpred GHC.ClassesEq==/= GHC.FloatFloatingpilogsqrt**logBasesincostanasinacosatansinhcoshtanhasinhacoshatanh Fractional fromRational/recipIntegral toIntegerquotremdivquotRemdivModMonadfail>>=>>return Data.DataDatagfoldlgunfoldtoConstr dataTypeOf dataCast1 dataCast2gmapTgmapQlgmapQrgmapQgmapQigmapMgmapMpgmapMoFunctorfmap<$GHC.NumNum*+-negate fromIntegerabssignumOrd>=minmax><<=compareGHC.ReadRead readsPrecreadListReal toRational RealFloat floatRadix floatDigits floatRange decodeFloat encodeFloatexponent significand scaleFloatisNaN isInfiniteisDenormalizedisNegativeZeroisIEEEatan2RealFracproperFractiontruncateroundceilingfloorGHC.ShowShowshow showsPrecshowListData.Typeable.InternalTypeable ApplicativeliftA2pure<*>*><* Data.FoldableFoldablefoldl'foldrlengthfoldMapnullfoldlfoldl1sumproductfoldr1maximumminimumelemData.Traversable TraversabletraversemapM sequenceAsequenceData.Semigroup Semigroup<>Monoidmemptymappendmconcat GHC.TypesBoolFalseTrueCharDoubleFloatInt integer-gmpGHC.Integer.TypeIntegerMaybeNothingJustOrderingLTEQGTRationalIOWord Data.EitherEitherLeftRight Data.Functor<$>StringShowS GHC.UnicodeisSpaceisAlphaisDigit Text.Readread Alternativeemptymany<|>some MonadPlusmzeromplus Control.Monadmfilter<$!>unless replicateM_ replicateMfoldM_foldM zipWithM_zipWithM mapAndUnzipMforever<=<>=>filterM Data.ListisSubsequenceOffoldMapDefault fmapDefault mapAccumR mapAccumLforMforControl.Applicativeoptional WrappedMonad WrapMonad unwrapMonad WrappedArrow WrapArrow unwrapArrowZipList getZipList Control.Arrowfirstsecond***&&&|||+++readIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharGHC.IO.ExceptionioErrorGHC.IOFilePath userErrorIOErrorData.Functor.ConstConstgetConstfindnotElem minimumBy maximumByallanyorand concatMapconcatmsum sequence_forM_mapM_ Data.OldListunwordswordsunlineslinesunfoldrsortOnsortBysort permutations subsequencestailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLengthinsertByinsert partition transpose intercalate intersperse intersectBy intersectunionByunion\\deleteBydeletenubBynub isInfixOf isSuffixOf isPrefixOf findIndices findIndex elemIndices elemIndex stripPrefix dropWhileEnd Data.Char isSeparatorisNumberisMarkisLetter digitToIntreads fromRightfromLeftisRightisLeftpartitionEithersrightsleftseitherData.Ord comparingDown readLitChar lexLitCharlex readParenText.ParserCombinators.ReadPReadStoTitletoUppertoLowerisLowerisUpperisPrint isControl isAlphaNumisSymbol isPunctuation isHexDigit isOctDigit isAsciiUpper isAsciiLowerisLatin1isAsciigeneralCategory Data.Functiononvoidlcmgcd^^^oddevenGHC.Charchr intToDigit showLitChar showParen showStringshowCharshowsunzip3unzipzipWith3zipWithzip3!!lookupreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl'scanl1scanlfoldl1'initlasttailunconshead Data.MaybemapMaybe catMaybes listToMaybe maybeToList fromMaybefromJust isNothingisJustmaybeuncurrycurrysubtractasTypeOfuntil$!flip.constidordapliftM5liftM4liftM3liftM2liftMwhen=<<liftA3liftA<**>GHC.Err undefinederrorWithoutStackTraceerror&&||not(base-compat-0.10.1-wOncnKUsnmDFmoK5y3oATData.List.Compatiterate'"safe-0.3.17-FlGpNEr1xSs639WHVSgvpBSafe indexNoteindexDefindexMaypredSafepredNotepredDefpredMaysuccSafesuccNotesuccDefsuccMay toEnumSafe toEnumNote toEnumDef toEnumMayfindIndexJustNotefindIndexJustDef findIndexJustelemIndexJustNoteelemIndexJustDef elemIndexJust findJustNote findJustDeffindJustlookupJustNote lookupJustDef lookupJustreadNotereadDefreadMayreadEitherSafeatNoteatDefatMayat assertNote fromJustNote fromJustDef cycleNotecycleDefcycleMay scanl1Note scanr1Note scanl1Def scanr1Def scanl1May scanr1May foldl1Note' foldl1Note foldr1Note foldl1Def' foldl1Def foldr1Def foldl1May' foldl1May foldr1May maximumByNote minimumByNote maximumByDef minimumByDef maximumByMay minimumByMay maximumNote minimumNote maximumDef minimumDef maximumMay minimumMaylastNoteheadNotelastDefheadDeflastMayheadMayinitSafeinitNoteinitDefinitMaytailSafetailNotetailDeftailMayabortModuleTModName MonadModule getModuleInfoControl.Monad.IO.ClassMonadIO ModuleInforeadModuleInfoconvertModuleName runModuleT modToString lookupInCache insertInCache ModuleNameqModNameunQual changeModuleunname unQualify changeModule' withIdent_configDirectoryIncludes_configPackagessyb-0.7-3Lq8MQxmYP07qktjI1jxu0Data.Generics.AliasesextQextRparseDataOrTuple parseTuple parseObject makeSimple makeRecord parseFloat parseDoubleparseInt parseBool parseString parseChar parseText parseArray parseUnitType TyVarBindStmtSrcLoc SpecialConRhsQualStmt QualConDeclQOpQNamePatFieldPatName ModulePragmaModuleMatchLiteral ImportSpec ImportDecl GuardedRhsGadtDecl FieldUpdate FieldDecl ExportSpecExpExDeclHeadDecl ClassDeclBangTypeAltX moduleName moduleExportsmoduleNameStringmkIdentnoIconvertFieldDeclfieldDeclNames declHeadName$fIsStringModuleName$fIsStringQName$fIsStringName SrcSpanInfoSrcSpanSignunAnn fayBuiltin primOpsMap findPrimOp resolvePrimOpgetRuntimeSource$fIsStringJsLit$fMonoidPrintWriter$fIsStringPrinter ENotInScope EAmbiguous ETypeAsClass EClassAsType ENotExported EModNotFound EInternal GlobalValue GlobalType LocalValueTypeVar ValueBinder TypeBinderImport ImportPartExportRecPatWildcardRecExpWildcardNone ScopeErrorScopedOrigName ModuleNameSGNameNameSSymbols SymTypeInfoSymTypeSymData SymNewType SymTypeFam SymDataFamSymClass SymValueInfoSymValue SymMethod SymSelectorSymConstructor SymFixityppGName ppOrigNameppErrorErrorNameInfo origGNamegModulegName HasOrigNameorigName st_origName st_fixity sv_origName sv_typeName sv_fixity sv_classNamesv_constructors ExtensionSetvalSymstySymsmkValmkTysLocmoduleExtensionsdropAnn getModuleName getImportsgetModuleDeclsgetExportSpecList qNameToNamegetDeclHeadName nameToString stringToNameunCName getErrorsTableaddValue lookupValueResultSpecial lookupType fromListsvaluestypes toSymbolscomputeSymbolTable resolveCName resolveCNames scopeErrornonenoScope sv_parentWcField wcFieldNamewcFieldOrigNamewcExistsGlobalValueWcNames patWcNames expWcNamescomputeImportedSymbolsprocessImportsGetBoundgetBoundScopegTablelTablenameCtxwcNames NameContext ResolvableAlg rtraverse initialScopemergeLocalScopesrmap2traverse-with-class-1.0.0.0-44uJCf5f4PbKZcRkPN4xgVData.Generics.Traversablegmap_gTable_lTable_nameCtx_wcNamesOtherBindingTBindingV ReferenceT ReferenceVrunAlgalgdefaultRtraverseintro setWcNamesbinderVbinderTexprVexprTConstraintProxychain<|-: moduleTable moduleSymbolsgetTopDeclSymbolsprocessExportsannotate groupModulesannotateModulecomputeInterfaces findFixPoint getInterfaces srcSpanInfo printJSString printJSPretty toJsStringLit printProp printStmtsident printConsprintConsUnQual printConsName reservedWords encodeName normalizeName mintercalate$fPrintableJsName$fPrintableJsExp$fPrintableModulePath$fPrintableJsStmt$fPrintableSpecialCon$fPrintableName$fPrintableModuleName$fPrintableQName$fPrintableJsLitallowedNameCharsDesugar DesugarReaderreaderNameDepth readerNoInforeaderTmpNamePrefix runDesugar unDesugarwithScopedTmpNameunscopedTmpNamestmpNamethunk stmtsThunk uniqueNamestryResolveNameunsafeResolveNamelookupNewtypeConstlookupNewtypeDestqualify qualifyQName bindToplevelforce isConstant parseResultconfigoptimizePatConditionsthrowthrowExp isWildCardAlt isWildCardPatffiExpwithScopedTmpJsNamewarn printSrcLoc typeToRecs typeToFieldsgetGhcPackageDbFlag runTopCompilehasLanguagePragmasifOptimizeNewtypesorigName2QNamereplaceWithBuiltInsioWarnprintSrcSpanInfo printSrcSpan recToFieldsshouldBeDesugaredhasLanguagePragma!getNonLocalExportsWithoutNewtypes isNewtype isNewtypeDest isNewtypeCons addModulePathaddedModulePath findTypeSiggetLocalExportsWithoutNewtypes compilePat compilePVarcompilePatFields compilePLit compilePAsPatcompileNewtypePat compilePApp compilePListOptStateOptimize FuncArity runOptimizer inlineMonadflattencollectoptimizeTopleveltcostripAndUncurrywalkAndStripForcesapplyToExpsInStmtsapplyToExpsInStmt collectFuncsexpArityuncurryBindingrenameUncurried optUncurryoptStmts startCompilecompileModuleFromFilecompileModuleFromName compileImport findImport compileFFIExp warnDotUses emitFayToJstranscodingObjtranscodingObjForcedfunctionTypeArgsargType expandApp userDefinedjsToFayfayToJs translatetypeRep typeArity formatFFI explodeFields fayToJsHash jsToFayHash emitJsToFayargTypesgetIndextyvardesugarSection desugarDodesugarTupleCon desugarLCasedesugarMultiIfdesugarTupleSectiondesugarFieldPundesugarPatFieldPundesugarListComp checkEnumdesugarImplicitPreludedesugarToplevelFFITypeSigsdesugarInfixOp.haskell-src-exts-1.20.2-F1uUzlDHWsq10Vce6vCtviLanguage.Haskell.Exts.BuildopdesugarInfixPat initialPasspreprocessFileWithSource preprocessASTscanNewtypeDeclscompileNewtypeDeclscanRecordDecls compileVar compileLit compileApp compileApp' compileNegApp compileLetcompileLetDecl compileList compileIf compileCase compilePatAltcompileGuardedAlt compileGuards compileLambdacompileEnumFromcompileEnumFromTocompileEnumFromThencompileEnumFromThenTocompileRecConstrcompileRecUpdatemakeList optEnumFromTooptEnumFromThenTomaxStrictASLen compileDeclscompilePatBindcompileUnguardedRhscompileDataDeclcompileFunCase compileRhsmkTyVarsversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNameresolvePackagesresolvePackagedoesSourceDirExistdescribePackagepackageVersion getShareGen faySourceDirdefaultCompileReaderdefaultCompileState typecheckcompileFileWithSourcecreateModulePathgenerateExportsgenerateStrictExportsanStdlibModulecompileToModule