@rsconcept/domain 3.1.0 → 3.2.0

package/dist/rslang/parser/syntax-errors/index.js

@@ -1,2 +1 @@
-import { t as extractSyntaxErrors } from "../../../syntax-errors-BN_bqTaX.js";
-export { extractSyntaxErrors };
+export { t as extractSyntaxErrors } from "../../../syntax-errors-WGLQNaNe.js";

package/dist/rslang/semantic/analyzer.d.ts

@@ -1,2 +1,2 @@
-import { a as RSLangAnalyzer, i as AnalysisOptions, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../../analyzer-B35QsI3L.js";
+import { a as RSLangAnalyzer, i as AnalysisOptions, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../../analyzer-BcPMzR38.js";
 export { AnalysisBase, AnalysisFast, AnalysisFull, AnalysisOptions, RSLangAnalyzer };

package/dist/rslang/semantic/analyzer.js

@@ -4,7 +4,7 @@ import { labelType } from "../labels.js";
 import { annotateError } from "../ast-annotations.js";
 import { parseRSLangExpression } from "../api.js";
 import { RSErrorCode } from "../error.js";
-import { t as extractSyntaxErrors } from "../../syntax-errors-BN_bqTaX.js";
+import { t as extractSyntaxErrors } from "../../syntax-errors-WGLQNaNe.js";
 import { getTypeClass } from "./typification-api.js";
 import { TypeAuditor } from "./type-auditor.js";
 import { ValueClass } from "./value-class.js";

package/dist/rslang/semantic/arguments-extractor.js

@@ -186,10 +186,12 @@ var LocalContext = class {
 	pushLocal(node) {
 		const alias = getNodeText(node);
 		const existing = this.data.find((data) => data.alias === alias);
-		if (existing) if (existing.level > 0) return;
-		else {
-			const index = this.data.indexOf(existing);
-			if (index !== -1) this.data.splice(index, 1);
+		if (existing) {
+			if (existing.level > 0) return;
+			else {
+				const index = this.data.indexOf(existing);
+				if (index !== -1) this.data.splice(index, 1);
+			}
 		}
 		this.data.push({
 			alias,

package/dist/rslang/semantic/arguments-extractor.js.map

@@ -1 +1 @@
-{"version":3,"file":"arguments-extractor.js","names":[],"sources":["../../../src/rslang/semantic/arguments-extractor.ts"],"sourcesContent":["/**\n * Module: Type auditor for AST type checking.\n */\n\nimport { type AstNode, getNodeText } from '../../parsing';\nimport { readTypeAnnotation } from '../ast-annotations';\nimport { TokenID } from '../parser/token';\n\nimport { type ExpressionType } from './typification';\n\n/** Represents function argument definition. */\nexport interface ArgumentsType {\n  alias: string;\n  type: ExpressionType | null;\n}\n\n/** Type auditor for AST type checking.\n * Warning! Assumes that the AST is well-formed and annotated with types.\n */\nexport class ArgumentsExtractor {\n  private locals: LocalContext = new LocalContext();\n  private result: ArgumentsType[] = [];\n\n  public run(ast: AstNode): ArgumentsType[] {\n    if (ast.hasError) {\n      return [];\n    }\n    this.result = [];\n    this.locals.clear();\n    this.dispatchVisit(ast);\n    return this.result;\n  }\n\n  private dispatchDeclare(node: AstNode): boolean {\n    return this.processDeclare(node);\n  }\n\n  private processDeclare(node: AstNode): boolean {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node);\n      case TokenID.NT_ENUM_DECL:\n        return this.declareEnumeration(node);\n    }\n    return false;\n  }\n\n  private declareLocal(node: AstNode): boolean {\n    this.locals.pushLocal(node);\n    return true;\n  }\n\n  private declareTuple(node: AstNode): boolean {\n    for (let child = 0; child < node.children.length; child++) {\n      if (!this.visitChildDeclaration(node, child)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private declareEnumeration(node: AstNode): boolean {\n    for (const child of node.children) {\n      if (!this.dispatchDeclare(child)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private dispatchVisit(node: AstNode): boolean {\n    return this.processVisit(node);\n  }\n\n  private processVisit(node: AstNode): boolean {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n      case TokenID.ID_FUNCTION:\n      case TokenID.ID_PREDICATE:\n      case TokenID.ID_RADICAL:\n      case TokenID.LIT_INTEGER:\n      case TokenID.LIT_WHOLE_NUMBERS:\n      case TokenID.LIT_EMPTYSET:\n        return true;\n\n      case TokenID.CARD:\n      case TokenID.FILTER:\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n      case TokenID.LOGIC_AND:\n      case TokenID.LOGIC_OR:\n      case TokenID.LOGIC_IMPLICATION:\n      case TokenID.LOGIC_EQUIVALENT:\n      case TokenID.EQUAL:\n      case TokenID.NOTEQUAL:\n      case TokenID.GREATER:\n      case TokenID.LESSER:\n      case TokenID.GREATER_OR_EQ:\n      case TokenID.LESSER_OR_EQ:\n      case TokenID.SET_IN:\n      case TokenID.SET_NOT_IN:\n      case TokenID.SUBSET:\n      case TokenID.SUBSET_OR_EQ:\n      case TokenID.NOT_SUBSET:\n      case TokenID.DECART:\n      case TokenID.BOOLEAN:\n      case TokenID.BIGPR:\n      case TokenID.SMALLPR:\n      case TokenID.REDUCE:\n      case TokenID.BOOL:\n      case TokenID.DEBOOL:\n      case TokenID.SET_UNION:\n      case TokenID.SET_INTERSECTION:\n      case TokenID.SET_MINUS:\n      case TokenID.SET_SYMMETRIC_MINUS:\n      case TokenID.LOGIC_NOT:\n      case TokenID.NT_TUPLE:\n      case TokenID.NT_ENUMERATION:\n      case TokenID.NT_ARGUMENTS:\n        return this.visitAllAndReturn(node);\n\n      case TokenID.ID_LOCAL:\n        return this.visitLocal(node);\n\n      case TokenID.NT_ARG_DECL:\n        return this.visitArgument(node);\n\n      case TokenID.QUANTOR_UNIVERSAL:\n      case TokenID.QUANTOR_EXISTS:\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitQuantifier(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.visitFunctionDefinition(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ITERATE:\n      case TokenID.ASSIGN:\n        return this.visitIterate(node);\n\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n    }\n    return false;\n  }\n\n  private visitChild(node: AstNode, index: number): boolean {\n    return index < node.children.length && this.dispatchVisit(node.children[index]);\n  }\n\n  private visitChildDeclaration(node: AstNode, index: number): boolean {\n    return index < node.children.length && this.dispatchDeclare(node.children[index]);\n  }\n\n  private visitAllAndReturn(node: AstNode): boolean {\n    for (const child of node.children) {\n      if (!this.dispatchVisit(child)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private visitLocal(node: AstNode): boolean {\n    const alias = getNodeText(node);\n    if (!this.locals.checkLocal(node) && this.result.find(arg => arg.alias === alias) === undefined) {\n      this.result.push({ alias, type: readTypeAnnotation(node) });\n    }\n    return true;\n  }\n\n  private visitFunctionDefinition(node: AstNode): boolean {\n    this.locals.startScope();\n    if (!this.visitChild(node, 0)) {\n      return false;\n    }\n    if (!this.visitChild(node, 1)) {\n      return false;\n    }\n    this.locals.endScope();\n    return true;\n  }\n\n  private visitFunctionCall(node: AstNode): boolean {\n    for (let child = 1; child < node.children.length; child++) {\n      if (!this.visitChild(node, child)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private visitArgument(node: AstNode): boolean {\n    return this.visitChild(node, 1) && this.visitChildDeclaration(node, 0);\n  }\n\n  private visitQuantifier(node: AstNode): boolean {\n    this.locals.startScope();\n\n    if (!this.visitChild(node, 1)) {\n      return false;\n    }\n    if (!this.visitChildDeclaration(node, 0)) {\n      return false;\n    }\n    if (!this.visitChild(node, 2)) {\n      return false;\n    }\n\n    this.locals.endScope();\n    return true;\n  }\n\n  private visitImperative(node: AstNode): boolean {\n    this.locals.startScope();\n\n    for (let child = 1; child < node.children.length; child++) {\n      if (!this.visitChild(node, child)) {\n        return false;\n      }\n    }\n\n    if (!this.visitChild(node, 0)) {\n      return false;\n    }\n\n    this.locals.endScope();\n    return true;\n  }\n\n  private visitIterate(node: AstNode): boolean {\n    return this.visitChild(node, 1) && this.visitChildDeclaration(node, 0);\n  }\n\n  private visitRecursion(node: AstNode): boolean {\n    this.locals.startScope();\n\n    if (!this.visitChild(node, 1)) {\n      return false;\n    }\n    if (!this.visitChildDeclaration(node, 0)) {\n      return false;\n    }\n\n    const isFull = node.typeID === TokenID.NT_RECURSIVE_FULL;\n    const iterationIndex = isFull ? 3 : 2;\n\n    if (!this.visitChild(node, iterationIndex)) {\n      return false;\n    }\n\n    if (isFull) {\n      if (!this.visitChild(node, 2)) {\n        return false;\n      }\n    }\n\n    this.locals.endScope();\n    return true;\n  }\n}\n\n// ========= Internals ========\n\n/** Local variable data. */\ninterface LocalData {\n  alias: string;\n  level: number;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  public data: LocalData[] = [];\n\n  clear(): void {\n    this.data = [];\n  }\n\n  startScope(): void {\n    for (const local of this.data) {\n      if (local.level > 0) {\n        local.level = local.level + 1;\n      }\n    }\n  }\n\n  endScope(): void {\n    for (const local of this.data) {\n      local.level--;\n    }\n  }\n\n  clearUnused(): void {\n    this.data = this.data.filter(data => data.level > 0);\n  }\n\n  pushLocal(node: AstNode) {\n    const alias = getNodeText(node);\n    const existing = this.data.find(data => data.alias === alias);\n    if (existing) {\n      if (existing.level > 0) {\n        return;\n      } else {\n        const index = this.data.indexOf(existing);\n        if (index !== -1) {\n          this.data.splice(index, 1);\n        }\n      }\n    }\n    this.data.push({ alias, level: 1 });\n  }\n\n  checkLocal(node: AstNode): boolean {\n    const alias = getNodeText(node);\n    const local = this.data.find(data => data.alias === alias);\n    return local !== undefined;\n  }\n}\n"],"mappings":";;;;;;;;;;;AAmBA,IAAa,qBAAb,MAAgC;CAC9B,SAA+B,IAAI,aAAa;CAChD,SAAkC,CAAC;CAEnC,IAAW,KAA+B;EACxC,IAAI,IAAI,UACN,OAAO,CAAC;EAEV,KAAK,SAAS,CAAC;EACf,KAAK,OAAO,MAAM;EAClB,KAAK,cAAc,GAAG;EACtB,OAAO,KAAK;CACd;CAEA,gBAAwB,MAAwB;EAC9C,OAAO,KAAK,eAAe,IAAI;CACjC;CAEA,eAAuB,MAAwB;EAC7C,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,IAAI;GAC/B,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,IAAI;GAC/B,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,IAAI;EACvC;EACA,OAAO;CACT;CAEA,aAAqB,MAAwB;EAC3C,KAAK,OAAO,UAAU,IAAI;EAC1B,OAAO;CACT;CAEA,aAAqB,MAAwB;EAC3C,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,sBAAsB,MAAM,KAAK,GACzC,OAAO;EAGX,OAAO;CACT;CAEA,mBAA2B,MAAwB;EACjD,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,gBAAgB,KAAK,GAC7B,OAAO;EAGX,OAAO;CACT;CAEA,cAAsB,MAAwB;EAC5C,OAAO,KAAK,aAAa,IAAI;CAC/B;CAEA,aAAqB,MAAwB;EAC3C,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO;GAET,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,aACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,qBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,oBACX,OAAO,KAAK,wBAAwB,IAAI;GAE1C,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ;GACb,KAAK,QAAQ,QACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;EACnC;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAAwB;EACxD,OAAO,QAAQ,KAAK,SAAS,UAAU,KAAK,cAAc,KAAK,SAAS,MAAM;CAChF;CAEA,sBAA8B,MAAe,OAAwB;EACnE,OAAO,QAAQ,KAAK,SAAS,UAAU,KAAK,gBAAgB,KAAK,SAAS,MAAM;CAClF;CAEA,kBAA0B,MAAwB;EAChD,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,cAAc,KAAK,GAC3B,OAAO;EAGX,OAAO;CACT;CAEA,WAAmB,MAAwB;EACzC,MAAM,QAAQ,YAAY,IAAI;EAC9B,IAAI,CAAC,KAAK,OAAO,WAAW,IAAI,KAAK,KAAK,OAAO,MAAK,QAAO,IAAI,UAAU,KAAK,MAAM,QACpF,KAAK,OAAO,KAAK;GAAE;GAAO,MAAM,mBAAmB,IAAI;EAAE,CAAC;EAE5D,OAAO;CACT;CAEA,wBAAgC,MAAwB;EACtD,KAAK,OAAO,WAAW;EACvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,kBAA0B,MAAwB;EAChD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK,GAC9B,OAAO;EAGX,OAAO;CACT;CAEA,cAAsB,MAAwB;EAC5C,OAAO,KAAK,WAAW,MAAM,CAAC,KAAK,KAAK,sBAAsB,MAAM,CAAC;CACvE;CAEA,gBAAwB,MAAwB;EAC9C,KAAK,OAAO,WAAW;EAEvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,CAAC,GACrC,OAAO;EAET,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAGT,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,gBAAwB,MAAwB;EAC9C,KAAK,OAAO,WAAW;EAEvB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK,GAC9B,OAAO;EAIX,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAGT,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,aAAqB,MAAwB;EAC3C,OAAO,KAAK,WAAW,MAAM,CAAC,KAAK,KAAK,sBAAsB,MAAM,CAAC;CACvE;CAEA,eAAuB,MAAwB;EAC7C,KAAK,OAAO,WAAW;EAEvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,CAAC,GACrC,OAAO;EAGT,MAAM,SAAS,KAAK,WAAW,QAAQ;EACvC,MAAM,iBAAiB,SAAS,IAAI;EAEpC,IAAI,CAAC,KAAK,WAAW,MAAM,cAAc,GACvC,OAAO;EAGT,IAAI,QACF;OAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EACT;EAGF,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;AACF;;AAWA,IAAM,eAAN,MAAmB;CACjB,OAA2B,CAAC;CAE5B,QAAc;EACZ,KAAK,OAAO,CAAC;CACf;CAEA,aAAmB;EACjB,KAAK,MAAM,SAAS,KAAK,MACvB,IAAI,MAAM,QAAQ,GAChB,MAAM,QAAQ,MAAM,QAAQ;CAGlC;CAEA,WAAiB;EACf,KAAK,MAAM,SAAS,KAAK,MACvB,MAAM;CAEV;CAEA,cAAoB;EAClB,KAAK,OAAO,KAAK,KAAK,QAAO,SAAQ,KAAK,QAAQ,CAAC;CACrD;CAEA,UAAU,MAAe;EACvB,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,WAAW,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EAC5D,IAAI,UACF,IAAI,SAAS,QAAQ,GACnB;OACK;GACL,MAAM,QAAQ,KAAK,KAAK,QAAQ,QAAQ;GACxC,IAAI,UAAU,IACZ,KAAK,KAAK,OAAO,OAAO,CAAC;EAE7B;EAEF,KAAK,KAAK,KAAK;GAAE;GAAO,OAAO;EAAE,CAAC;CACpC;CAEA,WAAW,MAAwB;EACjC,MAAM,QAAQ,YAAY,IAAI;EAE9B,OADc,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAC7C,MAAU;CACnB;AACF"}
+{"version":3,"file":"arguments-extractor.js","names":[],"sources":["../../../src/rslang/semantic/arguments-extractor.ts"],"sourcesContent":["/**\n * Module: Type auditor for AST type checking.\n */\n\nimport { type AstNode, getNodeText } from '../../parsing';\nimport { readTypeAnnotation } from '../ast-annotations';\nimport { TokenID } from '../parser/token';\n\nimport { type ExpressionType } from './typification';\n\n/** Represents function argument definition. */\nexport interface ArgumentsType {\n  alias: string;\n  type: ExpressionType | null;\n}\n\n/** Type auditor for AST type checking.\n * Warning! Assumes that the AST is well-formed and annotated with types.\n */\nexport class ArgumentsExtractor {\n  private locals: LocalContext = new LocalContext();\n  private result: ArgumentsType[] = [];\n\n  public run(ast: AstNode): ArgumentsType[] {\n    if (ast.hasError) {\n      return [];\n    }\n    this.result = [];\n    this.locals.clear();\n    this.dispatchVisit(ast);\n    return this.result;\n  }\n\n  private dispatchDeclare(node: AstNode): boolean {\n    return this.processDeclare(node);\n  }\n\n  private processDeclare(node: AstNode): boolean {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node);\n      case TokenID.NT_ENUM_DECL:\n        return this.declareEnumeration(node);\n    }\n    return false;\n  }\n\n  private declareLocal(node: AstNode): boolean {\n    this.locals.pushLocal(node);\n    return true;\n  }\n\n  private declareTuple(node: AstNode): boolean {\n    for (let child = 0; child < node.children.length; child++) {\n      if (!this.visitChildDeclaration(node, child)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private declareEnumeration(node: AstNode): boolean {\n    for (const child of node.children) {\n      if (!this.dispatchDeclare(child)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private dispatchVisit(node: AstNode): boolean {\n    return this.processVisit(node);\n  }\n\n  private processVisit(node: AstNode): boolean {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n      case TokenID.ID_FUNCTION:\n      case TokenID.ID_PREDICATE:\n      case TokenID.ID_RADICAL:\n      case TokenID.LIT_INTEGER:\n      case TokenID.LIT_WHOLE_NUMBERS:\n      case TokenID.LIT_EMPTYSET:\n        return true;\n\n      case TokenID.CARD:\n      case TokenID.FILTER:\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n      case TokenID.LOGIC_AND:\n      case TokenID.LOGIC_OR:\n      case TokenID.LOGIC_IMPLICATION:\n      case TokenID.LOGIC_EQUIVALENT:\n      case TokenID.EQUAL:\n      case TokenID.NOTEQUAL:\n      case TokenID.GREATER:\n      case TokenID.LESSER:\n      case TokenID.GREATER_OR_EQ:\n      case TokenID.LESSER_OR_EQ:\n      case TokenID.SET_IN:\n      case TokenID.SET_NOT_IN:\n      case TokenID.SUBSET:\n      case TokenID.SUBSET_OR_EQ:\n      case TokenID.NOT_SUBSET:\n      case TokenID.DECART:\n      case TokenID.BOOLEAN:\n      case TokenID.BIGPR:\n      case TokenID.SMALLPR:\n      case TokenID.REDUCE:\n      case TokenID.BOOL:\n      case TokenID.DEBOOL:\n      case TokenID.SET_UNION:\n      case TokenID.SET_INTERSECTION:\n      case TokenID.SET_MINUS:\n      case TokenID.SET_SYMMETRIC_MINUS:\n      case TokenID.LOGIC_NOT:\n      case TokenID.NT_TUPLE:\n      case TokenID.NT_ENUMERATION:\n      case TokenID.NT_ARGUMENTS:\n        return this.visitAllAndReturn(node);\n\n      case TokenID.ID_LOCAL:\n        return this.visitLocal(node);\n\n      case TokenID.NT_ARG_DECL:\n        return this.visitArgument(node);\n\n      case TokenID.QUANTOR_UNIVERSAL:\n      case TokenID.QUANTOR_EXISTS:\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitQuantifier(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.visitFunctionDefinition(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ITERATE:\n      case TokenID.ASSIGN:\n        return this.visitIterate(node);\n\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n    }\n    return false;\n  }\n\n  private visitChild(node: AstNode, index: number): boolean {\n    return index < node.children.length && this.dispatchVisit(node.children[index]);\n  }\n\n  private visitChildDeclaration(node: AstNode, index: number): boolean {\n    return index < node.children.length && this.dispatchDeclare(node.children[index]);\n  }\n\n  private visitAllAndReturn(node: AstNode): boolean {\n    for (const child of node.children) {\n      if (!this.dispatchVisit(child)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private visitLocal(node: AstNode): boolean {\n    const alias = getNodeText(node);\n    if (!this.locals.checkLocal(node) && this.result.find(arg => arg.alias === alias) === undefined) {\n      this.result.push({ alias, type: readTypeAnnotation(node) });\n    }\n    return true;\n  }\n\n  private visitFunctionDefinition(node: AstNode): boolean {\n    this.locals.startScope();\n    if (!this.visitChild(node, 0)) {\n      return false;\n    }\n    if (!this.visitChild(node, 1)) {\n      return false;\n    }\n    this.locals.endScope();\n    return true;\n  }\n\n  private visitFunctionCall(node: AstNode): boolean {\n    for (let child = 1; child < node.children.length; child++) {\n      if (!this.visitChild(node, child)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private visitArgument(node: AstNode): boolean {\n    return this.visitChild(node, 1) && this.visitChildDeclaration(node, 0);\n  }\n\n  private visitQuantifier(node: AstNode): boolean {\n    this.locals.startScope();\n\n    if (!this.visitChild(node, 1)) {\n      return false;\n    }\n    if (!this.visitChildDeclaration(node, 0)) {\n      return false;\n    }\n    if (!this.visitChild(node, 2)) {\n      return false;\n    }\n\n    this.locals.endScope();\n    return true;\n  }\n\n  private visitImperative(node: AstNode): boolean {\n    this.locals.startScope();\n\n    for (let child = 1; child < node.children.length; child++) {\n      if (!this.visitChild(node, child)) {\n        return false;\n      }\n    }\n\n    if (!this.visitChild(node, 0)) {\n      return false;\n    }\n\n    this.locals.endScope();\n    return true;\n  }\n\n  private visitIterate(node: AstNode): boolean {\n    return this.visitChild(node, 1) && this.visitChildDeclaration(node, 0);\n  }\n\n  private visitRecursion(node: AstNode): boolean {\n    this.locals.startScope();\n\n    if (!this.visitChild(node, 1)) {\n      return false;\n    }\n    if (!this.visitChildDeclaration(node, 0)) {\n      return false;\n    }\n\n    const isFull = node.typeID === TokenID.NT_RECURSIVE_FULL;\n    const iterationIndex = isFull ? 3 : 2;\n\n    if (!this.visitChild(node, iterationIndex)) {\n      return false;\n    }\n\n    if (isFull) {\n      if (!this.visitChild(node, 2)) {\n        return false;\n      }\n    }\n\n    this.locals.endScope();\n    return true;\n  }\n}\n\n// ========= Internals ========\n\n/** Local variable data. */\ninterface LocalData {\n  alias: string;\n  level: number;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  public data: LocalData[] = [];\n\n  clear(): void {\n    this.data = [];\n  }\n\n  startScope(): void {\n    for (const local of this.data) {\n      if (local.level > 0) {\n        local.level = local.level + 1;\n      }\n    }\n  }\n\n  endScope(): void {\n    for (const local of this.data) {\n      local.level--;\n    }\n  }\n\n  clearUnused(): void {\n    this.data = this.data.filter(data => data.level > 0);\n  }\n\n  pushLocal(node: AstNode) {\n    const alias = getNodeText(node);\n    const existing = this.data.find(data => data.alias === alias);\n    if (existing) {\n      if (existing.level > 0) {\n        return;\n      } else {\n        const index = this.data.indexOf(existing);\n        if (index !== -1) {\n          this.data.splice(index, 1);\n        }\n      }\n    }\n    this.data.push({ alias, level: 1 });\n  }\n\n  checkLocal(node: AstNode): boolean {\n    const alias = getNodeText(node);\n    const local = this.data.find(data => data.alias === alias);\n    return local !== undefined;\n  }\n}\n"],"mappings":";;;;;;;;;;;AAmBA,IAAa,qBAAb,MAAgC;CAC9B,SAA+B,IAAI,aAAa;CAChD,SAAkC,CAAC;CAEnC,IAAW,KAA+B;EACxC,IAAI,IAAI,UACN,OAAO,CAAC;EAEV,KAAK,SAAS,CAAC;EACf,KAAK,OAAO,MAAM;EAClB,KAAK,cAAc,GAAG;EACtB,OAAO,KAAK;CACd;CAEA,gBAAwB,MAAwB;EAC9C,OAAO,KAAK,eAAe,IAAI;CACjC;CAEA,eAAuB,MAAwB;EAC7C,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,IAAI;GAC/B,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,IAAI;GAC/B,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,IAAI;EACvC;EACA,OAAO;CACT;CAEA,aAAqB,MAAwB;EAC3C,KAAK,OAAO,UAAU,IAAI;EAC1B,OAAO;CACT;CAEA,aAAqB,MAAwB;EAC3C,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,sBAAsB,MAAM,KAAK,GACzC,OAAO;EAGX,OAAO;CACT;CAEA,mBAA2B,MAAwB;EACjD,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,gBAAgB,KAAK,GAC7B,OAAO;EAGX,OAAO;CACT;CAEA,cAAsB,MAAwB;EAC5C,OAAO,KAAK,aAAa,IAAI;CAC/B;CAEA,aAAqB,MAAwB;EAC3C,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO;GAET,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,aACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,qBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,oBACX,OAAO,KAAK,wBAAwB,IAAI;GAE1C,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ;GACb,KAAK,QAAQ,QACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;EACnC;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAAwB;EACxD,OAAO,QAAQ,KAAK,SAAS,UAAU,KAAK,cAAc,KAAK,SAAS,MAAM;CAChF;CAEA,sBAA8B,MAAe,OAAwB;EACnE,OAAO,QAAQ,KAAK,SAAS,UAAU,KAAK,gBAAgB,KAAK,SAAS,MAAM;CAClF;CAEA,kBAA0B,MAAwB;EAChD,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,cAAc,KAAK,GAC3B,OAAO;EAGX,OAAO;CACT;CAEA,WAAmB,MAAwB;EACzC,MAAM,QAAQ,YAAY,IAAI;EAC9B,IAAI,CAAC,KAAK,OAAO,WAAW,IAAI,KAAK,KAAK,OAAO,MAAK,QAAO,IAAI,UAAU,KAAK,MAAM,QACpF,KAAK,OAAO,KAAK;GAAE;GAAO,MAAM,mBAAmB,IAAI;EAAE,CAAC;EAE5D,OAAO;CACT;CAEA,wBAAgC,MAAwB;EACtD,KAAK,OAAO,WAAW;EACvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,kBAA0B,MAAwB;EAChD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK,GAC9B,OAAO;EAGX,OAAO;CACT;CAEA,cAAsB,MAAwB;EAC5C,OAAO,KAAK,WAAW,MAAM,CAAC,KAAK,KAAK,sBAAsB,MAAM,CAAC;CACvE;CAEA,gBAAwB,MAAwB;EAC9C,KAAK,OAAO,WAAW;EAEvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,CAAC,GACrC,OAAO;EAET,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAGT,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,gBAAwB,MAAwB;EAC9C,KAAK,OAAO,WAAW;EAEvB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK,GAC9B,OAAO;EAIX,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAGT,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,aAAqB,MAAwB;EAC3C,OAAO,KAAK,WAAW,MAAM,CAAC,KAAK,KAAK,sBAAsB,MAAM,CAAC;CACvE;CAEA,eAAuB,MAAwB;EAC7C,KAAK,OAAO,WAAW;EAEvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,CAAC,GACrC,OAAO;EAGT,MAAM,SAAS,KAAK,WAAW,QAAQ;EACvC,MAAM,iBAAiB,SAAS,IAAI;EAEpC,IAAI,CAAC,KAAK,WAAW,MAAM,cAAc,GACvC,OAAO;EAGT,IAAI,QACF;OAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EACT;EAGF,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;AACF;;AAWA,IAAM,eAAN,MAAmB;CACjB,OAA2B,CAAC;CAE5B,QAAc;EACZ,KAAK,OAAO,CAAC;CACf;CAEA,aAAmB;EACjB,KAAK,MAAM,SAAS,KAAK,MACvB,IAAI,MAAM,QAAQ,GAChB,MAAM,QAAQ,MAAM,QAAQ;CAGlC;CAEA,WAAiB;EACf,KAAK,MAAM,SAAS,KAAK,MACvB,MAAM;CAEV;CAEA,cAAoB;EAClB,KAAK,OAAO,KAAK,KAAK,QAAO,SAAQ,KAAK,QAAQ,CAAC;CACrD;CAEA,UAAU,MAAe;EACvB,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,WAAW,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EAC5D,IAAI,UAAU;GACZ,IAAI,SAAS,QAAQ,GACnB;QACK;IACL,MAAM,QAAQ,KAAK,KAAK,QAAQ,QAAQ;IACxC,IAAI,UAAU,IACZ,KAAK,KAAK,OAAO,OAAO,CAAC;GAE7B;EACF;EACA,KAAK,KAAK,KAAK;GAAE;GAAO,OAAO;EAAE,CAAC;CACpC;CAEA,WAAW,MAAwB;EACjC,MAAM,QAAQ,YAAY,IAAI;EAE9B,OADc,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAC7C,MAAU;CACnB;AACF"}

package/dist/rslang/semantic/type-auditor.d.ts

@@ -1,10 +1,10 @@
 import { t as AstNode } from "../../ast-D-D6Rq3T.js";
 import "../../index-D5RahF1K.js";
 import { _ as TypeContext, f as ExpressionType } from "../../typification-hWUoWCba.js";
-import { t as ErrorReporter } from "../../error-S1JghCNN.js";
+import { t as ErrorReporter } from "../../error-DBbO_NIg.js";
 //#region src/rslang/semantic/type-auditor.d.ts
 /** Type auditor for AST type checking. */
-declare class TypeAuditor {
+export declare class TypeAuditor {
   private static readonly TYPE_DEDUCTION_DEPTH;
   private context;
   private reporter?;
@@ -68,5 +68,4 @@ declare class TypeAuditor {
   private checkFuncArguments;
 }
 //#endregion
-export { TypeAuditor };
 //# sourceMappingURL=type-auditor.d.ts.map

package/dist/rslang/semantic/type-auditor.js

@@ -343,16 +343,18 @@ var TypeAuditor = class TypeAuditor {
 		if (isSubset) type2 = bool(type2);
 		const type1 = this.childTypification(node, 0);
 		if (type1 === null) return null;
-		if (!checkCompatibility(type1, type2)) if (isSubset) return this.onError(RSErrorCode.typesNotEqual, node, [
-			labelType(type1),
-			labelType(type2),
-			operator
-		]);
-		else return this.onError(RSErrorCode.invalidElementPredicate, node, [
-			labelType(type1),
-			operator,
-			labelType(bool(type2))
-		]);
+		if (!checkCompatibility(type1, type2)) {
+			if (isSubset) return this.onError(RSErrorCode.typesNotEqual, node, [
+				labelType(type1),
+				labelType(type2),
+				operator
+			]);
+			else return this.onError(RSErrorCode.invalidElementPredicate, node, [
+				labelType(type1),
+				operator,
+				labelType(bool(type2))
+			]);
+		}
 		return LogicT;
 	}
 	visitDecart(node) {
@@ -691,12 +693,14 @@ var LocalContext = class {
 	pushLocal(node, type) {
 		const alias = getNodeText(node);
 		const existing = this.data.find((data) => data.alias === alias);
-		if (existing) if (existing.level > 0) {
-			this.onError(RSErrorCode.localShadowing, node, [alias]);
-			return false;
-		} else {
-			this.onError(RSErrorCode.localDoubleDeclare, node, [alias]);
-			return false;
+		if (existing) {
+			if (existing.level > 0) {
+				this.onError(RSErrorCode.localShadowing, node, [alias]);
+				return false;
+			} else {
+				this.onError(RSErrorCode.localDoubleDeclare, node, [alias]);
+				return false;
+			}
 		}
 		this.data.push({
 			alias,

package/dist/rslang/semantic/type-auditor.js.map

@@ -1 +1 @@
-{"version":3,"file":"type-auditor.js","names":[],"sources":["../../../src/rslang/semantic/type-auditor.ts"],"sourcesContent":["/**\n * Module: Type auditor for AST type checking.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { annotateError, annotateType } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode } from '../error';\nimport { labelRSLangNode, labelToken, labelType } from '../labels';\nimport { TokenID } from '../parser/token';\n\nimport {\n  type Argument,\n  bool,\n  component,\n  debool,\n  type EchelonTuple,\n  EmptySetT,\n  type ExpressionType,\n  IntegerT,\n  isTemplateRadical,\n  isTypification,\n  LogicT,\n  mangleParamAlias,\n  mangleRadicalId,\n  type Parametrized,\n  tuple,\n  type TypeContext,\n  TypeID,\n  type Typification\n} from './typification';\nimport {\n  checkCompatibility,\n  checkEquality,\n  cloneTypification,\n  compareTemplated,\n  hasGenerics,\n  mergeTypifications,\n  substituteBase\n} from './typification-api';\n\n/** Type auditor for AST type checking. */\nexport class TypeAuditor {\n  private static readonly TYPE_DEDUCTION_DEPTH = 5;\n\n  private context: TypeContext;\n  private reporter?: ErrorReporter;\n  private locals: LocalContext;\n  private annotateTypes: boolean;\n  private annotateErrors: boolean;\n\n  constructor(context: TypeContext) {\n    this.annotateTypes = false;\n    this.annotateErrors = false;\n    this.context = context;\n    this.locals = new LocalContext(this.onError.bind(this));\n  }\n\n  public run(\n    ast: AstNode,\n    annotateTypes: boolean,\n    reporter?: ErrorReporter,\n    annotateErrors: boolean = false\n  ): ExpressionType | null {\n    if (ast.hasError) {\n      return null;\n    }\n    this.annotateTypes = annotateTypes;\n    this.annotateErrors = annotateErrors;\n    this.reporter = reporter;\n    this.clear();\n    return this.dispatchVisit(ast);\n  }\n\n  private clear(): void {\n    this.locals = new LocalContext(this.onError.bind(this));\n  }\n\n  private dispatchDeclare(node: AstNode, domain: Typification): boolean {\n    const result = this.processDeclare(node, domain);\n    if (result === true && this.annotateTypes) {\n      annotateType(node, domain);\n    }\n    return result;\n  }\n\n  private processDeclare(node: AstNode, domain: Typification): boolean {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node, domain);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node, domain);\n      case TokenID.NT_ENUM_DECL:\n        return this.declareEnumeration(node, domain);\n    }\n    return false;\n  }\n\n  private declareLocal(node: AstNode, domain: Typification): boolean {\n    return this.locals.pushLocal(node, domain);\n  }\n\n  private declareTuple(node: AstNode, domain: Typification): boolean {\n    if (domain.typeID !== TypeID.tuple || domain.factors.length !== node.children.length) {\n      this.onError(RSErrorCode.invalidCortegeDeclare, node.children[0]);\n      return false;\n    }\n    for (let child = 0; child < node.children.length; child++) {\n      if (!this.visitChildDeclaration(node, child, component(domain, child + 1)!)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private declareEnumeration(node: AstNode, domain: Typification): boolean {\n    for (const child of node.children) {\n      if (!this.dispatchDeclare(child, domain)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private dispatchVisit(node: AstNode): ExpressionType | null {\n    const result = this.processVisit(node);\n    if (result !== null && this.annotateTypes) {\n      annotateType(node, result);\n    }\n    return result;\n  }\n\n  private processVisit(node: AstNode): ExpressionType | null {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n      case TokenID.ID_FUNCTION:\n      case TokenID.ID_PREDICATE:\n        return this.visitGlobal(node);\n\n      case TokenID.ID_LOCAL:\n        return this.visitLocal(node);\n      case TokenID.ID_RADICAL:\n        return this.visitRadical(node);\n\n      case TokenID.LIT_INTEGER:\n        return IntegerT;\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return bool(IntegerT);\n      case TokenID.LIT_EMPTYSET:\n        return this.visitEmptySet(node);\n\n      case TokenID.NT_ARGUMENTS:\n        return this.visitArgumentsEnum(node);\n      case TokenID.NT_ARG_DECL:\n        return this.visitArgument(node);\n\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n        return this.visitArithmetic(node);\n\n      case TokenID.QUANTOR_UNIVERSAL:\n      case TokenID.QUANTOR_EXISTS:\n        return this.visitQuantifier(node);\n\n      case TokenID.LOGIC_NOT:\n        return this.visitNegation(node);\n\n      case TokenID.LOGIC_AND:\n      case TokenID.LOGIC_OR:\n      case TokenID.LOGIC_IMPLICATION:\n      case TokenID.LOGIC_EQUIVALENT:\n        return this.visitLogicBinary(node);\n\n      case TokenID.EQUAL:\n      case TokenID.NOTEQUAL:\n        return this.visitEquals(node);\n\n      case TokenID.GREATER:\n      case TokenID.LESSER:\n      case TokenID.GREATER_OR_EQ:\n      case TokenID.LESSER_OR_EQ:\n        return this.visitIntegerPredicate(node);\n\n      case TokenID.SET_IN:\n      case TokenID.SET_NOT_IN:\n      case TokenID.SUBSET:\n      case TokenID.SUBSET_OR_EQ:\n      case TokenID.NOT_SUBSET:\n        return this.visitSetexprPredicate(node);\n\n      case TokenID.DECART:\n        return this.visitDecart(node);\n      case TokenID.BOOLEAN:\n        return this.visitBoolean(node);\n\n      case TokenID.NT_TUPLE:\n        return this.visitTuple(node);\n      case TokenID.NT_ENUMERATION:\n        return this.visitEnumeration(node);\n\n      case TokenID.BIGPR:\n        return this.visitProjectSet(node);\n      case TokenID.SMALLPR:\n        return this.visitProjectTuple(node);\n      case TokenID.FILTER:\n        return this.visitFilter(node);\n\n      case TokenID.CARD:\n        return this.visitCard(node);\n      case TokenID.REDUCE:\n        return this.visitReduce(node);\n      case TokenID.BOOL:\n        return this.visitBool(node);\n      case TokenID.DEBOOL:\n        return this.visitDebool(node);\n\n      case TokenID.SET_UNION:\n      case TokenID.SET_INTERSECTION:\n      case TokenID.SET_MINUS:\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return this.visitSetexprBinary(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.visitFunctionDefinition(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ITERATE:\n        return this.visitIterate(node);\n      case TokenID.ASSIGN:\n        return this.visitAssign(node);\n\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitDeclarative(node);\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n    }\n    return null;\n  }\n\n  private onError(code: RSErrorCode, node: AstNode, params?: string[]): null {\n    this.reporter?.({ code, from: node.from, to: node.to, params });\n    if (this.annotateErrors) {\n      annotateError(node, code, params);\n    }\n    return null;\n  }\n\n  private visitChild(node: AstNode, index: number): ExpressionType | null {\n    if (index >= node.children.length) {\n      return null;\n    }\n    return this.dispatchVisit(node.children[index]);\n  }\n\n  private visitChildDeclaration(node: AstNode, index: number, domain: Typification): boolean {\n    if (index >= node.children.length) {\n      return false;\n    }\n    if (!this.dispatchDeclare(node.children[index], domain)) {\n      return false;\n    }\n    return true;\n  }\n\n  private visitAllAndReturn(node: AstNode, type: ExpressionType | null): ExpressionType | null {\n    for (const child of node.children) {\n      if (!this.dispatchVisit(child)) {\n        return null;\n      }\n    }\n    return type;\n  }\n\n  private childTypification(node: AstNode, index: number): Typification | null {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (!isTypification(result)) {\n      this.onError(RSErrorCode.expectedSetexpr, node.children[index], [labelType(result)]);\n      return null;\n    }\n    return result as Typification;\n  }\n\n  private childLogic(node: AstNode, index: number): boolean {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return false;\n    }\n    if (result.typeID !== TypeID.logic) {\n      this.onError(RSErrorCode.expectedLogic, node.children[index], [labelType(result)]);\n      return false;\n    }\n    return true;\n  }\n\n  private childTypeDebool(\n    node: AstNode,\n    index: number,\n    errorCode: RSErrorCode,\n    operation?: string\n  ): Typification | null {\n    const result = this.childTypification(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (result.typeID === TypeID.anyTypification) {\n      return result;\n    }\n    if (result.typeID !== TypeID.collection) {\n      const params =\n        errorCode === RSErrorCode.invalidTypeOperation && operation !== undefined\n          ? [operation, labelType(result)]\n          : [labelType(result)];\n      this.onError(errorCode, node.children[index], params);\n      return null;\n    }\n    return debool(result);\n  }\n\n  private childQuantifierDomain(node: AstNode, index: number, operator: string): Typification | null {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (!isTypification(result)) {\n      this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);\n      return null;\n    }\n    if (result.typeID === TypeID.anyTypification) {\n      return result;\n    }\n    if (result.typeID !== TypeID.collection) {\n      this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);\n      return null;\n    }\n    return debool(result);\n  }\n\n  private visitLocal(node: AstNode): ExpressionType | null {\n    return this.locals.getLocalType(node);\n  }\n\n  private visitGlobal(node: AstNode): ExpressionType | null {\n    const alias = getNodeText(node);\n    const type = this.context.get(alias);\n    if (!type) {\n      return this.onError(RSErrorCode.globalNotTyped, node, [alias]);\n    }\n    if (type.typeID === TypeID.function || type.typeID === TypeID.predicate) {\n      return this.onError(RSErrorCode.globalFuncWithoutArgs, node, [alias]);\n    }\n    return type;\n  }\n\n  private visitFunctionDefinition(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n    if (!this.visitChild(node, 0)) {\n      return null;\n    }\n\n    const args: Argument[] = [];\n    for (const local of this.locals.data) {\n      if (local.level === 1) {\n        args.push({ alias: local.alias, type: local.type });\n      }\n    }\n\n    const result = this.visitChild(node, 1);\n    if (result === null || result.typeID === TypeID.function || result.typeID === TypeID.predicate) {\n      return null;\n    }\n    this.locals.endScope(node.children[1]);\n    if (result.typeID === TypeID.logic) {\n      return {\n        typeID: TypeID.predicate,\n        result: result,\n        args: args\n      };\n    } else {\n      return {\n        typeID: TypeID.function,\n        result: result,\n        args: args\n      };\n    }\n  }\n\n  private visitFunctionCall(node: AstNode): ExpressionType | null {\n    const funcName = getNodeText(node.children[0]);\n    const funcType = this.context.get(funcName);\n    if (funcType?.typeID !== TypeID.function && funcType?.typeID !== TypeID.predicate) {\n      return this.onError(RSErrorCode.globalNotTyped, node.children[0], [funcName]);\n    }\n    if (this.annotateTypes) {\n      annotateType(node.children[0], funcType);\n    }\n\n    const substitutes = this.checkFuncArguments(node, funcName, funcType);\n    if (substitutes === null) {\n      return null;\n    }\n    if (funcType.result.typeID === TypeID.logic) {\n      return funcType.result;\n    } else {\n      const result = mangleRadicals(funcName, funcType.result);\n      if (substitutes.size > 0) {\n        substituteBase(result, substitutes);\n      }\n      return result;\n    }\n  }\n\n  private visitRadical(node: AstNode): ExpressionType | null {\n    const alias = getNodeText(node);\n    if (!this.isInsideFuncArgument(node)) {\n      return this.onError(RSErrorCode.radicalUsage, node, [alias]);\n    }\n    return bool({ typeID: TypeID.basic, baseID: alias });\n  }\n\n  private visitEmptySet(node: AstNode): ExpressionType | null {\n    const invalidParents: TokenID[] = [\n      TokenID.CARD,\n      TokenID.DEBOOL,\n      TokenID.SET_UNION,\n      TokenID.SET_INTERSECTION,\n      TokenID.SET_MINUS,\n      TokenID.SET_SYMMETRIC_MINUS,\n      TokenID.REDUCE,\n      TokenID.BIGPR,\n      TokenID.SMALLPR\n    ];\n    if (invalidParents.includes(node.parent?.typeID as TokenID)) {\n      return this.onError(RSErrorCode.invalidEmptySetUsage, node);\n    }\n    return EmptySetT;\n  }\n\n  private visitArgument(node: AstNode): ExpressionType | null {\n    const variable = node.children[0];\n    if (variable.typeID === TokenID.NT_TUPLE_DECL) {\n      return this.onError(RSErrorCode.invalidArgumentCortegeDeclare, variable);\n    }\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return domain;\n  }\n\n  private visitCard(node: AstNode): ExpressionType | null {\n    if (!this.childTypeDebool(node, 0, RSErrorCode.invalidCard)) {\n      return null;\n    }\n    return IntegerT;\n  }\n\n  private visitArithmetic(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n    if (!('isArithmetic' in type1 && type1.isArithmetic)) {\n      return this.onError(RSErrorCode.arithmeticNotSupported, node.children[0], [labelType(type1), operator]);\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!('isArithmetic' in type2 && type2.isArithmetic)) {\n      return this.onError(RSErrorCode.arithmeticNotSupported, node.children[1], [labelType(type2), operator]);\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return result;\n  }\n\n  private visitIntegerPredicate(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n    if (!('isOrdered' in type1 && type1.isOrdered)) {\n      return this.onError(RSErrorCode.orderingNotSupported, node.children[0], [labelType(type1), operator]);\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!('isOrdered' in type2 && type2.isOrdered)) {\n      return this.onError(RSErrorCode.orderingNotSupported, node.children[1], [labelType(type2), operator]);\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return LogicT;\n  }\n\n  private visitQuantifier(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const operator = labelRSLangNode(node);\n    const domain = this.childQuantifierDomain(node, 1, operator);\n    if (domain === null) {\n      return null;\n    } else if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    } else if (!this.childLogic(node, 2)) {\n      return null;\n    }\n\n    this.locals.endScope(node.children[2]);\n    return LogicT;\n  }\n\n  private visitNegation(node: AstNode): ExpressionType | null {\n    if (!this.childLogic(node, 0)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitLogicBinary(node: AstNode): ExpressionType | null {\n    if (!this.childLogic(node, 0) || !this.childLogic(node, 1)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitEquals(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return LogicT;\n  }\n\n  private visitSetexprPredicate(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);\n    if (type2 === null) {\n      return null;\n    }\n    const isSubset = this.isSubset(node.typeID as TokenID);\n    if (isSubset) {\n      type2 = bool(type2);\n    }\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      if (isSubset) {\n        return this.onError(RSErrorCode.typesNotEqual, node, [labelType(type1), labelType(type2), operator]);\n      } else {\n        return this.onError(RSErrorCode.invalidElementPredicate, node, [\n          labelType(type1),\n          operator,\n          labelType(bool(type2))\n        ]);\n      }\n    }\n    return LogicT;\n  }\n\n  private visitDecart(node: AstNode): ExpressionType | null {\n    const factors: Typification[] = [];\n    for (let child = 0; child < node.children.length; child++) {\n      const type = this.childTypeDebool(node, child, RSErrorCode.invalidDecart);\n      if (type === null) {\n        return null;\n      } else {\n        factors.push(type);\n      }\n    }\n    return bool(tuple(factors));\n  }\n\n  private visitBoolean(node: AstNode): ExpressionType | null {\n    const type = this.childTypeDebool(node, 0, RSErrorCode.invalidBoolean);\n    if (type === null) {\n      return null;\n    }\n    return bool(bool(type));\n  }\n\n  private visitTuple(node: AstNode): ExpressionType | null {\n    const components: Typification[] = [];\n    for (let child = 0; child < node.children.length; child++) {\n      const type = this.childTypification(node, child);\n      if (type === null) {\n        return null;\n      }\n      components.push(type);\n    }\n    return tuple(components);\n  }\n\n  private visitEnumeration(node: AstNode): ExpressionType | null {\n    let type: ExpressionType | null = this.childTypification(node, 0);\n    if (type === null) {\n      return null;\n    }\n    for (let child = 1; child < node.children.length; child++) {\n      const childType = this.childTypification(node, child);\n      if (childType === null) {\n        return null;\n      }\n\n      const merge = mergeTypifications(type, childType);\n      if (merge === null) {\n        return this.onError(RSErrorCode.invalidEnumeration, node.children[child], [\n          labelType(type),\n          labelType(childType)\n        ]);\n      }\n      type = merge;\n    }\n    return bool(type);\n  }\n\n  private visitBool(node: AstNode): ExpressionType | null {\n    return this.visitEnumeration(node);\n  }\n\n  private visitDebool(node: AstNode): ExpressionType | null {\n    return this.childTypeDebool(node, 0, RSErrorCode.invalidDebool);\n  }\n\n  private visitSetexprBinary(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation, operator);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);\n    if (type2 === null) {\n      return null;\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotEqual, node, [labelType(bool(type1)), labelType(bool(type2)), operator]);\n    }\n    return bool(result);\n  }\n\n  private visitProjectSet(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const argNode = node.children[0];\n    const argType = this.childTypification(node, 0);\n    if (argType === null) {\n      return null;\n    }\n    if (argType.typeID === TypeID.anyTypification) {\n      return EmptySetT;\n    }\n    if (argType.typeID !== TypeID.collection) {\n      return this.onError(RSErrorCode.projectionSetArgumentNotSet, argNode, [operator, labelType(argType)]);\n    }\n    const argument = debool(argType);\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.projectionSetArgumentNotTupleSet, argNode, [operator, labelType(bool(argument))]);\n    }\n\n    const indices = getNodeIndices(node);\n    const components: Typification[] = [];\n    for (const index of indices) {\n      const newComponent = component(argument, index);\n      if (newComponent === null) {\n        return this.onError(RSErrorCode.projectionSetIndexOutOfRange, argNode, [\n          operator,\n          String(index),\n          String(argument.factors.length),\n          labelType(bool(argument))\n        ]);\n      } else {\n        components.push(newComponent);\n      }\n    }\n    if (components.length === 1) {\n      return bool(components[0]);\n    } else {\n      return bool(tuple(components));\n    }\n  }\n\n  private visitProjectTuple(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const argNode = node.children[0];\n    const argument = this.childTypification(node, 0);\n    if (argument === null) {\n      return null;\n    }\n    if (argument.typeID === TypeID.anyTypification) {\n      return argument;\n    }\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.projectionTupleArgumentNotTuple, argNode, [operator, labelType(argument)]);\n    }\n\n    const indices = getNodeIndices(node);\n    const components: Typification[] = [];\n    for (const index of indices) {\n      const newComponent = component(argument, index);\n      if (newComponent === null) {\n        return this.onError(RSErrorCode.projectionTupleIndexOutOfRange, argNode, [\n          operator,\n          String(index),\n          String(argument.factors.length),\n          labelType(argument)\n        ]);\n      } else {\n        components.push(newComponent);\n      }\n    }\n    if (components.length === 1) {\n      return components[0];\n    } else {\n      return tuple(components);\n    }\n  }\n\n  private visitFilter(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const indices = getNodeIndices(node);\n    const tupleParam = indices.length === node.children.length - 1;\n    if (!tupleParam && node.children.length > 2) {\n      const extraParam = node.children[indices.length];\n      return this.onError(RSErrorCode.invalidFilterArity, extraParam ?? node, [\n        String(indices.length),\n        String(node.children.length - 1),\n        operator\n      ]);\n    }\n\n    const argument = this.childTypification(node, node.children.length - 1);\n    if (argument === null) {\n      return null;\n    }\n    if (\n      argument.typeID === TypeID.anyTypification ||\n      (argument.typeID === TypeID.collection && argument.base.typeID === TypeID.anyTypification)\n    ) {\n      return EmptySetT;\n    }\n    const expectedArgument = this.expectedFilterArgumentLabel(indices);\n    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidFilterArgumentType, node.children[node.children.length - 1], [\n        operator,\n        labelType(argument),\n        expectedArgument\n      ]);\n    }\n\n    const argBase = debool(argument) as EchelonTuple;\n    const bases: Typification[] = [];\n    for (const index of indices) {\n      const newBase = component(argBase, index);\n      if (newBase === null) {\n        return this.onError(RSErrorCode.invalidFilterIndex, node.children[node.children.length - 1], [\n          operator,\n          labelType(argument),\n          String(index),\n          String(argBase.factors.length)\n        ]);\n      }\n      bases.push(newBase);\n    }\n\n    if (tupleParam) {\n      for (let child = 0; child + 1 < node.children.length; child++) {\n        const param = this.childTypification(node, child);\n        if (param === null) {\n          return null;\n        }\n        const expectedParam = bool(bases[child]);\n        if (param.typeID !== TypeID.collection || !checkCompatibility(bases[child], debool(param))) {\n          return this.reportFilterParameterError(node, child, param, expectedParam, operator);\n        }\n      }\n    } else {\n      const param = this.childTypification(node, 0);\n      if (param === null) {\n        return null;\n      }\n      const paramType = param;\n      const expected = bool(tuple(bases));\n      if (paramType.typeID !== TypeID.collection || !checkCompatibility(expected, paramType)) {\n        return this.reportFilterParameterError(node, 0, paramType, expected, operator);\n      }\n    }\n    return argument;\n  }\n\n  private expectedFilterArgumentLabel(indices: number[]): string {\n    const maxIndex = Math.max(...indices, 0);\n    if (maxIndex <= 1) {\n      return labelType(bool({ typeID: TypeID.anyTypification }));\n    }\n    const factors: Typification[] = [];\n    for (let index = 1; index <= maxIndex; index++) {\n      factors.push({ typeID: TypeID.anyTypification });\n    }\n    return labelType(bool(tuple(factors)));\n  }\n\n  private reportFilterParameterError(\n    node: AstNode,\n    childIndex: number,\n    param: Typification,\n    expected: Typification,\n    operator: string\n  ): null {\n    const wrapped = bool(param);\n    if (checkEquality(wrapped, expected) || checkCompatibility(wrapped, expected)) {\n      return this.onError(RSErrorCode.invalidFilterBooleanEchelon, node.children[childIndex], [\n        operator,\n        labelType(param)\n      ]);\n    }\n    return this.onError(RSErrorCode.invalidFilterParameterType, node.children[childIndex], [\n      labelType(param),\n      labelType(expected),\n      operator\n    ]);\n  }\n\n  private visitReduce(node: AstNode): ExpressionType | null {\n    const argument = this.childTypification(node, 0);\n    if (argument === null) {\n      return null;\n    }\n    if (\n      argument.typeID === TypeID.anyTypification ||\n      (argument.typeID === TypeID.collection && argument.base.typeID === TypeID.anyTypification)\n    ) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.collection) {\n      return this.onError(RSErrorCode.invalidReduce, node.children[0], [labelType(argument)]);\n    }\n    return debool(argument);\n  }\n\n  private visitArgumentsEnum(node: AstNode): ExpressionType | null {\n    return this.visitAllAndReturn(node, LogicT);\n  }\n\n  private visitDeclarative(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const domain = this.childTypeDebool(\n      node,\n      1,\n      RSErrorCode.invalidTypeOperation,\n      labelToken(TokenID.NT_DECLARATIVE_EXPR)\n    );\n    if (domain === null) {\n      return null;\n    } else if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    } else if (!this.childLogic(node, 2)) {\n      return null;\n    }\n\n    this.locals.endScope(node.children[2]);\n    return bool(domain);\n  }\n\n  private visitImperative(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    for (let child = 1; child < node.children.length; child++) {\n      if (!this.childLogic(node, child)) {\n        return null;\n      }\n    }\n\n    const type = this.childTypification(node, 0);\n    if (type === null) {\n      return null;\n    }\n\n    this.locals.endScope(node);\n    return bool(type);\n  }\n\n  private visitIterate(node: AstNode): ExpressionType | null {\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitAssign(node: AstNode): ExpressionType | null {\n    const domain = this.childTypification(node, 1);\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitRecursion(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const initType = this.childTypification(node, 1);\n    if (initType === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, initType)) {\n      return null;\n    }\n\n    const isFull = node.typeID === TokenID.NT_RECURSIVE_FULL;\n    const iterationIndex = isFull ? 3 : 2;\n\n    let iterationValue = this.childTypification(node, iterationIndex);\n    if (iterationValue === null) {\n      return null;\n    }\n    if (!checkCompatibility(iterationValue, initType)) {\n      return this.onError(RSErrorCode.typesNotEqual, node.children[iterationIndex], [\n        labelType(iterationValue),\n        labelType(initType),\n        labelToken(node.typeID as TokenID)\n      ]);\n    }\n\n    if (hasGenerics(initType)) {\n      for (let retries = TypeAuditor.TYPE_DEDUCTION_DEPTH; retries > 0; retries--) {\n        this.locals.endScope(node);\n        this.locals.clearUnused();\n        this.locals.startScope();\n        if (!this.visitChildDeclaration(node, 0, iterationValue)) {\n          return null;\n        }\n        const newIteration = this.childTypification(node, iterationIndex);\n        if (newIteration === null) {\n          return null;\n        }\n        if (checkEquality(newIteration, iterationValue)) {\n          break;\n        }\n        iterationValue = newIteration;\n      }\n    }\n\n    if (isFull) {\n      if (!this.childLogic(node, 2)) {\n        return null;\n      }\n    }\n\n    this.locals.endScope(node);\n    return iterationValue;\n  }\n\n  private isSubset(token: TokenID): boolean {\n    return token === TokenID.SUBSET || token === TokenID.SUBSET_OR_EQ || token === TokenID.NOT_SUBSET;\n  }\n\n  private isInsideFuncArgument(node: AstNode): boolean {\n    while (node.parent && node.parent !== node) {\n      if (node.typeID === TokenID.NT_ARGUMENTS) return true;\n      node = node.parent;\n    }\n    return false;\n  }\n\n  private checkFuncArguments(node: AstNode, alias: string, type: Parametrized): Map<string, Typification> | null {\n    if (node.children.length - 1 !== type.args.length) {\n      return this.onError(RSErrorCode.invalidArgsArity, node, [\n        String(type.args.length),\n        String(node.children.length - 1)\n      ]);\n    }\n\n    const substitutes = new Map<string, Typification>();\n    for (let child = 1; child < node.children.length; child++) {\n      const childType = this.childTypification(node, child);\n      if (childType === null) {\n        return null;\n      }\n      const argType = mangleRadicals(alias, type.args[child - 1].type);\n      if (!compareTemplated(substitutes, argType, childType)) {\n        const expectedType = cloneTypification(argType);\n        if (substitutes.size > 0) {\n          substituteBase(expectedType, substitutes);\n        }\n        this.onError(RSErrorCode.invalidArgumentType, node.children[child], [\n          `${mangleParamAlias(type.args[child - 1].alias, alias)}∈${labelType(expectedType)}`,\n          labelType(childType)\n        ]);\n        return null;\n      }\n    }\n    return substitutes;\n  }\n}\n\n// ========= Internals ========\nfunction mangleRadicals(funcName: string, type: Typification): Typification {\n  switch (type.typeID) {\n    default:\n      throw new Error(`Unexpected type for ${funcName}: ${JSON.stringify(type)}`);\n    case TypeID.anyTypification:\n    case TypeID.integer:\n      return type;\n    case TypeID.basic: {\n      if (isTemplateRadical(type.baseID)) {\n        return {\n          typeID: type.typeID,\n          baseID: mangleRadicalId(type.baseID, funcName)\n        };\n      }\n      return type;\n    }\n    case TypeID.collection: {\n      return {\n        typeID: type.typeID,\n        base: mangleRadicals(funcName, debool(type))\n      };\n    }\n    case TypeID.tuple: {\n      const factors: Typification[] = [];\n      for (let index = 1; index <= type.factors.length; ++index) {\n        factors.push(mangleRadicals(funcName, component(type, index)!));\n      }\n      return {\n        typeID: type.typeID,\n        factors: factors\n      };\n    }\n  }\n}\n\n/** Local variable data. */\ninterface LocalData {\n  alias: string;\n  level: number;\n  useCount: number;\n  type: Typification;\n}\n\nfunction isLogicBinaryNode(typeID: number): boolean {\n  return (\n    typeID === TokenID.LOGIC_AND ||\n    typeID === TokenID.LOGIC_OR ||\n    typeID === TokenID.LOGIC_IMPLICATION ||\n    typeID === TokenID.LOGIC_EQUIVALENT\n  );\n}\n\nfunction isQuantifierNode(typeID: number): boolean {\n  return typeID === TokenID.QUANTOR_UNIVERSAL || typeID === TokenID.QUANTOR_EXISTS;\n}\n\n/** Quantifier on the path from `node` up through `stopAt` (inclusive). */\nfunction pathContainsQuantifier(node: AstNode, stopAt: AstNode): boolean {\n  let current: AstNode | null = node;\n  while (current !== null) {\n    if (isQuantifierNode(current.typeID)) {\n      return true;\n    }\n    if (current === stopAt) {\n      return false;\n    }\n    current = current.parent;\n  }\n  return false;\n}\n\n/** Right operand subtree of the innermost logic binary containing `node`. */\nfunction findRightLogicOperandRoot(node: AstNode): AstNode | null {\n  let current: AstNode | null = node;\n  while (current !== null && current.parent !== null) {\n    const parent: AstNode = current.parent;\n    if (isLogicBinaryNode(parent.typeID)) {\n      const childIndex = parent.children.indexOf(current);\n      if (childIndex > 0) {\n        return current;\n      }\n    }\n    current = parent;\n  }\n  return null;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  private onError: (code: RSErrorCode, node: AstNode, params: string[]) => null;\n\n  public data: LocalData[] = [];\n\n  constructor(onError: (code: RSErrorCode, node: AstNode, params: string[]) => null) {\n    this.onError = onError;\n  }\n\n  startScope(): void {\n    for (const local of this.data) {\n      if (local.level > 0) {\n        local.level = local.level + 1;\n      }\n    }\n  }\n\n  endScope(node: AstNode, skipUnused: boolean = false): void {\n    for (const local of this.data) {\n      local.level--;\n      if (!skipUnused && local.level === 0 && local.useCount === 0) {\n        this.onError(RSErrorCode.localNotUsed, node, [local.alias]);\n      }\n    }\n  }\n\n  clearUnused(): void {\n    this.data = this.data.filter(data => data.level > 0);\n  }\n\n  pushLocal(node: AstNode, type: Typification): boolean {\n    const alias = getNodeText(node);\n    const existing = this.data.find(data => data.alias === alias);\n    if (existing) {\n      if (existing.level > 0) {\n        this.onError(RSErrorCode.localShadowing, node, [alias]);\n        return false;\n      } else {\n        this.onError(RSErrorCode.localDoubleDeclare, node, [alias]);\n        return false;\n      }\n    }\n    this.data.push({ alias, type, level: 1, useCount: 0 });\n    return true;\n  }\n\n  getLocalType(node: AstNode): Typification | null {\n    const alias = getNodeText(node);\n    const local = this.data.find(data => data.alias === alias);\n    if (local === undefined) {\n      return this.onError(RSErrorCode.localUndeclared, node, [alias]);\n    } else if (local.level < 1) {\n      const subexprRoot = findRightLogicOperandRoot(node);\n      if (subexprRoot !== null) {\n        if (pathContainsQuantifier(node, subexprRoot)) {\n          return this.onError(RSErrorCode.localUndeclaredInSubexpr, node, [alias, labelType(local.type)]);\n        }\n        return this.onError(RSErrorCode.localOutOfScopeParentheses, node, [alias]);\n      }\n      return this.onError(RSErrorCode.localOutOfScope, node, [alias]);\n    } else {\n      local.useCount++;\n      return local.type;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAyCA,IAAa,cAAb,MAAa,YAAY;CACvB,OAAwB,uBAAuB;CAE/C;CACA;CACA;CACA;CACA;CAEA,YAAY,SAAsB;EAChC,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,UAAU;EACf,KAAK,SAAS,IAAI,aAAa,KAAK,QAAQ,KAAK,IAAI,CAAC;CACxD;CAEA,IACE,KACA,eACA,UACA,iBAA0B,OACH;EACvB,IAAI,IAAI,UACN,OAAO;EAET,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,WAAW;EAChB,KAAK,MAAM;EACX,OAAO,KAAK,cAAc,GAAG;CAC/B;CAEA,QAAsB;EACpB,KAAK,SAAS,IAAI,aAAa,KAAK,QAAQ,KAAK,IAAI,CAAC;CACxD;CAEA,gBAAwB,MAAe,QAA+B;EACpE,MAAM,SAAS,KAAK,eAAe,MAAM,MAAM;EAC/C,IAAI,WAAW,QAAQ,KAAK,eAC1B,aAAa,MAAM,MAAM;EAE3B,OAAO;CACT;CAEA,eAAuB,MAAe,QAA+B;EACnE,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,MAAM,MAAM;GACvC,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,MAAM,MAAM;GACvC,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,MAAM,MAAM;EAC/C;EACA,OAAO;CACT;CAEA,aAAqB,MAAe,QAA+B;EACjE,OAAO,KAAK,OAAO,UAAU,MAAM,MAAM;CAC3C;CAEA,aAAqB,MAAe,QAA+B;EACjE,IAAI,OAAO,WAAW,OAAO,SAAS,OAAO,QAAQ,WAAW,KAAK,SAAS,QAAQ;GACpF,KAAK,QAAQ,YAAY,uBAAuB,KAAK,SAAS,EAAE;GAChE,OAAO;EACT;EACA,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,sBAAsB,MAAM,OAAO,UAAU,QAAQ,QAAQ,CAAC,CAAE,GACxE,OAAO;EAGX,OAAO;CACT;CAEA,mBAA2B,MAAe,QAA+B;EACvE,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,gBAAgB,OAAO,MAAM,GACrC,OAAO;EAGX,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,MAAM,SAAS,KAAK,aAAa,IAAI;EACrC,IAAI,WAAW,QAAQ,KAAK,eAC1B,aAAa,MAAM,MAAM;EAE3B,OAAO;CACT;CAEA,aAAqB,MAAsC;EACzD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,QAAQ,YACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,aACX,OAAO;GACT,KAAK,QAAQ,mBACX,OAAO,KAAK,QAAQ;GACtB,KAAK,QAAQ,cACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,IAAI;GACrC,KAAK,QAAQ,aACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,gBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,WACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,kBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,sBAAsB,IAAI;GAExC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,YACX,OAAO,KAAK,sBAAsB,IAAI;GAExC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAC9B,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,QAAQ,gBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,OACX,OAAO,KAAK,gBAAgB,IAAI;GAClC,KAAK,QAAQ,SACX,OAAO,KAAK,kBAAkB,IAAI;GACpC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAC5B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAC9B,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAC5B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,qBACX,OAAO,KAAK,mBAAmB,IAAI;GAErC,KAAK,QAAQ,oBACX,OAAO,KAAK,wBAAwB,IAAI;GAE1C,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAC/B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,qBACX,OAAO,KAAK,iBAAiB,IAAI;GACnC,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;EACnC;EACA,OAAO;CACT;CAEA,QAAgB,MAAmB,MAAe,QAAyB;EACzE,KAAK,WAAW;GAAE;GAAM,MAAM,KAAK;GAAM,IAAI,KAAK;GAAI;EAAO,CAAC;EAC9D,IAAI,KAAK,gBACP,cAAc,MAAM,MAAM,MAAM;EAElC,OAAO;CACT;CAEA,WAAmB,MAAe,OAAsC;EACtE,IAAI,SAAS,KAAK,SAAS,QACzB,OAAO;EAET,OAAO,KAAK,cAAc,KAAK,SAAS,MAAM;CAChD;CAEA,sBAA8B,MAAe,OAAe,QAA+B;EACzF,IAAI,SAAS,KAAK,SAAS,QACzB,OAAO;EAET,IAAI,CAAC,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM,GACpD,OAAO;EAET,OAAO;CACT;CAEA,kBAA0B,MAAe,MAAoD;EAC3F,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,cAAc,KAAK,GAC3B,OAAO;EAGX,OAAO;CACT;CAEA,kBAA0B,MAAe,OAAoC;EAC3E,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,eAAe,MAAM,GAAG;GAC3B,KAAK,QAAQ,YAAY,iBAAiB,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACnF,OAAO;EACT;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAAwB;EACxD,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,OAAO;GAClC,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACjF,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBACE,MACA,OACA,WACA,WACqB;EACrB,MAAM,SAAS,KAAK,kBAAkB,MAAM,KAAK;EACjD,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,iBAC3B,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,YAAY;GACvC,MAAM,SACJ,cAAc,YAAY,wBAAwB,cAAc,SAC5D,CAAC,WAAW,UAAU,MAAM,CAAC,IAC7B,CAAC,UAAU,MAAM,CAAC;GACxB,KAAK,QAAQ,WAAW,KAAK,SAAS,QAAQ,MAAM;GACpD,OAAO;EACT;EACA,OAAO,OAAO,MAAM;CACtB;CAEA,sBAA8B,MAAe,OAAe,UAAuC;EACjG,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,eAAe,MAAM,GAAG;GAC3B,KAAK,QAAQ,YAAY,yBAAyB,KAAK,SAAS,QAAQ,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;GACrG,OAAO;EACT;EACA,IAAI,OAAO,WAAW,OAAO,iBAC3B,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,YAAY;GACvC,KAAK,QAAQ,YAAY,yBAAyB,KAAK,SAAS,QAAQ,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;GACrG,OAAO;EACT;EACA,OAAO,OAAO,MAAM;CACtB;CAEA,WAAmB,MAAsC;EACvD,OAAO,KAAK,OAAO,aAAa,IAAI;CACtC;CAEA,YAAoB,MAAsC;EACxD,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,OAAO,KAAK,QAAQ,IAAI,KAAK;EACnC,IAAI,CAAC,MACH,OAAO,KAAK,QAAQ,YAAY,gBAAgB,MAAM,CAAC,KAAK,CAAC;EAE/D,IAAI,KAAK,WAAW,OAAO,YAAY,KAAK,WAAW,OAAO,WAC5D,OAAO,KAAK,QAAQ,YAAY,uBAAuB,MAAM,CAAC,KAAK,CAAC;EAEtE,OAAO;CACT;CAEA,wBAAgC,MAAsC;EACpE,KAAK,OAAO,WAAW;EACvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAGT,MAAM,OAAmB,CAAC;EAC1B,KAAK,MAAM,SAAS,KAAK,OAAO,MAC9B,IAAI,MAAM,UAAU,GAClB,KAAK,KAAK;GAAE,OAAO,MAAM;GAAO,MAAM,MAAM;EAAK,CAAC;EAItD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,QAAQ,OAAO,WAAW,OAAO,YAAY,OAAO,WAAW,OAAO,WACnF,OAAO;EAET,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,IAAI,OAAO,WAAW,OAAO,OAC3B,OAAO;GACL,QAAQ,OAAO;GACP;GACF;EACR;OAEA,OAAO;GACL,QAAQ,OAAO;GACP;GACF;EACR;CAEJ;CAEA,kBAA0B,MAAsC;EAC9D,MAAM,WAAW,YAAY,KAAK,SAAS,EAAE;EAC7C,MAAM,WAAW,KAAK,QAAQ,IAAI,QAAQ;EAC1C,IAAI,UAAU,WAAW,OAAO,YAAY,UAAU,WAAW,OAAO,WACtE,OAAO,KAAK,QAAQ,YAAY,gBAAgB,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC;EAE9E,IAAI,KAAK,eACP,aAAa,KAAK,SAAS,IAAI,QAAQ;EAGzC,MAAM,cAAc,KAAK,mBAAmB,MAAM,UAAU,QAAQ;EACpE,IAAI,gBAAgB,MAClB,OAAO;EAET,IAAI,SAAS,OAAO,WAAW,OAAO,OACpC,OAAO,SAAS;OACX;GACL,MAAM,SAAS,eAAe,UAAU,SAAS,MAAM;GACvD,IAAI,YAAY,OAAO,GACrB,eAAe,QAAQ,WAAW;GAEpC,OAAO;EACT;CACF;CAEA,aAAqB,MAAsC;EACzD,MAAM,QAAQ,YAAY,IAAI;EAC9B,IAAI,CAAC,KAAK,qBAAqB,IAAI,GACjC,OAAO,KAAK,QAAQ,YAAY,cAAc,MAAM,CAAC,KAAK,CAAC;EAE7D,OAAO,KAAK;GAAE,QAAQ,OAAO;GAAO,QAAQ;EAAM,CAAC;CACrD;CAEA,cAAsB,MAAsC;EAY1D,IAAI;GAVF,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;EAEN,CAAA,CAAe,SAAS,KAAK,QAAQ,MAAiB,GACxD,OAAO,KAAK,QAAQ,YAAY,sBAAsB,IAAI;EAE5D,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,MAAM,WAAW,KAAK,SAAS;EAC/B,IAAI,SAAS,WAAW,QAAQ,eAC9B,OAAO,KAAK,QAAQ,YAAY,+BAA+B,QAAQ;EAEzE,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,WAAW,QAAQ,OAAO,CAAC;EAC1G,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,UAAkB,MAAsC;EACtD,IAAI,CAAC,KAAK,gBAAgB,MAAM,GAAG,YAAY,WAAW,GACxD,OAAO;EAET,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,kBAAkB,SAAS,MAAM,eACrC,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGxG,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,kBAAkB,SAAS,MAAM,eACrC,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGxG,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,eAAe,SAAS,MAAM,YAClC,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGtG,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,eAAe,SAAS,MAAM,YAClC,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGtG,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,SAAS,KAAK,sBAAsB,MAAM,GAAG,QAAQ;EAC3D,IAAI,WAAW,MACb,OAAO;OACF,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GACpD,OAAO;OACF,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GACjC,OAAO;EAGT,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,OAAO;CACT;CAEA,iBAAyB,MAAsC;EAC7D,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,KAAK,CAAC,KAAK,WAAW,MAAM,CAAC,GACvD,OAAO;EAET,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,MAAM,WAAW,gBAAgB,IAAI;EACrC,IAAI,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACpF,IAAI,UAAU,MACZ,OAAO;EAET,MAAM,WAAW,KAAK,SAAS,KAAK,MAAiB;EACrD,IAAI,UACF,QAAQ,KAAK,KAAK;EAEpB,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAGT,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,IAAI,UACF,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;OAEnG,OAAO,KAAK,QAAQ,YAAY,yBAAyB,MAAM;GAC7D,UAAU,KAAK;GACf;GACA,UAAU,KAAK,KAAK,CAAC;EACvB,CAAC;EAGL,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,UAA0B,CAAC;EACjC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,OAAO,KAAK,gBAAgB,MAAM,OAAO,YAAY,aAAa;GACxE,IAAI,SAAS,MACX,OAAO;QAEP,QAAQ,KAAK,IAAI;EAErB;EACA,OAAO,KAAK,MAAM,OAAO,CAAC;CAC5B;CAEA,aAAqB,MAAsC;EACzD,MAAM,OAAO,KAAK,gBAAgB,MAAM,GAAG,YAAY,cAAc;EACrE,IAAI,SAAS,MACX,OAAO;EAET,OAAO,KAAK,KAAK,IAAI,CAAC;CACxB;CAEA,WAAmB,MAAsC;EACvD,MAAM,aAA6B,CAAC;EACpC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,OAAO,KAAK,kBAAkB,MAAM,KAAK;GAC/C,IAAI,SAAS,MACX,OAAO;GAET,WAAW,KAAK,IAAI;EACtB;EACA,OAAO,MAAM,UAAU;CACzB;CAEA,iBAAyB,MAAsC;EAC7D,IAAI,OAA8B,KAAK,kBAAkB,MAAM,CAAC;EAChE,IAAI,SAAS,MACX,OAAO;EAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,YAAY,KAAK,kBAAkB,MAAM,KAAK;GACpD,IAAI,cAAc,MAChB,OAAO;GAGT,MAAM,QAAQ,mBAAmB,MAAM,SAAS;GAChD,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,oBAAoB,KAAK,SAAS,QAAQ,CACxE,UAAU,IAAI,GACd,UAAU,SAAS,CACrB,CAAC;GAEH,OAAO;EACT;EACA,OAAO,KAAK,IAAI;CAClB;CAEA,UAAkB,MAAsC;EACtD,OAAO,KAAK,iBAAiB,IAAI;CACnC;CAEA,YAAoB,MAAsC;EACxD,OAAO,KAAK,gBAAgB,MAAM,GAAG,YAAY,aAAa;CAChE;CAEA,mBAA2B,MAAsC;EAC/D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACtF,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACtF,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM;GAAC,UAAU,KAAK,KAAK,CAAC;GAAG,UAAU,KAAK,KAAK,CAAC;GAAG;EAAQ,CAAC;EAEjH,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,UAAU,KAAK,SAAS;EAC9B,MAAM,UAAU,KAAK,kBAAkB,MAAM,CAAC;EAC9C,IAAI,YAAY,MACd,OAAO;EAET,IAAI,QAAQ,WAAW,OAAO,iBAC5B,OAAO;EAET,IAAI,QAAQ,WAAW,OAAO,YAC5B,OAAO,KAAK,QAAQ,YAAY,6BAA6B,SAAS,CAAC,UAAU,UAAU,OAAO,CAAC,CAAC;EAEtG,MAAM,WAAW,OAAO,OAAO;EAC/B,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,kCAAkC,SAAS,CAAC,UAAU,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC;EAGlH,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAA6B,CAAC;EACpC,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,eAAe,UAAU,UAAU,KAAK;GAC9C,IAAI,iBAAiB,MACnB,OAAO,KAAK,QAAQ,YAAY,8BAA8B,SAAS;IACrE;IACA,OAAO,KAAK;IACZ,OAAO,SAAS,QAAQ,MAAM;IAC9B,UAAU,KAAK,QAAQ,CAAC;GAC1B,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,KAAK,WAAW,EAAE;OAEzB,OAAO,KAAK,MAAM,UAAU,CAAC;CAEjC;CAEA,kBAA0B,MAAsC;EAC9D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,UAAU,KAAK,SAAS;EAC9B,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,iBAC7B,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,iCAAiC,SAAS,CAAC,UAAU,UAAU,QAAQ,CAAC,CAAC;EAG3G,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAA6B,CAAC;EACpC,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,eAAe,UAAU,UAAU,KAAK;GAC9C,IAAI,iBAAiB,MACnB,OAAO,KAAK,QAAQ,YAAY,gCAAgC,SAAS;IACvE;IACA,OAAO,KAAK;IACZ,OAAO,SAAS,QAAQ,MAAM;IAC9B,UAAU,QAAQ;GACpB,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,WAAW;OAElB,OAAO,MAAM,UAAU;CAE3B;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAAa,QAAQ,WAAW,KAAK,SAAS,SAAS;EAC7D,IAAI,CAAC,cAAc,KAAK,SAAS,SAAS,GAAG;GAC3C,MAAM,aAAa,KAAK,SAAS,QAAQ;GACzC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,cAAc,MAAM;IACtE,OAAO,QAAQ,MAAM;IACrB,OAAO,KAAK,SAAS,SAAS,CAAC;IAC/B;GACF,CAAC;EACH;EAEA,MAAM,WAAW,KAAK,kBAAkB,MAAM,KAAK,SAAS,SAAS,CAAC;EACtE,IAAI,aAAa,MACf,OAAO;EAET,IACE,SAAS,WAAW,OAAO,mBAC1B,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,iBAE1E,OAAO;EAET,MAAM,mBAAmB,KAAK,4BAA4B,OAAO;EACjE,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,OAC3E,OAAO,KAAK,QAAQ,YAAY,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI;GAClG;GACA,UAAU,QAAQ;GAClB;EACF,CAAC;EAGH,MAAM,UAAU,OAAO,QAAQ;EAC/B,MAAM,QAAwB,CAAC;EAC/B,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,UAAU,UAAU,SAAS,KAAK;GACxC,IAAI,YAAY,MACd,OAAO,KAAK,QAAQ,YAAY,oBAAoB,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI;IAC3F;IACA,UAAU,QAAQ;IAClB,OAAO,KAAK;IACZ,OAAO,QAAQ,QAAQ,MAAM;GAC/B,CAAC;GAEH,MAAM,KAAK,OAAO;EACpB;EAEA,IAAI,YACF,KAAK,IAAI,QAAQ,GAAG,QAAQ,IAAI,KAAK,SAAS,QAAQ,SAAS;GAC7D,MAAM,QAAQ,KAAK,kBAAkB,MAAM,KAAK;GAChD,IAAI,UAAU,MACZ,OAAO;GAET,MAAM,gBAAgB,KAAK,MAAM,MAAM;GACvC,IAAI,MAAM,WAAW,OAAO,cAAc,CAAC,mBAAmB,MAAM,QAAQ,OAAO,KAAK,CAAC,GACvF,OAAO,KAAK,2BAA2B,MAAM,OAAO,OAAO,eAAe,QAAQ;EAEtF;OACK;GACL,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;GAC5C,IAAI,UAAU,MACZ,OAAO;GAET,MAAM,YAAY;GAClB,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC;GAClC,IAAI,UAAU,WAAW,OAAO,cAAc,CAAC,mBAAmB,UAAU,SAAS,GACnF,OAAO,KAAK,2BAA2B,MAAM,GAAG,WAAW,UAAU,QAAQ;EAEjF;EACA,OAAO;CACT;CAEA,4BAAoC,SAA2B;EAC7D,MAAM,WAAW,KAAK,IAAI,GAAG,SAAS,CAAC;EACvC,IAAI,YAAY,GACd,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,gBAAgB,CAAC,CAAC;EAE3D,MAAM,UAA0B,CAAC;EACjC,KAAK,IAAI,QAAQ,GAAG,SAAS,UAAU,SACrC,QAAQ,KAAK,EAAE,QAAQ,OAAO,gBAAgB,CAAC;EAEjD,OAAO,UAAU,KAAK,MAAM,OAAO,CAAC,CAAC;CACvC;CAEA,2BACE,MACA,YACA,OACA,UACA,UACM;EACN,MAAM,UAAU,KAAK,KAAK;EAC1B,IAAI,cAAc,SAAS,QAAQ,KAAK,mBAAmB,SAAS,QAAQ,GAC1E,OAAO,KAAK,QAAQ,YAAY,6BAA6B,KAAK,SAAS,aAAa,CACtF,UACA,UAAU,KAAK,CACjB,CAAC;EAEH,OAAO,KAAK,QAAQ,YAAY,4BAA4B,KAAK,SAAS,aAAa;GACrF,UAAU,KAAK;GACf,UAAU,QAAQ;GAClB;EACF,CAAC;CACH;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IACE,SAAS,WAAW,OAAO,mBAC1B,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,iBAE1E,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,YAC3E,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,IAAI,CAAC,UAAU,QAAQ,CAAC,CAAC;EAExF,OAAO,OAAO,QAAQ;CACxB;CAEA,mBAA2B,MAAsC;EAC/D,OAAO,KAAK,kBAAkB,MAAM,MAAM;CAC5C;CAEA,iBAAyB,MAAsC;EAC7D,KAAK,OAAO,WAAW;EAEvB,MAAM,SAAS,KAAK,gBAClB,MACA,GACA,YAAY,sBACZ,WAAW,QAAQ,mBAAmB,CACxC;EACA,IAAI,WAAW,MACb,OAAO;OACF,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GACpD,OAAO;OACF,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GACjC,OAAO;EAGT,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK,GAC9B,OAAO;EAIX,MAAM,OAAO,KAAK,kBAAkB,MAAM,CAAC;EAC3C,IAAI,SAAS,MACX,OAAO;EAGT,KAAK,OAAO,SAAS,IAAI;EACzB,OAAO,KAAK,IAAI;CAClB;CAEA,aAAqB,MAAsC;EACzD,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,WAAW,QAAQ,OAAO,CAAC;EAC1G,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,SAAS,KAAK,kBAAkB,MAAM,CAAC;EAC7C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,eAAuB,MAAsC;EAC3D,KAAK,OAAO,WAAW;EAEvB,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,QAAQ,GAC/C,OAAO;EAGT,MAAM,SAAS,KAAK,WAAW,QAAQ;EACvC,MAAM,iBAAiB,SAAS,IAAI;EAEpC,IAAI,iBAAiB,KAAK,kBAAkB,MAAM,cAAc;EAChE,IAAI,mBAAmB,MACrB,OAAO;EAET,IAAI,CAAC,mBAAmB,gBAAgB,QAAQ,GAC9C,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,iBAAiB;GAC5E,UAAU,cAAc;GACxB,UAAU,QAAQ;GAClB,WAAW,KAAK,MAAiB;EACnC,CAAC;EAGH,IAAI,YAAY,QAAQ,GACtB,KAAK,IAAI,UAAU,YAAY,sBAAsB,UAAU,GAAG,WAAW;GAC3E,KAAK,OAAO,SAAS,IAAI;GACzB,KAAK,OAAO,YAAY;GACxB,KAAK,OAAO,WAAW;GACvB,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,cAAc,GACrD,OAAO;GAET,MAAM,eAAe,KAAK,kBAAkB,MAAM,cAAc;GAChE,IAAI,iBAAiB,MACnB,OAAO;GAET,IAAI,cAAc,cAAc,cAAc,GAC5C;GAEF,iBAAiB;EACnB;EAGF,IAAI,QACF;OAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EACT;EAGF,KAAK,OAAO,SAAS,IAAI;EACzB,OAAO;CACT;CAEA,SAAiB,OAAyB;EACxC,OAAO,UAAU,QAAQ,UAAU,UAAU,QAAQ,gBAAgB,UAAU,QAAQ;CACzF;CAEA,qBAA6B,MAAwB;EACnD,OAAO,KAAK,UAAU,KAAK,WAAW,MAAM;GAC1C,IAAI,KAAK,WAAW,QAAQ,cAAc,OAAO;GACjD,OAAO,KAAK;EACd;EACA,OAAO;CACT;CAEA,mBAA2B,MAAe,OAAe,MAAsD;EAC7G,IAAI,KAAK,SAAS,SAAS,MAAM,KAAK,KAAK,QACzC,OAAO,KAAK,QAAQ,YAAY,kBAAkB,MAAM,CACtD,OAAO,KAAK,KAAK,MAAM,GACvB,OAAO,KAAK,SAAS,SAAS,CAAC,CACjC,CAAC;EAGH,MAAM,8BAAc,IAAI,IAA0B;EAClD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,YAAY,KAAK,kBAAkB,MAAM,KAAK;GACpD,IAAI,cAAc,MAChB,OAAO;GAET,MAAM,UAAU,eAAe,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC,IAAI;GAC/D,IAAI,CAAC,iBAAiB,aAAa,SAAS,SAAS,GAAG;IACtD,MAAM,eAAe,kBAAkB,OAAO;IAC9C,IAAI,YAAY,OAAO,GACrB,eAAe,cAAc,WAAW;IAE1C,KAAK,QAAQ,YAAY,qBAAqB,KAAK,SAAS,QAAQ,CAClE,GAAG,iBAAiB,KAAK,KAAK,QAAQ,EAAE,CAAC,OAAO,KAAK,EAAE,GAAG,UAAU,YAAY,KAChF,UAAU,SAAS,CACrB,CAAC;IACD,OAAO;GACT;EACF;EACA,OAAO;CACT;AACF;AAGA,SAAS,eAAe,UAAkB,MAAkC;CAC1E,QAAQ,KAAK,QAAb;EACE,SACE,MAAM,IAAI,MAAM,uBAAuB,SAAS,IAAI,KAAK,UAAU,IAAI,GAAG;EAC5E,KAAK,OAAO;EACZ,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO;GACV,IAAI,kBAAkB,KAAK,MAAM,GAC/B,OAAO;IACL,QAAQ,KAAK;IACb,QAAQ,gBAAgB,KAAK,QAAQ,QAAQ;GAC/C;GAEF,OAAO;EAET,KAAK,OAAO,YACV,OAAO;GACL,QAAQ,KAAK;GACb,MAAM,eAAe,UAAU,OAAO,IAAI,CAAC;EAC7C;EAEF,KAAK,OAAO,OAAO;GACjB,MAAM,UAA0B,CAAC;GACjC,KAAK,IAAI,QAAQ,GAAG,SAAS,KAAK,QAAQ,QAAQ,EAAE,OAClD,QAAQ,KAAK,eAAe,UAAU,UAAU,MAAM,KAAK,CAAE,CAAC;GAEhE,OAAO;IACL,QAAQ,KAAK;IACJ;GACX;EACF;CACF;AACF;AAUA,SAAS,kBAAkB,QAAyB;CAClD,OACE,WAAW,QAAQ,aACnB,WAAW,QAAQ,YACnB,WAAW,QAAQ,qBACnB,WAAW,QAAQ;AAEvB;AAEA,SAAS,iBAAiB,QAAyB;CACjD,OAAO,WAAW,QAAQ,qBAAqB,WAAW,QAAQ;AACpE;;AAGA,SAAS,uBAAuB,MAAe,QAA0B;CACvE,IAAI,UAA0B;CAC9B,OAAO,YAAY,MAAM;EACvB,IAAI,iBAAiB,QAAQ,MAAM,GACjC,OAAO;EAET,IAAI,YAAY,QACd,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;;AAGA,SAAS,0BAA0B,MAA+B;CAChE,IAAI,UAA0B;CAC9B,OAAO,YAAY,QAAQ,QAAQ,WAAW,MAAM;EAClD,MAAM,SAAkB,QAAQ;EAChC,IAAI,kBAAkB,OAAO,MAAM,GAEjC;OADmB,OAAO,SAAS,QAAQ,OACvC,IAAa,GACf,OAAO;EACT;EAEF,UAAU;CACZ;CACA,OAAO;AACT;;AAGA,IAAM,eAAN,MAAmB;CACjB;CAEA,OAA2B,CAAC;CAE5B,YAAY,SAAuE;EACjF,KAAK,UAAU;CACjB;CAEA,aAAmB;EACjB,KAAK,MAAM,SAAS,KAAK,MACvB,IAAI,MAAM,QAAQ,GAChB,MAAM,QAAQ,MAAM,QAAQ;CAGlC;CAEA,SAAS,MAAe,aAAsB,OAAa;EACzD,KAAK,MAAM,SAAS,KAAK,MAAM;GAC7B,MAAM;GACN,IAAI,CAAC,cAAc,MAAM,UAAU,KAAK,MAAM,aAAa,GACzD,KAAK,QAAQ,YAAY,cAAc,MAAM,CAAC,MAAM,KAAK,CAAC;EAE9D;CACF;CAEA,cAAoB;EAClB,KAAK,OAAO,KAAK,KAAK,QAAO,SAAQ,KAAK,QAAQ,CAAC;CACrD;CAEA,UAAU,MAAe,MAA6B;EACpD,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,WAAW,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EAC5D,IAAI,UACF,IAAI,SAAS,QAAQ,GAAG;GACtB,KAAK,QAAQ,YAAY,gBAAgB,MAAM,CAAC,KAAK,CAAC;GACtD,OAAO;EACT,OAAO;GACL,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,KAAK,CAAC;GAC1D,OAAO;EACT;EAEF,KAAK,KAAK,KAAK;GAAE;GAAO;GAAM,OAAO;GAAG,UAAU;EAAE,CAAC;EACrD,OAAO;CACT;CAEA,aAAa,MAAoC;EAC/C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EACzD,IAAI,UAAU,QACZ,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;OACzD,IAAI,MAAM,QAAQ,GAAG;GAC1B,MAAM,cAAc,0BAA0B,IAAI;GAClD,IAAI,gBAAgB,MAAM;IACxB,IAAI,uBAAuB,MAAM,WAAW,GAC1C,OAAO,KAAK,QAAQ,YAAY,0BAA0B,MAAM,CAAC,OAAO,UAAU,MAAM,IAAI,CAAC,CAAC;IAEhG,OAAO,KAAK,QAAQ,YAAY,4BAA4B,MAAM,CAAC,KAAK,CAAC;GAC3E;GACA,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;EAChE,OAAO;GACL,MAAM;GACN,OAAO,MAAM;EACf;CACF;AACF"}
+{"version":3,"file":"type-auditor.js","names":[],"sources":["../../../src/rslang/semantic/type-auditor.ts"],"sourcesContent":["/**\n * Module: Type auditor for AST type checking.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { annotateError, annotateType } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode } from '../error';\nimport { labelRSLangNode, labelToken, labelType } from '../labels';\nimport { TokenID } from '../parser/token';\n\nimport {\n  type Argument,\n  bool,\n  component,\n  debool,\n  type EchelonTuple,\n  EmptySetT,\n  type ExpressionType,\n  IntegerT,\n  isTemplateRadical,\n  isTypification,\n  LogicT,\n  mangleParamAlias,\n  mangleRadicalId,\n  type Parametrized,\n  tuple,\n  type TypeContext,\n  TypeID,\n  type Typification\n} from './typification';\nimport {\n  checkCompatibility,\n  checkEquality,\n  cloneTypification,\n  compareTemplated,\n  hasGenerics,\n  mergeTypifications,\n  substituteBase\n} from './typification-api';\n\n/** Type auditor for AST type checking. */\nexport class TypeAuditor {\n  private static readonly TYPE_DEDUCTION_DEPTH = 5;\n\n  private context: TypeContext;\n  private reporter?: ErrorReporter;\n  private locals: LocalContext;\n  private annotateTypes: boolean;\n  private annotateErrors: boolean;\n\n  constructor(context: TypeContext) {\n    this.annotateTypes = false;\n    this.annotateErrors = false;\n    this.context = context;\n    this.locals = new LocalContext(this.onError.bind(this));\n  }\n\n  public run(\n    ast: AstNode,\n    annotateTypes: boolean,\n    reporter?: ErrorReporter,\n    annotateErrors: boolean = false\n  ): ExpressionType | null {\n    if (ast.hasError) {\n      return null;\n    }\n    this.annotateTypes = annotateTypes;\n    this.annotateErrors = annotateErrors;\n    this.reporter = reporter;\n    this.clear();\n    return this.dispatchVisit(ast);\n  }\n\n  private clear(): void {\n    this.locals = new LocalContext(this.onError.bind(this));\n  }\n\n  private dispatchDeclare(node: AstNode, domain: Typification): boolean {\n    const result = this.processDeclare(node, domain);\n    if (result === true && this.annotateTypes) {\n      annotateType(node, domain);\n    }\n    return result;\n  }\n\n  private processDeclare(node: AstNode, domain: Typification): boolean {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node, domain);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node, domain);\n      case TokenID.NT_ENUM_DECL:\n        return this.declareEnumeration(node, domain);\n    }\n    return false;\n  }\n\n  private declareLocal(node: AstNode, domain: Typification): boolean {\n    return this.locals.pushLocal(node, domain);\n  }\n\n  private declareTuple(node: AstNode, domain: Typification): boolean {\n    if (domain.typeID !== TypeID.tuple || domain.factors.length !== node.children.length) {\n      this.onError(RSErrorCode.invalidCortegeDeclare, node.children[0]);\n      return false;\n    }\n    for (let child = 0; child < node.children.length; child++) {\n      if (!this.visitChildDeclaration(node, child, component(domain, child + 1)!)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private declareEnumeration(node: AstNode, domain: Typification): boolean {\n    for (const child of node.children) {\n      if (!this.dispatchDeclare(child, domain)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private dispatchVisit(node: AstNode): ExpressionType | null {\n    const result = this.processVisit(node);\n    if (result !== null && this.annotateTypes) {\n      annotateType(node, result);\n    }\n    return result;\n  }\n\n  private processVisit(node: AstNode): ExpressionType | null {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n      case TokenID.ID_FUNCTION:\n      case TokenID.ID_PREDICATE:\n        return this.visitGlobal(node);\n\n      case TokenID.ID_LOCAL:\n        return this.visitLocal(node);\n      case TokenID.ID_RADICAL:\n        return this.visitRadical(node);\n\n      case TokenID.LIT_INTEGER:\n        return IntegerT;\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return bool(IntegerT);\n      case TokenID.LIT_EMPTYSET:\n        return this.visitEmptySet(node);\n\n      case TokenID.NT_ARGUMENTS:\n        return this.visitArgumentsEnum(node);\n      case TokenID.NT_ARG_DECL:\n        return this.visitArgument(node);\n\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n        return this.visitArithmetic(node);\n\n      case TokenID.QUANTOR_UNIVERSAL:\n      case TokenID.QUANTOR_EXISTS:\n        return this.visitQuantifier(node);\n\n      case TokenID.LOGIC_NOT:\n        return this.visitNegation(node);\n\n      case TokenID.LOGIC_AND:\n      case TokenID.LOGIC_OR:\n      case TokenID.LOGIC_IMPLICATION:\n      case TokenID.LOGIC_EQUIVALENT:\n        return this.visitLogicBinary(node);\n\n      case TokenID.EQUAL:\n      case TokenID.NOTEQUAL:\n        return this.visitEquals(node);\n\n      case TokenID.GREATER:\n      case TokenID.LESSER:\n      case TokenID.GREATER_OR_EQ:\n      case TokenID.LESSER_OR_EQ:\n        return this.visitIntegerPredicate(node);\n\n      case TokenID.SET_IN:\n      case TokenID.SET_NOT_IN:\n      case TokenID.SUBSET:\n      case TokenID.SUBSET_OR_EQ:\n      case TokenID.NOT_SUBSET:\n        return this.visitSetexprPredicate(node);\n\n      case TokenID.DECART:\n        return this.visitDecart(node);\n      case TokenID.BOOLEAN:\n        return this.visitBoolean(node);\n\n      case TokenID.NT_TUPLE:\n        return this.visitTuple(node);\n      case TokenID.NT_ENUMERATION:\n        return this.visitEnumeration(node);\n\n      case TokenID.BIGPR:\n        return this.visitProjectSet(node);\n      case TokenID.SMALLPR:\n        return this.visitProjectTuple(node);\n      case TokenID.FILTER:\n        return this.visitFilter(node);\n\n      case TokenID.CARD:\n        return this.visitCard(node);\n      case TokenID.REDUCE:\n        return this.visitReduce(node);\n      case TokenID.BOOL:\n        return this.visitBool(node);\n      case TokenID.DEBOOL:\n        return this.visitDebool(node);\n\n      case TokenID.SET_UNION:\n      case TokenID.SET_INTERSECTION:\n      case TokenID.SET_MINUS:\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return this.visitSetexprBinary(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.visitFunctionDefinition(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ITERATE:\n        return this.visitIterate(node);\n      case TokenID.ASSIGN:\n        return this.visitAssign(node);\n\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitDeclarative(node);\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n    }\n    return null;\n  }\n\n  private onError(code: RSErrorCode, node: AstNode, params?: string[]): null {\n    this.reporter?.({ code, from: node.from, to: node.to, params });\n    if (this.annotateErrors) {\n      annotateError(node, code, params);\n    }\n    return null;\n  }\n\n  private visitChild(node: AstNode, index: number): ExpressionType | null {\n    if (index >= node.children.length) {\n      return null;\n    }\n    return this.dispatchVisit(node.children[index]);\n  }\n\n  private visitChildDeclaration(node: AstNode, index: number, domain: Typification): boolean {\n    if (index >= node.children.length) {\n      return false;\n    }\n    if (!this.dispatchDeclare(node.children[index], domain)) {\n      return false;\n    }\n    return true;\n  }\n\n  private visitAllAndReturn(node: AstNode, type: ExpressionType | null): ExpressionType | null {\n    for (const child of node.children) {\n      if (!this.dispatchVisit(child)) {\n        return null;\n      }\n    }\n    return type;\n  }\n\n  private childTypification(node: AstNode, index: number): Typification | null {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (!isTypification(result)) {\n      this.onError(RSErrorCode.expectedSetexpr, node.children[index], [labelType(result)]);\n      return null;\n    }\n    return result as Typification;\n  }\n\n  private childLogic(node: AstNode, index: number): boolean {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return false;\n    }\n    if (result.typeID !== TypeID.logic) {\n      this.onError(RSErrorCode.expectedLogic, node.children[index], [labelType(result)]);\n      return false;\n    }\n    return true;\n  }\n\n  private childTypeDebool(\n    node: AstNode,\n    index: number,\n    errorCode: RSErrorCode,\n    operation?: string\n  ): Typification | null {\n    const result = this.childTypification(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (result.typeID === TypeID.anyTypification) {\n      return result;\n    }\n    if (result.typeID !== TypeID.collection) {\n      const params =\n        errorCode === RSErrorCode.invalidTypeOperation && operation !== undefined\n          ? [operation, labelType(result)]\n          : [labelType(result)];\n      this.onError(errorCode, node.children[index], params);\n      return null;\n    }\n    return debool(result);\n  }\n\n  private childQuantifierDomain(node: AstNode, index: number, operator: string): Typification | null {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (!isTypification(result)) {\n      this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);\n      return null;\n    }\n    if (result.typeID === TypeID.anyTypification) {\n      return result;\n    }\n    if (result.typeID !== TypeID.collection) {\n      this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);\n      return null;\n    }\n    return debool(result);\n  }\n\n  private visitLocal(node: AstNode): ExpressionType | null {\n    return this.locals.getLocalType(node);\n  }\n\n  private visitGlobal(node: AstNode): ExpressionType | null {\n    const alias = getNodeText(node);\n    const type = this.context.get(alias);\n    if (!type) {\n      return this.onError(RSErrorCode.globalNotTyped, node, [alias]);\n    }\n    if (type.typeID === TypeID.function || type.typeID === TypeID.predicate) {\n      return this.onError(RSErrorCode.globalFuncWithoutArgs, node, [alias]);\n    }\n    return type;\n  }\n\n  private visitFunctionDefinition(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n    if (!this.visitChild(node, 0)) {\n      return null;\n    }\n\n    const args: Argument[] = [];\n    for (const local of this.locals.data) {\n      if (local.level === 1) {\n        args.push({ alias: local.alias, type: local.type });\n      }\n    }\n\n    const result = this.visitChild(node, 1);\n    if (result === null || result.typeID === TypeID.function || result.typeID === TypeID.predicate) {\n      return null;\n    }\n    this.locals.endScope(node.children[1]);\n    if (result.typeID === TypeID.logic) {\n      return {\n        typeID: TypeID.predicate,\n        result: result,\n        args: args\n      };\n    } else {\n      return {\n        typeID: TypeID.function,\n        result: result,\n        args: args\n      };\n    }\n  }\n\n  private visitFunctionCall(node: AstNode): ExpressionType | null {\n    const funcName = getNodeText(node.children[0]);\n    const funcType = this.context.get(funcName);\n    if (funcType?.typeID !== TypeID.function && funcType?.typeID !== TypeID.predicate) {\n      return this.onError(RSErrorCode.globalNotTyped, node.children[0], [funcName]);\n    }\n    if (this.annotateTypes) {\n      annotateType(node.children[0], funcType);\n    }\n\n    const substitutes = this.checkFuncArguments(node, funcName, funcType);\n    if (substitutes === null) {\n      return null;\n    }\n    if (funcType.result.typeID === TypeID.logic) {\n      return funcType.result;\n    } else {\n      const result = mangleRadicals(funcName, funcType.result);\n      if (substitutes.size > 0) {\n        substituteBase(result, substitutes);\n      }\n      return result;\n    }\n  }\n\n  private visitRadical(node: AstNode): ExpressionType | null {\n    const alias = getNodeText(node);\n    if (!this.isInsideFuncArgument(node)) {\n      return this.onError(RSErrorCode.radicalUsage, node, [alias]);\n    }\n    return bool({ typeID: TypeID.basic, baseID: alias });\n  }\n\n  private visitEmptySet(node: AstNode): ExpressionType | null {\n    const invalidParents: TokenID[] = [\n      TokenID.CARD,\n      TokenID.DEBOOL,\n      TokenID.SET_UNION,\n      TokenID.SET_INTERSECTION,\n      TokenID.SET_MINUS,\n      TokenID.SET_SYMMETRIC_MINUS,\n      TokenID.REDUCE,\n      TokenID.BIGPR,\n      TokenID.SMALLPR\n    ];\n    if (invalidParents.includes(node.parent?.typeID as TokenID)) {\n      return this.onError(RSErrorCode.invalidEmptySetUsage, node);\n    }\n    return EmptySetT;\n  }\n\n  private visitArgument(node: AstNode): ExpressionType | null {\n    const variable = node.children[0];\n    if (variable.typeID === TokenID.NT_TUPLE_DECL) {\n      return this.onError(RSErrorCode.invalidArgumentCortegeDeclare, variable);\n    }\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return domain;\n  }\n\n  private visitCard(node: AstNode): ExpressionType | null {\n    if (!this.childTypeDebool(node, 0, RSErrorCode.invalidCard)) {\n      return null;\n    }\n    return IntegerT;\n  }\n\n  private visitArithmetic(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n    if (!('isArithmetic' in type1 && type1.isArithmetic)) {\n      return this.onError(RSErrorCode.arithmeticNotSupported, node.children[0], [labelType(type1), operator]);\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!('isArithmetic' in type2 && type2.isArithmetic)) {\n      return this.onError(RSErrorCode.arithmeticNotSupported, node.children[1], [labelType(type2), operator]);\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return result;\n  }\n\n  private visitIntegerPredicate(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n    if (!('isOrdered' in type1 && type1.isOrdered)) {\n      return this.onError(RSErrorCode.orderingNotSupported, node.children[0], [labelType(type1), operator]);\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!('isOrdered' in type2 && type2.isOrdered)) {\n      return this.onError(RSErrorCode.orderingNotSupported, node.children[1], [labelType(type2), operator]);\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return LogicT;\n  }\n\n  private visitQuantifier(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const operator = labelRSLangNode(node);\n    const domain = this.childQuantifierDomain(node, 1, operator);\n    if (domain === null) {\n      return null;\n    } else if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    } else if (!this.childLogic(node, 2)) {\n      return null;\n    }\n\n    this.locals.endScope(node.children[2]);\n    return LogicT;\n  }\n\n  private visitNegation(node: AstNode): ExpressionType | null {\n    if (!this.childLogic(node, 0)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitLogicBinary(node: AstNode): ExpressionType | null {\n    if (!this.childLogic(node, 0) || !this.childLogic(node, 1)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitEquals(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return LogicT;\n  }\n\n  private visitSetexprPredicate(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);\n    if (type2 === null) {\n      return null;\n    }\n    const isSubset = this.isSubset(node.typeID as TokenID);\n    if (isSubset) {\n      type2 = bool(type2);\n    }\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      if (isSubset) {\n        return this.onError(RSErrorCode.typesNotEqual, node, [labelType(type1), labelType(type2), operator]);\n      } else {\n        return this.onError(RSErrorCode.invalidElementPredicate, node, [\n          labelType(type1),\n          operator,\n          labelType(bool(type2))\n        ]);\n      }\n    }\n    return LogicT;\n  }\n\n  private visitDecart(node: AstNode): ExpressionType | null {\n    const factors: Typification[] = [];\n    for (let child = 0; child < node.children.length; child++) {\n      const type = this.childTypeDebool(node, child, RSErrorCode.invalidDecart);\n      if (type === null) {\n        return null;\n      } else {\n        factors.push(type);\n      }\n    }\n    return bool(tuple(factors));\n  }\n\n  private visitBoolean(node: AstNode): ExpressionType | null {\n    const type = this.childTypeDebool(node, 0, RSErrorCode.invalidBoolean);\n    if (type === null) {\n      return null;\n    }\n    return bool(bool(type));\n  }\n\n  private visitTuple(node: AstNode): ExpressionType | null {\n    const components: Typification[] = [];\n    for (let child = 0; child < node.children.length; child++) {\n      const type = this.childTypification(node, child);\n      if (type === null) {\n        return null;\n      }\n      components.push(type);\n    }\n    return tuple(components);\n  }\n\n  private visitEnumeration(node: AstNode): ExpressionType | null {\n    let type: ExpressionType | null = this.childTypification(node, 0);\n    if (type === null) {\n      return null;\n    }\n    for (let child = 1; child < node.children.length; child++) {\n      const childType = this.childTypification(node, child);\n      if (childType === null) {\n        return null;\n      }\n\n      const merge = mergeTypifications(type, childType);\n      if (merge === null) {\n        return this.onError(RSErrorCode.invalidEnumeration, node.children[child], [\n          labelType(type),\n          labelType(childType)\n        ]);\n      }\n      type = merge;\n    }\n    return bool(type);\n  }\n\n  private visitBool(node: AstNode): ExpressionType | null {\n    return this.visitEnumeration(node);\n  }\n\n  private visitDebool(node: AstNode): ExpressionType | null {\n    return this.childTypeDebool(node, 0, RSErrorCode.invalidDebool);\n  }\n\n  private visitSetexprBinary(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation, operator);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);\n    if (type2 === null) {\n      return null;\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotEqual, node, [labelType(bool(type1)), labelType(bool(type2)), operator]);\n    }\n    return bool(result);\n  }\n\n  private visitProjectSet(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const argNode = node.children[0];\n    const argType = this.childTypification(node, 0);\n    if (argType === null) {\n      return null;\n    }\n    if (argType.typeID === TypeID.anyTypification) {\n      return EmptySetT;\n    }\n    if (argType.typeID !== TypeID.collection) {\n      return this.onError(RSErrorCode.projectionSetArgumentNotSet, argNode, [operator, labelType(argType)]);\n    }\n    const argument = debool(argType);\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.projectionSetArgumentNotTupleSet, argNode, [operator, labelType(bool(argument))]);\n    }\n\n    const indices = getNodeIndices(node);\n    const components: Typification[] = [];\n    for (const index of indices) {\n      const newComponent = component(argument, index);\n      if (newComponent === null) {\n        return this.onError(RSErrorCode.projectionSetIndexOutOfRange, argNode, [\n          operator,\n          String(index),\n          String(argument.factors.length),\n          labelType(bool(argument))\n        ]);\n      } else {\n        components.push(newComponent);\n      }\n    }\n    if (components.length === 1) {\n      return bool(components[0]);\n    } else {\n      return bool(tuple(components));\n    }\n  }\n\n  private visitProjectTuple(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const argNode = node.children[0];\n    const argument = this.childTypification(node, 0);\n    if (argument === null) {\n      return null;\n    }\n    if (argument.typeID === TypeID.anyTypification) {\n      return argument;\n    }\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.projectionTupleArgumentNotTuple, argNode, [operator, labelType(argument)]);\n    }\n\n    const indices = getNodeIndices(node);\n    const components: Typification[] = [];\n    for (const index of indices) {\n      const newComponent = component(argument, index);\n      if (newComponent === null) {\n        return this.onError(RSErrorCode.projectionTupleIndexOutOfRange, argNode, [\n          operator,\n          String(index),\n          String(argument.factors.length),\n          labelType(argument)\n        ]);\n      } else {\n        components.push(newComponent);\n      }\n    }\n    if (components.length === 1) {\n      return components[0];\n    } else {\n      return tuple(components);\n    }\n  }\n\n  private visitFilter(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const indices = getNodeIndices(node);\n    const tupleParam = indices.length === node.children.length - 1;\n    if (!tupleParam && node.children.length > 2) {\n      const extraParam = node.children[indices.length];\n      return this.onError(RSErrorCode.invalidFilterArity, extraParam ?? node, [\n        String(indices.length),\n        String(node.children.length - 1),\n        operator\n      ]);\n    }\n\n    const argument = this.childTypification(node, node.children.length - 1);\n    if (argument === null) {\n      return null;\n    }\n    if (\n      argument.typeID === TypeID.anyTypification ||\n      (argument.typeID === TypeID.collection && argument.base.typeID === TypeID.anyTypification)\n    ) {\n      return EmptySetT;\n    }\n    const expectedArgument = this.expectedFilterArgumentLabel(indices);\n    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidFilterArgumentType, node.children[node.children.length - 1], [\n        operator,\n        labelType(argument),\n        expectedArgument\n      ]);\n    }\n\n    const argBase = debool(argument) as EchelonTuple;\n    const bases: Typification[] = [];\n    for (const index of indices) {\n      const newBase = component(argBase, index);\n      if (newBase === null) {\n        return this.onError(RSErrorCode.invalidFilterIndex, node.children[node.children.length - 1], [\n          operator,\n          labelType(argument),\n          String(index),\n          String(argBase.factors.length)\n        ]);\n      }\n      bases.push(newBase);\n    }\n\n    if (tupleParam) {\n      for (let child = 0; child + 1 < node.children.length; child++) {\n        const param = this.childTypification(node, child);\n        if (param === null) {\n          return null;\n        }\n        const expectedParam = bool(bases[child]);\n        if (param.typeID !== TypeID.collection || !checkCompatibility(bases[child], debool(param))) {\n          return this.reportFilterParameterError(node, child, param, expectedParam, operator);\n        }\n      }\n    } else {\n      const param = this.childTypification(node, 0);\n      if (param === null) {\n        return null;\n      }\n      const paramType = param;\n      const expected = bool(tuple(bases));\n      if (paramType.typeID !== TypeID.collection || !checkCompatibility(expected, paramType)) {\n        return this.reportFilterParameterError(node, 0, paramType, expected, operator);\n      }\n    }\n    return argument;\n  }\n\n  private expectedFilterArgumentLabel(indices: number[]): string {\n    const maxIndex = Math.max(...indices, 0);\n    if (maxIndex <= 1) {\n      return labelType(bool({ typeID: TypeID.anyTypification }));\n    }\n    const factors: Typification[] = [];\n    for (let index = 1; index <= maxIndex; index++) {\n      factors.push({ typeID: TypeID.anyTypification });\n    }\n    return labelType(bool(tuple(factors)));\n  }\n\n  private reportFilterParameterError(\n    node: AstNode,\n    childIndex: number,\n    param: Typification,\n    expected: Typification,\n    operator: string\n  ): null {\n    const wrapped = bool(param);\n    if (checkEquality(wrapped, expected) || checkCompatibility(wrapped, expected)) {\n      return this.onError(RSErrorCode.invalidFilterBooleanEchelon, node.children[childIndex], [\n        operator,\n        labelType(param)\n      ]);\n    }\n    return this.onError(RSErrorCode.invalidFilterParameterType, node.children[childIndex], [\n      labelType(param),\n      labelType(expected),\n      operator\n    ]);\n  }\n\n  private visitReduce(node: AstNode): ExpressionType | null {\n    const argument = this.childTypification(node, 0);\n    if (argument === null) {\n      return null;\n    }\n    if (\n      argument.typeID === TypeID.anyTypification ||\n      (argument.typeID === TypeID.collection && argument.base.typeID === TypeID.anyTypification)\n    ) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.collection) {\n      return this.onError(RSErrorCode.invalidReduce, node.children[0], [labelType(argument)]);\n    }\n    return debool(argument);\n  }\n\n  private visitArgumentsEnum(node: AstNode): ExpressionType | null {\n    return this.visitAllAndReturn(node, LogicT);\n  }\n\n  private visitDeclarative(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const domain = this.childTypeDebool(\n      node,\n      1,\n      RSErrorCode.invalidTypeOperation,\n      labelToken(TokenID.NT_DECLARATIVE_EXPR)\n    );\n    if (domain === null) {\n      return null;\n    } else if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    } else if (!this.childLogic(node, 2)) {\n      return null;\n    }\n\n    this.locals.endScope(node.children[2]);\n    return bool(domain);\n  }\n\n  private visitImperative(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    for (let child = 1; child < node.children.length; child++) {\n      if (!this.childLogic(node, child)) {\n        return null;\n      }\n    }\n\n    const type = this.childTypification(node, 0);\n    if (type === null) {\n      return null;\n    }\n\n    this.locals.endScope(node);\n    return bool(type);\n  }\n\n  private visitIterate(node: AstNode): ExpressionType | null {\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitAssign(node: AstNode): ExpressionType | null {\n    const domain = this.childTypification(node, 1);\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitRecursion(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const initType = this.childTypification(node, 1);\n    if (initType === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, initType)) {\n      return null;\n    }\n\n    const isFull = node.typeID === TokenID.NT_RECURSIVE_FULL;\n    const iterationIndex = isFull ? 3 : 2;\n\n    let iterationValue = this.childTypification(node, iterationIndex);\n    if (iterationValue === null) {\n      return null;\n    }\n    if (!checkCompatibility(iterationValue, initType)) {\n      return this.onError(RSErrorCode.typesNotEqual, node.children[iterationIndex], [\n        labelType(iterationValue),\n        labelType(initType),\n        labelToken(node.typeID as TokenID)\n      ]);\n    }\n\n    if (hasGenerics(initType)) {\n      for (let retries = TypeAuditor.TYPE_DEDUCTION_DEPTH; retries > 0; retries--) {\n        this.locals.endScope(node);\n        this.locals.clearUnused();\n        this.locals.startScope();\n        if (!this.visitChildDeclaration(node, 0, iterationValue)) {\n          return null;\n        }\n        const newIteration = this.childTypification(node, iterationIndex);\n        if (newIteration === null) {\n          return null;\n        }\n        if (checkEquality(newIteration, iterationValue)) {\n          break;\n        }\n        iterationValue = newIteration;\n      }\n    }\n\n    if (isFull) {\n      if (!this.childLogic(node, 2)) {\n        return null;\n      }\n    }\n\n    this.locals.endScope(node);\n    return iterationValue;\n  }\n\n  private isSubset(token: TokenID): boolean {\n    return token === TokenID.SUBSET || token === TokenID.SUBSET_OR_EQ || token === TokenID.NOT_SUBSET;\n  }\n\n  private isInsideFuncArgument(node: AstNode): boolean {\n    while (node.parent && node.parent !== node) {\n      if (node.typeID === TokenID.NT_ARGUMENTS) return true;\n      node = node.parent;\n    }\n    return false;\n  }\n\n  private checkFuncArguments(node: AstNode, alias: string, type: Parametrized): Map<string, Typification> | null {\n    if (node.children.length - 1 !== type.args.length) {\n      return this.onError(RSErrorCode.invalidArgsArity, node, [\n        String(type.args.length),\n        String(node.children.length - 1)\n      ]);\n    }\n\n    const substitutes = new Map<string, Typification>();\n    for (let child = 1; child < node.children.length; child++) {\n      const childType = this.childTypification(node, child);\n      if (childType === null) {\n        return null;\n      }\n      const argType = mangleRadicals(alias, type.args[child - 1].type);\n      if (!compareTemplated(substitutes, argType, childType)) {\n        const expectedType = cloneTypification(argType);\n        if (substitutes.size > 0) {\n          substituteBase(expectedType, substitutes);\n        }\n        this.onError(RSErrorCode.invalidArgumentType, node.children[child], [\n          `${mangleParamAlias(type.args[child - 1].alias, alias)}∈${labelType(expectedType)}`,\n          labelType(childType)\n        ]);\n        return null;\n      }\n    }\n    return substitutes;\n  }\n}\n\n// ========= Internals ========\nfunction mangleRadicals(funcName: string, type: Typification): Typification {\n  switch (type.typeID) {\n    default:\n      throw new Error(`Unexpected type for ${funcName}: ${JSON.stringify(type)}`);\n    case TypeID.anyTypification:\n    case TypeID.integer:\n      return type;\n    case TypeID.basic: {\n      if (isTemplateRadical(type.baseID)) {\n        return {\n          typeID: type.typeID,\n          baseID: mangleRadicalId(type.baseID, funcName)\n        };\n      }\n      return type;\n    }\n    case TypeID.collection: {\n      return {\n        typeID: type.typeID,\n        base: mangleRadicals(funcName, debool(type))\n      };\n    }\n    case TypeID.tuple: {\n      const factors: Typification[] = [];\n      for (let index = 1; index <= type.factors.length; ++index) {\n        factors.push(mangleRadicals(funcName, component(type, index)!));\n      }\n      return {\n        typeID: type.typeID,\n        factors: factors\n      };\n    }\n  }\n}\n\n/** Local variable data. */\ninterface LocalData {\n  alias: string;\n  level: number;\n  useCount: number;\n  type: Typification;\n}\n\nfunction isLogicBinaryNode(typeID: number): boolean {\n  return (\n    typeID === TokenID.LOGIC_AND ||\n    typeID === TokenID.LOGIC_OR ||\n    typeID === TokenID.LOGIC_IMPLICATION ||\n    typeID === TokenID.LOGIC_EQUIVALENT\n  );\n}\n\nfunction isQuantifierNode(typeID: number): boolean {\n  return typeID === TokenID.QUANTOR_UNIVERSAL || typeID === TokenID.QUANTOR_EXISTS;\n}\n\n/** Quantifier on the path from `node` up through `stopAt` (inclusive). */\nfunction pathContainsQuantifier(node: AstNode, stopAt: AstNode): boolean {\n  let current: AstNode | null = node;\n  while (current !== null) {\n    if (isQuantifierNode(current.typeID)) {\n      return true;\n    }\n    if (current === stopAt) {\n      return false;\n    }\n    current = current.parent;\n  }\n  return false;\n}\n\n/** Right operand subtree of the innermost logic binary containing `node`. */\nfunction findRightLogicOperandRoot(node: AstNode): AstNode | null {\n  let current: AstNode | null = node;\n  while (current !== null && current.parent !== null) {\n    const parent: AstNode = current.parent;\n    if (isLogicBinaryNode(parent.typeID)) {\n      const childIndex = parent.children.indexOf(current);\n      if (childIndex > 0) {\n        return current;\n      }\n    }\n    current = parent;\n  }\n  return null;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  private onError: (code: RSErrorCode, node: AstNode, params: string[]) => null;\n\n  public data: LocalData[] = [];\n\n  constructor(onError: (code: RSErrorCode, node: AstNode, params: string[]) => null) {\n    this.onError = onError;\n  }\n\n  startScope(): void {\n    for (const local of this.data) {\n      if (local.level > 0) {\n        local.level = local.level + 1;\n      }\n    }\n  }\n\n  endScope(node: AstNode, skipUnused: boolean = false): void {\n    for (const local of this.data) {\n      local.level--;\n      if (!skipUnused && local.level === 0 && local.useCount === 0) {\n        this.onError(RSErrorCode.localNotUsed, node, [local.alias]);\n      }\n    }\n  }\n\n  clearUnused(): void {\n    this.data = this.data.filter(data => data.level > 0);\n  }\n\n  pushLocal(node: AstNode, type: Typification): boolean {\n    const alias = getNodeText(node);\n    const existing = this.data.find(data => data.alias === alias);\n    if (existing) {\n      if (existing.level > 0) {\n        this.onError(RSErrorCode.localShadowing, node, [alias]);\n        return false;\n      } else {\n        this.onError(RSErrorCode.localDoubleDeclare, node, [alias]);\n        return false;\n      }\n    }\n    this.data.push({ alias, type, level: 1, useCount: 0 });\n    return true;\n  }\n\n  getLocalType(node: AstNode): Typification | null {\n    const alias = getNodeText(node);\n    const local = this.data.find(data => data.alias === alias);\n    if (local === undefined) {\n      return this.onError(RSErrorCode.localUndeclared, node, [alias]);\n    } else if (local.level < 1) {\n      const subexprRoot = findRightLogicOperandRoot(node);\n      if (subexprRoot !== null) {\n        if (pathContainsQuantifier(node, subexprRoot)) {\n          return this.onError(RSErrorCode.localUndeclaredInSubexpr, node, [alias, labelType(local.type)]);\n        }\n        return this.onError(RSErrorCode.localOutOfScopeParentheses, node, [alias]);\n      }\n      return this.onError(RSErrorCode.localOutOfScope, node, [alias]);\n    } else {\n      local.useCount++;\n      return local.type;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAyCA,IAAa,cAAb,MAAa,YAAY;CACvB,OAAwB,uBAAuB;CAE/C;CACA;CACA;CACA;CACA;CAEA,YAAY,SAAsB;EAChC,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,UAAU;EACf,KAAK,SAAS,IAAI,aAAa,KAAK,QAAQ,KAAK,IAAI,CAAC;CACxD;CAEA,IACE,KACA,eACA,UACA,iBAA0B,OACH;EACvB,IAAI,IAAI,UACN,OAAO;EAET,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,WAAW;EAChB,KAAK,MAAM;EACX,OAAO,KAAK,cAAc,GAAG;CAC/B;CAEA,QAAsB;EACpB,KAAK,SAAS,IAAI,aAAa,KAAK,QAAQ,KAAK,IAAI,CAAC;CACxD;CAEA,gBAAwB,MAAe,QAA+B;EACpE,MAAM,SAAS,KAAK,eAAe,MAAM,MAAM;EAC/C,IAAI,WAAW,QAAQ,KAAK,eAC1B,aAAa,MAAM,MAAM;EAE3B,OAAO;CACT;CAEA,eAAuB,MAAe,QAA+B;EACnE,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,MAAM,MAAM;GACvC,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,MAAM,MAAM;GACvC,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,MAAM,MAAM;EAC/C;EACA,OAAO;CACT;CAEA,aAAqB,MAAe,QAA+B;EACjE,OAAO,KAAK,OAAO,UAAU,MAAM,MAAM;CAC3C;CAEA,aAAqB,MAAe,QAA+B;EACjE,IAAI,OAAO,WAAW,OAAO,SAAS,OAAO,QAAQ,WAAW,KAAK,SAAS,QAAQ;GACpF,KAAK,QAAQ,YAAY,uBAAuB,KAAK,SAAS,EAAE;GAChE,OAAO;EACT;EACA,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,sBAAsB,MAAM,OAAO,UAAU,QAAQ,QAAQ,CAAC,CAAE,GACxE,OAAO;EAGX,OAAO;CACT;CAEA,mBAA2B,MAAe,QAA+B;EACvE,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,gBAAgB,OAAO,MAAM,GACrC,OAAO;EAGX,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,MAAM,SAAS,KAAK,aAAa,IAAI;EACrC,IAAI,WAAW,QAAQ,KAAK,eAC1B,aAAa,MAAM,MAAM;EAE3B,OAAO;CACT;CAEA,aAAqB,MAAsC;EACzD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,QAAQ,YACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,aACX,OAAO;GACT,KAAK,QAAQ,mBACX,OAAO,KAAK,QAAQ;GACtB,KAAK,QAAQ,cACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,IAAI;GACrC,KAAK,QAAQ,aACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,gBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,WACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,kBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,sBAAsB,IAAI;GAExC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,YACX,OAAO,KAAK,sBAAsB,IAAI;GAExC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAC9B,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,QAAQ,gBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,OACX,OAAO,KAAK,gBAAgB,IAAI;GAClC,KAAK,QAAQ,SACX,OAAO,KAAK,kBAAkB,IAAI;GACpC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAC5B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAC9B,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAC5B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,qBACX,OAAO,KAAK,mBAAmB,IAAI;GAErC,KAAK,QAAQ,oBACX,OAAO,KAAK,wBAAwB,IAAI;GAE1C,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAC/B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,qBACX,OAAO,KAAK,iBAAiB,IAAI;GACnC,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;EACnC;EACA,OAAO;CACT;CAEA,QAAgB,MAAmB,MAAe,QAAyB;EACzE,KAAK,WAAW;GAAE;GAAM,MAAM,KAAK;GAAM,IAAI,KAAK;GAAI;EAAO,CAAC;EAC9D,IAAI,KAAK,gBACP,cAAc,MAAM,MAAM,MAAM;EAElC,OAAO;CACT;CAEA,WAAmB,MAAe,OAAsC;EACtE,IAAI,SAAS,KAAK,SAAS,QACzB,OAAO;EAET,OAAO,KAAK,cAAc,KAAK,SAAS,MAAM;CAChD;CAEA,sBAA8B,MAAe,OAAe,QAA+B;EACzF,IAAI,SAAS,KAAK,SAAS,QACzB,OAAO;EAET,IAAI,CAAC,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM,GACpD,OAAO;EAET,OAAO;CACT;CAEA,kBAA0B,MAAe,MAAoD;EAC3F,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,cAAc,KAAK,GAC3B,OAAO;EAGX,OAAO;CACT;CAEA,kBAA0B,MAAe,OAAoC;EAC3E,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,eAAe,MAAM,GAAG;GAC3B,KAAK,QAAQ,YAAY,iBAAiB,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACnF,OAAO;EACT;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAAwB;EACxD,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,OAAO;GAClC,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACjF,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBACE,MACA,OACA,WACA,WACqB;EACrB,MAAM,SAAS,KAAK,kBAAkB,MAAM,KAAK;EACjD,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,iBAC3B,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,YAAY;GACvC,MAAM,SACJ,cAAc,YAAY,wBAAwB,cAAc,SAC5D,CAAC,WAAW,UAAU,MAAM,CAAC,IAC7B,CAAC,UAAU,MAAM,CAAC;GACxB,KAAK,QAAQ,WAAW,KAAK,SAAS,QAAQ,MAAM;GACpD,OAAO;EACT;EACA,OAAO,OAAO,MAAM;CACtB;CAEA,sBAA8B,MAAe,OAAe,UAAuC;EACjG,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,eAAe,MAAM,GAAG;GAC3B,KAAK,QAAQ,YAAY,yBAAyB,KAAK,SAAS,QAAQ,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;GACrG,OAAO;EACT;EACA,IAAI,OAAO,WAAW,OAAO,iBAC3B,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,YAAY;GACvC,KAAK,QAAQ,YAAY,yBAAyB,KAAK,SAAS,QAAQ,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;GACrG,OAAO;EACT;EACA,OAAO,OAAO,MAAM;CACtB;CAEA,WAAmB,MAAsC;EACvD,OAAO,KAAK,OAAO,aAAa,IAAI;CACtC;CAEA,YAAoB,MAAsC;EACxD,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,OAAO,KAAK,QAAQ,IAAI,KAAK;EACnC,IAAI,CAAC,MACH,OAAO,KAAK,QAAQ,YAAY,gBAAgB,MAAM,CAAC,KAAK,CAAC;EAE/D,IAAI,KAAK,WAAW,OAAO,YAAY,KAAK,WAAW,OAAO,WAC5D,OAAO,KAAK,QAAQ,YAAY,uBAAuB,MAAM,CAAC,KAAK,CAAC;EAEtE,OAAO;CACT;CAEA,wBAAgC,MAAsC;EACpE,KAAK,OAAO,WAAW;EACvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAGT,MAAM,OAAmB,CAAC;EAC1B,KAAK,MAAM,SAAS,KAAK,OAAO,MAC9B,IAAI,MAAM,UAAU,GAClB,KAAK,KAAK;GAAE,OAAO,MAAM;GAAO,MAAM,MAAM;EAAK,CAAC;EAItD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,QAAQ,OAAO,WAAW,OAAO,YAAY,OAAO,WAAW,OAAO,WACnF,OAAO;EAET,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,IAAI,OAAO,WAAW,OAAO,OAC3B,OAAO;GACL,QAAQ,OAAO;GACP;GACF;EACR;OAEA,OAAO;GACL,QAAQ,OAAO;GACP;GACF;EACR;CAEJ;CAEA,kBAA0B,MAAsC;EAC9D,MAAM,WAAW,YAAY,KAAK,SAAS,EAAE;EAC7C,MAAM,WAAW,KAAK,QAAQ,IAAI,QAAQ;EAC1C,IAAI,UAAU,WAAW,OAAO,YAAY,UAAU,WAAW,OAAO,WACtE,OAAO,KAAK,QAAQ,YAAY,gBAAgB,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC;EAE9E,IAAI,KAAK,eACP,aAAa,KAAK,SAAS,IAAI,QAAQ;EAGzC,MAAM,cAAc,KAAK,mBAAmB,MAAM,UAAU,QAAQ;EACpE,IAAI,gBAAgB,MAClB,OAAO;EAET,IAAI,SAAS,OAAO,WAAW,OAAO,OACpC,OAAO,SAAS;OACX;GACL,MAAM,SAAS,eAAe,UAAU,SAAS,MAAM;GACvD,IAAI,YAAY,OAAO,GACrB,eAAe,QAAQ,WAAW;GAEpC,OAAO;EACT;CACF;CAEA,aAAqB,MAAsC;EACzD,MAAM,QAAQ,YAAY,IAAI;EAC9B,IAAI,CAAC,KAAK,qBAAqB,IAAI,GACjC,OAAO,KAAK,QAAQ,YAAY,cAAc,MAAM,CAAC,KAAK,CAAC;EAE7D,OAAO,KAAK;GAAE,QAAQ,OAAO;GAAO,QAAQ;EAAM,CAAC;CACrD;CAEA,cAAsB,MAAsC;EAY1D,IAAI;GAVF,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;EAEN,CAAA,CAAe,SAAS,KAAK,QAAQ,MAAiB,GACxD,OAAO,KAAK,QAAQ,YAAY,sBAAsB,IAAI;EAE5D,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,MAAM,WAAW,KAAK,SAAS;EAC/B,IAAI,SAAS,WAAW,QAAQ,eAC9B,OAAO,KAAK,QAAQ,YAAY,+BAA+B,QAAQ;EAEzE,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,WAAW,QAAQ,OAAO,CAAC;EAC1G,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,UAAkB,MAAsC;EACtD,IAAI,CAAC,KAAK,gBAAgB,MAAM,GAAG,YAAY,WAAW,GACxD,OAAO;EAET,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,kBAAkB,SAAS,MAAM,eACrC,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGxG,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,kBAAkB,SAAS,MAAM,eACrC,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGxG,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,eAAe,SAAS,MAAM,YAClC,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGtG,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,eAAe,SAAS,MAAM,YAClC,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGtG,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,SAAS,KAAK,sBAAsB,MAAM,GAAG,QAAQ;EAC3D,IAAI,WAAW,MACb,OAAO;OACF,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GACpD,OAAO;OACF,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GACjC,OAAO;EAGT,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,OAAO;CACT;CAEA,iBAAyB,MAAsC;EAC7D,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,KAAK,CAAC,KAAK,WAAW,MAAM,CAAC,GACvD,OAAO;EAET,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,MAAM,WAAW,gBAAgB,IAAI;EACrC,IAAI,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACpF,IAAI,UAAU,MACZ,OAAO;EAET,MAAM,WAAW,KAAK,SAAS,KAAK,MAAiB;EACrD,IAAI,UACF,QAAQ,KAAK,KAAK;EAEpB,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAGT,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAAG;GACrC,IAAI,UACF,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM;IAAC,UAAU,KAAK;IAAG,UAAU,KAAK;IAAG;GAAQ,CAAC;QAEnG,OAAO,KAAK,QAAQ,YAAY,yBAAyB,MAAM;IAC7D,UAAU,KAAK;IACf;IACA,UAAU,KAAK,KAAK,CAAC;GACvB,CAAC;EAEL;EACA,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,UAA0B,CAAC;EACjC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,OAAO,KAAK,gBAAgB,MAAM,OAAO,YAAY,aAAa;GACxE,IAAI,SAAS,MACX,OAAO;QAEP,QAAQ,KAAK,IAAI;EAErB;EACA,OAAO,KAAK,MAAM,OAAO,CAAC;CAC5B;CAEA,aAAqB,MAAsC;EACzD,MAAM,OAAO,KAAK,gBAAgB,MAAM,GAAG,YAAY,cAAc;EACrE,IAAI,SAAS,MACX,OAAO;EAET,OAAO,KAAK,KAAK,IAAI,CAAC;CACxB;CAEA,WAAmB,MAAsC;EACvD,MAAM,aAA6B,CAAC;EACpC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,OAAO,KAAK,kBAAkB,MAAM,KAAK;GAC/C,IAAI,SAAS,MACX,OAAO;GAET,WAAW,KAAK,IAAI;EACtB;EACA,OAAO,MAAM,UAAU;CACzB;CAEA,iBAAyB,MAAsC;EAC7D,IAAI,OAA8B,KAAK,kBAAkB,MAAM,CAAC;EAChE,IAAI,SAAS,MACX,OAAO;EAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,YAAY,KAAK,kBAAkB,MAAM,KAAK;GACpD,IAAI,cAAc,MAChB,OAAO;GAGT,MAAM,QAAQ,mBAAmB,MAAM,SAAS;GAChD,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,oBAAoB,KAAK,SAAS,QAAQ,CACxE,UAAU,IAAI,GACd,UAAU,SAAS,CACrB,CAAC;GAEH,OAAO;EACT;EACA,OAAO,KAAK,IAAI;CAClB;CAEA,UAAkB,MAAsC;EACtD,OAAO,KAAK,iBAAiB,IAAI;CACnC;CAEA,YAAoB,MAAsC;EACxD,OAAO,KAAK,gBAAgB,MAAM,GAAG,YAAY,aAAa;CAChE;CAEA,mBAA2B,MAAsC;EAC/D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACtF,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACtF,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM;GAAC,UAAU,KAAK,KAAK,CAAC;GAAG,UAAU,KAAK,KAAK,CAAC;GAAG;EAAQ,CAAC;EAEjH,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,UAAU,KAAK,SAAS;EAC9B,MAAM,UAAU,KAAK,kBAAkB,MAAM,CAAC;EAC9C,IAAI,YAAY,MACd,OAAO;EAET,IAAI,QAAQ,WAAW,OAAO,iBAC5B,OAAO;EAET,IAAI,QAAQ,WAAW,OAAO,YAC5B,OAAO,KAAK,QAAQ,YAAY,6BAA6B,SAAS,CAAC,UAAU,UAAU,OAAO,CAAC,CAAC;EAEtG,MAAM,WAAW,OAAO,OAAO;EAC/B,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,kCAAkC,SAAS,CAAC,UAAU,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC;EAGlH,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAA6B,CAAC;EACpC,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,eAAe,UAAU,UAAU,KAAK;GAC9C,IAAI,iBAAiB,MACnB,OAAO,KAAK,QAAQ,YAAY,8BAA8B,SAAS;IACrE;IACA,OAAO,KAAK;IACZ,OAAO,SAAS,QAAQ,MAAM;IAC9B,UAAU,KAAK,QAAQ,CAAC;GAC1B,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,KAAK,WAAW,EAAE;OAEzB,OAAO,KAAK,MAAM,UAAU,CAAC;CAEjC;CAEA,kBAA0B,MAAsC;EAC9D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,UAAU,KAAK,SAAS;EAC9B,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,iBAC7B,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,iCAAiC,SAAS,CAAC,UAAU,UAAU,QAAQ,CAAC,CAAC;EAG3G,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAA6B,CAAC;EACpC,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,eAAe,UAAU,UAAU,KAAK;GAC9C,IAAI,iBAAiB,MACnB,OAAO,KAAK,QAAQ,YAAY,gCAAgC,SAAS;IACvE;IACA,OAAO,KAAK;IACZ,OAAO,SAAS,QAAQ,MAAM;IAC9B,UAAU,QAAQ;GACpB,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,WAAW;OAElB,OAAO,MAAM,UAAU;CAE3B;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAAa,QAAQ,WAAW,KAAK,SAAS,SAAS;EAC7D,IAAI,CAAC,cAAc,KAAK,SAAS,SAAS,GAAG;GAC3C,MAAM,aAAa,KAAK,SAAS,QAAQ;GACzC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,cAAc,MAAM;IACtE,OAAO,QAAQ,MAAM;IACrB,OAAO,KAAK,SAAS,SAAS,CAAC;IAC/B;GACF,CAAC;EACH;EAEA,MAAM,WAAW,KAAK,kBAAkB,MAAM,KAAK,SAAS,SAAS,CAAC;EACtE,IAAI,aAAa,MACf,OAAO;EAET,IACE,SAAS,WAAW,OAAO,mBAC1B,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,iBAE1E,OAAO;EAET,MAAM,mBAAmB,KAAK,4BAA4B,OAAO;EACjE,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,OAC3E,OAAO,KAAK,QAAQ,YAAY,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI;GAClG;GACA,UAAU,QAAQ;GAClB;EACF,CAAC;EAGH,MAAM,UAAU,OAAO,QAAQ;EAC/B,MAAM,QAAwB,CAAC;EAC/B,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,UAAU,UAAU,SAAS,KAAK;GACxC,IAAI,YAAY,MACd,OAAO,KAAK,QAAQ,YAAY,oBAAoB,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI;IAC3F;IACA,UAAU,QAAQ;IAClB,OAAO,KAAK;IACZ,OAAO,QAAQ,QAAQ,MAAM;GAC/B,CAAC;GAEH,MAAM,KAAK,OAAO;EACpB;EAEA,IAAI,YACF,KAAK,IAAI,QAAQ,GAAG,QAAQ,IAAI,KAAK,SAAS,QAAQ,SAAS;GAC7D,MAAM,QAAQ,KAAK,kBAAkB,MAAM,KAAK;GAChD,IAAI,UAAU,MACZ,OAAO;GAET,MAAM,gBAAgB,KAAK,MAAM,MAAM;GACvC,IAAI,MAAM,WAAW,OAAO,cAAc,CAAC,mBAAmB,MAAM,QAAQ,OAAO,KAAK,CAAC,GACvF,OAAO,KAAK,2BAA2B,MAAM,OAAO,OAAO,eAAe,QAAQ;EAEtF;OACK;GACL,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;GAC5C,IAAI,UAAU,MACZ,OAAO;GAET,MAAM,YAAY;GAClB,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC;GAClC,IAAI,UAAU,WAAW,OAAO,cAAc,CAAC,mBAAmB,UAAU,SAAS,GACnF,OAAO,KAAK,2BAA2B,MAAM,GAAG,WAAW,UAAU,QAAQ;EAEjF;EACA,OAAO;CACT;CAEA,4BAAoC,SAA2B;EAC7D,MAAM,WAAW,KAAK,IAAI,GAAG,SAAS,CAAC;EACvC,IAAI,YAAY,GACd,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,gBAAgB,CAAC,CAAC;EAE3D,MAAM,UAA0B,CAAC;EACjC,KAAK,IAAI,QAAQ,GAAG,SAAS,UAAU,SACrC,QAAQ,KAAK,EAAE,QAAQ,OAAO,gBAAgB,CAAC;EAEjD,OAAO,UAAU,KAAK,MAAM,OAAO,CAAC,CAAC;CACvC;CAEA,2BACE,MACA,YACA,OACA,UACA,UACM;EACN,MAAM,UAAU,KAAK,KAAK;EAC1B,IAAI,cAAc,SAAS,QAAQ,KAAK,mBAAmB,SAAS,QAAQ,GAC1E,OAAO,KAAK,QAAQ,YAAY,6BAA6B,KAAK,SAAS,aAAa,CACtF,UACA,UAAU,KAAK,CACjB,CAAC;EAEH,OAAO,KAAK,QAAQ,YAAY,4BAA4B,KAAK,SAAS,aAAa;GACrF,UAAU,KAAK;GACf,UAAU,QAAQ;GAClB;EACF,CAAC;CACH;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IACE,SAAS,WAAW,OAAO,mBAC1B,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,iBAE1E,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,YAC3E,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,IAAI,CAAC,UAAU,QAAQ,CAAC,CAAC;EAExF,OAAO,OAAO,QAAQ;CACxB;CAEA,mBAA2B,MAAsC;EAC/D,OAAO,KAAK,kBAAkB,MAAM,MAAM;CAC5C;CAEA,iBAAyB,MAAsC;EAC7D,KAAK,OAAO,WAAW;EAEvB,MAAM,SAAS,KAAK,gBAClB,MACA,GACA,YAAY,sBACZ,WAAW,QAAQ,mBAAmB,CACxC;EACA,IAAI,WAAW,MACb,OAAO;OACF,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GACpD,OAAO;OACF,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GACjC,OAAO;EAGT,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK,GAC9B,OAAO;EAIX,MAAM,OAAO,KAAK,kBAAkB,MAAM,CAAC;EAC3C,IAAI,SAAS,MACX,OAAO;EAGT,KAAK,OAAO,SAAS,IAAI;EACzB,OAAO,KAAK,IAAI;CAClB;CAEA,aAAqB,MAAsC;EACzD,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,WAAW,QAAQ,OAAO,CAAC;EAC1G,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,SAAS,KAAK,kBAAkB,MAAM,CAAC;EAC7C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,eAAuB,MAAsC;EAC3D,KAAK,OAAO,WAAW;EAEvB,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,QAAQ,GAC/C,OAAO;EAGT,MAAM,SAAS,KAAK,WAAW,QAAQ;EACvC,MAAM,iBAAiB,SAAS,IAAI;EAEpC,IAAI,iBAAiB,KAAK,kBAAkB,MAAM,cAAc;EAChE,IAAI,mBAAmB,MACrB,OAAO;EAET,IAAI,CAAC,mBAAmB,gBAAgB,QAAQ,GAC9C,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,iBAAiB;GAC5E,UAAU,cAAc;GACxB,UAAU,QAAQ;GAClB,WAAW,KAAK,MAAiB;EACnC,CAAC;EAGH,IAAI,YAAY,QAAQ,GACtB,KAAK,IAAI,UAAU,YAAY,sBAAsB,UAAU,GAAG,WAAW;GAC3E,KAAK,OAAO,SAAS,IAAI;GACzB,KAAK,OAAO,YAAY;GACxB,KAAK,OAAO,WAAW;GACvB,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,cAAc,GACrD,OAAO;GAET,MAAM,eAAe,KAAK,kBAAkB,MAAM,cAAc;GAChE,IAAI,iBAAiB,MACnB,OAAO;GAET,IAAI,cAAc,cAAc,cAAc,GAC5C;GAEF,iBAAiB;EACnB;EAGF,IAAI,QACF;OAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EACT;EAGF,KAAK,OAAO,SAAS,IAAI;EACzB,OAAO;CACT;CAEA,SAAiB,OAAyB;EACxC,OAAO,UAAU,QAAQ,UAAU,UAAU,QAAQ,gBAAgB,UAAU,QAAQ;CACzF;CAEA,qBAA6B,MAAwB;EACnD,OAAO,KAAK,UAAU,KAAK,WAAW,MAAM;GAC1C,IAAI,KAAK,WAAW,QAAQ,cAAc,OAAO;GACjD,OAAO,KAAK;EACd;EACA,OAAO;CACT;CAEA,mBAA2B,MAAe,OAAe,MAAsD;EAC7G,IAAI,KAAK,SAAS,SAAS,MAAM,KAAK,KAAK,QACzC,OAAO,KAAK,QAAQ,YAAY,kBAAkB,MAAM,CACtD,OAAO,KAAK,KAAK,MAAM,GACvB,OAAO,KAAK,SAAS,SAAS,CAAC,CACjC,CAAC;EAGH,MAAM,8BAAc,IAAI,IAA0B;EAClD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,YAAY,KAAK,kBAAkB,MAAM,KAAK;GACpD,IAAI,cAAc,MAChB,OAAO;GAET,MAAM,UAAU,eAAe,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC,IAAI;GAC/D,IAAI,CAAC,iBAAiB,aAAa,SAAS,SAAS,GAAG;IACtD,MAAM,eAAe,kBAAkB,OAAO;IAC9C,IAAI,YAAY,OAAO,GACrB,eAAe,cAAc,WAAW;IAE1C,KAAK,QAAQ,YAAY,qBAAqB,KAAK,SAAS,QAAQ,CAClE,GAAG,iBAAiB,KAAK,KAAK,QAAQ,EAAE,CAAC,OAAO,KAAK,EAAE,GAAG,UAAU,YAAY,KAChF,UAAU,SAAS,CACrB,CAAC;IACD,OAAO;GACT;EACF;EACA,OAAO;CACT;AACF;AAGA,SAAS,eAAe,UAAkB,MAAkC;CAC1E,QAAQ,KAAK,QAAb;EACE,SACE,MAAM,IAAI,MAAM,uBAAuB,SAAS,IAAI,KAAK,UAAU,IAAI,GAAG;EAC5E,KAAK,OAAO;EACZ,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO;GACV,IAAI,kBAAkB,KAAK,MAAM,GAC/B,OAAO;IACL,QAAQ,KAAK;IACb,QAAQ,gBAAgB,KAAK,QAAQ,QAAQ;GAC/C;GAEF,OAAO;EAET,KAAK,OAAO,YACV,OAAO;GACL,QAAQ,KAAK;GACb,MAAM,eAAe,UAAU,OAAO,IAAI,CAAC;EAC7C;EAEF,KAAK,OAAO,OAAO;GACjB,MAAM,UAA0B,CAAC;GACjC,KAAK,IAAI,QAAQ,GAAG,SAAS,KAAK,QAAQ,QAAQ,EAAE,OAClD,QAAQ,KAAK,eAAe,UAAU,UAAU,MAAM,KAAK,CAAE,CAAC;GAEhE,OAAO;IACL,QAAQ,KAAK;IACJ;GACX;EACF;CACF;AACF;AAUA,SAAS,kBAAkB,QAAyB;CAClD,OACE,WAAW,QAAQ,aACnB,WAAW,QAAQ,YACnB,WAAW,QAAQ,qBACnB,WAAW,QAAQ;AAEvB;AAEA,SAAS,iBAAiB,QAAyB;CACjD,OAAO,WAAW,QAAQ,qBAAqB,WAAW,QAAQ;AACpE;;AAGA,SAAS,uBAAuB,MAAe,QAA0B;CACvE,IAAI,UAA0B;CAC9B,OAAO,YAAY,MAAM;EACvB,IAAI,iBAAiB,QAAQ,MAAM,GACjC,OAAO;EAET,IAAI,YAAY,QACd,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;;AAGA,SAAS,0BAA0B,MAA+B;CAChE,IAAI,UAA0B;CAC9B,OAAO,YAAY,QAAQ,QAAQ,WAAW,MAAM;EAClD,MAAM,SAAkB,QAAQ;EAChC,IAAI,kBAAkB,OAAO,MAAM,GAEjC;OADmB,OAAO,SAAS,QAAQ,OACvC,IAAa,GACf,OAAO;EACT;EAEF,UAAU;CACZ;CACA,OAAO;AACT;;AAGA,IAAM,eAAN,MAAmB;CACjB;CAEA,OAA2B,CAAC;CAE5B,YAAY,SAAuE;EACjF,KAAK,UAAU;CACjB;CAEA,aAAmB;EACjB,KAAK,MAAM,SAAS,KAAK,MACvB,IAAI,MAAM,QAAQ,GAChB,MAAM,QAAQ,MAAM,QAAQ;CAGlC;CAEA,SAAS,MAAe,aAAsB,OAAa;EACzD,KAAK,MAAM,SAAS,KAAK,MAAM;GAC7B,MAAM;GACN,IAAI,CAAC,cAAc,MAAM,UAAU,KAAK,MAAM,aAAa,GACzD,KAAK,QAAQ,YAAY,cAAc,MAAM,CAAC,MAAM,KAAK,CAAC;EAE9D;CACF;CAEA,cAAoB;EAClB,KAAK,OAAO,KAAK,KAAK,QAAO,SAAQ,KAAK,QAAQ,CAAC;CACrD;CAEA,UAAU,MAAe,MAA6B;EACpD,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,WAAW,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EAC5D,IAAI,UAAU;GACZ,IAAI,SAAS,QAAQ,GAAG;IACtB,KAAK,QAAQ,YAAY,gBAAgB,MAAM,CAAC,KAAK,CAAC;IACtD,OAAO;GACT,OAAO;IACL,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,KAAK,CAAC;IAC1D,OAAO;GACT;EACF;EACA,KAAK,KAAK,KAAK;GAAE;GAAO;GAAM,OAAO;GAAG,UAAU;EAAE,CAAC;EACrD,OAAO;CACT;CAEA,aAAa,MAAoC;EAC/C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EACzD,IAAI,UAAU,QACZ,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;OACzD,IAAI,MAAM,QAAQ,GAAG;GAC1B,MAAM,cAAc,0BAA0B,IAAI;GAClD,IAAI,gBAAgB,MAAM;IACxB,IAAI,uBAAuB,MAAM,WAAW,GAC1C,OAAO,KAAK,QAAQ,YAAY,0BAA0B,MAAM,CAAC,OAAO,UAAU,MAAM,IAAI,CAAC,CAAC;IAEhG,OAAO,KAAK,QAAQ,YAAY,4BAA4B,MAAM,CAAC,KAAK,CAAC;GAC3E;GACA,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;EAChE,OAAO;GACL,MAAM;GACN,OAAO,MAAM;EACf;CACF;AACF"}

package/dist/rslang/semantic/typification-api.d.ts

@@ -1,25 +1,24 @@
 import { b as Typification, f as ExpressionType, g as TypeClass, v as TypeID, y as TypePath } from "../../typification-hWUoWCba.js";
 //#region src/rslang/semantic/typification-api.d.ts
 /** Returns the TypeClass associated with the given TypeID. */
-declare function getTypeClass(typeID: TypeID): TypeClass;
+export declare function getTypeClass(typeID: TypeID): TypeClass;
 /** Returns true if the given typification is generic. */
-declare function hasGenerics(type: Typification): boolean;
+export declare function hasGenerics(type: Typification): boolean;
 /** Checks if two typifications are equal. */
-declare function checkEquality(type1: Typification, type2: Typification): boolean;
+export declare function checkEquality(type1: Typification, type2: Typification): boolean;
 /** Merge two types to get result of binary operation. */
-declare function mergeTypifications(type1: Typification, type2: Typification): Typification | null;
+export declare function mergeTypifications(type1: Typification, type2: Typification): Typification | null;
 /** Check compatibility of typifications. */
-declare function checkCompatibility(type1: ExpressionType, type2: ExpressionType): boolean;
+export declare function checkCompatibility(type1: ExpressionType, type2: ExpressionType): boolean;
 /** Compare typification with substitutions. */
-declare function compareTemplated(substitutes: Map<string, Typification>, arg: Typification, value: Typification): boolean;
+export declare function compareTemplated(substitutes: Map<string, Typification>, arg: Typification, value: Typification): boolean;
 /** Clone typification tree. */
-declare function cloneTypification(type: Typification): Typification;
+export declare function cloneTypification(type: Typification): Typification;
 /** Apply substitutions to typification. */
-declare function substituteBase(target: Typification, substitutes: Map<string, Typification>): void;
+export declare function substituteBase(target: Typification, substitutes: Map<string, Typification>): void;
 /** Extract bases from typification. */
-declare function extractBases(target: ExpressionType): Set<string>;
+export declare function extractBases(target: ExpressionType): Set<string>;
 /** Apply type path to typification. */
-declare function applyPath(target: Typification, path: TypePath, index?: number): Typification | null;
+export declare function applyPath(target: Typification, path: TypePath, index?: number): Typification | null;
 //#endregion
-export { applyPath, checkCompatibility, checkEquality, cloneTypification, compareTemplated, extractBases, getTypeClass, hasGenerics, mergeTypifications, substituteBase };
 //# sourceMappingURL=typification-api.d.ts.map

package/dist/rslang/semantic/typification-api.js

@@ -91,14 +91,16 @@ function checkCompatibility(type1, type2) {
 /** Compare typification with substitutions. */
 function compareTemplated(substitutes, arg, value) {
 	if (arg === value) return true;
-	if (arg.typeID === TypeID.basic && isRadical(arg.baseID)) if (!substitutes.has(arg.baseID)) {
-		substitutes.set(arg.baseID, value);
-		return true;
-	} else {
-		const mergeType = mergeTypifications(substitutes.get(arg.baseID), value);
-		if (mergeType === null) return false;
-		substitutes.set(arg.baseID, mergeType);
-		return true;
+	if (arg.typeID === TypeID.basic && isRadical(arg.baseID)) {
+		if (!substitutes.has(arg.baseID)) {
+			substitutes.set(arg.baseID, value);
+			return true;
+		} else {
+			const mergeType = mergeTypifications(substitutes.get(arg.baseID), value);
+			if (mergeType === null) return false;
+			substitutes.set(arg.baseID, mergeType);
+			return true;
+		}
 	}
 	if (arg.typeID === TypeID.anyTypification || value.typeID === TypeID.anyTypification) return true;
 	if (arg.typeID === TypeID.integer || arg.typeID === TypeID.basic || value.typeID === TypeID.integer || value.typeID === TypeID.basic) return commonType(arg, value) !== null;
@@ -161,7 +163,6 @@ function applyPath(target, path, index = 0) {
 			current = component(current, path[i]);
 			if (current === null) return null;
 			i++;
-			break;
 	}
 	return current;
 }

package/dist/rslang/semantic/typification-api.js.map

@@ -1 +1 @@
-{"version":3,"file":"typification-api.js","names":[],"sources":["../../../src/rslang/semantic/typification-api.ts"],"sourcesContent":["/**\n * Module: Typification API for RSLang.\n */\n\nimport {\n  bool,\n  component,\n  type EchelonBase,\n  type EchelonCollection,\n  type EchelonTuple,\n  type ExpressionType,\n  IntegerT,\n  isRadical,\n  isTypification,\n  tuple,\n  TypeClass,\n  TypeID,\n  type TypePath,\n  type Typification\n} from './typification';\n\n/** Record map from typeID to typeClass. */\nconst TypeIDToClass: Record<TypeID, TypeClass> = {\n  [TypeID.anyTypification]: TypeClass.typification,\n  [TypeID.integer]: TypeClass.typification,\n  [TypeID.basic]: TypeClass.typification,\n  [TypeID.tuple]: TypeClass.typification,\n  [TypeID.collection]: TypeClass.typification,\n  [TypeID.logic]: TypeClass.logic,\n  [TypeID.function]: TypeClass.function,\n  [TypeID.predicate]: TypeClass.predicate\n};\n\n/** Returns the TypeClass associated with the given TypeID. */\nexport function getTypeClass(typeID: TypeID): TypeClass {\n  return TypeIDToClass[typeID];\n}\n\n/** Returns true if the given typification is generic. */\nexport function hasGenerics(type: Typification): boolean {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n      return true;\n    case TypeID.integer:\n      return false;\n    case TypeID.basic:\n      return isRadical(type.baseID);\n    case TypeID.collection:\n      return hasGenerics(type.base);\n    case TypeID.tuple:\n      for (const factor of type.factors) {\n        if (hasGenerics(factor)) {\n          return true;\n        }\n      }\n      return false;\n  }\n}\n\n/** Checks if two typifications are equal. */\nexport function checkEquality(type1: Typification, type2: Typification): boolean {\n  if (type1 === type2) {\n    return true;\n  }\n  if (type1.typeID !== type2.typeID) {\n    return false;\n  }\n  switch (type1.typeID) {\n    case TypeID.integer:\n    case TypeID.anyTypification:\n      return true;\n    case TypeID.basic:\n      return type1.baseID === (type2 as EchelonBase).baseID;\n    case TypeID.collection:\n      return checkEquality(type1.base, (type2 as EchelonCollection).base);\n    case TypeID.tuple: {\n      if (type1.factors.length !== (type2 as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < type1.factors.length; ++index) {\n        if (!checkEquality(type1.factors[index], (type2 as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    }\n  }\n}\n\n/** Merge two types to get result of binary operation. */\nexport function mergeTypifications(type1: Typification, type2: Typification): Typification | null {\n  if (type1 === type2) {\n    return type1;\n  }\n  if (type1.typeID === TypeID.anyTypification) {\n    return isTypification(type2) ? type2 : null;\n  }\n  if (type2.typeID === TypeID.anyTypification) {\n    return isTypification(type1) ? type1 : null;\n  }\n\n  switch (type1.typeID) {\n    case TypeID.integer:\n    case TypeID.basic:\n      return commonType(type1, type2);\n    case TypeID.collection:\n      if (type2.typeID !== TypeID.collection) {\n        return null;\n      }\n      const base = mergeTypifications(type1.base, type2.base);\n      return base ? bool(base) : null;\n    case TypeID.tuple:\n      if (type2.typeID !== TypeID.tuple) {\n        return null;\n      }\n      if (type1.factors.length !== type2.factors.length) {\n        return null;\n      }\n      const components: Typification[] = [];\n      for (let index = 0; index < type1.factors.length; ++index) {\n        const component = mergeTypifications(type1.factors[index], type2.factors[index]);\n        if (component === null) {\n          return null;\n        }\n        components.push(component);\n      }\n      return tuple(components);\n  }\n}\n\n/** Check compatibility of typifications. */\nexport function checkCompatibility(type1: ExpressionType, type2: ExpressionType): boolean {\n  if (type1 === type2) {\n    return true;\n  }\n  if (type1.typeID === TypeID.anyTypification) {\n    return isTypification(type2);\n  }\n  if (type2.typeID === TypeID.anyTypification) {\n    return isTypification(type1);\n  }\n  if (isTypification(type1) !== isTypification(type2)) {\n    return false;\n  }\n  if (\n    type1.typeID === TypeID.integer ||\n    type1.typeID === TypeID.basic ||\n    type2.typeID === TypeID.integer ||\n    type2.typeID === TypeID.basic\n  ) {\n    return commonType(type1 as Typification, type2 as Typification) !== null;\n  }\n\n  if (type1.typeID !== type2.typeID) {\n    return false;\n  }\n  switch (type1.typeID) {\n    case TypeID.collection:\n      return checkCompatibility(type1.base, (type2 as EchelonCollection).base);\n    case TypeID.tuple:\n      if (type1.factors.length !== (type2 as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < type1.factors.length; ++index) {\n        if (!checkCompatibility(type1.factors[index], (type2 as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    case TypeID.logic:\n    case TypeID.predicate:\n    case TypeID.function:\n      return false;\n  }\n}\n\n/** Compare typification with substitutions. */\nexport function compareTemplated(\n  substitutes: Map<string, Typification>,\n  arg: Typification,\n  value: Typification\n): boolean {\n  if (arg === value) {\n    return true;\n  }\n  if (arg.typeID === TypeID.basic && isRadical(arg.baseID)) {\n    if (!substitutes.has(arg.baseID)) {\n      substitutes.set(arg.baseID, value);\n      return true;\n    } else {\n      const mergeType = mergeTypifications(substitutes.get(arg.baseID)!, value);\n      if (mergeType === null) {\n        return false;\n      }\n      substitutes.set(arg.baseID, mergeType);\n      return true;\n    }\n  }\n  if (arg.typeID === TypeID.anyTypification || value.typeID === TypeID.anyTypification) {\n    return true;\n  }\n  if (\n    arg.typeID === TypeID.integer ||\n    arg.typeID === TypeID.basic ||\n    value.typeID === TypeID.integer ||\n    value.typeID === TypeID.basic\n  ) {\n    return commonType(arg, value) !== null;\n  }\n  if (arg.typeID !== value.typeID) {\n    return false;\n  }\n  switch (arg.typeID) {\n    case TypeID.collection:\n      return compareTemplated(substitutes, arg.base, (value as EchelonCollection).base);\n    case TypeID.tuple: {\n      if (arg.factors.length !== (value as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < arg.factors.length; ++index) {\n        if (!compareTemplated(substitutes, arg.factors[index], (value as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    }\n  }\n}\n\n/** Clone typification tree. */\nexport function cloneTypification(type: Typification): Typification {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n    case TypeID.integer:\n      return type;\n    case TypeID.basic:\n      return { ...type };\n    case TypeID.collection:\n      return { typeID: type.typeID, base: cloneTypification(type.base) };\n    case TypeID.tuple:\n      return { typeID: type.typeID, factors: type.factors.map(cloneTypification) };\n  }\n}\n\n/** Apply substitutions to typification. */\nexport function substituteBase(target: Typification, substitutes: Map<string, Typification>): void {\n  switch (target.typeID) {\n    case TypeID.basic: {\n      if (substitutes.has(target.baseID)) {\n        Object.assign(target, substitutes.get(target.baseID)!);\n      }\n      return;\n    }\n    case TypeID.collection: {\n      substituteBase(target.base, substitutes);\n      return;\n    }\n    case TypeID.tuple: {\n      for (const factor of target.factors) {\n        substituteBase(factor, substitutes);\n      }\n      return;\n    }\n  }\n}\n\n/** Extract bases from typification. */\nexport function extractBases(target: ExpressionType): Set<string> {\n  return new Set(extractBasesImpl(target));\n}\n\n/** Apply type path to typification. */\nexport function applyPath(target: Typification, path: TypePath, index = 0): Typification | null {\n  let current: Typification | null = target;\n  let i = index;\n  while (i < path.length && current) {\n    switch (current.typeID) {\n      case TypeID.anyTypification:\n      case TypeID.integer:\n      case TypeID.basic:\n        return null;\n      case TypeID.collection:\n        current = current.base;\n        i++;\n        break;\n      case TypeID.tuple:\n        current = component(current, path[i]);\n        if (current === null) {\n          return null;\n        }\n        i++;\n        break;\n    }\n  }\n  return current;\n}\n\n// ===== Internals =====\nfunction commonType(type1: Typification, type2: Typification): Typification | null {\n  if (type1 === type2) {\n    return type1;\n  }\n  const int1 = 'isIntegerCompatible' in type1 && type1.isIntegerCompatible;\n  const int2 = 'isIntegerCompatible' in type2 && type2.isIntegerCompatible;\n  if (!int1 || !int2) {\n    if (type1.typeID === TypeID.basic && type2.typeID === TypeID.basic) {\n      return type1.baseID === type2.baseID ? type1 : null;\n    }\n    return null;\n  }\n  if (type1.typeID === TypeID.integer) {\n    return type2;\n  } else if (type2.typeID === TypeID.integer) {\n    return type1;\n  } else {\n    return IntegerT;\n  }\n}\n\nfunction extractBasesImpl(target: ExpressionType): string[] {\n  switch (target.typeID) {\n    case TypeID.basic:\n      return [target.baseID];\n    case TypeID.collection:\n      return extractBasesImpl(target.base);\n    case TypeID.tuple:\n      return target.factors.reduce((result, factor) => result.concat(extractBasesImpl(factor)), [] as string[]);\n    case TypeID.function:\n      const result = extractBasesImpl(target.result);\n      return target.args.reduce((result, arg) => result.concat(extractBasesImpl(arg.type)), result);\n    case TypeID.predicate:\n      return target.args.reduce((result, arg) => result.concat(extractBasesImpl(arg.type)), [] as string[]);\n    default:\n      return [];\n  }\n}\n"],"mappings":";;;;;;AAsBA,MAAM,gBAA2C;EAC9C,OAAO,kBAAkB,UAAU;EACnC,OAAO,UAAU,UAAU;EAC3B,OAAO,QAAQ,UAAU;EACzB,OAAO,QAAQ,UAAU;EACzB,OAAO,aAAa,UAAU;EAC9B,OAAO,QAAQ,UAAU;EACzB,OAAO,WAAW,UAAU;EAC5B,OAAO,YAAY,UAAU;AAChC;;AAGA,SAAgB,aAAa,QAA2B;CACtD,OAAO,cAAc;AACvB;;AAGA,SAAgB,YAAY,MAA6B;CACvD,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,UAAU,KAAK,MAAM;EAC9B,KAAK,OAAO,YACV,OAAO,YAAY,KAAK,IAAI;EAC9B,KAAK,OAAO;GACV,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,YAAY,MAAM,GACpB,OAAO;GAGX,OAAO;CACX;AACF;;AAGA,SAAgB,cAAc,OAAqB,OAA8B;CAC/E,IAAI,UAAU,OACZ,OAAO;CAET,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO;CAET,QAAQ,MAAM,QAAd;EACE,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,MAAM,WAAY,MAAsB;EACjD,KAAK,OAAO,YACV,OAAO,cAAc,MAAM,MAAO,MAA4B,IAAI;EACpE,KAAK,OAAO;GACV,IAAI,MAAM,QAAQ,WAAY,MAAuB,QAAQ,QAC3D,OAAO;GAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,QAAQ,EAAE,OAClD,IAAI,CAAC,cAAc,MAAM,QAAQ,QAAS,MAAuB,QAAQ,MAAM,GAC7E,OAAO;GAGX,OAAO;CAEX;AACF;;AAGA,SAAgB,mBAAmB,OAAqB,OAA0C;CAChG,IAAI,UAAU,OACZ,OAAO;CAET,IAAI,MAAM,WAAW,OAAO,iBAC1B,OAAO,eAAe,KAAK,IAAI,QAAQ;CAEzC,IAAI,MAAM,WAAW,OAAO,iBAC1B,OAAO,eAAe,KAAK,IAAI,QAAQ;CAGzC,QAAQ,MAAM,QAAd;EACE,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAO,WAAW,OAAO,KAAK;EAChC,KAAK,OAAO;GACV,IAAI,MAAM,WAAW,OAAO,YAC1B,OAAO;GAET,MAAM,OAAO,mBAAmB,MAAM,MAAM,MAAM,IAAI;GACtD,OAAO,OAAO,KAAK,IAAI,IAAI;EAC7B,KAAK,OAAO;GACV,IAAI,MAAM,WAAW,OAAO,OAC1B,OAAO;GAET,IAAI,MAAM,QAAQ,WAAW,MAAM,QAAQ,QACzC,OAAO;GAET,MAAM,aAA6B,CAAC;GACpC,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,QAAQ,EAAE,OAAO;IACzD,MAAM,YAAY,mBAAmB,MAAM,QAAQ,QAAQ,MAAM,QAAQ,MAAM;IAC/E,IAAI,cAAc,MAChB,OAAO;IAET,WAAW,KAAK,SAAS;GAC3B;GACA,OAAO,MAAM,UAAU;CAC3B;AACF;;AAGA,SAAgB,mBAAmB,OAAuB,OAAgC;CACxF,IAAI,UAAU,OACZ,OAAO;CAET,IAAI,MAAM,WAAW,OAAO,iBAC1B,OAAO,eAAe,KAAK;CAE7B,IAAI,MAAM,WAAW,OAAO,iBAC1B,OAAO,eAAe,KAAK;CAE7B,IAAI,eAAe,KAAK,MAAM,eAAe,KAAK,GAChD,OAAO;CAET,IACE,MAAM,WAAW,OAAO,WACxB,MAAM,WAAW,OAAO,SACxB,MAAM,WAAW,OAAO,WACxB,MAAM,WAAW,OAAO,OAExB,OAAO,WAAW,OAAuB,KAAqB,MAAM;CAGtE,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO;CAET,QAAQ,MAAM,QAAd;EACE,KAAK,OAAO,YACV,OAAO,mBAAmB,MAAM,MAAO,MAA4B,IAAI;EACzE,KAAK,OAAO;GACV,IAAI,MAAM,QAAQ,WAAY,MAAuB,QAAQ,QAC3D,OAAO;GAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,QAAQ,EAAE,OAClD,IAAI,CAAC,mBAAmB,MAAM,QAAQ,QAAS,MAAuB,QAAQ,MAAM,GAClF,OAAO;GAGX,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,UACV,OAAO;CACX;AACF;;AAGA,SAAgB,iBACd,aACA,KACA,OACS;CACT,IAAI,QAAQ,OACV,OAAO;CAET,IAAI,IAAI,WAAW,OAAO,SAAS,UAAU,IAAI,MAAM,GACrD,IAAI,CAAC,YAAY,IAAI,IAAI,MAAM,GAAG;EAChC,YAAY,IAAI,IAAI,QAAQ,KAAK;EACjC,OAAO;CACT,OAAO;EACL,MAAM,YAAY,mBAAmB,YAAY,IAAI,IAAI,MAAM,GAAI,KAAK;EACxE,IAAI,cAAc,MAChB,OAAO;EAET,YAAY,IAAI,IAAI,QAAQ,SAAS;EACrC,OAAO;CACT;CAEF,IAAI,IAAI,WAAW,OAAO,mBAAmB,MAAM,WAAW,OAAO,iBACnE,OAAO;CAET,IACE,IAAI,WAAW,OAAO,WACtB,IAAI,WAAW,OAAO,SACtB,MAAM,WAAW,OAAO,WACxB,MAAM,WAAW,OAAO,OAExB,OAAO,WAAW,KAAK,KAAK,MAAM;CAEpC,IAAI,IAAI,WAAW,MAAM,QACvB,OAAO;CAET,QAAQ,IAAI,QAAZ;EACE,KAAK,OAAO,YACV,OAAO,iBAAiB,aAAa,IAAI,MAAO,MAA4B,IAAI;EAClF,KAAK,OAAO;GACV,IAAI,IAAI,QAAQ,WAAY,MAAuB,QAAQ,QACzD,OAAO;GAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,IAAI,QAAQ,QAAQ,EAAE,OAChD,IAAI,CAAC,iBAAiB,aAAa,IAAI,QAAQ,QAAS,MAAuB,QAAQ,MAAM,GAC3F,OAAO;GAGX,OAAO;CAEX;AACF;;AAGA,SAAgB,kBAAkB,MAAkC;CAClE,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,EAAE,GAAG,KAAK;EACnB,KAAK,OAAO,YACV,OAAO;GAAE,QAAQ,KAAK;GAAQ,MAAM,kBAAkB,KAAK,IAAI;EAAE;EACnE,KAAK,OAAO,OACV,OAAO;GAAE,QAAQ,KAAK;GAAQ,SAAS,KAAK,QAAQ,IAAI,iBAAiB;EAAE;CAC/E;AACF;;AAGA,SAAgB,eAAe,QAAsB,aAA8C;CACjG,QAAQ,OAAO,QAAf;EACE,KAAK,OAAO;GACV,IAAI,YAAY,IAAI,OAAO,MAAM,GAC/B,OAAO,OAAO,QAAQ,YAAY,IAAI,OAAO,MAAM,CAAE;GAEvD;EAEF,KAAK,OAAO;GACV,eAAe,OAAO,MAAM,WAAW;GACvC;EAEF,KAAK,OAAO;GACV,KAAK,MAAM,UAAU,OAAO,SAC1B,eAAe,QAAQ,WAAW;GAEpC;CAEJ;AACF;;AAGA,SAAgB,aAAa,QAAqC;CAChE,OAAO,IAAI,IAAI,iBAAiB,MAAM,CAAC;AACzC;;AAGA,SAAgB,UAAU,QAAsB,MAAgB,QAAQ,GAAwB;CAC9F,IAAI,UAA+B;CACnC,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,UAAU,SACxB,QAAQ,QAAQ,QAAhB;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;GACV,UAAU,QAAQ;GAClB;GACA;EACF,KAAK,OAAO;GACV,UAAU,UAAU,SAAS,KAAK,EAAE;GACpC,IAAI,YAAY,MACd,OAAO;GAET;GACA;CACJ;CAEF,OAAO;AACT;AAGA,SAAS,WAAW,OAAqB,OAA0C;CACjF,IAAI,UAAU,OACZ,OAAO;CAET,MAAM,OAAO,yBAAyB,SAAS,MAAM;CACrD,MAAM,OAAO,yBAAyB,SAAS,MAAM;CACrD,IAAI,CAAC,QAAQ,CAAC,MAAM;EAClB,IAAI,MAAM,WAAW,OAAO,SAAS,MAAM,WAAW,OAAO,OAC3D,OAAO,MAAM,WAAW,MAAM,SAAS,QAAQ;EAEjD,OAAO;CACT;CACA,IAAI,MAAM,WAAW,OAAO,SAC1B,OAAO;MACF,IAAI,MAAM,WAAW,OAAO,SACjC,OAAO;MAEP,OAAO;AAEX;AAEA,SAAS,iBAAiB,QAAkC;CAC1D,QAAQ,OAAO,QAAf;EACE,KAAK,OAAO,OACV,OAAO,CAAC,OAAO,MAAM;EACvB,KAAK,OAAO,YACV,OAAO,iBAAiB,OAAO,IAAI;EACrC,KAAK,OAAO,OACV,OAAO,OAAO,QAAQ,QAAQ,QAAQ,WAAW,OAAO,OAAO,iBAAiB,MAAM,CAAC,GAAG,CAAC,CAAa;EAC1G,KAAK,OAAO;GACV,MAAM,SAAS,iBAAiB,OAAO,MAAM;GAC7C,OAAO,OAAO,KAAK,QAAQ,QAAQ,QAAQ,OAAO,OAAO,iBAAiB,IAAI,IAAI,CAAC,GAAG,MAAM;EAC9F,KAAK,OAAO,WACV,OAAO,OAAO,KAAK,QAAQ,QAAQ,QAAQ,OAAO,OAAO,iBAAiB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAa;EACtG,SACE,OAAO,CAAC;CACZ;AACF"}
+{"version":3,"file":"typification-api.js","names":[],"sources":["../../../src/rslang/semantic/typification-api.ts"],"sourcesContent":["/**\n * Module: Typification API for RSLang.\n */\n\nimport {\n  bool,\n  component,\n  type EchelonBase,\n  type EchelonCollection,\n  type EchelonTuple,\n  type ExpressionType,\n  IntegerT,\n  isRadical,\n  isTypification,\n  tuple,\n  TypeClass,\n  TypeID,\n  type TypePath,\n  type Typification\n} from './typification';\n\n/** Record map from typeID to typeClass. */\nconst TypeIDToClass: Record<TypeID, TypeClass> = {\n  [TypeID.anyTypification]: TypeClass.typification,\n  [TypeID.integer]: TypeClass.typification,\n  [TypeID.basic]: TypeClass.typification,\n  [TypeID.tuple]: TypeClass.typification,\n  [TypeID.collection]: TypeClass.typification,\n  [TypeID.logic]: TypeClass.logic,\n  [TypeID.function]: TypeClass.function,\n  [TypeID.predicate]: TypeClass.predicate\n};\n\n/** Returns the TypeClass associated with the given TypeID. */\nexport function getTypeClass(typeID: TypeID): TypeClass {\n  return TypeIDToClass[typeID];\n}\n\n/** Returns true if the given typification is generic. */\nexport function hasGenerics(type: Typification): boolean {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n      return true;\n    case TypeID.integer:\n      return false;\n    case TypeID.basic:\n      return isRadical(type.baseID);\n    case TypeID.collection:\n      return hasGenerics(type.base);\n    case TypeID.tuple:\n      for (const factor of type.factors) {\n        if (hasGenerics(factor)) {\n          return true;\n        }\n      }\n      return false;\n  }\n}\n\n/** Checks if two typifications are equal. */\nexport function checkEquality(type1: Typification, type2: Typification): boolean {\n  if (type1 === type2) {\n    return true;\n  }\n  if (type1.typeID !== type2.typeID) {\n    return false;\n  }\n  switch (type1.typeID) {\n    case TypeID.integer:\n    case TypeID.anyTypification:\n      return true;\n    case TypeID.basic:\n      return type1.baseID === (type2 as EchelonBase).baseID;\n    case TypeID.collection:\n      return checkEquality(type1.base, (type2 as EchelonCollection).base);\n    case TypeID.tuple: {\n      if (type1.factors.length !== (type2 as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < type1.factors.length; ++index) {\n        if (!checkEquality(type1.factors[index], (type2 as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    }\n  }\n}\n\n/** Merge two types to get result of binary operation. */\nexport function mergeTypifications(type1: Typification, type2: Typification): Typification | null {\n  if (type1 === type2) {\n    return type1;\n  }\n  if (type1.typeID === TypeID.anyTypification) {\n    return isTypification(type2) ? type2 : null;\n  }\n  if (type2.typeID === TypeID.anyTypification) {\n    return isTypification(type1) ? type1 : null;\n  }\n\n  switch (type1.typeID) {\n    case TypeID.integer:\n    case TypeID.basic:\n      return commonType(type1, type2);\n    case TypeID.collection:\n      if (type2.typeID !== TypeID.collection) {\n        return null;\n      }\n      const base = mergeTypifications(type1.base, type2.base);\n      return base ? bool(base) : null;\n    case TypeID.tuple:\n      if (type2.typeID !== TypeID.tuple) {\n        return null;\n      }\n      if (type1.factors.length !== type2.factors.length) {\n        return null;\n      }\n      const components: Typification[] = [];\n      for (let index = 0; index < type1.factors.length; ++index) {\n        const component = mergeTypifications(type1.factors[index], type2.factors[index]);\n        if (component === null) {\n          return null;\n        }\n        components.push(component);\n      }\n      return tuple(components);\n  }\n}\n\n/** Check compatibility of typifications. */\nexport function checkCompatibility(type1: ExpressionType, type2: ExpressionType): boolean {\n  if (type1 === type2) {\n    return true;\n  }\n  if (type1.typeID === TypeID.anyTypification) {\n    return isTypification(type2);\n  }\n  if (type2.typeID === TypeID.anyTypification) {\n    return isTypification(type1);\n  }\n  if (isTypification(type1) !== isTypification(type2)) {\n    return false;\n  }\n  if (\n    type1.typeID === TypeID.integer ||\n    type1.typeID === TypeID.basic ||\n    type2.typeID === TypeID.integer ||\n    type2.typeID === TypeID.basic\n  ) {\n    return commonType(type1 as Typification, type2 as Typification) !== null;\n  }\n\n  if (type1.typeID !== type2.typeID) {\n    return false;\n  }\n  switch (type1.typeID) {\n    case TypeID.collection:\n      return checkCompatibility(type1.base, (type2 as EchelonCollection).base);\n    case TypeID.tuple:\n      if (type1.factors.length !== (type2 as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < type1.factors.length; ++index) {\n        if (!checkCompatibility(type1.factors[index], (type2 as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    case TypeID.logic:\n    case TypeID.predicate:\n    case TypeID.function:\n      return false;\n  }\n}\n\n/** Compare typification with substitutions. */\nexport function compareTemplated(\n  substitutes: Map<string, Typification>,\n  arg: Typification,\n  value: Typification\n): boolean {\n  if (arg === value) {\n    return true;\n  }\n  if (arg.typeID === TypeID.basic && isRadical(arg.baseID)) {\n    if (!substitutes.has(arg.baseID)) {\n      substitutes.set(arg.baseID, value);\n      return true;\n    } else {\n      const mergeType = mergeTypifications(substitutes.get(arg.baseID)!, value);\n      if (mergeType === null) {\n        return false;\n      }\n      substitutes.set(arg.baseID, mergeType);\n      return true;\n    }\n  }\n  if (arg.typeID === TypeID.anyTypification || value.typeID === TypeID.anyTypification) {\n    return true;\n  }\n  if (\n    arg.typeID === TypeID.integer ||\n    arg.typeID === TypeID.basic ||\n    value.typeID === TypeID.integer ||\n    value.typeID === TypeID.basic\n  ) {\n    return commonType(arg, value) !== null;\n  }\n  if (arg.typeID !== value.typeID) {\n    return false;\n  }\n  switch (arg.typeID) {\n    case TypeID.collection:\n      return compareTemplated(substitutes, arg.base, (value as EchelonCollection).base);\n    case TypeID.tuple: {\n      if (arg.factors.length !== (value as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < arg.factors.length; ++index) {\n        if (!compareTemplated(substitutes, arg.factors[index], (value as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    }\n  }\n}\n\n/** Clone typification tree. */\nexport function cloneTypification(type: Typification): Typification {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n    case TypeID.integer:\n      return type;\n    case TypeID.basic:\n      return { ...type };\n    case TypeID.collection:\n      return { typeID: type.typeID, base: cloneTypification(type.base) };\n    case TypeID.tuple:\n      return { typeID: type.typeID, factors: type.factors.map(cloneTypification) };\n  }\n}\n\n/** Apply substitutions to typification. */\nexport function substituteBase(target: Typification, substitutes: Map<string, Typification>): void {\n  switch (target.typeID) {\n    case TypeID.basic: {\n      if (substitutes.has(target.baseID)) {\n        Object.assign(target, substitutes.get(target.baseID)!);\n      }\n      return;\n    }\n    case TypeID.collection: {\n      substituteBase(target.base, substitutes);\n      return;\n    }\n    case TypeID.tuple: {\n      for (const factor of target.factors) {\n        substituteBase(factor, substitutes);\n      }\n      return;\n    }\n  }\n}\n\n/** Extract bases from typification. */\nexport function extractBases(target: ExpressionType): Set<string> {\n  return new Set(extractBasesImpl(target));\n}\n\n/** Apply type path to typification. */\nexport function applyPath(target: Typification, path: TypePath, index = 0): Typification | null {\n  let current: Typification | null = target;\n  let i = index;\n  while (i < path.length && current) {\n    switch (current.typeID) {\n      case TypeID.anyTypification:\n      case TypeID.integer:\n      case TypeID.basic:\n        return null;\n      case TypeID.collection:\n        current = current.base;\n        i++;\n        break;\n      case TypeID.tuple:\n        current = component(current, path[i]);\n        if (current === null) {\n          return null;\n        }\n        i++;\n        break;\n    }\n  }\n  return current;\n}\n\n// ===== Internals =====\nfunction commonType(type1: Typification, type2: Typification): Typification | null {\n  if (type1 === type2) {\n    return type1;\n  }\n  const int1 = 'isIntegerCompatible' in type1 && type1.isIntegerCompatible;\n  const int2 = 'isIntegerCompatible' in type2 && type2.isIntegerCompatible;\n  if (!int1 || !int2) {\n    if (type1.typeID === TypeID.basic && type2.typeID === TypeID.basic) {\n      return type1.baseID === type2.baseID ? type1 : null;\n    }\n    return null;\n  }\n  if (type1.typeID === TypeID.integer) {\n    return type2;\n  } else if (type2.typeID === TypeID.integer) {\n    return type1;\n  } else {\n    return IntegerT;\n  }\n}\n\nfunction extractBasesImpl(target: ExpressionType): string[] {\n  switch (target.typeID) {\n    case TypeID.basic:\n      return [target.baseID];\n    case TypeID.collection:\n      return extractBasesImpl(target.base);\n    case TypeID.tuple:\n      return target.factors.reduce((result, factor) => result.concat(extractBasesImpl(factor)), [] as string[]);\n    case TypeID.function:\n      const result = extractBasesImpl(target.result);\n      return target.args.reduce((result, arg) => result.concat(extractBasesImpl(arg.type)), result);\n    case TypeID.predicate:\n      return target.args.reduce((result, arg) => result.concat(extractBasesImpl(arg.type)), [] as string[]);\n    default:\n      return [];\n  }\n}\n"],"mappings":";;;;;;AAsBA,MAAM,gBAA2C;EAC9C,OAAO,kBAAkB,UAAU;EACnC,OAAO,UAAU,UAAU;EAC3B,OAAO,QAAQ,UAAU;EACzB,OAAO,QAAQ,UAAU;EACzB,OAAO,aAAa,UAAU;EAC9B,OAAO,QAAQ,UAAU;EACzB,OAAO,WAAW,UAAU;EAC5B,OAAO,YAAY,UAAU;AAChC;;AAGA,SAAgB,aAAa,QAA2B;CACtD,OAAO,cAAc;AACvB;;AAGA,SAAgB,YAAY,MAA6B;CACvD,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,UAAU,KAAK,MAAM;EAC9B,KAAK,OAAO,YACV,OAAO,YAAY,KAAK,IAAI;EAC9B,KAAK,OAAO;GACV,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,YAAY,MAAM,GACpB,OAAO;GAGX,OAAO;CACX;AACF;;AAGA,SAAgB,cAAc,OAAqB,OAA8B;CAC/E,IAAI,UAAU,OACZ,OAAO;CAET,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO;CAET,QAAQ,MAAM,QAAd;EACE,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,MAAM,WAAY,MAAsB;EACjD,KAAK,OAAO,YACV,OAAO,cAAc,MAAM,MAAO,MAA4B,IAAI;EACpE,KAAK,OAAO;GACV,IAAI,MAAM,QAAQ,WAAY,MAAuB,QAAQ,QAC3D,OAAO;GAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,QAAQ,EAAE,OAClD,IAAI,CAAC,cAAc,MAAM,QAAQ,QAAS,MAAuB,QAAQ,MAAM,GAC7E,OAAO;GAGX,OAAO;CAEX;AACF;;AAGA,SAAgB,mBAAmB,OAAqB,OAA0C;CAChG,IAAI,UAAU,OACZ,OAAO;CAET,IAAI,MAAM,WAAW,OAAO,iBAC1B,OAAO,eAAe,KAAK,IAAI,QAAQ;CAEzC,IAAI,MAAM,WAAW,OAAO,iBAC1B,OAAO,eAAe,KAAK,IAAI,QAAQ;CAGzC,QAAQ,MAAM,QAAd;EACE,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAO,WAAW,OAAO,KAAK;EAChC,KAAK,OAAO;GACV,IAAI,MAAM,WAAW,OAAO,YAC1B,OAAO;GAET,MAAM,OAAO,mBAAmB,MAAM,MAAM,MAAM,IAAI;GACtD,OAAO,OAAO,KAAK,IAAI,IAAI;EAC7B,KAAK,OAAO;GACV,IAAI,MAAM,WAAW,OAAO,OAC1B,OAAO;GAET,IAAI,MAAM,QAAQ,WAAW,MAAM,QAAQ,QACzC,OAAO;GAET,MAAM,aAA6B,CAAC;GACpC,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,QAAQ,EAAE,OAAO;IACzD,MAAM,YAAY,mBAAmB,MAAM,QAAQ,QAAQ,MAAM,QAAQ,MAAM;IAC/E,IAAI,cAAc,MAChB,OAAO;IAET,WAAW,KAAK,SAAS;GAC3B;GACA,OAAO,MAAM,UAAU;CAC3B;AACF;;AAGA,SAAgB,mBAAmB,OAAuB,OAAgC;CACxF,IAAI,UAAU,OACZ,OAAO;CAET,IAAI,MAAM,WAAW,OAAO,iBAC1B,OAAO,eAAe,KAAK;CAE7B,IAAI,MAAM,WAAW,OAAO,iBAC1B,OAAO,eAAe,KAAK;CAE7B,IAAI,eAAe,KAAK,MAAM,eAAe,KAAK,GAChD,OAAO;CAET,IACE,MAAM,WAAW,OAAO,WACxB,MAAM,WAAW,OAAO,SACxB,MAAM,WAAW,OAAO,WACxB,MAAM,WAAW,OAAO,OAExB,OAAO,WAAW,OAAuB,KAAqB,MAAM;CAGtE,IAAI,MAAM,WAAW,MAAM,QACzB,OAAO;CAET,QAAQ,MAAM,QAAd;EACE,KAAK,OAAO,YACV,OAAO,mBAAmB,MAAM,MAAO,MAA4B,IAAI;EACzE,KAAK,OAAO;GACV,IAAI,MAAM,QAAQ,WAAY,MAAuB,QAAQ,QAC3D,OAAO;GAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,QAAQ,EAAE,OAClD,IAAI,CAAC,mBAAmB,MAAM,QAAQ,QAAS,MAAuB,QAAQ,MAAM,GAClF,OAAO;GAGX,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,UACV,OAAO;CACX;AACF;;AAGA,SAAgB,iBACd,aACA,KACA,OACS;CACT,IAAI,QAAQ,OACV,OAAO;CAET,IAAI,IAAI,WAAW,OAAO,SAAS,UAAU,IAAI,MAAM,GAAG;EACxD,IAAI,CAAC,YAAY,IAAI,IAAI,MAAM,GAAG;GAChC,YAAY,IAAI,IAAI,QAAQ,KAAK;GACjC,OAAO;EACT,OAAO;GACL,MAAM,YAAY,mBAAmB,YAAY,IAAI,IAAI,MAAM,GAAI,KAAK;GACxE,IAAI,cAAc,MAChB,OAAO;GAET,YAAY,IAAI,IAAI,QAAQ,SAAS;GACrC,OAAO;EACT;CACF;CACA,IAAI,IAAI,WAAW,OAAO,mBAAmB,MAAM,WAAW,OAAO,iBACnE,OAAO;CAET,IACE,IAAI,WAAW,OAAO,WACtB,IAAI,WAAW,OAAO,SACtB,MAAM,WAAW,OAAO,WACxB,MAAM,WAAW,OAAO,OAExB,OAAO,WAAW,KAAK,KAAK,MAAM;CAEpC,IAAI,IAAI,WAAW,MAAM,QACvB,OAAO;CAET,QAAQ,IAAI,QAAZ;EACE,KAAK,OAAO,YACV,OAAO,iBAAiB,aAAa,IAAI,MAAO,MAA4B,IAAI;EAClF,KAAK,OAAO;GACV,IAAI,IAAI,QAAQ,WAAY,MAAuB,QAAQ,QACzD,OAAO;GAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,IAAI,QAAQ,QAAQ,EAAE,OAChD,IAAI,CAAC,iBAAiB,aAAa,IAAI,QAAQ,QAAS,MAAuB,QAAQ,MAAM,GAC3F,OAAO;GAGX,OAAO;CAEX;AACF;;AAGA,SAAgB,kBAAkB,MAAkC;CAClE,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,EAAE,GAAG,KAAK;EACnB,KAAK,OAAO,YACV,OAAO;GAAE,QAAQ,KAAK;GAAQ,MAAM,kBAAkB,KAAK,IAAI;EAAE;EACnE,KAAK,OAAO,OACV,OAAO;GAAE,QAAQ,KAAK;GAAQ,SAAS,KAAK,QAAQ,IAAI,iBAAiB;EAAE;CAC/E;AACF;;AAGA,SAAgB,eAAe,QAAsB,aAA8C;CACjG,QAAQ,OAAO,QAAf;EACE,KAAK,OAAO;GACV,IAAI,YAAY,IAAI,OAAO,MAAM,GAC/B,OAAO,OAAO,QAAQ,YAAY,IAAI,OAAO,MAAM,CAAE;GAEvD;EAEF,KAAK,OAAO;GACV,eAAe,OAAO,MAAM,WAAW;GACvC;EAEF,KAAK,OAAO;GACV,KAAK,MAAM,UAAU,OAAO,SAC1B,eAAe,QAAQ,WAAW;GAEpC;CAEJ;AACF;;AAGA,SAAgB,aAAa,QAAqC;CAChE,OAAO,IAAI,IAAI,iBAAiB,MAAM,CAAC;AACzC;;AAGA,SAAgB,UAAU,QAAsB,MAAgB,QAAQ,GAAwB;CAC9F,IAAI,UAA+B;CACnC,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,UAAU,SACxB,QAAQ,QAAQ,QAAhB;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;GACV,UAAU,QAAQ;GAClB;GACA;EACF,KAAK,OAAO;GACV,UAAU,UAAU,SAAS,KAAK,EAAE;GACpC,IAAI,YAAY,MACd,OAAO;GAET;CAEJ;CAEF,OAAO;AACT;AAGA,SAAS,WAAW,OAAqB,OAA0C;CACjF,IAAI,UAAU,OACZ,OAAO;CAET,MAAM,OAAO,yBAAyB,SAAS,MAAM;CACrD,MAAM,OAAO,yBAAyB,SAAS,MAAM;CACrD,IAAI,CAAC,QAAQ,CAAC,MAAM;EAClB,IAAI,MAAM,WAAW,OAAO,SAAS,MAAM,WAAW,OAAO,OAC3D,OAAO,MAAM,WAAW,MAAM,SAAS,QAAQ;EAEjD,OAAO;CACT;CACA,IAAI,MAAM,WAAW,OAAO,SAC1B,OAAO;MACF,IAAI,MAAM,WAAW,OAAO,SACjC,OAAO;MAEP,OAAO;AAEX;AAEA,SAAS,iBAAiB,QAAkC;CAC1D,QAAQ,OAAO,QAAf;EACE,KAAK,OAAO,OACV,OAAO,CAAC,OAAO,MAAM;EACvB,KAAK,OAAO,YACV,OAAO,iBAAiB,OAAO,IAAI;EACrC,KAAK,OAAO,OACV,OAAO,OAAO,QAAQ,QAAQ,QAAQ,WAAW,OAAO,OAAO,iBAAiB,MAAM,CAAC,GAAG,CAAC,CAAa;EAC1G,KAAK,OAAO;GACV,MAAM,SAAS,iBAAiB,OAAO,MAAM;GAC7C,OAAO,OAAO,KAAK,QAAQ,QAAQ,QAAQ,OAAO,OAAO,iBAAiB,IAAI,IAAI,CAAC,GAAG,MAAM;EAC9F,KAAK,OAAO,WACV,OAAO,OAAO,KAAK,QAAQ,QAAQ,QAAQ,OAAO,OAAO,iBAAiB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAa;EACtG,SACE,OAAO,CAAC;CACZ;AACF"}

package/dist/rslang/semantic/typification-parser.js

@@ -98,7 +98,10 @@ var TypificationParser = class {
 				return bool(base);
 			}
 			this.skipSpaces();
-			if (this.input.startsWith("ℬ", this.index)) return bool(this.parseTypification());
+			if (this.input.startsWith("ℬ", this.index)) {
+				const base = this.parseTypification();
+				return bool(base);
+			}
 			throw new Error("Expected \"(\" after \"ℬ\"");
 		}
 		const first = this.parseTypificationAtom();