@veltra/sheet 2.0.1 → 2.1.1

package/dist/core/formula/dependency-graph.js

@@ -1,269 +0,0 @@
-import { cellKey, rangeContainsAddress } from "../address.js";
-import { collectReferences } from "./ast.js";
-import { formulaError, isFormulaError, isFormulaErrorCode } from "./errors.js";
-import { evaluateAst } from "./evaluator.js";
-import { invokeFormulaFunction } from "./functions.js";
-import { FormulaParseError } from "./tokenizer.js";
-import { parseFormula } from "./parser.js";
-//#region src/core/formula/dependency-graph.ts
-var DependencyGraph = class {
-	sheets = /* @__PURE__ */ new Map();
-	/** 正向索引宿主：sheetName → cellKey → 公式节点 */
-	nodes = /* @__PURE__ */ new Map();
-	/** 反向索引（单格引用）：sheetName → cellKey → 依赖者集合 */
-	exact = /* @__PURE__ */ new Map();
-	/** 反向索引（区域引用）：sheetName → { 区域, 依赖者 } 集合（线性扫描） */
-	ranged = /* @__PURE__ */ new Map();
-	registerSheet(sheet) {
-		this.sheets.set(sheet.name, sheet);
-	}
-	/** 注销 sheet 并移除其全部公式节点（引用它的公式在下次重算时得 #REF!） */
-	unregisterSheet(sheet) {
-		if (this.sheets.get(sheet.name) !== sheet) return;
-		this.sheets.delete(sheet.name);
-		const sheetNodes = this.nodes.get(sheet.name);
-		if (sheetNodes) for (const node of sheetNodes.values()) this.removeNode(node);
-	}
-	getSheet(name) {
-		return this.sheets.get(name);
-	}
-	getNode(sheetName, addr) {
-		return this.nodes.get(sheetName)?.get(cellKey(addr));
-	}
-	/** 公式节点总数（测试/调试用） */
-	get nodeCount() {
-		let count = 0;
-		for (const sheetNodes of this.nodes.values()) count += sheetNodes.size;
-		return count;
-	}
-	/**
-	* 单元格补丁后的图同步：f 增/删/改 → 节点增/删/重建。
-	* 由 Sheet.applyPatch（唯一变更通道）调用，命令与 undo/redo 回放均覆盖。
-	*/
-	syncCell(sheet, addr, before, after) {
-		const beforeF = before?.f;
-		const afterF = after?.f;
-		if (beforeF === afterF) return;
-		const existing = this.getNode(sheet.name, addr);
-		if (existing) this.removeNode(existing);
-		if (afterF != null && afterF !== "") this.addNode(sheet, addr, afterF);
-	}
-	/**
-	* 变更集 → 标脏 + 拓扑序重算 → 派生补丁（未应用）。
-	* 调用方（Sheet.executeCommand）负责应用补丁并并入同一 undo 单元。
-	*/
-	recalc(changed) {
-		const dirty = /* @__PURE__ */ new Set();
-		const queue = [];
-		const mark = (node) => {
-			if (node && !dirty.has(node)) {
-				dirty.add(node);
-				queue.push(node);
-			}
-		};
-		for (const { sheet, addr } of changed) {
-			mark(this.getNode(sheet.name, addr));
-			for (const dep of this.dependentsOf(sheet.name, addr)) mark(dep);
-		}
-		for (let i = 0; i < queue.length; i++) {
-			const node = queue[i];
-			for (const dep of this.dependentsOf(node.sheetName, node.addr)) mark(dep);
-		}
-		if (dirty.size === 0) return [];
-		const passValues = /* @__PURE__ */ new Map();
-		const inProgress = /* @__PURE__ */ new Set();
-		const stack = [];
-		const cycleMembers = /* @__PURE__ */ new Set();
-		const cycleError = formulaError("#CYCLE!");
-		const evaluateNode = (node) => {
-			const cached = passValues.get(node);
-			if (cached !== void 0) return cached;
-			if (inProgress.has(node)) {
-				const start = stack.indexOf(node);
-				for (let i = start; i < stack.length; i++) cycleMembers.add(stack[i]);
-				return cycleError;
-			}
-			if (!node.ast) {
-				const error = formulaError("#ERROR!");
-				passValues.set(node, error);
-				return error;
-			}
-			inProgress.add(node);
-			stack.push(node);
-			let value;
-			try {
-				value = evaluateAst(node.ast, {
-					currentSheet: node.sheetName,
-					readCell,
-					readRange,
-					callFunction: invokeFormulaFunction
-				});
-			} catch {
-				value = formulaError("#ERROR!");
-			}
-			inProgress.delete(node);
-			stack.pop();
-			if (Array.isArray(value)) value = formulaError("#VALUE!");
-			if (cycleMembers.has(node)) value = cycleError;
-			passValues.set(node, value);
-			return value;
-		};
-		const readCell = (sheetName, addr) => {
-			const sheet = this.sheets.get(sheetName);
-			if (!sheet) return formulaError("#REF!");
-			const dep = this.getNode(sheetName, addr);
-			if (dep && dirty.has(dep)) return evaluateNode(dep);
-			return cellDataToScalar(sheet.store.getCell(addr));
-		};
-		const readRange = (sheetName, range) => {
-			const sheet = this.sheets.get(sheetName);
-			if (!sheet) return formulaError("#REF!");
-			const values = [];
-			for (const [addr, data] of sheet.store.entriesInRange(range)) {
-				const dep = this.getNode(sheetName, addr);
-				values.push(dep && dirty.has(dep) ? evaluateNode(dep) : cellDataToScalar(data));
-			}
-			return values;
-		};
-		for (const node of dirty) evaluateNode(node);
-		const patches = [];
-		for (const node of dirty) {
-			const { v, t } = serializeResult(passValues.get(node));
-			const sheet = this.sheets.get(node.sheetName);
-			if (!sheet) continue;
-			const before = sheet.store.getCell(node.addr);
-			if (before && before.f === node.formula && before.v === v && before.t === t) continue;
-			patches.push({
-				kind: "cell",
-				sheet,
-				addr: node.addr,
-				before,
-				after: {
-					f: node.formula,
-					v,
-					t
-				}
-			});
-		}
-		return patches;
-	}
-	addNode(sheet, addr, formula) {
-		let ast = null;
-		try {
-			ast = parseFormula(formula);
-		} catch (error) {
-			if (!(error instanceof FormulaParseError)) throw error;
-		}
-		const deps = [];
-		if (ast) {
-			const seen = /* @__PURE__ */ new Set();
-			for (const ref of collectReferences(ast)) {
-				const sheetName = ref.sheet ?? sheet.name;
-				const { start, end } = ref.range;
-				const key = `${sheetName}|${start.row},${start.col},${end.row},${end.col}`;
-				if (seen.has(key)) continue;
-				seen.add(key);
-				deps.push({
-					sheetName,
-					range: ref.range
-				});
-			}
-		}
-		const node = {
-			sheetName: sheet.name,
-			addr: { ...addr },
-			formula,
-			ast,
-			deps,
-			cleanups: []
-		};
-		let sheetNodes = this.nodes.get(sheet.name);
-		if (!sheetNodes) {
-			sheetNodes = /* @__PURE__ */ new Map();
-			this.nodes.set(sheet.name, sheetNodes);
-		}
-		sheetNodes.set(cellKey(addr), node);
-		for (const dep of deps) if (dep.range.start.row === dep.range.end.row && dep.range.start.col === dep.range.end.col) {
-			let sheetExact = this.exact.get(dep.sheetName);
-			if (!sheetExact) {
-				sheetExact = /* @__PURE__ */ new Map();
-				this.exact.set(dep.sheetName, sheetExact);
-			}
-			const key = cellKey(dep.range.start);
-			let set = sheetExact.get(key);
-			if (!set) {
-				set = /* @__PURE__ */ new Set();
-				sheetExact.set(key, set);
-			}
-			set.add(node);
-			node.cleanups.push(() => {
-				set.delete(node);
-				if (set.size === 0) sheetExact.delete(key);
-			});
-		} else {
-			let set = this.ranged.get(dep.sheetName);
-			if (!set) {
-				set = /* @__PURE__ */ new Set();
-				this.ranged.set(dep.sheetName, set);
-			}
-			const entry = {
-				range: dep.range,
-				node
-			};
-			set.add(entry);
-			node.cleanups.push(() => set.delete(entry));
-		}
-	}
-	removeNode(node) {
-		for (const cleanup of node.cleanups) cleanup();
-		const sheetNodes = this.nodes.get(node.sheetName);
-		if (!sheetNodes) return;
-		sheetNodes.delete(cellKey(node.addr));
-		if (sheetNodes.size === 0) this.nodes.delete(node.sheetName);
-	}
-	dependentsOf(sheetName, addr) {
-		const result = /* @__PURE__ */ new Set();
-		const exactSet = this.exact.get(sheetName)?.get(cellKey(addr));
-		if (exactSet) for (const node of exactSet) result.add(node);
-		const rangedSet = this.ranged.get(sheetName);
-		if (rangedSet) {
-			for (const entry of rangedSet) if (rangeContainsAddress(entry.range, addr)) result.add(entry.node);
-		}
-		return result;
-	}
-};
-/** 单元格存储 → 求值标量（t='e' 还原为错误标记；空 → null） */
-function cellDataToScalar(data) {
-	if (!data || data.v == null) return null;
-	if (data.t === "e") return formulaError(isFormulaErrorCode(data.v) ? data.v : "#ERROR!");
-	return data.v;
-}
-/** 求值结果 → 存储形态（str = 公式结果字符串，e = 错误；与决策 2 一致） */
-function serializeResult(value) {
-	if (isFormulaError(value)) return {
-		v: value.code,
-		t: "e"
-	};
-	if (value === null) return {
-		v: 0,
-		t: "n"
-	};
-	switch (typeof value) {
-		case "number": return {
-			v: value,
-			t: "n"
-		};
-		case "boolean": return {
-			v: value,
-			t: "b"
-		};
-		default: return {
-			v: value,
-			t: "str"
-		};
-	}
-}
-//#endregion
-export { DependencyGraph };
-
-//# sourceMappingURL=dependency-graph.js.map

package/dist/core/formula/dependency-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dependency-graph.js","names":[],"sources":["../../../src/core/formula/dependency-graph.ts"],"sourcesContent":["import { cellKey, rangeContainsAddress, type CellAddress, type CellRange } from '../address'\nimport type { CellData, CellType, CellValue } from '../cell-store'\nimport type { CellPatch } from '../command/types'\nimport type { Sheet } from '../sheet'\nimport { collectReferences, type AstNode } from './ast'\nimport { formulaError, isFormulaError, isFormulaErrorCode, type FormulaError } from './errors'\nimport { evaluateAst, type ScalarValue } from './evaluator'\nimport { invokeFormulaFunction } from './functions'\nimport { parseFormula } from './parser'\nimport { FormulaParseError } from './tokenizer'\n\n/**\n * 依赖图（工作簿级计算中枢）：\n * - sheet 注册表：跨表引用按名解析（不存在 → #REF!）\n * - 正向索引：公式格 → 引用格集合（节点 deps）；反向索引：引用格 → 依赖者\n *   （单格引用走 cellKey 精确索引 O(1)，区域引用走线性扫描）\n * - 变更时标脏（向上 BFS 收集全部依赖者）+ 拓扑序增量重算（递归向下，memo 去重）\n * - 循环引用检测：求值在途栈遇回边 → 环上所有格 #CYCLE!；依赖环外格只传播错误，\n *   打破循环（编辑环上格）后经标脏重算自动恢复\n *\n * 图状态与单元格存储严格同步：所有 f 变更（命令/undo/redo/rollback 回放）都经\n * Sheet.applyPatch → syncCell 维护节点；重算只发生在命令执行后（见 Sheet.executeCommand），\n * undo/redo 靠派生补丁精确回放缓存值，不重算。\n */\n\n/** 公式节点的一个依赖（sheet 名已补齐为具体值） */\nexport interface FormulaDependency {\n  sheetName: string\n  range: CellRange\n}\n\n/** 公式节点（依赖图管理的公式格状态；依赖图外部只读使用） */\nexport interface FormulaNode {\n  readonly sheetName: string\n  readonly addr: CellAddress\n  readonly formula: string\n  /** null = 解析失败（求值 #ERROR!，无依赖） */\n  readonly ast: AstNode | null\n  readonly deps: FormulaDependency[]\n  /** 反向索引清理器（removeNode 时执行） */\n  readonly cleanups: (() => void)[]\n}\n\nexport class DependencyGraph {\n  private readonly sheets = new Map<string, Sheet>()\n  /** 正向索引宿主：sheetName → cellKey → 公式节点 */\n  private readonly nodes = new Map<string, Map<number, FormulaNode>>()\n  /** 反向索引（单格引用）：sheetName → cellKey → 依赖者集合 */\n  private readonly exact = new Map<string, Map<number, Set<FormulaNode>>>()\n  /** 反向索引（区域引用）：sheetName → { 区域, 依赖者 } 集合（线性扫描） */\n  private readonly ranged = new Map<string, Set<{ range: CellRange; node: FormulaNode }>>()\n\n  // ─── sheet 注册表 ─────────────────────────────────────────\n\n  registerSheet(sheet: Sheet): void {\n    this.sheets.set(sheet.name, sheet)\n  }\n\n  /** 注销 sheet 并移除其全部公式节点（引用它的公式在下次重算时得 #REF!） */\n  unregisterSheet(sheet: Sheet): void {\n    if (this.sheets.get(sheet.name) !== sheet) return\n    this.sheets.delete(sheet.name)\n    const sheetNodes = this.nodes.get(sheet.name)\n    if (sheetNodes) {\n      for (const node of sheetNodes.values()) this.removeNode(node)\n    }\n  }\n\n  getSheet(name: string): Sheet | undefined {\n    return this.sheets.get(name)\n  }\n\n  // ─── 节点查询 ─────────────────────────────────────────────\n\n  getNode(sheetName: string, addr: CellAddress): FormulaNode | undefined {\n    return this.nodes.get(sheetName)?.get(cellKey(addr))\n  }\n\n  /** 公式节点总数（测试/调试用） */\n  get nodeCount(): number {\n    let count = 0\n    for (const sheetNodes of this.nodes.values()) count += sheetNodes.size\n    return count\n  }\n\n  // ─── 图同步 ───────────────────────────────────────────────\n\n  /**\n   * 单元格补丁后的图同步：f 增/删/改 → 节点增/删/重建。\n   * 由 Sheet.applyPatch（唯一变更通道）调用，命令与 undo/redo 回放均覆盖。\n   */\n  syncCell(sheet: Sheet, addr: CellAddress, before?: CellData, after?: CellData): void {\n    const beforeF = before?.f\n    const afterF = after?.f\n    if (beforeF === afterF) return\n    const existing = this.getNode(sheet.name, addr)\n    if (existing) this.removeNode(existing)\n    if (afterF != null && afterF !== '') this.addNode(sheet, addr, afterF)\n  }\n\n  // ─── 增量重算 ─────────────────────────────────────────────\n\n  /**\n   * 变更集 → 标脏 + 拓扑序重算 → 派生补丁（未应用）。\n   * 调用方（Sheet.executeCommand）负责应用补丁并并入同一 undo 单元。\n   */\n  recalc(changed: readonly { sheet: Sheet; addr: CellAddress }[]): CellPatch[] {\n    // 1. 标脏：变更格自身（若是公式）+ 向上 BFS 全部传递依赖者\n    const dirty = new Set<FormulaNode>()\n    const queue: FormulaNode[] = []\n    const mark = (node: FormulaNode | undefined): void => {\n      if (node && !dirty.has(node)) {\n        dirty.add(node)\n        queue.push(node)\n      }\n    }\n    for (const { sheet, addr } of changed) {\n      mark(this.getNode(sheet.name, addr))\n      for (const dep of this.dependentsOf(sheet.name, addr)) mark(dep)\n    }\n    for (let i = 0; i < queue.length; i++) {\n      const node = queue[i]!\n      for (const dep of this.dependentsOf(node.sheetName, node.addr)) mark(dep)\n    }\n    if (dirty.size === 0) return []\n\n    // 2. 拓扑序求值：递归向下（依赖先于使用求值），memo 保证每格最多算一次；\n    //    在途栈遇回边 → 栈中自回边点起全部入环（#CYCLE!）\n    const passValues = new Map<FormulaNode, ScalarValue | FormulaError>()\n    const inProgress = new Set<FormulaNode>()\n    const stack: FormulaNode[] = []\n    const cycleMembers = new Set<FormulaNode>()\n    const cycleError = formulaError('#CYCLE!')\n\n    const evaluateNode = (node: FormulaNode): ScalarValue | FormulaError => {\n      const cached = passValues.get(node)\n      if (cached !== undefined) return cached\n      if (inProgress.has(node)) {\n        const start = stack.indexOf(node)\n        for (let i = start; i < stack.length; i++) cycleMembers.add(stack[i]!)\n        return cycleError\n      }\n      if (!node.ast) {\n        const error = formulaError('#ERROR!')\n        passValues.set(node, error)\n        return error\n      }\n      inProgress.add(node)\n      stack.push(node)\n      let value: ScalarValue | FormulaError | (ScalarValue | FormulaError)[]\n      try {\n        value = evaluateAst(node.ast, {\n          currentSheet: node.sheetName,\n          readCell,\n          readRange,\n          callFunction: invokeFormulaFunction\n        })\n      } catch {\n        // 求值期异常（如自定义函数抛错）不应击穿重算 → 记为 #ERROR!\n        value = formulaError('#ERROR!')\n      }\n      inProgress.delete(node)\n      stack.pop()\n      // 区域直接作为公式结果（'=A1:B2'）→ #VALUE!\n      if (Array.isArray(value)) value = formulaError('#VALUE!')\n      if (cycleMembers.has(node)) value = cycleError\n      passValues.set(node, value)\n      return value\n    }\n\n    const readCell = (sheetName: string, addr: CellAddress): ScalarValue | FormulaError => {\n      const sheet = this.sheets.get(sheetName)\n      if (!sheet) return formulaError('#REF!')\n      const dep = this.getNode(sheetName, addr)\n      if (dep && dirty.has(dep)) return evaluateNode(dep)\n      return cellDataToScalar(sheet.store.getCell(addr))\n    }\n\n    const readRange = (\n      sheetName: string,\n      range: CellRange\n    ): (ScalarValue | FormulaError)[] | FormulaError => {\n      const sheet = this.sheets.get(sheetName)\n      if (!sheet) return formulaError('#REF!')\n      const values: (ScalarValue | FormulaError)[] = []\n      // 只迭代稀疏存在的格\n      for (const [addr, data] of sheet.store.entriesInRange(range)) {\n        const dep = this.getNode(sheetName, addr)\n        values.push(dep && dirty.has(dep) ? evaluateNode(dep) : cellDataToScalar(data))\n      }\n      return values\n    }\n\n    for (const node of dirty) evaluateNode(node)\n\n    // 3. 派生补丁：缓存值与重算结果一致的跳过（收敛时不产生冗余变更）\n    const patches: CellPatch[] = []\n    for (const node of dirty) {\n      const value = passValues.get(node)!\n      const { v, t } = serializeResult(value)\n      const sheet = this.sheets.get(node.sheetName)\n      if (!sheet) continue\n      const before = sheet.store.getCell(node.addr)\n      if (before && before.f === node.formula && before.v === v && before.t === t) continue\n      patches.push({\n        kind: 'cell',\n        sheet,\n        addr: node.addr,\n        before,\n        after: { f: node.formula, v, t }\n      })\n    }\n    return patches\n  }\n\n  // ─── 内部 ─────────────────────────────────────────────────\n\n  private addNode(sheet: Sheet, addr: CellAddress, formula: string): void {\n    let ast: AstNode | null = null\n    try {\n      ast = parseFormula(formula)\n    } catch (error) {\n      if (!(error instanceof FormulaParseError)) throw error\n      // 解析失败：ast 保持 null（求值 #ERROR!，无依赖）\n    }\n    const deps: FormulaDependency[] = []\n    if (ast) {\n      const seen = new Set<string>()\n      for (const ref of collectReferences(ast)) {\n        const sheetName = ref.sheet ?? sheet.name\n        const { start, end } = ref.range\n        const key = `${sheetName}|${start.row},${start.col},${end.row},${end.col}`\n        if (seen.has(key)) continue\n        seen.add(key)\n        deps.push({ sheetName, range: ref.range })\n      }\n    }\n    const node: FormulaNode = {\n      sheetName: sheet.name,\n      addr: { ...addr },\n      formula,\n      ast,\n      deps,\n      cleanups: []\n    }\n    let sheetNodes = this.nodes.get(sheet.name)\n    if (!sheetNodes) {\n      sheetNodes = new Map()\n      this.nodes.set(sheet.name, sheetNodes)\n    }\n    sheetNodes.set(cellKey(addr), node)\n\n    for (const dep of deps) {\n      const isSingleCell =\n        dep.range.start.row === dep.range.end.row && dep.range.start.col === dep.range.end.col\n      if (isSingleCell) {\n        let sheetExact = this.exact.get(dep.sheetName)\n        if (!sheetExact) {\n          sheetExact = new Map()\n          this.exact.set(dep.sheetName, sheetExact)\n        }\n        const key = cellKey(dep.range.start)\n        let set = sheetExact.get(key)\n        if (!set) {\n          set = new Set()\n          sheetExact.set(key, set)\n        }\n        set.add(node)\n        node.cleanups.push(() => {\n          set.delete(node)\n          if (set.size === 0) sheetExact.delete(key)\n        })\n      } else {\n        let set = this.ranged.get(dep.sheetName)\n        if (!set) {\n          set = new Set()\n          this.ranged.set(dep.sheetName, set)\n        }\n        const entry = { range: dep.range, node }\n        set.add(entry)\n        node.cleanups.push(() => set.delete(entry))\n      }\n    }\n  }\n\n  private removeNode(node: FormulaNode): void {\n    for (const cleanup of node.cleanups) cleanup()\n    const sheetNodes = this.nodes.get(node.sheetName)\n    if (!sheetNodes) return\n    sheetNodes.delete(cellKey(node.addr))\n    if (sheetNodes.size === 0) this.nodes.delete(node.sheetName)\n  }\n\n  private dependentsOf(sheetName: string, addr: CellAddress): Set<FormulaNode> {\n    const result = new Set<FormulaNode>()\n    const exactSet = this.exact.get(sheetName)?.get(cellKey(addr))\n    if (exactSet) for (const node of exactSet) result.add(node)\n    const rangedSet = this.ranged.get(sheetName)\n    if (rangedSet) {\n      for (const entry of rangedSet) {\n        if (rangeContainsAddress(entry.range, addr)) result.add(entry.node)\n      }\n    }\n    return result\n  }\n}\n\n/** 单元格存储 → 求值标量（t='e' 还原为错误标记；空 → null） */\nfunction cellDataToScalar(data: CellData | undefined): ScalarValue | FormulaError {\n  if (!data || data.v == null) return null\n  if (data.t === 'e') {\n    return formulaError(isFormulaErrorCode(data.v) ? data.v : '#ERROR!')\n  }\n  return data.v\n}\n\n/** 求值结果 → 存储形态（str = 公式结果字符串，e = 错误；与决策 2 一致） */\nfunction serializeResult(value: ScalarValue | FormulaError): { v: CellValue; t: CellType } {\n  if (isFormulaError(value)) return { v: value.code, t: 'e' }\n  if (value === null) return { v: 0, t: 'n' } // 防御：公式结果不会是 null\n  switch (typeof value) {\n    case 'number':\n      return { v: value, t: 'n' }\n    case 'boolean':\n      return { v: value, t: 'b' }\n    default:\n      return { v: value, t: 'str' }\n  }\n}\n"],"mappings":";;;;;;;;AA2CA,IAAa,kBAAb,MAA6B;CAC3B,yBAA0B,IAAI,IAAmB;;CAEjD,wBAAyB,IAAI,IAAsC;;CAEnE,wBAAyB,IAAI,IAA2C;;CAExE,yBAA0B,IAAI,IAA0D;CAIxF,cAAc,OAAoB;EAChC,KAAK,OAAO,IAAI,MAAM,MAAM,KAAK;CACnC;;CAGA,gBAAgB,OAAoB;EAClC,IAAI,KAAK,OAAO,IAAI,MAAM,IAAI,MAAM,OAAO;EAC3C,KAAK,OAAO,OAAO,MAAM,IAAI;EAC7B,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM,IAAI;EAC5C,IAAI,YACF,KAAK,MAAM,QAAQ,WAAW,OAAO,GAAG,KAAK,WAAW,IAAI;CAEhE;CAEA,SAAS,MAAiC;EACxC,OAAO,KAAK,OAAO,IAAI,IAAI;CAC7B;CAIA,QAAQ,WAAmB,MAA4C;EACrE,OAAO,KAAK,MAAM,IAAI,SAAS,CAAC,EAAE,IAAI,QAAQ,IAAI,CAAC;CACrD;;CAGA,IAAI,YAAoB;EACtB,IAAI,QAAQ;EACZ,KAAK,MAAM,cAAc,KAAK,MAAM,OAAO,GAAG,SAAS,WAAW;EAClE,OAAO;CACT;;;;;CAQA,SAAS,OAAc,MAAmB,QAAmB,OAAwB;EACnF,MAAM,UAAU,QAAQ;EACxB,MAAM,SAAS,OAAO;EACtB,IAAI,YAAY,QAAQ;EACxB,MAAM,WAAW,KAAK,QAAQ,MAAM,MAAM,IAAI;EAC9C,IAAI,UAAU,KAAK,WAAW,QAAQ;EACtC,IAAI,UAAU,QAAQ,WAAW,IAAI,KAAK,QAAQ,OAAO,MAAM,MAAM;CACvE;;;;;CAQA,OAAO,SAAsE;EAE3E,MAAM,wBAAQ,IAAI,IAAiB;EACnC,MAAM,QAAuB,CAAC;EAC9B,MAAM,QAAQ,SAAwC;GACpD,IAAI,QAAQ,CAAC,MAAM,IAAI,IAAI,GAAG;IAC5B,MAAM,IAAI,IAAI;IACd,MAAM,KAAK,IAAI;GACjB;EACF;EACA,KAAK,MAAM,EAAE,OAAO,UAAU,SAAS;GACrC,KAAK,KAAK,QAAQ,MAAM,MAAM,IAAI,CAAC;GACnC,KAAK,MAAM,OAAO,KAAK,aAAa,MAAM,MAAM,IAAI,GAAG,KAAK,GAAG;EACjE;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,OAAO,MAAM;GACnB,KAAK,MAAM,OAAO,KAAK,aAAa,KAAK,WAAW,KAAK,IAAI,GAAG,KAAK,GAAG;EAC1E;EACA,IAAI,MAAM,SAAS,GAAG,OAAO,CAAC;EAI9B,MAAM,6BAAa,IAAI,IAA6C;EACpE,MAAM,6BAAa,IAAI,IAAiB;EACxC,MAAM,QAAuB,CAAC;EAC9B,MAAM,+BAAe,IAAI,IAAiB;EAC1C,MAAM,aAAa,aAAa,SAAS;EAEzC,MAAM,gBAAgB,SAAkD;GACtE,MAAM,SAAS,WAAW,IAAI,IAAI;GAClC,IAAI,WAAW,KAAA,GAAW,OAAO;GACjC,IAAI,WAAW,IAAI,IAAI,GAAG;IACxB,MAAM,QAAQ,MAAM,QAAQ,IAAI;IAChC,KAAK,IAAI,IAAI,OAAO,IAAI,MAAM,QAAQ,KAAK,aAAa,IAAI,MAAM,EAAG;IACrE,OAAO;GACT;GACA,IAAI,CAAC,KAAK,KAAK;IACb,MAAM,QAAQ,aAAa,SAAS;IACpC,WAAW,IAAI,MAAM,KAAK;IAC1B,OAAO;GACT;GACA,WAAW,IAAI,IAAI;GACnB,MAAM,KAAK,IAAI;GACf,IAAI;GACJ,IAAI;IACF,QAAQ,YAAY,KAAK,KAAK;KAC5B,cAAc,KAAK;KACnB;KACA;KACA,cAAc;IAChB,CAAC;GACH,QAAQ;IAEN,QAAQ,aAAa,SAAS;GAChC;GACA,WAAW,OAAO,IAAI;GACtB,MAAM,IAAI;GAEV,IAAI,MAAM,QAAQ,KAAK,GAAG,QAAQ,aAAa,SAAS;GACxD,IAAI,aAAa,IAAI,IAAI,GAAG,QAAQ;GACpC,WAAW,IAAI,MAAM,KAAK;GAC1B,OAAO;EACT;EAEA,MAAM,YAAY,WAAmB,SAAkD;GACrF,MAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;GACvC,IAAI,CAAC,OAAO,OAAO,aAAa,OAAO;GACvC,MAAM,MAAM,KAAK,QAAQ,WAAW,IAAI;GACxC,IAAI,OAAO,MAAM,IAAI,GAAG,GAAG,OAAO,aAAa,GAAG;GAClD,OAAO,iBAAiB,MAAM,MAAM,QAAQ,IAAI,CAAC;EACnD;EAEA,MAAM,aACJ,WACA,UACkD;GAClD,MAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;GACvC,IAAI,CAAC,OAAO,OAAO,aAAa,OAAO;GACvC,MAAM,SAAyC,CAAC;GAEhD,KAAK,MAAM,CAAC,MAAM,SAAS,MAAM,MAAM,eAAe,KAAK,GAAG;IAC5D,MAAM,MAAM,KAAK,QAAQ,WAAW,IAAI;IACxC,OAAO,KAAK,OAAO,MAAM,IAAI,GAAG,IAAI,aAAa,GAAG,IAAI,iBAAiB,IAAI,CAAC;GAChF;GACA,OAAO;EACT;EAEA,KAAK,MAAM,QAAQ,OAAO,aAAa,IAAI;EAG3C,MAAM,UAAuB,CAAC;EAC9B,KAAK,MAAM,QAAQ,OAAO;GAExB,MAAM,EAAE,GAAG,MAAM,gBADH,WAAW,IAAI,IACQ,CAAC;GACtC,MAAM,QAAQ,KAAK,OAAO,IAAI,KAAK,SAAS;GAC5C,IAAI,CAAC,OAAO;GACZ,MAAM,SAAS,MAAM,MAAM,QAAQ,KAAK,IAAI;GAC5C,IAAI,UAAU,OAAO,MAAM,KAAK,WAAW,OAAO,MAAM,KAAK,OAAO,MAAM,GAAG;GAC7E,QAAQ,KAAK;IACX,MAAM;IACN;IACA,MAAM,KAAK;IACX;IACA,OAAO;KAAE,GAAG,KAAK;KAAS;KAAG;IAAE;GACjC,CAAC;EACH;EACA,OAAO;CACT;CAIA,QAAgB,OAAc,MAAmB,SAAuB;EACtE,IAAI,MAAsB;EAC1B,IAAI;GACF,MAAM,aAAa,OAAO;EAC5B,SAAS,OAAO;GACd,IAAI,EAAE,iBAAiB,oBAAoB,MAAM;EAEnD;EACA,MAAM,OAA4B,CAAC;EACnC,IAAI,KAAK;GACP,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,OAAO,kBAAkB,GAAG,GAAG;IACxC,MAAM,YAAY,IAAI,SAAS,MAAM;IACrC,MAAM,EAAE,OAAO,QAAQ,IAAI;IAC3B,MAAM,MAAM,GAAG,UAAU,GAAG,MAAM,IAAI,GAAG,MAAM,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI;IACrE,IAAI,KAAK,IAAI,GAAG,GAAG;IACnB,KAAK,IAAI,GAAG;IACZ,KAAK,KAAK;KAAE;KAAW,OAAO,IAAI;IAAM,CAAC;GAC3C;EACF;EACA,MAAM,OAAoB;GACxB,WAAW,MAAM;GACjB,MAAM,EAAE,GAAG,KAAK;GAChB;GACA;GACA;GACA,UAAU,CAAC;EACb;EACA,IAAI,aAAa,KAAK,MAAM,IAAI,MAAM,IAAI;EAC1C,IAAI,CAAC,YAAY;GACf,6BAAa,IAAI,IAAI;GACrB,KAAK,MAAM,IAAI,MAAM,MAAM,UAAU;EACvC;EACA,WAAW,IAAI,QAAQ,IAAI,GAAG,IAAI;EAElC,KAAK,MAAM,OAAO,MAGhB,IADE,IAAI,MAAM,MAAM,QAAQ,IAAI,MAAM,IAAI,OAAO,IAAI,MAAM,MAAM,QAAQ,IAAI,MAAM,IAAI,KACnE;GAChB,IAAI,aAAa,KAAK,MAAM,IAAI,IAAI,SAAS;GAC7C,IAAI,CAAC,YAAY;IACf,6BAAa,IAAI,IAAI;IACrB,KAAK,MAAM,IAAI,IAAI,WAAW,UAAU;GAC1C;GACA,MAAM,MAAM,QAAQ,IAAI,MAAM,KAAK;GACnC,IAAI,MAAM,WAAW,IAAI,GAAG;GAC5B,IAAI,CAAC,KAAK;IACR,sBAAM,IAAI,IAAI;IACd,WAAW,IAAI,KAAK,GAAG;GACzB;GACA,IAAI,IAAI,IAAI;GACZ,KAAK,SAAS,WAAW;IACvB,IAAI,OAAO,IAAI;IACf,IAAI,IAAI,SAAS,GAAG,WAAW,OAAO,GAAG;GAC3C,CAAC;EACH,OAAO;GACL,IAAI,MAAM,KAAK,OAAO,IAAI,IAAI,SAAS;GACvC,IAAI,CAAC,KAAK;IACR,sBAAM,IAAI,IAAI;IACd,KAAK,OAAO,IAAI,IAAI,WAAW,GAAG;GACpC;GACA,MAAM,QAAQ;IAAE,OAAO,IAAI;IAAO;GAAK;GACvC,IAAI,IAAI,KAAK;GACb,KAAK,SAAS,WAAW,IAAI,OAAO,KAAK,CAAC;EAC5C;CAEJ;CAEA,WAAmB,MAAyB;EAC1C,KAAK,MAAM,WAAW,KAAK,UAAU,QAAQ;EAC7C,MAAM,aAAa,KAAK,MAAM,IAAI,KAAK,SAAS;EAChD,IAAI,CAAC,YAAY;EACjB,WAAW,OAAO,QAAQ,KAAK,IAAI,CAAC;EACpC,IAAI,WAAW,SAAS,GAAG,KAAK,MAAM,OAAO,KAAK,SAAS;CAC7D;CAEA,aAAqB,WAAmB,MAAqC;EAC3E,MAAM,yBAAS,IAAI,IAAiB;EACpC,MAAM,WAAW,KAAK,MAAM,IAAI,SAAS,CAAC,EAAE,IAAI,QAAQ,IAAI,CAAC;EAC7D,IAAI,UAAU,KAAK,MAAM,QAAQ,UAAU,OAAO,IAAI,IAAI;EAC1D,MAAM,YAAY,KAAK,OAAO,IAAI,SAAS;EAC3C,IAAI;QACG,MAAM,SAAS,WAClB,IAAI,qBAAqB,MAAM,OAAO,IAAI,GAAG,OAAO,IAAI,MAAM,IAAI;EAAA;EAGtE,OAAO;CACT;AACF;;AAGA,SAAS,iBAAiB,MAAwD;CAChF,IAAI,CAAC,QAAQ,KAAK,KAAK,MAAM,OAAO;CACpC,IAAI,KAAK,MAAM,KACb,OAAO,aAAa,mBAAmB,KAAK,CAAC,IAAI,KAAK,IAAI,SAAS;CAErE,OAAO,KAAK;AACd;;AAGA,SAAS,gBAAgB,OAAkE;CACzF,IAAI,eAAe,KAAK,GAAG,OAAO;EAAE,GAAG,MAAM;EAAM,GAAG;CAAI;CAC1D,IAAI,UAAU,MAAM,OAAO;EAAE,GAAG;EAAG,GAAG;CAAI;CAC1C,QAAQ,OAAO,OAAf;EACE,KAAK,UACH,OAAO;GAAE,GAAG;GAAO,GAAG;EAAI;EAC5B,KAAK,WACH,OAAO;GAAE,GAAG;GAAO,GAAG;EAAI;EAC5B,SACE,OAAO;GAAE,GAAG;GAAO,GAAG;EAAM;CAChC;AACF"}

package/dist/core/formula/errors.d.ts

@@ -1,25 +0,0 @@
-//#region src/core/formula/errors.d.ts
-/**
- * 公式错误值体系。
- *
- * 求值器内部以 FormulaError 标记对象传递错误（随运算传播）；
- * 写入单元格时序列化为 `v = 错误码, t = 'e'`（决策 2 的 CellData 格式）。
- */
-/** 公式错误码（Excel 子集 + 解析失败 #ERROR!、循环引用 #CYCLE!） */
-declare const FORMULA_ERROR_CODES: readonly ["#DIV/0!", "#VALUE!", "#NAME?", "#REF!", "#ERROR!", "#CYCLE!"];
-type FormulaErrorCode = (typeof FORMULA_ERROR_CODES)[number];
-declare const ERROR_BRAND: unique symbol;
-/** 求值过程中的错误标记（不参与普通值运算，遇运算即传播） */
-interface FormulaError {
-  readonly [ERROR_BRAND]: true;
-  readonly code: FormulaErrorCode;
-}
-/** 构造错误标记 */
-declare function formulaError(code: FormulaErrorCode): FormulaError;
-/** 判定错误标记 */
-declare function isFormulaError(value: unknown): value is FormulaError;
-/** 判定合法错误码（读取 t='e' 的单元格时校验） */
-declare function isFormulaErrorCode(value: unknown): value is FormulaErrorCode;
-//#endregion
-export { FORMULA_ERROR_CODES, FormulaError, FormulaErrorCode, formulaError, isFormulaError, isFormulaErrorCode };
-//# sourceMappingURL=errors.d.ts.map

package/dist/core/formula/errors.js

@@ -1,36 +0,0 @@
-//#region src/core/formula/errors.ts
-/**
-* 公式错误值体系。
-*
-* 求值器内部以 FormulaError 标记对象传递错误（随运算传播）；
-* 写入单元格时序列化为 `v = 错误码, t = 'e'`（决策 2 的 CellData 格式）。
-*/
-/** 公式错误码（Excel 子集 + 解析失败 #ERROR!、循环引用 #CYCLE!） */
-const FORMULA_ERROR_CODES = [
-	"#DIV/0!",
-	"#VALUE!",
-	"#NAME?",
-	"#REF!",
-	"#ERROR!",
-	"#CYCLE!"
-];
-const ERROR_BRAND = Symbol("veltra-sheet.formula-error");
-/** 构造错误标记 */
-function formulaError(code) {
-	return {
-		[ERROR_BRAND]: true,
-		code
-	};
-}
-/** 判定错误标记 */
-function isFormulaError(value) {
-	return typeof value === "object" && value !== null && ERROR_BRAND in value;
-}
-/** 判定合法错误码（读取 t='e' 的单元格时校验） */
-function isFormulaErrorCode(value) {
-	return typeof value === "string" && FORMULA_ERROR_CODES.includes(value);
-}
-//#endregion
-export { FORMULA_ERROR_CODES, formulaError, isFormulaError, isFormulaErrorCode };
-
-//# sourceMappingURL=errors.js.map

package/dist/core/formula/errors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"errors.js","names":[],"sources":["../../../src/core/formula/errors.ts"],"sourcesContent":["/**\n * 公式错误值体系。\n *\n * 求值器内部以 FormulaError 标记对象传递错误（随运算传播）；\n * 写入单元格时序列化为 `v = 错误码, t = 'e'`（决策 2 的 CellData 格式）。\n */\n\n/** 公式错误码（Excel 子集 + 解析失败 #ERROR!、循环引用 #CYCLE!） */\nexport const FORMULA_ERROR_CODES = [\n  '#DIV/0!',\n  '#VALUE!',\n  '#NAME?',\n  '#REF!',\n  '#ERROR!',\n  '#CYCLE!'\n] as const\n\nexport type FormulaErrorCode = (typeof FORMULA_ERROR_CODES)[number]\n\nconst ERROR_BRAND: unique symbol = Symbol('veltra-sheet.formula-error')\n\n/** 求值过程中的错误标记（不参与普通值运算，遇运算即传播） */\nexport interface FormulaError {\n  readonly [ERROR_BRAND]: true\n  readonly code: FormulaErrorCode\n}\n\n/** 构造错误标记 */\nexport function formulaError(code: FormulaErrorCode): FormulaError {\n  return { [ERROR_BRAND]: true, code }\n}\n\n/** 判定错误标记 */\nexport function isFormulaError(value: unknown): value is FormulaError {\n  return typeof value === 'object' && value !== null && ERROR_BRAND in value\n}\n\n/** 判定合法错误码（读取 t='e' 的单元格时校验） */\nexport function isFormulaErrorCode(value: unknown): value is FormulaErrorCode {\n  return typeof value === 'string' && (FORMULA_ERROR_CODES as readonly string[]).includes(value)\n}\n"],"mappings":";;;;;;;;AAQA,MAAa,sBAAsB;CACjC;CACA;CACA;CACA;CACA;CACA;AACF;AAIA,MAAM,cAA6B,OAAO,4BAA4B;;AAStE,SAAgB,aAAa,MAAsC;CACjE,OAAO;GAAG,cAAc;EAAM;CAAK;AACrC;;AAGA,SAAgB,eAAe,OAAuC;CACpE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,eAAe;AACvE;;AAGA,SAAgB,mBAAmB,OAA2C;CAC5E,OAAO,OAAO,UAAU,YAAa,oBAA0C,SAAS,KAAK;AAC/F"}

package/dist/core/formula/evaluator.d.ts

@@ -1,41 +0,0 @@
-import { CellAddress, CellRange } from "../address.js";
-import { AstNode } from "./ast.js";
-import { FormulaError } from "./errors.js";
-//#region src/core/formula/evaluator.d.ts
-/**
- * AST 求值器（纯函数，不持有状态；单元格读取经 FormulaEvalContext 注入）。
- *
- * 空格（null）参与运算的规则同 Excel：
- * - 数字上下文按 0（空单元格 +1 = 1）；空字符串字面量参与算术 → #VALUE!
- * - 文本上下文按 ''；布尔上下文按 FALSE
- * - 比较时空格归一为对方类型的零值
- * 错误值遇运算即传播（左操作数优先）。
- */
-/** 标量值（单元格/字面量可取的全集；null = 空单元格） */
-type ScalarValue = number | string | boolean | null;
-/** 求值结果：标量 / 错误 / 区域展开数组（数组仅作为函数参数形态出现） */
-type EvalValue = ScalarValue | FormulaError | (ScalarValue | FormulaError)[];
-/** 求值上下文（由依赖图按公式节点注入） */
-interface FormulaEvalContext {
-  /** 当前公式所在 sheet（裸引用缺省表） */
-  readonly currentSheet: string;
-  /** 读取单格（原始存储语义；表不存在 → #REF!） */
-  readCell(sheet: string, addr: CellAddress): ScalarValue | FormulaError;
-  /** 读取区域（只含稀疏存在的格；表不存在 → #REF!） */
-  readRange(sheet: string, range: CellRange): (ScalarValue | FormulaError)[] | FormulaError;
-  /** 调用函数（名称未知 → #NAME?；参数个数非法 → #VALUE!） */
-  callFunction(name: string, nodes: AstNode[], evalNode: (node: AstNode) => EvalValue): EvalValue;
-}
-/** 强转数字：null→0，布尔→1/0，数字文本→数字，其余文本→#VALUE!，错误传播 */
-declare function coerceToNumber(value: EvalValue): number | FormulaError;
-/** 强转文本：null→''，布尔→TRUE/FALSE，错误传播 */
-declare function coerceToText(value: EvalValue): string | FormulaError;
-/** 强转布尔：null→FALSE，数字≠0，TRUE/FALSE 文本，其余文本→#VALUE!，错误传播 */
-declare function coerceToBoolean(value: EvalValue): boolean | FormulaError;
-/** 比较：同类型按类型规则（文本大小写不敏感）；混合类型 数字 < 文本 < 布尔；null 归一为对方零值 */
-declare function compareScalars(left: ScalarValue, right: ScalarValue): number;
-/** AST 求值 */
-declare function evaluateAst(node: AstNode, ctx: FormulaEvalContext): EvalValue;
-//#endregion
-export { EvalValue, FormulaEvalContext, ScalarValue, coerceToBoolean, coerceToNumber, coerceToText, compareScalars, evaluateAst };
-//# sourceMappingURL=evaluator.d.ts.map

package/dist/core/formula/evaluator.js

@@ -1,154 +0,0 @@
-import { formulaError, isFormulaError } from "./errors.js";
-//#region src/core/formula/evaluator.ts
-const NUMERIC_TEXT_RE = /^[+-]?(\d+\.?\d*|\.\d+)([eE][+-]?\d+)?$/;
-/** 强转数字：null→0，布尔→1/0，数字文本→数字，其余文本→#VALUE!，错误传播 */
-function coerceToNumber(value) {
-	if (isFormulaError(value)) return value;
-	if (Array.isArray(value)) return formulaError("#VALUE!");
-	if (value === null) return 0;
-	switch (typeof value) {
-		case "number": return value;
-		case "boolean": return value ? 1 : 0;
-		case "string": {
-			const text = value.trim();
-			if (text === "") return formulaError("#VALUE!");
-			if (text.toUpperCase() === "TRUE") return 1;
-			if (text.toUpperCase() === "FALSE") return 0;
-			if (NUMERIC_TEXT_RE.test(text)) return Number.parseFloat(text);
-			return formulaError("#VALUE!");
-		}
-	}
-}
-/** 强转文本：null→''，布尔→TRUE/FALSE，错误传播 */
-function coerceToText(value) {
-	if (isFormulaError(value)) return value;
-	if (Array.isArray(value)) return formulaError("#VALUE!");
-	if (value === null) return "";
-	switch (typeof value) {
-		case "string": return value;
-		case "number": return String(value);
-		case "boolean": return value ? "TRUE" : "FALSE";
-	}
-}
-/** 强转布尔：null→FALSE，数字≠0，TRUE/FALSE 文本，其余文本→#VALUE!，错误传播 */
-function coerceToBoolean(value) {
-	if (isFormulaError(value)) return value;
-	if (Array.isArray(value)) return formulaError("#VALUE!");
-	if (value === null) return false;
-	switch (typeof value) {
-		case "boolean": return value;
-		case "number": return value !== 0;
-		case "string": {
-			const text = value.trim().toUpperCase();
-			if (text === "TRUE") return true;
-			if (text === "FALSE") return false;
-			return formulaError("#VALUE!");
-		}
-	}
-}
-/** 比较：同类型按类型规则（文本大小写不敏感）；混合类型 数字 < 文本 < 布尔；null 归一为对方零值 */
-function compareScalars(left, right) {
-	if (left === null || right === null) {
-		if (left === null && right === null) return 0;
-		if (left === null) return compareScalars(zeroLike(right), right);
-		return compareScalars(left, zeroLike(left));
-	}
-	const leftType = typeof left;
-	const rightType = typeof right;
-	if (leftType === "number" && rightType === "number") return left < right ? -1 : left > right ? 1 : 0;
-	if (leftType === "string" && rightType === "string") {
-		const a = left.toUpperCase();
-		const b = right.toUpperCase();
-		return a < b ? -1 : a > b ? 1 : 0;
-	}
-	if (leftType === "boolean" && rightType === "boolean") return left === right ? 0 : left ? 1 : -1;
-	return typeRank(leftType) - typeRank(rightType);
-}
-function zeroLike(value) {
-	if (typeof value === "number") return 0;
-	if (typeof value === "string") return "";
-	return false;
-}
-function typeRank(type) {
-	if (type === "number") return 0;
-	if (type === "string") return 1;
-	return 2;
-}
-const COMPARISON_OPS = /* @__PURE__ */ new Set([
-	"=",
-	"<>",
-	"<",
-	"<=",
-	">",
-	">="
-]);
-/** AST 求值 */
-function evaluateAst(node, ctx) {
-	switch (node.kind) {
-		case "number":
-		case "string":
-		case "boolean": return node.value;
-		case "name": return formulaError("#NAME?");
-		case "cell": return ctx.readCell(node.sheet ?? ctx.currentSheet, node.addr);
-		case "range": return ctx.readRange(node.sheet ?? ctx.currentSheet, node.range);
-		case "unary": {
-			const n = coerceToNumber(evaluateAst(node.operand, ctx));
-			if (isFormulaError(n)) return n;
-			return node.op === "-" ? -n : n;
-		}
-		case "percent": {
-			const n = coerceToNumber(evaluateAst(node.operand, ctx));
-			if (isFormulaError(n)) return n;
-			return n / 100;
-		}
-		case "binary": return evaluateBinary(node.op, node.left, node.right, ctx);
-		case "call": return ctx.callFunction(node.name, node.args, (arg) => evaluateAst(arg, ctx));
-	}
-}
-function evaluateBinary(op, leftNode, rightNode, ctx) {
-	const left = evaluateAst(leftNode, ctx);
-	if (isFormulaError(left)) return left;
-	const right = evaluateAst(rightNode, ctx);
-	if (isFormulaError(right)) return right;
-	if (op === "&") {
-		const l = coerceToText(left);
-		if (isFormulaError(l)) return l;
-		const r = coerceToText(right);
-		if (isFormulaError(r)) return r;
-		return l + r;
-	}
-	if (COMPARISON_OPS.has(op)) {
-		if (Array.isArray(left) || Array.isArray(right)) return formulaError("#VALUE!");
-		const cmp = compareScalars(left, right);
-		switch (op) {
-			case "=": return cmp === 0;
-			case "<>": return cmp !== 0;
-			case "<": return cmp < 0;
-			case "<=": return cmp <= 0;
-			case ">": return cmp > 0;
-			default: return cmp >= 0;
-		}
-	}
-	const l = coerceToNumber(left);
-	if (isFormulaError(l)) return l;
-	const r = coerceToNumber(right);
-	if (isFormulaError(r)) return r;
-	switch (op) {
-		case "+": return l + r;
-		case "-": return l - r;
-		case "*": return l * r;
-		case "/":
-			if (r === 0) return formulaError("#DIV/0!");
-			return l / r;
-		case "^": {
-			if (l === 0 && r < 0) return formulaError("#DIV/0!");
-			const value = Math.pow(l, r);
-			return Number.isFinite(value) ? value : formulaError("#VALUE!");
-		}
-		default: return formulaError("#ERROR!");
-	}
-}
-//#endregion
-export { coerceToBoolean, coerceToNumber, coerceToText, compareScalars, evaluateAst };
-
-//# sourceMappingURL=evaluator.js.map

package/dist/core/formula/evaluator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"evaluator.js","names":[],"sources":["../../../src/core/formula/evaluator.ts"],"sourcesContent":["import type { CellAddress, CellRange } from '../address'\nimport type { AstNode, BinaryOperator } from './ast'\nimport { formulaError, isFormulaError, type FormulaError } from './errors'\n\n/**\n * AST 求值器（纯函数，不持有状态；单元格读取经 FormulaEvalContext 注入）。\n *\n * 空格（null）参与运算的规则同 Excel：\n * - 数字上下文按 0（空单元格 +1 = 1）；空字符串字面量参与算术 → #VALUE!\n * - 文本上下文按 ''；布尔上下文按 FALSE\n * - 比较时空格归一为对方类型的零值\n * 错误值遇运算即传播（左操作数优先）。\n */\n\n/** 标量值（单元格/字面量可取的全集；null = 空单元格） */\nexport type ScalarValue = number | string | boolean | null\n\n/** 求值结果：标量 / 错误 / 区域展开数组（数组仅作为函数参数形态出现） */\nexport type EvalValue = ScalarValue | FormulaError | (ScalarValue | FormulaError)[]\n\n/** 求值上下文（由依赖图按公式节点注入） */\nexport interface FormulaEvalContext {\n  /** 当前公式所在 sheet（裸引用缺省表） */\n  readonly currentSheet: string\n  /** 读取单格（原始存储语义；表不存在 → #REF!） */\n  readCell(sheet: string, addr: CellAddress): ScalarValue | FormulaError\n  /** 读取区域（只含稀疏存在的格；表不存在 → #REF!） */\n  readRange(sheet: string, range: CellRange): (ScalarValue | FormulaError)[] | FormulaError\n  /** 调用函数（名称未知 → #NAME?；参数个数非法 → #VALUE!） */\n  callFunction(name: string, nodes: AstNode[], evalNode: (node: AstNode) => EvalValue): EvalValue\n}\n\nconst NUMERIC_TEXT_RE = /^[+-]?(\\d+\\.?\\d*|\\.\\d+)([eE][+-]?\\d+)?$/\n\n/** 强转数字：null→0，布尔→1/0，数字文本→数字，其余文本→#VALUE!，错误传播 */\nexport function coerceToNumber(value: EvalValue): number | FormulaError {\n  if (isFormulaError(value)) return value\n  if (Array.isArray(value)) return formulaError('#VALUE!')\n  if (value === null) return 0\n  switch (typeof value) {\n    case 'number':\n      return value\n    case 'boolean':\n      return value ? 1 : 0\n    case 'string': {\n      const text = value.trim()\n      if (text === '') return formulaError('#VALUE!')\n      if (text.toUpperCase() === 'TRUE') return 1\n      if (text.toUpperCase() === 'FALSE') return 0\n      if (NUMERIC_TEXT_RE.test(text)) return Number.parseFloat(text)\n      return formulaError('#VALUE!')\n    }\n  }\n}\n\n/** 强转文本：null→''，布尔→TRUE/FALSE，错误传播 */\nexport function coerceToText(value: EvalValue): string | FormulaError {\n  if (isFormulaError(value)) return value\n  if (Array.isArray(value)) return formulaError('#VALUE!')\n  if (value === null) return ''\n  switch (typeof value) {\n    case 'string':\n      return value\n    case 'number':\n      return String(value)\n    case 'boolean':\n      return value ? 'TRUE' : 'FALSE'\n  }\n}\n\n/** 强转布尔：null→FALSE，数字≠0，TRUE/FALSE 文本，其余文本→#VALUE!，错误传播 */\nexport function coerceToBoolean(value: EvalValue): boolean | FormulaError {\n  if (isFormulaError(value)) return value\n  if (Array.isArray(value)) return formulaError('#VALUE!')\n  if (value === null) return false\n  switch (typeof value) {\n    case 'boolean':\n      return value\n    case 'number':\n      return value !== 0\n    case 'string': {\n      const text = value.trim().toUpperCase()\n      if (text === 'TRUE') return true\n      if (text === 'FALSE') return false\n      return formulaError('#VALUE!')\n    }\n  }\n}\n\n/** 比较：同类型按类型规则（文本大小写不敏感）；混合类型 数字 < 文本 < 布尔；null 归一为对方零值 */\nexport function compareScalars(left: ScalarValue, right: ScalarValue): number {\n  if (left === null || right === null) {\n    if (left === null && right === null) return 0\n    if (left === null) return compareScalars(zeroLike(right), right)\n    return compareScalars(left, zeroLike(left))\n  }\n  const leftType = typeof left\n  const rightType = typeof right\n  if (leftType === 'number' && rightType === 'number') {\n    return left < right ? -1 : left > right ? 1 : 0\n  }\n  if (leftType === 'string' && rightType === 'string') {\n    const a = (left as string).toUpperCase()\n    const b = (right as string).toUpperCase()\n    return a < b ? -1 : a > b ? 1 : 0\n  }\n  if (leftType === 'boolean' && rightType === 'boolean') {\n    return left === right ? 0 : left ? 1 : -1\n  }\n  return typeRank(leftType) - typeRank(rightType)\n}\n\nfunction zeroLike(value: ScalarValue): ScalarValue {\n  if (typeof value === 'number') return 0\n  if (typeof value === 'string') return ''\n  return false\n}\n\nfunction typeRank(type: string): number {\n  if (type === 'number') return 0\n  if (type === 'string') return 1\n  return 2\n}\n\nconst COMPARISON_OPS = new Set(['=', '<>', '<', '<=', '>', '>='])\n\n/** AST 求值 */\nexport function evaluateAst(node: AstNode, ctx: FormulaEvalContext): EvalValue {\n  switch (node.kind) {\n    case 'number':\n    case 'string':\n    case 'boolean':\n      return node.value\n    case 'name':\n      return formulaError('#NAME?')\n    case 'cell':\n      return ctx.readCell(node.sheet ?? ctx.currentSheet, node.addr)\n    case 'range':\n      return ctx.readRange(node.sheet ?? ctx.currentSheet, node.range)\n    case 'unary': {\n      const n = coerceToNumber(evaluateAst(node.operand, ctx))\n      if (isFormulaError(n)) return n\n      return node.op === '-' ? -n : n\n    }\n    case 'percent': {\n      const n = coerceToNumber(evaluateAst(node.operand, ctx))\n      if (isFormulaError(n)) return n\n      return n / 100\n    }\n    case 'binary':\n      return evaluateBinary(node.op, node.left, node.right, ctx)\n    case 'call':\n      return ctx.callFunction(node.name, node.args, (arg) => evaluateAst(arg, ctx))\n  }\n}\n\nfunction evaluateBinary(\n  op: BinaryOperator,\n  leftNode: AstNode,\n  rightNode: AstNode,\n  ctx: FormulaEvalContext\n): EvalValue {\n  const left = evaluateAst(leftNode, ctx)\n  if (isFormulaError(left)) return left\n  const right = evaluateAst(rightNode, ctx)\n  if (isFormulaError(right)) return right\n\n  if (op === '&') {\n    const l = coerceToText(left)\n    if (isFormulaError(l)) return l\n    const r = coerceToText(right)\n    if (isFormulaError(r)) return r\n    return l + r\n  }\n\n  if (COMPARISON_OPS.has(op)) {\n    if (Array.isArray(left) || Array.isArray(right)) return formulaError('#VALUE!')\n    const cmp = compareScalars(left, right)\n    switch (op) {\n      case '=':\n        return cmp === 0\n      case '<>':\n        return cmp !== 0\n      case '<':\n        return cmp < 0\n      case '<=':\n        return cmp <= 0\n      case '>':\n        return cmp > 0\n      default:\n        return cmp >= 0\n    }\n  }\n\n  const l = coerceToNumber(left)\n  if (isFormulaError(l)) return l\n  const r = coerceToNumber(right)\n  if (isFormulaError(r)) return r\n\n  switch (op) {\n    case '+':\n      return l + r\n    case '-':\n      return l - r\n    case '*':\n      return l * r\n    case '/':\n      if (r === 0) return formulaError('#DIV/0!')\n      return l / r\n    case '^': {\n      if (l === 0 && r < 0) return formulaError('#DIV/0!')\n      const value = Math.pow(l, r)\n      return Number.isFinite(value) ? value : formulaError('#VALUE!')\n    }\n    // & 与比较运算已在上方提前返回\n    default:\n      return formulaError('#ERROR!')\n  }\n}\n"],"mappings":";;AAgCA,MAAM,kBAAkB;;AAGxB,SAAgB,eAAe,OAAyC;CACtE,IAAI,eAAe,KAAK,GAAG,OAAO;CAClC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,aAAa,SAAS;CACvD,IAAI,UAAU,MAAM,OAAO;CAC3B,QAAQ,OAAO,OAAf;EACE,KAAK,UACH,OAAO;EACT,KAAK,WACH,OAAO,QAAQ,IAAI;EACrB,KAAK,UAAU;GACb,MAAM,OAAO,MAAM,KAAK;GACxB,IAAI,SAAS,IAAI,OAAO,aAAa,SAAS;GAC9C,IAAI,KAAK,YAAY,MAAM,QAAQ,OAAO;GAC1C,IAAI,KAAK,YAAY,MAAM,SAAS,OAAO;GAC3C,IAAI,gBAAgB,KAAK,IAAI,GAAG,OAAO,OAAO,WAAW,IAAI;GAC7D,OAAO,aAAa,SAAS;EAC/B;CACF;AACF;;AAGA,SAAgB,aAAa,OAAyC;CACpE,IAAI,eAAe,KAAK,GAAG,OAAO;CAClC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,aAAa,SAAS;CACvD,IAAI,UAAU,MAAM,OAAO;CAC3B,QAAQ,OAAO,OAAf;EACE,KAAK,UACH,OAAO;EACT,KAAK,UACH,OAAO,OAAO,KAAK;EACrB,KAAK,WACH,OAAO,QAAQ,SAAS;CAC5B;AACF;;AAGA,SAAgB,gBAAgB,OAA0C;CACxE,IAAI,eAAe,KAAK,GAAG,OAAO;CAClC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,aAAa,SAAS;CACvD,IAAI,UAAU,MAAM,OAAO;CAC3B,QAAQ,OAAO,OAAf;EACE,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO,UAAU;EACnB,KAAK,UAAU;GACb,MAAM,OAAO,MAAM,KAAK,CAAC,CAAC,YAAY;GACtC,IAAI,SAAS,QAAQ,OAAO;GAC5B,IAAI,SAAS,SAAS,OAAO;GAC7B,OAAO,aAAa,SAAS;EAC/B;CACF;AACF;;AAGA,SAAgB,eAAe,MAAmB,OAA4B;CAC5E,IAAI,SAAS,QAAQ,UAAU,MAAM;EACnC,IAAI,SAAS,QAAQ,UAAU,MAAM,OAAO;EAC5C,IAAI,SAAS,MAAM,OAAO,eAAe,SAAS,KAAK,GAAG,KAAK;EAC/D,OAAO,eAAe,MAAM,SAAS,IAAI,CAAC;CAC5C;CACA,MAAM,WAAW,OAAO;CACxB,MAAM,YAAY,OAAO;CACzB,IAAI,aAAa,YAAY,cAAc,UACzC,OAAO,OAAO,QAAQ,KAAK,OAAO,QAAQ,IAAI;CAEhD,IAAI,aAAa,YAAY,cAAc,UAAU;EACnD,MAAM,IAAK,KAAgB,YAAY;EACvC,MAAM,IAAK,MAAiB,YAAY;EACxC,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;CAClC;CACA,IAAI,aAAa,aAAa,cAAc,WAC1C,OAAO,SAAS,QAAQ,IAAI,OAAO,IAAI;CAEzC,OAAO,SAAS,QAAQ,IAAI,SAAS,SAAS;AAChD;AAEA,SAAS,SAAS,OAAiC;CACjD,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,OAAO;AACT;AAEA,SAAS,SAAS,MAAsB;CACtC,IAAI,SAAS,UAAU,OAAO;CAC9B,IAAI,SAAS,UAAU,OAAO;CAC9B,OAAO;AACT;AAEA,MAAM,iCAAiB,IAAI,IAAI;CAAC;CAAK;CAAM;CAAK;CAAM;CAAK;AAAI,CAAC;;AAGhE,SAAgB,YAAY,MAAe,KAAoC;CAC7E,QAAQ,KAAK,MAAb;EACE,KAAK;EACL,KAAK;EACL,KAAK,WACH,OAAO,KAAK;EACd,KAAK,QACH,OAAO,aAAa,QAAQ;EAC9B,KAAK,QACH,OAAO,IAAI,SAAS,KAAK,SAAS,IAAI,cAAc,KAAK,IAAI;EAC/D,KAAK,SACH,OAAO,IAAI,UAAU,KAAK,SAAS,IAAI,cAAc,KAAK,KAAK;EACjE,KAAK,SAAS;GACZ,MAAM,IAAI,eAAe,YAAY,KAAK,SAAS,GAAG,CAAC;GACvD,IAAI,eAAe,CAAC,GAAG,OAAO;GAC9B,OAAO,KAAK,OAAO,MAAM,CAAC,IAAI;EAChC;EACA,KAAK,WAAW;GACd,MAAM,IAAI,eAAe,YAAY,KAAK,SAAS,GAAG,CAAC;GACvD,IAAI,eAAe,CAAC,GAAG,OAAO;GAC9B,OAAO,IAAI;EACb;EACA,KAAK,UACH,OAAO,eAAe,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,GAAG;EAC3D,KAAK,QACH,OAAO,IAAI,aAAa,KAAK,MAAM,KAAK,OAAO,QAAQ,YAAY,KAAK,GAAG,CAAC;CAChF;AACF;AAEA,SAAS,eACP,IACA,UACA,WACA,KACW;CACX,MAAM,OAAO,YAAY,UAAU,GAAG;CACtC,IAAI,eAAe,IAAI,GAAG,OAAO;CACjC,MAAM,QAAQ,YAAY,WAAW,GAAG;CACxC,IAAI,eAAe,KAAK,GAAG,OAAO;CAElC,IAAI,OAAO,KAAK;EACd,MAAM,IAAI,aAAa,IAAI;EAC3B,IAAI,eAAe,CAAC,GAAG,OAAO;EAC9B,MAAM,IAAI,aAAa,KAAK;EAC5B,IAAI,eAAe,CAAC,GAAG,OAAO;EAC9B,OAAO,IAAI;CACb;CAEA,IAAI,eAAe,IAAI,EAAE,GAAG;EAC1B,IAAI,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,KAAK,GAAG,OAAO,aAAa,SAAS;EAC9E,MAAM,MAAM,eAAe,MAAM,KAAK;EACtC,QAAQ,IAAR;GACE,KAAK,KACH,OAAO,QAAQ;GACjB,KAAK,MACH,OAAO,QAAQ;GACjB,KAAK,KACH,OAAO,MAAM;GACf,KAAK,MACH,OAAO,OAAO;GAChB,KAAK,KACH,OAAO,MAAM;GACf,SACE,OAAO,OAAO;EAClB;CACF;CAEA,MAAM,IAAI,eAAe,IAAI;CAC7B,IAAI,eAAe,CAAC,GAAG,OAAO;CAC9B,MAAM,IAAI,eAAe,KAAK;CAC9B,IAAI,eAAe,CAAC,GAAG,OAAO;CAE9B,QAAQ,IAAR;EACE,KAAK,KACH,OAAO,IAAI;EACb,KAAK,KACH,OAAO,IAAI;EACb,KAAK,KACH,OAAO,IAAI;EACb,KAAK;GACH,IAAI,MAAM,GAAG,OAAO,aAAa,SAAS;GAC1C,OAAO,IAAI;EACb,KAAK,KAAK;GACR,IAAI,MAAM,KAAK,IAAI,GAAG,OAAO,aAAa,SAAS;GACnD,MAAM,QAAQ,KAAK,IAAI,GAAG,CAAC;GAC3B,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ,aAAa,SAAS;EAChE;EAEA,SACE,OAAO,aAAa,SAAS;CACjC;AACF"}

package/dist/core/formula/functions.d.ts

@@ -1,30 +0,0 @@
-import { AstNode } from "./ast.js";
-import { EvalValue } from "./evaluator.js";
-//#region src/core/formula/functions.d.ts
-/**
- * 函数注册表（可扩展）+ 基础函数集。
- *
- * 参数形态约定：区域引用求值为数组（只含稀疏存在的格），直接参数为标量。
- * 聚合函数据此区分 Excel 语义：区域内的文本/布尔被忽略，直接参数则强转（非法 → #VALUE!）。
- * lazy 函数自行求值参数（IF 的短路分支，未选分支的副作用/错误不产生）。
- */
-type FormulaFunction = {
-  kind?: 'normal';
-  minArgs?: number;
-  maxArgs?: number;
-  impl: (args: EvalValue[]) => EvalValue;
-} | {
-  kind: 'lazy';
-  minArgs?: number;
-  maxArgs?: number;
-  impl: (nodes: AstNode[], evalNode: (node: AstNode) => EvalValue) => EvalValue;
-};
-/** 注册函数（名称大小写不敏感；同名覆盖，供扩展/自定义函数） */
-declare function registerFormulaFunction(name: string, def: FormulaFunction): void;
-/** 查询函数（大小写不敏感） */
-declare function getFormulaFunction(name: string): FormulaFunction | undefined;
-/** 求值器回调：名称解析 + 参数个数校验 + 按 kind 分发 */
-declare function invokeFormulaFunction(name: string, nodes: AstNode[], evalNode: (node: AstNode) => EvalValue): EvalValue;
-//#endregion
-export { FormulaFunction, getFormulaFunction, invokeFormulaFunction, registerFormulaFunction };
-//# sourceMappingURL=functions.d.ts.map