!=g]c      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b 7 Nonecfay%Convert a GADT to a normal data type.cNone%&dfayThe CPP's parsing state.PfayParse some Fay code.efayKApply 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.ffayThe parse mode for Fay.PQPQSafe'Rfay3Alias of liftIO, I hate typing it. Hate reading it.Sfay)Do any of the (monadic) predicates match?Tfay3Read from a process returning both std err and out. #'( )F*+ ,-._^]\[ZYXWVUTSR/=0,+  *)1ONMLHG23456 78g%$&>9h:rpqo;< !"=IL>?@ABCJKDOPQEFGHMN`abcdefghijklmijklmnnopqrstuvwxutsvwxyz{|}~yz{|}~     !"#$%&'(-./0123456789:;<A@?BCDEIJK      !"#$RSTd '( )F*+ ,-/=0,+  *)1ONMLHG23456 8%$&>9:rpqo;< !"=IL>?@ABCJKDOPQEFGHMNwxyz{|}~     !"#$%&'(-./0123<BCDEIJKutsv#-/po`abcdefghijklmn56789:;<A@?>4._^]\[ZYXWVUTSR7< !"SRT None=?HMVI%fay$A standard module monad transformer.i is the type of module info, m is the underlying monad.&faytDifferent libraries (Cabal, haskell-src-exts, ...) use different types to represent module names. Hence this class.'fay1This 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*fayThe type of module info+fayGRead the module info, given a list of search paths and the module name,fay@Convert module name from arbitrary representation to Cabal's one(fay~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 J 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.-fayRun a % action-faythe monadic action to runfay~return value, plus all cached module infos (that is, the initial set plus all infos that have been read by the action itself) %&.'*/0+(-NoneL1fay.Extract the module name from a qualified name.2fayExtract the name from a QName.3fay(Change or add the ModuleName of a QName.4fayExtract the string from a Name.1253674Noneg|&UfayDConfiguration of the compiler. The fields with a leading underscoreVfayRun optimizationsWfayFlatten function application?XfayExport the runtime?YfayExport the stdlib?ZfayExport only the stdlib?8fay5Possibly a fay package name, and a include directory.[fayPretty print the JS output?\fay-Output a HTML file including the produced JS.]fay(Output a source map file as outfile.map.^fay$Any JS files to link to in the HTML._fay%Don't invoke main in the produced JS.`fay3Warn on dubious stuff, not related to typechecking.afayFile path to output to.bfayTypecheck with GHC.cfayTypecheck with -Wall.dfay&Run Google Closure on the produced JS.efay(The package config e.g. packages-6.12.3.9fayIncluded Fay packages.ffay#Custom source location for fay-basegfayProduce strict and uncurried JavaScript callable wrappers for all exported functions with type signatures in the given modulehfay:Only invoke GHC for typechecking, don't produce any outputjfay#Optimize away newtype constructors?kfayUse pretty thunk names?lfayUse pretty operators?mfayPrint commands sent to GHC?nfayOutput a TypeScript file.qfay/Reading _configDirectoryIncludes is safe to do.rfay8Get all include directories without the package mapping.sfay:Get all include directories not included through packages.tfay:Add a mapping from (maybe) a package to a source directoryufay Add several include directories.vfay;Add several include directories without package references.wfay&Reading _configPackages is safe to do.xfayAdd a package to compilationyfay#Add several packages to compilationzfay5Should a strict wrapper be generated for this module?{fayDefault configuration.&UVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz&UVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyzNone%QSX}}fayxConvert 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.~fayConvert 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 :' to additional type- specific cases.fay,Convert a Fay json value to a Haskell value.fay~Convert a Fay json value to a Haskell value. This is like readFromFay, except it yields helpful error messages on failure.fay,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 ;' to additional type- specific cases.<fay%Parse a data type or record or tuple.=fayParse a tuple.>fay(Parse a data constructor from an object.?fayRMake a simple ADT constructor from an object: { "slot1": 1, "slot2": 2} -> Foo 1 2@fay;Make a record from a key-value: { "x": 1 } -> Foo { x = 1 }AfayParse a float.BfayParse a double.Cfay Parse an int.Dfay Parse a bool.EfayParse a string.Ffay Parse a char.Gfay Parse a Text.HfayParse an array.Ifay Parse unit.}~}~None~Y)JKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrNone=?sfay.Helpful for writing qualified symbols (Fay.*).tfayHelpful for some things.ufayHelpful for some things.$vwxyz{|}~None%-fay/Make an identifier from the built-in HJ module.fay<Mapping from unqualified names to qualified primitive names.fay:Lookup a primop that was resolved to a Prelude definition.fay[If this is resolved to a Prelude identifier or if it's unqualified, check if it's a primopNone"fayGet the default runtime source.Safe]None+fayThe serialization context indicates whether we're currently serializing some value or a particular field in a user-defined data type.fayIThese 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.Nonefay;The name of a module split into a list for code generation.fay4Construct the complete ModulePath from a ModuleName.fayFConstruct intermediate module paths from a ModuleName. mkModulePaths A.B => [[A], [A,B]]faypConverting a QName to a ModulePath is only relevant for constructors since they can conflict with module names.NonefayLiteral value type.fayA name of some kind.fayExpression type.fayStatement type.fayJust handy to have.?None>fayPrint some value.fay The printer.fay The state of the pretty printer.fayThe current line.fayCurrent column.fayCurrent indentation level.fayJust outputted a newline?fayOutput of printerfaySource mappings.fayThe current output.fayGlobal options of the printerfayAre we to pretty print?fayUse pretty thunk names?fayUse pretty operators?fay-default printer options (non-pretty printing)fayDefault state.fay!Print the given printer indented.faykOutput a newline and makes next line indented when prPretty is True. Does nothing when prPretty is FalsefaygWrite 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 )fay7exec one of Printers depending on PrintReader property.fayPGenerate a mapping from the Haskell location to the current point in the output.fayOutput concatenationfay>Write out a string, updating the current position information.None,=?@ANone12456P*fayname is not in scopefayname is ambiguousfay+type is used where a type class is expectedfay+type class is used where a type is expectedfaylAttempt 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 namefaymodule not foundfayinternal errorfay global valuefay global typefay+local value, and location where it is boundfay-type variable, and location where it is boundfayhere the value name is boundfayhere the type name is definedfayimport: declaration, and the table of symbols that it introducesfay part of an import declarationfayexport( declaration, and the symbols it exportsfayxwildcard in a record pattern. The list contains resolved names of the fields that are brought in scope by this pattern.faywildcard in a record construction expression. The list contains resolved names of the fields and information about values assigned to those fields.fay no annotationfay scope errorfay\A pair of the name information and original annotation. Used as an annotation type for AST.fayQualified 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 J6, then the entity is defined in the "current" package.fay8Possibly qualified name. If the name is not qualified,  is the empty string.fay!String representing a module namefay.String representing an unqualified entity namefayuThe set of symbols (entities) exported by a single module. Contains the sets of value-level and type-level entities.fay'Information about a type-level entitityfay type synonymfay data typefaynewtypefay type familyfay data familyfay type classfay(Information about a value-level entitityfayvalue or functionfay class methodfayrecord field selectorfaydata constructorfayRepesents the symbol's fixityfay Display a fay Display an fayDisplay an error.@Note: can span multiple lines; the trailing newline is included.ANoneӦfayCompute the extension set for the given module, based on the global preferences (e.g. specified on the command line) and module's LANGUAGE pragmas.fay base languagefayglobal extensions NoneMfay1Local symbol table  contains locally bound namesNone2fay+Global symbol table  contains global names NonefayIf L< ("qualified"), then only the qualified names are inserted.If I:, then both qualified and unqualified names are insterted.fayerror for "not found" conditionfayerror for "not found" conditionNone$PQkfay)Information about a field in the wildcard faythe field's simple name faythe field's original name fayowhether there is a global value in scope with the same name as the field but different from the field selector fayAInformation 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.    NoneHQVfay)This function takes care of the possible hiding clausefay all symbolsfaymentioned symbolsfayimported symbolsNone $=?@ACXfayGet bound value identifiers.faysFor record wildcards we need to know which fields the given constructor has. So we pass the global table for that. None.8=>?@AHSXkfay\Contains information about the node's enclosing scope. Can be accessed through the lenses: , , , .fay:Describes how we should treat names in the current contextfayA type that implements < provides a way to perform a shallow scope-aware traversal.fayThe algebra for L. It's newtype-wrapped because an implicit parameter cannot be polymorphic.fayCreate an initial scopefay]Merge local tables of two scopes. The other fields of the scopes are assumed to be the same.fay Analogous to  , but for   !"#$%&'()*+,-./0123!None =>?@ASX4fayChain 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.5465"None%X7fayvCompute module's global table. It contains both the imported entities and the global entities defined in this module.8fay9Compute 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 {..} = foo7fay the import table for this module8fay the import table for this module9fay the import table for this module78#NoneHV:$None &'>@AQUVX;%NoneHVX<fayTake 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.=fayAnnotate a module with scoping information. This assumes that all module dependencies have been resolved and cached  usually you need to run >1 first, unless you have one module in isolation.?fayCompute interfaces for a set of mutually recursive modules and write the results to the cache. Return the set of import/export errors.>fay> 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.@fayLike >N, but also returns a list of interfaces, one per module and in the same order=fay base languagefay6global extensions (e.g. specified on the command line)fay input modulefayoutput (annotated) module?fay@module and all extensions with which it is to be compiled. Use  to build this list.>fay base languagefay6global extensions (e.g. specified on the command line)fay input modulesfay errors in export or import lists@fay base languagefay6global extensions (e.g. specified on the command line)fay input modulesfay4output modules, and errors in export or import lists=>@&None'=@'None$ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdNonefay Error type.          NoneHMV'Cfay%The JavaScript FFI interfacing monad.fayCompile monad.fayUns the compilerfay+Configuration and globals for the compiler.!fayThe compilation configuration.$fay#Things written out by the compiler.&fay Constructors.'fayFay to JS dispatchers.(fayJS to Fay dispatchers.)fayState of the compiler.+fay$Exported identifiers for all modules,fayMap types to constructors-fayMap constructors to fields.fay3Newtype constructor, destructor, wrapped type tuple/fay7Map of all imported modules and their source locations.0fayLDepth of the current lexical scope, used for creating unshadowing variables.1fay,Name of the module currently being compiled.2fay/Module paths that have code generated for them.3fay5Use JS Strings instead of [Char] for string literals?4fay9Module level declarations having explicit type signatures5faySimple concatenating instance.6faySimple concatenating instance.UVWXYZ[\]^_`abcdefghijklmn      !"#$%&'()*+,-./01234      !"#$%&'(UVWXYZ[\]^_`abcdefghijklmn)*+,-./01234None=8^EfayThe opposite of Ptr+. Serialize the specified polymorphic type. foo :: Automatic a -> StringFfay=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.GfayValues that may be undefined Defined x encodes to x, Undefined decodes to undefined. An undefined property in a record will be removed when encoding.JfayHValues that may be null Nullable x decodes to x, Null decodes to null.MfayDeclare a foreign action.MfayThe foreign value.fayBottom. EFGHIJLKM JLKGHIFEM(NoneOefayPrint the JS to a flat string.ffay Print the JS to a pretty string.gfayEEncode String to JS-format lterals. Could use the Text.JSON library.hfayPrints 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)ifayPrint a list of statements.jfayUnqualify a JsName.kfay'Print a constructor name given a QName.lfayPrint an unqualified name.mfay<Print a constructor name given a Name. Helper for printCons.nfaybWords reserved in haskell as well are not needed here: case, class, do, else, if, import, in, letofayeThis 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.pfay3Normalize the given name to JavaScript-valid names.qfayIntercalate monoids.rfay Print one of the kinds of names.sfayPrint an expression.tfayPrint a module path.ufayPrint a single statement.vfay/Print special constructors (tuples, list, etc.)wfay#Print (and properly encode) a name.xfayPrint module name.yfay3Print (and properly encode to JS) a qualified name.zfayPrint literals.efghijklmn{opq)None4>@AMP|}~*NoneU+fay|Generate a temporary, SCOPED name for testing conditions and such. We don't have name tracking yet, so instead we use this.fay9Generates temporary names where the scope doesn't matter.fayLDon't call this directly, use withScopedTmpName or unscopedTmpNames instead.+None"#%>p fayWrap an expression in a thunk.fayWrap an expression in a thunk.fayGenerate unique names.fay>Resolve a given maybe-qualified name to a fully qualifed name.faylResolve a given maybe-qualified name to a fully qualifed name. Use this when a resolution failure is a bug.fayResolve a newtype constructor.fayResolve a newtype destructor.fay&Qualify a name for the current module.fay6Qualify a QName for the current module if unqualified.fayMake a top-level binding.fayForce an expression in a thunk.fay(Is a JS expression a literal (constant)?fay7Deconstruct a parse result (a la maybe, foldr, either).fayGet a config option.fayOptimize pattern matching conditions by merging conditions in common. TODO This is buggy and no longer used. Fails on tests/case3fayThrow a JS exception.fay(Throw a JS exception (in an expression).fayIs an alt a wildcard?fayIs a pattern a wildcard?fay4Return formatter string if expression is a FFI call.fayCGenerate a temporary, SCOPED name for testing conditions and such.fay|Generate a temporary, SCOPED name for testing conditions and such. We don't have name tracking yet, so instead we use this.fayPrint out a compiler warning.fayPretty print a source location.fay(Lookup the record for a given type name.fay Get the fields for a given type.fayGet 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.fay.Run the top level compilation for all modules.Nfay%Runs compilation for a single module.fay4Check if the given language pragmas are all present.fayif then else for when j.'N,None$wZfayMGet all non local identifiers that should be exported in the JS module scope.fay=Is this *resolved* name a new type constructor or destructor?fay.Is this *resolved* name a new type destructor?fay/Is this *resolved* name a new type constructor?fay>Add a ModulePath to CompileState, meaning it has been printed.fay'Has this ModulePath been added/printed?fay+Find the type signature of a top level name-None%|fay7Compile the given pattern against the given expression.fay"Compile a pattern variable e.g. x.fayCompile a record field pattern.fay-Compile a literal value from a pattern match.fay#Compile as binding in pattern matchfay%Compile a pattern match on a newtype.fayCompile a pattern application.fayCompile a pattern list..None>PQfayState.fayOptimize monad.fayThe 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.fay9Run an optimizer, which may output additional statements.fay&Inline x >> y to x;y in the JS output.fayFlatten a a>>(b>>c) to [a,b,c].fay Try to collect nested a>>(b>>c).fayRPerform any top-level cross-module optimizations and GO DEEP to optimize further.fayPerform tail-call optimization.fay6Strip redundant forcing from the whole generated code.fay8Strip redundant forcing from an application if possible.fayOApply the given function to the top-level expressions in the given statements.fayNApply the given function to the top-level expressions in the given statement.fay9Collect functions and their arity from the whole codeset.fayGet the arity of an expression.fay'Change foo(x)(y) to foo$uncurried(x,y).fay/Rename an uncurried copy of a curried function./None%Pfay$Start the compilation process using  compileModule to compile a file.OfayCompile a modulefay$Compile a module given its file pathfay5Lookup a module from include directories and compile.fayCompile an import.fay<Find an import's filepath and contents from its module name.O0None%>PfayKCompile an FFI expression (also used when compiling top level definitions).fayLWarn about uses of naked x.y which will not play nicely with Google Closure.fayMake a Fay!JS encoder.fayA name used for transcoding.fay?The name used for the forced version of a transcoding variable.fay!Get arg types of a function type.fay9Convert a Haskell type to an internal FFI representation.fayExpand a type application.fayGenerate a user-defined type.fayTranslate: JS ! Fay.fayTranslate: Fay ! JS.fayMake a translator.fayDGet a JS-representation of a fundamental type for encoding/decoding.fayGet the arity of a type.fay7Format the FFI format string with the given arguments.fay.Generate n name-typ pairs from the given list.fayGenerate Fay!JS encoding.fayGenerate JS!Fay decoding.fayMake a JS!Fay decoder.fayLThe argument types used in serialization of parametrized user-defined types.fay@Get the index of a name from the set of type variables bindings.fay.Extract the name from a possibly-kinded tyvar.faySource Location.fayThe format string.fay Arguments.fay The JS code. None>@APfay;Top level, desugar a whole module possibly returning errorsQfayDesugar with the option to specify a prefix for generated names. Useful if you want to provide valid haskell names that HSE can print.fay(a f ) => b -> a f b (f b) => a -> a f bfay)Convert do notation into binds and thens.fay7(,) => x y -> (x,y) (,,) => x y z -> (x,y,z) etcfay*case { ... } => foo -> case foo of { ... }fay6if | p -> x | q -> y => case () of _ | p -> x | q -> yfay(a,) => b -> (a,b)fay!{a} => {a=a} for R{a} expressionsfay{a} => {a=a} for R{a} patternsfayDesugar list comprehensions.fayWe 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.fay;Adds an explicit import Prelude statement when appropriate.fayFor 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" :: Intfaya / b => op a b a + b => (+) a b for expressionsfaya : b => (:) a b for patternsSfay(a) => a for patternsPQRSPQSR1None%fayEPreprocess and collect all information needed during code generation.fay3Preprocess a module given its filepath and content.fayPreprocess from an ASTfay PreprocessingFind newtype declarationsfayAdd new types to the statefay$Add record declarations to the state2None%=?@ATfayCompile Haskell expression.fayCompile variable.fayCompile Haskell literal.fayCompile simple application.fayHelper for compileApp.fayCompile a negate applicationfayCompile a let expression.fayCompile let declaration.fayCompile a list expression.fayCompile an if. fayCompile case expressions. fay7Compile the given pattern against the given expression. fayCompile a guarded alt. fayCompile guards fayCompile a lambda.fay$Compile [e1..] arithmetic sequences.fay&Compile [e1..e3] arithmetic sequences.fay'Compile [e1,e2..] arithmetic sequences.fay)Compile [e1,e2..e3] arithmetic sequences.faywCompile a record construction with named fields | GHC will warn on uninitialized fields, they will be undefined in JS.fayCompile a record update.fayMake a Fay list.fay5Optimize short literal [e1..e3] arithmetic sequences.fay8Optimize short literal [e1,e2..e3] arithmetic sequences.fay[Maximum number of elements to allow in strict list representation of arithmetic sequences.T 3None%=?@AӢfayCompile Haskell declaration.UfayCompile a declaration.fay!Compile a top-level pattern bind.fay(Compile a normal simple pattern binding.fayFCompile a data declaration (or a GADT, latter is converted to former).fayCCompile a function which pattern matches (causing a case analysis).fay%Compile a right-hand-side expression.U4Safe !"#$%&5NonePٸ'fayuGiven a configuration, resolve any packages specified to their data file directories for importing the *.hs sources.(fayResolve package.)fay?Does a directory exist and does it contain any Haskell sources?*fayDescribe the given package.+fay5Get the package version from the package description.,fay!Make a share directory generator.'()*+,6None-fay The data-files source directory..fay"The default compiler reader value./fayThe default compiler state.-./7Noneܺ0fay'Call out to GHC to type-check the file.0 None "#%=?@AX Vfay>Compile a Haskell source string to a JavaScript source string.Wfay!Compile the top-level Fay module.XfayCompile a source string.1fay-Compile given the location and source string.YfayCompile a parse HSE module.2fay6For a module A.B, generate | var A = {}; | A.B = {};3fayZGenerate exports for non local names, local exports have already been added to the module.4fay7Generate strict wrappers for the exports of the module.5faysIs the module a standard module, i.e., one that we'd rather not output code for if we're compiling separate files. PNOTUVWXY NVOTUWXYP None%=?@A Zfay\Compile the given file and write the output to the given path, or if nothing given, stdout.[fayfCompile the given file and write to the output, also generates HTML and sourcemap files if configured.\fayCompile the given file.]fay7Compile a file returning additional generated metadata.^fayCompile a file returning the resulting internal state of the compiler. Don't use this directly, it's only exposed for the test suite.6fay.Compile the given module to a runnable module._fay,Convert a Haskell filename to a JS filename.`fay4Convert a Haskell filename to a TypeScript filename.afay,Print a compile error for human consumption.bfayTGet the JS runtime source. This will return the user supplied runtime if it exists.]UVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz     )*+,-./01234Z[\]^_`ab7     )*+,-./01234\^]Z[_`ab789:;<=8>?8>@8AB8CD8CE89F89G89H8IJ8IK8LM8NO8NP8NQ8NR;ST;SU8IV89W89X89Y89Z89[8\]8\^8L_8L`8La8Lb89c89d89e89f89g89h89i89j8Nk8Nl;Sm8no8Lp8Lq89r8st89u8Iv;Sw8xy8Lz8n{8L|8}~889888989;;;;;8;8L;;8;88;88;;;8s8s8s8s8s8s8s8s8s8s8s8s8s8s88888888888888888888\8\8\8\8A8A8A8A8A8A8A8A8A8A8A8A8888888888888888888888888888888888888888x8x8x8x8x8x88n8n 8n 8n 8n 8n 8n8n8n8n8n8n8n8n8n8n8n8n8n8n8n8n8n8n8n 8n!8n"8n#8n$8n%8n&8'(8')8'*8'+8',8'-8'.8'/8'08'18'28'38'48'58'68'78'88'98':8';8<=8>?8>@8LA8LB8LC8LD8LE8LF8LG8LH8LI8LJ8LK8LL8LM8LN8LO8LP8LQ8LR8NS8NT8NU8NV8NW8NX8YZ8}[8}\8}]8}^8}_8}`8}a8}b8}c8}d8>e8>f8>g8>h8>i8>j8>k8>l8>m8>n8>o8>p8>q8>r8>s8>t8>u8>v8>w8>x8>y8>z8>{8>|8>}8>~8>88C8C8I8I8I8I8I89898989898989898989898989898989898989898989888;S;S;S;S;S;S;S;S;S;S      !"#$%&'()*+,-./0123456789:;;<==>?@ABBCDEEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno pqqrsstuvwwxyz{{|}~+/    23              89888888888888888888888888888888888888888888888888888888888888888888888888888888888888 8 8 8> 8> 8> 8>888888888989898989898989 ! " # $ % & ' ( ) * + , - . / 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 w8xy z { | } ~        !!" #$%&'()*+,-./0123456789 : ; < = > ? @ A B C D EFGH : I J K L M N O P Q A 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({(|(}(~()))))))***++++++++++++++++++++++++++++++++++++++,,,,,,,,--------..................../////0000000000000000000000              1111112222222 2 2 2 2 2222222222222333333 3!4"4#4$4%4&4'4(4)5*5+5,5-5.5/60616273 4 5 6 7 8 9:fay-0.24.0.3-inplaceFay.Compiler.PreludeFay.Compiler.Parse 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.TypecheckbaseGHC.Base++ghc-primGHC.PrimseqGHC.Listfilterzip System.IOprint Data.Tuplefstsnd otherwisemap$GHC.Num fromInteger-GHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negatefail>>=>>fmapreturn Control.Arrowfirst||| fromIntegral realToFrac toInteger toRational<>memptymappendmconcatjoin<*>pure*>BoundedEnumEq GHC.FloatFloating FractionalIntegralMonad Data.DataDataFunctorNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShowData.Typeable.InternalTypeable Applicative Data.FoldableFoldableData.Traversable Traversable SemigroupMonoid GHC.TypesBoolCharDoubleFloatInt integer-gmpGHC.Integer.TypeInteger GHC.MaybeMaybeOrderingRationalIOWord Data.EitherEitherFalseNothingJustTrueLeftRightLTEQGTgmapMogmapMpgmapMgmapQigmapQgmapQrgmapQlgmapT dataCast2 dataCast1 dataTypeOftoConstrgunfoldgfoldl Control.Monadmfilter<$!>unless replicateM_ replicateMfoldM_foldM zipWithM_zipWithM mapAndUnzipMforever<=<>=>filterMforMsequencemapM sequenceAtraverse&&&***second+++readIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharGHC.IO.ExceptionioErrorGHC.IOFilePath userErrorIOErrornotElemallanyorand concatMapconcatmsum sequence_forM_mapM_productsumminimummaximumelemlengthnullfoldl1foldr1foldlfoldrfoldMap Data.OldListunwordswordsunlineslines Data.Char isSeparatorisNumberisMarkisLetter digitToInt Text.Readreadreadseither readLitChar lexLitCharlex readParenreadList readsPrecText.ParserCombinators.ReadPReadSatanhacoshasinhtanhcoshsinhatanacosasintancossinlogBase**sqrtlogpiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadix GHC.UnicodetoTitletoUppertoLowerisLowerisUpperisPrint isControl isAlphaNumisAlphaisSymbol isPunctuation isHexDigit isOctDigitisDigitisSpace isAsciiUpper isAsciiLowerisLatin1isAsciigeneralCategory Data.Functionon Data.Functorvoid<$>lcmgcd^^^oddevendivModquotRemdivremquotrecip/floorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumpredsuccGHC.Charchr intToDigit showLitChar showParen showStringshowCharshowsShowSshowListshow showsPrecunzip3unzipzipWith3zipWithzip3!!lookupreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlinitlasttailhead Data.Maybemaybeuncurrycurrysubtractsignumabs*+asTypeOfuntil$!flip.constidordapliftM5liftM4liftM3liftM2liftMwhen=<<<$<*mplusmzero MonadPlusStringGHC.Err undefinederrorWithoutStackTraceerror/=<=compare&&||not<>maxminparseFaydefaultExtensionsioanyMreadAllFromProcessConfigconfigOptimizeconfigFlattenAppsconfigExportRuntimeconfigExportStdlibconfigExportStdlibOnlyconfigPrettyPrintconfigHtmlWrapperconfigSourceMapconfigHtmlJSLibs 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 parseModeliftA2foldl' Data.ListisSubsequenceOffoldMapDefault fmapDefault mapAccumR mapAccumLforControl.Applicativeoptional WrappedMonad WrapMonad unwrapMonad WrappedArrow WrapArrow unwrapArrowZipList getZipListData.Functor.ConstConstgetConstfind minimumBy maximumByunfoldrsortOnsortBysort permutations subsequencestailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLengthinsertByinsert partition transpose intercalate intersperse intersectBy intersectunionByunion\\deleteBydeletenubBynub isInfixOf isSuffixOf isPrefixOf findIndices findIndex elemIndices elemIndex stripPrefix dropWhileEnd fromRightfromLeftisRightisLeftpartitionEithersrightsleftsData.Ord comparingDowniterate'scanl'foldl1'unconsmapMaybe catMaybes listToMaybe maybeToList fromMaybefromJust isNothingisJustliftA3liftA<**> Alternativeempty<|>somemanysf-0.3.17-b49a10e6Safeabort assertNoteatatDefatMayatNotecycleDefcycleMay cycleNote elemIndexJustelemIndexJustDefelemIndexJustNote findIndexJustfindIndexJustDeffindIndexJustNotefindJust findJustDef findJustNote foldl1Def foldl1Def' foldl1May foldl1May' foldl1Note foldl1Note' foldr1Def foldr1May foldr1Note fromJustDef fromJustNoteheadDefheadMayheadNoteindexDefindexMay indexNoteinitDefinitMayinitNoteinitSafelastDeflastMaylastNote lookupJust lookupJustDeflookupJustNote maximumByDef maximumByMay maximumByNote maximumDef maximumMay maximumNote minimumByDef minimumByMay minimumByNote minimumDef minimumMay minimumNotepredDefpredMaypredNotepredSafereadDefreadEitherSafereadMayreadNote scanl1Def scanl1May scanl1Note scanr1Def scanr1May scanr1NotesuccDefsuccMaysuccNotesuccSafetailDeftailMaytailNotetailSafe toEnumDef toEnumMay toEnumNote toEnumSafeModuleTModName MonadModule getModuleInfoControl.Monad.IO.ClassMonadIO ModuleInforeadModuleInfoconvertModuleName runModuleT modToString lookupInCache insertInCacheqModNameunQual changeModuleunname unQualify changeModule' withIdent_configDirectoryIncludes_configPackagessyb-0.7-3cb4212dData.Generics.AliasesextQextRparseDataOrTuple parseTuple parseObject makeSimple makeRecord parseFloat parseDoubleparseInt parseBool parseString parseChar parseText parseArray parseUnitType TyVarBindStmtSrcLoc SpecialConRhsQualStmt QualConDeclQOpQNamePatFieldPatName ModulePragma ModuleNameModuleMatchLiteral 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 initialScopemergeLocalScopesrmaptrvrs-wth-clss-1.0.0.0-9368b338Data.Generics.Traversablegmap_gTable_lTable_nameCtx_wcNamesOtherBindingTBindingV ReferenceT ReferenceVrunAlgalgdefaultRtraverseintro setWcNamesbinderVbinderTexprVexprTchain<|-: 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 runDesugarwithScopedTmpNameunscopedTmpNamestmpNamethunk 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 checkEnumdesugarImplicitPreludedesugarToplevelFFITypeSigsdesugarInfixOphskll-src-xts-1.20.3-b466b4c9Language.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