@open-mercato/core 0.8.1-develop.7296.1.2111d779db → 0.8.1-develop.7441.1.b42958b98c

package/dist/modules/forms/services/form-logic-evaluator.js

@@ -0,0 +1,517 @@
+import {
+  OM_FIELD_KEYWORDS,
+  OM_ROOT_KEYWORDS
+} from "../schema/jsonschema-extensions.js";
+import {
+  ALLOWED_JSONLOGIC_OPS,
+  classifyVarPath
+} from "../schema/jsonlogic-grammar.js";
+class LogicEvaluatorError extends Error {
+  constructor(code, message) {
+    super(message);
+    this.name = "LogicEvaluatorError";
+    this.code = code;
+  }
+}
+const DEFAULT_MAX_DEPTH = 64;
+const DEFAULT_MAX_NODES = 1024;
+const RECALL_PATTERN = /@\{([a-z][a-z0-9_.]*)\}/g;
+const RAW_SENSITIVE_KEY = "x-om-sensitive";
+function evaluateFormLogic(schema, context) {
+  const answers = context.answers ?? {};
+  const hidden = context.hidden ?? {};
+  const locale = context.locale ?? "en";
+  const sections = readSections(schema);
+  const properties = readProperties(schema);
+  const variableDecls = readVariables(schema);
+  const hiddenDecls = readHiddenFields(schema);
+  const jumps = readJumps(schema);
+  const hiddenResolved = resolveHiddenDefaults(hidden, hiddenDecls);
+  const variables = computeVariables(variableDecls, answers, hiddenResolved);
+  const visibleSectionKeys = computeVisibleSections(sections, answers, hiddenResolved, variables);
+  const visibleFieldKeys = computeVisibleFields(
+    sections,
+    properties,
+    visibleSectionKeys,
+    answers,
+    hiddenResolved,
+    variables
+  );
+  const sensitiveFields = collectSensitiveFields(properties);
+  const resolveRecall = (text, requestedLocale) => {
+    return resolveRecallTokens(text, {
+      answers,
+      hidden: hiddenResolved,
+      variables,
+      sensitiveFields
+    }, requestedLocale ?? locale);
+  };
+  const nextTarget = (fromPageKey) => {
+    return resolveNextTarget({
+      schemaSections: sections,
+      jumps,
+      fromPageKey,
+      answers,
+      hidden: hiddenResolved,
+      variables,
+      visibleSectionKeys
+    });
+  };
+  return {
+    visibleFieldKeys,
+    visibleSectionKeys,
+    variables: Object.freeze({ ...variables }),
+    resolveRecall,
+    nextTarget
+  };
+}
+function readSections(schema) {
+  const value = schema[OM_ROOT_KEYWORDS.sections];
+  if (!Array.isArray(value)) return [];
+  return value.filter((entry) => !!entry && typeof entry === "object");
+}
+function readProperties(schema) {
+  const value = schema.properties;
+  if (!value || typeof value !== "object" || Array.isArray(value)) return {};
+  return value;
+}
+function readVariables(schema) {
+  const value = schema[OM_ROOT_KEYWORDS.variables];
+  if (!Array.isArray(value)) return [];
+  return value;
+}
+function readHiddenFields(schema) {
+  const value = schema[OM_ROOT_KEYWORDS.hiddenFields];
+  if (!Array.isArray(value)) return [];
+  return value;
+}
+function readJumps(schema) {
+  const value = schema[OM_ROOT_KEYWORDS.jumps];
+  if (!Array.isArray(value)) return [];
+  return value;
+}
+function collectSensitiveFields(properties) {
+  const set = /* @__PURE__ */ new Set();
+  for (const [key, node] of Object.entries(properties)) {
+    if (node && node[RAW_SENSITIVE_KEY] === true) {
+      set.add(key);
+    }
+  }
+  return set;
+}
+function resolveHiddenDefaults(hidden, declarations) {
+  const result = { ...hidden };
+  for (const decl of declarations) {
+    if (!(decl.name in result) || result[decl.name] === void 0 || result[decl.name] === null) {
+      if (decl.defaultValue !== void 0) {
+        result[decl.name] = decl.defaultValue;
+      }
+    }
+  }
+  return result;
+}
+function computeVariables(declarations, answers, hidden) {
+  if (declarations.length === 0) return {};
+  const byName = /* @__PURE__ */ new Map();
+  for (const decl of declarations) {
+    byName.set(decl.name, decl);
+  }
+  const order = topologicalOrder(declarations, byName);
+  const computed = {};
+  for (const name of order) {
+    const decl = byName.get(name);
+    if (!decl) continue;
+    try {
+      const raw = evaluateExpression(decl.formula, {
+        answers,
+        hidden,
+        variables: computed
+      });
+      computed[name] = coerceVariableValue(raw, decl.type, decl.default);
+    } catch {
+      computed[name] = decl.default !== void 0 ? decl.default : defaultForType(decl.type);
+    }
+  }
+  return computed;
+}
+function topologicalOrder(declarations, byName) {
+  const visited = /* @__PURE__ */ new Set();
+  const visiting = /* @__PURE__ */ new Set();
+  const order = [];
+  function visit(name, stack) {
+    if (visited.has(name)) return;
+    if (visiting.has(name)) {
+      throw new LogicEvaluatorError("VARIABLE_CYCLE", `Variable cycle detected: ${[...stack, name].join(" \u2192 ")}`);
+    }
+    const decl = byName.get(name);
+    if (!decl) return;
+    visiting.add(name);
+    for (const dep of collectVariableDependencies(decl.formula)) {
+      if (byName.has(dep)) visit(dep, [...stack, name]);
+    }
+    visiting.delete(name);
+    visited.add(name);
+    order.push(name);
+  }
+  for (const decl of declarations) {
+    visit(decl.name, []);
+  }
+  return order;
+}
+function collectVariableDependencies(expression) {
+  const deps = /* @__PURE__ */ new Set();
+  walkVarReferences(expression, (path) => {
+    const { namespace, name } = classifyVarPath(path);
+    if (namespace === "variable") deps.add(name.split(".")[0]);
+  });
+  return [...deps];
+}
+function walkVarReferences(expression, callback) {
+  if (expression === null || expression === void 0) return;
+  if (typeof expression !== "object") return;
+  if (Array.isArray(expression)) {
+    for (const entry of expression) walkVarReferences(entry, callback);
+    return;
+  }
+  const keys = Object.keys(expression);
+  if (keys.length !== 1) return;
+  const op = keys[0];
+  const args = expression[op];
+  if (op === "var") {
+    const path = Array.isArray(args) ? args[0] : args;
+    if (typeof path === "string") callback(path);
+    return;
+  }
+  walkVarReferences(args, callback);
+}
+function coerceVariableValue(raw, type, fallback) {
+  if (type === "number") {
+    const num = typeof raw === "number" ? raw : Number(raw);
+    if (!Number.isFinite(num)) return typeof fallback === "number" ? fallback : 0;
+    return num;
+  }
+  if (type === "boolean") {
+    return Boolean(raw);
+  }
+  if (typeof raw === "string") return raw;
+  if (raw === null || raw === void 0) return typeof fallback === "string" ? fallback : "";
+  return String(raw);
+}
+function defaultForType(type) {
+  if (type === "number") return 0;
+  if (type === "boolean") return false;
+  return "";
+}
+function computeVisibleSections(sections, answers, hidden, variables) {
+  const visible = /* @__PURE__ */ new Set();
+  for (const section of sections) {
+    if (section.kind === "ending") {
+      visible.add(section.key);
+      continue;
+    }
+    const predicate = section["x-om-visibility-if"];
+    if (predicate === void 0) {
+      visible.add(section.key);
+      continue;
+    }
+    if (predicateTruthy(predicate, { answers, hidden, variables })) {
+      visible.add(section.key);
+    }
+  }
+  return visible;
+}
+function computeVisibleFields(sections, properties, visibleSectionKeys, answers, hidden, variables) {
+  const visible = /* @__PURE__ */ new Set();
+  const sectionByField = /* @__PURE__ */ new Map();
+  for (const section of sections) {
+    for (const key of section.fieldKeys) {
+      if (!sectionByField.has(key)) sectionByField.set(key, section.key);
+    }
+  }
+  for (const [fieldKey, node] of Object.entries(properties)) {
+    const sectionKey = sectionByField.get(fieldKey);
+    if (sectionKey !== void 0 && !visibleSectionKeys.has(sectionKey)) {
+      continue;
+    }
+    if (sectionKey !== void 0) {
+      const owningSection = sections.find((s) => s.key === sectionKey);
+      if (owningSection?.kind === "ending") {
+        continue;
+      }
+    }
+    const predicate = node[OM_FIELD_KEYWORDS.visibilityIf];
+    if (predicate === void 0) {
+      visible.add(fieldKey);
+      continue;
+    }
+    if (predicateTruthy(predicate, { answers, hidden, variables })) {
+      visible.add(fieldKey);
+    }
+  }
+  return visible;
+}
+function resolveNextTarget(input) {
+  const { schemaSections, jumps, fromPageKey, answers, hidden, variables, visibleSectionKeys } = input;
+  const rule = jumps.find((entry) => entry.from.type === "page" && entry.from.pageKey === fromPageKey);
+  if (!rule) return { type: "next" };
+  for (const branch of rule.rules) {
+    if (predicateTruthy(branch.if, { answers, hidden, variables })) {
+      return ensureReachableTarget(branch.goto, schemaSections, visibleSectionKeys);
+    }
+  }
+  if (rule.otherwise) {
+    return ensureReachableTarget(rule.otherwise, schemaSections, visibleSectionKeys);
+  }
+  return { type: "next" };
+}
+function ensureReachableTarget(target, sections, visibleSectionKeys) {
+  if (target.type === "page") {
+    const exists = sections.some((s) => s.key === target.pageKey && (s.kind === "page" || s.kind === void 0));
+    if (!exists) return { type: "next" };
+    return target;
+  }
+  if (target.type === "ending") {
+    const exists = sections.some((s) => s.key === target.endingKey && s.kind === "ending");
+    if (!exists) return { type: "next" };
+    return target;
+  }
+  return target;
+}
+function predicateTruthy(expression, context) {
+  try {
+    const result = evaluateExpression(expression, context);
+    return truthy(result);
+  } catch {
+    return false;
+  }
+}
+function evaluateExpression(expression, context, options = {}) {
+  const counter = { count: 0 };
+  return evaluateInner(
+    expression,
+    context,
+    0,
+    options.maxDepth ?? DEFAULT_MAX_DEPTH,
+    options.maxNodes ?? DEFAULT_MAX_NODES,
+    counter
+  );
+}
+function evaluateInner(expression, context, depth, maxDepth, maxNodes, counter) {
+  counter.count += 1;
+  if (counter.count > maxNodes) {
+    throw new LogicEvaluatorError("NODE_LIMIT_EXCEEDED", "Expression evaluated too many nodes.");
+  }
+  if (depth > maxDepth) {
+    throw new LogicEvaluatorError("DEPTH_LIMIT_EXCEEDED", "Expression nesting exceeds the depth limit.");
+  }
+  if (expression === null || expression === void 0) return expression;
+  if (typeof expression !== "object") return expression;
+  if (Array.isArray(expression)) {
+    return expression.map(
+      (entry) => evaluateInner(entry, context, depth + 1, maxDepth, maxNodes, counter)
+    );
+  }
+  const keys = Object.keys(expression);
+  if (keys.length === 0) return void 0;
+  if (keys.length !== 1) {
+    throw new LogicEvaluatorError("INVALID_NODE", "Expression nodes must have exactly one key.");
+  }
+  const op = keys[0];
+  if (!ALLOWED_JSONLOGIC_OPS.has(op)) {
+    throw new LogicEvaluatorError("UNSUPPORTED_OP", `Operator "${op}" is not in the jsonlogic grammar.`);
+  }
+  const args = expression[op];
+  return applyOperator(op, args, context, depth, maxDepth, maxNodes, counter);
+}
+function applyOperator(op, args, context, depth, maxDepth, maxNodes, counter) {
+  const evalArg = (value) => evaluateInner(value, context, depth + 1, maxDepth, maxNodes, counter);
+  switch (op) {
+    case "var": {
+      const path = Array.isArray(args) ? args[0] : args;
+      if (typeof path !== "string") return void 0;
+      return resolveVar(path, context);
+    }
+    case "if": {
+      const list = Array.isArray(args) ? args : [args];
+      for (let i = 0; i + 1 < list.length; i += 2) {
+        if (truthy(evalArg(list[i]))) return evalArg(list[i + 1]);
+      }
+      if (list.length % 2 === 1) return evalArg(list[list.length - 1]);
+      return void 0;
+    }
+    case "and": {
+      const list = Array.isArray(args) ? args : [args];
+      let value = true;
+      for (const entry of list) {
+        value = evalArg(entry);
+        if (!truthy(value)) return value;
+      }
+      return value;
+    }
+    case "or": {
+      const list = Array.isArray(args) ? args : [args];
+      let value = false;
+      for (const entry of list) {
+        value = evalArg(entry);
+        if (truthy(value)) return value;
+      }
+      return value;
+    }
+    case "not":
+    case "!": {
+      const single = Array.isArray(args) ? args[0] : args;
+      return !truthy(evalArg(single));
+    }
+    case "!!": {
+      const single = Array.isArray(args) ? args[0] : args;
+      return truthy(evalArg(single));
+    }
+    case "==": {
+      const [a, b] = pair(args, evalArg);
+      return a == b;
+    }
+    case "!=": {
+      const [a, b] = pair(args, evalArg);
+      return a != b;
+    }
+    case "===": {
+      const [a, b] = pair(args, evalArg);
+      return a === b;
+    }
+    case "!==": {
+      const [a, b] = pair(args, evalArg);
+      return a !== b;
+    }
+    case ">": {
+      const [a, b] = pair(args, evalArg);
+      return Number(a) > Number(b);
+    }
+    case "<": {
+      const [a, b] = pair(args, evalArg);
+      return Number(a) < Number(b);
+    }
+    case ">=": {
+      const [a, b] = pair(args, evalArg);
+      return Number(a) >= Number(b);
+    }
+    case "<=": {
+      const [a, b] = pair(args, evalArg);
+      return Number(a) <= Number(b);
+    }
+    case "+": {
+      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)];
+      return list.reduce((acc, entry) => acc + (Number(entry) || 0), 0);
+    }
+    case "-": {
+      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)];
+      if (list.length === 0) return 0;
+      if (list.length === 1) return -Number(list[0]);
+      return list.slice(1).reduce((acc, entry) => acc - (Number(entry) || 0), Number(list[0]) || 0);
+    }
+    case "*": {
+      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)];
+      return list.reduce((acc, entry) => acc * (Number(entry) || 0), 1);
+    }
+    case "/": {
+      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)];
+      if (list.length < 2) return 0;
+      const denom = Number(list[1]) || 0;
+      if (denom === 0) return 0;
+      return (Number(list[0]) || 0) / denom;
+    }
+    case "%": {
+      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)];
+      if (list.length < 2) return 0;
+      const denom = Number(list[1]) || 0;
+      if (denom === 0) return 0;
+      return (Number(list[0]) || 0) % denom;
+    }
+    case "in": {
+      const [needle, haystack] = pair(args, evalArg);
+      if (Array.isArray(haystack)) return haystack.includes(needle);
+      if (typeof haystack === "string" && typeof needle === "string") return haystack.includes(needle);
+      return false;
+    }
+  }
+  throw new LogicEvaluatorError("UNSUPPORTED_OP", `Operator "${op}" is not in the jsonlogic grammar.`);
+}
+function pair(args, evalArg) {
+  if (!Array.isArray(args) || args.length < 2) {
+    throw new LogicEvaluatorError("INVALID_ARGS", "Comparison ops require two arguments.");
+  }
+  return [evalArg(args[0]), evalArg(args[1])];
+}
+function resolveVar(path, context) {
+  if (!path) return void 0;
+  const { namespace, name } = classifyVarPath(path);
+  const source = namespace === "variable" ? context.variables : namespace === "hidden" ? context.hidden : context.answers;
+  if (!source) return void 0;
+  if (!name) return source;
+  let cursor = source;
+  for (const segment of name.split(".")) {
+    if (cursor === null || cursor === void 0) return void 0;
+    if (typeof cursor !== "object") return void 0;
+    cursor = cursor[segment];
+  }
+  return cursor;
+}
+function truthy(value) {
+  if (value === null || value === void 0) return false;
+  if (typeof value === "boolean") return value;
+  if (typeof value === "number") return value !== 0 && !Number.isNaN(value);
+  if (typeof value === "string") return value.length > 0;
+  if (Array.isArray(value)) return value.length > 0;
+  return true;
+}
+function resolveRecallTokens(text, context, locale) {
+  if (text === void 0 || text === null) return "";
+  const source = typeof text === "string" ? text : pickLocale(text, locale);
+  if (!source) return "";
+  return source.replace(/@@\{/g, "\0ESC\0").replace(RECALL_PATTERN, (_, identifier) => {
+    const value = lookupRecall(identifier, context);
+    if (value === void 0 || value === null) return "";
+    return formatRecallValue(value, locale);
+  }).replace(/ESC/g, "@{");
+}
+function pickLocale(text, locale) {
+  if (text[locale]) return text[locale];
+  if (text.en) return text.en;
+  const first = Object.values(text)[0];
+  return typeof first === "string" ? first : "";
+}
+function lookupRecall(identifier, context) {
+  const { namespace, name } = classifyVarPath(identifier);
+  if (!name) return void 0;
+  if (namespace === "variable") return readNested(context.variables, name);
+  if (namespace === "hidden") return readNested(context.hidden, name);
+  if (context.sensitiveFields.has(name.split(".")[0])) return void 0;
+  return readNested(context.answers, name);
+}
+function readNested(source, path) {
+  let cursor = source;
+  for (const segment of path.split(".")) {
+    if (cursor === null || cursor === void 0) return void 0;
+    if (typeof cursor !== "object") return void 0;
+    cursor = cursor[segment];
+  }
+  return cursor;
+}
+function formatRecallValue(value, locale) {
+  if (typeof value === "number") {
+    try {
+      return new Intl.NumberFormat(locale).format(value);
+    } catch {
+      return String(value);
+    }
+  }
+  if (typeof value === "boolean") return value ? "true" : "false";
+  if (value instanceof Date) return value.toLocaleString(locale);
+  if (Array.isArray(value)) return value.map((entry) => formatRecallValue(entry, locale)).join(", ");
+  return String(value);
+}
+export {
+  LogicEvaluatorError,
+  evaluateExpression,
+  evaluateFormLogic
+};
+//# sourceMappingURL=form-logic-evaluator.js.map

package/dist/modules/forms/services/form-logic-evaluator.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../src/modules/forms/services/form-logic-evaluator.ts"],
+  "sourcesContent": ["/**\n * Forms reactive-core \u2014 pure logic evaluator.\n *\n * Given a schema + answers + hidden values + locale, returns a `LogicState`:\n *   - visibleFieldKeys / visibleSectionKeys (after cascade)\n *   - variables (computed in topological order; cycles throw)\n *   - resolveRecall(text, locale) (substitutes `@{...}` tokens)\n *   - nextTarget(currentPageKey) (applies `x-om-jumps`)\n *\n * Deterministic, no I/O. Shared by Studio Preview and the public runner.\n */\n\nimport {\n  OM_FIELD_KEYWORDS,\n  OM_ROOT_KEYWORDS,\n  type LocalizedText,\n  type OmFormVariable,\n  type OmFormVariableType,\n  type OmHiddenFieldDecl,\n  type OmJumpRule,\n  type OmJumpTarget,\n  type OmSection,\n} from '../schema/jsonschema-extensions'\nimport {\n  ALLOWED_JSONLOGIC_OPS,\n  classifyVarPath,\n} from '../schema/jsonlogic-grammar'\n\nexport class LogicEvaluatorError extends Error {\n  readonly code: string\n  constructor(code: string, message: string) {\n    super(message)\n    this.name = 'LogicEvaluatorError'\n    this.code = code\n  }\n}\n\nexport type LogicContext = {\n  answers: Record<string, unknown>\n  hidden: Record<string, unknown>\n  variables: Record<string, unknown>\n  locale: string\n}\n\nexport type JumpTarget = OmJumpTarget\n\nexport type LogicState = {\n  visibleFieldKeys: ReadonlySet<string>\n  visibleSectionKeys: ReadonlySet<string>\n  variables: Readonly<Record<string, unknown>>\n  resolveRecall(text: LocalizedText | string | undefined, locale: string): string\n  nextTarget(fromPageKey: string): JumpTarget\n}\n\ntype SchemaLike = Record<string, unknown>\n\ntype FieldNodeLike = Record<string, unknown>\n\nconst DEFAULT_MAX_DEPTH = 64\nconst DEFAULT_MAX_NODES = 1024\nconst RECALL_PATTERN = /@\\{([a-z][a-z0-9_.]*)\\}/g\n\nconst RAW_SENSITIVE_KEY = 'x-om-sensitive'\n\n/**\n * Pure entry point. Returns a `LogicState` derived from the schema + context.\n *\n * Order of operations (Q2/Q3 design):\n *   1. Compute variables in topological order (cycles \u2192 throw).\n *   2. Resolve visibility (fields + sections; hidden sections cascade to fields).\n *   3. Resolve `nextTarget(fromPageKey)` lazily \u2014 depends on visibility state.\n *   4. Provide a recall resolver bound to the same context.\n */\nexport function evaluateFormLogic(\n  schema: SchemaLike,\n  context: Omit<LogicContext, 'variables'>,\n): LogicState {\n  const answers = context.answers ?? {}\n  const hidden = context.hidden ?? {}\n  const locale = context.locale ?? 'en'\n  const sections = readSections(schema)\n  const properties = readProperties(schema)\n  const variableDecls = readVariables(schema)\n  const hiddenDecls = readHiddenFields(schema)\n  const jumps = readJumps(schema)\n\n  const hiddenResolved = resolveHiddenDefaults(hidden, hiddenDecls)\n  const variables = computeVariables(variableDecls, answers, hiddenResolved)\n\n  const visibleSectionKeys = computeVisibleSections(sections, answers, hiddenResolved, variables)\n  const visibleFieldKeys = computeVisibleFields(\n    sections,\n    properties,\n    visibleSectionKeys,\n    answers,\n    hiddenResolved,\n    variables,\n  )\n\n  const sensitiveFields = collectSensitiveFields(properties)\n\n  const resolveRecall = (text: LocalizedText | string | undefined, requestedLocale: string): string => {\n    return resolveRecallTokens(text, {\n      answers,\n      hidden: hiddenResolved,\n      variables,\n      sensitiveFields,\n    }, requestedLocale ?? locale)\n  }\n\n  const nextTarget = (fromPageKey: string): JumpTarget => {\n    return resolveNextTarget({\n      schemaSections: sections,\n      jumps,\n      fromPageKey,\n      answers,\n      hidden: hiddenResolved,\n      variables,\n      visibleSectionKeys,\n    })\n  }\n\n  return {\n    visibleFieldKeys,\n    visibleSectionKeys,\n    variables: Object.freeze({ ...variables }),\n    resolveRecall,\n    nextTarget,\n  }\n}\n\n// =============================================================================\n// Schema readers\n// =============================================================================\n\nfunction readSections(schema: SchemaLike): OmSection[] {\n  const value = schema[OM_ROOT_KEYWORDS.sections]\n  if (!Array.isArray(value)) return []\n  return value.filter((entry): entry is OmSection => !!entry && typeof entry === 'object')\n}\n\nfunction readProperties(schema: SchemaLike): Record<string, FieldNodeLike> {\n  const value = schema.properties\n  if (!value || typeof value !== 'object' || Array.isArray(value)) return {}\n  return value as Record<string, FieldNodeLike>\n}\n\nfunction readVariables(schema: SchemaLike): OmFormVariable[] {\n  const value = schema[OM_ROOT_KEYWORDS.variables]\n  if (!Array.isArray(value)) return []\n  return value as OmFormVariable[]\n}\n\nfunction readHiddenFields(schema: SchemaLike): OmHiddenFieldDecl[] {\n  const value = schema[OM_ROOT_KEYWORDS.hiddenFields]\n  if (!Array.isArray(value)) return []\n  return value as OmHiddenFieldDecl[]\n}\n\nfunction readJumps(schema: SchemaLike): OmJumpRule[] {\n  const value = schema[OM_ROOT_KEYWORDS.jumps]\n  if (!Array.isArray(value)) return []\n  return value as OmJumpRule[]\n}\n\nfunction collectSensitiveFields(properties: Record<string, FieldNodeLike>): Set<string> {\n  const set = new Set<string>()\n  for (const [key, node] of Object.entries(properties)) {\n    if (node && (node as Record<string, unknown>)[RAW_SENSITIVE_KEY] === true) {\n      set.add(key)\n    }\n  }\n  return set\n}\n\n// =============================================================================\n// Hidden fields\n// =============================================================================\n\nfunction resolveHiddenDefaults(\n  hidden: Record<string, unknown>,\n  declarations: OmHiddenFieldDecl[],\n): Record<string, unknown> {\n  const result: Record<string, unknown> = { ...hidden }\n  for (const decl of declarations) {\n    if (!(decl.name in result) || result[decl.name] === undefined || result[decl.name] === null) {\n      if (decl.defaultValue !== undefined) {\n        result[decl.name] = decl.defaultValue\n      }\n    }\n  }\n  return result\n}\n\n// =============================================================================\n// Variables \u2014 topological sort + jsonlogic evaluation\n// =============================================================================\n\nfunction computeVariables(\n  declarations: OmFormVariable[],\n  answers: Record<string, unknown>,\n  hidden: Record<string, unknown>,\n): Record<string, unknown> {\n  if (declarations.length === 0) return {}\n  const byName = new Map<string, OmFormVariable>()\n  for (const decl of declarations) {\n    byName.set(decl.name, decl)\n  }\n  const order = topologicalOrder(declarations, byName)\n  const computed: Record<string, unknown> = {}\n  for (const name of order) {\n    const decl = byName.get(name)\n    if (!decl) continue\n    try {\n      const raw = evaluateExpression(decl.formula, {\n        answers,\n        hidden,\n        variables: computed,\n      })\n      computed[name] = coerceVariableValue(raw, decl.type, decl.default)\n    } catch {\n      computed[name] = decl.default !== undefined ? decl.default : defaultForType(decl.type)\n    }\n  }\n  return computed\n}\n\nfunction topologicalOrder(\n  declarations: OmFormVariable[],\n  byName: Map<string, OmFormVariable>,\n): string[] {\n  const visited = new Set<string>()\n  const visiting = new Set<string>()\n  const order: string[] = []\n\n  function visit(name: string, stack: string[]): void {\n    if (visited.has(name)) return\n    if (visiting.has(name)) {\n      throw new LogicEvaluatorError('VARIABLE_CYCLE', `Variable cycle detected: ${[...stack, name].join(' \u2192 ')}`)\n    }\n    const decl = byName.get(name)\n    if (!decl) return\n    visiting.add(name)\n    for (const dep of collectVariableDependencies(decl.formula)) {\n      if (byName.has(dep)) visit(dep, [...stack, name])\n    }\n    visiting.delete(name)\n    visited.add(name)\n    order.push(name)\n  }\n\n  for (const decl of declarations) {\n    visit(decl.name, [])\n  }\n  return order\n}\n\nfunction collectVariableDependencies(expression: unknown): string[] {\n  const deps = new Set<string>()\n  walkVarReferences(expression, (path) => {\n    const { namespace, name } = classifyVarPath(path)\n    if (namespace === 'variable') deps.add(name.split('.')[0])\n  })\n  return [...deps]\n}\n\nfunction walkVarReferences(expression: unknown, callback: (path: string) => void): void {\n  if (expression === null || expression === undefined) return\n  if (typeof expression !== 'object') return\n  if (Array.isArray(expression)) {\n    for (const entry of expression) walkVarReferences(entry, callback)\n    return\n  }\n  const keys = Object.keys(expression as Record<string, unknown>)\n  if (keys.length !== 1) return\n  const op = keys[0]\n  const args = (expression as Record<string, unknown>)[op]\n  if (op === 'var') {\n    const path = Array.isArray(args) ? args[0] : args\n    if (typeof path === 'string') callback(path)\n    return\n  }\n  walkVarReferences(args, callback)\n}\n\nfunction coerceVariableValue(\n  raw: unknown,\n  type: OmFormVariableType,\n  fallback: unknown,\n): unknown {\n  if (type === 'number') {\n    const num = typeof raw === 'number' ? raw : Number(raw)\n    if (!Number.isFinite(num)) return typeof fallback === 'number' ? fallback : 0\n    return num\n  }\n  if (type === 'boolean') {\n    return Boolean(raw)\n  }\n  if (typeof raw === 'string') return raw\n  if (raw === null || raw === undefined) return typeof fallback === 'string' ? fallback : ''\n  return String(raw)\n}\n\nfunction defaultForType(type: OmFormVariableType): unknown {\n  if (type === 'number') return 0\n  if (type === 'boolean') return false\n  return ''\n}\n\n// =============================================================================\n// Visibility\n// =============================================================================\n\nfunction computeVisibleSections(\n  sections: OmSection[],\n  answers: Record<string, unknown>,\n  hidden: Record<string, unknown>,\n  variables: Record<string, unknown>,\n): Set<string> {\n  const visible = new Set<string>()\n  for (const section of sections) {\n    if (section.kind === 'ending') {\n      // Endings never appear via natural flow \u2014 only via jumps. Mark visible\n      // so consumers can render them when reached, but the navigation layer\n      // gates them.\n      visible.add(section.key)\n      continue\n    }\n    const predicate = (section as Record<string, unknown>)['x-om-visibility-if']\n    if (predicate === undefined) {\n      visible.add(section.key)\n      continue\n    }\n    if (predicateTruthy(predicate, { answers, hidden, variables })) {\n      visible.add(section.key)\n    }\n  }\n  return visible\n}\n\nfunction computeVisibleFields(\n  sections: OmSection[],\n  properties: Record<string, FieldNodeLike>,\n  visibleSectionKeys: Set<string>,\n  answers: Record<string, unknown>,\n  hidden: Record<string, unknown>,\n  variables: Record<string, unknown>,\n): Set<string> {\n  const visible = new Set<string>()\n  const sectionByField = new Map<string, string>()\n  for (const section of sections) {\n    for (const key of section.fieldKeys) {\n      if (!sectionByField.has(key)) sectionByField.set(key, section.key)\n    }\n  }\n  for (const [fieldKey, node] of Object.entries(properties)) {\n    const sectionKey = sectionByField.get(fieldKey)\n    if (sectionKey !== undefined && !visibleSectionKeys.has(sectionKey)) {\n      continue\n    }\n    if (sectionKey !== undefined) {\n      const owningSection = sections.find((s) => s.key === sectionKey)\n      if (owningSection?.kind === 'ending') {\n        continue\n      }\n    }\n    const predicate = (node as Record<string, unknown>)[OM_FIELD_KEYWORDS.visibilityIf]\n    if (predicate === undefined) {\n      visible.add(fieldKey)\n      continue\n    }\n    if (predicateTruthy(predicate, { answers, hidden, variables })) {\n      visible.add(fieldKey)\n    }\n  }\n  return visible\n}\n\n// =============================================================================\n// Jumps\n// =============================================================================\n\nfunction resolveNextTarget(input: {\n  schemaSections: OmSection[]\n  jumps: OmJumpRule[]\n  fromPageKey: string\n  answers: Record<string, unknown>\n  hidden: Record<string, unknown>\n  variables: Record<string, unknown>\n  visibleSectionKeys: Set<string>\n}): JumpTarget {\n  const { schemaSections, jumps, fromPageKey, answers, hidden, variables, visibleSectionKeys } = input\n  const rule = jumps.find((entry) => entry.from.type === 'page' && entry.from.pageKey === fromPageKey)\n  if (!rule) return { type: 'next' }\n  for (const branch of rule.rules) {\n    if (predicateTruthy(branch.if, { answers, hidden, variables })) {\n      return ensureReachableTarget(branch.goto, schemaSections, visibleSectionKeys)\n    }\n  }\n  if (rule.otherwise) {\n    return ensureReachableTarget(rule.otherwise, schemaSections, visibleSectionKeys)\n  }\n  return { type: 'next' }\n}\n\nfunction ensureReachableTarget(\n  target: JumpTarget,\n  sections: OmSection[],\n  visibleSectionKeys: Set<string>,\n): JumpTarget {\n  if (target.type === 'page') {\n    const exists = sections.some((s) => s.key === target.pageKey && (s.kind === 'page' || s.kind === undefined))\n    if (!exists) return { type: 'next' }\n    return target\n  }\n  if (target.type === 'ending') {\n    const exists = sections.some((s) => s.key === target.endingKey && s.kind === 'ending')\n    if (!exists) return { type: 'next' }\n    return target\n  }\n  return target\n}\n\n// =============================================================================\n// Predicate runtime (jsonlogic subset bound to the grammar)\n// =============================================================================\n\ntype PredicateContext = {\n  answers: Record<string, unknown>\n  hidden: Record<string, unknown>\n  variables: Record<string, unknown>\n}\n\nfunction predicateTruthy(expression: unknown, context: PredicateContext): boolean {\n  try {\n    const result = evaluateExpression(expression, context)\n    return truthy(result)\n  } catch {\n    return false\n  }\n}\n\nexport function evaluateExpression(\n  expression: unknown,\n  context: PredicateContext,\n  options: { maxDepth?: number; maxNodes?: number } = {},\n): unknown {\n  const counter = { count: 0 }\n  return evaluateInner(\n    expression,\n    context,\n    0,\n    options.maxDepth ?? DEFAULT_MAX_DEPTH,\n    options.maxNodes ?? DEFAULT_MAX_NODES,\n    counter,\n  )\n}\n\nfunction evaluateInner(\n  expression: unknown,\n  context: PredicateContext,\n  depth: number,\n  maxDepth: number,\n  maxNodes: number,\n  counter: { count: number },\n): unknown {\n  counter.count += 1\n  if (counter.count > maxNodes) {\n    throw new LogicEvaluatorError('NODE_LIMIT_EXCEEDED', 'Expression evaluated too many nodes.')\n  }\n  if (depth > maxDepth) {\n    throw new LogicEvaluatorError('DEPTH_LIMIT_EXCEEDED', 'Expression nesting exceeds the depth limit.')\n  }\n  if (expression === null || expression === undefined) return expression\n  if (typeof expression !== 'object') return expression\n  if (Array.isArray(expression)) {\n    return expression.map((entry) =>\n      evaluateInner(entry, context, depth + 1, maxDepth, maxNodes, counter),\n    )\n  }\n  const keys = Object.keys(expression as Record<string, unknown>)\n  if (keys.length === 0) return undefined\n  if (keys.length !== 1) {\n    throw new LogicEvaluatorError('INVALID_NODE', 'Expression nodes must have exactly one key.')\n  }\n  const op = keys[0]\n  if (!ALLOWED_JSONLOGIC_OPS.has(op)) {\n    throw new LogicEvaluatorError('UNSUPPORTED_OP', `Operator \"${op}\" is not in the jsonlogic grammar.`)\n  }\n  const args = (expression as Record<string, unknown>)[op]\n  return applyOperator(op, args, context, depth, maxDepth, maxNodes, counter)\n}\n\nfunction applyOperator(\n  op: string,\n  args: unknown,\n  context: PredicateContext,\n  depth: number,\n  maxDepth: number,\n  maxNodes: number,\n  counter: { count: number },\n): unknown {\n  const evalArg = (value: unknown) =>\n    evaluateInner(value, context, depth + 1, maxDepth, maxNodes, counter)\n\n  switch (op) {\n    case 'var': {\n      const path = Array.isArray(args) ? args[0] : args\n      if (typeof path !== 'string') return undefined\n      return resolveVar(path, context)\n    }\n    case 'if': {\n      const list = Array.isArray(args) ? args : [args]\n      for (let i = 0; i + 1 < list.length; i += 2) {\n        if (truthy(evalArg(list[i]))) return evalArg(list[i + 1])\n      }\n      if (list.length % 2 === 1) return evalArg(list[list.length - 1])\n      return undefined\n    }\n    case 'and': {\n      const list = Array.isArray(args) ? args : [args]\n      let value: unknown = true\n      for (const entry of list) {\n        value = evalArg(entry)\n        if (!truthy(value)) return value\n      }\n      return value\n    }\n    case 'or': {\n      const list = Array.isArray(args) ? args : [args]\n      let value: unknown = false\n      for (const entry of list) {\n        value = evalArg(entry)\n        if (truthy(value)) return value\n      }\n      return value\n    }\n    case 'not':\n    case '!': {\n      const single = Array.isArray(args) ? args[0] : args\n      return !truthy(evalArg(single))\n    }\n    case '!!': {\n      const single = Array.isArray(args) ? args[0] : args\n      return truthy(evalArg(single))\n    }\n    case '==': {\n      const [a, b] = pair(args, evalArg)\n      // eslint-disable-next-line eqeqeq\n      return a == b\n    }\n    case '!=': {\n      const [a, b] = pair(args, evalArg)\n      // eslint-disable-next-line eqeqeq\n      return a != b\n    }\n    case '===': {\n      const [a, b] = pair(args, evalArg)\n      return a === b\n    }\n    case '!==': {\n      const [a, b] = pair(args, evalArg)\n      return a !== b\n    }\n    case '>': {\n      const [a, b] = pair(args, evalArg)\n      return Number(a) > Number(b)\n    }\n    case '<': {\n      const [a, b] = pair(args, evalArg)\n      return Number(a) < Number(b)\n    }\n    case '>=': {\n      const [a, b] = pair(args, evalArg)\n      return Number(a) >= Number(b)\n    }\n    case '<=': {\n      const [a, b] = pair(args, evalArg)\n      return Number(a) <= Number(b)\n    }\n    case '+': {\n      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)]\n      return list.reduce<number>((acc, entry) => acc + (Number(entry) || 0), 0)\n    }\n    case '-': {\n      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)]\n      if (list.length === 0) return 0\n      if (list.length === 1) return -Number(list[0])\n      return list.slice(1).reduce<number>((acc, entry) => acc - (Number(entry) || 0), Number(list[0]) || 0)\n    }\n    case '*': {\n      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)]\n      return list.reduce<number>((acc, entry) => acc * (Number(entry) || 0), 1)\n    }\n    case '/': {\n      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)]\n      if (list.length < 2) return 0\n      const denom = Number(list[1]) || 0\n      if (denom === 0) return 0\n      return (Number(list[0]) || 0) / denom\n    }\n    case '%': {\n      const list = Array.isArray(args) ? args.map(evalArg) : [evalArg(args)]\n      if (list.length < 2) return 0\n      const denom = Number(list[1]) || 0\n      if (denom === 0) return 0\n      return (Number(list[0]) || 0) % denom\n    }\n    case 'in': {\n      const [needle, haystack] = pair(args, evalArg)\n      if (Array.isArray(haystack)) return haystack.includes(needle)\n      if (typeof haystack === 'string' && typeof needle === 'string') return haystack.includes(needle)\n      return false\n    }\n  }\n  throw new LogicEvaluatorError('UNSUPPORTED_OP', `Operator \"${op}\" is not in the jsonlogic grammar.`)\n}\n\nfunction pair(args: unknown, evalArg: (value: unknown) => unknown): [unknown, unknown] {\n  if (!Array.isArray(args) || args.length < 2) {\n    throw new LogicEvaluatorError('INVALID_ARGS', 'Comparison ops require two arguments.')\n  }\n  return [evalArg(args[0]), evalArg(args[1])]\n}\n\nfunction resolveVar(path: string, context: PredicateContext): unknown {\n  if (!path) return undefined\n  const { namespace, name } = classifyVarPath(path)\n  const source = namespace === 'variable'\n    ? context.variables\n    : namespace === 'hidden'\n      ? context.hidden\n      : context.answers\n  if (!source) return undefined\n  if (!name) return source\n  let cursor: unknown = source\n  for (const segment of name.split('.')) {\n    if (cursor === null || cursor === undefined) return undefined\n    if (typeof cursor !== 'object') return undefined\n    cursor = (cursor as Record<string, unknown>)[segment]\n  }\n  return cursor\n}\n\nfunction truthy(value: unknown): boolean {\n  if (value === null || value === undefined) return false\n  if (typeof value === 'boolean') return value\n  if (typeof value === 'number') return value !== 0 && !Number.isNaN(value)\n  if (typeof value === 'string') return value.length > 0\n  if (Array.isArray(value)) return value.length > 0\n  return true\n}\n\n// =============================================================================\n// Recall tokens \u2014 pure resolver (shared with studio/recall.ts for tokenizing)\n// =============================================================================\n\ntype RecallResolutionContext = {\n  answers: Record<string, unknown>\n  hidden: Record<string, unknown>\n  variables: Record<string, unknown>\n  sensitiveFields: Set<string>\n}\n\nfunction resolveRecallTokens(\n  text: LocalizedText | string | undefined,\n  context: RecallResolutionContext,\n  locale: string,\n): string {\n  if (text === undefined || text === null) return ''\n  const source = typeof text === 'string' ? text : pickLocale(text, locale)\n  if (!source) return ''\n  return source.replace(/@@\\{/g, '\u0000ESC\u0000').replace(RECALL_PATTERN, (_, identifier) => {\n    const value = lookupRecall(identifier, context)\n    if (value === undefined || value === null) return ''\n    return formatRecallValue(value, locale)\n  }).replace(/\u0000ESC\u0000/g, '@{')\n}\n\nfunction pickLocale(text: LocalizedText, locale: string): string {\n  if (text[locale]) return text[locale]\n  if (text.en) return text.en\n  const first = Object.values(text)[0]\n  return typeof first === 'string' ? first : ''\n}\n\nfunction lookupRecall(identifier: string, context: RecallResolutionContext): unknown {\n  const { namespace, name } = classifyVarPath(identifier)\n  if (!name) return undefined\n  if (namespace === 'variable') return readNested(context.variables, name)\n  if (namespace === 'hidden') return readNested(context.hidden, name)\n  if (context.sensitiveFields.has(name.split('.')[0])) return undefined\n  return readNested(context.answers, name)\n}\n\nfunction readNested(source: Record<string, unknown>, path: string): unknown {\n  let cursor: unknown = source\n  for (const segment of path.split('.')) {\n    if (cursor === null || cursor === undefined) return undefined\n    if (typeof cursor !== 'object') return undefined\n    cursor = (cursor as Record<string, unknown>)[segment]\n  }\n  return cursor\n}\n\nfunction formatRecallValue(value: unknown, locale: string): string {\n  if (typeof value === 'number') {\n    try {\n      return new Intl.NumberFormat(locale).format(value)\n    } catch {\n      return String(value)\n    }\n  }\n  if (typeof value === 'boolean') return value ? 'true' : 'false'\n  if (value instanceof Date) return value.toLocaleString(locale)\n  if (Array.isArray(value)) return value.map((entry) => formatRecallValue(entry, locale)).join(', ')\n  return String(value)\n}\n"],
+  "mappings": "AAYA;AAAA,EACE;AAAA,EACA;AAAA,OAQK;AACP;AAAA,EACE;AAAA,EACA;AAAA,OACK;AAEA,MAAM,4BAA4B,MAAM;AAAA,EAE7C,YAAY,MAAc,SAAiB;AACzC,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EACd;AACF;AAuBA,MAAM,oBAAoB;AAC1B,MAAM,oBAAoB;AAC1B,MAAM,iBAAiB;AAEvB,MAAM,oBAAoB;AAWnB,SAAS,kBACd,QACA,SACY;AACZ,QAAM,UAAU,QAAQ,WAAW,CAAC;AACpC,QAAM,SAAS,QAAQ,UAAU,CAAC;AAClC,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,WAAW,aAAa,MAAM;AACpC,QAAM,aAAa,eAAe,MAAM;AACxC,QAAM,gBAAgB,cAAc,MAAM;AAC1C,QAAM,cAAc,iBAAiB,MAAM;AAC3C,QAAM,QAAQ,UAAU,MAAM;AAE9B,QAAM,iBAAiB,sBAAsB,QAAQ,WAAW;AAChE,QAAM,YAAY,iBAAiB,eAAe,SAAS,cAAc;AAEzE,QAAM,qBAAqB,uBAAuB,UAAU,SAAS,gBAAgB,SAAS;AAC9F,QAAM,mBAAmB;AAAA,IACvB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,QAAM,kBAAkB,uBAAuB,UAAU;AAEzD,QAAM,gBAAgB,CAAC,MAA0C,oBAAoC;AACnG,WAAO,oBAAoB,MAAM;AAAA,MAC/B;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,IACF,GAAG,mBAAmB,MAAM;AAAA,EAC9B;AAEA,QAAM,aAAa,CAAC,gBAAoC;AACtD,WAAO,kBAAkB;AAAA,MACvB,gBAAgB;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,WAAW,OAAO,OAAO,EAAE,GAAG,UAAU,CAAC;AAAA,IACzC;AAAA,IACA;AAAA,EACF;AACF;AAMA,SAAS,aAAa,QAAiC;AACrD,QAAM,QAAQ,OAAO,iBAAiB,QAAQ;AAC9C,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACnC,SAAO,MAAM,OAAO,CAAC,UAA8B,CAAC,CAAC,SAAS,OAAO,UAAU,QAAQ;AACzF;AAEA,SAAS,eAAe,QAAmD;AACzE,QAAM,QAAQ,OAAO;AACrB,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACzE,SAAO;AACT;AAEA,SAAS,cAAc,QAAsC;AAC3D,QAAM,QAAQ,OAAO,iBAAiB,SAAS;AAC/C,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACnC,SAAO;AACT;AAEA,SAAS,iBAAiB,QAAyC;AACjE,QAAM,QAAQ,OAAO,iBAAiB,YAAY;AAClD,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACnC,SAAO;AACT;AAEA,SAAS,UAAU,QAAkC;AACnD,QAAM,QAAQ,OAAO,iBAAiB,KAAK;AAC3C,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACnC,SAAO;AACT;AAEA,SAAS,uBAAuB,YAAwD;AACtF,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,UAAU,GAAG;AACpD,QAAI,QAAS,KAAiC,iBAAiB,MAAM,MAAM;AACzE,UAAI,IAAI,GAAG;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,sBACP,QACA,cACyB;AACzB,QAAM,SAAkC,EAAE,GAAG,OAAO;AACpD,aAAW,QAAQ,cAAc;AAC/B,QAAI,EAAE,KAAK,QAAQ,WAAW,OAAO,KAAK,IAAI,MAAM,UAAa,OAAO,KAAK,IAAI,MAAM,MAAM;AAC3F,UAAI,KAAK,iBAAiB,QAAW;AACnC,eAAO,KAAK,IAAI,IAAI,KAAK;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,iBACP,cACA,SACA,QACyB;AACzB,MAAI,aAAa,WAAW,EAAG,QAAO,CAAC;AACvC,QAAM,SAAS,oBAAI,IAA4B;AAC/C,aAAW,QAAQ,cAAc;AAC/B,WAAO,IAAI,KAAK,MAAM,IAAI;AAAA,EAC5B;AACA,QAAM,QAAQ,iBAAiB,cAAc,MAAM;AACnD,QAAM,WAAoC,CAAC;AAC3C,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,OAAO,IAAI,IAAI;AAC5B,QAAI,CAAC,KAAM;AACX,QAAI;AACF,YAAM,MAAM,mBAAmB,KAAK,SAAS;AAAA,QAC3C;AAAA,QACA;AAAA,QACA,WAAW;AAAA,MACb,CAAC;AACD,eAAS,IAAI,IAAI,oBAAoB,KAAK,KAAK,MAAM,KAAK,OAAO;AAAA,IACnE,QAAQ;AACN,eAAS,IAAI,IAAI,KAAK,YAAY,SAAY,KAAK,UAAU,eAAe,KAAK,IAAI;AAAA,IACvF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iBACP,cACA,QACU;AACV,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,WAAW,oBAAI,IAAY;AACjC,QAAM,QAAkB,CAAC;AAEzB,WAAS,MAAM,MAAc,OAAuB;AAClD,QAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,QAAI,SAAS,IAAI,IAAI,GAAG;AACtB,YAAM,IAAI,oBAAoB,kBAAkB,4BAA4B,CAAC,GAAG,OAAO,IAAI,EAAE,KAAK,UAAK,CAAC,EAAE;AAAA,IAC5G;AACA,UAAM,OAAO,OAAO,IAAI,IAAI;AAC5B,QAAI,CAAC,KAAM;AACX,aAAS,IAAI,IAAI;AACjB,eAAW,OAAO,4BAA4B,KAAK,OAAO,GAAG;AAC3D,UAAI,OAAO,IAAI,GAAG,EAAG,OAAM,KAAK,CAAC,GAAG,OAAO,IAAI,CAAC;AAAA,IAClD;AACA,aAAS,OAAO,IAAI;AACpB,YAAQ,IAAI,IAAI;AAChB,UAAM,KAAK,IAAI;AAAA,EACjB;AAEA,aAAW,QAAQ,cAAc;AAC/B,UAAM,KAAK,MAAM,CAAC,CAAC;AAAA,EACrB;AACA,SAAO;AACT;AAEA,SAAS,4BAA4B,YAA+B;AAClE,QAAM,OAAO,oBAAI,IAAY;AAC7B,oBAAkB,YAAY,CAAC,SAAS;AACtC,UAAM,EAAE,WAAW,KAAK,IAAI,gBAAgB,IAAI;AAChD,QAAI,cAAc,WAAY,MAAK,IAAI,KAAK,MAAM,GAAG,EAAE,CAAC,CAAC;AAAA,EAC3D,CAAC;AACD,SAAO,CAAC,GAAG,IAAI;AACjB;AAEA,SAAS,kBAAkB,YAAqB,UAAwC;AACtF,MAAI,eAAe,QAAQ,eAAe,OAAW;AACrD,MAAI,OAAO,eAAe,SAAU;AACpC,MAAI,MAAM,QAAQ,UAAU,GAAG;AAC7B,eAAW,SAAS,WAAY,mBAAkB,OAAO,QAAQ;AACjE;AAAA,EACF;AACA,QAAM,OAAO,OAAO,KAAK,UAAqC;AAC9D,MAAI,KAAK,WAAW,EAAG;AACvB,QAAM,KAAK,KAAK,CAAC;AACjB,QAAM,OAAQ,WAAuC,EAAE;AACvD,MAAI,OAAO,OAAO;AAChB,UAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,CAAC,IAAI;AAC7C,QAAI,OAAO,SAAS,SAAU,UAAS,IAAI;AAC3C;AAAA,EACF;AACA,oBAAkB,MAAM,QAAQ;AAClC;AAEA,SAAS,oBACP,KACA,MACA,UACS;AACT,MAAI,SAAS,UAAU;AACrB,UAAM,MAAM,OAAO,QAAQ,WAAW,MAAM,OAAO,GAAG;AACtD,QAAI,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO,OAAO,aAAa,WAAW,WAAW;AAC5E,WAAO;AAAA,EACT;AACA,MAAI,SAAS,WAAW;AACtB,WAAO,QAAQ,GAAG;AAAA,EACpB;AACA,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,MAAI,QAAQ,QAAQ,QAAQ,OAAW,QAAO,OAAO,aAAa,WAAW,WAAW;AACxF,SAAO,OAAO,GAAG;AACnB;AAEA,SAAS,eAAe,MAAmC;AACzD,MAAI,SAAS,SAAU,QAAO;AAC9B,MAAI,SAAS,UAAW,QAAO;AAC/B,SAAO;AACT;AAMA,SAAS,uBACP,UACA,SACA,QACA,WACa;AACb,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,WAAW,UAAU;AAC9B,QAAI,QAAQ,SAAS,UAAU;AAI7B,cAAQ,IAAI,QAAQ,GAAG;AACvB;AAAA,IACF;AACA,UAAM,YAAa,QAAoC,oBAAoB;AAC3E,QAAI,cAAc,QAAW;AAC3B,cAAQ,IAAI,QAAQ,GAAG;AACvB;AAAA,IACF;AACA,QAAI,gBAAgB,WAAW,EAAE,SAAS,QAAQ,UAAU,CAAC,GAAG;AAC9D,cAAQ,IAAI,QAAQ,GAAG;AAAA,IACzB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,qBACP,UACA,YACA,oBACA,SACA,QACA,WACa;AACb,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,aAAW,WAAW,UAAU;AAC9B,eAAW,OAAO,QAAQ,WAAW;AACnC,UAAI,CAAC,eAAe,IAAI,GAAG,EAAG,gBAAe,IAAI,KAAK,QAAQ,GAAG;AAAA,IACnE;AAAA,EACF;AACA,aAAW,CAAC,UAAU,IAAI,KAAK,OAAO,QAAQ,UAAU,GAAG;AACzD,UAAM,aAAa,eAAe,IAAI,QAAQ;AAC9C,QAAI,eAAe,UAAa,CAAC,mBAAmB,IAAI,UAAU,GAAG;AACnE;AAAA,IACF;AACA,QAAI,eAAe,QAAW;AAC5B,YAAM,gBAAgB,SAAS,KAAK,CAAC,MAAM,EAAE,QAAQ,UAAU;AAC/D,UAAI,eAAe,SAAS,UAAU;AACpC;AAAA,MACF;AAAA,IACF;AACA,UAAM,YAAa,KAAiC,kBAAkB,YAAY;AAClF,QAAI,cAAc,QAAW;AAC3B,cAAQ,IAAI,QAAQ;AACpB;AAAA,IACF;AACA,QAAI,gBAAgB,WAAW,EAAE,SAAS,QAAQ,UAAU,CAAC,GAAG;AAC9D,cAAQ,IAAI,QAAQ;AAAA,IACtB;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,kBAAkB,OAQZ;AACb,QAAM,EAAE,gBAAgB,OAAO,aAAa,SAAS,QAAQ,WAAW,mBAAmB,IAAI;AAC/F,QAAM,OAAO,MAAM,KAAK,CAAC,UAAU,MAAM,KAAK,SAAS,UAAU,MAAM,KAAK,YAAY,WAAW;AACnG,MAAI,CAAC,KAAM,QAAO,EAAE,MAAM,OAAO;AACjC,aAAW,UAAU,KAAK,OAAO;AAC/B,QAAI,gBAAgB,OAAO,IAAI,EAAE,SAAS,QAAQ,UAAU,CAAC,GAAG;AAC9D,aAAO,sBAAsB,OAAO,MAAM,gBAAgB,kBAAkB;AAAA,IAC9E;AAAA,EACF;AACA,MAAI,KAAK,WAAW;AAClB,WAAO,sBAAsB,KAAK,WAAW,gBAAgB,kBAAkB;AAAA,EACjF;AACA,SAAO,EAAE,MAAM,OAAO;AACxB;AAEA,SAAS,sBACP,QACA,UACA,oBACY;AACZ,MAAI,OAAO,SAAS,QAAQ;AAC1B,UAAM,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO,YAAY,EAAE,SAAS,UAAU,EAAE,SAAS,OAAU;AAC3G,QAAI,CAAC,OAAQ,QAAO,EAAE,MAAM,OAAO;AACnC,WAAO;AAAA,EACT;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,UAAM,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO,aAAa,EAAE,SAAS,QAAQ;AACrF,QAAI,CAAC,OAAQ,QAAO,EAAE,MAAM,OAAO;AACnC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAYA,SAAS,gBAAgB,YAAqB,SAAoC;AAChF,MAAI;AACF,UAAM,SAAS,mBAAmB,YAAY,OAAO;AACrD,WAAO,OAAO,MAAM;AAAA,EACtB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,mBACd,YACA,SACA,UAAoD,CAAC,GAC5C;AACT,QAAM,UAAU,EAAE,OAAO,EAAE;AAC3B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,YAAY;AAAA,IACpB,QAAQ,YAAY;AAAA,IACpB;AAAA,EACF;AACF;AAEA,SAAS,cACP,YACA,SACA,OACA,UACA,UACA,SACS;AACT,UAAQ,SAAS;AACjB,MAAI,QAAQ,QAAQ,UAAU;AAC5B,UAAM,IAAI,oBAAoB,uBAAuB,sCAAsC;AAAA,EAC7F;AACA,MAAI,QAAQ,UAAU;AACpB,UAAM,IAAI,oBAAoB,wBAAwB,6CAA6C;AAAA,EACrG;AACA,MAAI,eAAe,QAAQ,eAAe,OAAW,QAAO;AAC5D,MAAI,OAAO,eAAe,SAAU,QAAO;AAC3C,MAAI,MAAM,QAAQ,UAAU,GAAG;AAC7B,WAAO,WAAW;AAAA,MAAI,CAAC,UACrB,cAAc,OAAO,SAAS,QAAQ,GAAG,UAAU,UAAU,OAAO;AAAA,IACtE;AAAA,EACF;AACA,QAAM,OAAO,OAAO,KAAK,UAAqC;AAC9D,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,MAAI,KAAK,WAAW,GAAG;AACrB,UAAM,IAAI,oBAAoB,gBAAgB,6CAA6C;AAAA,EAC7F;AACA,QAAM,KAAK,KAAK,CAAC;AACjB,MAAI,CAAC,sBAAsB,IAAI,EAAE,GAAG;AAClC,UAAM,IAAI,oBAAoB,kBAAkB,aAAa,EAAE,oCAAoC;AAAA,EACrG;AACA,QAAM,OAAQ,WAAuC,EAAE;AACvD,SAAO,cAAc,IAAI,MAAM,SAAS,OAAO,UAAU,UAAU,OAAO;AAC5E;AAEA,SAAS,cACP,IACA,MACA,SACA,OACA,UACA,UACA,SACS;AACT,QAAM,UAAU,CAAC,UACf,cAAc,OAAO,SAAS,QAAQ,GAAG,UAAU,UAAU,OAAO;AAEtE,UAAQ,IAAI;AAAA,IACV,KAAK,OAAO;AACV,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,CAAC,IAAI;AAC7C,UAAI,OAAO,SAAS,SAAU,QAAO;AACrC,aAAO,WAAW,MAAM,OAAO;AAAA,IACjC;AAAA,IACA,KAAK,MAAM;AACT,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;AAC/C,eAAS,IAAI,GAAG,IAAI,IAAI,KAAK,QAAQ,KAAK,GAAG;AAC3C,YAAI,OAAO,QAAQ,KAAK,CAAC,CAAC,CAAC,EAAG,QAAO,QAAQ,KAAK,IAAI,CAAC,CAAC;AAAA,MAC1D;AACA,UAAI,KAAK,SAAS,MAAM,EAAG,QAAO,QAAQ,KAAK,KAAK,SAAS,CAAC,CAAC;AAC/D,aAAO;AAAA,IACT;AAAA,IACA,KAAK,OAAO;AACV,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;AAC/C,UAAI,QAAiB;AACrB,iBAAW,SAAS,MAAM;AACxB,gBAAQ,QAAQ,KAAK;AACrB,YAAI,CAAC,OAAO,KAAK,EAAG,QAAO;AAAA,MAC7B;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,MAAM;AACT,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;AAC/C,UAAI,QAAiB;AACrB,iBAAW,SAAS,MAAM;AACxB,gBAAQ,QAAQ,KAAK;AACrB,YAAI,OAAO,KAAK,EAAG,QAAO;AAAA,MAC5B;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK;AAAA,IACL,KAAK,KAAK;AACR,YAAM,SAAS,MAAM,QAAQ,IAAI,IAAI,KAAK,CAAC,IAAI;AAC/C,aAAO,CAAC,OAAO,QAAQ,MAAM,CAAC;AAAA,IAChC;AAAA,IACA,KAAK,MAAM;AACT,YAAM,SAAS,MAAM,QAAQ,IAAI,IAAI,KAAK,CAAC,IAAI;AAC/C,aAAO,OAAO,QAAQ,MAAM,CAAC;AAAA,IAC/B;AAAA,IACA,KAAK,MAAM;AACT,YAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,OAAO;AAEjC,aAAO,KAAK;AAAA,IACd;AAAA,IACA,KAAK,MAAM;AACT,YAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,OAAO;AAEjC,aAAO,KAAK;AAAA,IACd;AAAA,IACA,KAAK,OAAO;AACV,YAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,OAAO;AACjC,aAAO,MAAM;AAAA,IACf;AAAA,IACA,KAAK,OAAO;AACV,YAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,OAAO;AACjC,aAAO,MAAM;AAAA,IACf;AAAA,IACA,KAAK,KAAK;AACR,YAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,OAAO;AACjC,aAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,IAC7B;AAAA,IACA,KAAK,KAAK;AACR,YAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,OAAO;AACjC,aAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAAA,IAC7B;AAAA,IACA,KAAK,MAAM;AACT,YAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,OAAO;AACjC,aAAO,OAAO,CAAC,KAAK,OAAO,CAAC;AAAA,IAC9B;AAAA,IACA,KAAK,MAAM;AACT,YAAM,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,OAAO;AACjC,aAAO,OAAO,CAAC,KAAK,OAAO,CAAC;AAAA,IAC9B;AAAA,IACA,KAAK,KAAK;AACR,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,CAAC;AACrE,aAAO,KAAK,OAAe,CAAC,KAAK,UAAU,OAAO,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,IAC1E;AAAA,IACA,KAAK,KAAK;AACR,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,CAAC;AACrE,UAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,UAAI,KAAK,WAAW,EAAG,QAAO,CAAC,OAAO,KAAK,CAAC,CAAC;AAC7C,aAAO,KAAK,MAAM,CAAC,EAAE,OAAe,CAAC,KAAK,UAAU,OAAO,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,CAAC,CAAC,KAAK,CAAC;AAAA,IACtG;AAAA,IACA,KAAK,KAAK;AACR,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,CAAC;AACrE,aAAO,KAAK,OAAe,CAAC,KAAK,UAAU,OAAO,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,IAC1E;AAAA,IACA,KAAK,KAAK;AACR,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,CAAC;AACrE,UAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,YAAM,QAAQ,OAAO,KAAK,CAAC,CAAC,KAAK;AACjC,UAAI,UAAU,EAAG,QAAO;AACxB,cAAQ,OAAO,KAAK,CAAC,CAAC,KAAK,KAAK;AAAA,IAClC;AAAA,IACA,KAAK,KAAK;AACR,YAAM,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,CAAC;AACrE,UAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,YAAM,QAAQ,OAAO,KAAK,CAAC,CAAC,KAAK;AACjC,UAAI,UAAU,EAAG,QAAO;AACxB,cAAQ,OAAO,KAAK,CAAC,CAAC,KAAK,KAAK;AAAA,IAClC;AAAA,IACA,KAAK,MAAM;AACT,YAAM,CAAC,QAAQ,QAAQ,IAAI,KAAK,MAAM,OAAO;AAC7C,UAAI,MAAM,QAAQ,QAAQ,EAAG,QAAO,SAAS,SAAS,MAAM;AAC5D,UAAI,OAAO,aAAa,YAAY,OAAO,WAAW,SAAU,QAAO,SAAS,SAAS,MAAM;AAC/F,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,IAAI,oBAAoB,kBAAkB,aAAa,EAAE,oCAAoC;AACrG;AAEA,SAAS,KAAK,MAAe,SAA0D;AACrF,MAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,GAAG;AAC3C,UAAM,IAAI,oBAAoB,gBAAgB,uCAAuC;AAAA,EACvF;AACA,SAAO,CAAC,QAAQ,KAAK,CAAC,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC;AAC5C;AAEA,SAAS,WAAW,MAAc,SAAoC;AACpE,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,EAAE,WAAW,KAAK,IAAI,gBAAgB,IAAI;AAChD,QAAM,SAAS,cAAc,aACzB,QAAQ,YACR,cAAc,WACZ,QAAQ,SACR,QAAQ;AACd,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,SAAkB;AACtB,aAAW,WAAW,KAAK,MAAM,GAAG,GAAG;AACrC,QAAI,WAAW,QAAQ,WAAW,OAAW,QAAO;AACpD,QAAI,OAAO,WAAW,SAAU,QAAO;AACvC,aAAU,OAAmC,OAAO;AAAA,EACtD;AACA,SAAO;AACT;AAEA,SAAS,OAAO,OAAyB;AACvC,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO;AAClD,MAAI,OAAO,UAAU,UAAW,QAAO;AACvC,MAAI,OAAO,UAAU,SAAU,QAAO,UAAU,KAAK,CAAC,OAAO,MAAM,KAAK;AACxE,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,SAAS;AACrD,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,SAAS;AAChD,SAAO;AACT;AAaA,SAAS,oBACP,MACA,SACA,QACQ;AACR,MAAI,SAAS,UAAa,SAAS,KAAM,QAAO;AAChD,QAAM,SAAS,OAAO,SAAS,WAAW,OAAO,WAAW,MAAM,MAAM;AACxE,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,OAAO,QAAQ,SAAS,SAAO,EAAE,QAAQ,gBAAgB,CAAC,GAAG,eAAe;AACjF,UAAM,QAAQ,aAAa,YAAY,OAAO;AAC9C,QAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,WAAO,kBAAkB,OAAO,MAAM;AAAA,EACxC,CAAC,EAAE,QAAQ,UAAU,IAAI;AAC3B;AAEA,SAAS,WAAW,MAAqB,QAAwB;AAC/D,MAAI,KAAK,MAAM,EAAG,QAAO,KAAK,MAAM;AACpC,MAAI,KAAK,GAAI,QAAO,KAAK;AACzB,QAAM,QAAQ,OAAO,OAAO,IAAI,EAAE,CAAC;AACnC,SAAO,OAAO,UAAU,WAAW,QAAQ;AAC7C;AAEA,SAAS,aAAa,YAAoB,SAA2C;AACnF,QAAM,EAAE,WAAW,KAAK,IAAI,gBAAgB,UAAU;AACtD,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,cAAc,WAAY,QAAO,WAAW,QAAQ,WAAW,IAAI;AACvE,MAAI,cAAc,SAAU,QAAO,WAAW,QAAQ,QAAQ,IAAI;AAClE,MAAI,QAAQ,gBAAgB,IAAI,KAAK,MAAM,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAC5D,SAAO,WAAW,QAAQ,SAAS,IAAI;AACzC;AAEA,SAAS,WAAW,QAAiC,MAAuB;AAC1E,MAAI,SAAkB;AACtB,aAAW,WAAW,KAAK,MAAM,GAAG,GAAG;AACrC,QAAI,WAAW,QAAQ,WAAW,OAAW,QAAO;AACpD,QAAI,OAAO,WAAW,SAAU,QAAO;AACvC,aAAU,OAAmC,OAAO;AAAA,EACtD;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,OAAgB,QAAwB;AACjE,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI;AACF,aAAO,IAAI,KAAK,aAAa,MAAM,EAAE,OAAO,KAAK;AAAA,IACnD,QAAQ;AACN,aAAO,OAAO,KAAK;AAAA,IACrB;AAAA,EACF;AACA,MAAI,OAAO,UAAU,UAAW,QAAO,QAAQ,SAAS;AACxD,MAAI,iBAAiB,KAAM,QAAO,MAAM,eAAe,MAAM;AAC7D,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,CAAC,UAAU,kBAAkB,OAAO,MAAM,CAAC,EAAE,KAAK,IAAI;AACjG,SAAO,OAAO,KAAK;AACrB;",
+  "names": []
+}