i x      !"#$%&'()*+,-./0123456789:;<=>?@ABC 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'z'{'|'}'~'''''''''''''''''''''''''''''''''''''''''''''''''''''''''(()))))))))))********+,---./////////////////////////////////////////////////////// / / / / //////////////01111 1!1"1#1$1%1&1'1(1)1*1+1,1-1.1/101112131415161718191:1;1<1=2>2?3@4A5B5C5D5E5F5G5H5I6J7K8L9M9N9O9P: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={=|=}=~====================================================>??@@@@@@@@@@@@@ABBBBCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCDDEEEEFFG H I I I IIIIIIIIIIIIIIIIIII I!I"I#I$I%I&I'I(I)I*I+I,I-I.I/I0I1I2I3I4I5I6I7I8I9I:I;I<I=I>I?I@IAIBICIDIEIFIGIHIIIJIKILIMINIOIPIQIRISITIUJVJWKXKYKZL[L\L]L^L_L`LaLbLcLdLeLfLgLhLiLjLkLlLmLnLoLpLqLrLsLtLuLvLwLxLyLzL{L|L}L~LLLLLLLLLLLMMMMNNNNNNOOOPPPPPPPPPPQRRRSTTUUUVWXYZZZZZZZZZZZ[\\\\\\\]]^_```````````aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabccccccccccccccccc c c c c ccccccccccccccccccc c!c"c#c$c%c&c'c(c)c*c+c,c-c.c/c0c1c2c3c4c5c6c7c8c9c:c;c<c=c>c?c@cAcBcCcDcEcFcGcHcIcJcKcLcMcNcOcPcQcRcScTcUcVcWcXcYcZc[c\c]c^c_c`cacbcccdcecfcgchcicjckclcmcncocpcqcrcsctcucvcwcxcyczc{c|c}c~cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccdddeffffghiiiiiiiiiiiiijjjjjjjjjjjjjjjjj j j j j jjjkkkkkkkkllllllll l!l"l#l$l%l&l'l(l)l*l+l,l-l.l/l0l1l2l3l4l5l6l7l8l9l:l;l<l=l>l?l@lAlBmCmDmEmFmGmHmImJmKmLmMmNmOmPmQmRmSmTmUmVmWmXmYmZm[m\m]m^m_m`mambmcmdmemfmgmhmimjmkmlmmmnmompmqmrmsmtmumvmwmxmymzm{m|m}m~mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m !m "m #m $m %m &m 'm (m )m *m +m ,m -m .m /m 0m 1m 2m 3m 4m 5m 6n 7n 8n 9n :n ;n <n =n >n ?n @o Ao Bo Co Dp Ep Fq Gq Hq Iq Jq Kq Lq Mq Nq Oq Pq Qq Rq Sq Tq Uq Vr Wr Xs Ys Zs [s \s ]s ^s _t `t at bt ct du eu fv gv hv iv jv kv lv mv nv ov pv qw rw sw tw ux vx wx xx yx zx {x |x }x ~x x x x y y y y y y z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z z 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 wSafe!"$*,2:<=DLOT[bSafe!"$*,2:<=DLOT[b x y z { | } ~   y   x y z { | } ~  Safe!"$*,2:<=DLOT[b    None!"$*,2:<=DLOT[b GGlob relative to the current directory, and produce relative pathnames.)Glob pattern for PureScript source files.    Safe!"$*,2:<=DLOT[b    Safe!"$*,2:<=DLOT[bState for the parser monad*The most recently marked indentation levelNone!"$*,25:<=DILOT[bStrings in PureScript are sequences of UTF-16 code units, which do not necessarily represent UTF-16 encoded text. For example, it is permissible for a string to contain *lone surrogates,* i.e. characters in the range U+D800 to U+DFFF which do not appear as a part of a surrogate pair.The Show instance for PSString produces a string literal which would represent the same data were it inserted into a PureScript source file.Because JSON parsers vary wildly in terms of how they deal with lone surrogates in JSON strings, the ToJSON instance for PSString produces JSON strings where that would be safe (i.e. when there are no lone surrogates), and arrays of UTF-16 code units (integers) otherwise. Decode a PSString to a String, representing any lone surrogates as the reserved code point with that index. Warning: if there are any lone surrogates, converting the result to Text via Data.Text.pack will result in loss of information as those lone surrogates will be replaced with U+FFFD REPLACEMENT CHARACTER. Because this function requires care to use correctly, we do not export it. eDecode a PSString as UTF-16 text. Lone surrogates will be replaced with U+FFFD REPLACEMENT CHARACTER!Decode a PSString as UTF-16. Lone surrogates in the input are represented in the output with the Left constructor; characters which were successfully decoded are represented with the Right constructor."Pretty print a PSString, using Haskell/PureScript escape sequences. This is identical to the Show instance except that we get a Text out instead of a String.#zAttempt to decode a PSString as UTF-16 text. This will fail (returning Nothing) if the argument contains lone surrogates.$dPretty print a PSString, using JavaScript escape sequences. Intended for use in compiled JS output.  !"#$ %&'()* !"#$% #! "$%  !"#$ %&'()*Safe!"$*,2:<=DLOT[b/!The data type of compiler options1Verbose error message2)Remove the comments from the generated js3Generate source maps4 Dump CoreFn/012345/012345/012345/012345None!"$*,25:<=DILOT[b7Labels are used as record keys and row entry names. Labels newtype PSString because records are indexable by PureScript strings at runtime.789:789789789: Safe!"$*,2:<=DLOT[bC0Locates the node executable. Checks for either nodejs or node.D/Grabs the filename where the history is stored. CDCDCD CD Safe!"$*,2:<=DLOT[bEEEE Safe!"$*,2:<=DLOT[bF A compatibility wrapper for the GHC.Stack.HasCallStack constraint.G3Exit with an error message and a crash report link.FGFGFGFG None!"$*,2:<=DLOT[bHIJNHIJHIJNNHIJN None!"$*,2:<=DLOT[bSStart position of this tokenT5End position of this token (not including whitespace)U"End position of the previous tokenZLexes the given file, and on encountering a parse error, returns the progress made up to that point, instead of returning an error CWe use Text.Parsec.Token to implement the string and number lexemes /A token parser based on the language definitionx1Parse zero or more values separated by semicolonsy0Parse one or more values separated by semicolonsz-Parse zero or more values separated by commas{,Parse one or more values separated by commas)A list of purescript reserved identifiers+The characters allowed for use in operators <The characters allowed in the head of an unquoted record key <The characters allowed in the tail of an unquoted record key3Strings allowed to be left unquoted in a record keyoP QRSTUVWX Y Z [\]^_`abcdefghijklmnopqrstuvwxyz{|}~ APQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~AQRSTUVWXPYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~LP QRSTUVWX Y Z [\]^_`abcdefghijklmnopqrstuvwxyz{|}~ None!"$*,2:<=DLOT[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 b 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 b 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!"$*,25:<=DLOT[b Source nameStart of the spanSource position information Line number Column number  None!"$*,25:<=DLOT[bFixity data for infix operators!Associativity for infix operators(A precedence level for an infix operator  None!"$*,2:<=DLOT[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:<=DILOT[bNone!"$*,26:<=DLORT[b None!"$*,25:<=DLOT[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.4Coerces 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.97Provide a default module name, if a name is unqualified:4Makes a qualified value from a name and module name.;,Remove the module name from a qualified name<ZRemove 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 reference>RChecks whether a qualified value is not actually qualified with a module reference?FChecks whether a qualified value is qualified with a particular moduleD      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIceg7     & !"#$%'()*+,-./0123456789:;<=>?G !"#$%&'I()*+,-.H/012GFE3DCB 4  A56  @789:;<=>?cceegg-      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIcegNone!"$*,2:<=DLOT[bj Convert an $ 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.l<Test if a string is a valid AST identifier without escaping.mkAttempts to find a human-readable name for a symbol, if none has been specified returns the ordinal value.n<Checks whether an identifier name is reserved in JavaScript.o=Checks whether a name matches a built-in value in JavaScript.ijklmnopqrstuvijklmnopqrstuvijklmnopqrstuvijklmnopqrstuvNone!"$*,2:<=DLOT[bwxyz{|}~wxyz{|}~~}|{zyxwwxyz{|}~None!"$*,2:<=DLOT[bData type for binders Wildcard 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 identifier                    None!"$*,2:<=DLOT[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 application Variable!A case expression" A let binding#"Extract the annotation from a term$Modify the annotation on a term !"#$% !"#$ !"%#$  !"#$%None!"$*,2:<=DLOT[b+,+,+,+,None!"$*,2:<=DLOT[b-Data constructor metadata.6The constructor is for a type with a single construcor/7The constructor is for a type with multiple construcors0Metadata annotations1)The contained value is a data constructor2 The contained value is a newtype39The contained value is a typeclass dictionary constructor4/The contained reference is for a foreign member-./01234-./0123401234-./-./01234None!"$*,25:<=DLOT[b;The data type of kinds<!Unification variable of type Kind=5Kinds for labelled, unordered rows without duplicates>Function kinds? A named kind ;<=>?@ABCDEF ;=<>?@ABC ;<=>?FE@DABC;<=>?@ABCDEFNone!"$*,2:<=DLOT[bKParse a general proper name.LParse a proper name for a type.MParse a proper name for a kind.N+Parse a proper name for a data constructor.OParse a module nameP0Parse a qualified name, i.e. M.name or just nameQParse an identifier.R<Parse a label, which may look like an identifier or a stringSParse an operator.TnRun the first parser, then match the second if possible, applying the specified function on a successful matchUnRun the first parser, then match the second zero or more times, applying the specified function for each matchVPBuild a parser from a smaller parser and a list of parsers for postfix operatorsW"Mark the current indentation levelX;Check that the current identation level matches a predicateYACheck that the current indentation level is past the current markZWCheck 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^-Read source position information and commentsKLMNOPQRSTUVWXYZ[\]^KLMNOPQRSTUVWXYZ[\]^KLMNOPQRSTUVWXYZ[\]^KLMNOPQRSTUVWXYZ[\]^None!"$*,2:<=DLOT[b_ Parse a kind ___ _None!"$*,25:<=DILOT[b&`A typeclass constraintbconstraint class namectype argumentsd+additional data relevant to this constrainte2Additional data relevant to type class constraintsfData 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.gThe type of typesh#A unification variable of type TypeiA named type variablejA type-level stringk:A type wildcard, as would appear in a partial type synonymlA type constructormlA type operator. This will be desugared into a type constructor during the "operators" phase of desugaring.nA type applicationoForall quantifierp+A type with a set of type class constraintsqA skolem constantr An empty rowsA non-empty rowtA type with a kind annotationu%A placeholder used in pretty printingv%A placeholder used in pretty printingw%A placeholder used in pretty printingxqBinary operator application. During the rebracketing phase of desugaring, this data constructor will be removed.yjExplicit 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.z0An identifier for the scope of a skolem variable4Convert a row to a list of pairs of labels and typesKConvert a row to a list of pairs of labels and types, sorted by the labels.+Convert a list of labels and types to a row"Check whether a type is a monotypeUniversally quantify a type?Replace a type variable, taking into account variable shadowing'Replace named type variables with types.Collect all type variables appearing in a type3Collect all free type variables appearing in a typeEUniversally quantify over all type variables appearing free in a type5Move all universal quantifiers to the front of a type"Check if a type contains wildcards8`abcdefghijklmnopqrstuvwxyz{|}~1`abcdefgqhijklmnoprstuvwxyz{|}~;z{|ghijklmnopqrstuvwxyef`abcd}~`abcdefghijklmnopqrstuvwxyz{|}~None!"$*,2:<=DLOT[b Data type for bindersWildcard binder A binder which matches a literal"A binder which binds an identifier)A binder which matches a data constructormA operator alias binder. During the rebracketing phase of desugaring, this data constructor will be removed.qBinary 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./A binder which binds its input to an identifier)A binder with source position informationA binder with a type annotation8Collect all names introduced in binders in an expression     None!"$*,2:<=DLOT[b Type alias for basic annotations#Initial annotation with no metadata&Remove the comments from an annotation!None!"$*,2:<=DLOT[b The CoreFn module representation   "None!"$*,2345:<=DLOT[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 dictionaryPGenerate a name for a superclass reference which can be used in generated code.   #None!"$*,25:<=DLOT[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 moduleKind of ground types#Construct a type in the Prim moduleType constructor for functionsType constructor for stringsType constructor for strings Type constructor for numbers Type constructor for integers Type constructor for booleans Type constructor for arrays Type 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, Warn, and Partial; types that correspond to the classes with the same names.0The primitive class map. This just contains the Fail, Warn, and Partial classes. Partial? is used as a kind of magic constraint for partial functions. Fail' is used for user-defined type errors. Warn for user-defined warnings.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.L      !"#$?     L$#"!      .      !"#$$None!"$*,234:<=DLOT[bb@"A statement in a do-notation blockA A monadic value without a binderBA monadic value with a binderC0A let statement, i.e. a pure value with a binderD6A do notation element with source position informationE"An alternative in a case statementG6A collection of binders with which to match the inputsH9The result expression or a collect of guarded expressionsI#Data type for expressions and termsJA literal valueKA prefix -, will be desugaredLqBinary operator application. During the rebracketing phase of desugaring, this data constructor will be removed.MjExplicit 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.N-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.OPartial record updateP_Object updates with nested support: `x { foo { bar = e } }` Replaced during desugaring into a Y and nested OsQFunction introductionRFunction applicationSVariableT`An operator. This will be desugared into a function during the "operators" phase of desugaring.U%Conditional (if-then-else expression)VA data constructorWA 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.XA value with a type annotationY A let bindingZA 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 typechecking_0A placeholder for an anonymous function argument`EA typed hole that will be turned into a hint/error duing typecheckinga(A value with source position informationbLThe right hand side of a binder in value declarations and case expressions.dSA guard is just a boolean-valued expression that appears alongside a set of bindersg0The members of a type class instance declarationhThis is a derived instancei*This is an instance derived from a newtypejnThis is an instance derived from a newtype, desugared to include a dictionary for the type under the newtype.k%This is a regular (explicit) instancepThe data type of declarationsqMA data type declaration (data or newtype, name, arguments, data constructors)r:A minimal mutually recursive set of data type declarationss2A type synonym declaration (name, arguments, type)t)A type declaration for a value (name, ty)uDA value declaration (name, top-level binders, optional guard, value)v_A declaration paired with pattern matching in let-in expression (binder, optional guard, value)w6A minimal mutually recursive set of value declarationsx)A foreign import declaration (name, type)y'A data type foreign import (name, kind)zA 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 valueA 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 kindgA value re-exported from another module. These will be inserted during elaboration in name desugaring.8A declaration reference with source position informationA 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 hintsGError message hints, providing more detailed information about failure.A type of error messagesIinstance name, type class, expected argument count, actual argument count:a user-defined warning raised by using the Warn type classda declaration couldn't be used because there wouldn't be enough information | to choose an instanceCHolds 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 Environment8The identifiers that fully satisfy the subsumption checkIRecord fields that are available on the first argument to the typed hole&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.0 A traversal for TypeInstanceBody1,Test if a declaration is a value declaration2@Test if a declaration is a data type or type synonym declaration3(Test if a declaration is a module import43Test if a declaration is a data type foreign import5.Test if a declaration is a foreign kind import6-Test if a declaration is a fixity declaration8)Test if a declaration is a foreign import9:Test if a declaration is a type class instance declaration:1Test if a declaration is a type class declaration;CRecursively flatten data binding groups in the list of declarations89:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<fhi89:;<=>?@ABCDEFGHIJSVTNOQRWYKLMPUXZ[\]^_`abcdefghijklmnop|qrstuvwxyz{}~      !"#$%&'()*+,-./0123456789:;h  !     "#$<%&'()*+,-.pqrstuvwxyz{|}~nolmghijk/0123456789:;defbcIJKLMNOPQRSTUVWXYZ[\]^_`aEFGH@ABCD>?;<=89:ffiih889:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ e      !"#$%&'()*+,-./0123456789:;<fhi%None!"$*,2:<=DLOT[bkReturn 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 J. 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.lTest 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 k" to this function, where possible. _Test if a data constructor for a given type is exported, given a module's export list. Prefer k" to this function, where possible.k l klklk l &None!"$*,2:<=DLOT[bx=Map a function over type annotations appearing inside a value mnopqrstuvwx mnopqrstuvwx mnopqrstuvwx mnopqrstuvwxNone!"$*,2:<=DLOT[b=89:;<=>?@ABCDEFGHIJSVTNOQRWYKLMPUXZ[\]^_`abcdefghijklmnop|qrstuvwxyz{}~      !"#$%&'()*+,-./0123456789:;hklmnopqrstuvwx'None!"$*,2:<=DLOT[by/Data type for simplified JavaScript expressionszA numeric literal{A string literal|A boolean literal}A unary operator application~A binary operator applicationAn array literalAn array indexer expressionAn object literal8A function introduction (optional name, arguments, body)Function applicationVariable A block of expressions in braces3A variable introduction and optional initializationA variable assignment While loopFor loop ForIn loopIf-then-else statementReturn statement%Return statement with no return valueThrow statementinstanceof checkCommented JavaScriptBuilt-in binary operatorsBuilt-in unary operators8yz{|}~8y~{z|}8yz{|}~ yz{|}~(None!"$*,2:<=DLOT[b@Collapse blocks which appear nested directly below another block)None!"$*,2:<=DLOT[b    *None!"$*,2:<=DLOT[b-       -       +None!"$*,2:<=DLOT[bCInline 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 module  ,None!"$*,2:<=DLOT[bEliminate tail calls-None!"$*,2:<=DLOT[b.None!"$*,2:<=DLOT[b@Apply a series of optimizer passes to simplified JavaScript code  None!"$*,2:<=DLOT[bSy~{z|}/None!"$*,25:<=DILOT[b A type representing a highly simplified version of PureScript code, intended for use in output formats like plain text or HTML.A single element in a rendered code fragment. The intention is to support multiple output formats. For example, plain text, or highlighted HTML.Any symbol which you might or might not want to link to, in any namespace (value, type, or kind). Note that this is not related to the kind called Symbol for type-level strings.This type is isomorphic to    G. It makes code a bit easier to read, as the meaning is more explicit. bGiven a list of actions, attempt them all, returning the first success. If all the actions fail,   returns the first argument. pTry the given parsers in sequence. If all fail, fail with the given message, and include the JSON in the error. 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.$Wrap a RenderedCode value in parens. oConverts a FixityAlias into a different representation which is more useful to other functions in this module.@       //3       0None!"$*,2:<=DLOT[b/Generate RenderedCode value representing a Kind      1None!"$*,2:<=DILOT[b !)String with length and source-map entries(Wrap a string in parentheses++Generalize intercalate slightly for monoids1)Number of characters per identation level2)Pretty print with a new indentation level3!Get the current indentation level4Print many lines6RPlace a box before another, vertically when the first box takes up multiple lines.8*Place a Box on the bottom right of another;Make 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.  !"#$%&'()*+,-./0123456789:; !"#$%&'()*+,-./012345678 ()*+%&'#$!";: ,9-./012345678 !"#$%&'()*+,-./0123456789:;2None!"$*,2:<=DLOT[b=rGenerate 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           => =>>=           => 3None!"$*,2:<=DLOT[b?4Generate a pretty-printed string representing a Kind ! " #??? ! " #?4None!"$*,2:<=DLOT[b@Replace every BoundValueDeclaration in Let expressions with Case expressions. $Desugar a single let expression@ $@@@ $5None!"$*,2:<=DLOT[bABCDEFGHABCDEFGHABCDEFGHABCDEFGH6None!"$*,2:<=DLOT[bIIII7None!"$*,2:<=DLOT[bJJJJ8None!"$*,2:<=DLOT[bKKKK9None!"$*,2:<=DLOT[bL5Parse a type as it appears in e.g. a data constructorMParse a monotypeNParse a polytypeO&Parse an atomic type with no wildcards % & ' ( ) * +L , - .MNO / 0 1LMNOMNOL % & ' ( ) * +L , - .MNO / 0 1:None!"$*,2:<=DLOT[b 23Generate a pretty-printed string representing a RowR\Generate a pretty-printed string representing a Type, as it should appear inside parenthesesU0Generate a pretty-printed string representing a gV0Generate a pretty-printed string representing a g( using unicode symbols where applicableW:Generate a pretty-printed string representing a suggested g 3 4 5 6 7 8 2P 9 : ; < = > ? @ AQRST B C D EUVW FXY PQRSTUVWXY STUVWQRPXY 3 4 5 6 7 8 2P 9 : ; < = > ? @ AQRST B C D EUVW FXY;None!"$*,2:<=DLOT[b^Render code representing a Row_Render code representing a Type`GRender code representing a Type, as it should appear inside parenthesesZ[\] G H I^ J K L M N O P Q R S T U V W X_`abc Z[\]^_`abc _`^Z[\]abcZ[\] G H I^ J K L M N O P Q R S T U V W X_`abcNone!"$*,2:<=DLOT[b:Z[\]^_`abc<None!"$*,2:<=DLOT[b Y5Render an aligned list of items separated with commasdPretty-print an expression ZCPretty-print an atomic expression, adding parentheses if necessary.f6Generate a pretty-printed string representing a Binder [ Y \ ] ^d Z _ ` a be cfdefdfe [ Y \ ] ^d Z _ ` a be cfNone!"$*,2:<=DLOT[b"?PQRSTUVWXYdef=None!"#$*,2:<=DILOT[b$g Optionsi$Color code with this color... or notj"Should write a full error message?k)Should this report an error or a warning?l/Should show a link to error message's doc page?mHow critical the issue ispLA map from rigid type variable name/unknown variable pairs to new variables.rGa map from skolems to their new names, including source and naming infos3a map from unification variables to their new namestunknowns and skolems share a source of names during renaming, to avoid overlaps in error messages. This is the next label for either case.uA stack trace for an errorz Get the source span for an error{ Get the module name for an error}3Remove 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 parallelGghijklmnopqrstuvwxyz{|}~89:;<=>?@ABCDEFGHIJSVTNOQRWYKLMPUXZ[\]^_`abcdefghijklmnop|qrstuvwxyz{}~      !"#$%&'()*+,-./0123456789:;hklmnopqrstuvwxghijklmnopqrstuvwxyz{|}~Gxyz{|}~uvwpqrstmnoghijkl9ghijklmnopqrstuvwxyz{|}~>None!"$*,2:<=DLOT[b d8There 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. eRQualifies a propername from a given qualified propername and a default module name fGiven 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"]) gReplicates a wildcard binder hBApplies a function over two lists of tuples that may lack elements iFind the uncovered set between two binders: the first binder is the case we are trying to cover, the second one is the matching binder jReturns 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. kGuard handling+We say a guard is exhaustive iff it has an  l (or truep) expression. Example: f x | x < 0 = 0 | otherwise = 1 is exhaustive, whereas `f x | x < 0` is not;or in case of a pattern guard if the pattern is exhaustive.5The function below say whether or not a guard has an  l# expression It is considered that  l is defined in Prelude m.Returns the uncovered set of case alternatives neMain 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 d o p e f g h i j k m q n d o p e f g h i j k m q n?None!"$*,2:<=DLOT[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. rOCalculate a list of used modules based on explicit imports and qualified names. sFConvert a strongly connected component of the module graph to a module r s r s@None!"$*,2:<=DLOT[b Parse a single declaration6Parse a module declaration and its export declarations6Parse 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  t/Parse an expression in backticks or an operator u1Expressions including indexers and record updatesParse an expressionParse a binder<Parse a binder as it would appear in a top level declaration Parse a guardE v w x y z { | } ~    t u    E v w x y z { | } ~    t u  None!"$*,2:<=DLOT[bjPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~KLMNOPQRSTUVWXYZ[\]^_LMNOANone!"$*,2:<=DLOT[b;Warns about duplicate values in a list of declaration refs.BNone!"$*,2:<=DLOT[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 oConvert a group of mutually-recursive dependencies into a BindingGroupDeclaration (or simple ValueDeclaration).  CNone!"$*,2:<=DLOT[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. The 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. eAdds an entry to a list of exports unless it is already present, in which case an error is returned. IRaises an error for when there is more than one definition for something. DRaises 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     //      DNone!"$*,2:<=DLOT[bLFinds 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.  ENone!"$*,2:<=DLOT[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.  FNone!"$*,2:<=DLOT[bTMap 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) & !"#$%'  !"#$%&' GNone!"$*,2:<=DLOT[bTLint the PureScript AST. | | Right now, this pass only performs a shadowing check. & !"#$%'HNone!"$*,2:<=DLOT[b IReplace all top level type declarations in a module with type annotations    INone!"$*,2:<=DLOT[b! 8A type or value declaration appearing in an externs file A type declaration A type synonym A data construtorA value declarationA type class declarationAn instance declarationA kind declaration),A type fixity declaration in an externs file+!The associativity of the operator,$The precedence level of the operator-The operator symbol.&The value the operator is an alias for/'A fixity declaration in an externs file1!The associativity of the operator2$The precedence level of the operator3The operator symbol4&The value the operator is an alias for5"A module import in an externs file7The imported module8-The import type: regular, qualified or hiding9+The imported-as name, for qualified imports:4The data which will be serialized to an externs file<The externs version= Module name>List of module exports?List of module imports@$List of operators and their fixitiesA)List of type operators and their fixitiesB"List of type and value declarationCSource span for error reportingD*Convert an externs file back into a moduleE9Generate an externs file for all declarations in a moduleA     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEKMOQS<     !"#$%&'()*+,-./0123456789:;<=>?@ABCDE<:;<=>?@ABC56789/01234)*+,-.     !"#$%&'(ED      !"#$%&'()*+,-./0123456789: ;<=>?@ABCDEKMOQSJNone!"$*,2:<=DLOT[bUReplaces all local names with qualified names within a list of modules. The modules should be topologically sorted beforehand. Make 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. vReplaces all local names with qualified names within a module and checks that all existing qualified names are valid.UV UV UVUV KNone!"$*,2:<=DLOT[b An operator associated with its declaration position, fixity, and the name of the function or data constructor it is an alias for.WARemoves unary negation operators and replaces them with calls to  .XERemove explicit parentheses and reorder binary operator applications.LThis pass requires name desugaring and export elaboration to have run first.YChecks 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. WX YWXYWXY WX YLNone!"$%&*,29:;<=DLOT[b'ZUnification variables[ State required for type checking] The current  Environment^"The next type unification variable_"The next kind unification variable`The next skolem variableaThe next skolem scope constantbThe current modulecThe current substitutiondOThe 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.e:A substitution of unification variables for types or kindsgType substitutionhKind substitutioniAn empty substitutionjCreate an empty  CheckStatek0Temporarily bind a collection of names to valuesl/Temporarily bind a collection of names to typesm/Temporarily bind a collection of names to typesoThese hints are added at the front, so the most nested hint occurs at the front, but the simplifier assumes the reverse order.rBTemporarily make a collection of type class dictionaries availables:Get the currently available map of type class dictionariest+Lookup type class dictionaries in a module.u9Temporarily bind a collection of names to local variablesv>Temporarily bind a collection of names to local type variablesw-Update the visibility of all names to DefinedxQUpdate the visibility of all names to Defined in the scope of the provided actiony6Perform an action while preserving the names from the  Environment.z*Lookup the type of a value by name in the  Environment{0Lookup the visibility of a value by name in the  Environment|Assert that a name is visible})Lookup the kind of a type by name in the  Environment~Get 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./Z[\]^_`abcdefghijklmnopqrstuvwxyz{|}~/Z[\]^_`abcdefghijklmnopqrstuvwxyz{|}~/efghi[\]^_`abcdjZklmnopqrstuvwxyz{|}~#Z[ \]^_`abcdefghijklmnopqrstuvwxyz{|}~MNone!"$*,29:;<=DLOT[b Generate a fresh kind variable 2Update the substitution to solve a kind constraint Apply a substitution to a kind 2Make sure that an unknown does not occur in a kind Unify 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 ^Solve the set of kind constraints associated with the data constructors for a type constructor 7Default all unknown kinds to the kindType kind of types Infer a kind for a type      NNone!"$*,2:<=DLOT[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 constantsMThis function skolemizes type variables appearing in any type signatures or ^o placeholders. These type variables are the only places where scoped type variables can appear in expressions.1Ensure skolem variables do not escape their scope(Every skolem variable is created when a oc type is skolemized. This determines the scope of that skolem variable, which is copied from the z field of the o constructor.<This function traverses the tree top-down, and collects any zs introduced by os. If a q is encountered whose zL is not in the current list, then we have found an escaped skolem variable.ONone!"$%&*,2:<=DLOT[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 .  PNone!"$*,29:;<=DLOT[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 substitution9Align two rows of types, splitting them into three parts:%Those types which appear in both rows#Those which appear only on the left$Those which appear only on the rightINote: importantly, we preserve the order of the types with a given label.1Unify two rows, updating the current substitutionCommon labels are identified and unified. Remaining labels and types are unified with a trailing row unification variable, if appropriate.>Replace a single type variable with a new unification variable$Replace type wildcards with unknownsJReplace outermost unsolved unification variables with named type variables      QNone!"$%&*,2:<=DLORT[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      RNone!"$*,2:<=DLOT[b@Replace all top-level binders in a module with case expressions. ]Desugar case with pattern guards and pattern clauses to a series of nested case expressions. 2Validates that case head and binder lengths match.4Replace all top-level binders with case expressions.      SNone!"$*,2:<=DLOT[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  TNone!"$*,2:<=DLOT[bUNone!"$*,2:<=DLOT[bAdd type synonym declarations for type class dictionary types, and value declarations for type class instance dictionary expressions.    VNone!"$*,2:<=DLOT[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:<=DLOT[b9      !"#$+,-./01234WNone!"$*,2:<=DLOT[biGenerate code in the simplified JavaScript intermediate representation for all declarations in a module.ijklmnopqrstuvyNone!"$*,2:<=DLOT[bijklmnopqrstuvyXNone!"$*,2:<=DLOT[b              YNone!"$*,2:<=DLOT[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.                      ZNone!"#$*,2:<=DLOT[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 LComputed instance of the Warn type class with a user-defined warning message !GComputed instance of the IsSymbol type class for a given Symbol literal ""Computed instance of CompareSymbol #!Computed instance of AppendSymbol $Computed instance of Union %Computed instance of RowCons &*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 * + ' ( ,         ! " # $ % & ) * + ' ( ,[None!"$*,2:<=DLOT[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 0K(all accessors we found, all accessors we found that match the result type))Additional constraints we need to satisfyGThe Environment which contains the relevant definitions and typeclassesThe typechecker stateThe type we are looking for - . / 0\None!"#$*,2:<=DLOT[b 1eA binding group contains multiple value definitions, some of which are typed and some which are not.HThis structure breaks down a binding group into typed and untyped parts. 2The untyped expressions 38The typed expressions, along with their type annotations 4A map containing all expressions and their assigned types (which might be fresh unification variables). These will be added to the ? after the binding group is checked, so the value type of the Map. is chosen to be compatible with the type of k.Infer the types of multiple mutually-recursive values, and return elaborated values including type class dictionaries and type annotations. 5 This function breaks a binding group down into two sets of declarations: those which contain type annotations, and those which don't. This function also generates fresh unification variables for the types of declarations without type annotations, returned in the  UntypedData structure. 6>Check the type annotation of a typed value in a binding group. 7FInfer a type for a value in a binding group which lacks an annotation. 89Check the kind of a type, failing if it is not of kind *. 9yRemove 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 ACheck the type of a value B5Check 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. C^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.) D(Check the type of a function application EJEnsure a set of property names and value does not contain duplicate labels 1 F 2 3 4 5 6YThe identifier we are trying to define, along with the expression and its type annotation.Names brought into scope in this binding group 7The identifier we are trying to define, along with the expression and its assigned type (at this point, this should be a unification variable).Names brought into scope in this binding group 8 9 : ; G < = > ? H @ A B CThe function expressionThe type of the functionThe argument expression(The result type, and the elaborated term D E 1 F 2 3 4 5 6 7 8 9 : ; G < = > ? H @ A B C D E]None!"$*,29:;<=DLOT[b I4Check that type synonyms are fully-applied in a type J'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. K L M N O P Q R Sindex of type class argument I J= Z[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ K L M N O P Q R S I J^None!"$*,2:<=DLOT[b=Elaborates deriving instance declarations by code generation. TTakes a declaration, and if the declaration is a deriving TypeInstanceDeclaration, elaborates that into an instance declaration via code generation. T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q_None!"$*,2:<=DLOT[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.4@ UVWXY`Safe!"$*,29:;<=DLORT[b;A replacement for WriterT IO which uses mutable references.5Run a Logger computation, starting with an empty log.   aNone!"$*,2:<=DILORT[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  r2 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 process,Compilation started for the specified moduleRender a progress messageRebuild a single module.QThis function is used for fast-rebuild workflows (PSCi and psc-ide are examples).?Compiles in "make" mode, compiling each module separately to a .js file and an  externs.json file.If 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.Run an  s action in the ; monad, by specifying how IO errors should be rendered as  values.Read a text file in the ( monad, capturing any errors using the  t 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. uoCheck that the declarations in a given PureScript module match with those in its corresponding foreign module. vthe 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? u v ubNone!"$*,2:<=DLOT[b "/012345FGHIJPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~     & !"#$%'()*+,-./0123456789:;<=>?;=<>?@ABCKLMNOPQRSTUVWXYZ[\]^_`abcdefgqhijklmnoprstuvwxyz{|}~     89:;<=>?@ABCDEFGHIJSVTNOQRWYKLMPUXZ[\]^_`abcdefghijklmnop|qrstuvwxyz{}~      !"#$%&'()*+,-./0123456789:;hklmnopqrstuvwx?@LMNOPQRSTUVWXYdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~cNone!"$*,25:<=DLOT[b+A link to a declaration in the same module.A link to a declaration in a different module, but still in the current package; we need to store the current module and the other declaration's module.A link to a declaration in a different package. We store: current module name, name of the other package, version of the other package, and name of the module in the other package that the declaration is in.A link to a declaration that is built in to the compiler, e.g. the Prim module. In this case we only need to store the module that the builtin comes from (at the time of writing, this will only ever be Prim).`Minimum allowable version for generating data with the current parser, and actual version used.@A type instance declaration, with its dependencies and its type.,A data constructor, with its type arguments. A 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,  w from  x would be `forall a. a -> f a`.'A 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 / 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 /.(#A value declaration, with its type.)A data/newtype declaration, with the kind of declaration (data or newtype) and its type arguments. Constructors are represented as child declarations.**A data type foreign import, with its kind.+5A type synonym, with its type arguments and its type.,A type class, with its type arguments, its superclasses and functional dependencies. Instances and members are represented as child declarations.-[An operator alias declaration, with the member the alias is for and the operator's fixity..A kind declarationLThe version of the PureScript compiler which was used to generate this data. We store this in order to reject packages which are too old.OThe time format used for serializing package tag times in the JSON format. This is the ISO 8601 date format which includes a time and a timezone.PRConvenience function for formatting a time in the format expected by this module.QOConvenience function for parsing a time in the format expected by this module.[>Discard any children which do not satisfy the given predicate.cGiven a links context, the current module name, the namespace of a thing to link to, its title, and its containing module, attempt to create a DocLink.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"}.      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&')+(*.,-/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ABCDEFGHIJKL?@>=<MNOPQ6789:;/012345'()*+,-.RSTUVWXYZ[!"#$%& \]^_    `ab cdefghijklmnopqrstuvwxyz{|}~m      !"#$%&'()*+,-./0123456789:;<=>?@A BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~dNone!"$*,2:<=DLOT[b yAn 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. zType 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. y z { | } ~   y z { | } ~  eNone!"$*,2:<=DLOT[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. %Different declarations we can augment &Augment documentation for a type class ,Augment documentation for a type constructoroConvert 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. !Create a basic Declaration value.      fNone!"$*,2:<=DLOT[bLike convertModules, except that it takes a list of modules, together with their dependency status, and discards dependency modules in the resulting documentation.bConvert a group of modules to the intermediate format, designed for producing documentation from.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. wConvert a sorted list of modules, returning both the list of converted modules and the Env produced during desugaring. If 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. <Typechecks all the modules together. Also returns the final _, which is useful for adding in inferred types where explicit declarations were not provided. tUpdates all the types of the ValueDeclarations inside the module based on their types inside the given Environment. cPartially desugar modules so that they are suitable for extracting documentation information from.    gNone!"$*,2:<=DLOT[b <Specifies whether a PureScript source file is considered as: 1) with the  d constructor, a target source file, i.e., we want to see its modules in the output 2) with the   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 modulesReturn the parsed modules and a Map mapping module names to package names for modules which come from dependencies. If a module does not exist in the map, it can safely be assumed to be local.    hNone!"$*,2:<=DLOT[b lLookup the TypeClassData of a Prim class. This function is specifically not exported because it is partial.  iNone!"$*,2:<=DLOT[b    None!"$*,2:<=DLOT[bZ[\]^_`abc      !"#$%&')+(*.,-/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~jNone!"$*,2:<=DLOT[bAAn HtmlRenderContext for when you don't want to render any links. QRender Markdown to HTML. Safe for untrusted input. Relative links are | removed.            kNone!"$*,2:<=DLOT[baTake a list of modules and render them all in order, returning a single Markdown-formatted Text.         lNone!"$*,2:<=DLOT[b !"#$%&'()*+,-.8:<>?@#" $!%&'()*+,-.>?!)*+,-.%&'( !"#$88::<<@@>?  !"#$%&'()*+,-.8:<>?@mNone!"$*,24:<=DLOT[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 editors fSourceSpans for the definition sites of Values and Types aswell as type annotations found in a moduleBCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw                    BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw              wvmnopqrstuijklefgh`abcd[\]^_VWXYZPQRSTUIJKLMNOBCDEFGH                    UBCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw                     nNone!"$*,2:<=DLOT[b 6 7 8 9 : ; < = > 6 ; 9 7 8 : < = 6 7 8 9 : ; < = 6 7 8 9 : ; < = >oNone!"$*,2:<=DLOST[b @ A B C @ A B C @ B C A @ A B CpNone!"$*,2:<=DLOT[b D E D E D E D EqNone!"$*,2:<=DLOT[b U!This function is to be used over  ideReadFilez when the result is not just passed on to the PureScript parser, but also needs to be treated as lines of text. Because  ideReadFile! reads the file as ByteString in  BinaryMode rather than TextMode{ line endings get mangled on Windows otherwise. This is irrelevant for parsing, because the Lexer strips these additional r's. F G H I J K L M N O P Q R S T U @ A B C F G H I J K L M N O P Q R S T U F I O P J M N G H K L Q R S T U F G H I J K L M N O P Q R S T UrNone!"$*,2:<=DLOST[b V W  V W V W  V W sNone!"$*,2:<=DILOT[b YOnly keeps the given Modules Z7Only keeps Identifiers that start with the given prefix [:Only keeps Identifiers that are equal to the search string X Y Z [ \ ] X Y Z [ \ X Y Z [ \ X Y Z [ \ ]tNone!"$*,29:;<=DILOT[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 _ ` a b _ ` a _ a ` _ ` a buNone!"$*,2:<=DLOT[b dApplies the CompletionFilters and the Matcher to the given Modules and sorts the found Completions according to the Matching Score d e  d e d e d e vNone!"$*,2:<=DLOT[b fBContains the module with resolved reexports, and possible failures jTUses the passed formatter to format the resolved module, and adds possible failures k%Whether any Refs couldn't be resolved lqResolves Reexports for the given Modules, by looking up the reexported values from the passed in DeclarationRefs f g h i j!Formatter for the resolved resultThe Result to be pretty printed k lthe references to resolve1Modules to search for the reexported declarations m  f g h i j k l m l j k f g h i m f g h i j k l m wNone!"$*,2:<=DLOT[b r-Extracts AST information from a parsed module s;Extracts type annotations for functions from a given Module tuGiven a surrounding Sourcespan and a Declaration from the PS AST, extracts definition sites inside that Declaration. q r s tThe surrounding span%The declaration to extract spans from'Declarations and their source locations q r s t q r t s q r s txNone!"#$*,2:<=DLOST[b uResets all State inside psc-ide vGets the loaded Modulenames wGets all loaded ExternFiles x(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 compiler yChecks if the given ModuleName matches the last rebuild cache and if it does returns all loaded definitions + the definitions inside the rebuild cache zAdds 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. {STM version of insertExterns |+Sets rebuild cache to the given ExternsFile Retrieves the rebuild cache }*Extracts source spans from the parsed ASTs STM version of populateStage2 ~HResolves reexports and populates Stage3 with data to be used in queries. STM version of populateStage3 RLooks up the types and kinds for operators and assigns them to their declarations u v w x   y z { |  }  ~      u v w x y z { | } ~  v w u | z x { y } ~   u v w x   y z { |  }  ~     yNone!"$*,2:<=DLOT[b /Constructs Patterns to insert into a sourcefile     Current lineBegin of the splitEnd of the split%Whether to explicitly type the splitsConstructors to split            zNone!"$*,2:<=DLOT[b 3Rebuild the specified file using the loaded externs 3Rebuild the specified file using the loaded externs* ' *     {None!"$*,2:<=DLOT[b  ImportParseD holds the data we extract out of a partial parse of the sourcefile the module name we parse dthe beginning of the import section. If `import Prelude` was the first import, this would point at i the end of the import section !the extracted import declarations Reads a file and returns the parsed modulename as well as the parsed imports, while ignoring eventual parse errors that aren't relevant to the import section bReads a file and returns the (lines before the imports, the imports, the lines after the imports) Adds 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               |None!"$*,2:<=DLOST[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. ' ( ) * + The file to rebuild/A runner for the second build with open exports ! " # $ % &   ' ( ) * + ! " # $ % &}None!"$*,2:<=DLOST[b eAccepts 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. / 0 1 2 3 4 5 6 , - . 7 8   / 0 1 2 3 4 5 6 , - . 7 8~None!"$*,2:<=DLOST[b 9kReloads 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 9    9 None!"$*,2:<=DLOT[b "Pretty print a module's signatures    None!"$*,2:<=DLOT[b Valid Meta-commands for PSCI A purescript expression &Show the help (ie, list of directives) "Import a module from a loaded file Browse a module  Exit PSCI +Reload all the imported modules of the REPL Clear the state of the REPL 7Add some declarations to the current evaluation context Find the type of an expression Find the kind of an expression 5Shows information about the current state of the REPL Paste multiple lines OAll 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:<=DLOT[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:<=DLOT[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. ? @ A B C D E  : < F G H I J K L M N O = > P Q R S T   ? @ A B C D E  : < F G H I J K L M N O = > P Q R S TNone!"$*,2:<=DLOT[b  The guide URL The help message. The welcome prologue. The quit message.                        None!"$*,2:<=DLOT[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:<=DLOT[b <Parses PSCI metacommands or expressions input from the user. U,Parses expressions entered at the PSCI repl. VeImports must be handled separately from other declarations, so that :show import works, for example. W[Any declaration that we don't need a 'special case' parser for (like import declarations). XTo show error message when 'let'7 is used for declaration in PSCI, which is deprecated. Y Z [ \ ] ^ U V W _ ` a X   Y Z [ \ ] ^ U V W _ ` a XNone!"$*,2:<=DLOT[b bPretty-print errors !&This is different than the runMake in bD in that it specifies the options and ignores the warning messages. cARebuild 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 dReload the application state eClear the application state fATakes a value expression and evaluates it with the current state. gTakes a list of declarations and updates the environment, then run a make. If the declaration fails, restore the original environment. h#Show actual loaded modules in psci. i"Show the imported modules in psci. j:Imports a module, preserving the initial state on failure. k!Takes a value and prints its type l Takes a type and prints its kind m*Browse a module and displays its signature b ! c " # evaluate JSreloadprint into console d e f g h i j k l mJCD                  ! " # # " ! b ! c " # d e f g h i j k l mNone!"$*,2:<=DLOT[b *6An error that probably indicates a bug in this module. 1*An error that should be fixed by the user. CRAn error which meant that it was not possible to retrieve metadata for a package.< n o p q r s t $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I u v w x y z { J | } ~  K L( $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D F E G H I J K( C D E F = > ? @ A B 1 2 3 4 5 6 7 8 9 : ; < * + , $ % & - . / 0 ' ( ) G H I K J n o p q r s t $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I u v w x y z { J | } ~  K LNone!"$*,2:<=DILOT[b .Listed in package manifest, but not installed. 6In the resolutions file, there was no _resolution key. 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"). ZWHow 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 -Given a git tag, get the time it was created. 5Check if a string is a valid SPDX license expression. Extracts all dependencies and their versions from a "resolutions" file, which is based on the output of `bower list --json --offline` EExtracts only the top level dependency names from a resolutions file.- W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k _ e ^ W ` a b c d X Y Z [ \ ] g h i j f k!   W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l                                           ! " # $ % & ' ( ) * +,,-./0123456789:;<=>?@ABCDEFGHIJJKLMNNOPQRSTUVWXYZ[\]^_`abccdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~x8      !"#$%&'()*+,-./0123456789: ; < =!>!?!?!@!8!A!B!C!D!I"E"F"F"G"H"I"J"K"L"M"N"O"P"Q"R#S#T#U#V#W#X#Y#Z#[#\#]#^#_#`#a#b#c#c#d#e#f#f#g#h#i#j#k#l#m#m#n#o#p#q#r#s#t#u#v#w#x#y#z#{#|#}#~################################################$$$$$$$$$$$$$$$$$$$x$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$?$?$0$0$$$$$$$$$$$5$$$$$$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$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${$|$}$~$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$I$$D$$$$$%%&&&&&&&&&&&&''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/f0g1h1h11i1i1j1j1k1k1l1m1n11o1p1q1r1s1t1u1v1w1x1y1z1{1|1}1~11112234555555556789999::::::::::;;;;;;;;;;<<<===========================================================================>??@@@@@@@@@@@@@ABBBBCCCCC C C C C C CCCCCCCCCCCCCCCCCC CCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9D:D;E<E=E>E?F@FAGBHCIDIEIFIGIHIIIJIKILIMINIOIPIQIRISITIUIVIWIXIYIZI[I\I]I^I_I`IaIbIcIcIdIeIfIgIhIhIiIjIkIlImImInIoIpIqIqIrIsItIuIvIwIxIyIzI{I|I}I~IIIIIIIIIIIIJJKKKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMNNNNNNOOOPPPPPPPPPPQRRRSTTUUUVWXYZZZZZZZZZZZ[\\\\\\\]]^_```````````aaaaaaaaaaaa a a a a aaaaaaaaaaaaaaaaaaa a!a"a#a$b%c&c'c(c)c*c+c+c,c-c.c/c/c0c1c2c3c4c5c6cc7c8c9c:c;c<c=c>c?c@cAcBcBcCcDcDcEcFcGcHcIcJcJcKcLcMcNcOccccccPccccQcRcScTcUc?c?cVcWcXcYcZc[c\c]c]c^c^c_c`cacbcccdcecfcgchcicjckclcmcncocpcqcrcsctcucvcwcxcyczc{c|c}c~cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccIcccccccccccccccccccdddeffffghiiiii i i i i iiiijjjjjjjjjjjjjjjjjj j!j"j#j$j%j&k'k(k)k*k+k,k-k.l/l/l0l1l2l2l3l4ll5l6l8l7lll8l9l:l:l;l<l=l>l?l@lAlBlClDlElFlGlHlIlJlKlLlMlNlOlPlQmRmRmSmTmUmVmWmXmXmYmZm[m\m]m^m^m_m`mambmcmcmdmemfmgmgmhmimjmkmkmlmmmnmomompmqmrmrmsmtmumvmwmxmymzm{m|m}m~mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm^mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m !m "m #m $m %m &m 'm (m )m *m +m ,m -m .m /m 0n 1n 2n 3nn 4n 5n 6n 7n 8n 9oo :o ;o <p =p >q ?q @q Aq Bq Cq Dq Eq Fq Gq Hq Iq Jq Kq Lq Mq Nr Or Ps Qs Rs Ss Ts Us Vs Wt Xt Yt Zt [t \u ]u ^v _v _v `v av bv cv dv ev fv gv hww iw jw kx lx mx nx ox px qx rx sx tx ux vx wx xy yy zy {y |y }y ~z z zz z z z z z z zz z z z z z z z z z z zz z z z z z z z z z z z z z z z z z z z z { { { { { { { { { { { { { { { | | | } ~                                                 2               ! " # $ % & ' ( )8   * + , - . / 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  {  |  }  ~             ' { z   ?         ?                     % % % % * *[*\*]*^*a*b*h*i*j*k*l*c*d*e*f*g*p*m*o*q* * * * * * * * * * * * * * * * + .  / / / / / / / / 0 0 0 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 4 9 9 9 9 9 9 9 9 9 9 9 9 9 : : : : : : : :: : : : : : : : : :: : : ; ; ; ; ; ; ;; ; ; ; ; ; ; ; ; ; ; < < < < < < < < < < < > > > > > > > >  > !> "> #>> $? %? @ &@ '@ (@ )@ *@ +@ ,@ -@ .@ /@ 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@ [@ \B ]B ^B _B `B aB bB cB dB eB fC gC hC iC jC kC lC mD nE oF pF qF rF sF tJ uJ vK w x>K yK zK {K |K }K ~K K K M M M M M M M M M M O P Q Q Q Q Q Q Q Q Q R R R R R R R R S U U U UU U U UUU V V V V V V X X X X X X X X X X Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z [ [ [ [ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ ] ] ] ] ] ] ] ] ] ] ] ^ ^ ^ ^ ^ ^ ^ ^^^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^         a a ! "  #d $d %d &d 'd (d )d *d +d ,d -d d .d /d $d 0d 1d 2d 3d 4d 5d 6d 7d 8d 9d :d ;dd <e =e >e ?e @e ?e Ae Be Ce De Ee Fe Gf Hf If Jf Kf Lf !f Mg Ng Og Pg Qh Rh Shyh Th Uh Vhzh{hh Wh Xh h Yh Zh [h \h{h ]h Bh ^h _h `h aj bj cj dj ej fj gj hj ij jj kj lk mk mk nk ok pk qk rkk sk tk un vn wp xp yq zr {r |r }r ~r r r r r r r s?s Qs s s s t Xt t t t t t t t u?u v x x x x x x x x x x x x x x y yyy y y y y y y y y { { { { { { { { { { { { | | || | | | | | | | | } } } } } } } } } } } |} } ~                                 9    ! " # $ % & '(purescript-0.11.4-HDftrROOdFbH3T3cz6jZNg(Language.PureScript.Publish.BoxesHelpersSystem.IO.UTF8Language.PureScript.Traversals!Language.PureScript.Publish.Utils Language.PureScript.Parser.StateLanguage.PureScript.PSStringLanguage.PureScript.OptionsLanguage.PureScript.Label"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.Common Language.PureScript.Parser.KindsLanguage.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.TraversalsLanguage.PureScript.CoreImp.AST,Language.PureScript.CoreImp.Optimizer.Blocks,Language.PureScript.CoreImp.Optimizer.Common-Language.PureScript.CoreImp.Optimizer.Inliner-Language.PureScript.CoreImp.Optimizer.MagicDo)Language.PureScript.CoreImp.Optimizer.TCO,Language.PureScript.CoreImp.Optimizer.Unused%Language.PureScript.CoreImp.Optimizer+Language.PureScript.Docs.RenderedCode.Types0Language.PureScript.Docs.RenderedCode.RenderKind!Language.PureScript.Pretty.Common&Language.PureScript.CodeGen.JS.Printer Language.PureScript.Pretty.Kinds$Language.PureScript.Sugar.LetPattern*Language.PureScript.Sugar.Operators.Common+Language.PureScript.Sugar.Operators.Binders(Language.PureScript.Sugar.Operators.Expr)Language.PureScript.Sugar.Operators.Types Language.PureScript.Parser.Types Language.PureScript.Pretty.Types0Language.PureScript.Docs.RenderedCode.RenderType!Language.PureScript.Pretty.ValuesLanguage.PureScript.Errors%Language.PureScript.Linter.Exhaustive&Language.PureScript.ModuleDependencies'Language.PureScript.Parser.Declarations&Language.PureScript.Sugar.Names.Common'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.PureScriptLanguage.PureScript.Docs.Types*Language.PureScript.Docs.Convert.ReExports'Language.PureScript.Docs.Convert.Single Language.PureScript.Docs.Convert'Language.PureScript.Docs.ParseInPackageLanguage.PureScript.Docs.PrimLanguage.PureScript.Docs.RenderLanguage.PureScript.Docs.AsHtml#Language.PureScript.Docs.AsMarkdownLanguage.PureScript.Errors.JSONLanguage.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.CoreImp%Language.PureScript.Docs.RenderedCodeLanguage.PureScript.PrettyText.Parsec.ErrorshowErrorMessagesLanguage.PureScript.ParserAxLanguage.PureScript.CoreFnLanguage.PureScript.CodeGenLanguage.PureScript.Docs!boxes-0.1.4-ydFzVDNbCb4CfN035tEOsText.PrettyPrint.BoxesnullBoxBox readUTF8FileTwriteUTF8FileT readUTF8File writeUTF8FilefstMsndMthirdMpairMmaybeMeitherMdefS globRelativepurescriptSourceFileswidth indentWidthparaindentedsuccessivelyIndentedvcatspacer bulletedList bulletedListT printToStderr printToStdout ParseStateindentationLevel$fShowParseStatePSStringtoUTF16CodeUnitsdecodeStringWithReplacementdecodeStringEitherprettyPrintString decodeStringprettyPrintStringJSmkString$fFromJSONPSString$fToJSONPSString$fIsStringPSString$fShowPSString$fNFDataPSString $fEqPSString $fOrdPSString$fMonoidPSString$fGenericPSStringOptionsoptionsVerboseErrorsoptionsNoCommentsoptionsSourceMapsoptionsDumpCoreFndefaultOptions $fShowOptionsLabelrunLabel $fNFDataLabel $fShowLabel $fEqLabel $fOrdLabel$fIsStringLabel $fMonoidLabel $fToJSONLabel$fFromJSONLabel$fGenericLabelfindNodeProcessgetHistoryFilename mintersperse HasCallStack internalErrorComment LineComment BlockComment $fShowComment $fEqComment $fOrdComment$fFromJSONComment$fToJSONComment TokenParserPositionedToken ptSourcePosptEndPos ptPrevEndPosptToken ptCommentsTokenlex lexLenientanyTokentokenmatchlparenrparenparenslbracerbracebraceslsquarersquaresquaresindentindentAtlarrowrarrow 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$fNFDataSourceSpan$fFromJSONSourcePos$fToJSONSourcePos$fNFDataSourcePos$fShowSourcePos $fEqSourcePos$fOrdSourcePos$fGenericSourcePos$fShowSourceSpan$fEqSourceSpan$fOrdSourceSpan$fGenericSourceSpanFixity AssociativityInfixlInfixrInfix Precedence showAssoc readAssoc$fToJSONFixity$fNFDataFixity$fFromJSONAssociativity$fToJSONAssociativity$fNFDataAssociativity$fShowAssociativity$fEqAssociativity$fOrdAssociativity$fGenericAssociativity $fShowFixity $fEqFixity $fOrdFixity$fGenericFixityLiteralNumericLiteral 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$fNFDataQualified$fNFDataModuleName$fFromJSONProperName$fToJSONProperName$fNFDataProperName$fFromJSONOpName$fToJSONOpName$fNFDataOpName $fNFDataIdent $fNFDataName $fShowIdent $fEqIdent $fOrdIdent$fGenericIdent $fShowOpName $fEqOpName $fOrdOpName$fGenericOpName$fShowProperName$fEqProperName$fOrdProperName$fGenericProperName$fShowModuleName$fEqModuleName$fOrdModuleName$fGenericModuleName$fEqName $fOrdName $fShowName $fGenericName$fShowQualified $fEqQualified$fOrdQualified$fFunctorQualified$fGenericQualified$fFromJSONQualified$fToJSONQualified$fFromJSONIdent $fToJSONIdent$fFromJSONModuleName$fToJSONModuleNamemoduleNameToJs identToJs properToJsidentNeedsEscapingidentCharToTextnameIsJsReservednameIsJsBuiltIn jsAnyReserved jsKeywordsjsSometimesReservedjsFutureReservedjsFutureReservedStrict jsOldReserved jsLiterals ControlBindRowConsUnionWarnFailPartialPrim AppendSymbol CompareSymbolTypeDataSymbolIsSymbol DataSymbolDiscard$apply# applyFlipped<>++append>>=binddiscard+add-sub*mul/div%mod<lessThan> greaterThan<= lessThanOrEq>=greaterThanOrEq==eq/=notEqcompare&&conj||disj unsafeIndexorandxor<<<compose>>>composeFlippedmapnegatenotshlshrzshr complementzeroonebottomtopreturnpure' returnEscapeduntilEwhileErunST stRefValuenewSTRef readSTRef writeSTRef modifySTRefmkFnrunFnunit undefinedmonadEffDictionaryapplicativeEffDictionarybindEffDictionarydiscardUnitDictionarysemiringNumber semiringInt ringNumberringIntmoduloSemiringNumbermoduloSemiringInteuclideanRingNumbereuclideanRingInt ordBoolean ordNumberordInt ordStringordChareqNumbereqInteqStringeqChar eqBooleanboundedBooleanbooleanAlgebraBooleanheytingAlgebraBooleansemigroupStringsemigroupoidFngenerictoSpine fromSpine toSignaturetypeDataOrdering orderingLT orderingEQ orderingGTmainpartialtyp__unusedprimprelude dataArrayeffstcontrolApplicativecontrolSemigroupoid controlBind dataBounded dataSemigroupdataHeytingAlgebradataEqdataOrd dataSemiringdataRingdataEuclideanRing dataFunctiondataFunctionUncurried dataIntBits partialUnsafe unsafePartialBinder NullBinder LiteralBinder VarBinderConstructorBinder NamedBinderextractBinderAnn $fShowBinder$fFunctorBinderCaseAlternativecaseAlternativeBinderscaseAlternativeResultGuardBindNonRecRecExpr ConstructorAccessor ObjectUpdateAbsAppVarCaseLet extractAnn modifyAnn$fFunctorCaseAlternative$fShowCaseAlternative $fShowExpr $fFunctorExpr $fShowBind $fFunctorBindeverywhereOnValueseverythingOnValuesConstructorType ProductTypeSumTypeMeta IsConstructor IsNewtypeIsTypeClassConstructor IsForeign$fShowConstructorType$fEqConstructorType$fOrdConstructorType $fShowMeta$fEqMeta $fOrdMetaKindKUnknownRowFunKind NamedKind kindFromJSONeverywhereOnKindseverywhereOnKindsMeverythingOnKinds$fFromJSONKind $fToJSONKind $fNFDataKind $fShowKind$fEqKind $fOrdKind $fGenericKind properNametypeNamekindNamedataConstructorNameparseQualified parseIdent parseLabel parseOperatoraugmentfoldbuildPostfixParsermarkcheckIndentationsame readCommentsrunTokenParser toSourcePoswithSourceSpan parseKind ConstraintconstraintClassconstraintArgsconstraintDataConstraintDataPartialConstraintDataTypeTUnknownTypeVarTypeLevelString TypeWildcardTypeConstructorTypeOpTypeAppForAllConstrainedTypeSkolemREmptyRCons KindedTypePrettyPrintFunctionPrettyPrintObjectPrettyPrintForAllBinaryNoParensType ParensInType SkolemScoperunSkolemScopemapConstraintArgsoverConstraintArgs$fNFDataConstraint$fNFDataConstraintData $fNFDataType$fNFDataSkolemScope$fShowSkolemScope$fEqSkolemScope$fOrdSkolemScope$fToJSONSkolemScope$fFromJSONSkolemScope$fGenericSkolemScope$fShowConstraintData$fEqConstraintData$fOrdConstraintData$fGenericConstraintData$fShowConstraint$fEqConstraint$fOrdConstraint$fGenericConstraint $fShowType$fEqType $fOrdType $fGenericType$fFromJSONType $fToJSONType$fFromJSONConstraint$fToJSONConstraint rowToListrowToSortedList rowFromList isMonoTypemkForAllreplaceTypeVarsreplaceAllTypeVarsusedTypeVariablesfreeTypeVariablesquantifymoveQuantifiersToFrontcontainsWildcardseverywhereOnTypeseverywhereOnTypesTopDowneverywhereOnTypesMeverywhereOnTypesTopDownMeverythingOnTypeseverythingWithContextOnTypes$fFromJSONConstraintData$fToJSONConstraintDataOpBinderBinaryNoParensBinderParensInBinderPositionedBinder TypedBinder binderNames isIrrefutable $fEqBinder $fOrdBinderAnnnullAnnremoveComments ForeignDeclModulemoduleComments moduleImports moduleExports moduleForeign moduleDecls NamedDictTypeClassDictionaryInScopetcdValuetcdPath tcdClassNametcdInstanceTypestcdDependenciessuperclassName"$fNFDataTypeClassDictionaryInScope $fShowTypeClassDictionaryInScope#$fFunctorTypeClassDictionaryInScope$$fFoldableTypeClassDictionaryInScope'$fTraversableTypeClassDictionaryInScope#$fGenericTypeClassDictionaryInScope DataDeclTypeDataNewtypeTypeKindDataType TypeSynonym ExternDataLocalTypeVariable ScopedTypeVarNameKindPrivatePublicExternalNameVisibility UndefinedDefinedFunctionalDependency fdDeterminers fdDetermined TypeClassDatatypeClassArgumentstypeClassMemberstypeClassSuperclassestypeClassDependenciestypeClassDeterminedArgumentstypeClassCoveringSets EnvironmentnamestypesdataConstructors typeSynonymstypeClassDictionaries typeClasseskindsinitEnvironmentmakeTypeClassDatashowDataDeclTypeprimNameprimKindkindType kindSymbolprimTy tyFunctiontyStringtyChartyNumbertyInt tyBooleantyArraytyRecordisObject isFunctionisTypeOrAppliedfunction primKinds primTypes primClasseslookupConstructorisNewtypeConstructor lookupValue$fFromJSONDataDeclType$fToJSONDataDeclType$fNFDataDataDeclType$fFromJSONTypeKind$fToJSONTypeKind$fNFDataTypeKind$fNFDataNameKind$fNFDataNameVisibility$fToJSONFunctionalDependency$fFromJSONFunctionalDependency$fNFDataFunctionalDependency$fNFDataTypeClassData$fNFDataEnvironment$fShowFunctionalDependency$fGenericFunctionalDependency$fShowTypeClassData$fGenericTypeClassData$fShowNameVisibility$fEqNameVisibility$fGenericNameVisibility$fShowNameKind $fEqNameKind$fGenericNameKind$fShowTypeKind $fEqTypeKind$fGenericTypeKind$fShowDataDeclType$fEqDataDeclType$fOrdDataDeclType$fGenericDataDeclType$fShowEnvironment$fGenericEnvironment AssocList runAssocListPathNodeLeafBranchPathTreeDoNotationElementDoNotationValueDoNotationBind DoNotationLetPositionedDoNotationElement UnaryMinusBinaryNoParensParensObjectUpdateNestedOp IfThenElse TypedValueDo!TypeClassDictionaryConstructorAppTypeClassDictionaryTypeClassDictionaryAccessorDeferredDictionaryAnonymousArgumentHolePositionedValue GuardedExprConditionGuard PatternGuardTypeInstanceBodyDerivedInstanceNewtypeInstanceNewtypeInstanceWithDictionaryExplicitInstance TypeFixity ValueFixity DeclarationDataDeclarationDataBindingGroupDeclarationTypeSynonymDeclarationTypeDeclarationValueDeclarationBoundValueDeclarationBindingGroupDeclarationExternDeclarationExternDataDeclarationExternKindDeclarationFixityDeclarationImportDeclarationTypeClassDeclarationTypeInstanceDeclarationPositionedDeclarationImportDeclarationTypeImplicitExplicitHidingDeclarationRefTypeRef TypeOpRefValueRef ValueOpRef TypeClassRefTypeInstanceRef ModuleRefKindRef ReExportRefPositionedDeclarationRef HintCategoryExprHintKindHint CheckHint PositionHint SolverHint OtherHintErrorMessageHintErrorUnifyingTypesErrorInExpressionErrorInInstanceErrorInSubsumptionErrorCheckingAccessorErrorCheckingTypeErrorCheckingKindErrorCheckingGuardErrorInferringTypeErrorInApplicationErrorInDataConstructorErrorInTypeConstructorErrorInBindingGroupErrorInDataBindingGroupErrorInTypeSynonymErrorInValueDeclarationErrorInTypeDeclarationErrorInTypeClassDeclarationErrorInForeignImportErrorSolvingConstraintPositionedErrorSimpleErrorMessageModuleNotFoundErrorParsingFFIModuleErrorParsingModuleMissingFFIModuleMultipleFFIModulesUnnecessaryFFIModuleMissingFFIImplementationsUnusedFFIImplementationsInvalidFFIIdentifierCannotGetFileInfoCannotReadFileCannotWriteFile InfiniteType InfiniteKindMultipleValueOpFixitiesMultipleTypeOpFixitiesOrphanTypeDeclarationRedefinedIdentOverlappingNamesInLet UnknownName UnknownImportUnknownImportDataConstructor UnknownExportUnknownExportDataConstructor ScopeConflictScopeShadowing DeclConflictExportConflictDuplicateModuleDuplicateTypeArgument InvalidDoBind InvalidDoLetCycleInDeclarationCycleInTypeSynonymCycleInModulesNameIsUndefinedUndefinedTypeVariablePartiallyAppliedSynonym EscapedSkolemTypesDoNotUnifyKindsDoNotUnifyConstrainedTypeUnifiedOverlappingInstancesNoInstanceFoundAmbiguousTypeVariables UnknownClassPossiblyInfiniteInstance CannotDeriveInvalidDerivedInstanceExpectedTypeConstructorInvalidNewtypeInstanceCannotFindDerivingTypeDuplicateLabelDuplicateValueDeclarationArgListLengthsDifferOverlappingArgNamesMissingClassMemberExtraneousClassMember ExpectedTypeIncorrectConstructorArityExprDoesNotHaveTypePropertyIsMissingAdditionalPropertyTypeSynonymInstanceOrphanInstanceInvalidNewtypeInvalidInstanceHeadTransitiveExportErrorTransitiveDctorExportError ShadowedNameShadowedTypeVar UnusedTypeVarWildcardInferredTypeHoleInferredTypeMissingTypeDeclarationOverlappingPatternIncompleteExhaustivityCheckMisleadingEmptyTypeImportImportHidingModule UnusedImportUnusedExplicitImportUnusedDctorImportUnusedDctorExplicitImportDuplicateSelectiveImportDuplicateImportDuplicateImportRefDuplicateExportRef IntOutOfRangeImplicitQualifiedImportImplicitImport HidingImportCaseBinderLengthDiffersIncorrectAnonymousArgumentInvalidOperatorInBinder!CannotGeneralizeRecursiveFunctionCannotDeriveNewtypeForDataExpectedWildcardCannotUseBindWithDoClassInstanceArityMismatchUserDefinedWarningUnusableDeclaration TypeSearchTSBeforeTSAftertsAfterIdentifierstsAfterRecordFieldsContext MkUnguardedTypeFixityDeclarationValueFixityDeclarationonTypeSearchTypesonTypeSearchTypesM 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$fShowAssocList $fEqAssocList$fOrdAssocList$fFoldableAssocList$fFunctorAssocList$fTraversableAssocList$fShowPathTree $fEqPathTree $fOrdPathTree$fFunctorPathTree$fFoldablePathTree$fTraversablePathTree$fShowPathNode $fEqPathNode $fOrdPathNode$fFunctorPathNode$fFoldablePathNode$fTraversablePathNode$fShowDoNotationElement$fShowDeclaration$fShowGuardedExpr $fShowGuard$fShowTypeInstanceBody$fShowErrorMessageHint$fShowSimpleErrorMessage$fFromJSONDeclarationRef$fToJSONDeclarationRef isTrueExpr$fFromJSONImportDeclarationType$fToJSONImportDeclarationTypeexportedDeclarations isExported guardedExprMmapGuardedExpreverywhereOnValuesTopDownMeverywhereOnValuesMeverythingWithContextOnValueseverywhereWithContextOnValuesMeverythingWithScope accumTypes accumKinds overTypesASTUnaryBinaryIndexerFunctionBlockVariableIntroduction AssignmentWhileForForInIfElseReturnReturnNoResultThrow InstanceOfBinaryOperatorAddSubtractMultiplyDivideModulusEqualTo NotEqualToLessThanLessThanOrEqualTo GreaterThanGreaterThanOrEqualToAndOr BitwiseAnd BitwiseOr BitwiseXor ShiftLeft ShiftRightZeroFillShiftRight UnaryOperatorNegateNot BitwiseNotPositiveNew getSourceSpan everywhereeverywhereTopDowneverywhereTopDownM everything$fShowUnaryOperator$fEqUnaryOperator$fShowBinaryOperator$fEqBinaryOperator $fShowAST$fEqASTcollapseNestedBlockscollapseNestedIfsapplyAll replaceIdent replaceIdents isReassigned isReboundisUsedtargetVariable isUpdatedremoveFromBlockisDictisDict' etaConvertunThunk evaluateIifesinlineVariablesinlineCommonValuesinlineCommonOperatorsinlineFnCompositioninlineUnsafePartialmagicDotcoremoveCodeAfterReturnStatementsremoveUnusedArgremoveUndefinedAppoptimize FixityAlias RenderedCodeRenderedCodeElementSyntaxKeywordSpaceSymbol ValueLevel TypeLevel KindLevelLinkNoLinkContainingModule ThisModule OtherModuleasContainingModulemaybeToContainingModulecontainingModuleToMaybefromContainingModule fromQualifiedasRenderedCodeElementasRenderedCode outputWithspsyntaxkeyword keywordForall keywordDatakeywordNewtype keywordType keywordClasskeywordInstance keywordWhere keywordFixity keywordKind keywordAsidentdataCtortypeCtortypeOptypeVarkindalias aliasName$fToJSONRenderedCode$fToJSONRenderedCodeElement$fFromJSONNamespace$fToJSONNamespace$fNFDataNamespace$fFromJSONLink $fToJSONLink$fFromJSONContainingModule$fToJSONContainingModule$fShowContainingModule$fEqContainingModule$fOrdContainingModule $fShowLink$fEqLink $fOrdLink$fShowNamespace $fEqNamespace$fOrdNamespace$fGenericNamespace$fShowRenderedCodeElement$fEqRenderedCodeElement$fOrdRenderedCodeElement$fShowRenderedCode$fEqRenderedCode$fOrdRenderedCode$fMonoidRenderedCode renderKind PrinterState PlainStringStrPosSMapEmitemit addMappingparensT parensPos intercalaterunPlainString addMapping'bumpPosaddPosemptyPrinterState blockIndent withIndent currentIndentprettyPrintManyobjectKeyRequiresQuotingbeforebeforeWithSpaceendWith$fEmitPlainString $fEmitStrPos$fMonoidStrPos$fMonoidPlainStringprettyPrintJSWithSourceMaps prettyPrintJSprettyPrintKinddesugarLetPatternModuleChaintoAssoc parseValueparseOpmatchOpopTablematchOperatorsmatchBinderOperatorsmatchExprOperatorsmatchTypeOperators parseTypeAtom parseType parsePolyType noWildcardsprettyPrintRow typeAtomAsBoxprettyPrintTypeAtom typeAsBoxsuggestedTypeAsBoxprettyPrintTypeprettyPrintTypeWithUnicodeprettyPrintSuggestedTypeprettyPrintLabelprettyPrintObjectKeyRenderTypeOptionsprettyPrintObjects currentModule renderRow renderTyperenderTypeAtomdefaultRenderTypeOptionsrenderTypeWithOptionsrenderTypeAtomWithOptionsprettyPrintValueprettyPrintBinderAtomprettyPrintBinder 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'parseDeclarationRefparseDeclarationparseLocalDeclarationparseModuleDeclaration parseModuleparseModulesFromFilesparseModuleFromFiletoPositionedError parseBinderparseBinderNoParens parseGuardwarnDuplicateRefscreateBindingGroupsModulecollapseBindingGroupsModulecreateBindingGroupscollapseBindingGroups 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 efFixitiesefTypeFixitiesefDeclarations efSourceSpanapplyExternsFileToEnvironmentmoduleToExternsFile$fShowExternsImport$fShowExternsFixity$fShowExternsTypeFixity$fShowExternsDeclaration$fShowExternsFile$fFromJSONExternsImport$fToJSONExternsImport$fFromJSONExternsFixity$fToJSONExternsFixity$fFromJSONExternsTypeFixity$fToJSONExternsTypeFixity$fFromJSONExternsDeclaration$fToJSONExternsDeclaration$fFromJSONExternsFile$fToJSONExternsFiledesugarImportsWithEnvdesugarSignedLiterals rebracketcheckFixityExportsUnknown CheckStatecheckEnv checkNextType checkNextKindcheckNextSkolemcheckNextSkolemScopecheckCurrentModulecheckSubstitution checkHints Substitution substType substKindemptySubstitutionemptyCheckState bindNames bindTypeswithScopedTypeVarswithErrorMessageHintgetHintsrethrowWithPositionTCwarnAndRethrowWithPositionTCwithTypeClassDictionariesgetTypeClassDictionarieslookupTypeClassDictionariesbindLocalVariablesbindLocalTypeVariablesmakeBindingGroupVisiblewithBindingGroupVisiblepreservingNameslookupVariable getVisibilitycheckVisibilitylookupTypeVariablegetEnvgetLocalContextputEnv modifyEnvrunCheck runCheck' guardWithcaptureSubstitutioncapturingSubstitutionwithFreshSubstitutionwithoutWarningskindOfkindOfWithScopedVarskindsOf kindsOfAllnewSkolemConstantintroduceSkolemScopenewSkolemScope skolemizeskolemizeTypesInValueskolemEscapeCheck SynonymMapreplaceAllTypeSynonymsreplaceAllTypeSynonymsM freshType solveTypesubstituteTypeunknownsInType unifyTypes alignRowsWith unifyRowsreplaceVarWithUnknownreplaceTypeWildcards varIfUnknownsubsumesdesugarCasesModuledesugarCaseGuards desugarCasesdesugarDoModuledesugarObjectConstructors desugarDecldesugarTypeClassestypeClassMemberNamesuperClassDictionaryNamesmoduleToCoreFn moduleToJs moduleToJSONrenameInModules SolverOptionssolverShouldGeneralizesolverDeferErrorsInstanceContextreplaceTypeClassDictionariesentailsnewDictionaries$fShowEvidence $fEqEvidence$fShowEntailsResult 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 LinkLocation SameModule LocalModule DepsModule BuiltinModuleDocLink linkLocation linkTitle linkNamespace LinksContext ctxGithub ctxModuleMapctxResolvedDependenciesctxPackageName ctxVersion ctxVersionTag InPackageFromDep PackageErrorCompilerTooOldErrorInPackageMetaInvalidVersionInvalidDeclarationTypeInvalidChildDeclarationType InvalidFixity InvalidKindInvalidDataDeclType InvalidTime GithubRepo runGithubRepo GithubUser runGithubUserChildDeclarationInfo ChildInstanceChildDataConstructorChildTypeClassMemberChildDeclaration cdeclTitle cdeclCommentscdeclSourceSpan cdeclInfoDeclarationInfoAliasDeclaration declTitle declCommentsdeclSourceSpan declChildrendeclInfomodName modCommentsmodDeclarations modReExports ManifestErrorVerifiedPackageUploadedPackage NotYetKnownPackagepkgMeta pkgVersion pkgVersionTag pkgTagTime pkgModules pkgModuleMappkgResolvedDependencies pkgGithub pkgUploaderpkgCompilerVersion verifyPackage packageNamejsonTimeFormat formatTime parseTimeconvertFundepsToStringsdeclInfoToStringdeclInfoNamespace isTypeClassisValueisType isValueAlias isTypeAliasisKindfilterChildrenchildDeclInfoToStringchildDeclInfoNamespaceisTypeClassMemberisDataConstructor takeLocal takeLocals ignorePackagegetLinkgetLinksContextparseUploadedPackageparseVerifiedPackage asPackageparseTimeEitherasUploadedPackage asNotYetKnownasVerifiedPackagedisplayPackageError asGithubUser asVersion parseVersion'asModule asDeclaration asReExportpOr asInPackageasFixity asFixityAliasparseAssociativityasAssociativityasDeclarationInfoasTypeArgumentsasKindasType asFunDepsasDataDeclTypeasChildDeclarationasChildDeclarationInfo asSourcePos asConstraintasQualifiedProperNameasQualifiedIdent asModuleMapbookmarksAsModuleMapasResolvedDependenciesparsePackageName'mapLeftasGithub asSourceSpanassocListToJSON$fToJSONInPackage$fToJSONGithubRepo$fToJSONGithubUser$fToJSONChildDeclarationInfo$fToJSONDeclarationInfo$fToJSONChildDeclaration$fToJSONDeclaration$fToJSONModule$fToJSONNotYetKnown$fToJSONPackage$fFromJSONGithubUser$fFromJSONPackage$fFromJSONNotYetKnown$fNFDataLinkLocation$fNFDataDocLink$fNFDataLinksContext$fFunctorInPackage$fNFDataInPackage$fNFDataPackageError$fNFDataGithubRepo$fNFDataGithubUser$fNFDataChildDeclarationInfo$fNFDataChildDeclaration$fNFDataDeclarationInfo$fNFDataDeclaration$fNFDataModule$fNFDataNotYetKnown$fNFDataPackage$fShowNotYetKnown$fEqNotYetKnown$fOrdNotYetKnown$fGenericNotYetKnown$fShowDeclarationInfo$fEqDeclarationInfo$fOrdDeclarationInfo$fGenericDeclarationInfo$fShowChildDeclarationInfo$fEqChildDeclarationInfo$fOrdChildDeclarationInfo$fGenericChildDeclarationInfo$fShowChildDeclaration$fEqChildDeclaration$fOrdChildDeclaration$fGenericChildDeclaration$fEqDeclaration$fOrdDeclaration$fGenericDeclaration$fShowGithubUser$fEqGithubUser$fOrdGithubUser$fGenericGithubUser$fShowGithubRepo$fEqGithubRepo$fOrdGithubRepo$fGenericGithubRepo$fShowPackageError$fEqPackageError$fOrdPackageError$fGenericPackageError$fShowInPackage $fEqInPackage$fOrdInPackage$fGenericInPackage $fEqModule $fOrdModule$fGenericModule $fShowPackage $fEqPackage $fOrdPackage$fGenericPackage$fShowLinksContext$fEqLinksContext$fOrdLinksContext$fGenericLinksContext$fShowLinkLocation$fEqLinkLocation$fOrdLinkLocation$fGenericLinkLocation $fShowDocLink $fEqDocLink $fOrdDocLink$fGenericDocLinkupdateReExports$fMonoidTypeClassEnv$fShowTypeClassEnvconvertSingleModuleconvertModulesInPackageconvertModulesInPackageWithEnvconvertModulesconvertModulesWithEnvparseFilesInPackagesprimDocsModulerenderDeclarationrenderDeclarationWithOptionsrenderChildDeclaration!renderChildDeclarationWithOptionsrenderConstraintrenderConstraintWithOptionsrenderConstraintsrenderConstraintsWithOptions notQualifiedident' dataCtor'typeApp toTypeVarHtmlRenderContextcurrentModuleName buildDocLink renderDocLinkrenderSourceLinkHtmlOutputModulehtmlOutputModuleLocalshtmlOutputModuleReExports HtmlOutput htmlIndex htmlModules declNamespacenullRenderContext packageAsHtml moduleAsHtml makeFragmentrenderMarkdown$fShowHtmlOutputModule$fFunctorHtmlOutputModule$fShowHtmlOutput$fFunctorHtmlOutputDocsrenderModulesAsMarkdownmodulesAsMarkdown 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$fToJSONErrorSuggestionIdeTypeOperator_ideTypeOpName_ideTypeOpAlias_ideTypeOpPrecedence_ideTypeOpAssociativity_ideTypeOpKindIdeValueOperator_ideValueOpName_ideValueOpAlias_ideValueOpPrecedence_ideValueOpAssociativity_ideValueOpType IdeInstance_ideInstanceModule_ideInstanceName_ideInstanceTypes_ideInstanceConstraints IdeTypeClass _ideTCName _ideTCKind_ideTCInstancesIdeDataConstructor _ideDtorName_ideDtorTypeName _ideDtorTypeIdeTypeSynonym_ideSynonymName_ideSynonymType_ideSynonymKindIdeType _ideTypeName _ideTypeKindIdeValue_ideValueIdent _ideValueTypeIdeDeclaration IdeDeclValue IdeDeclTypeIdeDeclTypeSynonymIdeDeclDataConstructorIdeDeclTypeClassIdeDeclValueOperatorIdeDeclTypeOperator IdeDeclKind ModuleMap ModuleIdent$fShowIdeValue $fEqIdeValue $fOrdIdeValue $fShowIdeType $fEqIdeType $fOrdIdeType$fShowIdeTypeSynonym$fEqIdeTypeSynonym$fOrdIdeTypeSynonym$fShowIdeDataConstructor$fEqIdeDataConstructor$fOrdIdeDataConstructor$fShowIdeInstance$fEqIdeInstance$fOrdIdeInstance$fShowIdeTypeClass$fEqIdeTypeClass$fOrdIdeTypeClass$fShowIdeValueOperator$fEqIdeValueOperator$fOrdIdeValueOperator$fShowIdeTypeOperator$fEqIdeTypeOperator$fOrdIdeTypeOperator$fShowIdeDeclaration$fEqIdeDeclaration$fOrdIdeDeclaration _IdeDeclValue _IdeDeclType_IdeDeclTypeSynonym_IdeDeclDataConstructor_IdeDeclTypeClass_IdeDeclValueOperator_IdeDeclTypeOperator _IdeDeclKind ideValueIdent ideValueType ideTypeKind ideTypeNameideSynonymKindideSynonymNameideSynonymType ideDtorName ideDtorTypeideDtorTypeNameideTCInstances ideTCKind ideTCNameideInstanceConstraintsideInstanceModuleideInstanceNameideInstanceTypesideValueOpAliasideValueOpAssociativityideValueOpNameideValueOpPrecedenceideValueOpType Annotation _annLocation_annExportedFrom_annTypeAnnotationIdeDeclarationAnn_idaAnnotation_idaDeclarationideTypeOpAliasideTypeOpAssociativity ideTypeOpKind ideTypeOpNameideTypeOpPrecedence$fShowAnnotation$fEqAnnotation$fOrdAnnotation$fShowIdeDeclarationAnn$fEqIdeDeclarationAnn$fOrdIdeDeclarationAnnannExportedFrom annLocationannTypeAnnotationIdeDeclNamespace IdeNSValue IdeNSType IdeNSKindPursuitResponseModuleResponseDeclarationResponsePursuitSearchType Identifier PursuitQuerySuccessCompletionResult TextResultMultilineTextResult PursuitResult ImportList ModuleListRebuildSuccess Completion complModulecomplIdentifier complTypecomplExpandedType complLocationcomplDocumentationMatchStage3s3Declarationss3CachedRebuildStage2 s2AstDataStage1 s1Externs s1ModulesIdeState ideStage1 ideStage2 ideStage3IdeIdeEnvironment ideStateVarideConfiguration ConfigurationconfOutputPath confLogLevel confGlobs IdeLogLevelLogDebugLogPerfLogAll LogDefaultLogNoneAstDataTypeAnnotationsDefinitionSites idaAnnotationidaDeclarationemptyAnn emptyIdeState emptyStage1 emptyStage2 emptyStage3identifierFromDeclarationRef encodeSuccess encodeImport$fToJSONPursuitResponse$fFromJSONPursuitResponse$fFromJSONPursuitQuery$fFromJSONPursuitSearchType$fToJSONSuccess$fToJSONCompletion$fShowIdeLogLevel$fEqIdeLogLevel $fShowStage1 $fShowStage3 $fShowMatch $fEqMatch$fFunctorMatch$fShowCompletion$fEqCompletion$fOrdCompletion$fShowPursuitQuery$fEqPursuitQuery$fShowPursuitSearchType$fEqPursuitSearchType$fShowPursuitResponse$fEqPursuitResponse $fShowSuccess$fShowIdeDeclNamespace$fEqIdeDeclNamespace$fOrdIdeDeclNamespace $fShowAstData $fEqAstData $fOrdAstData$fFunctorAstData$fFoldableAstData $fShowStage2 $fEqStage2$fShowIdeStateIdeError GeneralErrorNotFoundModuleFileNotFound ParseError RebuildErrorprettyPrintTypeSingleLine$fToJSONIdeError$fShowIdeError labelTimespeclogPerfdisplayTimeSpecsearchPursuitForDeclarationsfindPackagesForModuleIdentidentifierFromIdeDeclaration discardAnn withEmptyAnn unwrapMatchcompletionFromMatchvalueOperatorAliasTtypeOperatorAliasTencodeTdecodeTunwrapPositionedunwrapPositionedRef properNameTidentTopNameT ideReadFileideReadTextFilereadExternFileconvertExternsFilter moduleFilter prefixFilterequalityFilter applyFilters$fFromJSONFilter$fMonoidFilterMatcher flexMatcher runMatcher$fFromJSONMatcher$fMonoidMatchergetCompletionsgetExactMatchesReexportResult reResolvedreFailedprettyPrintReexportResultreexportHasFailuresresolveReexportsresolveReexports'$fShowReexportResult$fEqReexportResult$fFunctorReexportResultextractAstInformationextractTypeAnnotations extractSpans resetIdeStategetLoadedModulenamesgetExternFiles insertModule getAllModules insertExternsinsertExternsSTM cacheRebuildpopulateStage2populateStage3populateStage3STMresolveInstancesresolveOperatorsForModuleWildcardAnnotationsexplicitAnnotations noAnnotations caseSplit makePattern addClauseListType LoadedModulesAvailableModules ImportCommandAddImplicitImportAddImportForIdentifierCommandLoadLoadSyncCompletePursuit CaseSplit AddClauseImportListRebuild RebuildSyncCwdResetQuit typeFilterstypeCurrentModulecompleteFilterscompleteMatchercompleteCurrentModule pursuitQuerypursuitSearchType caseSplitLinecaseSplitBegin caseSplitEndcaseSplitAnnotations caseSplitType addClauseLineaddClauseAnnotationslistType commandName$fFromJSONCommand$fFromJSONListType$fFromJSONImportCommand$fShowImportCommand$fEqImportCommandparseImportsFromFilesliceImportSectionaddImplicitImportaddImplicitImport'addExplicitImport'addImportForIdentifierprettyPrintImport'prettyPrintImportSection answerRequest parseImport $fOrdImport $fEqImport $fShowImport rebuildFilerebuildFileAsyncrebuildFileSync handleCommandwatchertextTprintModuleSignatures DirectiveHelpReloadClearBrowseShowPaste ReplQuery QueryLoaded QueryImport ExpressionShowHelp BrowseModuleQuitPSCi ReloadState ClearStateDeclsTypeOfKindOfShowInfo PasteLinesImportedModule PSCiStatepsciImportedModulespsciLetBindingspsciLoadedExterns PSCiConfigpsciLoadedFilespsciEnvironmentinitialPSCiStatepsciImportedModuleNames allImportsOfupdateImportedModulesupdateLoadedExterns updateLets replQueriesreplQueryStrings showReplQueryparseReplQuery$fShowPSCiConfig$fShowPSCiState $fEqReplQuery$fShowReplQuery $fShowCommand $fEqDirective$fShowDirective directivesdirectiveStringsdirectiveStrings'strings stringsFor stringFordirectivesFor' directivesFordirectiveStringsForparseDirective hasArgumenthelp CompletionMliftCompletionM completion completion'$fShowCompletionContextguideURL helpMessageprologueMessagenoInputMessagesupportModuleMessage quitMessagesupportModuleNamesupportModuleIsDefined loadModuleloadAllModulescreateTemporaryModulecreateTemporaryModuleForKindcreateTemporaryModuleForImports importDecl indexFile modulesDir parseCommand OtherError ProcessFailedIOExceptionThrown JSONSourceFromFileFromResolutions InternalErrorCouldntParseGitTagDateRepositoryFieldErrorRepositoryFieldMissingBadRepositoryType NotOnGithub UserErrorPackageManifestNotFoundResolutionsFileNotFoundCouldntDecodePackageManifestTagMustBeCheckedOutAmbiguousVersionsBadRepositoryFieldNoLicenseSpecifiedInvalidLicenseMissingDependencies CompileErrorDirtyWorkingTreePackageWarningNoResolvedVersionUndeclaredDependencyUnacceptableVersionDirtyWorkingTree_Warn MissingPath printErrorprintErrorToStdout renderErrorrenderWarnings printWarnings$fMonoidCollectedWarnings$fShowPackageWarning$fShowRepositoryFieldError$fShowUserError$fShowJSONSource$fShowInternalError$fShowOtherError$fShowCollectedWarnings$fEqCollectedWarnings$fOrdCollectedWarningsPrepareMPublishOptionspublishGetVersionpublishGetTagTimepublishWorkingTreeDirtydefaultPublishOptionsunsafePreparePackagepreparePackage runPrepareMwarn userError otherErrorpreparePackage' getModulesgetGitWorkingTreeStatuscheckCleanWorkingTreegetVersionFromGitTaggetManifestRepositoryInfogetResolvedDependencies$fMonadIOPrepareM$fFunctorPrepareM$fApplicativePrepareM$fMonadPrepareM$fMonadWriterPrepareM$fMonadErrorPrepareM$fShowTreeStatus$fEqTreeStatus$fOrdTreeStatus$fEnumTreeStatus$fShowDependencyStatus$fEqDependencyStatuscatchIObindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName codePointsisLeadisTrail isSurrogatetoChartoWordtoIntmkdirponFirstFileMatchinglangDef tokenParserisUnquotedKeyHeadCharisUnquotedKeyTailCharLexerLParenRParenLBraceRBraceLSquareRSquareIndentLArrowRArrow LFatArrow RFatArrowColon DoubleColonEqualsPipeTickDotCommaSemiAt UnderscoreLNameUName QualifierNumberHoleLitprettyPrintTokenupdatePositions parseTokensparseTokensLenient whitespace parseCommentparsePositionedToken parseTokenvalidModuleName validUNamenotElemT ModuleElement ExportTypeKeycheckImportPathwithDepstoModulecompile isModuleEmptycodeGenRequireMember ExportsListOtherSkip RegularExportForeignReexportshowModuleTypefromStringLiteralstrValue commaListtrailingCommaList matchRequire matchMembermatchExportsAssignment extractLabelbaseGHC.Base parseStar parseBangparseNamedKind parseKindAtom#text-1.2.2.1-9Yh8rJoh8fO2JMLWffT3QsData.Text.InternalTextfilterDataConstructorsfilterInstancestypeInstanceConstituentsisDctorExported shouldInlineopAddopMulopEqopNotEq opLessThanopLessThanOrEq opGreaterThanopGreaterThanOrEqopAppendopSubopNegateopDivopModopConjopDisjopNotinlineSTuntilFixedPointMaybetryAlltryParseunpackFixityAliasRCunRCfirstEqasLink asNamespace typeLiteralsmatchRowfunKindprettyPrintJS'literalsaccessorindexerlamapp instanceOfunary'unarynegateOperatorbinaryprettyStatementsdesugarLetPattern parseFunction parseObjectparseTypeLevelStringparseTypeWildcardparseTypeVariableparseTypeConstructor parseForAllparseConstrainedTypetypeOrConstrainedType parseAnyTypeparseNameAndTypeparseRowEndingparseRowprettyPrintRowWithTypeRenderOptions troSuggesting troUnicodeconstraintsAsBoxconstraintAsBoxappliedFunctionkindedinsertPlaceholders constrainedexplicitParens matchTypeAtom matchTypeforall_suggestingOptionsunicodeOptions typeAsBoxImplprettyPrintType' renderHead renderLabel renderTailconvertconvertForAllspreprocessTypelistprettyPrintValueAtomellipsisprettyPrintObjectprettyPrintUpdateEntryprettyPrintLiteralValueprettyPrintDeclarationprettyPrintCaseAlternativeprettyPrintDoNotationElementprettyPrintLiteralBinderRedundancyError qualifyNamegetConstructors initialize genericMergemissingCasesSinglemissingCasesMultipleisExhaustiveGuard otherwise missingCasescheckExhaustive IncompletemissingAlternative usedModulesparseInfixExprindexersAndAccessors kindedIdentparseDataDeclarationparseTypeDeclarationparseTypeSynonymDeclarationparseValueWithWhereClauseparseValueWithIdentAndBindersparseValueDeclarationparseLocalValueDeclarationparseExternDeclaration parseFixityparseFixityDeclarationparseImportDeclarationparseTypeClassDeclarationparseConstraintparseInstanceDeclarationparseTypeInstanceDeclaration parseDerivingInstanceDeclaration positionedbooleanLiteralparseNumericLiteralparseCharLiteralparseStringLiteralparseBooleanLiteralparseArrayLiteralparseObjectLiteralparseIdentifierAndValueparseAbsparseVarparseConstructor parseCaseparseCaseAlternativeparseIfThenElseparseLetparseValueAtom parseHoleparsePropertyUpdate parseAccessorparseDoparseDoNotationLetparseDoNotationBindparseDoNotationElementparseUpdaterBodyFieldsparseUpdaterBodyparseAnonymousArgumentparseNumberLiteralparseNullaryConstructorBinderparseConstructorBinderparseObjectBinderparseArrayBinderparseVarOrNamedBinderparseNullBinderparseIdentifierAndBinderparseBinderAtomtoBindingGroupcollapseBindingGroupsForValue 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 NoElaboratedesugarGuardedExprs validateCases desugarAbsstripPositioned inSameGrouptoDeclstoTuplemakeCaseDeclaration desugarDoDesugar MemberMap desugarModulememberToNameAndTypetypeClassDictionaryDeclaration#typeClassMemberToDictionaryAccessor!typeInstanceDictionaryDeclarationfindQualModulesimportToCoreFnexternToCoreFnexportToCoreFnmkTypeClassConstructor properToIdent literalToJSON identToJSONproperNameToJSONqualifiedToJSONmoduleNameToJSON bindToJSON recordToJSON exprToJSONcaseAlternativeToJSON binderToJSON RenameState rsBoundNames rsUsedNames runRenamenewScope updateScope lookupIdentfindDeclIdents renameInDecl renameInValuerenameInLiteralrenameInCaseAlternativerenameInBinderRename initState EntailsResultSolvedUnsolvedDeferredMatching TypeClassDictEvidence NamedInstance WarnInstanceIsSymbolInstanceCompareSymbolInstanceAppendSymbolInstance UnionInstance ConsInstancenamedInstanceIdentifier pairwiseAll pairwiseAnycombineContextsmatches mkContext pairwiseMcheckInEnvironment evalWriterT checkSubsumeaccessorSearchSplitBindingGroup_splitBindingGroupUntyped_splitBindingGroupTyped_splitBindingGroupNamestypeDictionaryForBindingGroupcheckTypedBindingGroupElementtypeForBindingGroupElement checkTypeKindinstantiatePolyTypeWithUnknowns inferBinderbinderRequiresMonotypeinstantiateForBinders checkBinderscheckcheck'checkPropertiescheckFunctionApplicationcheckFunctionApplication'ensureNoDuplicatePropertiesinferLetBindingcheckGuardedRhscheckTypeSynonyms typeCheckAll addDataTypeaddDataConstructoraddTypeSynonymvalueIsNotDefinedaddValue addTypeClassaddTypeClassDictionariescheckDuplicateTypeArgumentscheckTypeClassInstancederiveInstanceunwrapTypeConstructorderiveNewtypeInstance dataGenericdataGenericRep dataMaybe typesProxy dataNewtype dataFunctor unguarded deriveGenericderiveGenericRepcheckIsWildcardderiveEq deriveOrd deriveNewtype findTypeDecllamNulllamCaselamCase2mkVarMnmkVar labelToIdent objectType decomposeRec decomposeRec' deriveFunctorNothingghc-prim GHC.TypesIO mtl-2.2.1-6qsR1PHUy5lL47Hpoa4jCMControl.Monad.Error.Class MonadErrorcheckForeignDecls importPrimpure Applicative TypeClassEnvenvUnhandledMembers envValuesenvTypeClasses getReExportscollectDeclarations findImportlookupTypeDeclarationlookupModuleDeclarations handleEnvfilterTypeClassMemberstypeClassConstraintForlookupValueDeclarationlookupValueOpDeclarationlookupTypeOpDeclarationlookupTypeClassDeclarationlookupKindDeclarationhandleTypeClassMembersvalsAndMembersToEnvtypeClassesToEnvsplitMapfilterExportedChildrenallDeclarations|>internalErrorInModuleDeclarationAugmentIntermediateDeclaration AugmentType AugmentClassaugmentDeclarations mkDeclaration AugmentChildgetDeclarationTitlebasicDeclarationconvertDeclarationconvertComments convertSortedtypeCheckIfNecessary typeCheckinsertValueTypespartiallyDesugar runParserFileInfo throwLeftfileInfoToString readFileAslookupPrimClass unsafeLookuplookupPrimTypeKindprimType primClassarrayrecordintstringcharbooleanfailunionrowCons typeConcat typeString declAsHtmlrenderChildren codeAsHtml renderLink fragmentForlinkToDeclaration renderAliasremoveRelativeLinksv withClasspartitionChildrenFirstNotFirstmoduleAsMarkdowndeclAsMarkdown childToStringtell' headerLevel fencedBlockticksencodeRebuildErrors textError queryPursuithandler ideReadFile' ToResolveTypeClassToResolveSynonymToResolveresolveSynonymsresolveTypeClassesfindType findSynonym convertExport convertDeclconvertOperatorconvertTypeOperatormkFilter moduleFilter' identFilter runFilter ScoredMatchdistanceMatcherdistanceMatcher' mkMatchersortCompletions flexMatchflexRate flexScorecompletionsFromModules resolveRefinsertModuleSTM getStage1 getStage1STM getStage2 setStage2STM getStage3 setStage3STM cachedRebuildpopulateStage2STM getStage2STMresolveLocationsresolveLocationsForModuleresolveOperatorsmapIffindTypeDeclarationfindTypeDeclaration'splitTypeConstructor prettyCtorprettyPrintWildcardprettyWildcard parseType'parseTypeDeclaration'splitFunctionType ImportParse ipModuleNameipStartipEnd ipImportsparseImportsFromFile'addExplicitImportcompImportType compImportparseModuleHeaderupdateAtFirstOrPrependMakeActionsEnvrebuildModuleOpen shushProgress shushCodegen sortExternsopenModuleExportsmaeOutputDirectorymaeFilePathMapmaeForeignPathMapmaePrefixCommentfindAvailableExternsfindAllSourceFilesloadModulesAsyncfindCompletionsfindPursuitCompletionsfindPursuitPackages printModulesoutputDirectorylistAvailableModulesloadModulesSync loadModules reloadFilehaskeline-0.7.2.3#System.Console.Haskeline.CompletioncompleteWordWithPrevcompletionContextgetAllQualificationsgetAllImportsOfCompletionContext CtxDirective CtxFilePath CtxModule CtxIdentifierCtxTypeCtxFixedcompleteDirective directiveArgcompleteImport headSatisfiesgetLoadedModulesgetModuleNamesmapLoadedModulesAndQualify getIdentNames getDctorNames getTypeNamesnubOnFst typeDecls identNames dctorNames moduleNamespsciExpression psciImportpsciDeclarationpsciDeprecatedLet parseRest psciCommandtrim trimStarttrimEnddiscardPositionInfo acceptableparseReplQuery' printErrorsrebuildhandleReloadStatehandleClearStatehandleExpression handleDeclshandleShowLoadedModuleshandleShowImportedModules handleImport handleTypeOf handleKindOf handleBrowseCollectedWarningsnoResolvedVersionsundeclaredDependenciesunacceptableVersionsdirtyWorkingTree missingPathsdisplayUserError spdxExamplesdisplayRepositoryErrordisplayInternalErrordisplayJSONSourcedisplayOtherErrorcollectWarningswarnNoResolvedVersionswarnUndeclaredDependencieswarnUnacceptableVersionswarnDirtyWorkingTreewarnMissingPathsMissing NoResolution ResolvedOtherResolvedVersion getTagTime isValidSPDXasToplevelDependenciesDependencyStatus TreeStatusCleanDirty unPrepareM catchLeft checkLicense extractGithub readProcess'asDirectoryAndDependencyStatuswarnUndeclared handleDepstryExtractVersiongetInputAndDepsFiles