@rsconcept/domain 1.4.1 → 1.4.3

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

@@ -168,12 +168,27 @@ var TypeAuditor = class TypeAuditor {
 		}
 		return true;
 	}
-	childTypeDebool(node, index, errorCode) {
+	childTypeDebool(node, index, errorCode, operation) {
 		const result = this.childTypification(node, index);
 		if (result === null) return null;
 		if (result.typeID === TypeID.anyTypification) return result;
 		if (result.typeID !== TypeID.collection) {
-			this.onError(errorCode, node.children[index], [labelType(result)]);
+			const params = errorCode === RSErrorCode.invalidTypeOperation && operation !== void 0 ? [operation, labelType(result)] : [labelType(result)];
+			this.onError(errorCode, node.children[index], params);
+			return null;
+		}
+		return debool(result);
+	}
+	childQuantifierDomain(node, index, operator) {
+		const result = this.visitChild(node, index);
+		if (result === null) return null;
+		if (!isTypification(result)) {
+			this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);
+			return null;
+		}
+		if (result.typeID === TypeID.anyTypification) return result;
+		if (result.typeID !== TypeID.collection) {
+			this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);
 			return null;
 		}
 		return debool(result);
@@ -248,7 +263,7 @@ var TypeAuditor = class TypeAuditor {
 	visitArgument(node) {
 		const variable = node.children[0];
 		if (variable.typeID === TokenID.NT_TUPLE_DECL) return this.onError(RSErrorCode.invalidArgumentCortegeDeclare, variable);
-		const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);
+		const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));
 		if (domain === null) return null;
 		if (!this.visitChildDeclaration(node, 0, domain)) return null;
 		return domain;
@@ -258,29 +273,40 @@ var TypeAuditor = class TypeAuditor {
 		return IntegerT;
 	}
 	visitArithmetic(node) {
+		const operator = labelRSLangNode(node);
 		const type1 = this.childTypification(node, 0);
 		if (type1 === null) return null;
-		if (!("isArithmetic" in type1 && type1.isArithmetic)) return this.onError(RSErrorCode.arithmeticNotSupported, node.children[0], [labelType(type1)]);
+		if (!("isArithmetic" in type1 && type1.isArithmetic)) return this.onError(RSErrorCode.arithmeticNotSupported, node.children[0], [labelType(type1), operator]);
 		const type2 = this.childTypification(node, 1);
 		if (type2 === null) return null;
-		if (!("isArithmetic" in type2 && type2.isArithmetic)) return this.onError(RSErrorCode.arithmeticNotSupported, node.children[1], [labelType(type2)]);
+		if (!("isArithmetic" in type2 && type2.isArithmetic)) return this.onError(RSErrorCode.arithmeticNotSupported, node.children[1], [labelType(type2), operator]);
 		const result = mergeTypifications(type1, type2);
-		if (result === null) return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);
+		if (result === null) return this.onError(RSErrorCode.typesNotCompatible, node, [
+			labelType(type1),
+			labelType(type2),
+			operator
+		]);
 		return result;
 	}
 	visitIntegerPredicate(node) {
+		const operator = labelRSLangNode(node);
 		const type1 = this.childTypification(node, 0);
 		if (type1 === null) return null;
-		if (!("isOrdered" in type1 && type1.isOrdered)) return this.onError(RSErrorCode.orderingNotSupported, node.children[0], [labelType(type1)]);
+		if (!("isOrdered" in type1 && type1.isOrdered)) return this.onError(RSErrorCode.orderingNotSupported, node.children[0], [labelType(type1), operator]);
 		const type2 = this.childTypification(node, 1);
 		if (type2 === null) return null;
-		if (!("isOrdered" in type2 && type2.isOrdered)) return this.onError(RSErrorCode.orderingNotSupported, node.children[1], [labelType(type2)]);
-		if (!checkCompatibility(type1, type2)) return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);
+		if (!("isOrdered" in type2 && type2.isOrdered)) return this.onError(RSErrorCode.orderingNotSupported, node.children[1], [labelType(type2), operator]);
+		if (!checkCompatibility(type1, type2)) return this.onError(RSErrorCode.typesNotCompatible, node, [
+			labelType(type1),
+			labelType(type2),
+			operator
+		]);
 		return LogicT;
 	}
 	visitQuantifier(node) {
 		this.locals.startScope();
-		const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);
+		const operator = labelRSLangNode(node);
+		const domain = this.childQuantifierDomain(node, 1, operator);
 		if (domain === null) return null;
 		else if (!this.visitChildDeclaration(node, 0, domain)) return null;
 		else if (!this.childLogic(node, 2)) return null;
@@ -296,24 +322,34 @@ var TypeAuditor = class TypeAuditor {
 		return LogicT;
 	}
 	visitEquals(node) {
+		const operator = labelRSLangNode(node);
 		const type1 = this.childTypification(node, 0);
 		if (type1 === null) return null;
 		const type2 = this.childTypification(node, 1);
 		if (type2 === null) return null;
-		if (!checkCompatibility(type1, type2)) return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);
+		if (!checkCompatibility(type1, type2)) return this.onError(RSErrorCode.typesNotCompatible, node, [
+			labelType(type1),
+			labelType(type2),
+			operator
+		]);
 		return LogicT;
 	}
 	visitSetexprPredicate(node) {
-		let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);
+		const operator = labelRSLangNode(node);
+		let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);
 		if (type2 === null) return null;
 		const isSubset = this.isSubset(node.typeID);
 		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)]);
+		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),
-			labelToken(node.typeID),
+			operator,
 			labelType(bool(type2))
 		]);
 		return LogicT;
@@ -360,12 +396,17 @@ var TypeAuditor = class TypeAuditor {
 		return this.childTypeDebool(node, 0, RSErrorCode.invalidDebool);
 	}
 	visitSetexprBinary(node) {
-		const type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation);
+		const operator = labelRSLangNode(node);
+		const type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation, operator);
 		if (type1 === null) return null;
-		const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);
+		const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);
 		if (type2 === null) return null;
 		const result = mergeTypifications(type1, type2);
-		if (result === null) return this.onError(RSErrorCode.typesNotEqual, node, [labelType(bool(type1)), labelType(bool(type2))]);
+		if (result === null) return this.onError(RSErrorCode.typesNotEqual, node, [
+			labelType(bool(type1)),
+			labelType(bool(type2)),
+			operator
+		]);
 		return bool(result);
 	}
 	visitProjectSet(node) {
@@ -399,6 +440,7 @@ var TypeAuditor = class TypeAuditor {
 		else return tuple(components);
 	}
 	visitFilter(node) {
+		const operator = labelRSLangNode(node);
 		const indices = getNodeIndices(node);
 		const tupleParam = indices.length === node.children.length - 1;
 		if (!tupleParam && node.children.length > 2) return this.onError(RSErrorCode.invalidFilterArity, node);
@@ -416,14 +458,22 @@ var TypeAuditor = class TypeAuditor {
 		if (tupleParam) for (let child = 0; child + 1 < node.children.length; child++) {
 			const param = this.childTypification(node, child);
 			if (param === null) return null;
-			if (param.typeID !== TypeID.collection || !checkCompatibility(bases[child], debool(param))) return this.onError(RSErrorCode.typesNotEqual, node.children[child], [labelType(param), labelType(bool(bases[child]))]);
+			if (param.typeID !== TypeID.collection || !checkCompatibility(bases[child], debool(param))) return this.onError(RSErrorCode.typesNotEqual, node.children[child], [
+				labelType(param),
+				labelType(bool(bases[child])),
+				operator
+			]);
 		}
 		else {
 			const param = this.childTypification(node, 0);
 			if (param === null) return null;
 			const paramType = param;
 			const expected = bool(tuple(bases));
-			if (paramType.typeID !== TypeID.collection || !checkCompatibility(expected, paramType)) return this.onError(RSErrorCode.typesNotEqual, node.children[0], [labelType(paramType), labelType(expected)]);
+			if (paramType.typeID !== TypeID.collection || !checkCompatibility(expected, paramType)) return this.onError(RSErrorCode.typesNotEqual, node.children[0], [
+				labelType(paramType),
+				labelType(expected),
+				operator
+			]);
 		}
 		return argument;
 	}
@@ -439,7 +489,7 @@ var TypeAuditor = class TypeAuditor {
 	}
 	visitDeclarative(node) {
 		this.locals.startScope();
-		const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);
+		const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.NT_DECLARATIVE_EXPR));
 		if (domain === null) return null;
 		else if (!this.visitChildDeclaration(node, 0, domain)) return null;
 		else if (!this.childLogic(node, 2)) return null;
@@ -455,7 +505,7 @@ var TypeAuditor = class TypeAuditor {
 		return bool(type);
 	}
 	visitIterate(node) {
-		const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);
+		const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));
 		if (domain === null) return null;
 		if (!this.visitChildDeclaration(node, 0, domain)) return null;
 		return LogicT;
@@ -475,7 +525,11 @@ var TypeAuditor = class TypeAuditor {
 		const iterationIndex = isFull ? 3 : 2;
 		let iterationValue = this.childTypification(node, iterationIndex);
 		if (iterationValue === null) return null;
-		if (!checkCompatibility(iterationValue, initType)) return this.onError(RSErrorCode.typesNotEqual, node.children[iterationIndex], [labelType(iterationValue), labelType(initType)]);
+		if (!checkCompatibility(iterationValue, initType)) return this.onError(RSErrorCode.typesNotEqual, node.children[iterationIndex], [
+			labelType(iterationValue),
+			labelType(initType),
+			labelToken(node.typeID)
+		]);
 		if (hasGenerics(initType)) for (let retries = TypeAuditor.TYPE_DEDUCTION_DEPTH; retries > 0; retries--) {
 			this.locals.endScope(node);
 			this.locals.clearUnused();

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  isRadical,\n  isTypification,\n  LogicT,\n  type Parametrized,\n  tuple,\n  type TypeContext,\n  TypeID,\n  type Typification\n} from './typification';\nimport {\n  checkCompatibility,\n  checkEquality,\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(node: AstNode, index: number, errorCode: RSErrorCode): 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      this.onError(errorCode, node.children[index], [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    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);\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 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)]);\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)]);\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);\n    }\n    return result;\n  }\n\n  private visitIntegerPredicate(node: AstNode): ExpressionType | null {\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)]);\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)]);\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);\n    }\n    return LogicT;\n  }\n\n  private visitQuantifier(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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 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)]);\n    }\n    return LogicT;\n  }\n\n  private visitSetexprPredicate(node: AstNode): ExpressionType | null {\n    let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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)]);\n      } else {\n        return this.onError(RSErrorCode.invalidElementPredicate, node, [\n          labelType(type1),\n          labelToken(node.typeID as TokenID),\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 type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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))]);\n    }\n    return bool(result);\n  }\n\n  private visitProjectSet(node: AstNode): ExpressionType | null {\n    const argument = this.childTypeDebool(node, 0, RSErrorCode.invalidProjectionSet);\n    if (argument === null) {\n      return null;\n    }\n    if (argument.typeID === TypeID.anyTypification) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidProjectionSet, node.children[0], [\n        labelRSLangNode(node),\n        labelType(bool(argument))\n      ]);\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.invalidProjectionSet, node.children[0], [\n          labelRSLangNode(node),\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 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.invalidProjectionTuple, node.children[0], [\n        labelRSLangNode(node),\n        labelType(argument)\n      ]);\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.invalidProjectionTuple, node.children[0], [\n          labelRSLangNode(node),\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 indices = getNodeIndices(node);\n    const tupleParam = indices.length === node.children.length - 1;\n    if (!tupleParam && node.children.length > 2) {\n      return this.onError(RSErrorCode.invalidFilterArity, node);\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    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidFilterArgumentType, node.children[node.children.length - 1], [\n        labelRSLangNode(node),\n        labelType(argument)\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.invalidFilterArgumentType, node.children[node.children.length - 1], [\n          labelRSLangNode(node),\n          labelType(argument)\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        if (param.typeID !== TypeID.collection || !checkCompatibility(bases[child], debool(param))) {\n          return this.onError(RSErrorCode.typesNotEqual, node.children[child], [\n            labelType(param),\n            labelType(bool(bases[child]))\n          ]);\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.onError(RSErrorCode.typesNotEqual, node.children[0], [labelType(paramType), labelType(expected)]);\n      }\n    }\n    return argument;\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(node, 1, RSErrorCode.invalidTypeOperation);\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);\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      ]);\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.children[1], [\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        this.onError(RSErrorCode.invalidArgumentType, node.children[child], [\n          `${type.args[child - 1].alias}∈${labelType(argType)}`,\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 (isRadical(type.baseID)) {\n        return {\n          typeID: type.typeID,\n          baseID: 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\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        const index = this.data.indexOf(existing);\n        if (index !== -1) {\n          this.data.splice(index, 1);\n        }\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      this.onError(RSErrorCode.localUndeclared, node, [alias]);\n      return null;\n    } else if (local.level < 1) {\n      this.onError(RSErrorCode.localOutOfScope, node, [alias]);\n      return null;\n    } else {\n      local.useCount++;\n      return local.type;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAsCA,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,gBAAwB,MAAe,OAAe,WAA6C;EACjG,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,KAAK,QAAQ,WAAW,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACjE,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,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,oBAAoB;EAC7E,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,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,CAAC,CAAC;EAG9F,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,CAAC,CAAC;EAG9F,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,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,CAAC,CAAC;EAG5F,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,CAAC,CAAC;EAG5F,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC7E,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,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,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,IAAI,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC1E,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,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;OAEzF,OAAO,KAAK,QAAQ,YAAY,yBAAyB,MAAM;GAC7D,UAAU,KAAK;GACf,WAAW,KAAK,MAAiB;GACjC,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,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC5E,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC5E,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM,CAAC,UAAU,KAAK,KAAK,CAAC,GAAG,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC;EAEvG,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC/E,IAAI,aAAa,MACf,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,iBAC7B,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CACtE,gBAAgB,IAAI,GACpB,UAAU,KAAK,QAAQ,CAAC,CAC1B,CAAC;EAGH,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,sBAAsB,KAAK,SAAS,IAAI,CACtE,gBAAgB,IAAI,GACpB,UAAU,KAAK,QAAQ,CAAC,CAC1B,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,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,wBAAwB,KAAK,SAAS,IAAI,CACxE,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;EAGH,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,wBAAwB,KAAK,SAAS,IAAI,CACxE,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,WAAW;OAElB,OAAO,MAAM,UAAU;CAE3B;CAEA,YAAoB,MAAsC;EACxD,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAAa,QAAQ,WAAW,KAAK,SAAS,SAAS;EAC7D,IAAI,CAAC,cAAc,KAAK,SAAS,SAAS,GACxC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,IAAI;EAG1D,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,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,OAC3E,OAAO,KAAK,QAAQ,YAAY,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI,CAClG,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,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,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI,CAClG,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,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,IAAI,MAAM,WAAW,OAAO,cAAc,CAAC,mBAAmB,MAAM,QAAQ,OAAO,KAAK,CAAC,GACvF,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,QAAQ,CACnE,UAAU,KAAK,GACf,UAAU,KAAK,MAAM,MAAM,CAAC,CAC9B,CAAC;EAEL;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,QAAQ,YAAY,eAAe,KAAK,SAAS,IAAI,CAAC,UAAU,SAAS,GAAG,UAAU,QAAQ,CAAC,CAAC;EAEhH;EACA,OAAO;CACT;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,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC7E,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,oBAAoB;EAC7E,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,CAC5E,UAAU,cAAc,GACxB,UAAU,QAAQ,CACpB,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,KAAK,SAAS,IAAI,CAClE,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,KAAK,QAAQ,YAAY,qBAAqB,KAAK,SAAS,QAAQ,CAClE,GAAG,KAAK,KAAK,QAAQ,EAAE,CAAC,MAAM,GAAG,UAAU,OAAO,KAClD,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,UAAU,KAAK,MAAM,GACvB,OAAO;IACL,QAAQ,KAAK;IACb,QAAQ,KAAK,SAAS;GACxB;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;;AAWA,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,MAAM,QAAQ,KAAK,KAAK,QAAQ,QAAQ;GACxC,IAAI,UAAU,IACZ,KAAK,KAAK,OAAO,OAAO,CAAC;EAE7B;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,QAAW;GACvB,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;GACvD,OAAO;EACT,OAAO,IAAI,MAAM,QAAQ,GAAG;GAC1B,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;GACvD,OAAO;EACT,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  isRadical,\n  isTypification,\n  LogicT,\n  type Parametrized,\n  tuple,\n  type TypeContext,\n  TypeID,\n  type Typification\n} from './typification';\nimport {\n  checkCompatibility,\n  checkEquality,\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    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 argument = this.childTypeDebool(node, 0, RSErrorCode.invalidProjectionSet);\n    if (argument === null) {\n      return null;\n    }\n    if (argument.typeID === TypeID.anyTypification) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidProjectionSet, node.children[0], [\n        labelRSLangNode(node),\n        labelType(bool(argument))\n      ]);\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.invalidProjectionSet, node.children[0], [\n          labelRSLangNode(node),\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 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.invalidProjectionTuple, node.children[0], [\n        labelRSLangNode(node),\n        labelType(argument)\n      ]);\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.invalidProjectionTuple, node.children[0], [\n          labelRSLangNode(node),\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      return this.onError(RSErrorCode.invalidFilterArity, node);\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    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidFilterArgumentType, node.children[node.children.length - 1], [\n        labelRSLangNode(node),\n        labelType(argument)\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.invalidFilterArgumentType, node.children[node.children.length - 1], [\n          labelRSLangNode(node),\n          labelType(argument)\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        if (param.typeID !== TypeID.collection || !checkCompatibility(bases[child], debool(param))) {\n          return this.onError(RSErrorCode.typesNotEqual, node.children[child], [\n            labelType(param),\n            labelType(bool(bases[child])),\n            operator\n          ]);\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.onError(RSErrorCode.typesNotEqual, node.children[0], [\n          labelType(paramType),\n          labelType(expected),\n          operator\n        ]);\n      }\n    }\n    return argument;\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.children[1], [\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        this.onError(RSErrorCode.invalidArgumentType, node.children[child], [\n          `${type.args[child - 1].alias}∈${labelType(argType)}`,\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 (isRadical(type.baseID)) {\n        return {\n          typeID: type.typeID,\n          baseID: 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\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        const index = this.data.indexOf(existing);\n        if (index !== -1) {\n          this.data.splice(index, 1);\n        }\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      this.onError(RSErrorCode.localUndeclared, node, [alias]);\n      return null;\n    } else if (local.level < 1) {\n      this.onError(RSErrorCode.localOutOfScope, node, [alias]);\n      return null;\n    } else {\n      local.useCount++;\n      return local.type;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAsCA,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,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,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC/E,IAAI,aAAa,MACf,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,iBAC7B,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CACtE,gBAAgB,IAAI,GACpB,UAAU,KAAK,QAAQ,CAAC,CAC1B,CAAC;EAGH,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,sBAAsB,KAAK,SAAS,IAAI,CACtE,gBAAgB,IAAI,GACpB,UAAU,KAAK,QAAQ,CAAC,CAC1B,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,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,wBAAwB,KAAK,SAAS,IAAI,CACxE,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;EAGH,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,wBAAwB,KAAK,SAAS,IAAI,CACxE,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,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,GACxC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,IAAI;EAG1D,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,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,OAC3E,OAAO,KAAK,QAAQ,YAAY,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI,CAClG,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,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,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI,CAClG,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,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,IAAI,MAAM,WAAW,OAAO,cAAc,CAAC,mBAAmB,MAAM,QAAQ,OAAO,KAAK,CAAC,GACvF,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,QAAQ;IACnE,UAAU,KAAK;IACf,UAAU,KAAK,MAAM,MAAM,CAAC;IAC5B;GACF,CAAC;EAEL;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,QAAQ,YAAY,eAAe,KAAK,SAAS,IAAI;IAC/D,UAAU,SAAS;IACnB,UAAU,QAAQ;IAClB;GACF,CAAC;EAEL;EACA,OAAO;CACT;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,KAAK,SAAS,IAAI,CAClE,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,KAAK,QAAQ,YAAY,qBAAqB,KAAK,SAAS,QAAQ,CAClE,GAAG,KAAK,KAAK,QAAQ,EAAE,CAAC,MAAM,GAAG,UAAU,OAAO,KAClD,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,UAAU,KAAK,MAAM,GACvB,OAAO;IACL,QAAQ,KAAK;IACb,QAAQ,KAAK,SAAS;GACxB;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;;AAWA,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,MAAM,QAAQ,KAAK,KAAK,QAAQ,QAAQ;GACxC,IAAI,UAAU,IACZ,KAAK,KAAK,OAAO,OAAO,CAAC;EAE7B;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,QAAW;GACvB,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;GACvD,OAAO;EACT,OAAO,IAAI,MAAM,QAAQ,GAAG;GAC1B,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;GACvD,OAAO;EACT,OAAO;GACL,MAAM;GACN,OAAO,MAAM;EACf;CACF;AACF"}

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

@@ -1,5 +1,5 @@
 import { t as AstNode } from "../../ast-C8sIpKdL.js";
-import { t as ErrorReporter } from "../../error-deey7EiC.js";
+import { t as ErrorReporter } from "../../error-DuqsZDL5.js";
 import { n as ValueClassContext, t as ValueClass } from "../../value-class-CNI-lqXJ.js";
 
 //#region src/rslang/semantic/value-auditor.d.ts

package/dist/{value-ybFBRuz6.js → value-COprb2Je.js}

@@ -1,6 +1,6 @@
+import { TypeID } from "./rslang/semantic/typification.js";
 import { generateStub } from "./shared/hash.js";
 import "./shared/index.js";
-import { TypeID } from "./rslang/semantic/typification.js";
 //#region src/rslang/eval/value-api.ts
 /** Cartesian product of factor sets. */
 function cartesianProduct(factors) {
@@ -374,4 +374,4 @@ function set(elements) {
 //#endregion
 export { setUnion as A, printValue as C, setIntersection as D, setDiff as E, validateValue as M, valueStub as N, setNestedValue as O, normalizeValue as S, reduce as T, extractValue as _, SET_INFINITY as a, isTupleValue as b, VALUE_TRUE as c, set as d, tuple as f, convertPathToType as g, contains as h, INVALID_ELEMENT as i, testInvalid as j, setSymDiff as k, compare as l, cartesianProduct as m, CalcInvalidDataError as n, TUPLE_ID as o, boolean as p, EmptySetV as r, VALUE_FALSE as s, BOOL_INFINITY as t, makeValuePath as u, isSetValue as v, projection as w, makeDefaultValue as x, isSubsetOrEq as y };
 
-//# sourceMappingURL=value-ybFBRuz6.js.map
+//# sourceMappingURL=value-COprb2Je.js.map

package/dist/{value-ybFBRuz6.js.map → value-COprb2Je.js.map}

@@ -1 +1 @@
-{"version":3,"file":"value-ybFBRuz6.js","names":[],"sources":["../src/rslang/eval/value-api.ts","../src/rslang/eval/value.ts"],"sourcesContent":["import { generateStub } from '../../shared';\nimport { type ExpressionType, TypeID, type TypePath, type Typification } from '../semantic/typification';\n\nimport {\n  BOOL_INFINITY,\n  compare,\n  EmptySetV,\n  INVALID_ELEMENT,\n  makeValuePath,\n  set,\n  SET_INFINITY,\n  tuple,\n  TUPLE_ID,\n  type Value,\n  VALUE_FALSE,\n  VALUE_TRUE,\n  type ValueContext,\n  type ValuePath\n} from './value';\n\n/** Cartesian product of factor sets. */\nexport function cartesianProduct(factors: Value[][]): Value[] | null {\n  const cardinality = factors.reduce((acc, f) => acc * f.length, 1);\n  if (cardinality > SET_INFINITY) {\n    return null;\n  }\n  if (cardinality === 0 || factors.length === 0) {\n    return EmptySetV;\n  }\n\n  let accumulator: Value[][] = [[]];\n  for (const factor of factors) {\n    const next: Value[][] = [];\n    for (const prefix of accumulator) {\n      for (const value of factor) {\n        next.push([...prefix, value]);\n      }\n    }\n    accumulator = next;\n  }\n  return accumulator.map(tuple);\n}\n\n/** Boolean power set ℬ(X). No cache - materialized. */\nexport function boolean(base: Value[]): Value[] | null {\n  if (base.length > BOOL_INFINITY) {\n    return null;\n  }\n  return powerset(base);\n}\n\n/** Powerset of array. */\nfunction powerset(arr: readonly Value[]): Value[][] {\n  const result: Value[][] = [[]];\n  if (arr.length === 0) {\n    return result;\n  }\n\n  let current: Value[][] = [[]];\n  let maxIndex: number[] = [-1];\n  while (current.length > 0) {\n    const next: Value[][] = [];\n    const nextMaxIndex: number[] = [];\n    for (let i = 0; i < current.length; i++) {\n      for (let j = maxIndex[i] + 1; j < arr.length; j++) {\n        const subset = [...current[i], arr[j]];\n        result.push(subset);\n        if (j < arr.length - 1) {\n          next.push(subset);\n          nextMaxIndex.push(j);\n        }\n      }\n    }\n    current = next;\n    maxIndex = nextMaxIndex;\n  }\n  return result;\n}\n\n/** Check if set contains element. */\nexport function contains(setData: Value[], element: Value): boolean {\n  let left = 0;\n  let right = setData.length - 1;\n  while (left <= right) {\n    const mid = Math.floor((left + right) / 2);\n    const cmp = compare(setData[mid], element);\n    if (cmp === 0) {\n      return true;\n    } else if (cmp < 0) {\n      left = mid + 1;\n    } else {\n      right = mid - 1;\n    }\n  }\n  return false;\n}\n\n/** Is A ⊆ B. */\nexport function isSubsetOrEq(a: Value[], b: Value[]): boolean {\n  let i = 0,\n    j = 0;\n  while (i < a.length && j < b.length) {\n    const cmp = compare(a[i], b[j]);\n    if (cmp === 0) {\n      i++;\n      j++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      return false;\n    }\n  }\n  return i === a.length;\n}\n\n/** Reduce: flatten double boolean to single boolean. */\nexport function reduce(target: Value[][]): Value[] {\n  const result: Value[] = [];\n  for (const element of target) {\n    result.push(...element);\n  }\n  return set(result);\n}\n\n/** Union A ∪ B. */\nexport function setUnion(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      result.push(set2[j]);\n      j++;\n    } else {\n      result.push(set1[i]);\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  while (j < set2.length) {\n    result.push(set2[j]);\n    j++;\n  }\n  return result;\n}\n\n/** Intersection A ∩ B. */\nexport function setIntersection(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  for (let i = 0, j = 0; i < set1.length && j < set2.length; ) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      i++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      result.push(set1[i]);\n      i++;\n      j++;\n    }\n  }\n  return result;\n}\n\n/** Difference A \\ B. */\nexport function setDiff(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  return result;\n}\n\n/** Symmetric difference A ∆ B. */\nexport function setSymDiff(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      result.push(set2[j]);\n      j++;\n    } else {\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  while (j < set2.length) {\n    result.push(set2[j]);\n    j++;\n  }\n  return result;\n}\n\n/** Projection of set by indices (BigPr). */\nexport function projection(target: Value[][], indices: number[]): Value[] {\n  const projectedElements: Value[] = target.map(element => {\n    const newComponents = indices.map(idx => element[idx]);\n    return indices.length === 1 ? newComponents[0] : tuple(newComponents);\n  });\n  return set(projectedElements);\n}\n\n/** Condensed string representation. */\nexport function printValue(data: Value | null): string {\n  if (!Array.isArray(data)) {\n    return String(data);\n  }\n  const len = data.length;\n  if (data.length === 0) {\n    return '{}';\n  }\n\n  const isTuple = data[0] === TUPLE_ID;\n  const start = isTuple ? 1 : 0;\n\n  let result = isTuple ? '(' : '{';\n  for (let i = start; i < len; i++) {\n    if (i > start) result += ', ';\n    result += printValue(data[i]);\n  }\n  result += isTuple ? ')' : '}';\n  return result;\n}\n\n/** Generates stub ID for value. */\nexport function valueStub(value: Value | null): string {\n  if (value == null) {\n    return '';\n  }\n  const str = printValue(value);\n  return generateStub(str);\n}\n\n/** Checks if value is a set representation, not a tuple representation. */\nexport function isSetValue(data: Value | null): data is Value[] {\n  return Array.isArray(data) && (data.length === 0 || data[0] !== TUPLE_ID);\n}\n\n/** Checks if value is a tuple representation. */\nexport function isTupleValue(data: Value | null): data is Value[] {\n  return Array.isArray(data) && data.length > 1 && data[0] === TUPLE_ID;\n}\n\n/** Normalize unsorted array of values. */\nexport function normalizeValue(data: Value): void {\n  if (!Array.isArray(data) || data.length === 0) {\n    return;\n  }\n\n  if (data[0] === TUPLE_ID) {\n    for (let i = 1; i < data.length; i++) {\n      normalizeValue(data[i]);\n    }\n    return;\n  }\n\n  for (const item of data) {\n    normalizeValue(item);\n  }\n\n  data.sort((a, b) => compare(a, b));\n  let i = 1;\n  while (i < data.length) {\n    if (compare(data[i - 1], data[i]) === 0) {\n      data.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n}\n\n/** Validates value for {@link ExpressionType} and value of basic sets. */\nexport function validateValue(value: Value, type: ExpressionType, basics: ValueContext): boolean {\n  switch (type.typeID) {\n    case TypeID.integer:\n      return typeof value === 'number';\n    case TypeID.logic: {\n      if (typeof value !== 'number') {\n        return false;\n      }\n      return value === VALUE_TRUE || value === VALUE_FALSE;\n    }\n    case TypeID.basic: {\n      if (typeof value !== 'number') {\n        return false;\n      }\n      const domain = basics.get(type.baseID);\n      return !!domain && Array.isArray(domain) && domain.includes(value);\n    }\n\n    case TypeID.tuple: {\n      if (!Array.isArray(value) || value.length !== type.factors.length + 1 || value[0] !== TUPLE_ID) {\n        return false;\n      }\n      for (let i = 0; i < type.factors.length; i++) {\n        if (!validateValue(value[i + 1], type.factors[i], basics)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    case TypeID.collection: {\n      if (!isSetValue(value)) {\n        return false;\n      }\n      for (const item of value) {\n        if (!validateValue(item, type.base, basics)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    case TypeID.anyTypification:\n    case TypeID.predicate:\n    case TypeID.function:\n      return false;\n  }\n}\n\n/** Converts value path to type path. */\nexport function convertPathToType(path: ValuePath, type: Typification): TypePath | null {\n  const result: number[] = [];\n  if (path.length === 0) {\n    return result as TypePath;\n  }\n\n  let curType = type;\n  let index = 0;\n  while (index < path.length) {\n    switch (curType.typeID) {\n      case TypeID.collection: {\n        result.push(0);\n        curType = curType.base;\n        index++;\n        break;\n      }\n      case TypeID.tuple: {\n        const tupleIdx = path[index];\n        if (typeof tupleIdx !== 'number' || tupleIdx < 1 || tupleIdx > curType.factors.length) {\n          return null;\n        }\n        result.push(tupleIdx);\n        curType = curType.factors[tupleIdx - 1];\n        index++;\n        break;\n      }\n      case TypeID.basic:\n      case TypeID.integer:\n      case TypeID.anyTypification:\n        return null;\n    }\n  }\n  return result as TypePath;\n}\n\n/** Extracts value from a target by path. */\nexport function extractValue(target: Value, path: ValuePath): Value | null {\n  let current: Value = target;\n  let i = 0;\n  while (i < path.length) {\n    if (!Array.isArray(current) || current.length <= path[i]) {\n      return null;\n    }\n    current = current[path[i]];\n    i++;\n  }\n  return current;\n}\n\n/** Makes default value for a type. */\nexport function makeDefaultValue(type: Typification): Value {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n    case TypeID.integer:\n    case TypeID.basic:\n      return INVALID_ELEMENT;\n    case TypeID.collection:\n      return [];\n    case TypeID.tuple:\n      return tuple(type.factors.map(item => makeDefaultValue(item)));\n  }\n}\n\n/** Perform immutable deep copy update. */\nexport function setNestedValue(target: Value | null, path: ValuePath, newVal: Value): Value {\n  if (path.length === 0) {\n    return newVal;\n  }\n  const [head, ...rest] = path;\n  const arr = Array.isArray(target) ? [...target] : [];\n  arr[head] = setNestedValue(arr[head], makeValuePath(rest), newVal);\n  return arr;\n}\n\n/** Test if value contains invalid elements. */\nexport function testInvalid(value: Value): boolean {\n  const stack = [value];\n  while (stack.length > 0) {\n    const current = stack.pop();\n    if (current === INVALID_ELEMENT) {\n      return true;\n    }\n    if (Array.isArray(current)) {\n      for (const element of current) {\n        stack.push(element);\n      }\n    }\n  }\n  return false;\n}\n","/**\n * Module: Structured data for RSLang expression evaluation.\n */\n\nimport { type Branded } from '../../shared';\n\nimport { printValue } from './value-api';\n\n/** Tuple ID for array distinction. */\nexport const TUPLE_ID = -111;\n\n/** Invalid value for structured data. */\nexport const INVALID_ELEMENT = -1;\n\n/** Boolean values: true. */\nexport const VALUE_TRUE = 1;\n\n/** Boolean values: false. */\nexport const VALUE_FALSE = 0;\n\n/** Cardinality threshold for \"infinite\" sets (e.g. Z). */\nexport const SET_INFINITY = 10_000_000;\n\n/** Cardinality threshold for Boolean power set. */\nexport const BOOL_INFINITY = 18;\n\n/** Expression evaluation result: structured data. */\nexport type Value = number | Value[];\n\n/** Values context. */\nexport type ValueContext = Map<string, Value>;\n\n/** Value extraction path. */\nexport type ValuePath = Branded<number[], 'ValuePath'>;\n\n/** Creates value path. */\nexport function makeValuePath(path: number[]): ValuePath {\n  return path as ValuePath;\n}\n\n/** Empty set ∅. */\nexport const EmptySetV = [];\n\n/** Thrown when a runtime value operation cannot be applied to the given operands. */\nexport class CalcInvalidDataError extends Error {\n  readonly left: string;\n  readonly right: string;\n\n  constructor(left: string, right: string) {\n    super(`Cannot compare different types ${left} and ${right}`);\n    this.name = 'CalcInvalidDataError';\n    this.left = left;\n    this.right = right;\n  }\n}\n\n/** Compare two structured data without recursive calls. */\nexport function compare(v1: Value, v2: Value): number {\n  const stack1: Value[] = [v1];\n  const stack2: Value[] = [v2];\n\n  while (stack1.length > 0 && stack2.length > 0) {\n    const el1 = stack1.pop();\n    const el2 = stack2.pop();\n    if (el1 === el2) {\n      continue;\n    }\n\n    const type1 = typeof el1;\n    const type2 = typeof el2;\n    if (type1 === 'number' && type2 === 'number') {\n      const numDiff = (el1 as number) - (el2 as number);\n      if (numDiff !== 0) return numDiff;\n      continue;\n    }\n\n    const isArray1 = Array.isArray(el1);\n    const isArray2 = Array.isArray(el2);\n    if (!isArray1 || !isArray2) {\n      throw new CalcInvalidDataError(printValue(el1!), printValue(el2!));\n    }\n\n    const arr1 = el1;\n    const arr2 = el2;\n    const len1 = arr1.length;\n    const len2 = arr2.length;\n    if (len1 !== len2) {\n      return len1 - len2;\n    }\n\n    for (let i = len1 - 1; i >= 0; i--) {\n      stack1.push(arr1[i]);\n      stack2.push(arr2[i]);\n    }\n  }\n  return 0;\n}\n\n/** Tuple from components. */\nexport function tuple(components: Value[]): Value {\n  return [TUPLE_ID, ...components];\n}\n\n/** Set from elements (unique). Value[] - materialized. */\nexport function set(elements: Value[]): Value[] {\n  const sorted = [...elements].sort(compare);\n  for (let i = 1; i < sorted.length; ) {\n    if (compare(sorted[i - 1], sorted[i]) === 0) {\n      sorted.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n  return sorted;\n}\n"],"mappings":";;;;;AAqBA,SAAgB,iBAAiB,SAAoC;CACnE,MAAM,cAAc,QAAQ,QAAQ,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;CAChE,IAAI,cAAA,KACF,OAAO;CAET,IAAI,gBAAgB,KAAK,QAAQ,WAAW,GAC1C,OAAO;CAGT,IAAI,cAAyB,CAAC,CAAC,CAAC;CAChC,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,OAAkB,CAAC;EACzB,KAAK,MAAM,UAAU,aACnB,KAAK,MAAM,SAAS,QAClB,KAAK,KAAK,CAAC,GAAG,QAAQ,KAAK,CAAC;EAGhC,cAAc;CAChB;CACA,OAAO,YAAY,IAAI,KAAK;AAC9B;;AAGA,SAAgB,QAAQ,MAA+B;CACrD,IAAI,KAAK,SAAA,IACP,OAAO;CAET,OAAO,SAAS,IAAI;AACtB;;AAGA,SAAS,SAAS,KAAkC;CAClD,MAAM,SAAoB,CAAC,CAAC,CAAC;CAC7B,IAAI,IAAI,WAAW,GACjB,OAAO;CAGT,IAAI,UAAqB,CAAC,CAAC,CAAC;CAC5B,IAAI,WAAqB,CAAC,EAAE;CAC5B,OAAO,QAAQ,SAAS,GAAG;EACzB,MAAM,OAAkB,CAAC;EACzB,MAAM,eAAyB,CAAC;EAChC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,KAAK,IAAI,IAAI,SAAS,KAAK,GAAG,IAAI,IAAI,QAAQ,KAAK;GACjD,MAAM,SAAS,CAAC,GAAG,QAAQ,IAAI,IAAI,EAAE;GACrC,OAAO,KAAK,MAAM;GAClB,IAAI,IAAI,IAAI,SAAS,GAAG;IACtB,KAAK,KAAK,MAAM;IAChB,aAAa,KAAK,CAAC;GACrB;EACF;EAEF,UAAU;EACV,WAAW;CACb;CACA,OAAO;AACT;;AAGA,SAAgB,SAAS,SAAkB,SAAyB;CAClE,IAAI,OAAO;CACX,IAAI,QAAQ,QAAQ,SAAS;CAC7B,OAAO,QAAQ,OAAO;EACpB,MAAM,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC;EACzC,MAAM,MAAM,QAAQ,QAAQ,MAAM,OAAO;EACzC,IAAI,QAAQ,GACV,OAAO;OACF,IAAI,MAAM,GACf,OAAO,MAAM;OAEb,QAAQ,MAAM;CAElB;CACA,OAAO;AACT;;AAGA,SAAgB,aAAa,GAAY,GAAqB;CAC5D,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,EAAE,UAAU,IAAI,EAAE,QAAQ;EACnC,MAAM,MAAM,QAAQ,EAAE,IAAI,EAAE,EAAE;EAC9B,IAAI,QAAQ,GAAG;GACb;GACA;EACF,OAAO,IAAI,MAAM,GACf;OAEA,OAAO;CAEX;CACA,OAAO,MAAM,EAAE;AACjB;;AAGA,SAAgB,OAAO,QAA4B;CACjD,MAAM,SAAkB,CAAC;CACzB,KAAK,MAAM,WAAW,QACpB,OAAO,KAAK,GAAG,OAAO;CAExB,OAAO,IAAI,MAAM;AACnB;;AAGA,SAAgB,SAAS,MAAe,MAAwB;CAC9D,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GAAG;GAClB,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO;GACL,OAAO,KAAK,KAAK,EAAE;GACnB;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,gBAAgB,MAAe,MAAwB;CACrE,MAAM,SAAkB,CAAC;CACzB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,SAAU;EAC3D,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GACR;OACK,IAAI,MAAM,GACf;OACK;GACL,OAAO,KAAK,KAAK,EAAE;GACnB;GACA;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,MAAe,MAAwB;CAC7D,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GACf;OACK;GACL;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,WAAW,MAAe,MAAwB;CAChE,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GAAG;GAClB,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO;GACL;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,WAAW,QAAmB,SAA4B;CAKxE,OAAO,IAJ4B,OAAO,KAAI,YAAW;EACvD,MAAM,gBAAgB,QAAQ,KAAI,QAAO,QAAQ,IAAI;EACrD,OAAO,QAAQ,WAAW,IAAI,cAAc,KAAK,MAAM,aAAa;CACtE,CACW,CAAiB;AAC9B;;AAGA,SAAgB,WAAW,MAA4B;CACrD,IAAI,CAAC,MAAM,QAAQ,IAAI,GACrB,OAAO,OAAO,IAAI;CAEpB,MAAM,MAAM,KAAK;CACjB,IAAI,KAAK,WAAW,GAClB,OAAO;CAGT,MAAM,UAAU,KAAK,OAAO;CAC5B,MAAM,QAAQ,UAAU,IAAI;CAE5B,IAAI,SAAS,UAAU,MAAM;CAC7B,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK;EAChC,IAAI,IAAI,OAAO,UAAU;EACzB,UAAU,WAAW,KAAK,EAAE;CAC9B;CACA,UAAU,UAAU,MAAM;CAC1B,OAAO;AACT;;AAGA,SAAgB,UAAU,OAA6B;CACrD,IAAI,SAAS,MACX,OAAO;CAGT,OAAO,aADK,WAAW,KACH,CAAG;AACzB;;AAGA,SAAgB,WAAW,MAAqC;CAC9D,OAAO,MAAM,QAAQ,IAAI,MAAM,KAAK,WAAW,KAAK,KAAK,OAAA;AAC3D;;AAGA,SAAgB,aAAa,MAAqC;CAChE,OAAO,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,KAAK,KAAK,OAAA;AACxD;;AAGA,SAAgB,eAAe,MAAmB;CAChD,IAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,WAAW,GAC1C;CAGF,IAAI,KAAK,OAAA,MAAiB;EACxB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,eAAe,KAAK,EAAE;EAExB;CACF;CAEA,KAAK,MAAM,QAAQ,MACjB,eAAe,IAAI;CAGrB,KAAK,MAAM,GAAG,MAAM,QAAQ,GAAG,CAAC,CAAC;CACjC,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QACd,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,EAAE,MAAM,GACpC,KAAK,OAAO,GAAG,CAAC;MAEhB;AAGN;;AAGA,SAAgB,cAAc,OAAc,MAAsB,QAA+B;CAC/F,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,SACV,OAAO,OAAO,UAAU;EAC1B,KAAK,OAAO;GACV,IAAI,OAAO,UAAU,UACnB,OAAO;GAET,OAAO,UAAA,KAAwB,UAAA;EAEjC,KAAK,OAAO,OAAO;GACjB,IAAI,OAAO,UAAU,UACnB,OAAO;GAET,MAAM,SAAS,OAAO,IAAI,KAAK,MAAM;GACrC,OAAO,CAAC,CAAC,UAAU,MAAM,QAAQ,MAAM,KAAK,OAAO,SAAS,KAAK;EACnE;EAEA,KAAK,OAAO;GACV,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,KAAK,QAAQ,SAAS,KAAK,MAAM,OAAA,MAC7E,OAAO;GAET,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KACvC,IAAI,CAAC,cAAc,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,MAAM,GACtD,OAAO;GAGX,OAAO;EAGT,KAAK,OAAO;GACV,IAAI,CAAC,WAAW,KAAK,GACnB,OAAO;GAET,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,cAAc,MAAM,KAAK,MAAM,MAAM,GACxC,OAAO;GAGX,OAAO;EAGT,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,UACV,OAAO;CACX;AACF;;AAGA,SAAgB,kBAAkB,MAAiB,MAAqC;CACtF,MAAM,SAAmB,CAAC;CAC1B,IAAI,KAAK,WAAW,GAClB,OAAO;CAGT,IAAI,UAAU;CACd,IAAI,QAAQ;CACZ,OAAO,QAAQ,KAAK,QAClB,QAAQ,QAAQ,QAAhB;EACE,KAAK,OAAO;GACV,OAAO,KAAK,CAAC;GACb,UAAU,QAAQ;GAClB;GACA;EAEF,KAAK,OAAO,OAAO;GACjB,MAAM,WAAW,KAAK;GACtB,IAAI,OAAO,aAAa,YAAY,WAAW,KAAK,WAAW,QAAQ,QAAQ,QAC7E,OAAO;GAET,OAAO,KAAK,QAAQ;GACpB,UAAU,QAAQ,QAAQ,WAAW;GACrC;GACA;EACF;EACA,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;CACX;CAEF,OAAO;AACT;;AAGA,SAAgB,aAAa,QAAe,MAA+B;CACzE,IAAI,UAAiB;CACrB,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QAAQ;EACtB,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,UAAU,KAAK,IACpD,OAAO;EAET,UAAU,QAAQ,KAAK;EACvB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,iBAAiB,MAA2B;CAC1D,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAA;EACF,KAAK,OAAO,YACV,OAAO,CAAC;EACV,KAAK,OAAO,OACV,OAAO,MAAM,KAAK,QAAQ,KAAI,SAAQ,iBAAiB,IAAI,CAAC,CAAC;CACjE;AACF;;AAGA,SAAgB,eAAe,QAAsB,MAAiB,QAAsB;CAC1F,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,MAAM,CAAC,MAAM,GAAG,QAAQ;CACxB,MAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC;CACnD,IAAI,QAAQ,eAAe,IAAI,OAAO,cAAc,IAAI,GAAG,MAAM;CACjE,OAAO;AACT;;AAGA,SAAgB,YAAY,OAAuB;CACjD,MAAM,QAAQ,CAAC,KAAK;CACpB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,IAAI;EAC1B,IAAI,YAAA,IACF,OAAO;EAET,IAAI,MAAM,QAAQ,OAAO,GACvB,KAAK,MAAM,WAAW,SACpB,MAAM,KAAK,OAAO;CAGxB;CACA,OAAO;AACT;;;;AClbA,MAAa,WAAW;;AAGxB,MAAa,kBAAkB;;AAG/B,MAAa,aAAa;;AAG1B,MAAa,cAAc;;AAG3B,MAAa,eAAe;;AAG5B,MAAa,gBAAgB;;AAY7B,SAAgB,cAAc,MAA2B;CACvD,OAAO;AACT;;AAGA,MAAa,YAAY,CAAC;;AAG1B,IAAa,uBAAb,cAA0C,MAAM;CAC9C;CACA;CAEA,YAAY,MAAc,OAAe;EACvC,MAAM,kCAAkC,KAAK,OAAO,OAAO;EAC3D,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,QAAQ;CACf;AACF;;AAGA,SAAgB,QAAQ,IAAW,IAAmB;CACpD,MAAM,SAAkB,CAAC,EAAE;CAC3B,MAAM,SAAkB,CAAC,EAAE;CAE3B,OAAO,OAAO,SAAS,KAAK,OAAO,SAAS,GAAG;EAC7C,MAAM,MAAM,OAAO,IAAI;EACvB,MAAM,MAAM,OAAO,IAAI;EACvB,IAAI,QAAQ,KACV;EAKF,IAAI,OAFiB,QAEP,YAAY,OADL,QACe,UAAU;GAC5C,MAAM,UAAW,MAAkB;GACnC,IAAI,YAAY,GAAG,OAAO;GAC1B;EACF;EAIA,IAAI,CAFa,MAAM,QAAQ,GAE1B,KAAY,CADA,MAAM,QAAQ,GACb,GAChB,MAAM,IAAI,qBAAqB,WAAW,GAAI,GAAG,WAAW,GAAI,CAAC;EAGnE,MAAM,OAAO;EACb,MAAM,OAAO;EACb,MAAM,OAAO,KAAK;EAClB,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,MACX,OAAO,OAAO;EAGhB,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK;GAClC,OAAO,KAAK,KAAK,EAAE;GACnB,OAAO,KAAK,KAAK,EAAE;EACrB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,MAAM,YAA4B;CAChD,OAAO,CAAC,UAAU,GAAG,UAAU;AACjC;;AAGA,SAAgB,IAAI,UAA4B;CAC9C,MAAM,SAAS,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,OAAO;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SACzB,IAAI,QAAQ,OAAO,IAAI,IAAI,OAAO,EAAE,MAAM,GACxC,OAAO,OAAO,GAAG,CAAC;MAElB;CAGJ,OAAO;AACT"}
+{"version":3,"file":"value-COprb2Je.js","names":[],"sources":["../src/rslang/eval/value-api.ts","../src/rslang/eval/value.ts"],"sourcesContent":["import { generateStub } from '../../shared';\nimport { type ExpressionType, TypeID, type TypePath, type Typification } from '../semantic/typification';\n\nimport {\n  BOOL_INFINITY,\n  compare,\n  EmptySetV,\n  INVALID_ELEMENT,\n  makeValuePath,\n  set,\n  SET_INFINITY,\n  tuple,\n  TUPLE_ID,\n  type Value,\n  VALUE_FALSE,\n  VALUE_TRUE,\n  type ValueContext,\n  type ValuePath\n} from './value';\n\n/** Cartesian product of factor sets. */\nexport function cartesianProduct(factors: Value[][]): Value[] | null {\n  const cardinality = factors.reduce((acc, f) => acc * f.length, 1);\n  if (cardinality > SET_INFINITY) {\n    return null;\n  }\n  if (cardinality === 0 || factors.length === 0) {\n    return EmptySetV;\n  }\n\n  let accumulator: Value[][] = [[]];\n  for (const factor of factors) {\n    const next: Value[][] = [];\n    for (const prefix of accumulator) {\n      for (const value of factor) {\n        next.push([...prefix, value]);\n      }\n    }\n    accumulator = next;\n  }\n  return accumulator.map(tuple);\n}\n\n/** Boolean power set ℬ(X). No cache - materialized. */\nexport function boolean(base: Value[]): Value[] | null {\n  if (base.length > BOOL_INFINITY) {\n    return null;\n  }\n  return powerset(base);\n}\n\n/** Powerset of array. */\nfunction powerset(arr: readonly Value[]): Value[][] {\n  const result: Value[][] = [[]];\n  if (arr.length === 0) {\n    return result;\n  }\n\n  let current: Value[][] = [[]];\n  let maxIndex: number[] = [-1];\n  while (current.length > 0) {\n    const next: Value[][] = [];\n    const nextMaxIndex: number[] = [];\n    for (let i = 0; i < current.length; i++) {\n      for (let j = maxIndex[i] + 1; j < arr.length; j++) {\n        const subset = [...current[i], arr[j]];\n        result.push(subset);\n        if (j < arr.length - 1) {\n          next.push(subset);\n          nextMaxIndex.push(j);\n        }\n      }\n    }\n    current = next;\n    maxIndex = nextMaxIndex;\n  }\n  return result;\n}\n\n/** Check if set contains element. */\nexport function contains(setData: Value[], element: Value): boolean {\n  let left = 0;\n  let right = setData.length - 1;\n  while (left <= right) {\n    const mid = Math.floor((left + right) / 2);\n    const cmp = compare(setData[mid], element);\n    if (cmp === 0) {\n      return true;\n    } else if (cmp < 0) {\n      left = mid + 1;\n    } else {\n      right = mid - 1;\n    }\n  }\n  return false;\n}\n\n/** Is A ⊆ B. */\nexport function isSubsetOrEq(a: Value[], b: Value[]): boolean {\n  let i = 0,\n    j = 0;\n  while (i < a.length && j < b.length) {\n    const cmp = compare(a[i], b[j]);\n    if (cmp === 0) {\n      i++;\n      j++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      return false;\n    }\n  }\n  return i === a.length;\n}\n\n/** Reduce: flatten double boolean to single boolean. */\nexport function reduce(target: Value[][]): Value[] {\n  const result: Value[] = [];\n  for (const element of target) {\n    result.push(...element);\n  }\n  return set(result);\n}\n\n/** Union A ∪ B. */\nexport function setUnion(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      result.push(set2[j]);\n      j++;\n    } else {\n      result.push(set1[i]);\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  while (j < set2.length) {\n    result.push(set2[j]);\n    j++;\n  }\n  return result;\n}\n\n/** Intersection A ∩ B. */\nexport function setIntersection(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  for (let i = 0, j = 0; i < set1.length && j < set2.length; ) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      i++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      result.push(set1[i]);\n      i++;\n      j++;\n    }\n  }\n  return result;\n}\n\n/** Difference A \\ B. */\nexport function setDiff(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  return result;\n}\n\n/** Symmetric difference A ∆ B. */\nexport function setSymDiff(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      result.push(set2[j]);\n      j++;\n    } else {\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  while (j < set2.length) {\n    result.push(set2[j]);\n    j++;\n  }\n  return result;\n}\n\n/** Projection of set by indices (BigPr). */\nexport function projection(target: Value[][], indices: number[]): Value[] {\n  const projectedElements: Value[] = target.map(element => {\n    const newComponents = indices.map(idx => element[idx]);\n    return indices.length === 1 ? newComponents[0] : tuple(newComponents);\n  });\n  return set(projectedElements);\n}\n\n/** Condensed string representation. */\nexport function printValue(data: Value | null): string {\n  if (!Array.isArray(data)) {\n    return String(data);\n  }\n  const len = data.length;\n  if (data.length === 0) {\n    return '{}';\n  }\n\n  const isTuple = data[0] === TUPLE_ID;\n  const start = isTuple ? 1 : 0;\n\n  let result = isTuple ? '(' : '{';\n  for (let i = start; i < len; i++) {\n    if (i > start) result += ', ';\n    result += printValue(data[i]);\n  }\n  result += isTuple ? ')' : '}';\n  return result;\n}\n\n/** Generates stub ID for value. */\nexport function valueStub(value: Value | null): string {\n  if (value == null) {\n    return '';\n  }\n  const str = printValue(value);\n  return generateStub(str);\n}\n\n/** Checks if value is a set representation, not a tuple representation. */\nexport function isSetValue(data: Value | null): data is Value[] {\n  return Array.isArray(data) && (data.length === 0 || data[0] !== TUPLE_ID);\n}\n\n/** Checks if value is a tuple representation. */\nexport function isTupleValue(data: Value | null): data is Value[] {\n  return Array.isArray(data) && data.length > 1 && data[0] === TUPLE_ID;\n}\n\n/** Normalize unsorted array of values. */\nexport function normalizeValue(data: Value): void {\n  if (!Array.isArray(data) || data.length === 0) {\n    return;\n  }\n\n  if (data[0] === TUPLE_ID) {\n    for (let i = 1; i < data.length; i++) {\n      normalizeValue(data[i]);\n    }\n    return;\n  }\n\n  for (const item of data) {\n    normalizeValue(item);\n  }\n\n  data.sort((a, b) => compare(a, b));\n  let i = 1;\n  while (i < data.length) {\n    if (compare(data[i - 1], data[i]) === 0) {\n      data.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n}\n\n/** Validates value for {@link ExpressionType} and value of basic sets. */\nexport function validateValue(value: Value, type: ExpressionType, basics: ValueContext): boolean {\n  switch (type.typeID) {\n    case TypeID.integer:\n      return typeof value === 'number';\n    case TypeID.logic: {\n      if (typeof value !== 'number') {\n        return false;\n      }\n      return value === VALUE_TRUE || value === VALUE_FALSE;\n    }\n    case TypeID.basic: {\n      if (typeof value !== 'number') {\n        return false;\n      }\n      const domain = basics.get(type.baseID);\n      return !!domain && Array.isArray(domain) && domain.includes(value);\n    }\n\n    case TypeID.tuple: {\n      if (!Array.isArray(value) || value.length !== type.factors.length + 1 || value[0] !== TUPLE_ID) {\n        return false;\n      }\n      for (let i = 0; i < type.factors.length; i++) {\n        if (!validateValue(value[i + 1], type.factors[i], basics)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    case TypeID.collection: {\n      if (!isSetValue(value)) {\n        return false;\n      }\n      for (const item of value) {\n        if (!validateValue(item, type.base, basics)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    case TypeID.anyTypification:\n    case TypeID.predicate:\n    case TypeID.function:\n      return false;\n  }\n}\n\n/** Converts value path to type path. */\nexport function convertPathToType(path: ValuePath, type: Typification): TypePath | null {\n  const result: number[] = [];\n  if (path.length === 0) {\n    return result as TypePath;\n  }\n\n  let curType = type;\n  let index = 0;\n  while (index < path.length) {\n    switch (curType.typeID) {\n      case TypeID.collection: {\n        result.push(0);\n        curType = curType.base;\n        index++;\n        break;\n      }\n      case TypeID.tuple: {\n        const tupleIdx = path[index];\n        if (typeof tupleIdx !== 'number' || tupleIdx < 1 || tupleIdx > curType.factors.length) {\n          return null;\n        }\n        result.push(tupleIdx);\n        curType = curType.factors[tupleIdx - 1];\n        index++;\n        break;\n      }\n      case TypeID.basic:\n      case TypeID.integer:\n      case TypeID.anyTypification:\n        return null;\n    }\n  }\n  return result as TypePath;\n}\n\n/** Extracts value from a target by path. */\nexport function extractValue(target: Value, path: ValuePath): Value | null {\n  let current: Value = target;\n  let i = 0;\n  while (i < path.length) {\n    if (!Array.isArray(current) || current.length <= path[i]) {\n      return null;\n    }\n    current = current[path[i]];\n    i++;\n  }\n  return current;\n}\n\n/** Makes default value for a type. */\nexport function makeDefaultValue(type: Typification): Value {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n    case TypeID.integer:\n    case TypeID.basic:\n      return INVALID_ELEMENT;\n    case TypeID.collection:\n      return [];\n    case TypeID.tuple:\n      return tuple(type.factors.map(item => makeDefaultValue(item)));\n  }\n}\n\n/** Perform immutable deep copy update. */\nexport function setNestedValue(target: Value | null, path: ValuePath, newVal: Value): Value {\n  if (path.length === 0) {\n    return newVal;\n  }\n  const [head, ...rest] = path;\n  const arr = Array.isArray(target) ? [...target] : [];\n  arr[head] = setNestedValue(arr[head], makeValuePath(rest), newVal);\n  return arr;\n}\n\n/** Test if value contains invalid elements. */\nexport function testInvalid(value: Value): boolean {\n  const stack = [value];\n  while (stack.length > 0) {\n    const current = stack.pop();\n    if (current === INVALID_ELEMENT) {\n      return true;\n    }\n    if (Array.isArray(current)) {\n      for (const element of current) {\n        stack.push(element);\n      }\n    }\n  }\n  return false;\n}\n","/**\n * Module: Structured data for RSLang expression evaluation.\n */\n\nimport { type Branded } from '../../shared';\n\nimport { printValue } from './value-api';\n\n/** Tuple ID for array distinction. */\nexport const TUPLE_ID = -111;\n\n/** Invalid value for structured data. */\nexport const INVALID_ELEMENT = -1;\n\n/** Boolean values: true. */\nexport const VALUE_TRUE = 1;\n\n/** Boolean values: false. */\nexport const VALUE_FALSE = 0;\n\n/** Cardinality threshold for \"infinite\" sets (e.g. Z). */\nexport const SET_INFINITY = 10_000_000;\n\n/** Cardinality threshold for Boolean power set. */\nexport const BOOL_INFINITY = 18;\n\n/** Expression evaluation result: structured data. */\nexport type Value = number | Value[];\n\n/** Values context. */\nexport type ValueContext = Map<string, Value>;\n\n/** Value extraction path. */\nexport type ValuePath = Branded<number[], 'ValuePath'>;\n\n/** Creates value path. */\nexport function makeValuePath(path: number[]): ValuePath {\n  return path as ValuePath;\n}\n\n/** Empty set ∅. */\nexport const EmptySetV = [];\n\n/** Thrown when a runtime value operation cannot be applied to the given operands. */\nexport class CalcInvalidDataError extends Error {\n  readonly left: string;\n  readonly right: string;\n\n  constructor(left: string, right: string) {\n    super(`Cannot compare different types ${left} and ${right}`);\n    this.name = 'CalcInvalidDataError';\n    this.left = left;\n    this.right = right;\n  }\n}\n\n/** Compare two structured data without recursive calls. */\nexport function compare(v1: Value, v2: Value): number {\n  const stack1: Value[] = [v1];\n  const stack2: Value[] = [v2];\n\n  while (stack1.length > 0 && stack2.length > 0) {\n    const el1 = stack1.pop();\n    const el2 = stack2.pop();\n    if (el1 === el2) {\n      continue;\n    }\n\n    const type1 = typeof el1;\n    const type2 = typeof el2;\n    if (type1 === 'number' && type2 === 'number') {\n      const numDiff = (el1 as number) - (el2 as number);\n      if (numDiff !== 0) return numDiff;\n      continue;\n    }\n\n    const isArray1 = Array.isArray(el1);\n    const isArray2 = Array.isArray(el2);\n    if (!isArray1 || !isArray2) {\n      throw new CalcInvalidDataError(printValue(el1!), printValue(el2!));\n    }\n\n    const arr1 = el1;\n    const arr2 = el2;\n    const len1 = arr1.length;\n    const len2 = arr2.length;\n    if (len1 !== len2) {\n      return len1 - len2;\n    }\n\n    for (let i = len1 - 1; i >= 0; i--) {\n      stack1.push(arr1[i]);\n      stack2.push(arr2[i]);\n    }\n  }\n  return 0;\n}\n\n/** Tuple from components. */\nexport function tuple(components: Value[]): Value {\n  return [TUPLE_ID, ...components];\n}\n\n/** Set from elements (unique). Value[] - materialized. */\nexport function set(elements: Value[]): Value[] {\n  const sorted = [...elements].sort(compare);\n  for (let i = 1; i < sorted.length; ) {\n    if (compare(sorted[i - 1], sorted[i]) === 0) {\n      sorted.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n  return sorted;\n}\n"],"mappings":";;;;;AAqBA,SAAgB,iBAAiB,SAAoC;CACnE,MAAM,cAAc,QAAQ,QAAQ,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;CAChE,IAAI,cAAA,KACF,OAAO;CAET,IAAI,gBAAgB,KAAK,QAAQ,WAAW,GAC1C,OAAO;CAGT,IAAI,cAAyB,CAAC,CAAC,CAAC;CAChC,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,OAAkB,CAAC;EACzB,KAAK,MAAM,UAAU,aACnB,KAAK,MAAM,SAAS,QAClB,KAAK,KAAK,CAAC,GAAG,QAAQ,KAAK,CAAC;EAGhC,cAAc;CAChB;CACA,OAAO,YAAY,IAAI,KAAK;AAC9B;;AAGA,SAAgB,QAAQ,MAA+B;CACrD,IAAI,KAAK,SAAA,IACP,OAAO;CAET,OAAO,SAAS,IAAI;AACtB;;AAGA,SAAS,SAAS,KAAkC;CAClD,MAAM,SAAoB,CAAC,CAAC,CAAC;CAC7B,IAAI,IAAI,WAAW,GACjB,OAAO;CAGT,IAAI,UAAqB,CAAC,CAAC,CAAC;CAC5B,IAAI,WAAqB,CAAC,EAAE;CAC5B,OAAO,QAAQ,SAAS,GAAG;EACzB,MAAM,OAAkB,CAAC;EACzB,MAAM,eAAyB,CAAC;EAChC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,KAAK,IAAI,IAAI,SAAS,KAAK,GAAG,IAAI,IAAI,QAAQ,KAAK;GACjD,MAAM,SAAS,CAAC,GAAG,QAAQ,IAAI,IAAI,EAAE;GACrC,OAAO,KAAK,MAAM;GAClB,IAAI,IAAI,IAAI,SAAS,GAAG;IACtB,KAAK,KAAK,MAAM;IAChB,aAAa,KAAK,CAAC;GACrB;EACF;EAEF,UAAU;EACV,WAAW;CACb;CACA,OAAO;AACT;;AAGA,SAAgB,SAAS,SAAkB,SAAyB;CAClE,IAAI,OAAO;CACX,IAAI,QAAQ,QAAQ,SAAS;CAC7B,OAAO,QAAQ,OAAO;EACpB,MAAM,MAAM,KAAK,OAAO,OAAO,SAAS,CAAC;EACzC,MAAM,MAAM,QAAQ,QAAQ,MAAM,OAAO;EACzC,IAAI,QAAQ,GACV,OAAO;OACF,IAAI,MAAM,GACf,OAAO,MAAM;OAEb,QAAQ,MAAM;CAElB;CACA,OAAO;AACT;;AAGA,SAAgB,aAAa,GAAY,GAAqB;CAC5D,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,EAAE,UAAU,IAAI,EAAE,QAAQ;EACnC,MAAM,MAAM,QAAQ,EAAE,IAAI,EAAE,EAAE;EAC9B,IAAI,QAAQ,GAAG;GACb;GACA;EACF,OAAO,IAAI,MAAM,GACf;OAEA,OAAO;CAEX;CACA,OAAO,MAAM,EAAE;AACjB;;AAGA,SAAgB,OAAO,QAA4B;CACjD,MAAM,SAAkB,CAAC;CACzB,KAAK,MAAM,WAAW,QACpB,OAAO,KAAK,GAAG,OAAO;CAExB,OAAO,IAAI,MAAM;AACnB;;AAGA,SAAgB,SAAS,MAAe,MAAwB;CAC9D,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GAAG;GAClB,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO;GACL,OAAO,KAAK,KAAK,EAAE;GACnB;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,gBAAgB,MAAe,MAAwB;CACrE,MAAM,SAAkB,CAAC;CACzB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,SAAU;EAC3D,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GACR;OACK,IAAI,MAAM,GACf;OACK;GACL,OAAO,KAAK,KAAK,EAAE;GACnB;GACA;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,MAAe,MAAwB;CAC7D,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GACf;OACK;GACL;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,WAAW,MAAe,MAAwB;CAChE,MAAM,SAAkB,CAAC;CACzB,IAAI,IAAI,GACN,IAAI;CACN,OAAO,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ;EACzC,MAAM,MAAM,QAAQ,KAAK,IAAI,KAAK,EAAE;EACpC,IAAI,MAAM,GAAG;GACX,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO,IAAI,MAAM,GAAG;GAClB,OAAO,KAAK,KAAK,EAAE;GACnB;EACF,OAAO;GACL;GACA;EACF;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO,IAAI,KAAK,QAAQ;EACtB,OAAO,KAAK,KAAK,EAAE;EACnB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,WAAW,QAAmB,SAA4B;CAKxE,OAAO,IAJ4B,OAAO,KAAI,YAAW;EACvD,MAAM,gBAAgB,QAAQ,KAAI,QAAO,QAAQ,IAAI;EACrD,OAAO,QAAQ,WAAW,IAAI,cAAc,KAAK,MAAM,aAAa;CACtE,CACW,CAAiB;AAC9B;;AAGA,SAAgB,WAAW,MAA4B;CACrD,IAAI,CAAC,MAAM,QAAQ,IAAI,GACrB,OAAO,OAAO,IAAI;CAEpB,MAAM,MAAM,KAAK;CACjB,IAAI,KAAK,WAAW,GAClB,OAAO;CAGT,MAAM,UAAU,KAAK,OAAO;CAC5B,MAAM,QAAQ,UAAU,IAAI;CAE5B,IAAI,SAAS,UAAU,MAAM;CAC7B,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK;EAChC,IAAI,IAAI,OAAO,UAAU;EACzB,UAAU,WAAW,KAAK,EAAE;CAC9B;CACA,UAAU,UAAU,MAAM;CAC1B,OAAO;AACT;;AAGA,SAAgB,UAAU,OAA6B;CACrD,IAAI,SAAS,MACX,OAAO;CAGT,OAAO,aADK,WAAW,KACH,CAAG;AACzB;;AAGA,SAAgB,WAAW,MAAqC;CAC9D,OAAO,MAAM,QAAQ,IAAI,MAAM,KAAK,WAAW,KAAK,KAAK,OAAA;AAC3D;;AAGA,SAAgB,aAAa,MAAqC;CAChE,OAAO,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,KAAK,KAAK,OAAA;AACxD;;AAGA,SAAgB,eAAe,MAAmB;CAChD,IAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,WAAW,GAC1C;CAGF,IAAI,KAAK,OAAA,MAAiB;EACxB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,eAAe,KAAK,EAAE;EAExB;CACF;CAEA,KAAK,MAAM,QAAQ,MACjB,eAAe,IAAI;CAGrB,KAAK,MAAM,GAAG,MAAM,QAAQ,GAAG,CAAC,CAAC;CACjC,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QACd,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,EAAE,MAAM,GACpC,KAAK,OAAO,GAAG,CAAC;MAEhB;AAGN;;AAGA,SAAgB,cAAc,OAAc,MAAsB,QAA+B;CAC/F,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,SACV,OAAO,OAAO,UAAU;EAC1B,KAAK,OAAO;GACV,IAAI,OAAO,UAAU,UACnB,OAAO;GAET,OAAO,UAAA,KAAwB,UAAA;EAEjC,KAAK,OAAO,OAAO;GACjB,IAAI,OAAO,UAAU,UACnB,OAAO;GAET,MAAM,SAAS,OAAO,IAAI,KAAK,MAAM;GACrC,OAAO,CAAC,CAAC,UAAU,MAAM,QAAQ,MAAM,KAAK,OAAO,SAAS,KAAK;EACnE;EAEA,KAAK,OAAO;GACV,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,KAAK,QAAQ,SAAS,KAAK,MAAM,OAAA,MAC7E,OAAO;GAET,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KACvC,IAAI,CAAC,cAAc,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,MAAM,GACtD,OAAO;GAGX,OAAO;EAGT,KAAK,OAAO;GACV,IAAI,CAAC,WAAW,KAAK,GACnB,OAAO;GAET,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,cAAc,MAAM,KAAK,MAAM,MAAM,GACxC,OAAO;GAGX,OAAO;EAGT,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,UACV,OAAO;CACX;AACF;;AAGA,SAAgB,kBAAkB,MAAiB,MAAqC;CACtF,MAAM,SAAmB,CAAC;CAC1B,IAAI,KAAK,WAAW,GAClB,OAAO;CAGT,IAAI,UAAU;CACd,IAAI,QAAQ;CACZ,OAAO,QAAQ,KAAK,QAClB,QAAQ,QAAQ,QAAhB;EACE,KAAK,OAAO;GACV,OAAO,KAAK,CAAC;GACb,UAAU,QAAQ;GAClB;GACA;EAEF,KAAK,OAAO,OAAO;GACjB,MAAM,WAAW,KAAK;GACtB,IAAI,OAAO,aAAa,YAAY,WAAW,KAAK,WAAW,QAAQ,QAAQ,QAC7E,OAAO;GAET,OAAO,KAAK,QAAQ;GACpB,UAAU,QAAQ,QAAQ,WAAW;GACrC;GACA;EACF;EACA,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;CACX;CAEF,OAAO;AACT;;AAGA,SAAgB,aAAa,QAAe,MAA+B;CACzE,IAAI,UAAiB;CACrB,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,QAAQ;EACtB,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,UAAU,KAAK,IACpD,OAAO;EAET,UAAU,QAAQ,KAAK;EACvB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,iBAAiB,MAA2B;CAC1D,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAA;EACF,KAAK,OAAO,YACV,OAAO,CAAC;EACV,KAAK,OAAO,OACV,OAAO,MAAM,KAAK,QAAQ,KAAI,SAAQ,iBAAiB,IAAI,CAAC,CAAC;CACjE;AACF;;AAGA,SAAgB,eAAe,QAAsB,MAAiB,QAAsB;CAC1F,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,MAAM,CAAC,MAAM,GAAG,QAAQ;CACxB,MAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC;CACnD,IAAI,QAAQ,eAAe,IAAI,OAAO,cAAc,IAAI,GAAG,MAAM;CACjE,OAAO;AACT;;AAGA,SAAgB,YAAY,OAAuB;CACjD,MAAM,QAAQ,CAAC,KAAK;CACpB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,IAAI;EAC1B,IAAI,YAAA,IACF,OAAO;EAET,IAAI,MAAM,QAAQ,OAAO,GACvB,KAAK,MAAM,WAAW,SACpB,MAAM,KAAK,OAAO;CAGxB;CACA,OAAO;AACT;;;;AClbA,MAAa,WAAW;;AAGxB,MAAa,kBAAkB;;AAG/B,MAAa,aAAa;;AAG1B,MAAa,cAAc;;AAG3B,MAAa,eAAe;;AAG5B,MAAa,gBAAgB;;AAY7B,SAAgB,cAAc,MAA2B;CACvD,OAAO;AACT;;AAGA,MAAa,YAAY,CAAC;;AAG1B,IAAa,uBAAb,cAA0C,MAAM;CAC9C;CACA;CAEA,YAAY,MAAc,OAAe;EACvC,MAAM,kCAAkC,KAAK,OAAO,OAAO;EAC3D,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,QAAQ;CACf;AACF;;AAGA,SAAgB,QAAQ,IAAW,IAAmB;CACpD,MAAM,SAAkB,CAAC,EAAE;CAC3B,MAAM,SAAkB,CAAC,EAAE;CAE3B,OAAO,OAAO,SAAS,KAAK,OAAO,SAAS,GAAG;EAC7C,MAAM,MAAM,OAAO,IAAI;EACvB,MAAM,MAAM,OAAO,IAAI;EACvB,IAAI,QAAQ,KACV;EAKF,IAAI,OAFiB,QAEP,YAAY,OADL,QACe,UAAU;GAC5C,MAAM,UAAW,MAAkB;GACnC,IAAI,YAAY,GAAG,OAAO;GAC1B;EACF;EAIA,IAAI,CAFa,MAAM,QAAQ,GAE1B,KAAY,CADA,MAAM,QAAQ,GACb,GAChB,MAAM,IAAI,qBAAqB,WAAW,GAAI,GAAG,WAAW,GAAI,CAAC;EAGnE,MAAM,OAAO;EACb,MAAM,OAAO;EACb,MAAM,OAAO,KAAK;EAClB,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,MACX,OAAO,OAAO;EAGhB,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK;GAClC,OAAO,KAAK,KAAK,EAAE;GACnB,OAAO,KAAK,KAAK,EAAE;EACrB;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,MAAM,YAA4B;CAChD,OAAO,CAAC,UAAU,GAAG,UAAU;AACjC;;AAGA,SAAgB,IAAI,UAA4B;CAC9C,MAAM,SAAS,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAK,OAAO;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SACzB,IAAI,QAAQ,OAAO,IAAI,IAAI,OAAO,EAAE,MAAM,GACxC,OAAO,OAAO,GAAG,CAAC;MAElB;CAGJ,OAAO;AACT"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rsconcept/domain",
-  "version": "1.4.1",
+  "version": "1.4.3",
   "description": "Shared TypeScript domain for RS language, RSForm, RSModel, RSEngine, OSS, and concept-text helpers.",
   "license": "MIT",
   "author": "IRBorisov",

package/src/rslang/error.ts

@@ -71,6 +71,7 @@ export const RSErrorCode = {
   expectedLogic: 0x8827, // 34855
   expectedSetexpr: 0x8828, // 34856
   invalidArgumentCortegeDeclare: 0x8829, // 34857
+  invalidQuantifierDomain: 0x882a, // 34858
 
   globalNoValue: 0x8840, // 34880
   invalidPropertyUsage: 0x8841, // 34881

package/src/rslang/eval/evaluator.test.ts

@@ -230,8 +230,8 @@ const errorData = [
   ['I{(a,b) | a:∈X1; b:=a; b≠D1}', { code: RSErrorCode.calcGlobalMissing, from: 25, to: 27, params: ['D1'] }],
   ['I{(a,b) | a:∈X1; b:=D1; b≠a}', { code: RSErrorCode.calcGlobalMissing, from: 20, to: 22, params: ['D1'] }],
   ['∀a∈X1 b=b', { code: RSErrorCode.localUndeclared, from: 6, to: 7, params: ['b'] }],
-  ['X1=1', { code: RSErrorCode.calcInvalidData, from: 0, to: 4, params: ['{1, 2, 3}', '1'] }],
-  ['X1=1 & 1=1', { code: RSErrorCode.calcInvalidData, from: 0, to: 4, params: ['{1, 2, 3}', '1'] }]
+  ['X1=1', { code: RSErrorCode.calcInvalidData, from: 0, to: 4, params: ['{1, 2, 3}', '1', '='] }],
+  ['X1=1 & 1=1', { code: RSErrorCode.calcInvalidData, from: 0, to: 4, params: ['{1, 2, 3}', '1', '='] }]
 ];
 
 describe('Calculator', () => {