@tangle-network/agent-runtime 0.44.0 → 0.46.0

package/dist/runtime.js

@@ -0,0 +1,114 @@
+import {
+  FileCorpus,
+  FileResultBlobStore,
+  FileSpawnJournal,
+  InMemoryCorpus,
+  InMemoryResultBlobStore,
+  InMemorySpawnJournal,
+  acquireSandbox,
+  assertTraceDerivedFindings,
+  buildSteerContext,
+  builtinShapes,
+  completionAuthorizes,
+  contentAddress,
+  createBudgetPool,
+  createDriver,
+  createExecutor,
+  createExecutorRegistry,
+  createRootHandle,
+  createSandboxForSpec,
+  createSandboxLineage,
+  createScope,
+  createScopeAnalyst,
+  createShapeRegistry,
+  createSupervisor,
+  defaultSelectWinner,
+  definePersona,
+  deterministicCompletion,
+  equalKOnCost,
+  fanout,
+  flatWidenGate,
+  inlineSandboxClient,
+  loopDispatch,
+  loopUntil,
+  materializeTreeView,
+  openSandboxRun,
+  panel,
+  pipeline,
+  probeSandboxCapabilities,
+  registerShape,
+  renderAnalyses,
+  renderCorpusToInstructions,
+  replaySpawnTree,
+  reportLoopUsage,
+  runLoop,
+  runPersonified,
+  sentinelCompletion,
+  settledToIteration,
+  spendFromUsageEvents,
+  stopSentinel,
+  trajectoryReport,
+  verify,
+  widen
+} from "./chunk-65FQLI4V.js";
+import {
+  extractLlmCallEvent,
+  mapSandboxEvent
+} from "./chunk-GSUO5QS6.js";
+import "./chunk-DGUM43GV.js";
+export {
+  FileCorpus,
+  FileResultBlobStore,
+  FileSpawnJournal,
+  InMemoryCorpus,
+  InMemoryResultBlobStore,
+  InMemorySpawnJournal,
+  acquireSandbox,
+  assertTraceDerivedFindings,
+  buildSteerContext,
+  builtinShapes,
+  completionAuthorizes,
+  contentAddress,
+  createBudgetPool,
+  createDriver,
+  createExecutor,
+  createExecutorRegistry,
+  createRootHandle,
+  createSandboxForSpec,
+  createSandboxLineage,
+  createScope,
+  createScopeAnalyst,
+  createShapeRegistry,
+  createSupervisor,
+  defaultSelectWinner,
+  definePersona,
+  deterministicCompletion,
+  equalKOnCost,
+  extractLlmCallEvent,
+  fanout,
+  flatWidenGate,
+  inlineSandboxClient,
+  loopDispatch,
+  loopUntil,
+  mapSandboxEvent,
+  materializeTreeView,
+  openSandboxRun,
+  panel,
+  pipeline,
+  probeSandboxCapabilities,
+  registerShape,
+  renderAnalyses,
+  renderCorpusToInstructions,
+  replaySpawnTree,
+  reportLoopUsage,
+  runLoop,
+  runPersonified,
+  sentinelCompletion,
+  settledToIteration,
+  spendFromUsageEvents,
+  stopSentinel,
+  trajectoryReport,
+  verify,
+  widen
+};
+//# sourceMappingURL=runtime.js.map

package/dist/runtime.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/substrate-CUgk7F7s.d.ts

@@ -0,0 +1,77 @@
+/**
+ * @experimental
+ *
+ * UI audit finding shapes — the unit of evidence a contributor can act on.
+ *
+ * A finding describes a single, actionable UI problem: lens, severity,
+ * route, observation, impact, suggested fix, and screenshot evidence.
+ * Findings are produced by the auditor profile, persisted by the issue
+ * writer as self-contained GitHub-issue Markdown, and surfaced over MCP.
+ *
+ * The shapes are deliberately constraining — the validator + writer
+ * hard-fail on missing screenshot evidence, missing lens, missing title.
+ */
+/**
+ * Canonical audit lenses. Each lens scopes a finding to a single class of
+ * problem so a single audit pass can iterate them without pile-on findings
+ * under a generic label.
+ */
+type UiLens = 'consistency' | 'hierarchy' | 'layout' | 'ux-flow' | 'duplication' | 'accessibility' | 'responsive' | 'states' | 'content' | 'interaction' | 'performance-perceived' | 'other';
+/** Frozen tuple of lenses for validation + iteration. */
+declare const UI_LENSES: readonly UiLens[];
+/**
+ * Severity scale.
+ *   - `critical` — blocks a core task or is an accessibility blocker.
+ *   - `high`     — confusing, broken-looking, or noticeable friction.
+ *   - `med`      — visible polish issue, would be caught in code review.
+ *   - `low`      — nitpick worth fixing eventually.
+ */
+type UiFindingSeverity = 'low' | 'med' | 'high' | 'critical';
+/** Frozen severity tuple, ordered worst → least bad for sort/report. */
+declare const UI_FINDING_SEVERITIES: readonly UiFindingSeverity[];
+/** Pointer to a screenshot referenced by a finding (workspace-relative path). */
+interface UiFindingScreenshot {
+    path: string;
+    viewport?: string;
+    label?: string;
+}
+/**
+ * A single UI audit finding — the unit of work a contributor can act on.
+ *
+ * Every field except the documented optionals is required. The auditor
+ * validator + writer hard-fail on missing screenshot evidence, missing
+ * lens, missing title, etc.
+ */
+interface UiFinding {
+    /** Monotonic id assigned by the writer when persisting. Optional in-transit. */
+    id?: number;
+    title: string;
+    lens: UiLens;
+    severity: UiFindingSeverity;
+    /** Logical route the finding was observed on (e.g. `home`, `checkout-step-2`). */
+    route: string;
+    /** Fully qualified URL the finding was observed at. */
+    url?: string;
+    /** Viewport string the offending capture was taken at (e.g. `1280x800`). */
+    viewport?: string;
+    /** CSS selector pinning the offending element, when one can be identified. */
+    selector?: string;
+    /** 1–3 sentences describing what the screenshot shows that is wrong. */
+    observation: string;
+    /** Who is affected and how. */
+    impact: string;
+    /** A specific change a contributor could apply without asking back. */
+    suggestedFix: string;
+    /** Optional explicit reproduction steps. Writer synthesizes from route/url/selector when omitted. */
+    reproSteps?: string;
+    /** Free-form tags. */
+    tags?: readonly string[];
+    /** Screenshot references — must be non-empty for actionable findings. */
+    screenshots: readonly UiFindingScreenshot[];
+    /** Cross-references to similar findings already on file, by id. */
+    similarTo?: readonly number[];
+    /** ISO-8601 creation timestamp set by the writer when persisted. */
+    createdAt?: string;
+}
+
+export { type UiFinding as U, type UiLens as a, UI_FINDING_SEVERITIES as b, UI_LENSES as c, type UiFindingScreenshot as d, type UiFindingSeverity as e };

package/dist/topology.d.ts

@@ -0,0 +1,73 @@
+import { R as RuntimeHooks, a as RuntimeHookEvent } from './runtime-hooks-C7JwKb9E.js';
+
+/**
+ * @experimental
+ *
+ * TOPOLOGY VIEW — the live recursive agent tree, folded from the ONE lifecycle stream
+ * (`src/runtime-hooks.ts`). It is a pure projection: feed it the `RuntimeHookEvent`s that
+ * `runLoop`, `toolLoop`, and the keystone `Scope` already emit, and it maintains the tree of
+ * agents + renders it. Attach `view.hooks` to a `Supervisor`/`runLoop` and the tree updates live.
+ *
+ * Two node sources, ONE stream:
+ *  - an agent node is born from `agent.spawn` (id = `childId`, parent = the spawner) or the root
+ *    `agent.run` (id = `runId`); `agent.child`/`agent.run:after` settle it (status + score/reason).
+ *  - a STEP (`agent.{turn,tool_call,plan,decision}`) is not a node — it advances the step count of
+ *    the agent it belongs to (matched by `runId`/`parentId`).
+ *
+ * No I/O, no timers, no backend coupling — the same projection drives a CLI render, a TUI, or a
+ * web tree. Rendering is deterministic given the event order (the stream is the source of truth).
+ */
+
+type TopologyStatus = 'running' | 'done' | 'down';
+/** One agent in the tree. A leaf never spawns; a driver's `childIds` is non-empty. */
+interface TopologyNode {
+    readonly id: string;
+    /** Display label (spawn `label`, or the driver name on the root). */
+    label: string;
+    /** Leaf runtime (`router`/`sandbox`/`cli`) when known. */
+    runtime?: string;
+    /** Parent agent id; undefined ⇒ a root. */
+    parentId?: string;
+    /** Recursion depth (root = 0). */
+    depth: number;
+    status: TopologyStatus;
+    /** Count of in-agent steps (turns + tool calls + plan/decision rounds) folded so far. */
+    steps: number;
+    /** Deployable score in [0,1] once settled `done`. */
+    score?: number;
+    /** Failure reason once settled `down`. */
+    reason?: string;
+    /** Children in spawn order. */
+    readonly childIds: string[];
+}
+interface RenderOptions {
+    /** Cap the rendered depth (deeper nodes collapse to a `… N more` line). Default: no cap. */
+    readonly maxDepth?: number;
+    /** Drop the per-node detail suffix (steps/children/score) — labels only. Default: false. */
+    readonly compact?: boolean;
+}
+interface TopologyView {
+    /** The `RuntimeHooks` sink — attach to `SupervisorOpts.hooks` / `runLoop` options. */
+    readonly hooks: RuntimeHooks;
+    /** Fold one event into the tree (the same call `hooks.onEvent` makes — exposed for replay). */
+    ingest(event: RuntimeHookEvent): void;
+    /** Every node, insertion order. */
+    nodes(): TopologyNode[];
+    /** Nodes with no in-tree parent (the run roots). */
+    roots(): TopologyNode[];
+    /** One node by id. */
+    node(id: string): TopologyNode | undefined;
+    /** Render the tree as an aligned ASCII forest. */
+    render(opts?: RenderOptions): string;
+}
+/** Build a live topology view. Stateful — one per run (or per replay). */
+declare function createTopologyView(): TopologyView;
+/** Render a forest of `TopologyNode`s to an aligned ASCII tree. Pure — given the same roots +
+ *  node lookup it returns the same string. Exposed so a caller can render a tree it folded
+ *  itself (e.g. from a journal replay) without the live view. */
+declare function renderTopologyTree(tree: {
+    roots: TopologyNode[];
+    node: (id: string) => TopologyNode | undefined;
+}, opts?: RenderOptions): string;
+
+export { type RenderOptions, type TopologyNode, type TopologyStatus, type TopologyView, createTopologyView, renderTopologyTree };

package/dist/topology.js

@@ -0,0 +1,111 @@
+import "./chunk-DGUM43GV.js";
+
+// src/topology/tree.ts
+var stepTargets = /* @__PURE__ */ new Set(["agent.turn", "agent.tool_call", "agent.plan", "agent.decision"]);
+function createTopologyView() {
+  const byId = /* @__PURE__ */ new Map();
+  const ensure = (id, seed = {}) => {
+    const existing = byId.get(id);
+    if (existing) return existing;
+    const node = {
+      id,
+      label: seed.label ?? id,
+      depth: seed.depth ?? 0,
+      status: "running",
+      steps: 0,
+      childIds: [],
+      ...seed
+    };
+    byId.set(id, node);
+    return node;
+  };
+  const str = (v) => typeof v === "string" ? v : void 0;
+  const num = (v) => typeof v === "number" ? v : void 0;
+  const ingest = (event) => {
+    const p = event.payload ?? {};
+    if (event.target === "agent.spawn" && event.phase === "after") {
+      const id = str(p.childId);
+      if (!id) return;
+      const parent = event.parentId ? ensure(event.parentId) : void 0;
+      const node = ensure(id, {
+        label: str(p.label) ?? id,
+        runtime: str(p.runtime),
+        parentId: event.parentId,
+        depth: num(p.depth) ?? (parent ? parent.depth + 1 : 0)
+      });
+      if (parent && !parent.childIds.includes(id)) parent.childIds.push(id);
+      node.status = "running";
+      return;
+    }
+    if (event.target === "agent.child" && event.phase === "after") {
+      const id = str(p.childId);
+      if (!id) return;
+      const node = ensure(id, { parentId: event.parentId });
+      node.status = str(p.status) === "down" ? "down" : "done";
+      node.score = num(p.score);
+      node.reason = str(p.reason);
+      return;
+    }
+    if (event.target === "agent.run") {
+      const node = ensure(event.runId, {
+        label: str(p.driver) ?? event.runId,
+        parentId: event.parentId
+      });
+      if (event.phase === "before") node.status = "running";
+      else if (event.phase === "error") node.status = "down";
+      else if (event.phase === "after" && node.status === "running") node.status = "done";
+      return;
+    }
+    if (stepTargets.has(event.target) && (event.phase === "after" || event.phase === "event")) {
+      const owner = event.parentId && byId.get(event.parentId) || byId.get(event.runId) || void 0;
+      if (owner) owner.steps += 1;
+    }
+  };
+  const nodes = () => [...byId.values()];
+  const roots = () => nodes().filter((n) => n.parentId === void 0 || !byId.has(n.parentId));
+  return {
+    hooks: { onEvent: (e) => ingest(e) },
+    ingest,
+    nodes,
+    roots,
+    node: (id) => byId.get(id),
+    render: (opts) => renderTopologyTree({ roots: roots(), node: (id) => byId.get(id) }, opts)
+  };
+}
+var glyph = { running: "\u25D0", done: "\u2713", down: "\u2717" };
+function renderTopologyTree(tree, opts = {}) {
+  const lines = [];
+  const detail = (n) => {
+    if (opts.compact) return "";
+    const parts = [];
+    if (n.runtime) parts.push(n.runtime);
+    if (n.steps > 0) parts.push(`${n.steps} ${n.steps === 1 ? "step" : "steps"}`);
+    if (n.childIds.length > 0) parts.push(`${n.childIds.length} children`);
+    if (n.status === "done" && n.score !== void 0) parts.push(`score ${n.score.toFixed(2)}`);
+    if (n.status === "down" && n.reason) parts.push(`down: ${n.reason}`);
+    return parts.length ? `  (${parts.join(" \xB7 ")})` : "";
+  };
+  const walk = (n, prefix, isLast, depth) => {
+    const branch = depth === 0 ? "" : isLast ? "\u2514\u2500 " : "\u251C\u2500 ";
+    lines.push(`${prefix}${branch}${glyph[n.status]} ${n.label}${detail(n)}`);
+    if (opts.maxDepth !== void 0 && depth >= opts.maxDepth && n.childIds.length > 0) {
+      const childPrefix2 = prefix + (depth === 0 ? "" : isLast ? "   " : "\u2502  ");
+      lines.push(`${childPrefix2}\u2514\u2500 \u2026 ${n.childIds.length} more`);
+      return;
+    }
+    const childPrefix = prefix + (depth === 0 ? "" : isLast ? "   " : "\u2502  ");
+    const kids = n.childIds.map((id) => tree.node(id)).filter((c) => !!c);
+    kids.forEach((c, i) => {
+      walk(c, childPrefix, i === kids.length - 1, depth + 1);
+    });
+  };
+  tree.roots.forEach((r, i) => {
+    walk(r, "", i === tree.roots.length - 1, 0);
+  });
+  return lines.join("\n");
+}
+export {
+  createTopologyView,
+  renderTopologyTree
+};
+//# sourceMappingURL=topology.js.map

package/dist/topology.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/topology/tree.ts"],"sourcesContent":["/**\n * @experimental\n *\n * TOPOLOGY VIEW — the live recursive agent tree, folded from the ONE lifecycle stream\n * (`src/runtime-hooks.ts`). It is a pure projection: feed it the `RuntimeHookEvent`s that\n * `runLoop`, `toolLoop`, and the keystone `Scope` already emit, and it maintains the tree of\n * agents + renders it. Attach `view.hooks` to a `Supervisor`/`runLoop` and the tree updates live.\n *\n * Two node sources, ONE stream:\n *  - an agent node is born from `agent.spawn` (id = `childId`, parent = the spawner) or the root\n *    `agent.run` (id = `runId`); `agent.child`/`agent.run:after` settle it (status + score/reason).\n *  - a STEP (`agent.{turn,tool_call,plan,decision}`) is not a node — it advances the step count of\n *    the agent it belongs to (matched by `runId`/`parentId`).\n *\n * No I/O, no timers, no backend coupling — the same projection drives a CLI render, a TUI, or a\n * web tree. Rendering is deterministic given the event order (the stream is the source of truth).\n */\n\nimport type { RuntimeHookEvent, RuntimeHooks } from '../runtime-hooks'\n\nexport type TopologyStatus = 'running' | 'done' | 'down'\n\n/** One agent in the tree. A leaf never spawns; a driver's `childIds` is non-empty. */\nexport interface TopologyNode {\n  readonly id: string\n  /** Display label (spawn `label`, or the driver name on the root). */\n  label: string\n  /** Leaf runtime (`router`/`sandbox`/`cli`) when known. */\n  runtime?: string\n  /** Parent agent id; undefined ⇒ a root. */\n  parentId?: string\n  /** Recursion depth (root = 0). */\n  depth: number\n  status: TopologyStatus\n  /** Count of in-agent steps (turns + tool calls + plan/decision rounds) folded so far. */\n  steps: number\n  /** Deployable score in [0,1] once settled `done`. */\n  score?: number\n  /** Failure reason once settled `down`. */\n  reason?: string\n  /** Children in spawn order. */\n  readonly childIds: string[]\n}\n\nexport interface RenderOptions {\n  /** Cap the rendered depth (deeper nodes collapse to a `… N more` line). Default: no cap. */\n  readonly maxDepth?: number\n  /** Drop the per-node detail suffix (steps/children/score) — labels only. Default: false. */\n  readonly compact?: boolean\n}\n\nexport interface TopologyView {\n  /** The `RuntimeHooks` sink — attach to `SupervisorOpts.hooks` / `runLoop` options. */\n  readonly hooks: RuntimeHooks\n  /** Fold one event into the tree (the same call `hooks.onEvent` makes — exposed for replay). */\n  ingest(event: RuntimeHookEvent): void\n  /** Every node, insertion order. */\n  nodes(): TopologyNode[]\n  /** Nodes with no in-tree parent (the run roots). */\n  roots(): TopologyNode[]\n  /** One node by id. */\n  node(id: string): TopologyNode | undefined\n  /** Render the tree as an aligned ASCII forest. */\n  render(opts?: RenderOptions): string\n}\n\nconst stepTargets = new Set(['agent.turn', 'agent.tool_call', 'agent.plan', 'agent.decision'])\n\n/** Build a live topology view. Stateful — one per run (or per replay). */\nexport function createTopologyView(): TopologyView {\n  // Insertion-ordered so render is stable and roots() reflects spawn order.\n  const byId = new Map<string, TopologyNode>()\n\n  const ensure = (id: string, seed: Partial<TopologyNode> = {}): TopologyNode => {\n    const existing = byId.get(id)\n    if (existing) return existing\n    const node: TopologyNode = {\n      id,\n      label: seed.label ?? id,\n      depth: seed.depth ?? 0,\n      status: 'running',\n      steps: 0,\n      childIds: [],\n      ...seed,\n    }\n    byId.set(id, node)\n    return node\n  }\n\n  const str = (v: unknown): string | undefined => (typeof v === 'string' ? v : undefined)\n  const num = (v: unknown): number | undefined => (typeof v === 'number' ? v : undefined)\n\n  const ingest = (event: RuntimeHookEvent): void => {\n    const p = (event.payload ?? {}) as Record<string, unknown>\n\n    if (event.target === 'agent.spawn' && event.phase === 'after') {\n      const id = str(p.childId)\n      if (!id) return\n      const parent = event.parentId ? ensure(event.parentId) : undefined\n      const node = ensure(id, {\n        label: str(p.label) ?? id,\n        runtime: str(p.runtime),\n        parentId: event.parentId,\n        depth: num(p.depth) ?? (parent ? parent.depth + 1 : 0),\n      })\n      if (parent && !parent.childIds.includes(id)) parent.childIds.push(id)\n      node.status = 'running'\n      return\n    }\n\n    if (event.target === 'agent.child' && event.phase === 'after') {\n      const id = str(p.childId)\n      if (!id) return\n      const node = ensure(id, { parentId: event.parentId })\n      node.status = str(p.status) === 'down' ? 'down' : 'done'\n      node.score = num(p.score)\n      node.reason = str(p.reason)\n      return\n    }\n\n    if (event.target === 'agent.run') {\n      const node = ensure(event.runId, {\n        label: str(p.driver) ?? event.runId,\n        parentId: event.parentId,\n      })\n      if (event.phase === 'before') node.status = 'running'\n      else if (event.phase === 'error') node.status = 'down'\n      else if (event.phase === 'after' && node.status === 'running') node.status = 'done'\n      return\n    }\n\n    // A step advances the agent it belongs to: tool-loop/run-loop key the agent by `runId`,\n    // a within-agent sub-event names it via `parentId`. Only count `after`/`event` phases so a\n    // before/after pair is one step, not two. An unknown owner is dropped (no phantom node).\n    if (stepTargets.has(event.target) && (event.phase === 'after' || event.phase === 'event')) {\n      const owner =\n        (event.parentId && byId.get(event.parentId)) || byId.get(event.runId) || undefined\n      if (owner) owner.steps += 1\n    }\n  }\n\n  const nodes = (): TopologyNode[] => [...byId.values()]\n  const roots = (): TopologyNode[] =>\n    nodes().filter((n) => n.parentId === undefined || !byId.has(n.parentId))\n\n  return {\n    hooks: { onEvent: (e) => ingest(e) },\n    ingest,\n    nodes,\n    roots,\n    node: (id) => byId.get(id),\n    render: (opts) => renderTopologyTree({ roots: roots(), node: (id) => byId.get(id) }, opts),\n  }\n}\n\nconst glyph: Record<TopologyStatus, string> = { running: '◐', done: '✓', down: '✗' }\n\n/** Render a forest of `TopologyNode`s to an aligned ASCII tree. Pure — given the same roots +\n *  node lookup it returns the same string. Exposed so a caller can render a tree it folded\n *  itself (e.g. from a journal replay) without the live view. */\nexport function renderTopologyTree(\n  tree: { roots: TopologyNode[]; node: (id: string) => TopologyNode | undefined },\n  opts: RenderOptions = {},\n): string {\n  const lines: string[] = []\n\n  const detail = (n: TopologyNode): string => {\n    if (opts.compact) return ''\n    const parts: string[] = []\n    if (n.runtime) parts.push(n.runtime)\n    if (n.steps > 0) parts.push(`${n.steps} ${n.steps === 1 ? 'step' : 'steps'}`)\n    if (n.childIds.length > 0) parts.push(`${n.childIds.length} children`)\n    if (n.status === 'done' && n.score !== undefined) parts.push(`score ${n.score.toFixed(2)}`)\n    if (n.status === 'down' && n.reason) parts.push(`down: ${n.reason}`)\n    return parts.length ? `  (${parts.join(' · ')})` : ''\n  }\n\n  const walk = (n: TopologyNode, prefix: string, isLast: boolean, depth: number): void => {\n    const branch = depth === 0 ? '' : isLast ? '└─ ' : '├─ '\n    lines.push(`${prefix}${branch}${glyph[n.status]} ${n.label}${detail(n)}`)\n\n    if (opts.maxDepth !== undefined && depth >= opts.maxDepth && n.childIds.length > 0) {\n      const childPrefix = prefix + (depth === 0 ? '' : isLast ? '   ' : '│  ')\n      lines.push(`${childPrefix}└─ … ${n.childIds.length} more`)\n      return\n    }\n    const childPrefix = prefix + (depth === 0 ? '' : isLast ? '   ' : '│  ')\n    const kids = n.childIds.map((id) => tree.node(id)).filter((c): c is TopologyNode => !!c)\n    kids.forEach((c, i) => {\n      walk(c, childPrefix, i === kids.length - 1, depth + 1)\n    })\n  }\n\n  tree.roots.forEach((r, i) => {\n    walk(r, '', i === tree.roots.length - 1, 0)\n  })\n  return lines.join('\\n')\n}\n"],"mappings":";;;AAkEA,IAAM,cAAc,oBAAI,IAAI,CAAC,cAAc,mBAAmB,cAAc,gBAAgB,CAAC;AAGtF,SAAS,qBAAmC;AAEjD,QAAM,OAAO,oBAAI,IAA0B;AAE3C,QAAM,SAAS,CAAC,IAAY,OAA8B,CAAC,MAAoB;AAC7E,UAAM,WAAW,KAAK,IAAI,EAAE;AAC5B,QAAI,SAAU,QAAO;AACrB,UAAM,OAAqB;AAAA,MACzB;AAAA,MACA,OAAO,KAAK,SAAS;AAAA,MACrB,OAAO,KAAK,SAAS;AAAA,MACrB,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,UAAU,CAAC;AAAA,MACX,GAAG;AAAA,IACL;AACA,SAAK,IAAI,IAAI,IAAI;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,CAAC,MAAoC,OAAO,MAAM,WAAW,IAAI;AAC7E,QAAM,MAAM,CAAC,MAAoC,OAAO,MAAM,WAAW,IAAI;AAE7E,QAAM,SAAS,CAAC,UAAkC;AAChD,UAAM,IAAK,MAAM,WAAW,CAAC;AAE7B,QAAI,MAAM,WAAW,iBAAiB,MAAM,UAAU,SAAS;AAC7D,YAAM,KAAK,IAAI,EAAE,OAAO;AACxB,UAAI,CAAC,GAAI;AACT,YAAM,SAAS,MAAM,WAAW,OAAO,MAAM,QAAQ,IAAI;AACzD,YAAM,OAAO,OAAO,IAAI;AAAA,QACtB,OAAO,IAAI,EAAE,KAAK,KAAK;AAAA,QACvB,SAAS,IAAI,EAAE,OAAO;AAAA,QACtB,UAAU,MAAM;AAAA,QAChB,OAAO,IAAI,EAAE,KAAK,MAAM,SAAS,OAAO,QAAQ,IAAI;AAAA,MACtD,CAAC;AACD,UAAI,UAAU,CAAC,OAAO,SAAS,SAAS,EAAE,EAAG,QAAO,SAAS,KAAK,EAAE;AACpE,WAAK,SAAS;AACd;AAAA,IACF;AAEA,QAAI,MAAM,WAAW,iBAAiB,MAAM,UAAU,SAAS;AAC7D,YAAM,KAAK,IAAI,EAAE,OAAO;AACxB,UAAI,CAAC,GAAI;AACT,YAAM,OAAO,OAAO,IAAI,EAAE,UAAU,MAAM,SAAS,CAAC;AACpD,WAAK,SAAS,IAAI,EAAE,MAAM,MAAM,SAAS,SAAS;AAClD,WAAK,QAAQ,IAAI,EAAE,KAAK;AACxB,WAAK,SAAS,IAAI,EAAE,MAAM;AAC1B;AAAA,IACF;AAEA,QAAI,MAAM,WAAW,aAAa;AAChC,YAAM,OAAO,OAAO,MAAM,OAAO;AAAA,QAC/B,OAAO,IAAI,EAAE,MAAM,KAAK,MAAM;AAAA,QAC9B,UAAU,MAAM;AAAA,MAClB,CAAC;AACD,UAAI,MAAM,UAAU,SAAU,MAAK,SAAS;AAAA,eACnC,MAAM,UAAU,QAAS,MAAK,SAAS;AAAA,eACvC,MAAM,UAAU,WAAW,KAAK,WAAW,UAAW,MAAK,SAAS;AAC7E;AAAA,IACF;AAKA,QAAI,YAAY,IAAI,MAAM,MAAM,MAAM,MAAM,UAAU,WAAW,MAAM,UAAU,UAAU;AACzF,YAAM,QACH,MAAM,YAAY,KAAK,IAAI,MAAM,QAAQ,KAAM,KAAK,IAAI,MAAM,KAAK,KAAK;AAC3E,UAAI,MAAO,OAAM,SAAS;AAAA,IAC5B;AAAA,EACF;AAEA,QAAM,QAAQ,MAAsB,CAAC,GAAG,KAAK,OAAO,CAAC;AACrD,QAAM,QAAQ,MACZ,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,aAAa,UAAa,CAAC,KAAK,IAAI,EAAE,QAAQ,CAAC;AAEzE,SAAO;AAAA,IACL,OAAO,EAAE,SAAS,CAAC,MAAM,OAAO,CAAC,EAAE;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,CAAC,OAAO,KAAK,IAAI,EAAE;AAAA,IACzB,QAAQ,CAAC,SAAS,mBAAmB,EAAE,OAAO,MAAM,GAAG,MAAM,CAAC,OAAO,KAAK,IAAI,EAAE,EAAE,GAAG,IAAI;AAAA,EAC3F;AACF;AAEA,IAAM,QAAwC,EAAE,SAAS,UAAK,MAAM,UAAK,MAAM,SAAI;AAK5E,SAAS,mBACd,MACA,OAAsB,CAAC,GACf;AACR,QAAM,QAAkB,CAAC;AAEzB,QAAM,SAAS,CAAC,MAA4B;AAC1C,QAAI,KAAK,QAAS,QAAO;AACzB,UAAM,QAAkB,CAAC;AACzB,QAAI,EAAE,QAAS,OAAM,KAAK,EAAE,OAAO;AACnC,QAAI,EAAE,QAAQ,EAAG,OAAM,KAAK,GAAG,EAAE,KAAK,IAAI,EAAE,UAAU,IAAI,SAAS,OAAO,EAAE;AAC5E,QAAI,EAAE,SAAS,SAAS,EAAG,OAAM,KAAK,GAAG,EAAE,SAAS,MAAM,WAAW;AACrE,QAAI,EAAE,WAAW,UAAU,EAAE,UAAU,OAAW,OAAM,KAAK,SAAS,EAAE,MAAM,QAAQ,CAAC,CAAC,EAAE;AAC1F,QAAI,EAAE,WAAW,UAAU,EAAE,OAAQ,OAAM,KAAK,SAAS,EAAE,MAAM,EAAE;AACnE,WAAO,MAAM,SAAS,MAAM,MAAM,KAAK,QAAK,CAAC,MAAM;AAAA,EACrD;AAEA,QAAM,OAAO,CAAC,GAAiB,QAAgB,QAAiB,UAAwB;AACtF,UAAM,SAAS,UAAU,IAAI,KAAK,SAAS,kBAAQ;AACnD,UAAM,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE;AAExE,QAAI,KAAK,aAAa,UAAa,SAAS,KAAK,YAAY,EAAE,SAAS,SAAS,GAAG;AAClF,YAAMA,eAAc,UAAU,UAAU,IAAI,KAAK,SAAS,QAAQ;AAClE,YAAM,KAAK,GAAGA,YAAW,uBAAQ,EAAE,SAAS,MAAM,OAAO;AACzD;AAAA,IACF;AACA,UAAM,cAAc,UAAU,UAAU,IAAI,KAAK,SAAS,QAAQ;AAClE,UAAM,OAAO,EAAE,SAAS,IAAI,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,MAAyB,CAAC,CAAC,CAAC;AACvF,SAAK,QAAQ,CAAC,GAAG,MAAM;AACrB,WAAK,GAAG,aAAa,MAAM,KAAK,SAAS,GAAG,QAAQ,CAAC;AAAA,IACvD,CAAC;AAAA,EACH;AAEA,OAAK,MAAM,QAAQ,CAAC,GAAG,MAAM;AAC3B,SAAK,GAAG,IAAI,MAAM,KAAK,MAAM,SAAS,GAAG,CAAC;AAAA,EAC5C,CAAC;AACD,SAAO,MAAM,KAAK,IAAI;AACxB;","names":["childPrefix"]}