@objectstack/formula 9.7.0 → 9.8.0

package/.turbo/turbo-build.log

@@ -1,5 +1,5 @@
 
-> @objectstack/formula@9.7.0 build /home/runner/work/framework/framework/packages/formula
+> @objectstack/formula@9.8.0 build /home/runner/work/framework/framework/packages/formula
 > tsup --config ../../tsup.config.ts
 
 CLI Building entry: src/index.ts
@@ -10,13 +10,13 @@
 CLI Cleaning output folder
 ESM Build start
 CJS Build start
-CJS dist/index.js     27.85 KB
-CJS dist/index.js.map 73.20 KB
-CJS ⚡️ Build success in 103ms
-ESM dist/index.mjs     26.12 KB
-ESM dist/index.mjs.map 71.83 KB
-ESM ⚡️ Build success in 104ms
+CJS dist/index.js     29.77 KB
+CJS dist/index.js.map 78.89 KB
+CJS ⚡️ Build success in 123ms
+ESM dist/index.mjs     28.04 KB
+ESM dist/index.mjs.map 77.53 KB
+ESM ⚡️ Build success in 124ms
 DTS Build start
-DTS ⚡️ Build success in 5303ms
-DTS dist/index.d.mts 15.44 KB
-DTS dist/index.d.ts  15.44 KB
+DTS ⚡️ Build success in 4371ms
+DTS dist/index.d.mts 15.71 KB
+DTS dist/index.d.ts  15.71 KB

package/CHANGELOG.md

@@ -1,5 +1,29 @@
 # @objectstack/formula
 
+## 9.8.0
+
+### Minor Changes
+
+- c17d2c8: feat(formula): register the CEL functions the authoring catalog advertises (daysBetween, abs, round, min, max, upper, lower, contains, startsWith, endsWith, matches, len, isEmpty, date, datetime)
+
+  `introspectScope` / `CEL_STDLIB_FUNCTIONS` advertised 25 functions to authors
+  (incl. AI), but only 8 were registered — 14 faulted at runtime (`daysBetween`,
+  `abs`, `round`, `min`, `max`, `upper`, `lower`, `len`, `isEmpty`, `contains`,
+  `startsWith`, `endsWith`, `matches`, plus `date`/`datetime`). Authors were told
+  to call functions that don't exist (e.g. `daysBetween` for "days remaining").
+
+  Register the genuinely-useful set in `registerStdLib` with dyn-lenient signatures
+  (so a `Field.date` arriving as a string still works) and internal coercion, and
+  reconcile the catalog so every advertised entry resolves — guarded by a test that
+  evaluates every `CEL_STDLIB_FUNCTIONS` entry. Pure additions; no behavior change
+  to existing expressions.
+
+### Patch Changes
+
+- Updated dependencies [97c55b3]
+- Updated dependencies [1b1f490]
+  - @objectstack/spec@9.8.0
+
 ## 9.7.0
 
 ### Minor Changes

package/dist/index.d.mts

@@ -364,7 +364,12 @@ declare function introspectScope(role: FieldRole, schema?: ExprSchemaHint): {
     roots: string[];
     functions: string[];
 };
-/** Public catalog of CEL stdlib functions available in expressions. */
+/**
+ * Public catalog of CEL functions available in expressions — what `introspectScope`
+ * advertises to authors (incl. AI). Every entry MUST actually resolve at runtime:
+ * either registered in `registerStdLib` or a verified cel-js built-in. Drifting this
+ * list ahead of the runtime tells the author to call functions that fault (#1928).
+ */
 declare const CEL_STDLIB_FUNCTIONS: string[];
 
 export { CEL_STDLIB_FUNCTIONS, DEFAULT_LIMITS, type DialectEngine, type EvalContext, type EvalError, type EvalResult, type ExprSchemaHint, type ExprValidationError, type ExprValidationResult, ExpressionEngine, type FieldRole, type SeedPrimitive, type SeedValue, TEMPLATE_FORMATTERS, buildScope, celEngine, cronEngine, expectedDialect, getEngine, hasDialect, introspectScope, normalizeExpression, normalizeExpressionTree, register, registerStdLib, resolveSeed, resolveSeedRecord, templateEngine, validateExpression };

package/dist/index.d.ts

@@ -364,7 +364,12 @@ declare function introspectScope(role: FieldRole, schema?: ExprSchemaHint): {
     roots: string[];
     functions: string[];
 };
-/** Public catalog of CEL stdlib functions available in expressions. */
+/**
+ * Public catalog of CEL functions available in expressions — what `introspectScope`
+ * advertises to authors (incl. AI). Every entry MUST actually resolve at runtime:
+ * either registered in `registerStdLib` or a verified cel-js built-in. Drifting this
+ * list ahead of the runtime tells the author to call functions that fault (#1928).
+ */
 declare const CEL_STDLIB_FUNCTIONS: string[];
 
 export { CEL_STDLIB_FUNCTIONS, DEFAULT_LIMITS, type DialectEngine, type EvalContext, type EvalError, type EvalResult, type ExprSchemaHint, type ExprValidationError, type ExprValidationResult, ExpressionEngine, type FieldRole, type SeedPrimitive, type SeedValue, TEMPLATE_FORMATTERS, buildScope, celEngine, cronEngine, expectedDialect, getEngine, hasDialect, introspectScope, normalizeExpression, normalizeExpressionTree, register, registerStdLib, resolveSeed, resolveSeedRecord, templateEngine, validateExpression };

package/dist/index.js

@@ -51,6 +51,12 @@ function startOfDayUtc(d) {
   out.setUTCHours(0, 0, 0, 0);
   return out;
 }
+function toDate(v) {
+  if (v instanceof Date) return v;
+  if (typeof v === "number" || typeof v === "bigint") return new Date(Number(v));
+  return new Date(String(v));
+}
+var MS_PER_DAY = 864e5;
 function addDaysUtc(d, n) {
   const out = new Date(d.getTime());
   out.setUTCDate(out.getUTCDate() + n);
@@ -96,8 +102,20 @@ function registerStdLib(env, now) {
       }
       return parts.join(separator);
     }
+  ).registerFunction(
+    "daysBetween(dyn, dyn): int",
+    (a, b) => BigInt(Math.round((toDate(b).getTime() - toDate(a).getTime()) / MS_PER_DAY))
+  ).registerFunction("date(dyn): google.protobuf.Timestamp", (s) => toDate(s)).registerFunction("datetime(dyn): google.protobuf.Timestamp", (s) => toDate(s)).registerFunction("abs(dyn): double", (x) => Math.abs(Number(x))).registerFunction("round(dyn): int", (x) => BigInt(Math.round(Number(x)))).registerFunction("min(dyn, dyn): dyn", (a, b) => Number(a) <= Number(b) ? a : b).registerFunction("max(dyn, dyn): dyn", (a, b) => Number(a) >= Number(b) ? a : b).registerFunction("upper(dyn): string", (s) => String(s ?? "").toUpperCase()).registerFunction("lower(dyn): string", (s) => String(s ?? "").toLowerCase()).registerFunction("contains(dyn, dyn): bool", (s, sub) => String(s ?? "").includes(String(sub ?? ""))).registerFunction("startsWith(dyn, dyn): bool", (s, p) => String(s ?? "").startsWith(String(p ?? ""))).registerFunction("endsWith(dyn, dyn): bool", (s, p) => String(s ?? "").endsWith(String(p ?? ""))).registerFunction("matches(dyn, dyn): bool", (s, re) => new RegExp(String(re ?? "")).test(String(s ?? ""))).registerFunction("len(dyn): int", (v) => BigInt(lengthOf(v))).registerFunction(
+    "isEmpty(dyn): bool",
+    (v) => v === null || v === void 0 || lengthOf(v) === 0
   );
 }
+function lengthOf(v) {
+  if (v === null || v === void 0) return 0;
+  if (typeof v === "string" || Array.isArray(v)) return v.length;
+  if (typeof v === "object") return Object.keys(v).length;
+  return 0;
+}
 function registerNumericCoercions(env) {
   const ops = {
     "+": (a, b) => a + b,
@@ -854,22 +872,20 @@ function introspectScope(role, schema) {
   };
 }
 var CEL_STDLIB_FUNCTIONS = [
+  // Dates (registered stdlib)
   "now",
   "today",
   "daysFromNow",
+  "daysAgo",
   "daysBetween",
   "date",
   "datetime",
-  "timestamp",
-  "isBlank",
-  "isEmpty",
-  "coalesce",
-  "len",
-  "size",
-  "int",
-  "float",
-  "string",
-  "bool",
+  // Numbers (registered stdlib)
+  "abs",
+  "round",
+  "min",
+  "max",
+  // Strings (registered stdlib)
   "upper",
   "lower",
   "trim",
@@ -877,11 +893,21 @@ var CEL_STDLIB_FUNCTIONS = [
   "startsWith",
   "endsWith",
   "matches",
+  "joinNonEmpty",
+  // Collections / null-ish (registered stdlib)
+  "isBlank",
+  "isEmpty",
+  "coalesce",
+  "len",
+  // cel-js built-ins (verified to resolve)
+  "size",
   "has",
-  "min",
-  "max",
-  "abs",
-  "round"
+  "int",
+  "string",
+  "bool",
+  "double",
+  "timestamp",
+  "duration"
 ];
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts","../src/cel-engine.ts","../src/stdlib.ts","../src/cron-engine.ts","../src/template-engine.ts","../src/registry.ts","../src/seed-eval.ts","../src/normalize.ts","../src/validate.ts"],"sourcesContent":["/**\n * @objectstack/formula\n *\n * Canonical expression engine for ObjectStack. CEL (Common Expression\n * Language) is the default dialect; `js` and `cron` are dispatched to\n * dedicated plugin engines.\n *\n * @see content/docs/concepts/north-star.mdx §8 \"No private expression DSL\"\n * @see ROADMAP.md M9 \"Expression Unification\"\n */\n\nexport { ExpressionEngine, getEngine, hasDialect, register } from './registry';\nexport { celEngine, DEFAULT_LIMITS } from './cel-engine';\nexport { cronEngine } from './cron-engine';\nexport { templateEngine, TEMPLATE_FORMATTERS } from './template-engine';\nexport { registerStdLib, buildScope } from './stdlib';\nexport { resolveSeed, resolveSeedRecord } from './seed-eval';\nexport { normalizeExpression, normalizeExpressionTree } from './normalize';\n// ADR-0032 — shared validator + introspection (one validator for build,\n// registration, and the agent-callable validate_expression tool).\nexport { validateExpression, introspectScope, expectedDialect, CEL_STDLIB_FUNCTIONS } from './validate';\nexport type { FieldRole, ExprSchemaHint, ExprValidationError, ExprValidationResult } from './validate';\nexport type { SeedValue, SeedPrimitive } from './seed-eval';\nexport type { DialectEngine, EvalContext, EvalResult, EvalError } from './types';\n","/**\n * CEL dialect engine — wraps `@marcbachmann/cel-js` with the ObjectStack\n * stdlib, bounded execution limits, and result coercion.\n *\n * Why a thin wrapper:\n *\n *  - cel-js returns `BigInt` for ints. The kernel and CRM expect plain\n *    numbers, so we coerce at the boundary.\n *  - cel-js parses dotted names as receiver-typed methods; we register\n *    `now()`, `today()`, `daysFromNow()` as bare functions and let `os.*`\n *    refer to context data only (see {@link buildScope}).\n *  - Bounds (`maxAstNodes`, `maxDepth`, …) are enforced spec-wide so\n *    third-party plugins can't ship runaway predicates.\n */\n\nimport { Environment } from '@marcbachmann/cel-js';\nimport type { Expression } from '@objectstack/spec';\n\nimport { buildScope, registerNumericCoercions, registerStdLib } from './stdlib';\nimport type { DialectEngine, EvalContext, EvalResult } from './types';\n\n/**\n * Default execution bounds. Picked conservatively — every metadata-authored\n * expression we've seen is well under these. If you hit them, the expression\n * is too complex for ObjectStack and should be moved to a hook (`dialect: js`).\n */\nexport const DEFAULT_LIMITS = {\n  maxAstNodes: 256,\n  maxDepth: 32,\n  maxListElements: 64,\n  maxMapEntries: 64,\n  maxCallArguments: 16,\n} as const;\n\nfunction buildEnv(now: () => Date): Environment {\n  const env = new Environment({\n    unlistedVariablesAreDyn: true,\n    enableOptionalTypes: true,\n    limits: DEFAULT_LIMITS,\n  });\n  return registerNumericCoercions(registerStdLib(env, now));\n}\n\n/**\n * Namespace roots that a `record`-scoped CEL site may legitimately reference.\n * Declared as `map` (dyn values) so member access (`record.foo`) and any\n * arithmetic/comparison on it defers to runtime — the strict env faults ONLY on\n * an *undeclared* top-level identifier, i.e. a bare field reference. Generous on\n * purpose: an unknown root is a missed catch, a missing root is a false positive\n * that would break the build, so we err toward declaring more.\n */\nconst SCOPE_ROOTS = [\n  'record', 'previous', 'input', 'output', 'os', 'vars', 'variables',\n  'automation', 'context', 'args', 'item', 'env', 'user', 'step', 'result',\n  'trigger', 'event', 'payload', 'data', 'params', 'config', 'settings',\n] as const;\n\n/**\n * A `record`-scoped environment (`unlistedVariablesAreDyn: false`) for detecting\n * bare field references. It reuses the real stdlib so function calls don't fault;\n * only undeclared *variables* do. Built once — `parse`/`check` do not mutate it.\n */\nfunction buildScopedEnv(knownFields: readonly string[]): Environment {\n  const env = new Environment({\n    unlistedVariablesAreDyn: false,\n    enableOptionalTypes: true,\n    limits: DEFAULT_LIMITS,\n  });\n  registerStdLib(env, () => new Date(0));\n  for (const root of SCOPE_ROOTS) {\n    try { env.registerVariable(root, 'map'); } catch { /* duplicate — ignore */ }\n  }\n  // `knownFields` are declared as `dyn` so they (and member/arith/compare on\n  // them) never fault — only a genuinely-undeclared top-level identifier does.\n  // Empty for a record-scope site (any bare field is a bug); the trigger\n  // object's fields for a flattened flow condition (only a NON-field bare ref —\n  // a typo or flow variable — is then interesting).\n  for (const field of knownFields) {\n    try { env.registerVariable(field, 'dyn'); } catch { /* duplicate / reserved — ignore */ }\n  }\n  return env;\n}\n\n// Roots-only env reused for the common record-scope check (no per-call rebuild).\nlet recordScopeEnv: Environment | undefined;\n\n/**\n * In a `record`-scoped CEL site — a `Field.formula` or an object validation\n * predicate — the evaluation scope binds only the `record`/`previous`/… *namespaces*\n * (no field flattening). A bare top-level identifier like `amount` or `status`\n * therefore resolves to nothing and the expression silently evaluates to `null`\n * / never fires (#1928, the class behind #1927's broken formulas). Returns the\n * first such bare reference, or `null`.\n *\n * Acts ONLY on cel-js's `Unknown variable: X` fault, so it cannot false-positive\n * on arithmetic/comparison overloads — and it must NOT be applied to flow /\n * automation conditions, where the record's fields ARE flattened to top-level\n * and bare references are correct.\n */\nexport function firstUndeclaredReference(\n  source: string,\n  knownFields: readonly string[] = [],\n): string | null {\n  if (typeof source !== 'string' || !source.trim()) return null;\n  try {\n    const env = knownFields.length === 0\n      ? (recordScopeEnv ??= buildScopedEnv([]))\n      : buildScopedEnv(knownFields);\n    const result = env.parse(source).check?.() as\n      | { valid: boolean; error?: { message?: string } }\n      | undefined;\n    if (result && result.valid === false) {\n      const m = /Unknown variable:\\s*([A-Za-z_$][\\w$]*)/.exec(result.error?.message ?? '');\n      if (m) return m[1];\n    }\n  } catch {\n    // Parse/other faults are the syntax checker's job (celEngine.compile); this\n    // helper only reports the undeclared-variable case.\n  }\n  return null;\n}\n\n/** @deprecated use {@link firstUndeclaredReference} with no fields. */\nexport function detectBareReference(source: string): string | null {\n  return firstUndeclaredReference(source);\n}\n\n/** Coerce cel-js's BigInt-flavored return into spec-friendly JS values. */\nfunction coerce(value: unknown): unknown {\n  if (typeof value === 'bigint') {\n    // BigInt → number when safe, else string to avoid silent truncation.\n    if (value >= BigInt(Number.MIN_SAFE_INTEGER) && value <= BigInt(Number.MAX_SAFE_INTEGER)) {\n      return Number(value);\n    }\n    return value.toString();\n  }\n  if (Array.isArray(value)) return value.map(coerce);\n  if (value && typeof value === 'object' && !(value instanceof Date)) {\n    const out: Record<string, unknown> = {};\n    for (const [k, v] of Object.entries(value)) out[k] = coerce(v);\n    return out;\n  }\n  return value;\n}\n\n/**\n * A string that is *entirely* a JS number literal: optional sign, integer\n * and/or fractional part, optional exponent. Deliberately strict — `\"5.0\"`,\n * `\"250000.00\"`, `\"-3\"`, `\"1e3\"` match; `\"5px\"`, `\"0x10\"`, `\" \"`, `\"\"`,\n * `\"1,000\"`, `\"v2\"` do not.\n */\n// The fractional part is a single optional `(?:\\.\\d*)?` group anchored by the\n// literal `.` — never the ambiguous `\\d+\\.?\\d*`, whose adjacent unbounded\n// quantifiers (`\\d+\\d*` when the dot is absent) backtrack polynomially on long\n// digit runs (CodeQL ReDoS). This matches the same strings without the hazard.\nconst NUMERIC_STRING_RE = /^[+-]?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:[eE][+-]?\\d+)?$/;\n\n/**\n * A string that is an ISO-8601 date (`\"2026-06-20\"`) or date-time\n * (`\"2026-06-20T08:15:35.244Z\"`, `\"2026-06-20 08:15\"`, `\"...+02:00\"`). Strict\n * and anchored — no nested unbounded quantifiers, so no ReDoS hazard (every\n * sub-group is bounded or a single `\\.\\d+`). `Field.date` / `Field.datetime`\n * serialize to these; cel-js compares them as `string` and faults against the\n * `google.protobuf.Timestamp` returned by `today()` / `now()` / `daysFromNow()`.\n */\nconst ISO_TEMPORAL_STRING_RE =\n  /^\\d{4}-\\d{2}-\\d{2}(?:[T ]\\d{2}:\\d{2}(?::\\d{2})?(?:\\.\\d+)?(?:Z|[+-]\\d{2}:?\\d{2})?)?$/;\n\n/**\n * cel-js raises `no such overload: dyn <op> int` (and kin) when a comparison\n * or arithmetic operator sees a `string` on one side and a number on the\n * other. ADR-0032 §1c — numeric fields that serialize as strings (`Field.rating`\n * → `\"5.0\"`, `Field.currency` → `\"250000.00\"`, `Field.percent`) trip this in\n * flow conditions / formulas (#1530, #1534) even though the schema and the\n * build-time validator treat them as numeric.\n */\nfunction isNumericOverloadError(err: unknown): boolean {\n  const message = err instanceof Error ? err.message : String(err);\n  return /no such overload/i.test(message);\n}\n\n/**\n * Recursively coerce string values that faulted a CEL overload into their\n * intended primitive: entirely-numeric literals → `number` (#1534), and\n * ISO-8601 date / date-time strings → `Date` (cel-js `google.protobuf.Timestamp`)\n * (#1530). Used only on the {@link isNumericOverloadError} retry path, so it can\n * never change a comparison that already evaluated cleanly — it only rescues one\n * that already faulted. Strings that are neither (a zip like `\"02134\"`, free\n * text) pass through untouched; if the retry still cannot type-check, the\n * original loud error is preserved.\n */\nfunction hydrateOverloadStrings(value: unknown): unknown {\n  if (typeof value === 'string') {\n    const trimmed = value.trim();\n    if (trimmed.length > 0) {\n      if (NUMERIC_STRING_RE.test(trimmed)) {\n        const n = Number(trimmed);\n        if (Number.isFinite(n)) return n;\n      } else if (ISO_TEMPORAL_STRING_RE.test(trimmed)) {\n        const ms = Date.parse(trimmed);\n        if (!Number.isNaN(ms)) return new Date(ms);\n      }\n    }\n    return value;\n  }\n  if (Array.isArray(value)) return value.map(hydrateOverloadStrings);\n  if (value && typeof value === 'object' && !(value instanceof Date)) {\n    const out: Record<string, unknown> = {};\n    for (const [k, v] of Object.entries(value)) out[k] = hydrateOverloadStrings(v);\n    return out;\n  }\n  return value;\n}\n\nfunction classifyError(err: unknown): EvalResult<never> {\n  const message = err instanceof Error ? err.message : String(err);\n  let kind: 'parse' | 'type' | 'runtime' | 'bounds' = 'runtime';\n  if (/Exceeded max/i.test(message)) kind = 'bounds';\n  else if (/parse|unexpected|syntax/i.test(message)) kind = 'parse';\n  else if (/type|unknown variable|undeclared/i.test(message)) kind = 'type';\n  return { ok: false, error: { kind, message } };\n}\n\nexport const celEngine: DialectEngine = {\n  dialect: 'cel',\n\n  compile(source: string): EvalResult<unknown> {\n    try {\n      // We use a wall-clock now() here purely for parse-time stdlib\n      // type-checking; the function is never actually called.\n      const env = buildEnv(() => new Date(0));\n      const compiled = env.parse(source);\n      // Surface check errors eagerly. cel-js's `check()` returns a\n      // `TypeCheckResult` object (`{ valid, type?, error? }`) — NOT an array —\n      // so the type fault (including `found no matching overload for 'PRIOR(dyn)'`\n      // when a condition calls an UNKNOWN function) only surfaces when we read\n      // `valid === false`. The previous `Array.isArray(...)` guard never matched\n      // an object, so unknown-function predicates type-checked clean and were\n      // silently accepted by `objectstack build` / `registerFlow`, then no-op'd\n      // the flow at runtime (#1877). Reading the documented shape closes that.\n      const checkResult = compiled.check?.();\n      if (checkResult && checkResult.valid === false) {\n        return {\n          ok: false,\n          error: { kind: 'type', message: checkResult.error?.message ?? 'expression failed type checking' },\n        };\n      }\n      return { ok: true, value: compiled.ast };\n    } catch (err) {\n      return classifyError(err);\n    }\n  },\n\n  evaluate<T = unknown>(expr: Expression, ctx: EvalContext): EvalResult<T> {\n    if (expr.dialect !== 'cel') {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `celEngine cannot evaluate dialect '${expr.dialect}'` },\n      };\n    }\n    const source = expr.source;\n    if (typeof source !== 'string' || source.length === 0) {\n      // AST-only inputs: cel-js does not currently expose a public API to\n      // re-execute a parsed AST without re-serializing. We persist `source`\n      // as the canonical form during M9.1 and revisit AST-only execution in\n      // M9.7 when we cut the spec persistence over.\n      return {\n        ok: false,\n        error: { kind: 'parse', message: 'AST-only evaluation not yet supported; persist `source`' },\n      };\n    }\n\n    const now = () => ctx.now ?? new Date();\n    try {\n      const env = buildEnv(now);\n      const scope = buildScope(ctx);\n      try {\n        const raw = env.evaluate(source, scope);\n        return { ok: true, value: coerce(raw) as T };\n      } catch (err) {\n        // ADR-0032 §1c — string-serialized fields make CEL raise\n        // `no such overload`: numeric fields (`rating` → `\"5.0\"`,\n        // `amount` → `\"250000.00\"`) on `record.rating >= 4` (#1534), and\n        // date/datetime fields (`end_date` → `\"2026-06-20\"`) on\n        // `record.end_date <= daysFromNow(60)` (#1530), since cel-js compares the\n        // raw string against the `google.protobuf.Timestamp` from `today()` etc.\n        // Hydrate those strings to number / Date and retry ONCE. This only runs\n        // after a fault, so a comparison that already evaluated cleanly is never\n        // re-interpreted; if the retry still cannot type-check, the original loud\n        // error is reported.\n        if (!isNumericOverloadError(err)) throw err;\n        const hydrated = hydrateOverloadStrings(scope) as Record<string, unknown>;\n        try {\n          const raw = env.evaluate(source, hydrated);\n          return { ok: true, value: coerce(raw) as T };\n        } catch {\n          // Hydration did not resolve it — surface the original fault, not the\n          // retry's, so the message reflects what the author actually wrote.\n          throw err;\n        }\n      }\n    } catch (err) {\n      return classifyError(err);\n    }\n  },\n};\n","/**\n * ObjectStack standard CEL function library.\n *\n * Registered into the per-evaluation `Environment` by the CEL engine. All\n * functions are pure given a pinned `now` — that determinism is what makes\n * `objectstack build` artifacts byte-stable across runs.\n *\n * Function naming intentionally avoids the `os.` prefix because cel-js binds\n * dotted names to receiver types. Instead, the `os` namespace in CEL holds\n * *data* (`os.user`, `os.org`, `os.env`) supplied by the caller's\n * {@link EvalContext}.\n */\n\nimport type { Environment } from '@marcbachmann/cel-js';\n\nimport type { EvalContext } from './types';\n\n/** Truncate a Date to start-of-day in UTC. */\nfunction startOfDayUtc(d: Date): Date {\n  const out = new Date(d.getTime());\n  out.setUTCHours(0, 0, 0, 0);\n  return out;\n}\n\n/** Add `n` days to a Date in UTC; returns a new Date. */\nfunction addDaysUtc(d: Date, n: number): Date {\n  const out = new Date(d.getTime());\n  out.setUTCDate(out.getUTCDate() + n);\n  return out;\n}\n\n/**\n * Register the ObjectStack standard library into a CEL environment.\n *\n * The `now` resolver is closed over so each call uses the pinned\n * `EvalContext.now` (or wall-clock fallback). Implementations are kept tiny\n * and dependency-free — they're the contract surface for AI authors and must\n * stay legible.\n */\nexport function registerStdLib(\n  env: Environment,\n  now: () => Date,\n): Environment {\n  return env\n    .registerFunction('now(): google.protobuf.Timestamp', () => now())\n    .registerFunction(\n      'today(): google.protobuf.Timestamp',\n      () => startOfDayUtc(now()),\n    )\n    .registerFunction(\n      'daysFromNow(int): google.protobuf.Timestamp',\n      (n: bigint | number) => addDaysUtc(now(), Number(n)),\n    )\n    .registerFunction(\n      'daysAgo(int): google.protobuf.Timestamp',\n      (n: bigint | number) => addDaysUtc(now(), -Number(n)),\n    )\n    // Returns true when `value` is null, undefined, empty string, or empty list.\n    // Matches the intent of legacy `ISBLANK()` while staying CEL-idiomatic.\n    .registerFunction(\n      'isBlank(dyn): bool',\n      (value: unknown) => {\n        if (value === null || value === undefined) return true;\n        if (typeof value === 'string') return value.length === 0;\n        if (Array.isArray(value)) return value.length === 0;\n        return false;\n      },\n    )\n    // Returns `value` when not null/undefined, otherwise the `fallback`.\n    // Use this to safely concatenate optional string fields:\n    //   coalesce(record.salutation, '') + ' ' + coalesce(record.first_name, '')\n    .registerFunction(\n      'coalesce(dyn, dyn): dyn',\n      (value: unknown, fallback: unknown) =>\n        (value === null || value === undefined) ? fallback : value,\n    )\n    // Trim leading/trailing ASCII whitespace from a string. Returns '' for\n    // null/undefined so it composes cleanly with `coalesce`.\n    .registerFunction(\n      'trim(dyn): string',\n      (value: unknown) => {\n        if (value === null || value === undefined) return '';\n        return String(value).trim();\n      },\n    )\n    // Join a list of values with `sep`, dropping null/undefined/empty entries\n    // first. Designed for display-name formulas like:\n    //   joinNonEmpty([record.salutation, record.first_name, record.last_name], ' ')\n    // which produces 'Alice Martinez' (no leading/trailing/internal extra\n    // spaces) when `salutation` is null.\n    .registerFunction(\n      'joinNonEmpty(list, string): string',\n      (list: unknown, sep: unknown) => {\n        const arr = Array.isArray(list) ? list : [];\n        const separator = typeof sep === 'string' ? sep : ' ';\n        const parts: string[] = [];\n        for (const item of arr) {\n          if (item === null || item === undefined) continue;\n          const s = String(item).trim();\n          if (s.length > 0) parts.push(s);\n        }\n        return parts.join(separator);\n      },\n    );\n}\n\n/**\n * Register mixed `double <op> int` / `int <op> double` arithmetic overloads.\n *\n * cel-js types a record field number as `double` and a bare integer literal as\n * `int`, and ships overloads only for matching pairs (`double op double`,\n * `int op int`). So a formula as ordinary as `record.amount / 100` or\n * `record.price * 2` faults at runtime (`no such overload: dyn<double> / int`);\n * the engine catches the fault and the formula silently evaluates to `null`\n * (#1928). Authors then have to know the cel-js quirk and write `/ 100.0`.\n *\n * We close the gap by registering the missing mixed overloads. The result is\n * always computed as a JS `double`, matching CEL's promotion rule for mixed\n * numeric arithmetic. Pure `int op int` is untouched, so integer division\n * (`7 / 2 == 3`) keeps its semantics — these overloads only fire when the two\n * operands are genuinely a `double` and an `int`.\n */\nexport function registerNumericCoercions(env: Environment): Environment {\n  const ops: Record<string, (a: number, b: number) => number> = {\n    '+': (a, b) => a + b,\n    '-': (a, b) => a - b,\n    '*': (a, b) => a * b,\n    '/': (a, b) => a / b,\n    '%': (a, b) => a % b,\n  };\n  for (const [op, fn] of Object.entries(ops)) {\n    const impl = (a: unknown, b: unknown) => fn(Number(a), Number(b));\n    env.registerOperator(`double ${op} int`, impl);\n    env.registerOperator(`int ${op} double`, impl);\n  }\n  return env;\n}\n\n/**\n * Build the variable scope for a single evaluation. Absent fields are simply\n * not bound — CEL macros (`has(record.foo)`) handle missing-key safely.\n */\nexport function buildScope(ctx: EvalContext): Record<string, unknown> {\n  const scope: Record<string, unknown> = {};\n\n  if (ctx.record !== undefined) scope.record = ctx.record;\n  if (ctx.previous !== undefined) scope.previous = ctx.previous;\n  if (ctx.input !== undefined) scope.input = ctx.input;\n\n  // Namespaced data — written as `os.user.id`, `os.env`, etc. in CEL.\n  const os: Record<string, unknown> = {};\n  if (ctx.user !== undefined) os.user = ctx.user;\n  if (ctx.org !== undefined) os.org = ctx.org;\n  if (ctx.env !== undefined) os.env = ctx.env;\n  if (Object.keys(os).length > 0) scope.os = os;\n\n  if (ctx.extra !== undefined) Object.assign(scope, ctx.extra);\n\n  return scope;\n}\n","/**\n * Cron dialect engine.\n *\n * Validates cron expressions at compile time without depending on a parser.\n * Actual schedule firing lives in the scheduler service — this engine just\n * round-trips the expression through `Expression.evaluate`, returning the\n * source so callers can hand it to a scheduler library.\n *\n * Accepted forms:\n *   - 5-field standard cron:  `m h dom mon dow`\n *   - 6-field extended cron:  `s m h dom mon dow`\n *   - Aliases: @yearly, @annually, @monthly, @weekly, @daily, @hourly, @reboot\n */\n\nimport type { Expression } from '@objectstack/spec';\n\nimport type { DialectEngine, EvalContext, EvalResult } from './types';\n\nconst ALIASES = new Set([\n  '@yearly', '@annually', '@monthly', '@weekly', '@daily', '@hourly', '@reboot',\n]);\n\nfunction validate(source: string): EvalResult<string> {\n  const trimmed = source.trim();\n  if (trimmed.length === 0) {\n    return { ok: false, error: { kind: 'parse', message: 'cron source is empty' } };\n  }\n  if (trimmed.startsWith('@')) {\n    if (!ALIASES.has(trimmed)) {\n      return {\n        ok: false,\n        error: { kind: 'parse', message: `unknown cron alias '${trimmed}'` },\n      };\n    }\n    return { ok: true, value: trimmed };\n  }\n  const fields = trimmed.split(/\\s+/);\n  if (fields.length !== 5 && fields.length !== 6) {\n    return {\n      ok: false,\n      error: {\n        kind: 'parse',\n        message: `cron requires 5 or 6 space-separated fields, got ${fields.length}`,\n      },\n    };\n  }\n  // Each field must use only allowed cron characters.\n  const allowed = /^[\\d*/,\\-?LWA-Z#]+$/i;\n  for (let i = 0; i < fields.length; i++) {\n    if (!allowed.test(fields[i])) {\n      return {\n        ok: false,\n        error: {\n          kind: 'parse',\n          message: `cron field ${i + 1} contains invalid characters: '${fields[i]}'`,\n        },\n      };\n    }\n  }\n  return { ok: true, value: trimmed };\n}\n\nexport const cronEngine: DialectEngine = {\n  dialect: 'cron',\n\n  compile(source: string): EvalResult<unknown> {\n    return validate(source);\n  },\n\n  evaluate<T = unknown>(expr: Expression, _ctx: EvalContext): EvalResult<T> {\n    if (expr.dialect !== 'cron') {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `cronEngine cannot evaluate dialect '${expr.dialect}'` },\n      };\n    }\n    if (typeof expr.source !== 'string') {\n      return { ok: false, error: { kind: 'parse', message: 'cron Expression.source required' } };\n    }\n    const result = validate(expr.source);\n    if (!result.ok) return result as EvalResult<T>;\n    // Cron expressions don't \"evaluate\" to a value at predicate time — they\n    // describe a schedule. Returning the source lets schedulers consume it.\n    return { ok: true, value: result.value as unknown as T };\n  },\n};\n","/**\n * Template dialect engine — strict Mustache subset with a formatter whitelist.\n *\n * Holes are `{{ path }}` or `{{ path | formatter[:'arg'] }}` (ADR-0032 §3).\n * Holes are restricted to a **field/variable path** plus a **whitelisted\n * formatter** — never arbitrary CEL logic — so the grammar stays small (low\n * author/agent error surface), GUI-pickable (path + formatter dropdown), and\n * display strings stay declarative. Real logic belongs in `Predicate`/`Expr`\n * (CEL) fields, where it is validated and visible.\n *\n * The variable scope is the same as CEL (`record`, `previous`, `input`,\n * `os.user/org/env`, plus `extra`), so authors move fluidly between a CEL\n * formula and a template body without re-learning a namespace.\n *\n * Value→string semantics are explicit and defined per formatter (numbers,\n * dates, money, percent, null), instead of implicit coercion.\n */\n\nimport type { Expression } from '@objectstack/spec';\n\nimport { buildScope } from './stdlib';\nimport type { DialectEngine, EvalContext, EvalResult } from './types';\n\n/**\n * A hole: capture the full inner content (no `}` allowed inside). Uses a single\n * greedy `[^}]*` (not `\\s*…\\s*` around a lazy group) so the pattern is linear —\n * `\\s` is a subset of `[^}]`, and wrapping a lazy group in `\\s*` creates an\n * ambiguous (polynomial-ReDoS) matcher. Surrounding whitespace is stripped in\n * `parseHole` instead.\n */\nconst HOLE_RE = /\\{\\{([^}]*)\\}\\}/g;\n\n// ───────────────────────── formatter whitelist (ADR-0032 §3) ──────────────\n\ntype Formatter = (value: unknown, arg: string | undefined, locale: string) => string;\n\nfunction asNumber(v: unknown): number | undefined {\n  if (typeof v === 'number') return v;\n  if (typeof v === 'bigint') return Number(v);\n  if (typeof v === 'string' && v.trim() !== '' && !Number.isNaN(Number(v))) return Number(v);\n  return undefined;\n}\n\nfunction asDate(v: unknown): Date | undefined {\n  if (v instanceof Date) return v;\n  if (typeof v === 'number') return new Date(v);\n  if (typeof v === 'string') {\n    const d = new Date(v);\n    if (!Number.isNaN(d.getTime())) return d;\n  }\n  return undefined;\n}\n\nconst FORMATTERS: Record<string, Formatter> = {\n  upper: (v) => baseString(v).toUpperCase(),\n  lower: (v) => baseString(v).toLowerCase(),\n  trim: (v) => baseString(v).trim(),\n  // number | number:2  → grouped, optional fixed decimals\n  number: (v, arg, locale) => {\n    const n = asNumber(v);\n    if (n === undefined) return baseString(v);\n    const digits = arg !== undefined ? Number(arg) : undefined;\n    return new Intl.NumberFormat(locale, digits !== undefined && !Number.isNaN(digits)\n      ? { minimumFractionDigits: digits, maximumFractionDigits: digits } : {}).format(n);\n  },\n  // currency | currency:EUR  → defaults to USD\n  currency: (v, arg, locale) => {\n    const n = asNumber(v);\n    if (n === undefined) return baseString(v);\n    const code = (arg && arg.trim()) || 'USD';\n    try {\n      return new Intl.NumberFormat(locale, { style: 'currency', currency: code }).format(n);\n    } catch {\n      return new Intl.NumberFormat(locale, { style: 'currency', currency: 'USD' }).format(n);\n    }\n  },\n  // percent | percent:1  → 0.42 → \"42%\" (value is a 0..1 ratio)\n  percent: (v, arg, locale) => {\n    const n = asNumber(v);\n    if (n === undefined) return baseString(v);\n    const digits = arg !== undefined ? Number(arg) : 0;\n    return new Intl.NumberFormat(locale, {\n      style: 'percent',\n      minimumFractionDigits: Number.isNaN(digits) ? 0 : digits,\n      maximumFractionDigits: Number.isNaN(digits) ? 0 : digits,\n    }).format(n);\n  },\n  // date | date:long | date:iso  → date-only\n  date: (v, arg, locale) => {\n    const d = asDate(v);\n    if (!d) return baseString(v);\n    if (arg === 'iso') return d.toISOString().slice(0, 10);\n    const style = arg === 'long' ? 'long' : arg === 'medium' ? 'medium' : 'short';\n    return new Intl.DateTimeFormat(locale, { dateStyle: style as 'short' | 'medium' | 'long' }).format(d);\n  },\n  // datetime | datetime:long | datetime:iso\n  datetime: (v, arg, locale) => {\n    const d = asDate(v);\n    if (!d) return baseString(v);\n    if (arg === 'iso') return d.toISOString();\n    const style = arg === 'long' ? 'long' : arg === 'medium' ? 'medium' : 'short';\n    return new Intl.DateTimeFormat(locale, {\n      dateStyle: style as 'short' | 'medium' | 'long',\n      timeStyle: style as 'short' | 'medium' | 'long',\n    }).format(d);\n  },\n  // truncate:80  → cut with an ellipsis\n  truncate: (v, arg) => {\n    const s = baseString(v);\n    const len = arg !== undefined ? Number(arg) : 80;\n    if (Number.isNaN(len) || s.length <= len) return s;\n    return s.slice(0, Math.max(0, len - 1)) + '…';\n  },\n  // default:'N/A'  → fallback when the value is null/undefined/empty\n  default: (v, arg) => {\n    const s = baseString(v);\n    return s === '' ? (arg ?? '') : s;\n  },\n  json: (v) => {\n    try { return JSON.stringify(v); } catch { return String(v); }\n  },\n};\n\n/** Public list of whitelisted template formatters (for introspection/docs). */\nexport const TEMPLATE_FORMATTERS: string[] = Object.keys(FORMATTERS);\n\nfunction baseString(value: unknown): string {\n  if (value === null || value === undefined) return '';\n  if (value instanceof Date) return value.toISOString();\n  if (typeof value === 'string') return value;\n  if (typeof value === 'number' || typeof value === 'boolean') return String(value);\n  if (typeof value === 'bigint') return value.toString();\n  try {\n    return JSON.stringify(value);\n  } catch {\n    return String(value);\n  }\n}\n\nfunction resolvePath(scope: Record<string, unknown>, path: string): unknown {\n  const normalized = path.replace(/\\[(\\w+)\\]/g, '.$1');\n  const segments = normalized.split('.').filter(Boolean);\n  let cursor: unknown = scope;\n  for (const seg of segments) {\n    if (cursor == null || typeof cursor !== 'object') return undefined;\n    cursor = (cursor as Record<string, unknown>)[seg];\n  }\n  return cursor;\n}\n\ninterface ParsedHole {\n  path: string;\n  filter?: { name: string; arg?: string };\n}\n\nconst PATH_ONLY_RE = /^[\\w.[\\]]+$/;\n\n/**\n * Parse a hole's inner content into a path + optional single formatter.\n * Returns null when the inner content is not a valid path[+formatter] form\n * (e.g. arbitrary CEL was written into a hole — rejected, ADR-0032 §3).\n */\nfunction parseHole(inner: string): ParsedHole | null {\n  const pipe = inner.indexOf('|');\n  if (pipe === -1) {\n    const path = inner.trim();\n    return PATH_ONLY_RE.test(path) ? { path } : null;\n  }\n  const path = inner.slice(0, pipe).trim();\n  if (!PATH_ONLY_RE.test(path)) return null;\n  const filterPart = inner.slice(pipe + 1).trim();\n  // `name` or `name:arg` or `name:'arg'`\n  const colon = filterPart.indexOf(':');\n  let name = filterPart;\n  let arg: string | undefined;\n  if (colon !== -1) {\n    name = filterPart.slice(0, colon).trim();\n    arg = filterPart.slice(colon + 1).trim().replace(/^['\"]|['\"]$/g, '');\n  }\n  if (!FORMATTERS[name]) return null;\n  return { path, filter: { name, arg } };\n}\n\nfunction compileTemplate(source: string): EvalResult<ParsedHole[]> {\n  const open = (source.match(/\\{\\{/g) ?? []).length;\n  const close = (source.match(/\\}\\}/g) ?? []).length;\n  if (open !== close) {\n    return { ok: false, error: { kind: 'parse', message: 'template has unbalanced {{ }} delimiters' } };\n  }\n  const holes: ParsedHole[] = [];\n  let m: RegExpExecArray | null;\n  HOLE_RE.lastIndex = 0;\n  while ((m = HOLE_RE.exec(source)) !== null) {\n    const parsed = parseHole(m[1]);\n    if (!parsed) {\n      return {\n        ok: false,\n        error: {\n          kind: 'parse',\n          message:\n            `invalid template hole \\`{{ ${m[1]} }}\\` — holes are a field path with an optional ` +\n            `formatter (\\`{{ record.amount | currency }}\\`), not arbitrary logic. ` +\n            `Move logic into a CEL field. Known formatters: ${TEMPLATE_FORMATTERS.join(', ')}.`,\n        },\n      };\n    }\n    holes.push(parsed);\n  }\n  return { ok: true, value: holes };\n}\n\nexport const templateEngine: DialectEngine = {\n  dialect: 'template',\n\n  compile(source: string): EvalResult<unknown> {\n    return compileTemplate(source);\n  },\n\n  evaluate<T = unknown>(expr: Expression, ctx: EvalContext): EvalResult<T> {\n    if (expr.dialect !== 'template') {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `templateEngine cannot evaluate dialect '${expr.dialect}'` },\n      };\n    }\n    if (typeof expr.source !== 'string') {\n      return { ok: false, error: { kind: 'parse', message: 'template Expression.source required' } };\n    }\n    const check = compileTemplate(expr.source);\n    if (!check.ok) return check as EvalResult<T>;\n\n    const scope = buildScope(ctx);\n    const locale =\n      (ctx.extra && typeof ctx.extra.locale === 'string' && ctx.extra.locale) ||\n      (typeof (ctx as { locale?: string }).locale === 'string' && (ctx as { locale?: string }).locale) ||\n      'en-US';\n\n    const out = expr.source.replace(HOLE_RE, (_match, inner) => {\n      const parsed = parseHole(String(inner));\n      if (!parsed) return _match; // compile already validated; defensive\n      const value = resolvePath(scope, parsed.path);\n      if (parsed.filter) {\n        return FORMATTERS[parsed.filter.name](value, parsed.filter.arg, locale as string);\n      }\n      return baseString(value);\n    });\n    return { ok: true, value: out as unknown as T };\n  },\n};\n","/**\n * Dialect-pluggable Expression engine registry.\n *\n * Replaces the per-call-site `compileFormula` / `evaluateFormula` direct\n * imports of the deleted custom engine. Call sites now ask the registry to\n * dispatch by `expression.dialect`.\n *\n * Stub dialects (`js`, `cron`) are registered at module load with explicit\n * `dialect`-error responses so call sites get a clear message instead of\n * silent `undefined` (the old engine's anti-pattern).\n */\n\nimport type { Expression } from '@objectstack/spec';\n\nimport { celEngine } from './cel-engine';\nimport { cronEngine } from './cron-engine';\nimport { templateEngine } from './template-engine';\nimport type { DialectEngine, EvalContext, EvalResult } from './types';\n\nconst registry = new Map<string, DialectEngine>();\n\n/** Register or replace a dialect engine. */\nexport function register(engine: DialectEngine): void {\n  registry.set(engine.dialect, engine);\n}\n\n/** Look up a dialect engine without dispatching. */\nexport function getEngine(dialect: string): DialectEngine | undefined {\n  return registry.get(dialect);\n}\n\n/** Whether a dialect has a real (non-stub) implementation registered. */\nexport function hasDialect(dialect: string): boolean {\n  return registry.has(dialect) && !registry.get(dialect)!.dialect.startsWith('stub:');\n}\n\nfunction makeStub(dialect: string, reason: string): DialectEngine {\n  return {\n    dialect,\n    compile: () => ({ ok: false, error: { kind: 'dialect', message: reason } }),\n    evaluate: () => ({ ok: false, error: { kind: 'dialect', message: reason } }),\n  };\n}\n\n// Real engines.\nregister(celEngine);\nregister(cronEngine);\nregister(templateEngine);\n\n// Stubs — `js` lives in @objectstack/plugin-js-vm (not yet shipped).\nregister(makeStub('js', \"dialect 'js' not registered. Install @objectstack/plugin-js-vm\"));\n\n/**\n * The unified evaluation entry point. Replaces the old direct calls to\n * `evaluateFormula` from the deleted custom engine.\n */\nexport const ExpressionEngine = {\n  register,\n  getEngine,\n  hasDialect,\n\n  /**\n   * Compile-only — parse + type-check, returning the engine-native AST. Used\n   * by `objectstack compile` to normalize source into AST in artifacts.\n   */\n  compile(expr: Expression): EvalResult<unknown> {\n    const engine = registry.get(expr.dialect);\n    if (!engine) {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `No engine registered for dialect '${expr.dialect}'` },\n      };\n    }\n    if (typeof expr.source !== 'string') {\n      return {\n        ok: false,\n        error: { kind: 'parse', message: 'Expression.source required for compile()' },\n      };\n    }\n    return engine.compile(expr.source);\n  },\n\n  /**\n   * Evaluate an expression in the given context. Never throws — branch on\n   * `result.ok`. Errors carry a `kind` for caller-side classification.\n   */\n  evaluate<T = unknown>(expr: Expression, ctx: EvalContext): EvalResult<T> {\n    const engine = registry.get(expr.dialect);\n    if (!engine) {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `No engine registered for dialect '${expr.dialect}'` },\n      };\n    }\n    return engine.evaluate<T>(expr, ctx);\n  },\n};\n","/**\n * Seed-value resolver.\n *\n * `Seed.records` accepts {@link SeedValue} = primitive | Expression | array\n * | object — install-time resolution walks the tree and replaces any\n * Expression node with its evaluated result. This is what makes\n * `close_date: cel\\`now() + duration(\"P30D\")\\`` resolve to *the customer's*\n * \"today + 30 days\" instead of the developer's compile-time clock.\n */\n\nimport { ExpressionSchema, type Expression } from '@objectstack/spec';\n\nimport type { EvalContext, EvalResult } from './types';\nimport { ExpressionEngine } from './registry';\n\nexport type SeedPrimitive = string | number | boolean | null | Date;\nexport type SeedValue = SeedPrimitive | Expression | SeedValue[] | { [key: string]: SeedValue };\n\n/** Detect an Expression-shaped object without throwing on unrelated shapes. */\nfunction isExpressionLike(value: unknown): value is Expression {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) return false;\n  const v = value as Record<string, unknown>;\n  if (typeof v.dialect !== 'string') return false;\n  return ExpressionSchema.safeParse(v).success;\n}\n\n/**\n * Recursively resolve a SeedValue. Records that contain Expression leaves are\n * evaluated with `ctx`; other values are passed through unchanged.\n *\n * Returns the first failure encountered. Callers (seed loader) typically\n * abort the whole record on failure rather than silently writing partial data.\n */\nexport function resolveSeed(\n  value: SeedValue,\n  ctx: EvalContext,\n): EvalResult<unknown> {\n  if (value === null || value === undefined) {\n    return { ok: true, value };\n  }\n  const t = typeof value;\n  if (t === 'string' || t === 'number' || t === 'boolean') {\n    return { ok: true, value };\n  }\n  if (value instanceof Date) {\n    return { ok: true, value };\n  }\n  if (Array.isArray(value)) {\n    const out: unknown[] = [];\n    for (const item of value) {\n      const r = resolveSeed(item, ctx);\n      if (!r.ok) return r;\n      out.push(r.value);\n    }\n    return { ok: true, value: out };\n  }\n  if (isExpressionLike(value)) {\n    return ExpressionEngine.evaluate(value, ctx);\n  }\n  // Plain object — recurse field-by-field.\n  const out: Record<string, unknown> = {};\n  for (const [k, v] of Object.entries(value as Record<string, SeedValue>)) {\n    const r = resolveSeed(v, ctx);\n    if (!r.ok) return r;\n    out[k] = r.value;\n  }\n  return { ok: true, value: out };\n}\n\n/**\n * Resolve a single record (object of fields), pinning `ctx.now` so all\n * expressions within see one logical clock.\n */\nexport function resolveSeedRecord(\n  record: Record<string, SeedValue>,\n  ctx: EvalContext,\n): EvalResult<Record<string, unknown>> {\n  const pinnedCtx: EvalContext = { ...ctx, now: ctx.now ?? new Date() };\n  const result = resolveSeed(record, pinnedCtx) as EvalResult<Record<string, unknown>>;\n  return result;\n}\n","/**\n * Build-time normalization helpers.\n *\n * The CLI `objectstack compile` step walks the assembled `objectstack.json`\n * artifact and rewrites every Expression so that:\n *\n *  1. String shorthand input is replaced by `{ dialect: 'cel', source }`.\n *  2. The persisted envelope carries an `ast` field produced by the dialect\n *     engine (M9.2 deliverable). Source is retained for round-trip / debug.\n *\n * Spec layer cannot do step 2 because it must remain dependency-free; this\n * package owns the engine import and therefore the AST step.\n */\n\nimport {\n  ExpressionInputSchema,\n  ExpressionSchema,\n  type Expression,\n  type ExpressionInput,\n} from '@objectstack/spec';\n\nimport { ExpressionEngine } from './registry';\nimport type { EvalResult } from './types';\n\n/**\n * Normalize an {@link ExpressionInput} (string shorthand OR full envelope) into\n * a fully-resolved {@link Expression} carrying both `source` and `ast`.\n *\n * Returns an EvalResult so the caller can render a structured compile error\n * pointing at the offending metadata path.\n */\nexport function normalizeExpression(input: ExpressionInput): EvalResult<Expression> {\n  const parsed = ExpressionInputSchema.safeParse(input);\n  if (!parsed.success) {\n    return {\n      ok: false,\n      error: { kind: 'parse', message: parsed.error.message },\n    };\n  }\n\n  const expr = parsed.data as Expression;\n\n  // Already AST-only — accept as-is.\n  if (expr.ast !== undefined && expr.source === undefined) {\n    return { ok: true, value: expr };\n  }\n\n  // Source-bearing: ask the dialect engine to compile. Failures surface here\n  // as part of the build (no silent skip).\n  const compiled = ExpressionEngine.compile(expr);\n  if (!compiled.ok) {\n    return compiled;\n  }\n\n  return {\n    ok: true,\n    value: {\n      ...expr,\n      ast: compiled.value,\n    },\n  };\n}\n\n/**\n * Walk an arbitrary JSON tree and normalize every embedded Expression in\n * place. Used by the build pipeline to traverse the assembled metadata\n * artifact. Returns the first error encountered (paired with the dotted path\n * for diagnostics) or `null` when fully clean.\n */\nexport function normalizeExpressionTree(\n  root: unknown,\n  path: string[] = [],\n): { path: string; error: import('./types').EvalError } | null {\n  if (root === null || typeof root !== 'object') return null;\n\n  if (looksLikeExpression(root)) {\n    const r = normalizeExpression(root as ExpressionInput);\n    if (!r.ok) return { path: path.join('.'), error: r.error };\n    Object.assign(root as Record<string, unknown>, r.value);\n    return null;\n  }\n\n  if (Array.isArray(root)) {\n    for (let i = 0; i < root.length; i++) {\n      const r = normalizeExpressionTree(root[i], [...path, String(i)]);\n      if (r) return r;\n    }\n    return null;\n  }\n\n  for (const [k, v] of Object.entries(root as Record<string, unknown>)) {\n    const r = normalizeExpressionTree(v, [...path, k]);\n    if (r) return r;\n  }\n  return null;\n}\n\nfunction looksLikeExpression(value: unknown): boolean {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) return false;\n  const v = value as Record<string, unknown>;\n  if (typeof v.dialect !== 'string') return false;\n  return ExpressionSchema.safeParse(v).success;\n}\n","/**\n * Shared expression validator (ADR-0032 §Decision 1/5).\n *\n * One validator, used by every author surface — `objectstack build`,\n * `registerFlow`/metadata registration, and the agent-callable\n * `validate_expression` tool — so a malformed expression is caught the same\n * way everywhere, with a message written for **self-correction** (Decision 1d):\n * it states what is wrong AND the correct form.\n *\n * Field roles map to dialects (Decision 2):\n *   - `predicate`  → bare CEL returning bool (`record.rating >= 4`)\n *   - `value`      → bare CEL of any type   (`daysFromNow(3)`)\n *   - `template`   → text with `{{ path }}` holes (`Hot lead: {{ record.name }}`)\n *\n * The #1 author error (human or LLM) is wrapping a field reference in single\n * `{…}` braces inside a CEL field — `{x}` parses as a CEL map literal and fails.\n * This validator detects that specific mistake and returns the exact fix.\n */\n\nimport { celEngine, firstUndeclaredReference } from './cel-engine';\nimport { templateEngine } from './template-engine';\n\nexport type FieldRole = 'predicate' | 'value' | 'template';\n\n/**\n * Loose input accepted by the validator: a bare string, or any object exposing\n * `dialect`/`source` (the Expression envelope, or a not-yet-narrowed value from\n * a `config.condition` / `edge.condition` field). Kept structural so call sites\n * need not pre-narrow to the strict {@link Expression} dialect union.\n */\nexport type ExprInput = string | { dialect?: string; source?: string } | null | undefined;\n\n/** Optional schema context for field-existence checks (Decision 1b, v1). */\nexport interface ExprSchemaHint {\n  /** Object the expression is authored against (for error text). */\n  objectName?: string;\n  /** Known top-level field names, so `record.<field>` can be checked. */\n  fields?: readonly string[];\n  /**\n   * Evaluation scope of the authoring site — determines whether a bare top-level\n   * identifier is legal (#1928):\n   *  - `'record'`    → the record is bound only as the `record` namespace, with\n   *                    no field flattening (`Field.formula`, object validation\n   *                    predicates). A bare `amount` resolves to nothing and the\n   *                    expression silently evaluates to `null` / never fires, so\n   *                    it MUST be written `record.amount`. We flag bare refs.\n   *  - `'flattened'` → the record's own fields are spread to top-level alongside\n   *                    flow variables (flow / automation conditions), so bare\n   *                    `status` is correct and is NOT an error. Flow variables\n   *                    are not schema-knowable, so a non-field bare identifier\n   *                    can't be soundly told apart from a typo — but when one is\n   *                    a near-miss of a known field we emit a non-blocking\n   *                    did-you-mean *warning*. (Default.)\n   */\n  scope?: 'record' | 'flattened';\n}\n\nexport interface ExprValidationError {\n  /** Self-correcting message: what is wrong + the correct form. */\n  message: string;\n  /** The offending source, echoed for location. */\n  source: string;\n}\n\nexport interface ExprValidationResult {\n  ok: boolean;\n  errors: ExprValidationError[];\n  /**\n   * Non-blocking advisories (#1928 tier 3): a likely-typo'd field reference in a\n   * flattened flow condition. Never affects `ok` — callers surface these without\n   * failing the build, since a bare identifier there may legitimately be a flow\n   * variable.\n   */\n  warnings: ExprValidationError[];\n}\n\n/** A bare `{x}` that is NOT part of a `{{x}}` mustache hole. */\nconst SINGLE_BRACE_RE = /(?:^|[^{])\\{\\s*([A-Za-z_$][\\w.$]*)\\s*\\}(?!\\})/;\n/** `record.<field>` / `previous.<field>` head references for field-existence. */\nconst RECORD_REF_RE = /\\b(?:record|previous)\\.([A-Za-z_$][\\w$]*)/g;\n\n/** The dialect a field role expects (Decision 2). */\nexport function expectedDialect(role: FieldRole): 'cel' | 'template' {\n  return role === 'template' ? 'template' : 'cel';\n}\n\nfunction toSource(input: ExprInput): { dialect?: string; source: string } {\n  if (input == null) return { source: '' };\n  if (typeof input === 'string') return { source: input };\n  return { dialect: input.dialect, source: input.source ?? '' };\n}\n\nfunction bracesHint(source: string): string | null {\n  const m = SINGLE_BRACE_RE.exec(source);\n  if (!m) return null;\n  const ref = m[1];\n  return (\n    `it looks like a \\`{${ref}}\\` template brace was used inside a CEL expression — ` +\n    `\\`{…}\\` parses as a CEL map literal and fails. Write the bare reference instead, e.g. \\`${ref}\\`.`\n  );\n}\n\nfunction checkFieldExistence(source: string, schema: ExprSchemaHint | undefined, errors: ExprValidationError[]): void {\n  if (!schema?.fields || schema.fields.length === 0) return;\n  const known = new Set(schema.fields);\n  const seen = new Set<string>();\n  let m: RegExpExecArray | null;\n  RECORD_REF_RE.lastIndex = 0;\n  while ((m = RECORD_REF_RE.exec(source)) !== null) {\n    const field = m[1];\n    if (seen.has(field) || known.has(field)) continue;\n    seen.add(field);\n    const suggestion = nearest(field, schema.fields);\n    errors.push({\n      source,\n      message:\n        `unknown field \\`${field}\\`${schema.objectName ? ` on \\`${schema.objectName}\\`` : ''}` +\n        (suggestion ? ` — did you mean \\`${suggestion}\\`?` : ''),\n    });\n  }\n}\n\n/** Cheap edit-distance suggestion for typo'd field names. */\nfunction nearest(name: string, candidates: readonly string[]): string | undefined {\n  let best: string | undefined;\n  let bestD = Infinity;\n  for (const c of candidates) {\n    const d = levenshtein(name, c);\n    if (d < bestD) { bestD = d; best = c; }\n  }\n  return bestD <= Math.max(2, Math.floor(name.length / 3)) ? best : undefined;\n}\n\nfunction levenshtein(a: string, b: string): number {\n  const m = a.length, n = b.length;\n  const dp = Array.from({ length: m + 1 }, (_, i) => i);\n  for (let j = 1; j <= n; j++) {\n    let prev = dp[0];\n    dp[0] = j;\n    for (let i = 1; i <= m; i++) {\n      const tmp = dp[i];\n      dp[i] = Math.min(dp[i] + 1, dp[i - 1] + 1, prev + (a[i - 1] === b[j - 1] ? 0 : 1));\n      prev = tmp;\n    }\n  }\n  return dp[m];\n}\n\n/**\n * Validate one expression for a given field role. Never throws — returns a\n * structured result. Call sites decide whether to throw (build/registration)\n * or report (agent tool).\n */\nexport function validateExpression(\n  role: FieldRole,\n  input: ExprInput,\n  schema?: ExprSchemaHint,\n): ExprValidationResult {\n  const { dialect, source } = toSource(input);\n  const errors: ExprValidationError[] = [];\n  const warnings: ExprValidationError[] = [];\n  if (!source.trim()) return { ok: true, errors, warnings };\n\n  if (role === 'template') {\n    // Templates must be the `template` dialect (or untyped string). Reject a\n    // CEL envelope mistakenly placed in a text field.\n    if (dialect && dialect !== 'template') {\n      errors.push({ source, message: `expected a text template but got a \\`${dialect}\\` expression.` });\n      return { ok: false, errors, warnings };\n    }\n    const compiled = templateEngine.compile(source);\n    if (!compiled.ok) {\n      errors.push({ source, message: `invalid template: ${compiled.error.message} (holes use \\`{{ path }}\\`).` });\n    }\n    // A single `{x}` in a template is the legacy/deprecated form (ADR-0032 §3).\n    const hint = SINGLE_BRACE_RE.test(source) ? bracesHintForTemplate(source) : null;\n    if (hint) errors.push({ source, message: hint });\n    return { ok: errors.length === 0, errors, warnings };\n  }\n\n  // predicate | value → CEL\n  if (dialect && dialect !== 'cel') {\n    errors.push({ source, message: `expected a CEL expression but got a \\`${dialect}\\` dialect.` });\n    return { ok: false, errors, warnings };\n  }\n  const compiled = celEngine.compile(source);\n  if (!compiled.ok) {\n    const hint = bracesHint(source);\n    errors.push({\n      source,\n      message:\n        `invalid CEL ${role}: ${compiled.error.message}` +\n        (hint ? ` — ${hint}` : ` — ${role}s are bare CEL (e.g. \\`record.rating >= 4\\`).`),\n    });\n  } else {\n    checkFieldExistence(source, schema, errors);\n    if (schema?.scope === 'record') {\n      // In a `record`-scoped site a bare top-level identifier is a silent bug —\n      // it must be `record.<field>` (#1928). Hard error.\n      const bare = firstUndeclaredReference(source);\n      if (bare) {\n        errors.push({\n          source,\n          message:\n            `bare reference \\`${bare}\\` — a formula/validation expression binds the record as the ` +\n            `\\`record\\` namespace, not at top level, so \\`${bare}\\` resolves to nothing and the ` +\n            `expression silently evaluates to null. Write \\`record.${bare}\\`.`,\n        });\n      }\n    } else if (schema?.fields && schema.fields.length > 0) {\n      // Flattened flow/automation condition: the record's fields ARE bound at\n      // top-level, so a bare ref is normally correct. But a *non-field* bare\n      // identifier is either a flow variable or a typo. When it is a near-miss\n      // of a known field, warn (did-you-mean) WITHOUT failing the build —\n      // a genuine flow variable won't be edit-distance-close to a field. (#1928)\n      const unknown = firstUndeclaredReference(source, schema.fields);\n      if (unknown) {\n        const suggestion = nearest(unknown, schema.fields);\n        if (suggestion) {\n          warnings.push({\n            source,\n            message:\n              `\\`${unknown}\\` is not a field of \\`${schema.objectName ?? 'the trigger object'}\\` — ` +\n              `did you mean \\`${suggestion}\\`? (flow conditions reference fields bare, e.g. \\`${suggestion} == …\\`). ` +\n              `If \\`${unknown}\\` is a flow variable this is safe to ignore.`,\n          });\n        }\n      }\n    }\n  }\n  return { ok: errors.length === 0, errors, warnings };\n}\n\nfunction bracesHintForTemplate(source: string): string {\n  const m = SINGLE_BRACE_RE.exec(source);\n  const ref = m?.[1] ?? 'field';\n  return `single-brace \\`{${ref}}\\` is not a valid template hole — use double braces: \\`{{ ${ref} }}\\`.`;\n}\n\n/**\n * Introspect what an author (esp. an agent) may use in a field (Decision 1e):\n * the expected dialect, the in-scope field references, and the callable\n * functions. Feeds the authoring context so the model does not guess.\n */\nexport function introspectScope(role: FieldRole, schema?: ExprSchemaHint): {\n  dialect: 'cel' | 'template';\n  fields: string[];\n  roots: string[];\n  functions: string[];\n} {\n  return {\n    dialect: expectedDialect(role),\n    fields: [...(schema?.fields ?? [])],\n    roots: ['record', 'previous', 'input', 'os', 'vars'],\n    functions: CEL_STDLIB_FUNCTIONS,\n  };\n}\n\n/** Public catalog of CEL stdlib functions available in expressions. */\nexport const CEL_STDLIB_FUNCTIONS: string[] = [\n  'now', 'today', 'daysFromNow', 'daysBetween', 'date', 'datetime', 'timestamp',\n  'isBlank', 'isEmpty', 'coalesce', 'len', 'size', 'int', 'float', 'string', 'bool',\n  'upper', 'lower', 'trim', 'contains', 'startsWith', 'endsWith', 'matches',\n  'has', 'min', 'max', 'abs', 'round',\n];\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACeA,oBAA4B;;;ACG5B,SAAS,cAAc,GAAe;AACpC,QAAM,MAAM,IAAI,KAAK,EAAE,QAAQ,CAAC;AAChC,MAAI,YAAY,GAAG,GAAG,GAAG,CAAC;AAC1B,SAAO;AACT;AAGA,SAAS,WAAW,GAAS,GAAiB;AAC5C,QAAM,MAAM,IAAI,KAAK,EAAE,QAAQ,CAAC;AAChC,MAAI,WAAW,IAAI,WAAW,IAAI,CAAC;AACnC,SAAO;AACT;AAUO,SAAS,eACd,KACA,KACa;AACb,SAAO,IACJ,iBAAiB,oCAAoC,MAAM,IAAI,CAAC,EAChE;AAAA,IACC;AAAA,IACA,MAAM,cAAc,IAAI,CAAC;AAAA,EAC3B,EACC;AAAA,IACC;AAAA,IACA,CAAC,MAAuB,WAAW,IAAI,GAAG,OAAO,CAAC,CAAC;AAAA,EACrD,EACC;AAAA,IACC;AAAA,IACA,CAAC,MAAuB,WAAW,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;AAAA,EACtD,EAGC;AAAA,IACC;AAAA,IACA,CAAC,UAAmB;AAClB,UAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,UAAI,OAAO,UAAU,SAAU,QAAO,MAAM,WAAW;AACvD,UAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,aAAO;AAAA,IACT;AAAA,EACF,EAIC;AAAA,IACC;AAAA,IACA,CAAC,OAAgB,aACd,UAAU,QAAQ,UAAU,SAAa,WAAW;AAAA,EACzD,EAGC;AAAA,IACC;AAAA,IACA,CAAC,UAAmB;AAClB,UAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,aAAO,OAAO,KAAK,EAAE,KAAK;AAAA,IAC5B;AAAA,EACF,EAMC;AAAA,IACC;AAAA,IACA,CAAC,MAAe,QAAiB;AAC/B,YAAM,MAAM,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC;AAC1C,YAAM,YAAY,OAAO,QAAQ,WAAW,MAAM;AAClD,YAAM,QAAkB,CAAC;AACzB,iBAAW,QAAQ,KAAK;AACtB,YAAI,SAAS,QAAQ,SAAS,OAAW;AACzC,cAAM,IAAI,OAAO,IAAI,EAAE,KAAK;AAC5B,YAAI,EAAE,SAAS,EAAG,OAAM,KAAK,CAAC;AAAA,MAChC;AACA,aAAO,MAAM,KAAK,SAAS;AAAA,IAC7B;AAAA,EACF;AACJ;AAkBO,SAAS,yBAAyB,KAA+B;AACtE,QAAM,MAAwD;AAAA,IAC5D,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,IACnB,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,IACnB,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,IACnB,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,IACnB,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,EACrB;AACA,aAAW,CAAC,IAAI,EAAE,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC1C,UAAM,OAAO,CAAC,GAAY,MAAe,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAChE,QAAI,iBAAiB,UAAU,EAAE,QAAQ,IAAI;AAC7C,QAAI,iBAAiB,OAAO,EAAE,WAAW,IAAI;AAAA,EAC/C;AACA,SAAO;AACT;AAMO,SAAS,WAAW,KAA2C;AACpE,QAAM,QAAiC,CAAC;AAExC,MAAI,IAAI,WAAW,OAAW,OAAM,SAAS,IAAI;AACjD,MAAI,IAAI,aAAa,OAAW,OAAM,WAAW,IAAI;AACrD,MAAI,IAAI,UAAU,OAAW,OAAM,QAAQ,IAAI;AAG/C,QAAM,KAA8B,CAAC;AACrC,MAAI,IAAI,SAAS,OAAW,IAAG,OAAO,IAAI;AAC1C,MAAI,IAAI,QAAQ,OAAW,IAAG,MAAM,IAAI;AACxC,MAAI,IAAI,QAAQ,OAAW,IAAG,MAAM,IAAI;AACxC,MAAI,OAAO,KAAK,EAAE,EAAE,SAAS,EAAG,OAAM,KAAK;AAE3C,MAAI,IAAI,UAAU,OAAW,QAAO,OAAO,OAAO,IAAI,KAAK;AAE3D,SAAO;AACT;;;ADrIO,IAAM,iBAAiB;AAAA,EAC5B,aAAa;AAAA,EACb,UAAU;AAAA,EACV,iBAAiB;AAAA,EACjB,eAAe;AAAA,EACf,kBAAkB;AACpB;AAEA,SAAS,SAAS,KAA8B;AAC9C,QAAM,MAAM,IAAI,0BAAY;AAAA,IAC1B,yBAAyB;AAAA,IACzB,qBAAqB;AAAA,IACrB,QAAQ;AAAA,EACV,CAAC;AACD,SAAO,yBAAyB,eAAe,KAAK,GAAG,CAAC;AAC1D;AAUA,IAAM,cAAc;AAAA,EAClB;AAAA,EAAU;AAAA,EAAY;AAAA,EAAS;AAAA,EAAU;AAAA,EAAM;AAAA,EAAQ;AAAA,EACvD;AAAA,EAAc;AAAA,EAAW;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAChE;AAAA,EAAW;AAAA,EAAS;AAAA,EAAW;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAU;AAC7D;AAOA,SAAS,eAAe,aAA6C;AACnE,QAAM,MAAM,IAAI,0BAAY;AAAA,IAC1B,yBAAyB;AAAA,IACzB,qBAAqB;AAAA,IACrB,QAAQ;AAAA,EACV,CAAC;AACD,iBAAe,KAAK,MAAM,oBAAI,KAAK,CAAC,CAAC;AACrC,aAAW,QAAQ,aAAa;AAC9B,QAAI;AAAE,UAAI,iBAAiB,MAAM,KAAK;AAAA,IAAG,QAAQ;AAAA,IAA2B;AAAA,EAC9E;AAMA,aAAW,SAAS,aAAa;AAC/B,QAAI;AAAE,UAAI,iBAAiB,OAAO,KAAK;AAAA,IAAG,QAAQ;AAAA,IAAsC;AAAA,EAC1F;AACA,SAAO;AACT;AAGA,IAAI;AAeG,SAAS,yBACd,QACA,cAAiC,CAAC,GACnB;AACf,MAAI,OAAO,WAAW,YAAY,CAAC,OAAO,KAAK,EAAG,QAAO;AACzD,MAAI;AACF,UAAM,MAAM,YAAY,WAAW,IAC9B,oCAAmB,eAAe,CAAC,CAAC,KACrC,eAAe,WAAW;AAC9B,UAAM,SAAS,IAAI,MAAM,MAAM,EAAE,QAAQ;AAGzC,QAAI,UAAU,OAAO,UAAU,OAAO;AACpC,YAAM,IAAI,yCAAyC,KAAK,OAAO,OAAO,WAAW,EAAE;AACnF,UAAI,EAAG,QAAO,EAAE,CAAC;AAAA,IACnB;AAAA,EACF,QAAQ;AAAA,EAGR;AACA,SAAO;AACT;AAQA,SAAS,OAAO,OAAyB;AACvC,MAAI,OAAO,UAAU,UAAU;AAE7B,QAAI,SAAS,OAAO,OAAO,gBAAgB,KAAK,SAAS,OAAO,OAAO,gBAAgB,GAAG;AACxF,aAAO,OAAO,KAAK;AAAA,IACrB;AACA,WAAO,MAAM,SAAS;AAAA,EACxB;AACA,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,MAAM;AACjD,MAAI,SAAS,OAAO,UAAU,YAAY,EAAE,iBAAiB,OAAO;AAClE,UAAM,MAA+B,CAAC;AACtC,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,EAAG,KAAI,CAAC,IAAI,OAAO,CAAC;AAC7D,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAYA,IAAM,oBAAoB;AAU1B,IAAM,yBACJ;AAUF,SAAS,uBAAuB,KAAuB;AACrD,QAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,SAAO,oBAAoB,KAAK,OAAO;AACzC;AAYA,SAAS,uBAAuB,OAAyB;AACvD,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,QAAQ,SAAS,GAAG;AACtB,UAAI,kBAAkB,KAAK,OAAO,GAAG;AACnC,cAAM,IAAI,OAAO,OAAO;AACxB,YAAI,OAAO,SAAS,CAAC,EAAG,QAAO;AAAA,MACjC,WAAW,uBAAuB,KAAK,OAAO,GAAG;AAC/C,cAAM,KAAK,KAAK,MAAM,OAAO;AAC7B,YAAI,CAAC,OAAO,MAAM,EAAE,EAAG,QAAO,IAAI,KAAK,EAAE;AAAA,MAC3C;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,sBAAsB;AACjE,MAAI,SAAS,OAAO,UAAU,YAAY,EAAE,iBAAiB,OAAO;AAClE,UAAM,MAA+B,CAAC;AACtC,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,EAAG,KAAI,CAAC,IAAI,uBAAuB,CAAC;AAC7E,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAiC;AACtD,QAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,MAAI,OAAgD;AACpD,MAAI,gBAAgB,KAAK,OAAO,EAAG,QAAO;AAAA,WACjC,2BAA2B,KAAK,OAAO,EAAG,QAAO;AAAA,WACjD,oCAAoC,KAAK,OAAO,EAAG,QAAO;AACnE,SAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,QAAQ,EAAE;AAC/C;AAEO,IAAM,YAA2B;AAAA,EACtC,SAAS;AAAA,EAET,QAAQ,QAAqC;AAC3C,QAAI;AAGF,YAAM,MAAM,SAAS,MAAM,oBAAI,KAAK,CAAC,CAAC;AACtC,YAAM,WAAW,IAAI,MAAM,MAAM;AASjC,YAAM,cAAc,SAAS,QAAQ;AACrC,UAAI,eAAe,YAAY,UAAU,OAAO;AAC9C,eAAO;AAAA,UACL,IAAI;AAAA,UACJ,OAAO,EAAE,MAAM,QAAQ,SAAS,YAAY,OAAO,WAAW,kCAAkC;AAAA,QAClG;AAAA,MACF;AACA,aAAO,EAAE,IAAI,MAAM,OAAO,SAAS,IAAI;AAAA,IACzC,SAAS,KAAK;AACZ,aAAO,cAAc,GAAG;AAAA,IAC1B;AAAA,EACF;AAAA,EAEA,SAAsB,MAAkB,KAAiC;AACvE,QAAI,KAAK,YAAY,OAAO;AAC1B,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,sCAAsC,KAAK,OAAO,IAAI;AAAA,MAC3F;AAAA,IACF;AACA,UAAM,SAAS,KAAK;AACpB,QAAI,OAAO,WAAW,YAAY,OAAO,WAAW,GAAG;AAKrD,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,SAAS,SAAS,0DAA0D;AAAA,MAC7F;AAAA,IACF;AAEA,UAAM,MAAM,MAAM,IAAI,OAAO,oBAAI,KAAK;AACtC,QAAI;AACF,YAAM,MAAM,SAAS,GAAG;AACxB,YAAM,QAAQ,WAAW,GAAG;AAC5B,UAAI;AACF,cAAM,MAAM,IAAI,SAAS,QAAQ,KAAK;AACtC,eAAO,EAAE,IAAI,MAAM,OAAO,OAAO,GAAG,EAAO;AAAA,MAC7C,SAAS,KAAK;AAWZ,YAAI,CAAC,uBAAuB,GAAG,EAAG,OAAM;AACxC,cAAM,WAAW,uBAAuB,KAAK;AAC7C,YAAI;AACF,gBAAM,MAAM,IAAI,SAAS,QAAQ,QAAQ;AACzC,iBAAO,EAAE,IAAI,MAAM,OAAO,OAAO,GAAG,EAAO;AAAA,QAC7C,QAAQ;AAGN,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,aAAO,cAAc,GAAG;AAAA,IAC1B;AAAA,EACF;AACF;;;AE/RA,IAAM,UAAU,oBAAI,IAAI;AAAA,EACtB;AAAA,EAAW;AAAA,EAAa;AAAA,EAAY;AAAA,EAAW;AAAA,EAAU;AAAA,EAAW;AACtE,CAAC;AAED,SAAS,SAAS,QAAoC;AACpD,QAAM,UAAU,OAAO,KAAK;AAC5B,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,SAAS,SAAS,uBAAuB,EAAE;AAAA,EAChF;AACA,MAAI,QAAQ,WAAW,GAAG,GAAG;AAC3B,QAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,SAAS,SAAS,uBAAuB,OAAO,IAAI;AAAA,MACrE;AAAA,IACF;AACA,WAAO,EAAE,IAAI,MAAM,OAAO,QAAQ;AAAA,EACpC;AACA,QAAM,SAAS,QAAQ,MAAM,KAAK;AAClC,MAAI,OAAO,WAAW,KAAK,OAAO,WAAW,GAAG;AAC9C,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,OAAO;AAAA,QACL,MAAM;AAAA,QACN,SAAS,oDAAoD,OAAO,MAAM;AAAA,MAC5E;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU;AAChB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,GAAG;AAC5B,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS,cAAc,IAAI,CAAC,kCAAkC,OAAO,CAAC,CAAC;AAAA,QACzE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,IAAI,MAAM,OAAO,QAAQ;AACpC;AAEO,IAAM,aAA4B;AAAA,EACvC,SAAS;AAAA,EAET,QAAQ,QAAqC;AAC3C,WAAO,SAAS,MAAM;AAAA,EACxB;AAAA,EAEA,SAAsB,MAAkB,MAAkC;AACxE,QAAI,KAAK,YAAY,QAAQ;AAC3B,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,uCAAuC,KAAK,OAAO,IAAI;AAAA,MAC5F;AAAA,IACF;AACA,QAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,SAAS,SAAS,kCAAkC,EAAE;AAAA,IAC3F;AACA,UAAM,SAAS,SAAS,KAAK,MAAM;AACnC,QAAI,CAAC,OAAO,GAAI,QAAO;AAGvB,WAAO,EAAE,IAAI,MAAM,OAAO,OAAO,MAAsB;AAAA,EACzD;AACF;;;ACvDA,IAAM,UAAU;AAMhB,SAAS,SAAS,GAAgC;AAChD,MAAI,OAAO,MAAM,SAAU,QAAO;AAClC,MAAI,OAAO,MAAM,SAAU,QAAO,OAAO,CAAC;AAC1C,MAAI,OAAO,MAAM,YAAY,EAAE,KAAK,MAAM,MAAM,CAAC,OAAO,MAAM,OAAO,CAAC,CAAC,EAAG,QAAO,OAAO,CAAC;AACzF,SAAO;AACT;AAEA,SAAS,OAAO,GAA8B;AAC5C,MAAI,aAAa,KAAM,QAAO;AAC9B,MAAI,OAAO,MAAM,SAAU,QAAO,IAAI,KAAK,CAAC;AAC5C,MAAI,OAAO,MAAM,UAAU;AACzB,UAAM,IAAI,IAAI,KAAK,CAAC;AACpB,QAAI,CAAC,OAAO,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,EACzC;AACA,SAAO;AACT;AAEA,IAAM,aAAwC;AAAA,EAC5C,OAAO,CAAC,MAAM,WAAW,CAAC,EAAE,YAAY;AAAA,EACxC,OAAO,CAAC,MAAM,WAAW,CAAC,EAAE,YAAY;AAAA,EACxC,MAAM,CAAC,MAAM,WAAW,CAAC,EAAE,KAAK;AAAA;AAAA,EAEhC,QAAQ,CAAC,GAAG,KAAK,WAAW;AAC1B,UAAM,IAAI,SAAS,CAAC;AACpB,QAAI,MAAM,OAAW,QAAO,WAAW,CAAC;AACxC,UAAM,SAAS,QAAQ,SAAY,OAAO,GAAG,IAAI;AACjD,WAAO,IAAI,KAAK,aAAa,QAAQ,WAAW,UAAa,CAAC,OAAO,MAAM,MAAM,IAC7E,EAAE,uBAAuB,QAAQ,uBAAuB,OAAO,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC;AAAA,EACrF;AAAA;AAAA,EAEA,UAAU,CAAC,GAAG,KAAK,WAAW;AAC5B,UAAM,IAAI,SAAS,CAAC;AACpB,QAAI,MAAM,OAAW,QAAO,WAAW,CAAC;AACxC,UAAM,OAAQ,OAAO,IAAI,KAAK,KAAM;AACpC,QAAI;AACF,aAAO,IAAI,KAAK,aAAa,QAAQ,EAAE,OAAO,YAAY,UAAU,KAAK,CAAC,EAAE,OAAO,CAAC;AAAA,IACtF,QAAQ;AACN,aAAO,IAAI,KAAK,aAAa,QAAQ,EAAE,OAAO,YAAY,UAAU,MAAM,CAAC,EAAE,OAAO,CAAC;AAAA,IACvF;AAAA,EACF;AAAA;AAAA,EAEA,SAAS,CAAC,GAAG,KAAK,WAAW;AAC3B,UAAM,IAAI,SAAS,CAAC;AACpB,QAAI,MAAM,OAAW,QAAO,WAAW,CAAC;AACxC,UAAM,SAAS,QAAQ,SAAY,OAAO,GAAG,IAAI;AACjD,WAAO,IAAI,KAAK,aAAa,QAAQ;AAAA,MACnC,OAAO;AAAA,MACP,uBAAuB,OAAO,MAAM,MAAM,IAAI,IAAI;AAAA,MAClD,uBAAuB,OAAO,MAAM,MAAM,IAAI,IAAI;AAAA,IACpD,CAAC,EAAE,OAAO,CAAC;AAAA,EACb;AAAA;AAAA,EAEA,MAAM,CAAC,GAAG,KAAK,WAAW;AACxB,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,CAAC,EAAG,QAAO,WAAW,CAAC;AAC3B,QAAI,QAAQ,MAAO,QAAO,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AACrD,UAAM,QAAQ,QAAQ,SAAS,SAAS,QAAQ,WAAW,WAAW;AACtE,WAAO,IAAI,KAAK,eAAe,QAAQ,EAAE,WAAW,MAAqC,CAAC,EAAE,OAAO,CAAC;AAAA,EACtG;AAAA;AAAA,EAEA,UAAU,CAAC,GAAG,KAAK,WAAW;AAC5B,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,CAAC,EAAG,QAAO,WAAW,CAAC;AAC3B,QAAI,QAAQ,MAAO,QAAO,EAAE,YAAY;AACxC,UAAM,QAAQ,QAAQ,SAAS,SAAS,QAAQ,WAAW,WAAW;AACtE,WAAO,IAAI,KAAK,eAAe,QAAQ;AAAA,MACrC,WAAW;AAAA,MACX,WAAW;AAAA,IACb,CAAC,EAAE,OAAO,CAAC;AAAA,EACb;AAAA;AAAA,EAEA,UAAU,CAAC,GAAG,QAAQ;AACpB,UAAM,IAAI,WAAW,CAAC;AACtB,UAAM,MAAM,QAAQ,SAAY,OAAO,GAAG,IAAI;AAC9C,QAAI,OAAO,MAAM,GAAG,KAAK,EAAE,UAAU,IAAK,QAAO;AACjD,WAAO,EAAE,MAAM,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI;AAAA,EAC5C;AAAA;AAAA,EAEA,SAAS,CAAC,GAAG,QAAQ;AACnB,UAAM,IAAI,WAAW,CAAC;AACtB,WAAO,MAAM,KAAM,OAAO,KAAM;AAAA,EAClC;AAAA,EACA,MAAM,CAAC,MAAM;AACX,QAAI;AAAE,aAAO,KAAK,UAAU,CAAC;AAAA,IAAG,QAAQ;AAAE,aAAO,OAAO,CAAC;AAAA,IAAG;AAAA,EAC9D;AACF;AAGO,IAAM,sBAAgC,OAAO,KAAK,UAAU;AAEnE,SAAS,WAAW,OAAwB;AAC1C,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,MAAI,iBAAiB,KAAM,QAAO,MAAM,YAAY;AACpD,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAW,QAAO,OAAO,KAAK;AAChF,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,SAAS;AACrD,MAAI;AACF,WAAO,KAAK,UAAU,KAAK;AAAA,EAC7B,QAAQ;AACN,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AAEA,SAAS,YAAY,OAAgC,MAAuB;AAC1E,QAAM,aAAa,KAAK,QAAQ,cAAc,KAAK;AACnD,QAAM,WAAW,WAAW,MAAM,GAAG,EAAE,OAAO,OAAO;AACrD,MAAI,SAAkB;AACtB,aAAW,OAAO,UAAU;AAC1B,QAAI,UAAU,QAAQ,OAAO,WAAW,SAAU,QAAO;AACzD,aAAU,OAAmC,GAAG;AAAA,EAClD;AACA,SAAO;AACT;AAOA,IAAM,eAAe;AAOrB,SAAS,UAAU,OAAkC;AACnD,QAAM,OAAO,MAAM,QAAQ,GAAG;AAC9B,MAAI,SAAS,IAAI;AACf,UAAMA,QAAO,MAAM,KAAK;AACxB,WAAO,aAAa,KAAKA,KAAI,IAAI,EAAE,MAAAA,MAAK,IAAI;AAAA,EAC9C;AACA,QAAM,OAAO,MAAM,MAAM,GAAG,IAAI,EAAE,KAAK;AACvC,MAAI,CAAC,aAAa,KAAK,IAAI,EAAG,QAAO;AACrC,QAAM,aAAa,MAAM,MAAM,OAAO,CAAC,EAAE,KAAK;AAE9C,QAAM,QAAQ,WAAW,QAAQ,GAAG;AACpC,MAAI,OAAO;AACX,MAAI;AACJ,MAAI,UAAU,IAAI;AAChB,WAAO,WAAW,MAAM,GAAG,KAAK,EAAE,KAAK;AACvC,UAAM,WAAW,MAAM,QAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,gBAAgB,EAAE;AAAA,EACrE;AACA,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAC9B,SAAO,EAAE,MAAM,QAAQ,EAAE,MAAM,IAAI,EAAE;AACvC;AAEA,SAAS,gBAAgB,QAA0C;AACjE,QAAM,QAAQ,OAAO,MAAM,OAAO,KAAK,CAAC,GAAG;AAC3C,QAAM,SAAS,OAAO,MAAM,OAAO,KAAK,CAAC,GAAG;AAC5C,MAAI,SAAS,OAAO;AAClB,WAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,SAAS,SAAS,2CAA2C,EAAE;AAAA,EACpG;AACA,QAAM,QAAsB,CAAC;AAC7B,MAAI;AACJ,UAAQ,YAAY;AACpB,UAAQ,IAAI,QAAQ,KAAK,MAAM,OAAO,MAAM;AAC1C,UAAM,SAAS,UAAU,EAAE,CAAC,CAAC;AAC7B,QAAI,CAAC,QAAQ;AACX,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SACE,8BAA8B,EAAE,CAAC,CAAC,4KAEgB,oBAAoB,KAAK,IAAI,CAAC;AAAA,QACpF;AAAA,MACF;AAAA,IACF;AACA,UAAM,KAAK,MAAM;AAAA,EACnB;AACA,SAAO,EAAE,IAAI,MAAM,OAAO,MAAM;AAClC;AAEO,IAAM,iBAAgC;AAAA,EAC3C,SAAS;AAAA,EAET,QAAQ,QAAqC;AAC3C,WAAO,gBAAgB,MAAM;AAAA,EAC/B;AAAA,EAEA,SAAsB,MAAkB,KAAiC;AACvE,QAAI,KAAK,YAAY,YAAY;AAC/B,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,2CAA2C,KAAK,OAAO,IAAI;AAAA,MAChG;AAAA,IACF;AACA,QAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,SAAS,SAAS,sCAAsC,EAAE;AAAA,IAC/F;AACA,UAAM,QAAQ,gBAAgB,KAAK,MAAM;AACzC,QAAI,CAAC,MAAM,GAAI,QAAO;AAEtB,UAAM,QAAQ,WAAW,GAAG;AAC5B,UAAM,SACH,IAAI,SAAS,OAAO,IAAI,MAAM,WAAW,YAAY,IAAI,MAAM,UAC/D,OAAQ,IAA4B,WAAW,YAAa,IAA4B,UACzF;AAEF,UAAM,MAAM,KAAK,OAAO,QAAQ,SAAS,CAAC,QAAQ,UAAU;AAC1D,YAAM,SAAS,UAAU,OAAO,KAAK,CAAC;AACtC,UAAI,CAAC,OAAQ,QAAO;AACpB,YAAM,QAAQ,YAAY,OAAO,OAAO,IAAI;AAC5C,UAAI,OAAO,QAAQ;AACjB,eAAO,WAAW,OAAO,OAAO,IAAI,EAAE,OAAO,OAAO,OAAO,KAAK,MAAgB;AAAA,MAClF;AACA,aAAO,WAAW,KAAK;AAAA,IACzB,CAAC;AACD,WAAO,EAAE,IAAI,MAAM,OAAO,IAAoB;AAAA,EAChD;AACF;;;ACrOA,IAAM,WAAW,oBAAI,IAA2B;AAGzC,SAAS,SAAS,QAA6B;AACpD,WAAS,IAAI,OAAO,SAAS,MAAM;AACrC;AAGO,SAAS,UAAU,SAA4C;AACpE,SAAO,SAAS,IAAI,OAAO;AAC7B;AAGO,SAAS,WAAW,SAA0B;AACnD,SAAO,SAAS,IAAI,OAAO,KAAK,CAAC,SAAS,IAAI,OAAO,EAAG,QAAQ,WAAW,OAAO;AACpF;AAEA,SAAS,SAAS,SAAiB,QAA+B;AAChE,SAAO;AAAA,IACL;AAAA,IACA,SAAS,OAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,WAAW,SAAS,OAAO,EAAE;AAAA,IACzE,UAAU,OAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,WAAW,SAAS,OAAO,EAAE;AAAA,EAC5E;AACF;AAGA,SAAS,SAAS;AAClB,SAAS,UAAU;AACnB,SAAS,cAAc;AAGvB,SAAS,SAAS,MAAM,gEAAgE,CAAC;AAMlF,IAAM,mBAAmB;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,MAAuC;AAC7C,UAAM,SAAS,SAAS,IAAI,KAAK,OAAO;AACxC,QAAI,CAAC,QAAQ;AACX,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,qCAAqC,KAAK,OAAO,IAAI;AAAA,MAC1F;AAAA,IACF;AACA,QAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,SAAS,SAAS,2CAA2C;AAAA,MAC9E;AAAA,IACF;AACA,WAAO,OAAO,QAAQ,KAAK,MAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAsB,MAAkB,KAAiC;AACvE,UAAM,SAAS,SAAS,IAAI,KAAK,OAAO;AACxC,QAAI,CAAC,QAAQ;AACX,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,qCAAqC,KAAK,OAAO,IAAI;AAAA,MAC1F;AAAA,IACF;AACA,WAAO,OAAO,SAAY,MAAM,GAAG;AAAA,EACrC;AACF;;;ACtFA,kBAAkD;AASlD,SAAS,iBAAiB,OAAqC;AAC7D,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO;AACxE,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,SAAU,QAAO;AAC1C,SAAO,6BAAiB,UAAU,CAAC,EAAE;AACvC;AASO,SAAS,YACd,OACA,KACqB;AACrB,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO,EAAE,IAAI,MAAM,MAAM;AAAA,EAC3B;AACA,QAAM,IAAI,OAAO;AACjB,MAAI,MAAM,YAAY,MAAM,YAAY,MAAM,WAAW;AACvD,WAAO,EAAE,IAAI,MAAM,MAAM;AAAA,EAC3B;AACA,MAAI,iBAAiB,MAAM;AACzB,WAAO,EAAE,IAAI,MAAM,MAAM;AAAA,EAC3B;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAMC,OAAiB,CAAC;AACxB,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,YAAY,MAAM,GAAG;AAC/B,UAAI,CAAC,EAAE,GAAI,QAAO;AAClB,MAAAA,KAAI,KAAK,EAAE,KAAK;AAAA,IAClB;AACA,WAAO,EAAE,IAAI,MAAM,OAAOA,KAAI;AAAA,EAChC;AACA,MAAI,iBAAiB,KAAK,GAAG;AAC3B,WAAO,iBAAiB,SAAS,OAAO,GAAG;AAAA,EAC7C;AAEA,QAAM,MAA+B,CAAC;AACtC,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAkC,GAAG;AACvE,UAAM,IAAI,YAAY,GAAG,GAAG;AAC5B,QAAI,CAAC,EAAE,GAAI,QAAO;AAClB,QAAI,CAAC,IAAI,EAAE;AAAA,EACb;AACA,SAAO,EAAE,IAAI,MAAM,OAAO,IAAI;AAChC;AAMO,SAAS,kBACd,QACA,KACqC;AACrC,QAAM,YAAyB,EAAE,GAAG,KAAK,KAAK,IAAI,OAAO,oBAAI,KAAK,EAAE;AACpE,QAAM,SAAS,YAAY,QAAQ,SAAS;AAC5C,SAAO;AACT;;;AClEA,IAAAC,eAKO;AAYA,SAAS,oBAAoB,OAAgD;AAClF,QAAM,SAAS,mCAAsB,UAAU,KAAK;AACpD,MAAI,CAAC,OAAO,SAAS;AACnB,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,OAAO,EAAE,MAAM,SAAS,SAAS,OAAO,MAAM,QAAQ;AAAA,IACxD;AAAA,EACF;AAEA,QAAM,OAAO,OAAO;AAGpB,MAAI,KAAK,QAAQ,UAAa,KAAK,WAAW,QAAW;AACvD,WAAO,EAAE,IAAI,MAAM,OAAO,KAAK;AAAA,EACjC;AAIA,QAAM,WAAW,iBAAiB,QAAQ,IAAI;AAC9C,MAAI,CAAC,SAAS,IAAI;AAChB,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,OAAO;AAAA,MACL,GAAG;AAAA,MACH,KAAK,SAAS;AAAA,IAChB;AAAA,EACF;AACF;AAQO,SAAS,wBACd,MACA,OAAiB,CAAC,GAC2C;AAC7D,MAAI,SAAS,QAAQ,OAAO,SAAS,SAAU,QAAO;AAEtD,MAAI,oBAAoB,IAAI,GAAG;AAC7B,UAAM,IAAI,oBAAoB,IAAuB;AACrD,QAAI,CAAC,EAAE,GAAI,QAAO,EAAE,MAAM,KAAK,KAAK,GAAG,GAAG,OAAO,EAAE,MAAM;AACzD,WAAO,OAAO,MAAiC,EAAE,KAAK;AACtD,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,IAAI,wBAAwB,KAAK,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC;AAC/D,UAAI,EAAG,QAAO;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAEA,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,IAA+B,GAAG;AACpE,UAAM,IAAI,wBAAwB,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;AACjD,QAAI,EAAG,QAAO;AAAA,EAChB;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAAyB;AACpD,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO;AACxE,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,SAAU,QAAO;AAC1C,SAAO,8BAAiB,UAAU,CAAC,EAAE;AACvC;;;ACzBA,IAAM,kBAAkB;AAExB,IAAM,gBAAgB;AAGf,SAAS,gBAAgB,MAAqC;AACnE,SAAO,SAAS,aAAa,aAAa;AAC5C;AAEA,SAAS,SAAS,OAAwD;AACxE,MAAI,SAAS,KAAM,QAAO,EAAE,QAAQ,GAAG;AACvC,MAAI,OAAO,UAAU,SAAU,QAAO,EAAE,QAAQ,MAAM;AACtD,SAAO,EAAE,SAAS,MAAM,SAAS,QAAQ,MAAM,UAAU,GAAG;AAC9D;AAEA,SAAS,WAAW,QAA+B;AACjD,QAAM,IAAI,gBAAgB,KAAK,MAAM;AACrC,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,MAAM,EAAE,CAAC;AACf,SACE,sBAAsB,GAAG,2JACkE,GAAG;AAElG;AAEA,SAAS,oBAAoB,QAAgB,QAAoC,QAAqC;AACpH,MAAI,CAAC,QAAQ,UAAU,OAAO,OAAO,WAAW,EAAG;AACnD,QAAM,QAAQ,IAAI,IAAI,OAAO,MAAM;AACnC,QAAM,OAAO,oBAAI,IAAY;AAC7B,MAAI;AACJ,gBAAc,YAAY;AAC1B,UAAQ,IAAI,cAAc,KAAK,MAAM,OAAO,MAAM;AAChD,UAAM,QAAQ,EAAE,CAAC;AACjB,QAAI,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,EAAG;AACzC,SAAK,IAAI,KAAK;AACd,UAAM,aAAa,QAAQ,OAAO,OAAO,MAAM;AAC/C,WAAO,KAAK;AAAA,MACV;AAAA,MACA,SACE,mBAAmB,KAAK,KAAK,OAAO,aAAa,SAAS,OAAO,UAAU,OAAO,EAAE,MACnF,aAAa,0BAAqB,UAAU,QAAQ;AAAA,IACzD,CAAC;AAAA,EACH;AACF;AAGA,SAAS,QAAQ,MAAc,YAAmD;AAChF,MAAI;AACJ,MAAI,QAAQ;AACZ,aAAW,KAAK,YAAY;AAC1B,UAAM,IAAI,YAAY,MAAM,CAAC;AAC7B,QAAI,IAAI,OAAO;AAAE,cAAQ;AAAG,aAAO;AAAA,IAAG;AAAA,EACxC;AACA,SAAO,SAAS,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,SAAS,CAAC,CAAC,IAAI,OAAO;AACpE;AAEA,SAAS,YAAY,GAAW,GAAmB;AACjD,QAAM,IAAI,EAAE,QAAQ,IAAI,EAAE;AAC1B,QAAM,KAAK,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;AACpD,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,QAAI,OAAO,GAAG,CAAC;AACf,OAAG,CAAC,IAAI;AACR,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAM,MAAM,GAAG,CAAC;AAChB,SAAG,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE;AACjF,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,GAAG,CAAC;AACb;AAOO,SAAS,mBACd,MACA,OACA,QACsB;AACtB,QAAM,EAAE,SAAS,OAAO,IAAI,SAAS,KAAK;AAC1C,QAAM,SAAgC,CAAC;AACvC,QAAM,WAAkC,CAAC;AACzC,MAAI,CAAC,OAAO,KAAK,EAAG,QAAO,EAAE,IAAI,MAAM,QAAQ,SAAS;AAExD,MAAI,SAAS,YAAY;AAGvB,QAAI,WAAW,YAAY,YAAY;AACrC,aAAO,KAAK,EAAE,QAAQ,SAAS,wCAAwC,OAAO,iBAAiB,CAAC;AAChG,aAAO,EAAE,IAAI,OAAO,QAAQ,SAAS;AAAA,IACvC;AACA,UAAMC,YAAW,eAAe,QAAQ,MAAM;AAC9C,QAAI,CAACA,UAAS,IAAI;AAChB,aAAO,KAAK,EAAE,QAAQ,SAAS,qBAAqBA,UAAS,MAAM,OAAO,+BAA+B,CAAC;AAAA,IAC5G;AAEA,UAAM,OAAO,gBAAgB,KAAK,MAAM,IAAI,sBAAsB,MAAM,IAAI;AAC5E,QAAI,KAAM,QAAO,KAAK,EAAE,QAAQ,SAAS,KAAK,CAAC;AAC/C,WAAO,EAAE,IAAI,OAAO,WAAW,GAAG,QAAQ,SAAS;AAAA,EACrD;AAGA,MAAI,WAAW,YAAY,OAAO;AAChC,WAAO,KAAK,EAAE,QAAQ,SAAS,yCAAyC,OAAO,cAAc,CAAC;AAC9F,WAAO,EAAE,IAAI,OAAO,QAAQ,SAAS;AAAA,EACvC;AACA,QAAM,WAAW,UAAU,QAAQ,MAAM;AACzC,MAAI,CAAC,SAAS,IAAI;AAChB,UAAM,OAAO,WAAW,MAAM;AAC9B,WAAO,KAAK;AAAA,MACV;AAAA,MACA,SACE,eAAe,IAAI,KAAK,SAAS,MAAM,OAAO,MAC7C,OAAO,WAAM,IAAI,KAAK,WAAM,IAAI;AAAA,IACrC,CAAC;AAAA,EACH,OAAO;AACL,wBAAoB,QAAQ,QAAQ,MAAM;AAC1C,QAAI,QAAQ,UAAU,UAAU;AAG9B,YAAM,OAAO,yBAAyB,MAAM;AAC5C,UAAI,MAAM;AACR,eAAO,KAAK;AAAA,UACV;AAAA,UACA,SACE,oBAAoB,IAAI,kHACwB,IAAI,wFACK,IAAI;AAAA,QACjE,CAAC;AAAA,MACH;AAAA,IACF,WAAW,QAAQ,UAAU,OAAO,OAAO,SAAS,GAAG;AAMrD,YAAM,UAAU,yBAAyB,QAAQ,OAAO,MAAM;AAC9D,UAAI,SAAS;AACX,cAAM,aAAa,QAAQ,SAAS,OAAO,MAAM;AACjD,YAAI,YAAY;AACd,mBAAS,KAAK;AAAA,YACZ;AAAA,YACA,SACE,KAAK,OAAO,0BAA0B,OAAO,cAAc,oBAAoB,4BAC7D,UAAU,sDAAsD,UAAU,uBACpF,OAAO;AAAA,UACnB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,IAAI,OAAO,WAAW,GAAG,QAAQ,SAAS;AACrD;AAEA,SAAS,sBAAsB,QAAwB;AACrD,QAAM,IAAI,gBAAgB,KAAK,MAAM;AACrC,QAAM,MAAM,IAAI,CAAC,KAAK;AACtB,SAAO,mBAAmB,GAAG,mEAA8D,GAAG;AAChG;AAOO,SAAS,gBAAgB,MAAiB,QAK/C;AACA,SAAO;AAAA,IACL,SAAS,gBAAgB,IAAI;AAAA,IAC7B,QAAQ,CAAC,GAAI,QAAQ,UAAU,CAAC,CAAE;AAAA,IAClC,OAAO,CAAC,UAAU,YAAY,SAAS,MAAM,MAAM;AAAA,IACnD,WAAW;AAAA,EACb;AACF;AAGO,IAAM,uBAAiC;AAAA,EAC5C;AAAA,EAAO;AAAA,EAAS;AAAA,EAAe;AAAA,EAAe;AAAA,EAAQ;AAAA,EAAY;AAAA,EAClE;AAAA,EAAW;AAAA,EAAW;AAAA,EAAY;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAS;AAAA,EAAU;AAAA,EAC3E;AAAA,EAAS;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAY;AAAA,EAAc;AAAA,EAAY;AAAA,EAChE;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAC9B;","names":["path","out","import_spec","compiled"]}
+{"version":3,"sources":["../src/index.ts","../src/cel-engine.ts","../src/stdlib.ts","../src/cron-engine.ts","../src/template-engine.ts","../src/registry.ts","../src/seed-eval.ts","../src/normalize.ts","../src/validate.ts"],"sourcesContent":["/**\n * @objectstack/formula\n *\n * Canonical expression engine for ObjectStack. CEL (Common Expression\n * Language) is the default dialect; `js` and `cron` are dispatched to\n * dedicated plugin engines.\n *\n * @see content/docs/concepts/north-star.mdx §8 \"No private expression DSL\"\n * @see ROADMAP.md M9 \"Expression Unification\"\n */\n\nexport { ExpressionEngine, getEngine, hasDialect, register } from './registry';\nexport { celEngine, DEFAULT_LIMITS } from './cel-engine';\nexport { cronEngine } from './cron-engine';\nexport { templateEngine, TEMPLATE_FORMATTERS } from './template-engine';\nexport { registerStdLib, buildScope } from './stdlib';\nexport { resolveSeed, resolveSeedRecord } from './seed-eval';\nexport { normalizeExpression, normalizeExpressionTree } from './normalize';\n// ADR-0032 — shared validator + introspection (one validator for build,\n// registration, and the agent-callable validate_expression tool).\nexport { validateExpression, introspectScope, expectedDialect, CEL_STDLIB_FUNCTIONS } from './validate';\nexport type { FieldRole, ExprSchemaHint, ExprValidationError, ExprValidationResult } from './validate';\nexport type { SeedValue, SeedPrimitive } from './seed-eval';\nexport type { DialectEngine, EvalContext, EvalResult, EvalError } from './types';\n","/**\n * CEL dialect engine — wraps `@marcbachmann/cel-js` with the ObjectStack\n * stdlib, bounded execution limits, and result coercion.\n *\n * Why a thin wrapper:\n *\n *  - cel-js returns `BigInt` for ints. The kernel and CRM expect plain\n *    numbers, so we coerce at the boundary.\n *  - cel-js parses dotted names as receiver-typed methods; we register\n *    `now()`, `today()`, `daysFromNow()` as bare functions and let `os.*`\n *    refer to context data only (see {@link buildScope}).\n *  - Bounds (`maxAstNodes`, `maxDepth`, …) are enforced spec-wide so\n *    third-party plugins can't ship runaway predicates.\n */\n\nimport { Environment } from '@marcbachmann/cel-js';\nimport type { Expression } from '@objectstack/spec';\n\nimport { buildScope, registerNumericCoercions, registerStdLib } from './stdlib';\nimport type { DialectEngine, EvalContext, EvalResult } from './types';\n\n/**\n * Default execution bounds. Picked conservatively — every metadata-authored\n * expression we've seen is well under these. If you hit them, the expression\n * is too complex for ObjectStack and should be moved to a hook (`dialect: js`).\n */\nexport const DEFAULT_LIMITS = {\n  maxAstNodes: 256,\n  maxDepth: 32,\n  maxListElements: 64,\n  maxMapEntries: 64,\n  maxCallArguments: 16,\n} as const;\n\nfunction buildEnv(now: () => Date): Environment {\n  const env = new Environment({\n    unlistedVariablesAreDyn: true,\n    enableOptionalTypes: true,\n    limits: DEFAULT_LIMITS,\n  });\n  return registerNumericCoercions(registerStdLib(env, now));\n}\n\n/**\n * Namespace roots that a `record`-scoped CEL site may legitimately reference.\n * Declared as `map` (dyn values) so member access (`record.foo`) and any\n * arithmetic/comparison on it defers to runtime — the strict env faults ONLY on\n * an *undeclared* top-level identifier, i.e. a bare field reference. Generous on\n * purpose: an unknown root is a missed catch, a missing root is a false positive\n * that would break the build, so we err toward declaring more.\n */\nconst SCOPE_ROOTS = [\n  'record', 'previous', 'input', 'output', 'os', 'vars', 'variables',\n  'automation', 'context', 'args', 'item', 'env', 'user', 'step', 'result',\n  'trigger', 'event', 'payload', 'data', 'params', 'config', 'settings',\n] as const;\n\n/**\n * A `record`-scoped environment (`unlistedVariablesAreDyn: false`) for detecting\n * bare field references. It reuses the real stdlib so function calls don't fault;\n * only undeclared *variables* do. Built once — `parse`/`check` do not mutate it.\n */\nfunction buildScopedEnv(knownFields: readonly string[]): Environment {\n  const env = new Environment({\n    unlistedVariablesAreDyn: false,\n    enableOptionalTypes: true,\n    limits: DEFAULT_LIMITS,\n  });\n  registerStdLib(env, () => new Date(0));\n  for (const root of SCOPE_ROOTS) {\n    try { env.registerVariable(root, 'map'); } catch { /* duplicate — ignore */ }\n  }\n  // `knownFields` are declared as `dyn` so they (and member/arith/compare on\n  // them) never fault — only a genuinely-undeclared top-level identifier does.\n  // Empty for a record-scope site (any bare field is a bug); the trigger\n  // object's fields for a flattened flow condition (only a NON-field bare ref —\n  // a typo or flow variable — is then interesting).\n  for (const field of knownFields) {\n    try { env.registerVariable(field, 'dyn'); } catch { /* duplicate / reserved — ignore */ }\n  }\n  return env;\n}\n\n// Roots-only env reused for the common record-scope check (no per-call rebuild).\nlet recordScopeEnv: Environment | undefined;\n\n/**\n * In a `record`-scoped CEL site — a `Field.formula` or an object validation\n * predicate — the evaluation scope binds only the `record`/`previous`/… *namespaces*\n * (no field flattening). A bare top-level identifier like `amount` or `status`\n * therefore resolves to nothing and the expression silently evaluates to `null`\n * / never fires (#1928, the class behind #1927's broken formulas). Returns the\n * first such bare reference, or `null`.\n *\n * Acts ONLY on cel-js's `Unknown variable: X` fault, so it cannot false-positive\n * on arithmetic/comparison overloads — and it must NOT be applied to flow /\n * automation conditions, where the record's fields ARE flattened to top-level\n * and bare references are correct.\n */\nexport function firstUndeclaredReference(\n  source: string,\n  knownFields: readonly string[] = [],\n): string | null {\n  if (typeof source !== 'string' || !source.trim()) return null;\n  try {\n    const env = knownFields.length === 0\n      ? (recordScopeEnv ??= buildScopedEnv([]))\n      : buildScopedEnv(knownFields);\n    const result = env.parse(source).check?.() as\n      | { valid: boolean; error?: { message?: string } }\n      | undefined;\n    if (result && result.valid === false) {\n      const m = /Unknown variable:\\s*([A-Za-z_$][\\w$]*)/.exec(result.error?.message ?? '');\n      if (m) return m[1];\n    }\n  } catch {\n    // Parse/other faults are the syntax checker's job (celEngine.compile); this\n    // helper only reports the undeclared-variable case.\n  }\n  return null;\n}\n\n/** @deprecated use {@link firstUndeclaredReference} with no fields. */\nexport function detectBareReference(source: string): string | null {\n  return firstUndeclaredReference(source);\n}\n\n/** Coerce cel-js's BigInt-flavored return into spec-friendly JS values. */\nfunction coerce(value: unknown): unknown {\n  if (typeof value === 'bigint') {\n    // BigInt → number when safe, else string to avoid silent truncation.\n    if (value >= BigInt(Number.MIN_SAFE_INTEGER) && value <= BigInt(Number.MAX_SAFE_INTEGER)) {\n      return Number(value);\n    }\n    return value.toString();\n  }\n  if (Array.isArray(value)) return value.map(coerce);\n  if (value && typeof value === 'object' && !(value instanceof Date)) {\n    const out: Record<string, unknown> = {};\n    for (const [k, v] of Object.entries(value)) out[k] = coerce(v);\n    return out;\n  }\n  return value;\n}\n\n/**\n * A string that is *entirely* a JS number literal: optional sign, integer\n * and/or fractional part, optional exponent. Deliberately strict — `\"5.0\"`,\n * `\"250000.00\"`, `\"-3\"`, `\"1e3\"` match; `\"5px\"`, `\"0x10\"`, `\" \"`, `\"\"`,\n * `\"1,000\"`, `\"v2\"` do not.\n */\n// The fractional part is a single optional `(?:\\.\\d*)?` group anchored by the\n// literal `.` — never the ambiguous `\\d+\\.?\\d*`, whose adjacent unbounded\n// quantifiers (`\\d+\\d*` when the dot is absent) backtrack polynomially on long\n// digit runs (CodeQL ReDoS). This matches the same strings without the hazard.\nconst NUMERIC_STRING_RE = /^[+-]?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:[eE][+-]?\\d+)?$/;\n\n/**\n * A string that is an ISO-8601 date (`\"2026-06-20\"`) or date-time\n * (`\"2026-06-20T08:15:35.244Z\"`, `\"2026-06-20 08:15\"`, `\"...+02:00\"`). Strict\n * and anchored — no nested unbounded quantifiers, so no ReDoS hazard (every\n * sub-group is bounded or a single `\\.\\d+`). `Field.date` / `Field.datetime`\n * serialize to these; cel-js compares them as `string` and faults against the\n * `google.protobuf.Timestamp` returned by `today()` / `now()` / `daysFromNow()`.\n */\nconst ISO_TEMPORAL_STRING_RE =\n  /^\\d{4}-\\d{2}-\\d{2}(?:[T ]\\d{2}:\\d{2}(?::\\d{2})?(?:\\.\\d+)?(?:Z|[+-]\\d{2}:?\\d{2})?)?$/;\n\n/**\n * cel-js raises `no such overload: dyn <op> int` (and kin) when a comparison\n * or arithmetic operator sees a `string` on one side and a number on the\n * other. ADR-0032 §1c — numeric fields that serialize as strings (`Field.rating`\n * → `\"5.0\"`, `Field.currency` → `\"250000.00\"`, `Field.percent`) trip this in\n * flow conditions / formulas (#1530, #1534) even though the schema and the\n * build-time validator treat them as numeric.\n */\nfunction isNumericOverloadError(err: unknown): boolean {\n  const message = err instanceof Error ? err.message : String(err);\n  return /no such overload/i.test(message);\n}\n\n/**\n * Recursively coerce string values that faulted a CEL overload into their\n * intended primitive: entirely-numeric literals → `number` (#1534), and\n * ISO-8601 date / date-time strings → `Date` (cel-js `google.protobuf.Timestamp`)\n * (#1530). Used only on the {@link isNumericOverloadError} retry path, so it can\n * never change a comparison that already evaluated cleanly — it only rescues one\n * that already faulted. Strings that are neither (a zip like `\"02134\"`, free\n * text) pass through untouched; if the retry still cannot type-check, the\n * original loud error is preserved.\n */\nfunction hydrateOverloadStrings(value: unknown): unknown {\n  if (typeof value === 'string') {\n    const trimmed = value.trim();\n    if (trimmed.length > 0) {\n      if (NUMERIC_STRING_RE.test(trimmed)) {\n        const n = Number(trimmed);\n        if (Number.isFinite(n)) return n;\n      } else if (ISO_TEMPORAL_STRING_RE.test(trimmed)) {\n        const ms = Date.parse(trimmed);\n        if (!Number.isNaN(ms)) return new Date(ms);\n      }\n    }\n    return value;\n  }\n  if (Array.isArray(value)) return value.map(hydrateOverloadStrings);\n  if (value && typeof value === 'object' && !(value instanceof Date)) {\n    const out: Record<string, unknown> = {};\n    for (const [k, v] of Object.entries(value)) out[k] = hydrateOverloadStrings(v);\n    return out;\n  }\n  return value;\n}\n\nfunction classifyError(err: unknown): EvalResult<never> {\n  const message = err instanceof Error ? err.message : String(err);\n  let kind: 'parse' | 'type' | 'runtime' | 'bounds' = 'runtime';\n  if (/Exceeded max/i.test(message)) kind = 'bounds';\n  else if (/parse|unexpected|syntax/i.test(message)) kind = 'parse';\n  else if (/type|unknown variable|undeclared/i.test(message)) kind = 'type';\n  return { ok: false, error: { kind, message } };\n}\n\nexport const celEngine: DialectEngine = {\n  dialect: 'cel',\n\n  compile(source: string): EvalResult<unknown> {\n    try {\n      // We use a wall-clock now() here purely for parse-time stdlib\n      // type-checking; the function is never actually called.\n      const env = buildEnv(() => new Date(0));\n      const compiled = env.parse(source);\n      // Surface check errors eagerly. cel-js's `check()` returns a\n      // `TypeCheckResult` object (`{ valid, type?, error? }`) — NOT an array —\n      // so the type fault (including `found no matching overload for 'PRIOR(dyn)'`\n      // when a condition calls an UNKNOWN function) only surfaces when we read\n      // `valid === false`. The previous `Array.isArray(...)` guard never matched\n      // an object, so unknown-function predicates type-checked clean and were\n      // silently accepted by `objectstack build` / `registerFlow`, then no-op'd\n      // the flow at runtime (#1877). Reading the documented shape closes that.\n      const checkResult = compiled.check?.();\n      if (checkResult && checkResult.valid === false) {\n        return {\n          ok: false,\n          error: { kind: 'type', message: checkResult.error?.message ?? 'expression failed type checking' },\n        };\n      }\n      return { ok: true, value: compiled.ast };\n    } catch (err) {\n      return classifyError(err);\n    }\n  },\n\n  evaluate<T = unknown>(expr: Expression, ctx: EvalContext): EvalResult<T> {\n    if (expr.dialect !== 'cel') {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `celEngine cannot evaluate dialect '${expr.dialect}'` },\n      };\n    }\n    const source = expr.source;\n    if (typeof source !== 'string' || source.length === 0) {\n      // AST-only inputs: cel-js does not currently expose a public API to\n      // re-execute a parsed AST without re-serializing. We persist `source`\n      // as the canonical form during M9.1 and revisit AST-only execution in\n      // M9.7 when we cut the spec persistence over.\n      return {\n        ok: false,\n        error: { kind: 'parse', message: 'AST-only evaluation not yet supported; persist `source`' },\n      };\n    }\n\n    const now = () => ctx.now ?? new Date();\n    try {\n      const env = buildEnv(now);\n      const scope = buildScope(ctx);\n      try {\n        const raw = env.evaluate(source, scope);\n        return { ok: true, value: coerce(raw) as T };\n      } catch (err) {\n        // ADR-0032 §1c — string-serialized fields make CEL raise\n        // `no such overload`: numeric fields (`rating` → `\"5.0\"`,\n        // `amount` → `\"250000.00\"`) on `record.rating >= 4` (#1534), and\n        // date/datetime fields (`end_date` → `\"2026-06-20\"`) on\n        // `record.end_date <= daysFromNow(60)` (#1530), since cel-js compares the\n        // raw string against the `google.protobuf.Timestamp` from `today()` etc.\n        // Hydrate those strings to number / Date and retry ONCE. This only runs\n        // after a fault, so a comparison that already evaluated cleanly is never\n        // re-interpreted; if the retry still cannot type-check, the original loud\n        // error is reported.\n        if (!isNumericOverloadError(err)) throw err;\n        const hydrated = hydrateOverloadStrings(scope) as Record<string, unknown>;\n        try {\n          const raw = env.evaluate(source, hydrated);\n          return { ok: true, value: coerce(raw) as T };\n        } catch {\n          // Hydration did not resolve it — surface the original fault, not the\n          // retry's, so the message reflects what the author actually wrote.\n          throw err;\n        }\n      }\n    } catch (err) {\n      return classifyError(err);\n    }\n  },\n};\n","/**\n * ObjectStack standard CEL function library.\n *\n * Registered into the per-evaluation `Environment` by the CEL engine. All\n * functions are pure given a pinned `now` — that determinism is what makes\n * `objectstack build` artifacts byte-stable across runs.\n *\n * Function naming intentionally avoids the `os.` prefix because cel-js binds\n * dotted names to receiver types. Instead, the `os` namespace in CEL holds\n * *data* (`os.user`, `os.org`, `os.env`) supplied by the caller's\n * {@link EvalContext}.\n */\n\nimport type { Environment } from '@marcbachmann/cel-js';\n\nimport type { EvalContext } from './types';\n\n/** Truncate a Date to start-of-day in UTC. */\nfunction startOfDayUtc(d: Date): Date {\n  const out = new Date(d.getTime());\n  out.setUTCHours(0, 0, 0, 0);\n  return out;\n}\n\n/** Coerce a CEL value (Date | ISO string | epoch number) to a Date. */\nfunction toDate(v: unknown): Date {\n  if (v instanceof Date) return v;\n  if (typeof v === 'number' || typeof v === 'bigint') return new Date(Number(v));\n  return new Date(String(v));\n}\n\n/** One UTC day in milliseconds. */\nconst MS_PER_DAY = 86_400_000;\n\n/** Add `n` days to a Date in UTC; returns a new Date. */\nfunction addDaysUtc(d: Date, n: number): Date {\n  const out = new Date(d.getTime());\n  out.setUTCDate(out.getUTCDate() + n);\n  return out;\n}\n\n/**\n * Register the ObjectStack standard library into a CEL environment.\n *\n * The `now` resolver is closed over so each call uses the pinned\n * `EvalContext.now` (or wall-clock fallback). Implementations are kept tiny\n * and dependency-free — they're the contract surface for AI authors and must\n * stay legible.\n */\nexport function registerStdLib(\n  env: Environment,\n  now: () => Date,\n): Environment {\n  return env\n    .registerFunction('now(): google.protobuf.Timestamp', () => now())\n    .registerFunction(\n      'today(): google.protobuf.Timestamp',\n      () => startOfDayUtc(now()),\n    )\n    .registerFunction(\n      'daysFromNow(int): google.protobuf.Timestamp',\n      (n: bigint | number) => addDaysUtc(now(), Number(n)),\n    )\n    .registerFunction(\n      'daysAgo(int): google.protobuf.Timestamp',\n      (n: bigint | number) => addDaysUtc(now(), -Number(n)),\n    )\n    // Returns true when `value` is null, undefined, empty string, or empty list.\n    // Matches the intent of legacy `ISBLANK()` while staying CEL-idiomatic.\n    .registerFunction(\n      'isBlank(dyn): bool',\n      (value: unknown) => {\n        if (value === null || value === undefined) return true;\n        if (typeof value === 'string') return value.length === 0;\n        if (Array.isArray(value)) return value.length === 0;\n        return false;\n      },\n    )\n    // Returns `value` when not null/undefined, otherwise the `fallback`.\n    // Use this to safely concatenate optional string fields:\n    //   coalesce(record.salutation, '') + ' ' + coalesce(record.first_name, '')\n    .registerFunction(\n      'coalesce(dyn, dyn): dyn',\n      (value: unknown, fallback: unknown) =>\n        (value === null || value === undefined) ? fallback : value,\n    )\n    // Trim leading/trailing ASCII whitespace from a string. Returns '' for\n    // null/undefined so it composes cleanly with `coalesce`.\n    .registerFunction(\n      'trim(dyn): string',\n      (value: unknown) => {\n        if (value === null || value === undefined) return '';\n        return String(value).trim();\n      },\n    )\n    // Join a list of values with `sep`, dropping null/undefined/empty entries\n    // first. Designed for display-name formulas like:\n    //   joinNonEmpty([record.salutation, record.first_name, record.last_name], ' ')\n    // which produces 'Alice Martinez' (no leading/trailing/internal extra\n    // spaces) when `salutation` is null.\n    .registerFunction(\n      'joinNonEmpty(list, string): string',\n      (list: unknown, sep: unknown) => {\n        const arr = Array.isArray(list) ? list : [];\n        const separator = typeof sep === 'string' ? sep : ' ';\n        const parts: string[] = [];\n        for (const item of arr) {\n          if (item === null || item === undefined) continue;\n          const s = String(item).trim();\n          if (s.length > 0) parts.push(s);\n        }\n        return parts.join(separator);\n      },\n    )\n    // ── Dates ────────────────────────────────────────────────────────────\n    // Whole days from `a` to `b` (negative if `b` is before `a`). The common\n    // shape is `daysBetween(today(), record.due)` for \"days remaining\". Args are\n    // coerced (Date | ISO string | epoch) so a `Field.date` that arrives as a\n    // string still works without the caller hydrating it.\n    .registerFunction(\n      'daysBetween(dyn, dyn): int',\n      (a: unknown, b: unknown) =>\n        BigInt(Math.round((toDate(b).getTime() - toDate(a).getTime()) / MS_PER_DAY)),\n    )\n    // Parse an ISO date / date-time string to a Timestamp. `date` and `datetime`\n    // are aliases — both accept either form (the field's own type decides the\n    // intent); kept distinct because authors reach for whichever reads clearer.\n    .registerFunction('date(dyn): google.protobuf.Timestamp', (s: unknown) => toDate(s))\n    .registerFunction('datetime(dyn): google.protobuf.Timestamp', (s: unknown) => toDate(s))\n    // ── Numbers ──────────────────────────────────────────────────────────\n    .registerFunction('abs(dyn): double', (x: unknown) => Math.abs(Number(x)))\n    .registerFunction('round(dyn): int', (x: unknown) => BigInt(Math.round(Number(x))))\n    // min/max return the smaller/larger operand verbatim (type preserved) rather\n    // than a coerced copy, so `min(record.a, record.b)` keeps int-ness when both\n    // are ints. Comparison is numeric.\n    .registerFunction('min(dyn, dyn): dyn', (a: unknown, b: unknown) => (Number(a) <= Number(b) ? a : b))\n    .registerFunction('max(dyn, dyn): dyn', (a: unknown, b: unknown) => (Number(a) >= Number(b) ? a : b))\n    // ── Strings ──────────────────────────────────────────────────────────\n    // Free-function forms of the common string ops. CEL also exposes some as\n    // receiver methods (`s.contains(x)`), but the authoring catalog advertises\n    // the bare-call form, so register it to match what authors are told to use.\n    .registerFunction('upper(dyn): string', (s: unknown) => String(s ?? '').toUpperCase())\n    .registerFunction('lower(dyn): string', (s: unknown) => String(s ?? '').toLowerCase())\n    .registerFunction('contains(dyn, dyn): bool', (s: unknown, sub: unknown) => String(s ?? '').includes(String(sub ?? '')))\n    .registerFunction('startsWith(dyn, dyn): bool', (s: unknown, p: unknown) => String(s ?? '').startsWith(String(p ?? '')))\n    .registerFunction('endsWith(dyn, dyn): bool', (s: unknown, p: unknown) => String(s ?? '').endsWith(String(p ?? '')))\n    .registerFunction('matches(dyn, dyn): bool', (s: unknown, re: unknown) => new RegExp(String(re ?? '')).test(String(s ?? '')))\n    // ── Collections ──────────────────────────────────────────────────────\n    // `len` mirrors CEL's built-in `size()` for strings/lists/maps; `isEmpty` is\n    // the inverse-of-non-empty companion to `isBlank` (true for null, '', []).\n    .registerFunction('len(dyn): int', (v: unknown) => BigInt(lengthOf(v)))\n    .registerFunction(\n      'isEmpty(dyn): bool',\n      (v: unknown) => v === null || v === undefined || lengthOf(v) === 0,\n    );\n}\n\n/** Length of a string / list / map (0 for scalars and null). */\nfunction lengthOf(v: unknown): number {\n  if (v === null || v === undefined) return 0;\n  if (typeof v === 'string' || Array.isArray(v)) return v.length;\n  if (typeof v === 'object') return Object.keys(v as Record<string, unknown>).length;\n  return 0;\n}\n\n/**\n * Register mixed `double <op> int` / `int <op> double` arithmetic overloads.\n *\n * cel-js types a record field number as `double` and a bare integer literal as\n * `int`, and ships overloads only for matching pairs (`double op double`,\n * `int op int`). So a formula as ordinary as `record.amount / 100` or\n * `record.price * 2` faults at runtime (`no such overload: dyn<double> / int`);\n * the engine catches the fault and the formula silently evaluates to `null`\n * (#1928). Authors then have to know the cel-js quirk and write `/ 100.0`.\n *\n * We close the gap by registering the missing mixed overloads. The result is\n * always computed as a JS `double`, matching CEL's promotion rule for mixed\n * numeric arithmetic. Pure `int op int` is untouched, so integer division\n * (`7 / 2 == 3`) keeps its semantics — these overloads only fire when the two\n * operands are genuinely a `double` and an `int`.\n */\nexport function registerNumericCoercions(env: Environment): Environment {\n  const ops: Record<string, (a: number, b: number) => number> = {\n    '+': (a, b) => a + b,\n    '-': (a, b) => a - b,\n    '*': (a, b) => a * b,\n    '/': (a, b) => a / b,\n    '%': (a, b) => a % b,\n  };\n  for (const [op, fn] of Object.entries(ops)) {\n    const impl = (a: unknown, b: unknown) => fn(Number(a), Number(b));\n    env.registerOperator(`double ${op} int`, impl);\n    env.registerOperator(`int ${op} double`, impl);\n  }\n  return env;\n}\n\n/**\n * Build the variable scope for a single evaluation. Absent fields are simply\n * not bound — CEL macros (`has(record.foo)`) handle missing-key safely.\n */\nexport function buildScope(ctx: EvalContext): Record<string, unknown> {\n  const scope: Record<string, unknown> = {};\n\n  if (ctx.record !== undefined) scope.record = ctx.record;\n  if (ctx.previous !== undefined) scope.previous = ctx.previous;\n  if (ctx.input !== undefined) scope.input = ctx.input;\n\n  // Namespaced data — written as `os.user.id`, `os.env`, etc. in CEL.\n  const os: Record<string, unknown> = {};\n  if (ctx.user !== undefined) os.user = ctx.user;\n  if (ctx.org !== undefined) os.org = ctx.org;\n  if (ctx.env !== undefined) os.env = ctx.env;\n  if (Object.keys(os).length > 0) scope.os = os;\n\n  if (ctx.extra !== undefined) Object.assign(scope, ctx.extra);\n\n  return scope;\n}\n","/**\n * Cron dialect engine.\n *\n * Validates cron expressions at compile time without depending on a parser.\n * Actual schedule firing lives in the scheduler service — this engine just\n * round-trips the expression through `Expression.evaluate`, returning the\n * source so callers can hand it to a scheduler library.\n *\n * Accepted forms:\n *   - 5-field standard cron:  `m h dom mon dow`\n *   - 6-field extended cron:  `s m h dom mon dow`\n *   - Aliases: @yearly, @annually, @monthly, @weekly, @daily, @hourly, @reboot\n */\n\nimport type { Expression } from '@objectstack/spec';\n\nimport type { DialectEngine, EvalContext, EvalResult } from './types';\n\nconst ALIASES = new Set([\n  '@yearly', '@annually', '@monthly', '@weekly', '@daily', '@hourly', '@reboot',\n]);\n\nfunction validate(source: string): EvalResult<string> {\n  const trimmed = source.trim();\n  if (trimmed.length === 0) {\n    return { ok: false, error: { kind: 'parse', message: 'cron source is empty' } };\n  }\n  if (trimmed.startsWith('@')) {\n    if (!ALIASES.has(trimmed)) {\n      return {\n        ok: false,\n        error: { kind: 'parse', message: `unknown cron alias '${trimmed}'` },\n      };\n    }\n    return { ok: true, value: trimmed };\n  }\n  const fields = trimmed.split(/\\s+/);\n  if (fields.length !== 5 && fields.length !== 6) {\n    return {\n      ok: false,\n      error: {\n        kind: 'parse',\n        message: `cron requires 5 or 6 space-separated fields, got ${fields.length}`,\n      },\n    };\n  }\n  // Each field must use only allowed cron characters.\n  const allowed = /^[\\d*/,\\-?LWA-Z#]+$/i;\n  for (let i = 0; i < fields.length; i++) {\n    if (!allowed.test(fields[i])) {\n      return {\n        ok: false,\n        error: {\n          kind: 'parse',\n          message: `cron field ${i + 1} contains invalid characters: '${fields[i]}'`,\n        },\n      };\n    }\n  }\n  return { ok: true, value: trimmed };\n}\n\nexport const cronEngine: DialectEngine = {\n  dialect: 'cron',\n\n  compile(source: string): EvalResult<unknown> {\n    return validate(source);\n  },\n\n  evaluate<T = unknown>(expr: Expression, _ctx: EvalContext): EvalResult<T> {\n    if (expr.dialect !== 'cron') {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `cronEngine cannot evaluate dialect '${expr.dialect}'` },\n      };\n    }\n    if (typeof expr.source !== 'string') {\n      return { ok: false, error: { kind: 'parse', message: 'cron Expression.source required' } };\n    }\n    const result = validate(expr.source);\n    if (!result.ok) return result as EvalResult<T>;\n    // Cron expressions don't \"evaluate\" to a value at predicate time — they\n    // describe a schedule. Returning the source lets schedulers consume it.\n    return { ok: true, value: result.value as unknown as T };\n  },\n};\n","/**\n * Template dialect engine — strict Mustache subset with a formatter whitelist.\n *\n * Holes are `{{ path }}` or `{{ path | formatter[:'arg'] }}` (ADR-0032 §3).\n * Holes are restricted to a **field/variable path** plus a **whitelisted\n * formatter** — never arbitrary CEL logic — so the grammar stays small (low\n * author/agent error surface), GUI-pickable (path + formatter dropdown), and\n * display strings stay declarative. Real logic belongs in `Predicate`/`Expr`\n * (CEL) fields, where it is validated and visible.\n *\n * The variable scope is the same as CEL (`record`, `previous`, `input`,\n * `os.user/org/env`, plus `extra`), so authors move fluidly between a CEL\n * formula and a template body without re-learning a namespace.\n *\n * Value→string semantics are explicit and defined per formatter (numbers,\n * dates, money, percent, null), instead of implicit coercion.\n */\n\nimport type { Expression } from '@objectstack/spec';\n\nimport { buildScope } from './stdlib';\nimport type { DialectEngine, EvalContext, EvalResult } from './types';\n\n/**\n * A hole: capture the full inner content (no `}` allowed inside). Uses a single\n * greedy `[^}]*` (not `\\s*…\\s*` around a lazy group) so the pattern is linear —\n * `\\s` is a subset of `[^}]`, and wrapping a lazy group in `\\s*` creates an\n * ambiguous (polynomial-ReDoS) matcher. Surrounding whitespace is stripped in\n * `parseHole` instead.\n */\nconst HOLE_RE = /\\{\\{([^}]*)\\}\\}/g;\n\n// ───────────────────────── formatter whitelist (ADR-0032 §3) ──────────────\n\ntype Formatter = (value: unknown, arg: string | undefined, locale: string) => string;\n\nfunction asNumber(v: unknown): number | undefined {\n  if (typeof v === 'number') return v;\n  if (typeof v === 'bigint') return Number(v);\n  if (typeof v === 'string' && v.trim() !== '' && !Number.isNaN(Number(v))) return Number(v);\n  return undefined;\n}\n\nfunction asDate(v: unknown): Date | undefined {\n  if (v instanceof Date) return v;\n  if (typeof v === 'number') return new Date(v);\n  if (typeof v === 'string') {\n    const d = new Date(v);\n    if (!Number.isNaN(d.getTime())) return d;\n  }\n  return undefined;\n}\n\nconst FORMATTERS: Record<string, Formatter> = {\n  upper: (v) => baseString(v).toUpperCase(),\n  lower: (v) => baseString(v).toLowerCase(),\n  trim: (v) => baseString(v).trim(),\n  // number | number:2  → grouped, optional fixed decimals\n  number: (v, arg, locale) => {\n    const n = asNumber(v);\n    if (n === undefined) return baseString(v);\n    const digits = arg !== undefined ? Number(arg) : undefined;\n    return new Intl.NumberFormat(locale, digits !== undefined && !Number.isNaN(digits)\n      ? { minimumFractionDigits: digits, maximumFractionDigits: digits } : {}).format(n);\n  },\n  // currency | currency:EUR  → defaults to USD\n  currency: (v, arg, locale) => {\n    const n = asNumber(v);\n    if (n === undefined) return baseString(v);\n    const code = (arg && arg.trim()) || 'USD';\n    try {\n      return new Intl.NumberFormat(locale, { style: 'currency', currency: code }).format(n);\n    } catch {\n      return new Intl.NumberFormat(locale, { style: 'currency', currency: 'USD' }).format(n);\n    }\n  },\n  // percent | percent:1  → 0.42 → \"42%\" (value is a 0..1 ratio)\n  percent: (v, arg, locale) => {\n    const n = asNumber(v);\n    if (n === undefined) return baseString(v);\n    const digits = arg !== undefined ? Number(arg) : 0;\n    return new Intl.NumberFormat(locale, {\n      style: 'percent',\n      minimumFractionDigits: Number.isNaN(digits) ? 0 : digits,\n      maximumFractionDigits: Number.isNaN(digits) ? 0 : digits,\n    }).format(n);\n  },\n  // date | date:long | date:iso  → date-only\n  date: (v, arg, locale) => {\n    const d = asDate(v);\n    if (!d) return baseString(v);\n    if (arg === 'iso') return d.toISOString().slice(0, 10);\n    const style = arg === 'long' ? 'long' : arg === 'medium' ? 'medium' : 'short';\n    return new Intl.DateTimeFormat(locale, { dateStyle: style as 'short' | 'medium' | 'long' }).format(d);\n  },\n  // datetime | datetime:long | datetime:iso\n  datetime: (v, arg, locale) => {\n    const d = asDate(v);\n    if (!d) return baseString(v);\n    if (arg === 'iso') return d.toISOString();\n    const style = arg === 'long' ? 'long' : arg === 'medium' ? 'medium' : 'short';\n    return new Intl.DateTimeFormat(locale, {\n      dateStyle: style as 'short' | 'medium' | 'long',\n      timeStyle: style as 'short' | 'medium' | 'long',\n    }).format(d);\n  },\n  // truncate:80  → cut with an ellipsis\n  truncate: (v, arg) => {\n    const s = baseString(v);\n    const len = arg !== undefined ? Number(arg) : 80;\n    if (Number.isNaN(len) || s.length <= len) return s;\n    return s.slice(0, Math.max(0, len - 1)) + '…';\n  },\n  // default:'N/A'  → fallback when the value is null/undefined/empty\n  default: (v, arg) => {\n    const s = baseString(v);\n    return s === '' ? (arg ?? '') : s;\n  },\n  json: (v) => {\n    try { return JSON.stringify(v); } catch { return String(v); }\n  },\n};\n\n/** Public list of whitelisted template formatters (for introspection/docs). */\nexport const TEMPLATE_FORMATTERS: string[] = Object.keys(FORMATTERS);\n\nfunction baseString(value: unknown): string {\n  if (value === null || value === undefined) return '';\n  if (value instanceof Date) return value.toISOString();\n  if (typeof value === 'string') return value;\n  if (typeof value === 'number' || typeof value === 'boolean') return String(value);\n  if (typeof value === 'bigint') return value.toString();\n  try {\n    return JSON.stringify(value);\n  } catch {\n    return String(value);\n  }\n}\n\nfunction resolvePath(scope: Record<string, unknown>, path: string): unknown {\n  const normalized = path.replace(/\\[(\\w+)\\]/g, '.$1');\n  const segments = normalized.split('.').filter(Boolean);\n  let cursor: unknown = scope;\n  for (const seg of segments) {\n    if (cursor == null || typeof cursor !== 'object') return undefined;\n    cursor = (cursor as Record<string, unknown>)[seg];\n  }\n  return cursor;\n}\n\ninterface ParsedHole {\n  path: string;\n  filter?: { name: string; arg?: string };\n}\n\nconst PATH_ONLY_RE = /^[\\w.[\\]]+$/;\n\n/**\n * Parse a hole's inner content into a path + optional single formatter.\n * Returns null when the inner content is not a valid path[+formatter] form\n * (e.g. arbitrary CEL was written into a hole — rejected, ADR-0032 §3).\n */\nfunction parseHole(inner: string): ParsedHole | null {\n  const pipe = inner.indexOf('|');\n  if (pipe === -1) {\n    const path = inner.trim();\n    return PATH_ONLY_RE.test(path) ? { path } : null;\n  }\n  const path = inner.slice(0, pipe).trim();\n  if (!PATH_ONLY_RE.test(path)) return null;\n  const filterPart = inner.slice(pipe + 1).trim();\n  // `name` or `name:arg` or `name:'arg'`\n  const colon = filterPart.indexOf(':');\n  let name = filterPart;\n  let arg: string | undefined;\n  if (colon !== -1) {\n    name = filterPart.slice(0, colon).trim();\n    arg = filterPart.slice(colon + 1).trim().replace(/^['\"]|['\"]$/g, '');\n  }\n  if (!FORMATTERS[name]) return null;\n  return { path, filter: { name, arg } };\n}\n\nfunction compileTemplate(source: string): EvalResult<ParsedHole[]> {\n  const open = (source.match(/\\{\\{/g) ?? []).length;\n  const close = (source.match(/\\}\\}/g) ?? []).length;\n  if (open !== close) {\n    return { ok: false, error: { kind: 'parse', message: 'template has unbalanced {{ }} delimiters' } };\n  }\n  const holes: ParsedHole[] = [];\n  let m: RegExpExecArray | null;\n  HOLE_RE.lastIndex = 0;\n  while ((m = HOLE_RE.exec(source)) !== null) {\n    const parsed = parseHole(m[1]);\n    if (!parsed) {\n      return {\n        ok: false,\n        error: {\n          kind: 'parse',\n          message:\n            `invalid template hole \\`{{ ${m[1]} }}\\` — holes are a field path with an optional ` +\n            `formatter (\\`{{ record.amount | currency }}\\`), not arbitrary logic. ` +\n            `Move logic into a CEL field. Known formatters: ${TEMPLATE_FORMATTERS.join(', ')}.`,\n        },\n      };\n    }\n    holes.push(parsed);\n  }\n  return { ok: true, value: holes };\n}\n\nexport const templateEngine: DialectEngine = {\n  dialect: 'template',\n\n  compile(source: string): EvalResult<unknown> {\n    return compileTemplate(source);\n  },\n\n  evaluate<T = unknown>(expr: Expression, ctx: EvalContext): EvalResult<T> {\n    if (expr.dialect !== 'template') {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `templateEngine cannot evaluate dialect '${expr.dialect}'` },\n      };\n    }\n    if (typeof expr.source !== 'string') {\n      return { ok: false, error: { kind: 'parse', message: 'template Expression.source required' } };\n    }\n    const check = compileTemplate(expr.source);\n    if (!check.ok) return check as EvalResult<T>;\n\n    const scope = buildScope(ctx);\n    const locale =\n      (ctx.extra && typeof ctx.extra.locale === 'string' && ctx.extra.locale) ||\n      (typeof (ctx as { locale?: string }).locale === 'string' && (ctx as { locale?: string }).locale) ||\n      'en-US';\n\n    const out = expr.source.replace(HOLE_RE, (_match, inner) => {\n      const parsed = parseHole(String(inner));\n      if (!parsed) return _match; // compile already validated; defensive\n      const value = resolvePath(scope, parsed.path);\n      if (parsed.filter) {\n        return FORMATTERS[parsed.filter.name](value, parsed.filter.arg, locale as string);\n      }\n      return baseString(value);\n    });\n    return { ok: true, value: out as unknown as T };\n  },\n};\n","/**\n * Dialect-pluggable Expression engine registry.\n *\n * Replaces the per-call-site `compileFormula` / `evaluateFormula` direct\n * imports of the deleted custom engine. Call sites now ask the registry to\n * dispatch by `expression.dialect`.\n *\n * Stub dialects (`js`, `cron`) are registered at module load with explicit\n * `dialect`-error responses so call sites get a clear message instead of\n * silent `undefined` (the old engine's anti-pattern).\n */\n\nimport type { Expression } from '@objectstack/spec';\n\nimport { celEngine } from './cel-engine';\nimport { cronEngine } from './cron-engine';\nimport { templateEngine } from './template-engine';\nimport type { DialectEngine, EvalContext, EvalResult } from './types';\n\nconst registry = new Map<string, DialectEngine>();\n\n/** Register or replace a dialect engine. */\nexport function register(engine: DialectEngine): void {\n  registry.set(engine.dialect, engine);\n}\n\n/** Look up a dialect engine without dispatching. */\nexport function getEngine(dialect: string): DialectEngine | undefined {\n  return registry.get(dialect);\n}\n\n/** Whether a dialect has a real (non-stub) implementation registered. */\nexport function hasDialect(dialect: string): boolean {\n  return registry.has(dialect) && !registry.get(dialect)!.dialect.startsWith('stub:');\n}\n\nfunction makeStub(dialect: string, reason: string): DialectEngine {\n  return {\n    dialect,\n    compile: () => ({ ok: false, error: { kind: 'dialect', message: reason } }),\n    evaluate: () => ({ ok: false, error: { kind: 'dialect', message: reason } }),\n  };\n}\n\n// Real engines.\nregister(celEngine);\nregister(cronEngine);\nregister(templateEngine);\n\n// Stubs — `js` lives in @objectstack/plugin-js-vm (not yet shipped).\nregister(makeStub('js', \"dialect 'js' not registered. Install @objectstack/plugin-js-vm\"));\n\n/**\n * The unified evaluation entry point. Replaces the old direct calls to\n * `evaluateFormula` from the deleted custom engine.\n */\nexport const ExpressionEngine = {\n  register,\n  getEngine,\n  hasDialect,\n\n  /**\n   * Compile-only — parse + type-check, returning the engine-native AST. Used\n   * by `objectstack compile` to normalize source into AST in artifacts.\n   */\n  compile(expr: Expression): EvalResult<unknown> {\n    const engine = registry.get(expr.dialect);\n    if (!engine) {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `No engine registered for dialect '${expr.dialect}'` },\n      };\n    }\n    if (typeof expr.source !== 'string') {\n      return {\n        ok: false,\n        error: { kind: 'parse', message: 'Expression.source required for compile()' },\n      };\n    }\n    return engine.compile(expr.source);\n  },\n\n  /**\n   * Evaluate an expression in the given context. Never throws — branch on\n   * `result.ok`. Errors carry a `kind` for caller-side classification.\n   */\n  evaluate<T = unknown>(expr: Expression, ctx: EvalContext): EvalResult<T> {\n    const engine = registry.get(expr.dialect);\n    if (!engine) {\n      return {\n        ok: false,\n        error: { kind: 'dialect', message: `No engine registered for dialect '${expr.dialect}'` },\n      };\n    }\n    return engine.evaluate<T>(expr, ctx);\n  },\n};\n","/**\n * Seed-value resolver.\n *\n * `Seed.records` accepts {@link SeedValue} = primitive | Expression | array\n * | object — install-time resolution walks the tree and replaces any\n * Expression node with its evaluated result. This is what makes\n * `close_date: cel\\`now() + duration(\"P30D\")\\`` resolve to *the customer's*\n * \"today + 30 days\" instead of the developer's compile-time clock.\n */\n\nimport { ExpressionSchema, type Expression } from '@objectstack/spec';\n\nimport type { EvalContext, EvalResult } from './types';\nimport { ExpressionEngine } from './registry';\n\nexport type SeedPrimitive = string | number | boolean | null | Date;\nexport type SeedValue = SeedPrimitive | Expression | SeedValue[] | { [key: string]: SeedValue };\n\n/** Detect an Expression-shaped object without throwing on unrelated shapes. */\nfunction isExpressionLike(value: unknown): value is Expression {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) return false;\n  const v = value as Record<string, unknown>;\n  if (typeof v.dialect !== 'string') return false;\n  return ExpressionSchema.safeParse(v).success;\n}\n\n/**\n * Recursively resolve a SeedValue. Records that contain Expression leaves are\n * evaluated with `ctx`; other values are passed through unchanged.\n *\n * Returns the first failure encountered. Callers (seed loader) typically\n * abort the whole record on failure rather than silently writing partial data.\n */\nexport function resolveSeed(\n  value: SeedValue,\n  ctx: EvalContext,\n): EvalResult<unknown> {\n  if (value === null || value === undefined) {\n    return { ok: true, value };\n  }\n  const t = typeof value;\n  if (t === 'string' || t === 'number' || t === 'boolean') {\n    return { ok: true, value };\n  }\n  if (value instanceof Date) {\n    return { ok: true, value };\n  }\n  if (Array.isArray(value)) {\n    const out: unknown[] = [];\n    for (const item of value) {\n      const r = resolveSeed(item, ctx);\n      if (!r.ok) return r;\n      out.push(r.value);\n    }\n    return { ok: true, value: out };\n  }\n  if (isExpressionLike(value)) {\n    return ExpressionEngine.evaluate(value, ctx);\n  }\n  // Plain object — recurse field-by-field.\n  const out: Record<string, unknown> = {};\n  for (const [k, v] of Object.entries(value as Record<string, SeedValue>)) {\n    const r = resolveSeed(v, ctx);\n    if (!r.ok) return r;\n    out[k] = r.value;\n  }\n  return { ok: true, value: out };\n}\n\n/**\n * Resolve a single record (object of fields), pinning `ctx.now` so all\n * expressions within see one logical clock.\n */\nexport function resolveSeedRecord(\n  record: Record<string, SeedValue>,\n  ctx: EvalContext,\n): EvalResult<Record<string, unknown>> {\n  const pinnedCtx: EvalContext = { ...ctx, now: ctx.now ?? new Date() };\n  const result = resolveSeed(record, pinnedCtx) as EvalResult<Record<string, unknown>>;\n  return result;\n}\n","/**\n * Build-time normalization helpers.\n *\n * The CLI `objectstack compile` step walks the assembled `objectstack.json`\n * artifact and rewrites every Expression so that:\n *\n *  1. String shorthand input is replaced by `{ dialect: 'cel', source }`.\n *  2. The persisted envelope carries an `ast` field produced by the dialect\n *     engine (M9.2 deliverable). Source is retained for round-trip / debug.\n *\n * Spec layer cannot do step 2 because it must remain dependency-free; this\n * package owns the engine import and therefore the AST step.\n */\n\nimport {\n  ExpressionInputSchema,\n  ExpressionSchema,\n  type Expression,\n  type ExpressionInput,\n} from '@objectstack/spec';\n\nimport { ExpressionEngine } from './registry';\nimport type { EvalResult } from './types';\n\n/**\n * Normalize an {@link ExpressionInput} (string shorthand OR full envelope) into\n * a fully-resolved {@link Expression} carrying both `source` and `ast`.\n *\n * Returns an EvalResult so the caller can render a structured compile error\n * pointing at the offending metadata path.\n */\nexport function normalizeExpression(input: ExpressionInput): EvalResult<Expression> {\n  const parsed = ExpressionInputSchema.safeParse(input);\n  if (!parsed.success) {\n    return {\n      ok: false,\n      error: { kind: 'parse', message: parsed.error.message },\n    };\n  }\n\n  const expr = parsed.data as Expression;\n\n  // Already AST-only — accept as-is.\n  if (expr.ast !== undefined && expr.source === undefined) {\n    return { ok: true, value: expr };\n  }\n\n  // Source-bearing: ask the dialect engine to compile. Failures surface here\n  // as part of the build (no silent skip).\n  const compiled = ExpressionEngine.compile(expr);\n  if (!compiled.ok) {\n    return compiled;\n  }\n\n  return {\n    ok: true,\n    value: {\n      ...expr,\n      ast: compiled.value,\n    },\n  };\n}\n\n/**\n * Walk an arbitrary JSON tree and normalize every embedded Expression in\n * place. Used by the build pipeline to traverse the assembled metadata\n * artifact. Returns the first error encountered (paired with the dotted path\n * for diagnostics) or `null` when fully clean.\n */\nexport function normalizeExpressionTree(\n  root: unknown,\n  path: string[] = [],\n): { path: string; error: import('./types').EvalError } | null {\n  if (root === null || typeof root !== 'object') return null;\n\n  if (looksLikeExpression(root)) {\n    const r = normalizeExpression(root as ExpressionInput);\n    if (!r.ok) return { path: path.join('.'), error: r.error };\n    Object.assign(root as Record<string, unknown>, r.value);\n    return null;\n  }\n\n  if (Array.isArray(root)) {\n    for (let i = 0; i < root.length; i++) {\n      const r = normalizeExpressionTree(root[i], [...path, String(i)]);\n      if (r) return r;\n    }\n    return null;\n  }\n\n  for (const [k, v] of Object.entries(root as Record<string, unknown>)) {\n    const r = normalizeExpressionTree(v, [...path, k]);\n    if (r) return r;\n  }\n  return null;\n}\n\nfunction looksLikeExpression(value: unknown): boolean {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) return false;\n  const v = value as Record<string, unknown>;\n  if (typeof v.dialect !== 'string') return false;\n  return ExpressionSchema.safeParse(v).success;\n}\n","/**\n * Shared expression validator (ADR-0032 §Decision 1/5).\n *\n * One validator, used by every author surface — `objectstack build`,\n * `registerFlow`/metadata registration, and the agent-callable\n * `validate_expression` tool — so a malformed expression is caught the same\n * way everywhere, with a message written for **self-correction** (Decision 1d):\n * it states what is wrong AND the correct form.\n *\n * Field roles map to dialects (Decision 2):\n *   - `predicate`  → bare CEL returning bool (`record.rating >= 4`)\n *   - `value`      → bare CEL of any type   (`daysFromNow(3)`)\n *   - `template`   → text with `{{ path }}` holes (`Hot lead: {{ record.name }}`)\n *\n * The #1 author error (human or LLM) is wrapping a field reference in single\n * `{…}` braces inside a CEL field — `{x}` parses as a CEL map literal and fails.\n * This validator detects that specific mistake and returns the exact fix.\n */\n\nimport { celEngine, firstUndeclaredReference } from './cel-engine';\nimport { templateEngine } from './template-engine';\n\nexport type FieldRole = 'predicate' | 'value' | 'template';\n\n/**\n * Loose input accepted by the validator: a bare string, or any object exposing\n * `dialect`/`source` (the Expression envelope, or a not-yet-narrowed value from\n * a `config.condition` / `edge.condition` field). Kept structural so call sites\n * need not pre-narrow to the strict {@link Expression} dialect union.\n */\nexport type ExprInput = string | { dialect?: string; source?: string } | null | undefined;\n\n/** Optional schema context for field-existence checks (Decision 1b, v1). */\nexport interface ExprSchemaHint {\n  /** Object the expression is authored against (for error text). */\n  objectName?: string;\n  /** Known top-level field names, so `record.<field>` can be checked. */\n  fields?: readonly string[];\n  /**\n   * Evaluation scope of the authoring site — determines whether a bare top-level\n   * identifier is legal (#1928):\n   *  - `'record'`    → the record is bound only as the `record` namespace, with\n   *                    no field flattening (`Field.formula`, object validation\n   *                    predicates). A bare `amount` resolves to nothing and the\n   *                    expression silently evaluates to `null` / never fires, so\n   *                    it MUST be written `record.amount`. We flag bare refs.\n   *  - `'flattened'` → the record's own fields are spread to top-level alongside\n   *                    flow variables (flow / automation conditions), so bare\n   *                    `status` is correct and is NOT an error. Flow variables\n   *                    are not schema-knowable, so a non-field bare identifier\n   *                    can't be soundly told apart from a typo — but when one is\n   *                    a near-miss of a known field we emit a non-blocking\n   *                    did-you-mean *warning*. (Default.)\n   */\n  scope?: 'record' | 'flattened';\n}\n\nexport interface ExprValidationError {\n  /** Self-correcting message: what is wrong + the correct form. */\n  message: string;\n  /** The offending source, echoed for location. */\n  source: string;\n}\n\nexport interface ExprValidationResult {\n  ok: boolean;\n  errors: ExprValidationError[];\n  /**\n   * Non-blocking advisories (#1928 tier 3): a likely-typo'd field reference in a\n   * flattened flow condition. Never affects `ok` — callers surface these without\n   * failing the build, since a bare identifier there may legitimately be a flow\n   * variable.\n   */\n  warnings: ExprValidationError[];\n}\n\n/** A bare `{x}` that is NOT part of a `{{x}}` mustache hole. */\nconst SINGLE_BRACE_RE = /(?:^|[^{])\\{\\s*([A-Za-z_$][\\w.$]*)\\s*\\}(?!\\})/;\n/** `record.<field>` / `previous.<field>` head references for field-existence. */\nconst RECORD_REF_RE = /\\b(?:record|previous)\\.([A-Za-z_$][\\w$]*)/g;\n\n/** The dialect a field role expects (Decision 2). */\nexport function expectedDialect(role: FieldRole): 'cel' | 'template' {\n  return role === 'template' ? 'template' : 'cel';\n}\n\nfunction toSource(input: ExprInput): { dialect?: string; source: string } {\n  if (input == null) return { source: '' };\n  if (typeof input === 'string') return { source: input };\n  return { dialect: input.dialect, source: input.source ?? '' };\n}\n\nfunction bracesHint(source: string): string | null {\n  const m = SINGLE_BRACE_RE.exec(source);\n  if (!m) return null;\n  const ref = m[1];\n  return (\n    `it looks like a \\`{${ref}}\\` template brace was used inside a CEL expression — ` +\n    `\\`{…}\\` parses as a CEL map literal and fails. Write the bare reference instead, e.g. \\`${ref}\\`.`\n  );\n}\n\nfunction checkFieldExistence(source: string, schema: ExprSchemaHint | undefined, errors: ExprValidationError[]): void {\n  if (!schema?.fields || schema.fields.length === 0) return;\n  const known = new Set(schema.fields);\n  const seen = new Set<string>();\n  let m: RegExpExecArray | null;\n  RECORD_REF_RE.lastIndex = 0;\n  while ((m = RECORD_REF_RE.exec(source)) !== null) {\n    const field = m[1];\n    if (seen.has(field) || known.has(field)) continue;\n    seen.add(field);\n    const suggestion = nearest(field, schema.fields);\n    errors.push({\n      source,\n      message:\n        `unknown field \\`${field}\\`${schema.objectName ? ` on \\`${schema.objectName}\\`` : ''}` +\n        (suggestion ? ` — did you mean \\`${suggestion}\\`?` : ''),\n    });\n  }\n}\n\n/** Cheap edit-distance suggestion for typo'd field names. */\nfunction nearest(name: string, candidates: readonly string[]): string | undefined {\n  let best: string | undefined;\n  let bestD = Infinity;\n  for (const c of candidates) {\n    const d = levenshtein(name, c);\n    if (d < bestD) { bestD = d; best = c; }\n  }\n  return bestD <= Math.max(2, Math.floor(name.length / 3)) ? best : undefined;\n}\n\nfunction levenshtein(a: string, b: string): number {\n  const m = a.length, n = b.length;\n  const dp = Array.from({ length: m + 1 }, (_, i) => i);\n  for (let j = 1; j <= n; j++) {\n    let prev = dp[0];\n    dp[0] = j;\n    for (let i = 1; i <= m; i++) {\n      const tmp = dp[i];\n      dp[i] = Math.min(dp[i] + 1, dp[i - 1] + 1, prev + (a[i - 1] === b[j - 1] ? 0 : 1));\n      prev = tmp;\n    }\n  }\n  return dp[m];\n}\n\n/**\n * Validate one expression for a given field role. Never throws — returns a\n * structured result. Call sites decide whether to throw (build/registration)\n * or report (agent tool).\n */\nexport function validateExpression(\n  role: FieldRole,\n  input: ExprInput,\n  schema?: ExprSchemaHint,\n): ExprValidationResult {\n  const { dialect, source } = toSource(input);\n  const errors: ExprValidationError[] = [];\n  const warnings: ExprValidationError[] = [];\n  if (!source.trim()) return { ok: true, errors, warnings };\n\n  if (role === 'template') {\n    // Templates must be the `template` dialect (or untyped string). Reject a\n    // CEL envelope mistakenly placed in a text field.\n    if (dialect && dialect !== 'template') {\n      errors.push({ source, message: `expected a text template but got a \\`${dialect}\\` expression.` });\n      return { ok: false, errors, warnings };\n    }\n    const compiled = templateEngine.compile(source);\n    if (!compiled.ok) {\n      errors.push({ source, message: `invalid template: ${compiled.error.message} (holes use \\`{{ path }}\\`).` });\n    }\n    // A single `{x}` in a template is the legacy/deprecated form (ADR-0032 §3).\n    const hint = SINGLE_BRACE_RE.test(source) ? bracesHintForTemplate(source) : null;\n    if (hint) errors.push({ source, message: hint });\n    return { ok: errors.length === 0, errors, warnings };\n  }\n\n  // predicate | value → CEL\n  if (dialect && dialect !== 'cel') {\n    errors.push({ source, message: `expected a CEL expression but got a \\`${dialect}\\` dialect.` });\n    return { ok: false, errors, warnings };\n  }\n  const compiled = celEngine.compile(source);\n  if (!compiled.ok) {\n    const hint = bracesHint(source);\n    errors.push({\n      source,\n      message:\n        `invalid CEL ${role}: ${compiled.error.message}` +\n        (hint ? ` — ${hint}` : ` — ${role}s are bare CEL (e.g. \\`record.rating >= 4\\`).`),\n    });\n  } else {\n    checkFieldExistence(source, schema, errors);\n    if (schema?.scope === 'record') {\n      // In a `record`-scoped site a bare top-level identifier is a silent bug —\n      // it must be `record.<field>` (#1928). Hard error.\n      const bare = firstUndeclaredReference(source);\n      if (bare) {\n        errors.push({\n          source,\n          message:\n            `bare reference \\`${bare}\\` — a formula/validation expression binds the record as the ` +\n            `\\`record\\` namespace, not at top level, so \\`${bare}\\` resolves to nothing and the ` +\n            `expression silently evaluates to null. Write \\`record.${bare}\\`.`,\n        });\n      }\n    } else if (schema?.fields && schema.fields.length > 0) {\n      // Flattened flow/automation condition: the record's fields ARE bound at\n      // top-level, so a bare ref is normally correct. But a *non-field* bare\n      // identifier is either a flow variable or a typo. When it is a near-miss\n      // of a known field, warn (did-you-mean) WITHOUT failing the build —\n      // a genuine flow variable won't be edit-distance-close to a field. (#1928)\n      const unknown = firstUndeclaredReference(source, schema.fields);\n      if (unknown) {\n        const suggestion = nearest(unknown, schema.fields);\n        if (suggestion) {\n          warnings.push({\n            source,\n            message:\n              `\\`${unknown}\\` is not a field of \\`${schema.objectName ?? 'the trigger object'}\\` — ` +\n              `did you mean \\`${suggestion}\\`? (flow conditions reference fields bare, e.g. \\`${suggestion} == …\\`). ` +\n              `If \\`${unknown}\\` is a flow variable this is safe to ignore.`,\n          });\n        }\n      }\n    }\n  }\n  return { ok: errors.length === 0, errors, warnings };\n}\n\nfunction bracesHintForTemplate(source: string): string {\n  const m = SINGLE_BRACE_RE.exec(source);\n  const ref = m?.[1] ?? 'field';\n  return `single-brace \\`{${ref}}\\` is not a valid template hole — use double braces: \\`{{ ${ref} }}\\`.`;\n}\n\n/**\n * Introspect what an author (esp. an agent) may use in a field (Decision 1e):\n * the expected dialect, the in-scope field references, and the callable\n * functions. Feeds the authoring context so the model does not guess.\n */\nexport function introspectScope(role: FieldRole, schema?: ExprSchemaHint): {\n  dialect: 'cel' | 'template';\n  fields: string[];\n  roots: string[];\n  functions: string[];\n} {\n  return {\n    dialect: expectedDialect(role),\n    fields: [...(schema?.fields ?? [])],\n    roots: ['record', 'previous', 'input', 'os', 'vars'],\n    functions: CEL_STDLIB_FUNCTIONS,\n  };\n}\n\n/**\n * Public catalog of CEL functions available in expressions — what `introspectScope`\n * advertises to authors (incl. AI). Every entry MUST actually resolve at runtime:\n * either registered in `registerStdLib` or a verified cel-js built-in. Drifting this\n * list ahead of the runtime tells the author to call functions that fault (#1928).\n */\nexport const CEL_STDLIB_FUNCTIONS: string[] = [\n  // Dates (registered stdlib)\n  'now', 'today', 'daysFromNow', 'daysAgo', 'daysBetween', 'date', 'datetime',\n  // Numbers (registered stdlib)\n  'abs', 'round', 'min', 'max',\n  // Strings (registered stdlib)\n  'upper', 'lower', 'trim', 'contains', 'startsWith', 'endsWith', 'matches', 'joinNonEmpty',\n  // Collections / null-ish (registered stdlib)\n  'isBlank', 'isEmpty', 'coalesce', 'len',\n  // cel-js built-ins (verified to resolve)\n  'size', 'has', 'int', 'string', 'bool', 'double', 'timestamp', 'duration',\n];\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACeA,oBAA4B;;;ACG5B,SAAS,cAAc,GAAe;AACpC,QAAM,MAAM,IAAI,KAAK,EAAE,QAAQ,CAAC;AAChC,MAAI,YAAY,GAAG,GAAG,GAAG,CAAC;AAC1B,SAAO;AACT;AAGA,SAAS,OAAO,GAAkB;AAChC,MAAI,aAAa,KAAM,QAAO;AAC9B,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,IAAI,KAAK,OAAO,CAAC,CAAC;AAC7E,SAAO,IAAI,KAAK,OAAO,CAAC,CAAC;AAC3B;AAGA,IAAM,aAAa;AAGnB,SAAS,WAAW,GAAS,GAAiB;AAC5C,QAAM,MAAM,IAAI,KAAK,EAAE,QAAQ,CAAC;AAChC,MAAI,WAAW,IAAI,WAAW,IAAI,CAAC;AACnC,SAAO;AACT;AAUO,SAAS,eACd,KACA,KACa;AACb,SAAO,IACJ,iBAAiB,oCAAoC,MAAM,IAAI,CAAC,EAChE;AAAA,IACC;AAAA,IACA,MAAM,cAAc,IAAI,CAAC;AAAA,EAC3B,EACC;AAAA,IACC;AAAA,IACA,CAAC,MAAuB,WAAW,IAAI,GAAG,OAAO,CAAC,CAAC;AAAA,EACrD,EACC;AAAA,IACC;AAAA,IACA,CAAC,MAAuB,WAAW,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;AAAA,EACtD,EAGC;AAAA,IACC;AAAA,IACA,CAAC,UAAmB;AAClB,UAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,UAAI,OAAO,UAAU,SAAU,QAAO,MAAM,WAAW;AACvD,UAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,WAAW;AAClD,aAAO;AAAA,IACT;AAAA,EACF,EAIC;AAAA,IACC;AAAA,IACA,CAAC,OAAgB,aACd,UAAU,QAAQ,UAAU,SAAa,WAAW;AAAA,EACzD,EAGC;AAAA,IACC;AAAA,IACA,CAAC,UAAmB;AAClB,UAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,aAAO,OAAO,KAAK,EAAE,KAAK;AAAA,IAC5B;AAAA,EACF,EAMC;AAAA,IACC;AAAA,IACA,CAAC,MAAe,QAAiB;AAC/B,YAAM,MAAM,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC;AAC1C,YAAM,YAAY,OAAO,QAAQ,WAAW,MAAM;AAClD,YAAM,QAAkB,CAAC;AACzB,iBAAW,QAAQ,KAAK;AACtB,YAAI,SAAS,QAAQ,SAAS,OAAW;AACzC,cAAM,IAAI,OAAO,IAAI,EAAE,KAAK;AAC5B,YAAI,EAAE,SAAS,EAAG,OAAM,KAAK,CAAC;AAAA,MAChC;AACA,aAAO,MAAM,KAAK,SAAS;AAAA,IAC7B;AAAA,EACF,EAMC;AAAA,IACC;AAAA,IACA,CAAC,GAAY,MACX,OAAO,KAAK,OAAO,OAAO,CAAC,EAAE,QAAQ,IAAI,OAAO,CAAC,EAAE,QAAQ,KAAK,UAAU,CAAC;AAAA,EAC/E,EAIC,iBAAiB,wCAAwC,CAAC,MAAe,OAAO,CAAC,CAAC,EAClF,iBAAiB,4CAA4C,CAAC,MAAe,OAAO,CAAC,CAAC,EAEtF,iBAAiB,oBAAoB,CAAC,MAAe,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,EACxE,iBAAiB,mBAAmB,CAAC,MAAe,OAAO,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,EAIjF,iBAAiB,sBAAsB,CAAC,GAAY,MAAgB,OAAO,CAAC,KAAK,OAAO,CAAC,IAAI,IAAI,CAAE,EACnG,iBAAiB,sBAAsB,CAAC,GAAY,MAAgB,OAAO,CAAC,KAAK,OAAO,CAAC,IAAI,IAAI,CAAE,EAKnG,iBAAiB,sBAAsB,CAAC,MAAe,OAAO,KAAK,EAAE,EAAE,YAAY,CAAC,EACpF,iBAAiB,sBAAsB,CAAC,MAAe,OAAO,KAAK,EAAE,EAAE,YAAY,CAAC,EACpF,iBAAiB,4BAA4B,CAAC,GAAY,QAAiB,OAAO,KAAK,EAAE,EAAE,SAAS,OAAO,OAAO,EAAE,CAAC,CAAC,EACtH,iBAAiB,8BAA8B,CAAC,GAAY,MAAe,OAAO,KAAK,EAAE,EAAE,WAAW,OAAO,KAAK,EAAE,CAAC,CAAC,EACtH,iBAAiB,4BAA4B,CAAC,GAAY,MAAe,OAAO,KAAK,EAAE,EAAE,SAAS,OAAO,KAAK,EAAE,CAAC,CAAC,EAClH,iBAAiB,2BAA2B,CAAC,GAAY,OAAgB,IAAI,OAAO,OAAO,MAAM,EAAE,CAAC,EAAE,KAAK,OAAO,KAAK,EAAE,CAAC,CAAC,EAI3H,iBAAiB,iBAAiB,CAAC,MAAe,OAAO,SAAS,CAAC,CAAC,CAAC,EACrE;AAAA,IACC;AAAA,IACA,CAAC,MAAe,MAAM,QAAQ,MAAM,UAAa,SAAS,CAAC,MAAM;AAAA,EACnE;AACJ;AAGA,SAAS,SAAS,GAAoB;AACpC,MAAI,MAAM,QAAQ,MAAM,OAAW,QAAO;AAC1C,MAAI,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,EAAG,QAAO,EAAE;AACxD,MAAI,OAAO,MAAM,SAAU,QAAO,OAAO,KAAK,CAA4B,EAAE;AAC5E,SAAO;AACT;AAkBO,SAAS,yBAAyB,KAA+B;AACtE,QAAM,MAAwD;AAAA,IAC5D,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,IACnB,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,IACnB,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,IACnB,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,IACnB,KAAK,CAAC,GAAG,MAAM,IAAI;AAAA,EACrB;AACA,aAAW,CAAC,IAAI,EAAE,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC1C,UAAM,OAAO,CAAC,GAAY,MAAe,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAChE,QAAI,iBAAiB,UAAU,EAAE,QAAQ,IAAI;AAC7C,QAAI,iBAAiB,OAAO,EAAE,WAAW,IAAI;AAAA,EAC/C;AACA,SAAO;AACT;AAMO,SAAS,WAAW,KAA2C;AACpE,QAAM,QAAiC,CAAC;AAExC,MAAI,IAAI,WAAW,OAAW,OAAM,SAAS,IAAI;AACjD,MAAI,IAAI,aAAa,OAAW,OAAM,WAAW,IAAI;AACrD,MAAI,IAAI,UAAU,OAAW,OAAM,QAAQ,IAAI;AAG/C,QAAM,KAA8B,CAAC;AACrC,MAAI,IAAI,SAAS,OAAW,IAAG,OAAO,IAAI;AAC1C,MAAI,IAAI,QAAQ,OAAW,IAAG,MAAM,IAAI;AACxC,MAAI,IAAI,QAAQ,OAAW,IAAG,MAAM,IAAI;AACxC,MAAI,OAAO,KAAK,EAAE,EAAE,SAAS,EAAG,OAAM,KAAK;AAE3C,MAAI,IAAI,UAAU,OAAW,QAAO,OAAO,OAAO,IAAI,KAAK;AAE3D,SAAO;AACT;;;ADhMO,IAAM,iBAAiB;AAAA,EAC5B,aAAa;AAAA,EACb,UAAU;AAAA,EACV,iBAAiB;AAAA,EACjB,eAAe;AAAA,EACf,kBAAkB;AACpB;AAEA,SAAS,SAAS,KAA8B;AAC9C,QAAM,MAAM,IAAI,0BAAY;AAAA,IAC1B,yBAAyB;AAAA,IACzB,qBAAqB;AAAA,IACrB,QAAQ;AAAA,EACV,CAAC;AACD,SAAO,yBAAyB,eAAe,KAAK,GAAG,CAAC;AAC1D;AAUA,IAAM,cAAc;AAAA,EAClB;AAAA,EAAU;AAAA,EAAY;AAAA,EAAS;AAAA,EAAU;AAAA,EAAM;AAAA,EAAQ;AAAA,EACvD;AAAA,EAAc;AAAA,EAAW;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAChE;AAAA,EAAW;AAAA,EAAS;AAAA,EAAW;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAU;AAC7D;AAOA,SAAS,eAAe,aAA6C;AACnE,QAAM,MAAM,IAAI,0BAAY;AAAA,IAC1B,yBAAyB;AAAA,IACzB,qBAAqB;AAAA,IACrB,QAAQ;AAAA,EACV,CAAC;AACD,iBAAe,KAAK,MAAM,oBAAI,KAAK,CAAC,CAAC;AACrC,aAAW,QAAQ,aAAa;AAC9B,QAAI;AAAE,UAAI,iBAAiB,MAAM,KAAK;AAAA,IAAG,QAAQ;AAAA,IAA2B;AAAA,EAC9E;AAMA,aAAW,SAAS,aAAa;AAC/B,QAAI;AAAE,UAAI,iBAAiB,OAAO,KAAK;AAAA,IAAG,QAAQ;AAAA,IAAsC;AAAA,EAC1F;AACA,SAAO;AACT;AAGA,IAAI;AAeG,SAAS,yBACd,QACA,cAAiC,CAAC,GACnB;AACf,MAAI,OAAO,WAAW,YAAY,CAAC,OAAO,KAAK,EAAG,QAAO;AACzD,MAAI;AACF,UAAM,MAAM,YAAY,WAAW,IAC9B,oCAAmB,eAAe,CAAC,CAAC,KACrC,eAAe,WAAW;AAC9B,UAAM,SAAS,IAAI,MAAM,MAAM,EAAE,QAAQ;AAGzC,QAAI,UAAU,OAAO,UAAU,OAAO;AACpC,YAAM,IAAI,yCAAyC,KAAK,OAAO,OAAO,WAAW,EAAE;AACnF,UAAI,EAAG,QAAO,EAAE,CAAC;AAAA,IACnB;AAAA,EACF,QAAQ;AAAA,EAGR;AACA,SAAO;AACT;AAQA,SAAS,OAAO,OAAyB;AACvC,MAAI,OAAO,UAAU,UAAU;AAE7B,QAAI,SAAS,OAAO,OAAO,gBAAgB,KAAK,SAAS,OAAO,OAAO,gBAAgB,GAAG;AACxF,aAAO,OAAO,KAAK;AAAA,IACrB;AACA,WAAO,MAAM,SAAS;AAAA,EACxB;AACA,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,MAAM;AACjD,MAAI,SAAS,OAAO,UAAU,YAAY,EAAE,iBAAiB,OAAO;AAClE,UAAM,MAA+B,CAAC;AACtC,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,EAAG,KAAI,CAAC,IAAI,OAAO,CAAC;AAC7D,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAYA,IAAM,oBAAoB;AAU1B,IAAM,yBACJ;AAUF,SAAS,uBAAuB,KAAuB;AACrD,QAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,SAAO,oBAAoB,KAAK,OAAO;AACzC;AAYA,SAAS,uBAAuB,OAAyB;AACvD,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,QAAQ,SAAS,GAAG;AACtB,UAAI,kBAAkB,KAAK,OAAO,GAAG;AACnC,cAAM,IAAI,OAAO,OAAO;AACxB,YAAI,OAAO,SAAS,CAAC,EAAG,QAAO;AAAA,MACjC,WAAW,uBAAuB,KAAK,OAAO,GAAG;AAC/C,cAAM,KAAK,KAAK,MAAM,OAAO;AAC7B,YAAI,CAAC,OAAO,MAAM,EAAE,EAAG,QAAO,IAAI,KAAK,EAAE;AAAA,MAC3C;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,sBAAsB;AACjE,MAAI,SAAS,OAAO,UAAU,YAAY,EAAE,iBAAiB,OAAO;AAClE,UAAM,MAA+B,CAAC;AACtC,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,EAAG,KAAI,CAAC,IAAI,uBAAuB,CAAC;AAC7E,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAiC;AACtD,QAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,MAAI,OAAgD;AACpD,MAAI,gBAAgB,KAAK,OAAO,EAAG,QAAO;AAAA,WACjC,2BAA2B,KAAK,OAAO,EAAG,QAAO;AAAA,WACjD,oCAAoC,KAAK,OAAO,EAAG,QAAO;AACnE,SAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,QAAQ,EAAE;AAC/C;AAEO,IAAM,YAA2B;AAAA,EACtC,SAAS;AAAA,EAET,QAAQ,QAAqC;AAC3C,QAAI;AAGF,YAAM,MAAM,SAAS,MAAM,oBAAI,KAAK,CAAC,CAAC;AACtC,YAAM,WAAW,IAAI,MAAM,MAAM;AASjC,YAAM,cAAc,SAAS,QAAQ;AACrC,UAAI,eAAe,YAAY,UAAU,OAAO;AAC9C,eAAO;AAAA,UACL,IAAI;AAAA,UACJ,OAAO,EAAE,MAAM,QAAQ,SAAS,YAAY,OAAO,WAAW,kCAAkC;AAAA,QAClG;AAAA,MACF;AACA,aAAO,EAAE,IAAI,MAAM,OAAO,SAAS,IAAI;AAAA,IACzC,SAAS,KAAK;AACZ,aAAO,cAAc,GAAG;AAAA,IAC1B;AAAA,EACF;AAAA,EAEA,SAAsB,MAAkB,KAAiC;AACvE,QAAI,KAAK,YAAY,OAAO;AAC1B,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,sCAAsC,KAAK,OAAO,IAAI;AAAA,MAC3F;AAAA,IACF;AACA,UAAM,SAAS,KAAK;AACpB,QAAI,OAAO,WAAW,YAAY,OAAO,WAAW,GAAG;AAKrD,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,SAAS,SAAS,0DAA0D;AAAA,MAC7F;AAAA,IACF;AAEA,UAAM,MAAM,MAAM,IAAI,OAAO,oBAAI,KAAK;AACtC,QAAI;AACF,YAAM,MAAM,SAAS,GAAG;AACxB,YAAM,QAAQ,WAAW,GAAG;AAC5B,UAAI;AACF,cAAM,MAAM,IAAI,SAAS,QAAQ,KAAK;AACtC,eAAO,EAAE,IAAI,MAAM,OAAO,OAAO,GAAG,EAAO;AAAA,MAC7C,SAAS,KAAK;AAWZ,YAAI,CAAC,uBAAuB,GAAG,EAAG,OAAM;AACxC,cAAM,WAAW,uBAAuB,KAAK;AAC7C,YAAI;AACF,gBAAM,MAAM,IAAI,SAAS,QAAQ,QAAQ;AACzC,iBAAO,EAAE,IAAI,MAAM,OAAO,OAAO,GAAG,EAAO;AAAA,QAC7C,QAAQ;AAGN,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,aAAO,cAAc,GAAG;AAAA,IAC1B;AAAA,EACF;AACF;;;AE/RA,IAAM,UAAU,oBAAI,IAAI;AAAA,EACtB;AAAA,EAAW;AAAA,EAAa;AAAA,EAAY;AAAA,EAAW;AAAA,EAAU;AAAA,EAAW;AACtE,CAAC;AAED,SAAS,SAAS,QAAoC;AACpD,QAAM,UAAU,OAAO,KAAK;AAC5B,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,SAAS,SAAS,uBAAuB,EAAE;AAAA,EAChF;AACA,MAAI,QAAQ,WAAW,GAAG,GAAG;AAC3B,QAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,SAAS,SAAS,uBAAuB,OAAO,IAAI;AAAA,MACrE;AAAA,IACF;AACA,WAAO,EAAE,IAAI,MAAM,OAAO,QAAQ;AAAA,EACpC;AACA,QAAM,SAAS,QAAQ,MAAM,KAAK;AAClC,MAAI,OAAO,WAAW,KAAK,OAAO,WAAW,GAAG;AAC9C,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,OAAO;AAAA,QACL,MAAM;AAAA,QACN,SAAS,oDAAoD,OAAO,MAAM;AAAA,MAC5E;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU;AAChB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,GAAG;AAC5B,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS,cAAc,IAAI,CAAC,kCAAkC,OAAO,CAAC,CAAC;AAAA,QACzE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,IAAI,MAAM,OAAO,QAAQ;AACpC;AAEO,IAAM,aAA4B;AAAA,EACvC,SAAS;AAAA,EAET,QAAQ,QAAqC;AAC3C,WAAO,SAAS,MAAM;AAAA,EACxB;AAAA,EAEA,SAAsB,MAAkB,MAAkC;AACxE,QAAI,KAAK,YAAY,QAAQ;AAC3B,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,uCAAuC,KAAK,OAAO,IAAI;AAAA,MAC5F;AAAA,IACF;AACA,QAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,SAAS,SAAS,kCAAkC,EAAE;AAAA,IAC3F;AACA,UAAM,SAAS,SAAS,KAAK,MAAM;AACnC,QAAI,CAAC,OAAO,GAAI,QAAO;AAGvB,WAAO,EAAE,IAAI,MAAM,OAAO,OAAO,MAAsB;AAAA,EACzD;AACF;;;ACvDA,IAAM,UAAU;AAMhB,SAAS,SAAS,GAAgC;AAChD,MAAI,OAAO,MAAM,SAAU,QAAO;AAClC,MAAI,OAAO,MAAM,SAAU,QAAO,OAAO,CAAC;AAC1C,MAAI,OAAO,MAAM,YAAY,EAAE,KAAK,MAAM,MAAM,CAAC,OAAO,MAAM,OAAO,CAAC,CAAC,EAAG,QAAO,OAAO,CAAC;AACzF,SAAO;AACT;AAEA,SAAS,OAAO,GAA8B;AAC5C,MAAI,aAAa,KAAM,QAAO;AAC9B,MAAI,OAAO,MAAM,SAAU,QAAO,IAAI,KAAK,CAAC;AAC5C,MAAI,OAAO,MAAM,UAAU;AACzB,UAAM,IAAI,IAAI,KAAK,CAAC;AACpB,QAAI,CAAC,OAAO,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO;AAAA,EACzC;AACA,SAAO;AACT;AAEA,IAAM,aAAwC;AAAA,EAC5C,OAAO,CAAC,MAAM,WAAW,CAAC,EAAE,YAAY;AAAA,EACxC,OAAO,CAAC,MAAM,WAAW,CAAC,EAAE,YAAY;AAAA,EACxC,MAAM,CAAC,MAAM,WAAW,CAAC,EAAE,KAAK;AAAA;AAAA,EAEhC,QAAQ,CAAC,GAAG,KAAK,WAAW;AAC1B,UAAM,IAAI,SAAS,CAAC;AACpB,QAAI,MAAM,OAAW,QAAO,WAAW,CAAC;AACxC,UAAM,SAAS,QAAQ,SAAY,OAAO,GAAG,IAAI;AACjD,WAAO,IAAI,KAAK,aAAa,QAAQ,WAAW,UAAa,CAAC,OAAO,MAAM,MAAM,IAC7E,EAAE,uBAAuB,QAAQ,uBAAuB,OAAO,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC;AAAA,EACrF;AAAA;AAAA,EAEA,UAAU,CAAC,GAAG,KAAK,WAAW;AAC5B,UAAM,IAAI,SAAS,CAAC;AACpB,QAAI,MAAM,OAAW,QAAO,WAAW,CAAC;AACxC,UAAM,OAAQ,OAAO,IAAI,KAAK,KAAM;AACpC,QAAI;AACF,aAAO,IAAI,KAAK,aAAa,QAAQ,EAAE,OAAO,YAAY,UAAU,KAAK,CAAC,EAAE,OAAO,CAAC;AAAA,IACtF,QAAQ;AACN,aAAO,IAAI,KAAK,aAAa,QAAQ,EAAE,OAAO,YAAY,UAAU,MAAM,CAAC,EAAE,OAAO,CAAC;AAAA,IACvF;AAAA,EACF;AAAA;AAAA,EAEA,SAAS,CAAC,GAAG,KAAK,WAAW;AAC3B,UAAM,IAAI,SAAS,CAAC;AACpB,QAAI,MAAM,OAAW,QAAO,WAAW,CAAC;AACxC,UAAM,SAAS,QAAQ,SAAY,OAAO,GAAG,IAAI;AACjD,WAAO,IAAI,KAAK,aAAa,QAAQ;AAAA,MACnC,OAAO;AAAA,MACP,uBAAuB,OAAO,MAAM,MAAM,IAAI,IAAI;AAAA,MAClD,uBAAuB,OAAO,MAAM,MAAM,IAAI,IAAI;AAAA,IACpD,CAAC,EAAE,OAAO,CAAC;AAAA,EACb;AAAA;AAAA,EAEA,MAAM,CAAC,GAAG,KAAK,WAAW;AACxB,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,CAAC,EAAG,QAAO,WAAW,CAAC;AAC3B,QAAI,QAAQ,MAAO,QAAO,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AACrD,UAAM,QAAQ,QAAQ,SAAS,SAAS,QAAQ,WAAW,WAAW;AACtE,WAAO,IAAI,KAAK,eAAe,QAAQ,EAAE,WAAW,MAAqC,CAAC,EAAE,OAAO,CAAC;AAAA,EACtG;AAAA;AAAA,EAEA,UAAU,CAAC,GAAG,KAAK,WAAW;AAC5B,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,CAAC,EAAG,QAAO,WAAW,CAAC;AAC3B,QAAI,QAAQ,MAAO,QAAO,EAAE,YAAY;AACxC,UAAM,QAAQ,QAAQ,SAAS,SAAS,QAAQ,WAAW,WAAW;AACtE,WAAO,IAAI,KAAK,eAAe,QAAQ;AAAA,MACrC,WAAW;AAAA,MACX,WAAW;AAAA,IACb,CAAC,EAAE,OAAO,CAAC;AAAA,EACb;AAAA;AAAA,EAEA,UAAU,CAAC,GAAG,QAAQ;AACpB,UAAM,IAAI,WAAW,CAAC;AACtB,UAAM,MAAM,QAAQ,SAAY,OAAO,GAAG,IAAI;AAC9C,QAAI,OAAO,MAAM,GAAG,KAAK,EAAE,UAAU,IAAK,QAAO;AACjD,WAAO,EAAE,MAAM,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI;AAAA,EAC5C;AAAA;AAAA,EAEA,SAAS,CAAC,GAAG,QAAQ;AACnB,UAAM,IAAI,WAAW,CAAC;AACtB,WAAO,MAAM,KAAM,OAAO,KAAM;AAAA,EAClC;AAAA,EACA,MAAM,CAAC,MAAM;AACX,QAAI;AAAE,aAAO,KAAK,UAAU,CAAC;AAAA,IAAG,QAAQ;AAAE,aAAO,OAAO,CAAC;AAAA,IAAG;AAAA,EAC9D;AACF;AAGO,IAAM,sBAAgC,OAAO,KAAK,UAAU;AAEnE,SAAS,WAAW,OAAwB;AAC1C,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,MAAI,iBAAiB,KAAM,QAAO,MAAM,YAAY;AACpD,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAW,QAAO,OAAO,KAAK;AAChF,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,SAAS;AACrD,MAAI;AACF,WAAO,KAAK,UAAU,KAAK;AAAA,EAC7B,QAAQ;AACN,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;AAEA,SAAS,YAAY,OAAgC,MAAuB;AAC1E,QAAM,aAAa,KAAK,QAAQ,cAAc,KAAK;AACnD,QAAM,WAAW,WAAW,MAAM,GAAG,EAAE,OAAO,OAAO;AACrD,MAAI,SAAkB;AACtB,aAAW,OAAO,UAAU;AAC1B,QAAI,UAAU,QAAQ,OAAO,WAAW,SAAU,QAAO;AACzD,aAAU,OAAmC,GAAG;AAAA,EAClD;AACA,SAAO;AACT;AAOA,IAAM,eAAe;AAOrB,SAAS,UAAU,OAAkC;AACnD,QAAM,OAAO,MAAM,QAAQ,GAAG;AAC9B,MAAI,SAAS,IAAI;AACf,UAAMA,QAAO,MAAM,KAAK;AACxB,WAAO,aAAa,KAAKA,KAAI,IAAI,EAAE,MAAAA,MAAK,IAAI;AAAA,EAC9C;AACA,QAAM,OAAO,MAAM,MAAM,GAAG,IAAI,EAAE,KAAK;AACvC,MAAI,CAAC,aAAa,KAAK,IAAI,EAAG,QAAO;AACrC,QAAM,aAAa,MAAM,MAAM,OAAO,CAAC,EAAE,KAAK;AAE9C,QAAM,QAAQ,WAAW,QAAQ,GAAG;AACpC,MAAI,OAAO;AACX,MAAI;AACJ,MAAI,UAAU,IAAI;AAChB,WAAO,WAAW,MAAM,GAAG,KAAK,EAAE,KAAK;AACvC,UAAM,WAAW,MAAM,QAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,gBAAgB,EAAE;AAAA,EACrE;AACA,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAC9B,SAAO,EAAE,MAAM,QAAQ,EAAE,MAAM,IAAI,EAAE;AACvC;AAEA,SAAS,gBAAgB,QAA0C;AACjE,QAAM,QAAQ,OAAO,MAAM,OAAO,KAAK,CAAC,GAAG;AAC3C,QAAM,SAAS,OAAO,MAAM,OAAO,KAAK,CAAC,GAAG;AAC5C,MAAI,SAAS,OAAO;AAClB,WAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,SAAS,SAAS,2CAA2C,EAAE;AAAA,EACpG;AACA,QAAM,QAAsB,CAAC;AAC7B,MAAI;AACJ,UAAQ,YAAY;AACpB,UAAQ,IAAI,QAAQ,KAAK,MAAM,OAAO,MAAM;AAC1C,UAAM,SAAS,UAAU,EAAE,CAAC,CAAC;AAC7B,QAAI,CAAC,QAAQ;AACX,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SACE,8BAA8B,EAAE,CAAC,CAAC,4KAEgB,oBAAoB,KAAK,IAAI,CAAC;AAAA,QACpF;AAAA,MACF;AAAA,IACF;AACA,UAAM,KAAK,MAAM;AAAA,EACnB;AACA,SAAO,EAAE,IAAI,MAAM,OAAO,MAAM;AAClC;AAEO,IAAM,iBAAgC;AAAA,EAC3C,SAAS;AAAA,EAET,QAAQ,QAAqC;AAC3C,WAAO,gBAAgB,MAAM;AAAA,EAC/B;AAAA,EAEA,SAAsB,MAAkB,KAAiC;AACvE,QAAI,KAAK,YAAY,YAAY;AAC/B,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,2CAA2C,KAAK,OAAO,IAAI;AAAA,MAChG;AAAA,IACF;AACA,QAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,SAAS,SAAS,sCAAsC,EAAE;AAAA,IAC/F;AACA,UAAM,QAAQ,gBAAgB,KAAK,MAAM;AACzC,QAAI,CAAC,MAAM,GAAI,QAAO;AAEtB,UAAM,QAAQ,WAAW,GAAG;AAC5B,UAAM,SACH,IAAI,SAAS,OAAO,IAAI,MAAM,WAAW,YAAY,IAAI,MAAM,UAC/D,OAAQ,IAA4B,WAAW,YAAa,IAA4B,UACzF;AAEF,UAAM,MAAM,KAAK,OAAO,QAAQ,SAAS,CAAC,QAAQ,UAAU;AAC1D,YAAM,SAAS,UAAU,OAAO,KAAK,CAAC;AACtC,UAAI,CAAC,OAAQ,QAAO;AACpB,YAAM,QAAQ,YAAY,OAAO,OAAO,IAAI;AAC5C,UAAI,OAAO,QAAQ;AACjB,eAAO,WAAW,OAAO,OAAO,IAAI,EAAE,OAAO,OAAO,OAAO,KAAK,MAAgB;AAAA,MAClF;AACA,aAAO,WAAW,KAAK;AAAA,IACzB,CAAC;AACD,WAAO,EAAE,IAAI,MAAM,OAAO,IAAoB;AAAA,EAChD;AACF;;;ACrOA,IAAM,WAAW,oBAAI,IAA2B;AAGzC,SAAS,SAAS,QAA6B;AACpD,WAAS,IAAI,OAAO,SAAS,MAAM;AACrC;AAGO,SAAS,UAAU,SAA4C;AACpE,SAAO,SAAS,IAAI,OAAO;AAC7B;AAGO,SAAS,WAAW,SAA0B;AACnD,SAAO,SAAS,IAAI,OAAO,KAAK,CAAC,SAAS,IAAI,OAAO,EAAG,QAAQ,WAAW,OAAO;AACpF;AAEA,SAAS,SAAS,SAAiB,QAA+B;AAChE,SAAO;AAAA,IACL;AAAA,IACA,SAAS,OAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,WAAW,SAAS,OAAO,EAAE;AAAA,IACzE,UAAU,OAAO,EAAE,IAAI,OAAO,OAAO,EAAE,MAAM,WAAW,SAAS,OAAO,EAAE;AAAA,EAC5E;AACF;AAGA,SAAS,SAAS;AAClB,SAAS,UAAU;AACnB,SAAS,cAAc;AAGvB,SAAS,SAAS,MAAM,gEAAgE,CAAC;AAMlF,IAAM,mBAAmB;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,MAAuC;AAC7C,UAAM,SAAS,SAAS,IAAI,KAAK,OAAO;AACxC,QAAI,CAAC,QAAQ;AACX,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,qCAAqC,KAAK,OAAO,IAAI;AAAA,MAC1F;AAAA,IACF;AACA,QAAI,OAAO,KAAK,WAAW,UAAU;AACnC,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,SAAS,SAAS,2CAA2C;AAAA,MAC9E;AAAA,IACF;AACA,WAAO,OAAO,QAAQ,KAAK,MAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAsB,MAAkB,KAAiC;AACvE,UAAM,SAAS,SAAS,IAAI,KAAK,OAAO;AACxC,QAAI,CAAC,QAAQ;AACX,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,OAAO,EAAE,MAAM,WAAW,SAAS,qCAAqC,KAAK,OAAO,IAAI;AAAA,MAC1F;AAAA,IACF;AACA,WAAO,OAAO,SAAY,MAAM,GAAG;AAAA,EACrC;AACF;;;ACtFA,kBAAkD;AASlD,SAAS,iBAAiB,OAAqC;AAC7D,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO;AACxE,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,SAAU,QAAO;AAC1C,SAAO,6BAAiB,UAAU,CAAC,EAAE;AACvC;AASO,SAAS,YACd,OACA,KACqB;AACrB,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO,EAAE,IAAI,MAAM,MAAM;AAAA,EAC3B;AACA,QAAM,IAAI,OAAO;AACjB,MAAI,MAAM,YAAY,MAAM,YAAY,MAAM,WAAW;AACvD,WAAO,EAAE,IAAI,MAAM,MAAM;AAAA,EAC3B;AACA,MAAI,iBAAiB,MAAM;AACzB,WAAO,EAAE,IAAI,MAAM,MAAM;AAAA,EAC3B;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAMC,OAAiB,CAAC;AACxB,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,YAAY,MAAM,GAAG;AAC/B,UAAI,CAAC,EAAE,GAAI,QAAO;AAClB,MAAAA,KAAI,KAAK,EAAE,KAAK;AAAA,IAClB;AACA,WAAO,EAAE,IAAI,MAAM,OAAOA,KAAI;AAAA,EAChC;AACA,MAAI,iBAAiB,KAAK,GAAG;AAC3B,WAAO,iBAAiB,SAAS,OAAO,GAAG;AAAA,EAC7C;AAEA,QAAM,MAA+B,CAAC;AACtC,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAkC,GAAG;AACvE,UAAM,IAAI,YAAY,GAAG,GAAG;AAC5B,QAAI,CAAC,EAAE,GAAI,QAAO;AAClB,QAAI,CAAC,IAAI,EAAE;AAAA,EACb;AACA,SAAO,EAAE,IAAI,MAAM,OAAO,IAAI;AAChC;AAMO,SAAS,kBACd,QACA,KACqC;AACrC,QAAM,YAAyB,EAAE,GAAG,KAAK,KAAK,IAAI,OAAO,oBAAI,KAAK,EAAE;AACpE,QAAM,SAAS,YAAY,QAAQ,SAAS;AAC5C,SAAO;AACT;;;AClEA,IAAAC,eAKO;AAYA,SAAS,oBAAoB,OAAgD;AAClF,QAAM,SAAS,mCAAsB,UAAU,KAAK;AACpD,MAAI,CAAC,OAAO,SAAS;AACnB,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,OAAO,EAAE,MAAM,SAAS,SAAS,OAAO,MAAM,QAAQ;AAAA,IACxD;AAAA,EACF;AAEA,QAAM,OAAO,OAAO;AAGpB,MAAI,KAAK,QAAQ,UAAa,KAAK,WAAW,QAAW;AACvD,WAAO,EAAE,IAAI,MAAM,OAAO,KAAK;AAAA,EACjC;AAIA,QAAM,WAAW,iBAAiB,QAAQ,IAAI;AAC9C,MAAI,CAAC,SAAS,IAAI;AAChB,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,OAAO;AAAA,MACL,GAAG;AAAA,MACH,KAAK,SAAS;AAAA,IAChB;AAAA,EACF;AACF;AAQO,SAAS,wBACd,MACA,OAAiB,CAAC,GAC2C;AAC7D,MAAI,SAAS,QAAQ,OAAO,SAAS,SAAU,QAAO;AAEtD,MAAI,oBAAoB,IAAI,GAAG;AAC7B,UAAM,IAAI,oBAAoB,IAAuB;AACrD,QAAI,CAAC,EAAE,GAAI,QAAO,EAAE,MAAM,KAAK,KAAK,GAAG,GAAG,OAAO,EAAE,MAAM;AACzD,WAAO,OAAO,MAAiC,EAAE,KAAK;AACtD,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,IAAI,wBAAwB,KAAK,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC;AAC/D,UAAI,EAAG,QAAO;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAEA,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,IAA+B,GAAG;AACpE,UAAM,IAAI,wBAAwB,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;AACjD,QAAI,EAAG,QAAO;AAAA,EAChB;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAAyB;AACpD,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO;AACxE,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,SAAU,QAAO;AAC1C,SAAO,8BAAiB,UAAU,CAAC,EAAE;AACvC;;;ACzBA,IAAM,kBAAkB;AAExB,IAAM,gBAAgB;AAGf,SAAS,gBAAgB,MAAqC;AACnE,SAAO,SAAS,aAAa,aAAa;AAC5C;AAEA,SAAS,SAAS,OAAwD;AACxE,MAAI,SAAS,KAAM,QAAO,EAAE,QAAQ,GAAG;AACvC,MAAI,OAAO,UAAU,SAAU,QAAO,EAAE,QAAQ,MAAM;AACtD,SAAO,EAAE,SAAS,MAAM,SAAS,QAAQ,MAAM,UAAU,GAAG;AAC9D;AAEA,SAAS,WAAW,QAA+B;AACjD,QAAM,IAAI,gBAAgB,KAAK,MAAM;AACrC,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,MAAM,EAAE,CAAC;AACf,SACE,sBAAsB,GAAG,2JACkE,GAAG;AAElG;AAEA,SAAS,oBAAoB,QAAgB,QAAoC,QAAqC;AACpH,MAAI,CAAC,QAAQ,UAAU,OAAO,OAAO,WAAW,EAAG;AACnD,QAAM,QAAQ,IAAI,IAAI,OAAO,MAAM;AACnC,QAAM,OAAO,oBAAI,IAAY;AAC7B,MAAI;AACJ,gBAAc,YAAY;AAC1B,UAAQ,IAAI,cAAc,KAAK,MAAM,OAAO,MAAM;AAChD,UAAM,QAAQ,EAAE,CAAC;AACjB,QAAI,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,EAAG;AACzC,SAAK,IAAI,KAAK;AACd,UAAM,aAAa,QAAQ,OAAO,OAAO,MAAM;AAC/C,WAAO,KAAK;AAAA,MACV;AAAA,MACA,SACE,mBAAmB,KAAK,KAAK,OAAO,aAAa,SAAS,OAAO,UAAU,OAAO,EAAE,MACnF,aAAa,0BAAqB,UAAU,QAAQ;AAAA,IACzD,CAAC;AAAA,EACH;AACF;AAGA,SAAS,QAAQ,MAAc,YAAmD;AAChF,MAAI;AACJ,MAAI,QAAQ;AACZ,aAAW,KAAK,YAAY;AAC1B,UAAM,IAAI,YAAY,MAAM,CAAC;AAC7B,QAAI,IAAI,OAAO;AAAE,cAAQ;AAAG,aAAO;AAAA,IAAG;AAAA,EACxC;AACA,SAAO,SAAS,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,SAAS,CAAC,CAAC,IAAI,OAAO;AACpE;AAEA,SAAS,YAAY,GAAW,GAAmB;AACjD,QAAM,IAAI,EAAE,QAAQ,IAAI,EAAE;AAC1B,QAAM,KAAK,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;AACpD,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,QAAI,OAAO,GAAG,CAAC;AACf,OAAG,CAAC,IAAI;AACR,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAM,MAAM,GAAG,CAAC;AAChB,SAAG,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE;AACjF,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,GAAG,CAAC;AACb;AAOO,SAAS,mBACd,MACA,OACA,QACsB;AACtB,QAAM,EAAE,SAAS,OAAO,IAAI,SAAS,KAAK;AAC1C,QAAM,SAAgC,CAAC;AACvC,QAAM,WAAkC,CAAC;AACzC,MAAI,CAAC,OAAO,KAAK,EAAG,QAAO,EAAE,IAAI,MAAM,QAAQ,SAAS;AAExD,MAAI,SAAS,YAAY;AAGvB,QAAI,WAAW,YAAY,YAAY;AACrC,aAAO,KAAK,EAAE,QAAQ,SAAS,wCAAwC,OAAO,iBAAiB,CAAC;AAChG,aAAO,EAAE,IAAI,OAAO,QAAQ,SAAS;AAAA,IACvC;AACA,UAAMC,YAAW,eAAe,QAAQ,MAAM;AAC9C,QAAI,CAACA,UAAS,IAAI;AAChB,aAAO,KAAK,EAAE,QAAQ,SAAS,qBAAqBA,UAAS,MAAM,OAAO,+BAA+B,CAAC;AAAA,IAC5G;AAEA,UAAM,OAAO,gBAAgB,KAAK,MAAM,IAAI,sBAAsB,MAAM,IAAI;AAC5E,QAAI,KAAM,QAAO,KAAK,EAAE,QAAQ,SAAS,KAAK,CAAC;AAC/C,WAAO,EAAE,IAAI,OAAO,WAAW,GAAG,QAAQ,SAAS;AAAA,EACrD;AAGA,MAAI,WAAW,YAAY,OAAO;AAChC,WAAO,KAAK,EAAE,QAAQ,SAAS,yCAAyC,OAAO,cAAc,CAAC;AAC9F,WAAO,EAAE,IAAI,OAAO,QAAQ,SAAS;AAAA,EACvC;AACA,QAAM,WAAW,UAAU,QAAQ,MAAM;AACzC,MAAI,CAAC,SAAS,IAAI;AAChB,UAAM,OAAO,WAAW,MAAM;AAC9B,WAAO,KAAK;AAAA,MACV;AAAA,MACA,SACE,eAAe,IAAI,KAAK,SAAS,MAAM,OAAO,MAC7C,OAAO,WAAM,IAAI,KAAK,WAAM,IAAI;AAAA,IACrC,CAAC;AAAA,EACH,OAAO;AACL,wBAAoB,QAAQ,QAAQ,MAAM;AAC1C,QAAI,QAAQ,UAAU,UAAU;AAG9B,YAAM,OAAO,yBAAyB,MAAM;AAC5C,UAAI,MAAM;AACR,eAAO,KAAK;AAAA,UACV;AAAA,UACA,SACE,oBAAoB,IAAI,kHACwB,IAAI,wFACK,IAAI;AAAA,QACjE,CAAC;AAAA,MACH;AAAA,IACF,WAAW,QAAQ,UAAU,OAAO,OAAO,SAAS,GAAG;AAMrD,YAAM,UAAU,yBAAyB,QAAQ,OAAO,MAAM;AAC9D,UAAI,SAAS;AACX,cAAM,aAAa,QAAQ,SAAS,OAAO,MAAM;AACjD,YAAI,YAAY;AACd,mBAAS,KAAK;AAAA,YACZ;AAAA,YACA,SACE,KAAK,OAAO,0BAA0B,OAAO,cAAc,oBAAoB,4BAC7D,UAAU,sDAAsD,UAAU,uBACpF,OAAO;AAAA,UACnB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,IAAI,OAAO,WAAW,GAAG,QAAQ,SAAS;AACrD;AAEA,SAAS,sBAAsB,QAAwB;AACrD,QAAM,IAAI,gBAAgB,KAAK,MAAM;AACrC,QAAM,MAAM,IAAI,CAAC,KAAK;AACtB,SAAO,mBAAmB,GAAG,mEAA8D,GAAG;AAChG;AAOO,SAAS,gBAAgB,MAAiB,QAK/C;AACA,SAAO;AAAA,IACL,SAAS,gBAAgB,IAAI;AAAA,IAC7B,QAAQ,CAAC,GAAI,QAAQ,UAAU,CAAC,CAAE;AAAA,IAClC,OAAO,CAAC,UAAU,YAAY,SAAS,MAAM,MAAM;AAAA,IACnD,WAAW;AAAA,EACb;AACF;AAQO,IAAM,uBAAiC;AAAA;AAAA,EAE5C;AAAA,EAAO;AAAA,EAAS;AAAA,EAAe;AAAA,EAAW;AAAA,EAAe;AAAA,EAAQ;AAAA;AAAA,EAEjE;AAAA,EAAO;AAAA,EAAS;AAAA,EAAO;AAAA;AAAA,EAEvB;AAAA,EAAS;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAY;AAAA,EAAc;AAAA,EAAY;AAAA,EAAW;AAAA;AAAA,EAE3E;AAAA,EAAW;AAAA,EAAW;AAAA,EAAY;AAAA;AAAA,EAElC;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAa;AACjE;","names":["path","out","import_spec","compiled"]}