@titan-design/queue-mirror 0.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Henry Jewkes
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,10 @@
+# @titan-design/queue-mirror
+
+Projects a local queue of human-actionable items (agent approvals, endorsements, questions,
+notices) into a Matrix `#queue` room, and folds the owner's reactions and replies back into
+verdicts on that queue.
+
+Tier 2 of the titan-platform DAG. Depends on `@titan-design/matrix-bus`. The root entry has
+no `node:` import.
+
+Reference: [site/reference/queue-mirror.md](../../site/reference/queue-mirror.md).

package/dist/index.d.ts

@@ -0,0 +1,143 @@
+import { ItemKind, TitanItem, Verdict, ItemInput } from '@titan-design/matrix-bus';
+
+/** One pending thing a human can act on; `id` becomes TitanItem.msg_id. */
+interface QueueItem {
+    id: string;
+    kind: ItemKind;
+    machine: string;
+    session: string;
+    at: number;
+    agentId?: string;
+    toolName?: string;
+    inputPreview?: string;
+    recipient?: string;
+    text?: string;
+    /** Epoch ms; the mirror edits the item "expired" once the clock passes it. */
+    expiresAt?: number;
+}
+type CloseOutcome = "resolved" | "cancelled" | "expired";
+type SourceEvent = {
+    type: "opened";
+    item: QueueItem;
+    cursor: string;
+} | {
+    type: "closed";
+    id: string;
+    outcome: CloseOutcome;
+    label?: string;
+    cursor: string;
+};
+interface VerdictInput {
+    verdict: Verdict;
+    text?: string;
+    resolutionEventId: string;
+}
+type ResolveResult = {
+    ok: true;
+} | {
+    ok: false;
+    reason: "closed" | "rejected";
+    detail?: string;
+};
+interface QueueSource {
+    readonly kinds: readonly ItemKind[];
+    open(): Promise<QueueItem[]>;
+    /** Events after `cursor` (undefined = from now); ends when `signal` aborts. */
+    tail(cursor: string | undefined, signal: AbortSignal): AsyncIterable<SourceEvent>;
+    resolve(id: string, verdict: VerdictInput): Promise<ResolveResult>;
+}
+interface PostedItem {
+    sourceId: string;
+    eventId: string;
+    kind: ItemKind;
+    /** False when the item was redacted or truncated, so no phone verdict may resolve it. */
+    approvable: boolean;
+    status: "open" | "closed";
+    /** Epoch ms after which the sweep closes the item: the source's expiry, or the approval TTL. */
+    expiresAt?: number;
+    /** The record as posted; an edit repeats it in m.new_content and reads its redacted and truncated flags. */
+    record: TitanItem;
+}
+interface StateChange {
+    sourceCursor?: string;
+    syncToken?: string;
+    posted?: PostedItem[];
+    /** Source ids. */
+    closed?: string[];
+    /** Resolution event ids. */
+    applied?: string[];
+}
+/** Synchronous like hitl's GateStore: both implementations are local. `commit` is atomic. */
+interface MirrorState {
+    sourceCursor(): string | undefined;
+    syncToken(): string | undefined;
+    bySourceId(id: string): PostedItem | undefined;
+    byEventId(eventId: string): PostedItem | undefined;
+    openItems(): PostedItem[];
+    hasApplied(resolutionEventId: string): boolean;
+    commit(change: StateChange): void;
+}
+
+/** A base64-like run is a secret only if it mixes digits and both cases and no path segment is a plain word. */
+declare function looksSecret(run: string): boolean;
+/** Section 10 decision 3: masks auth headers, key=value secrets and long hex or base64 runs. */
+declare function redactPreview(text: string): {
+    text: string;
+    redacted: boolean;
+};
+
+/** Halves `inputPreview` and `text` until the encoded content fits, marking the item truncated. */
+declare function fitItem(input: ItemInput): ItemInput;
+/** Redacts before fitting, so a cut never strands the tail of a secret the patterns no longer see whole. */
+declare function toItemInput(item: QueueItem): ItemInput;
+/** A /sync filter that returns only the queue room's timeline, with no presence, receipts or account data. */
+declare function syncFilter(roomId: string): Record<string, unknown>;
+
+/** An in-memory QueueSource for tests; cursors are the 1-based position in its event log. */
+declare class MemoryQueueSource implements QueueSource {
+    readonly kinds: readonly ItemKind[];
+    readonly resolutions: Array<{
+        id: string;
+    } & VerdictInput>;
+    private readonly pending;
+    private readonly log;
+    private readonly waiters;
+    constructor(kinds?: readonly ItemKind[]);
+    add(item: QueueItem): void;
+    close(id: string, outcome: CloseOutcome, label?: string): void;
+    open(): Promise<QueueItem[]>;
+    resolve(id: string, verdict: VerdictInput): Promise<ResolveResult>;
+    /** "Now" is fixed when tail is called, not at the first next(), so nothing added in between is missed. */
+    tail(cursor: string | undefined, signal: AbortSignal): AsyncIterable<SourceEvent>;
+    private stream;
+    private nextCursor;
+    private append;
+    private nextAppend;
+}
+
+interface MirrorSnapshot {
+    sourceCursor?: string;
+    syncToken?: string;
+    posted: PostedItem[];
+    applied: string[];
+}
+/** An in-memory MirrorState; `snapshot` and `restore` stand in for a restart in replay tests. */
+declare class MemoryMirrorState implements MirrorState {
+    private cursor;
+    private token;
+    private readonly items;
+    private readonly eventIndex;
+    private readonly applied;
+    static restore(snapshot: MirrorSnapshot): MemoryMirrorState;
+    sourceCursor(): string | undefined;
+    syncToken(): string | undefined;
+    bySourceId(id: string): PostedItem | undefined;
+    byEventId(eventId: string): PostedItem | undefined;
+    openItems(): PostedItem[];
+    hasApplied(resolutionEventId: string): boolean;
+    /** Applies posted before closed, so one change may post and close the same item. */
+    commit(change: StateChange): void;
+    snapshot(): MirrorSnapshot;
+}
+
+export { type CloseOutcome, MemoryMirrorState, MemoryQueueSource, type MirrorSnapshot, type MirrorState, type PostedItem, type QueueItem, type QueueSource, type ResolveResult, type SourceEvent, type StateChange, type VerdictInput, fitItem, looksSecret, redactPreview, syncFilter, toItemInput };

package/dist/index.js

@@ -0,0 +1,201 @@
+// src/redact.ts
+var PLACEHOLDER = "[REDACTED]";
+var AUTH_HEADER = /\b(Bearer|Basic)\s+[A-Za-z0-9._~+/-]+=*/gi;
+var KEY_VALUE = /\b([A-Za-z0-9_-]*(?:token|key|password))(["']?\s*[=:]\s*)("[^"]*"|'[^']*'|[^\s&"',;]+)/gi;
+var HEX_RUN = /\b(?:[0-9a-fA-F]{32,39}|[0-9a-fA-F]{41,})\b/g;
+var B64_RUN = /(?<![A-Za-z0-9+/_-])[A-Za-z0-9+/_-]{32,}={0,2}(?![A-Za-z0-9+/_=-])/g;
+var PLAIN_WORD = /^(?:[a-z]{3,}|[A-Z]{3,})$/;
+function looksSecret(run) {
+  if (!/\d/.test(run) || !/[A-Z]/.test(run) || !/[a-z]/.test(run)) return false;
+  return !run.split("/").some((segment) => PLAIN_WORD.test(segment));
+}
+function redactPreview(text) {
+  let hits = 0;
+  const hit = (replacement) => {
+    hits += 1;
+    return replacement;
+  };
+  const out = text.replace(AUTH_HEADER, (_match, scheme) => hit(`${scheme} ${PLACEHOLDER}`)).replace(KEY_VALUE, (_match, name, separator) => hit(`${name}${separator}${PLACEHOLDER}`)).replace(HEX_RUN, () => hit(PLACEHOLDER)).replace(B64_RUN, (run) => looksSecret(run) ? hit(PLACEHOLDER) : run);
+  return { text: out, redacted: hits > 0 };
+}
+
+// src/render.ts
+import { MAX_CONTENT_BYTES, contentBytes, encodeItem } from "@titan-design/matrix-bus";
+var MAX_FIT_ROUNDS = 16;
+function fits(input) {
+  return contentBytes(encodeItem(input)) <= MAX_CONTENT_BYTES;
+}
+function shrink(value, round) {
+  if (value === void 0) return void 0;
+  const points = Array.from(value);
+  return `${points.slice(0, Math.floor(points.length / 2 ** round)).join("")}\u2026`;
+}
+function fitItem(input) {
+  if (fits(input)) return input;
+  for (let round = 1; round <= MAX_FIT_ROUNDS; round += 1) {
+    const cut = { ...input, input_preview: shrink(input.input_preview, round), text: shrink(input.text, round), truncated: true };
+    if (fits(cut)) return cut;
+  }
+  return { ...input, input_preview: void 0, text: void 0, truncated: true };
+}
+function redactFields(item) {
+  if (item.kind === "approval_request" && item.inputPreview !== void 0) {
+    const { text, redacted } = redactPreview(item.inputPreview);
+    return { inputPreview: text, text: item.text, redacted };
+  }
+  if (item.kind === "endorse_request" && item.text !== void 0) {
+    const { text, redacted } = redactPreview(item.text);
+    return { inputPreview: item.inputPreview, text, redacted };
+  }
+  return { inputPreview: item.inputPreview, text: item.text, redacted: false };
+}
+function toItemInput(item) {
+  const { inputPreview, text, redacted } = redactFields(item);
+  return fitItem({
+    kind: item.kind,
+    machine: item.machine,
+    session: item.session,
+    agent_id: item.agentId,
+    msg_id: item.id,
+    at: item.at,
+    tool_name: item.toolName,
+    input_preview: inputPreview,
+    recipient: item.recipient,
+    text,
+    truncated: false,
+    redacted
+  });
+}
+function syncFilter(roomId) {
+  const none = { types: [] };
+  return {
+    presence: none,
+    account_data: none,
+    room: { rooms: [roomId], timeline: { limit: 50 }, state: none, ephemeral: none, account_data: none }
+  };
+}
+
+// src/memory-source.ts
+import { ITEM_KINDS } from "@titan-design/matrix-bus";
+var MemoryQueueSource = class {
+  constructor(kinds = ITEM_KINDS) {
+    this.kinds = kinds;
+  }
+  kinds;
+  resolutions = [];
+  pending = /* @__PURE__ */ new Map();
+  log = [];
+  waiters = /* @__PURE__ */ new Set();
+  add(item) {
+    this.pending.set(item.id, item);
+    this.append({ type: "opened", item, cursor: this.nextCursor() });
+  }
+  close(id, outcome, label) {
+    if (!this.pending.delete(id)) return;
+    this.append({ type: "closed", id, outcome, label, cursor: this.nextCursor() });
+  }
+  async open() {
+    return [...this.pending.values()];
+  }
+  async resolve(id, verdict) {
+    if (!this.pending.has(id)) return { ok: false, reason: "closed" };
+    this.resolutions.push({ id, ...verdict });
+    this.close(id, "resolved", verdict.verdict);
+    return { ok: true };
+  }
+  /** "Now" is fixed when tail is called, not at the first next(), so nothing added in between is missed. */
+  tail(cursor, signal) {
+    return this.stream(cursor === void 0 ? this.log.length : Number(cursor), signal);
+  }
+  async *stream(start, signal) {
+    let next = start;
+    while (!signal.aborted) {
+      while (next < this.log.length) yield this.log[next++];
+      await this.nextAppend(signal);
+    }
+  }
+  nextCursor() {
+    return String(this.log.length + 1);
+  }
+  append(event) {
+    this.log.push(event);
+    for (const wake of [...this.waiters]) wake();
+  }
+  nextAppend(signal) {
+    return new Promise((resolve) => {
+      if (signal.aborted) return resolve();
+      const done = () => {
+        this.waiters.delete(done);
+        signal.removeEventListener("abort", done);
+        resolve();
+      };
+      this.waiters.add(done);
+      signal.addEventListener("abort", done);
+    });
+  }
+};
+
+// src/memory-state.ts
+var MemoryMirrorState = class _MemoryMirrorState {
+  cursor;
+  token;
+  items = /* @__PURE__ */ new Map();
+  eventIndex = /* @__PURE__ */ new Map();
+  applied = /* @__PURE__ */ new Set();
+  static restore(snapshot) {
+    const state = new _MemoryMirrorState();
+    state.commit({ ...snapshot, posted: snapshot.posted.map((item) => ({ ...item })) });
+    return state;
+  }
+  sourceCursor() {
+    return this.cursor;
+  }
+  syncToken() {
+    return this.token;
+  }
+  bySourceId(id) {
+    return this.items.get(id);
+  }
+  byEventId(eventId) {
+    const sourceId = this.eventIndex.get(eventId);
+    return sourceId === void 0 ? void 0 : this.items.get(sourceId);
+  }
+  openItems() {
+    return [...this.items.values()].filter((item) => item.status === "open");
+  }
+  hasApplied(resolutionEventId) {
+    return this.applied.has(resolutionEventId);
+  }
+  /** Applies posted before closed, so one change may post and close the same item. */
+  commit(change) {
+    for (const item of change.posted ?? []) {
+      this.items.set(item.sourceId, { ...item });
+      this.eventIndex.set(item.eventId, item.sourceId);
+    }
+    for (const id of change.closed ?? []) {
+      const item = this.items.get(id);
+      if (item) item.status = "closed";
+    }
+    for (const id of change.applied ?? []) this.applied.add(id);
+    if (change.sourceCursor !== void 0) this.cursor = change.sourceCursor;
+    if (change.syncToken !== void 0) this.token = change.syncToken;
+  }
+  snapshot() {
+    return {
+      sourceCursor: this.cursor,
+      syncToken: this.token,
+      posted: [...this.items.values()].map((item) => ({ ...item })),
+      applied: [...this.applied]
+    };
+  }
+};
+export {
+  MemoryMirrorState,
+  MemoryQueueSource,
+  fitItem,
+  looksSecret,
+  redactPreview,
+  syncFilter,
+  toItemInput
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/redact.ts","../src/render.ts","../src/memory-source.ts","../src/memory-state.ts"],"sourcesContent":["const PLACEHOLDER = \"[REDACTED]\";\n\nconst AUTH_HEADER = /\\b(Bearer|Basic)\\s+[A-Za-z0-9._~+/-]+=*/gi;\n// The optional quote after the name lets a JSON key such as \"password\": \"x\" match.\nconst KEY_VALUE = /\\b([A-Za-z0-9_-]*(?:token|key|password))([\"']?\\s*[=:]\\s*)(\"[^\"]*\"|'[^']*'|[^\\s&\"',;]+)/gi;\n// Exactly 40 hex characters is a git commit SHA, which the owner exempted so git previews stay approvable.\nconst HEX_RUN = /\\b(?:[0-9a-fA-F]{32,39}|[0-9a-fA-F]{41,})\\b/g;\nconst B64_RUN = /(?<![A-Za-z0-9+/_-])[A-Za-z0-9+/_-]{32,}={0,2}(?![A-Za-z0-9+/_=-])/g;\n\nconst PLAIN_WORD = /^(?:[a-z]{3,}|[A-Z]{3,})$/;\n\n/** A base64-like run is a secret only if it mixes digits and both cases and no path segment is a plain word. */\nexport function looksSecret(run: string): boolean {\n  if (!/\\d/.test(run) || !/[A-Z]/.test(run) || !/[a-z]/.test(run)) return false;\n  return !run.split(\"/\").some((segment) => PLAIN_WORD.test(segment));\n}\n\n/** Section 10 decision 3: masks auth headers, key=value secrets and long hex or base64 runs. */\nexport function redactPreview(text: string): { text: string; redacted: boolean } {\n  let hits = 0;\n  const hit = (replacement: string) => {\n    hits += 1;\n    return replacement;\n  };\n  const out = text\n    .replace(AUTH_HEADER, (_match, scheme: string) => hit(`${scheme} ${PLACEHOLDER}`))\n    .replace(KEY_VALUE, (_match, name: string, separator: string) => hit(`${name}${separator}${PLACEHOLDER}`))\n    .replace(HEX_RUN, () => hit(PLACEHOLDER))\n    .replace(B64_RUN, (run) => (looksSecret(run) ? hit(PLACEHOLDER) : run));\n  return { text: out, redacted: hits > 0 };\n}\n","import { MAX_CONTENT_BYTES, contentBytes, encodeItem, type ItemInput } from \"@titan-design/matrix-bus\";\nimport { redactPreview } from \"./redact.js\";\nimport type { QueueItem } from \"./types.js\";\n\nconst MAX_FIT_ROUNDS = 16;\n\nfunction fits(input: ItemInput): boolean {\n  return contentBytes(encodeItem(input)) <= MAX_CONTENT_BYTES;\n}\n\n// Slices on code points, so an astral character is never split into a lone surrogate.\nfunction shrink(value: string | undefined, round: number): string | undefined {\n  if (value === undefined) return undefined;\n  const points = Array.from(value);\n  return `${points.slice(0, Math.floor(points.length / 2 ** round)).join(\"\")}…`;\n}\n\n/** Halves `inputPreview` and `text` until the encoded content fits, marking the item truncated. */\nexport function fitItem(input: ItemInput): ItemInput {\n  if (fits(input)) return input;\n  for (let round = 1; round <= MAX_FIT_ROUNDS; round += 1) {\n    const cut = { ...input, input_preview: shrink(input.input_preview, round), text: shrink(input.text, round), truncated: true };\n    if (fits(cut)) return cut;\n  }\n  return { ...input, input_preview: undefined, text: undefined, truncated: true };\n}\n\nfunction redactFields(item: QueueItem): { inputPreview?: string; text?: string; redacted: boolean } {\n  if (item.kind === \"approval_request\" && item.inputPreview !== undefined) {\n    const { text, redacted } = redactPreview(item.inputPreview);\n    return { inputPreview: text, text: item.text, redacted };\n  }\n  if (item.kind === \"endorse_request\" && item.text !== undefined) {\n    const { text, redacted } = redactPreview(item.text);\n    return { inputPreview: item.inputPreview, text, redacted };\n  }\n  return { inputPreview: item.inputPreview, text: item.text, redacted: false };\n}\n\n/** Redacts before fitting, so a cut never strands the tail of a secret the patterns no longer see whole. */\nexport function toItemInput(item: QueueItem): ItemInput {\n  const { inputPreview, text, redacted } = redactFields(item);\n  return fitItem({\n    kind: item.kind,\n    machine: item.machine,\n    session: item.session,\n    agent_id: item.agentId,\n    msg_id: item.id,\n    at: item.at,\n    tool_name: item.toolName,\n    input_preview: inputPreview,\n    recipient: item.recipient,\n    text,\n    truncated: false,\n    redacted,\n  });\n}\n\n/** A /sync filter that returns only the queue room's timeline, with no presence, receipts or account data. */\nexport function syncFilter(roomId: string): Record<string, unknown> {\n  const none = { types: [] as string[] };\n  return {\n    presence: none,\n    account_data: none,\n    room: { rooms: [roomId], timeline: { limit: 50 }, state: none, ephemeral: none, account_data: none },\n  };\n}\n","import { ITEM_KINDS, type ItemKind } from \"@titan-design/matrix-bus\";\nimport type { CloseOutcome, QueueItem, QueueSource, ResolveResult, SourceEvent, VerdictInput } from \"./types.js\";\n\n/** An in-memory QueueSource for tests; cursors are the 1-based position in its event log. */\nexport class MemoryQueueSource implements QueueSource {\n  readonly resolutions: Array<{ id: string } & VerdictInput> = [];\n  private readonly pending = new Map<string, QueueItem>();\n  private readonly log: SourceEvent[] = [];\n  private readonly waiters = new Set<() => void>();\n\n  constructor(readonly kinds: readonly ItemKind[] = ITEM_KINDS) {}\n\n  add(item: QueueItem): void {\n    this.pending.set(item.id, item);\n    this.append({ type: \"opened\", item, cursor: this.nextCursor() });\n  }\n\n  close(id: string, outcome: CloseOutcome, label?: string): void {\n    if (!this.pending.delete(id)) return;\n    this.append({ type: \"closed\", id, outcome, label, cursor: this.nextCursor() });\n  }\n\n  async open(): Promise<QueueItem[]> {\n    return [...this.pending.values()];\n  }\n\n  async resolve(id: string, verdict: VerdictInput): Promise<ResolveResult> {\n    if (!this.pending.has(id)) return { ok: false, reason: \"closed\" };\n    this.resolutions.push({ id, ...verdict });\n    this.close(id, \"resolved\", verdict.verdict);\n    return { ok: true };\n  }\n\n  /** \"Now\" is fixed when tail is called, not at the first next(), so nothing added in between is missed. */\n  tail(cursor: string | undefined, signal: AbortSignal): AsyncIterable<SourceEvent> {\n    return this.stream(cursor === undefined ? this.log.length : Number(cursor), signal);\n  }\n\n  private async *stream(start: number, signal: AbortSignal): AsyncGenerator<SourceEvent> {\n    let next = start;\n    while (!signal.aborted) {\n      while (next < this.log.length) yield this.log[next++] as SourceEvent;\n      await this.nextAppend(signal);\n    }\n  }\n\n  private nextCursor(): string {\n    return String(this.log.length + 1);\n  }\n\n  private append(event: SourceEvent): void {\n    this.log.push(event);\n    for (const wake of [...this.waiters]) wake();\n  }\n\n  private nextAppend(signal: AbortSignal): Promise<void> {\n    return new Promise((resolve) => {\n      if (signal.aborted) return resolve();\n      const done = () => {\n        this.waiters.delete(done);\n        signal.removeEventListener(\"abort\", done);\n        resolve();\n      };\n      this.waiters.add(done);\n      signal.addEventListener(\"abort\", done);\n    });\n  }\n}\n","import type { MirrorState, PostedItem, StateChange } from \"./types.js\";\n\nexport interface MirrorSnapshot {\n  sourceCursor?: string;\n  syncToken?: string;\n  posted: PostedItem[];\n  applied: string[];\n}\n\n/** An in-memory MirrorState; `snapshot` and `restore` stand in for a restart in replay tests. */\nexport class MemoryMirrorState implements MirrorState {\n  private cursor: string | undefined;\n  private token: string | undefined;\n  private readonly items = new Map<string, PostedItem>();\n  private readonly eventIndex = new Map<string, string>();\n  private readonly applied = new Set<string>();\n\n  static restore(snapshot: MirrorSnapshot): MemoryMirrorState {\n    const state = new MemoryMirrorState();\n    state.commit({ ...snapshot, posted: snapshot.posted.map((item) => ({ ...item })) });\n    return state;\n  }\n\n  sourceCursor(): string | undefined {\n    return this.cursor;\n  }\n\n  syncToken(): string | undefined {\n    return this.token;\n  }\n\n  bySourceId(id: string): PostedItem | undefined {\n    return this.items.get(id);\n  }\n\n  byEventId(eventId: string): PostedItem | undefined {\n    const sourceId = this.eventIndex.get(eventId);\n    return sourceId === undefined ? undefined : this.items.get(sourceId);\n  }\n\n  openItems(): PostedItem[] {\n    return [...this.items.values()].filter((item) => item.status === \"open\");\n  }\n\n  hasApplied(resolutionEventId: string): boolean {\n    return this.applied.has(resolutionEventId);\n  }\n\n  /** Applies posted before closed, so one change may post and close the same item. */\n  commit(change: StateChange): void {\n    for (const item of change.posted ?? []) {\n      this.items.set(item.sourceId, { ...item });\n      this.eventIndex.set(item.eventId, item.sourceId);\n    }\n    for (const id of change.closed ?? []) {\n      const item = this.items.get(id);\n      if (item) item.status = \"closed\";\n    }\n    for (const id of change.applied ?? []) this.applied.add(id);\n    if (change.sourceCursor !== undefined) this.cursor = change.sourceCursor;\n    if (change.syncToken !== undefined) this.token = change.syncToken;\n  }\n\n  snapshot(): MirrorSnapshot {\n    return {\n      sourceCursor: this.cursor,\n      syncToken: this.token,\n      posted: [...this.items.values()].map((item) => ({ ...item })),\n      applied: [...this.applied],\n    };\n  }\n}\n"],"mappings":";AAAA,IAAM,cAAc;AAEpB,IAAM,cAAc;AAEpB,IAAM,YAAY;AAElB,IAAM,UAAU;AAChB,IAAM,UAAU;AAEhB,IAAM,aAAa;AAGZ,SAAS,YAAY,KAAsB;AAChD,MAAI,CAAC,KAAK,KAAK,GAAG,KAAK,CAAC,QAAQ,KAAK,GAAG,KAAK,CAAC,QAAQ,KAAK,GAAG,EAAG,QAAO;AACxE,SAAO,CAAC,IAAI,MAAM,GAAG,EAAE,KAAK,CAAC,YAAY,WAAW,KAAK,OAAO,CAAC;AACnE;AAGO,SAAS,cAAc,MAAmD;AAC/E,MAAI,OAAO;AACX,QAAM,MAAM,CAAC,gBAAwB;AACnC,YAAQ;AACR,WAAO;AAAA,EACT;AACA,QAAM,MAAM,KACT,QAAQ,aAAa,CAAC,QAAQ,WAAmB,IAAI,GAAG,MAAM,IAAI,WAAW,EAAE,CAAC,EAChF,QAAQ,WAAW,CAAC,QAAQ,MAAc,cAAsB,IAAI,GAAG,IAAI,GAAG,SAAS,GAAG,WAAW,EAAE,CAAC,EACxG,QAAQ,SAAS,MAAM,IAAI,WAAW,CAAC,EACvC,QAAQ,SAAS,CAAC,QAAS,YAAY,GAAG,IAAI,IAAI,WAAW,IAAI,GAAI;AACxE,SAAO,EAAE,MAAM,KAAK,UAAU,OAAO,EAAE;AACzC;;;AC9BA,SAAS,mBAAmB,cAAc,kBAAkC;AAI5E,IAAM,iBAAiB;AAEvB,SAAS,KAAK,OAA2B;AACvC,SAAO,aAAa,WAAW,KAAK,CAAC,KAAK;AAC5C;AAGA,SAAS,OAAO,OAA2B,OAAmC;AAC5E,MAAI,UAAU,OAAW,QAAO;AAChC,QAAM,SAAS,MAAM,KAAK,KAAK;AAC/B,SAAO,GAAG,OAAO,MAAM,GAAG,KAAK,MAAM,OAAO,SAAS,KAAK,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC;AAC5E;AAGO,SAAS,QAAQ,OAA6B;AACnD,MAAI,KAAK,KAAK,EAAG,QAAO;AACxB,WAAS,QAAQ,GAAG,SAAS,gBAAgB,SAAS,GAAG;AACvD,UAAM,MAAM,EAAE,GAAG,OAAO,eAAe,OAAO,MAAM,eAAe,KAAK,GAAG,MAAM,OAAO,MAAM,MAAM,KAAK,GAAG,WAAW,KAAK;AAC5H,QAAI,KAAK,GAAG,EAAG,QAAO;AAAA,EACxB;AACA,SAAO,EAAE,GAAG,OAAO,eAAe,QAAW,MAAM,QAAW,WAAW,KAAK;AAChF;AAEA,SAAS,aAAa,MAA8E;AAClG,MAAI,KAAK,SAAS,sBAAsB,KAAK,iBAAiB,QAAW;AACvE,UAAM,EAAE,MAAM,SAAS,IAAI,cAAc,KAAK,YAAY;AAC1D,WAAO,EAAE,cAAc,MAAM,MAAM,KAAK,MAAM,SAAS;AAAA,EACzD;AACA,MAAI,KAAK,SAAS,qBAAqB,KAAK,SAAS,QAAW;AAC9D,UAAM,EAAE,MAAM,SAAS,IAAI,cAAc,KAAK,IAAI;AAClD,WAAO,EAAE,cAAc,KAAK,cAAc,MAAM,SAAS;AAAA,EAC3D;AACA,SAAO,EAAE,cAAc,KAAK,cAAc,MAAM,KAAK,MAAM,UAAU,MAAM;AAC7E;AAGO,SAAS,YAAY,MAA4B;AACtD,QAAM,EAAE,cAAc,MAAM,SAAS,IAAI,aAAa,IAAI;AAC1D,SAAO,QAAQ;AAAA,IACb,MAAM,KAAK;AAAA,IACX,SAAS,KAAK;AAAA,IACd,SAAS,KAAK;AAAA,IACd,UAAU,KAAK;AAAA,IACf,QAAQ,KAAK;AAAA,IACb,IAAI,KAAK;AAAA,IACT,WAAW,KAAK;AAAA,IAChB,eAAe;AAAA,IACf,WAAW,KAAK;AAAA,IAChB;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACF,CAAC;AACH;AAGO,SAAS,WAAW,QAAyC;AAClE,QAAM,OAAO,EAAE,OAAO,CAAC,EAAc;AACrC,SAAO;AAAA,IACL,UAAU;AAAA,IACV,cAAc;AAAA,IACd,MAAM,EAAE,OAAO,CAAC,MAAM,GAAG,UAAU,EAAE,OAAO,GAAG,GAAG,OAAO,MAAM,WAAW,MAAM,cAAc,KAAK;AAAA,EACrG;AACF;;;AClEA,SAAS,kBAAiC;AAInC,IAAM,oBAAN,MAA+C;AAAA,EAMpD,YAAqB,QAA6B,YAAY;AAAzC;AAAA,EAA0C;AAAA,EAA1C;AAAA,EALZ,cAAoD,CAAC;AAAA,EAC7C,UAAU,oBAAI,IAAuB;AAAA,EACrC,MAAqB,CAAC;AAAA,EACtB,UAAU,oBAAI,IAAgB;AAAA,EAI/C,IAAI,MAAuB;AACzB,SAAK,QAAQ,IAAI,KAAK,IAAI,IAAI;AAC9B,SAAK,OAAO,EAAE,MAAM,UAAU,MAAM,QAAQ,KAAK,WAAW,EAAE,CAAC;AAAA,EACjE;AAAA,EAEA,MAAM,IAAY,SAAuB,OAAsB;AAC7D,QAAI,CAAC,KAAK,QAAQ,OAAO,EAAE,EAAG;AAC9B,SAAK,OAAO,EAAE,MAAM,UAAU,IAAI,SAAS,OAAO,QAAQ,KAAK,WAAW,EAAE,CAAC;AAAA,EAC/E;AAAA,EAEA,MAAM,OAA6B;AACjC,WAAO,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC;AAAA,EAClC;AAAA,EAEA,MAAM,QAAQ,IAAY,SAA+C;AACvE,QAAI,CAAC,KAAK,QAAQ,IAAI,EAAE,EAAG,QAAO,EAAE,IAAI,OAAO,QAAQ,SAAS;AAChE,SAAK,YAAY,KAAK,EAAE,IAAI,GAAG,QAAQ,CAAC;AACxC,SAAK,MAAM,IAAI,YAAY,QAAQ,OAAO;AAC1C,WAAO,EAAE,IAAI,KAAK;AAAA,EACpB;AAAA;AAAA,EAGA,KAAK,QAA4B,QAAiD;AAChF,WAAO,KAAK,OAAO,WAAW,SAAY,KAAK,IAAI,SAAS,OAAO,MAAM,GAAG,MAAM;AAAA,EACpF;AAAA,EAEA,OAAe,OAAO,OAAe,QAAkD;AACrF,QAAI,OAAO;AACX,WAAO,CAAC,OAAO,SAAS;AACtB,aAAO,OAAO,KAAK,IAAI,OAAQ,OAAM,KAAK,IAAI,MAAM;AACpD,YAAM,KAAK,WAAW,MAAM;AAAA,IAC9B;AAAA,EACF;AAAA,EAEQ,aAAqB;AAC3B,WAAO,OAAO,KAAK,IAAI,SAAS,CAAC;AAAA,EACnC;AAAA,EAEQ,OAAO,OAA0B;AACvC,SAAK,IAAI,KAAK,KAAK;AACnB,eAAW,QAAQ,CAAC,GAAG,KAAK,OAAO,EAAG,MAAK;AAAA,EAC7C;AAAA,EAEQ,WAAW,QAAoC;AACrD,WAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,UAAI,OAAO,QAAS,QAAO,QAAQ;AACnC,YAAM,OAAO,MAAM;AACjB,aAAK,QAAQ,OAAO,IAAI;AACxB,eAAO,oBAAoB,SAAS,IAAI;AACxC,gBAAQ;AAAA,MACV;AACA,WAAK,QAAQ,IAAI,IAAI;AACrB,aAAO,iBAAiB,SAAS,IAAI;AAAA,IACvC,CAAC;AAAA,EACH;AACF;;;ACzDO,IAAM,oBAAN,MAAM,mBAAyC;AAAA,EAC5C;AAAA,EACA;AAAA,EACS,QAAQ,oBAAI,IAAwB;AAAA,EACpC,aAAa,oBAAI,IAAoB;AAAA,EACrC,UAAU,oBAAI,IAAY;AAAA,EAE3C,OAAO,QAAQ,UAA6C;AAC1D,UAAM,QAAQ,IAAI,mBAAkB;AACpC,UAAM,OAAO,EAAE,GAAG,UAAU,QAAQ,SAAS,OAAO,IAAI,CAAC,UAAU,EAAE,GAAG,KAAK,EAAE,EAAE,CAAC;AAClF,WAAO;AAAA,EACT;AAAA,EAEA,eAAmC;AACjC,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,YAAgC;AAC9B,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,WAAW,IAAoC;AAC7C,WAAO,KAAK,MAAM,IAAI,EAAE;AAAA,EAC1B;AAAA,EAEA,UAAU,SAAyC;AACjD,UAAM,WAAW,KAAK,WAAW,IAAI,OAAO;AAC5C,WAAO,aAAa,SAAY,SAAY,KAAK,MAAM,IAAI,QAAQ;AAAA,EACrE;AAAA,EAEA,YAA0B;AACxB,WAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE,OAAO,CAAC,SAAS,KAAK,WAAW,MAAM;AAAA,EACzE;AAAA,EAEA,WAAW,mBAAoC;AAC7C,WAAO,KAAK,QAAQ,IAAI,iBAAiB;AAAA,EAC3C;AAAA;AAAA,EAGA,OAAO,QAA2B;AAChC,eAAW,QAAQ,OAAO,UAAU,CAAC,GAAG;AACtC,WAAK,MAAM,IAAI,KAAK,UAAU,EAAE,GAAG,KAAK,CAAC;AACzC,WAAK,WAAW,IAAI,KAAK,SAAS,KAAK,QAAQ;AAAA,IACjD;AACA,eAAW,MAAM,OAAO,UAAU,CAAC,GAAG;AACpC,YAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,UAAI,KAAM,MAAK,SAAS;AAAA,IAC1B;AACA,eAAW,MAAM,OAAO,WAAW,CAAC,EAAG,MAAK,QAAQ,IAAI,EAAE;AAC1D,QAAI,OAAO,iBAAiB,OAAW,MAAK,SAAS,OAAO;AAC5D,QAAI,OAAO,cAAc,OAAW,MAAK,QAAQ,OAAO;AAAA,EAC1D;AAAA,EAEA,WAA2B;AACzB,WAAO;AAAA,MACL,cAAc,KAAK;AAAA,MACnB,WAAW,KAAK;AAAA,MAChB,QAAQ,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,UAAU,EAAE,GAAG,KAAK,EAAE;AAAA,MAC5D,SAAS,CAAC,GAAG,KAAK,OAAO;AAAA,IAC3B;AAAA,EACF;AACF;","names":[]}

package/package.json

@@ -0,0 +1,41 @@
+{
+  "name": "@titan-design/queue-mirror",
+  "version": "0.0.0",
+  "description": "Projects a local queue of human-actionable items into a Matrix room and folds the owner's verdicts back",
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md"
+  ],
+  "author": "Henry Jewkes",
+  "license": "MIT",
+  "homepage": "https://github.com/HJewkes/titan-platform#readme",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/HJewkes/titan-platform.git",
+    "directory": "packages/queue-mirror"
+  },
+  "bugs": "https://github.com/HJewkes/titan-platform/issues",
+  "engines": {
+    "node": ">=20"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "dependencies": {
+    "@titan-design/matrix-bus": "^0.0.0"
+  },
+  "scripts": {
+    "build": "tsup",
+    "typecheck": "tsc --noEmit",
+    "lint": "eslint src"
+  }
+}