Oo E      !"#$%&'()*+,- . / 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 { | } ~        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                  !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!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!{!|!}!~!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!""##########$$$$$$$$$$$$$$$$$$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$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/z0{1|2}3~444455555555666777777777777777777777777777777777777777777777777777777777777777777777777777899:::::::::::;<====>>>>>>>>>>>>>>>>>>>>>>>>>>>>> > > > > >>>>>>>>>>>>>>>>>>> >!>">#>$>%?&?'@(@)@*@+A,A-B.C/D0D1D2D3D4D5D6D7D8D9D:D;D<D=D>D?D@DADBDCDDDEDFDGDHDIDJDKDLDMDNDODPDQDRDSDTDUDVDWDXDYDZD[D\D]D^D_D`DaDbDcDdDeDfDgDhDiDjDkDlDmDnDoDpDqDrDsDtDuDvDwDxDyEzE{F|F}F~GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHIIIIIIJJJKKKKKKKKKLMMNOOPPPQRSTUUUUUUUUUVWWWWWWWXXYZ[[[[[[[[[[[\\\\\\\\\\\\\\\\\\\\\\\\\\ \ \ \ \ \\\\\\\\\]^^^^^^^^^ ^!^"^#^$^%^&^'^(^)^*^+^,^-^.^/^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`{`|`}`~````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````aaabbccdeffffffffff f g g g ggggghhhhhhhhhhhhhh h!h"h#h$h%h&h'h(h)h*h+h,h-h.h/h0h1h2h3h4h5h6h7h8h9h:h;h<i=i>i?j@jAjBjCjDjEjFjGjHjIjJjKjLjMjNjOjPjQjRjSjTjUjVjWjXjYjZj[j\j]j^j_j`jajbjcjdjejfjgjhjijjjkjljmjnjojpjqjrjsjtjujvjwjxjyjzj{j|j}j~jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjj j j j j jjjjjjjjjjjkkkkkkkk l!l"l#m$m%n&n'n(n)n*n+n,n-n.n/n0o1o2o3p4p5p6p7p8p9p:q;q<q=q>q?r@rAsBsCsDsEsFsGsHsIsJsKtLtMtNtOtPuQuRuSuTuUuVuWuXuYuZu[u\v]v^v_v`vavbwcwdwewfwgwhwiwjwkwlwmwnwowpwqwrwswtwuwvwwwxwywzw{w|w}w~wwwwwwwwwwwwwwxxxxxxxxxxxxxxyz{||}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~~~~~~~~~~~~                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C DSafe!"$*,2:<=CDLMOT[bSafe!"$*,2:<=CDLMOT[b E F G H I J K L M N O P Q F L M N O P Q E F G H I J K L M N O P QSafe!"$*,2:<=CDLMOT[b    None!"$*,2:<=CDLMOT[b GGlob relative to the current directory, and produce relative pathnames.)Glob pattern for PureScript source files.-Glob pattern for PureScript dependency files.    Safe!"$*,2:<=CDLMOT[b    Safe!"$*,2:<=CDLMOT[bState for the parser monad*The most recently marked indentation levelSafe!"$*,2:<=CDLMOT[b !The data type of compiler options Disable tail-call elimination!>Disable inlining of calls to return and bind for the Eff monad"#When specified, checks the type of mainN in the module, and generate a call to run main after the module definitions.#Skip all optimizations$Verbose error message%)Remove the comments from the generated js&Generate soure maps' Dump CoreFn(Default make options  !"#$%&'(  !"#$%&'(  !"#$%&'(  !"#$%&'(Safe!"$*,2:<=CDLMOT[b*0Locates the node executable. Checks for either nodejs or node.+/Grabs the filename where the history is stored. R S*+*+*+ R S*+Safe!"$*,2:<=CDLMOT[b,,,, Safe!"$*,2:<=CDLMOT[b-3Exit with an error message and a crash report link.---- None!"$*,2:<=CDLMOT[b./04./0./044./04 None!"$*,2:<=CDLMOT[b9Start position of this token:5End position of this token (not including whitespace);"End position of the previous token TCWe use Text.Parsec.Token to implement the string and number lexemes U/A token parser based on the language definition]1Parse zero or more values separated by semicolons^0Parse one or more values separated by semicolons_-Parse zero or more values separated by commas`,Parse one or more values separated by commasr)A list of purescript reserved identifierst+The characters allowed for use in operators V<The characters allowed in the head of an unquoted record key W<The characters allowed in the tail of an unquoted record keyu3Strings allowed to be left unquoted in a record keym6 X789:;<=> 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 { | T U@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq } ~ rst V Wuv@6789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstu@789:;<=>6?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcghiefjdklqmnoprstuJ6 X789:;<=> 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 { | T U@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq } ~ rst V Wuv None!"$*,2:<=CDLMOT[b >A module is just a list of elements of the types listed above. <There are four types of module element we are interested in:R1) Require statements 2) Member declarations 3) Export lists 4) Everything else|Each is labelled with the original AST node which generated it, so that we can dump it back into the output during codegen. An export is either a "regular export", which exports a name from the regular module we are in, or a reexport of a declaration in the corresponding foreign module.WRegular exports are labelled, since they might re-export an operator with another name. yA piece of code is identified by its module and its name. These keys are used to label vertices in the dependency graph.{7A module is identified by its module name and its type.}VModules are either "regular modules" (i.e. those generated by psc) or foreign modules.The type of error messages. We separate generation and rendering of errors using a data type, in case we need to match on error types later.XGiven a filename, assuming it is in the correct place on disk, infer a ModuleIdentifier.3Prepare an error message for consumption by humans. FCalculate the ModuleIdentifier which a require(...) statement imports. OCompute the dependencies of all elements in a module, and add them to the tree.YMembers and exports can have dependencies. A dependency is of one of the following forms: 1) module.name or member["name"]where module was imported usingvar module = require( Module.Name);2) nameAwhere name is the name of a member defined in the current module. 1Attempt to create a Module from a Javascript AST.xEach type of module element is matched using pattern guards, and everything else is bundled into the Other constructor. =Eliminate unused code based on the specified entry point set. zTopologically sort the module dependency graph, so that when we generate code, modules can be defined in the right order. A module is empty if it contains no exported members (in other words, if the only things left after dead code elimination are module imports and "other" foreign code).<If a module is empty, we don't want to generate code for it. ?Generate code for a set of modules, including a call to main().8Modules get defined on the global PS object, as follows:>var PS = { }; (function(exports) { ... })(PS[ Module.Name] = PS[ Module.Name ] || {});LIn particular, a module and its foreign imports share the same namespace inside PS. This saves us from having to generate unique names for a module and its foreign imports, and is safe since a module shares a namespace with its foreign imports in PureScript as well (so there is no way to have overlaps in code generated by psc).The bundling function. This function performs dead code elimination, filters empty modules and generates and prints the final Javascript bundle.The bundling function. This function performs dead code elimination, filters empty modules and generates and prints the final Javascript bundle./ {|}~  main module namespace input modulesoutput filenameCThe input modules. Each module should be javascript rendered from ] or psc.WEntry points. These module identifiers are used as the roots for dead-code eliminationAn optional main module.The namespace (e.g. PS).JThe output file name (if there is one - in which case generate source map)CThe input modules. Each module should be javascript rendered from ] or psc.WEntry points. These module identifiers are used as the roots for dead-code eliminationAn optional main module.The namespace (e.g. PS).{|}~{|}~    {|}~ None!"$*,2:<=CDLMOT[b Source nameStart of the spanSource position information Line number Column number  None!"$*,2:<=CDLMOT[bFixity data for infix operators!Associativity for infix operators(A precedence level for an infix operator Safe!"$*,2:<=CDLMOT[bUData type for literal values. Parameterised so it can be used for Exprs and Binders.A numeric literalA string literalA character literalA boolean literalAn array literalAn object literalNone!"$*,2:<=CDILMOT[bNone!"$*,26:<=CDLMORT[b None!"$*,2:<=CDLMOT[b:A qualified name, i.e. a name with an optional module name Module names$The closed set of proper name types.TProper names, i.e. capitalized names for e.g. module names, type//data constructors.'The closed set of operator alias types.Operator alias names.Names for value identifiersAn alphanumeric identifier"A generated name for an identifierEA sum of the possible name types, useful for error and lint messages.Coerces a ProperName from one ProperNameType to another. This should be used with care, and is primarily used to convert ClassNames into TypeNames after classes have been desugared.7Provide a default module name, if a name is unqualified4Makes a qualified value from a name and module name.,Remove the module name from a qualified nameZRemove the qualification from a value when it is qualified with a particular module name.NChecks whether a qualified value is actually qualified with a module referenceRChecks whether a qualified value is not actually qualified with a module referenceFChecks whether a qualified value is qualified with a particular module>      3577     A      335577'      357None!"$*,2:<=CDLMOT[b:4Convert an Ident into a valid Javascript identifier:,Alphanumeric characters are kept unmodified.2Reserved javascript identifiers are prefixed with $$.Symbols are prefixed with  2 followed by a symbol name or their ordinal value.<;Test if a string is a valid JS identifier without escaping.=kAttempts to find a human-readable name for a symbol, if none has been specified returns the ordinal value.><Checks whether an identifier name is reserved in Javascript.?=Checks whether a name matches a built-in value in Javascript.9:;<=>?@ABCDEF9:;<=>?@ABCDEF9:;<=>?@ABCDEF9:;<=>?@ABCDEFNone!"$*,2:<=CDLMOT[bGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~GHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ЊOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~NMLKJIHGGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None!"$*,2:<=CDLMOT[bData type for bindersWildcard binder&A binder which matches a literal value"A binder which binds an identifier)A binder which matches a data constructor/A binder which binds its input to an identifierNone!"$*,2:<=CDLMOT[b"An alternative in a case statement6A collection of binders with which to match the inputs9The result expression or a collect of guarded expressionsSA guard is just a boolean-valued expression that appears alongside a set of bindersA let or module binding.(Non-recursive binding for a single value3Mutually recursive binding group for several values#Data type for expressions and termsA literal value=A data constructor (type name, constructor name, field names)A record property accessorPartial record updateFunction introductionFunction applicationVariableA case expression A let binding"Extract the annotation from a termModify the annotation on a term None!"$*,2:<=CDLMOT[bNone!"$*,2:<=CDLMOT[bData constructor metadata6The constructor is for a type with a single construcor7The constructor is for a type with multiple construcorsMetadata annotations)The contained value is a data constructor The contained value is a newtype9The contained value is a typeclass dictionary constructor/The contained reference is for a foreign memberNone!"$*,2:<=CDLMOT[bThe data type of kinds!Unification variable of type Kind5Kinds for labelled, unordered rows without duplicatesFunction kinds A named kind                 None!"$*,2:<=CDLMOT[bParse a general proper name.Parse a proper name for a type.Parse a proper name for a kind.+Parse a proper name for a data constructor.Parse a module name0Parse a qualified name, i.e. M.name or just nameParse an identifier.Parse an operator.nRun the first parser, then match the second if possible, applying the specified function on a successful matchnRun the first parser, then match the second zero or more times, applying the specified function for each matchPBuild a parser from a smaller parser and a list of parsers for postfix operators"Mark the current indentation level;Check that the current identation level matches a predicateACheck that the current indentation level is past the current markWCheck that the current indentation level is at the same indentation as the current mark?Read the comments from the the next token, without consuming it Run a parser Convert from Parsec sourcepos    None!"$*,2:<=CDILMOT[b%!A typeclass constraint#constraint class name$type arguments%+additional data relevant to this constraint&2Additional data relevant to type class constraints'Data to accompany a Partial constraint generated by the exhaustivity checker. It contains (rendered) binder information for those binders which were not matched, and a flag indicating whether the list was truncated or not. Note: we use   here because using Binder: would introduce a cyclic dependency in the module graph.(The type of types)#A unification variable of type Type*A named type variable+A type-level string,:A type wildcard, as would appear in a partial type synonym-A type constructor.lA type operator. This will be desugared into a type constructor during the "operators" phase of desugaring./A type application0Forall quantifier1+A type with a set of type class constraints2A skolem constant3 An empty row4A non-empty row5A type with a kind annotation6%A placeholder used in pretty printing7%A placeholder used in pretty printing8%A placeholder used in pretty printing9qBinary operator application. During the rebracketing phase of desugaring, this data constructor will be removed.:jExplicit parentheses. During the rebracketing phase of desugaring, this data constructor will be removed.zNote: although it seems this constructor is not used, it _is_ useful, since it prevents certain traversals from matching.;0An identifier for the scope of a skolem variableR4Convert a row to a list of pairs of labels and typesS+Convert a list of labels and types to a rowT"Check whether a type is a monotypeUUniversally quantify a typeV?Replace a type variable, taking into account variable shadowingW'Replace named type variables with typesX.Collect all type variables appearing in a typeY3Collect all free type variables appearing in a typeZEUniversally quantify over all type variables appearing free in a type[5Move all universal quantifiers to the front of a type\"Check if a type contains wildcards3!"#$%&'()*+,-./0123456789:;<=>?NPRSTUVWXYZ[\]^_`abc0!"#$%&'(2)*+,-./013456789:;<=>?RSTUVWXYZ[\]^_`ab6;<=()*+,-./0123456789:&'!"#$%>?NNPPccRSTUVWXYZ[\]^_`ab!"#$%&'()*+,-./0123456789:;<=>?NPRSTUVWXYZ[\]^_`abcNone!"$*,2:<=CDLMOT[b eData type for bindersfWildcard binderg A binder which matches a literalh"A binder which binds an identifieri)A binder which matches a data constructorjmA operator alias binder. During the rebracketing phase of desugaring, this data constructor will be removed.kqBinary operator application. During the rebracketing phase of desugaring, this data constructor will be removed.ljExplicit parentheses. During the rebracketing phase of desugaring, this data constructor will be removed.zNote: although it seems this constructor is not used, it _is_ useful, since it prevents certain traversals from matching.m/A binder which binds its input to an identifiern)A binder with source position informationoA binder with a type annotationp8Collect all names introduced in binders in an expression efghijklmnop efghimjklnop efghijklmnope fghijklmnopNone!"$*,2:<=CDLMOT[bs Type alias for basic annotationst#Initial annotation with no metadatau&Remove the comments from an annotationstustustustuNone!"$*,2:<=CDLMOT[bw The CoreFn module representation vwxyz{|}~ vwxzy{|}~ wxyz{|}~vvwxyz{|}~None!"$*,234:<=CDLMOT[b;Data representing a type class dictionary which is in scope>The value with which the dictionary can be accessed at runtime8How to obtain this instance via superclass relationshipsDThe name of the type class to which this type class instance applies3The types to which this type class instance appliesLType class dependencies which must be satisfied to construct this dictionary None!"$*,2:<=CDLMOT[b8 The type ('data' or  'newtype') of a data type declarationA standard data constructorA newtype constructorThe kinds of a type Data type Type synonym Foreign dataA local type variableA scoped type variableA flag for whether a name is for an private or public value - only public values will be included in a generated externs file.mA private value introduced as an artifact of code generation (class instances, class member accessors, etc.)@A public value for a module member or foreing import declaration.A name for member introduced by foreign import!The visibility of a name in scopeDThe name is defined in the current binding group, but is not visible_The name is defined in the another binding group, or has been made visible by a function binderlA functional dependency indicates a relationship between two sets of type arguments in a class declaration.@the type arguments which determine the determined type argumentsthe determined type argumentsInformation about a type classVA list of type argument names, and their kinds, where kind annotations were provided.oA list of type class members and their types. Type arguments listed above are considered bound in these types.A list of superclasses of this type class. Type arguments listed above are considered bound in the types appearing in these constraints.GA list of functional dependencies for the type arguments of this class.A set of indexes of type argument that are fully determined by other arguments via functional dependencies. This can be computed from both typeClassArguments and typeClassDependencies.BA sets of arguments that can be used to infer all other arguments.The  Environment; defines all values and types which are currently in scope:Values currently in scopeType names currently in scopeyData constructors currently in scope, along with their associated type constructor name, argument types and return type. Type synonyms currently in scope!Available type class dictionaries Type classesKinds in scopeTThe initial environment with no values and only the default javascript types definedgA constructor for TypeClassData that computes which type class arguments are fully determined and argument covering sets. Fully determined means that this argument cannot be used when selecting a type class instance. A covering set is a minimal collection of arguments that can be used to find an instance and therefore determine all other type arguments.An example of the difference between determined and fully determined would be with the class: ```class C a b c | a -> b, b -> a, b -> c``` In this case, a must differ when bB differs, and vice versa - each is determined by the other. Both a and b: can be used in selecting a type class instance. However, c% cannot - it is fully determined by a and b."Define a graph of type class arguments with edges being fundep determiners to determined. Each argument also has a self looping edge. An argument is fully determined if doesn't appear at the start of a path of strongly connected components. An argument is not fully determined otherwise.1The way we compute this is by saying: an argument X is fully determined if there are arguments that determine X that X does not determine. This is the same thing: everything X determines includes everything in its SCC, and everything determining X is either before it in an SCC path, or in the same SCC.)Construct a ProperName in the Prim module Kinds in prim#Construct a type in the Prim moduleType constructor for functionsType constructor for stringsType constructor for stringsType constructor for numbersType constructor for integersType constructor for booleansType constructor for arraysType constructor for records Check whether a type is a record"Check whether a type is a function$Smart constructor for function typesThe primitive kindsoThe primitive types in the external javascript environment with their associated kinds. There are also pseudo Fail and Partial; types that correspond to the classes with the same names.0The primitive class map. This just contains the Fail and Partial classes. Partial? is used as a kind of magic constraint for partial functions. Fail& is used for user-defined type errors.GFinds information about data constructors from the current environment.3Checks whether a data constructor is for a newtype.<Finds information about values from the current environment.D@F&!None!"$*,2:<=CDLMOT[bZ"A statement in a do-notation block A monadic value without a binderA monadic value with a binder0A let statement, i.e. a pure value with a binder6A do notation element with source position information"An alternative in a case statement6A collection of binders with which to match the inputs9The result expression or a collect of guarded expressions#Data type for expressions and termsA literal valueA prefix -, will be desugaredqBinary operator application. During the rebracketing phase of desugaring, this data constructor will be removed.jExplicit parentheses. During the rebracketing phase of desugaring, this data constructor will be removed.zNote: although it seems this constructor is not used, it _is_ useful, since it prevents certain traversals from matching.-An record property accessor expression (e.g. `obj.x` or `_.x`z). Anonymous arguments will be removed during desugaring and expanded into a lambda that reads a property from a record.Partial record updateFunction introductionFunction applicationVariable`An operator. This will be desugared into a function during the "operators" phase of desugaring.%Conditional (if-then-else expression)A data constructorA case expression. During the case expansion phase of desugaring, top-level binders will get desugared into case expressions, hence the need for guards and multiple binders per branch here.A value with a type annotation A let bindingA do-notation block\An application of a typeclass dictionary constructor. The value should be an ObjectLiteral.A placeholder for a type class dictionary to be inserted later. At the end of type checking, these placeholders will be replaced with actual expressions representing type classes dictionaries which can be evaluated at runtime. The constructor arguments represent (in order): whether or not to look at superclass implementations when searching for a dictionary, the type class name and instance type, and the type class dictionaries in scope.`A typeclass dictionary accessor, the implementation is left unspecified until CoreFn desugaring.eA placeholder for a superclass dictionary to be turned into a TypeClassDictionary during typechecking0A placeholder for an anonymous function argumentEA typed hole that will be turned into a hint/error duing typechecking(A value with source position informationSA guard is just a boolean-valued expression that appears alongside a set of binders0The members of a type class instance declarationThis is a derived instance*This is an instance derived from a newtypenThis is an instance derived from a newtype, desugared to include a dictionary for the type under the newtype.%This is a regular (explicit) instance The data type of declarations MA data type declaration (data or newtype, name, arguments, data constructors) :A minimal mutually recursive set of data type declarations 2A type synonym declaration (name, arguments, type) )A type declaration for a value (name, ty)DA value declaration (name, top-level binders, optional guard, value)6A minimal mutually recursive set of value declarations)A foreign import declaration (name, type)'A data type foreign import (name, kind)A foreign kind import (name)A fixity declaration'A module import (module name, qualified unqualified%hiding, optional "qualified as" name)GA type class declaration (name, argument, implies, member declarations)bA type instance declaration (name, dependencies, class name, instance types, member declarations).A declaration with source position information8The data type which specifies type of import declaration,An import with no explicit list: `import M`.IAn import with an explicit list of references to import: `import M (foo)`DAn import with a list of references to hide: `import M hiding (foo)`0An item in a list of explicit imports or exports)A type constructor with data constructorsA type operatorA value A value-level operator! A type class"]A type class instance, created during typeclass desugaring (name, class name, instance types)#A module, in its entirety$ A named kind%gA value re-exported from another module. These will be inserted during elaboration in name desugaring.&8A declaration reference with source position information'A module declaration, consisting of comments about the module, a module name, a list of declarations, and a list of the declarations that are explicitly exported. If the export list is Nothing, everything is exported.+Categories of hints2GError message hints, providing more detailed information about failure.IA type of error messagesCHolds the data necessary to do type directed search for typed holesEAn Environment captured for later consumption by type directed searchPResults of applying type directed search to the previously captured Environment&A map of locally-bound names in scope.Return a module's name.Return a module's source span.SAdd an import declaration for a module if it does not already explicitly import it. A traversal for TypeInstanceBody,Test if a declaration is a value declaration@Test if a declaration is a data type or type synonym declaration(Test if a declaration is a module import3Test if a declaration is a data type foreign import.Test if a declaration is a foreign kind import-Test if a declaration is a fixity declaration)Test if a declaration is a foreign import:Test if a declaration is a type class instance declaration1Test if a declaration is a type class declarationCRecursively flatten data binding groups in the list of declarations      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0125346789:;<=>?@ABCDEFGHIsJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrtuvwxyz{|}~IJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~23456789:;<=>?@ABCDEFGH+,-./01)*'( !"#$%&     0       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHI_JKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~"None!"$*,2:<=CDLMOT[bReturn a list of all declarations which are exported from a module. This function descends into data declarations to filter out unexported data constructors, and also filters out type instance declarations if they refer to classes or types which are not themselves exported.]Note that this function assumes that the module has already had its imports desugared using E. It will produce incorrect results if this is not the case - for example, type class instances will be incorrectly removed in some cases. Filter out all data constructors from a declaration which are not exported. If the supplied declaration is not a data declaration, this function returns it unchanged. Filter out all the type instances from a list of declarations which reference a type or type class which is both local and not exported.Note that this function assumes that the module has already had its imports desugared using "Language.PureScript.Sugar.Names.desugarImports". It will produce incorrect results if this is not the case - for example, type class instances will be incorrectly removed in some cases. LGet all type and type class names referenced by a type instance declaration.Test if a declaration is exported, given a module's export list. Note that this function does not account for type instance declarations of non-exported types, or non-exported data constructors. Therefore, you should prefer " to this function, where possible. _Test if a data constructor for a given type is exported, given a module's export list. Prefer " to this function, where possible.    #None!"$*,2:<=CDLMOT[b=Map a function over type annotations appearing inside a value    None!"$*,2:<=CDLMOT[b efghimjklnop      !"#$%&'()*+,-./0125346789:;<=>?@ABCDEFGHIsJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrtuvwxyz{|}~$None!"$*,2:<=CDLMOT[b8/Data type for simplified Javascript expressionsA numeric literalA string literalA boolean literalA unary operator applicationA binary operator applicationAn array literalAn array indexer expressionAn object literal&An object property accessor expression8A function introduction (optional name, arguments, body)Function applicationVariableConditional expression A block of expressions in braces3A variable introduction and optional initializationA variable assignment While loopFor loop ForIn loopIf-then-else statementReturn statementThrow statementType-Of operatorInstanceOf testLabelled statement Break statement Continue statement VRaw Javascript (generated when parsing fails for an inline foreign import declaration) Commented Javascript Built-in binary operatorsNumeric additionNumeric subtractionNumeric multiplicationNumeric division RemainderGeneric equality testGeneric inequality testNumeric less-thanNumeric less-than-or-equalNumeric greater-thanNumeric greater-than-or-equal Boolean and Boolean or Bitwise and Bitwise or Bitwise xorBitwise left shiftBitwise right shift "Bitwise right shift with zero-fill!Built-in unary operators"Numeric negation#Boolean negation$Bitwise negation%Numeric unary 'plus'& Constructor>      !"#$%&'()*+,>      !#"$%&'()*+,>!"#$%&      '()*+,       !"#$%&'()*+,%None!"$*,2:<=CDLMOT[b3@Collapse blocks which appear nested directly below another block34343434&None!"$*,2:<=CDLMOT[b 56789:;<=>?@ 56789:;<=>?@ 56789:;<=>?@ 56789:;<=>?@'None!"$*,2:<=CDLMOT[b, ABCDEFG ABCDEFGDEFGABC, ABCDEFG (None!"$*,2:<=CDLMOT[b CInline type class dictionaries for >>= and return for the Eff monadE.g.;Prelude[">>="](dict)(m1)(function(x) { return ...; })becomes-function __do { var x = m1(); ... } !Inline functions in the ST moduleH HHH )None!"$*,2:<=CDLMOT[bIEliminate tail callsI III *None!"$*,2:<=CDLMOT[bJKLJKLJKLJKL+None!"$*,2:<=CDLMOT[bM@Apply a series of optimizer passes to simplified Javascript codeM MMM ,None!"$*,2:<=CDILMOT[b S)String with length and source-map entriesZWrap a string in parentheses]+Generalize intercalate slightly for monoidsc)Number of characters per identation leveld)Pretty print with a new indentation levele!Get the current indentation levelfPrint many linesg.Prints an object key, escaping reserved names.hRPlace a box before another, vertically when the first box takes up multiple lines.j*Place a Box on the bottom right of anothermMake a monoid where append consists of concatenating the string part, adding the lengths appropriately and advancing source mappings on the right hand side to account for the length of the left. NOPQRSTUVWXYZ[\]^_`abcdefghijklmNOPQRSTUVWXYZ[\]^_`abcdefghij Z[\]WXYUVSTmlQR^k_`aNOPbcdefghijNOPQRSTUVWXYZ[\]^_`abcdefghijklm-None!"$*,2:<=CDLMOT[bo4Generate a pretty-printed string representing a Kind ooo o.None!"$*,2:<=CDLMOT[b EGenerate a pretty-printed string representing a Javascript expressionprGenerate a pretty-printed string representing a collection of Javascript expressions at the same indentation level PGenerate an indented, pretty-printed string representing a Javascript expression pq pqqp pq /None!"$*,2:<=CDLMOT[brstuvwxyrstuvwxyrstuvwxyrstuvwxy0None!"$*,2:<=CDLMOT[bzzzz1None!"$*,2:<=CDLMOT[b{{{{2None!"$*,2:<=CDLMOT[b||||3None!"$*,2:<=CDLMOT[b} Parse a kind }}} }4None!"$*,2:<=CDLMOT[b~5Parse a type as it appears in e.g. a data constructorParse a monotypeParse a polytype&Parse an atomic type with no wildcards ~  ~~ ~  5None!"$*,2:<=CDLMOT[b3Generate a pretty-printed string representing a Row\Generate a pretty-printed string representing a Type, as it should appear inside parentheses0Generate a pretty-printed string representing a (:Generate a pretty-printed string representing a suggested (      6None!"$*,2:<=CDLMOT[b 5Render an aligned list of items separated with commasPretty-print an expression CPretty-print an atomic expression, adding parentheses if necessary.6Generate a pretty-printed string representing a Binder          None!"$*,2:<=CDLMOT[bopq7None!"#$*,2:<=CDILMOT[b$ Options$Color code with this color... or not"Should write a full error message?)Should this report an error or a warning?/Should show a link to error message's doc page?How critical the issue isLA map from rigid type variable name/unknown variable pairs to new variables.Ga map from skolems to their new names, including source and naming info3a map from unification variables to their new namesunknowns and skolems share a source of names during renaming, to avoid overlaps in error messages. This is the next label for either case.A stack trace for an error Get the source span for an error Get the module name for an error3Remove the module name and span hints from an error.Get the error code for a particular error type5Check whether a collection of errors is empty or not.6Create an error set from a single simple error message/Create an error set from a single error message?Lift a function on ErrorMessage to a function on MultipleErrorsAdd a hint to an error messageAdd hints to an error message1Extract nested error messages from wrapper errors)Default color intesity and color for codeDefault options for PPEOptions5Pretty print a single error, simplifying if necessaryPretty print multiple errorsPretty print multiple warningsPretty print warnings as a BoxPretty print errors as a Box)Pretty print a Parsec ParseError as a Box(Pretty print ParseError detail messages. Adapted from , see  Hhttps://github.com/aslatter/parsec/blob/v3.1.9/Text/Parsec/Error.hs#L173./Indent to the right, and pad on top and bottom.JRethrow an error with a more detailed error message in the case of failure1Rethrow an error with source position informationuRuns a computation listening for warnings and then escalating any warnings that match the predicate to error status.Collect errors in in parallelGgefghimjklnop      !"#$%&'()*+,-./0125346789:;<=>?@ABCDEFGHIsJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrtuvwxyz{|}~G98None!"$*,2:<=CDLMOT[b 8There are two modes of failure for the redundancy check: WExhaustivity was incomplete due to too many cases, so we couldn't determine redundancy.OWe didn't attempt to determine redundancy for a binder, e.g. an integer binder.+We want to warn the user in the first case. RQualifies a propername from a given qualified propername and a default module name Given an environment and a datatype or newtype name, this function returns the associated data constructors if it is the case of a datatype where: - ProperName is the name of the constructor (for example, NothingN in Maybe) - [Type] is the list of arguments, if it has (for example, Just has [TypeVar "a"]) Replicates a wildcard binder BApplies a function over two lists of tuples that may lack elements Find the uncovered set between two binders: the first binder is the case we are trying to cover, the second one is the matching binder Returns the uncovered set of binders the first argument is the list of uncovered binders at step i the second argument is the (i+1)th clause of a pattern matching definitionZThe idea of the algorithm is as follows: it processes each binder of the two lists (say, x and yU) one by one at each step two cases arises: - there are no missing cases between x and y: this is very straightforward, it continues with the remaining cases but keeps the uncovered binder in its position. - there are missing cases, let us call it the set U5: on the one hand, we mix each new uncovered case in U with the current tail of uncovered set. On the other hand, it continues with the remaining cases: here we can use x. (but it will generate overlapping cases), or y,, which will generate non-overlapping cases.As an example, consider:wdata N = Z | S N f Z Z = Z --> {[S _, _], [Z, S _]} which are the right non-overlapping cases (GHC uses this). if we use x instead of y (in this case, y stands for Z and x for `_`i) we obtain: f Z Z = Z --> {[S _, _], [_, S _]} you can see that both cases overlaps each other. Up to now, we've decided to use x~ just because we expect to generate uncovered cases which might be redundant or not, but uncovered at least. If we use y instead, we'll need to have a redundancy checker (which ought to be available soon), or increase the complexity of the algorithm. Guard handling+We say a guard is exhaustive iff it has an   (or truep) expression. Example: f x | x < 0 = 0 | otherwise = 1 is exhaustive, whereas `f x | x < 0` is not5The function below say whether or not a guard has an  # expression It is considered that   is defined in Prelude .Returns the uncovered set of case alternatives eMain exhaustivity checking function Starting with the set `uncovered = { _ }` (nothing covered, one `_` for each function argument), it partitions that set with the new uncovered cases, until it consumes the whole set of clauses. Then, returns the uncovered set of case alternatives.Exhaustivity checking                  9None!"$*,2:<=CDLMOT[b4A list of modules with their transitive dependencies:Sort a collection of modules based on module dependencies.6Reports an error if the module graph contains a cycle. QCalculate a list of used modules based on explicit imports and qualified names. ams is a list of  ModuleNames; that refer to names brought into scope by importing with as - this ensures that when building the list we don't inadvertantly assume a dependency on an actual module, if there is a module that has the same name as the qualified import. FConvert a strongly connected component of the module graph to a module    :None!"$*,2:<=CDLMOT[b  Read source position informationParse a single declaration6Parse a module header and a collection of declarations)Parse a collection of modules in parallel@Parses a single module with FilePath for eventual parsing errors Converts a  ParseError into a PositionedError /Parse an expression in backticks or an operator 1Expressions including indexers and record updates Parse a valueParse a binder<Parse a binder as it would appear in a top level declaration Parse a guardA          ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8  9 : ; < = > ?  @ A B C D E F G H I J  A          ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8  9 : ; < = > ?  @ A B C D E F G H I JNone!"$*,2:<=CDLMOT[be6789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstu }~;None!"$*,2:<=CDLMOT[b;Warns about duplicate values in a list of declaration refs.<None!"$*,2:<=CDLMOT[b+Ensure rows do not contain duplicate labels=None!"$*,2:<=CDLMOT[bSReplace all sets of mutually-recursive declarations in a module with binding groupsBCollapse all binding groups in a module to individual declarations6Collapse all binding groups to individual declarations KoConvert a group of mutually-recursive dependencies into a BindingGroupDeclaration (or simple ValueDeclaration). L M N O P Q K R S T L M N O P Q K R S T>None!"$*,2:<=CDLMOT[b'When updating the  the behaviour is slightly different depending on whether we are exporting values defined within the module or elaborating re-exported values. This type is used to indicate which behaviour should be used.9The imports and exports for a collection of modules. The  is used to store the source location of the module with a given name, used to provide useful information when there is a duplicate module definition.(The exported declarations from a module.CThe exported types along with the module they originally came from.MThe exported type operators along with the module they originally came from.EThe exported classes along with the module they originally came from.DThe exported values along with the module they originally came from.NThe exported value operators along with the module they originally came from.CThe exported kinds along with the module they originally came from.KThe imported declarations for a module, including the module's own members.ELocal names for types within a module mapped to their qualified namesNLocal names for type operators within a module mapped to their qualified namesQLocal names for data constructors within a module mapped to their qualified namesGLocal names for classes within a module mapped to their qualified namesFLocal names for values within a module mapped to their qualified namesOLocal names for value operators within a module mapped to their qualified nameszThe name of modules that have been imported into the current scope that can be re-exported. If a module is imported with as qualification, the as0 name appears here, otherwise the original name.<The "as" names of modules that have been imported qualified.ELocal names for kinds within a module mapped to their qualified namesUsed to track how an import was introduced into scope. This allows us to handle the one-open-import special case that allows a name conflict to become a warning rather than being an unresolvable situation.JThe details for an import: the name of the thing that is being imported ( if importing from Az), the module that the thing was originally defined in (for re-export resolution), and the import provenance (see below). An  value with imports for the  module. An empty  value. Extracts the  from an  value. Extracts the  from an  value. Extracts the  from an  value. UThe exported types from the Prim module0Environment which only contains the Prim module.gSafely adds a type and its data constructors to some exports, returning an error if a conflict occurs.VSafely adds a type operator to some exports, returning an error if a conflict occurs.MSafely adds a class to some exports, returning an error if a conflict occurs.MSafely adds a value to some exports, returning an error if a conflict occurs.WSafely adds a value operator to some exports, returning an error if a conflict occurs.LSafely adds a kind to some exports, returning an error if a conflict occurs. VeAdds an entry to a list of exports unless it is already present, in which case an error is returned. WIRaises an error for when there is more than one definition for something. XDRaises an error for when there are conflicting names in the exports.MGets the exports for a module, or raise an error if the module doesn't exist.SWhen reading a value from the imports, check that there are no conflicts in scope.6 Y    Z [ U V W X/     /       Y    Z [ U V W X?None!"$*,2:<=CDLMOT[b%LFinds all exportable members of a module, disregarding any explicit exports.&Resolves the exports for a module, filtering out members that have not been exported and elaborating re-exports of other modules. \~Filters the full list of exportable values, types, and classes for a module based on a list of export declaration references.%& \%&%&%& \@None!"$*,2:<=CDLMOT[b(|Finds the imports within a module, mapping the imported module name to an optional set of explicitly imported declarations.))Constructs a set of imports for a module.*7Constructs a set of imports for a single module import. ]TExtends the local environment for a module by resolving an import of another module.'()* ]'()*')*('()* ]ANone!"$*,2:<=CDLMOT[b+TMap of module name to list of imported names from that module which have been used.,Find and warn on:3Unused import statements (qualified or unqualified),Unused references in an explicit import listImplicit imports of modulesoImplicit imports into a virtual module (unless the virtual module only has members from one module imported)Imports using hiding- (this is another form of implicit importing)+, ^ _ ` a b +, ,++, ^ _ ` a bBNone!"$*,2:<=CDLMOT[b-TLint the PureScript AST. | | Right now, this pass only performs a shadowing check.- +,---CNone!"$*,2:<=CDLMOT[b.IReplace all top level type declarations in a module with type annotations....DNone!"$*,2:<=CDLMOT[b /8A type or value declaration appearing in an externs file0A type declaration1A type synonym2A data construtor3A value declaration4A type class declaration5An instance declaration6A kind declarationN,A type fixity declaration in an externs fileP!The associativity of the operatorQ$The precedence level of the operatorRThe operator symbolS&The value the operator is an alias forT'A fixity declaration in an externs fileV!The associativity of the operatorW$The precedence level of the operatorXThe operator symbolY&The value the operator is an alias forZ"A module import in an externs file\The imported module]-The import type: regular, qualified or hiding^+The imported-as name, for qualified imports_4The data which will be serialized to an externs fileaThe externs versionb Module namecList of module exportsdList of module importse$List of operators and their fixitiesf)List of type operators and their fixitiesg"List of type and value declarationh*Convert an externs file back into a modulei9Generate an externs file for all declarations in a module@/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghioqsuw;/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi;_`abcdefgZ[\]^TUVWXYNOPQRS/0123456789:;<=>?@ABCDEFGHIJKLMih /0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghioqsuwENone!"$*,2:<=CDLMOT[byReplaces all local names with qualified names within a list of modules. The modules should be topologically sorted beforehand. cMake all exports for a module explicit. This may still effect modules that have an exports list, as it will also make all data constructor exports explicit. dvReplaces all local names with qualified names within a module and checks that all existing qualified names are valid.yz c d     yz yz    yz c dFNone!"$*,2:<=CDLMOT[b eAn operator associated with its declaration position, fixity, and the name of the function or data constructor it is an alias for.{ARemoves unary negation operators and replaces them with calls to  f.|ERemove explicit parentheses and reorder binary operator applications.LThis pass requires name desugaring and export elaboration to have run first.}Checks all the fixity exports within a module to ensure that members aliased by the operators are also exported from the module.LThis pass requires name desugaring and export elaboration to have run first. g h e{| i j k l m n o}{|}{|} g h e{| i j k l m n o}GNone!"$%&*,29:;<=CDLMOT[b&~Unification variables State required for type checking The current  Environment"The next type unification variable"The next kind unification variableThe next skolem variableThe next skolem scope constantThe current moduleThe current substitutionOThe current error message hint stack. This goes into state, rather than using R, since this way, we can provide good error messages during instance resolution.:A substitution of unification variables for types or kindsType substitutionKind substitutionAn empty substitutionCreate an empty  CheckState0Temporarily bind a collection of names to values/Temporarily bind a collection of names to types/Temporarily bind a collection of names to typesBTemporarily make a collection of type class dictionaries available:Get the currently available map of type class dictionaries+Lookup type class dictionaries in a module.9Temporarily bind a collection of names to local variables>Temporarily bind a collection of names to local type variables-Update the visibility of all names to DefinedQUpdate the visibility of all names to Defined in the scope of the provided action6Perform an action while preserving the names from the  Environment.*Lookup the type of a value by name in the  Environment0Lookup the visibility of a value by name in the  EnvironmentAssert that a name is visible)Lookup the kind of a type by name in the  EnvironmentGet the current  Environment?Get locally-bound names in context, to create an error message. Update the  Environment Modify the  EnvironmentDRun a computation in the typechecking monad, starting with an empty  EnvironmenttRun a computation in the typechecking monad, failing with an error, or succeeding with a return value and the final  Environment.0Make an assertion, failing with an error messagebRun a computation in the substitution monad, generating a return value and the final substitution..~.~.~"~ HNone!"$*,29:;<=CDLMOT[b pGenerate a fresh kind variable q2Update the substitution to solve a kind constraint rApply a substitution to a kind s2Make sure that an unknown does not occur in a kind tUnify two kindsInfer the kind of a single typeQInfer the kind of a single type, returning the kinds of any scoped type variablestInfer the kind of a type constructor with a collection of arguments and a collection of associated data constructorsNSimultaneously infer the kinds of several mutually recursive type constructors u^Solve the set of kind constraints associated with the data constructors for a type constructor v7Default all unknown kinds to the kindType kind of types wInfer a kind for a type p q r s t x u v w y p q r s t x u v w yINone!"$*,2:<=CDLMOT[bGenerate a new skolem constant5Introduce skolem scope at every occurence of a ForAllGenerate a new skolem scopePSkolemize a type variable by replacing its instances with fresh skolem constantsThis function has one purpose - to skolemize type variables appearing in a DeferredDictionary placeholder. These type variables are somewhat unique since they are the only example of scoped type variables.1Ensure skolem variables do not escape their scopeJNone!"$%&*,2:<=CDLMOT[bNType synonym information (arguments with kinds, aliased type), indexed by name#Replace fully applied type synonyms>Replace fully applied type synonyms by explicitly providing a . z zKNone!"$*,29:;<=CDLMOT[b Generate a fresh type variable2Update the substitution to solve a type constraintApply a substitution to a type {2Make sure that an unknown does not occur in a type2Compute a list of all unknowns appearing in a type2Unify two types, updating the current substitution1Unify two rows, updating the current substitutionCommon labels are first identified, and unified. Remaining labels and types are unified with a trailing row unification variable, if appropriate, otherwise leftover labels result in a unification error.>Replace a single type variable with a new unification variable$Replace type wildcards with unknownsJReplace outermost unsolved unification variables with named type variables  {    {LNone!"$%&*,2:<=CDLMORT[b |5This type family tracks what evidence we return from  for each mode. }%Value-level proxies for the two modes ~%Subsumption can operate in two modes:CElaboration mode, in which we try to insert type class dictionaries;No-elaboration mode, in which we do not insert dictionariesVSome subsumption rules apply in both modes, and others are specific to certain modes.The subsumption algorithm follows the structure of the types in question, and we can switch into no-elaboration mode when we move under a type constructor where we can no longer insert dictionaries, e.g. into the fields of a record. #The default coercion for each mode.YCheck that one type subsumes another, rethrowing errors to provide a better error message $Check that one type subsumes another | } ~   | } ~  MNone!"$*,2:<=CDLMOT[b@Replace all top-level binders in a module with case expressions. 2Validates that case head and binder lengths match.4Replace all top-level binders with case expressions.    NNone!"$*,2:<=CDLMOT[b Replace all DoNotationBind and DoNotationValueH constructors with applications of the bind function in scope, and all  DoNotationLet$ constructors with let expressions. Desugar a single do statement  ONone!"$*,2:<=CDLMOT[bPNone!"$*,2:<=CDLMOT[bAdd type synonym declarations for type class dictionary types, and value declarations for type class instance dictionary expressions.    QNone!"$*,2:<=CDLMOT[b4Desugars a module from AST to CoreFn representation. Find module names from qualified references to values. This is used to ensure instances are imported from any module that is referenced by the current module, not just from those that are imported explicitly (#667). ?Desugars import declarations from AST to CoreFn representation. @Desugars foreign declarations from AST to CoreFn representation. Desugars export declarations references from AST to CoreFn representation. CoreFn modules only export values, so all data constructors, class constructor, instances and values are flattened into one list. Makes a typeclass dictionary constructor function. The returned expression is a function that accepts the superclass instances and member implementations and returns a record for the instance dictionary. "Converts a ProperName to an Ident.  None!"$*,2:<=CDLMOT[b9stuvwxzy{|}~RNone!"$*,2:<=CDLMOT[biGenerate code in the simplified Javascript intermediate representation for all declarations in a module.M9:;<=>?@ABCDEF      !#"$%&'()*+,None!"$*,2:<=CDLMOT[bM9:;<=>?@ABCDEF      !#"$%&'()*+,SNone!"$*,2:<=CDLMOT[b    TNone!"$*,2:<=CDLMOT[b $The state object used in this module DA map from names bound (in the input) to their names (in the output) DThe set of names which have been used and are in scope in the output CRuns renaming starting with a list of idents for the initial scope. bCreates a new renaming scope using the current as a basis. Used to backtrack when leaving an Abs. qAdds a new scope entry for an ident. If the ident is already present, a new unique name is generated and stored. 'Finds the new name to use for an ident. (Finds idents introduced by declarations.,Renames within each declaration in a module. PRenames within a declaration. isTopLevel is used to determine whether the declaration is a module member or appearing within a Let. At the top level declarations are not renamed or added to the scope (they should already have been added), whereas in a Let declarations are renamed if their name shadows another in the current scope. Renames within a value. Renames within literals. !Renames within case alternatives. Renames within binders.     UNone!"#$*,2:<=CDLMOT[b!Options for the constraint solverEShould the solver be allowed to generalize over unsolved constraints?EShould the solver be allowed to defer errors by skipping constraints? QThree options for how we can handle a constraint, depending on the mode we're in. We solved this constraint CWe couldn't solve this constraint right now, it will be generalized DWe couldn't solve this constraint right now, so it has been deferred GA type substitution which makes an instance head match a list of types.Note: we store many types per type variable name. For any name, all types should unify if we are going to commit to an instance.The 1 tracks those constraints which can be satisfied. =Description of a type class dictionary with instance evidence FDescribes what sort of dictionary to generate for type class instances An existing named instance GComputed instance of the IsSymbol type class for a given Symbol literal "Computed instance of CompareSymbol !Computed instance of AppendSymbol *Extract the identifier of a named instancePReplace type class dictionary placeholders with inferred type class dictionariesCheck that the current set of type class dictionaries entail the specified type class goal, and, if so, return a type class dictionary reference.iAdd a dictionary for the constraint to the scope, and dictionaries for all implied superclass instances. 5Check all pairs of values in a list match a predicate 4Check any pair of values in a list match a predicate  Solver optionsThe constraint to solve-The contexts in which to solve the constraint3Error message hints to apply to any instance errors        VNone!"$*,2:<=CDLMOT[b )Additional constraints we need to satisfyGThe Environment which contains the relevant definitions and typeclassesThe typechecker stateThe user supplied type$The type supplied by the environment)Additional constraints we need to satisfyGThe Environment which contains the relevant definitions and typeclassesThe typechecker stateThe type we are looking for WNone!"#$*,2:<=CDLMOT[bInfer the types of multiple mutually-recursive values, and return elaborated values including type class dictionaries and type annotations. +Check if a value contains a type annotation 9Check the kind of a type, failing if it is not of kind *. yRemove any ForAlls and ConstrainedType constructors in a type by introducing new unknowns or TypeClassDictionary values.iThis is necessary during type checking to avoid unifying a polymorphic type with a unification variable. UInfer a type for a value, rethrowing any error to provide a more useful error message Infer a type for a value ;Infer the types of variables brought into scope by a binder Returns true if a binder requires its argument type to be a monotype. | If this is the case, we need to instantiate any polymorphic types before checking binders. 9Instantiate polytypes only when necessitated by a binder. LCheck the types of the return values in a set of binders in a case statement NCheck the type of a value, rethrowing errors to provide a better error message Check the type of a value 5Check the type of a collection of named record fieldsThe laxt parameter controls whether or not every record member has to be provided. For object updates, this is not the case. ^Check the type of a function application, rethrowing errors to provide a better error message.!This judgment takes three inputs:.The expression of the function we are applyingThe type of that function$The expression we are applying it toand synthesizes two outputs:The return typewThe elaborated expression for the function application (since we might need to insert type class dictionaries, etc.) (Check the type of a function application JEnsure a set of property names and value does not contain duplicate labels  The function expressionThe type of the functionThe argument expression(The result type, and the elaborated term   XNone!"$*,29:;<=CDLMOT[b 4Check that type synonyms are fully-applied in a type 'Type check all declarations in a moduleWAt this point, many declarations will have been desugared, but it is still necessary to)Kind-check all types and add them to the  Environment*Type-check all values and add them to the  Environment%Bring type class instances into scopeProcess module importsType check an entire module and ensure all types and classes defined within the module that are required by exported members are also exported. index of type class argument < ~ YNone!"$*,2:<=CDLMOT[b=Elaborates deriving instance declarations by code generation. Takes a declaration, and if the declaration is a deriving TypeInstanceDeclaration, elaborates that into an instance declaration via code generation.          ZNone!"$*,2:<=CDLMOT[b,The desugaring pipeline proceeds as follows: $Remove signed literals in favour of negate applications3Desugar object literals with wildcards into lambdasDesugar operator sectionsDesugar do-notationBDesugar top-level case declarations into explicit case expressionsPDesugar type declarations into value declarations with explicit type annotations'Qualify any unqualified names and types'Rebracket user-defined binary operators3Introduce type synonyms for type class dictionariesIGroup mutually recursive value and data declarations into binding groups.2    .yz{|}[Safe!"$*,29:;<=CDLMORT[b;A replacement for WriterT IO which uses mutable references.5Run a Logger computation, starting with an empty log.   \None!"$*,2:<=CDILMORT[b A monad for running make actions#Determines when to rebuild a moduleNever rebuild this moduleAlways rebuild this module#Generated code for an externs file.AActions that require implementations when running in "make" mode.-This type exists to make two things abstract:;The particular backend being used (Javascript, C++11, etc.).The details of how files are read/written etc.TGet the timestamp for the input file(s) for a module. If there are multiple files (.purs^ and foreign files, for example) the timestamp should be for the most recently modified file.tGet the timestamp for the output files for a module. This should be the timestamp for the oldest modified file, or  2 if any of the required output files are missing.]Read the externs file for a module as a string and also return the actual path for the file.JRun the code generator for the module and write any required output files.Respond to a progress update.'Progress messages from the make processRender a progress messageRebuild a single module[Compiles in "make" mode, compiling each module separately to a js files and an externs fileIf timestamps have not changed, the externs file can be used to provide the module's types without having to typecheck the module again. Execute a P monad, returning either errors, or the result of the compile plus any warnings.Read a text file in the ( monad, capturing any errors using the   instance.ZInfer the module name for a module by looking for the same filename with a .js extension.KA set of make actions that read and write modules from the given directory. oCheck that the declarations in a given PureScript module match with those in its corresponding foreign module. the output directoryQa map between module names and paths to the file containing the PureScript moduleWa map between module name and the file containing the foreign javascript for the moduleGenerate a prefix comment?   ]None!"$*,2:<=CDLMOT[bh  !"#$%&'(-./06789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstu         !"#$%&'(2)*+,-./013456789:;<=>?RSTUVWXYZ[\]^_`abefghimjklnop      !"#$%&'()*+,-./0125346789:;<=>?@ABCDEFGHIsJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrtuvwxyz{|}~opq}~    +,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghiyz{|}~^None!"$*,2:<=CDILMOT[bA type representing a highly simplified version of PureScript code, intended for use in output formats like plain text or HTML.This type is isomorphic to   G. It makes code a bit easier to read, as the meaning is more explicit.A single element in a rendered code fragment. The intention is to support multiple output formats. For example, plain text, or highlighted HTML.$ Convert a    to a !, using the obvious isomorphism.% Convert a  to a   !, using the obvious isomorphism.& A version of  fromMaybe for  values.(%This function allows conversion of a  value into a value of some other type (for example, plain text, or HTML). The first argument is a function specifying how each individual  should be rendered.)A  fragment representing a space.'  !"#$%&'()*+,-./0123456789:;"! "#$%&'()*+,-./012345678" !"#%$&'()*+,-./012345678  !"#$%&'()*+,-./0123456789:;_None!"$*,2:<=CDLMOT[bJRender code representing a RowKRender code representing a KindLGRender code representing a Type, as it should appear inside parenthesesMRender code representing a TypeFGHI  J                KLMNO FGIHJKLMNO MLJKFGHINOFGHI  J                KLMNONone!"$*,2:<=CDLMOT[b,! "#$%&'()*+,-./012345678FGIHJKLMNO`None!"$*,2:<=CDLMOT[bU`Minimum allowable version for generating data with the current parser, and actual version used.d@A type instance declaration, with its dependencies and its type.e,A data constructor, with its type arguments.fA type class member, with its type. Note that the type does not include the type class constraint; this may be added manually if desired. For example,   from  ! would be `forall a. a -> f a`.nA value of this type contains information that is specific to a particular kind of declaration (as opposed to information which exists in all kinds of declarations, which goes into the v type directly).Many of the constructors are very similar to their equivalents in the real PureScript AST, except that they have their name elided, since this is already available via the rdTitle field of v.o#A value declaration, with its type.pA data/newtype declaration, with the kind of declaration (data or newtype) and its type arguments. Constructors are represented as child declarations.q*A data type foreign import, with its kind.r5A type synonym, with its type arguments and its type.sA type class, with its type arguments, its superclasses and functional dependencies. Instances and members are represented as child declarations.t[An operator alias declaration, with the member the alias is for and the operator's fixity.uA kind declarationThe version of the PureScript compiler which was used to generate this data. We store this in order to reject packages which are too old.>Discard any children which do not satisfy the given predicate.Given a function for turning association list keys into JSON object keys, and a function for turning association list values to JSON string values, turns an association list into a JSON object.For example: *assocListToJSON T.pack T.pack [("a", "b")] will give  {"a": "b"}.PQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~! "#'PQRSTUVWXYZ[\]^_`abcdefghijklmnproqustvwxyz{|}~ƅ}~vwxyz{|nopqrstumghijklcdef`ab]^_TUVWXYZ[\SPQRRPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ aNone!"$*,2:<=CDLMOT[b "An intermediate data type, used for either moving type class members under their parent type classes, or promoting them to normal Declaration values if their parent type class has not been re-exported. #Type class members which have not yet been dealt with. The Text is the name of the type class they belong to, and the constraint is used to make sure that they have the correct type if they get promoted. $A list of normal value declarations. Type class members will be added to this list if their parent type class is not available. %rA list of type class declarations. Type class members will be added to their parents in this list, if they exist.Given:The Imports/Exports Env<An order to traverse the modules (which must be topological)iA map of modules, indexed by their names, which are assumed to not have their re-exports listed yet.This function adds all the missing re-exports. &@Collect all of the re-exported declarations for a single module.We require that modules have already been sorted (P.sortModules) in order to ensure that by the time we convert a particular module, all its dependencies have already been converted. 'Assemble a list of declarations re-exported from a particular module, based on the Imports and Exports value for that module, and by extracting the declarations from the current state.This function works by searching through the lists of exported declarations in the Exports, and looking them up in the associated Imports value to find the module they were imported from. Additionally:Attempts to move re-exported type class members under their parent type classes, if possible, or otherwise, "promote" them from ChildDeclarations to proper Declarations.]Filters data declarations to ensure that only re-exported data constructors are listed.dFilters type class declarations to ensure that only re-exported type class members are listed. (Given a list of imported declarations (of a particular kind, ie. type, data, class, value, etc), and the name of an exported declaration of the same kind, together with the module it was originally defined in, return a tuple of:the module that exported declaration was imported from (note that this can be different from the module it was originally defined in, if it is a re-export),that same declaration's name.XThis function uses a type variable for names because we want to be able to instantiate name as both  and . )Extract a particular type declaration. For data declarations, constructors are only included in the output if they are listed in the arguments. *{Get the full list of declarations for a particular module out of the state, or raise an internal error if it is not there. +Take a TypeClassEnv and handle all of the type class members in it, either adding them to their parent classes, or promoting them to normal Declaration values.*Returns a tuple of (values, type classes). ,Given a list of exported constructor names, remove any data constructor names in the provided Map of declarations which are not in the list. -Given a list of exported type class member names, remove any data type class member names in the provided Map of declarations which are not in the list. .If the provided Declaration is a TypeClassDeclaration, construct an appropriate Constraint for use with the types of its members. " / # $ % & ' ( 0 1 ) 2 3 4 * 5 6 7 + 8 , - 9 : ; < = . " / # $ % & ' ( 0 1 ) 2 3 4 * 5 6 7 + 8 , - 9 : ; < = .bNone!"$*,2:<=CDLMOT[b >ESome data which will be used to augment a Declaration in the output.oThe AugmentChild constructor allows us to move all children under their respective parents. It is only necessary for type instance declarations, since they appear at the top level in the AST, and since they might need to appear as children in two places (for example, if a data type defined in a module is an instance of a type class also defined in that module). ?OThe data type for an intermediate stage which we go through during converting.In the first pass, we take all top level declarations in the module, and collect other information which will later be used to augment the top level declarations. These two situation correspond to the Right and Left constructors, respectively.In the second pass, we go over all of the Left values and augment the relevant declarations, leaving only the augmented Right values.qNote that in the Left case, we provide a [Text] as well as augment information. The [Text] value should be a list of titles of declarations that the augmentation should apply to. For example, for a type instance declaration, that would be any types or type classes mentioned in the instance. For a fixity declaration, it would be just the relevant operator's name.oConvert a single Module, but ignore re-exports; any re-exported types or values will not appear in the result. @Augment top-level declarations; the second pass. See the comments under the type synonym IntermediateDeclaration for more information. A!Create a basic Declaration value.Go through a PureScript module and extract a list of Bookmarks; references to data types or values, to be used as a kind of index. These are used for generating links in the HTML documentation, for example. > B ? @ C A D E F G > B ? @ C A D E F GcNone!"$*,2:<=CDLMOT[bLike convertModules, except that it takes a list of modules, together with their dependency status, and discards dependency modules in the resulting documentation.Convert a group of modules to the intermediate format, designed for producing documentation from. It is also necessary to pass an Env containing imports/exports information about the list of modules, which is needed for documenting re-exports.Note that the whole module dependency graph must be included in the list; if some modules import things from other modules, then those modules must also be included.For value declarations, if explicit type signatures are omitted, or a wildcard type is used, then we typecheck the modules and use the inferred types. H!Convert a sorted list of modules. IIf any exported value declarations have either wildcard type signatures, or none at all, then typecheck in order to fill them in with the inferred types. J<Typechecks all the modules together. Also returns the final _, which is useful for adding in inferred types where explicit declarations were not provided. KtUpdates all the types of the ValueDeclarations inside the module based on their types inside the given Environment. LcPartially desugar modules so that they are suitable for extracting documentation information from.  M H I J K N L  M H I J K N LdNone!"$*,2:<=CDLMOT[b O<Specifies whether a PureScript source file is considered as: 1) with the Qd constructor, a target source file, i.e., we want to see its modules in the output 2) with the R constructor, a dependencies source file, i.e. we do not want its modules in the output; it is there to enable desugaring, and to ensure that links between modules are constructed correctly.Given:A list of local source filesZA list of source files from external dependencies, together with their package names!This function does the following:2Parse all of the input and dependency source filesmAssociate each dependency module with its package name, thereby distinguishing these from local modules>Collect a list of bookmarks from the whole set of source files+Return the parsed modules and the bookmarks O P Q R S T U V W O P Q R S T U V WeNone!"$*,2:<=CDLMOT[b XlLookup the TypeClassData of a Prim class. This function is specifically not exported because it is partial. Y Z [ \ X ] ^ _ ` a b c d e f g h i j k l Y Z [ \ X ] ^ _ ` a b c d e f g h i j k lfNone!"$*,2:<=CDLMOT[b     None!"$*,2:<=CDLMOT[b! "#$%&'()*+,-./012345678FGIHJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnproqustvwxyz{|}~ gNone!"$*,2:<=CDLMOT[b aTake a list of modules and render them all in order, returning a single Markdown-formatted Text. m n o  p q r s t u v w         m n o  p q r s t u v whNone!"$*,2:<=CDLMOT[b !"#$%&'(24689: !"#$%&'(89!#$%&'( !"224466::89  !"#$%&'(24689:iNone!"$*,2:<=CDLMOT[b<=><=><=><=>jNone!"$*,24:<=CDLMOT[b$An identifier in the value namespace#An identifier in the type namespace#An identifier in the kind namespace\A Pursuit Response for a module. Consists of the modules name and the package it belongs tolA Pursuit Response for a declaration. Consist of the declaration's module, name, package, type summary text+A completion as it gets sent to the editorsfSourceSpans for the definition sites of Values and Types aswell as type annotations found in a module?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg}~?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg}~g^_`abcdefZ[\]VWXYRSTUMNOPQFGHIJKL?@ABCDE~}J?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg}~kNone!"$*,2:<=CDLMOT[b  x xlNone!"$*,2:<=CDLMOST[b !" !" !" !"mNone!"$*,2:<=CDLMOT[b y z#$#$#$ y z#$nNone!"$*,2:<=CDLMOT[b %&'()*+,-./<=> !"%&'()*+,-./ %(./),-&'*+ %&'()*+,-./oNone!"$*,2:<=CDLMOST[b 01 { | } ~  2012012 01 { | } ~  2pNone!"$*,2:<=CDILMOT[b4Only keeps the given Modules57Only keeps Identifiers that start with the given prefix6:Only keeps Identifiers that are equal to the search string 3 4 56 783456734567 3 4 56 78qNone!"$*,29:;<=CDILMOT[b;=Matches any occurence of the search string with intersectionsThe scoring measures how far the matches span the string where closer is better. Examples: flMa matches flexMatcher. Score: 14.28 sons matches sortCompletions. Score: 6.25 : ; < =:;<:<; : ; < =rNone!"$*,2:<=CDLMOT[b?Applies the CompletionFilters and the Matcher to the given Modules and sorts the found Completions according to the Matching Score?@ ?@?@?@ sNone!"$*,2:<=CDLMOT[bABContains the module with resolved reexports, and eventual failuresETUses the passed formatter to format the resolved module, and adds eventual failuresF%Whether any Refs couldn't be resolvedGbResolves Reexports for a given Module, by looking up the reexported values from the passed in MapABCDE!Formatter for the resolved resultThe Result to be pretty printedFG1Modules to search for the reexported declarationsHThe module to resolve reexports for, aswell as the references to resolve ABCDEFGGEFABCDABCDEFG tNone!"$*,2:<=CDLMOT[bM-Extracts AST information from a parsed moduleN;Extracts type annotations for functions from a given ModuleOuGiven a surrounding Sourcespan and a Declaration from the PS AST, extracts definition sites inside that Declaration.K LMNOThe surrounding span%The declaration to extract spans from'Declarations and their source locationsKLMNOKLMONK LMNOuNone!"$*,2:<=CDLMOST[bPResets all State inside psc-ideQGets the loaded ModulenamesRGets all loaded ExternFilesS(Insert a Module into Stage1 of the State STM version of insertModule CRetrieves Stage1 from the State. This includes loaded Externfiles STM version of getStage1  Retrieves Stage2 from the State. STM version of setStage2 aRetrieves Stage3 from the State. This includes the denormalized Declarations and cached rebuilds Sets Stage3 inside the compilerTChecks if the given ModuleName matches the last rebuild cache and if it does returns all loaded definitions + the definitions inside the rebuild cacheUAdds an ExternsFile into psc-ide's State Stage1. This does not populate the following Stages, which needs to be done after all the necessary Exterms have been loaded.VSTM version of insertExternsW+Sets rebuild cache to the given ExternsFile Retrieves the rebuild cacheX*Extracts source spans from the parsed ASTs STM version of populateStage2YHResolves reexports and populates Stage3 with data to be used in queries.ZSTM version of populateStage3[RLooks up the types and kinds for operators and assigns them to their declarationsPQRS TUVW X YZ [ PQRSTUVWXYZ[ QRPWUSVTXYZ[PQRS TUVW X YZ [vNone!"$*,2:<=CDLMOT[b`/Constructs Patterns to insert into a sourcefile\ ]^_ ` Current lineBegin of the splitEnd of the split%Whether to explicitly type the splitsConstructors to splita \]^_`a\]^`a_\ ]^_ `a wNone!"$*,2:<=CDLMOT[br3Rebuild the specified file using the loaded externs(bcdefghijklmnopqrstuvwxyz{|}~%bdcefghikqtlunpmrjosvwxyz{|}~(ijklmnopqrstuvwxyz{|}~fghbcdebcdefghijklmnopqrstuvwxyz{|}~xNone!"$*,2:<=CDLMOT[b bReads a file and returns the (lines before the imports, the imports, the lines after the imports) We start in theModuleHeader state.We skip every line we encounter, that doesn't start with "import". If we find a line that starts with module we store that linenumber. Once we find a line with "import" we store its linenumber as the start of the import section and change into theImportSection stateFor any line that starts with import or whitespace(is thus indented) we expand the end of the import section to that line and continue. If we encounter a commented or empty line, we continue moving forward in the ImportSection state but don't expand the import section end yet. This allows us to exclude newlines or comments that directly follow the import section. Once we encounter a line that is not a comment, newline, indentation or import we switch into the Res statea, which just shortcuts to the end of the file and carries the detected import section boundariesAdds an implicit import like import Prelude to a Sourcefile. Adds an explicit import like import Prelude (unit){ to a Sourcefile. If an explicit import already exists for the given module, it adds the identifier to that imports list.So &addExplicitImport "/File.purs" "bind" Prelude with an already existing import Prelude (bind) in the file File.purs returns  ["import Prelude (bind, unit)"]>Looks up the given identifier in the currently loaded modules.2Throws an error if the identifier cannot be found.KIf exactly one match is found, adds an explicit import to the importsectionaIf more than one possible imports are found, reports the possibilities as a list of completions.Writes a list of lines to  Just filepath and responds with a  TextResult, or returns the lines as a MultilineTextResult if Nothing" was given as the first argument.Test and ghci helper   The Sourcefile read fromThe module to import  The Sourcefile to read fromThe identifier to import5Filters to apply before searching for the identifier        yNone!"$*,2:<=CDLMOST[b ,Parameters we can access while building our  MakeActions.Given a filepath performs the following steps:7Reads and parses a PureScript module from the filepath.VBuilds a dependency graph for the parsed module from the already loaded ExternsFiles.Attempts to find an FFI definition file for the module by looking for a file with the same filepath except for a .js extension.$Passes all the created artifacts to  rebuildModule.&If the rebuilding succeeds, returns a RebuildSuccessB with the generated warnings, and if rebuilding fails, returns a  RebuildError with the generated errors. dRebuilds a module but opens up its export list first and stores the result inside the rebuild cache Builds the default  MakeActions from a MakeActionsEnv -Shuts the compiler up about progress messages ZStops any kind of codegen (also silences errors about missing or unused FFI files though) Returns a topologically sorted list of dependent ExternsFiles for the given module. Throws an error if there is a cyclic dependency within the ExternsFiles Removes a modules export list.     zNone!"$*,2:<=CDLMOST[beAccepts a Commmand and runs it against psc-ide's State. This is the main entry point for the server. dFinds all the externs.json files inside the output folder and returns the corresponding Modulenames <Finds all matches for the globs specified at the commandline Looks up the ExternsFiles for the given Modulenames and loads them into the server state. Then proceeds to parse all the specified sourcefiles and inserts their ASTs into the state. Finally kicks off an async worker, which populates Stage 2 and 3 of the state.    {None!"$*,2:<=CDLMOT[b kReloads an ExternsFile from Disc. If the Event indicates the ExternsFile was deleted we don't do anything.`Installs filewatchers for the given directory and reloads ExternsFiles when they change on disc  |None!"$*,2:<=CDLMOT[b"Pretty print a module's signatures}None!"$*,2:<=CDLMOT[bValid Meta-commands for PSCIA purescript expression&Show the help (ie, list of directives)"Import a module from a loaded fileBrowse a module Exit PSCIReset the state of the REPL7Add some declarations to the current evaluation contextFind the type of an expressionFind the kind of an expression5Shows information about the current state of the REPLPaste multiple linesOAll of the data that is contained by an ImportDeclaration in the AST. That is:=A module name, the name of the module which is being importedpAn ImportDeclarationType which specifies whether there is an explicit import list, a hiding list, or neither.gIf the module is imported qualified, its qualified name in the importing module. Otherwise, Nothing.The PSCI state.Holds a list of imported modules, loaded files, and partial let bindings. The let bindings are partial, because it makes more sense to apply the binding to the final evaluated expression.The PSCI configuration.:These configuration values do not change during execution.1Updates the imported modules in the state record.5Updates the loaded externs files in the state record.-Updates the let bindings in the state record.A list of all ReplQuery values.,,, ~None!"$*,2:<=CDLMOT[b !List of all avaliable directives.RA mapping of directives to the different strings that can be used to invoke them.0Like directiveStrings, but the other way around.List of all directive strings.;Returns all possible string representations of a directive.9Returns the default string representation of a directive.~Returns the list of directives which could be expanded from the string argument, together with the string alias that matched.?True if the given directive takes an argument, false otherwise.The help menu.    None!"$*,2:<=CDLMOT[b-Loads module, function, and file completions. Callback for Haskeline's  Z. Expects: * Line contents to the left of the word, reversed * Word to be completed Decide what kind of completion we need based on input. This function expects a list of complete words (to the left of the cursor) as the first argument, and the current word as the second argument. Given a module and a declaration in that module, return all possible ways it could have been referenced given the current PSCiState - including fully qualified, qualified using an alias, and unqualified. SReturns all the ImportedModule values referring to imports of a particular module.     None!"$*,2:<=CDLMOT[bThe help message.The welcome prologue.The quit message.None!"$*,2:<=CDLMOT[b#The name of the PSCI support module'Checks if the Console module is defined"Loads a file for use with imports.Load all modules.:Makes a volatile module to execute the current expression.iMakes a volatile module to hold a non-qualified type synonym for a fully-qualified data type declaration.7Makes a volatile module to execute the current imports.    None!"$*,2:<=CDLMOT[b<Parses PSCI metacommands or expressions input from the user. ,Parses expressions entered at the PSCI repl. PSCI version of letR. This is essentially let from do-notation. However, since we don't support the Eff% monad, we actually want the normal let. eImports must be handled separately from other declarations, so that :show import works, for example. hAny other declaration that we don't need a 'special case' parser for (like let or import declarations).  None!"$(*,2:<=CDLMOT[b Pretty-print errors&This is different than the runMake in ]D in that it specifies the options and ignores the warning messages. ARebuild a module, using the cached externs data for dependencies.NBuild the collection of modules from scratch. This is usually done on startup.Performs a PSCi command Reset the application state ATakes a value expression and evaluates it with the current state. Takes a list of declarations and updates the environment, then run a make. If the declaration fails, restore the original environment. #Show actual loaded modules in psci. "Show the imported modules in psci. :Imports a module, preserving the initial state on failure. !Takes a value and prints its type  Takes a type and prints its kind *Browse a module and displays its signature   F*+   None!"$*,2:<=CDLMOT[b6An error that probably indicates a bug in this module. *An error that should be fixed by the user. RAn error which meant that it was not possible to retrieve metadata for a package.8                               &                    &                                                      None!"$*,2:<=CDILMOT[b (Listed in bower.json, but not installed. In the output of `bower list --json --offline`, there was no _resolution key. This can be caused by adding the dependency using `bower link`, or simply copying it into bower_components instead of installing it normally. Resolved, but to something other than a version. The Text argument is the resolution type. The values it can take that I'm aware of are "commit" and "branch". OResolved to a version. The Text argument is the resolution tag (eg, "v0.1.0"). (WHow to obtain the version tag and version that the data being generated will refer to. ))What to do when the working tree is dirty +~Attempt to retrieve package metadata from the current directory. Calls exitFailure if no package metadata could be retrieved. ,cAttempt to retrieve package metadata from the current directory. Returns a PackageError on failure 5Check if a string is a valid SPDX license expression. RExtracts all dependencies and their versions from `bower list --json --offline` `Extracts only the top level dependency names from the output of `bower list --json --offline` `Returns whether it looks like there is a purescript package checked out in the given directory.0         %   & ' ( ) * + , - . / 0 1   2 3 4 5 6 7  ! " 8 #   $ % & '  ( ) * 9 % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 , 2 + % - . / 0 1 & ' ( ) * 4 5 6 7 3 8%         %   & ' ( ) * + , - . / 0 1   2 3 4 5 6 7  ! " 8 #   $ % & '  ( ) * 9 +                                          ! " # $ % & ' ( ) * + , , - . / 0 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @AABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^^_`abcdefghijklmnopqrsttuuvwxyz{||}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abbcdefghiRjklmnopqrstuvwxyz{|}~YZ[\]^`+                                  ! " # $ % & ' ( ) * + , - . / 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!b!b!c!d!i!R!W!X!Y!k!l!m!n!o!Z![!j!p!\!q!]!^!_!`!a!b!c!d!e!e!f!g!h!i!j!j!k!k!l!m!n!o!p!q!r!s!t!u!v!w!x!y!z!{!|!}!~!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0!1!2!3!4!v!u!5!6!7!+!8!&!9!:!;!<"=">#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$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${$|$}$~$$$$$$$$$$$$%%&&&&&&&&&&&&'''''''()***+,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,-..////////0123444455555555666777777777777777777777777777777777777777777777777 7 7 7 7 77777777777777777777 7!7"7#8$9%9&:':(:):*:+:,:-::.:/:0;1<2=3=4=5=6>7>8>9>:>;>;><>=>>>?>@>A>B>B>C>D>E>F>G>H>I>J>K>L>M>N>O>>P>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@qArAsBtCuDvDwDxDyDzD{D|D}D~DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDEEFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHIIIIIIJJJKKKKKKKKKLMMNOOPP P Q R S TUUUUUUUUUVWWWWWWWXX Y!Z"[#[#[$[%[&['[([)[*[+[,\\\-\.\/\0\1\2\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^{^|^}^~__________``O``````````````````````````````q`m`t`o`x``u`l`l``````````````````````````````````````````````````````````````````````````````````````````````````````````5` ` ` ` ` ``````````+`````aaabb c!c"d#e$f%f&f'f(f)f*f+f,f-f.f/g0g1g2g3g4g5g6g7h8h8h9h:h;h;h<h=hh>h?hh@hhhAhBhChChDhEhFhGhHhIhJhKhLhMhNhOhPhQhRhShThUhVhWhXhYhZi[i\i]j^j^j_j`jajbjcjdjdjejfjgjhjijjjjjkjljmjnjnjojpjqjqjrjsjtjtjujvjwjxjyjzj{j|j}j~jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjj j j j j jjjjjjjjjjjjjjjjjjj j!k"k#k$k%k&k'k(k)l$l*l+m,m-n.n/n0n1n2n3n4n5n6n7n8o9o:o;p<p=p>p?p@pApBqCqDqEqFqGrHrIsJsJsKsLsMsNsOsPsQsRt*tStTtUtVuWuXuYuZu[u\u]u^u_u`uaubvcvdvevfvgvhwiwjwBwkwlwmwnwowpwwqwrwswtwuwvwwwxwywzww{w|w}w~wwwwwwwwwwwwwwwwwxuxuxxxxxxxxxxxxyz{||}}}z}y}}}}}}}}}o}}}u}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~~~~~~~~~~~~=<;                             ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4Q 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  [  \  ]  ^  _ U T  `  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  { | } ~    " " " " ' '!'"'#'$'''('.'/'0'1'2')'*'+','-'6'3'5'7' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ( ( ) + + - - - . . . . . . . . . . . . . . . . 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5.5 5 5 5 5 5 5 5 5 6 6 66 6 6 6 6 6 6 8 8 8 8 8 8 8 8 8 8 8 88 9 9 q:: : : : : : : : :: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : = = = = = = = != "= #= $> %> &> '> (> )> *> +? ,@ -A .A /A 0A 1A 2E 3E 4F 5 6F 7F 8F 9F :F ;F <F =F >F ?H @H AH BH CH DH EH FH GH HH IJ JK CL KL LL ML NL OL PL QL RL SM TM UM VM WM XM YN ZP [P \P ]PP ^P _P `PP aQ bQ cQ dQ eQ fQ gS hS iS jS kS lS mS nS oS pS qT rT sT tT uT vT wT xT yT zT {T |T }T ~T T rT U U U U U U U U U U U U U U U U U U V V V W W W W GW IW W W W W W W W W W W W W W W W X X X X X X X X X X X  Y Y Y Y Y Y Y YQYRY Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y   \ \  ^ ^ _ _)_+_ _ _ _._ _ _ _ _ _ _ _ _ _ _ _  a a a a a a a a a a a a a a a a a a a a a a a a a a aa b b b b b b b b b b c c c c c c c d d d d d d d d d e e e)e e e e*e+e,e9e e ee e e e eAe e e g g g !g "g #g $g %gg &g 'g (k )m *m +o ,o%o -o .o /o 0p<p 1p 2p 3p 4qCq 5q 6q 7q 8q 9q :q ;q <r =s >t ?u @u Au Bu Cu Du Eu Fu Gu Hu Iu Jvcvjv Kv Lv Mv Nv Ov Pv Qv Rv Sx Tx Ux Vx Wx Xx Yx Zx [x \x ]x ^x _y `y ayAy by cy dy ey `y fy gy hy iz jz kz lz mz nz oz pz qz rz szf{ t m u v w x y z { | } ~                                (purescript-0.10.4-8l8e94azsQ365elkOejmda(Language.PureScript.Publish.BoxesHelpersSystem.IO.UTF8Language.PureScript.Traversals!Language.PureScript.Publish.Utils Language.PureScript.Parser.StateLanguage.PureScript.Options"Language.PureScript.Interactive.IO+Language.PureScript.Docs.Utils.MonoidExtrasLanguage.PureScript.CrashLanguage.PureScript.Comments Language.PureScript.Parser.LexerLanguage.PureScript.Bundle!Language.PureScript.AST.SourcePos!Language.PureScript.AST.Operators Language.PureScript.AST.LiteralsControl.Monad.SupplyControl.Monad.Supply.ClassLanguage.PureScript.Names%Language.PureScript.CodeGen.JS.CommonLanguage.PureScript.Constants"Language.PureScript.CoreFn.BindersLanguage.PureScript.CoreFn.Expr%Language.PureScript.CoreFn.TraversalsLanguage.PureScript.CoreFn.MetaLanguage.PureScript.Kinds!Language.PureScript.Parser.CommonLanguage.PureScript.TypesLanguage.PureScript.AST.BindersLanguage.PureScript.CoreFn.Ann!Language.PureScript.CoreFn.Module)Language.PureScript.TypeClassDictionariesLanguage.PureScript.Environment$Language.PureScript.AST.Declarations Language.PureScript.AST.Exported"Language.PureScript.AST.Traversals"Language.PureScript.CodeGen.JS.AST/Language.PureScript.CodeGen.JS.Optimizer.Blocks/Language.PureScript.CodeGen.JS.Optimizer.Common0Language.PureScript.CodeGen.JS.Optimizer.Inliner0Language.PureScript.CodeGen.JS.Optimizer.MagicDo,Language.PureScript.CodeGen.JS.Optimizer.TCO/Language.PureScript.CodeGen.JS.Optimizer.Unused(Language.PureScript.CodeGen.JS.Optimizer!Language.PureScript.Pretty.Common Language.PureScript.Pretty.KindsLanguage.PureScript.Pretty.JS*Language.PureScript.Sugar.Operators.Common+Language.PureScript.Sugar.Operators.Binders(Language.PureScript.Sugar.Operators.Expr)Language.PureScript.Sugar.Operators.Types Language.PureScript.Parser.Kinds Language.PureScript.Parser.Types Language.PureScript.Pretty.Types!Language.PureScript.Pretty.ValuesLanguage.PureScript.Errors%Language.PureScript.Linter.Exhaustive&Language.PureScript.ModuleDependencies'Language.PureScript.Parser.Declarations&Language.PureScript.Sugar.Names.Common$Language.PureScript.TypeChecker.Rows'Language.PureScript.Sugar.BindingGroups#Language.PureScript.Sugar.Names.Env'Language.PureScript.Sugar.Names.Exports'Language.PureScript.Sugar.Names.Imports"Language.PureScript.Linter.ImportsLanguage.PureScript.Linter*Language.PureScript.Sugar.TypeDeclarationsLanguage.PureScript.ExternsLanguage.PureScript.Sugar.Names#Language.PureScript.Sugar.Operators%Language.PureScript.TypeChecker.Monad%Language.PureScript.TypeChecker.Kinds'Language.PureScript.TypeChecker.Skolems(Language.PureScript.TypeChecker.Synonyms%Language.PureScript.TypeChecker.Unify+Language.PureScript.TypeChecker.Subsumption*Language.PureScript.Sugar.CaseDeclarations$Language.PureScript.Sugar.DoNotation)Language.PureScript.Sugar.ObjectWildcards%Language.PureScript.Sugar.TypeClasses"Language.PureScript.CoreFn.DesugarLanguage.PureScript.CodeGen.JS!Language.PureScript.CoreFn.ToJSONLanguage.PureScript.Renamer*Language.PureScript.TypeChecker.Entailment*Language.PureScript.TypeChecker.TypeSearch%Language.PureScript.TypeChecker.TypesLanguage.PureScript.TypeChecker.Language.PureScript.Sugar.TypeClasses.DerivingLanguage.PureScript.SugarControl.Monad.LoggerLanguage.PureScript.MakeLanguage.PureScript+Language.PureScript.Docs.RenderedCode.Types,Language.PureScript.Docs.RenderedCode.RenderLanguage.PureScript.Docs.Types*Language.PureScript.Docs.Convert.ReExports'Language.PureScript.Docs.Convert.Single Language.PureScript.Docs.Convert)Language.PureScript.Docs.ParseAndBookmarkLanguage.PureScript.Docs.PrimLanguage.PureScript.Docs.Render#Language.PureScript.Docs.AsMarkdownLanguage.PureScript.Errors.JSON#Language.PureScript.Ide.ConversionsLanguage.PureScript.Ide.TypesLanguage.PureScript.Ide.ErrorLanguage.PureScript.Ide.LoggingLanguage.PureScript.Ide.PursuitLanguage.PureScript.Ide.UtilLanguage.PureScript.Ide.ExternsLanguage.PureScript.Ide.FilterLanguage.PureScript.Ide.Matcher"Language.PureScript.Ide.Completion!Language.PureScript.Ide.Reexports"Language.PureScript.Ide.SourceFileLanguage.PureScript.Ide.State!Language.PureScript.Ide.CaseSplitLanguage.PureScript.Ide.CommandLanguage.PureScript.Ide.ImportsLanguage.PureScript.Ide.RebuildLanguage.PureScript.IdeLanguage.PureScript.Ide.Watcher'Language.PureScript.Interactive.Printer%Language.PureScript.Interactive.Types)Language.PureScript.Interactive.Directive*Language.PureScript.Interactive.Completion'Language.PureScript.Interactive.Message&Language.PureScript.Interactive.Module&Language.PureScript.Interactive.ParserLanguage.PureScript.Interactive*Language.PureScript.Publish.ErrorsWarningsLanguage.PureScript.PublishPaths_purescriptMakedesugarImportsLanguage.PureScript.ASTLanguage.PureScript.PrettyText.Parsec.ErrorshowErrorMessagesLanguage.PureScript.ParserAxLanguage.PureScript.CoreFnLanguage.PureScript.CodeGen%Language.PureScript.Docs.RenderedCodeLanguage.PureScript.Docs!boxes-0.1.4-ydFzVDNbCb4CfN035tEOsText.PrettyPrint.BoxesnullBoxBox readUTF8FileTwriteUTF8FileT readUTF8File writeUTF8FilefstMsndMthirdMpairMmaybeMeitherMdefS globRelativepurescriptSourceFilespurescriptDepsFileswidth indentWidthparaindentedsuccessivelyIndentedvcatspacer bulletedList printToStderr printToStdout ParseStateindentationLevel$fShowParseStateOptions optionsNoTcooptionsNoMagicDo optionsMainoptionsNoOptimizationsoptionsVerboseErrorsoptionsNoCommentsoptionsSourceMapsoptionsDumpCoreFndefaultOptions $fShowOptionsfindNodeProcessgetHistoryFilename mintersperse internalErrorComment LineComment BlockComment $fShowComment $fEqComment $fOrdComment$fFromJSONComment$fToJSONComment TokenParserPositionedToken ptSourcePosptEndPos ptPrevEndPosptToken ptCommentsTokenlexanyTokentokenmatchlparenrparenparenslbracerbracebraceslsquarersquaresquaresindentindentAtlarrowrarrow lfatArrow rfatArrowcolon doubleColonequalspipetickdotcommasemiat underscoreholeLitsemiSepsemiSep1commaSep commaSep1lnamelname' qualifierreservedunameuname'tynamekiname dconsnamemnamesymbolsymbol' charLiteral stringLiteralnumbernatural identifierreservedPsNamesreservedTypeNames isSymbolChar isUnquotedKey$fShowPositionedToken $fShowToken $fEqToken $fOrdToken$fEqPositionedTokenModuleIdentifier ModuleTypeRegularForeign ErrorMessageUnsupportedModulePathInvalidTopLevelUnableToParseModuleUnsupportedExport ErrorInModuleMissingEntryPointMissingMainModule moduleNameguessModuleIdentifierprintErrorMessagegetExportedIdentifiersbundleSMbundle$fShowModuleType$fEqModuleType$fOrdModuleType$fShowModuleIdentifier$fEqModuleIdentifier$fOrdModuleIdentifier$fShowErrorMessage$fShowExportType$fEqExportType$fOrdExportType$fShowModuleElement $fShowModule SourceSpanspanName spanStartspanEnd SourcePos sourcePosLinesourcePosColumndisplaySourcePosdisplayStartEndPosdisplaySourceSpaninternalModuleSourceSpan$fFromJSONSourceSpan$fToJSONSourceSpan$fFromJSONSourcePos$fToJSONSourcePos$fShowSourcePos $fEqSourcePos$fOrdSourcePos$fShowSourceSpan$fEqSourceSpan$fOrdSourceSpanFixity AssociativityInfixlInfixrInfix Precedence showAssoc readAssoc$fToJSONFixity$fFromJSONAssociativity$fToJSONAssociativity$fShowAssociativity$fEqAssociativity$fOrdAssociativity $fShowFixity $fEqFixity $fOrdFixityLiteralNumericLiteral StringLiteral CharLiteralBooleanLiteral ArrayLiteral ObjectLiteral $fEqLiteral $fOrdLiteral $fShowLiteral$fFunctorLiteralSupplySupplyT unSupplyT runSupplyT evalSupplyT runSupply evalSupply$fFunctorSupplyT$fApplicativeSupplyT$fMonadSupplyT$fMonadTransSupplyT$fMonadErrorSupplyT$fMonadWriterSupplyT$fMonadReaderSupplyT$fAlternativeSupplyT$fMonadPlusSupplyT MonadSupplyfreshpeek freshName$fMonadSupplyWriterT$fMonadSupplyStateT$fMonadSupplySupplyT Qualified ModuleNameProperNameTypeTypeNameConstructorName ClassNameKindName Namespace ProperName runProperName OpNameType ValueOpName TypeOpNameOpName runOpNameIdentGenIdentName IdentName ValOpNameTyNameTyOpName DctorName TyClassNameModNameKiName getIdentName getValOpName getTypeName getTypeOpName getDctorName getClassName getModNamerunIdent showIdent freshIdent freshIdent'showOpcoerceProperName runModuleNamemoduleNameFromString showQualifiedgetQualqualify mkQualified disqualify disqualifyFor isQualified isUnqualifiedisQualifiedWith$fFromJSONProperName$fToJSONProperName$fFromJSONOpName$fToJSONOpName $fShowIdent $fEqIdent $fOrdIdent $fShowOpName $fEqOpName $fOrdOpName$fShowProperName$fEqProperName$fOrdProperName$fShowModuleName$fEqModuleName$fOrdModuleName$fEqName $fShowName$fShowQualified $fEqQualified$fOrdQualified$fFunctorQualified$fFromJSONQualified$fToJSONQualified$fFromJSONIdent $fToJSONIdent$fFromJSONModuleName$fToJSONModuleNamemoduleNameToJs identToJs properToJsidentNeedsEscapingidentCharToTextnameIsJsReservednameIsJsBuiltIn jsAnyReserved jsKeywordsjsSometimesReservedjsFutureReservedjsFutureReservedStrict jsOldReserved jsLiteralsFailPartialPrim AppendSymbol CompareSymbolTypeDataSymbolIsSymbol DataSymbol$apply# applyFlipped<>++append>>=bind+add-sub*mul/div%mod<lessThan> greaterThan<= lessThanOrEq>=greaterThanOrEq==eq/=notEqcompare&&conj||disj unsafeIndexorandxor<<<compose>>>composeFlippedmapnegatenotshlshrzshr complementzeroonebottomtopreturnpure' returnEscapeduntilEwhileErunST stRefValuenewSTRef readSTRef writeSTRef modifySTRefmkFnrunFnunit undefinedmonadEffDictionaryapplicativeEffDictionarybindEffDictionarysemiringNumber semiringInt ringNumberringIntmoduloSemiringNumbermoduloSemiringInteuclideanRingNumbereuclideanRingInt ordBoolean ordNumberordInt ordStringordChareqNumbereqInteqStringeqChar eqBooleanboundedBooleanbooleanAlgebraBooleanheytingAlgebraBooleansemigroupStringsemigroupoidFngenerictoSpine fromSpine toSignaturetypeDataOrdering orderingLT orderingEQ orderingGTmainpartialtypeffect __superclass___unusedprimprelude dataArrayeffstcontrolApplicativecontrolSemigroupoid controlBind dataBounded dataSemigroupdataHeytingAlgebradataEqdataOrd dataSemiringdataRingdataEuclideanRing dataFunctiondataFunctionUncurried dataIntBitsBinder NullBinder LiteralBinder VarBinderConstructorBinder NamedBinderextractBinderAnn $fShowBinder$fFunctorBinderCaseAlternativecaseAlternativeBinderscaseAlternativeResultGuardBindNonRecRecExpr ConstructorAccessor ObjectUpdateAbsAppVarCaseLet extractAnn modifyAnn$fFunctorCaseAlternative$fShowCaseAlternative $fShowExpr $fFunctorExpr $fShowBind $fFunctorBindeverywhereOnValueseverythingOnValuesConstructorType ProductTypeSumTypeMeta IsConstructor IsNewtypeIsTypeClassConstructor IsForeign$fShowConstructorType$fEqConstructorType $fShowMeta$fEqMetaKindKUnknownRowFunKind NamedKind $fShowKind$fEqKind $fOrdKindeverywhereOnKindseverywhereOnKindsMeverythingOnKinds$fFromJSONKind $fToJSONKind properNametypeNamekindNamedataConstructorNameparseQualified parseIdent parseOperatoraugmentfoldbuildPostfixParsermarkcheckIndentationsame readCommentsrunTokenParser toSourcePos ConstraintconstraintClassconstraintArgsconstraintDataConstraintDataPartialConstraintDataTypeTUnknownTypeVarTypeLevelString TypeWildcardTypeConstructorTypeOpTypeAppForAllConstrainedTypeSkolemREmptyRCons KindedTypePrettyPrintFunctionPrettyPrintObjectPrettyPrintForAllBinaryNoParensType ParensInType SkolemScoperunSkolemScopemapConstraintArgsoverConstraintArgs$fShowSkolemScope$fEqSkolemScope$fOrdSkolemScope$fToJSONSkolemScope$fFromJSONSkolemScope$fShowConstraintData$fEqConstraintData$fOrdConstraintData$fShowConstraint$fEqConstraint$fOrdConstraint $fShowType$fEqType $fOrdType$fFromJSONType $fToJSONType$fFromJSONConstraint$fToJSONConstraint rowToList rowFromList isMonoTypemkForAllreplaceTypeVarsreplaceAllTypeVarsusedTypeVariablesfreeTypeVariablesquantifymoveQuantifiersToFrontcontainsWildcardseverywhereOnTypeseverywhereOnTypesTopDowneverywhereOnTypesMeverywhereOnTypesTopDownMeverythingOnTypeseverythingWithContextOnTypes$fFromJSONConstraintData$fToJSONConstraintDataOpBinderBinaryNoParensBinderParensInBinderPositionedBinder TypedBinder binderNames $fEqBinderAnnnullAnnremoveComments ForeignDeclModulemoduleComments moduleImports moduleExports moduleForeign moduleDecls NamedDictTypeClassDictionaryInScopetcdValuetcdPath tcdClassNametcdInstanceTypestcdDependencies $fShowTypeClassDictionaryInScope#$fFunctorTypeClassDictionaryInScope$$fFoldableTypeClassDictionaryInScope'$fTraversableTypeClassDictionaryInScope DataDeclTypeDataNewtypeTypeKindDataType TypeSynonym ExternDataLocalTypeVariable ScopedTypeVarNameKindPrivatePublicExternalNameVisibility UndefinedDefinedFunctionalDependency fdDeterminers fdDetermined TypeClassDatatypeClassArgumentstypeClassMemberstypeClassSuperclassestypeClassDependenciestypeClassDeterminedArgumentstypeClassCoveringSets EnvironmentnamestypesdataConstructors typeSynonymstypeClassDictionaries typeClasseskindsinitEnvironmentmakeTypeClassDatashowDataDeclTypeprimNameprimKindkindType kindEffect kindSymbolprimTy tyFunctiontyStringtyChartyNumbertyInt tyBooleantyArraytyRecordisObject isFunctionisTypeOrAppliedfunction primKinds primTypes primClasseslookupConstructorisNewtypeConstructor lookupValue$fFromJSONDataDeclType$fToJSONDataDeclType$fShowFunctionalDependency$fShowTypeClassData$fShowNameVisibility$fEqNameVisibility$fShowNameKind $fEqNameKind$fShowTypeKind $fEqTypeKind$fShowDataDeclType$fEqDataDeclType$fOrdDataDeclType$fShowEnvironment$fFromJSONTypeKind$fToJSONTypeKind$fFromJSONFunctionalDependency$fToJSONFunctionalDependencyDoNotationElementDoNotationValueDoNotationBind DoNotationLetPositionedDoNotationElement UnaryMinusBinaryNoParensParensOp IfThenElse TypedValueDo!TypeClassDictionaryConstructorAppTypeClassDictionaryTypeClassDictionaryAccessorDeferredDictionaryAnonymousArgumentHolePositionedValueTypeInstanceBodyDerivedInstanceNewtypeInstanceNewtypeInstanceWithDictionaryExplicitInstance TypeFixity ValueFixity DeclarationDataDeclarationDataBindingGroupDeclarationTypeSynonymDeclarationTypeDeclarationValueDeclarationBindingGroupDeclarationExternDeclarationExternDataDeclarationExternKindDeclarationFixityDeclarationImportDeclarationTypeClassDeclarationTypeInstanceDeclarationPositionedDeclarationImportDeclarationTypeImplicitExplicitHidingDeclarationRefTypeRef TypeOpRefValueRef ValueOpRef TypeClassRefTypeInstanceRef ModuleRefKindRef ReExportRefPositionedDeclarationRef HintCategoryExprHintKindHint CheckHint PositionHint SolverHint OtherHintErrorMessageHintErrorUnifyingTypesErrorInExpressionErrorInInstanceErrorInSubsumptionErrorCheckingAccessorErrorCheckingTypeErrorCheckingKindErrorCheckingGuardErrorInferringTypeErrorInApplicationErrorInDataConstructorErrorInTypeConstructorErrorInBindingGroupErrorInDataBindingGroupErrorInTypeSynonymErrorInValueDeclarationErrorInTypeDeclarationErrorInTypeClassDeclarationErrorInForeignImportErrorSolvingConstraintPositionedErrorSimpleErrorMessageErrorParsingFFIModuleErrorParsingModuleMissingFFIModuleMultipleFFIModulesUnnecessaryFFIModuleMissingFFIImplementationsUnusedFFIImplementationsInvalidFFIIdentifierCannotGetFileInfoCannotReadFileCannotWriteFile InfiniteType InfiniteKindMultipleValueOpFixitiesMultipleTypeOpFixitiesOrphanTypeDeclarationRedefinedIdentOverlappingNamesInLet UnknownName UnknownImportUnknownImportDataConstructor UnknownExportUnknownExportDataConstructor ScopeConflictScopeShadowing DeclConflictExportConflictDuplicateModuleDuplicateTypeArgument InvalidDoBind InvalidDoLetCycleInDeclarationCycleInTypeSynonymCycleInModulesNameIsUndefinedUndefinedTypeVariablePartiallyAppliedSynonym EscapedSkolemTypesDoNotUnifyKindsDoNotUnifyConstrainedTypeUnifiedOverlappingInstancesNoInstanceFoundAmbiguousTypeVariables UnknownClassPossiblyInfiniteInstance CannotDeriveInvalidNewtypeInstanceCannotFindDerivingTypeDuplicateLabelDuplicateValueDeclarationArgListLengthsDifferOverlappingArgNamesMissingClassMemberExtraneousClassMember ExpectedTypeIncorrectConstructorArityExprDoesNotHaveTypePropertyIsMissingAdditionalPropertyTypeSynonymInstanceOrphanInstanceInvalidNewtypeInvalidInstanceHeadTransitiveExportErrorTransitiveDctorExportError ShadowedNameShadowedTypeVar UnusedTypeVarWildcardInferredTypeHoleInferredTypeMissingTypeDeclarationOverlappingPatternIncompleteExhaustivityCheckMisleadingEmptyTypeImportImportHidingModule UnusedImportUnusedExplicitImportUnusedDctorImportUnusedDctorExplicitImportDuplicateSelectiveImportDuplicateImportDuplicateImportRefDuplicateExportRef IntOutOfRangeImplicitQualifiedImportImplicitImport HidingImportCaseBinderLengthDiffersIncorrectAnonymousArgumentInvalidOperatorInBinderDeprecatedRequirePath!CannotGeneralizeRecursiveFunctionCannotDeriveNewtypeForDataExpectedWildcard TypeSearchTSBeforeTSAfterContextTypeFixityDeclarationValueFixityDeclaration getModuleNamegetModuleSourceSpanaddDefaultImport compDecRef getTypeRef getTypeOpRef getValueRef getValueOpRefgetTypeClassRef getKindRef isModuleRef isImplicit isExplicitmapTypeInstanceBodytraverseTypeInstanceBody isValueDecl isDataDecl isImportDeclisExternDataDeclisExternKindDecl isFixityDecl getFixityDecl isExternDeclisTypeClassInstanceDeclarationisTypeClassDeclaration flattenDecls$fEqDeclarationRef$fShowTypeSearch$fShowHintCategory$fEqHintCategory$fShowDeclarationRef$fEqImportDeclarationType$fShowImportDeclarationType$fEqValueFixity$fOrdValueFixity$fShowValueFixity$fEqTypeFixity$fOrdTypeFixity$fShowTypeFixity$fShowDoNotationElement$fShowDeclaration$fShowTypeInstanceBody$fShowErrorMessageHint$fShowSimpleErrorMessage$fFromJSONDeclarationRef$fToJSONDeclarationRef$fFromJSONImportDeclarationType$fToJSONImportDeclarationTypeexportedDeclarations isExportedeverywhereOnValuesTopDownMeverywhereOnValuesMeverythingWithContextOnValueseverywhereWithContextOnValuesMeverythingWithScope accumTypes accumKinds overTypesJSJSNumericLiteralJSStringLiteralJSBooleanLiteralJSUnaryJSBinaryJSArrayLiteral JSIndexerJSObjectLiteral JSAccessor JSFunctionJSAppJSVar JSConditionalJSBlockJSVariableIntroduction JSAssignmentJSWhileJSForJSForInJSIfElseJSReturnJSThrowJSTypeOf JSInstanceOfJSLabelJSBreak JSContinueJSRaw JSCommentBinaryOperatorAddSubtractMultiplyDivideModulusEqualTo NotEqualToLessThanLessThanOrEqualTo GreaterThanGreaterThanOrEqualToAndOr BitwiseAnd BitwiseOr BitwiseXor ShiftLeft ShiftRightZeroFillShiftRight UnaryOperatorNegateNot BitwiseNotPositiveJSNewwithSourceSpan getSourceSpaneverywhereOnJSeverywhereOnJSTopDowneverywhereOnJSTopDownMeverythingOnJS$fShowUnaryOperator$fEqUnaryOperator$fShowBinaryOperator$fEqBinaryOperator$fShowJS$fEqJScollapseNestedBlockscollapseNestedIfsapplyAll replaceIdent replaceIdents isReassigned isReboundisUsedtargetVariable isUpdatedremoveFromBlockisFnisDictisDict' etaConvertunThunk evaluateIifesinlineVariablesinlineCommonValuesinlineCommonOperatorsinlineFnCompositionmagicDotcoremoveCodeAfterReturnStatementsremoveUnusedArgremoveUndefinedAppoptimize PrinterState PlainStringStrPosSMapEmitemit addMappingparensT parensPos intercalaterunPlainString addMapping'bumpPosaddPosemptyPrinterState blockIndent withIndent currentIndentprettyPrintManyprettyPrintObjectKeybeforebeforeWithSpaceendWith$fEmitPlainString $fEmitStrPos$fMonoidStrPos$fMonoidPlainStringprettyPrintKindprettyPrintJSWithSourceMaps prettyPrintJSChaintoAssoc parseValueparseOpmatchOpopTablematchOperatorsmatchBinderOperatorsmatchExprOperatorsmatchTypeOperators parseKind parseTypeAtom parseType parsePolyType noWildcardsprettyPrintRowWithprettyPrintRow typeAtomAsBoxprettyPrintTypeAtom typeAsBoxsuggestedTypeAsBoxprettyPrintTypeprettyPrintSuggestedTypeprettyPrintValueprettyPrintBinderAtomprettyPrintBinder PPEOptions ppeCodeColorppeFullppeLevel ppeShowDocsLevelErrorWarningTypeMap umSkolemMap umUnknownMap umNextIndexMultipleErrorsrunMultipleErrorsErrorSuggestion errorSpan errorModulefindHintstripModuleAndSpan errorCodenonEmpty errorMessage singleErroronErrorMessagesaddHintaddHintsdefaultUnknownMapunwrapErrorMessagereplaceUnknownsonTypesInErrorMessageonTypesInErrorMessageM errorDocUrierrorSuggestionsuggestionSpanshowSuggestion ansiColoransiColorReset colorCode colorCodeBoxdefaultCodeColordefaultPPEOptionsprettyPrintSingleErrorprettyPrintExportprettyPrintImportprettyPrintRefprettyPrintMultipleErrorsprettyPrintMultipleWarningsprettyPrintMultipleWarningsBoxprettyPrintMultipleErrorsBoxprettyPrintMultipleErrorsWithprettyPrintParseErrorprettyPrintParseErrorMessageslinelineS renderBoxtoTypelevelStringrethrow reifyErrors reflectErrorswarnAndRethrowrethrowWithPositionwarnWithPositionwarnAndRethrowWithPosition withPositionescalateWarningWhenparU$fShowMultipleErrors$fMonoidMultipleErrors $fShowTypeMap $fShowLevelcheckExhaustiveExpr ModuleGraph sortModulesparseImportDeclaration'parseDeclarationparseLocalDeclaration parseModuleparseModulesFromFilesparseModuleFromFiletoPositionedError parseBinderparseBinderNoParens parseGuardwarnDuplicateRefscheckDuplicateLabelscreateBindingGroupsModulecollapseBindingGroupsModulecreateBindingGroupscollapseBindingGroups ExportModeInternalReExportEnvExports exportedTypesexportedTypeOpsexportedTypeClassesexportedValuesexportedValueOps exportedKindsImports importedTypesimportedTypeOpsimportedDataConstructorsimportedTypeClassesimportedValuesimportedValueOpsimportedModulesimportedQualModules importedKindsImportProvenance FromImplicit FromExplicitLocal ImportRecord importNameimportSourceModuleimportProvenance primImports nullExportsenvModuleSourceSpanenvModuleImportsenvModuleExportsprimEnv exportType exportTypeOpexportTypeClass exportValue exportValueOp exportKind getExportscheckImportConflicts$fEqImportProvenance$fOrdImportProvenance$fShowImportProvenance$fEqImportRecord$fOrdImportRecord$fShowImportRecord $fShowImports $fShowExports$fEqExportMode$fShowExportModefindExportableresolveExports ImportDef findImportsresolveImportsresolveModuleImport UsedImports lintImportslintdesugarTypeDeclarationsModuleExternsDeclarationEDType EDTypeSynonymEDDataConstructorEDValueEDClass EDInstanceEDKind edTypeName edTypeKindedTypeDeclarationKindedTypeSynonymNameedTypeSynonymArgumentsedTypeSynonymTypeedDataCtorNameedDataCtorOriginedDataCtorTypeCtoredDataCtorTypeedDataCtorFields edValueName edValueType edClassNameedClassTypeArgumentsedClassMembersedClassConstraintsedFunctionalDependenciesedInstanceClassNameedInstanceNameedInstanceTypesedInstanceConstraints edKindNameExternsTypeFixityefTypeAssociativityefTypePrecedenceefTypeOperator efTypeAlias ExternsFixityefAssociativity efPrecedence efOperatorefAlias ExternsImporteiModule eiImportType eiImportedAs ExternsFile efVersion efModuleName efExports efImports efFixitiesefTypeFixitiesefDeclarationsapplyExternsFileToEnvironmentmoduleToExternsFile$fShowExternsImport$fShowExternsFixity$fShowExternsTypeFixity$fShowExternsDeclaration$fShowExternsFile$fFromJSONExternsImport$fToJSONExternsImport$fFromJSONExternsFixity$fToJSONExternsFixity$fFromJSONExternsTypeFixity$fToJSONExternsTypeFixity$fFromJSONExternsDeclaration$fToJSONExternsDeclaration$fFromJSONExternsFile$fToJSONExternsFiledesugarImportsWithEnvdesugarSignedLiterals rebracketcheckFixityExportsUnknown CheckStatecheckEnv checkNextType checkNextKindcheckNextSkolemcheckNextSkolemScopecheckCurrentModulecheckSubstitution checkHints Substitution substType substKindemptySubstitutionemptyCheckState bindNames bindTypeswithScopedTypeVarswithErrorMessageHintrethrowWithPositionTCwarnAndRethrowWithPositionTCwithTypeClassDictionariesgetTypeClassDictionarieslookupTypeClassDictionariesbindLocalVariablesbindLocalTypeVariablesmakeBindingGroupVisiblewithBindingGroupVisiblepreservingNameslookupVariable getVisibilitycheckVisibilitylookupTypeVariablegetEnvgetLocalContextputEnv modifyEnvrunCheck runCheck' guardWithcaptureSubstitutioncapturingSubstitutionwithFreshSubstitutionwithoutWarningskindOfkindOfWithScopedVarskindsOf kindsOfAllnewSkolemConstantintroduceSkolemScopenewSkolemScope skolemizeskolemizeTypesInValueskolemEscapeCheck SynonymMapreplaceAllTypeSynonymsreplaceAllTypeSynonymsM freshType solveTypesubstituteTypeunknownsInType unifyTypes unifyRowsreplaceVarWithUnknownreplaceTypeWildcards varIfUnknownsubsumesdesugarCasesModule desugarCasesdesugarDoModuledesugarObjectConstructors desugarDecldesugarTypeClassestypeClassMemberNamesuperClassDictionaryNamesmoduleToCoreFn moduleToJs moduleToJSONrenameInModules SolverOptionssolverShouldGeneralizesolverDeferErrorsInstanceContextreplaceTypeClassDictionariesentailsnewDictionaries $fEqEvidence typeSearchBindingGroupTypeRecursiveBindingGroupNonRecursiveBindingGrouptypesOf$fShowBindingGroupType$fEqBindingGroupType$fOrdBindingGroupType checkNewtypetypeCheckModulederiveInstancesdesugarLogger runLogger runLogger'$fMonadBaseControlIOLogger$fMonadBaseIOLogger$fMonadWriterwLogger$fMonadIOLogger $fMonadLogger$fApplicativeLogger$fFunctorLoggerunMake RebuildPolicy RebuildNever RebuildAlwaysExterns MakeActionsgetInputTimestampgetOutputTimestamp readExternscodegenprogressProgressMessageCompilingModulerenderProgressMessage rebuildModulemakerunMakemakeIO readTextFileinferForeignModulesbuildMakeActions$fMonadBaseControlIOMake$fMonadBaseIOMake$fShowProgressMessage$fEqProgressMessage$fOrdProgressMessage$fShowRebuildPolicy$fEqRebuildPolicy$fOrdRebuildPolicy $fFunctorMake$fApplicativeMake $fMonadMake $fMonadIOMake$fMonadErrorMake$fMonadWriterMake$fMonadReaderMakeversion RenderedCodeContainingModule ThisModule OtherModuleRenderedCodeElementSyntaxCtorKeywordSpaceasRenderedCodeElementasContainingModulemaybeToContainingModulecontainingModuleToMaybefromContainingModuleasRenderedCode outputWithspsyntaxidentident'ctorkindkeyword keywordForall keywordDatakeywordNewtype keywordType keywordClasskeywordInstance keywordWhere keywordFixity keywordKind$fToJSONRenderedCode$fToJSONContainingModule$fToJSONRenderedCodeElement$fShowContainingModule$fEqContainingModule$fOrdContainingModule$fShowRenderedCodeElement$fEqRenderedCodeElement$fOrdRenderedCodeElement$fShowRenderedCode$fEqRenderedCode$fOrdRenderedCode$fMonoidRenderedCodeRenderTypeOptionsprettyPrintObjects currentModule renderRow renderKindrenderTypeAtom renderTypedefaultRenderTypeOptionsrenderTypeWithOptions InPackageFromDepBookmark PackageErrorCompilerTooOldErrorInPackageMetaInvalidVersionInvalidDeclarationTypeInvalidChildDeclarationType InvalidFixity InvalidKindInvalidDataDeclType GithubRepo runGithubRepo GithubUser runGithubUserChildDeclarationInfo ChildInstanceChildDataConstructorChildTypeClassMemberChildDeclaration cdeclTitle cdeclCommentscdeclSourceSpan cdeclInfo FixityAliasDeclarationInfoAliasDeclaration declTitle declCommentsdeclSourceSpan declChildrendeclInfomodName modCommentsmodDeclarations modReExportsVerifiedPackageUploadedPackage NotYetKnownPackagepkgMeta pkgVersion pkgVersionTag pkgModules pkgBookmarkspkgResolvedDependencies pkgGithub pkgUploaderpkgCompilerVersion verifyPackage packageNameconvertFundepsToStringsdeclInfoToString isTypeClassisValueisType isValueAlias isTypeAliasisKindfilterChildrenchildDeclInfoToStringisTypeClassMemberisDataConstructor takeLocal takeLocals ignorePackageparseUploadedPackageparseVerifiedPackage asPackageasUploadedPackage asNotYetKnownasVerifiedPackagedisplayPackageError asGithubUser asVersion parseVersion'asModule asDeclaration asReExport asInPackageasFixity asFixityAliasparseAssociativityasAssociativityasDeclarationInfoasTypeArgumentsasKindasType asFunDepsasDataDeclTypeasChildDeclarationasChildDeclarationInfo asSourcePos asConstraintasQualifiedProperNameasQualifiedIdent asBookmarks asBookmarkasResolvedDependenciesasGithub asSourceSpanassocListToJSON$fToJSONInPackage$fToJSONGithubRepo$fToJSONGithubUser$fToJSONChildDeclarationInfo$fToJSONDeclarationInfo$fToJSONChildDeclaration$fToJSONDeclaration$fToJSONModule$fToJSONNotYetKnown$fToJSONPackage$fFromJSONGithubUser$fFromJSONPackage$fFromJSONNotYetKnown$fFunctorInPackage$fShowNotYetKnown$fEqNotYetKnown$fOrdNotYetKnown$fShowDeclarationInfo$fEqDeclarationInfo$fOrdDeclarationInfo$fShowChildDeclarationInfo$fEqChildDeclarationInfo$fOrdChildDeclarationInfo$fShowChildDeclaration$fEqChildDeclaration$fOrdChildDeclaration$fEqDeclaration$fOrdDeclaration$fShowGithubUser$fEqGithubUser$fOrdGithubUser$fShowGithubRepo$fEqGithubRepo$fOrdGithubRepo$fShowPackageError$fEqPackageError$fOrdPackageError$fShowInPackage $fEqInPackage$fOrdInPackage $fEqModule $fOrdModule $fShowPackage $fEqPackage $fOrdPackageupdateReExports$fMonoidTypeClassEnv$fShowTypeClassEnvconvertSingleModulecollectBookmarksconvertModulesInPackageconvertModulesparseAndBookmarkprimDocsModulerenderDeclarationrenderDeclarationWithOptionsrenderChildDeclaration!renderChildDeclarationWithOptionsrenderConstraintrenderConstraintWithOptionsrenderConstraintsrenderConstraintsWithOptions notQualifiedtypeApp toTypeVarDocsrenderModulesAsMarkdownmodulesAsMarkdown codeToStringrunDocs $fShowFirst $fEqFirst $fOrdFirst JSONResultwarningserrors JSONErrorpositionmessage errorLinkfilename suggestion replacement replaceRange ErrorPosition startLine startColumnendLine endColumn$fShowErrorPosition$fEqErrorPosition$fOrdErrorPosition$fShowErrorSuggestion$fEqErrorSuggestion$fShowJSONError $fEqJSONError$fShowJSONResult$fEqJSONResult$fFromJSONErrorPosition$fToJSONErrorPosition$fFromJSONJSONError$fToJSONJSONError$fFromJSONJSONResult$fToJSONJSONResult toJSONErrors toJSONError$fFromJSONErrorSuggestion$fToJSONErrorSuggestion properNameTidentT prettyTypeTIdeTypeOperator_ideTypeOpName_ideTypeOpAlias_ideTypeOpPrecedence_ideTypeOpAssociativity_ideTypeOpKindIdeValueOperator_ideValueOpName_ideValueOpAlias_ideValueOpPrecedence_ideValueOpAssociativity_ideValueOpTypeIdeDataConstructor _ideDtorName_ideDtorTypeName _ideDtorType IdeSynonym_ideSynonymName_ideSynonymTypeIdeType _ideTypeName _ideTypeKindIdeValue_ideValueIdent _ideValueTypeIdeDeclaration IdeDeclValue IdeDeclTypeIdeDeclTypeSynonymIdeDeclDataConstructorIdeDeclTypeClassIdeDeclValueOperatorIdeDeclTypeOperator IdeDeclKind ModuleIdent$fShowIdeValue $fEqIdeValue $fOrdIdeValue $fShowIdeType $fEqIdeType $fOrdIdeType$fShowIdeSynonym$fEqIdeSynonym$fOrdIdeSynonym$fShowIdeDataConstructor$fEqIdeDataConstructor$fOrdIdeDataConstructor$fShowIdeValueOperator$fEqIdeValueOperator$fOrdIdeValueOperator$fShowIdeTypeOperator$fEqIdeTypeOperator$fOrdIdeTypeOperator$fShowIdeDeclaration$fEqIdeDeclaration$fOrdIdeDeclaration _IdeDeclValue _IdeDeclType_IdeDeclTypeSynonym_IdeDeclDataConstructor_IdeDeclTypeClass_IdeDeclValueOperator_IdeDeclTypeOperator _IdeDeclKind ideValueIdent ideValueType ideTypeKind ideTypeNameideSynonymNameideSynonymType ideDtorName ideDtorTypeideDtorTypeNameideValueOpAliasideValueOpAssociativityideValueOpNameideValueOpPrecedenceideValueOpType Annotation annLocationannExportedFromannTypeAnnotationIdeDeclarationAnn_idaAnnotation_idaDeclarationideTypeOpAliasideTypeOpAssociativity ideTypeOpKind ideTypeOpNameideTypeOpPrecedence$fShowAnnotation$fEqAnnotation$fOrdAnnotation$fShowIdeDeclarationAnn$fEqIdeDeclarationAnn$fOrdIdeDeclarationAnnIdeDeclNamespace IdeNSValue IdeNSType IdeNSKindPursuitResponseModuleResponseDeclarationResponsePursuitSearchType Identifier PursuitQuerySuccessCompletionResult TextResultMultilineTextResult PursuitResult ImportList ModuleListRebuildSuccess ModuleImportimportModuleName importTypeimportQualifier Completion complModulecomplIdentifier complTypecomplExpandedType complLocationcomplDocumentationMatchStage3s3Declarationss3CachedRebuildStage2 s2AstDataStage1 s1Externs s1ModulesIdeState ideStage1 ideStage2 ideStage3IdeIdeEnvironment ideStateVarideConfiguration ConfigurationconfOutputPath confLogLevel confGlobs IdeLogLevelLogDebugLogPerfLogAll LogDefaultLogNoneAstDataTypeAnnotationsDefinitionSites idaAnnotationidaDeclarationemptyAnn emptyIdeState emptyStage1 emptyStage2 emptyStage3identifierFromDeclarationRef encodeSuccess$fToJSONPursuitResponse$fFromJSONPursuitResponse$fFromJSONPursuitQuery$fFromJSONPursuitSearchType$fToJSONSuccess$fToJSONModuleImport$fEqModuleImport$fToJSONCompletion$fShowIdeLogLevel$fEqIdeLogLevel $fShowMatch $fEqMatch$fFunctorMatch$fShowCompletion$fEqCompletion$fShowModuleImport$fShowPursuitQuery$fEqPursuitQuery$fShowPursuitSearchType$fEqPursuitSearchType$fShowPursuitResponse$fEqPursuitResponse $fShowSuccess $fEqSuccess$fShowIdeDeclNamespace$fEqIdeDeclNamespace$fOrdIdeDeclNamespace $fShowAstData $fEqAstData $fOrdAstData$fFunctorAstData$fFoldableAstData PscIdeError GeneralErrorNotFoundModuleNotFoundModuleFileNotFound ParseError RebuildError$fToJSONPscIdeErrorlogPerfdisplayTimeSpecsearchPursuitForDeclarationsfindPackagesForModuleIdentidentifierFromIdeDeclaration discardAnn withEmptyAnn unwrapMatchcompletionFromMatchvalueOperatorAliasTtypeOperatorAliasTencodeTdecodeTunwrapPositionedunwrapPositionedRefreadExternFileconvertExternsannotateModuleFilter moduleFilter prefixFilterequalityFilter applyFilters$fFromJSONFilter$fMonoidFilterMatcher flexMatcher runMatcher$fFromJSONMatcher$fMonoidMatchergetCompletionsgetExactMatchesReexportResult reResolvedreFailedprettyPrintReexportResultreexportHasFailuresresolveReexports$fShowReexportResult$fEqReexportResult$fFunctorReexportResultgetImportsForFileextractAstInformationextractTypeAnnotations extractSpans resetIdeStategetLoadedModulenamesgetExternFiles insertModule getAllModules insertExternsinsertExternsSTM cacheRebuildpopulateStage2populateStage3populateStage3STMresolveOperatorsForModuleWildcardAnnotationsexplicitAnnotations noAnnotations caseSplit makePattern addClauseListType LoadedModulesAvailableModules ImportCommandAddImplicitImportAddImportForIdentifierCommandLoadCompletePursuit CaseSplit AddClauseImportListRebuildCwdResetQuit typeFilterstypeCurrentModulecompleteFilterscompleteMatchercompleteCurrentModule pursuitQuerypursuitSearchType caseSplitLinecaseSplitBegin caseSplitEndcaseSplitAnnotations caseSplitType addClauseLineaddClauseAnnotationslistType commandName$fFromJSONCommand$fFromJSONListType$fFromJSONImportCommand$fShowImportCommand$fEqImportCommandsliceImportSectionaddImplicitImportaddImplicitImport'addExplicitImport'addImportForIdentifierprettyPrintImport'prettyPrintImportSection answerRequest parseImport $fOrdImport $fEqImport $fShowImport rebuildFile handleCommandwatchertextTprintModuleSignatures DirectiveHelpBrowseShowPaste ReplQuery QueryLoaded QueryImport ExpressionShowHelp BrowseModuleQuitPSCi ResetStateDeclsTypeOfKindOfShowInfo PasteLinesImportedModule PSCiStatepsciImportedModulespsciLetBindingspsciLoadedExterns PSCiConfigpsciLoadedFilespsciEnvironmentinitialPSCiStatepsciImportedModuleNames allImportsOfupdateImportedModulesupdateLoadedExterns updateLets replQueriesreplQueryStrings showReplQueryparseReplQuery$fShowPSCiConfig$fShowPSCiState $fEqReplQuery$fShowReplQuery $fEqDirective$fShowDirective directivesdirectiveStringsdirectiveStrings'strings stringsFor stringFordirectivesFor' directivesFordirectiveStringsForparseDirective hasArgumenthelp CompletionMliftCompletionM completion completion'$fShowCompletionContext helpMessageprologueMessagesupportModuleMessage quitMessagesupportModuleNamesupportModuleIsDefined loadModuleloadAllModulescreateTemporaryModulecreateTemporaryModuleForKindcreateTemporaryModuleForImports importDecl indexFile modulesDir parseCommand OtherError ProcessFailedIOExceptionThrown JSONSourceFromFile FromBowerList InternalErrorRepositoryFieldErrorRepositoryFieldMissingBadRepositoryType NotOnGithub UserErrorBowerJSONNotFoundBowerExecutableNotFoundCouldntDecodeBowerJSONTagMustBeCheckedOutAmbiguousVersionsBadRepositoryFieldNoLicenseSpecifiedInvalidLicenseMissingDependencies CompileErrorDirtyWorkingTreePackageWarningNoResolvedVersionUndeclaredDependencyUnacceptableVersionDirtyWorkingTree_Warn printErrorprintErrorToStdout renderErrorrenderWarnings printWarnings$fMonoidCollectedWarnings$fShowPackageWarning$fShowRepositoryFieldError$fShowUserError$fShowJSONSource$fShowInternalError$fShowOtherError$fShowCollectedWarnings$fEqCollectedWarnings$fOrdCollectedWarningsPrepareMPublishOptionspublishGetVersionpublishWorkingTreeDirtydefaultPublishOptionsunsafePreparePackagepreparePackage runPrepareMwarn userError otherErrorpreparePackage'getModulesAndBookmarksgetGitWorkingTreeStatuscheckCleanWorkingTreegetVersionFromGitTaggetBowerRepositoryInfogetResolvedDependencies$fMonadIOPrepareM$fFunctorPrepareM$fApplicativePrepareM$fMonadPrepareM$fMonadWriterPrepareM$fMonadErrorPrepareM$fShowTreeStatus$fEqTreeStatus$fOrdTreeStatus$fEnumTreeStatus$fShowDependencyStatus$fEqDependencyStatuscatchIObindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNamemkdirponFirstFileMatchinglangDef tokenParserisUnquotedKeyHeadCharisUnquotedKeyTailCharLexerLParenRParenLBraceRBraceLSquareRSquareIndentLArrowRArrow LFatArrow RFatArrowColon DoubleColonEqualsPipeTickDotCommaSemiAt UnderscoreLNameUName QualifierSymbolNumberHoleLitprettyPrintTokenupdatePositions parseTokens whitespace parseCommentparsePositionedToken parseTokenvalidModuleName validUNamenotElemT ModuleElement ExportTypeKeycheckImportPathwithDepstoModulecompile isModuleEmptycodeGenRequireMember ExportsListOtherSkip RegularExportForeignReexportshowModuleTypefromStringLiteralstrValue commaListtrailingCommaList matchRequire matchMembermatchExportsAssignment extractLabelbaseGHC.BaseStringfilterDataConstructorsfilterInstancestypeInstanceConstituentsisDctorExported shouldInlineopAddopMulopEqopNotEq opLessThanopLessThanOrEq opGreaterThanopGreaterThanOrEqopAppendopSubopNegateopDivopModopConjopDisjopNotmagicDo'inlineSTtco' optimize'untilFixedPoint typeLiteralsmatchRowfunKindprettyPrintJS1prettyPrintJS'literalsstring conditionalaccessorindexerlamapptypeOf instanceOfunary'unarynegateOperatorbinaryprettyStatements parseStar parseBangparseNamedKind parseKindAtom parseFunction parseObjectparseTypeLevelStringparseTypeWildcardparseTypeVariableparseTypeConstructor parseForAllparseConstrainedType parseAnyTypeparseNameAndTypeparseRowEndingparseRowconstraintsAsBoxconstraintAsBoxappliedFunctionkindedinsertPlaceholders constrainedexplicitParens matchTypeAtom matchTypeforall_ typeAsBoxImpllistprettyPrintValueAtomellipsisprettyPrintObjectprettyPrintLiteralValueprettyPrintDeclarationprettyPrintCaseAlternativeprettyPrintDoNotationElementprettyPrintLiteralBinderRedundancyError qualifyNamegetConstructors initialize genericMergemissingCasesSinglemissingCasesMultipleisExhaustiveGuard otherwise missingCasescheckExhaustive IncompletemissingAlternative usedModulesparseInfixExprindexersAndAccessors kindedIdentparseDataDeclarationparseTypeDeclarationparseTypeSynonymDeclarationparseValueDeclarationparseExternDeclaration parseFixityparseFixityDeclarationparseImportDeclarationparseDeclarationRefparseTypeClassDeclarationparseConstraintparseInstanceDeclarationparseTypeInstanceDeclaration parseDerivingInstanceDeclaration positionedbooleanLiteralparseNumericLiteralparseCharLiteralparseStringLiteralparseBooleanLiteralparseArrayLiteralparseObjectLiteralparseIdentifierAndValueparseAbsparseVarparseConstructor parseCaseparseCaseAlternativeparseIfThenElseparseLetparseValueAtom parseHoleparsePropertyUpdate parseAccessorparseDoparseDoNotationLetparseDoNotationBindparseDoNotationElementparseUpdaterBodyparseAnonymousArgumentparseNumberLiteralparseNullaryConstructorBinderparseConstructorBinderparseObjectBinderparseArrayBinderparseVarOrNamedBinderparseNullBinderparseIdentifierAndBinderparseBinderAtomtoBindingGroupcollapseBindingGroupsForValue usedIdentsusedImmediateIdents usedTypeNames declIdent declTypeNametoDataBindingGroup isTypeSynonym fromValueDecl primExports addExportthrowDeclConflictthrowExportConflict ImportMap nullImportsprimModuleName filterModule resolveImportlintImportDecl findUsedRefs matchName runDeclRefcheckDuplicateImportselaborateExportsrenameInModule FixityRecordGHC.NumTypeFixityRecordValueFixityRecordrebracketModule removeParensexternsFixitiescollectFixitiesensureNoDuplicatescustomOperatorTable updateTypes freshKind solveKindsubstituteKind occursCheck unifyKinds solveTypes starIfUnknowninfer freshKindVarinfer'replaceAllTypeSynonyms'CoercionModeSingModedefaultCoercion subsumes' SElaborate SNoElaborate Elaborate NoElaborate validateCases desugarAbs inSameGrouptoDeclstoTuplemakeCaseDeclaration desugarDoDesugar MemberMap desugarModulememberToNameAndTypetypeClassDictionaryDeclaration#typeClassMemberToDictionaryAccessor!typeInstanceDictionaryDeclarationfindQualModulesimportToCoreFnexternToCoreFnexportToCoreFnmkTypeClassConstructor properToIdent literalToJSON identToJSONproperNameToJSONqualifiedToJSONmoduleNameToJSON bindToJSON recordToJSON exprToJSONcaseAlternativeToJSON binderToJSON RenameState rsBoundNames rsUsedNames runRenamenewScope updateScope lookupIdentfindDeclIdents renameInDecl renameInValuerenameInLiteralrenameInCaseAlternativerenameInBinderRename initState EntailsResultSolvedUnsolvedDeferredMatching TypeClassDictEvidence NamedInstanceIsSymbolInstanceCompareSymbolInstanceAppendSymbolInstancenamedInstanceIdentifier pairwiseAll pairwiseAnycombineContextsmatches mkContext pairwiseMcheckInEnvironment evalWriterT checkSubsumeisTyped checkTypeKindinstantiatePolyTypeWithUnknowns inferBinderbinderRequiresMonotypeinstantiateForBinders checkBinderscheckcheck'checkPropertiescheckFunctionApplicationcheckFunctionApplication'ensureNoDuplicateProperties UntypedDataTypeDatatypeDictionaryForBindingGroupcheckTypedBindingGroupElementtypeForBindingGroupElementinferLetBindingcheckTypeSynonyms typeCheckAll addDataTypeaddDataConstructoraddTypeSynonymvalueIsNotDefinedaddValue addTypeClassaddTypeClassDictionariescheckDuplicateTypeArgumentscheckTypeClassInstance#text-1.2.2.1-9Yh8rJoh8fO2JMLWffT3QsData.Text.InternalTextderiveInstanceunwrapTypeConstructorderiveNewtypeInstance dataGenericdataGenericRep dataMaybe typesProxy dataNewtype dataFunctor deriveGenericderiveGenericRepcheckIsWildcardderiveEq deriveOrd deriveNewtype findTypeDecllamNulllamCaselamCase2mkVarMnmkVar objectType decomposeRec deriveFunctorNothing mtl-2.2.1-6qsR1PHUy5lL47Hpoa4jCMControl.Monad.Error.Class MonadErrorcheckForeignDecls importPrimMaybeRCunRC renderHead renderLabel renderTaildePrimconvertconvertForAllspreprocessTypepure Applicative TypeClassEnvenvUnhandledMembers envValuesenvTypeClasses getReExportscollectDeclarations findImportlookupTypeDeclarationlookupModuleDeclarations handleEnvfilterTypeClassMemberstypeClassConstraintForlookupValueDeclarationlookupValueOpDeclarationlookupTypeOpDeclarationlookupTypeClassDeclarationlookupKindDeclarationhandleTypeClassMembersvalsAndMembersToEnvtypeClassesToEnvsplitMapfilterExportedChildrenallDeclarations|>internalErrorInModuleDeclarationAugmentIntermediateDeclarationaugmentDeclarations mkDeclaration AugmentChildgetDeclarationTitlebasicDeclarationconvertDeclarationconvertCommentscollectBookmarks' convertSortedtypeCheckIfNecessary typeCheckinsertValueTypespartiallyDesugar runParserFileInfo parseFiles addBookmarks throwLeftfileInfoToString parseFileparseAsgetDepsModuleNames addPackagelookupPrimClass unsafeLookuplookupPrimTypeKindprimType primClassarrayrecordintcharbooleanfail typeConcat typeStringFirstNotFirstmoduleAsMarkdowndeclAsMarkdown childToStringtell' headerLevel fencedBlockticks textError queryPursuithandlerremoveTypeDeclarationsForClass convertExport convertDeclconvertOperatorconvertTypeOperatormkFilter moduleFilter' identFilter runFilter ScoredMatchdistanceMatcherdistanceMatcher' mkMatchersortCompletions flexMatchflexRate flexScorecompletionsFromModules resolveRef getImportsinsertModuleSTM getStage1 getStage1STM getStage2 setStage2STM getStage3 setStage3STM cachedRebuildpopulateStage2STM getStage2STMresolveOperatorsfindTypeDeclarationfindTypeDeclaration'splitTypeConstructor prettyCtorprettyPrintWildcardprettyWildcard parseType'parseTypeDeclaration'splitFunctionTypeparseImportsFromFilestepaddExplicitImportImportStateMachine ModuleHeader ImportSectionRescompImportType compImportparseImportsWithModuleName moduleParseupdateAtFirstOrPrependMakeActionsEnvrebuildModuleOpen shushProgress shushCodegen sortExternsopenModuleExportsmaeOutputDirectorymaeFilePathMapmaeForeignPathMapmaePrefixCommentfindAvailableExternsfindAllSourceFiles loadModulesfindCompletionsfindTypefindPursuitCompletionsfindPursuitPackages printModulesoutputDirectorylistAvailableModules reloadFilehaskeline-0.7.2.3#System.Console.Haskeline.CompletioncompleteWordWithPrevcompletionContextgetAllQualificationsgetAllImportsOfCompletionContext CtxDirective CtxFilePath CtxModule CtxIdentifierCtxTypeCtxFixedcompleteDirective directiveArgcompleteImport headSatisfiesgetLoadedModulesgetModuleNamesmapLoadedModulesAndQualify getIdentNames getDctorNames getTypeNamesnubOnFst typeDecls identNames dctorNames moduleNamespsciExpressionpsciLet psciImportpsciOtherDeclaration parseRest psciCommandtrim trimStarttrimEnddiscardPositionInfo acceptableparseReplQuery' printErrorsrebuildhandleResetStatehandleExpression handleDeclshandleShowLoadedModuleshandleShowImportedModules handleImport handleTypeOf handleKindOf handleBrowseCollectedWarningsnoResolvedVersionsundeclaredDependenciesunacceptableVersionsdirtyWorkingTreedisplayUserError spdxExamplesdisplayRepositoryErrordisplayInternalErrordisplayJSONSourcedisplayOtherErrorcollectWarningswarnNoResolvedVersionswarnUndeclaredDependencieswarnUnacceptableVersionswarnDirtyWorkingTreeMissing NoResolution ResolvedOtherResolvedVersion isValidSPDXasToplevelDependencies isPureScriptDependencyStatus TreeStatusCleanDirty unPrepareM catchLeftunlessM checkLicense extractGithub readProcess'findBowerExecutableasDependencyStatuswarnUndeclared handleDepstryExtractVersiongetInputAndDepsFileswithPackageNamegetPackageName