@rsconcept/domain 1.0.0 → 1.2.0

package/dist/rslang/eval/evaluation-cache.js

@@ -1,310 +1,191 @@
-// src/parsing/ast.ts
-var TOKEN_ERROR = 0;
-function getNodeText(node) {
-  if (node.data.dataType === "string" && typeof node.data.value === "string") {
-    return node.data.value;
-  }
-  return `NO DATA NODE: ${node.typeID}`;
-}
-function getNodeIndices(node) {
-  if (node.data.dataType === "string[]" && Array.isArray(node.data.value)) {
-    return node.data.value.map((s) => parseInt(s, 10)).filter((n) => !isNaN(n));
-  }
-  return [];
-}
-
-// src/rslang/parser/token.ts
-var TokenID = {
-  // Global, local IDs and literals
-  ERROR: TOKEN_ERROR,
-  ID_LOCAL: 258,
-  ID_GLOBAL: 259,
-  ID_FUNCTION: 260,
-  ID_PREDICATE: 261,
-  ID_RADICAL: 262,
-  LIT_INTEGER: 263,
-  LIT_WHOLE_NUMBERS: 264,
-  LIT_EMPTYSET: 265,
-  // Arithmetic
-  PLUS: 266,
-  MINUS: 267,
-  MULTIPLY: 268,
-  // Integer predicate symbols
-  GREATER: 269,
-  LESSER: 270,
-  GREATER_OR_EQ: 271,
-  LESSER_OR_EQ: 272,
-  // Equality comparison
-  EQUAL: 273,
-  NOTEQUAL: 274,
-  // Logic predicate symbols
-  QUANTOR_UNIVERSAL: 275,
-  QUANTOR_EXISTS: 276,
-  LOGIC_NOT: 277,
-  LOGIC_EQUIVALENT: 278,
-  LOGIC_IMPLICATION: 279,
-  LOGIC_OR: 280,
-  LOGIC_AND: 281,
-  // Set theory predicate symbols
-  SET_IN: 282,
-  SET_NOT_IN: 283,
-  SUBSET: 284,
-  SUBSET_OR_EQ: 285,
-  NOT_SUBSET: 286,
-  // Set theory operators
-  DECART: 287,
-  SET_UNION: 288,
-  SET_INTERSECTION: 289,
-  SET_MINUS: 290,
-  SET_SYMMETRIC_MINUS: 291,
-  BOOLEAN: 292,
-  // Structure operations
-  BIGPR: 293,
-  SMALLPR: 294,
-  FILTER: 295,
-  CARD: 296,
-  BOOL: 297,
-  DEBOOL: 298,
-  REDUCE: 299,
-  // Term constructions prefixes
-  DECLARATIVE: 300,
-  RECURSIVE: 301,
-  IMPERATIVE: 302,
-  ITERATE: 303,
-  ASSIGN: 304,
-  // Punctuation
-  PUNCTUATION_DEFINE: 305,
-  PUNCTUATION_STRUCT: 306,
-  PUNCTUATION_PL: 307,
-  PUNCTUATION_PR: 308,
-  PUNCTUATION_CL: 309,
-  PUNCTUATION_CR: 310,
-  PUNCTUATION_SL: 311,
-  PUNCTUATION_SR: 312,
-  PUNCTUATION_BAR: 313,
-  PUNCTUATION_COMMA: 314,
-  PUNCTUATION_SEMICOLON: 315,
-  // ======= Non-terminal tokens =========
-  NT_ENUM_DECL: 316,
-  NT_TUPLE: 317,
-  NT_ENUMERATION: 318,
-  NT_TUPLE_DECL: 319,
-  NT_ARG_DECL: 320,
-  NT_FUNC_DEFINITION: 321,
-  NT_ARGUMENTS: 322,
-  NT_FUNC_CALL: 323,
-  NT_DECLARATIVE_EXPR: 324,
-  NT_IMPERATIVE_EXPR: 325,
-  NT_RECURSIVE_FULL: 326,
-  NT_RECURSIVE_SHORT: 327,
-  // ======= Helper tokens ========
-  INTERRUPT: 328,
-  END: 329
-};
-
-// src/rslang/eval/evaluation-cache.ts
+import { getNodeIndices, getNodeText } from "../../parsing/ast.js";
+import "../../parsing/index.js";
+import { TokenID } from "../parser/token.js";
+//#region src/rslang/eval/evaluation-cache.ts
+/**
+* Module: Dependency metadata and per-run memoization for RSLang evaluation.
+*/
+/** Per-evaluator cache of immutable AST dependency metadata (no runtime values). */
 var EvaluationMetadata = class {
-  byNode = /* @__PURE__ */ new WeakMap();
-  get(node) {
-    let info = this.byNode.get(node);
-    if (!info) {
-      info = analyzeNode(node, /* @__PURE__ */ new Set());
-      this.byNode.set(node, info);
-    }
-    return info;
-  }
+	byNode = /* @__PURE__ */ new WeakMap();
+	get(node) {
+		let info = this.byNode.get(node);
+		if (!info) {
+			info = analyzeNode(node, /* @__PURE__ */ new Set());
+			this.byNode.set(node, info);
+		}
+		return info;
+	}
 };
+/** Per-run memo of computed values (cleared on each {@link Evaluator.run}). */
 var EvaluationCache = class {
-  entries = /* @__PURE__ */ new Map();
-  /** Cache hits in the current evaluation run (for tests/diagnostics). */
-  hits = 0;
-  /** Returns cached value, or `undefined` on miss or stamp mismatch. */
-  lookup(structuralKey, stamp) {
-    const entry = this.entries.get(structuralKey);
-    if (entry?.stamp !== stamp) {
-      return void 0;
-    }
-    this.hits++;
-    return entry.value;
-  }
-  /** Stores one value per structural key (replaces previous stamp). */
-  store(structuralKey, stamp, value) {
-    this.entries.set(structuralKey, { stamp, value });
-  }
-  clear() {
-    this.entries.clear();
-    this.hits = 0;
-  }
+	entries = /* @__PURE__ */ new Map();
+	/** Cache hits in the current evaluation run (for tests/diagnostics). */
+	hits = 0;
+	/** Returns cached value, or `undefined` on miss or stamp mismatch. */
+	lookup(structuralKey, stamp) {
+		const entry = this.entries.get(structuralKey);
+		if (entry?.stamp !== stamp) return;
+		this.hits++;
+		return entry.value;
+	}
+	/** Stores one value per structural key (replaces previous stamp). */
+	store(structuralKey, stamp, value) {
+		this.entries.set(structuralKey, {
+			stamp,
+			value
+		});
+	}
+	clear() {
+		this.entries.clear();
+		this.hits = 0;
+	}
 };
 function analyzeNode(node, bound) {
-  const reads = collectReads(node, bound);
-  const structuralKey = buildStructuralKey(node);
-  const cacheable = isCacheableNode(node);
-  return { reads, structuralKey, cacheable };
+	return {
+		reads: collectReads(node, bound),
+		structuralKey: buildStructuralKey(node),
+		cacheable: isCacheableNode(node)
+	};
 }
 function isCacheableNode(node) {
-  switch (node.typeID) {
-    case TokenID.ASSIGN:
-    case TokenID.ITERATE:
-    case TokenID.NT_IMPERATIVE_EXPR:
-    case TokenID.NT_DECLARATIVE_EXPR:
-    case TokenID.NT_RECURSIVE_FULL:
-    case TokenID.NT_RECURSIVE_SHORT:
-    case TokenID.QUANTOR_UNIVERSAL:
-    case TokenID.QUANTOR_EXISTS:
-    case TokenID.LOGIC_AND:
-    case TokenID.LOGIC_OR:
-    case TokenID.LOGIC_IMPLICATION:
-    case TokenID.NT_FUNC_DEFINITION:
-    case TokenID.LIT_INTEGER:
-    case TokenID.LIT_EMPTYSET:
-    case TokenID.LIT_WHOLE_NUMBERS:
-    case TokenID.ID_LOCAL:
-    case TokenID.ID_RADICAL:
-    case TokenID.ID_GLOBAL:
-      return false;
-    default:
-      return !node.hasError;
-  }
+	switch (node.typeID) {
+		case TokenID.ASSIGN:
+		case TokenID.ITERATE:
+		case TokenID.NT_IMPERATIVE_EXPR:
+		case TokenID.NT_DECLARATIVE_EXPR:
+		case TokenID.NT_RECURSIVE_FULL:
+		case TokenID.NT_RECURSIVE_SHORT:
+		case TokenID.QUANTOR_UNIVERSAL:
+		case TokenID.QUANTOR_EXISTS:
+		case TokenID.LOGIC_AND:
+		case TokenID.LOGIC_OR:
+		case TokenID.LOGIC_IMPLICATION:
+		case TokenID.NT_FUNC_DEFINITION:
+		case TokenID.LIT_INTEGER:
+		case TokenID.LIT_EMPTYSET:
+		case TokenID.LIT_WHOLE_NUMBERS:
+		case TokenID.ID_LOCAL:
+		case TokenID.ID_RADICAL:
+		case TokenID.ID_GLOBAL: return false;
+		default: return !node.hasError;
+	}
 }
 function buildStructuralKey(node) {
-  switch (node.typeID) {
-    case TokenID.ID_GLOBAL:
-    case TokenID.ID_LOCAL:
-    case TokenID.ID_RADICAL:
-    case TokenID.LIT_INTEGER:
-    case TokenID.LIT_EMPTYSET:
-    case TokenID.LIT_WHOLE_NUMBERS:
-      return `${node.typeID}:${nodeTextKey(node)}`;
-    case TokenID.NT_FUNC_CALL:
-      return `${node.typeID}:${nodeTextKey(node.children[0])}(${node.children.slice(1).map(buildStructuralKey).join(",")})`;
-    case TokenID.BIGPR:
-    case TokenID.SMALLPR:
-    case TokenID.FILTER:
-      return `${node.typeID}:${indicesKey(node)}(${node.children.map(buildStructuralKey).join(",")})`;
-    default:
-      return `${node.typeID}(${node.children.map(buildStructuralKey).join(",")})`;
-  }
+	switch (node.typeID) {
+		case TokenID.ID_GLOBAL:
+		case TokenID.ID_LOCAL:
+		case TokenID.ID_RADICAL:
+		case TokenID.LIT_INTEGER:
+		case TokenID.LIT_EMPTYSET:
+		case TokenID.LIT_WHOLE_NUMBERS: return `${node.typeID}:${nodeTextKey(node)}`;
+		case TokenID.NT_FUNC_CALL: return `${node.typeID}:${nodeTextKey(node.children[0])}(${node.children.slice(1).map(buildStructuralKey).join(",")})`;
+		case TokenID.BIGPR:
+		case TokenID.SMALLPR:
+		case TokenID.FILTER: return `${node.typeID}:${indicesKey(node)}(${node.children.map(buildStructuralKey).join(",")})`;
+		default: return `${node.typeID}(${node.children.map(buildStructuralKey).join(",")})`;
+	}
 }
 function nodeTextKey(node) {
-  if (node.data.dataType === "number") {
-    return String(node.data.value);
-  }
-  return getNodeText(node);
+	if (node.data.dataType === "number") return String(node.data.value);
+	return getNodeText(node);
 }
 function indicesKey(node) {
-  return getNodeIndices(node).join(".");
+	return getNodeIndices(node).join(".");
 }
 function collectReads(node, bound) {
-  const reads = /* @__PURE__ */ new Set();
-  collectReadsImpl(node, bound, reads);
-  return reads;
+	const reads = /* @__PURE__ */ new Set();
+	collectReadsImpl(node, bound, reads);
+	return reads;
 }
 function collectReadsImpl(node, bound, reads) {
-  switch (node.typeID) {
-    case TokenID.ID_LOCAL:
-    case TokenID.ID_RADICAL: {
-      reads.add(getNodeText(node));
-      return;
-    }
-    case TokenID.QUANTOR_UNIVERSAL:
-    case TokenID.QUANTOR_EXISTS: {
-      collectReadsImpl(node.children[1], bound, reads);
-      const innerBound = extendBound(bound, node.children[0]);
-      collectReadsImpl(node.children[2], innerBound, reads);
-      return;
-    }
-    case TokenID.NT_DECLARATIVE_EXPR: {
-      collectReadsImpl(node.children[1], bound, reads);
-      const innerBound = extendBound(bound, node.children[0]);
-      collectReadsImpl(node.children[2], innerBound, reads);
-      return;
-    }
-    case TokenID.ITERATE: {
-      collectReadsImpl(node.children[1], bound, reads);
-      return;
-    }
-    case TokenID.ASSIGN: {
-      collectReadsImpl(node.children[1], bound, reads);
-      return;
-    }
-    case TokenID.NT_IMPERATIVE_EXPR: {
-      const innerBound = new Set(bound);
-      collectReadsImpl(node.children[0], innerBound, reads);
-      for (let i = 1; i < node.children.length; i++) {
-        const child = node.children[i];
-        if (child.typeID === TokenID.ITERATE) {
-          extendBoundInPlace(innerBound, child.children[0]);
-          collectReadsImpl(child.children[1], innerBound, reads);
-        } else if (child.typeID === TokenID.ASSIGN) {
-          collectReadsImpl(child.children[1], innerBound, reads);
-          extendBoundInPlace(innerBound, child.children[0]);
-        } else {
-          collectReadsImpl(child, innerBound, reads);
-        }
-      }
-      return;
-    }
-    case TokenID.NT_RECURSIVE_FULL:
-    case TokenID.NT_RECURSIVE_SHORT: {
-      collectReadsImpl(node.children[1], bound, reads);
-      const innerBound = extendBound(bound, node.children[0]);
-      if (node.typeID === TokenID.NT_RECURSIVE_FULL) {
-        collectReadsImpl(node.children[2], innerBound, reads);
-        collectReadsImpl(node.children[3], innerBound, reads);
-      } else {
-        collectReadsImpl(node.children[2], innerBound, reads);
-      }
-      return;
-    }
-    case TokenID.NT_FUNC_DEFINITION: {
-      const innerBound = extendBound(bound, node.children[0]);
-      collectReadsImpl(node.children[1], innerBound, reads);
-      return;
-    }
-    case TokenID.NT_FUNC_CALL: {
-      for (let i = 1; i < node.children.length; i++) {
-        collectReadsImpl(node.children[i], bound, reads);
-      }
-      return;
-    }
-    case TokenID.LOGIC_AND:
-    case TokenID.LOGIC_OR:
-    case TokenID.LOGIC_IMPLICATION: {
-      collectReadsImpl(node.children[0], bound, reads);
-      collectReadsImpl(node.children[1], bound, reads);
-      return;
-    }
-    default:
-      for (const child of node.children) {
-        collectReadsImpl(child, bound, reads);
-      }
-  }
+	switch (node.typeID) {
+		case TokenID.ID_LOCAL:
+		case TokenID.ID_RADICAL:
+			reads.add(getNodeText(node));
+			return;
+		case TokenID.QUANTOR_UNIVERSAL:
+		case TokenID.QUANTOR_EXISTS: {
+			collectReadsImpl(node.children[1], bound, reads);
+			const innerBound = extendBound(bound, node.children[0]);
+			collectReadsImpl(node.children[2], innerBound, reads);
+			return;
+		}
+		case TokenID.NT_DECLARATIVE_EXPR: {
+			collectReadsImpl(node.children[1], bound, reads);
+			const innerBound = extendBound(bound, node.children[0]);
+			collectReadsImpl(node.children[2], innerBound, reads);
+			return;
+		}
+		case TokenID.ITERATE:
+			collectReadsImpl(node.children[1], bound, reads);
+			return;
+		case TokenID.ASSIGN:
+			collectReadsImpl(node.children[1], bound, reads);
+			return;
+		case TokenID.NT_IMPERATIVE_EXPR: {
+			const innerBound = new Set(bound);
+			collectReadsImpl(node.children[0], innerBound, reads);
+			for (let i = 1; i < node.children.length; i++) {
+				const child = node.children[i];
+				if (child.typeID === TokenID.ITERATE) {
+					extendBoundInPlace(innerBound, child.children[0]);
+					collectReadsImpl(child.children[1], innerBound, reads);
+				} else if (child.typeID === TokenID.ASSIGN) {
+					collectReadsImpl(child.children[1], innerBound, reads);
+					extendBoundInPlace(innerBound, child.children[0]);
+				} else collectReadsImpl(child, innerBound, reads);
+			}
+			return;
+		}
+		case TokenID.NT_RECURSIVE_FULL:
+		case TokenID.NT_RECURSIVE_SHORT: {
+			collectReadsImpl(node.children[1], bound, reads);
+			const innerBound = extendBound(bound, node.children[0]);
+			if (node.typeID === TokenID.NT_RECURSIVE_FULL) {
+				collectReadsImpl(node.children[2], innerBound, reads);
+				collectReadsImpl(node.children[3], innerBound, reads);
+			} else collectReadsImpl(node.children[2], innerBound, reads);
+			return;
+		}
+		case TokenID.NT_FUNC_DEFINITION: {
+			const innerBound = extendBound(bound, node.children[0]);
+			collectReadsImpl(node.children[1], innerBound, reads);
+			return;
+		}
+		case TokenID.NT_FUNC_CALL:
+			for (let i = 1; i < node.children.length; i++) collectReadsImpl(node.children[i], bound, reads);
+			return;
+		case TokenID.LOGIC_AND:
+		case TokenID.LOGIC_OR:
+		case TokenID.LOGIC_IMPLICATION:
+			collectReadsImpl(node.children[0], bound, reads);
+			collectReadsImpl(node.children[1], bound, reads);
+			return;
+		default: for (const child of node.children) collectReadsImpl(child, bound, reads);
+	}
 }
 function extendBound(bound, declNode) {
-  const next = new Set(bound);
-  extendBoundInPlace(next, declNode);
-  return next;
+	const next = new Set(bound);
+	extendBoundInPlace(next, declNode);
+	return next;
 }
 function extendBoundInPlace(bound, declNode) {
-  switch (declNode.typeID) {
-    case TokenID.ID_LOCAL:
-    case TokenID.ID_RADICAL:
-      bound.add(getNodeText(declNode));
-      break;
-    case TokenID.NT_TUPLE_DECL:
-    case TokenID.NT_ENUM_DECL:
-      for (const child of declNode.children) {
-        extendBoundInPlace(bound, child);
-      }
-      break;
-    case TokenID.NT_ARG_DECL:
-      extendBoundInPlace(bound, declNode.children[0]);
-      break;
-  }
+	switch (declNode.typeID) {
+		case TokenID.ID_LOCAL:
+		case TokenID.ID_RADICAL:
+			bound.add(getNodeText(declNode));
+			break;
+		case TokenID.NT_TUPLE_DECL:
+		case TokenID.NT_ENUM_DECL:
+			for (const child of declNode.children) extendBoundInPlace(bound, child);
+			break;
+		case TokenID.NT_ARG_DECL:
+			extendBoundInPlace(bound, declNode.children[0]);
+			break;
+	}
 }
-export {
-  EvaluationCache,
-  EvaluationMetadata
-};
+//#endregion
+export { EvaluationCache, EvaluationMetadata };
+
 //# sourceMappingURL=evaluation-cache.js.map

package/dist/rslang/eval/evaluation-cache.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/parsing/ast.ts","../../../src/rslang/parser/token.ts","../../../src/rslang/eval/evaluation-cache.ts"],"sourcesContent":["import { type TreeCursor } from './lezer-tree';\n\nexport const TOKEN_ERROR = 0;\n\n/** Represents AST node data. */\ninterface AstNodeData extends Record<string, unknown> {\n  dataType: string;\n  value: unknown;\n}\n\n/** Represents AST structured node base. */\nexport interface AstNodeBase {\n  typeID: number;\n  data: AstNodeData;\n  annotation?: Record<string, unknown>;\n}\n\n/** Represents AST structured node. */\nexport interface AstNode extends Record<string, unknown>, AstNodeBase {\n  uid: number;\n  from: number;\n  to: number;\n  hasError: boolean;\n  parenthesis?: boolean;\n  parent: AstNode | null;\n  children: AstNode[];\n}\n\n/** Represents AST node. */\nexport interface FlatAstNode extends Record<string, unknown>, AstNodeBase {\n  uid: number;\n  parent: number | null;\n  from: number;\n  to: number;\n}\n\n/** Represents Syntax tree flat representation. */\nexport type FlatAST = FlatAstNode[];\n\n/** Builds AST tree from a given tree cursor, generating unique uids for each node. */\nexport function buildTree(cursor: TreeCursor): AstNode {\n  let nextUid = 1;\n  function genUid() {\n    return nextUid++;\n  }\n  return buildTreeInternal(cursor, null, genUid);\n}\n\n/** Flattens AST tree to a array form. */\nexport function flattenAst(node: AstNode, parent: number | null = null, out: FlatAST = []): FlatAST {\n  out.push({\n    uid: node.uid,\n    parent: parent,\n    typeID: node.typeID,\n    from: node.from,\n    to: node.to,\n    data: node.data,\n    annotation: node.annotation\n  });\n  for (const child of node.children) {\n    flattenAst(child, node.uid, out);\n  }\n  return out;\n}\n\n/** Visits AST tree in depth-first order. */\nexport function visitAstDFS(node: AstNode, callback: (node: AstNode) => void) {\n  for (const child of node.children) {\n    visitAstDFS(child, callback);\n  }\n  callback(node);\n}\n\n/** Finds and returns the AstNode with the given ui. */\nexport function findByUid(root: AstNode, uid: number): AstNode | null {\n  let found: AstNode | null = null;\n  visitAstDFS(root, node => {\n    if (node.uid === uid && !found) {\n      found = node;\n    }\n  });\n  return found;\n}\n\n/** Prints AST tree. */\nexport function printAst(node: AstNode, printNode: (node: AstNode) => string): string {\n  let children: string = '';\n  for (const child of node.children) {\n    children += `${printAst(child, printNode)}`;\n  }\n  return `[${printNode(node)}${children}]`;\n}\n\n/** Extracts node text. */\nexport function getNodeText(node: AstNode): string {\n  if (node.data.dataType === 'string' && typeof node.data.value === 'string') {\n    return node.data.value;\n  }\n  return `NO DATA NODE: ${node.typeID}`;\n}\n\n/** Extracts node indices. */\nexport function getNodeIndices(node: AstNode): number[] {\n  if (node.data.dataType === 'string[]' && Array.isArray(node.data.value)) {\n    return (node.data.value as string[]).map(s => parseInt(s, 10)).filter(n => !isNaN(n));\n  }\n  return [];\n}\n\n// ======== Internals ========\nfunction buildTreeInternal(cursor: TreeCursor, parent: AstNode | null = null, genUid: () => number): AstNode {\n  const node = cursor.node;\n\n  const result: AstNode = {\n    uid: genUid(),\n    typeID: node.type.isError ? 0 : node.type.id,\n    from: node.from,\n    to: node.to,\n    hasError: node.type.isError,\n    data: node.type.isError ? { dataType: 'null', value: null } : { dataType: 'string', value: node.type.name },\n    parent,\n    children: []\n  };\n\n  if (cursor.firstChild()) {\n    do {\n      const child = buildTreeInternal(cursor, result, genUid);\n      if (child.hasError) {\n        result.hasError = true;\n      }\n      result.children.push(child);\n    } while (cursor.nextSibling());\n    cursor.parent();\n  }\n  return result;\n}\n","import { TOKEN_ERROR } from '../../parsing';\n\n/** Represents RSLang token types. */\nexport const TokenID = {\n  // Global, local IDs and literals\n  ERROR: TOKEN_ERROR,\n\n  ID_LOCAL: 258,\n  ID_GLOBAL: 259,\n  ID_FUNCTION: 260,\n  ID_PREDICATE: 261,\n  ID_RADICAL: 262,\n  LIT_INTEGER: 263,\n  LIT_WHOLE_NUMBERS: 264,\n  LIT_EMPTYSET: 265,\n\n  // Arithmetic\n  PLUS: 266,\n  MINUS: 267,\n  MULTIPLY: 268,\n\n  // Integer predicate symbols\n  GREATER: 269,\n  LESSER: 270,\n  GREATER_OR_EQ: 271,\n  LESSER_OR_EQ: 272,\n\n  // Equality comparison\n  EQUAL: 273,\n  NOTEQUAL: 274,\n\n  // Logic predicate symbols\n  QUANTOR_UNIVERSAL: 275,\n  QUANTOR_EXISTS: 276,\n  LOGIC_NOT: 277,\n  LOGIC_EQUIVALENT: 278,\n  LOGIC_IMPLICATION: 279,\n  LOGIC_OR: 280,\n  LOGIC_AND: 281,\n\n  // Set theory predicate symbols\n  SET_IN: 282,\n  SET_NOT_IN: 283,\n  SUBSET: 284,\n  SUBSET_OR_EQ: 285,\n  NOT_SUBSET: 286,\n\n  // Set theory operators\n  DECART: 287,\n  SET_UNION: 288,\n  SET_INTERSECTION: 289,\n  SET_MINUS: 290,\n  SET_SYMMETRIC_MINUS: 291,\n  BOOLEAN: 292,\n\n  // Structure operations\n  BIGPR: 293,\n  SMALLPR: 294,\n  FILTER: 295,\n  CARD: 296,\n  BOOL: 297,\n  DEBOOL: 298,\n  REDUCE: 299,\n\n  // Term constructions prefixes\n  DECLARATIVE: 300,\n  RECURSIVE: 301,\n  IMPERATIVE: 302,\n\n  ITERATE: 303,\n  ASSIGN: 304,\n\n  // Punctuation\n  PUNCTUATION_DEFINE: 305,\n  PUNCTUATION_STRUCT: 306,\n  PUNCTUATION_PL: 307,\n  PUNCTUATION_PR: 308,\n  PUNCTUATION_CL: 309,\n  PUNCTUATION_CR: 310,\n  PUNCTUATION_SL: 311,\n  PUNCTUATION_SR: 312,\n  PUNCTUATION_BAR: 313,\n  PUNCTUATION_COMMA: 314,\n  PUNCTUATION_SEMICOLON: 315,\n\n  // ======= Non-terminal tokens =========\n  NT_ENUM_DECL: 316,\n  NT_TUPLE: 317,\n  NT_ENUMERATION: 318,\n  NT_TUPLE_DECL: 319,\n  NT_ARG_DECL: 320,\n\n  NT_FUNC_DEFINITION: 321,\n  NT_ARGUMENTS: 322,\n  NT_FUNC_CALL: 323,\n\n  NT_DECLARATIVE_EXPR: 324,\n  NT_IMPERATIVE_EXPR: 325,\n  NT_RECURSIVE_FULL: 326,\n  NT_RECURSIVE_SHORT: 327,\n\n  // ======= Helper tokens ========\n  INTERRUPT: 328,\n  END: 329\n} as const;\nexport type TokenID = (typeof TokenID)[keyof typeof TokenID];\n","/**\n * Module: Dependency metadata and per-run memoization for RSLang evaluation.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { TokenID } from '../parser/token';\n\nimport { type Value } from './value';\n\n/** Static metadata for one AST node. */\nexport interface EvalNodeInfo {\n  /** Local aliases this expression reads (for dependency stamping). */\n  reads: ReadonlySet<string>;\n  /** Stable key shared by structurally equivalent expressions. */\n  structuralKey: string;\n  /** Whether the node may be memoized for the current evaluation run. */\n  cacheable: boolean;\n}\n\n/** Per-evaluator cache of immutable AST dependency metadata (no runtime values). */\nexport class EvaluationMetadata {\n  private readonly byNode = new WeakMap<AstNode, EvalNodeInfo>();\n\n  get(node: AstNode): EvalNodeInfo {\n    let info = this.byNode.get(node);\n    if (!info) {\n      info = analyzeNode(node, new Set());\n      this.byNode.set(node, info);\n    }\n    return info;\n  }\n}\n\n/** Per-run memo of computed values (cleared on each {@link Evaluator.run}). */\nexport class EvaluationCache {\n  private entries = new Map<string, CacheEntry>();\n\n  /** Cache hits in the current evaluation run (for tests/diagnostics). */\n  hits = 0;\n\n  /** Returns cached value, or `undefined` on miss or stamp mismatch. */\n  lookup(structuralKey: string, stamp: string): Value | undefined {\n    const entry = this.entries.get(structuralKey);\n    if (entry?.stamp !== stamp) {\n      return undefined;\n    }\n    this.hits++;\n    return entry.value;\n  }\n\n  /** Stores one value per structural key (replaces previous stamp). */\n  store(structuralKey: string, stamp: string, value: Value): void {\n    this.entries.set(structuralKey, { stamp, value });\n  }\n\n  clear(): void {\n    this.entries.clear();\n    this.hits = 0;\n  }\n}\n\ninterface CacheEntry {\n  stamp: string;\n  value: Value;\n}\n\nfunction analyzeNode(node: AstNode, bound: Set<string>): EvalNodeInfo {\n  const reads = collectReads(node, bound);\n  const structuralKey = buildStructuralKey(node);\n  const cacheable = isCacheableNode(node);\n  return { reads, structuralKey, cacheable };\n}\n\nfunction isCacheableNode(node: AstNode): boolean {\n  switch (node.typeID) {\n    case TokenID.ASSIGN:\n    case TokenID.ITERATE:\n    case TokenID.NT_IMPERATIVE_EXPR:\n    case TokenID.NT_DECLARATIVE_EXPR:\n    case TokenID.NT_RECURSIVE_FULL:\n    case TokenID.NT_RECURSIVE_SHORT:\n    case TokenID.QUANTOR_UNIVERSAL:\n    case TokenID.QUANTOR_EXISTS:\n    case TokenID.LOGIC_AND:\n    case TokenID.LOGIC_OR:\n    case TokenID.LOGIC_IMPLICATION:\n    case TokenID.NT_FUNC_DEFINITION:\n    case TokenID.LIT_INTEGER:\n    case TokenID.LIT_EMPTYSET:\n    case TokenID.LIT_WHOLE_NUMBERS:\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_RADICAL:\n    case TokenID.ID_GLOBAL:\n      return false;\n    default:\n      return !node.hasError;\n  }\n}\n\nfunction buildStructuralKey(node: AstNode): string {\n  switch (node.typeID) {\n    case TokenID.ID_GLOBAL:\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_RADICAL:\n    case TokenID.LIT_INTEGER:\n    case TokenID.LIT_EMPTYSET:\n    case TokenID.LIT_WHOLE_NUMBERS:\n      return `${node.typeID}:${nodeTextKey(node)}`;\n\n    case TokenID.NT_FUNC_CALL:\n      return `${node.typeID}:${nodeTextKey(node.children[0])}(${node.children\n        .slice(1)\n        .map(buildStructuralKey)\n        .join(',')})`;\n\n    case TokenID.BIGPR:\n    case TokenID.SMALLPR:\n    case TokenID.FILTER:\n      return `${node.typeID}:${indicesKey(node)}(${node.children.map(buildStructuralKey).join(',')})`;\n\n    default:\n      return `${node.typeID}(${node.children.map(buildStructuralKey).join(',')})`;\n  }\n}\n\nfunction nodeTextKey(node: AstNode): string {\n  if (node.data.dataType === 'number') {\n    return String(node.data.value);\n  }\n  return getNodeText(node);\n}\n\nfunction indicesKey(node: AstNode): string {\n  return getNodeIndices(node).join('.');\n}\n\nfunction collectReads(node: AstNode, bound: Set<string>): Set<string> {\n  const reads = new Set<string>();\n  collectReadsImpl(node, bound, reads);\n  return reads;\n}\n\nfunction collectReadsImpl(node: AstNode, bound: Set<string>, reads: Set<string>): void {\n  switch (node.typeID) {\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_RADICAL: {\n      reads.add(getNodeText(node));\n      return;\n    }\n\n    case TokenID.QUANTOR_UNIVERSAL:\n    case TokenID.QUANTOR_EXISTS: {\n      collectReadsImpl(node.children[1], bound, reads);\n      const innerBound = extendBound(bound, node.children[0]);\n      collectReadsImpl(node.children[2], innerBound, reads);\n      return;\n    }\n\n    case TokenID.NT_DECLARATIVE_EXPR: {\n      collectReadsImpl(node.children[1], bound, reads);\n      const innerBound = extendBound(bound, node.children[0]);\n      collectReadsImpl(node.children[2], innerBound, reads);\n      return;\n    }\n\n    case TokenID.ITERATE: {\n      collectReadsImpl(node.children[1], bound, reads);\n      return;\n    }\n\n    case TokenID.ASSIGN: {\n      collectReadsImpl(node.children[1], bound, reads);\n      return;\n    }\n\n    case TokenID.NT_IMPERATIVE_EXPR: {\n      const innerBound = new Set(bound);\n      collectReadsImpl(node.children[0], innerBound, reads);\n      for (let i = 1; i < node.children.length; i++) {\n        const child = node.children[i];\n        if (child.typeID === TokenID.ITERATE) {\n          extendBoundInPlace(innerBound, child.children[0]);\n          collectReadsImpl(child.children[1], innerBound, reads);\n        } else if (child.typeID === TokenID.ASSIGN) {\n          collectReadsImpl(child.children[1], innerBound, reads);\n          extendBoundInPlace(innerBound, child.children[0]);\n        } else {\n          collectReadsImpl(child, innerBound, reads);\n        }\n      }\n      return;\n    }\n\n    case TokenID.NT_RECURSIVE_FULL:\n    case TokenID.NT_RECURSIVE_SHORT: {\n      collectReadsImpl(node.children[1], bound, reads);\n      const innerBound = extendBound(bound, node.children[0]);\n      if (node.typeID === TokenID.NT_RECURSIVE_FULL) {\n        collectReadsImpl(node.children[2], innerBound, reads);\n        collectReadsImpl(node.children[3], innerBound, reads);\n      } else {\n        collectReadsImpl(node.children[2], innerBound, reads);\n      }\n      return;\n    }\n\n    case TokenID.NT_FUNC_DEFINITION: {\n      const innerBound = extendBound(bound, node.children[0]);\n      collectReadsImpl(node.children[1], innerBound, reads);\n      return;\n    }\n\n    case TokenID.NT_FUNC_CALL: {\n      for (let i = 1; i < node.children.length; i++) {\n        collectReadsImpl(node.children[i], bound, reads);\n      }\n      return;\n    }\n\n    case TokenID.LOGIC_AND:\n    case TokenID.LOGIC_OR:\n    case TokenID.LOGIC_IMPLICATION: {\n      collectReadsImpl(node.children[0], bound, reads);\n      collectReadsImpl(node.children[1], bound, reads);\n      return;\n    }\n\n    default:\n      for (const child of node.children) {\n        collectReadsImpl(child, bound, reads);\n      }\n  }\n}\n\nfunction extendBound(bound: Set<string>, declNode: AstNode): Set<string> {\n  const next = new Set(bound);\n  extendBoundInPlace(next, declNode);\n  return next;\n}\n\nfunction extendBoundInPlace(bound: Set<string>, declNode: AstNode): void {\n  switch (declNode.typeID) {\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_RADICAL:\n      bound.add(getNodeText(declNode));\n      break;\n    case TokenID.NT_TUPLE_DECL:\n    case TokenID.NT_ENUM_DECL:\n      for (const child of declNode.children) {\n        extendBoundInPlace(bound, child);\n      }\n      break;\n    case TokenID.NT_ARG_DECL:\n      extendBoundInPlace(bound, declNode.children[0]);\n      break;\n  }\n}\n"],"mappings":";AAEO,IAAM,cAAc;AA4FpB,SAAS,YAAY,MAAuB;AACjD,MAAI,KAAK,KAAK,aAAa,YAAY,OAAO,KAAK,KAAK,UAAU,UAAU;AAC1E,WAAO,KAAK,KAAK;AAAA,EACnB;AACA,SAAO,iBAAiB,KAAK,MAAM;AACrC;AAGO,SAAS,eAAe,MAAyB;AACtD,MAAI,KAAK,KAAK,aAAa,cAAc,MAAM,QAAQ,KAAK,KAAK,KAAK,GAAG;AACvE,WAAQ,KAAK,KAAK,MAAmB,IAAI,OAAK,SAAS,GAAG,EAAE,CAAC,EAAE,OAAO,OAAK,CAAC,MAAM,CAAC,CAAC;AAAA,EACtF;AACA,SAAO,CAAC;AACV;;;ACxGO,IAAM,UAAU;AAAA;AAAA,EAErB,OAAO;AAAA,EAEP,UAAU;AAAA,EACV,WAAW;AAAA,EACX,aAAa;AAAA,EACb,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,mBAAmB;AAAA,EACnB,cAAc;AAAA;AAAA,EAGd,MAAM;AAAA,EACN,OAAO;AAAA,EACP,UAAU;AAAA;AAAA,EAGV,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,cAAc;AAAA;AAAA,EAGd,OAAO;AAAA,EACP,UAAU;AAAA;AAAA,EAGV,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,WAAW;AAAA,EACX,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,UAAU;AAAA,EACV,WAAW;AAAA;AAAA,EAGX,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,QAAQ;AAAA,EACR,cAAc;AAAA,EACd,YAAY;AAAA;AAAA,EAGZ,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,kBAAkB;AAAA,EAClB,WAAW;AAAA,EACX,qBAAqB;AAAA,EACrB,SAAS;AAAA;AAAA,EAGT,OAAO;AAAA,EACP,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,QAAQ;AAAA;AAAA,EAGR,aAAa;AAAA,EACb,WAAW;AAAA,EACX,YAAY;AAAA,EAEZ,SAAS;AAAA,EACT,QAAQ;AAAA;AAAA,EAGR,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,uBAAuB;AAAA;AAAA,EAGvB,cAAc;AAAA,EACd,UAAU;AAAA,EACV,gBAAgB;AAAA,EAChB,eAAe;AAAA,EACf,aAAa;AAAA,EAEb,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,cAAc;AAAA,EAEd,qBAAqB;AAAA,EACrB,oBAAoB;AAAA,EACpB,mBAAmB;AAAA,EACnB,oBAAoB;AAAA;AAAA,EAGpB,WAAW;AAAA,EACX,KAAK;AACP;;;ACpFO,IAAM,qBAAN,MAAyB;AAAA,EACb,SAAS,oBAAI,QAA+B;AAAA,EAE7D,IAAI,MAA6B;AAC/B,QAAI,OAAO,KAAK,OAAO,IAAI,IAAI;AAC/B,QAAI,CAAC,MAAM;AACT,aAAO,YAAY,MAAM,oBAAI,IAAI,CAAC;AAClC,WAAK,OAAO,IAAI,MAAM,IAAI;AAAA,IAC5B;AACA,WAAO;AAAA,EACT;AACF;AAGO,IAAM,kBAAN,MAAsB;AAAA,EACnB,UAAU,oBAAI,IAAwB;AAAA;AAAA,EAG9C,OAAO;AAAA;AAAA,EAGP,OAAO,eAAuB,OAAkC;AAC9D,UAAM,QAAQ,KAAK,QAAQ,IAAI,aAAa;AAC5C,QAAI,OAAO,UAAU,OAAO;AAC1B,aAAO;AAAA,IACT;AACA,SAAK;AACL,WAAO,MAAM;AAAA,EACf;AAAA;AAAA,EAGA,MAAM,eAAuB,OAAe,OAAoB;AAC9D,SAAK,QAAQ,IAAI,eAAe,EAAE,OAAO,MAAM,CAAC;AAAA,EAClD;AAAA,EAEA,QAAc;AACZ,SAAK,QAAQ,MAAM;AACnB,SAAK,OAAO;AAAA,EACd;AACF;AAOA,SAAS,YAAY,MAAe,OAAkC;AACpE,QAAM,QAAQ,aAAa,MAAM,KAAK;AACtC,QAAM,gBAAgB,mBAAmB,IAAI;AAC7C,QAAM,YAAY,gBAAgB,IAAI;AACtC,SAAO,EAAE,OAAO,eAAe,UAAU;AAC3C;AAEA,SAAS,gBAAgB,MAAwB;AAC/C,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,IACT;AACE,aAAO,CAAC,KAAK;AAAA,EACjB;AACF;AAEA,SAAS,mBAAmB,MAAuB;AACjD,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO,GAAG,KAAK,MAAM,IAAI,YAAY,IAAI,CAAC;AAAA,IAE5C,KAAK,QAAQ;AACX,aAAO,GAAG,KAAK,MAAM,IAAI,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,KAAK,SAC5D,MAAM,CAAC,EACP,IAAI,kBAAkB,EACtB,KAAK,GAAG,CAAC;AAAA,IAEd,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO,GAAG,KAAK,MAAM,IAAI,WAAW,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,kBAAkB,EAAE,KAAK,GAAG,CAAC;AAAA,IAE9F;AACE,aAAO,GAAG,KAAK,MAAM,IAAI,KAAK,SAAS,IAAI,kBAAkB,EAAE,KAAK,GAAG,CAAC;AAAA,EAC5E;AACF;AAEA,SAAS,YAAY,MAAuB;AAC1C,MAAI,KAAK,KAAK,aAAa,UAAU;AACnC,WAAO,OAAO,KAAK,KAAK,KAAK;AAAA,EAC/B;AACA,SAAO,YAAY,IAAI;AACzB;AAEA,SAAS,WAAW,MAAuB;AACzC,SAAO,eAAe,IAAI,EAAE,KAAK,GAAG;AACtC;AAEA,SAAS,aAAa,MAAe,OAAiC;AACpE,QAAM,QAAQ,oBAAI,IAAY;AAC9B,mBAAiB,MAAM,OAAO,KAAK;AACnC,SAAO;AACT;AAEA,SAAS,iBAAiB,MAAe,OAAoB,OAA0B;AACrF,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ,YAAY;AACvB,YAAM,IAAI,YAAY,IAAI,CAAC;AAC3B;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ,gBAAgB;AAC3B,uBAAiB,KAAK,SAAS,CAAC,GAAG,OAAO,KAAK;AAC/C,YAAM,aAAa,YAAY,OAAO,KAAK,SAAS,CAAC,CAAC;AACtD,uBAAiB,KAAK,SAAS,CAAC,GAAG,YAAY,KAAK;AACpD;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ,qBAAqB;AAChC,uBAAiB,KAAK,SAAS,CAAC,GAAG,OAAO,KAAK;AAC/C,YAAM,aAAa,YAAY,OAAO,KAAK,SAAS,CAAC,CAAC;AACtD,uBAAiB,KAAK,SAAS,CAAC,GAAG,YAAY,KAAK;AACpD;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ,SAAS;AACpB,uBAAiB,KAAK,SAAS,CAAC,GAAG,OAAO,KAAK;AAC/C;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ,QAAQ;AACnB,uBAAiB,KAAK,SAAS,CAAC,GAAG,OAAO,KAAK;AAC/C;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ,oBAAoB;AAC/B,YAAM,aAAa,IAAI,IAAI,KAAK;AAChC,uBAAiB,KAAK,SAAS,CAAC,GAAG,YAAY,KAAK;AACpD,eAAS,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;AAC7C,cAAM,QAAQ,KAAK,SAAS,CAAC;AAC7B,YAAI,MAAM,WAAW,QAAQ,SAAS;AACpC,6BAAmB,YAAY,MAAM,SAAS,CAAC,CAAC;AAChD,2BAAiB,MAAM,SAAS,CAAC,GAAG,YAAY,KAAK;AAAA,QACvD,WAAW,MAAM,WAAW,QAAQ,QAAQ;AAC1C,2BAAiB,MAAM,SAAS,CAAC,GAAG,YAAY,KAAK;AACrD,6BAAmB,YAAY,MAAM,SAAS,CAAC,CAAC;AAAA,QAClD,OAAO;AACL,2BAAiB,OAAO,YAAY,KAAK;AAAA,QAC3C;AAAA,MACF;AACA;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ,oBAAoB;AAC/B,uBAAiB,KAAK,SAAS,CAAC,GAAG,OAAO,KAAK;AAC/C,YAAM,aAAa,YAAY,OAAO,KAAK,SAAS,CAAC,CAAC;AACtD,UAAI,KAAK,WAAW,QAAQ,mBAAmB;AAC7C,yBAAiB,KAAK,SAAS,CAAC,GAAG,YAAY,KAAK;AACpD,yBAAiB,KAAK,SAAS,CAAC,GAAG,YAAY,KAAK;AAAA,MACtD,OAAO;AACL,yBAAiB,KAAK,SAAS,CAAC,GAAG,YAAY,KAAK;AAAA,MACtD;AACA;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ,oBAAoB;AAC/B,YAAM,aAAa,YAAY,OAAO,KAAK,SAAS,CAAC,CAAC;AACtD,uBAAiB,KAAK,SAAS,CAAC,GAAG,YAAY,KAAK;AACpD;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ,cAAc;AACzB,eAAS,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;AAC7C,yBAAiB,KAAK,SAAS,CAAC,GAAG,OAAO,KAAK;AAAA,MACjD;AACA;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ,mBAAmB;AAC9B,uBAAiB,KAAK,SAAS,CAAC,GAAG,OAAO,KAAK;AAC/C,uBAAiB,KAAK,SAAS,CAAC,GAAG,OAAO,KAAK;AAC/C;AAAA,IACF;AAAA,IAEA;AACE,iBAAW,SAAS,KAAK,UAAU;AACjC,yBAAiB,OAAO,OAAO,KAAK;AAAA,MACtC;AAAA,EACJ;AACF;AAEA,SAAS,YAAY,OAAoB,UAAgC;AACvE,QAAM,OAAO,IAAI,IAAI,KAAK;AAC1B,qBAAmB,MAAM,QAAQ;AACjC,SAAO;AACT;AAEA,SAAS,mBAAmB,OAAoB,UAAyB;AACvE,UAAQ,SAAS,QAAQ;AAAA,IACvB,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,YAAM,IAAI,YAAY,QAAQ,CAAC;AAC/B;AAAA,IACF,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,iBAAW,SAAS,SAAS,UAAU;AACrC,2BAAmB,OAAO,KAAK;AAAA,MACjC;AACA;AAAA,IACF,KAAK,QAAQ;AACX,yBAAmB,OAAO,SAAS,SAAS,CAAC,CAAC;AAC9C;AAAA,EACJ;AACF;","names":[]}
+{"version":3,"file":"evaluation-cache.js","names":[],"sources":["../../../src/rslang/eval/evaluation-cache.ts"],"sourcesContent":["/**\n * Module: Dependency metadata and per-run memoization for RSLang evaluation.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { TokenID } from '../parser/token';\n\nimport { type Value } from './value';\n\n/** Static metadata for one AST node. */\nexport interface EvalNodeInfo {\n  /** Local aliases this expression reads (for dependency stamping). */\n  reads: ReadonlySet<string>;\n  /** Stable key shared by structurally equivalent expressions. */\n  structuralKey: string;\n  /** Whether the node may be memoized for the current evaluation run. */\n  cacheable: boolean;\n}\n\n/** Per-evaluator cache of immutable AST dependency metadata (no runtime values). */\nexport class EvaluationMetadata {\n  private readonly byNode = new WeakMap<AstNode, EvalNodeInfo>();\n\n  get(node: AstNode): EvalNodeInfo {\n    let info = this.byNode.get(node);\n    if (!info) {\n      info = analyzeNode(node, new Set());\n      this.byNode.set(node, info);\n    }\n    return info;\n  }\n}\n\n/** Per-run memo of computed values (cleared on each {@link Evaluator.run}). */\nexport class EvaluationCache {\n  private entries = new Map<string, CacheEntry>();\n\n  /** Cache hits in the current evaluation run (for tests/diagnostics). */\n  hits = 0;\n\n  /** Returns cached value, or `undefined` on miss or stamp mismatch. */\n  lookup(structuralKey: string, stamp: string): Value | undefined {\n    const entry = this.entries.get(structuralKey);\n    if (entry?.stamp !== stamp) {\n      return undefined;\n    }\n    this.hits++;\n    return entry.value;\n  }\n\n  /** Stores one value per structural key (replaces previous stamp). */\n  store(structuralKey: string, stamp: string, value: Value): void {\n    this.entries.set(structuralKey, { stamp, value });\n  }\n\n  clear(): void {\n    this.entries.clear();\n    this.hits = 0;\n  }\n}\n\ninterface CacheEntry {\n  stamp: string;\n  value: Value;\n}\n\nfunction analyzeNode(node: AstNode, bound: Set<string>): EvalNodeInfo {\n  const reads = collectReads(node, bound);\n  const structuralKey = buildStructuralKey(node);\n  const cacheable = isCacheableNode(node);\n  return { reads, structuralKey, cacheable };\n}\n\nfunction isCacheableNode(node: AstNode): boolean {\n  switch (node.typeID) {\n    case TokenID.ASSIGN:\n    case TokenID.ITERATE:\n    case TokenID.NT_IMPERATIVE_EXPR:\n    case TokenID.NT_DECLARATIVE_EXPR:\n    case TokenID.NT_RECURSIVE_FULL:\n    case TokenID.NT_RECURSIVE_SHORT:\n    case TokenID.QUANTOR_UNIVERSAL:\n    case TokenID.QUANTOR_EXISTS:\n    case TokenID.LOGIC_AND:\n    case TokenID.LOGIC_OR:\n    case TokenID.LOGIC_IMPLICATION:\n    case TokenID.NT_FUNC_DEFINITION:\n    case TokenID.LIT_INTEGER:\n    case TokenID.LIT_EMPTYSET:\n    case TokenID.LIT_WHOLE_NUMBERS:\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_RADICAL:\n    case TokenID.ID_GLOBAL:\n      return false;\n    default:\n      return !node.hasError;\n  }\n}\n\nfunction buildStructuralKey(node: AstNode): string {\n  switch (node.typeID) {\n    case TokenID.ID_GLOBAL:\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_RADICAL:\n    case TokenID.LIT_INTEGER:\n    case TokenID.LIT_EMPTYSET:\n    case TokenID.LIT_WHOLE_NUMBERS:\n      return `${node.typeID}:${nodeTextKey(node)}`;\n\n    case TokenID.NT_FUNC_CALL:\n      return `${node.typeID}:${nodeTextKey(node.children[0])}(${node.children\n        .slice(1)\n        .map(buildStructuralKey)\n        .join(',')})`;\n\n    case TokenID.BIGPR:\n    case TokenID.SMALLPR:\n    case TokenID.FILTER:\n      return `${node.typeID}:${indicesKey(node)}(${node.children.map(buildStructuralKey).join(',')})`;\n\n    default:\n      return `${node.typeID}(${node.children.map(buildStructuralKey).join(',')})`;\n  }\n}\n\nfunction nodeTextKey(node: AstNode): string {\n  if (node.data.dataType === 'number') {\n    return String(node.data.value);\n  }\n  return getNodeText(node);\n}\n\nfunction indicesKey(node: AstNode): string {\n  return getNodeIndices(node).join('.');\n}\n\nfunction collectReads(node: AstNode, bound: Set<string>): Set<string> {\n  const reads = new Set<string>();\n  collectReadsImpl(node, bound, reads);\n  return reads;\n}\n\nfunction collectReadsImpl(node: AstNode, bound: Set<string>, reads: Set<string>): void {\n  switch (node.typeID) {\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_RADICAL: {\n      reads.add(getNodeText(node));\n      return;\n    }\n\n    case TokenID.QUANTOR_UNIVERSAL:\n    case TokenID.QUANTOR_EXISTS: {\n      collectReadsImpl(node.children[1], bound, reads);\n      const innerBound = extendBound(bound, node.children[0]);\n      collectReadsImpl(node.children[2], innerBound, reads);\n      return;\n    }\n\n    case TokenID.NT_DECLARATIVE_EXPR: {\n      collectReadsImpl(node.children[1], bound, reads);\n      const innerBound = extendBound(bound, node.children[0]);\n      collectReadsImpl(node.children[2], innerBound, reads);\n      return;\n    }\n\n    case TokenID.ITERATE: {\n      collectReadsImpl(node.children[1], bound, reads);\n      return;\n    }\n\n    case TokenID.ASSIGN: {\n      collectReadsImpl(node.children[1], bound, reads);\n      return;\n    }\n\n    case TokenID.NT_IMPERATIVE_EXPR: {\n      const innerBound = new Set(bound);\n      collectReadsImpl(node.children[0], innerBound, reads);\n      for (let i = 1; i < node.children.length; i++) {\n        const child = node.children[i];\n        if (child.typeID === TokenID.ITERATE) {\n          extendBoundInPlace(innerBound, child.children[0]);\n          collectReadsImpl(child.children[1], innerBound, reads);\n        } else if (child.typeID === TokenID.ASSIGN) {\n          collectReadsImpl(child.children[1], innerBound, reads);\n          extendBoundInPlace(innerBound, child.children[0]);\n        } else {\n          collectReadsImpl(child, innerBound, reads);\n        }\n      }\n      return;\n    }\n\n    case TokenID.NT_RECURSIVE_FULL:\n    case TokenID.NT_RECURSIVE_SHORT: {\n      collectReadsImpl(node.children[1], bound, reads);\n      const innerBound = extendBound(bound, node.children[0]);\n      if (node.typeID === TokenID.NT_RECURSIVE_FULL) {\n        collectReadsImpl(node.children[2], innerBound, reads);\n        collectReadsImpl(node.children[3], innerBound, reads);\n      } else {\n        collectReadsImpl(node.children[2], innerBound, reads);\n      }\n      return;\n    }\n\n    case TokenID.NT_FUNC_DEFINITION: {\n      const innerBound = extendBound(bound, node.children[0]);\n      collectReadsImpl(node.children[1], innerBound, reads);\n      return;\n    }\n\n    case TokenID.NT_FUNC_CALL: {\n      for (let i = 1; i < node.children.length; i++) {\n        collectReadsImpl(node.children[i], bound, reads);\n      }\n      return;\n    }\n\n    case TokenID.LOGIC_AND:\n    case TokenID.LOGIC_OR:\n    case TokenID.LOGIC_IMPLICATION: {\n      collectReadsImpl(node.children[0], bound, reads);\n      collectReadsImpl(node.children[1], bound, reads);\n      return;\n    }\n\n    default:\n      for (const child of node.children) {\n        collectReadsImpl(child, bound, reads);\n      }\n  }\n}\n\nfunction extendBound(bound: Set<string>, declNode: AstNode): Set<string> {\n  const next = new Set(bound);\n  extendBoundInPlace(next, declNode);\n  return next;\n}\n\nfunction extendBoundInPlace(bound: Set<string>, declNode: AstNode): void {\n  switch (declNode.typeID) {\n    case TokenID.ID_LOCAL:\n    case TokenID.ID_RADICAL:\n      bound.add(getNodeText(declNode));\n      break;\n    case TokenID.NT_TUPLE_DECL:\n    case TokenID.NT_ENUM_DECL:\n      for (const child of declNode.children) {\n        extendBoundInPlace(bound, child);\n      }\n      break;\n    case TokenID.NT_ARG_DECL:\n      extendBoundInPlace(bound, declNode.children[0]);\n      break;\n  }\n}\n"],"mappings":";;;;;;;;AAoBA,IAAa,qBAAb,MAAgC;CAC9B,yBAA0B,IAAI,QAA+B;CAE7D,IAAI,MAA6B;EAC/B,IAAI,OAAO,KAAK,OAAO,IAAI,IAAI;EAC/B,IAAI,CAAC,MAAM;GACT,OAAO,YAAY,sBAAM,IAAI,IAAI,CAAC;GAClC,KAAK,OAAO,IAAI,MAAM,IAAI;EAC5B;EACA,OAAO;CACT;AACF;;AAGA,IAAa,kBAAb,MAA6B;CAC3B,0BAAkB,IAAI,IAAwB;;CAG9C,OAAO;;CAGP,OAAO,eAAuB,OAAkC;EAC9D,MAAM,QAAQ,KAAK,QAAQ,IAAI,aAAa;EAC5C,IAAI,OAAO,UAAU,OACnB;EAEF,KAAK;EACL,OAAO,MAAM;CACf;;CAGA,MAAM,eAAuB,OAAe,OAAoB;EAC9D,KAAK,QAAQ,IAAI,eAAe;GAAE;GAAO;EAAM,CAAC;CAClD;CAEA,QAAc;EACZ,KAAK,QAAQ,MAAM;EACnB,KAAK,OAAO;CACd;AACF;AAOA,SAAS,YAAY,MAAe,OAAkC;CAIpE,OAAO;EAAE,OAHK,aAAa,MAAM,KAGxB;EAAO,eAFM,mBAAmB,IAEzB;EAAe,WADb,gBAAgB,IACH;CAAU;AAC3C;AAEA,SAAS,gBAAgB,MAAwB;CAC/C,QAAQ,KAAK,QAAb;EACE,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,WACX,OAAO;EACT,SACE,OAAO,CAAC,KAAK;CACjB;AACF;AAEA,SAAS,mBAAmB,MAAuB;CACjD,QAAQ,KAAK,QAAb;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,mBACX,OAAO,GAAG,KAAK,OAAO,GAAG,YAAY,IAAI;EAE3C,KAAK,QAAQ,cACX,OAAO,GAAG,KAAK,OAAO,GAAG,YAAY,KAAK,SAAS,EAAE,EAAE,GAAG,KAAK,SAC5D,MAAM,CAAC,CAAC,CACR,IAAI,kBAAkB,CAAC,CACvB,KAAK,GAAG,EAAE;EAEf,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,QACX,OAAO,GAAG,KAAK,OAAO,GAAG,WAAW,IAAI,EAAE,GAAG,KAAK,SAAS,IAAI,kBAAkB,CAAC,CAAC,KAAK,GAAG,EAAE;EAE/F,SACE,OAAO,GAAG,KAAK,OAAO,GAAG,KAAK,SAAS,IAAI,kBAAkB,CAAC,CAAC,KAAK,GAAG,EAAE;CAC7E;AACF;AAEA,SAAS,YAAY,MAAuB;CAC1C,IAAI,KAAK,KAAK,aAAa,UACzB,OAAO,OAAO,KAAK,KAAK,KAAK;CAE/B,OAAO,YAAY,IAAI;AACzB;AAEA,SAAS,WAAW,MAAuB;CACzC,OAAO,eAAe,IAAI,CAAC,CAAC,KAAK,GAAG;AACtC;AAEA,SAAS,aAAa,MAAe,OAAiC;CACpE,MAAM,wBAAQ,IAAI,IAAY;CAC9B,iBAAiB,MAAM,OAAO,KAAK;CACnC,OAAO;AACT;AAEA,SAAS,iBAAiB,MAAe,OAAoB,OAA0B;CACrF,QAAQ,KAAK,QAAb;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;GACX,MAAM,IAAI,YAAY,IAAI,CAAC;GAC3B;EAGF,KAAK,QAAQ;EACb,KAAK,QAAQ,gBAAgB;GAC3B,iBAAiB,KAAK,SAAS,IAAI,OAAO,KAAK;GAC/C,MAAM,aAAa,YAAY,OAAO,KAAK,SAAS,EAAE;GACtD,iBAAiB,KAAK,SAAS,IAAI,YAAY,KAAK;GACpD;EACF;EAEA,KAAK,QAAQ,qBAAqB;GAChC,iBAAiB,KAAK,SAAS,IAAI,OAAO,KAAK;GAC/C,MAAM,aAAa,YAAY,OAAO,KAAK,SAAS,EAAE;GACtD,iBAAiB,KAAK,SAAS,IAAI,YAAY,KAAK;GACpD;EACF;EAEA,KAAK,QAAQ;GACX,iBAAiB,KAAK,SAAS,IAAI,OAAO,KAAK;GAC/C;EAGF,KAAK,QAAQ;GACX,iBAAiB,KAAK,SAAS,IAAI,OAAO,KAAK;GAC/C;EAGF,KAAK,QAAQ,oBAAoB;GAC/B,MAAM,aAAa,IAAI,IAAI,KAAK;GAChC,iBAAiB,KAAK,SAAS,IAAI,YAAY,KAAK;GACpD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;IAC7C,MAAM,QAAQ,KAAK,SAAS;IAC5B,IAAI,MAAM,WAAW,QAAQ,SAAS;KACpC,mBAAmB,YAAY,MAAM,SAAS,EAAE;KAChD,iBAAiB,MAAM,SAAS,IAAI,YAAY,KAAK;IACvD,OAAO,IAAI,MAAM,WAAW,QAAQ,QAAQ;KAC1C,iBAAiB,MAAM,SAAS,IAAI,YAAY,KAAK;KACrD,mBAAmB,YAAY,MAAM,SAAS,EAAE;IAClD,OACE,iBAAiB,OAAO,YAAY,KAAK;GAE7C;GACA;EACF;EAEA,KAAK,QAAQ;EACb,KAAK,QAAQ,oBAAoB;GAC/B,iBAAiB,KAAK,SAAS,IAAI,OAAO,KAAK;GAC/C,MAAM,aAAa,YAAY,OAAO,KAAK,SAAS,EAAE;GACtD,IAAI,KAAK,WAAW,QAAQ,mBAAmB;IAC7C,iBAAiB,KAAK,SAAS,IAAI,YAAY,KAAK;IACpD,iBAAiB,KAAK,SAAS,IAAI,YAAY,KAAK;GACtD,OACE,iBAAiB,KAAK,SAAS,IAAI,YAAY,KAAK;GAEtD;EACF;EAEA,KAAK,QAAQ,oBAAoB;GAC/B,MAAM,aAAa,YAAY,OAAO,KAAK,SAAS,EAAE;GACtD,iBAAiB,KAAK,SAAS,IAAI,YAAY,KAAK;GACpD;EACF;EAEA,KAAK,QAAQ;GACX,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KACxC,iBAAiB,KAAK,SAAS,IAAI,OAAO,KAAK;GAEjD;EAGF,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;GACX,iBAAiB,KAAK,SAAS,IAAI,OAAO,KAAK;GAC/C,iBAAiB,KAAK,SAAS,IAAI,OAAO,KAAK;GAC/C;EAGF,SACE,KAAK,MAAM,SAAS,KAAK,UACvB,iBAAiB,OAAO,OAAO,KAAK;CAE1C;AACF;AAEA,SAAS,YAAY,OAAoB,UAAgC;CACvE,MAAM,OAAO,IAAI,IAAI,KAAK;CAC1B,mBAAmB,MAAM,QAAQ;CACjC,OAAO;AACT;AAEA,SAAS,mBAAmB,OAAoB,UAAyB;CACvE,QAAQ,SAAS,QAAjB;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;GACX,MAAM,IAAI,YAAY,QAAQ,CAAC;GAC/B;EACF,KAAK,QAAQ;EACb,KAAK,QAAQ;GACX,KAAK,MAAM,SAAS,SAAS,UAC3B,mBAAmB,OAAO,KAAK;GAEjC;EACF,KAAK,QAAQ;GACX,mBAAmB,OAAO,SAAS,SAAS,EAAE;GAC9C;CACJ;AACF"}