@freighttech/ui 0.13.18

package/dist/backend/dynamic-table/formula/functions.js

@@ -0,0 +1,602 @@
+import { formulaIssue } from "./types.js";
+function ok(value) {
+  return { ok: true, value };
+}
+function fail(code, message, params) {
+  return { ok: false, issue: formulaIssue(code, message, params) };
+}
+const EMPTY = { ok: true, value: null };
+const ISO_DATE = /^\d{4}-\d{2}-\d{2}(?:[T ]|$)/;
+const DATE_ONLY = /^(\d{4})-(\d{2})-(\d{2})$/;
+function toNumber(value, what = "value") {
+  if (value === null) return EMPTY;
+  if (typeof value === "number") {
+    if (Number.isNaN(value)) return fail("type_mismatch", `${what} is not a number`, { name: what });
+    return ok(value);
+  }
+  if (typeof value === "boolean") return ok(value ? 1 : 0);
+  if (typeof value === "string") {
+    const trimmed = value.trim();
+    if (!trimmed) return EMPTY;
+    const n = Number(trimmed);
+    if (Number.isNaN(n)) return fail("type_mismatch", `${what} is not a number`, { name: what });
+    return ok(n);
+  }
+  return fail("type_mismatch", `${what} is not a number`, { name: what });
+}
+function toText(value) {
+  if (value === null) return EMPTY;
+  if (value instanceof Date) return ok(formatDate(value));
+  return ok(String(value));
+}
+function toBoolean(value, what = "value") {
+  if (value === null) return EMPTY;
+  if (typeof value === "boolean") return ok(value);
+  if (typeof value === "number") return ok(value !== 0);
+  if (typeof value === "string") {
+    const lowered = value.trim().toLowerCase();
+    if (!lowered) return EMPTY;
+    if (lowered === "true" || lowered === "1") return ok(true);
+    if (lowered === "false" || lowered === "0") return ok(false);
+  }
+  return fail("type_mismatch", `${what} is not a true/false value`, { name: what });
+}
+function toDate(value, what = "value") {
+  if (value === null) return EMPTY;
+  if (value instanceof Date) {
+    if (Number.isNaN(value.getTime())) {
+      return fail("type_mismatch", `${what} is not a date`, { name: what });
+    }
+    return ok(value);
+  }
+  if (typeof value === "string") {
+    const trimmed = value.trim();
+    if (!trimmed) return EMPTY;
+    if (!ISO_DATE.test(trimmed)) return fail("type_mismatch", `${what} is not a date`, { name: what });
+    const dateOnly = DATE_ONLY.exec(trimmed);
+    const d = dateOnly ? new Date(Number(dateOnly[1]), Number(dateOnly[2]) - 1, Number(dateOnly[3])) : new Date(trimmed);
+    if (Number.isNaN(d.getTime())) return fail("type_mismatch", `${what} is not a date`, { name: what });
+    return ok(d);
+  }
+  return fail("type_mismatch", `${what} is not a date`, { name: what });
+}
+function formatDate(d) {
+  const pad = (n) => String(n).padStart(2, "0");
+  return `${d.getFullYear()}-${pad(d.getMonth() + 1)}-${pad(d.getDate())}`;
+}
+function roundHalfAwayFromZero(value, digits) {
+  const sign = value < 0 ? -1 : 1;
+  const abs = Math.abs(value);
+  const shifted = Number(`${abs}e${digits}`);
+  const rounded = Number.isFinite(shifted) ? Math.round(shifted) : Math.round(abs * 10 ** digits);
+  const unshifted = Number(`${rounded}e${-digits}`);
+  return sign * (Number.isFinite(unshifted) ? unshifted : rounded / 10 ** digits);
+}
+const MS_PER_DAY = 24 * 60 * 60 * 1e3;
+function dayDelta(from, to) {
+  const a = Date.UTC(from.getFullYear(), from.getMonth(), from.getDate());
+  const b = Date.UTC(to.getFullYear(), to.getMonth(), to.getDate());
+  return Math.round((b - a) / MS_PER_DAY);
+}
+function numericFold(name, args, fold) {
+  const numbers = [];
+  for (const arg of args) {
+    const n = toNumber(arg, name);
+    if (!n.ok) return n;
+    if (n.value === null) continue;
+    numbers.push(n.value);
+  }
+  if (numbers.length === 0) return EMPTY;
+  return ok(fold(numbers));
+}
+function unaryNumber(name, f) {
+  return (args) => {
+    const n = toNumber(args[0], name);
+    if (!n.ok || n.value === null) return n;
+    return ok(f(n.value));
+  };
+}
+function unaryText(f) {
+  return (args) => {
+    const s = toText(args[0]);
+    if (!s.ok || s.value === null) return s;
+    return ok(f(s.value));
+  };
+}
+function unaryDatePart(name, f) {
+  return (args) => {
+    const d = toDate(args[0], name);
+    if (!d.ok || d.value === null) return d;
+    return ok(f(d.value));
+  };
+}
+function unifyTypes(a, b) {
+  if (a === b) return a;
+  return "unknown";
+}
+const DEFS = [
+  // --- Logic -------------------------------------------------------------
+  {
+    name: "IF",
+    signature: "IF(condition, then, else)",
+    minArgs: 3,
+    maxArgs: 3,
+    argTypes: ["boolean", "unknown", "unknown"],
+    resultType: (types) => unifyTypes(types[1] ?? "unknown", types[2] ?? "unknown"),
+    lazy: true,
+    callLazy(args, rt) {
+      const cond = rt.evaluateNode(args[0]);
+      if (!cond.ok) return cond;
+      const asBool = toBoolean(cond.value, "condition");
+      if (!asBool.ok) return asBool;
+      return rt.evaluateNode(asBool.value === true ? args[1] : args[2]);
+    }
+  },
+  {
+    name: "IFERROR",
+    signature: "IFERROR(value, fallback)",
+    minArgs: 2,
+    maxArgs: 2,
+    argTypes: ["unknown", "unknown"],
+    resultType: (types) => unifyTypes(types[0] ?? "unknown", types[1] ?? "unknown"),
+    lazy: true,
+    callLazy(args, rt) {
+      const primary = rt.evaluateNode(args[0]);
+      if (primary.ok) return primary;
+      return rt.evaluateNode(args[1]);
+    }
+  },
+  {
+    name: "AND",
+    signature: "AND(a, b, \u2026)",
+    minArgs: 1,
+    maxArgs: Infinity,
+    argTypes: ["boolean"],
+    resultType: "boolean",
+    lazy: true,
+    callLazy(args, rt) {
+      for (const arg of args) {
+        const r = rt.evaluateNode(arg);
+        if (!r.ok) return r;
+        const b = toBoolean(r.value, "AND");
+        if (!b.ok) return b;
+        if (b.value === null) return EMPTY;
+        if (b.value === false) return ok(false);
+      }
+      return ok(true);
+    }
+  },
+  {
+    name: "OR",
+    signature: "OR(a, b, \u2026)",
+    minArgs: 1,
+    maxArgs: Infinity,
+    argTypes: ["boolean"],
+    resultType: "boolean",
+    lazy: true,
+    callLazy(args, rt) {
+      for (const arg of args) {
+        const r = rt.evaluateNode(arg);
+        if (!r.ok) return r;
+        const b = toBoolean(r.value, "OR");
+        if (!b.ok) return b;
+        if (b.value === null) return EMPTY;
+        if (b.value === true) return ok(true);
+      }
+      return ok(false);
+    }
+  },
+  {
+    name: "NOT",
+    signature: "NOT(value)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["boolean"],
+    resultType: "boolean",
+    call(args) {
+      const b = toBoolean(args[0], "NOT");
+      if (!b.ok || b.value === null) return b;
+      return ok(!b.value);
+    }
+  },
+  {
+    name: "IS_EMPTY",
+    signature: "IS_EMPTY(value)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["unknown"],
+    resultType: "boolean",
+    nullPolicy: "accept",
+    call(args) {
+      const v = args[0];
+      return ok(v === null || v === void 0 || v === "");
+    }
+  },
+  {
+    name: "COALESCE",
+    signature: "COALESCE(a, b, \u2026)",
+    minArgs: 1,
+    maxArgs: Infinity,
+    argTypes: ["unknown"],
+    resultType: (types) => types.reduce((acc, t) => unifyTypes(acc, t), types[0] ?? "unknown"),
+    nullPolicy: "accept",
+    call(args) {
+      for (const arg of args) {
+        if (arg !== null && arg !== "") return ok(arg);
+      }
+      return EMPTY;
+    }
+  },
+  // --- Maths -------------------------------------------------------------
+  {
+    name: "ABS",
+    signature: "ABS(number)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["number"],
+    resultType: "number",
+    call: unaryNumber("ABS", Math.abs)
+  },
+  {
+    name: "ROUND",
+    signature: "ROUND(number, digits)",
+    minArgs: 1,
+    maxArgs: 2,
+    argTypes: ["number", "number"],
+    resultType: "number",
+    call(args) {
+      const n = toNumber(args[0], "ROUND");
+      if (!n.ok || n.value === null) return n;
+      const dRaw = args.length > 1 ? toNumber(args[1], "ROUND") : ok(0);
+      if (!dRaw.ok) return dRaw;
+      const digits = dRaw.value === null ? 0 : Math.trunc(dRaw.value);
+      return ok(roundHalfAwayFromZero(n.value, digits));
+    }
+  },
+  {
+    name: "CEILING",
+    signature: "CEILING(number)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["number"],
+    resultType: "number",
+    call: unaryNumber("CEILING", Math.ceil)
+  },
+  {
+    name: "FLOOR",
+    signature: "FLOOR(number)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["number"],
+    resultType: "number",
+    call: unaryNumber("FLOOR", Math.floor)
+  },
+  {
+    name: "MIN",
+    signature: "MIN(a, b, \u2026)",
+    minArgs: 1,
+    maxArgs: Infinity,
+    argTypes: ["number"],
+    resultType: "number",
+    nullPolicy: "accept",
+    call: (args) => numericFold("MIN", args, (v) => Math.min(...v))
+  },
+  {
+    name: "MAX",
+    signature: "MAX(a, b, \u2026)",
+    minArgs: 1,
+    maxArgs: Infinity,
+    argTypes: ["number"],
+    resultType: "number",
+    nullPolicy: "accept",
+    call: (args) => numericFold("MAX", args, (v) => Math.max(...v))
+  },
+  {
+    name: "SUM",
+    signature: "SUM(a, b, \u2026)",
+    minArgs: 1,
+    maxArgs: Infinity,
+    argTypes: ["number"],
+    resultType: "number",
+    nullPolicy: "accept",
+    call: (args) => numericFold("SUM", args, (v) => v.reduce((a, b) => a + b, 0))
+  },
+  {
+    name: "AVERAGE",
+    signature: "AVERAGE(a, b, \u2026)",
+    minArgs: 1,
+    maxArgs: Infinity,
+    argTypes: ["number"],
+    resultType: "number",
+    nullPolicy: "accept",
+    call: (args) => numericFold("AVERAGE", args, (v) => v.reduce((a, b) => a + b, 0) / v.length)
+  },
+  {
+    name: "POWER",
+    signature: "POWER(base, exponent)",
+    minArgs: 2,
+    maxArgs: 2,
+    argTypes: ["number", "number"],
+    resultType: "number",
+    call(args) {
+      const base = toNumber(args[0], "POWER");
+      if (!base.ok || base.value === null) return base;
+      const exp = toNumber(args[1], "POWER");
+      if (!exp.ok || exp.value === null) return exp;
+      const result = base.value ** exp.value;
+      if (!Number.isFinite(result)) {
+        return fail("type_mismatch", "POWER is not a number", { name: "POWER" });
+      }
+      return ok(result);
+    }
+  },
+  {
+    name: "SQRT",
+    signature: "SQRT(number)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["number"],
+    resultType: "number",
+    call(args) {
+      const n = toNumber(args[0], "SQRT");
+      if (!n.ok || n.value === null) return n;
+      if (n.value < 0) {
+        return fail("type_mismatch", "SQRT is not a number", { name: "SQRT" });
+      }
+      return ok(Math.sqrt(n.value));
+    }
+  },
+  {
+    name: "MOD",
+    signature: "MOD(number, divisor)",
+    minArgs: 2,
+    maxArgs: 2,
+    argTypes: ["number", "number"],
+    resultType: "number",
+    call(args) {
+      const a = toNumber(args[0], "MOD");
+      if (!a.ok || a.value === null) return a;
+      const b = toNumber(args[1], "MOD");
+      if (!b.ok || b.value === null) return b;
+      if (b.value === 0) return fail("divide_by_zero", "Cannot divide by zero");
+      return ok(a.value % b.value);
+    }
+  },
+  // --- Text --------------------------------------------------------------
+  {
+    name: "CONCAT",
+    signature: "CONCAT(a, b, \u2026)",
+    minArgs: 1,
+    maxArgs: Infinity,
+    argTypes: ["unknown"],
+    resultType: "text",
+    nullPolicy: "accept",
+    call(args) {
+      let out = "";
+      for (const arg of args) {
+        if (arg === null) continue;
+        const s = toText(arg);
+        if (!s.ok) return s;
+        out += s.value === null ? "" : s.value;
+      }
+      return ok(out);
+    }
+  },
+  {
+    name: "UPPER",
+    signature: "UPPER(text)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["text"],
+    resultType: "text",
+    call: unaryText((s) => s.toUpperCase())
+  },
+  {
+    name: "LOWER",
+    signature: "LOWER(text)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["text"],
+    resultType: "text",
+    call: unaryText((s) => s.toLowerCase())
+  },
+  {
+    name: "TRIM",
+    signature: "TRIM(text)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["text"],
+    resultType: "text",
+    call: unaryText((s) => s.trim())
+  },
+  {
+    name: "LEN",
+    signature: "LEN(text)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["text"],
+    resultType: "number",
+    call: unaryText((s) => s.length)
+  },
+  {
+    name: "LEFT",
+    signature: "LEFT(text, count)",
+    minArgs: 2,
+    maxArgs: 2,
+    argTypes: ["text", "number"],
+    resultType: "text",
+    call(args) {
+      const s = toText(args[0]);
+      if (!s.ok || s.value === null) return s;
+      const n = toNumber(args[1], "LEFT");
+      if (!n.ok || n.value === null) return n;
+      return ok(s.value.slice(0, Math.max(0, Math.trunc(n.value))));
+    }
+  },
+  {
+    name: "RIGHT",
+    signature: "RIGHT(text, count)",
+    minArgs: 2,
+    maxArgs: 2,
+    argTypes: ["text", "number"],
+    resultType: "text",
+    call(args) {
+      const s = toText(args[0]);
+      if (!s.ok || s.value === null) return s;
+      const n = toNumber(args[1], "RIGHT");
+      if (!n.ok || n.value === null) return n;
+      const count = Math.max(0, Math.trunc(n.value));
+      return ok(count === 0 ? "" : s.value.slice(-count));
+    }
+  },
+  {
+    name: "CONTAINS",
+    signature: "CONTAINS(text, search)",
+    minArgs: 2,
+    maxArgs: 2,
+    argTypes: ["text", "text"],
+    resultType: "boolean",
+    call(args) {
+      const haystack = toText(args[0]);
+      if (!haystack.ok || haystack.value === null) return haystack;
+      const needle = toText(args[1]);
+      if (!needle.ok || needle.value === null) return needle;
+      return ok(
+        haystack.value.toLowerCase().includes(needle.value.toLowerCase())
+      );
+    }
+  },
+  {
+    name: "TEXT",
+    signature: "TEXT(value)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["unknown"],
+    resultType: "text",
+    call: (args) => toText(args[0])
+  },
+  {
+    name: "VALUE",
+    signature: "VALUE(text)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["unknown"],
+    resultType: "number",
+    call: (args) => toNumber(args[0], "VALUE")
+  },
+  // --- Dates -------------------------------------------------------------
+  {
+    name: "TODAY",
+    signature: "TODAY()",
+    minArgs: 0,
+    maxArgs: 0,
+    argTypes: [],
+    resultType: "date",
+    call(_args, rt) {
+      const now = rt.now();
+      return ok(new Date(now.getFullYear(), now.getMonth(), now.getDate()));
+    }
+  },
+  {
+    name: "DAYS_BETWEEN",
+    signature: "DAYS_BETWEEN(from, to)",
+    minArgs: 2,
+    maxArgs: 2,
+    argTypes: ["date", "date"],
+    resultType: "number",
+    call(args) {
+      const from = toDate(args[0], "DAYS_BETWEEN");
+      if (!from.ok || from.value === null) return from;
+      const to = toDate(args[1], "DAYS_BETWEEN");
+      if (!to.ok || to.value === null) return to;
+      return ok(dayDelta(from.value, to.value));
+    }
+  },
+  {
+    name: "DATE_ADD",
+    signature: "DATE_ADD(date, days)",
+    minArgs: 2,
+    maxArgs: 2,
+    argTypes: ["date", "number"],
+    resultType: "date",
+    call(args) {
+      const d = toDate(args[0], "DATE_ADD");
+      if (!d.ok || d.value === null) return d;
+      const n = toNumber(args[1], "DATE_ADD");
+      if (!n.ok || n.value === null) return n;
+      const base = d.value;
+      return ok(
+        new Date(base.getFullYear(), base.getMonth(), base.getDate() + Math.trunc(n.value))
+      );
+    }
+  },
+  {
+    name: "YEAR",
+    signature: "YEAR(date)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["date"],
+    resultType: "number",
+    call: unaryDatePart("YEAR", (d) => d.getFullYear())
+  },
+  {
+    name: "MONTH",
+    signature: "MONTH(date)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["date"],
+    resultType: "number",
+    call: unaryDatePart("MONTH", (d) => d.getMonth() + 1)
+  },
+  {
+    name: "DAY",
+    signature: "DAY(date)",
+    minArgs: 1,
+    maxArgs: 1,
+    argTypes: ["date"],
+    resultType: "number",
+    call: unaryDatePart("DAY", (d) => d.getDate())
+  }
+];
+const FORMULA_FUNCTIONS = Object.freeze(
+  DEFS.reduce((acc, def) => {
+    acc[def.name] = def;
+    return acc;
+  }, {})
+);
+const FORMULA_FUNCTION_NAMES = Object.freeze(
+  DEFS.map((d) => d.name).sort()
+);
+const FORMULA_FUNCTION_SIGNATURES = Object.freeze(DEFS.map((d) => ({ name: d.name, signature: d.signature })).sort((a, b) => a.name.localeCompare(b.name)));
+function lookupFormulaFunction(name) {
+  return FORMULA_FUNCTIONS[name.toUpperCase()];
+}
+function declaredArgType(def, index) {
+  if (def.argTypes.length === 0) return "unknown";
+  return def.argTypes[Math.min(index, def.argTypes.length - 1)];
+}
+function resolveResultType(def, argTypes) {
+  return typeof def.resultType === "function" ? def.resultType(argTypes) : def.resultType;
+}
+function asResultType(type) {
+  return type === "unknown" ? void 0 : type;
+}
+export {
+  EMPTY,
+  FORMULA_FUNCTIONS,
+  FORMULA_FUNCTION_NAMES,
+  FORMULA_FUNCTION_SIGNATURES,
+  asResultType,
+  declaredArgType,
+  fail,
+  lookupFormulaFunction,
+  ok,
+  resolveResultType,
+  roundHalfAwayFromZero,
+  toBoolean,
+  toDate,
+  toNumber,
+  toText,
+  unifyTypes
+};
+//# sourceMappingURL=functions.js.map

package/dist/backend/dynamic-table/formula/functions.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/backend/dynamic-table/formula/functions.ts"],
+  "sourcesContent": ["// formula/functions.ts\n//\n// The curated function library. Every entry is total, side-effect free and\n// deterministic given `FormulaRuntime.now()` \u2014 there is no I/O, no host reach\n// and no way for a function to observe anything outside the row it is given.\n//\n// The set is grounded in the freight cases the spec names: margin, cost per\n// unit, days between dates, conditional surcharge. Where Excel has an\n// established name and behaviour, that name and behaviour is used verbatim;\n// where it does not (`DAYS_BETWEEN`, `IS_EMPTY`), the name says what it does.\n//\n// This module imports nothing but `./types`, which is what keeps the\n// evaluator \u2194 library edge acyclic: the evaluator hands each function a\n// `FormulaRuntime` rather than the library importing the evaluator.\n\nimport type {\n  FormulaAst,\n  FormulaErrorCode,\n  FormulaIssue,\n  FormulaResultType,\n  FormulaValue,\n  FormulaValueType,\n} from './types';\nimport { formulaIssue } from './types';\n\n/** Success or failure of one evaluation step. Never a thrown exception. */\nexport type EvalOutcome =\n  | { ok: true; value: FormulaValue }\n  | { ok: false; issue: FormulaIssue };\n\nexport function ok(value: FormulaValue): EvalOutcome {\n  return { ok: true, value };\n}\n\nexport function fail(\n  code: FormulaErrorCode,\n  message: string,\n  params?: Record<string, string | number>,\n): EvalOutcome {\n  return { ok: false, issue: formulaIssue(code, message, params) };\n}\n\n/** The empty value. A null input yields empty \u2014 never `0`, never `NaN`. */\nexport const EMPTY: EvalOutcome = { ok: true, value: null };\n\n/**\n * What the evaluator lends to a function: the ability to evaluate an\n * un-evaluated argument (lazy functions only) and a clock (so `TODAY()` is\n * testable).\n */\nexport interface FormulaRuntime {\n  evaluateNode(node: FormulaAst): EvalOutcome;\n  now(): Date;\n}\n\nexport interface FormulaFunctionDef {\n  name: string;\n  minArgs: number;\n  /** `Infinity` for variadic functions. */\n  maxArgs: number;\n  /**\n   * Declared argument types for the checker. The LAST entry repeats for every\n   * further argument of a variadic function.\n   */\n  argTypes: FormulaValueType[];\n  /** Result type, or a rule over the actual argument types. */\n  resultType: FormulaValueType | ((argTypes: FormulaValueType[]) => FormulaValueType);\n  /**\n   * `propagate` (default): a null argument short-circuits the whole call to\n   * empty. `accept`: nulls reach the implementation, which decides \u2014 SUM\n   * ignores blanks, COALESCE is entirely about them.\n   */\n  nullPolicy?: 'propagate' | 'accept';\n  /** Lazy functions receive UNEVALUATED arguments (IF, IFERROR, AND, OR). */\n  lazy?: boolean;\n  call?(args: FormulaValue[], rt: FormulaRuntime): EvalOutcome;\n  callLazy?(args: FormulaAst[], rt: FormulaRuntime): EvalOutcome;\n  /** One-line description, shown in the editor's function list. */\n  signature: string;\n}\n\n// ============================================\n// COERCIONS\n// ============================================\n\nconst ISO_DATE = /^\\d{4}-\\d{2}-\\d{2}(?:[T ]|$)/;\nconst DATE_ONLY = /^(\\d{4})-(\\d{2})-(\\d{2})$/;\n\n/**\n * Coerce to a number. A numeric *string* is accepted because the API commonly\n * returns money as a string; anything else is an honest `type_mismatch` rather\n * than a silent `NaN`.\n */\nexport function toNumber(value: FormulaValue, what = 'value'): EvalOutcome {\n  if (value === null) return EMPTY;\n  if (typeof value === 'number') {\n    if (Number.isNaN(value)) return fail('type_mismatch', `${what} is not a number`, { name: what });\n    return ok(value);\n  }\n  if (typeof value === 'boolean') return ok(value ? 1 : 0);\n  if (typeof value === 'string') {\n    const trimmed = value.trim();\n    if (!trimmed) return EMPTY;\n    const n = Number(trimmed);\n    if (Number.isNaN(n)) return fail('type_mismatch', `${what} is not a number`, { name: what });\n    return ok(n);\n  }\n  return fail('type_mismatch', `${what} is not a number`, { name: what });\n}\n\n/** Coerce to text. Dates render as `YYYY-MM-DD` so `&` never leaks a locale. */\nexport function toText(value: FormulaValue): EvalOutcome {\n  if (value === null) return EMPTY;\n  if (value instanceof Date) return ok(formatDate(value));\n  return ok(String(value));\n}\n\n/** Coerce to boolean. `'true'`/`'false'` are accepted; other text is a mismatch. */\nexport function toBoolean(value: FormulaValue, what = 'value'): EvalOutcome {\n  if (value === null) return EMPTY;\n  if (typeof value === 'boolean') return ok(value);\n  if (typeof value === 'number') return ok(value !== 0);\n  if (typeof value === 'string') {\n    const lowered = value.trim().toLowerCase();\n    if (!lowered) return EMPTY;\n    if (lowered === 'true' || lowered === '1') return ok(true);\n    if (lowered === 'false' || lowered === '0') return ok(false);\n  }\n  return fail('type_mismatch', `${what} is not a true/false value`, { name: what });\n}\n\n/** Coerce to a Date. ISO strings only \u2014 no locale guessing, ever. */\nexport function toDate(value: FormulaValue, what = 'value'): EvalOutcome {\n  if (value === null) return EMPTY;\n  if (value instanceof Date) {\n    if (Number.isNaN(value.getTime())) {\n      return fail('type_mismatch', `${what} is not a date`, { name: what });\n    }\n    return ok(value);\n  }\n  if (typeof value === 'string') {\n    const trimmed = value.trim();\n    if (!trimmed) return EMPTY;\n    if (!ISO_DATE.test(trimmed)) return fail('type_mismatch', `${what} is not a date`, { name: what });\n    // A date-only string is a LOCAL calendar date. `new Date('2026-01-25')`\n    // would read it as UTC midnight, which is the previous day in every\n    // timezone west of Greenwich \u2014 the classic off-by-one that makes\n    // DAYS_BETWEEN wrong for half the world.\n    const dateOnly = DATE_ONLY.exec(trimmed);\n    const d = dateOnly\n      ? new Date(Number(dateOnly[1]), Number(dateOnly[2]) - 1, Number(dateOnly[3]))\n      : new Date(trimmed);\n    if (Number.isNaN(d.getTime())) return fail('type_mismatch', `${what} is not a date`, { name: what });\n    return ok(d);\n  }\n  return fail('type_mismatch', `${what} is not a date`, { name: what });\n}\n\nfunction formatDate(d: Date): string {\n  const pad = (n: number) => String(n).padStart(2, '0');\n  return `${d.getFullYear()}-${pad(d.getMonth() + 1)}-${pad(d.getDate())}`;\n}\n\n/**\n * Round half AWAY FROM ZERO, which is what Excel does and what an accountant\n * expects \u2014 JS `Math.round` rounds half UP, so `-2.5` would become `-2`.\n *\n * The shift is done through the exponent in the string form rather than by\n * multiplying: `1.005 * 100` is `100.49999999999999`, so a naive implementation\n * rounds a price DOWN by a grosz and nobody notices until the invoice does not\n * reconcile.\n */\nexport function roundHalfAwayFromZero(value: number, digits: number): number {\n  const sign = value < 0 ? -1 : 1;\n  const abs = Math.abs(value);\n  const shifted = Number(`${abs}e${digits}`);\n  const rounded = Number.isFinite(shifted)\n    ? Math.round(shifted)\n    : Math.round(abs * 10 ** digits);\n  const unshifted = Number(`${rounded}e${-digits}`);\n  return sign * (Number.isFinite(unshifted) ? unshifted : rounded / 10 ** digits);\n}\n\nconst MS_PER_DAY = 24 * 60 * 60 * 1000;\n\n/** Whole days between two dates, ignoring the time of day. */\nfunction dayDelta(from: Date, to: Date): number {\n  const a = Date.UTC(from.getFullYear(), from.getMonth(), from.getDate());\n  const b = Date.UTC(to.getFullYear(), to.getMonth(), to.getDate());\n  return Math.round((b - a) / MS_PER_DAY);\n}\n\n// ============================================\n// HELPERS FOR THE REGISTRY\n// ============================================\n\n/** Fold a variadic numeric function, skipping blanks the way Excel does. */\nfunction numericFold(\n  name: string,\n  args: FormulaValue[],\n  fold: (values: number[]) => number,\n): EvalOutcome {\n  const numbers: number[] = [];\n  for (const arg of args) {\n    const n = toNumber(arg, name);\n    if (!n.ok) return n;\n    if (n.value === null) continue; // blanks are skipped, not zeroed\n    numbers.push(n.value as number);\n  }\n  if (numbers.length === 0) return EMPTY;\n  return ok(fold(numbers));\n}\n\nfunction unaryNumber(name: string, f: (n: number) => number) {\n  return (args: FormulaValue[]): EvalOutcome => {\n    const n = toNumber(args[0], name);\n    if (!n.ok || n.value === null) return n;\n    return ok(f(n.value as number));\n  };\n}\n\nfunction unaryText(f: (s: string) => string | number) {\n  return (args: FormulaValue[]): EvalOutcome => {\n    const s = toText(args[0]);\n    if (!s.ok || s.value === null) return s;\n    return ok(f(s.value as string));\n  };\n}\n\nfunction unaryDatePart(name: string, f: (d: Date) => number) {\n  return (args: FormulaValue[]): EvalOutcome => {\n    const d = toDate(args[0], name);\n    if (!d.ok || d.value === null) return d;\n    return ok(f(d.value as Date));\n  };\n}\n\n/** The widest of two checker types; `unknown` absorbs everything. */\nexport function unifyTypes(a: FormulaValueType, b: FormulaValueType): FormulaValueType {\n  if (a === b) return a;\n  return 'unknown';\n}\n\n// ============================================\n// THE LIBRARY\n// ============================================\n\nconst DEFS: FormulaFunctionDef[] = [\n  // --- Logic -------------------------------------------------------------\n  {\n    name: 'IF',\n    signature: 'IF(condition, then, else)',\n    minArgs: 3,\n    maxArgs: 3,\n    argTypes: ['boolean', 'unknown', 'unknown'],\n    resultType: (types) => unifyTypes(types[1] ?? 'unknown', types[2] ?? 'unknown'),\n    lazy: true,\n    callLazy(args, rt) {\n      const cond = rt.evaluateNode(args[0]);\n      if (!cond.ok) return cond;\n      const asBool = toBoolean(cond.value, 'condition');\n      if (!asBool.ok) return asBool;\n      // A blank condition takes the else branch \u2014 the same reading as Excel,\n      // where a blank cell is falsey.\n      return rt.evaluateNode(asBool.value === true ? args[1] : args[2]);\n    },\n  },\n  {\n    name: 'IFERROR',\n    signature: 'IFERROR(value, fallback)',\n    minArgs: 2,\n    maxArgs: 2,\n    argTypes: ['unknown', 'unknown'],\n    resultType: (types) => unifyTypes(types[0] ?? 'unknown', types[1] ?? 'unknown'),\n    lazy: true,\n    callLazy(args, rt) {\n      const primary = rt.evaluateNode(args[0]);\n      if (primary.ok) return primary;\n      return rt.evaluateNode(args[1]);\n    },\n  },\n  {\n    name: 'AND',\n    signature: 'AND(a, b, \u2026)',\n    minArgs: 1,\n    maxArgs: Infinity,\n    argTypes: ['boolean'],\n    resultType: 'boolean',\n    lazy: true,\n    callLazy(args, rt) {\n      for (const arg of args) {\n        const r = rt.evaluateNode(arg);\n        if (!r.ok) return r;\n        const b = toBoolean(r.value, 'AND');\n        if (!b.ok) return b;\n        if (b.value === null) return EMPTY;\n        if (b.value === false) return ok(false); // short-circuit\n      }\n      return ok(true);\n    },\n  },\n  {\n    name: 'OR',\n    signature: 'OR(a, b, \u2026)',\n    minArgs: 1,\n    maxArgs: Infinity,\n    argTypes: ['boolean'],\n    resultType: 'boolean',\n    lazy: true,\n    callLazy(args, rt) {\n      for (const arg of args) {\n        const r = rt.evaluateNode(arg);\n        if (!r.ok) return r;\n        const b = toBoolean(r.value, 'OR');\n        if (!b.ok) return b;\n        if (b.value === null) return EMPTY;\n        if (b.value === true) return ok(true); // short-circuit\n      }\n      return ok(false);\n    },\n  },\n  {\n    name: 'NOT',\n    signature: 'NOT(value)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['boolean'],\n    resultType: 'boolean',\n    call(args) {\n      const b = toBoolean(args[0], 'NOT');\n      if (!b.ok || b.value === null) return b;\n      return ok(!(b.value as boolean));\n    },\n  },\n  {\n    name: 'IS_EMPTY',\n    signature: 'IS_EMPTY(value)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['unknown'],\n    resultType: 'boolean',\n    nullPolicy: 'accept',\n    call(args) {\n      const v = args[0];\n      return ok(v === null || v === undefined || v === '');\n    },\n  },\n  {\n    name: 'COALESCE',\n    signature: 'COALESCE(a, b, \u2026)',\n    minArgs: 1,\n    maxArgs: Infinity,\n    argTypes: ['unknown'],\n    resultType: (types) => types.reduce<FormulaValueType>((acc, t) => unifyTypes(acc, t), types[0] ?? 'unknown'),\n    nullPolicy: 'accept',\n    call(args) {\n      for (const arg of args) {\n        if (arg !== null && arg !== '') return ok(arg);\n      }\n      return EMPTY;\n    },\n  },\n\n  // --- Maths -------------------------------------------------------------\n  {\n    name: 'ABS',\n    signature: 'ABS(number)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['number'],\n    resultType: 'number',\n    call: unaryNumber('ABS', Math.abs),\n  },\n  {\n    name: 'ROUND',\n    signature: 'ROUND(number, digits)',\n    minArgs: 1,\n    maxArgs: 2,\n    argTypes: ['number', 'number'],\n    resultType: 'number',\n    call(args) {\n      const n = toNumber(args[0], 'ROUND');\n      if (!n.ok || n.value === null) return n;\n      const dRaw = args.length > 1 ? toNumber(args[1], 'ROUND') : ok(0);\n      if (!dRaw.ok) return dRaw;\n      const digits = dRaw.value === null ? 0 : Math.trunc(dRaw.value as number);\n      return ok(roundHalfAwayFromZero(n.value as number, digits));\n    },\n  },\n  {\n    name: 'CEILING',\n    signature: 'CEILING(number)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['number'],\n    resultType: 'number',\n    call: unaryNumber('CEILING', Math.ceil),\n  },\n  {\n    name: 'FLOOR',\n    signature: 'FLOOR(number)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['number'],\n    resultType: 'number',\n    call: unaryNumber('FLOOR', Math.floor),\n  },\n  {\n    name: 'MIN',\n    signature: 'MIN(a, b, \u2026)',\n    minArgs: 1,\n    maxArgs: Infinity,\n    argTypes: ['number'],\n    resultType: 'number',\n    nullPolicy: 'accept',\n    call: (args) => numericFold('MIN', args, (v) => Math.min(...v)),\n  },\n  {\n    name: 'MAX',\n    signature: 'MAX(a, b, \u2026)',\n    minArgs: 1,\n    maxArgs: Infinity,\n    argTypes: ['number'],\n    resultType: 'number',\n    nullPolicy: 'accept',\n    call: (args) => numericFold('MAX', args, (v) => Math.max(...v)),\n  },\n  {\n    name: 'SUM',\n    signature: 'SUM(a, b, \u2026)',\n    minArgs: 1,\n    maxArgs: Infinity,\n    argTypes: ['number'],\n    resultType: 'number',\n    nullPolicy: 'accept',\n    call: (args) => numericFold('SUM', args, (v) => v.reduce((a, b) => a + b, 0)),\n  },\n  {\n    name: 'AVERAGE',\n    signature: 'AVERAGE(a, b, \u2026)',\n    minArgs: 1,\n    maxArgs: Infinity,\n    argTypes: ['number'],\n    resultType: 'number',\n    nullPolicy: 'accept',\n    call: (args) => numericFold('AVERAGE', args, (v) => v.reduce((a, b) => a + b, 0) / v.length),\n  },\n  {\n    name: 'POWER',\n    signature: 'POWER(base, exponent)',\n    minArgs: 2,\n    maxArgs: 2,\n    argTypes: ['number', 'number'],\n    resultType: 'number',\n    call(args) {\n      const base = toNumber(args[0], 'POWER');\n      if (!base.ok || base.value === null) return base;\n      const exp = toNumber(args[1], 'POWER');\n      if (!exp.ok || exp.value === null) return exp;\n      const result = (base.value as number) ** (exp.value as number);\n      if (!Number.isFinite(result)) {\n        return fail('type_mismatch', 'POWER is not a number', { name: 'POWER' });\n      }\n      return ok(result);\n    },\n  },\n  {\n    name: 'SQRT',\n    signature: 'SQRT(number)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['number'],\n    resultType: 'number',\n    call(args) {\n      const n = toNumber(args[0], 'SQRT');\n      if (!n.ok || n.value === null) return n;\n      if ((n.value as number) < 0) {\n        return fail('type_mismatch', 'SQRT is not a number', { name: 'SQRT' });\n      }\n      return ok(Math.sqrt(n.value as number));\n    },\n  },\n  {\n    name: 'MOD',\n    signature: 'MOD(number, divisor)',\n    minArgs: 2,\n    maxArgs: 2,\n    argTypes: ['number', 'number'],\n    resultType: 'number',\n    call(args) {\n      const a = toNumber(args[0], 'MOD');\n      if (!a.ok || a.value === null) return a;\n      const b = toNumber(args[1], 'MOD');\n      if (!b.ok || b.value === null) return b;\n      if (b.value === 0) return fail('divide_by_zero', 'Cannot divide by zero');\n      return ok((a.value as number) % (b.value as number));\n    },\n  },\n\n  // --- Text --------------------------------------------------------------\n  {\n    name: 'CONCAT',\n    signature: 'CONCAT(a, b, \u2026)',\n    minArgs: 1,\n    maxArgs: Infinity,\n    argTypes: ['unknown'],\n    resultType: 'text',\n    nullPolicy: 'accept',\n    call(args) {\n      let out = '';\n      for (const arg of args) {\n        if (arg === null) continue; // blanks contribute nothing, as in Excel\n        const s = toText(arg);\n        if (!s.ok) return s;\n        out += s.value === null ? '' : (s.value as string);\n      }\n      return ok(out);\n    },\n  },\n  {\n    name: 'UPPER',\n    signature: 'UPPER(text)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['text'],\n    resultType: 'text',\n    call: unaryText((s) => s.toUpperCase()),\n  },\n  {\n    name: 'LOWER',\n    signature: 'LOWER(text)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['text'],\n    resultType: 'text',\n    call: unaryText((s) => s.toLowerCase()),\n  },\n  {\n    name: 'TRIM',\n    signature: 'TRIM(text)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['text'],\n    resultType: 'text',\n    call: unaryText((s) => s.trim()),\n  },\n  {\n    name: 'LEN',\n    signature: 'LEN(text)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['text'],\n    resultType: 'number',\n    call: unaryText((s) => s.length),\n  },\n  {\n    name: 'LEFT',\n    signature: 'LEFT(text, count)',\n    minArgs: 2,\n    maxArgs: 2,\n    argTypes: ['text', 'number'],\n    resultType: 'text',\n    call(args) {\n      const s = toText(args[0]);\n      if (!s.ok || s.value === null) return s;\n      const n = toNumber(args[1], 'LEFT');\n      if (!n.ok || n.value === null) return n;\n      return ok((s.value as string).slice(0, Math.max(0, Math.trunc(n.value as number))));\n    },\n  },\n  {\n    name: 'RIGHT',\n    signature: 'RIGHT(text, count)',\n    minArgs: 2,\n    maxArgs: 2,\n    argTypes: ['text', 'number'],\n    resultType: 'text',\n    call(args) {\n      const s = toText(args[0]);\n      if (!s.ok || s.value === null) return s;\n      const n = toNumber(args[1], 'RIGHT');\n      if (!n.ok || n.value === null) return n;\n      const count = Math.max(0, Math.trunc(n.value as number));\n      return ok(count === 0 ? '' : (s.value as string).slice(-count));\n    },\n  },\n  {\n    name: 'CONTAINS',\n    signature: 'CONTAINS(text, search)',\n    minArgs: 2,\n    maxArgs: 2,\n    argTypes: ['text', 'text'],\n    resultType: 'boolean',\n    call(args) {\n      const haystack = toText(args[0]);\n      if (!haystack.ok || haystack.value === null) return haystack;\n      const needle = toText(args[1]);\n      if (!needle.ok || needle.value === null) return needle;\n      return ok(\n        (haystack.value as string).toLowerCase().includes((needle.value as string).toLowerCase()),\n      );\n    },\n  },\n  {\n    name: 'TEXT',\n    signature: 'TEXT(value)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['unknown'],\n    resultType: 'text',\n    call: (args) => toText(args[0]),\n  },\n  {\n    name: 'VALUE',\n    signature: 'VALUE(text)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['unknown'],\n    resultType: 'number',\n    call: (args) => toNumber(args[0], 'VALUE'),\n  },\n\n  // --- Dates -------------------------------------------------------------\n  {\n    name: 'TODAY',\n    signature: 'TODAY()',\n    minArgs: 0,\n    maxArgs: 0,\n    argTypes: [],\n    resultType: 'date',\n    call(_args, rt) {\n      const now = rt.now();\n      return ok(new Date(now.getFullYear(), now.getMonth(), now.getDate()));\n    },\n  },\n  {\n    name: 'DAYS_BETWEEN',\n    signature: 'DAYS_BETWEEN(from, to)',\n    minArgs: 2,\n    maxArgs: 2,\n    argTypes: ['date', 'date'],\n    resultType: 'number',\n    call(args) {\n      const from = toDate(args[0], 'DAYS_BETWEEN');\n      if (!from.ok || from.value === null) return from;\n      const to = toDate(args[1], 'DAYS_BETWEEN');\n      if (!to.ok || to.value === null) return to;\n      return ok(dayDelta(from.value as Date, to.value as Date));\n    },\n  },\n  {\n    name: 'DATE_ADD',\n    signature: 'DATE_ADD(date, days)',\n    minArgs: 2,\n    maxArgs: 2,\n    argTypes: ['date', 'number'],\n    resultType: 'date',\n    call(args) {\n      const d = toDate(args[0], 'DATE_ADD');\n      if (!d.ok || d.value === null) return d;\n      const n = toNumber(args[1], 'DATE_ADD');\n      if (!n.ok || n.value === null) return n;\n      const base = d.value as Date;\n      return ok(\n        new Date(base.getFullYear(), base.getMonth(), base.getDate() + Math.trunc(n.value as number)),\n      );\n    },\n  },\n  {\n    name: 'YEAR',\n    signature: 'YEAR(date)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['date'],\n    resultType: 'number',\n    call: unaryDatePart('YEAR', (d) => d.getFullYear()),\n  },\n  {\n    name: 'MONTH',\n    signature: 'MONTH(date)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['date'],\n    resultType: 'number',\n    call: unaryDatePart('MONTH', (d) => d.getMonth() + 1),\n  },\n  {\n    name: 'DAY',\n    signature: 'DAY(date)',\n    minArgs: 1,\n    maxArgs: 1,\n    argTypes: ['date'],\n    resultType: 'number',\n    call: unaryDatePart('DAY', (d) => d.getDate()),\n  },\n];\n\n/** Name \u2192 definition. Names are canonical upper-case. */\nexport const FORMULA_FUNCTIONS: Readonly<Record<string, FormulaFunctionDef>> = Object.freeze(\n  DEFS.reduce<Record<string, FormulaFunctionDef>>((acc, def) => {\n    acc[def.name] = def;\n    return acc;\n  }, {}),\n);\n\n/** Every function name, sorted \u2014 the editor's \"Available functions\" list. */\nexport const FORMULA_FUNCTION_NAMES: readonly string[] = Object.freeze(\n  DEFS.map((d) => d.name).sort(),\n);\n\n/** Signatures in list order, for the editor. */\nexport const FORMULA_FUNCTION_SIGNATURES: readonly { name: string; signature: string }[] =\n  Object.freeze(DEFS.map((d) => ({ name: d.name, signature: d.signature })).sort((a, b) => a.name.localeCompare(b.name)));\n\n/** Case-insensitive lookup \u2014 users type `if(...)` as often as `IF(...)`. */\nexport function lookupFormulaFunction(name: string): FormulaFunctionDef | undefined {\n  return FORMULA_FUNCTIONS[name.toUpperCase()];\n}\n\n/** The declared type of argument `index`, honouring variadic repetition. */\nexport function declaredArgType(def: FormulaFunctionDef, index: number): FormulaValueType {\n  if (def.argTypes.length === 0) return 'unknown';\n  return def.argTypes[Math.min(index, def.argTypes.length - 1)];\n}\n\n/** The function's result type given the checker's view of its arguments. */\nexport function resolveResultType(\n  def: FormulaFunctionDef,\n  argTypes: FormulaValueType[],\n): FormulaValueType {\n  return typeof def.resultType === 'function' ? def.resultType(argTypes) : def.resultType;\n}\n\n/** Narrow a checker type to the four persistable result types. */\nexport function asResultType(type: FormulaValueType): FormulaResultType | undefined {\n  return type === 'unknown' ? undefined : type;\n}\n"],
+  "mappings": "AAuBA,SAAS,oBAAoB;AAOtB,SAAS,GAAG,OAAkC;AACnD,SAAO,EAAE,IAAI,MAAM,MAAM;AAC3B;AAEO,SAAS,KACd,MACA,SACA,QACa;AACb,SAAO,EAAE,IAAI,OAAO,OAAO,aAAa,MAAM,SAAS,MAAM,EAAE;AACjE;AAGO,MAAM,QAAqB,EAAE,IAAI,MAAM,OAAO,KAAK;AA0C1D,MAAM,WAAW;AACjB,MAAM,YAAY;AAOX,SAAS,SAAS,OAAqB,OAAO,SAAsB;AACzE,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,OAAO,MAAM,KAAK,EAAG,QAAO,KAAK,iBAAiB,GAAG,IAAI,oBAAoB,EAAE,MAAM,KAAK,CAAC;AAC/F,WAAO,GAAG,KAAK;AAAA,EACjB;AACA,MAAI,OAAO,UAAU,UAAW,QAAO,GAAG,QAAQ,IAAI,CAAC;AACvD,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,CAAC,QAAS,QAAO;AACrB,UAAM,IAAI,OAAO,OAAO;AACxB,QAAI,OAAO,MAAM,CAAC,EAAG,QAAO,KAAK,iBAAiB,GAAG,IAAI,oBAAoB,EAAE,MAAM,KAAK,CAAC;AAC3F,WAAO,GAAG,CAAC;AAAA,EACb;AACA,SAAO,KAAK,iBAAiB,GAAG,IAAI,oBAAoB,EAAE,MAAM,KAAK,CAAC;AACxE;AAGO,SAAS,OAAO,OAAkC;AACvD,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,iBAAiB,KAAM,QAAO,GAAG,WAAW,KAAK,CAAC;AACtD,SAAO,GAAG,OAAO,KAAK,CAAC;AACzB;AAGO,SAAS,UAAU,OAAqB,OAAO,SAAsB;AAC1E,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,OAAO,UAAU,UAAW,QAAO,GAAG,KAAK;AAC/C,MAAI,OAAO,UAAU,SAAU,QAAO,GAAG,UAAU,CAAC;AACpD,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,UAAU,MAAM,KAAK,EAAE,YAAY;AACzC,QAAI,CAAC,QAAS,QAAO;AACrB,QAAI,YAAY,UAAU,YAAY,IAAK,QAAO,GAAG,IAAI;AACzD,QAAI,YAAY,WAAW,YAAY,IAAK,QAAO,GAAG,KAAK;AAAA,EAC7D;AACA,SAAO,KAAK,iBAAiB,GAAG,IAAI,8BAA8B,EAAE,MAAM,KAAK,CAAC;AAClF;AAGO,SAAS,OAAO,OAAqB,OAAO,SAAsB;AACvE,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,iBAAiB,MAAM;AACzB,QAAI,OAAO,MAAM,MAAM,QAAQ,CAAC,GAAG;AACjC,aAAO,KAAK,iBAAiB,GAAG,IAAI,kBAAkB,EAAE,MAAM,KAAK,CAAC;AAAA,IACtE;AACA,WAAO,GAAG,KAAK;AAAA,EACjB;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,CAAC,QAAS,QAAO;AACrB,QAAI,CAAC,SAAS,KAAK,OAAO,EAAG,QAAO,KAAK,iBAAiB,GAAG,IAAI,kBAAkB,EAAE,MAAM,KAAK,CAAC;AAKjG,UAAM,WAAW,UAAU,KAAK,OAAO;AACvC,UAAM,IAAI,WACN,IAAI,KAAK,OAAO,SAAS,CAAC,CAAC,GAAG,OAAO,SAAS,CAAC,CAAC,IAAI,GAAG,OAAO,SAAS,CAAC,CAAC,CAAC,IAC1E,IAAI,KAAK,OAAO;AACpB,QAAI,OAAO,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO,KAAK,iBAAiB,GAAG,IAAI,kBAAkB,EAAE,MAAM,KAAK,CAAC;AACnG,WAAO,GAAG,CAAC;AAAA,EACb;AACA,SAAO,KAAK,iBAAiB,GAAG,IAAI,kBAAkB,EAAE,MAAM,KAAK,CAAC;AACtE;AAEA,SAAS,WAAW,GAAiB;AACnC,QAAM,MAAM,CAAC,MAAc,OAAO,CAAC,EAAE,SAAS,GAAG,GAAG;AACpD,SAAO,GAAG,EAAE,YAAY,CAAC,IAAI,IAAI,EAAE,SAAS,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE,QAAQ,CAAC,CAAC;AACxE;AAWO,SAAS,sBAAsB,OAAe,QAAwB;AAC3E,QAAM,OAAO,QAAQ,IAAI,KAAK;AAC9B,QAAM,MAAM,KAAK,IAAI,KAAK;AAC1B,QAAM,UAAU,OAAO,GAAG,GAAG,IAAI,MAAM,EAAE;AACzC,QAAM,UAAU,OAAO,SAAS,OAAO,IACnC,KAAK,MAAM,OAAO,IAClB,KAAK,MAAM,MAAM,MAAM,MAAM;AACjC,QAAM,YAAY,OAAO,GAAG,OAAO,IAAI,CAAC,MAAM,EAAE;AAChD,SAAO,QAAQ,OAAO,SAAS,SAAS,IAAI,YAAY,UAAU,MAAM;AAC1E;AAEA,MAAM,aAAa,KAAK,KAAK,KAAK;AAGlC,SAAS,SAAS,MAAY,IAAkB;AAC9C,QAAM,IAAI,KAAK,IAAI,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,KAAK,QAAQ,CAAC;AACtE,QAAM,IAAI,KAAK,IAAI,GAAG,YAAY,GAAG,GAAG,SAAS,GAAG,GAAG,QAAQ,CAAC;AAChE,SAAO,KAAK,OAAO,IAAI,KAAK,UAAU;AACxC;AAOA,SAAS,YACP,MACA,MACA,MACa;AACb,QAAM,UAAoB,CAAC;AAC3B,aAAW,OAAO,MAAM;AACtB,UAAM,IAAI,SAAS,KAAK,IAAI;AAC5B,QAAI,CAAC,EAAE,GAAI,QAAO;AAClB,QAAI,EAAE,UAAU,KAAM;AACtB,YAAQ,KAAK,EAAE,KAAe;AAAA,EAChC;AACA,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,SAAO,GAAG,KAAK,OAAO,CAAC;AACzB;AAEA,SAAS,YAAY,MAAc,GAA0B;AAC3D,SAAO,CAAC,SAAsC;AAC5C,UAAM,IAAI,SAAS,KAAK,CAAC,GAAG,IAAI;AAChC,QAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,WAAO,GAAG,EAAE,EAAE,KAAe,CAAC;AAAA,EAChC;AACF;AAEA,SAAS,UAAU,GAAmC;AACpD,SAAO,CAAC,SAAsC;AAC5C,UAAM,IAAI,OAAO,KAAK,CAAC,CAAC;AACxB,QAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,WAAO,GAAG,EAAE,EAAE,KAAe,CAAC;AAAA,EAChC;AACF;AAEA,SAAS,cAAc,MAAc,GAAwB;AAC3D,SAAO,CAAC,SAAsC;AAC5C,UAAM,IAAI,OAAO,KAAK,CAAC,GAAG,IAAI;AAC9B,QAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,WAAO,GAAG,EAAE,EAAE,KAAa,CAAC;AAAA,EAC9B;AACF;AAGO,SAAS,WAAW,GAAqB,GAAuC;AACrF,MAAI,MAAM,EAAG,QAAO;AACpB,SAAO;AACT;AAMA,MAAM,OAA6B;AAAA;AAAA,EAEjC;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,WAAW,WAAW,SAAS;AAAA,IAC1C,YAAY,CAAC,UAAU,WAAW,MAAM,CAAC,KAAK,WAAW,MAAM,CAAC,KAAK,SAAS;AAAA,IAC9E,MAAM;AAAA,IACN,SAAS,MAAM,IAAI;AACjB,YAAM,OAAO,GAAG,aAAa,KAAK,CAAC,CAAC;AACpC,UAAI,CAAC,KAAK,GAAI,QAAO;AACrB,YAAM,SAAS,UAAU,KAAK,OAAO,WAAW;AAChD,UAAI,CAAC,OAAO,GAAI,QAAO;AAGvB,aAAO,GAAG,aAAa,OAAO,UAAU,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;AAAA,IAClE;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,WAAW,SAAS;AAAA,IAC/B,YAAY,CAAC,UAAU,WAAW,MAAM,CAAC,KAAK,WAAW,MAAM,CAAC,KAAK,SAAS;AAAA,IAC9E,MAAM;AAAA,IACN,SAAS,MAAM,IAAI;AACjB,YAAM,UAAU,GAAG,aAAa,KAAK,CAAC,CAAC;AACvC,UAAI,QAAQ,GAAI,QAAO;AACvB,aAAO,GAAG,aAAa,KAAK,CAAC,CAAC;AAAA,IAChC;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,SAAS;AAAA,IACpB,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,SAAS,MAAM,IAAI;AACjB,iBAAW,OAAO,MAAM;AACtB,cAAM,IAAI,GAAG,aAAa,GAAG;AAC7B,YAAI,CAAC,EAAE,GAAI,QAAO;AAClB,cAAM,IAAI,UAAU,EAAE,OAAO,KAAK;AAClC,YAAI,CAAC,EAAE,GAAI,QAAO;AAClB,YAAI,EAAE,UAAU,KAAM,QAAO;AAC7B,YAAI,EAAE,UAAU,MAAO,QAAO,GAAG,KAAK;AAAA,MACxC;AACA,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,SAAS;AAAA,IACpB,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,SAAS,MAAM,IAAI;AACjB,iBAAW,OAAO,MAAM;AACtB,cAAM,IAAI,GAAG,aAAa,GAAG;AAC7B,YAAI,CAAC,EAAE,GAAI,QAAO;AAClB,cAAM,IAAI,UAAU,EAAE,OAAO,IAAI;AACjC,YAAI,CAAC,EAAE,GAAI,QAAO;AAClB,YAAI,EAAE,UAAU,KAAM,QAAO;AAC7B,YAAI,EAAE,UAAU,KAAM,QAAO,GAAG,IAAI;AAAA,MACtC;AACA,aAAO,GAAG,KAAK;AAAA,IACjB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,SAAS;AAAA,IACpB,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,IAAI,UAAU,KAAK,CAAC,GAAG,KAAK;AAClC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,aAAO,GAAG,CAAE,EAAE,KAAiB;AAAA,IACjC;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,SAAS;AAAA,IACpB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,IAAI,KAAK,CAAC;AAChB,aAAO,GAAG,MAAM,QAAQ,MAAM,UAAa,MAAM,EAAE;AAAA,IACrD;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,SAAS;AAAA,IACpB,YAAY,CAAC,UAAU,MAAM,OAAyB,CAAC,KAAK,MAAM,WAAW,KAAK,CAAC,GAAG,MAAM,CAAC,KAAK,SAAS;AAAA,IAC3G,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,iBAAW,OAAO,MAAM;AACtB,YAAI,QAAQ,QAAQ,QAAQ,GAAI,QAAO,GAAG,GAAG;AAAA,MAC/C;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ;AAAA,IACnB,YAAY;AAAA,IACZ,MAAM,YAAY,OAAO,KAAK,GAAG;AAAA,EACnC;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,UAAU,QAAQ;AAAA,IAC7B,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,OAAO;AACnC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,YAAM,OAAO,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG,OAAO,IAAI,GAAG,CAAC;AAChE,UAAI,CAAC,KAAK,GAAI,QAAO;AACrB,YAAM,SAAS,KAAK,UAAU,OAAO,IAAI,KAAK,MAAM,KAAK,KAAe;AACxE,aAAO,GAAG,sBAAsB,EAAE,OAAiB,MAAM,CAAC;AAAA,IAC5D;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ;AAAA,IACnB,YAAY;AAAA,IACZ,MAAM,YAAY,WAAW,KAAK,IAAI;AAAA,EACxC;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ;AAAA,IACnB,YAAY;AAAA,IACZ,MAAM,YAAY,SAAS,KAAK,KAAK;AAAA,EACvC;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ;AAAA,IACnB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,YAAY,OAAO,MAAM,CAAC,MAAM,KAAK,IAAI,GAAG,CAAC,CAAC;AAAA,EAChE;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ;AAAA,IACnB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,YAAY,OAAO,MAAM,CAAC,MAAM,KAAK,IAAI,GAAG,CAAC,CAAC;AAAA,EAChE;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ;AAAA,IACnB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,YAAY,OAAO,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,CAAC;AAAA,EAC9E;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ;AAAA,IACnB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,YAAY,WAAW,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,MAAM;AAAA,EAC7F;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,UAAU,QAAQ;AAAA,IAC7B,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,OAAO,SAAS,KAAK,CAAC,GAAG,OAAO;AACtC,UAAI,CAAC,KAAK,MAAM,KAAK,UAAU,KAAM,QAAO;AAC5C,YAAM,MAAM,SAAS,KAAK,CAAC,GAAG,OAAO;AACrC,UAAI,CAAC,IAAI,MAAM,IAAI,UAAU,KAAM,QAAO;AAC1C,YAAM,SAAU,KAAK,SAAqB,IAAI;AAC9C,UAAI,CAAC,OAAO,SAAS,MAAM,GAAG;AAC5B,eAAO,KAAK,iBAAiB,yBAAyB,EAAE,MAAM,QAAQ,CAAC;AAAA,MACzE;AACA,aAAO,GAAG,MAAM;AAAA,IAClB;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ;AAAA,IACnB,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,MAAM;AAClC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,UAAK,EAAE,QAAmB,GAAG;AAC3B,eAAO,KAAK,iBAAiB,wBAAwB,EAAE,MAAM,OAAO,CAAC;AAAA,MACvE;AACA,aAAO,GAAG,KAAK,KAAK,EAAE,KAAe,CAAC;AAAA,IACxC;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,UAAU,QAAQ;AAAA,IAC7B,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,KAAK;AACjC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,KAAK;AACjC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,UAAI,EAAE,UAAU,EAAG,QAAO,KAAK,kBAAkB,uBAAuB;AACxE,aAAO,GAAI,EAAE,QAAoB,EAAE,KAAgB;AAAA,IACrD;AAAA,EACF;AAAA;AAAA,EAGA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,SAAS;AAAA,IACpB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,UAAI,MAAM;AACV,iBAAW,OAAO,MAAM;AACtB,YAAI,QAAQ,KAAM;AAClB,cAAM,IAAI,OAAO,GAAG;AACpB,YAAI,CAAC,EAAE,GAAI,QAAO;AAClB,eAAO,EAAE,UAAU,OAAO,KAAM,EAAE;AAAA,MACpC;AACA,aAAO,GAAG,GAAG;AAAA,IACf;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,MAAM;AAAA,IACjB,YAAY;AAAA,IACZ,MAAM,UAAU,CAAC,MAAM,EAAE,YAAY,CAAC;AAAA,EACxC;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,MAAM;AAAA,IACjB,YAAY;AAAA,IACZ,MAAM,UAAU,CAAC,MAAM,EAAE,YAAY,CAAC;AAAA,EACxC;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,MAAM;AAAA,IACjB,YAAY;AAAA,IACZ,MAAM,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC;AAAA,EACjC;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,MAAM;AAAA,IACjB,YAAY;AAAA,IACZ,MAAM,UAAU,CAAC,MAAM,EAAE,MAAM;AAAA,EACjC;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ,QAAQ;AAAA,IAC3B,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,IAAI,OAAO,KAAK,CAAC,CAAC;AACxB,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,MAAM;AAClC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,aAAO,GAAI,EAAE,MAAiB,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,MAAM,EAAE,KAAe,CAAC,CAAC,CAAC;AAAA,IACpF;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ,QAAQ;AAAA,IAC3B,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,IAAI,OAAO,KAAK,CAAC,CAAC;AACxB,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,OAAO;AACnC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,YAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,EAAE,KAAe,CAAC;AACvD,aAAO,GAAG,UAAU,IAAI,KAAM,EAAE,MAAiB,MAAM,CAAC,KAAK,CAAC;AAAA,IAChE;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ,MAAM;AAAA,IACzB,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,WAAW,OAAO,KAAK,CAAC,CAAC;AAC/B,UAAI,CAAC,SAAS,MAAM,SAAS,UAAU,KAAM,QAAO;AACpD,YAAM,SAAS,OAAO,KAAK,CAAC,CAAC;AAC7B,UAAI,CAAC,OAAO,MAAM,OAAO,UAAU,KAAM,QAAO;AAChD,aAAO;AAAA,QACJ,SAAS,MAAiB,YAAY,EAAE,SAAU,OAAO,MAAiB,YAAY,CAAC;AAAA,MAC1F;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,SAAS;AAAA,IACpB,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,OAAO,KAAK,CAAC,CAAC;AAAA,EAChC;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,SAAS;AAAA,IACpB,YAAY;AAAA,IACZ,MAAM,CAAC,SAAS,SAAS,KAAK,CAAC,GAAG,OAAO;AAAA,EAC3C;AAAA;AAAA,EAGA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC;AAAA,IACX,YAAY;AAAA,IACZ,KAAK,OAAO,IAAI;AACd,YAAM,MAAM,GAAG,IAAI;AACnB,aAAO,GAAG,IAAI,KAAK,IAAI,YAAY,GAAG,IAAI,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC;AAAA,IACtE;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ,MAAM;AAAA,IACzB,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,OAAO,OAAO,KAAK,CAAC,GAAG,cAAc;AAC3C,UAAI,CAAC,KAAK,MAAM,KAAK,UAAU,KAAM,QAAO;AAC5C,YAAM,KAAK,OAAO,KAAK,CAAC,GAAG,cAAc;AACzC,UAAI,CAAC,GAAG,MAAM,GAAG,UAAU,KAAM,QAAO;AACxC,aAAO,GAAG,SAAS,KAAK,OAAe,GAAG,KAAa,CAAC;AAAA,IAC1D;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,QAAQ,QAAQ;AAAA,IAC3B,YAAY;AAAA,IACZ,KAAK,MAAM;AACT,YAAM,IAAI,OAAO,KAAK,CAAC,GAAG,UAAU;AACpC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,YAAM,IAAI,SAAS,KAAK,CAAC,GAAG,UAAU;AACtC,UAAI,CAAC,EAAE,MAAM,EAAE,UAAU,KAAM,QAAO;AACtC,YAAM,OAAO,EAAE;AACf,aAAO;AAAA,QACL,IAAI,KAAK,KAAK,YAAY,GAAG,KAAK,SAAS,GAAG,KAAK,QAAQ,IAAI,KAAK,MAAM,EAAE,KAAe,CAAC;AAAA,MAC9F;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,MAAM;AAAA,IACjB,YAAY;AAAA,IACZ,MAAM,cAAc,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;AAAA,EACpD;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,MAAM;AAAA,IACjB,YAAY;AAAA,IACZ,MAAM,cAAc,SAAS,CAAC,MAAM,EAAE,SAAS,IAAI,CAAC;AAAA,EACtD;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,WAAW;AAAA,IACX,SAAS;AAAA,IACT,SAAS;AAAA,IACT,UAAU,CAAC,MAAM;AAAA,IACjB,YAAY;AAAA,IACZ,MAAM,cAAc,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;AAAA,EAC/C;AACF;AAGO,MAAM,oBAAkE,OAAO;AAAA,EACpF,KAAK,OAA2C,CAAC,KAAK,QAAQ;AAC5D,QAAI,IAAI,IAAI,IAAI;AAChB,WAAO;AAAA,EACT,GAAG,CAAC,CAAC;AACP;AAGO,MAAM,yBAA4C,OAAO;AAAA,EAC9D,KAAK,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK;AAC/B;AAGO,MAAM,8BACX,OAAO,OAAO,KAAK,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,EAAE,UAAU,EAAE,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC,CAAC;AAGjH,SAAS,sBAAsB,MAA8C;AAClF,SAAO,kBAAkB,KAAK,YAAY,CAAC;AAC7C;AAGO,SAAS,gBAAgB,KAAyB,OAAiC;AACxF,MAAI,IAAI,SAAS,WAAW,EAAG,QAAO;AACtC,SAAO,IAAI,SAAS,KAAK,IAAI,OAAO,IAAI,SAAS,SAAS,CAAC,CAAC;AAC9D;AAGO,SAAS,kBACd,KACA,UACkB;AAClB,SAAO,OAAO,IAAI,eAAe,aAAa,IAAI,WAAW,QAAQ,IAAI,IAAI;AAC/E;AAGO,SAAS,aAAa,MAAuD;AAClF,SAAO,SAAS,YAAY,SAAY;AAC1C;",
+  "names": []
+}