@unbrained/pm-cli 2026.5.30 → 2026.6.5

package/dist/cli-bundle/chunks/chunk-RQAWLSUU.js

@@ -0,0 +1,140 @@
+import {
+  levenshteinDistanceWithinLimit
+} from "./chunk-EAOG77HM.js";
+import {
+  coerceRuntimeFieldValue,
+  normalizeStatusInput,
+  readRuntimeFieldOptionValue
+} from "./chunk-HPH6X4ZZ.js";
+import {
+  EXIT_CODE,
+  PmCliError,
+  stableValueEquals
+} from "./chunk-SRVKTWPR.js";
+
+// dist/core/item/status-filter.js
+!(function() {
+  try {
+    var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "8640de3f-a20a-5ea8-b1ff-05798e76f862");
+  } catch (e2) {
+  }
+})();
+var STATUS_GROUP_ALIASES = {
+  open: "open_status",
+  closed: "close_status",
+  canceled: "canceled_status",
+  cancelled: "canceled_status"
+};
+function resolveStatusFilterToken(token, registry) {
+  const trimmed = token.trim().toLowerCase();
+  if (trimmed.length === 0) {
+    return void 0;
+  }
+  const group = STATUS_GROUP_ALIASES[trimmed];
+  if (group) {
+    return registry[group];
+  }
+  return normalizeStatusInput(token, registry);
+}
+function collectStatusSuggestionCandidates(registry) {
+  const candidates = new Set(Object.keys(STATUS_GROUP_ALIASES));
+  for (const definition of registry.definitions) {
+    candidates.add(definition.id);
+    for (const alias of definition.aliases) {
+      candidates.add(alias);
+    }
+  }
+  return [...candidates];
+}
+function suggestClosestStatus(value, registry) {
+  const normalized = value.trim().toLowerCase();
+  let best;
+  let bestDistance = Number.POSITIVE_INFINITY;
+  for (const candidate of collectStatusSuggestionCandidates(registry)) {
+    const distance = levenshteinDistanceWithinLimit(normalized, candidate.toLowerCase(), 2);
+    if (distance !== null && distance < bestDistance) {
+      best = candidate;
+      bestDistance = distance;
+    }
+  }
+  return best;
+}
+function parseStatusFilterCsv(raw, registry, options) {
+  if (typeof raw !== "string") {
+    return void 0;
+  }
+  const strict = options?.strict === true;
+  const flagLabel = options?.flagLabel ?? "--status";
+  const tokens = raw.split(",").map((entry) => entry.trim()).filter((entry) => entry.length > 0);
+  if (tokens.length === 0) {
+    return void 0;
+  }
+  const resolved = [];
+  for (const token of tokens) {
+    const status = resolveStatusFilterToken(token, registry);
+    if (status === void 0) {
+      if (strict) {
+        const suggestion = suggestClosestStatus(token, registry);
+        throw new PmCliError(`Invalid ${flagLabel} value "${token}". Use open|closed|canceled or a configured status id${suggestion ? `. Did you mean "${suggestion}"?` : "."}`, EXIT_CODE.USAGE);
+      }
+      resolved.push(token);
+      continue;
+    }
+    resolved.push(status);
+  }
+  return [...new Set(resolved)];
+}
+
+// dist/core/schema/runtime-field-filters.js
+!(function() {
+  try {
+    var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "1a6bd7a4-f91a-562a-9358-8e2f1ac36b32");
+  } catch (e2) {
+  }
+})();
+function valuesEqual(left, right) {
+  return stableValueEquals(left, right);
+}
+function collectRuntimeFilterValues(options, fieldRegistry, command) {
+  const filters = {};
+  for (const definition of fieldRegistry.command_to_fields.get(command) ?? []) {
+    const rawValue = readRuntimeFieldOptionValue(options, definition);
+    if (rawValue === void 0) {
+      continue;
+    }
+    filters[definition.metadata_key] = coerceRuntimeFieldValue(definition, rawValue);
+  }
+  return filters;
+}
+function matchesRuntimeFilters(item, filters) {
+  for (const [fieldKey, expectedValue] of Object.entries(filters)) {
+    const actualValue = item[fieldKey];
+    if (Array.isArray(expectedValue)) {
+      if (Array.isArray(actualValue)) {
+        const normalizedActual = actualValue.map((value) => String(value));
+        const normalizedExpected = expectedValue.map((value) => String(value));
+        if (!normalizedExpected.every((value) => normalizedActual.includes(value))) {
+          return false;
+        }
+        continue;
+      }
+      if (!valuesEqual(actualValue, expectedValue[expectedValue.length - 1])) {
+        return false;
+      }
+      continue;
+    }
+    if (!valuesEqual(actualValue, expectedValue)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+export {
+  parseStatusFilterCsv,
+  collectRuntimeFilterValues,
+  matchesRuntimeFilters
+};
+//# sourceMappingURL=chunk-RQAWLSUU.js.map

package/dist/cli-bundle/chunks/chunk-RQAWLSUU.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../core/item/status-filter.ts", "../../../../../../../../core/schema/runtime-field-filters.ts"],
+  "sourcesContent": ["import { EXIT_CODE } from \"../shared/constants.js\";\nimport { PmCliError } from \"../shared/errors.js\";\nimport { levenshteinDistanceWithinLimit } from \"../shared/levenshtein.js\";\nimport type { RuntimeStatusRegistry } from \"../schema/runtime-schema.js\";\nimport type { ItemStatus } from \"../../types/index.js\";\nimport { normalizeStatusInput } from \"./status.js\";\n\n// Workflow-group aliases shared by every status-filter consumer so that the\n// agent-friendly `open`/`closed`/`canceled` shorthands resolve to whatever the\n// runtime workflow has configured as its open/close/cancel anchors, rather than\n// hardcoding the built-in status ids. `cancelled` is accepted as a spelling\n// variant of `canceled`.\nconst STATUS_GROUP_ALIASES: Readonly<Record<string, \"open_status\" | \"close_status\" | \"canceled_status\">> = {\n  open: \"open_status\",\n  closed: \"close_status\",\n  canceled: \"canceled_status\",\n  cancelled: \"canceled_status\",\n};\n\n/**\n * Resolve a single status-filter token to a concrete runtime status id.\n *\n * Returns `undefined` when the token is not a recognized workflow-group alias\n * (open/closed/canceled) and does not normalize to a known registry status.\n * Callers decide whether an unrecognized token is an error (strict mode) or is\n * passed through verbatim (lenient mode) — see {@link parseStatusFilterCsv}.\n */\nexport function resolveStatusFilterToken(\n  token: string,\n  registry: RuntimeStatusRegistry,\n): ItemStatus | undefined {\n  const trimmed = token.trim().toLowerCase();\n  if (trimmed.length === 0) {\n    return undefined;\n  }\n  const group = STATUS_GROUP_ALIASES[trimmed];\n  if (group) {\n    return registry[group] as ItemStatus;\n  }\n  return normalizeStatusInput(token, registry);\n}\n\nfunction collectStatusSuggestionCandidates(registry: RuntimeStatusRegistry): string[] {\n  const candidates = new Set<string>(Object.keys(STATUS_GROUP_ALIASES));\n  for (const definition of registry.definitions) {\n    candidates.add(definition.id);\n    for (const alias of definition.aliases) {\n      candidates.add(alias);\n    }\n  }\n  return [...candidates];\n}\n\nfunction suggestClosestStatus(value: string, registry: RuntimeStatusRegistry): string | undefined {\n  // Only ever called for an unresolved, already-non-empty token (parseStatusFilterCsv\n  // filters blanks first), so no empty-input guard is needed here.\n  const normalized = value.trim().toLowerCase();\n  let best: string | undefined;\n  let bestDistance = Number.POSITIVE_INFINITY;\n  for (const candidate of collectStatusSuggestionCandidates(registry)) {\n    const distance = levenshteinDistanceWithinLimit(normalized, candidate.toLowerCase(), 2);\n    if (distance !== null && distance < bestDistance) {\n      best = candidate;\n      bestDistance = distance;\n    }\n  }\n  return best;\n}\n\nexport interface ParseStatusFilterOptions {\n  /**\n   * When true, an unrecognized token throws a USAGE error with a did-you-mean\n   * hint. When false (default), an unrecognized token is passed through\n   * verbatim so custom/unknown statuses still compare against item values by\n   * their raw string — preserving the long-standing lenient `pm list` behavior.\n   */\n  strict?: boolean;\n  /** Flag label used in error messages (default: \"--status\"). */\n  flagLabel?: string;\n}\n\n/**\n * Parse a comma-separated status filter into a de-duplicated list of concrete\n * status ids. Shared by `pm list` (lenient) and `pm search` (strict, with a\n * did-you-mean hint on typos) so both surfaces resolve the open/closed/canceled\n * workflow-group aliases identically.\n */\nexport function parseStatusFilterCsv(\n  raw: unknown,\n  registry: RuntimeStatusRegistry,\n  options?: ParseStatusFilterOptions,\n): ItemStatus[] | undefined {\n  if (typeof raw !== \"string\") {\n    return undefined;\n  }\n  const strict = options?.strict === true;\n  const flagLabel = options?.flagLabel ?? \"--status\";\n  const tokens = raw\n    .split(\",\")\n    .map((entry) => entry.trim())\n    .filter((entry) => entry.length > 0);\n  if (tokens.length === 0) {\n    return undefined;\n  }\n  const resolved: ItemStatus[] = [];\n  for (const token of tokens) {\n    const status = resolveStatusFilterToken(token, registry);\n    if (status === undefined) {\n      if (strict) {\n        const suggestion = suggestClosestStatus(token, registry);\n        throw new PmCliError(\n          `Invalid ${flagLabel} value \"${token}\". Use open|closed|canceled or a configured status id${\n            suggestion ? `. Did you mean \"${suggestion}\"?` : \".\"\n          }`,\n          EXIT_CODE.USAGE,\n        );\n      }\n      resolved.push(token as ItemStatus);\n      continue;\n    }\n    resolved.push(status);\n  }\n  return [...new Set(resolved)];\n}\n", "import { coerceRuntimeFieldValue, readRuntimeFieldOptionValue } from \"./runtime-field-values.js\";\nimport type { RuntimeFieldCommand, RuntimeFieldRegistry } from \"./runtime-schema.js\";\nimport { stableValueEquals } from \"../shared/serialization.js\";\n\nfunction valuesEqual(left: unknown, right: unknown): boolean {\n  return stableValueEquals(left, right);\n}\n\nexport function collectRuntimeFilterValues(\n  options: Record<string, unknown>,\n  fieldRegistry: RuntimeFieldRegistry,\n  command: RuntimeFieldCommand,\n): Record<string, unknown> {\n  const filters: Record<string, unknown> = {};\n  for (const definition of fieldRegistry.command_to_fields.get(command) ?? []) {\n    const rawValue = readRuntimeFieldOptionValue(options, definition);\n    if (rawValue === undefined) {\n      continue;\n    }\n    filters[definition.metadata_key] = coerceRuntimeFieldValue(definition, rawValue);\n  }\n  return filters;\n}\n\nexport function matchesRuntimeFilters(item: Record<string, unknown>, filters: Record<string, unknown>): boolean {\n  for (const [fieldKey, expectedValue] of Object.entries(filters)) {\n    const actualValue = item[fieldKey];\n    if (Array.isArray(expectedValue)) {\n      if (Array.isArray(actualValue)) {\n        const normalizedActual = actualValue.map((value) => String(value));\n        const normalizedExpected = expectedValue.map((value) => String(value));\n        if (!normalizedExpected.every((value) => normalizedActual.includes(value))) {\n          return false;\n        }\n        continue;\n      }\n      if (!valuesEqual(actualValue, expectedValue[expectedValue.length - 1])) {\n        return false;\n      }\n      continue;\n    }\n    if (!valuesEqual(actualValue, expectedValue)) {\n      return false;\n    }\n  }\n  return true;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;AAYA,IAAM,uBAAqG;EACzG,MAAM;EACN,QAAQ;EACR,UAAU;EACV,WAAW;;AAWP,SAAU,yBACd,OACA,UAA+B;AAE/B,QAAM,UAAU,MAAM,KAAI,EAAG,YAAW;AACxC,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;EACT;AACA,QAAM,QAAQ,qBAAqB,OAAO;AAC1C,MAAI,OAAO;AACT,WAAO,SAAS,KAAK;EACvB;AACA,SAAO,qBAAqB,OAAO,QAAQ;AAC7C;AAEA,SAAS,kCAAkC,UAA+B;AACxE,QAAM,aAAa,IAAI,IAAY,OAAO,KAAK,oBAAoB,CAAC;AACpE,aAAW,cAAc,SAAS,aAAa;AAC7C,eAAW,IAAI,WAAW,EAAE;AAC5B,eAAW,SAAS,WAAW,SAAS;AACtC,iBAAW,IAAI,KAAK;IACtB;EACF;AACA,SAAO,CAAC,GAAG,UAAU;AACvB;AAEA,SAAS,qBAAqB,OAAe,UAA+B;AAG1E,QAAM,aAAa,MAAM,KAAI,EAAG,YAAW;AAC3C,MAAI;AACJ,MAAI,eAAe,OAAO;AAC1B,aAAW,aAAa,kCAAkC,QAAQ,GAAG;AACnE,UAAM,WAAW,+BAA+B,YAAY,UAAU,YAAW,GAAI,CAAC;AACtF,QAAI,aAAa,QAAQ,WAAW,cAAc;AAChD,aAAO;AACP,qBAAe;IACjB;EACF;AACA,SAAO;AACT;AAoBM,SAAU,qBACd,KACA,UACA,SAAkC;AAElC,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;EACT;AACA,QAAM,SAAS,SAAS,WAAW;AACnC,QAAM,YAAY,SAAS,aAAa;AACxC,QAAM,SAAS,IACZ,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;EACT;AACA,QAAM,WAAyB,CAAA;AAC/B,aAAW,SAAS,QAAQ;AAC1B,UAAM,SAAS,yBAAyB,OAAO,QAAQ;AACvD,QAAI,WAAW,QAAW;AACxB,UAAI,QAAQ;AACV,cAAM,aAAa,qBAAqB,OAAO,QAAQ;AACvD,cAAM,IAAI,WACR,WAAW,SAAS,WAAW,KAAK,wDAClC,aAAa,mBAAmB,UAAU,OAAO,GACnD,IACA,UAAU,KAAK;MAEnB;AACA,eAAS,KAAK,KAAmB;AACjC;IACF;AACA,aAAS,KAAK,MAAM;EACtB;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,QAAQ,CAAC;AAC9B;;;;;;;;;;ACvHA,SAAS,YAAY,MAAe,OAAc;AAChD,SAAO,kBAAkB,MAAM,KAAK;AACtC;AAEM,SAAU,2BACd,SACA,eACA,SAA4B;AAE5B,QAAM,UAAmC,CAAA;AACzC,aAAW,cAAc,cAAc,kBAAkB,IAAI,OAAO,KAAK,CAAA,GAAI;AAC3E,UAAM,WAAW,4BAA4B,SAAS,UAAU;AAChE,QAAI,aAAa,QAAW;AAC1B;IACF;AACA,YAAQ,WAAW,YAAY,IAAI,wBAAwB,YAAY,QAAQ;EACjF;AACA,SAAO;AACT;AAEM,SAAU,sBAAsB,MAA+B,SAAgC;AACnG,aAAW,CAAC,UAAU,aAAa,KAAK,OAAO,QAAQ,OAAO,GAAG;AAC/D,UAAM,cAAc,KAAK,QAAQ;AACjC,QAAI,MAAM,QAAQ,aAAa,GAAG;AAChC,UAAI,MAAM,QAAQ,WAAW,GAAG;AAC9B,cAAM,mBAAmB,YAAY,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AACjE,cAAM,qBAAqB,cAAc,IAAI,CAAC,UAAU,OAAO,KAAK,CAAC;AACrE,YAAI,CAAC,mBAAmB,MAAM,CAAC,UAAU,iBAAiB,SAAS,KAAK,CAAC,GAAG;AAC1E,iBAAO;QACT;AACA;MACF;AACA,UAAI,CAAC,YAAY,aAAa,cAAc,cAAc,SAAS,CAAC,CAAC,GAAG;AACtE,eAAO;MACT;AACA;IACF;AACA,QAAI,CAAC,YAAY,aAAa,aAAa,GAAG;AAC5C,aAAO;IACT;EACF;AACA,SAAO;AACT;",
+  "names": []
+}

package/dist/cli-bundle/chunks/chunk-S3CV7JGJ.js

@@ -0,0 +1,233 @@
+import {
+  hashDocument,
+  toItemRecord
+} from "./chunk-XG7RJYHV.js";
+import {
+  canonicalDocument
+} from "./chunk-HPH6X4ZZ.js";
+import {
+  FRONT_MATTER_KEY_ORDER,
+  orderObject,
+  sha256Hex,
+  stableStringify
+} from "./chunk-SRVKTWPR.js";
+
+// dist/core/history/replay.js
+import jsonPatch from "fast-json-patch";
+!(function() {
+  try {
+    var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "a11d69ae-cb25-5c08-8722-85d4fe95b973");
+  } catch (e2) {
+  }
+})();
+var EMPTY_REPLAY_DOCUMENT = {
+  metadata: {},
+  body: ""
+};
+function cloneEmptyReplayDocument() {
+  return structuredClone(EMPTY_REPLAY_DOCUMENT);
+}
+function replayHash(document) {
+  try {
+    return hashDocument({
+      metadata: document.metadata,
+      body: document.body
+    });
+  } catch {
+    return sha256Hex(stableStringify({ replay_fallback: true, metadata: document.metadata, body: document.body }));
+  }
+}
+function replayToItemDocument(document) {
+  return {
+    metadata: document.metadata,
+    body: document.body
+  };
+}
+function toReplayDocument(document) {
+  if (!document.metadata || Object.keys(document.metadata).length === 0) {
+    return {
+      metadata: {},
+      body: document.body ?? ""
+    };
+  }
+  const canonical = canonicalDocument(document);
+  return {
+    metadata: orderObject(toItemRecord(canonical.metadata), FRONT_MATTER_KEY_ORDER),
+    body: canonical.body
+  };
+}
+function normalizeReplayPatchPath(path) {
+  if (path === "/front_matter") {
+    return "/metadata";
+  }
+  if (path.startsWith("/front_matter/")) {
+    return `/metadata/${path.slice("/front_matter/".length)}`;
+  }
+  return path;
+}
+function normalizeReplayPatchOps(patch) {
+  return patch.map((operation) => ({
+    ...operation,
+    path: normalizeReplayPatchPath(operation.path),
+    from: operation.from ? normalizeReplayPatchPath(operation.from) : void 0
+  }));
+}
+function isReplayDocumentShape(value) {
+  return typeof value === "object" && value !== null && "metadata" in value && "body" in value && typeof value.body === "string" && typeof value.metadata === "object" && value.metadata !== null;
+}
+function tryApplyReplayPatch(current, patch) {
+  try {
+    const normalizedPatch = normalizeReplayPatchOps(patch);
+    const applied = jsonPatch.applyPatch(structuredClone(current), normalizedPatch, true, false).newDocument;
+    if (!isReplayDocumentShape(applied)) {
+      return { ok: false, error: new Error("history_replay_invalid_document_shape") };
+    }
+    return { ok: true, document: { metadata: applied.metadata, body: applied.body } };
+  } catch (error) {
+    return { ok: false, error };
+  }
+}
+function verifyHistoryChain(entries) {
+  let replay = cloneEmptyReplayDocument();
+  for (let index = 0; index < entries.length; index += 1) {
+    const entry = entries[index];
+    if (replayHash(replay) !== entry.before_hash) {
+      return {
+        ok: false,
+        errors: [`verify_failed:before_hash_mismatch:entry_${index + 1}`]
+      };
+    }
+    const applied = tryApplyReplayPatch(replay, entry.patch);
+    if (!applied.ok) {
+      return {
+        ok: false,
+        errors: [`verify_failed:patch_apply_failed:entry_${index + 1}`]
+      };
+    }
+    replay = applied.document;
+    if (replayHash(replay) !== entry.after_hash) {
+      return {
+        ok: false,
+        errors: [`verify_failed:after_hash_mismatch:entry_${index + 1}`]
+      };
+    }
+  }
+  return { ok: true, errors: [] };
+}
+function tryApplySingleOp(document, op) {
+  try {
+    const applied = jsonPatch.applyPatch(structuredClone(document), [op], true, false).newDocument;
+    return { ok: true, document: applied };
+  } catch {
+    return { ok: false };
+  }
+}
+function lenientApplyReplayPatch(current, patch) {
+  let working = structuredClone(current);
+  let convertedReplaceToAdd = 0;
+  let skippedOps = 0;
+  for (const op of normalizeReplayPatchOps(patch)) {
+    const direct = tryApplySingleOp(working, op);
+    if (direct.ok) {
+      working = direct.document;
+      continue;
+    }
+    if (op.op === "replace") {
+      const asAdd = tryApplySingleOp(working, { ...op, op: "add" });
+      if (asAdd.ok) {
+        working = asAdd.document;
+        convertedReplaceToAdd += 1;
+        continue;
+      }
+    }
+    skippedOps += 1;
+  }
+  const candidate = working;
+  const document = {
+    metadata: typeof candidate.metadata === "object" && candidate.metadata !== null ? candidate.metadata : {},
+    body: typeof candidate.body === "string" ? candidate.body : current.body
+  };
+  return { document, convertedReplaceToAdd, skippedOps };
+}
+function reanchorHistoryEntries(entries) {
+  let replay = cloneEmptyReplayDocument();
+  const rewritten = [];
+  const details = [];
+  let entriesRehashed = 0;
+  let entriesPatchRepaired = 0;
+  let convertedReplaceToAdd = 0;
+  let skippedOps = 0;
+  for (let index = 0; index < entries.length; index += 1) {
+    const entry = entries[index];
+    const beforeHash = replayHash(replay);
+    const strict = tryApplyReplayPatch(replay, entry.patch);
+    let next;
+    let outPatch;
+    let patchRepaired = false;
+    let entryConverted = 0;
+    let entrySkipped = 0;
+    if (strict.ok) {
+      next = strict.document;
+      outPatch = entry.patch;
+    } else {
+      const lenient = lenientApplyReplayPatch(replay, entry.patch);
+      next = lenient.document;
+      outPatch = jsonPatch.compare(replay, next);
+      patchRepaired = true;
+      entryConverted = lenient.convertedReplaceToAdd;
+      entrySkipped = lenient.skippedOps;
+      convertedReplaceToAdd += entryConverted;
+      skippedOps += entrySkipped;
+      entriesPatchRepaired += 1;
+    }
+    const afterHash = replayHash(next);
+    const rehashed = beforeHash !== entry.before_hash || afterHash !== entry.after_hash;
+    if (rehashed) {
+      entriesRehashed += 1;
+    }
+    rewritten.push({
+      ...entry,
+      patch: outPatch,
+      before_hash: beforeHash,
+      after_hash: afterHash
+    });
+    details.push({
+      index: index + 1,
+      rehashed,
+      patch_repaired: patchRepaired,
+      converted_replace_to_add: entryConverted,
+      skipped_ops: entrySkipped
+    });
+    replay = next;
+  }
+  return {
+    entries: rewritten,
+    finalDocument: replay,
+    entriesRehashed,
+    entriesPatchRepaired,
+    convertedReplaceToAdd,
+    skippedOps,
+    details
+  };
+}
+function historyEntriesToRaw(entries) {
+  if (entries.length === 0) {
+    return "";
+  }
+  return `${entries.map((entry) => JSON.stringify(entry)).join("\n")}
+`;
+}
+
+export {
+  EMPTY_REPLAY_DOCUMENT,
+  replayHash,
+  replayToItemDocument,
+  toReplayDocument,
+  normalizeReplayPatchOps,
+  tryApplyReplayPatch,
+  verifyHistoryChain,
+  reanchorHistoryEntries,
+  historyEntriesToRaw
+};
+//# sourceMappingURL=chunk-S3CV7JGJ.js.map

package/dist/cli-bundle/chunks/chunk-S3CV7JGJ.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../core/history/replay.ts"],
+  "sourcesContent": ["import jsonPatch from \"fast-json-patch\";\nimport { FRONT_MATTER_KEY_ORDER } from \"../shared/constants.js\";\nimport { canonicalDocument } from \"../item/item-format.js\";\nimport { toItemRecord } from \"../item/item-record.js\";\nimport { orderObject, sha256Hex, stableStringify } from \"../shared/serialization.js\";\nimport { hashDocument } from \"./history.js\";\nimport type { HistoryEntry, HistoryPatchOp, ItemDocument, ItemMetadata } from \"../../types/index.js\";\n\n/**\n * Shared history replay/patch mechanics single-sourced for the history, restore,\n * history-redact, and history-repair commands plus the health/validate drift checks.\n *\n * Each command keeps its own thin error-formatting wrapper so the exact CLI error\n * contracts (restore's rich patch-failure context, redact's op tag, history's\n * generic message) are preserved; only the underlying replay/patch logic is shared.\n */\n\nexport interface ReplayDocument {\n  metadata: Record<string, unknown>;\n  body: string;\n}\n\nexport const EMPTY_REPLAY_DOCUMENT: ReplayDocument = {\n  metadata: {},\n  body: \"\",\n};\n\nexport function cloneEmptyReplayDocument(): ReplayDocument {\n  return structuredClone(EMPTY_REPLAY_DOCUMENT);\n}\n\nexport function replayHash(document: ReplayDocument): string {\n  try {\n    return hashDocument({\n      metadata: document.metadata as unknown as ItemMetadata,\n      body: document.body,\n    });\n  } catch {\n    // Legacy/malformed replay states (for example a stream whose first entry never\n    // established a full `create` document, so the canonicalizer cannot normalize it)\n    // cannot be canonically hashed. Fall back to a deterministic structural hash so\n    // re-anchor and verification stay internally consistent for these streams. Fully\n    // formed documents always take the canonical path above, so valid streams are\n    // unaffected.\n    return sha256Hex(stableStringify({ replay_fallback: true, metadata: document.metadata, body: document.body }));\n  }\n}\n\nexport function replayToItemDocument(document: ReplayDocument): ItemDocument {\n  return {\n    metadata: document.metadata as unknown as ItemMetadata,\n    body: document.body,\n  };\n}\n\n/**\n * Canonicalize an item document into the ordered replay form used when comparing\n * a replayed chain against the on-disk item (restore + history-repair reconciliation).\n */\nexport function toReplayDocument(document: ItemDocument): ReplayDocument {\n  if (!document.metadata || Object.keys(document.metadata).length === 0) {\n    return {\n      metadata: {},\n      body: document.body ?? \"\",\n    };\n  }\n  const canonical = canonicalDocument(document);\n  return {\n    metadata: orderObject(toItemRecord(canonical.metadata), FRONT_MATTER_KEY_ORDER),\n    body: canonical.body,\n  };\n}\n\nexport function normalizeReplayPatchPath(path: string): string {\n  if (path === \"/front_matter\") {\n    return \"/metadata\";\n  }\n  if (path.startsWith(\"/front_matter/\")) {\n    return `/metadata/${path.slice(\"/front_matter/\".length)}`;\n  }\n  return path;\n}\n\nexport function normalizeReplayPatchOps(patch: HistoryPatchOp[]): HistoryPatchOp[] {\n  return patch.map((operation) => ({\n    ...operation,\n    path: normalizeReplayPatchPath(operation.path),\n    from: operation.from ? normalizeReplayPatchPath(operation.from) : undefined,\n  }));\n}\n\nfunction isReplayDocumentShape(value: unknown): value is { metadata: Record<string, unknown>; body: string } {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    \"metadata\" in value &&\n    \"body\" in value &&\n    typeof (value as { body: unknown }).body === \"string\" &&\n    typeof (value as { metadata: unknown }).metadata === \"object\" &&\n    (value as { metadata: unknown }).metadata !== null\n  );\n}\n\nexport type ReplayApplyResult =\n  | { ok: true; document: ReplayDocument }\n  | { ok: false; error: unknown };\n\n/**\n * Strictly apply a history patch (front_matter->metadata normalized) to a replay\n * document. Returns a result envelope rather than throwing so each caller can\n * format its own error contract.\n */\nexport function tryApplyReplayPatch(current: ReplayDocument, patch: HistoryPatchOp[]): ReplayApplyResult {\n  try {\n    const normalizedPatch = normalizeReplayPatchOps(patch);\n    const applied = jsonPatch.applyPatch(\n      structuredClone(current),\n      normalizedPatch as jsonPatch.Operation[],\n      true,\n      false,\n    ).newDocument as unknown;\n    if (!isReplayDocumentShape(applied)) {\n      return { ok: false, error: new Error(\"history_replay_invalid_document_shape\") };\n    }\n    return { ok: true, document: { metadata: applied.metadata, body: applied.body } };\n  } catch (error) {\n    return { ok: false, error };\n  }\n}\n\n/**\n * Deterministically verify a history chain: each entry's before_hash must equal\n * the prior replayed after_hash, the patch must strictly apply, and the recorded\n * after_hash must equal the replayed result.\n */\nexport function verifyHistoryChain(entries: HistoryEntry[]): { ok: boolean; errors: string[] } {\n  let replay = cloneEmptyReplayDocument();\n  for (let index = 0; index < entries.length; index += 1) {\n    const entry = entries[index];\n    if (replayHash(replay) !== entry.before_hash) {\n      return {\n        ok: false,\n        errors: [`verify_failed:before_hash_mismatch:entry_${index + 1}`],\n      };\n    }\n    const applied = tryApplyReplayPatch(replay, entry.patch);\n    if (!applied.ok) {\n      return {\n        ok: false,\n        errors: [`verify_failed:patch_apply_failed:entry_${index + 1}`],\n      };\n    }\n    replay = applied.document;\n    if (replayHash(replay) !== entry.after_hash) {\n      return {\n        ok: false,\n        errors: [`verify_failed:after_hash_mismatch:entry_${index + 1}`],\n      };\n    }\n  }\n  return { ok: true, errors: [] };\n}\n\nexport interface LenientApplyResult {\n  document: ReplayDocument;\n  convertedReplaceToAdd: number;\n  skippedOps: number;\n}\n\nfunction tryApplySingleOp(document: unknown, op: HistoryPatchOp): { ok: true; document: unknown } | { ok: false } {\n  try {\n    const applied = jsonPatch.applyPatch(\n      structuredClone(document),\n      [op as jsonPatch.Operation],\n      true,\n      false,\n    ).newDocument as unknown;\n    return { ok: true, document: applied };\n  } catch {\n    return { ok: false };\n  }\n}\n\n/**\n * Apply a legacy patch op-by-op, recovering from drift that strict replay rejects:\n * a `replace` whose path no longer exists is retried as `add`, and any op that\n * still cannot apply against the current replay state is skipped. The resulting\n * document is what the repaired entry's recomputed patch should target.\n */\nexport function lenientApplyReplayPatch(current: ReplayDocument, patch: HistoryPatchOp[]): LenientApplyResult {\n  let working: unknown = structuredClone(current);\n  let convertedReplaceToAdd = 0;\n  let skippedOps = 0;\n\n  for (const op of normalizeReplayPatchOps(patch)) {\n    const direct = tryApplySingleOp(working, op);\n    if (direct.ok) {\n      working = direct.document;\n      continue;\n    }\n    if (op.op === \"replace\") {\n      const asAdd = tryApplySingleOp(working, { ...op, op: \"add\" });\n      if (asAdd.ok) {\n        working = asAdd.document;\n        convertedReplaceToAdd += 1;\n        continue;\n      }\n    }\n    skippedOps += 1;\n  }\n\n  const candidate = working as { metadata?: unknown; body?: unknown };\n  const document: ReplayDocument = {\n    metadata:\n      typeof candidate.metadata === \"object\" && candidate.metadata !== null\n        ? (candidate.metadata as Record<string, unknown>)\n        : {},\n    body: typeof candidate.body === \"string\" ? candidate.body : current.body,\n  };\n  return { document, convertedReplaceToAdd, skippedOps };\n}\n\nexport interface ReanchorEntryDetail {\n  index: number;\n  rehashed: boolean;\n  patch_repaired: boolean;\n  converted_replace_to_add: number;\n  skipped_ops: number;\n}\n\nexport interface ReanchorResult {\n  entries: HistoryEntry[];\n  finalDocument: ReplayDocument;\n  entriesRehashed: number;\n  entriesPatchRepaired: number;\n  convertedReplaceToAdd: number;\n  skippedOps: number;\n  details: ReanchorEntryDetail[];\n}\n\n/**\n * Re-anchor a drifted history chain: replay every entry from empty, recompute the\n * before/after hashes, and only rewrite a patch when the original op set no longer\n * strictly applies (legacy drift). Clean entries keep their patch verbatim so the\n * on-disk diff stays minimal. The returned chain verifies via verifyHistoryChain.\n */\nexport function reanchorHistoryEntries(entries: HistoryEntry[]): ReanchorResult {\n  let replay = cloneEmptyReplayDocument();\n  const rewritten: HistoryEntry[] = [];\n  const details: ReanchorEntryDetail[] = [];\n  let entriesRehashed = 0;\n  let entriesPatchRepaired = 0;\n  let convertedReplaceToAdd = 0;\n  let skippedOps = 0;\n\n  for (let index = 0; index < entries.length; index += 1) {\n    const entry = entries[index];\n    const beforeHash = replayHash(replay);\n    const strict = tryApplyReplayPatch(replay, entry.patch);\n\n    let next: ReplayDocument;\n    let outPatch: HistoryPatchOp[];\n    let patchRepaired = false;\n    let entryConverted = 0;\n    let entrySkipped = 0;\n\n    if (strict.ok) {\n      next = strict.document;\n      outPatch = entry.patch;\n    } else {\n      const lenient = lenientApplyReplayPatch(replay, entry.patch);\n      next = lenient.document;\n      outPatch = jsonPatch.compare(replay, next) as HistoryPatchOp[];\n      patchRepaired = true;\n      entryConverted = lenient.convertedReplaceToAdd;\n      entrySkipped = lenient.skippedOps;\n      convertedReplaceToAdd += entryConverted;\n      skippedOps += entrySkipped;\n      entriesPatchRepaired += 1;\n    }\n\n    const afterHash = replayHash(next);\n    const rehashed = beforeHash !== entry.before_hash || afterHash !== entry.after_hash;\n    if (rehashed) {\n      entriesRehashed += 1;\n    }\n\n    rewritten.push({\n      ...entry,\n      patch: outPatch,\n      before_hash: beforeHash,\n      after_hash: afterHash,\n    });\n    details.push({\n      index: index + 1,\n      rehashed,\n      patch_repaired: patchRepaired,\n      converted_replace_to_add: entryConverted,\n      skipped_ops: entrySkipped,\n    });\n    replay = next;\n  }\n\n  return {\n    entries: rewritten,\n    finalDocument: replay,\n    entriesRehashed,\n    entriesPatchRepaired,\n    convertedReplaceToAdd,\n    skippedOps,\n    details,\n  };\n}\n\nexport function historyEntriesToRaw(entries: HistoryEntry[]): string {\n  if (entries.length === 0) {\n    return \"\";\n  }\n  return `${entries.map((entry) => JSON.stringify(entry)).join(\"\\n\")}\\n`;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;AAAA,OAAO,eAAe;;;;;;;;AAsBf,IAAM,wBAAwC;EACnD,UAAU,CAAA;EACV,MAAM;;AAGF,SAAU,2BAAwB;AACtC,SAAO,gBAAgB,qBAAqB;AAC9C;AAEM,SAAU,WAAW,UAAwB;AACjD,MAAI;AACF,WAAO,aAAa;MAClB,UAAU,SAAS;MACnB,MAAM,SAAS;KAChB;EACH,QAAQ;AAON,WAAO,UAAU,gBAAgB,EAAE,iBAAiB,MAAM,UAAU,SAAS,UAAU,MAAM,SAAS,KAAI,CAAE,CAAC;EAC/G;AACF;AAEM,SAAU,qBAAqB,UAAwB;AAC3D,SAAO;IACL,UAAU,SAAS;IACnB,MAAM,SAAS;;AAEnB;AAMM,SAAU,iBAAiB,UAAsB;AACrD,MAAI,CAAC,SAAS,YAAY,OAAO,KAAK,SAAS,QAAQ,EAAE,WAAW,GAAG;AACrE,WAAO;MACL,UAAU,CAAA;MACV,MAAM,SAAS,QAAQ;;EAE3B;AACA,QAAM,YAAY,kBAAkB,QAAQ;AAC5C,SAAO;IACL,UAAU,YAAY,aAAa,UAAU,QAAQ,GAAG,sBAAsB;IAC9E,MAAM,UAAU;;AAEpB;AAEM,SAAU,yBAAyB,MAAY;AACnD,MAAI,SAAS,iBAAiB;AAC5B,WAAO;EACT;AACA,MAAI,KAAK,WAAW,gBAAgB,GAAG;AACrC,WAAO,aAAa,KAAK,MAAM,iBAAiB,MAAM,CAAC;EACzD;AACA,SAAO;AACT;AAEM,SAAU,wBAAwB,OAAuB;AAC7D,SAAO,MAAM,IAAI,CAAC,eAAe;IAC/B,GAAG;IACH,MAAM,yBAAyB,UAAU,IAAI;IAC7C,MAAM,UAAU,OAAO,yBAAyB,UAAU,IAAI,IAAI;IAClE;AACJ;AAEA,SAAS,sBAAsB,OAAc;AAC3C,SACE,OAAO,UAAU,YACjB,UAAU,QACV,cAAc,SACd,UAAU,SACV,OAAQ,MAA4B,SAAS,YAC7C,OAAQ,MAAgC,aAAa,YACpD,MAAgC,aAAa;AAElD;AAWM,SAAU,oBAAoB,SAAyB,OAAuB;AAClF,MAAI;AACF,UAAM,kBAAkB,wBAAwB,KAAK;AACrD,UAAM,UAAU,UAAU,WACxB,gBAAgB,OAAO,GACvB,iBACA,MACA,KAAK,EACL;AACF,QAAI,CAAC,sBAAsB,OAAO,GAAG;AACnC,aAAO,EAAE,IAAI,OAAO,OAAO,IAAI,MAAM,uCAAuC,EAAC;IAC/E;AACA,WAAO,EAAE,IAAI,MAAM,UAAU,EAAE,UAAU,QAAQ,UAAU,MAAM,QAAQ,KAAI,EAAE;EACjF,SAAS,OAAO;AACd,WAAO,EAAE,IAAI,OAAO,MAAK;EAC3B;AACF;AAOM,SAAU,mBAAmB,SAAuB;AACxD,MAAI,SAAS,yBAAwB;AACrC,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,UAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAI,WAAW,MAAM,MAAM,MAAM,aAAa;AAC5C,aAAO;QACL,IAAI;QACJ,QAAQ,CAAC,4CAA4C,QAAQ,CAAC,EAAE;;IAEpE;AACA,UAAM,UAAU,oBAAoB,QAAQ,MAAM,KAAK;AACvD,QAAI,CAAC,QAAQ,IAAI;AACf,aAAO;QACL,IAAI;QACJ,QAAQ,CAAC,0CAA0C,QAAQ,CAAC,EAAE;;IAElE;AACA,aAAS,QAAQ;AACjB,QAAI,WAAW,MAAM,MAAM,MAAM,YAAY;AAC3C,aAAO;QACL,IAAI;QACJ,QAAQ,CAAC,2CAA2C,QAAQ,CAAC,EAAE;;IAEnE;EACF;AACA,SAAO,EAAE,IAAI,MAAM,QAAQ,CAAA,EAAE;AAC/B;AAQA,SAAS,iBAAiB,UAAmB,IAAkB;AAC7D,MAAI;AACF,UAAM,UAAU,UAAU,WACxB,gBAAgB,QAAQ,GACxB,CAAC,EAAyB,GAC1B,MACA,KAAK,EACL;AACF,WAAO,EAAE,IAAI,MAAM,UAAU,QAAO;EACtC,QAAQ;AACN,WAAO,EAAE,IAAI,MAAK;EACpB;AACF;AAQM,SAAU,wBAAwB,SAAyB,OAAuB;AACtF,MAAI,UAAmB,gBAAgB,OAAO;AAC9C,MAAI,wBAAwB;AAC5B,MAAI,aAAa;AAEjB,aAAW,MAAM,wBAAwB,KAAK,GAAG;AAC/C,UAAM,SAAS,iBAAiB,SAAS,EAAE;AAC3C,QAAI,OAAO,IAAI;AACb,gBAAU,OAAO;AACjB;IACF;AACA,QAAI,GAAG,OAAO,WAAW;AACvB,YAAM,QAAQ,iBAAiB,SAAS,EAAE,GAAG,IAAI,IAAI,MAAK,CAAE;AAC5D,UAAI,MAAM,IAAI;AACZ,kBAAU,MAAM;AAChB,iCAAyB;AACzB;MACF;IACF;AACA,kBAAc;EAChB;AAEA,QAAM,YAAY;AAClB,QAAM,WAA2B;IAC/B,UACE,OAAO,UAAU,aAAa,YAAY,UAAU,aAAa,OAC5D,UAAU,WACX,CAAA;IACN,MAAM,OAAO,UAAU,SAAS,WAAW,UAAU,OAAO,QAAQ;;AAEtE,SAAO,EAAE,UAAU,uBAAuB,WAAU;AACtD;AA0BM,SAAU,uBAAuB,SAAuB;AAC5D,MAAI,SAAS,yBAAwB;AACrC,QAAM,YAA4B,CAAA;AAClC,QAAM,UAAiC,CAAA;AACvC,MAAI,kBAAkB;AACtB,MAAI,uBAAuB;AAC3B,MAAI,wBAAwB;AAC5B,MAAI,aAAa;AAEjB,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,UAAM,QAAQ,QAAQ,KAAK;AAC3B,UAAM,aAAa,WAAW,MAAM;AACpC,UAAM,SAAS,oBAAoB,QAAQ,MAAM,KAAK;AAEtD,QAAI;AACJ,QAAI;AACJ,QAAI,gBAAgB;AACpB,QAAI,iBAAiB;AACrB,QAAI,eAAe;AAEnB,QAAI,OAAO,IAAI;AACb,aAAO,OAAO;AACd,iBAAW,MAAM;IACnB,OAAO;AACL,YAAM,UAAU,wBAAwB,QAAQ,MAAM,KAAK;AAC3D,aAAO,QAAQ;AACf,iBAAW,UAAU,QAAQ,QAAQ,IAAI;AACzC,sBAAgB;AAChB,uBAAiB,QAAQ;AACzB,qBAAe,QAAQ;AACvB,+BAAyB;AACzB,oBAAc;AACd,8BAAwB;IAC1B;AAEA,UAAM,YAAY,WAAW,IAAI;AACjC,UAAM,WAAW,eAAe,MAAM,eAAe,cAAc,MAAM;AACzE,QAAI,UAAU;AACZ,yBAAmB;IACrB;AAEA,cAAU,KAAK;MACb,GAAG;MACH,OAAO;MACP,aAAa;MACb,YAAY;KACb;AACD,YAAQ,KAAK;MACX,OAAO,QAAQ;MACf;MACA,gBAAgB;MAChB,0BAA0B;MAC1B,aAAa;KACd;AACD,aAAS;EACX;AAEA,SAAO;IACL,SAAS;IACT,eAAe;IACf;IACA;IACA;IACA;IACA;;AAEJ;AAEM,SAAU,oBAAoB,SAAuB;AACzD,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;EACT;AACA,SAAO,GAAG,QAAQ,IAAI,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC;;AACpE;",
+  "names": []
+}