@mulmoclaude/collection-plugin 0.5.8 → 0.5.9

package/dist/deriveAll-BJ0Lvm1Q.cjs

@@ -1,359 +0,0 @@
-//#region src/core/derivedFormula.ts
-function evaluateDerived(formula, ctx) {
-	let tokens;
-	try {
-		tokens = tokenize(formula);
-	} catch {
-		return null;
-	}
-	const parser = new Parser(tokens);
-	let ast;
-	try {
-		ast = parser.parseExpr();
-		if (!parser.atEnd()) return null;
-	} catch {
-		return null;
-	}
-	const value = evaluate(ast, ctx);
-	return Number.isFinite(value) ? value : null;
-}
-var SINGLE_CHAR_PUNCT = new Set([
-	"(",
-	")",
-	"+",
-	"-",
-	"*",
-	"/",
-	"."
-]);
-function consumeWhitespace(cur) {
-	const char = cur.input[cur.index];
-	if (char === " " || char === "	" || char === "\n") {
-		cur.index++;
-		return true;
-	}
-	return false;
-}
-function consumeNumber(cur) {
-	const char = cur.input[cur.index] ?? "";
-	const next = cur.input[cur.index + 1] ?? "";
-	if (!isDigit(char) && !(char === "." && isDigit(next))) return null;
-	let raw = "";
-	while (cur.index < cur.input.length) {
-		const here = cur.input[cur.index] ?? "";
-		if (!isDigit(here) && here !== ".") break;
-		raw += here;
-		cur.index++;
-	}
-	const num = Number(raw);
-	if (!Number.isFinite(num)) throw new Error("bad number");
-	return {
-		kind: "number",
-		value: num
-	};
-}
-function consumeIdent(cur) {
-	if (!isIdentStart(cur.input[cur.index] ?? "")) return null;
-	let raw = "";
-	while (cur.index < cur.input.length && isIdentChar(cur.input[cur.index] ?? "")) {
-		raw += cur.input[cur.index];
-		cur.index++;
-	}
-	return {
-		kind: "ident",
-		value: raw
-	};
-}
-function consumePunct(cur) {
-	const char = cur.input[cur.index] ?? "";
-	if (char === "[" && cur.input[cur.index + 1] === "]") {
-		cur.index += 2;
-		return { kind: "[]" };
-	}
-	if (SINGLE_CHAR_PUNCT.has(char)) {
-		cur.index++;
-		return { kind: char };
-	}
-	return null;
-}
-function tokenize(input) {
-	const tokens = [];
-	const cur = {
-		input,
-		index: 0
-	};
-	while (cur.index < input.length) {
-		if (consumeWhitespace(cur)) continue;
-		const numTok = consumeNumber(cur);
-		if (numTok) {
-			tokens.push(numTok);
-			continue;
-		}
-		const punctTok = consumePunct(cur);
-		if (punctTok) {
-			tokens.push(punctTok);
-			continue;
-		}
-		const identTok = consumeIdent(cur);
-		if (identTok) {
-			tokens.push(identTok);
-			continue;
-		}
-		throw new Error(`unexpected char ${input[cur.index]}`);
-	}
-	return tokens;
-}
-function isDigit(char) {
-	return char >= "0" && char <= "9";
-}
-function isIdentStart(char) {
-	return char >= "a" && char <= "z" || char >= "A" && char <= "Z" || char === "_";
-}
-function isIdentChar(char) {
-	return isIdentStart(char) || isDigit(char);
-}
-var Parser = class {
-	tokens;
-	cursor = 0;
-	constructor(tokens) {
-		this.tokens = tokens;
-	}
-	atEnd() {
-		return this.cursor >= this.tokens.length;
-	}
-	peek() {
-		return this.tokens[this.cursor];
-	}
-	consume() {
-		const tok = this.tokens[this.cursor++];
-		if (!tok) throw new Error("unexpected end of input");
-		return tok;
-	}
-	expect(kind) {
-		const tok = this.consume();
-		if (tok.kind !== kind) throw new Error(`expected ${kind}, got ${tok.kind}`);
-		return tok;
-	}
-	parseExpr() {
-		let left = this.parseTerm();
-		while (this.peek()?.kind === "+" || this.peek()?.kind === "-") {
-			const operator = this.consume().kind;
-			const right = this.parseTerm();
-			left = {
-				kind: "binop",
-				operator,
-				left,
-				right
-			};
-		}
-		return left;
-	}
-	parseTerm() {
-		let left = this.parseFactor();
-		while (this.peek()?.kind === "*" || this.peek()?.kind === "/") {
-			const operator = this.consume().kind;
-			const right = this.parseFactor();
-			left = {
-				kind: "binop",
-				operator,
-				left,
-				right
-			};
-		}
-		return left;
-	}
-	parseFactor() {
-		const tok = this.peek();
-		if (!tok) throw new Error("unexpected end in factor");
-		if (tok.kind === "number") {
-			this.consume();
-			return {
-				kind: "num",
-				value: tok.value
-			};
-		}
-		if (tok.kind === "(") {
-			this.consume();
-			const inner = this.parseExpr();
-			this.expect(")");
-			return inner;
-		}
-		if (tok.kind === "ident") {
-			const name = tok.value ?? "";
-			if (name === "sum" && this.tokens[this.cursor + 1]?.kind === "(") {
-				this.consume();
-				this.expect("(");
-				const arg = this.parseSumArg();
-				this.expect(")");
-				return {
-					kind: "sum",
-					arg
-				};
-			}
-			this.consume();
-			if (this.peek()?.kind === ".") {
-				this.consume();
-				return {
-					kind: "ref",
-					field: name,
-					col: this.expect("ident").value
-				};
-			}
-			return {
-				kind: "ident",
-				name
-			};
-		}
-		throw new Error(`unexpected token ${tok.kind} in factor`);
-	}
-	parseSumArg() {
-		const factors = [];
-		const operators = [];
-		factors.push(this.parseTableCol());
-		while (this.peek()?.kind === "*" || this.peek()?.kind === "/") {
-			const operator = this.consume().kind;
-			operators.push(operator);
-			factors.push(this.parseTableCol());
-		}
-		return {
-			factors,
-			operators
-		};
-	}
-	parseTableCol() {
-		const tableTok = this.expect("ident");
-		this.expect("[]");
-		this.expect(".");
-		const colTok = this.expect("ident");
-		return {
-			table: tableTok.value,
-			col: colTok.value
-		};
-	}
-};
-function evaluate(node, ctx) {
-	if (node.kind === "num") return node.value;
-	if (node.kind === "ident") {
-		const raw = ctx.record[node.name];
-		return toFiniteNumber(raw);
-	}
-	if (node.kind === "ref") {
-		const target = ctx.refs?.[node.field] ?? null;
-		if (!target) return NaN;
-		return toFiniteNumber(target[node.col]);
-	}
-	if (node.kind === "binop") {
-		const left = evaluate(node.left, ctx);
-		const right = evaluate(node.right, ctx);
-		return applyBinop(node.operator, left, right);
-	}
-	if (node.kind === "sum") return evaluateSum(node.arg, ctx);
-	throw new Error(`unknown node`);
-}
-function applyBinop(operator, left, right) {
-	if (!Number.isFinite(left) || !Number.isFinite(right)) return NaN;
-	if (operator === "+") return left + right;
-	if (operator === "-") return left - right;
-	if (operator === "*") return left * right;
-	if (right === 0) return NaN;
-	return left / right;
-}
-function evaluateSum(arg, ctx) {
-	if (arg.factors.length === 0) return 0;
-	const tableName = arg.factors[0].table;
-	for (const factor of arg.factors) if (factor.table !== tableName) return NaN;
-	const rows = ctx.record[tableName];
-	if (!Array.isArray(rows)) return 0;
-	let total = 0;
-	for (const row of rows) {
-		if (!row || typeof row !== "object") continue;
-		let product = toFiniteNumber(row[arg.factors[0].col]);
-		if (!Number.isFinite(product)) return NaN;
-		for (let i = 1; i < arg.factors.length; i++) {
-			const value = toFiniteNumber(row[arg.factors[i].col]);
-			if (!Number.isFinite(value)) return NaN;
-			product = applyBinop(arg.operators[i - 1], product, value);
-		}
-		total += product;
-	}
-	return total;
-}
-function toFiniteNumber(value) {
-	if (typeof value === "number") return Number.isFinite(value) ? value : NaN;
-	if (typeof value === "string" && value.length > 0) {
-		const num = Number(value);
-		return Number.isFinite(num) ? num : NaN;
-	}
-	return NaN;
-}
-//#endregion
-//#region src/core/deriveAll.ts
-/** Map each `ref` field's stored slug to its loaded target record (or
-*  null when dangling / not loaded), keyed by the LOCAL field name —
-*  the shape `evaluateDerived` reads for `<field>.<col>` derefs. */
-function resolveRowRefs(schema, record, refRecords) {
-	const refs = {};
-	for (const [key, field] of Object.entries(schema.fields)) {
-		if (field.type !== "ref" || !field.to) continue;
-		const slug = record[key];
-		refs[key] = typeof slug === "string" ? refRecords[field.to]?.[slug] ?? null : null;
-	}
-	return refs;
-}
-/** Evaluate every `derived` field against `base`, saturating so a
-*  derived field can read another derived field computed in an earlier
-*  pass (`subtotal → tax → total` converges in ≤ field-count passes).
-*  Cycles can't loop forever — passes are bounded by the number of
-*  derived fields and the loop breaks as soon as a pass changes
-*  nothing. Failed formulas stay ABSENT (the UI renders them as
-*  em-dash). Returns a copy; `base` is never mutated.
-*
-*  Derived keys already present in `base` are stripped before
-*  evaluation: computed output is host-truth, never persisted-input
-*  fallback. A record JSON can carry a stale (or forged) derived value
-*  — raw Write/Edit, legacy data — and without the strip, a failing
-*  formula would silently surface that value as if the host computed
-*  it. */
-function deriveAll(schema, base, refRecords) {
-	const derivedKeys = new Set(Object.keys(schema.fields).filter((key) => schema.fields[key]?.type === "derived"));
-	const enriched = Object.fromEntries(Object.entries(base).filter(([key]) => !derivedKeys.has(key)));
-	const refs = resolveRowRefs(schema, base, refRecords);
-	const maxPasses = Object.values(schema.fields).filter((field) => field.type === "derived").length;
-	for (let pass = 0; pass < maxPasses; pass++) {
-		let mutated = false;
-		for (const [key, field] of Object.entries(schema.fields)) {
-			if (field.type !== "derived" || !field.formula) continue;
-			const next = evaluateDerived(field.formula, {
-				record: enriched,
-				refs
-			});
-			if (next !== null && enriched[key] !== next) {
-				enriched[key] = next;
-				mutated = true;
-			}
-		}
-		if (!mutated) break;
-	}
-	return enriched;
-}
-//#endregion
-Object.defineProperty(exports, "deriveAll", {
-	enumerable: true,
-	get: function() {
-		return deriveAll;
-	}
-});
-Object.defineProperty(exports, "evaluateDerived", {
-	enumerable: true,
-	get: function() {
-		return evaluateDerived;
-	}
-});
-Object.defineProperty(exports, "resolveRowRefs", {
-	enumerable: true,
-	get: function() {
-		return resolveRowRefs;
-	}
-});
-
-//# sourceMappingURL=deriveAll-BJ0Lvm1Q.cjs.map

package/dist/deriveAll-BJ0Lvm1Q.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"deriveAll-BJ0Lvm1Q.cjs","names":[],"sources":["../src/core/derivedFormula.ts","../src/core/deriveAll.ts"],"sourcesContent":["// Tiny expression evaluator for the `derived` field type on\n// schema-driven collections (see plans/done/feat-mc-invoice.md).\n//\n// Grammar (recursive-descent, no precedence climbing — six\n// non-terminals total):\n//\n//   expr   := term (('+' | '-') term)*\n//   term   := factor (('*' | '/') factor)*\n//   factor := number | sumCall | refAccess | identifier | '(' expr ')'\n//   sumCall:= 'sum' '(' sumArg ')'\n//   sumArg := tableCol (('*' | '/') tableCol)*      // e.g. lineItems[].quantity * lineItems[].rate\n//   tableCol := identifier '[]' '.' identifier\n//   refAccess := identifier '.' identifier          // e.g. ticker.price — deref a ref field into its target record\n//\n// `identifier` accepts top-level field names (single segment).\n// Inside `sumArg`, identifiers are the `<table>[].col` form.\n// A two-segment `<field>.<col>` at factor level is a *ref deref*:\n// `<field>` must be a `ref`-typed field on this record (its stored\n// value is the target item's slug), and `<col>` is a numeric column\n// read from that target record. The caller resolves the target into\n// `ctx.refs` (it owns the schema + the loaded target collection);\n// the evaluator stays pure and never does I/O.\n//\n// What's deliberately NOT supported (and would parse-error rather\n// than silently misbehave):\n//   - String literals, boolean operators, comparisons, conditionals\n//   - Nested function calls beyond `sum(...)`\n//   - Anything in the record that isn't a number / table-of-objects\n//\n// All evaluation is pure — no eval(), no Function constructor.\n// Returns `null` on any failure (parse error, unbound identifier,\n// non-finite arithmetic). The caller renders `null` as em-dash in\n// the table cell + form display.\n\nexport interface FormulaContext {\n  /** The record being evaluated. For derived fields in the form,\n   *  this is the live draft (text + table both converted via the\n   *  same `draftToRecord` pipeline). For the main table cell,\n   *  this is the persisted item. */\n  record: Record<string, unknown>;\n  /** Resolved ref-target records for THIS row, keyed by the local\n   *  `ref` field name. The caller (which has the schema + the linked\n   *  collection's items loaded) maps each ref field's stored slug to\n   *  the full target record and passes it here, so a `<field>.<col>`\n   *  formula can read a numeric column off the referenced record\n   *  (e.g. `shares * ticker.price`). A missing key or `null` value\n   *  (unknown field / dangling slug) makes that deref evaluate to\n   *  NaN → the whole formula returns `null` → em-dash, consistent\n   *  with every other failure mode. Absent ⇒ no refs available. */\n  refs?: Record<string, Record<string, unknown> | null>;\n}\n\nexport function evaluateDerived(formula: string, ctx: FormulaContext): number | null {\n  let tokens: Token[];\n  try {\n    tokens = tokenize(formula);\n  } catch {\n    return null;\n  }\n  // eslint-disable-next-line @typescript-eslint/no-use-before-define -- Parser class is defined later in the file (grouped with its AST + evaluator); evaluateDerived runs after module init so the TDZ concern doesn't apply.\n  const parser = new Parser(tokens);\n  let ast: Node;\n  try {\n    ast = parser.parseExpr();\n    if (!parser.atEnd()) return null; // trailing junk\n  } catch {\n    return null;\n  }\n  const value = evaluate(ast, ctx);\n  return Number.isFinite(value) ? value : null;\n}\n\n// ─── Tokens ────────────────────────────────────────────────\n\ntype TokenKind = \"number\" | \"ident\" | \"(\" | \")\" | \"+\" | \"-\" | \"*\" | \"/\" | \"[]\" | \".\";\n\ninterface Token {\n  kind: TokenKind;\n  value?: string | number;\n}\n\nconst SINGLE_CHAR_PUNCT = new Set<TokenKind>([\"(\", \")\", \"+\", \"-\", \"*\", \"/\", \".\"]);\n\ninterface Cursor {\n  input: string;\n  index: number;\n}\n\nfunction consumeWhitespace(cur: Cursor): boolean {\n  const char = cur.input[cur.index];\n  if (char === \" \" || char === \"\\t\" || char === \"\\n\") {\n    cur.index++;\n    return true;\n  }\n  return false;\n}\n\nfunction consumeNumber(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  const next = cur.input[cur.index + 1] ?? \"\";\n  if (!isDigit(char) && !(char === \".\" && isDigit(next))) return null;\n  let raw = \"\";\n  while (cur.index < cur.input.length) {\n    const here = cur.input[cur.index] ?? \"\";\n    if (!isDigit(here) && here !== \".\") break;\n    raw += here;\n    cur.index++;\n  }\n  const num = Number(raw);\n  if (!Number.isFinite(num)) throw new Error(\"bad number\");\n  return { kind: \"number\", value: num };\n}\n\nfunction consumeIdent(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  if (!isIdentStart(char)) return null;\n  let raw = \"\";\n  while (cur.index < cur.input.length && isIdentChar(cur.input[cur.index] ?? \"\")) {\n    raw += cur.input[cur.index];\n    cur.index++;\n  }\n  return { kind: \"ident\", value: raw };\n}\n\nfunction consumePunct(cur: Cursor): Token | null {\n  const char = cur.input[cur.index] ?? \"\";\n  if (char === \"[\" && cur.input[cur.index + 1] === \"]\") {\n    cur.index += 2;\n    return { kind: \"[]\" };\n  }\n  if (SINGLE_CHAR_PUNCT.has(char as TokenKind)) {\n    cur.index++;\n    return { kind: char as TokenKind };\n  }\n  return null;\n}\n\nfunction tokenize(input: string): Token[] {\n  const tokens: Token[] = [];\n  const cur: Cursor = { input, index: 0 };\n  while (cur.index < input.length) {\n    if (consumeWhitespace(cur)) continue;\n    // Number FIRST so a leading-dot literal (`.25`) isn't split by\n    // the `.` punctuation branch.\n    const numTok = consumeNumber(cur);\n    if (numTok) {\n      tokens.push(numTok);\n      continue;\n    }\n    const punctTok = consumePunct(cur);\n    if (punctTok) {\n      tokens.push(punctTok);\n      continue;\n    }\n    const identTok = consumeIdent(cur);\n    if (identTok) {\n      tokens.push(identTok);\n      continue;\n    }\n    throw new Error(`unexpected char ${input[cur.index]}`);\n  }\n  return tokens;\n}\n\nfunction isDigit(char: string): boolean {\n  return char >= \"0\" && char <= \"9\";\n}\nfunction isIdentStart(char: string): boolean {\n  return (char >= \"a\" && char <= \"z\") || (char >= \"A\" && char <= \"Z\") || char === \"_\";\n}\nfunction isIdentChar(char: string): boolean {\n  return isIdentStart(char) || isDigit(char);\n}\n\n// ─── AST + Parser ───────────────────────────────────────────\n\ntype Node =\n  | { kind: \"num\"; value: number }\n  | { kind: \"ident\"; name: string }\n  | { kind: \"ref\"; field: string; col: string }\n  | { kind: \"binop\"; operator: \"+\" | \"-\" | \"*\" | \"/\"; left: Node; right: Node }\n  | { kind: \"sum\"; arg: SumArg };\n\ninterface SumArg {\n  // factors multiplied/divided together; each is a (tableName, colName) ref into a row.\n  factors: { table: string; col: string }[];\n  /** Operators between factors: length = factors.length - 1; each\n   *  is \"*\" or \"/\". For a single-factor sum (`sum(lineItems[].amount)`)\n   *  this is empty. */\n  operators: (\"*\" | \"/\")[];\n}\n\nclass Parser {\n  private cursor = 0;\n  constructor(private readonly tokens: Token[]) {}\n\n  atEnd(): boolean {\n    return this.cursor >= this.tokens.length;\n  }\n  private peek(): Token | undefined {\n    return this.tokens[this.cursor];\n  }\n  private consume(): Token {\n    const tok = this.tokens[this.cursor++];\n    if (!tok) throw new Error(\"unexpected end of input\");\n    return tok;\n  }\n  private expect(kind: TokenKind): Token {\n    const tok = this.consume();\n    if (tok.kind !== kind) throw new Error(`expected ${kind}, got ${tok.kind}`);\n    return tok;\n  }\n\n  parseExpr(): Node {\n    let left = this.parseTerm();\n    while (this.peek()?.kind === \"+\" || this.peek()?.kind === \"-\") {\n      const operator = this.consume().kind as \"+\" | \"-\";\n      const right = this.parseTerm();\n      left = { kind: \"binop\", operator, left, right };\n    }\n    return left;\n  }\n\n  private parseTerm(): Node {\n    let left = this.parseFactor();\n    while (this.peek()?.kind === \"*\" || this.peek()?.kind === \"/\") {\n      const operator = this.consume().kind as \"*\" | \"/\";\n      const right = this.parseFactor();\n      left = { kind: \"binop\", operator, left, right };\n    }\n    return left;\n  }\n\n  private parseFactor(): Node {\n    const tok = this.peek();\n    if (!tok) throw new Error(\"unexpected end in factor\");\n    if (tok.kind === \"number\") {\n      this.consume();\n      return { kind: \"num\", value: tok.value as number };\n    }\n    if (tok.kind === \"(\") {\n      this.consume();\n      const inner = this.parseExpr();\n      this.expect(\")\");\n      return inner;\n    }\n    if (tok.kind === \"ident\") {\n      const name = (tok.value as string) ?? \"\";\n      // sum(...) — only function call we support\n      if (name === \"sum\" && this.tokens[this.cursor + 1]?.kind === \"(\") {\n        this.consume(); // ident\n        this.expect(\"(\");\n        const arg = this.parseSumArg();\n        this.expect(\")\");\n        return { kind: \"sum\", arg };\n      }\n      this.consume(); // ident\n      // ref deref: `<field>.<col>` (e.g. ticker.price). The table-row\n      // form `<table>[].col` only appears inside sum(), so a `.`\n      // immediately after a top-level ident is unambiguously a ref\n      // dereference here.\n      if (this.peek()?.kind === \".\") {\n        this.consume(); // '.'\n        const col = this.expect(\"ident\");\n        return { kind: \"ref\", field: name, col: col.value as string };\n      }\n      return { kind: \"ident\", name };\n    }\n    throw new Error(`unexpected token ${tok.kind} in factor`);\n  }\n\n  private parseSumArg(): SumArg {\n    const factors: { table: string; col: string }[] = [];\n    const operators: (\"*\" | \"/\")[] = [];\n    factors.push(this.parseTableCol());\n    while (this.peek()?.kind === \"*\" || this.peek()?.kind === \"/\") {\n      const operator = this.consume().kind as \"*\" | \"/\";\n      operators.push(operator);\n      factors.push(this.parseTableCol());\n    }\n    return { factors, operators };\n  }\n\n  private parseTableCol(): { table: string; col: string } {\n    const tableTok = this.expect(\"ident\");\n    this.expect(\"[]\");\n    this.expect(\".\");\n    const colTok = this.expect(\"ident\");\n    return { table: tableTok.value as string, col: colTok.value as string };\n  }\n}\n\n// ─── Evaluator ──────────────────────────────────────────────\n\nfunction evaluate(node: Node, ctx: FormulaContext): number {\n  if (node.kind === \"num\") return node.value;\n  if (node.kind === \"ident\") {\n    const raw = ctx.record[node.name];\n    return toFiniteNumber(raw);\n  }\n  if (node.kind === \"ref\") {\n    // `<field>.<col>`: read `col` off the resolved target record the\n    // caller put in ctx.refs. Unknown field / dangling slug → null →\n    // NaN, so the whole formula fails soft to an em-dash.\n    const target = ctx.refs?.[node.field] ?? null;\n    if (!target) return Number.NaN;\n    return toFiniteNumber(target[node.col]);\n  }\n  if (node.kind === \"binop\") {\n    const left = evaluate(node.left, ctx);\n    const right = evaluate(node.right, ctx);\n    return applyBinop(node.operator, left, right);\n  }\n  if (node.kind === \"sum\") {\n    return evaluateSum(node.arg, ctx);\n  }\n  // Exhaustive — TS narrows above branches but throw keeps runtime honest.\n  throw new Error(`unknown node`);\n}\n\nfunction applyBinop(operator: \"+\" | \"-\" | \"*\" | \"/\", left: number, right: number): number {\n  if (!Number.isFinite(left) || !Number.isFinite(right)) return Number.NaN;\n  if (operator === \"+\") return left + right;\n  if (operator === \"-\") return left - right;\n  if (operator === \"*\") return left * right;\n  // operator === \"/\"\n  if (right === 0) return Number.NaN;\n  return left / right;\n}\n\nfunction evaluateSum(arg: SumArg, ctx: FormulaContext): number {\n  if (arg.factors.length === 0) return 0;\n  const tableName = arg.factors[0].table;\n  // All factors must reference the SAME table (you can't multiply\n  // a row from lineItems against a row from another table — the\n  // semantics would be ambiguous). Reject mismatch.\n  for (const factor of arg.factors) {\n    if (factor.table !== tableName) return Number.NaN;\n  }\n  const rows = ctx.record[tableName];\n  if (!Array.isArray(rows)) return 0;\n  let total = 0;\n  for (const row of rows) {\n    if (!row || typeof row !== \"object\") continue;\n    let product = toFiniteNumber((row as Record<string, unknown>)[arg.factors[0].col]);\n    if (!Number.isFinite(product)) return Number.NaN;\n    for (let i = 1; i < arg.factors.length; i++) {\n      const value = toFiniteNumber((row as Record<string, unknown>)[arg.factors[i].col]);\n      if (!Number.isFinite(value)) return Number.NaN;\n      product = applyBinop(arg.operators[i - 1], product, value);\n    }\n    total += product;\n  }\n  return total;\n}\n\nfunction toFiniteNumber(value: unknown): number {\n  if (typeof value === \"number\") return Number.isFinite(value) ? value : Number.NaN;\n  if (typeof value === \"string\" && value.length > 0) {\n    const num = Number(value);\n    return Number.isFinite(num) ? num : Number.NaN;\n  }\n  return Number.NaN;\n}\n","// The derived-field saturation loop for schema-driven collections,\n// extracted from `composables/collections/useCollectionRendering.ts` so\n// the server (manageCollection getItems enrichment) and the client\n// (table cells, form display) evaluate formulas through ONE\n// implementation — if the two ever diverged, the UI and the LLM would\n// disagree on a number. Pure module: no Vue, no I/O.\n//\n// Like `actionVisible.ts`, the input types are minimal structural\n// shapes so both the client `FieldSpec`/`CollectionSchema`\n// (src/components/collectionTypes.ts) and the server\n// `CollectionFieldSpec`/`CollectionSchema`\n// (server/workspace/collections/types.ts) satisfy them as-is.\n\nimport { evaluateDerived, type FormulaContext } from \"./derivedFormula\";\n\n/** Minimal field shape the derive loop needs — accepts both the client\n *  FieldSpec and the server CollectionFieldSpec. */\nexport interface DerivableFieldSpec {\n  type: string;\n  /** When type === \"ref\": slug of the target collection. */\n  to?: string;\n  /** When type === \"derived\": formula evaluated against the record. */\n  formula?: string;\n}\n\n/** Minimal schema shape: just the ordered field map. */\nexport interface DerivableSchema {\n  fields: Record<string, DerivableFieldSpec>;\n}\n\nexport type DerivableRecord = Record<string, unknown>;\n\n/** Per-target-collection cache of loaded referenced records:\n *  target collection slug → item slug → full record. Mirrors the\n *  client's `RefRecordCache` / the server's enrichment loader. */\nexport type DeriveRefRecords = Record<string, Record<string, DerivableRecord>>;\n\n/** Map each `ref` field's stored slug to its loaded target record (or\n *  null when dangling / not loaded), keyed by the LOCAL field name —\n *  the shape `evaluateDerived` reads for `<field>.<col>` derefs. */\nexport function resolveRowRefs(schema: DerivableSchema, record: DerivableRecord, refRecords: DeriveRefRecords): NonNullable<FormulaContext[\"refs\"]> {\n  const refs: NonNullable<FormulaContext[\"refs\"]> = {};\n  for (const [key, field] of Object.entries(schema.fields)) {\n    if (field.type !== \"ref\" || !field.to) continue;\n    const slug = record[key];\n    refs[key] = typeof slug === \"string\" ? (refRecords[field.to]?.[slug] ?? null) : null;\n  }\n  return refs;\n}\n\n/** Evaluate every `derived` field against `base`, saturating so a\n *  derived field can read another derived field computed in an earlier\n *  pass (`subtotal → tax → total` converges in ≤ field-count passes).\n *  Cycles can't loop forever — passes are bounded by the number of\n *  derived fields and the loop breaks as soon as a pass changes\n *  nothing. Failed formulas stay ABSENT (the UI renders them as\n *  em-dash). Returns a copy; `base` is never mutated.\n *\n *  Derived keys already present in `base` are stripped before\n *  evaluation: computed output is host-truth, never persisted-input\n *  fallback. A record JSON can carry a stale (or forged) derived value\n *  — raw Write/Edit, legacy data — and without the strip, a failing\n *  formula would silently surface that value as if the host computed\n *  it. */\nexport function deriveAll(schema: DerivableSchema, base: DerivableRecord, refRecords: DeriveRefRecords): DerivableRecord {\n  const derivedKeys = new Set(Object.keys(schema.fields).filter((key) => schema.fields[key]?.type === \"derived\"));\n  const enriched: DerivableRecord = Object.fromEntries(Object.entries(base).filter(([key]) => !derivedKeys.has(key)));\n  const refs = resolveRowRefs(schema, base, refRecords);\n  const maxPasses = Object.values(schema.fields).filter((field) => field.type === \"derived\").length;\n  for (let pass = 0; pass < maxPasses; pass++) {\n    let mutated = false;\n    for (const [key, field] of Object.entries(schema.fields)) {\n      if (field.type !== \"derived\" || !field.formula) continue;\n      const next = evaluateDerived(field.formula, { record: enriched, refs });\n      if (next !== null && enriched[key] !== next) {\n        enriched[key] = next;\n        mutated = true;\n      }\n    }\n    if (!mutated) break;\n  }\n  return enriched;\n}\n"],"mappings":";AAoDA,SAAgB,gBAAgB,SAAiB,KAAoC;CACnF,IAAI;CACJ,IAAI;EACF,SAAS,SAAS,OAAO;CAC3B,QAAQ;EACN,OAAO;CACT;CAEA,MAAM,SAAS,IAAI,OAAO,MAAM;CAChC,IAAI;CACJ,IAAI;EACF,MAAM,OAAO,UAAU;EACvB,IAAI,CAAC,OAAO,MAAM,GAAG,OAAO;CAC9B,QAAQ;EACN,OAAO;CACT;CACA,MAAM,QAAQ,SAAS,KAAK,GAAG;CAC/B,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;AAC1C;AAWA,IAAM,oBAAoB,IAAI,IAAe;CAAC;CAAK;CAAK;CAAK;CAAK;CAAK;CAAK;AAAG,CAAC;AAOhF,SAAS,kBAAkB,KAAsB;CAC/C,MAAM,OAAO,IAAI,MAAM,IAAI;CAC3B,IAAI,SAAS,OAAO,SAAS,OAAQ,SAAS,MAAM;EAClD,IAAI;EACJ,OAAO;CACT;CACA,OAAO;AACT;AAEA,SAAS,cAAc,KAA2B;CAChD,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;CACrC,MAAM,OAAO,IAAI,MAAM,IAAI,QAAQ,MAAM;CACzC,IAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,SAAS,OAAO,QAAQ,IAAI,IAAI,OAAO;CAC/D,IAAI,MAAM;CACV,OAAO,IAAI,QAAQ,IAAI,MAAM,QAAQ;EACnC,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;EACrC,IAAI,CAAC,QAAQ,IAAI,KAAK,SAAS,KAAK;EACpC,OAAO;EACP,IAAI;CACN;CACA,MAAM,MAAM,OAAO,GAAG;CACtB,IAAI,CAAC,OAAO,SAAS,GAAG,GAAG,MAAM,IAAI,MAAM,YAAY;CACvD,OAAO;EAAE,MAAM;EAAU,OAAO;CAAI;AACtC;AAEA,SAAS,aAAa,KAA2B;CAE/C,IAAI,CAAC,aADQ,IAAI,MAAM,IAAI,UAAU,EACf,GAAG,OAAO;CAChC,IAAI,MAAM;CACV,OAAO,IAAI,QAAQ,IAAI,MAAM,UAAU,YAAY,IAAI,MAAM,IAAI,UAAU,EAAE,GAAG;EAC9E,OAAO,IAAI,MAAM,IAAI;EACrB,IAAI;CACN;CACA,OAAO;EAAE,MAAM;EAAS,OAAO;CAAI;AACrC;AAEA,SAAS,aAAa,KAA2B;CAC/C,MAAM,OAAO,IAAI,MAAM,IAAI,UAAU;CACrC,IAAI,SAAS,OAAO,IAAI,MAAM,IAAI,QAAQ,OAAO,KAAK;EACpD,IAAI,SAAS;EACb,OAAO,EAAE,MAAM,KAAK;CACtB;CACA,IAAI,kBAAkB,IAAI,IAAiB,GAAG;EAC5C,IAAI;EACJ,OAAO,EAAE,MAAM,KAAkB;CACnC;CACA,OAAO;AACT;AAEA,SAAS,SAAS,OAAwB;CACxC,MAAM,SAAkB,CAAC;CACzB,MAAM,MAAc;EAAE;EAAO,OAAO;CAAE;CACtC,OAAO,IAAI,QAAQ,MAAM,QAAQ;EAC/B,IAAI,kBAAkB,GAAG,GAAG;EAG5B,MAAM,SAAS,cAAc,GAAG;EAChC,IAAI,QAAQ;GACV,OAAO,KAAK,MAAM;GAClB;EACF;EACA,MAAM,WAAW,aAAa,GAAG;EACjC,IAAI,UAAU;GACZ,OAAO,KAAK,QAAQ;GACpB;EACF;EACA,MAAM,WAAW,aAAa,GAAG;EACjC,IAAI,UAAU;GACZ,OAAO,KAAK,QAAQ;GACpB;EACF;EACA,MAAM,IAAI,MAAM,mBAAmB,MAAM,IAAI,QAAQ;CACvD;CACA,OAAO;AACT;AAEA,SAAS,QAAQ,MAAuB;CACtC,OAAO,QAAQ,OAAO,QAAQ;AAChC;AACA,SAAS,aAAa,MAAuB;CAC3C,OAAQ,QAAQ,OAAO,QAAQ,OAAS,QAAQ,OAAO,QAAQ,OAAQ,SAAS;AAClF;AACA,SAAS,YAAY,MAAuB;CAC1C,OAAO,aAAa,IAAI,KAAK,QAAQ,IAAI;AAC3C;AAoBA,IAAM,SAAN,MAAa;CAEkB;CAD7B,SAAiB;CACjB,YAAY,QAAkC;EAAjB,KAAA,SAAA;CAAkB;CAE/C,QAAiB;EACf,OAAO,KAAK,UAAU,KAAK,OAAO;CACpC;CACA,OAAkC;EAChC,OAAO,KAAK,OAAO,KAAK;CAC1B;CACA,UAAyB;EACvB,MAAM,MAAM,KAAK,OAAO,KAAK;EAC7B,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,yBAAyB;EACnD,OAAO;CACT;CACA,OAAe,MAAwB;EACrC,MAAM,MAAM,KAAK,QAAQ;EACzB,IAAI,IAAI,SAAS,MAAM,MAAM,IAAI,MAAM,YAAY,KAAK,QAAQ,IAAI,MAAM;EAC1E,OAAO;CACT;CAEA,YAAkB;EAChB,IAAI,OAAO,KAAK,UAAU;EAC1B,OAAO,KAAK,KAAK,GAAG,SAAS,OAAO,KAAK,KAAK,GAAG,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,EAAE;GAChC,MAAM,QAAQ,KAAK,UAAU;GAC7B,OAAO;IAAE,MAAM;IAAS;IAAU;IAAM;GAAM;EAChD;EACA,OAAO;CACT;CAEA,YAA0B;EACxB,IAAI,OAAO,KAAK,YAAY;EAC5B,OAAO,KAAK,KAAK,GAAG,SAAS,OAAO,KAAK,KAAK,GAAG,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,EAAE;GAChC,MAAM,QAAQ,KAAK,YAAY;GAC/B,OAAO;IAAE,MAAM;IAAS;IAAU;IAAM;GAAM;EAChD;EACA,OAAO;CACT;CAEA,cAA4B;EAC1B,MAAM,MAAM,KAAK,KAAK;EACtB,IAAI,CAAC,KAAK,MAAM,IAAI,MAAM,0BAA0B;EACpD,IAAI,IAAI,SAAS,UAAU;GACzB,KAAK,QAAQ;GACb,OAAO;IAAE,MAAM;IAAO,OAAO,IAAI;GAAgB;EACnD;EACA,IAAI,IAAI,SAAS,KAAK;GACpB,KAAK,QAAQ;GACb,MAAM,QAAQ,KAAK,UAAU;GAC7B,KAAK,OAAO,GAAG;GACf,OAAO;EACT;EACA,IAAI,IAAI,SAAS,SAAS;GACxB,MAAM,OAAQ,IAAI,SAAoB;GAEtC,IAAI,SAAS,SAAS,KAAK,OAAO,KAAK,SAAS,IAAI,SAAS,KAAK;IAChE,KAAK,QAAQ;IACb,KAAK,OAAO,GAAG;IACf,MAAM,MAAM,KAAK,YAAY;IAC7B,KAAK,OAAO,GAAG;IACf,OAAO;KAAE,MAAM;KAAO;IAAI;GAC5B;GACA,KAAK,QAAQ;GAKb,IAAI,KAAK,KAAK,GAAG,SAAS,KAAK;IAC7B,KAAK,QAAQ;IAEb,OAAO;KAAE,MAAM;KAAO,OAAO;KAAM,KADvB,KAAK,OAAO,OACgB,EAAI;IAAgB;GAC9D;GACA,OAAO;IAAE,MAAM;IAAS;GAAK;EAC/B;EACA,MAAM,IAAI,MAAM,oBAAoB,IAAI,KAAK,WAAW;CAC1D;CAEA,cAA8B;EAC5B,MAAM,UAA4C,CAAC;EACnD,MAAM,YAA2B,CAAC;EAClC,QAAQ,KAAK,KAAK,cAAc,CAAC;EACjC,OAAO,KAAK,KAAK,GAAG,SAAS,OAAO,KAAK,KAAK,GAAG,SAAS,KAAK;GAC7D,MAAM,WAAW,KAAK,QAAQ,EAAE;GAChC,UAAU,KAAK,QAAQ;GACvB,QAAQ,KAAK,KAAK,cAAc,CAAC;EACnC;EACA,OAAO;GAAE;GAAS;EAAU;CAC9B;CAEA,gBAAwD;EACtD,MAAM,WAAW,KAAK,OAAO,OAAO;EACpC,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,GAAG;EACf,MAAM,SAAS,KAAK,OAAO,OAAO;EAClC,OAAO;GAAE,OAAO,SAAS;GAAiB,KAAK,OAAO;EAAgB;CACxE;AACF;AAIA,SAAS,SAAS,MAAY,KAA6B;CACzD,IAAI,KAAK,SAAS,OAAO,OAAO,KAAK;CACrC,IAAI,KAAK,SAAS,SAAS;EACzB,MAAM,MAAM,IAAI,OAAO,KAAK;EAC5B,OAAO,eAAe,GAAG;CAC3B;CACA,IAAI,KAAK,SAAS,OAAO;EAIvB,MAAM,SAAS,IAAI,OAAO,KAAK,UAAU;EACzC,IAAI,CAAC,QAAQ,OAAO;EACpB,OAAO,eAAe,OAAO,KAAK,IAAI;CACxC;CACA,IAAI,KAAK,SAAS,SAAS;EACzB,MAAM,OAAO,SAAS,KAAK,MAAM,GAAG;EACpC,MAAM,QAAQ,SAAS,KAAK,OAAO,GAAG;EACtC,OAAO,WAAW,KAAK,UAAU,MAAM,KAAK;CAC9C;CACA,IAAI,KAAK,SAAS,OAChB,OAAO,YAAY,KAAK,KAAK,GAAG;CAGlC,MAAM,IAAI,MAAM,cAAc;AAChC;AAEA,SAAS,WAAW,UAAiC,MAAc,OAAuB;CACxF,IAAI,CAAC,OAAO,SAAS,IAAI,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;CAC9D,IAAI,aAAa,KAAK,OAAO,OAAO;CACpC,IAAI,aAAa,KAAK,OAAO,OAAO;CACpC,IAAI,aAAa,KAAK,OAAO,OAAO;CAEpC,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO,OAAO;AAChB;AAEA,SAAS,YAAY,KAAa,KAA6B;CAC7D,IAAI,IAAI,QAAQ,WAAW,GAAG,OAAO;CACrC,MAAM,YAAY,IAAI,QAAQ,GAAG;CAIjC,KAAK,MAAM,UAAU,IAAI,SACvB,IAAI,OAAO,UAAU,WAAW,OAAO;CAEzC,MAAM,OAAO,IAAI,OAAO;CACxB,IAAI,CAAC,MAAM,QAAQ,IAAI,GAAG,OAAO;CACjC,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;EACrC,IAAI,UAAU,eAAgB,IAAgC,IAAI,QAAQ,GAAG,IAAI;EACjF,IAAI,CAAC,OAAO,SAAS,OAAO,GAAG,OAAO;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,QAAQ,KAAK;GAC3C,MAAM,QAAQ,eAAgB,IAAgC,IAAI,QAAQ,GAAG,IAAI;GACjF,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;GACpC,UAAU,WAAW,IAAI,UAAU,IAAI,IAAI,SAAS,KAAK;EAC3D;EACA,SAAS;CACX;CACA,OAAO;AACT;AAEA,SAAS,eAAe,OAAwB;CAC9C,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;CACvE,IAAI,OAAO,UAAU,YAAY,MAAM,SAAS,GAAG;EACjD,MAAM,MAAM,OAAO,KAAK;EACxB,OAAO,OAAO,SAAS,GAAG,IAAI,MAAM;CACtC;CACA,OAAO;AACT;;;;;;ACnUA,SAAgB,eAAe,QAAyB,QAAyB,YAAmE;CAClJ,MAAM,OAA4C,CAAC;CACnD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,OAAO,MAAM,GAAG;EACxD,IAAI,MAAM,SAAS,SAAS,CAAC,MAAM,IAAI;EACvC,MAAM,OAAO,OAAO;EACpB,KAAK,OAAO,OAAO,SAAS,WAAY,WAAW,MAAM,MAAM,SAAS,OAAQ;CAClF;CACA,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAgB,UAAU,QAAyB,MAAuB,YAA+C;CACvH,MAAM,cAAc,IAAI,IAAI,OAAO,KAAK,OAAO,MAAM,EAAE,QAAQ,QAAQ,OAAO,OAAO,MAAM,SAAS,SAAS,CAAC;CAC9G,MAAM,WAA4B,OAAO,YAAY,OAAO,QAAQ,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,YAAY,IAAI,GAAG,CAAC,CAAC;CAClH,MAAM,OAAO,eAAe,QAAQ,MAAM,UAAU;CACpD,MAAM,YAAY,OAAO,OAAO,OAAO,MAAM,EAAE,QAAQ,UAAU,MAAM,SAAS,SAAS,EAAE;CAC3F,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,UAAU;EACd,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,OAAO,MAAM,GAAG;GACxD,IAAI,MAAM,SAAS,aAAa,CAAC,MAAM,SAAS;GAChD,MAAM,OAAO,gBAAgB,MAAM,SAAS;IAAE,QAAQ;IAAU;GAAK,CAAC;GACtE,IAAI,SAAS,QAAQ,SAAS,SAAS,MAAM;IAC3C,SAAS,OAAO;IAChB,UAAU;GACZ;EACF;EACA,IAAI,CAAC,SAAS;CAChB;CACA,OAAO;AACT"}

package/dist/index.cjs

@@ -1,57 +0,0 @@
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_schema = require("./schema-5P5ZJPrY.cjs");
-const require_promptSafety = require("./promptSafety-B0pPJkfQ.cjs");
-const require_deriveAll = require("./deriveAll-BJ0Lvm1Q.cjs");
-exports.ENUM_ALERT = require_promptSafety.ENUM_ALERT;
-exports.ENUM_NEUTRAL = require_promptSafety.ENUM_NEUTRAL;
-exports.ENUM_NUDGE = require_promptSafety.ENUM_NUDGE;
-exports.FEED_SCHEDULES = require_schema.FEED_SCHEDULES;
-exports.INGEST_KINDS = require_schema.INGEST_KINDS;
-exports.MINUTES_PER_DAY = require_promptSafety.MINUTES_PER_DAY;
-exports.TOOL_DEFINITION = require_promptSafety.TOOL_DEFINITION;
-exports.TOOL_NAME = require_promptSafety.TOOL_NAME;
-exports.actionVisible = require_promptSafety.actionVisible;
-exports.assignLanes = require_promptSafety.assignLanes;
-exports.boolSortValue = require_promptSafety.boolSortValue;
-exports.bucketRecords = require_promptSafety.bucketRecords;
-exports.buildMonthGrid = require_promptSafety.buildMonthGrid;
-exports.buildUpdatedRecord = require_promptSafety.buildUpdatedRecord;
-exports.coerceInlineValue = require_promptSafety.coerceInlineValue;
-exports.compareSortValues = require_promptSafety.compareSortValues;
-exports.compareYmd = require_promptSafety.compareYmd;
-exports.dateOf = require_promptSafety.dateOf;
-exports.dateSortValue = require_promptSafety.dateSortValue;
-exports.daySlice = require_promptSafety.daySlice;
-exports.defangForPrompt = require_promptSafety.defangForPrompt;
-exports.deriveAll = require_deriveAll.deriveAll;
-exports.draftToRecord = require_promptSafety.draftToRecord;
-exports.emptyRow = require_promptSafety.emptyRow;
-exports.enumColorClasses = require_promptSafety.enumColorClasses;
-exports.enumSortValue = require_promptSafety.enumSortValue;
-exports.enumValueIndex = require_promptSafety.enumValueIndex;
-exports.errorMessage = require_promptSafety.errorMessage;
-exports.evaluateDerived = require_deriveAll.evaluateDerived;
-exports.executePresentCollection = require_promptSafety.executePresentCollection;
-exports.fieldVisible = require_promptSafety.fieldVisible;
-exports.firstMissingRequiredField = require_promptSafety.firstMissingRequiredField;
-exports.isFieldDrivenEvery = require_schema.isFieldDrivenEvery;
-exports.isSortableField = require_promptSafety.isSortableField;
-exports.itemIdOf = require_promptSafety.itemIdOf;
-exports.itemLabelOf = require_promptSafety.itemLabelOf;
-exports.labelFieldFor = require_promptSafety.labelFieldFor;
-exports.monthAnchorDate = require_promptSafety.monthAnchorDate;
-exports.nextSortDirection = require_promptSafety.nextSortDirection;
-exports.numericSortValue = require_promptSafety.numericSortValue;
-exports.parseIsoDate = require_promptSafety.parseIsoDate;
-exports.parseIsoDateTime = require_promptSafety.parseIsoDateTime;
-exports.parseTimeRange = require_promptSafety.parseTimeRange;
-exports.recordSpan = require_promptSafety.recordSpan;
-exports.resolveEnumColor = require_promptSafety.resolveEnumColor;
-exports.resolveRowRefs = require_deriveAll.resolveRowRefs;
-exports.rowFromItem = require_promptSafety.rowFromItem;
-exports.shortHexId = require_promptSafety.shortHexId;
-exports.sortItems = require_promptSafety.sortItems;
-exports.spanCoversDay = require_promptSafety.spanCoversDay;
-exports.stringSortValue = require_promptSafety.stringSortValue;
-exports.whenMatches = require_promptSafety.whenMatches;
-exports.ymdKey = require_promptSafety.ymdKey;

package/dist/index.d.ts

@@ -1,15 +0,0 @@
-export * from "./core/schema";
-export * from "./core/uiTypes";
-export * from "./core/presentCollection";
-export * from "./core/enumColors";
-export * from "./core/draft";
-export * from "./core/actionVisible";
-export * from "./core/derivedFormula";
-export * from "./core/deriveAll";
-export * from "./core/sortItems";
-export * from "./core/itemLabel";
-export * from "./core/calendarGrid";
-export * from "./core/errorMessage";
-export * from "./core/shortHexId";
-export * from "./core/promptSafety";
-//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAOA,cAAc,eAAe,CAAC;AAC9B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,0BAA0B,CAAC;AACzC,cAAc,mBAAmB,CAAC;AAClC,cAAc,cAAc,CAAC;AAC7B,cAAc,sBAAsB,CAAC;AACrC,cAAc,uBAAuB,CAAC;AACtC,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC"}

package/dist/index.js

@@ -1,4 +0,0 @@
-import { n as INGEST_KINDS, r as isFieldDrivenEvery, t as FEED_SCHEDULES } from "./schema-BcnitlL8.js";
-import { A as buildUpdatedRecord, B as ENUM_NEUTRAL, C as dateSortValue, D as numericSortValue, E as nextSortDirection, F as rowFromItem, G as TOOL_DEFINITION, H as enumColorClasses, I as actionVisible, K as TOOL_NAME, L as fieldVisible, M as draftToRecord, N as emptyRow, O as sortItems, P as firstMissingRequiredField, R as whenMatches, S as compareSortValues, T as isSortableField, U as enumValueIndex, V as ENUM_NUDGE, W as resolveEnumColor, _ as ymdKey, a as assignLanes, b as labelFieldFor, c as compareYmd, d as monthAnchorDate, f as parseIsoDate, g as spanCoversDay, h as recordSpan, i as MINUTES_PER_DAY, j as coerceInlineValue, k as stringSortValue, l as dateOf, m as parseTimeRange, n as shortHexId, o as bucketRecords, p as parseIsoDateTime, q as executePresentCollection, r as errorMessage, s as buildMonthGrid, t as defangForPrompt, u as daySlice, v as itemIdOf, w as enumSortValue, x as boolSortValue, y as itemLabelOf, z as ENUM_ALERT } from "./promptSafety-DIQ2yDca.js";
-import { n as resolveRowRefs, r as evaluateDerived, t as deriveAll } from "./deriveAll-BHcs1erT.js";
-export { ENUM_ALERT, ENUM_NEUTRAL, ENUM_NUDGE, FEED_SCHEDULES, INGEST_KINDS, MINUTES_PER_DAY, TOOL_DEFINITION, TOOL_NAME, actionVisible, assignLanes, boolSortValue, bucketRecords, buildMonthGrid, buildUpdatedRecord, coerceInlineValue, compareSortValues, compareYmd, dateOf, dateSortValue, daySlice, defangForPrompt, deriveAll, draftToRecord, emptyRow, enumColorClasses, enumSortValue, enumValueIndex, errorMessage, evaluateDerived, executePresentCollection, fieldVisible, firstMissingRequiredField, isFieldDrivenEvery, isSortableField, itemIdOf, itemLabelOf, labelFieldFor, monthAnchorDate, nextSortDirection, numericSortValue, parseIsoDate, parseIsoDateTime, parseTimeRange, recordSpan, resolveEnumColor, resolveRowRefs, rowFromItem, shortHexId, sortItems, spanCoversDay, stringSortValue, whenMatches, ymdKey };