@rsconcept/domain 1.4.2 → 1.4.3

package/dist/{analyzer-BliNe3pV.d.ts → analyzer-CvnbnrSX.d.ts}

@@ -1,6 +1,6 @@
 import { t as AstNode } from "./ast-C8sIpKdL.js";
 import { f as ExpressionType, g as TypeClass } from "./typification-Dk-fisgO.js";
-import { i as RSErrorDescription } from "./error-deey7EiC.js";
+import { i as RSErrorDescription } from "./error-DuqsZDL5.js";
 import { t as ValueClass } from "./value-class-CNI-lqXJ.js";
 
 //#region src/rslang/semantic/analyzer.d.ts
@@ -36,4 +36,4 @@ declare class RSLangAnalyzer {
 }
 //#endregion
 export { RSLangAnalyzer as a, AnalysisOptions as i, AnalysisFast as n, AnalysisFull as r, AnalysisBase as t };
-//# sourceMappingURL=analyzer-BliNe3pV.d.ts.map
+//# sourceMappingURL=analyzer-CvnbnrSX.d.ts.map

package/dist/{ast-annotations-GOkbNN8F.d.ts → ast-annotations-B4T8S2DS.d.ts}

@@ -1,6 +1,6 @@
 import { t as AstNode } from "./ast-C8sIpKdL.js";
 import { f as ExpressionType } from "./typification-Dk-fisgO.js";
-import { a as RSErrorInfo, r as RSErrorCode } from "./error-deey7EiC.js";
+import { a as RSErrorInfo, r as RSErrorCode } from "./error-DuqsZDL5.js";
 
 //#region src/rslang/ast-annotations.d.ts
 /** Appends {@link ExpressionType} onto the node's `annotation.rsType`. */
@@ -13,4 +13,4 @@ declare function annotateError(node: AstNode, code: RSErrorCode, params?: readon
 declare function readErrorAnnotation(node: AstNode): RSErrorInfo | null;
 //#endregion
 export { readTypeAnnotation as i, annotateType as n, readErrorAnnotation as r, annotateError as t };
-//# sourceMappingURL=ast-annotations-GOkbNN8F.d.ts.map
+//# sourceMappingURL=ast-annotations-B4T8S2DS.d.ts.map

package/dist/{calculator-DFevxZyV.d.ts → calculator-8tErfQcI.d.ts}

@@ -1,6 +1,6 @@
 import { t as AstNode } from "./ast-C8sIpKdL.js";
 import { f as ExpressionType } from "./typification-Dk-fisgO.js";
-import { i as RSErrorDescription } from "./error-deey7EiC.js";
+import { i as RSErrorDescription } from "./error-DuqsZDL5.js";
 import { l as Value } from "./value-BduA_ZGp.js";
 
 //#region src/rslang/eval/calculator.d.ts
@@ -36,4 +36,4 @@ declare class RSCalculator {
 }
 //#endregion
 export { CalculatorResult as n, RSCalculator as r, CalculatorEvaluateOptions as t };
-//# sourceMappingURL=calculator-DFevxZyV.d.ts.map
+//# sourceMappingURL=calculator-8tErfQcI.d.ts.map

package/dist/{error-deey7EiC.d.ts → error-DuqsZDL5.d.ts}

@@ -64,6 +64,7 @@ declare const RSErrorCode: {
   readonly expectedLogic: 34855;
   readonly expectedSetexpr: 34856;
   readonly invalidArgumentCortegeDeclare: 34857;
+  readonly invalidQuantifierDomain: 34858;
   readonly globalNoValue: 34880;
   readonly invalidPropertyUsage: 34881;
   readonly calcUnknownError: 33024;
@@ -85,4 +86,4 @@ declare function getRSErrorPrefix(code: RSErrorCode): string;
 declare function isCritical(code: RSErrorCode): boolean;
 //#endregion
 export { RSErrorInfo as a, RSErrorDescription as i, RSErrorClass as n, getRSErrorPrefix as o, RSErrorCode as r, isCritical as s, ErrorReporter as t };
-//# sourceMappingURL=error-deey7EiC.d.ts.map
+//# sourceMappingURL=error-DuqsZDL5.d.ts.map

package/dist/index.d.ts

@@ -9,15 +9,15 @@ import { a as TOKEN_ERROR, c as flattenAst, d as printAst, f as visitAstDFS, i a
 import { t as Branded } from "./branded-ZlzIcxzu.js";
 import { n as generateStub, t as applyHash_fnv1a } from "./hash-Y8I4c6Al.js";
 import { O as makeTypePath, b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "./typification-Dk-fisgO.js";
-import { i as RSErrorDescription, r as RSErrorCode } from "./error-deey7EiC.js";
-import { i as readTypeAnnotation, r as readErrorAnnotation } from "./ast-annotations-GOkbNN8F.js";
+import { i as RSErrorDescription, r as RSErrorCode } from "./error-DuqsZDL5.js";
+import { i as readTypeAnnotation, r as readErrorAnnotation } from "./ast-annotations-B4T8S2DS.js";
 import { d as ValuePath, l as Value, o as TUPLE_ID, p as makeValuePath } from "./value-BduA_ZGp.js";
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "./calculator-DFevxZyV.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "./calculator-8tErfQcI.js";
 import { d as printValue } from "./value-api-B6T6f4Ia.js";
 import { t as parser } from "./parser-Bwd8LxJ1.js";
 import { t as TokenID } from "./token-DeXAmzwr.js";
 import { t as ValueClass } from "./value-class-CNI-lqXJ.js";
-import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "./analyzer-BliNe3pV.js";
+import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "./analyzer-CvnbnrSX.js";
 import { n as ArgumentsType } from "./arguments-extractor-1acwjQNc.js";
 import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "./typification-parser-BBVx1RxP.js";
 import { n as TypificationNodeData, t as TypificationGraph } from "./typification-graph-6HcZ-rKH.js";

package/dist/index.js

@@ -8,9 +8,9 @@ import { RSErrorCode } from "./rslang/error.js";
 import { TOKEN_ERROR, buildTree, findByUid, flattenAst, getNodeIndices, getNodeText, printAst, visitAstDFS } from "./parsing/ast.js";
 import { printTree } from "./parsing/lezer-tree.js";
 import { TokenID } from "./rslang/parser/token.js";
-import { applyHash_fnv1a, generateStub } from "./shared/hash.js";
 import { AnyTypificationT, EmptySetT, LogicT, TypeClass, TypeID, makeTypePath } from "./rslang/semantic/typification.js";
-import { C as printValue, o as TUPLE_ID, u as makeValuePath } from "./value-ybFBRuz6.js";
+import { applyHash_fnv1a, generateStub } from "./shared/hash.js";
+import { C as printValue, o as TUPLE_ID, u as makeValuePath } from "./value-COprb2Je.js";
 import { RSCalculator } from "./rslang/eval/calculator.js";
 import { parser } from "./rslang/parser/parser.js";
 import { ValueClass } from "./rslang/semantic/value-class.js";

package/dist/library/rsengine.d.ts

@@ -1,6 +1,6 @@
 import { t as AstNode } from "../ast-C8sIpKdL.js";
 import { l as Value } from "../value-BduA_ZGp.js";
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-DFevxZyV.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-8tErfQcI.js";
 import { CstType, RSForm } from "./rsform.js";
 import { BasicBinding, BasicsContext, EvalStatus, RSModel } from "./rsmodel.js";
 

package/dist/library/rsengine.js

@@ -1,7 +1,7 @@
 import { TypeID } from "../rslang/semantic/typification.js";
-import { l as compare } from "../value-ybFBRuz6.js";
-import { RSCalculator } from "../rslang/eval/calculator.js";
 import { normalizeType } from "../rslang/labels.js";
+import { l as compare } from "../value-COprb2Je.js";
+import { RSCalculator } from "../rslang/eval/calculator.js";
 import "../rslang/index.js";
 import { CstType } from "./rsform.js";
 import { getAnalysisFor, isBaseSet, isBasicConcept, isFunctional } from "./rsform-api.js";

package/dist/library/rsform-api.d.ts

@@ -1,7 +1,7 @@
 import { r as LibraryItem } from "../library-CYun28Xz.js";
 import { g as TypeClass, y as TypePath } from "../typification-Dk-fisgO.js";
 import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
-import { r as AnalysisFull } from "../analyzer-BliNe3pV.js";
+import { r as AnalysisFull } from "../analyzer-CvnbnrSX.js";
 import { ArgumentValue, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats } from "./rsform.js";
 
 //#region src/library/rsform-api.d.ts

package/dist/library/rsform.d.ts

@@ -1,7 +1,7 @@
 import { t as Graph } from "../graph-DR8rL2o3.js";
 import { i as LibraryItemReference, n as CurrentVersion, r as LibraryItem, s as VersionInfo } from "../library-CYun28Xz.js";
 import { f as ExpressionType, y as TypePath } from "../typification-Dk-fisgO.js";
-import { a as RSLangAnalyzer, t as AnalysisBase } from "../analyzer-BliNe3pV.js";
+import { a as RSLangAnalyzer, t as AnalysisBase } from "../analyzer-CvnbnrSX.js";
 //#region src/library/rsform.d.ts
 /** Represents {@link Constituenta} type. */
 declare const CstType: {

package/dist/library/rsmodel-api.js

@@ -1,5 +1,5 @@
 import { TypeID } from "../rslang/semantic/typification.js";
-import { O as setNestedValue, _ as extractValue, b as isTupleValue, f as tuple, l as compare, x as makeDefaultValue } from "../value-ybFBRuz6.js";
+import { O as setNestedValue, _ as extractValue, b as isTupleValue, f as tuple, l as compare, x as makeDefaultValue } from "../value-COprb2Je.js";
 import "../rslang/index.js";
 import { CstType } from "./rsform.js";
 import { calculateSchemaStats, isBaseSet, isBasicConcept } from "./rsform-api.js";

package/dist/rslang/ast-annotations.d.ts

@@ -1,2 +1,2 @@
-import { i as readTypeAnnotation, n as annotateType, r as readErrorAnnotation, t as annotateError } from "../ast-annotations-GOkbNN8F.js";
+import { i as readTypeAnnotation, n as annotateType, r as readErrorAnnotation, t as annotateError } from "../ast-annotations-B4T8S2DS.js";
 export { annotateError, annotateType, readErrorAnnotation, readTypeAnnotation };

package/dist/rslang/error.d.ts

@@ -1,2 +1,2 @@
-import { a as RSErrorInfo, i as RSErrorDescription, n as RSErrorClass, o as getRSErrorPrefix, r as RSErrorCode, s as isCritical, t as ErrorReporter } from "../error-deey7EiC.js";
+import { a as RSErrorInfo, i as RSErrorDescription, n as RSErrorClass, o as getRSErrorPrefix, r as RSErrorCode, s as isCritical, t as ErrorReporter } from "../error-DuqsZDL5.js";
 export { ErrorReporter, RSErrorClass, RSErrorCode, RSErrorDescription, RSErrorInfo, getRSErrorPrefix, isCritical };

package/dist/rslang/error.js

@@ -51,6 +51,7 @@ const RSErrorCode = {
 	expectedLogic: 34855,
 	expectedSetexpr: 34856,
 	invalidArgumentCortegeDeclare: 34857,
+	invalidQuantifierDomain: 34858,
 	globalNoValue: 34880,
 	invalidPropertyUsage: 34881,
 	calcUnknownError: 33024,

package/dist/rslang/error.js.map

@@ -1 +1 @@
-{"version":3,"file":"error.js","names":[],"sources":["../../src/rslang/error.ts"],"sourcesContent":["/** Module: Error types and functions. */\n\n/** Represents error class. */\nexport const RSErrorClass = {\n  LEXER: 0,\n  PARSER: 1,\n  SEMANTIC: 2,\n  EVALUATION: 3,\n  UNKNOWN: 4\n} as const;\nexport type RSErrorClass = (typeof RSErrorClass)[keyof typeof RSErrorClass];\n\n/** Represents RSLang expression error information. */\nexport interface RSErrorInfo {\n  code: RSErrorCode;\n  params?: readonly string[];\n}\n\n/** Represents RSLang expression error description. */\nexport interface RSErrorDescription extends RSErrorInfo {\n  from: number;\n  to: number;\n}\n\n/** Error reporter function type. */\nexport type ErrorReporter = (error: RSErrorDescription) => void;\n\n/** Represents RSLang expression error types. */\nexport const RSErrorCode = {\n  unknownSyntax: 0x8400, // 33792\n  missingParenthesis: 0x8406, // 33798\n  missingCurlyBrace: 0x8407, // 33799\n  missingSquareBracket: 0x8408, // 33800\n  bracketMismatch: 0x8409, // 33801\n  doubleParenthesis: 0x840a, // 33802\n  missingOpenBracket: 0x840b, // 33803\n  expectedLocal: 0x8415, // 33813\n  expectedType: 0x8416, // 33814\n\n  localDoubleDeclare: 0x2801, // 10241\n  localNotUsed: 0x2802, // 10242\n\n  localUndeclared: 0x8801, // 34817\n  localShadowing: 0x8802, // 34818\n\n  typesNotEqual: 0x8803, // 34819\n  globalNotTyped: 0x8804, // 34820\n  invalidDecart: 0x8805, // 34821\n  invalidBoolean: 0x8806, // 34822\n  invalidTypeOperation: 0x8807, // 34823\n  invalidCard: 0x8808, // 34824\n  invalidDebool: 0x8809, // 34825\n  globalFuncWithoutArgs: 0x880b, // 34827\n  invalidReduce: 0x8810, // 34832\n  invalidProjectionTuple: 0x8811, // 34833\n  invalidProjectionSet: 0x8812, // 34834\n  invalidEnumeration: 0x8813, // 34835\n  invalidCortegeDeclare: 0x8814, // 34836\n  localOutOfScope: 0x8815, // 34837\n  invalidElementPredicate: 0x8816, // 34838\n  invalidEmptySetUsage: 0x8817, // 34839\n  invalidArgsArity: 0x8818, // 34840\n  invalidArgumentType: 0x8819, // 34841\n  globalStructure: 0x881c, // 34844\n  radicalUsage: 0x8821, // 34849\n  invalidFilterArgumentType: 0x8822, // 34850\n  invalidFilterArity: 0x8823, // 34851\n  arithmeticNotSupported: 0x8824, // 34852\n  typesNotCompatible: 0x8825, // 34853\n  orderingNotSupported: 0x8826, // 34854\n  expectedLogic: 0x8827, // 34855\n  expectedSetexpr: 0x8828, // 34856\n  invalidArgumentCortegeDeclare: 0x8829, // 34857\n\n  globalNoValue: 0x8840, // 34880\n  invalidPropertyUsage: 0x8841, // 34881\n\n  // Value evaluation (runtime)\n  calcUnknownError: 0x8100, // 35328\n  setOverflow: 0x8101, // 35329\n  booleanBaseLimit: 0x8102, // 35330\n  calcGlobalMissing: 0x8103, // 35331\n  iterationsLimit: 0x8104, // 35332\n  calcInvalidDebool: 0x8105, // 35333\n  iterateInfinity: 0x8106, // 35334\n  calculationNotSupported: 0x8107, // 35335\n  calcInvalidData: 0x8108, // 35336\n\n  cstEmptyDerived: 0x8861, // 34913\n  definitionNotAllowed: 0x8862 // 34914\n} as const;\nexport type RSErrorCode = (typeof RSErrorCode)[keyof typeof RSErrorCode];\n\nconst ERROR_EVALUATION_MASK = 0x0100;\nconst ERROR_LEXER_MASK = 0x0200;\nconst ERROR_PARSER_MASK = 0x0400;\nconst ERROR_SEMANTIC_MASK = 0x0800;\n\n/** Infers error class from error type (code). */\nfunction inferErrorClass(error: RSErrorCode): RSErrorClass {\n  if ((error & ERROR_EVALUATION_MASK) !== 0) {\n    return RSErrorClass.EVALUATION;\n  } else if ((error & ERROR_LEXER_MASK) !== 0) {\n    return RSErrorClass.LEXER;\n  } else if ((error & ERROR_PARSER_MASK) !== 0) {\n    return RSErrorClass.PARSER;\n  } else if ((error & ERROR_SEMANTIC_MASK) !== 0) {\n    return RSErrorClass.SEMANTIC;\n  } else {\n    return RSErrorClass.UNKNOWN;\n  }\n}\n\n/** Generate ErrorID label. */\nexport function getRSErrorPrefix(code: RSErrorCode): string {\n  const id = code.toString(16).toUpperCase();\n  // prettier-ignore\n  switch (inferErrorClass(code)) {\n    case RSErrorClass.LEXER: return 'L' + id;\n    case RSErrorClass.PARSER: return 'P' + id;\n    case RSErrorClass.SEMANTIC: return 'S' + id;\n    case RSErrorClass.EVALUATION: return 'E' + id;\n    case RSErrorClass.UNKNOWN: return 'U' + id;\n  }\n}\n\n/** Checks if error is critical. */\nexport function isCritical(code: RSErrorCode): boolean {\n  return code !== RSErrorCode.localDoubleDeclare && code !== RSErrorCode.localNotUsed;\n}\n"],"mappings":";;;AAGA,MAAa,eAAe;CAC1B,OAAO;CACP,QAAQ;CACR,UAAU;CACV,YAAY;CACZ,SAAS;AACX;;AAmBA,MAAa,cAAc;CACzB,eAAe;CACf,oBAAoB;CACpB,mBAAmB;CACnB,sBAAsB;CACtB,iBAAiB;CACjB,mBAAmB;CACnB,oBAAoB;CACpB,eAAe;CACf,cAAc;CAEd,oBAAoB;CACpB,cAAc;CAEd,iBAAiB;CACjB,gBAAgB;CAEhB,eAAe;CACf,gBAAgB;CAChB,eAAe;CACf,gBAAgB;CAChB,sBAAsB;CACtB,aAAa;CACb,eAAe;CACf,uBAAuB;CACvB,eAAe;CACf,wBAAwB;CACxB,sBAAsB;CACtB,oBAAoB;CACpB,uBAAuB;CACvB,iBAAiB;CACjB,yBAAyB;CACzB,sBAAsB;CACtB,kBAAkB;CAClB,qBAAqB;CACrB,iBAAiB;CACjB,cAAc;CACd,2BAA2B;CAC3B,oBAAoB;CACpB,wBAAwB;CACxB,oBAAoB;CACpB,sBAAsB;CACtB,eAAe;CACf,iBAAiB;CACjB,+BAA+B;CAE/B,eAAe;CACf,sBAAsB;CAGtB,kBAAkB;CAClB,aAAa;CACb,kBAAkB;CAClB,mBAAmB;CACnB,iBAAiB;CACjB,mBAAmB;CACnB,iBAAiB;CACjB,yBAAyB;CACzB,iBAAiB;CAEjB,iBAAiB;CACjB,sBAAsB;AACxB;AAGA,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,oBAAoB;AAC1B,MAAM,sBAAsB;;AAG5B,SAAS,gBAAgB,OAAkC;CACzD,KAAK,QAAQ,2BAA2B,GACtC,OAAO,aAAa;MACf,KAAK,QAAQ,sBAAsB,GACxC,OAAO,aAAa;MACf,KAAK,QAAQ,uBAAuB,GACzC,OAAO,aAAa;MACf,KAAK,QAAQ,yBAAyB,GAC3C,OAAO,aAAa;MAEpB,OAAO,aAAa;AAExB;;AAGA,SAAgB,iBAAiB,MAA2B;CAC1D,MAAM,KAAK,KAAK,SAAS,EAAE,CAAC,CAAC,YAAY;CAEzC,QAAQ,gBAAgB,IAAI,GAA5B;EACE,KAAK,aAAa,OAAO,OAAO,MAAM;EACtC,KAAK,aAAa,QAAQ,OAAO,MAAM;EACvC,KAAK,aAAa,UAAU,OAAO,MAAM;EACzC,KAAK,aAAa,YAAY,OAAO,MAAM;EAC3C,KAAK,aAAa,SAAS,OAAO,MAAM;CAC1C;AACF;;AAGA,SAAgB,WAAW,MAA4B;CACrD,OAAO,SAAS,YAAY,sBAAsB,SAAS,YAAY;AACzE"}
+{"version":3,"file":"error.js","names":[],"sources":["../../src/rslang/error.ts"],"sourcesContent":["/** Module: Error types and functions. */\n\n/** Represents error class. */\nexport const RSErrorClass = {\n  LEXER: 0,\n  PARSER: 1,\n  SEMANTIC: 2,\n  EVALUATION: 3,\n  UNKNOWN: 4\n} as const;\nexport type RSErrorClass = (typeof RSErrorClass)[keyof typeof RSErrorClass];\n\n/** Represents RSLang expression error information. */\nexport interface RSErrorInfo {\n  code: RSErrorCode;\n  params?: readonly string[];\n}\n\n/** Represents RSLang expression error description. */\nexport interface RSErrorDescription extends RSErrorInfo {\n  from: number;\n  to: number;\n}\n\n/** Error reporter function type. */\nexport type ErrorReporter = (error: RSErrorDescription) => void;\n\n/** Represents RSLang expression error types. */\nexport const RSErrorCode = {\n  unknownSyntax: 0x8400, // 33792\n  missingParenthesis: 0x8406, // 33798\n  missingCurlyBrace: 0x8407, // 33799\n  missingSquareBracket: 0x8408, // 33800\n  bracketMismatch: 0x8409, // 33801\n  doubleParenthesis: 0x840a, // 33802\n  missingOpenBracket: 0x840b, // 33803\n  expectedLocal: 0x8415, // 33813\n  expectedType: 0x8416, // 33814\n\n  localDoubleDeclare: 0x2801, // 10241\n  localNotUsed: 0x2802, // 10242\n\n  localUndeclared: 0x8801, // 34817\n  localShadowing: 0x8802, // 34818\n\n  typesNotEqual: 0x8803, // 34819\n  globalNotTyped: 0x8804, // 34820\n  invalidDecart: 0x8805, // 34821\n  invalidBoolean: 0x8806, // 34822\n  invalidTypeOperation: 0x8807, // 34823\n  invalidCard: 0x8808, // 34824\n  invalidDebool: 0x8809, // 34825\n  globalFuncWithoutArgs: 0x880b, // 34827\n  invalidReduce: 0x8810, // 34832\n  invalidProjectionTuple: 0x8811, // 34833\n  invalidProjectionSet: 0x8812, // 34834\n  invalidEnumeration: 0x8813, // 34835\n  invalidCortegeDeclare: 0x8814, // 34836\n  localOutOfScope: 0x8815, // 34837\n  invalidElementPredicate: 0x8816, // 34838\n  invalidEmptySetUsage: 0x8817, // 34839\n  invalidArgsArity: 0x8818, // 34840\n  invalidArgumentType: 0x8819, // 34841\n  globalStructure: 0x881c, // 34844\n  radicalUsage: 0x8821, // 34849\n  invalidFilterArgumentType: 0x8822, // 34850\n  invalidFilterArity: 0x8823, // 34851\n  arithmeticNotSupported: 0x8824, // 34852\n  typesNotCompatible: 0x8825, // 34853\n  orderingNotSupported: 0x8826, // 34854\n  expectedLogic: 0x8827, // 34855\n  expectedSetexpr: 0x8828, // 34856\n  invalidArgumentCortegeDeclare: 0x8829, // 34857\n  invalidQuantifierDomain: 0x882a, // 34858\n\n  globalNoValue: 0x8840, // 34880\n  invalidPropertyUsage: 0x8841, // 34881\n\n  // Value evaluation (runtime)\n  calcUnknownError: 0x8100, // 35328\n  setOverflow: 0x8101, // 35329\n  booleanBaseLimit: 0x8102, // 35330\n  calcGlobalMissing: 0x8103, // 35331\n  iterationsLimit: 0x8104, // 35332\n  calcInvalidDebool: 0x8105, // 35333\n  iterateInfinity: 0x8106, // 35334\n  calculationNotSupported: 0x8107, // 35335\n  calcInvalidData: 0x8108, // 35336\n\n  cstEmptyDerived: 0x8861, // 34913\n  definitionNotAllowed: 0x8862 // 34914\n} as const;\nexport type RSErrorCode = (typeof RSErrorCode)[keyof typeof RSErrorCode];\n\nconst ERROR_EVALUATION_MASK = 0x0100;\nconst ERROR_LEXER_MASK = 0x0200;\nconst ERROR_PARSER_MASK = 0x0400;\nconst ERROR_SEMANTIC_MASK = 0x0800;\n\n/** Infers error class from error type (code). */\nfunction inferErrorClass(error: RSErrorCode): RSErrorClass {\n  if ((error & ERROR_EVALUATION_MASK) !== 0) {\n    return RSErrorClass.EVALUATION;\n  } else if ((error & ERROR_LEXER_MASK) !== 0) {\n    return RSErrorClass.LEXER;\n  } else if ((error & ERROR_PARSER_MASK) !== 0) {\n    return RSErrorClass.PARSER;\n  } else if ((error & ERROR_SEMANTIC_MASK) !== 0) {\n    return RSErrorClass.SEMANTIC;\n  } else {\n    return RSErrorClass.UNKNOWN;\n  }\n}\n\n/** Generate ErrorID label. */\nexport function getRSErrorPrefix(code: RSErrorCode): string {\n  const id = code.toString(16).toUpperCase();\n  // prettier-ignore\n  switch (inferErrorClass(code)) {\n    case RSErrorClass.LEXER: return 'L' + id;\n    case RSErrorClass.PARSER: return 'P' + id;\n    case RSErrorClass.SEMANTIC: return 'S' + id;\n    case RSErrorClass.EVALUATION: return 'E' + id;\n    case RSErrorClass.UNKNOWN: return 'U' + id;\n  }\n}\n\n/** Checks if error is critical. */\nexport function isCritical(code: RSErrorCode): boolean {\n  return code !== RSErrorCode.localDoubleDeclare && code !== RSErrorCode.localNotUsed;\n}\n"],"mappings":";;;AAGA,MAAa,eAAe;CAC1B,OAAO;CACP,QAAQ;CACR,UAAU;CACV,YAAY;CACZ,SAAS;AACX;;AAmBA,MAAa,cAAc;CACzB,eAAe;CACf,oBAAoB;CACpB,mBAAmB;CACnB,sBAAsB;CACtB,iBAAiB;CACjB,mBAAmB;CACnB,oBAAoB;CACpB,eAAe;CACf,cAAc;CAEd,oBAAoB;CACpB,cAAc;CAEd,iBAAiB;CACjB,gBAAgB;CAEhB,eAAe;CACf,gBAAgB;CAChB,eAAe;CACf,gBAAgB;CAChB,sBAAsB;CACtB,aAAa;CACb,eAAe;CACf,uBAAuB;CACvB,eAAe;CACf,wBAAwB;CACxB,sBAAsB;CACtB,oBAAoB;CACpB,uBAAuB;CACvB,iBAAiB;CACjB,yBAAyB;CACzB,sBAAsB;CACtB,kBAAkB;CAClB,qBAAqB;CACrB,iBAAiB;CACjB,cAAc;CACd,2BAA2B;CAC3B,oBAAoB;CACpB,wBAAwB;CACxB,oBAAoB;CACpB,sBAAsB;CACtB,eAAe;CACf,iBAAiB;CACjB,+BAA+B;CAC/B,yBAAyB;CAEzB,eAAe;CACf,sBAAsB;CAGtB,kBAAkB;CAClB,aAAa;CACb,kBAAkB;CAClB,mBAAmB;CACnB,iBAAiB;CACjB,mBAAmB;CACnB,iBAAiB;CACjB,yBAAyB;CACzB,iBAAiB;CAEjB,iBAAiB;CACjB,sBAAsB;AACxB;AAGA,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,oBAAoB;AAC1B,MAAM,sBAAsB;;AAG5B,SAAS,gBAAgB,OAAkC;CACzD,KAAK,QAAQ,2BAA2B,GACtC,OAAO,aAAa;MACf,KAAK,QAAQ,sBAAsB,GACxC,OAAO,aAAa;MACf,KAAK,QAAQ,uBAAuB,GACzC,OAAO,aAAa;MACf,KAAK,QAAQ,yBAAyB,GAC3C,OAAO,aAAa;MAEpB,OAAO,aAAa;AAExB;;AAGA,SAAgB,iBAAiB,MAA2B;CAC1D,MAAM,KAAK,KAAK,SAAS,EAAE,CAAC,CAAC,YAAY;CAEzC,QAAQ,gBAAgB,IAAI,GAA5B;EACE,KAAK,aAAa,OAAO,OAAO,MAAM;EACtC,KAAK,aAAa,QAAQ,OAAO,MAAM;EACvC,KAAK,aAAa,UAAU,OAAO,MAAM;EACzC,KAAK,aAAa,YAAY,OAAO,MAAM;EAC3C,KAAK,aAAa,SAAS,OAAO,MAAM;CAC1C;AACF;;AAGA,SAAgB,WAAW,MAA4B;CACrD,OAAO,SAAS,YAAY,sBAAsB,SAAS,YAAY;AACzE"}

package/dist/rslang/eval/calculator.d.ts

@@ -1,2 +1,2 @@
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../../calculator-DFevxZyV.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../../calculator-8tErfQcI.js";
 export { CalculatorEvaluateOptions, CalculatorResult, RSCalculator };

package/dist/rslang/eval/calculator.js

@@ -1,6 +1,6 @@
 import { annotateError } from "../ast-annotations.js";
 import { RSErrorCode } from "../error.js";
-import { M as validateValue } from "../../value-ybFBRuz6.js";
+import { M as validateValue } from "../../value-COprb2Je.js";
 import { Evaluator } from "./evaluator.js";
 //#region src/rslang/eval/calculator.ts
 /** AST calculator - evaluates RS expressions via visitor pattern and provides updates via listeners. */

package/dist/rslang/eval/evaluator.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 { l as Value, u as ValueContext } from "../../value-BduA_ZGp.js";
 
 //#region src/rslang/eval/evaluator.d.ts

package/dist/rslang/eval/evaluator.js

@@ -3,8 +3,9 @@ import { RSErrorCode } from "../error.js";
 import { getNodeIndices, getNodeText } from "../../parsing/ast.js";
 import "../../parsing/index.js";
 import { TokenID } from "../parser/token.js";
+import { labelRSLangNode } from "../labels.js";
 import { EvaluationCache, EvaluationMetadata } from "./evaluation-cache.js";
-import { A as setUnion, D as setIntersection, E as setDiff, T as reduce, a as SET_INFINITY, d as set, f as tuple, h as contains, k as setSymDiff, l as compare, m as cartesianProduct, n as CalcInvalidDataError, p as boolean, r as EmptySetV, w as projection, y as isSubsetOrEq } from "../../value-ybFBRuz6.js";
+import { A as setUnion, D as setIntersection, E as setDiff, T as reduce, a as SET_INFINITY, d as set, f as tuple, h as contains, k as setSymDiff, l as compare, m as cartesianProduct, n as CalcInvalidDataError, p as boolean, r as EmptySetV, w as projection, y as isSubsetOrEq } from "../../value-COprb2Je.js";
 //#region src/rslang/eval/evaluator.ts
 /**
 * Module: AST evaluation - visitor-pattern evaluator for RS expressions.
@@ -103,7 +104,11 @@ var Evaluator = class {
 			if (!this.disableCache && result !== null && info.cacheable && stamp !== null) this.evalCache.store(info.structuralKey, stamp, result);
 			return result;
 		} catch (error) {
-			if (error instanceof CalcInvalidDataError) return this.onError(RSErrorCode.calcInvalidData, node, [error.left, error.right]);
+			if (error instanceof CalcInvalidDataError) return this.onError(RSErrorCode.calcInvalidData, node, [
+				error.left,
+				error.right,
+				labelRSLangNode(node)
+			]);
 			this.onError(RSErrorCode.calcUnknownError, node);
 			return null;
 		}

package/dist/rslang/eval/evaluator.js.map

@@ -1 +1 @@
-{"version":3,"file":"evaluator.js","names":[],"sources":["../../../src/rslang/eval/evaluator.ts"],"sourcesContent":["/**\n * Module: AST evaluation - visitor-pattern evaluator for RS expressions.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { annotateError } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode } from '../error';\nimport { TokenID } from '../parser/token';\n\nimport { EvaluationCache, EvaluationMetadata } from './evaluation-cache';\nimport {\n  BOOL_INFINITY,\n  CalcInvalidDataError,\n  compare,\n  EmptySetV,\n  set,\n  SET_INFINITY,\n  tuple,\n  type Value,\n  VALUE_FALSE,\n  VALUE_TRUE,\n  type ValueContext\n} from './value';\nimport {\n  boolean,\n  cartesianProduct,\n  contains,\n  isSubsetOrEq,\n  projection,\n  reduce,\n  setDiff,\n  setIntersection,\n  setSymDiff,\n  setUnion\n} from './value-api';\n\n/** Maximum iterations to prevent infinite loops (recursion, quantifiers, etc.). */\nconst MAX_ITERATIONS = 1_000_000;\n\nconst TICK_PER_FUNCTION = 3;\nconst TICK_PER_RECURSION = 3;\nconst TICK_PER_IMPERATIVE = 1;\nconst TICK_PER_DECLARATIVE = 1;\nconst TICK_PER_QUANTIFIER = 1;\n\n/** AST context. */\nexport type ASTContext = Map<string, AstNode>;\n\n/** AST calculator - evaluates RS expressions via visitor pattern and provides updates via listeners.\n * Not safe for concurrent {@link run} calls on the same instance; use separate evaluators instead. */\nexport class Evaluator {\n  private reporter?: ErrorReporter;\n  private annotateErrors = false;\n  private disableCache = false;\n  private locals: LocalContext = new LocalContext();\n  private nodeMetadata: EvaluationMetadata = new EvaluationMetadata();\n  private evalCache: EvaluationCache = new EvaluationCache();\n  private callSiteStack: AstNode[] = [];\n  private context: ValueContext;\n  private treeContext: ASTContext;\n\n  public iterationCounter = 0;\n\n  /** Cache hits in the current evaluation run (for tests/diagnostics). */\n  public get cacheHits(): number {\n    return this.evalCache.hits;\n  }\n\n  constructor(context: ValueContext, astContext: ASTContext) {\n    this.treeContext = astContext;\n    this.context = context;\n  }\n\n  public run(\n    ast: AstNode,\n    reporter?: ErrorReporter,\n    annotateErrors: boolean = false,\n    disableCache: boolean = false\n  ): Value | null {\n    if (ast.hasError) {\n      return null;\n    }\n    this.reporter = reporter;\n    this.annotateErrors = annotateErrors;\n    this.disableCache = disableCache;\n    this.clear();\n    return this.dispatchVisit(ast);\n  }\n\n  private clear(): void {\n    this.locals = new LocalContext();\n    this.evalCache.clear();\n    this.callSiteStack = [];\n    this.iterationCounter = 0;\n  }\n\n  private errorNode(node: AstNode): AstNode {\n    if (this.callSiteStack.length > 0) {\n      return this.callSiteStack[this.callSiteStack.length - 1];\n    }\n    return node;\n  }\n\n  private onError(code: RSErrorCode, node: AstNode, params?: string[]): null {\n    const target = this.errorNode(node);\n    this.reporter?.({ code, from: target.from, to: target.to, params });\n    if (this.annotateErrors) {\n      annotateError(target, code, params);\n    }\n    return null;\n  }\n\n  private tick(node: AstNode, counter: number = 1): boolean {\n    this.iterationCounter += counter;\n    if (this.iterationCounter > MAX_ITERATIONS) {\n      this.onError(RSErrorCode.iterationsLimit, node, [String(MAX_ITERATIONS)]);\n      return false;\n    }\n    return true;\n  }\n\n  private dispatchDeclare(node: AstNode, value: Value): void {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node, value);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node, value as Value[]);\n      case TokenID.NT_ARG_DECL:\n        return this.dispatchDeclare(node.children[0], value);\n    }\n  }\n\n  private declareLocal(node: AstNode, value: Value): void {\n    const alias = getNodeText(node);\n    this.locals.setLocal(alias, value);\n  }\n\n  private declareTuple(node: AstNode, value: Value[]): void {\n    for (let child = 0; child < node.children.length; child++) {\n      this.dispatchDeclare(node.children[child], value[child + 1]);\n    }\n  }\n\n  private dispatchVisit(node: AstNode): Value | null {\n    const info = this.nodeMetadata.get(node);\n    let stamp: string | null = null;\n    if (info.cacheable && !this.disableCache) {\n      stamp = this.locals.buildDependencyStamp(info.reads);\n      if (stamp !== null) {\n        const cached = this.evalCache.lookup(info.structuralKey, stamp);\n        if (cached !== undefined) {\n          return cached;\n        }\n      }\n    }\n\n    try {\n      const result = this.dispatchVisitImpl(node);\n      if (!this.disableCache && result !== null && info.cacheable && stamp !== null) {\n        this.evalCache.store(info.structuralKey, stamp, result);\n      }\n      return result;\n    } catch (error) {\n      if (error instanceof CalcInvalidDataError) {\n        return this.onError(RSErrorCode.calcInvalidData, node, [error.left, error.right]);\n      }\n      this.onError(RSErrorCode.calcUnknownError, node);\n      return null;\n    }\n  }\n\n  private dispatchVisitImpl(node: AstNode): Value | null {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n        return this.visitGlobal(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ID_LOCAL:\n      case TokenID.ID_RADICAL:\n        return this.visitLocal(node);\n\n      case TokenID.LIT_INTEGER:\n        return this.visitInteger(node);\n\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return this.onError(RSErrorCode.iterateInfinity, node);\n\n      case TokenID.LIT_EMPTYSET:\n        return EmptySetV;\n\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n        return this.visitArithmetic(node);\n\n      case TokenID.CARD:\n        return this.visitCard(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\n      case TokenID.BOOLEAN:\n        return this.visitBoolean(node);\n\n      case TokenID.NT_TUPLE:\n        return this.visitTuple(node);\n\n      case TokenID.NT_ENUMERATION:\n        return this.visitEnumeration(node);\n\n      case TokenID.BOOL:\n        return this.visitBool(node);\n\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.BIGPR:\n        return this.visitProjectSet(node);\n\n      case TokenID.SMALLPR:\n        return this.visitProjectTuple(node);\n\n      case TokenID.FILTER:\n        return this.visitFilter(node);\n\n      case TokenID.REDUCE:\n        return this.visitReduce(node);\n\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitDeclarative(node);\n\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.ASSIGN:\n        return this.visitAssign(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.onError(RSErrorCode.calculationNotSupported, node);\n    }\n    return null;\n  }\n\n  private visitChild(node: AstNode, index: number): Value | null {\n    return this.dispatchVisit(node.children[index]);\n  }\n\n  private visitGlobal(node: AstNode): Value | null {\n    const alias = getNodeText(node);\n    const value = this.context.get(alias) ?? null;\n    if (value === null) {\n      return this.onError(RSErrorCode.calcGlobalMissing, node, [alias]);\n    }\n    return value;\n  }\n\n  private visitLocal(node: AstNode): Value | null {\n    const alias = getNodeText(node);\n    const value = this.locals.findLocal(alias);\n    if (value === null) {\n      return this.onError(RSErrorCode.localUndeclared, node, [alias]);\n    }\n    return value;\n  }\n\n  private visitFunctionCall(node: AstNode): Value | null {\n    const funcName = getNodeText(node.children[0]);\n    const ast = this.treeContext.get(funcName);\n    if (!ast) {\n      return this.onError(RSErrorCode.calcGlobalMissing, node.children[0], [funcName]);\n    }\n    if (!this.tick(node, TICK_PER_FUNCTION)) {\n      return null;\n    }\n\n    const args: Value[] = [];\n    for (let i = 1; i < node.children.length; i++) {\n      const arg = this.visitChild(node, i);\n      if (arg === null) {\n        return null;\n      }\n      args.push(arg);\n    }\n\n    this.locals.startScope();\n    for (let i = 0; i < args.length; i++) {\n      this.dispatchDeclare(ast.children[0].children[i], args[i]);\n    }\n    this.callSiteStack.push(node);\n    let result: Value | null;\n    try {\n      result = this.visitChild(ast, 1);\n    } finally {\n      this.callSiteStack.pop();\n    }\n    this.locals.endScope();\n    return result;\n  }\n\n  private visitInteger(node: AstNode): Value | null {\n    const value = node.data.dataType === 'number' ? (node.data.value as number) : Number(node.data.value);\n    return Math.floor(value);\n  }\n\n  private visitArithmetic(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    const v2 = this.visitChild(node, 1);\n    if (v1 === null || v2 === null) {\n      return null;\n    }\n    const a = v1 as number;\n    const b = v2 as number;\n    switch (node.typeID) {\n      case TokenID.PLUS:\n        return a + b;\n      case TokenID.MINUS:\n        return a - b;\n      case TokenID.MULTIPLY:\n        return a * b;\n    }\n    return null;\n  }\n\n  private visitCard(node: AstNode): Value | null {\n    const base = this.visitChild(node, 0);\n    if (base === null || !Array.isArray(base)) {\n      return null;\n    }\n    return base.length;\n  }\n\n  private visitQuantifier(node: AstNode): Value | null {\n    const domain = this.visitChild(node, 1) as Value[];\n    if (domain === null) {\n      return null;\n    }\n    const isUniversal = node.typeID === TokenID.QUANTOR_UNIVERSAL;\n    if (domain.length === 0) {\n      return isUniversal ? VALUE_TRUE : VALUE_FALSE;\n    }\n\n    const varNodes = node.children[0].typeID === TokenID.NT_ENUM_DECL ? node.children[0].children : [node.children[0]];\n    const count = domain.length;\n    const iterators: number[] = [];\n    for (const declaration of varNodes) {\n      iterators.push(0);\n      this.dispatchDeclare(declaration, domain[0]);\n    }\n    let finishIteration = false;\n    while (!finishIteration) {\n      const iterationValue = this.visitChild(node, 2);\n      if (iterationValue === null) {\n        return null;\n      }\n      if ((iterationValue === VALUE_TRUE) !== isUniversal) {\n        return !isUniversal ? VALUE_TRUE : VALUE_FALSE;\n      }\n      let incrementIndex = iterators.length - 1;\n      while (true) {\n        if (iterators[incrementIndex] < count - 1) {\n          iterators[incrementIndex]++;\n          if (!this.tick(node, TICK_PER_QUANTIFIER)) {\n            return null;\n          }\n          this.dispatchDeclare(varNodes[incrementIndex], domain[iterators[incrementIndex]]);\n          incrementIndex = iterators.length - 1;\n          break;\n        } else if (incrementIndex === 0) {\n          finishIteration = true;\n          break;\n        } else {\n          iterators[incrementIndex] = 0;\n          this.dispatchDeclare(varNodes[incrementIndex], domain[0]);\n          incrementIndex--;\n        }\n      }\n    }\n    return isUniversal ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitNegation(node: AstNode): Value | null {\n    const value = this.visitChild(node, 0);\n    if (value === null) {\n      return null;\n    }\n    return (value as number) === VALUE_TRUE ? VALUE_FALSE : VALUE_TRUE;\n  }\n\n  private tryEvaluateFromFirstArg(op: number, first: boolean): Value | null {\n    if ((op === TokenID.LOGIC_AND && !first) || (op === TokenID.LOGIC_OR && first)) {\n      return first ? VALUE_TRUE : VALUE_FALSE;\n    }\n    if (op === TokenID.LOGIC_IMPLICATION && !first) {\n      return VALUE_TRUE;\n    }\n    return null;\n  }\n\n  private visitLogicBinary(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const b1 = v1 === VALUE_TRUE;\n    const attempt = this.tryEvaluateFromFirstArg(node.typeID, b1);\n    if (attempt !== null) {\n      return attempt;\n    }\n\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const b2 = v2 === VALUE_TRUE;\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.LOGIC_AND:\n        result = b1 && b2;\n        break;\n      case TokenID.LOGIC_OR:\n        result = b1 || b2;\n        break;\n      case TokenID.LOGIC_IMPLICATION:\n        result = !b1 || b2;\n        break;\n      case TokenID.LOGIC_EQUIVALENT:\n        result = b1 === b2;\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitEquals(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const areEqual = compare(v1, v2) === 0;\n    return areEqual === (node.typeID !== TokenID.NOTEQUAL) ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitIntegerPredicate(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const a = v1 as number;\n    const b = v2 as number;\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.GREATER:\n        result = a > b;\n        break;\n      case TokenID.LESSER:\n        result = a < b;\n        break;\n      case TokenID.GREATER_OR_EQ:\n        result = a >= b;\n        break;\n      case TokenID.LESSER_OR_EQ:\n        result = a <= b;\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitSetexprPredicate(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.SET_IN:\n        result = contains(v2 as Value[], v1);\n        break;\n      case TokenID.SET_NOT_IN:\n        result = !contains(v2 as Value[], v1);\n        break;\n      case TokenID.SUBSET:\n        result = compare(v1, v2) !== 0 && isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      case TokenID.NOT_SUBSET:\n        result = compare(v1, v2) === 0 || !isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      case TokenID.SUBSET_OR_EQ:\n        result = isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitDecart(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const component = this.visitChild(node, i) as Value[];\n      if (component === null) {\n        return null;\n      }\n      if (component.length === 0) {\n        return EmptySetV;\n      }\n      args.push(component);\n    }\n    const result = cartesianProduct(args as Value[][]);\n    if (result === null) {\n      this.onError(RSErrorCode.setOverflow, node, [String(SET_INFINITY)]);\n      return null;\n    }\n    return result;\n  }\n\n  private visitBoolean(node: AstNode): Value | null {\n    const base = this.visitChild(node, 0) as Value[];\n    if (base === null) {\n      return null;\n    }\n    const result = boolean(base);\n    if (result === null) {\n      this.onError(RSErrorCode.booleanBaseLimit, node.children[0], [String(BOOL_INFINITY)]);\n      return null;\n    }\n    return result;\n  }\n\n  private visitTuple(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const component = this.visitChild(node, i);\n      if (component === null) {\n        return null;\n      }\n      args.push(component);\n    }\n    return tuple(args);\n  }\n\n  private visitEnumeration(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const element = this.visitChild(node, i);\n      if (element === null) {\n        return null;\n      }\n      args.push(element);\n    }\n    return set(args);\n  }\n\n  private visitBool(node: AstNode): Value | null {\n    const element = this.visitChild(node, 0);\n    if (element === null) {\n      return null;\n    }\n    return [element];\n  }\n\n  private visitDebool(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0) as Value[];\n    if (target === null) {\n      return null;\n    }\n    if (target.length !== 1) {\n      return this.onError(RSErrorCode.calcInvalidDebool, node.children[0]);\n    }\n    return target[0];\n  }\n\n  private visitSetexprBinary(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    switch (node.typeID) {\n      case TokenID.SET_UNION:\n        return setUnion(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_INTERSECTION:\n        return setIntersection(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_MINUS:\n        return setDiff(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return setSymDiff(v1 as Value[], v2 as Value[]);\n    }\n    return null;\n  }\n\n  private visitProjectSet(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0);\n    if (target === null) {\n      return null;\n    }\n    const indices = getNodeIndices(node);\n    return projection(target as Value[][], indices);\n  }\n\n  private visitProjectTuple(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0) as Value[];\n    if (target === null) {\n      return null;\n    }\n    const indices = getNodeIndices(node);\n    const components = indices.map(i => target[i]);\n    return components.length === 1 ? components[0] : tuple(components);\n  }\n\n  private visitFilter(node: AstNode): Value | null {\n    const lastIdx = node.children.length - 1;\n    const argVal = this.visitChild(node, lastIdx) as Value[][];\n    if (argVal === null) {\n      return null;\n    }\n    if (argVal.length === 0) {\n      return EmptySetV;\n    }\n\n    const indices = getNodeIndices(node);\n    const tupleParam = indices.length === lastIdx;\n    if (tupleParam) {\n      const params: Value[] = [];\n      for (let i = 0; i < lastIdx; i++) {\n        const param = this.visitChild(node, i) as Value[];\n        if (param === null) {\n          return null;\n        }\n        if (param.length === 0) {\n          return EmptySetV;\n        }\n        params.push(param);\n      }\n      const result: Value[] = [];\n      for (const element of argVal) {\n        let valid = true;\n        for (let j = 0; j < indices.length; j++) {\n          const comp = element[indices[j]];\n          const paramSet = params[j] as Value[];\n          if (!contains(paramSet, comp)) {\n            valid = false;\n            break;\n          }\n        }\n        if (valid) {\n          result.push(element);\n        }\n      }\n      return result;\n    } else {\n      const paramVal = this.visitChild(node, 0) as Value[];\n      if (paramVal === null) {\n        return null;\n      }\n      if (paramVal.length === 0) {\n        return EmptySetV;\n      }\n\n      const result: Value[] = [];\n      for (const element of argVal) {\n        const comps = indices.map(i => element[i]);\n        const testElement = comps.length === 1 ? comps[0] : tuple(comps);\n        if (contains(paramVal, testElement)) result.push(element);\n      }\n      return result;\n    }\n  }\n\n  private visitReduce(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0);\n    if (target === null) {\n      return null;\n    }\n    return reduce(target as Value[][]);\n  }\n\n  private visitDeclarative(node: AstNode): Value | null {\n    const domain = this.visitChild(node, 1);\n    if (domain === null) {\n      return null;\n    }\n\n    const elements = [];\n    for (const element of domain as Value[]) {\n      if (!this.tick(node, TICK_PER_DECLARATIVE)) {\n        return null;\n      }\n      this.dispatchDeclare(node.children[0], element);\n      const value = this.visitChild(node, 2);\n      if (value === null) {\n        return null;\n      }\n      if (value === VALUE_TRUE) {\n        elements.push(element);\n      }\n    }\n    return elements.length === 0 ? EmptySetV : elements;\n  }\n\n  private visitImperative(node: AstNode): Value | null {\n    const result: Value[] = [];\n    const frames: IterationFrame[] = [];\n\n    let currentChild = 1;\n\n    // Advance to next iteration\n    const advanceIterator = (): boolean => {\n      while (frames.length > 0) {\n        const top = frames[frames.length - 1];\n        if (top.valueID < top.domain.length - 1) {\n          top.valueID++;\n          const nextValue = top.domain[top.valueID];\n          if (!this.tick(node.children[top.childID], TICK_PER_IMPERATIVE)) {\n            return false;\n          }\n          this.dispatchDeclare(node.children[top.childID].children[0], nextValue);\n          currentChild = top.childID + 1;\n          return true;\n        }\n        frames.pop();\n      }\n      return false;\n    };\n\n    while (true) {\n      // Iteration end - create element and pop up stack\n      if (currentChild >= node.children.length) {\n        const element = this.visitChild(node, 0);\n        if (element === null) {\n          return null;\n        }\n        result.push(element);\n        if (!advanceIterator()) {\n          break;\n        }\n        continue;\n      }\n\n      // Iteration node\n      const child = node.children[currentChild];\n      if (child.typeID === TokenID.ITERATE) {\n        const domain = this.visitChild(child, 1) as Value[];\n        if (domain === null) {\n          return null;\n        }\n        if (domain.length === 0) {\n          if (!advanceIterator()) {\n            break;\n          }\n          continue;\n        }\n        if (!this.tick(child, TICK_PER_IMPERATIVE)) {\n          return null;\n        }\n        frames.push({\n          childID: currentChild,\n          domain,\n          valueID: 0\n        });\n        this.dispatchDeclare(child.children[0], domain[0]);\n        currentChild++;\n        continue;\n      }\n\n      // Guard expression\n      const value = this.dispatchVisit(child);\n      if (value === null) {\n        return null;\n      }\n      if (value === VALUE_FALSE) {\n        if (!advanceIterator()) {\n          break;\n        }\n        continue;\n      }\n      currentChild++;\n    }\n    return set(result);\n  }\n\n  private visitAssign(node: AstNode): Value | null {\n    const value = this.visitChild(node, 1);\n    if (value === null) {\n      return null;\n    }\n    this.dispatchDeclare(node.children[0], value);\n    return VALUE_TRUE;\n  }\n\n  private visitRecursion(node: AstNode): Value | null {\n    const initialValue = this.visitChild(node, 1);\n    if (initialValue === null) {\n      return null;\n    }\n    const bodyIndex = node.typeID === TokenID.NT_RECURSIVE_FULL ? 3 : 2;\n    let current: Value = initialValue;\n    while (true) {\n      if (!this.tick(node, TICK_PER_RECURSION)) {\n        return null;\n      }\n\n      this.dispatchDeclare(node.children[0], current);\n      if (node.typeID === TokenID.NT_RECURSIVE_FULL) {\n        const pred = this.visitChild(node, 2);\n        if (pred === null) {\n          return null;\n        }\n        if (pred !== VALUE_TRUE) {\n          break;\n        }\n      }\n\n      const next = this.visitChild(node, bodyIndex);\n      if (next === null) {\n        return null;\n      }\n      if (compare(current, next) === 0) {\n        break;\n      }\n      current = next;\n    }\n\n    return current;\n  }\n}\n\n/** Imperative iteration block data. */\ninterface IterationFrame {\n  childID: number;\n  domain: Value[];\n  valueID: number;\n}\n\n/** Local variable binding with version for cache invalidation. */\ninterface LocalBinding {\n  id: number;\n  version: number;\n  value: Value;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  private nextBindingId = 1;\n  private data = new Map<string, LocalBinding>();\n  private callStack: Map<string, LocalBinding>[] = [];\n\n  startScope(): void {\n    this.callStack.push(this.data);\n    this.data = new Map();\n  }\n\n  endScope(): void {\n    this.data = this.callStack.pop()!;\n  }\n\n  setLocal(alias: string, value: Value): void {\n    const existing = this.data.get(alias);\n    if (existing) {\n      existing.value = value;\n      existing.version++;\n    } else {\n      this.data.set(alias, { id: this.nextBindingId++, version: 0, value });\n    }\n  }\n\n  findLocal(alias: string): Value | null {\n    return this.data.get(alias)?.value ?? null;\n  }\n\n  buildDependencyStamp(reads: ReadonlySet<string>): string | null {\n    if (reads.size === 0) {\n      return '';\n    }\n    const parts: string[] = [];\n    for (const alias of [...reads].sort()) {\n      const binding = this.data.get(alias);\n      if (binding === undefined) {\n        return null;\n      }\n      parts.push(`${binding.id}:${binding.version}`);\n    }\n    return parts.join('|');\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAqCA,MAAM,iBAAiB;AAEvB,MAAM,oBAAoB;AAC1B,MAAM,qBAAqB;AAC3B,MAAM,sBAAsB;AAC5B,MAAM,uBAAuB;AAC7B,MAAM,sBAAsB;;;AAO5B,IAAa,YAAb,MAAuB;CACrB;CACA,iBAAyB;CACzB,eAAuB;CACvB,SAA+B,IAAI,aAAa;CAChD,eAA2C,IAAI,mBAAmB;CAClE,YAAqC,IAAI,gBAAgB;CACzD,gBAAmC,CAAC;CACpC;CACA;CAEA,mBAA0B;;CAG1B,IAAW,YAAoB;EAC7B,OAAO,KAAK,UAAU;CACxB;CAEA,YAAY,SAAuB,YAAwB;EACzD,KAAK,cAAc;EACnB,KAAK,UAAU;CACjB;CAEA,IACE,KACA,UACA,iBAA0B,OAC1B,eAAwB,OACV;EACd,IAAI,IAAI,UACN,OAAO;EAET,KAAK,WAAW;EAChB,KAAK,iBAAiB;EACtB,KAAK,eAAe;EACpB,KAAK,MAAM;EACX,OAAO,KAAK,cAAc,GAAG;CAC/B;CAEA,QAAsB;EACpB,KAAK,SAAS,IAAI,aAAa;EAC/B,KAAK,UAAU,MAAM;EACrB,KAAK,gBAAgB,CAAC;EACtB,KAAK,mBAAmB;CAC1B;CAEA,UAAkB,MAAwB;EACxC,IAAI,KAAK,cAAc,SAAS,GAC9B,OAAO,KAAK,cAAc,KAAK,cAAc,SAAS;EAExD,OAAO;CACT;CAEA,QAAgB,MAAmB,MAAe,QAAyB;EACzE,MAAM,SAAS,KAAK,UAAU,IAAI;EAClC,KAAK,WAAW;GAAE;GAAM,MAAM,OAAO;GAAM,IAAI,OAAO;GAAI;EAAO,CAAC;EAClE,IAAI,KAAK,gBACP,cAAc,QAAQ,MAAM,MAAM;EAEpC,OAAO;CACT;CAEA,KAAa,MAAe,UAAkB,GAAY;EACxD,KAAK,oBAAoB;EACzB,IAAI,KAAK,mBAAmB,gBAAgB;GAC1C,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,OAAO,cAAc,CAAC,CAAC;GACxE,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBAAwB,MAAe,OAAoB;EACzD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,MAAM,KAAK;GACtC,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,MAAM,KAAgB;GACjD,KAAK,QAAQ,aACX,OAAO,KAAK,gBAAgB,KAAK,SAAS,IAAI,KAAK;EACvD;CACF;CAEA,aAAqB,MAAe,OAAoB;EACtD,MAAM,QAAQ,YAAY,IAAI;EAC9B,KAAK,OAAO,SAAS,OAAO,KAAK;CACnC;CAEA,aAAqB,MAAe,OAAsB;EACxD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE;CAE/D;CAEA,cAAsB,MAA6B;EACjD,MAAM,OAAO,KAAK,aAAa,IAAI,IAAI;EACvC,IAAI,QAAuB;EAC3B,IAAI,KAAK,aAAa,CAAC,KAAK,cAAc;GACxC,QAAQ,KAAK,OAAO,qBAAqB,KAAK,KAAK;GACnD,IAAI,UAAU,MAAM;IAClB,MAAM,SAAS,KAAK,UAAU,OAAO,KAAK,eAAe,KAAK;IAC9D,IAAI,WAAW,QACb,OAAO;GAEX;EACF;EAEA,IAAI;GACF,MAAM,SAAS,KAAK,kBAAkB,IAAI;GAC1C,IAAI,CAAC,KAAK,gBAAgB,WAAW,QAAQ,KAAK,aAAa,UAAU,MACvE,KAAK,UAAU,MAAM,KAAK,eAAe,OAAO,MAAM;GAExD,OAAO;EACT,SAAS,OAAO;GACd,IAAI,iBAAiB,sBACnB,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,MAAM,MAAM,MAAM,KAAK,CAAC;GAElF,KAAK,QAAQ,YAAY,kBAAkB,IAAI;GAC/C,OAAO;EACT;CACF;CAEA,kBAA0B,MAA6B;EACrD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,WACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ;GACb,KAAK,QAAQ,YACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,aACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,mBACX,OAAO,KAAK,QAAQ,YAAY,iBAAiB,IAAI;GAEvD,KAAK,QAAQ,cACX,OAAO;GAET,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAE5B,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;GAE9B,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,gBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAE5B,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,OACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,SACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,qBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;GAEjC,KAAK,QAAQ,oBACX,OAAO,KAAK,QAAQ,YAAY,yBAAyB,IAAI;EACjE;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAA6B;EAC7D,OAAO,KAAK,cAAc,KAAK,SAAS,MAAM;CAChD;CAEA,YAAoB,MAA6B;EAC/C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,KAAK;EACzC,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,mBAAmB,MAAM,CAAC,KAAK,CAAC;EAElE,OAAO;CACT;CAEA,WAAmB,MAA6B;EAC9C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,OAAO,UAAU,KAAK;EACzC,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;EAEhE,OAAO;CACT;CAEA,kBAA0B,MAA6B;EACrD,MAAM,WAAW,YAAY,KAAK,SAAS,EAAE;EAC7C,MAAM,MAAM,KAAK,YAAY,IAAI,QAAQ;EACzC,IAAI,CAAC,KACH,OAAO,KAAK,QAAQ,YAAY,mBAAmB,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC;EAEjF,IAAI,CAAC,KAAK,KAAK,MAAM,iBAAiB,GACpC,OAAO;EAGT,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,MAAM,KAAK,WAAW,MAAM,CAAC;GACnC,IAAI,QAAQ,MACV,OAAO;GAET,KAAK,KAAK,GAAG;EACf;EAEA,KAAK,OAAO,WAAW;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,KAAK,gBAAgB,IAAI,SAAS,EAAE,CAAC,SAAS,IAAI,KAAK,EAAE;EAE3D,KAAK,cAAc,KAAK,IAAI;EAC5B,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,WAAW,KAAK,CAAC;EACjC,UAAU;GACR,KAAK,cAAc,IAAI;EACzB;EACA,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,aAAqB,MAA6B;EAChD,MAAM,QAAQ,KAAK,KAAK,aAAa,WAAY,KAAK,KAAK,QAAmB,OAAO,KAAK,KAAK,KAAK;EACpG,OAAO,KAAK,MAAM,KAAK;CACzB;CAEA,gBAAwB,MAA6B;EACnD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,QAAQ,OAAO,MACxB,OAAO;EAET,MAAM,IAAI;EACV,MAAM,IAAI;EACV,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,MACX,OAAO,IAAI;GACb,KAAK,QAAQ,OACX,OAAO,IAAI;GACb,KAAK,QAAQ,UACX,OAAO,IAAI;EACf;EACA,OAAO;CACT;CAEA,UAAkB,MAA6B;EAC7C,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;EACpC,IAAI,SAAS,QAAQ,CAAC,MAAM,QAAQ,IAAI,GACtC,OAAO;EAET,OAAO,KAAK;CACd;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,MAAM,cAAc,KAAK,WAAW,QAAQ;EAC5C,IAAI,OAAO,WAAW,GACpB,OAAO,cAAA,IAAA;EAGT,MAAM,WAAW,KAAK,SAAS,EAAE,CAAC,WAAW,QAAQ,eAAe,KAAK,SAAS,EAAE,CAAC,WAAW,CAAC,KAAK,SAAS,EAAE;EACjH,MAAM,QAAQ,OAAO;EACrB,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,eAAe,UAAU;GAClC,UAAU,KAAK,CAAC;GAChB,KAAK,gBAAgB,aAAa,OAAO,EAAE;EAC7C;EACA,IAAI,kBAAkB;EACtB,OAAO,CAAC,iBAAiB;GACvB,MAAM,iBAAiB,KAAK,WAAW,MAAM,CAAC;GAC9C,IAAI,mBAAmB,MACrB,OAAO;GAET,IAAK,mBAAA,MAAmC,aACtC,OAAO,CAAC,cAAA,IAAA;GAEV,IAAI,iBAAiB,UAAU,SAAS;GACxC,OAAO,MACL,IAAI,UAAU,kBAAkB,QAAQ,GAAG;IACzC,UAAU,eAAe;IACzB,IAAI,CAAC,KAAK,KAAK,MAAM,mBAAmB,GACtC,OAAO;IAET,KAAK,gBAAgB,SAAS,iBAAiB,OAAO,UAAU,gBAAgB;IAChF,iBAAiB,UAAU,SAAS;IACpC;GACF,OAAO,IAAI,mBAAmB,GAAG;IAC/B,kBAAkB;IAClB;GACF,OAAO;IACL,UAAU,kBAAkB;IAC5B,KAAK,gBAAgB,SAAS,iBAAiB,OAAO,EAAE;IACxD;GACF;EAEJ;EACA,OAAO,cAAA,IAAA;CACT;CAEA,cAAsB,MAA6B;EACjD,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;EACrC,IAAI,UAAU,MACZ,OAAO;EAET,OAAQ,UAAA,IAAA,IAAA;CACV;CAEA,wBAAgC,IAAY,OAA8B;EACxE,IAAK,OAAO,QAAQ,aAAa,CAAC,SAAW,OAAO,QAAQ,YAAY,OACtE,OAAO,QAAA,IAAA;EAET,IAAI,OAAO,QAAQ,qBAAqB,CAAC,OACvC,OAAA;EAEF,OAAO;CACT;CAEA,iBAAyB,MAA6B;EACpD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,OAAA;EACX,MAAM,UAAU,KAAK,wBAAwB,KAAK,QAAQ,EAAE;EAC5D,IAAI,YAAY,MACd,OAAO;EAGT,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,OAAA;EACX,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,MAAM;IACf;GACF,KAAK,QAAQ;IACX,SAAS,MAAM;IACf;GACF,KAAK,QAAQ;IACX,SAAS,CAAC,MAAM;IAChB;GACF,KAAK,QAAQ;IACX,SAAS,OAAO;IAChB;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,YAAoB,MAA6B;EAC/C,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAGT,OADiB,QAAQ,IAAI,EAAE,MAAM,OAChB,KAAK,WAAW,QAAQ,YAAA,IAAA;CAC/C;CAEA,sBAA8B,MAA6B;EACzD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,IAAI;EACV,MAAM,IAAI;EACV,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,IAAI;IACb;GACF,KAAK,QAAQ;IACX,SAAS,IAAI;IACb;GACF,KAAK,QAAQ;IACX,SAAS,KAAK;IACd;GACF,KAAK,QAAQ;IACX,SAAS,KAAK;IACd;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,sBAA8B,MAA6B;EACzD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,SAAS,IAAe,EAAE;IACnC;GACF,KAAK,QAAQ;IACX,SAAS,CAAC,SAAS,IAAe,EAAE;IACpC;GACF,KAAK,QAAQ;IACX,SAAS,QAAQ,IAAI,EAAE,MAAM,KAAK,aAAa,IAAe,EAAa;IAC3E;GACF,KAAK,QAAQ;IACX,SAAS,QAAQ,IAAI,EAAE,MAAM,KAAK,CAAC,aAAa,IAAe,EAAa;IAC5E;GACF,KAAK,QAAQ;IACX,SAAS,aAAa,IAAe,EAAa;IAClD;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,YAAoB,MAA6B;EAC/C,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,YAAY,KAAK,WAAW,MAAM,CAAC;GACzC,IAAI,cAAc,MAChB,OAAO;GAET,IAAI,UAAU,WAAW,GACvB,OAAO;GAET,KAAK,KAAK,SAAS;EACrB;EACA,MAAM,SAAS,iBAAiB,IAAiB;EACjD,IAAI,WAAW,MAAM;GACnB,KAAK,QAAQ,YAAY,aAAa,MAAM,CAAC,OAAO,YAAY,CAAC,CAAC;GAClE,OAAO;EACT;EACA,OAAO;CACT;CAEA,aAAqB,MAA6B;EAChD,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;EACpC,IAAI,SAAS,MACX,OAAO;EAET,MAAM,SAAS,QAAQ,IAAI;EAC3B,IAAI,WAAW,MAAM;GACnB,KAAK,QAAQ,YAAY,kBAAkB,KAAK,SAAS,IAAI,CAAC,OAAA,EAAoB,CAAC,CAAC;GACpF,OAAO;EACT;EACA,OAAO;CACT;CAEA,WAAmB,MAA6B;EAC9C,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,YAAY,KAAK,WAAW,MAAM,CAAC;GACzC,IAAI,cAAc,MAChB,OAAO;GAET,KAAK,KAAK,SAAS;EACrB;EACA,OAAO,MAAM,IAAI;CACnB;CAEA,iBAAyB,MAA6B;EACpD,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;GACvC,IAAI,YAAY,MACd,OAAO;GAET,KAAK,KAAK,OAAO;EACnB;EACA,OAAO,IAAI,IAAI;CACjB;CAEA,UAAkB,MAA6B;EAC7C,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;EACvC,IAAI,YAAY,MACd,OAAO;EAET,OAAO,CAAC,OAAO;CACjB;CAEA,YAAoB,MAA6B;EAC/C,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,GACpB,OAAO,KAAK,QAAQ,YAAY,mBAAmB,KAAK,SAAS,EAAE;EAErE,OAAO,OAAO;CAChB;CAEA,mBAA2B,MAA6B;EACtD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,WACX,OAAO,SAAS,IAAe,EAAa;GAC9C,KAAK,QAAQ,kBACX,OAAO,gBAAgB,IAAe,EAAa;GACrD,KAAK,QAAQ,WACX,OAAO,QAAQ,IAAe,EAAa;GAC7C,KAAK,QAAQ,qBACX,OAAO,WAAW,IAAe,EAAa;EAClD;EACA,OAAO;CACT;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,OAAO,WAAW,QADF,eAAe,IACQ,CAAO;CAChD;CAEA,kBAA0B,MAA6B;EACrD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,MAAM,aADU,eAAe,IACZ,CAAA,CAAQ,KAAI,MAAK,OAAO,EAAE;EAC7C,OAAO,WAAW,WAAW,IAAI,WAAW,KAAK,MAAM,UAAU;CACnE;CAEA,YAAoB,MAA6B;EAC/C,MAAM,UAAU,KAAK,SAAS,SAAS;EACvC,MAAM,SAAS,KAAK,WAAW,MAAM,OAAO;EAC5C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,GACpB,OAAO;EAGT,MAAM,UAAU,eAAe,IAAI;EAEnC,IADmB,QAAQ,WAAW,SACtB;GACd,MAAM,SAAkB,CAAC;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;IAChC,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;IACrC,IAAI,UAAU,MACZ,OAAO;IAET,IAAI,MAAM,WAAW,GACnB,OAAO;IAET,OAAO,KAAK,KAAK;GACnB;GACA,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,WAAW,QAAQ;IAC5B,IAAI,QAAQ;IACZ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;KACvC,MAAM,OAAO,QAAQ,QAAQ;KAC7B,MAAM,WAAW,OAAO;KACxB,IAAI,CAAC,SAAS,UAAU,IAAI,GAAG;MAC7B,QAAQ;MACR;KACF;IACF;IACA,IAAI,OACF,OAAO,KAAK,OAAO;GAEvB;GACA,OAAO;EACT,OAAO;GACL,MAAM,WAAW,KAAK,WAAW,MAAM,CAAC;GACxC,IAAI,aAAa,MACf,OAAO;GAET,IAAI,SAAS,WAAW,GACtB,OAAO;GAGT,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,WAAW,QAAQ;IAC5B,MAAM,QAAQ,QAAQ,KAAI,MAAK,QAAQ,EAAE;IAEzC,IAAI,SAAS,UADO,MAAM,WAAW,IAAI,MAAM,KAAK,MAAM,KAAK,CAC7B,GAAG,OAAO,KAAK,OAAO;GAC1D;GACA,OAAO;EACT;CACF;CAEA,YAAoB,MAA6B;EAC/C,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,OAAO,OAAO,MAAmB;CACnC;CAEA,iBAAyB,MAA6B;EACpD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,MAAM,WAAW,CAAC;EAClB,KAAK,MAAM,WAAW,QAAmB;GACvC,IAAI,CAAC,KAAK,KAAK,MAAM,oBAAoB,GACvC,OAAO;GAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,OAAO;GAC9C,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;GACrC,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,UAAA,GACF,SAAS,KAAK,OAAO;EAEzB;EACA,OAAO,SAAS,WAAW,IAAI,YAAY;CAC7C;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAkB,CAAC;EACzB,MAAM,SAA2B,CAAC;EAElC,IAAI,eAAe;EAGnB,MAAM,wBAAiC;GACrC,OAAO,OAAO,SAAS,GAAG;IACxB,MAAM,MAAM,OAAO,OAAO,SAAS;IACnC,IAAI,IAAI,UAAU,IAAI,OAAO,SAAS,GAAG;KACvC,IAAI;KACJ,MAAM,YAAY,IAAI,OAAO,IAAI;KACjC,IAAI,CAAC,KAAK,KAAK,KAAK,SAAS,IAAI,UAAU,mBAAmB,GAC5D,OAAO;KAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,IAAI,SAAS;KACtE,eAAe,IAAI,UAAU;KAC7B,OAAO;IACT;IACA,OAAO,IAAI;GACb;GACA,OAAO;EACT;EAEA,OAAO,MAAM;GAEX,IAAI,gBAAgB,KAAK,SAAS,QAAQ;IACxC,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;IACvC,IAAI,YAAY,MACd,OAAO;IAET,OAAO,KAAK,OAAO;IACnB,IAAI,CAAC,gBAAgB,GACnB;IAEF;GACF;GAGA,MAAM,QAAQ,KAAK,SAAS;GAC5B,IAAI,MAAM,WAAW,QAAQ,SAAS;IACpC,MAAM,SAAS,KAAK,WAAW,OAAO,CAAC;IACvC,IAAI,WAAW,MACb,OAAO;IAET,IAAI,OAAO,WAAW,GAAG;KACvB,IAAI,CAAC,gBAAgB,GACnB;KAEF;IACF;IACA,IAAI,CAAC,KAAK,KAAK,OAAO,mBAAmB,GACvC,OAAO;IAET,OAAO,KAAK;KACV,SAAS;KACT;KACA,SAAS;IACX,CAAC;IACD,KAAK,gBAAgB,MAAM,SAAS,IAAI,OAAO,EAAE;IACjD;IACA;GACF;GAGA,MAAM,QAAQ,KAAK,cAAc,KAAK;GACtC,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,UAAA,GAAuB;IACzB,IAAI,CAAC,gBAAgB,GACnB;IAEF;GACF;GACA;EACF;EACA,OAAO,IAAI,MAAM;CACnB;CAEA,YAAoB,MAA6B;EAC/C,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;EACrC,IAAI,UAAU,MACZ,OAAO;EAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,KAAK;EAC5C,OAAA;CACF;CAEA,eAAuB,MAA6B;EAClD,MAAM,eAAe,KAAK,WAAW,MAAM,CAAC;EAC5C,IAAI,iBAAiB,MACnB,OAAO;EAET,MAAM,YAAY,KAAK,WAAW,QAAQ,oBAAoB,IAAI;EAClE,IAAI,UAAiB;EACrB,OAAO,MAAM;GACX,IAAI,CAAC,KAAK,KAAK,MAAM,kBAAkB,GACrC,OAAO;GAGT,KAAK,gBAAgB,KAAK,SAAS,IAAI,OAAO;GAC9C,IAAI,KAAK,WAAW,QAAQ,mBAAmB;IAC7C,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;IACpC,IAAI,SAAS,MACX,OAAO;IAET,IAAI,SAAA,GACF;GAEJ;GAEA,MAAM,OAAO,KAAK,WAAW,MAAM,SAAS;GAC5C,IAAI,SAAS,MACX,OAAO;GAET,IAAI,QAAQ,SAAS,IAAI,MAAM,GAC7B;GAEF,UAAU;EACZ;EAEA,OAAO;CACT;AACF;;AAiBA,IAAM,eAAN,MAAmB;CACjB,gBAAwB;CACxB,uBAAe,IAAI,IAA0B;CAC7C,YAAiD,CAAC;CAElD,aAAmB;EACjB,KAAK,UAAU,KAAK,KAAK,IAAI;EAC7B,KAAK,uBAAO,IAAI,IAAI;CACtB;CAEA,WAAiB;EACf,KAAK,OAAO,KAAK,UAAU,IAAI;CACjC;CAEA,SAAS,OAAe,OAAoB;EAC1C,MAAM,WAAW,KAAK,KAAK,IAAI,KAAK;EACpC,IAAI,UAAU;GACZ,SAAS,QAAQ;GACjB,SAAS;EACX,OACE,KAAK,KAAK,IAAI,OAAO;GAAE,IAAI,KAAK;GAAiB,SAAS;GAAG;EAAM,CAAC;CAExE;CAEA,UAAU,OAA6B;EACrC,OAAO,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,SAAS;CACxC;CAEA,qBAAqB,OAA2C;EAC9D,IAAI,MAAM,SAAS,GACjB,OAAO;EAET,MAAM,QAAkB,CAAC;EACzB,KAAK,MAAM,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,GAAG;GACrC,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK;GACnC,IAAI,YAAY,QACd,OAAO;GAET,MAAM,KAAK,GAAG,QAAQ,GAAG,GAAG,QAAQ,SAAS;EAC/C;EACA,OAAO,MAAM,KAAK,GAAG;CACvB;AACF"}
+{"version":3,"file":"evaluator.js","names":[],"sources":["../../../src/rslang/eval/evaluator.ts"],"sourcesContent":["/**\n * Module: AST evaluation - visitor-pattern evaluator for RS expressions.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { annotateError } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode } from '../error';\nimport { labelRSLangNode } from '../labels';\nimport { TokenID } from '../parser/token';\n\nimport { EvaluationCache, EvaluationMetadata } from './evaluation-cache';\nimport {\n  BOOL_INFINITY,\n  CalcInvalidDataError,\n  compare,\n  EmptySetV,\n  set,\n  SET_INFINITY,\n  tuple,\n  type Value,\n  VALUE_FALSE,\n  VALUE_TRUE,\n  type ValueContext\n} from './value';\nimport {\n  boolean,\n  cartesianProduct,\n  contains,\n  isSubsetOrEq,\n  projection,\n  reduce,\n  setDiff,\n  setIntersection,\n  setSymDiff,\n  setUnion\n} from './value-api';\n\n/** Maximum iterations to prevent infinite loops (recursion, quantifiers, etc.). */\nconst MAX_ITERATIONS = 1_000_000;\n\nconst TICK_PER_FUNCTION = 3;\nconst TICK_PER_RECURSION = 3;\nconst TICK_PER_IMPERATIVE = 1;\nconst TICK_PER_DECLARATIVE = 1;\nconst TICK_PER_QUANTIFIER = 1;\n\n/** AST context. */\nexport type ASTContext = Map<string, AstNode>;\n\n/** AST calculator - evaluates RS expressions via visitor pattern and provides updates via listeners.\n * Not safe for concurrent {@link run} calls on the same instance; use separate evaluators instead. */\nexport class Evaluator {\n  private reporter?: ErrorReporter;\n  private annotateErrors = false;\n  private disableCache = false;\n  private locals: LocalContext = new LocalContext();\n  private nodeMetadata: EvaluationMetadata = new EvaluationMetadata();\n  private evalCache: EvaluationCache = new EvaluationCache();\n  private callSiteStack: AstNode[] = [];\n  private context: ValueContext;\n  private treeContext: ASTContext;\n\n  public iterationCounter = 0;\n\n  /** Cache hits in the current evaluation run (for tests/diagnostics). */\n  public get cacheHits(): number {\n    return this.evalCache.hits;\n  }\n\n  constructor(context: ValueContext, astContext: ASTContext) {\n    this.treeContext = astContext;\n    this.context = context;\n  }\n\n  public run(\n    ast: AstNode,\n    reporter?: ErrorReporter,\n    annotateErrors: boolean = false,\n    disableCache: boolean = false\n  ): Value | null {\n    if (ast.hasError) {\n      return null;\n    }\n    this.reporter = reporter;\n    this.annotateErrors = annotateErrors;\n    this.disableCache = disableCache;\n    this.clear();\n    return this.dispatchVisit(ast);\n  }\n\n  private clear(): void {\n    this.locals = new LocalContext();\n    this.evalCache.clear();\n    this.callSiteStack = [];\n    this.iterationCounter = 0;\n  }\n\n  private errorNode(node: AstNode): AstNode {\n    if (this.callSiteStack.length > 0) {\n      return this.callSiteStack[this.callSiteStack.length - 1];\n    }\n    return node;\n  }\n\n  private onError(code: RSErrorCode, node: AstNode, params?: string[]): null {\n    const target = this.errorNode(node);\n    this.reporter?.({ code, from: target.from, to: target.to, params });\n    if (this.annotateErrors) {\n      annotateError(target, code, params);\n    }\n    return null;\n  }\n\n  private tick(node: AstNode, counter: number = 1): boolean {\n    this.iterationCounter += counter;\n    if (this.iterationCounter > MAX_ITERATIONS) {\n      this.onError(RSErrorCode.iterationsLimit, node, [String(MAX_ITERATIONS)]);\n      return false;\n    }\n    return true;\n  }\n\n  private dispatchDeclare(node: AstNode, value: Value): void {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node, value);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node, value as Value[]);\n      case TokenID.NT_ARG_DECL:\n        return this.dispatchDeclare(node.children[0], value);\n    }\n  }\n\n  private declareLocal(node: AstNode, value: Value): void {\n    const alias = getNodeText(node);\n    this.locals.setLocal(alias, value);\n  }\n\n  private declareTuple(node: AstNode, value: Value[]): void {\n    for (let child = 0; child < node.children.length; child++) {\n      this.dispatchDeclare(node.children[child], value[child + 1]);\n    }\n  }\n\n  private dispatchVisit(node: AstNode): Value | null {\n    const info = this.nodeMetadata.get(node);\n    let stamp: string | null = null;\n    if (info.cacheable && !this.disableCache) {\n      stamp = this.locals.buildDependencyStamp(info.reads);\n      if (stamp !== null) {\n        const cached = this.evalCache.lookup(info.structuralKey, stamp);\n        if (cached !== undefined) {\n          return cached;\n        }\n      }\n    }\n\n    try {\n      const result = this.dispatchVisitImpl(node);\n      if (!this.disableCache && result !== null && info.cacheable && stamp !== null) {\n        this.evalCache.store(info.structuralKey, stamp, result);\n      }\n      return result;\n    } catch (error) {\n      if (error instanceof CalcInvalidDataError) {\n        return this.onError(RSErrorCode.calcInvalidData, node, [error.left, error.right, labelRSLangNode(node)]);\n      }\n      this.onError(RSErrorCode.calcUnknownError, node);\n      return null;\n    }\n  }\n\n  private dispatchVisitImpl(node: AstNode): Value | null {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n        return this.visitGlobal(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ID_LOCAL:\n      case TokenID.ID_RADICAL:\n        return this.visitLocal(node);\n\n      case TokenID.LIT_INTEGER:\n        return this.visitInteger(node);\n\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return this.onError(RSErrorCode.iterateInfinity, node);\n\n      case TokenID.LIT_EMPTYSET:\n        return EmptySetV;\n\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n        return this.visitArithmetic(node);\n\n      case TokenID.CARD:\n        return this.visitCard(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\n      case TokenID.BOOLEAN:\n        return this.visitBoolean(node);\n\n      case TokenID.NT_TUPLE:\n        return this.visitTuple(node);\n\n      case TokenID.NT_ENUMERATION:\n        return this.visitEnumeration(node);\n\n      case TokenID.BOOL:\n        return this.visitBool(node);\n\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.BIGPR:\n        return this.visitProjectSet(node);\n\n      case TokenID.SMALLPR:\n        return this.visitProjectTuple(node);\n\n      case TokenID.FILTER:\n        return this.visitFilter(node);\n\n      case TokenID.REDUCE:\n        return this.visitReduce(node);\n\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitDeclarative(node);\n\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.ASSIGN:\n        return this.visitAssign(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.onError(RSErrorCode.calculationNotSupported, node);\n    }\n    return null;\n  }\n\n  private visitChild(node: AstNode, index: number): Value | null {\n    return this.dispatchVisit(node.children[index]);\n  }\n\n  private visitGlobal(node: AstNode): Value | null {\n    const alias = getNodeText(node);\n    const value = this.context.get(alias) ?? null;\n    if (value === null) {\n      return this.onError(RSErrorCode.calcGlobalMissing, node, [alias]);\n    }\n    return value;\n  }\n\n  private visitLocal(node: AstNode): Value | null {\n    const alias = getNodeText(node);\n    const value = this.locals.findLocal(alias);\n    if (value === null) {\n      return this.onError(RSErrorCode.localUndeclared, node, [alias]);\n    }\n    return value;\n  }\n\n  private visitFunctionCall(node: AstNode): Value | null {\n    const funcName = getNodeText(node.children[0]);\n    const ast = this.treeContext.get(funcName);\n    if (!ast) {\n      return this.onError(RSErrorCode.calcGlobalMissing, node.children[0], [funcName]);\n    }\n    if (!this.tick(node, TICK_PER_FUNCTION)) {\n      return null;\n    }\n\n    const args: Value[] = [];\n    for (let i = 1; i < node.children.length; i++) {\n      const arg = this.visitChild(node, i);\n      if (arg === null) {\n        return null;\n      }\n      args.push(arg);\n    }\n\n    this.locals.startScope();\n    for (let i = 0; i < args.length; i++) {\n      this.dispatchDeclare(ast.children[0].children[i], args[i]);\n    }\n    this.callSiteStack.push(node);\n    let result: Value | null;\n    try {\n      result = this.visitChild(ast, 1);\n    } finally {\n      this.callSiteStack.pop();\n    }\n    this.locals.endScope();\n    return result;\n  }\n\n  private visitInteger(node: AstNode): Value | null {\n    const value = node.data.dataType === 'number' ? (node.data.value as number) : Number(node.data.value);\n    return Math.floor(value);\n  }\n\n  private visitArithmetic(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    const v2 = this.visitChild(node, 1);\n    if (v1 === null || v2 === null) {\n      return null;\n    }\n    const a = v1 as number;\n    const b = v2 as number;\n    switch (node.typeID) {\n      case TokenID.PLUS:\n        return a + b;\n      case TokenID.MINUS:\n        return a - b;\n      case TokenID.MULTIPLY:\n        return a * b;\n    }\n    return null;\n  }\n\n  private visitCard(node: AstNode): Value | null {\n    const base = this.visitChild(node, 0);\n    if (base === null || !Array.isArray(base)) {\n      return null;\n    }\n    return base.length;\n  }\n\n  private visitQuantifier(node: AstNode): Value | null {\n    const domain = this.visitChild(node, 1) as Value[];\n    if (domain === null) {\n      return null;\n    }\n    const isUniversal = node.typeID === TokenID.QUANTOR_UNIVERSAL;\n    if (domain.length === 0) {\n      return isUniversal ? VALUE_TRUE : VALUE_FALSE;\n    }\n\n    const varNodes = node.children[0].typeID === TokenID.NT_ENUM_DECL ? node.children[0].children : [node.children[0]];\n    const count = domain.length;\n    const iterators: number[] = [];\n    for (const declaration of varNodes) {\n      iterators.push(0);\n      this.dispatchDeclare(declaration, domain[0]);\n    }\n    let finishIteration = false;\n    while (!finishIteration) {\n      const iterationValue = this.visitChild(node, 2);\n      if (iterationValue === null) {\n        return null;\n      }\n      if ((iterationValue === VALUE_TRUE) !== isUniversal) {\n        return !isUniversal ? VALUE_TRUE : VALUE_FALSE;\n      }\n      let incrementIndex = iterators.length - 1;\n      while (true) {\n        if (iterators[incrementIndex] < count - 1) {\n          iterators[incrementIndex]++;\n          if (!this.tick(node, TICK_PER_QUANTIFIER)) {\n            return null;\n          }\n          this.dispatchDeclare(varNodes[incrementIndex], domain[iterators[incrementIndex]]);\n          incrementIndex = iterators.length - 1;\n          break;\n        } else if (incrementIndex === 0) {\n          finishIteration = true;\n          break;\n        } else {\n          iterators[incrementIndex] = 0;\n          this.dispatchDeclare(varNodes[incrementIndex], domain[0]);\n          incrementIndex--;\n        }\n      }\n    }\n    return isUniversal ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitNegation(node: AstNode): Value | null {\n    const value = this.visitChild(node, 0);\n    if (value === null) {\n      return null;\n    }\n    return (value as number) === VALUE_TRUE ? VALUE_FALSE : VALUE_TRUE;\n  }\n\n  private tryEvaluateFromFirstArg(op: number, first: boolean): Value | null {\n    if ((op === TokenID.LOGIC_AND && !first) || (op === TokenID.LOGIC_OR && first)) {\n      return first ? VALUE_TRUE : VALUE_FALSE;\n    }\n    if (op === TokenID.LOGIC_IMPLICATION && !first) {\n      return VALUE_TRUE;\n    }\n    return null;\n  }\n\n  private visitLogicBinary(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const b1 = v1 === VALUE_TRUE;\n    const attempt = this.tryEvaluateFromFirstArg(node.typeID, b1);\n    if (attempt !== null) {\n      return attempt;\n    }\n\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const b2 = v2 === VALUE_TRUE;\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.LOGIC_AND:\n        result = b1 && b2;\n        break;\n      case TokenID.LOGIC_OR:\n        result = b1 || b2;\n        break;\n      case TokenID.LOGIC_IMPLICATION:\n        result = !b1 || b2;\n        break;\n      case TokenID.LOGIC_EQUIVALENT:\n        result = b1 === b2;\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitEquals(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const areEqual = compare(v1, v2) === 0;\n    return areEqual === (node.typeID !== TokenID.NOTEQUAL) ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitIntegerPredicate(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const a = v1 as number;\n    const b = v2 as number;\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.GREATER:\n        result = a > b;\n        break;\n      case TokenID.LESSER:\n        result = a < b;\n        break;\n      case TokenID.GREATER_OR_EQ:\n        result = a >= b;\n        break;\n      case TokenID.LESSER_OR_EQ:\n        result = a <= b;\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitSetexprPredicate(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.SET_IN:\n        result = contains(v2 as Value[], v1);\n        break;\n      case TokenID.SET_NOT_IN:\n        result = !contains(v2 as Value[], v1);\n        break;\n      case TokenID.SUBSET:\n        result = compare(v1, v2) !== 0 && isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      case TokenID.NOT_SUBSET:\n        result = compare(v1, v2) === 0 || !isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      case TokenID.SUBSET_OR_EQ:\n        result = isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitDecart(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const component = this.visitChild(node, i) as Value[];\n      if (component === null) {\n        return null;\n      }\n      if (component.length === 0) {\n        return EmptySetV;\n      }\n      args.push(component);\n    }\n    const result = cartesianProduct(args as Value[][]);\n    if (result === null) {\n      this.onError(RSErrorCode.setOverflow, node, [String(SET_INFINITY)]);\n      return null;\n    }\n    return result;\n  }\n\n  private visitBoolean(node: AstNode): Value | null {\n    const base = this.visitChild(node, 0) as Value[];\n    if (base === null) {\n      return null;\n    }\n    const result = boolean(base);\n    if (result === null) {\n      this.onError(RSErrorCode.booleanBaseLimit, node.children[0], [String(BOOL_INFINITY)]);\n      return null;\n    }\n    return result;\n  }\n\n  private visitTuple(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const component = this.visitChild(node, i);\n      if (component === null) {\n        return null;\n      }\n      args.push(component);\n    }\n    return tuple(args);\n  }\n\n  private visitEnumeration(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const element = this.visitChild(node, i);\n      if (element === null) {\n        return null;\n      }\n      args.push(element);\n    }\n    return set(args);\n  }\n\n  private visitBool(node: AstNode): Value | null {\n    const element = this.visitChild(node, 0);\n    if (element === null) {\n      return null;\n    }\n    return [element];\n  }\n\n  private visitDebool(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0) as Value[];\n    if (target === null) {\n      return null;\n    }\n    if (target.length !== 1) {\n      return this.onError(RSErrorCode.calcInvalidDebool, node.children[0]);\n    }\n    return target[0];\n  }\n\n  private visitSetexprBinary(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    switch (node.typeID) {\n      case TokenID.SET_UNION:\n        return setUnion(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_INTERSECTION:\n        return setIntersection(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_MINUS:\n        return setDiff(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return setSymDiff(v1 as Value[], v2 as Value[]);\n    }\n    return null;\n  }\n\n  private visitProjectSet(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0);\n    if (target === null) {\n      return null;\n    }\n    const indices = getNodeIndices(node);\n    return projection(target as Value[][], indices);\n  }\n\n  private visitProjectTuple(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0) as Value[];\n    if (target === null) {\n      return null;\n    }\n    const indices = getNodeIndices(node);\n    const components = indices.map(i => target[i]);\n    return components.length === 1 ? components[0] : tuple(components);\n  }\n\n  private visitFilter(node: AstNode): Value | null {\n    const lastIdx = node.children.length - 1;\n    const argVal = this.visitChild(node, lastIdx) as Value[][];\n    if (argVal === null) {\n      return null;\n    }\n    if (argVal.length === 0) {\n      return EmptySetV;\n    }\n\n    const indices = getNodeIndices(node);\n    const tupleParam = indices.length === lastIdx;\n    if (tupleParam) {\n      const params: Value[] = [];\n      for (let i = 0; i < lastIdx; i++) {\n        const param = this.visitChild(node, i) as Value[];\n        if (param === null) {\n          return null;\n        }\n        if (param.length === 0) {\n          return EmptySetV;\n        }\n        params.push(param);\n      }\n      const result: Value[] = [];\n      for (const element of argVal) {\n        let valid = true;\n        for (let j = 0; j < indices.length; j++) {\n          const comp = element[indices[j]];\n          const paramSet = params[j] as Value[];\n          if (!contains(paramSet, comp)) {\n            valid = false;\n            break;\n          }\n        }\n        if (valid) {\n          result.push(element);\n        }\n      }\n      return result;\n    } else {\n      const paramVal = this.visitChild(node, 0) as Value[];\n      if (paramVal === null) {\n        return null;\n      }\n      if (paramVal.length === 0) {\n        return EmptySetV;\n      }\n\n      const result: Value[] = [];\n      for (const element of argVal) {\n        const comps = indices.map(i => element[i]);\n        const testElement = comps.length === 1 ? comps[0] : tuple(comps);\n        if (contains(paramVal, testElement)) result.push(element);\n      }\n      return result;\n    }\n  }\n\n  private visitReduce(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0);\n    if (target === null) {\n      return null;\n    }\n    return reduce(target as Value[][]);\n  }\n\n  private visitDeclarative(node: AstNode): Value | null {\n    const domain = this.visitChild(node, 1);\n    if (domain === null) {\n      return null;\n    }\n\n    const elements = [];\n    for (const element of domain as Value[]) {\n      if (!this.tick(node, TICK_PER_DECLARATIVE)) {\n        return null;\n      }\n      this.dispatchDeclare(node.children[0], element);\n      const value = this.visitChild(node, 2);\n      if (value === null) {\n        return null;\n      }\n      if (value === VALUE_TRUE) {\n        elements.push(element);\n      }\n    }\n    return elements.length === 0 ? EmptySetV : elements;\n  }\n\n  private visitImperative(node: AstNode): Value | null {\n    const result: Value[] = [];\n    const frames: IterationFrame[] = [];\n\n    let currentChild = 1;\n\n    // Advance to next iteration\n    const advanceIterator = (): boolean => {\n      while (frames.length > 0) {\n        const top = frames[frames.length - 1];\n        if (top.valueID < top.domain.length - 1) {\n          top.valueID++;\n          const nextValue = top.domain[top.valueID];\n          if (!this.tick(node.children[top.childID], TICK_PER_IMPERATIVE)) {\n            return false;\n          }\n          this.dispatchDeclare(node.children[top.childID].children[0], nextValue);\n          currentChild = top.childID + 1;\n          return true;\n        }\n        frames.pop();\n      }\n      return false;\n    };\n\n    while (true) {\n      // Iteration end - create element and pop up stack\n      if (currentChild >= node.children.length) {\n        const element = this.visitChild(node, 0);\n        if (element === null) {\n          return null;\n        }\n        result.push(element);\n        if (!advanceIterator()) {\n          break;\n        }\n        continue;\n      }\n\n      // Iteration node\n      const child = node.children[currentChild];\n      if (child.typeID === TokenID.ITERATE) {\n        const domain = this.visitChild(child, 1) as Value[];\n        if (domain === null) {\n          return null;\n        }\n        if (domain.length === 0) {\n          if (!advanceIterator()) {\n            break;\n          }\n          continue;\n        }\n        if (!this.tick(child, TICK_PER_IMPERATIVE)) {\n          return null;\n        }\n        frames.push({\n          childID: currentChild,\n          domain,\n          valueID: 0\n        });\n        this.dispatchDeclare(child.children[0], domain[0]);\n        currentChild++;\n        continue;\n      }\n\n      // Guard expression\n      const value = this.dispatchVisit(child);\n      if (value === null) {\n        return null;\n      }\n      if (value === VALUE_FALSE) {\n        if (!advanceIterator()) {\n          break;\n        }\n        continue;\n      }\n      currentChild++;\n    }\n    return set(result);\n  }\n\n  private visitAssign(node: AstNode): Value | null {\n    const value = this.visitChild(node, 1);\n    if (value === null) {\n      return null;\n    }\n    this.dispatchDeclare(node.children[0], value);\n    return VALUE_TRUE;\n  }\n\n  private visitRecursion(node: AstNode): Value | null {\n    const initialValue = this.visitChild(node, 1);\n    if (initialValue === null) {\n      return null;\n    }\n    const bodyIndex = node.typeID === TokenID.NT_RECURSIVE_FULL ? 3 : 2;\n    let current: Value = initialValue;\n    while (true) {\n      if (!this.tick(node, TICK_PER_RECURSION)) {\n        return null;\n      }\n\n      this.dispatchDeclare(node.children[0], current);\n      if (node.typeID === TokenID.NT_RECURSIVE_FULL) {\n        const pred = this.visitChild(node, 2);\n        if (pred === null) {\n          return null;\n        }\n        if (pred !== VALUE_TRUE) {\n          break;\n        }\n      }\n\n      const next = this.visitChild(node, bodyIndex);\n      if (next === null) {\n        return null;\n      }\n      if (compare(current, next) === 0) {\n        break;\n      }\n      current = next;\n    }\n\n    return current;\n  }\n}\n\n/** Imperative iteration block data. */\ninterface IterationFrame {\n  childID: number;\n  domain: Value[];\n  valueID: number;\n}\n\n/** Local variable binding with version for cache invalidation. */\ninterface LocalBinding {\n  id: number;\n  version: number;\n  value: Value;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  private nextBindingId = 1;\n  private data = new Map<string, LocalBinding>();\n  private callStack: Map<string, LocalBinding>[] = [];\n\n  startScope(): void {\n    this.callStack.push(this.data);\n    this.data = new Map();\n  }\n\n  endScope(): void {\n    this.data = this.callStack.pop()!;\n  }\n\n  setLocal(alias: string, value: Value): void {\n    const existing = this.data.get(alias);\n    if (existing) {\n      existing.value = value;\n      existing.version++;\n    } else {\n      this.data.set(alias, { id: this.nextBindingId++, version: 0, value });\n    }\n  }\n\n  findLocal(alias: string): Value | null {\n    return this.data.get(alias)?.value ?? null;\n  }\n\n  buildDependencyStamp(reads: ReadonlySet<string>): string | null {\n    if (reads.size === 0) {\n      return '';\n    }\n    const parts: string[] = [];\n    for (const alias of [...reads].sort()) {\n      const binding = this.data.get(alias);\n      if (binding === undefined) {\n        return null;\n      }\n      parts.push(`${binding.id}:${binding.version}`);\n    }\n    return parts.join('|');\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAsCA,MAAM,iBAAiB;AAEvB,MAAM,oBAAoB;AAC1B,MAAM,qBAAqB;AAC3B,MAAM,sBAAsB;AAC5B,MAAM,uBAAuB;AAC7B,MAAM,sBAAsB;;;AAO5B,IAAa,YAAb,MAAuB;CACrB;CACA,iBAAyB;CACzB,eAAuB;CACvB,SAA+B,IAAI,aAAa;CAChD,eAA2C,IAAI,mBAAmB;CAClE,YAAqC,IAAI,gBAAgB;CACzD,gBAAmC,CAAC;CACpC;CACA;CAEA,mBAA0B;;CAG1B,IAAW,YAAoB;EAC7B,OAAO,KAAK,UAAU;CACxB;CAEA,YAAY,SAAuB,YAAwB;EACzD,KAAK,cAAc;EACnB,KAAK,UAAU;CACjB;CAEA,IACE,KACA,UACA,iBAA0B,OAC1B,eAAwB,OACV;EACd,IAAI,IAAI,UACN,OAAO;EAET,KAAK,WAAW;EAChB,KAAK,iBAAiB;EACtB,KAAK,eAAe;EACpB,KAAK,MAAM;EACX,OAAO,KAAK,cAAc,GAAG;CAC/B;CAEA,QAAsB;EACpB,KAAK,SAAS,IAAI,aAAa;EAC/B,KAAK,UAAU,MAAM;EACrB,KAAK,gBAAgB,CAAC;EACtB,KAAK,mBAAmB;CAC1B;CAEA,UAAkB,MAAwB;EACxC,IAAI,KAAK,cAAc,SAAS,GAC9B,OAAO,KAAK,cAAc,KAAK,cAAc,SAAS;EAExD,OAAO;CACT;CAEA,QAAgB,MAAmB,MAAe,QAAyB;EACzE,MAAM,SAAS,KAAK,UAAU,IAAI;EAClC,KAAK,WAAW;GAAE;GAAM,MAAM,OAAO;GAAM,IAAI,OAAO;GAAI;EAAO,CAAC;EAClE,IAAI,KAAK,gBACP,cAAc,QAAQ,MAAM,MAAM;EAEpC,OAAO;CACT;CAEA,KAAa,MAAe,UAAkB,GAAY;EACxD,KAAK,oBAAoB;EACzB,IAAI,KAAK,mBAAmB,gBAAgB;GAC1C,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,OAAO,cAAc,CAAC,CAAC;GACxE,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBAAwB,MAAe,OAAoB;EACzD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,MAAM,KAAK;GACtC,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,MAAM,KAAgB;GACjD,KAAK,QAAQ,aACX,OAAO,KAAK,gBAAgB,KAAK,SAAS,IAAI,KAAK;EACvD;CACF;CAEA,aAAqB,MAAe,OAAoB;EACtD,MAAM,QAAQ,YAAY,IAAI;EAC9B,KAAK,OAAO,SAAS,OAAO,KAAK;CACnC;CAEA,aAAqB,MAAe,OAAsB;EACxD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE;CAE/D;CAEA,cAAsB,MAA6B;EACjD,MAAM,OAAO,KAAK,aAAa,IAAI,IAAI;EACvC,IAAI,QAAuB;EAC3B,IAAI,KAAK,aAAa,CAAC,KAAK,cAAc;GACxC,QAAQ,KAAK,OAAO,qBAAqB,KAAK,KAAK;GACnD,IAAI,UAAU,MAAM;IAClB,MAAM,SAAS,KAAK,UAAU,OAAO,KAAK,eAAe,KAAK;IAC9D,IAAI,WAAW,QACb,OAAO;GAEX;EACF;EAEA,IAAI;GACF,MAAM,SAAS,KAAK,kBAAkB,IAAI;GAC1C,IAAI,CAAC,KAAK,gBAAgB,WAAW,QAAQ,KAAK,aAAa,UAAU,MACvE,KAAK,UAAU,MAAM,KAAK,eAAe,OAAO,MAAM;GAExD,OAAO;EACT,SAAS,OAAO;GACd,IAAI,iBAAiB,sBACnB,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM;IAAC,MAAM;IAAM,MAAM;IAAO,gBAAgB,IAAI;GAAC,CAAC;GAEzG,KAAK,QAAQ,YAAY,kBAAkB,IAAI;GAC/C,OAAO;EACT;CACF;CAEA,kBAA0B,MAA6B;EACrD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,WACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ;GACb,KAAK,QAAQ,YACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,aACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,mBACX,OAAO,KAAK,QAAQ,YAAY,iBAAiB,IAAI;GAEvD,KAAK,QAAQ,cACX,OAAO;GAET,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAE5B,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;GAE9B,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,gBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAE5B,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,OACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,SACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,qBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;GAEjC,KAAK,QAAQ,oBACX,OAAO,KAAK,QAAQ,YAAY,yBAAyB,IAAI;EACjE;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAA6B;EAC7D,OAAO,KAAK,cAAc,KAAK,SAAS,MAAM;CAChD;CAEA,YAAoB,MAA6B;EAC/C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,KAAK;EACzC,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,mBAAmB,MAAM,CAAC,KAAK,CAAC;EAElE,OAAO;CACT;CAEA,WAAmB,MAA6B;EAC9C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,OAAO,UAAU,KAAK;EACzC,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;EAEhE,OAAO;CACT;CAEA,kBAA0B,MAA6B;EACrD,MAAM,WAAW,YAAY,KAAK,SAAS,EAAE;EAC7C,MAAM,MAAM,KAAK,YAAY,IAAI,QAAQ;EACzC,IAAI,CAAC,KACH,OAAO,KAAK,QAAQ,YAAY,mBAAmB,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC;EAEjF,IAAI,CAAC,KAAK,KAAK,MAAM,iBAAiB,GACpC,OAAO;EAGT,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,MAAM,KAAK,WAAW,MAAM,CAAC;GACnC,IAAI,QAAQ,MACV,OAAO;GAET,KAAK,KAAK,GAAG;EACf;EAEA,KAAK,OAAO,WAAW;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,KAAK,gBAAgB,IAAI,SAAS,EAAE,CAAC,SAAS,IAAI,KAAK,EAAE;EAE3D,KAAK,cAAc,KAAK,IAAI;EAC5B,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,WAAW,KAAK,CAAC;EACjC,UAAU;GACR,KAAK,cAAc,IAAI;EACzB;EACA,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,aAAqB,MAA6B;EAChD,MAAM,QAAQ,KAAK,KAAK,aAAa,WAAY,KAAK,KAAK,QAAmB,OAAO,KAAK,KAAK,KAAK;EACpG,OAAO,KAAK,MAAM,KAAK;CACzB;CAEA,gBAAwB,MAA6B;EACnD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,QAAQ,OAAO,MACxB,OAAO;EAET,MAAM,IAAI;EACV,MAAM,IAAI;EACV,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,MACX,OAAO,IAAI;GACb,KAAK,QAAQ,OACX,OAAO,IAAI;GACb,KAAK,QAAQ,UACX,OAAO,IAAI;EACf;EACA,OAAO;CACT;CAEA,UAAkB,MAA6B;EAC7C,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;EACpC,IAAI,SAAS,QAAQ,CAAC,MAAM,QAAQ,IAAI,GACtC,OAAO;EAET,OAAO,KAAK;CACd;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,MAAM,cAAc,KAAK,WAAW,QAAQ;EAC5C,IAAI,OAAO,WAAW,GACpB,OAAO,cAAA,IAAA;EAGT,MAAM,WAAW,KAAK,SAAS,EAAE,CAAC,WAAW,QAAQ,eAAe,KAAK,SAAS,EAAE,CAAC,WAAW,CAAC,KAAK,SAAS,EAAE;EACjH,MAAM,QAAQ,OAAO;EACrB,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,eAAe,UAAU;GAClC,UAAU,KAAK,CAAC;GAChB,KAAK,gBAAgB,aAAa,OAAO,EAAE;EAC7C;EACA,IAAI,kBAAkB;EACtB,OAAO,CAAC,iBAAiB;GACvB,MAAM,iBAAiB,KAAK,WAAW,MAAM,CAAC;GAC9C,IAAI,mBAAmB,MACrB,OAAO;GAET,IAAK,mBAAA,MAAmC,aACtC,OAAO,CAAC,cAAA,IAAA;GAEV,IAAI,iBAAiB,UAAU,SAAS;GACxC,OAAO,MACL,IAAI,UAAU,kBAAkB,QAAQ,GAAG;IACzC,UAAU,eAAe;IACzB,IAAI,CAAC,KAAK,KAAK,MAAM,mBAAmB,GACtC,OAAO;IAET,KAAK,gBAAgB,SAAS,iBAAiB,OAAO,UAAU,gBAAgB;IAChF,iBAAiB,UAAU,SAAS;IACpC;GACF,OAAO,IAAI,mBAAmB,GAAG;IAC/B,kBAAkB;IAClB;GACF,OAAO;IACL,UAAU,kBAAkB;IAC5B,KAAK,gBAAgB,SAAS,iBAAiB,OAAO,EAAE;IACxD;GACF;EAEJ;EACA,OAAO,cAAA,IAAA;CACT;CAEA,cAAsB,MAA6B;EACjD,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;EACrC,IAAI,UAAU,MACZ,OAAO;EAET,OAAQ,UAAA,IAAA,IAAA;CACV;CAEA,wBAAgC,IAAY,OAA8B;EACxE,IAAK,OAAO,QAAQ,aAAa,CAAC,SAAW,OAAO,QAAQ,YAAY,OACtE,OAAO,QAAA,IAAA;EAET,IAAI,OAAO,QAAQ,qBAAqB,CAAC,OACvC,OAAA;EAEF,OAAO;CACT;CAEA,iBAAyB,MAA6B;EACpD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,OAAA;EACX,MAAM,UAAU,KAAK,wBAAwB,KAAK,QAAQ,EAAE;EAC5D,IAAI,YAAY,MACd,OAAO;EAGT,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,OAAA;EACX,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,MAAM;IACf;GACF,KAAK,QAAQ;IACX,SAAS,MAAM;IACf;GACF,KAAK,QAAQ;IACX,SAAS,CAAC,MAAM;IAChB;GACF,KAAK,QAAQ;IACX,SAAS,OAAO;IAChB;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,YAAoB,MAA6B;EAC/C,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAGT,OADiB,QAAQ,IAAI,EAAE,MAAM,OAChB,KAAK,WAAW,QAAQ,YAAA,IAAA;CAC/C;CAEA,sBAA8B,MAA6B;EACzD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,IAAI;EACV,MAAM,IAAI;EACV,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,IAAI;IACb;GACF,KAAK,QAAQ;IACX,SAAS,IAAI;IACb;GACF,KAAK,QAAQ;IACX,SAAS,KAAK;IACd;GACF,KAAK,QAAQ;IACX,SAAS,KAAK;IACd;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,sBAA8B,MAA6B;EACzD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,SAAS,IAAe,EAAE;IACnC;GACF,KAAK,QAAQ;IACX,SAAS,CAAC,SAAS,IAAe,EAAE;IACpC;GACF,KAAK,QAAQ;IACX,SAAS,QAAQ,IAAI,EAAE,MAAM,KAAK,aAAa,IAAe,EAAa;IAC3E;GACF,KAAK,QAAQ;IACX,SAAS,QAAQ,IAAI,EAAE,MAAM,KAAK,CAAC,aAAa,IAAe,EAAa;IAC5E;GACF,KAAK,QAAQ;IACX,SAAS,aAAa,IAAe,EAAa;IAClD;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,YAAoB,MAA6B;EAC/C,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,YAAY,KAAK,WAAW,MAAM,CAAC;GACzC,IAAI,cAAc,MAChB,OAAO;GAET,IAAI,UAAU,WAAW,GACvB,OAAO;GAET,KAAK,KAAK,SAAS;EACrB;EACA,MAAM,SAAS,iBAAiB,IAAiB;EACjD,IAAI,WAAW,MAAM;GACnB,KAAK,QAAQ,YAAY,aAAa,MAAM,CAAC,OAAO,YAAY,CAAC,CAAC;GAClE,OAAO;EACT;EACA,OAAO;CACT;CAEA,aAAqB,MAA6B;EAChD,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;EACpC,IAAI,SAAS,MACX,OAAO;EAET,MAAM,SAAS,QAAQ,IAAI;EAC3B,IAAI,WAAW,MAAM;GACnB,KAAK,QAAQ,YAAY,kBAAkB,KAAK,SAAS,IAAI,CAAC,OAAA,EAAoB,CAAC,CAAC;GACpF,OAAO;EACT;EACA,OAAO;CACT;CAEA,WAAmB,MAA6B;EAC9C,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,YAAY,KAAK,WAAW,MAAM,CAAC;GACzC,IAAI,cAAc,MAChB,OAAO;GAET,KAAK,KAAK,SAAS;EACrB;EACA,OAAO,MAAM,IAAI;CACnB;CAEA,iBAAyB,MAA6B;EACpD,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;GACvC,IAAI,YAAY,MACd,OAAO;GAET,KAAK,KAAK,OAAO;EACnB;EACA,OAAO,IAAI,IAAI;CACjB;CAEA,UAAkB,MAA6B;EAC7C,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;EACvC,IAAI,YAAY,MACd,OAAO;EAET,OAAO,CAAC,OAAO;CACjB;CAEA,YAAoB,MAA6B;EAC/C,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,GACpB,OAAO,KAAK,QAAQ,YAAY,mBAAmB,KAAK,SAAS,EAAE;EAErE,OAAO,OAAO;CAChB;CAEA,mBAA2B,MAA6B;EACtD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,WACX,OAAO,SAAS,IAAe,EAAa;GAC9C,KAAK,QAAQ,kBACX,OAAO,gBAAgB,IAAe,EAAa;GACrD,KAAK,QAAQ,WACX,OAAO,QAAQ,IAAe,EAAa;GAC7C,KAAK,QAAQ,qBACX,OAAO,WAAW,IAAe,EAAa;EAClD;EACA,OAAO;CACT;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,OAAO,WAAW,QADF,eAAe,IACQ,CAAO;CAChD;CAEA,kBAA0B,MAA6B;EACrD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,MAAM,aADU,eAAe,IACZ,CAAA,CAAQ,KAAI,MAAK,OAAO,EAAE;EAC7C,OAAO,WAAW,WAAW,IAAI,WAAW,KAAK,MAAM,UAAU;CACnE;CAEA,YAAoB,MAA6B;EAC/C,MAAM,UAAU,KAAK,SAAS,SAAS;EACvC,MAAM,SAAS,KAAK,WAAW,MAAM,OAAO;EAC5C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,GACpB,OAAO;EAGT,MAAM,UAAU,eAAe,IAAI;EAEnC,IADmB,QAAQ,WAAW,SACtB;GACd,MAAM,SAAkB,CAAC;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;IAChC,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;IACrC,IAAI,UAAU,MACZ,OAAO;IAET,IAAI,MAAM,WAAW,GACnB,OAAO;IAET,OAAO,KAAK,KAAK;GACnB;GACA,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,WAAW,QAAQ;IAC5B,IAAI,QAAQ;IACZ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;KACvC,MAAM,OAAO,QAAQ,QAAQ;KAC7B,MAAM,WAAW,OAAO;KACxB,IAAI,CAAC,SAAS,UAAU,IAAI,GAAG;MAC7B,QAAQ;MACR;KACF;IACF;IACA,IAAI,OACF,OAAO,KAAK,OAAO;GAEvB;GACA,OAAO;EACT,OAAO;GACL,MAAM,WAAW,KAAK,WAAW,MAAM,CAAC;GACxC,IAAI,aAAa,MACf,OAAO;GAET,IAAI,SAAS,WAAW,GACtB,OAAO;GAGT,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,WAAW,QAAQ;IAC5B,MAAM,QAAQ,QAAQ,KAAI,MAAK,QAAQ,EAAE;IAEzC,IAAI,SAAS,UADO,MAAM,WAAW,IAAI,MAAM,KAAK,MAAM,KAAK,CAC7B,GAAG,OAAO,KAAK,OAAO;GAC1D;GACA,OAAO;EACT;CACF;CAEA,YAAoB,MAA6B;EAC/C,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,OAAO,OAAO,MAAmB;CACnC;CAEA,iBAAyB,MAA6B;EACpD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,MAAM,WAAW,CAAC;EAClB,KAAK,MAAM,WAAW,QAAmB;GACvC,IAAI,CAAC,KAAK,KAAK,MAAM,oBAAoB,GACvC,OAAO;GAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,OAAO;GAC9C,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;GACrC,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,UAAA,GACF,SAAS,KAAK,OAAO;EAEzB;EACA,OAAO,SAAS,WAAW,IAAI,YAAY;CAC7C;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAkB,CAAC;EACzB,MAAM,SAA2B,CAAC;EAElC,IAAI,eAAe;EAGnB,MAAM,wBAAiC;GACrC,OAAO,OAAO,SAAS,GAAG;IACxB,MAAM,MAAM,OAAO,OAAO,SAAS;IACnC,IAAI,IAAI,UAAU,IAAI,OAAO,SAAS,GAAG;KACvC,IAAI;KACJ,MAAM,YAAY,IAAI,OAAO,IAAI;KACjC,IAAI,CAAC,KAAK,KAAK,KAAK,SAAS,IAAI,UAAU,mBAAmB,GAC5D,OAAO;KAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,IAAI,SAAS;KACtE,eAAe,IAAI,UAAU;KAC7B,OAAO;IACT;IACA,OAAO,IAAI;GACb;GACA,OAAO;EACT;EAEA,OAAO,MAAM;GAEX,IAAI,gBAAgB,KAAK,SAAS,QAAQ;IACxC,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;IACvC,IAAI,YAAY,MACd,OAAO;IAET,OAAO,KAAK,OAAO;IACnB,IAAI,CAAC,gBAAgB,GACnB;IAEF;GACF;GAGA,MAAM,QAAQ,KAAK,SAAS;GAC5B,IAAI,MAAM,WAAW,QAAQ,SAAS;IACpC,MAAM,SAAS,KAAK,WAAW,OAAO,CAAC;IACvC,IAAI,WAAW,MACb,OAAO;IAET,IAAI,OAAO,WAAW,GAAG;KACvB,IAAI,CAAC,gBAAgB,GACnB;KAEF;IACF;IACA,IAAI,CAAC,KAAK,KAAK,OAAO,mBAAmB,GACvC,OAAO;IAET,OAAO,KAAK;KACV,SAAS;KACT;KACA,SAAS;IACX,CAAC;IACD,KAAK,gBAAgB,MAAM,SAAS,IAAI,OAAO,EAAE;IACjD;IACA;GACF;GAGA,MAAM,QAAQ,KAAK,cAAc,KAAK;GACtC,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,UAAA,GAAuB;IACzB,IAAI,CAAC,gBAAgB,GACnB;IAEF;GACF;GACA;EACF;EACA,OAAO,IAAI,MAAM;CACnB;CAEA,YAAoB,MAA6B;EAC/C,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;EACrC,IAAI,UAAU,MACZ,OAAO;EAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,KAAK;EAC5C,OAAA;CACF;CAEA,eAAuB,MAA6B;EAClD,MAAM,eAAe,KAAK,WAAW,MAAM,CAAC;EAC5C,IAAI,iBAAiB,MACnB,OAAO;EAET,MAAM,YAAY,KAAK,WAAW,QAAQ,oBAAoB,IAAI;EAClE,IAAI,UAAiB;EACrB,OAAO,MAAM;GACX,IAAI,CAAC,KAAK,KAAK,MAAM,kBAAkB,GACrC,OAAO;GAGT,KAAK,gBAAgB,KAAK,SAAS,IAAI,OAAO;GAC9C,IAAI,KAAK,WAAW,QAAQ,mBAAmB;IAC7C,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;IACpC,IAAI,SAAS,MACX,OAAO;IAET,IAAI,SAAA,GACF;GAEJ;GAEA,MAAM,OAAO,KAAK,WAAW,MAAM,SAAS;GAC5C,IAAI,SAAS,MACX,OAAO;GAET,IAAI,QAAQ,SAAS,IAAI,MAAM,GAC7B;GAEF,UAAU;EACZ;EAEA,OAAO;CACT;AACF;;AAiBA,IAAM,eAAN,MAAmB;CACjB,gBAAwB;CACxB,uBAAe,IAAI,IAA0B;CAC7C,YAAiD,CAAC;CAElD,aAAmB;EACjB,KAAK,UAAU,KAAK,KAAK,IAAI;EAC7B,KAAK,uBAAO,IAAI,IAAI;CACtB;CAEA,WAAiB;EACf,KAAK,OAAO,KAAK,UAAU,IAAI;CACjC;CAEA,SAAS,OAAe,OAAoB;EAC1C,MAAM,WAAW,KAAK,KAAK,IAAI,KAAK;EACpC,IAAI,UAAU;GACZ,SAAS,QAAQ;GACjB,SAAS;EACX,OACE,KAAK,KAAK,IAAI,OAAO;GAAE,IAAI,KAAK;GAAiB,SAAS;GAAG;EAAM,CAAC;CAExE;CAEA,UAAU,OAA6B;EACrC,OAAO,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,SAAS;CACxC;CAEA,qBAAqB,OAA2C;EAC9D,IAAI,MAAM,SAAS,GACjB,OAAO;EAET,MAAM,QAAkB,CAAC;EACzB,KAAK,MAAM,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,GAAG;GACrC,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK;GACnC,IAAI,YAAY,QACd,OAAO;GAET,MAAM,KAAK,GAAG,QAAQ,GAAG,GAAG,QAAQ,SAAS;EAC/C;EACA,OAAO,MAAM,KAAK,GAAG;CACvB;AACF"}

package/dist/rslang/eval/value-api.js

@@ -1,2 +1,2 @@
-import { A as setUnion, C as printValue, D as setIntersection, E as setDiff, M as validateValue, N as valueStub, O as setNestedValue, S as normalizeValue, T as reduce, _ as extractValue, b as isTupleValue, g as convertPathToType, h as contains, j as testInvalid, k as setSymDiff, m as cartesianProduct, p as boolean, v as isSetValue, w as projection, x as makeDefaultValue, y as isSubsetOrEq } from "../../value-ybFBRuz6.js";
+import { A as setUnion, C as printValue, D as setIntersection, E as setDiff, M as validateValue, N as valueStub, O as setNestedValue, S as normalizeValue, T as reduce, _ as extractValue, b as isTupleValue, g as convertPathToType, h as contains, j as testInvalid, k as setSymDiff, m as cartesianProduct, p as boolean, v as isSetValue, w as projection, x as makeDefaultValue, y as isSubsetOrEq } from "../../value-COprb2Je.js";
 export { boolean, cartesianProduct, contains, convertPathToType, extractValue, isSetValue, isSubsetOrEq, isTupleValue, makeDefaultValue, normalizeValue, printValue, projection, reduce, setDiff, setIntersection, setNestedValue, setSymDiff, setUnion, testInvalid, validateValue, valueStub };

package/dist/rslang/eval/value.js

@@ -1,2 +1,2 @@
-import { a as SET_INFINITY, c as VALUE_TRUE, d as set, f as tuple, i as INVALID_ELEMENT, l as compare, n as CalcInvalidDataError, o as TUPLE_ID, r as EmptySetV, s as VALUE_FALSE, t as BOOL_INFINITY, u as makeValuePath } from "../../value-ybFBRuz6.js";
+import { a as SET_INFINITY, c as VALUE_TRUE, d as set, f as tuple, i as INVALID_ELEMENT, l as compare, n as CalcInvalidDataError, o as TUPLE_ID, r as EmptySetV, s as VALUE_FALSE, t as BOOL_INFINITY, u as makeValuePath } from "../../value-COprb2Je.js";
 export { BOOL_INFINITY, CalcInvalidDataError, EmptySetV, INVALID_ELEMENT, SET_INFINITY, TUPLE_ID, VALUE_FALSE, VALUE_TRUE, compare, makeValuePath, set, tuple };

package/dist/rslang/index.d.ts

@@ -1,13 +1,13 @@
 import { O as makeTypePath, b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "../typification-Dk-fisgO.js";
-import { i as RSErrorDescription, r as RSErrorCode } from "../error-deey7EiC.js";
-import { i as readTypeAnnotation, r as readErrorAnnotation } from "../ast-annotations-GOkbNN8F.js";
+import { i as RSErrorDescription, r as RSErrorCode } from "../error-DuqsZDL5.js";
+import { i as readTypeAnnotation, r as readErrorAnnotation } from "../ast-annotations-B4T8S2DS.js";
 import { d as ValuePath, l as Value, p as makeValuePath } from "../value-BduA_ZGp.js";
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-DFevxZyV.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-8tErfQcI.js";
 import { d as printValue } from "../value-api-B6T6f4Ia.js";
 import { t as parser } from "../parser-Bwd8LxJ1.js";
 import { t as TokenID } from "../token-DeXAmzwr.js";
 import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
-import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../analyzer-BliNe3pV.js";
+import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../analyzer-CvnbnrSX.js";
 import { n as ArgumentsType } from "../arguments-extractor-1acwjQNc.js";
 import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "../typification-parser-BBVx1RxP.js";
 import { n as TypificationNodeData, t as TypificationGraph } from "../typification-graph-6HcZ-rKH.js";

package/dist/rslang/index.js

@@ -2,7 +2,7 @@ import { readErrorAnnotation, readTypeAnnotation } from "./ast-annotations.js";
 import { RSErrorCode } from "./error.js";
 import { TokenID } from "./parser/token.js";
 import { AnyTypificationT, EmptySetT, LogicT, TypeClass, TypeID, makeTypePath } from "./semantic/typification.js";
-import { C as printValue, u as makeValuePath } from "../value-ybFBRuz6.js";
+import { C as printValue, u as makeValuePath } from "../value-COprb2Je.js";
 import { RSCalculator } from "./eval/calculator.js";
 import { parser } from "./parser/parser.js";
 import { ValueClass } from "./semantic/value-class.js";

package/dist/rslang/labels.js

@@ -35,6 +35,7 @@ const labelTokenRecord = {
 	[TokenID.NT_DECLARATIVE_EXPR]: "D{}",
 	[TokenID.NT_IMPERATIVE_EXPR]: "I{}",
 	[TokenID.NT_RECURSIVE_FULL]: "R{}",
+	[TokenID.NT_RECURSIVE_SHORT]: "R{}",
 	[TokenID.BIGPR]: "Pr1()",
 	[TokenID.SMALLPR]: "pr1()",
 	[TokenID.FILTER]: "Fi1[]()",

package/dist/rslang/labels.js.map

@@ -1 +1 @@
-{"version":3,"file":"labels.js","names":[],"sources":["../../src/rslang/labels.ts"],"sourcesContent":["import { type AstNodeBase } from '../parsing';\n\nimport { TokenID } from './parser/token';\nimport { type ExpressionType, TypeID } from './semantic/typification';\n\nconst INTEGER_TYPE_NAME = 'Z';\nconst ANY_TYPE_NAME = 'R0';\nconst LOGIC_TYPE_NAME = 'Logic';\n\nconst labelTokenRecord: Partial<Record<TokenID, string>> = {\n  [TokenID.DECART]: '×',\n  [TokenID.PUNCTUATION_PL]: '( )',\n  [TokenID.PUNCTUATION_SL]: '[ ]',\n  [TokenID.QUANTOR_UNIVERSAL]: '∀',\n  [TokenID.QUANTOR_EXISTS]: '∃',\n  [TokenID.LOGIC_NOT]: '¬',\n  [TokenID.LOGIC_AND]: '&',\n  [TokenID.LOGIC_OR]: '∨',\n  [TokenID.LOGIC_IMPLICATION]: '⇒',\n  [TokenID.LOGIC_EQUIVALENT]: '⇔',\n  [TokenID.LIT_EMPTYSET]: '∅',\n  [TokenID.LIT_WHOLE_NUMBERS]: 'Z',\n  [TokenID.MULTIPLY]: '*',\n  [TokenID.EQUAL]: '=',\n  [TokenID.NOTEQUAL]: '≠',\n  [TokenID.GREATER_OR_EQ]: '≥',\n  [TokenID.LESSER_OR_EQ]: '≤',\n  [TokenID.SET_IN]: '∈',\n  [TokenID.SET_NOT_IN]: '∉',\n  [TokenID.SUBSET_OR_EQ]: '⊆',\n  [TokenID.SUBSET]: '⊂',\n  [TokenID.NOT_SUBSET]: '⊄',\n  [TokenID.SET_INTERSECTION]: '∩',\n  [TokenID.SET_UNION]: '∪',\n  [TokenID.SET_MINUS]: '\\\\',\n  [TokenID.SET_SYMMETRIC_MINUS]: '∆',\n  [TokenID.BOOLEAN]: 'ℬ()',\n  [TokenID.NT_DECLARATIVE_EXPR]: 'D{}',\n  [TokenID.NT_IMPERATIVE_EXPR]: 'I{}',\n  [TokenID.NT_RECURSIVE_FULL]: 'R{}',\n  [TokenID.BIGPR]: 'Pr1()',\n  [TokenID.SMALLPR]: 'pr1()',\n  [TokenID.FILTER]: 'Fi1[]()',\n  [TokenID.REDUCE]: 'red()',\n  [TokenID.CARD]: 'card()',\n  [TokenID.BOOL]: 'bool()',\n  [TokenID.DEBOOL]: 'debool()',\n  [TokenID.ASSIGN]: ':=',\n  [TokenID.ITERATE]: ':∈'\n};\n\n/** Retrieves label for {@link TokenID}. */\nexport function labelToken(id: TokenID): string {\n  const text = labelTokenRecord[id];\n  return text ?? 'UNKNOWN TOKEN: ' + String(id);\n}\n\n/** Generates label for {@link AstNodeBase}. */\nexport function labelRSLangNode(node: AstNodeBase): string {\n  // prettier-ignore\n  switch (node.typeID) {\n    case TokenID.ERROR: return '[ERROR]';\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_GLOBAL:\n    case TokenID.ID_FUNCTION:\n    case TokenID.ID_PREDICATE:\n    case TokenID.ID_RADICAL:\n      return node.data.value as string;\n\n    case TokenID.LIT_INTEGER: return String(node.data.value);\n\n    case TokenID.BIGPR: return 'Pr' + (node.data.value as string[]).toString();\n    case TokenID.SMALLPR: return 'pr' + (node.data.value as string[]).toString();\n    case TokenID.FILTER: return 'Fi' + (node.data.value as string[]).toString();\n\n    case TokenID.NT_DECLARATIVE_EXPR: return 'DECLARATIVE';\n    case TokenID.NT_IMPERATIVE_EXPR: return 'IMPERATIVE';\n    case TokenID.NT_RECURSIVE_FULL: return 'RECURSIVE';\n    case TokenID.NT_RECURSIVE_SHORT: return 'RECURSIVE';\n\n    case TokenID.BOOLEAN: return 'ℬ';\n    case TokenID.REDUCE: return 'red';\n    case TokenID.CARD: return 'card';\n    case TokenID.BOOL: return 'bool';\n    case TokenID.DEBOOL: return 'debool';\n\n    case TokenID.PLUS: return '+';\n    case TokenID.MINUS: return '-';\n    case TokenID.MULTIPLY: return '*';\n    case TokenID.GREATER: return '>';\n    case TokenID.LESSER: return '<';\n\n    case TokenID.NT_TUPLE: return 'TUPLE';\n    case TokenID.NT_ENUMERATION: return 'ENUM';\n\n    case TokenID.NT_ENUM_DECL: return 'ENUM_DECLARE';\n    case TokenID.NT_TUPLE_DECL: return 'TUPLE_DECLARE';\n    case TokenID.PUNCTUATION_DEFINE: return 'DEFINITION';\n    case TokenID.PUNCTUATION_STRUCT: return 'STRUCTURE_DEFINE';\n\n    case TokenID.NT_ARG_DECL: return 'ARG';\n    case TokenID.NT_FUNC_CALL: return 'CALL';\n    case TokenID.NT_ARGUMENTS: return 'ARGS';\n\n    case TokenID.NT_FUNC_DEFINITION: return 'FUNCTION_DEFINE';\n\n    case TokenID.DECART:\n    case TokenID.QUANTOR_UNIVERSAL:\n    case TokenID.QUANTOR_EXISTS:\n    case TokenID.LOGIC_NOT:\n    case TokenID.LOGIC_AND:\n    case TokenID.LOGIC_OR:\n    case TokenID.LOGIC_IMPLICATION:\n    case TokenID.LOGIC_EQUIVALENT:\n    case TokenID.LIT_EMPTYSET:\n    case TokenID.LIT_WHOLE_NUMBERS:\n    case TokenID.EQUAL:\n    case TokenID.NOTEQUAL:\n    case TokenID.GREATER_OR_EQ:\n    case TokenID.LESSER_OR_EQ:\n    case TokenID.SET_IN:\n    case TokenID.SET_NOT_IN:\n    case TokenID.SUBSET_OR_EQ:\n    case TokenID.SUBSET:\n    case TokenID.NOT_SUBSET:\n    case TokenID.SET_INTERSECTION:\n    case TokenID.SET_UNION:\n    case TokenID.SET_MINUS:\n    case TokenID.SET_SYMMETRIC_MINUS:\n    case TokenID.ASSIGN:\n    case TokenID.ITERATE:\n      return labelToken(node.typeID);\n  }\n  if (node.data.value) {\n    return node.data.value as string;\n  }\n  return 'UNKNOWN NODE: ' + String(node.typeID);\n}\n\n/** Converts expression type to string. */\nexport function labelType(type: ExpressionType | null): string {\n  if (!type) {\n    return 'N/A';\n  }\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n      return ANY_TYPE_NAME;\n    case TypeID.integer:\n      return INTEGER_TYPE_NAME;\n    case TypeID.basic:\n      return type.baseID;\n    case TypeID.tuple:\n      return type.factors\n        .map(factor => (factor.typeID === TypeID.tuple ? `(${labelType(factor)})` : labelType(factor)))\n        .join('×');\n    case TypeID.collection:\n      return type.base.typeID === TypeID.collection ? `ℬ${labelType(type.base)}` : `ℬ(${labelType(type.base)})`;\n    case TypeID.logic:\n      return LOGIC_TYPE_NAME;\n    case TypeID.predicate:\n    case TypeID.function:\n      const argsText = type.args.map(arg => labelType(arg.type)).join(', ');\n      return `[${argsText}] → ${labelType(type.result)}`;\n  }\n}\n\n/** Converts expression type to normalized string. */\nexport function normalizeType(type: ExpressionType | null): string {\n  if (!type) {\n    return 'N/A';\n  }\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n      return ANY_TYPE_NAME;\n    case TypeID.integer:\n    case TypeID.basic:\n      return 'X1';\n    case TypeID.tuple:\n      return type.factors\n        .map(factor => (factor.typeID === TypeID.tuple ? `(${normalizeType(factor)})` : normalizeType(factor)))\n        .join('×');\n    case TypeID.collection:\n      return type.base.typeID === TypeID.collection ? `ℬ${normalizeType(type.base)}` : `ℬ(${normalizeType(type.base)})`;\n    case TypeID.logic:\n      return LOGIC_TYPE_NAME;\n    case TypeID.predicate:\n    case TypeID.function:\n      const argsText = type.args.map(arg => normalizeType(arg.type)).join(', ');\n      return `[${argsText}] → ${normalizeType(type.result)}`;\n  }\n}\n"],"mappings":";;;AAKA,MAAM,oBAAoB;AAC1B,MAAM,gBAAgB;AACtB,MAAM,kBAAkB;AAExB,MAAM,mBAAqD;EACxD,QAAQ,SAAS;EACjB,QAAQ,iBAAiB;EACzB,QAAQ,iBAAiB;EACzB,QAAQ,oBAAoB;EAC5B,QAAQ,iBAAiB;EACzB,QAAQ,YAAY;EACpB,QAAQ,YAAY;EACpB,QAAQ,WAAW;EACnB,QAAQ,oBAAoB;EAC5B,QAAQ,mBAAmB;EAC3B,QAAQ,eAAe;EACvB,QAAQ,oBAAoB;EAC5B,QAAQ,WAAW;EACnB,QAAQ,QAAQ;EAChB,QAAQ,WAAW;EACnB,QAAQ,gBAAgB;EACxB,QAAQ,eAAe;EACvB,QAAQ,SAAS;EACjB,QAAQ,aAAa;EACrB,QAAQ,eAAe;EACvB,QAAQ,SAAS;EACjB,QAAQ,aAAa;EACrB,QAAQ,mBAAmB;EAC3B,QAAQ,YAAY;EACpB,QAAQ,YAAY;EACpB,QAAQ,sBAAsB;EAC9B,QAAQ,UAAU;EAClB,QAAQ,sBAAsB;EAC9B,QAAQ,qBAAqB;EAC7B,QAAQ,oBAAoB;EAC5B,QAAQ,QAAQ;EAChB,QAAQ,UAAU;EAClB,QAAQ,SAAS;EACjB,QAAQ,SAAS;EACjB,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,QAAQ,SAAS;EACjB,QAAQ,SAAS;EACjB,QAAQ,UAAU;AACrB;;AAGA,SAAgB,WAAW,IAAqB;CAE9C,OADa,iBAAiB,OACf,oBAAoB,OAAO,EAAE;AAC9C;;AAGA,SAAgB,gBAAgB,MAA2B;CAEzD,QAAQ,KAAK,QAAb;EACE,KAAK,QAAQ,OAAO,OAAO;EAC3B,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,YACX,OAAO,KAAK,KAAK;EAEnB,KAAK,QAAQ,aAAa,OAAO,OAAO,KAAK,KAAK,KAAK;EAEvD,KAAK,QAAQ,OAAO,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EACzE,KAAK,QAAQ,SAAS,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EAC3E,KAAK,QAAQ,QAAQ,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EAE1E,KAAK,QAAQ,qBAAqB,OAAO;EACzC,KAAK,QAAQ,oBAAoB,OAAO;EACxC,KAAK,QAAQ,mBAAmB,OAAO;EACvC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ,SAAS,OAAO;EAC7B,KAAK,QAAQ,QAAQ,OAAO;EAC5B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,QAAQ,OAAO;EAE5B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,OAAO,OAAO;EAC3B,KAAK,QAAQ,UAAU,OAAO;EAC9B,KAAK,QAAQ,SAAS,OAAO;EAC7B,KAAK,QAAQ,QAAQ,OAAO;EAE5B,KAAK,QAAQ,UAAU,OAAO;EAC9B,KAAK,QAAQ,gBAAgB,OAAO;EAEpC,KAAK,QAAQ,cAAc,OAAO;EAClC,KAAK,QAAQ,eAAe,OAAO;EACnC,KAAK,QAAQ,oBAAoB,OAAO;EACxC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ,aAAa,OAAO;EACjC,KAAK,QAAQ,cAAc,OAAO;EAClC,KAAK,QAAQ,cAAc,OAAO;EAElC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,SACX,OAAO,WAAW,KAAK,MAAM;CACjC;CACA,IAAI,KAAK,KAAK,OACZ,OAAO,KAAK,KAAK;CAEnB,OAAO,mBAAmB,OAAO,KAAK,MAAM;AAC9C;;AAGA,SAAgB,UAAU,MAAqC;CAC7D,IAAI,CAAC,MACH,OAAO;CAET,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,KAAK;EACd,KAAK,OAAO,OACV,OAAO,KAAK,QACT,KAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,IAAI,UAAU,MAAM,EAAE,KAAK,UAAU,MAAM,CAAE,CAAC,CAC9F,KAAK,GAAG;EACb,KAAK,OAAO,YACV,OAAO,KAAK,KAAK,WAAW,OAAO,aAAa,IAAI,UAAU,KAAK,IAAI,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;EACzG,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,UAEV,OAAO,IADU,KAAK,KAAK,KAAI,QAAO,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IACrD,EAAS,MAAM,UAAU,KAAK,MAAM;CACnD;AACF;;AAGA,SAAgB,cAAc,MAAqC;CACjE,IAAI,CAAC,MACH,OAAO;CAET,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,KAAK,QACT,KAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,IAAI,cAAc,MAAM,EAAE,KAAK,cAAc,MAAM,CAAE,CAAC,CACtG,KAAK,GAAG;EACb,KAAK,OAAO,YACV,OAAO,KAAK,KAAK,WAAW,OAAO,aAAa,IAAI,cAAc,KAAK,IAAI,MAAM,KAAK,cAAc,KAAK,IAAI,EAAE;EACjH,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,UAEV,OAAO,IADU,KAAK,KAAK,KAAI,QAAO,cAAc,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IACzD,EAAS,MAAM,cAAc,KAAK,MAAM;CACvD;AACF"}
+{"version":3,"file":"labels.js","names":[],"sources":["../../src/rslang/labels.ts"],"sourcesContent":["import { type AstNodeBase } from '../parsing';\n\nimport { TokenID } from './parser/token';\nimport { type ExpressionType, TypeID } from './semantic/typification';\n\nconst INTEGER_TYPE_NAME = 'Z';\nconst ANY_TYPE_NAME = 'R0';\nconst LOGIC_TYPE_NAME = 'Logic';\n\nconst labelTokenRecord: Partial<Record<TokenID, string>> = {\n  [TokenID.DECART]: '×',\n  [TokenID.PUNCTUATION_PL]: '( )',\n  [TokenID.PUNCTUATION_SL]: '[ ]',\n  [TokenID.QUANTOR_UNIVERSAL]: '∀',\n  [TokenID.QUANTOR_EXISTS]: '∃',\n  [TokenID.LOGIC_NOT]: '¬',\n  [TokenID.LOGIC_AND]: '&',\n  [TokenID.LOGIC_OR]: '∨',\n  [TokenID.LOGIC_IMPLICATION]: '⇒',\n  [TokenID.LOGIC_EQUIVALENT]: '⇔',\n  [TokenID.LIT_EMPTYSET]: '∅',\n  [TokenID.LIT_WHOLE_NUMBERS]: 'Z',\n  [TokenID.MULTIPLY]: '*',\n  [TokenID.EQUAL]: '=',\n  [TokenID.NOTEQUAL]: '≠',\n  [TokenID.GREATER_OR_EQ]: '≥',\n  [TokenID.LESSER_OR_EQ]: '≤',\n  [TokenID.SET_IN]: '∈',\n  [TokenID.SET_NOT_IN]: '∉',\n  [TokenID.SUBSET_OR_EQ]: '⊆',\n  [TokenID.SUBSET]: '⊂',\n  [TokenID.NOT_SUBSET]: '⊄',\n  [TokenID.SET_INTERSECTION]: '∩',\n  [TokenID.SET_UNION]: '∪',\n  [TokenID.SET_MINUS]: '\\\\',\n  [TokenID.SET_SYMMETRIC_MINUS]: '∆',\n  [TokenID.BOOLEAN]: 'ℬ()',\n  [TokenID.NT_DECLARATIVE_EXPR]: 'D{}',\n  [TokenID.NT_IMPERATIVE_EXPR]: 'I{}',\n  [TokenID.NT_RECURSIVE_FULL]: 'R{}',\n  [TokenID.NT_RECURSIVE_SHORT]: 'R{}',\n  [TokenID.BIGPR]: 'Pr1()',\n  [TokenID.SMALLPR]: 'pr1()',\n  [TokenID.FILTER]: 'Fi1[]()',\n  [TokenID.REDUCE]: 'red()',\n  [TokenID.CARD]: 'card()',\n  [TokenID.BOOL]: 'bool()',\n  [TokenID.DEBOOL]: 'debool()',\n  [TokenID.ASSIGN]: ':=',\n  [TokenID.ITERATE]: ':∈'\n};\n\n/** Retrieves label for {@link TokenID}. */\nexport function labelToken(id: TokenID): string {\n  const text = labelTokenRecord[id];\n  return text ?? 'UNKNOWN TOKEN: ' + String(id);\n}\n\n/** Generates label for {@link AstNodeBase}. */\nexport function labelRSLangNode(node: AstNodeBase): string {\n  // prettier-ignore\n  switch (node.typeID) {\n    case TokenID.ERROR: return '[ERROR]';\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_GLOBAL:\n    case TokenID.ID_FUNCTION:\n    case TokenID.ID_PREDICATE:\n    case TokenID.ID_RADICAL:\n      return node.data.value as string;\n\n    case TokenID.LIT_INTEGER: return String(node.data.value);\n\n    case TokenID.BIGPR: return 'Pr' + (node.data.value as string[]).toString();\n    case TokenID.SMALLPR: return 'pr' + (node.data.value as string[]).toString();\n    case TokenID.FILTER: return 'Fi' + (node.data.value as string[]).toString();\n\n    case TokenID.NT_DECLARATIVE_EXPR: return 'DECLARATIVE';\n    case TokenID.NT_IMPERATIVE_EXPR: return 'IMPERATIVE';\n    case TokenID.NT_RECURSIVE_FULL: return 'RECURSIVE';\n    case TokenID.NT_RECURSIVE_SHORT: return 'RECURSIVE';\n\n    case TokenID.BOOLEAN: return 'ℬ';\n    case TokenID.REDUCE: return 'red';\n    case TokenID.CARD: return 'card';\n    case TokenID.BOOL: return 'bool';\n    case TokenID.DEBOOL: return 'debool';\n\n    case TokenID.PLUS: return '+';\n    case TokenID.MINUS: return '-';\n    case TokenID.MULTIPLY: return '*';\n    case TokenID.GREATER: return '>';\n    case TokenID.LESSER: return '<';\n\n    case TokenID.NT_TUPLE: return 'TUPLE';\n    case TokenID.NT_ENUMERATION: return 'ENUM';\n\n    case TokenID.NT_ENUM_DECL: return 'ENUM_DECLARE';\n    case TokenID.NT_TUPLE_DECL: return 'TUPLE_DECLARE';\n    case TokenID.PUNCTUATION_DEFINE: return 'DEFINITION';\n    case TokenID.PUNCTUATION_STRUCT: return 'STRUCTURE_DEFINE';\n\n    case TokenID.NT_ARG_DECL: return 'ARG';\n    case TokenID.NT_FUNC_CALL: return 'CALL';\n    case TokenID.NT_ARGUMENTS: return 'ARGS';\n\n    case TokenID.NT_FUNC_DEFINITION: return 'FUNCTION_DEFINE';\n\n    case TokenID.DECART:\n    case TokenID.QUANTOR_UNIVERSAL:\n    case TokenID.QUANTOR_EXISTS:\n    case TokenID.LOGIC_NOT:\n    case TokenID.LOGIC_AND:\n    case TokenID.LOGIC_OR:\n    case TokenID.LOGIC_IMPLICATION:\n    case TokenID.LOGIC_EQUIVALENT:\n    case TokenID.LIT_EMPTYSET:\n    case TokenID.LIT_WHOLE_NUMBERS:\n    case TokenID.EQUAL:\n    case TokenID.NOTEQUAL:\n    case TokenID.GREATER_OR_EQ:\n    case TokenID.LESSER_OR_EQ:\n    case TokenID.SET_IN:\n    case TokenID.SET_NOT_IN:\n    case TokenID.SUBSET_OR_EQ:\n    case TokenID.SUBSET:\n    case TokenID.NOT_SUBSET:\n    case TokenID.SET_INTERSECTION:\n    case TokenID.SET_UNION:\n    case TokenID.SET_MINUS:\n    case TokenID.SET_SYMMETRIC_MINUS:\n    case TokenID.ASSIGN:\n    case TokenID.ITERATE:\n      return labelToken(node.typeID);\n  }\n  if (node.data.value) {\n    return node.data.value as string;\n  }\n  return 'UNKNOWN NODE: ' + String(node.typeID);\n}\n\n/** Converts expression type to string. */\nexport function labelType(type: ExpressionType | null): string {\n  if (!type) {\n    return 'N/A';\n  }\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n      return ANY_TYPE_NAME;\n    case TypeID.integer:\n      return INTEGER_TYPE_NAME;\n    case TypeID.basic:\n      return type.baseID;\n    case TypeID.tuple:\n      return type.factors\n        .map(factor => (factor.typeID === TypeID.tuple ? `(${labelType(factor)})` : labelType(factor)))\n        .join('×');\n    case TypeID.collection:\n      return type.base.typeID === TypeID.collection ? `ℬ${labelType(type.base)}` : `ℬ(${labelType(type.base)})`;\n    case TypeID.logic:\n      return LOGIC_TYPE_NAME;\n    case TypeID.predicate:\n    case TypeID.function:\n      const argsText = type.args.map(arg => labelType(arg.type)).join(', ');\n      return `[${argsText}] → ${labelType(type.result)}`;\n  }\n}\n\n/** Converts expression type to normalized string. */\nexport function normalizeType(type: ExpressionType | null): string {\n  if (!type) {\n    return 'N/A';\n  }\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n      return ANY_TYPE_NAME;\n    case TypeID.integer:\n    case TypeID.basic:\n      return 'X1';\n    case TypeID.tuple:\n      return type.factors\n        .map(factor => (factor.typeID === TypeID.tuple ? `(${normalizeType(factor)})` : normalizeType(factor)))\n        .join('×');\n    case TypeID.collection:\n      return type.base.typeID === TypeID.collection ? `ℬ${normalizeType(type.base)}` : `ℬ(${normalizeType(type.base)})`;\n    case TypeID.logic:\n      return LOGIC_TYPE_NAME;\n    case TypeID.predicate:\n    case TypeID.function:\n      const argsText = type.args.map(arg => normalizeType(arg.type)).join(', ');\n      return `[${argsText}] → ${normalizeType(type.result)}`;\n  }\n}\n"],"mappings":";;;AAKA,MAAM,oBAAoB;AAC1B,MAAM,gBAAgB;AACtB,MAAM,kBAAkB;AAExB,MAAM,mBAAqD;EACxD,QAAQ,SAAS;EACjB,QAAQ,iBAAiB;EACzB,QAAQ,iBAAiB;EACzB,QAAQ,oBAAoB;EAC5B,QAAQ,iBAAiB;EACzB,QAAQ,YAAY;EACpB,QAAQ,YAAY;EACpB,QAAQ,WAAW;EACnB,QAAQ,oBAAoB;EAC5B,QAAQ,mBAAmB;EAC3B,QAAQ,eAAe;EACvB,QAAQ,oBAAoB;EAC5B,QAAQ,WAAW;EACnB,QAAQ,QAAQ;EAChB,QAAQ,WAAW;EACnB,QAAQ,gBAAgB;EACxB,QAAQ,eAAe;EACvB,QAAQ,SAAS;EACjB,QAAQ,aAAa;EACrB,QAAQ,eAAe;EACvB,QAAQ,SAAS;EACjB,QAAQ,aAAa;EACrB,QAAQ,mBAAmB;EAC3B,QAAQ,YAAY;EACpB,QAAQ,YAAY;EACpB,QAAQ,sBAAsB;EAC9B,QAAQ,UAAU;EAClB,QAAQ,sBAAsB;EAC9B,QAAQ,qBAAqB;EAC7B,QAAQ,oBAAoB;EAC5B,QAAQ,qBAAqB;EAC7B,QAAQ,QAAQ;EAChB,QAAQ,UAAU;EAClB,QAAQ,SAAS;EACjB,QAAQ,SAAS;EACjB,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,QAAQ,SAAS;EACjB,QAAQ,SAAS;EACjB,QAAQ,UAAU;AACrB;;AAGA,SAAgB,WAAW,IAAqB;CAE9C,OADa,iBAAiB,OACf,oBAAoB,OAAO,EAAE;AAC9C;;AAGA,SAAgB,gBAAgB,MAA2B;CAEzD,QAAQ,KAAK,QAAb;EACE,KAAK,QAAQ,OAAO,OAAO;EAC3B,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,YACX,OAAO,KAAK,KAAK;EAEnB,KAAK,QAAQ,aAAa,OAAO,OAAO,KAAK,KAAK,KAAK;EAEvD,KAAK,QAAQ,OAAO,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EACzE,KAAK,QAAQ,SAAS,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EAC3E,KAAK,QAAQ,QAAQ,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EAE1E,KAAK,QAAQ,qBAAqB,OAAO;EACzC,KAAK,QAAQ,oBAAoB,OAAO;EACxC,KAAK,QAAQ,mBAAmB,OAAO;EACvC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ,SAAS,OAAO;EAC7B,KAAK,QAAQ,QAAQ,OAAO;EAC5B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,QAAQ,OAAO;EAE5B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,OAAO,OAAO;EAC3B,KAAK,QAAQ,UAAU,OAAO;EAC9B,KAAK,QAAQ,SAAS,OAAO;EAC7B,KAAK,QAAQ,QAAQ,OAAO;EAE5B,KAAK,QAAQ,UAAU,OAAO;EAC9B,KAAK,QAAQ,gBAAgB,OAAO;EAEpC,KAAK,QAAQ,cAAc,OAAO;EAClC,KAAK,QAAQ,eAAe,OAAO;EACnC,KAAK,QAAQ,oBAAoB,OAAO;EACxC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ,aAAa,OAAO;EACjC,KAAK,QAAQ,cAAc,OAAO;EAClC,KAAK,QAAQ,cAAc,OAAO;EAElC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,SACX,OAAO,WAAW,KAAK,MAAM;CACjC;CACA,IAAI,KAAK,KAAK,OACZ,OAAO,KAAK,KAAK;CAEnB,OAAO,mBAAmB,OAAO,KAAK,MAAM;AAC9C;;AAGA,SAAgB,UAAU,MAAqC;CAC7D,IAAI,CAAC,MACH,OAAO;CAET,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,KAAK;EACd,KAAK,OAAO,OACV,OAAO,KAAK,QACT,KAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,IAAI,UAAU,MAAM,EAAE,KAAK,UAAU,MAAM,CAAE,CAAC,CAC9F,KAAK,GAAG;EACb,KAAK,OAAO,YACV,OAAO,KAAK,KAAK,WAAW,OAAO,aAAa,IAAI,UAAU,KAAK,IAAI,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;EACzG,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,UAEV,OAAO,IADU,KAAK,KAAK,KAAI,QAAO,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IACrD,EAAS,MAAM,UAAU,KAAK,MAAM;CACnD;AACF;;AAGA,SAAgB,cAAc,MAAqC;CACjE,IAAI,CAAC,MACH,OAAO;CAET,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,KAAK,QACT,KAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,IAAI,cAAc,MAAM,EAAE,KAAK,cAAc,MAAM,CAAE,CAAC,CACtG,KAAK,GAAG;EACb,KAAK,OAAO,YACV,OAAO,KAAK,KAAK,WAAW,OAAO,aAAa,IAAI,cAAc,KAAK,IAAI,MAAM,KAAK,cAAc,KAAK,IAAI,EAAE;EACjH,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,UAEV,OAAO,IADU,KAAK,KAAK,KAAI,QAAO,cAAc,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IACzD,EAAS,MAAM,cAAc,KAAK,MAAM;CACvD;AACF"}

package/dist/rslang/parser/syntax-errors.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";
 
 //#region src/rslang/parser/syntax-errors.d.ts
 declare function extractSyntaxErrors(ast: AstNode, expression: string, reporter: ErrorReporter, annotateErrors?: boolean): void;

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

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

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

@@ -1,6 +1,6 @@
 import { t as AstNode } from "../../ast-C8sIpKdL.js";
 import { _ as TypeContext, f as ExpressionType } from "../../typification-Dk-fisgO.js";
-import { t as ErrorReporter } from "../../error-deey7EiC.js";
+import { t as ErrorReporter } from "../../error-DuqsZDL5.js";
 
 //#region src/rslang/semantic/type-auditor.d.ts
 /** Type auditor for AST type checking. */
@@ -28,6 +28,7 @@ declare class TypeAuditor {
   private childTypification;
   private childLogic;
   private childTypeDebool;
+  private childQuantifierDomain;
   private visitLocal;
   private visitGlobal;
   private visitFunctionDefinition;