@smthrs/gateway 0.34.0 → 1.0.0-rc.3

package/dist/cjs/Diagnosis.js

@@ -0,0 +1,476 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var Diagnosis_exports = {};
+__export(Diagnosis_exports, {
+  asNumber: () => asNumber,
+  asRecord: () => asRecord,
+  asString: () => asString,
+  callEventKey: () => import_callEvents2.callEventKey,
+  callScope: () => import_callEvents2.callScope,
+  clip: () => clip,
+  combine: () => combine,
+  digest: () => digest,
+  duration: () => duration,
+  emptyDigest: () => emptyDigest,
+  firstLine: () => firstLine,
+  foreignVerdict: () => foreignVerdict,
+  handlerReach: () => handlerReach,
+  nativeCallEvent: () => import_callEvents2.nativeCallEvent,
+  nativeStepEvent: () => import_callEvents2.nativeStepEvent,
+  openCallIndex: () => import_callEvents3.openCallIndex,
+  render: () => render,
+  resolvedOutput: () => resolvedOutput,
+  timeOf: () => timeOf,
+  uniqueCallEvents: () => import_callEvents.uniqueCallEvents,
+  usd: () => usd,
+  verdict: () => verdict
+});
+module.exports = __toCommonJS(Diagnosis_exports);
+var import_control = require("@smthrs/control");
+var Fault = __toESM(require("@smthrs/flow/Fault"), 1);
+var import_effect = require("effect");
+var import_callEvents = require("./internal/callEvents.js");
+var DigestIndex = __toESM(require("./internal/digestIndex.js"), 1);
+var import_digestMemory = require("./internal/digestMemory.js");
+var NativeResolution = __toESM(require("./internal/nativeResolution.js"), 1);
+var import_callEvents2 = require("./internal/callEvents.js");
+var import_callEvents3 = require("./internal/callEvents.js");
+const runStatuses = new Set(import_control.ControlSchema.RunStatus.literals);
+const editFlows = /* @__PURE__ */ new Set(["write", "edit", "apply_patch"]);
+const asRecord = (value) => typeof value === "object" && value !== null && !Array.isArray(value) ? value : {};
+const asString = (value) => typeof value === "string" ? value : void 0;
+const isFault = import_effect.Schema.is(Fault.Fault);
+const asNumber = (value) => typeof value === "number" ? value : void 0;
+const timeOf = (event) => asNumber(asRecord(event.payload).at) ?? event.occurredAt;
+const firstLine = (text) => {
+  const index = text.search(/[\r\n]/);
+  return index < 0 ? text : text.slice(0, index);
+};
+const clip = (text, width) => {
+  if (width <= 0) return "";
+  const points = [...text];
+  return points.length <= width ? text : `${points.slice(0, width - 1).join("")}\u2026`;
+};
+const handlers = {
+  "control.agent.turn-opened": {
+    reach: "aggregate",
+    apply: (accumulator, payload) => {
+      accumulator.turns += 1;
+      accumulator.seat = asString(payload.seat) ?? accumulator.seat;
+    }
+  },
+  "control.agent.model-settled": {
+    reach: "aggregate",
+    apply: (accumulator, payload) => {
+      const usage = asRecord(payload.usage);
+      accumulator.inputTokens += asNumber(usage.inputTokens) ?? 0;
+      accumulator.outputTokens += asNumber(usage.outputTokens) ?? 0;
+      const cost = asNumber(payload.costUsd);
+      if (cost !== void 0 && Number.isFinite(cost) && cost > 0) accumulator.costUsd += cost;
+    }
+  },
+  "control.agent.cell-call-started": {
+    reach: "aggregate",
+    apply: (accumulator, payload) => {
+      accumulator.calls += 1;
+      if (editFlows.has(asString(payload.flowName) ?? "")) accumulator.editsAttempted += 1;
+    }
+  },
+  "control.agent.resolved": {
+    reach: "root",
+    apply: (accumulator, payload) => {
+      accumulator.finalOutput = asString(payload.text);
+    }
+  },
+  "control.approval.requested": {
+    reach: "root",
+    apply: (accumulator, payload) => {
+      accumulator.parkedQuestion = asString(payload.question);
+    }
+  }
+};
+const handlerReach = Object.fromEntries(
+  Object.entries(handlers).map(([kind, handler]) => [kind, handler.reach])
+);
+const rawDigest = (events) => {
+  const accumulator = {
+    status: void 0,
+    cause: void 0,
+    fault: void 0,
+    seat: void 0,
+    turns: 0,
+    calls: 0,
+    callsFailed: 0,
+    editsAttempted: 0,
+    editsSucceeded: 0,
+    inputTokens: 0,
+    outputTokens: 0,
+    costUsd: 0,
+    finalOutput: void 0,
+    parkedQuestion: void 0
+  };
+  const refusalCounts = /* @__PURE__ */ new Map();
+  let startedAt;
+  let endedAt;
+  let nativeResolution;
+  const observe = (at) => {
+    startedAt = startedAt === void 0 ? at : Math.min(startedAt, at);
+    endedAt = endedAt === void 0 ? at : Math.max(endedAt, at);
+  };
+  for (const event of (0, import_callEvents.uniqueCallEvents)(events)) {
+    nativeResolution = NativeResolution.combine(nativeResolution, NativeResolution.fromEvent(event));
+    const payload = asRecord(event.payload);
+    const at = timeOf(event);
+    const handler = Object.hasOwn(handlers, event.kind) ? handlers[event.kind] : void 0;
+    if (handler !== void 0) {
+      observe(at);
+      if (handler.reach === "aggregate" || (0, import_callEvents.callScope)(event) === void 0) handler.apply(accumulator, payload);
+      continue;
+    }
+    if (event.kind === "control.agent.cell-call-settled") {
+      observe(at);
+      if (asString(payload.outcome) === "failure") {
+        accumulator.callsFailed += 1;
+        const message = firstLine(asString(payload.message) ?? "unknown refusal");
+        refusalCounts.set(message, (refusalCounts.get(message) ?? 0) + 1);
+      } else if (editFlows.has(asString(payload.flowName) ?? "")) {
+        accumulator.editsSucceeded += 1;
+      }
+      continue;
+    }
+    if (event.kind.startsWith("control.run.")) {
+      const status = event.kind.slice("control.run.".length);
+      if (!runStatuses.has(status)) continue;
+      observe(at);
+      accumulator.status = status;
+      if (status === "failed") accumulator.cause = asString(payload.cause);
+      accumulator.fault = status === "failed" && isFault(payload.fault) ? payload.fault : void 0;
+    }
+  }
+  return {
+    ...accumulator,
+    ...nativeResolution === void 0 ? {} : { nativeResolution },
+    refusals: [...refusalCounts.entries()].map(([message, count]) => ({ message, count })).sort((left, right) => right.count - left.count),
+    startedAt,
+    endedAt
+  };
+};
+const counters = [
+  "turns",
+  "calls",
+  "callsFailed",
+  "editsAttempted",
+  "editsSucceeded",
+  "inputTokens",
+  "outputTokens",
+  "costUsd"
+];
+const contributionValue = (value) => ({
+  ...Object.fromEntries(counters.filter((counter) => value[counter] !== 0).map((counter) => [counter, value[counter]])),
+  ...value.seat === void 0 ? {} : { seat: value.seat },
+  ...value.startedAt === void 0 ? {} : { startedAt: value.startedAt },
+  ...value.endedAt === void 0 ? {} : { endedAt: value.endedAt },
+  ...value.refusals.length === 0 ? {} : { refusals: value.refusals }
+});
+const emptyIndexes = () => ({ timings: void 0, refusals: import_effect.HashMap.empty(), refusalBytes: 0 });
+const refusalIndexBytes = (message, tree) => tree === void 0 ? 0 : (0, import_digestMemory.encodedBytes)(message) + tree.bytes;
+const indexContribution = (indexes, previous, next) => {
+  let refusals = indexes.refusals;
+  let refusalBytes = indexes.refusalBytes;
+  for (const refusal of previous?.value.refusals ?? []) {
+    if (next.value.refusals?.some((member) => member.message === refusal.message)) continue;
+    const oldTree = import_effect.HashMap.getUnsafe(refusals, refusal.message);
+    const tree = DigestIndex.remove(oldTree, next.ordinal);
+    refusalBytes += refusalIndexBytes(refusal.message, tree) - refusalIndexBytes(refusal.message, oldTree);
+    refusals = tree === void 0 ? import_effect.HashMap.remove(refusals, refusal.message) : import_effect.HashMap.set(refusals, refusal.message, tree);
+  }
+  for (const refusal of next.value.refusals ?? []) {
+    if (previous?.value.refusals?.some((member) => member.message === refusal.message)) continue;
+    const old = import_effect.HashMap.get(refusals, refusal.message);
+    const oldTree = old._tag === "Some" ? old.value : void 0;
+    const tree = DigestIndex.set(oldTree, next.ordinal);
+    refusalBytes += refusalIndexBytes(refusal.message, tree) - refusalIndexBytes(refusal.message, oldTree);
+    refusals = import_effect.HashMap.set(refusals, refusal.message, tree);
+  }
+  return {
+    timings: DigestIndex.set(indexes.timings, next.ordinal, next.value.startedAt, next.value.endedAt),
+    refusals,
+    refusalBytes
+  };
+};
+const digestStates = /* @__PURE__ */ new WeakMap();
+const remember = (value, state) => {
+  digestStates.set(value, state);
+  (0, import_digestMemory.recordDigestBytes)(
+    value,
+    (0, import_digestMemory.encodedBytes)(value) + (value === state.base ? 0 : (0, import_digestMemory.encodedBytes)(state.base)) + state.contributionBytes + (state.indexes.timings?.bytes ?? 0) + state.indexes.refusalBytes + (0, import_digestMemory.encodedBytes)({
+      writes: state.writes,
+      baseSeatOrdinal: state.baseSeatOrdinal,
+      baseRefusals: [...state.baseRefusals],
+      length: state.length
+    })
+  );
+  return value;
+};
+const foreignVerdict = (event, runId) => runId !== void 0 && event.runId !== void 0 && event.runId !== runId && event.kind.startsWith("control.run.");
+const digest = (events, runId) => {
+  if (runId !== void 0 && events.some((event) => foreignVerdict(event, runId))) {
+    events = events.filter((event) => !foreignVerdict(event, runId));
+  }
+  let contributions = import_effect.HashMap.empty();
+  let indexes = emptyIndexes();
+  let contributionBytes = 0;
+  const baseEvents = [];
+  const baseRefusals = /* @__PURE__ */ new Map();
+  const writes = { cause: false, finalOutput: false, parkedQuestion: false };
+  let baseSeatOrdinal;
+  for (const [ordinal, event] of events.entries()) {
+    const key = (0, import_callEvents.callEventKey)(event);
+    if (key === void 0) {
+      baseEvents.push(event);
+      if (event.kind === "control.run.failed") writes.cause = true;
+      if ((0, import_callEvents.callScope)(event) === void 0) {
+        if (event.kind === "control.agent.resolved") writes.finalOutput = true;
+        if (event.kind === "control.approval.requested") writes.parkedQuestion = true;
+      }
+      const payload = asRecord(event.payload);
+      if (event.kind === "control.agent.turn-opened" && asString(payload.seat) !== void 0) baseSeatOrdinal = ordinal;
+      if (event.kind === "control.agent.cell-call-settled" && payload.outcome === "failure") {
+        const message = firstLine(asString(payload.message) ?? "unknown refusal");
+        if (!baseRefusals.has(message)) baseRefusals.set(message, ordinal);
+      }
+      continue;
+    }
+    const native = (0, import_callEvents.nativeStepEvent)(event) ?? (0, import_callEvents.nativeCallEvent)(event);
+    const previous = import_effect.HashMap.get(contributions, key);
+    if (previous._tag === "Some" && (previous.value.authoritative || native === void 0)) continue;
+    const contribution = {
+      ordinal: previous._tag === "Some" ? previous.value.ordinal : ordinal,
+      authoritative: native !== void 0,
+      value: contributionValue(rawDigest([native ?? event]))
+    };
+    contributionBytes += (0, import_digestMemory.encodedBytes)([key, contribution]) - (previous._tag === "Some" ? (0, import_digestMemory.encodedBytes)([key, previous.value]) : 0);
+    contributions = import_effect.HashMap.set(contributions, key, contribution);
+    indexes = indexContribution(indexes, previous._tag === "Some" ? previous.value : void 0, contribution);
+  }
+  const value = rawDigest(events);
+  return remember(value, {
+    base: baseEvents.length === events.length ? value : rawDigest(baseEvents),
+    writes,
+    baseSeatOrdinal,
+    baseRefusals,
+    indexes,
+    contributions,
+    contributionBytes,
+    length: events.length
+  });
+};
+const duration = (value) => {
+  if (value.startedAt === void 0 || value.endedAt === void 0) return "0s";
+  const seconds = Math.max(0, Math.round((value.endedAt - value.startedAt) / 1e3));
+  return seconds < 60 ? `${seconds}s` : `${Math.floor(seconds / 60)}m ${String(seconds % 60).padStart(2, "0")}s`;
+};
+const usd = (value) => `$${value.toFixed(value >= 1 ? 2 : 4)}`;
+const resolvedOutput = (value) => value.finalOutput ?? NativeResolution.output(value.nativeResolution);
+const verdict = (value) => {
+  const status = value.status ?? "unlaunched";
+  const output = resolvedOutput(value);
+  if (status === "failed") {
+    return value.cause === void 0 ? "failed \u2014 no cause recorded in the journal" : `failed \u2014 ${clip(firstLine(value.cause), 100)}`;
+  }
+  if (status === "waiting-approval") {
+    return value.parkedQuestion === void 0 ? "waiting-approval \u2014 a permission gate is pending" : `waiting-approval \u2014 asks: ${clip(value.parkedQuestion, 90)}`;
+  }
+  if (status === "completed" && value.calls > 0 && value.editsAttempted === 0) {
+    return `completed \u2014 but 0 of ${value.calls} calls attempted an edit; the run only read`;
+  }
+  if (status === "completed" && output !== void 0 && output.length > 0) {
+    return `completed \u2014 ${clip(firstLine(output), 100)}`;
+  }
+  return status;
+};
+const label = (name) => name.padEnd(10);
+const render = (subject, value) => {
+  const output = resolvedOutput(value);
+  const lines = [
+    `${label("Verdict")}${verdict(value)}`,
+    `${label("Run")}${subject.runId}${subject.flowId === void 0 ? "" : ` \xB7 ${subject.flowId}`}${value.seat === void 0 ? "" : ` \xB7 ${value.seat}`} \xB7 ${duration(value)}`,
+    `${label("Activity")}${value.turns} turns \xB7 ${value.calls} calls (${value.callsFailed} refused) \xB7 edits ${value.editsSucceeded}/${value.editsAttempted}`,
+    `${label("Tokens")}${value.inputTokens} in / ${value.outputTokens} out`,
+    ...value.costUsd > 0 ? [`${label("Cost")}${usd(value.costUsd)}`] : []
+  ];
+  for (const [index, refusal] of value.refusals.slice(0, 3).entries()) {
+    lines.push(`${label(index === 0 ? "Refusals" : "")}${refusal.count}\xD7 ${clip(refusal.message, 110)}`);
+  }
+  if (value.cause !== void 0) lines.push(`${label("Cause")}${clip(firstLine(value.cause), 120)}`);
+  if (output !== void 0 && output.length > 0) {
+    lines.push(`${label("Output")}${clip(firstLine(output), 120)}`);
+  }
+  return lines.join("\n");
+};
+const emptyDigest = () => digest([]);
+const earliest = (left, right) => left === void 0 ? right : right === void 0 ? left : Math.min(left, right);
+const latest = (left, right) => left === void 0 ? right : right === void 0 ? left : Math.max(left, right);
+const combinePlain = (earlier, later, writes) => {
+  const counts = /* @__PURE__ */ new Map();
+  for (const refusal of [...earlier.refusals, ...later.refusals]) {
+    counts.set(refusal.message, (counts.get(refusal.message) ?? 0) + refusal.count);
+  }
+  return {
+    status: later.status ?? earlier.status,
+    cause: writes.cause ? later.cause : earlier.cause,
+    fault: writes.cause || later.status !== void 0 && later.status !== "failed" ? later.fault : earlier.fault,
+    seat: later.seat ?? earlier.seat,
+    turns: earlier.turns + later.turns,
+    calls: earlier.calls + later.calls,
+    callsFailed: earlier.callsFailed + later.callsFailed,
+    editsAttempted: earlier.editsAttempted + later.editsAttempted,
+    editsSucceeded: earlier.editsSucceeded + later.editsSucceeded,
+    refusals: [...counts.entries()].map(([message, count]) => ({ message, count })).sort((left, right) => right.count - left.count),
+    inputTokens: earlier.inputTokens + later.inputTokens,
+    outputTokens: earlier.outputTokens + later.outputTokens,
+    costUsd: earlier.costUsd + later.costUsd,
+    finalOutput: writes.finalOutput ? later.finalOutput : earlier.finalOutput,
+    nativeResolution: NativeResolution.combine(earlier.nativeResolution, later.nativeResolution),
+    parkedQuestion: writes.parkedQuestion ? later.parkedQuestion : earlier.parkedQuestion,
+    startedAt: earliest(earlier.startedAt, later.startedAt),
+    endedAt: latest(earlier.endedAt, later.endedAt)
+  };
+};
+const stateOf = (value) => digestStates.get(value) ?? {
+  base: value,
+  writes: {
+    cause: value.cause !== void 0,
+    finalOutput: value.finalOutput !== void 0,
+    parkedQuestion: value.parkedQuestion !== void 0
+  },
+  baseSeatOrdinal: value.seat === void 0 ? void 0 : 0,
+  baseRefusals: new Map(value.refusals.map((refusal) => [refusal.message, 0])),
+  indexes: emptyIndexes(),
+  contributions: import_effect.HashMap.empty(),
+  contributionBytes: 0,
+  length: 1
+};
+const combinedFacts = (state) => {
+  const result = { ...state.base };
+  let seatOrdinal = state.baseSeatOrdinal ?? -1;
+  const refusals = new Map(state.base.refusals.map((refusal) => [refusal.message, {
+    count: refusal.count,
+    ordinal: state.baseRefusals.get(refusal.message)
+  }]));
+  for (const [, contribution] of state.contributions) {
+    const value = contribution.value;
+    for (const key of counters) result[key] += value[key] ?? 0;
+    if (value.seat !== void 0 && contribution.ordinal > seatOrdinal) {
+      result.seat = value.seat;
+      seatOrdinal = contribution.ordinal;
+    }
+    result.startedAt = earliest(result.startedAt, value.startedAt);
+    result.endedAt = latest(result.endedAt, value.endedAt);
+    for (const refusal of value.refusals ?? []) {
+      const previous = refusals.get(refusal.message);
+      refusals.set(refusal.message, {
+        count: (previous?.count ?? 0) + refusal.count,
+        ordinal: Math.min(previous?.ordinal ?? contribution.ordinal, contribution.ordinal)
+      });
+    }
+  }
+  result.refusals = [...refusals].sort(
+    ([, left], [, right]) => right.count - left.count || left.ordinal - right.ordinal
+  ).map(([message, { count }]) => ({ message, count }));
+  return result;
+};
+const combine = (earlier, later) => {
+  const left = stateOf(earlier);
+  const right = stateOf(later);
+  let contributions = left.contributions;
+  let indexes = left.indexes;
+  let contributionBytes = left.contributionBytes;
+  let accepted = import_effect.HashMap.empty();
+  const corrected = { ...earlier };
+  for (const [key, value2] of right.contributions) {
+    const previous = import_effect.HashMap.get(contributions, key);
+    if (previous._tag === "Some" && (previous.value.authoritative || !value2.authoritative)) continue;
+    if (previous._tag === "Some") {
+      const old = previous.value.value;
+      const next = value2.value;
+      for (const counter of counters) corrected[counter] += (next[counter] ?? 0) - (old[counter] ?? 0);
+    } else accepted = import_effect.HashMap.set(accepted, key, value2);
+    const contribution = {
+      ...value2,
+      ordinal: previous._tag === "Some" ? previous.value.ordinal : left.length + value2.ordinal
+    };
+    contributionBytes += (0, import_digestMemory.encodedBytes)([key, contribution]) - (previous._tag === "Some" ? (0, import_digestMemory.encodedBytes)([key, previous.value]) : 0);
+    contributions = import_effect.HashMap.set(contributions, key, contribution);
+    indexes = indexContribution(indexes, previous._tag === "Some" ? previous.value : void 0, contribution);
+  }
+  const baseRefusals = new Map(left.baseRefusals);
+  for (const [message, ordinal] of right.baseRefusals) {
+    if (!baseRefusals.has(message)) baseRefusals.set(message, left.length + ordinal);
+  }
+  const incomingComplete = import_effect.HashMap.size(accepted) === import_effect.HashMap.size(right.contributions);
+  const incoming = incomingComplete ? later : combinedFacts({ ...right, contributions: accepted });
+  const state = {
+    base: combinePlain(left.base, right.base, right.writes),
+    writes: {
+      cause: left.writes.cause || right.writes.cause,
+      finalOutput: left.writes.finalOutput || right.writes.finalOutput,
+      parkedQuestion: left.writes.parkedQuestion || right.writes.parkedQuestion
+    },
+    baseSeatOrdinal: right.baseSeatOrdinal === void 0 ? left.baseSeatOrdinal : left.length + right.baseSeatOrdinal,
+    baseRefusals,
+    indexes,
+    contributions,
+    contributionBytes,
+    length: left.length + right.length
+  };
+  const value = { ...combinePlain(corrected, incoming, right.writes) };
+  value.startedAt = state.base.startedAt;
+  value.endedAt = state.base.endedAt;
+  if (indexes.timings?.min !== void 0) {
+    value.startedAt = Math.min(value.startedAt ?? indexes.timings.min, indexes.timings.min);
+  }
+  if (indexes.timings?.max !== void 0) {
+    value.endedAt = Math.max(value.endedAt ?? indexes.timings.max, indexes.timings.max);
+  }
+  const refusals = new Map(state.base.refusals.map((refusal) => [refusal.message, {
+    count: refusal.count,
+    ordinal: baseRefusals.get(refusal.message)
+  }]));
+  for (const [message, tree] of indexes.refusals) {
+    const previous = refusals.get(message);
+    refusals.set(message, {
+      count: (previous?.count ?? 0) + tree.size,
+      ordinal: Math.min(previous?.ordinal ?? tree.first, tree.first)
+    });
+  }
+  value.refusals = [...refusals].sort(([, a], [, b]) => b.count - a.count || a.ordinal - b.ordinal).map(([message, { count }]) => ({ message, count }));
+  return remember(value, state);
+};
+//# sourceMappingURL=Diagnosis.js.map

package/dist/cjs/Diagnosis.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/Diagnosis.ts"],
+  "sourcesContent": ["/**\n * The run diagnosis: what happened to a run, computed from its own control\n * events.\n *\n * The old gateway answered this question with a `whatHappened` RPC that read\n * run rows, node-iteration rows, and attempt rows out of the engine database\n * and optionally asked an agent to narrate them. The rc.0 gateway serves the\n * same answer as a field of the `run-summary` projection, computed from the\n * ordered `ControlEvent` deltas `Control.watch` already publishes. Nothing\n * here opens a database, so a diagnosis read through a relay is the same\n * diagnosis a local reader computes.\n *\n * This is the one fold both surfaces read. `@smthrs/cli` `Forensics` calls\n * `digest` and adds what a terminal card needs on top of it: duplicate calls,\n * per-flow counts, the parked approval payload, and the declined-launch state\n * the wire vocabulary does not carry. The counts, the refusal aggregation, and\n * the clipping are therefore one implementation, not two that drift.\n *\n * @since 1.0.0\n */\n\nimport { ControlSchema } from \"@smthrs/control\"\nimport * as Fault from \"@smthrs/flow/Fault\"\nimport { HashMap, Schema } from \"effect\"\nimport { callEventKey, callScope, nativeCallEvent, nativeStepEvent, uniqueCallEvents } from \"./internal/callEvents.ts\"\nimport * as DigestIndex from \"./internal/digestIndex.ts\"\nimport { encodedBytes, recordDigestBytes } from \"./internal/digestMemory.ts\"\nimport * as NativeResolution from \"./internal/nativeResolution.ts\"\n\n/**\n * Keeps one start and settlement per durable call identity, preferring a\n * committed native fact over telemetry at the first observation's position.\n * Unidentified legacy events remain distinct because their identity cannot\n * be recovered from flow names and inputs. Shared with CLI call counts.\n *\n * @since 1.0.0\n * @category projections\n */\nexport { uniqueCallEvents }\n\n/**\n * Native fact normalization and stable call/checkpoint identities.\n * Incremental readers retain these keys to match the full history fold.\n *\n * @since 1.0.0\n * @category projections\n */\nexport { callEventKey, callScope, nativeCallEvent, nativeStepEvent } from \"./internal/callEvents.ts\"\n\n/**\n * Finds an open call by ID, with name/FIFO fallback only for legacy starts.\n * Shared by gateway node output and the CLI's compatible flow/ordinal IDs.\n *\n * @since 1.0.0\n * @category projections\n */\nexport { openCallIndex } from \"./internal/callEvents.ts\"\n\n/**\n * The run statuses a digest may report.\n *\n * `@smthrs/control` `ControlSchema.RunStatus` is the vocabulary; this is the\n * runtime set the fold checks a journaled kind against.\n *\n * @since 1.0.0\n * @category models\n */\nexport type RunStatus = ControlSchema.RunStatus\n\n/**\n * Every `control.run.*` suffix that names a status rather than an operation.\n *\n * `@smthrs/control` journals `control.run.lineage`, `control.run.resume`,\n * `control.run.resumed`, `control.run.cancel-requested`, and\n * `control.run.pending` under the same prefix as the status transitions, and\n * `Lineage.derive` adds one more to every followed stream. Reading a status\n * off the prefix alone made a live run's verdict read `lineage` or `resume`,\n * so the fold accepts only the schema statuses a client may render.\n */\nconst runStatuses: ReadonlySet<string> = new Set(ControlSchema.RunStatus.literals)\n\n/**\n * One refused flow call, aggregated by its refusal message.\n *\n * @since 1.0.0\n * @category models\n */\nexport interface Refusal {\n  readonly message: string\n  readonly count: number\n}\n\n/**\n * Everything the diagnosis computes from one run's events.\n *\n * @since 1.0.0\n * @category models\n */\nexport interface Digest {\n  /** The last run status seen, or undefined before launch. */\n  readonly status: RunStatus | undefined\n  /** The journaled failure cause, when the run failed and recorded one. */\n  readonly cause: string | undefined\n  /** The typed fault stamped beside {@link cause}; it is written and cleared with it. */\n  readonly fault?: Fault.Fault | undefined\n  /** The model seat the last opened turn ran on. */\n  readonly seat: string | undefined\n  readonly turns: number\n  readonly calls: number\n  readonly callsFailed: number\n  readonly editsAttempted: number\n  readonly editsSucceeded: number\n  /** Refusal messages, descending by count. */\n  readonly refusals: ReadonlyArray<Refusal>\n  readonly inputTokens: number\n  readonly outputTokens: number\n  /** USD the run's priced model calls cost; zero when none was priced. */\n  readonly costUsd: number\n  /** The final assistant output, when the run resolved. */\n  readonly finalOutput: string | undefined\n  /** Root binding and committed native result, retained across bounded windows. */\n  readonly nativeResolution?: NativeResolution.NativeResolution | undefined\n  /** The pending ask's question, when the run parked for approval. */\n  readonly parkedQuestion: string | undefined\n  /** The earliest time a kind this fold handles occurred at. */\n  readonly startedAt: number | undefined\n  /** The latest time a kind this fold handles occurred at. */\n  readonly endedAt: number | undefined\n}\n\n/** Flows whose calls count as edit attempts. */\nconst editFlows: ReadonlySet<string> = new Set([\"write\", \"edit\", \"apply_patch\"])\n\n/**\n * Reads a payload as a record. Wire payloads are `Json`, so every field read\n * tolerates absence and the digest of a malformed journal is a sparse digest,\n * never a throw.\n *\n * @param value the payload to read\n * @since 1.0.0\n * @category conversions\n */\nexport const asRecord = (value: unknown): Record<string, unknown> =>\n  typeof value === \"object\" && value !== null && !Array.isArray(value) ? value as Record<string, unknown> : {}\n\n/**\n * Reads a payload field as a string, or nothing when it is not one.\n *\n * @param value the field to read\n * @since 1.0.0\n * @category conversions\n */\nexport const asString = (value: unknown): string | undefined => typeof value === \"string\" ? value : undefined\n\nconst isFault = Schema.is(Fault.Fault)\n\n/**\n * Reads a payload field as a number, or nothing when it is not one.\n *\n * @param value the field to read\n * @since 1.0.0\n * @category conversions\n */\nexport const asNumber = (value: unknown): number | undefined => typeof value === \"number\" ? value : undefined\n\n/**\n * Occurrence time: the payload's own stamp, else journal admission time.\n *\n * @param event the event to time\n * @since 1.0.0\n * @category conversions\n */\nexport const timeOf = (event: ControlSchema.ControlEvent): number =>\n  asNumber(asRecord(event.payload).at) ?? event.occurredAt\n\n/**\n * The first line, whichever line ending produced it. Splitting on `\\n` alone\n * left the `\\r` of a CRLF cause on the wire, and every reader of a one-line\n * field, here and in `@smthrs/cli` `Forensics`, wants the same answer.\n *\n * @param text the text to read one line of\n * @since 1.0.0\n * @category conversions\n */\nexport const firstLine = (text: string): string => {\n  const index = text.search(/[\\r\\n]/)\n  return index < 0 ? text : text.slice(0, index)\n}\n\n/**\n * Truncates to a display width, marking the cut.\n *\n * The cut is made on code points, never on UTF-16 code units. Slicing code\n * units splits an astral character in half and puts a lone surrogate on the\n * wire, where a Go decoder silently replaces it with U+FFFD and a strict\n * decoder rejects the whole frame; the result of this function is always well\n * formed. A clipped result is exactly `width` code points, so `width` 1 is the\n * ellipsis alone and `width` 0, or any negative width, is the empty string.\n *\n * @param text the text to clip\n * @param width the greatest number of code points to keep\n * @since 1.0.0\n * @category rendering\n */\nexport const clip = (text: string, width: number): string => {\n  if (width <= 0) return \"\"\n  const points = [...text]\n  return points.length <= width ? text : `${points.slice(0, width - 1).join(\"\")}\u2026`\n}\n\n/** The mutable accumulator the fold below writes into. */\ninterface Accumulator {\n  status: RunStatus | undefined\n  cause: string | undefined\n  fault: Fault.Fault | undefined\n  seat: string | undefined\n  turns: number\n  calls: number\n  callsFailed: number\n  editsAttempted: number\n  editsSucceeded: number\n  inputTokens: number\n  outputTokens: number\n  costUsd: number\n  finalOutput: string | undefined\n  parkedQuestion: string | undefined\n}\n\n/**\n * Which events may write a run-level field.\n *\n * `uniqueCallEvents` normalizes a native step fact into the `control.agent.*`\n * event the step recorded, so this fold reads two streams at once: the run's\n * own, and one per step a module run dispatched. A step's record carries the\n * `step` object its checkpoint was written under, which is what `callScope`\n * reads; the run's own records carry none. Every run-level field therefore\n * belongs to one of three classes, and a new handler has to name its class\n * before it compiles:\n *\n * - `aggregate`: the field sums or counts what the whole run did, steps\n *   included, so a step's record contributes to it like any other.\n * - `root`: the field is the run's own answer or state, so only an unscoped\n *   record may set it. A step's record is skipped.\n * - scope dependent: the field means something only beside the scope that\n *   recorded it, so it is kept per scope rather than run wide. No field of\n *   this digest is one; `GatewayProjection.callHistory` holds the one that is,\n *   the seat a call ran on.\n *\n * The table, field by field:\n *\n * | Field                           | Class     | Why                                                        |\n * | ------------------------------- | --------- | ---------------------------------------------------------- |\n * | `turns`                         | aggregate | a turn a step opened is a turn this run opened             |\n * | `seat`                          | aggregate | the seat of the run's last opened turn, wherever it opened |\n * | `inputTokens`, `outputTokens`   | aggregate | a step spends the run's budget, so the run pays for it     |\n * | `costUsd`                       | aggregate | the dollars of those same calls                            |\n * | `calls`, `editsAttempted`       | aggregate | a call a step made is a call this run made                 |\n * | `callsFailed`, `editsSucceeded` | aggregate | the settlement of one of those calls                       |\n * | `refusals`                      | aggregate | the messages those settlements refused with                |\n * | `startedAt`, `endedAt`          | aggregate | a step runs inside the run's span, so its records widen it |\n * | `finalOutput`                   | root      | THE run's answer; a step's answer is the step's            |\n * | `parkedQuestion`                | root      | THE question the run is parked on                          |\n * | `status`, `cause`               | root      | THE run's terminal state, from `control.run.*` alone       |\n *\n * `status`, `cause` and `parkedQuestion` are root only by construction as well\n * as by this class: `StepFact.Fact` accepts an `eventType` matching\n * `^control\\.agent\\.[a-z-]+$`, so no step fact can normalize to a\n * `control.run.*` kind or to `control.approval.requested`.\n */\ntype Reach = \"aggregate\" | \"root\"\n\n/** One kind's contribution, and the class of the fields it writes. */\ninterface Handler {\n  readonly reach: Reach\n  readonly apply: (accumulator: Accumulator, payload: Record<string, unknown>) => void\n}\n\nconst handlers: Readonly<Record<string, Handler>> = {\n  \"control.agent.turn-opened\": {\n    reach: \"aggregate\",\n    apply: (accumulator, payload) => {\n      accumulator.turns += 1\n      accumulator.seat = asString(payload.seat) ?? accumulator.seat\n    }\n  },\n  \"control.agent.model-settled\": {\n    reach: \"aggregate\",\n    apply: (accumulator, payload) => {\n      const usage = asRecord(payload.usage)\n      accumulator.inputTokens += asNumber(usage.inputTokens) ?? 0\n      accumulator.outputTokens += asNumber(usage.outputTokens) ?? 0\n      const cost = asNumber(payload.costUsd)\n      if (cost !== undefined && Number.isFinite(cost) && cost > 0) accumulator.costUsd += cost\n    }\n  },\n  \"control.agent.cell-call-started\": {\n    reach: \"aggregate\",\n    apply: (accumulator, payload) => {\n      accumulator.calls += 1\n      if (editFlows.has(asString(payload.flowName) ?? \"\")) accumulator.editsAttempted += 1\n    }\n  },\n  \"control.agent.resolved\": {\n    reach: \"root\",\n    apply: (accumulator, payload) => {\n      accumulator.finalOutput = asString(payload.text)\n    }\n  },\n  \"control.approval.requested\": {\n    reach: \"root\",\n    apply: (accumulator, payload) => {\n      accumulator.parkedQuestion = asString(payload.question)\n    }\n  }\n}\n\n/**\n * The kinds this fold handles, with the class each one's fields belong to.\n *\n * Exported so a test can hold the table above against the map rather than\n * trusting a comment, and so a new handler that names no class fails both the\n * compiler and that test.\n *\n * @since 1.0.0\n * @category models\n */\nexport const handlerReach: Readonly<Record<string, \"aggregate\" | \"root\">> = Object.fromEntries(\n  Object.entries(handlers).map(([kind, handler]) => [kind, handler.reach])\n)\n\n/**\n * Computes the diagnosis facts for one run from its ordered control events.\n *\n * Total on purpose: an event this vocabulary does not know contributes\n * nothing rather than failing the fold.\n *\n * @param events the run's ordered control events\n * @since 1.0.0\n * @category constructors\n */\nconst rawDigest = (events: ReadonlyArray<ControlSchema.ControlEvent>): Digest => {\n  const accumulator: Accumulator = {\n    status: undefined,\n    cause: undefined,\n    fault: undefined,\n    seat: undefined,\n    turns: 0,\n    calls: 0,\n    callsFailed: 0,\n    editsAttempted: 0,\n    editsSucceeded: 0,\n    inputTokens: 0,\n    outputTokens: 0,\n    costUsd: 0,\n    finalOutput: undefined,\n    parkedQuestion: undefined\n  }\n  const refusalCounts = new Map<string, number>()\n  let startedAt: number | undefined\n  let endedAt: number | undefined\n  let nativeResolution: NativeResolution.NativeResolution | undefined\n\n  /**\n   * Widens the span this digest reports.\n   *\n   * Only a kind this fold handles widens it. The gateway merges a keepalive\n   * event whose kind no emitter uses into every followed `Watch` stream\n   * (`GatewayServer.watchHeartbeatKind`), and a fold that let an unhandled kind\n   * contribute its timestamp reported a run that ran for as long as it was\n   * watched.\n   */\n  const observe = (at: number): void => {\n    startedAt = startedAt === undefined ? at : Math.min(startedAt, at)\n    endedAt = endedAt === undefined ? at : Math.max(endedAt, at)\n  }\n\n  for (const event of uniqueCallEvents(events)) {\n    nativeResolution = NativeResolution.combine(nativeResolution, NativeResolution.fromEvent(event))\n    const payload = asRecord(event.payload)\n    const at = timeOf(event)\n    const handler = Object.hasOwn(handlers, event.kind) ? handlers[event.kind] : undefined\n    if (handler !== undefined) {\n      // A step's record still widens the span it was recorded in, because the\n      // step ran inside this run. Whether it may write the field is the\n      // handler's class: a root-only field keeps the root's reading.\n      observe(at)\n      if (handler.reach === \"aggregate\" || callScope(event) === undefined) handler.apply(accumulator, payload)\n      continue\n    }\n    if (event.kind === \"control.agent.cell-call-settled\") {\n      observe(at)\n      if (asString(payload.outcome) === \"failure\") {\n        accumulator.callsFailed += 1\n        const message = firstLine(asString(payload.message) ?? \"unknown refusal\")\n        refusalCounts.set(message, (refusalCounts.get(message) ?? 0) + 1)\n      } else if (editFlows.has(asString(payload.flowName) ?? \"\")) {\n        accumulator.editsSucceeded += 1\n      }\n      continue\n    }\n    if (event.kind.startsWith(\"control.run.\")) {\n      const status = event.kind.slice(\"control.run.\".length)\n      if (!runStatuses.has(status)) continue\n      observe(at)\n      accumulator.status = status as RunStatus\n      if (status === \"failed\") accumulator.cause = asString(payload.cause)\n      // A resumed run is no longer failed, so the fault of its last failure goes.\n      accumulator.fault = status === \"failed\" && isFault(payload.fault) ? payload.fault : undefined\n    }\n  }\n\n  return {\n    ...accumulator,\n    ...(nativeResolution === undefined ? {} : { nativeResolution }),\n    refusals: [...refusalCounts.entries()]\n      .map(([message, count]) => ({ message, count }))\n      .sort((left, right) => right.count - left.count),\n    startedAt,\n    endedAt\n  }\n}\n\nconst counters = [\n  \"turns\",\n  \"calls\",\n  \"callsFailed\",\n  \"editsAttempted\",\n  \"editsSucceeded\",\n  \"inputTokens\",\n  \"outputTokens\",\n  \"costUsd\"\n] as const\ntype ContributionValue = Partial<Pick<Digest, typeof counters[number] | \"seat\" | \"startedAt\" | \"endedAt\" | \"refusals\">>\n\nconst contributionValue = (value: Digest): ContributionValue => ({\n  ...Object.fromEntries(counters.filter((counter) => value[counter] !== 0).map((counter) => [counter, value[counter]])),\n  ...(value.seat === undefined ? {} : { seat: value.seat }),\n  ...(value.startedAt === undefined ? {} : { startedAt: value.startedAt }),\n  ...(value.endedAt === undefined ? {} : { endedAt: value.endedAt }),\n  ...(value.refusals.length === 0 ? {} : { refusals: value.refusals })\n})\n\ninterface Contribution {\n  readonly ordinal: number\n  readonly authoritative: boolean\n  readonly value: ContributionValue\n}\n\ninterface DigestState {\n  readonly base: Digest\n  readonly writes: { readonly cause: boolean; readonly finalOutput: boolean; readonly parkedQuestion: boolean }\n  readonly baseSeatOrdinal: number | undefined\n  readonly baseRefusals: ReadonlyMap<string, number>\n  readonly indexes: Indexes\n  readonly contributions: HashMap.HashMap<string, Contribution>\n  readonly contributionBytes: number\n  readonly length: number\n}\n\ninterface Indexes {\n  readonly timings: DigestIndex.Index | undefined\n  readonly refusals: HashMap.HashMap<string, DigestIndex.Index>\n  readonly refusalBytes: number\n}\n\nconst emptyIndexes = (): Indexes => ({ timings: undefined, refusals: HashMap.empty(), refusalBytes: 0 })\nconst refusalIndexBytes = (message: string, tree: DigestIndex.Index | undefined): number =>\n  tree === undefined ? 0 : encodedBytes(message) + tree.bytes\n\nconst indexContribution = (indexes: Indexes, previous: Contribution | undefined, next: Contribution): Indexes => {\n  let refusals = indexes.refusals\n  let refusalBytes = indexes.refusalBytes\n  for (const refusal of previous?.value.refusals ?? []) {\n    if (next.value.refusals?.some((member) => member.message === refusal.message)) continue\n    // Every previous refusal was indexed when its contribution was retained.\n    const oldTree = HashMap.getUnsafe(refusals, refusal.message)\n    const tree = DigestIndex.remove(oldTree, next.ordinal)\n    refusalBytes += refusalIndexBytes(refusal.message, tree) - refusalIndexBytes(refusal.message, oldTree)\n    refusals = tree === undefined\n      ? HashMap.remove(refusals, refusal.message)\n      : HashMap.set(refusals, refusal.message, tree)\n  }\n  for (const refusal of next.value.refusals ?? []) {\n    if (previous?.value.refusals?.some((member) => member.message === refusal.message)) continue\n    const old = HashMap.get(refusals, refusal.message)\n    const oldTree = old._tag === \"Some\" ? old.value : undefined\n    const tree = DigestIndex.set(oldTree, next.ordinal)\n    refusalBytes += refusalIndexBytes(refusal.message, tree) - refusalIndexBytes(refusal.message, oldTree)\n    refusals = HashMap.set(refusals, refusal.message, tree)\n  }\n  return {\n    timings: DigestIndex.set(indexes.timings, next.ordinal, next.value.startedAt, next.value.endedAt),\n    refusals,\n    refusalBytes\n  }\n}\n\n// Scalar contributions only: no model input, call output, or event body is\n// retained. Weak associations keep the public Digest and its wire shape intact.\nconst digestStates = new WeakMap<Digest, DigestState>()\nconst remember = (value: Digest, state: DigestState): Digest => {\n  digestStates.set(value, state)\n  recordDigestBytes(\n    value,\n    encodedBytes(value) + (value === state.base ? 0 : encodedBytes(state.base)) +\n      state.contributionBytes + (state.indexes.timings?.bytes ?? 0) + state.indexes.refusalBytes + encodedBytes({\n        writes: state.writes,\n        baseSeatOrdinal: state.baseSeatOrdinal,\n        baseRefusals: [...state.baseRefusals],\n        length: state.length\n      })\n  )\n  return value\n}\n\n/**\n * A `control.run.*` verdict stamped with a run id other than `runId`, such as\n * a child's riding in the parent's events. It must not set the digested run's\n * status or failure cause. An unstamped verdict is the run's own.\n *\n * @param event the event to classify\n * @param runId the run being digested; omitted, no verdict is foreign\n * @category predicates\n * @since 1.0.0\n */\nexport const foreignVerdict = (event: ControlSchema.ControlEvent, runId: string | undefined): boolean =>\n  runId !== undefined && event.runId !== undefined && event.runId !== runId && event.kind.startsWith(\"control.run.\")\n\n/**\n * Folds one event range, retaining compact identities for later combination.\n * Native facts supersede telemetry at its first position across ranges too.\n *\n * @param events the range to fold\n * @param runId the run being digested; a `control.run.*` verdict stamped with\n *   another run's id is skipped. Omitted, every verdict folds.\n * @category constructors\n * @since 1.0.0\n */\nexport const digest = (events: ReadonlyArray<ControlSchema.ControlEvent>, runId?: string): Digest => {\n  if (runId !== undefined && events.some((event) => foreignVerdict(event, runId))) {\n    events = events.filter((event) => !foreignVerdict(event, runId))\n  }\n  let contributions = HashMap.empty<string, Contribution>()\n  let indexes = emptyIndexes()\n  let contributionBytes = 0\n  const baseEvents: Array<ControlSchema.ControlEvent> = []\n  const baseRefusals = new Map<string, number>()\n  const writes = { cause: false, finalOutput: false, parkedQuestion: false }\n  let baseSeatOrdinal: number | undefined\n  for (const [ordinal, event] of events.entries()) {\n    const key = callEventKey(event)\n    if (key === undefined) {\n      baseEvents.push(event)\n      if (event.kind === \"control.run.failed\") writes.cause = true\n      if (callScope(event) === undefined) {\n        if (event.kind === \"control.agent.resolved\") writes.finalOutput = true\n        if (event.kind === \"control.approval.requested\") writes.parkedQuestion = true\n      }\n      const payload = asRecord(event.payload)\n      if (event.kind === \"control.agent.turn-opened\" && asString(payload.seat) !== undefined) baseSeatOrdinal = ordinal\n      if (event.kind === \"control.agent.cell-call-settled\" && payload.outcome === \"failure\") {\n        const message = firstLine(asString(payload.message) ?? \"unknown refusal\")\n        if (!baseRefusals.has(message)) baseRefusals.set(message, ordinal)\n      }\n      continue\n    }\n    const native = nativeStepEvent(event) ?? nativeCallEvent(event)\n    const previous = HashMap.get(contributions, key)\n    if (previous._tag === \"Some\" && (previous.value.authoritative || native === undefined)) continue\n    const contribution = {\n      ordinal: previous._tag === \"Some\" ? previous.value.ordinal : ordinal,\n      authoritative: native !== undefined,\n      value: contributionValue(rawDigest([native ?? event]))\n    }\n    contributionBytes += encodedBytes([key, contribution]) -\n      (previous._tag === \"Some\" ? encodedBytes([key, previous.value]) : 0)\n    contributions = HashMap.set(contributions, key, contribution)\n    indexes = indexContribution(indexes, previous._tag === \"Some\" ? previous.value : undefined, contribution)\n  }\n  const value = rawDigest(events)\n  return remember(value, {\n    base: baseEvents.length === events.length ? value : rawDigest(baseEvents),\n    writes,\n    baseSeatOrdinal,\n    baseRefusals,\n    indexes,\n    contributions,\n    contributionBytes,\n    length: events.length\n  })\n}\n\n/**\n * The wall-clock span the events cover, rendered for a reader.\n *\n * Only the span is read, so a caller carrying a wider digest of its own, as\n * `@smthrs/cli` `Forensics` does, measures it with this rather than a copy.\n *\n * @param value the span to measure\n * @since 1.0.0\n * @category rendering\n */\nexport const duration = (value: Pick<Digest, \"startedAt\" | \"endedAt\">): string => {\n  if (value.startedAt === undefined || value.endedAt === undefined) return \"0s\"\n  const seconds = Math.max(0, Math.round((value.endedAt - value.startedAt) / 1000))\n  return seconds < 60 ? `${seconds}s` : `${Math.floor(seconds / 60)}m ${String(seconds % 60).padStart(2, \"0\")}s`\n}\n\n/**\n * A USD amount for a reader: cents from one dollar, four places below it, so\n * a cheap run never reads as `$0.00`.\n *\n * @param value dollars, finite and non-negative\n * @since 1.0.0\n * @category rendering\n */\nexport const usd = (value: number): string => `$${value.toFixed(value >= 1 ? 2 : 4)}`\n\n/**\n * Assistant text, or a typed module's committed result under its bound root.\n * @category projections\n * @since 1.0.0\n */\nexport const resolvedOutput = (value: Pick<Digest, \"finalOutput\" | \"nativeResolution\">): string | undefined =>\n  value.finalOutput ?? NativeResolution.output(value.nativeResolution)\n\n/**\n * The one-line verdict: the status plus the reason that most explains it.\n *\n * Priority order mirrors what a reader needs first: a recorded failure cause,\n * then a park's question, then the \"worked but never edited\" pathology a green\n * status would otherwise hide, then the resolved output.\n *\n * @param value the digest to judge\n * @since 1.0.0\n * @category rendering\n */\nexport const verdict = (value: Digest): string => {\n  const status = value.status ?? \"unlaunched\"\n  const output = resolvedOutput(value)\n  if (status === \"failed\") {\n    return value.cause === undefined\n      ? \"failed \u2014 no cause recorded in the journal\"\n      : `failed \u2014 ${clip(firstLine(value.cause), 100)}`\n  }\n  if (status === \"waiting-approval\") {\n    return value.parkedQuestion === undefined\n      ? \"waiting-approval \u2014 a permission gate is pending\"\n      : `waiting-approval \u2014 asks: ${clip(value.parkedQuestion, 90)}`\n  }\n  if (status === \"completed\" && value.calls > 0 && value.editsAttempted === 0) {\n    return `completed \u2014 but 0 of ${value.calls} calls attempted an edit; the run only read`\n  }\n  if (status === \"completed\" && output !== undefined && output.length > 0) {\n    return `completed \u2014 ${clip(firstLine(output), 100)}`\n  }\n  return status\n}\n\nconst label = (name: string): string => name.padEnd(10)\n\n/**\n * Identity a diagnosis is rendered for.\n *\n * @since 1.0.0\n * @category models\n */\nexport interface Subject {\n  readonly runId: string\n  readonly flowId?: string | undefined\n}\n\n/**\n * Renders the diagnosis card for one run: verdict, activity evidence, tokens,\n * cost when any call was priced, refusals, cause, and output.\n *\n * @param subject the run being diagnosed\n * @param value the digest computed from its events\n * @since 1.0.0\n * @category rendering\n */\nexport const render = (subject: Subject, value: Digest): string => {\n  const output = resolvedOutput(value)\n  const lines: Array<string> = [\n    `${label(\"Verdict\")}${verdict(value)}`,\n    `${label(\"Run\")}${subject.runId}${subject.flowId === undefined ? \"\" : ` \u00B7 ${subject.flowId}`}${\n      value.seat === undefined ? \"\" : ` \u00B7 ${value.seat}`\n    } \u00B7 ${duration(value)}`,\n    `${\n      label(\"Activity\")\n    }${value.turns} turns \u00B7 ${value.calls} calls (${value.callsFailed} refused) \u00B7 edits ${value.editsSucceeded}/${value.editsAttempted}`,\n    `${label(\"Tokens\")}${value.inputTokens} in / ${value.outputTokens} out`,\n    ...(value.costUsd > 0 ? [`${label(\"Cost\")}${usd(value.costUsd)}`] : [])\n  ]\n  for (const [index, refusal] of value.refusals.slice(0, 3).entries()) {\n    lines.push(`${label(index === 0 ? \"Refusals\" : \"\")}${refusal.count}\u00D7 ${clip(refusal.message, 110)}`)\n  }\n  if (value.cause !== undefined) lines.push(`${label(\"Cause\")}${clip(firstLine(value.cause), 120)}`)\n  if (output !== undefined && output.length > 0) {\n    lines.push(`${label(\"Output\")}${clip(firstLine(output), 120)}`)\n  }\n  return lines.join(\"\\n\")\n}\n\n/**\n * A digest of no events at all: the identity {@link combine} folds onto.\n *\n * @since 1.0.0\n * @category constructors\n */\nexport const emptyDigest = (): Digest => digest([])\n\nconst earliest = (left: number | undefined, right: number | undefined): number | undefined =>\n  left === undefined ? right : right === undefined ? left : Math.min(left, right)\nconst latest = (left: number | undefined, right: number | undefined): number | undefined =>\n  left === undefined ? right : right === undefined ? left : Math.max(left, right)\n\n/**\n * Folds two digests of adjacent event ranges into the digest of both.\n *\n * `digest` is a left fold over an ordered range, so the digest of a whole\n * journal is the digest of its prefix combined with the digest of its\n * remainder. That identity is what lets a bounded reader keep exact counters\n * for a run whose journal it cannot hold: it folds the events it drops into a\n * carry digest and combines that carry with the digest of the window it kept.\n *\n * Used for contributions that do not overlap. Written fields may deliberately\n * clear an older value. Refusal counts merge and re-sort. The span widens.\n *\n * @param earlier the digest of the earlier range\n * @param later the digest of the range that follows it\n * @since 1.0.0\n * @category constructors\n */\nconst combinePlain = (earlier: Digest, later: Digest, writes: DigestState[\"writes\"]): Digest => {\n  const counts = new Map<string, number>()\n  for (const refusal of [...earlier.refusals, ...later.refusals]) {\n    counts.set(refusal.message, (counts.get(refusal.message) ?? 0) + refusal.count)\n  }\n  return {\n    status: later.status ?? earlier.status,\n    cause: writes.cause ? later.cause : earlier.cause,\n    fault: writes.cause || (later.status !== undefined && later.status !== \"failed\") ? later.fault : earlier.fault,\n    seat: later.seat ?? earlier.seat,\n    turns: earlier.turns + later.turns,\n    calls: earlier.calls + later.calls,\n    callsFailed: earlier.callsFailed + later.callsFailed,\n    editsAttempted: earlier.editsAttempted + later.editsAttempted,\n    editsSucceeded: earlier.editsSucceeded + later.editsSucceeded,\n    refusals: [...counts.entries()]\n      .map(([message, count]) => ({ message, count }))\n      .sort((left, right) => right.count - left.count),\n    inputTokens: earlier.inputTokens + later.inputTokens,\n    outputTokens: earlier.outputTokens + later.outputTokens,\n    costUsd: earlier.costUsd + later.costUsd,\n    finalOutput: writes.finalOutput ? later.finalOutput : earlier.finalOutput,\n    nativeResolution: NativeResolution.combine(earlier.nativeResolution, later.nativeResolution),\n    parkedQuestion: writes.parkedQuestion ? later.parkedQuestion : earlier.parkedQuestion,\n    startedAt: earliest(earlier.startedAt, later.startedAt),\n    endedAt: latest(earlier.endedAt, later.endedAt)\n  }\n}\n\nconst stateOf = (value: Digest): DigestState =>\n  digestStates.get(value) ?? {\n    base: value,\n    writes: {\n      cause: value.cause !== undefined,\n      finalOutput: value.finalOutput !== undefined,\n      parkedQuestion: value.parkedQuestion !== undefined\n    },\n    baseSeatOrdinal: value.seat === undefined ? undefined : 0,\n    baseRefusals: new Map(value.refusals.map((refusal) => [refusal.message, 0])),\n    indexes: emptyIndexes(),\n    contributions: HashMap.empty(),\n    contributionBytes: 0,\n    length: 1\n  }\n\n/** Rebuild only scalar facts; keyed observations never own root result/state fields. */\nconst combinedFacts = (state: DigestState): Digest => {\n  const result = { ...state.base }\n  let seatOrdinal = state.baseSeatOrdinal ?? -1\n  const refusals = new Map(state.base.refusals.map((refusal) => [refusal.message, {\n    count: refusal.count,\n    ordinal: state.baseRefusals.get(refusal.message)!\n  }]))\n  for (const [, contribution] of state.contributions) {\n    const value = contribution.value\n    for (const key of counters) result[key] += value[key] ?? 0\n    if (value.seat !== undefined && contribution.ordinal > seatOrdinal) {\n      result.seat = value.seat\n      seatOrdinal = contribution.ordinal\n    }\n    result.startedAt = earliest(result.startedAt, value.startedAt)\n    result.endedAt = latest(result.endedAt, value.endedAt)\n    for (const refusal of value.refusals ?? []) {\n      const previous = refusals.get(refusal.message)\n      refusals.set(refusal.message, {\n        count: (previous?.count ?? 0) + refusal.count,\n        ordinal: Math.min(previous?.ordinal ?? contribution.ordinal, contribution.ordinal)\n      })\n    }\n  }\n  result.refusals = [...refusals].sort(([, left], [, right]) =>\n    right.count - left.count || left.ordinal - right.ordinal\n  )\n    .map(([message, { count }]) => ({ message, count }))\n  return result\n}\n\n/**\n * Combines adjacent digests without counting an identified call or checkpoint\n * twice. A later native fact replaces the earlier telemetry contribution.\n * Identity state is private and must stay with the in-memory digest; a plain\n * reconstructed Digest is treated as an already aggregated, unkeyed value.\n * @category constructors\n * @since 1.0.0\n */\nexport const combine = (earlier: Digest, later: Digest): Digest => {\n  const left = stateOf(earlier)\n  const right = stateOf(later)\n  let contributions = left.contributions\n  let indexes = left.indexes\n  let contributionBytes = left.contributionBytes\n  let accepted = HashMap.empty<string, Contribution>()\n  const corrected = { ...earlier }\n  for (const [key, value] of right.contributions) {\n    const previous = HashMap.get(contributions, key)\n    if (previous._tag === \"Some\" && (previous.value.authoritative || !value.authoritative)) continue\n    if (previous._tag === \"Some\") {\n      const old = previous.value.value\n      const next = value.value\n      for (const counter of counters) corrected[counter] += (next[counter] ?? 0) - (old[counter] ?? 0)\n    } else accepted = HashMap.set(accepted, key, value)\n    const contribution = {\n      ...value,\n      ordinal: previous._tag === \"Some\" ? previous.value.ordinal : left.length + value.ordinal\n    }\n    contributionBytes += encodedBytes([key, contribution]) -\n      (previous._tag === \"Some\" ? encodedBytes([key, previous.value]) : 0)\n    contributions = HashMap.set(contributions, key, contribution)\n    indexes = indexContribution(indexes, previous._tag === \"Some\" ? previous.value : undefined, contribution)\n  }\n  const baseRefusals = new Map(left.baseRefusals)\n  for (const [message, ordinal] of right.baseRefusals) {\n    if (!baseRefusals.has(message)) baseRefusals.set(message, left.length + ordinal)\n  }\n  const incomingComplete = HashMap.size(accepted) === HashMap.size(right.contributions)\n  const incoming = incomingComplete ? later : combinedFacts({ ...right, contributions: accepted })\n  const state: DigestState = {\n    base: combinePlain(left.base, right.base, right.writes),\n    writes: {\n      cause: left.writes.cause || right.writes.cause,\n      finalOutput: left.writes.finalOutput || right.writes.finalOutput,\n      parkedQuestion: left.writes.parkedQuestion || right.writes.parkedQuestion\n    },\n    baseSeatOrdinal: right.baseSeatOrdinal === undefined ? left.baseSeatOrdinal : left.length + right.baseSeatOrdinal,\n    baseRefusals,\n    indexes,\n    contributions,\n    contributionBytes,\n    length: left.length + right.length\n  }\n  // Appending new identities (or replaying an existing one) should cost the\n  // incoming range, not re-fold the entire retained ledger on every eviction.\n  // Indexed timestamps and refusal positions handle native corrections without\n  // re-scanning all identities. Refusal rendering costs distinct messages.\n  const value = { ...combinePlain(corrected, incoming, right.writes) }\n  value.startedAt = state.base.startedAt\n  value.endedAt = state.base.endedAt\n  if (indexes.timings?.min !== undefined) {\n    value.startedAt = Math.min(value.startedAt ?? indexes.timings.min, indexes.timings.min)\n  }\n  if (indexes.timings?.max !== undefined) {\n    value.endedAt = Math.max(value.endedAt ?? indexes.timings.max, indexes.timings.max)\n  }\n  const refusals = new Map(state.base.refusals.map((refusal) => [refusal.message, {\n    count: refusal.count,\n    ordinal: baseRefusals.get(refusal.message)!\n  }]))\n  for (const [message, tree] of indexes.refusals) {\n    const previous = refusals.get(message)\n    refusals.set(message, {\n      count: (previous?.count ?? 0) + tree.size,\n      ordinal: Math.min(previous?.ordinal ?? tree.first, tree.first)\n    })\n  }\n  value.refusals = [...refusals].sort(([, a], [, b]) => b.count - a.count || a.ordinal - b.ordinal)\n    .map(([message, { count }]) => ({ message, count }))\n  return remember(value, state)\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAqBA,qBAA8B;AAC9B,YAAuB;AACvB,oBAAgC;AAChC,wBAA4F;AAC5F,kBAA6B;AAC7B,0BAAgD;AAChD,uBAAkC;AAoBlC,IAAAA,qBAA0E;AAS1E,IAAAA,qBAA8B;AAuB9B,MAAM,cAAmC,IAAI,IAAI,6BAAc,UAAU,QAAQ;AAoDjF,MAAM,YAAiC,oBAAI,IAAI,CAAC,SAAS,QAAQ,aAAa,CAAC;AAWxE,MAAM,WAAW,CAAC,UACvB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,IAAI,QAAmC,CAAC;AAStG,MAAM,WAAW,CAAC,UAAuC,OAAO,UAAU,WAAW,QAAQ;AAEpG,MAAM,UAAU,qBAAO,GAAG,MAAM,KAAK;AAS9B,MAAM,WAAW,CAAC,UAAuC,OAAO,UAAU,WAAW,QAAQ;AAS7F,MAAM,SAAS,CAAC,UACrB,SAAS,SAAS,MAAM,OAAO,EAAE,EAAE,KAAK,MAAM;AAWzC,MAAM,YAAY,CAAC,SAAyB;AACjD,QAAM,QAAQ,KAAK,OAAO,QAAQ;AAClC,SAAO,QAAQ,IAAI,OAAO,KAAK,MAAM,GAAG,KAAK;AAC/C;AAiBO,MAAM,OAAO,CAAC,MAAc,UAA0B;AAC3D,MAAI,SAAS,EAAG,QAAO;AACvB,QAAM,SAAS,CAAC,GAAG,IAAI;AACvB,SAAO,OAAO,UAAU,QAAQ,OAAO,GAAG,OAAO,MAAM,GAAG,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC;AAC/E;AAqEA,MAAM,WAA8C;AAAA,EAClD,6BAA6B;AAAA,IAC3B,OAAO;AAAA,IACP,OAAO,CAAC,aAAa,YAAY;AAC/B,kBAAY,SAAS;AACrB,kBAAY,OAAO,SAAS,QAAQ,IAAI,KAAK,YAAY;AAAA,IAC3D;AAAA,EACF;AAAA,EACA,+BAA+B;AAAA,IAC7B,OAAO;AAAA,IACP,OAAO,CAAC,aAAa,YAAY;AAC/B,YAAM,QAAQ,SAAS,QAAQ,KAAK;AACpC,kBAAY,eAAe,SAAS,MAAM,WAAW,KAAK;AAC1D,kBAAY,gBAAgB,SAAS,MAAM,YAAY,KAAK;AAC5D,YAAM,OAAO,SAAS,QAAQ,OAAO;AACrC,UAAI,SAAS,UAAa,OAAO,SAAS,IAAI,KAAK,OAAO,EAAG,aAAY,WAAW;AAAA,IACtF;AAAA,EACF;AAAA,EACA,mCAAmC;AAAA,IACjC,OAAO;AAAA,IACP,OAAO,CAAC,aAAa,YAAY;AAC/B,kBAAY,SAAS;AACrB,UAAI,UAAU,IAAI,SAAS,QAAQ,QAAQ,KAAK,EAAE,EAAG,aAAY,kBAAkB;AAAA,IACrF;AAAA,EACF;AAAA,EACA,0BAA0B;AAAA,IACxB,OAAO;AAAA,IACP,OAAO,CAAC,aAAa,YAAY;AAC/B,kBAAY,cAAc,SAAS,QAAQ,IAAI;AAAA,IACjD;AAAA,EACF;AAAA,EACA,8BAA8B;AAAA,IAC5B,OAAO;AAAA,IACP,OAAO,CAAC,aAAa,YAAY;AAC/B,kBAAY,iBAAiB,SAAS,QAAQ,QAAQ;AAAA,IACxD;AAAA,EACF;AACF;AAYO,MAAM,eAA+D,OAAO;AAAA,EACjF,OAAO,QAAQ,QAAQ,EAAE,IAAI,CAAC,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,QAAQ,KAAK,CAAC;AACzE;AAYA,MAAM,YAAY,CAAC,WAA8D;AAC/E,QAAM,cAA2B;AAAA,IAC/B,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,IACP,aAAa;AAAA,IACb,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,aAAa;AAAA,IACb,cAAc;AAAA,IACd,SAAS;AAAA,IACT,aAAa;AAAA,IACb,gBAAgB;AAAA,EAClB;AACA,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,MAAI;AACJ,MAAI;AACJ,MAAI;AAWJ,QAAM,UAAU,CAAC,OAAqB;AACpC,gBAAY,cAAc,SAAY,KAAK,KAAK,IAAI,WAAW,EAAE;AACjE,cAAU,YAAY,SAAY,KAAK,KAAK,IAAI,SAAS,EAAE;AAAA,EAC7D;AAEA,aAAW,aAAS,oCAAiB,MAAM,GAAG;AAC5C,uBAAmB,iBAAiB,QAAQ,kBAAkB,iBAAiB,UAAU,KAAK,CAAC;AAC/F,UAAM,UAAU,SAAS,MAAM,OAAO;AACtC,UAAM,KAAK,OAAO,KAAK;AACvB,UAAM,UAAU,OAAO,OAAO,UAAU,MAAM,IAAI,IAAI,SAAS,MAAM,IAAI,IAAI;AAC7E,QAAI,YAAY,QAAW;AAIzB,cAAQ,EAAE;AACV,UAAI,QAAQ,UAAU,mBAAe,6BAAU,KAAK,MAAM,OAAW,SAAQ,MAAM,aAAa,OAAO;AACvG;AAAA,IACF;AACA,QAAI,MAAM,SAAS,mCAAmC;AACpD,cAAQ,EAAE;AACV,UAAI,SAAS,QAAQ,OAAO,MAAM,WAAW;AAC3C,oBAAY,eAAe;AAC3B,cAAM,UAAU,UAAU,SAAS,QAAQ,OAAO,KAAK,iBAAiB;AACxE,sBAAc,IAAI,UAAU,cAAc,IAAI,OAAO,KAAK,KAAK,CAAC;AAAA,MAClE,WAAW,UAAU,IAAI,SAAS,QAAQ,QAAQ,KAAK,EAAE,GAAG;AAC1D,oBAAY,kBAAkB;AAAA,MAChC;AACA;AAAA,IACF;AACA,QAAI,MAAM,KAAK,WAAW,cAAc,GAAG;AACzC,YAAM,SAAS,MAAM,KAAK,MAAM,eAAe,MAAM;AACrD,UAAI,CAAC,YAAY,IAAI,MAAM,EAAG;AAC9B,cAAQ,EAAE;AACV,kBAAY,SAAS;AACrB,UAAI,WAAW,SAAU,aAAY,QAAQ,SAAS,QAAQ,KAAK;AAEnE,kBAAY,QAAQ,WAAW,YAAY,QAAQ,QAAQ,KAAK,IAAI,QAAQ,QAAQ;AAAA,IACtF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAI,qBAAqB,SAAY,CAAC,IAAI,EAAE,iBAAiB;AAAA,IAC7D,UAAU,CAAC,GAAG,cAAc,QAAQ,CAAC,EAClC,IAAI,CAAC,CAAC,SAAS,KAAK,OAAO,EAAE,SAAS,MAAM,EAAE,EAC9C,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AAAA,IACjD;AAAA,IACA;AAAA,EACF;AACF;AAEA,MAAM,WAAW;AAAA,EACf;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGA,MAAM,oBAAoB,CAAC,WAAsC;AAAA,EAC/D,GAAG,OAAO,YAAY,SAAS,OAAO,CAAC,YAAY,MAAM,OAAO,MAAM,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,SAAS,MAAM,OAAO,CAAC,CAAC,CAAC;AAAA,EACpH,GAAI,MAAM,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,MAAM,KAAK;AAAA,EACvD,GAAI,MAAM,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,MAAM,UAAU;AAAA,EACtE,GAAI,MAAM,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,MAAM,QAAQ;AAAA,EAChE,GAAI,MAAM,SAAS,WAAW,IAAI,CAAC,IAAI,EAAE,UAAU,MAAM,SAAS;AACpE;AAyBA,MAAM,eAAe,OAAgB,EAAE,SAAS,QAAW,UAAU,sBAAQ,MAAM,GAAG,cAAc,EAAE;AACtG,MAAM,oBAAoB,CAAC,SAAiB,SAC1C,SAAS,SAAY,QAAI,kCAAa,OAAO,IAAI,KAAK;AAExD,MAAM,oBAAoB,CAAC,SAAkB,UAAoC,SAAgC;AAC/G,MAAI,WAAW,QAAQ;AACvB,MAAI,eAAe,QAAQ;AAC3B,aAAW,WAAW,UAAU,MAAM,YAAY,CAAC,GAAG;AACpD,QAAI,KAAK,MAAM,UAAU,KAAK,CAAC,WAAW,OAAO,YAAY,QAAQ,OAAO,EAAG;AAE/E,UAAM,UAAU,sBAAQ,UAAU,UAAU,QAAQ,OAAO;AAC3D,UAAM,OAAO,YAAY,OAAO,SAAS,KAAK,OAAO;AACrD,oBAAgB,kBAAkB,QAAQ,SAAS,IAAI,IAAI,kBAAkB,QAAQ,SAAS,OAAO;AACrG,eAAW,SAAS,SAChB,sBAAQ,OAAO,UAAU,QAAQ,OAAO,IACxC,sBAAQ,IAAI,UAAU,QAAQ,SAAS,IAAI;AAAA,EACjD;AACA,aAAW,WAAW,KAAK,MAAM,YAAY,CAAC,GAAG;AAC/C,QAAI,UAAU,MAAM,UAAU,KAAK,CAAC,WAAW,OAAO,YAAY,QAAQ,OAAO,EAAG;AACpF,UAAM,MAAM,sBAAQ,IAAI,UAAU,QAAQ,OAAO;AACjD,UAAM,UAAU,IAAI,SAAS,SAAS,IAAI,QAAQ;AAClD,UAAM,OAAO,YAAY,IAAI,SAAS,KAAK,OAAO;AAClD,oBAAgB,kBAAkB,QAAQ,SAAS,IAAI,IAAI,kBAAkB,QAAQ,SAAS,OAAO;AACrG,eAAW,sBAAQ,IAAI,UAAU,QAAQ,SAAS,IAAI;AAAA,EACxD;AACA,SAAO;AAAA,IACL,SAAS,YAAY,IAAI,QAAQ,SAAS,KAAK,SAAS,KAAK,MAAM,WAAW,KAAK,MAAM,OAAO;AAAA,IAChG;AAAA,IACA;AAAA,EACF;AACF;AAIA,MAAM,eAAe,oBAAI,QAA6B;AACtD,MAAM,WAAW,CAAC,OAAe,UAA+B;AAC9D,eAAa,IAAI,OAAO,KAAK;AAC7B;AAAA,IACE;AAAA,QACA,kCAAa,KAAK,KAAK,UAAU,MAAM,OAAO,QAAI,kCAAa,MAAM,IAAI,KACvE,MAAM,qBAAqB,MAAM,QAAQ,SAAS,SAAS,KAAK,MAAM,QAAQ,mBAAe,kCAAa;AAAA,MACxG,QAAQ,MAAM;AAAA,MACd,iBAAiB,MAAM;AAAA,MACvB,cAAc,CAAC,GAAG,MAAM,YAAY;AAAA,MACpC,QAAQ,MAAM;AAAA,IAChB,CAAC;AAAA,EACL;AACA,SAAO;AACT;AAYO,MAAM,iBAAiB,CAAC,OAAmC,UAChE,UAAU,UAAa,MAAM,UAAU,UAAa,MAAM,UAAU,SAAS,MAAM,KAAK,WAAW,cAAc;AAY5G,MAAM,SAAS,CAAC,QAAmD,UAA2B;AACnG,MAAI,UAAU,UAAa,OAAO,KAAK,CAAC,UAAU,eAAe,OAAO,KAAK,CAAC,GAAG;AAC/E,aAAS,OAAO,OAAO,CAAC,UAAU,CAAC,eAAe,OAAO,KAAK,CAAC;AAAA,EACjE;AACA,MAAI,gBAAgB,sBAAQ,MAA4B;AACxD,MAAI,UAAU,aAAa;AAC3B,MAAI,oBAAoB;AACxB,QAAM,aAAgD,CAAC;AACvD,QAAM,eAAe,oBAAI,IAAoB;AAC7C,QAAM,SAAS,EAAE,OAAO,OAAO,aAAa,OAAO,gBAAgB,MAAM;AACzE,MAAI;AACJ,aAAW,CAAC,SAAS,KAAK,KAAK,OAAO,QAAQ,GAAG;AAC/C,UAAM,UAAM,gCAAa,KAAK;AAC9B,QAAI,QAAQ,QAAW;AACrB,iBAAW,KAAK,KAAK;AACrB,UAAI,MAAM,SAAS,qBAAsB,QAAO,QAAQ;AACxD,cAAI,6BAAU,KAAK,MAAM,QAAW;AAClC,YAAI,MAAM,SAAS,yBAA0B,QAAO,cAAc;AAClE,YAAI,MAAM,SAAS,6BAA8B,QAAO,iBAAiB;AAAA,MAC3E;AACA,YAAM,UAAU,SAAS,MAAM,OAAO;AACtC,UAAI,MAAM,SAAS,+BAA+B,SAAS,QAAQ,IAAI,MAAM,OAAW,mBAAkB;AAC1G,UAAI,MAAM,SAAS,qCAAqC,QAAQ,YAAY,WAAW;AACrF,cAAM,UAAU,UAAU,SAAS,QAAQ,OAAO,KAAK,iBAAiB;AACxE,YAAI,CAAC,aAAa,IAAI,OAAO,EAAG,cAAa,IAAI,SAAS,OAAO;AAAA,MACnE;AACA;AAAA,IACF;AACA,UAAM,aAAS,mCAAgB,KAAK,SAAK,mCAAgB,KAAK;AAC9D,UAAM,WAAW,sBAAQ,IAAI,eAAe,GAAG;AAC/C,QAAI,SAAS,SAAS,WAAW,SAAS,MAAM,iBAAiB,WAAW,QAAY;AACxF,UAAM,eAAe;AAAA,MACnB,SAAS,SAAS,SAAS,SAAS,SAAS,MAAM,UAAU;AAAA,MAC7D,eAAe,WAAW;AAAA,MAC1B,OAAO,kBAAkB,UAAU,CAAC,UAAU,KAAK,CAAC,CAAC;AAAA,IACvD;AACA,6BAAqB,kCAAa,CAAC,KAAK,YAAY,CAAC,KAClD,SAAS,SAAS,aAAS,kCAAa,CAAC,KAAK,SAAS,KAAK,CAAC,IAAI;AACpE,oBAAgB,sBAAQ,IAAI,eAAe,KAAK,YAAY;AAC5D,cAAU,kBAAkB,SAAS,SAAS,SAAS,SAAS,SAAS,QAAQ,QAAW,YAAY;AAAA,EAC1G;AACA,QAAM,QAAQ,UAAU,MAAM;AAC9B,SAAO,SAAS,OAAO;AAAA,IACrB,MAAM,WAAW,WAAW,OAAO,SAAS,QAAQ,UAAU,UAAU;AAAA,IACxE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,OAAO;AAAA,EACjB,CAAC;AACH;AAYO,MAAM,WAAW,CAAC,UAAyD;AAChF,MAAI,MAAM,cAAc,UAAa,MAAM,YAAY,OAAW,QAAO;AACzE,QAAM,UAAU,KAAK,IAAI,GAAG,KAAK,OAAO,MAAM,UAAU,MAAM,aAAa,GAAI,CAAC;AAChF,SAAO,UAAU,KAAK,GAAG,OAAO,MAAM,GAAG,KAAK,MAAM,UAAU,EAAE,CAAC,KAAK,OAAO,UAAU,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC7G;AAUO,MAAM,MAAM,CAAC,UAA0B,IAAI,MAAM,QAAQ,SAAS,IAAI,IAAI,CAAC,CAAC;AAO5E,MAAM,iBAAiB,CAAC,UAC7B,MAAM,eAAe,iBAAiB,OAAO,MAAM,gBAAgB;AAa9D,MAAM,UAAU,CAAC,UAA0B;AAChD,QAAM,SAAS,MAAM,UAAU;AAC/B,QAAM,SAAS,eAAe,KAAK;AACnC,MAAI,WAAW,UAAU;AACvB,WAAO,MAAM,UAAU,SACnB,mDACA,iBAAY,KAAK,UAAU,MAAM,KAAK,GAAG,GAAG,CAAC;AAAA,EACnD;AACA,MAAI,WAAW,oBAAoB;AACjC,WAAO,MAAM,mBAAmB,SAC5B,yDACA,iCAA4B,KAAK,MAAM,gBAAgB,EAAE,CAAC;AAAA,EAChE;AACA,MAAI,WAAW,eAAe,MAAM,QAAQ,KAAK,MAAM,mBAAmB,GAAG;AAC3E,WAAO,6BAAwB,MAAM,KAAK;AAAA,EAC5C;AACA,MAAI,WAAW,eAAe,WAAW,UAAa,OAAO,SAAS,GAAG;AACvE,WAAO,oBAAe,KAAK,UAAU,MAAM,GAAG,GAAG,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAEA,MAAM,QAAQ,CAAC,SAAyB,KAAK,OAAO,EAAE;AAsB/C,MAAM,SAAS,CAAC,SAAkB,UAA0B;AACjE,QAAM,SAAS,eAAe,KAAK;AACnC,QAAM,QAAuB;AAAA,IAC3B,GAAG,MAAM,SAAS,CAAC,GAAG,QAAQ,KAAK,CAAC;AAAA,IACpC,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,KAAK,GAAG,QAAQ,WAAW,SAAY,KAAK,SAAM,QAAQ,MAAM,EAAE,GAC1F,MAAM,SAAS,SAAY,KAAK,SAAM,MAAM,IAAI,EAClD,SAAM,SAAS,KAAK,CAAC;AAAA,IACrB,GACE,MAAM,UAAU,CAClB,GAAG,MAAM,KAAK,eAAY,MAAM,KAAK,WAAW,MAAM,WAAW,wBAAqB,MAAM,cAAc,IAAI,MAAM,cAAc;AAAA,IAClI,GAAG,MAAM,QAAQ,CAAC,GAAG,MAAM,WAAW,SAAS,MAAM,YAAY;AAAA,IACjE,GAAI,MAAM,UAAU,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,GAAG,IAAI,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC;AAAA,EACvE;AACA,aAAW,CAAC,OAAO,OAAO,KAAK,MAAM,SAAS,MAAM,GAAG,CAAC,EAAE,QAAQ,GAAG;AACnE,UAAM,KAAK,GAAG,MAAM,UAAU,IAAI,aAAa,EAAE,CAAC,GAAG,QAAQ,KAAK,QAAK,KAAK,QAAQ,SAAS,GAAG,CAAC,EAAE;AAAA,EACrG;AACA,MAAI,MAAM,UAAU,OAAW,OAAM,KAAK,GAAG,MAAM,OAAO,CAAC,GAAG,KAAK,UAAU,MAAM,KAAK,GAAG,GAAG,CAAC,EAAE;AACjG,MAAI,WAAW,UAAa,OAAO,SAAS,GAAG;AAC7C,UAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,UAAU,MAAM,GAAG,GAAG,CAAC,EAAE;AAAA,EAChE;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAQO,MAAM,cAAc,MAAc,OAAO,CAAC,CAAC;AAElD,MAAM,WAAW,CAAC,MAA0B,UAC1C,SAAS,SAAY,QAAQ,UAAU,SAAY,OAAO,KAAK,IAAI,MAAM,KAAK;AAChF,MAAM,SAAS,CAAC,MAA0B,UACxC,SAAS,SAAY,QAAQ,UAAU,SAAY,OAAO,KAAK,IAAI,MAAM,KAAK;AAmBhF,MAAM,eAAe,CAAC,SAAiB,OAAe,WAA0C;AAC9F,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,WAAW,CAAC,GAAG,QAAQ,UAAU,GAAG,MAAM,QAAQ,GAAG;AAC9D,WAAO,IAAI,QAAQ,UAAU,OAAO,IAAI,QAAQ,OAAO,KAAK,KAAK,QAAQ,KAAK;AAAA,EAChF;AACA,SAAO;AAAA,IACL,QAAQ,MAAM,UAAU,QAAQ;AAAA,IAChC,OAAO,OAAO,QAAQ,MAAM,QAAQ,QAAQ;AAAA,IAC5C,OAAO,OAAO,SAAU,MAAM,WAAW,UAAa,MAAM,WAAW,WAAY,MAAM,QAAQ,QAAQ;AAAA,IACzG,MAAM,MAAM,QAAQ,QAAQ;AAAA,IAC5B,OAAO,QAAQ,QAAQ,MAAM;AAAA,IAC7B,OAAO,QAAQ,QAAQ,MAAM;AAAA,IAC7B,aAAa,QAAQ,cAAc,MAAM;AAAA,IACzC,gBAAgB,QAAQ,iBAAiB,MAAM;AAAA,IAC/C,gBAAgB,QAAQ,iBAAiB,MAAM;AAAA,IAC/C,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC,EAC3B,IAAI,CAAC,CAAC,SAAS,KAAK,OAAO,EAAE,SAAS,MAAM,EAAE,EAC9C,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AAAA,IACjD,aAAa,QAAQ,cAAc,MAAM;AAAA,IACzC,cAAc,QAAQ,eAAe,MAAM;AAAA,IAC3C,SAAS,QAAQ,UAAU,MAAM;AAAA,IACjC,aAAa,OAAO,cAAc,MAAM,cAAc,QAAQ;AAAA,IAC9D,kBAAkB,iBAAiB,QAAQ,QAAQ,kBAAkB,MAAM,gBAAgB;AAAA,IAC3F,gBAAgB,OAAO,iBAAiB,MAAM,iBAAiB,QAAQ;AAAA,IACvE,WAAW,SAAS,QAAQ,WAAW,MAAM,SAAS;AAAA,IACtD,SAAS,OAAO,QAAQ,SAAS,MAAM,OAAO;AAAA,EAChD;AACF;AAEA,MAAM,UAAU,CAAC,UACf,aAAa,IAAI,KAAK,KAAK;AAAA,EACzB,MAAM;AAAA,EACN,QAAQ;AAAA,IACN,OAAO,MAAM,UAAU;AAAA,IACvB,aAAa,MAAM,gBAAgB;AAAA,IACnC,gBAAgB,MAAM,mBAAmB;AAAA,EAC3C;AAAA,EACA,iBAAiB,MAAM,SAAS,SAAY,SAAY;AAAA,EACxD,cAAc,IAAI,IAAI,MAAM,SAAS,IAAI,CAAC,YAAY,CAAC,QAAQ,SAAS,CAAC,CAAC,CAAC;AAAA,EAC3E,SAAS,aAAa;AAAA,EACtB,eAAe,sBAAQ,MAAM;AAAA,EAC7B,mBAAmB;AAAA,EACnB,QAAQ;AACV;AAGF,MAAM,gBAAgB,CAAC,UAA+B;AACpD,QAAM,SAAS,EAAE,GAAG,MAAM,KAAK;AAC/B,MAAI,cAAc,MAAM,mBAAmB;AAC3C,QAAM,WAAW,IAAI,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,YAAY,CAAC,QAAQ,SAAS;AAAA,IAC9E,OAAO,QAAQ;AAAA,IACf,SAAS,MAAM,aAAa,IAAI,QAAQ,OAAO;AAAA,EACjD,CAAC,CAAC,CAAC;AACH,aAAW,CAAC,EAAE,YAAY,KAAK,MAAM,eAAe;AAClD,UAAM,QAAQ,aAAa;AAC3B,eAAW,OAAO,SAAU,QAAO,GAAG,KAAK,MAAM,GAAG,KAAK;AACzD,QAAI,MAAM,SAAS,UAAa,aAAa,UAAU,aAAa;AAClE,aAAO,OAAO,MAAM;AACpB,oBAAc,aAAa;AAAA,IAC7B;AACA,WAAO,YAAY,SAAS,OAAO,WAAW,MAAM,SAAS;AAC7D,WAAO,UAAU,OAAO,OAAO,SAAS,MAAM,OAAO;AACrD,eAAW,WAAW,MAAM,YAAY,CAAC,GAAG;AAC1C,YAAM,WAAW,SAAS,IAAI,QAAQ,OAAO;AAC7C,eAAS,IAAI,QAAQ,SAAS;AAAA,QAC5B,QAAQ,UAAU,SAAS,KAAK,QAAQ;AAAA,QACxC,SAAS,KAAK,IAAI,UAAU,WAAW,aAAa,SAAS,aAAa,OAAO;AAAA,MACnF,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,WAAW,CAAC,GAAG,QAAQ,EAAE;AAAA,IAAK,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,KAAK,MACtD,MAAM,QAAQ,KAAK,SAAS,KAAK,UAAU,MAAM;AAAA,EACnD,EACG,IAAI,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE;AACrD,SAAO;AACT;AAUO,MAAM,UAAU,CAAC,SAAiB,UAA0B;AACjE,QAAM,OAAO,QAAQ,OAAO;AAC5B,QAAM,QAAQ,QAAQ,KAAK;AAC3B,MAAI,gBAAgB,KAAK;AACzB,MAAI,UAAU,KAAK;AACnB,MAAI,oBAAoB,KAAK;AAC7B,MAAI,WAAW,sBAAQ,MAA4B;AACnD,QAAM,YAAY,EAAE,GAAG,QAAQ;AAC/B,aAAW,CAAC,KAAKC,MAAK,KAAK,MAAM,eAAe;AAC9C,UAAM,WAAW,sBAAQ,IAAI,eAAe,GAAG;AAC/C,QAAI,SAAS,SAAS,WAAW,SAAS,MAAM,iBAAiB,CAACA,OAAM,eAAgB;AACxF,QAAI,SAAS,SAAS,QAAQ;AAC5B,YAAM,MAAM,SAAS,MAAM;AAC3B,YAAM,OAAOA,OAAM;AACnB,iBAAW,WAAW,SAAU,WAAU,OAAO,MAAM,KAAK,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK;AAAA,IAChG,MAAO,YAAW,sBAAQ,IAAI,UAAU,KAAKA,MAAK;AAClD,UAAM,eAAe;AAAA,MACnB,GAAGA;AAAA,MACH,SAAS,SAAS,SAAS,SAAS,SAAS,MAAM,UAAU,KAAK,SAASA,OAAM;AAAA,IACnF;AACA,6BAAqB,kCAAa,CAAC,KAAK,YAAY,CAAC,KAClD,SAAS,SAAS,aAAS,kCAAa,CAAC,KAAK,SAAS,KAAK,CAAC,IAAI;AACpE,oBAAgB,sBAAQ,IAAI,eAAe,KAAK,YAAY;AAC5D,cAAU,kBAAkB,SAAS,SAAS,SAAS,SAAS,SAAS,QAAQ,QAAW,YAAY;AAAA,EAC1G;AACA,QAAM,eAAe,IAAI,IAAI,KAAK,YAAY;AAC9C,aAAW,CAAC,SAAS,OAAO,KAAK,MAAM,cAAc;AACnD,QAAI,CAAC,aAAa,IAAI,OAAO,EAAG,cAAa,IAAI,SAAS,KAAK,SAAS,OAAO;AAAA,EACjF;AACA,QAAM,mBAAmB,sBAAQ,KAAK,QAAQ,MAAM,sBAAQ,KAAK,MAAM,aAAa;AACpF,QAAM,WAAW,mBAAmB,QAAQ,cAAc,EAAE,GAAG,OAAO,eAAe,SAAS,CAAC;AAC/F,QAAM,QAAqB;AAAA,IACzB,MAAM,aAAa,KAAK,MAAM,MAAM,MAAM,MAAM,MAAM;AAAA,IACtD,QAAQ;AAAA,MACN,OAAO,KAAK,OAAO,SAAS,MAAM,OAAO;AAAA,MACzC,aAAa,KAAK,OAAO,eAAe,MAAM,OAAO;AAAA,MACrD,gBAAgB,KAAK,OAAO,kBAAkB,MAAM,OAAO;AAAA,IAC7D;AAAA,IACA,iBAAiB,MAAM,oBAAoB,SAAY,KAAK,kBAAkB,KAAK,SAAS,MAAM;AAAA,IAClG;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,KAAK,SAAS,MAAM;AAAA,EAC9B;AAKA,QAAM,QAAQ,EAAE,GAAG,aAAa,WAAW,UAAU,MAAM,MAAM,EAAE;AACnE,QAAM,YAAY,MAAM,KAAK;AAC7B,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,QAAQ,SAAS,QAAQ,QAAW;AACtC,UAAM,YAAY,KAAK,IAAI,MAAM,aAAa,QAAQ,QAAQ,KAAK,QAAQ,QAAQ,GAAG;AAAA,EACxF;AACA,MAAI,QAAQ,SAAS,QAAQ,QAAW;AACtC,UAAM,UAAU,KAAK,IAAI,MAAM,WAAW,QAAQ,QAAQ,KAAK,QAAQ,QAAQ,GAAG;AAAA,EACpF;AACA,QAAM,WAAW,IAAI,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,YAAY,CAAC,QAAQ,SAAS;AAAA,IAC9E,OAAO,QAAQ;AAAA,IACf,SAAS,aAAa,IAAI,QAAQ,OAAO;AAAA,EAC3C,CAAC,CAAC,CAAC;AACH,aAAW,CAAC,SAAS,IAAI,KAAK,QAAQ,UAAU;AAC9C,UAAM,WAAW,SAAS,IAAI,OAAO;AACrC,aAAS,IAAI,SAAS;AAAA,MACpB,QAAQ,UAAU,SAAS,KAAK,KAAK;AAAA,MACrC,SAAS,KAAK,IAAI,UAAU,WAAW,KAAK,OAAO,KAAK,KAAK;AAAA,IAC/D,CAAC;AAAA,EACH;AACA,QAAM,WAAW,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAC7F,IAAI,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE;AACrD,SAAO,SAAS,OAAO,KAAK;AAC9B;",
+  "names": ["import_callEvents", "value"]
+}