@unbrained/pm-cli 2026.7.1 → 2026.7.3

package/dist/cli-bundle/chunks/{chunk-WYDHYJPO.js → chunk-AJHYQCBJ.js}

@@ -1,13 +1,32 @@
 import {
   EXIT_CODE,
   PmCliError
-} from "./chunk-RVUALSJF.js";
+} from "./chunk-KHVGM5CS.js";
+
+// dist/core/shared/memo.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] = "6994d548-06c7-57d3-810a-6164e2001577");
+  } catch (e2) {
+  }
+})();
+function evictOldestMemoEntries(memo) {
+  let remaining = Math.ceil(memo.size / 2);
+  for (const key of memo.keys()) {
+    if (remaining === 0) {
+      return;
+    }
+    memo.delete(key);
+    remaining -= 1;
+  }
+}
 
 // dist/core/shared/time.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] = "7464d015-8653-5f0a-a32c-8241e2c4a3c9");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "e10e1e6b-1d12-59cc-86e8-3e9c6415782a");
   } catch (e2) {
   }
 })();
@@ -23,9 +42,23 @@ function nowIso() {
 function isTimestampLiteral(input) {
   return Number.isFinite(Date.parse(input));
 }
+var TIMESTAMP_PARSE_MEMO_MAX_ENTRIES = 1e4;
+var timestampParseMemo = /* @__PURE__ */ new Map();
+function parseTimestampMsMemoized(value) {
+  const memoized = timestampParseMemo.get(value);
+  if (memoized !== void 0) {
+    return memoized;
+  }
+  const parsed = Date.parse(value);
+  if (timestampParseMemo.size >= TIMESTAMP_PARSE_MEMO_MAX_ENTRIES) {
+    evictOldestMemoEntries(timestampParseMemo);
+  }
+  timestampParseMemo.set(value, parsed);
+  return parsed;
+}
 function compareTimestampStrings(left, right) {
-  const leftMs = Date.parse(left);
-  const rightMs = Date.parse(right);
+  const leftMs = parseTimestampMsMemoized(left);
+  const rightMs = parseTimestampMsMemoized(right);
   if (Number.isFinite(leftMs) && Number.isFinite(rightMs) && leftMs !== rightMs) {
     return leftMs - rightMs;
   }
@@ -204,9 +237,10 @@ function resolveIsoOrRelative(input, now = /* @__PURE__ */ new Date(), fieldLabe
 }
 
 export {
+  evictOldestMemoEntries,
   nowIso,
   isTimestampLiteral,
   compareTimestampStrings,
   resolveIsoOrRelative
 };
-//# sourceMappingURL=chunk-WYDHYJPO.js.map
+//# sourceMappingURL=chunk-AJHYQCBJ.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../core/shared/memo.ts", "../../../../../../../../core/shared/time.ts"],
+  "sourcesContent": ["/**\n * @module core/shared/memo\n *\n * Provides shared primitives and utilities for capped memoization maps.\n */\n\n/**\n * Drop the oldest-inserted half of a memo map (Map preserves insertion order), so a\n * size-cap hit mid-scan keeps the newest-inserted half instead of cold-starting the\n * memo. Callers that re-insert entries on hit (the envelope memo) get LRU eviction;\n * the scalar comparator memos evict purely by insertion order.\n */\nexport function evictOldestMemoEntries<Value>(memo: Map<string, Value>): void {\n  let remaining = Math.ceil(memo.size / 2);\n  for (const key of memo.keys()) {\n    if (remaining === 0) {\n      return;\n    }\n    memo.delete(key);\n    remaining -= 1;\n  }\n}\n", "/**\n * @module core/shared/time\n *\n * Provides shared primitives and utilities for Time.\n */\nimport { PmCliError } from \"./errors.js\";\nimport { evictOldestMemoEntries } from \"./memo.js\";\nimport { EXIT_CODE } from \"./constants.js\";\n\nconst RELATIVE_DEADLINE = /^([+-]?)(\\d+)([hdwm])$/i;\nconst COMPOUND_RELATIVE_DEADLINE = /^[+-]?\\d+[hdwm](?:[+-]\\d+[hdwm])+$/i;\nconst COMPACT_DATE = /^(\\d{4})(\\d{2})(\\d{2})$/;\nconst COMPACT_DATETIME = /^(\\d{4})(\\d{2})(\\d{2})(?:[T\\s]?)(\\d{2})(\\d{2})(\\d{2})?([.,]\\d{1,3})?(Z|[+-]\\d{2}:?\\d{2})?$/i;\nconst HYPHEN_TIME = /^(\\d{4}-\\d{2}-\\d{2})[T\\s](\\d{2})-(\\d{2})(?:-(\\d{2}))?([.,]\\d{1,3})?(Z|[+-]\\d{2}:?\\d{2})?$/i;\nconst COMPACT_TIME = /^(\\d{4}-\\d{2}-\\d{2})[T\\s](\\d{2})(\\d{2})(\\d{2})?([.,]\\d{1,3})?(Z|[+-]\\d{2}:?\\d{2})?$/i;\n\n/**\n * Implements now iso for the public runtime surface of this module.\n */\nexport function nowIso(): string {\n  return new Date().toISOString();\n}\n\n/**\n * Implements check whether timestamp literal for the public runtime surface of this module.\n */\nexport function isTimestampLiteral(input: string): boolean {\n  return Number.isFinite(Date.parse(input));\n}\n\n/**\n * Memoized `Date.parse` for {@link compareTimestampStrings}. Sort comparators call it\n * O(n log n) times over a corpus whose timestamp strings repeat heavily, and\n * `Date.parse` is expensive enough to show up in list/next/context profiles. The cap\n * bounds memory in long-lived hosts (the MCP server); half-eviction keeps the\n * newest-inserted half when the cap is hit.\n */\nconst TIMESTAMP_PARSE_MEMO_MAX_ENTRIES = 10_000;\nconst timestampParseMemo = new Map<string, number>();\n\nfunction parseTimestampMsMemoized(value: string): number {\n  const memoized = timestampParseMemo.get(value);\n  if (memoized !== undefined) {\n    return memoized;\n  }\n  const parsed = Date.parse(value);\n  if (timestampParseMemo.size >= TIMESTAMP_PARSE_MEMO_MAX_ENTRIES) {\n    evictOldestMemoEntries(timestampParseMemo);\n  }\n  timestampParseMemo.set(value, parsed);\n  return parsed;\n}\n\n/**\n * Implements compare timestamp strings for the public runtime surface of this module.\n */\nexport function compareTimestampStrings(left: string, right: string): number {\n  const leftMs = parseTimestampMsMemoized(left);\n  const rightMs = parseTimestampMsMemoized(right);\n  if (Number.isFinite(leftMs) && Number.isFinite(rightMs) && leftMs !== rightMs) {\n    return leftMs - rightMs;\n  }\n  return left.localeCompare(right);\n}\n\nfunction normalizeFraction(raw: string | undefined): string {\n  if (!raw) return \"\";\n  const digits = raw.slice(1);\n  return `.${digits.padEnd(3, \"0\").slice(0, 3)}`;\n}\n\nfunction normalizeOffset(raw: string | undefined): string {\n  if (!raw) return \"\";\n  if (raw.toUpperCase() === \"Z\") return \"Z\";\n  const compact = /^([+-]\\d{2})(\\d{2})$/.exec(raw);\n  if (compact) return `${compact[1]}:${compact[2]}`;\n  return raw;\n}\n\nfunction pushTimestampCandidate(candidates: string[], input: string, value: string | undefined): void {\n  if (!value) return;\n  if (value === input) return;\n  if (candidates.includes(value)) return;\n  candidates.push(value);\n}\n\nfunction normalizeTimestampCandidates(input: string): string[] {\n  const candidates: string[] = [];\n  const push = (value: string | undefined): void => pushTimestampCandidate(candidates, input, value);\n\n  const compactDate = COMPACT_DATE.exec(input);\n  if (compactDate) {\n    const [, year, month, day] = compactDate;\n    push(`${year}-${month}-${day}`);\n  }\n\n  const compactDateTime = COMPACT_DATETIME.exec(input);\n  if (compactDateTime) {\n    const [, year, month, day, hour, minute, secondRaw, fractionRaw, offsetRaw] = compactDateTime;\n    const second = secondRaw ? `:${secondRaw}` : \"\";\n    push(\n      `${year}-${month}-${day}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`,\n    );\n  }\n\n  const hyphenTime = HYPHEN_TIME.exec(input);\n  if (hyphenTime) {\n    const [, datePart, hour, minute, secondRaw, fractionRaw, offsetRaw] = hyphenTime;\n    const second = secondRaw ? `:${secondRaw}` : \"\";\n    push(`${datePart}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`);\n  }\n\n  const compactTime = COMPACT_TIME.exec(input);\n  if (compactTime) {\n    const [, datePart, hour, minute, secondRaw, fractionRaw, offsetRaw] = compactTime;\n    const second = secondRaw ? `:${secondRaw}` : \"\";\n    push(`${datePart}T${hour}:${minute}${second}${normalizeFraction(fractionRaw)}${normalizeOffset(offsetRaw)}`);\n  }\n\n  const datePrefixLength = 10;\n  const datePrefix = input.slice(0, datePrefixLength);\n  if (isHyphenDatePrefix(datePrefix)) {\n    let index = datePrefixLength;\n    while (index < input.length && isWhitespaceCharacter(input[index])) {\n      index += 1;\n    }\n    if (index < input.length) {\n      push(`${datePrefix}T${input.slice(index)}`);\n    }\n  }\n\n  return candidates;\n}\n\nfunction parseTimestampWithFallbacks(input: string): number {\n  const direct = Date.parse(input);\n  if (Number.isFinite(direct)) return direct;\n  for (const candidate of normalizeTimestampCandidates(input)) {\n    const parsed = Date.parse(candidate);\n    if (Number.isFinite(parsed)) return parsed;\n  }\n  return Number.NaN;\n}\n\nfunction isHyphenDatePrefix(value: string): boolean {\n  if (value.length !== 10) {\n    return false;\n  }\n  for (let index = 0; index < value.length; index += 1) {\n    const character = value[index];\n    if (index === 4 || index === 7) {\n      if (character !== \"-\") {\n        return false;\n      }\n      continue;\n    }\n    const code = character.charCodeAt(0);\n    if (code < 48 || code > 57) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction isWhitespaceCharacter(character: string | undefined): boolean {\n  if (!character) {\n    return false;\n  }\n  return (\n    character === \" \" ||\n    character === \"\\t\" ||\n    character === \"\\n\" ||\n    character === \"\\r\" ||\n    character === \"\\f\" ||\n    character === \"\\v\"\n  );\n}\n\nfunction daysInUtcMonth(year: number, monthIndex: number): number {\n  return new Date(Date.UTC(year, monthIndex + 1, 0)).getUTCDate();\n}\n\nconst MONTH_NAMES = [\n  \"January\",\n  \"February\",\n  \"March\",\n  \"April\",\n  \"May\",\n  \"June\",\n  \"July\",\n  \"August\",\n  \"September\",\n  \"October\",\n  \"November\",\n  \"December\",\n] as const;\n\n// Leading literal calendar date in either hyphenated (`2026-02-30`) or compact\n// (`20260230`) form, optionally followed by any time/zone component. We validate\n// the digits the caller actually typed — not the parsed instant — so timezone\n// offsets never produce a false \"impossible date\" rejection. The hyphenated form\n// is unambiguous, so anything may follow (`T`/space time, `Z`, `+/-` offset). The\n// compact form must be followed by end-of-string or a time digit (with an optional\n// `T`/space separator) so a no-separator compact datetime like `20260230135900Z`\n// is still guarded and a 7-digit non-date is not misread as a date.\nconst LEADING_HYPHEN_DATE = /^(\\d{4})-(\\d{2})-(\\d{2})/;\nconst LEADING_COMPACT_DATE = /^(\\d{4})(\\d{2})(\\d{2})(?:[T ]?\\d{2}|$)/;\n\n/**\n * Reject literal calendar dates whose day cannot exist (e.g. `2026-02-30`, which JS\n * `Date` silently rolls forward to March 2). Without this, agents that pass an\n * impossible deadline get a silently-wrong stored date instead of an actionable\n * error. Only triggers on a leading literal date; relative tokens, \"now\", and pure\n * times are untouched. Month 00 / >12 is also rejected with a clear message rather\n * than falling through to the generic \"invalid value\" path.\n */\nfunction assertRealCalendarDate(originalInput: string, trimmed: string, fieldLabel: string): void {\n  const match = LEADING_HYPHEN_DATE.exec(trimmed) ?? LEADING_COMPACT_DATE.exec(trimmed);\n  if (!match) {\n    return;\n  }\n  const year = Number.parseInt(match[1], 10);\n  const month = Number.parseInt(match[2], 10);\n  const day = Number.parseInt(match[3], 10);\n  const label = fieldLabel?.trim() || \"deadline\";\n  if (month < 1 || month > 12) {\n    throw new PmCliError(\n      `Invalid ${label} value \"${originalInput}\". Month \"${match[2]}\" is out of range — use a month between 01 and 12.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  const maxDay = daysInUtcMonth(year, month - 1);\n  if (day < 1 || day > maxDay) {\n    throw new PmCliError(\n      `Invalid ${label} value \"${originalInput}\". ${MONTH_NAMES[month - 1]} ${year} has ${maxDay} days, so day \"${match[3]}\" does not exist. Use a real YYYY-MM-DD calendar date.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n}\n\nfunction addUtcMonths(now: Date, amount: number): Date {\n  const result = new Date(now.getTime());\n  const startDay = result.getUTCDate();\n  const targetMonthIndex = result.getUTCMonth() + amount;\n  const targetYear = result.getUTCFullYear() + Math.floor(targetMonthIndex / 12);\n  const targetMonth = ((targetMonthIndex % 12) + 12) % 12;\n  const day = Math.min(startDay, daysInUtcMonth(targetYear, targetMonth));\n  result.setUTCFullYear(targetYear, targetMonth, day);\n  return result;\n}\n\n/**\n * Implements resolve iso or relative for the public runtime surface of this module.\n */\nexport function resolveIsoOrRelative(\n  input: string,\n  now: Date = new Date(),\n  fieldLabel = \"deadline\",\n): string {\n  const trimmed = input.trim();\n  if (trimmed.toLowerCase() === \"now\") {\n    return now.toISOString();\n  }\n  const relative = RELATIVE_DEADLINE.exec(trimmed);\n  if (relative) {\n    const sign = relative[1] === \"-\" ? -1 : 1;\n    const amount = Number.parseInt(relative[2], 10) * sign;\n    const unit = relative[3].toLowerCase();\n    if (unit === \"m\") {\n      return addUtcMonths(now, amount).toISOString();\n    }\n    const msPerUnit = unit === \"h\" ? 60 * 60 * 1000 : unit === \"d\" ? 24 * 60 * 60 * 1000 : 7 * 24 * 60 * 60 * 1000;\n    return new Date(now.getTime() + amount * msPerUnit).toISOString();\n  }\n\n  assertRealCalendarDate(input, trimmed, fieldLabel);\n\n  const timestamp = parseTimestampWithFallbacks(trimmed);\n  if (!Number.isFinite(timestamp)) {\n    const normalizedLabel = fieldLabel.trim().length > 0 ? fieldLabel.trim() : \"deadline\";\n    const guidance = COMPOUND_RELATIVE_DEADLINE.test(trimmed)\n      ? \"Compound relative expressions like +3d+1h are not supported; use a single relative token (for example +3d) or an ISO/date string.\"\n      : 'Use ISO/date string input, \"now\", or relative +6h/-6h/+1d/-1d/+2w/-2w/+6m/-6m.';\n    throw new PmCliError(\n      `Invalid ${normalizedLabel} value \"${input}\". ${guidance}`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return new Date(timestamp).toISOString();\n}\n\nexport const _testOnly = {\n  normalizeOffset,\n  pushTimestampCandidate,\n  normalizeTimestampCandidates,\n  parseTimestampWithFallbacks,\n  isWhitespaceCharacter,\n};\n"],
+  "mappings": ";;;;;;;;;;;;;AAYM,SAAU,uBAA8B,MAAwB;AACpE,MAAI,YAAY,KAAK,KAAK,KAAK,OAAO,CAAC;AACvC,aAAW,OAAO,KAAK,KAAI,GAAI;AAC7B,QAAI,cAAc,GAAG;AACnB;IACF;AACA,SAAK,OAAO,GAAG;AACf,iBAAa;EACf;AACF;;;;;;;;;;ACZA,IAAM,oBAAoB;AAC1B,IAAM,6BAA6B;AACnC,IAAM,eAAe;AACrB,IAAM,mBAAmB;AACzB,IAAM,cAAc;AACpB,IAAM,eAAe;AAKf,SAAU,SAAM;AACpB,UAAO,oBAAI,KAAI,GAAG,YAAW;AAC/B;AAKM,SAAU,mBAAmB,OAAa;AAC9C,SAAO,OAAO,SAAS,KAAK,MAAM,KAAK,CAAC;AAC1C;AASA,IAAM,mCAAmC;AACzC,IAAM,qBAAqB,oBAAI,IAAG;AAElC,SAAS,yBAAyB,OAAa;AAC7C,QAAM,WAAW,mBAAmB,IAAI,KAAK;AAC7C,MAAI,aAAa,QAAW;AAC1B,WAAO;EACT;AACA,QAAM,SAAS,KAAK,MAAM,KAAK;AAC/B,MAAI,mBAAmB,QAAQ,kCAAkC;AAC/D,2BAAuB,kBAAkB;EAC3C;AACA,qBAAmB,IAAI,OAAO,MAAM;AACpC,SAAO;AACT;AAKM,SAAU,wBAAwB,MAAc,OAAa;AACjE,QAAM,SAAS,yBAAyB,IAAI;AAC5C,QAAM,UAAU,yBAAyB,KAAK;AAC9C,MAAI,OAAO,SAAS,MAAM,KAAK,OAAO,SAAS,OAAO,KAAK,WAAW,SAAS;AAC7E,WAAO,SAAS;EAClB;AACA,SAAO,KAAK,cAAc,KAAK;AACjC;AAEA,SAAS,kBAAkB,KAAuB;AAChD,MAAI,CAAC;AAAK,WAAO;AACjB,QAAM,SAAS,IAAI,MAAM,CAAC;AAC1B,SAAO,IAAI,OAAO,OAAO,GAAG,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC;AAC9C;AAEA,SAAS,gBAAgB,KAAuB;AAC9C,MAAI,CAAC;AAAK,WAAO;AACjB,MAAI,IAAI,YAAW,MAAO;AAAK,WAAO;AACtC,QAAM,UAAU,uBAAuB,KAAK,GAAG;AAC/C,MAAI;AAAS,WAAO,GAAG,QAAQ,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;AAC/C,SAAO;AACT;AAEA,SAAS,uBAAuB,YAAsB,OAAe,OAAyB;AAC5F,MAAI,CAAC;AAAO;AACZ,MAAI,UAAU;AAAO;AACrB,MAAI,WAAW,SAAS,KAAK;AAAG;AAChC,aAAW,KAAK,KAAK;AACvB;AAEA,SAAS,6BAA6B,OAAa;AACjD,QAAM,aAAuB,CAAA;AAC7B,QAAM,OAAO,CAAC,UAAoC,uBAAuB,YAAY,OAAO,KAAK;AAEjG,QAAM,cAAc,aAAa,KAAK,KAAK;AAC3C,MAAI,aAAa;AACf,UAAM,CAAC,EAAE,MAAM,OAAO,GAAG,IAAI;AAC7B,SAAK,GAAG,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE;EAChC;AAEA,QAAM,kBAAkB,iBAAiB,KAAK,KAAK;AACnD,MAAI,iBAAiB;AACnB,UAAM,CAAC,EAAE,MAAM,OAAO,KAAK,MAAM,QAAQ,WAAW,aAAa,SAAS,IAAI;AAC9E,UAAM,SAAS,YAAY,IAAI,SAAS,KAAK;AAC7C,SACE,GAAG,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,MAAM,GAAG,MAAM,GAAG,kBAAkB,WAAW,CAAC,GAAG,gBAAgB,SAAS,CAAC,EAAE;EAEtH;AAEA,QAAM,aAAa,YAAY,KAAK,KAAK;AACzC,MAAI,YAAY;AACd,UAAM,CAAC,EAAE,UAAU,MAAM,QAAQ,WAAW,aAAa,SAAS,IAAI;AACtE,UAAM,SAAS,YAAY,IAAI,SAAS,KAAK;AAC7C,SAAK,GAAG,QAAQ,IAAI,IAAI,IAAI,MAAM,GAAG,MAAM,GAAG,kBAAkB,WAAW,CAAC,GAAG,gBAAgB,SAAS,CAAC,EAAE;EAC7G;AAEA,QAAM,cAAc,aAAa,KAAK,KAAK;AAC3C,MAAI,aAAa;AACf,UAAM,CAAC,EAAE,UAAU,MAAM,QAAQ,WAAW,aAAa,SAAS,IAAI;AACtE,UAAM,SAAS,YAAY,IAAI,SAAS,KAAK;AAC7C,SAAK,GAAG,QAAQ,IAAI,IAAI,IAAI,MAAM,GAAG,MAAM,GAAG,kBAAkB,WAAW,CAAC,GAAG,gBAAgB,SAAS,CAAC,EAAE;EAC7G;AAEA,QAAM,mBAAmB;AACzB,QAAM,aAAa,MAAM,MAAM,GAAG,gBAAgB;AAClD,MAAI,mBAAmB,UAAU,GAAG;AAClC,QAAI,QAAQ;AACZ,WAAO,QAAQ,MAAM,UAAU,sBAAsB,MAAM,KAAK,CAAC,GAAG;AAClE,eAAS;IACX;AACA,QAAI,QAAQ,MAAM,QAAQ;AACxB,WAAK,GAAG,UAAU,IAAI,MAAM,MAAM,KAAK,CAAC,EAAE;IAC5C;EACF;AAEA,SAAO;AACT;AAEA,SAAS,4BAA4B,OAAa;AAChD,QAAM,SAAS,KAAK,MAAM,KAAK;AAC/B,MAAI,OAAO,SAAS,MAAM;AAAG,WAAO;AACpC,aAAW,aAAa,6BAA6B,KAAK,GAAG;AAC3D,UAAM,SAAS,KAAK,MAAM,SAAS;AACnC,QAAI,OAAO,SAAS,MAAM;AAAG,aAAO;EACtC;AACA,SAAO,OAAO;AAChB;AAEA,SAAS,mBAAmB,OAAa;AACvC,MAAI,MAAM,WAAW,IAAI;AACvB,WAAO;EACT;AACA,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,UAAM,YAAY,MAAM,KAAK;AAC7B,QAAI,UAAU,KAAK,UAAU,GAAG;AAC9B,UAAI,cAAc,KAAK;AACrB,eAAO;MACT;AACA;IACF;AACA,UAAM,OAAO,UAAU,WAAW,CAAC;AACnC,QAAI,OAAO,MAAM,OAAO,IAAI;AAC1B,aAAO;IACT;EACF;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,WAA6B;AAC1D,MAAI,CAAC,WAAW;AACd,WAAO;EACT;AACA,SACE,cAAc,OACd,cAAc,OACd,cAAc,QACd,cAAc,QACd,cAAc,QACd,cAAc;AAElB;AAEA,SAAS,eAAe,MAAc,YAAkB;AACtD,SAAO,IAAI,KAAK,KAAK,IAAI,MAAM,aAAa,GAAG,CAAC,CAAC,EAAE,WAAU;AAC/D;AAEA,IAAM,cAAc;EAClB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAWF,IAAM,sBAAsB;AAC5B,IAAM,uBAAuB;AAU7B,SAAS,uBAAuB,eAAuB,SAAiB,YAAkB;AACxF,QAAM,QAAQ,oBAAoB,KAAK,OAAO,KAAK,qBAAqB,KAAK,OAAO;AACpF,MAAI,CAAC,OAAO;AACV;EACF;AACA,QAAM,OAAO,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AACzC,QAAM,QAAQ,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAC1C,QAAM,MAAM,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AACxC,QAAM,QAAQ,YAAY,KAAI,KAAM;AACpC,MAAI,QAAQ,KAAK,QAAQ,IAAI;AAC3B,UAAM,IAAI,WACR,WAAW,KAAK,WAAW,aAAa,aAAa,MAAM,CAAC,CAAC,2DAC7D,UAAU,KAAK;EAEnB;AACA,QAAM,SAAS,eAAe,MAAM,QAAQ,CAAC;AAC7C,MAAI,MAAM,KAAK,MAAM,QAAQ;AAC3B,UAAM,IAAI,WACR,WAAW,KAAK,WAAW,aAAa,MAAM,YAAY,QAAQ,CAAC,CAAC,IAAI,IAAI,QAAQ,MAAM,kBAAkB,MAAM,CAAC,CAAC,0DACpH,UAAU,KAAK;EAEnB;AACF;AAEA,SAAS,aAAa,KAAW,QAAc;AAC7C,QAAM,SAAS,IAAI,KAAK,IAAI,QAAO,CAAE;AACrC,QAAM,WAAW,OAAO,WAAU;AAClC,QAAM,mBAAmB,OAAO,YAAW,IAAK;AAChD,QAAM,aAAa,OAAO,eAAc,IAAK,KAAK,MAAM,mBAAmB,EAAE;AAC7E,QAAM,eAAgB,mBAAmB,KAAM,MAAM;AACrD,QAAM,MAAM,KAAK,IAAI,UAAU,eAAe,YAAY,WAAW,CAAC;AACtE,SAAO,eAAe,YAAY,aAAa,GAAG;AAClD,SAAO;AACT;AAKM,SAAU,qBACd,OACA,MAAY,oBAAI,KAAI,GACpB,aAAa,YAAU;AAEvB,QAAM,UAAU,MAAM,KAAI;AAC1B,MAAI,QAAQ,YAAW,MAAO,OAAO;AACnC,WAAO,IAAI,YAAW;EACxB;AACA,QAAM,WAAW,kBAAkB,KAAK,OAAO;AAC/C,MAAI,UAAU;AACZ,UAAM,OAAO,SAAS,CAAC,MAAM,MAAM,KAAK;AACxC,UAAM,SAAS,OAAO,SAAS,SAAS,CAAC,GAAG,EAAE,IAAI;AAClD,UAAM,OAAO,SAAS,CAAC,EAAE,YAAW;AACpC,QAAI,SAAS,KAAK;AAChB,aAAO,aAAa,KAAK,MAAM,EAAE,YAAW;IAC9C;AACA,UAAM,YAAY,SAAS,MAAM,KAAK,KAAK,MAAO,SAAS,MAAM,KAAK,KAAK,KAAK,MAAO,IAAI,KAAK,KAAK,KAAK;AAC1G,WAAO,IAAI,KAAK,IAAI,QAAO,IAAK,SAAS,SAAS,EAAE,YAAW;EACjE;AAEA,yBAAuB,OAAO,SAAS,UAAU;AAEjD,QAAM,YAAY,4BAA4B,OAAO;AACrD,MAAI,CAAC,OAAO,SAAS,SAAS,GAAG;AAC/B,UAAM,kBAAkB,WAAW,KAAI,EAAG,SAAS,IAAI,WAAW,KAAI,IAAK;AAC3E,UAAM,WAAW,2BAA2B,KAAK,OAAO,IACpD,sIACA;AACJ,UAAM,IAAI,WACR,WAAW,eAAe,WAAW,KAAK,MAAM,QAAQ,IACxD,UAAU,KAAK;EAEnB;AACA,SAAO,IAAI,KAAK,SAAS,EAAE,YAAW;AACxC;",
+  "names": []
+}

package/dist/cli-bundle/chunks/{chunk-VZDBVEZR.js → chunk-B4O5S7I3.js}

@@ -2,7 +2,7 @@
 !(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] = "439e5c08-5cff-56f0-a21d-15ffdb7afe94");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "b0ddd8ee-f289-5872-bce9-00b573abca7e");
   } catch (e2) {
   }
 })();
@@ -251,43 +251,39 @@ function resolveNestedSettingDescriptor(raw) {
   }
   return DESCRIPTOR_BY_KEY.get(normalized);
 }
-function parseNestedSettingValue(descriptor, rawValue) {
-  if (typeof rawValue !== "string") {
-    return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };
+function parseNestedBooleanValue(descriptor, rawValue) {
+  const normalized = rawValue.trim().toLowerCase();
+  if (normalized === "true" || normalized === "1" || normalized === "yes" || normalized === "on") {
+    return { ok: true, parsed: { descriptor, value: true } };
   }
-  const trimmed = rawValue.trim();
-  if (descriptor.kind === "boolean") {
-    const normalized = trimmed.toLowerCase();
-    if (normalized === "true" || normalized === "1" || normalized === "yes" || normalized === "on") {
-      return { ok: true, parsed: { descriptor, value: true } };
-    }
-    if (normalized === "false" || normalized === "0" || normalized === "no" || normalized === "off") {
-      return { ok: true, parsed: { descriptor, value: false } };
+  if (normalized === "false" || normalized === "0" || normalized === "no" || normalized === "off") {
+    return { ok: true, parsed: { descriptor, value: false } };
+  }
+  return {
+    ok: false,
+    error: {
+      message: `Config set ${descriptor.key} requires a boolean value (true|false), got "${rawValue}"`
     }
+  };
+}
+function parseNestedStringValue(descriptor, rawValue, trimmed) {
+  if (descriptor.non_empty === true && trimmed.length === 0) {
+    return {
+      ok: false,
+      error: { message: `Config set ${descriptor.key} requires a non-empty value` }
+    };
+  }
+  if (descriptor.choices && !descriptor.choices.includes(trimmed)) {
     return {
       ok: false,
       error: {
-        message: `Config set ${descriptor.key} requires a boolean value (true|false), got "${rawValue}"`
+        message: `Config set ${descriptor.key} must be one of ${descriptor.choices.join("|")}, got "${rawValue}"`
       }
     };
   }
-  if (descriptor.kind === "string") {
-    if (descriptor.non_empty === true && trimmed.length === 0) {
-      return {
-        ok: false,
-        error: { message: `Config set ${descriptor.key} requires a non-empty value` }
-      };
-    }
-    if (descriptor.choices && !descriptor.choices.includes(trimmed)) {
-      return {
-        ok: false,
-        error: {
-          message: `Config set ${descriptor.key} must be one of ${descriptor.choices.join("|")}, got "${rawValue}"`
-        }
-      };
-    }
-    return { ok: true, parsed: { descriptor, value: trimmed } };
-  }
+  return { ok: true, parsed: { descriptor, value: trimmed } };
+}
+function parseFiniteNestedNumber(descriptor, rawValue, trimmed) {
   if (trimmed.length === 0) {
     return {
       ok: false,
@@ -301,39 +297,65 @@ function parseNestedSettingValue(descriptor, rawValue) {
       error: { message: `Config set ${descriptor.key} requires a finite number, got "${rawValue}"` }
     };
   }
-  if (descriptor.kind === "integer") {
-    if (!Number.isInteger(parsed) || parsed < 0) {
-      return {
-        ok: false,
-        error: { message: `Config set ${descriptor.key} requires a non-negative integer, got "${rawValue}"` }
-      };
-    }
-    if (descriptor.min !== void 0 && parsed < descriptor.min) {
-      return {
-        ok: false,
-        error: {
-          message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got "${rawValue}" (the runtime silently ignores 0 here and falls back to the default)`
-        }
-      };
-    }
-    return { ok: true, parsed: { descriptor, value: parsed } };
+  return { ok: true, value: parsed };
+}
+function parseNestedIntegerValue(descriptor, rawValue, value) {
+  if (!Number.isInteger(value) || value < 0) {
+    return {
+      ok: false,
+      error: { message: `Config set ${descriptor.key} requires a non-negative integer, got "${rawValue}"` }
+    };
   }
-  if (descriptor.kind === "ratio") {
-    if (parsed < 0 || parsed > 1) {
-      return {
-        ok: false,
-        error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got "${rawValue}"` }
-      };
-    }
-    return { ok: true, parsed: { descriptor, value: parsed } };
+  if (descriptor.min !== void 0 && value < descriptor.min) {
+    return {
+      ok: false,
+      error: {
+        message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got "${rawValue}" (the runtime silently ignores 0 here and falls back to the default)`
+      }
+    };
   }
-  if (descriptor.min !== void 0 && parsed < descriptor.min) {
+  return { ok: true, parsed: { descriptor, value } };
+}
+function parseNestedRatioValue(descriptor, rawValue, value) {
+  if (value < 0 || value > 1) {
+    return {
+      ok: false,
+      error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got "${rawValue}"` }
+    };
+  }
+  return { ok: true, parsed: { descriptor, value } };
+}
+function parseNestedNumberValue(descriptor, rawValue, value) {
+  if (descriptor.min !== void 0 && value < descriptor.min) {
     return {
       ok: false,
       error: { message: `Config set ${descriptor.key} requires a number >= ${descriptor.min}, got "${rawValue}"` }
     };
   }
-  return { ok: true, parsed: { descriptor, value: parsed } };
+  return { ok: true, parsed: { descriptor, value } };
+}
+function parseNestedSettingValue(descriptor, rawValue) {
+  if (typeof rawValue !== "string") {
+    return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };
+  }
+  const trimmed = rawValue.trim();
+  if (descriptor.kind === "boolean") {
+    return parseNestedBooleanValue(descriptor, rawValue);
+  }
+  if (descriptor.kind === "string") {
+    return parseNestedStringValue(descriptor, rawValue, trimmed);
+  }
+  const parsed = parseFiniteNestedNumber(descriptor, rawValue, trimmed);
+  if (!parsed.ok) {
+    return { ok: false, error: parsed.error };
+  }
+  if (descriptor.kind === "integer") {
+    return parseNestedIntegerValue(descriptor, rawValue, parsed.value);
+  }
+  if (descriptor.kind === "ratio") {
+    return parseNestedRatioValue(descriptor, rawValue, parsed.value);
+  }
+  return parseNestedNumberValue(descriptor, rawValue, parsed.value);
 }
 function readNestedSettingValue(settings, descriptor) {
   const segments = descriptor.path.split(".");
@@ -379,4 +401,4 @@ export {
   readNestedSettingValue,
   writeNestedSettingValue
 };
-//# sourceMappingURL=chunk-VZDBVEZR.js.map
+//# sourceMappingURL=chunk-B4O5S7I3.js.map

package/dist/cli-bundle/chunks/{chunk-VZDBVEZR.js.map → chunk-B4O5S7I3.js.map}

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../../../core/config/nested-settings.ts"],
-  "sourcesContent": ["/**\n * Nested leaf settings exposed via `pm config <scope> set/get <key> <value>`.\n *\n * These are simple string/number leaves of {@link PmSettings} (provider URLs,\n * vector-store adapter, search tuning) that previously required hand-editing\n * `.agents/pm/settings.json`. They live here so the same dotted path is\n * documented in one place and surfaced both to the config dispatcher and to\n * `pm config list` (so `pm config list --json` is discoverable).\n *\n * Shape conventions:\n * - `path` is the dotted JSON path in {@link PmSettings} (e.g. `search.provider`).\n * - `kind` is the value shape: \"string\" | \"boolean\" | \"integer\" | \"number\" | \"ratio\"\n *   - \"ratio\" must be a finite number in [0, 1].\n *   - \"integer\" must be a finite non-negative integer. Set `min: 1` for keys\n *     where the runtime silently falls back when 0 is supplied (e.g. batch\n *     size, timeout, max-results limits).\n *   - \"number\" must be a finite number — negatives ARE allowed (e.g. score\n *     thresholds may legitimately be negative when a provider normalizes\n *     scores into a signed range).\n *\n * Adding a key here makes it acceptable to `pm config <scope> set <key> <value>`\n * with no other code changes — the dispatcher walks the dotted path on the\n * already-validated PmSettings shape.\n */\n\n/** Supported coercion shapes for nested settings exposed through `pm config`. */\nexport type NestedSettingKind = \"string\" | \"boolean\" | \"integer\" | \"number\" | \"ratio\";\n\n/**\n * Documents the nested setting descriptor payload exchanged by command, SDK, and package integrations.\n */\nexport interface NestedSettingDescriptor {\n  /** CLI key (snake_case). Kebab-case form is accepted by normalizing `-` → `_`. */\n  key: string;\n  /** Dotted JSON path in PmSettings. */\n  path: string;\n  /** Value shape. */\n  kind: NestedSettingKind;\n  /** Short human-facing summary for `pm config list`. */\n  summary: string;\n  /** Optional accepted values for string settings. */\n  choices?: readonly string[];\n  /** Require a non-empty trimmed string value for string settings. */\n  non_empty?: boolean;\n  /**\n   * Optional minimum value for `integer` / `number` kinds. When set,\n   * `parseNestedSettingValue` rejects values strictly below `min`. Useful for\n   * settings where 0 would be silently ignored by the runtime (batch sizes,\n   * timeouts, max-results limits).\n   */\n  min?: number;\n}\n\n/**\n * Search/provider/vector-store leaves. Order is the display order in\n * `pm config list` and in error hints.\n */\nexport const NESTED_SETTING_DESCRIPTORS: readonly NestedSettingDescriptor[] = [\n  {\n    key: \"search_provider\",\n    path: \"search.provider\",\n    kind: \"string\",\n    summary: \"Search embedding provider name (e.g. openai, ollama, or an extension provider).\",\n  },\n  {\n    key: \"search_mutation_refresh_policy\",\n    path: \"search.mutation_refresh_policy\",\n    kind: \"string\",\n    choices: [\"cache_only\", \"semantic_configured\", \"semantic_auto\"],\n    summary: \"Mutation-time search refresh policy: cache_only, semantic_configured, or semantic_auto.\",\n  },\n  {\n    key: \"search_query_expansion_enabled\",\n    path: \"search.query_expansion.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable or disable query expansion for semantic/hybrid search.\",\n  },\n  {\n    key: \"search_query_expansion_provider\",\n    path: \"search.query_expansion.provider\",\n    kind: \"string\",\n    summary: \"Query expansion provider name (built-in openai/ollama or extension provider).\",\n  },\n  {\n    key: \"search_rerank_enabled\",\n    path: \"search.rerank.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable or disable post-retrieval reranking for hybrid search.\",\n  },\n  {\n    key: \"search_rerank_model\",\n    path: \"search.rerank.model\",\n    kind: \"string\",\n    summary: \"Rerank model name override used by built-in providers.\",\n  },\n  {\n    key: \"search_rerank_top_k\",\n    path: \"search.rerank.top_k\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Number of top hybrid candidates to rerank when rerank is enabled.\",\n  },\n  {\n    key: \"search_embedding_model\",\n    path: \"search.embedding_model\",\n    kind: \"string\",\n    summary: \"Default embedding model name (overrides provider-specific model when set).\",\n  },\n  {\n    key: \"search_embedding_corpus_max_characters\",\n    path: \"search.embedding_corpus_max_characters\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Maximum semantic corpus characters per item before truncation.\",\n  },\n  {\n    key: \"search_embedding_batch_size\",\n    path: \"search.embedding_batch_size\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Number of items embedded per request batch.\",\n  },\n  {\n    key: \"search_embedding_timeout_ms\",\n    path: \"search.embedding_timeout_ms\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Per-request embedding timeout in milliseconds.\",\n  },\n  {\n    key: \"search_score_threshold\",\n    path: \"search.score_threshold\",\n    kind: \"number\",\n    summary: \"Minimum score for a hit to be returned (0 keeps all matches).\",\n  },\n  {\n    key: \"search_hybrid_semantic_weight\",\n    path: \"search.hybrid_semantic_weight\",\n    kind: \"ratio\",\n    summary: \"Hybrid mode semantic weight in [0, 1] (1-weight goes to keyword).\",\n  },\n  {\n    key: \"search_max_results\",\n    path: \"search.max_results\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Default upper bound on search hits when --limit is not supplied.\",\n  },\n  {\n    key: \"search_bm25_k1\",\n    path: \"search.bm25.k1\",\n    kind: \"number\",\n    min: 0,\n    summary: \"Offline BM25 term-frequency saturation (k1); higher saturates repeated terms slower (default 1.2).\",\n  },\n  {\n    key: \"search_bm25_b\",\n    path: \"search.bm25.b\",\n    kind: \"ratio\",\n    summary: \"Offline BM25 document-length normalization (b) in [0, 1]; 0 disables, 1 fully normalizes (default 0.75).\",\n  },\n  {\n    key: \"openai_base_url\",\n    path: \"providers.openai.base_url\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible API base URL (LM Studio/vLLM also use this).\",\n  },\n  {\n    key: \"openai_api_key\",\n    path: \"providers.openai.api_key\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible API key.\",\n  },\n  {\n    key: \"openai_model\",\n    path: \"providers.openai.model\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible embedding model name.\",\n  },\n  {\n    key: \"ollama_base_url\",\n    path: \"providers.ollama.base_url\",\n    kind: \"string\",\n    summary: \"Ollama API base URL (typically http://localhost:11434).\",\n  },\n  {\n    key: \"ollama_model\",\n    path: \"providers.ollama.model\",\n    kind: \"string\",\n    summary: \"Ollama embedding model name (e.g. nomic-embed-text).\",\n  },\n  {\n    key: \"vector_store_adapter\",\n    path: \"vector_store.adapter\",\n    kind: \"string\",\n    summary: \"Vector store adapter name (lancedb, qdrant, or an extension adapter).\",\n  },\n  {\n    key: \"vector_store_collection_name\",\n    path: \"vector_store.collection_name\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Vector collection/table name shared by Qdrant and LanceDB adapters.\",\n  },\n  {\n    key: \"qdrant_url\",\n    path: \"vector_store.qdrant.url\",\n    kind: \"string\",\n    summary: \"Qdrant HTTP API URL.\",\n  },\n  {\n    key: \"qdrant_api_key\",\n    path: \"vector_store.qdrant.api_key\",\n    kind: \"string\",\n    summary: \"Qdrant API key (empty if running unauthenticated).\",\n  },\n  {\n    key: \"lancedb_path\",\n    path: \"vector_store.lancedb.path\",\n    kind: \"string\",\n    summary: \"LanceDB storage path (relative to pm root or absolute).\",\n  },\n  // General workspace leaves (id/author/output/locks/schema governance). These\n  // are documented user-facing settings in CONFIGURATION.md that previously\n  // required hand-editing settings.json.\n  {\n    key: \"id_prefix\",\n    path: \"id_prefix\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Prefix for generated item IDs (e.g. \\\"pm\\\" produces pm-xxxx).\",\n  },\n  {\n    key: \"author_default\",\n    path: \"author_default\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Default author recorded on mutations when --author is not supplied.\",\n  },\n  {\n    key: \"output_default_format\",\n    path: \"output.default_format\",\n    kind: \"string\",\n    choices: [\"toon\", \"json\"],\n    summary: \"Default output format for commands that support it: toon or json.\",\n  },\n  {\n    key: \"locks_ttl_seconds\",\n    path: \"locks.ttl_seconds\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Claim/lock time-to-live in seconds before a stale lock can be reclaimed.\",\n  },\n  {\n    key: \"checkpoints_retention_days\",\n    path: \"checkpoints.retention_days\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Age in days above which pm gc --scope checkpoints prunes bulk-mutation rollback checkpoints.\",\n  },\n  {\n    key: \"schema_unknown_field_policy\",\n    path: \"schema.unknown_field_policy\",\n    kind: \"string\",\n    choices: [\"allow\", \"warn\", \"reject\"],\n    summary: \"How item I/O handles metadata keys not in the field registry: allow, warn, or reject.\",\n  },\n  // History compaction policy leaves (pm health advisory + pm history-compact\n  // bulk-sweep default threshold). Disabled by default; enabling makes large\n  // streams discoverable without a manual stats pass.\n  {\n    key: \"history_compact_policy_enabled\",\n    path: \"history.compact_policy.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable the history-compaction advisory: pm health warns on over-threshold streams.\",\n  },\n  {\n    key: \"history_compact_policy_max_entries\",\n    path: \"history.compact_policy.max_entries\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Entry count above which a history stream is flagged (and the default pm history-compact --all-over threshold).\",\n  },\n  {\n    key: \"history_compact_policy_trigger\",\n    path: \"history.compact_policy.trigger\",\n    kind: \"string\",\n    choices: [\"health_warn\", \"auto\"],\n    summary: \"History-compaction policy intent: health_warn (advisory only) or auto (scheduled sweeps expected).\",\n  },\n];\n\nconst DESCRIPTOR_BY_KEY: ReadonlyMap<string, NestedSettingDescriptor> = new Map(\n  NESTED_SETTING_DESCRIPTORS.map((descriptor) => [descriptor.key, descriptor]),\n);\n\n/**\n * Map a raw user-supplied key (kebab or snake case, any casing) onto a known\n * nested-leaf descriptor. Returns `undefined` when the key is not a nested\n * leaf (callers can then fall back to the regular ConfigKey path).\n */\nexport function resolveNestedSettingDescriptor(raw: string | undefined): NestedSettingDescriptor | undefined {\n  if (typeof raw !== \"string\") {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase().replaceAll(\"-\", \"_\");\n  if (normalized.length === 0) {\n    return undefined;\n  }\n  return DESCRIPTOR_BY_KEY.get(normalized);\n}\n\n/** Recoverable parsed value with the descriptor it satisfied. */\nexport interface NestedSettingParsedValue {\n  descriptor: NestedSettingDescriptor;\n  value: string | number | boolean;\n}\n\n/** Throwable validation error returned as a structured result. */\nexport interface NestedSettingParseError {\n  message: string;\n}\n\n/**\n * Restricts nested setting parse result values accepted by command, SDK, and storage contracts.\n */\nexport type NestedSettingParseResult =\n  | { ok: true; parsed: NestedSettingParsedValue }\n  | { ok: false; error: NestedSettingParseError };\n\n/**\n * Validate and coerce a raw string value for a nested-leaf setting. The\n * returned value is the typed leaf that should be written into PmSettings.\n *\n * Empty strings are allowed for \"string\" leaves unless `non_empty` is set.\n */\nexport function parseNestedSettingValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n): NestedSettingParseResult {\n  if (typeof rawValue !== \"string\") {\n    return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };\n  }\n  const trimmed = rawValue.trim();\n  if (descriptor.kind === \"boolean\") {\n    const normalized = trimmed.toLowerCase();\n    if (normalized === \"true\" || normalized === \"1\" || normalized === \"yes\" || normalized === \"on\") {\n      return { ok: true, parsed: { descriptor, value: true } };\n    }\n    if (normalized === \"false\" || normalized === \"0\" || normalized === \"no\" || normalized === \"off\") {\n      return { ok: true, parsed: { descriptor, value: false } };\n    }\n    return {\n      ok: false,\n      error: {\n        message: `Config set ${descriptor.key} requires a boolean value (true|false), got \"${rawValue}\"`,\n      },\n    };\n  }\n  if (descriptor.kind === \"string\") {\n    if (descriptor.non_empty === true && trimmed.length === 0) {\n      return {\n        ok: false,\n        error: { message: `Config set ${descriptor.key} requires a non-empty value` },\n      };\n    }\n    if (descriptor.choices && !descriptor.choices.includes(trimmed)) {\n      return {\n        ok: false,\n        error: {\n          message: `Config set ${descriptor.key} must be one of ${descriptor.choices.join(\"|\")}, got \"${rawValue}\"`,\n        },\n      };\n    }\n    return { ok: true, parsed: { descriptor, value: trimmed } };\n  }\n\n  // Number(\"\") === 0, which would silently accept empty / whitespace-only input\n  // as a valid zero. Reject explicitly so misconfigurations don't slip through.\n  if (trimmed.length === 0) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a non-empty value` },\n    };\n  }\n\n  const parsed = Number(trimmed);\n  if (!Number.isFinite(parsed)) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a finite number, got \"${rawValue}\"` },\n    };\n  }\n  if (descriptor.kind === \"integer\") {\n    if (!Number.isInteger(parsed) || parsed < 0) {\n      return {\n        ok: false,\n        error: { message: `Config set ${descriptor.key} requires a non-negative integer, got \"${rawValue}\"` },\n      };\n    }\n    if (descriptor.min !== undefined && parsed < descriptor.min) {\n      return {\n        ok: false,\n        error: {\n          message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got \"${rawValue}\" (the runtime silently ignores 0 here and falls back to the default)`,\n        },\n      };\n    }\n    return { ok: true, parsed: { descriptor, value: parsed } };\n  }\n  if (descriptor.kind === \"ratio\") {\n    if (parsed < 0 || parsed > 1) {\n      return {\n        ok: false,\n        error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got \"${rawValue}\"` },\n      };\n    }\n    return { ok: true, parsed: { descriptor, value: parsed } };\n  }\n  // kind === \"number\" — negatives are allowed; only apply an explicit `min`.\n  if (descriptor.min !== undefined && parsed < descriptor.min) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a number >= ${descriptor.min}, got \"${rawValue}\"` },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value: parsed } };\n}\n\n/** Walk a dotted path on an arbitrary record (best-effort, returns null on miss). */\nexport function readNestedSettingValue(\n  settings: unknown,\n  descriptor: NestedSettingDescriptor,\n): string | number | boolean | null {\n  const segments = descriptor.path.split(\".\");\n  let cursor: unknown = settings;\n  for (const segment of segments) {\n    if (typeof cursor !== \"object\" || cursor === null) {\n      return null;\n    }\n    cursor = (cursor as Record<string, unknown>)[segment];\n  }\n  if (typeof cursor === \"string\" || typeof cursor === \"number\" || typeof cursor === \"boolean\") {\n    return cursor;\n  }\n  return null;\n}\n\n/**\n * Set a leaf value on a settings object by walking the descriptor's dotted\n * path. Missing intermediate objects are created. Returns `true` when the\n * value actually changed.\n */\nexport function writeNestedSettingValue(\n  settings: Record<string, unknown>,\n  descriptor: NestedSettingDescriptor,\n  value: string | number | boolean,\n): boolean {\n  const segments = descriptor.path.split(\".\");\n  let cursor: Record<string, unknown> = settings;\n  for (let index = 0; index < segments.length - 1; index += 1) {\n    const segment = segments[index];\n    const existing = cursor[segment];\n    if (typeof existing !== \"object\" || existing === null || Array.isArray(existing)) {\n      const next: Record<string, unknown> = {};\n      cursor[segment] = next;\n      cursor = next;\n    } else {\n      cursor = existing as Record<string, unknown>;\n    }\n  }\n  const leafKey = segments[segments.length - 1];\n  const previous = cursor[leafKey];\n  if (previous === value) {\n    return false;\n  }\n  cursor[leafKey] = value;\n  return true;\n}\n"],
-  "mappings": ";;;;;;;;AAyDO,IAAM,6BAAiE;EAC5E;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS,CAAC,cAAc,uBAAuB,eAAe;IAC9D,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,WAAW;IACX,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;;;;EAKX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,WAAW;IACX,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,WAAW;IACX,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS,CAAC,QAAQ,MAAM;IACxB,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS,CAAC,SAAS,QAAQ,QAAQ;IACnC,SAAS;;;;;EAKX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS,CAAC,eAAe,MAAM;IAC/B,SAAS;;;AAIb,IAAM,oBAAkE,IAAI,IAC1E,2BAA2B,IAAI,CAAC,eAAe,CAAC,WAAW,KAAK,UAAU,CAAC,CAAC;AAQxE,SAAU,+BAA+B,KAAuB;AACpE,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW,EAAG,WAAW,KAAK,GAAG;AAC/D,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,SAAO,kBAAkB,IAAI,UAAU;AACzC;AA0BM,SAAU,wBACd,YACA,UAAgB;AAEhB,MAAI,OAAO,aAAa,UAAU;AAChC,WAAO,EAAE,IAAI,OAAO,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,2BAA0B,EAAE;EAChG;AACA,QAAM,UAAU,SAAS,KAAI;AAC7B,MAAI,WAAW,SAAS,WAAW;AACjC,UAAM,aAAa,QAAQ,YAAW;AACtC,QAAI,eAAe,UAAU,eAAe,OAAO,eAAe,SAAS,eAAe,MAAM;AAC9F,aAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,KAAI,EAAE;IACxD;AACA,QAAI,eAAe,WAAW,eAAe,OAAO,eAAe,QAAQ,eAAe,OAAO;AAC/F,aAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,MAAK,EAAE;IACzD;AACA,WAAO;MACL,IAAI;MACJ,OAAO;QACL,SAAS,cAAc,WAAW,GAAG,gDAAgD,QAAQ;;;EAGnG;AACA,MAAI,WAAW,SAAS,UAAU;AAChC,QAAI,WAAW,cAAc,QAAQ,QAAQ,WAAW,GAAG;AACzD,aAAO;QACL,IAAI;QACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,8BAA6B;;IAE/E;AACA,QAAI,WAAW,WAAW,CAAC,WAAW,QAAQ,SAAS,OAAO,GAAG;AAC/D,aAAO;QACL,IAAI;QACJ,OAAO;UACL,SAAS,cAAc,WAAW,GAAG,mBAAmB,WAAW,QAAQ,KAAK,GAAG,CAAC,UAAU,QAAQ;;;IAG5G;AACA,WAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,QAAO,EAAE;EAC3D;AAIA,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,8BAA6B;;EAE/E;AAEA,QAAM,SAAS,OAAO,OAAO;AAC7B,MAAI,CAAC,OAAO,SAAS,MAAM,GAAG;AAC5B,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,mCAAmC,QAAQ,IAAG;;EAEhG;AACA,MAAI,WAAW,SAAS,WAAW;AACjC,QAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,GAAG;AAC3C,aAAO;QACL,IAAI;QACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,0CAA0C,QAAQ,IAAG;;IAEvG;AACA,QAAI,WAAW,QAAQ,UAAa,SAAS,WAAW,KAAK;AAC3D,aAAO;QACL,IAAI;QACJ,OAAO;UACL,SAAS,cAAc,WAAW,GAAG,2BAA2B,WAAW,GAAG,UAAU,QAAQ;;;IAGtG;AACA,WAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,OAAM,EAAE;EAC1D;AACA,MAAI,WAAW,SAAS,SAAS;AAC/B,QAAI,SAAS,KAAK,SAAS,GAAG;AAC5B,aAAO;QACL,IAAI;QACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,sCAAsC,QAAQ,IAAG;;IAEnG;AACA,WAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,OAAM,EAAE;EAC1D;AAEA,MAAI,WAAW,QAAQ,UAAa,SAAS,WAAW,KAAK;AAC3D,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,yBAAyB,WAAW,GAAG,UAAU,QAAQ,IAAG;;EAE9G;AACA,SAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,OAAM,EAAE;AAC1D;AAGM,SAAU,uBACd,UACA,YAAmC;AAEnC,QAAM,WAAW,WAAW,KAAK,MAAM,GAAG;AAC1C,MAAI,SAAkB;AACtB,aAAW,WAAW,UAAU;AAC9B,QAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,aAAO;IACT;AACA,aAAU,OAAmC,OAAO;EACtD;AACA,MAAI,OAAO,WAAW,YAAY,OAAO,WAAW,YAAY,OAAO,WAAW,WAAW;AAC3F,WAAO;EACT;AACA,SAAO;AACT;AAOM,SAAU,wBACd,UACA,YACA,OAAgC;AAEhC,QAAM,WAAW,WAAW,KAAK,MAAM,GAAG;AAC1C,MAAI,SAAkC;AACtC,WAAS,QAAQ,GAAG,QAAQ,SAAS,SAAS,GAAG,SAAS,GAAG;AAC3D,UAAM,UAAU,SAAS,KAAK;AAC9B,UAAM,WAAW,OAAO,OAAO;AAC/B,QAAI,OAAO,aAAa,YAAY,aAAa,QAAQ,MAAM,QAAQ,QAAQ,GAAG;AAChF,YAAM,OAAgC,CAAA;AACtC,aAAO,OAAO,IAAI;AAClB,eAAS;IACX,OAAO;AACL,eAAS;IACX;EACF;AACA,QAAM,UAAU,SAAS,SAAS,SAAS,CAAC;AAC5C,QAAM,WAAW,OAAO,OAAO;AAC/B,MAAI,aAAa,OAAO;AACtB,WAAO;EACT;AACA,SAAO,OAAO,IAAI;AAClB,SAAO;AACT;",
+  "sourcesContent": ["/**\n * Nested leaf settings exposed via `pm config <scope> set/get <key> <value>`.\n *\n * These are simple string/number leaves of {@link PmSettings} (provider URLs,\n * vector-store adapter, search tuning) that previously required hand-editing\n * `.agents/pm/settings.json`. They live here so the same dotted path is\n * documented in one place and surfaced both to the config dispatcher and to\n * `pm config list` (so `pm config list --json` is discoverable).\n *\n * Shape conventions:\n * - `path` is the dotted JSON path in {@link PmSettings} (e.g. `search.provider`).\n * - `kind` is the value shape: \"string\" | \"boolean\" | \"integer\" | \"number\" | \"ratio\"\n *   - \"ratio\" must be a finite number in [0, 1].\n *   - \"integer\" must be a finite non-negative integer. Set `min: 1` for keys\n *     where the runtime silently falls back when 0 is supplied (e.g. batch\n *     size, timeout, max-results limits).\n *   - \"number\" must be a finite number — negatives ARE allowed (e.g. score\n *     thresholds may legitimately be negative when a provider normalizes\n *     scores into a signed range).\n *\n * Adding a key here makes it acceptable to `pm config <scope> set <key> <value>`\n * with no other code changes — the dispatcher walks the dotted path on the\n * already-validated PmSettings shape.\n */\n\n/** Supported coercion shapes for nested settings exposed through `pm config`. */\nexport type NestedSettingKind = \"string\" | \"boolean\" | \"integer\" | \"number\" | \"ratio\";\n\n/**\n * Documents the nested setting descriptor payload exchanged by command, SDK, and package integrations.\n */\nexport interface NestedSettingDescriptor {\n  /** CLI key (snake_case). Kebab-case form is accepted by normalizing `-` → `_`. */\n  key: string;\n  /** Dotted JSON path in PmSettings. */\n  path: string;\n  /** Value shape. */\n  kind: NestedSettingKind;\n  /** Short human-facing summary for `pm config list`. */\n  summary: string;\n  /** Optional accepted values for string settings. */\n  choices?: readonly string[];\n  /** Require a non-empty trimmed string value for string settings. */\n  non_empty?: boolean;\n  /**\n   * Optional minimum value for `integer` / `number` kinds. When set,\n   * `parseNestedSettingValue` rejects values strictly below `min`. Useful for\n   * settings where 0 would be silently ignored by the runtime (batch sizes,\n   * timeouts, max-results limits).\n   */\n  min?: number;\n}\n\n/**\n * Search/provider/vector-store leaves. Order is the display order in\n * `pm config list` and in error hints.\n */\nexport const NESTED_SETTING_DESCRIPTORS: readonly NestedSettingDescriptor[] = [\n  {\n    key: \"search_provider\",\n    path: \"search.provider\",\n    kind: \"string\",\n    summary: \"Search embedding provider name (e.g. openai, ollama, or an extension provider).\",\n  },\n  {\n    key: \"search_mutation_refresh_policy\",\n    path: \"search.mutation_refresh_policy\",\n    kind: \"string\",\n    choices: [\"cache_only\", \"semantic_configured\", \"semantic_auto\"],\n    summary: \"Mutation-time search refresh policy: cache_only, semantic_configured, or semantic_auto.\",\n  },\n  {\n    key: \"search_query_expansion_enabled\",\n    path: \"search.query_expansion.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable or disable query expansion for semantic/hybrid search.\",\n  },\n  {\n    key: \"search_query_expansion_provider\",\n    path: \"search.query_expansion.provider\",\n    kind: \"string\",\n    summary: \"Query expansion provider name (built-in openai/ollama or extension provider).\",\n  },\n  {\n    key: \"search_rerank_enabled\",\n    path: \"search.rerank.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable or disable post-retrieval reranking for hybrid search.\",\n  },\n  {\n    key: \"search_rerank_model\",\n    path: \"search.rerank.model\",\n    kind: \"string\",\n    summary: \"Rerank model name override used by built-in providers.\",\n  },\n  {\n    key: \"search_rerank_top_k\",\n    path: \"search.rerank.top_k\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Number of top hybrid candidates to rerank when rerank is enabled.\",\n  },\n  {\n    key: \"search_embedding_model\",\n    path: \"search.embedding_model\",\n    kind: \"string\",\n    summary: \"Default embedding model name (overrides provider-specific model when set).\",\n  },\n  {\n    key: \"search_embedding_corpus_max_characters\",\n    path: \"search.embedding_corpus_max_characters\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Maximum semantic corpus characters per item before truncation.\",\n  },\n  {\n    key: \"search_embedding_batch_size\",\n    path: \"search.embedding_batch_size\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Number of items embedded per request batch.\",\n  },\n  {\n    key: \"search_embedding_timeout_ms\",\n    path: \"search.embedding_timeout_ms\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Per-request embedding timeout in milliseconds.\",\n  },\n  {\n    key: \"search_score_threshold\",\n    path: \"search.score_threshold\",\n    kind: \"number\",\n    summary: \"Minimum score for a hit to be returned (0 keeps all matches).\",\n  },\n  {\n    key: \"search_hybrid_semantic_weight\",\n    path: \"search.hybrid_semantic_weight\",\n    kind: \"ratio\",\n    summary: \"Hybrid mode semantic weight in [0, 1] (1-weight goes to keyword).\",\n  },\n  {\n    key: \"search_max_results\",\n    path: \"search.max_results\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Default upper bound on search hits when --limit is not supplied.\",\n  },\n  {\n    key: \"search_bm25_k1\",\n    path: \"search.bm25.k1\",\n    kind: \"number\",\n    min: 0,\n    summary: \"Offline BM25 term-frequency saturation (k1); higher saturates repeated terms slower (default 1.2).\",\n  },\n  {\n    key: \"search_bm25_b\",\n    path: \"search.bm25.b\",\n    kind: \"ratio\",\n    summary: \"Offline BM25 document-length normalization (b) in [0, 1]; 0 disables, 1 fully normalizes (default 0.75).\",\n  },\n  {\n    key: \"openai_base_url\",\n    path: \"providers.openai.base_url\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible API base URL (LM Studio/vLLM also use this).\",\n  },\n  {\n    key: \"openai_api_key\",\n    path: \"providers.openai.api_key\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible API key.\",\n  },\n  {\n    key: \"openai_model\",\n    path: \"providers.openai.model\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible embedding model name.\",\n  },\n  {\n    key: \"ollama_base_url\",\n    path: \"providers.ollama.base_url\",\n    kind: \"string\",\n    summary: \"Ollama API base URL (typically http://localhost:11434).\",\n  },\n  {\n    key: \"ollama_model\",\n    path: \"providers.ollama.model\",\n    kind: \"string\",\n    summary: \"Ollama embedding model name (e.g. nomic-embed-text).\",\n  },\n  {\n    key: \"vector_store_adapter\",\n    path: \"vector_store.adapter\",\n    kind: \"string\",\n    summary: \"Vector store adapter name (lancedb, qdrant, or an extension adapter).\",\n  },\n  {\n    key: \"vector_store_collection_name\",\n    path: \"vector_store.collection_name\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Vector collection/table name shared by Qdrant and LanceDB adapters.\",\n  },\n  {\n    key: \"qdrant_url\",\n    path: \"vector_store.qdrant.url\",\n    kind: \"string\",\n    summary: \"Qdrant HTTP API URL.\",\n  },\n  {\n    key: \"qdrant_api_key\",\n    path: \"vector_store.qdrant.api_key\",\n    kind: \"string\",\n    summary: \"Qdrant API key (empty if running unauthenticated).\",\n  },\n  {\n    key: \"lancedb_path\",\n    path: \"vector_store.lancedb.path\",\n    kind: \"string\",\n    summary: \"LanceDB storage path (relative to pm root or absolute).\",\n  },\n  // General workspace leaves (id/author/output/locks/schema governance). These\n  // are documented user-facing settings in CONFIGURATION.md that previously\n  // required hand-editing settings.json.\n  {\n    key: \"id_prefix\",\n    path: \"id_prefix\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Prefix for generated item IDs (e.g. \\\"pm\\\" produces pm-xxxx).\",\n  },\n  {\n    key: \"author_default\",\n    path: \"author_default\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Default author recorded on mutations when --author is not supplied.\",\n  },\n  {\n    key: \"output_default_format\",\n    path: \"output.default_format\",\n    kind: \"string\",\n    choices: [\"toon\", \"json\"],\n    summary: \"Default output format for commands that support it: toon or json.\",\n  },\n  {\n    key: \"locks_ttl_seconds\",\n    path: \"locks.ttl_seconds\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Claim/lock time-to-live in seconds before a stale lock can be reclaimed.\",\n  },\n  {\n    key: \"checkpoints_retention_days\",\n    path: \"checkpoints.retention_days\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Age in days above which pm gc --scope checkpoints prunes bulk-mutation rollback checkpoints.\",\n  },\n  {\n    key: \"schema_unknown_field_policy\",\n    path: \"schema.unknown_field_policy\",\n    kind: \"string\",\n    choices: [\"allow\", \"warn\", \"reject\"],\n    summary: \"How item I/O handles metadata keys not in the field registry: allow, warn, or reject.\",\n  },\n  // History compaction policy leaves (pm health advisory + pm history-compact\n  // bulk-sweep default threshold). Disabled by default; enabling makes large\n  // streams discoverable without a manual stats pass.\n  {\n    key: \"history_compact_policy_enabled\",\n    path: \"history.compact_policy.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable the history-compaction advisory: pm health warns on over-threshold streams.\",\n  },\n  {\n    key: \"history_compact_policy_max_entries\",\n    path: \"history.compact_policy.max_entries\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Entry count above which a history stream is flagged (and the default pm history-compact --all-over threshold).\",\n  },\n  {\n    key: \"history_compact_policy_trigger\",\n    path: \"history.compact_policy.trigger\",\n    kind: \"string\",\n    choices: [\"health_warn\", \"auto\"],\n    summary: \"History-compaction policy intent: health_warn (advisory only) or auto (scheduled sweeps expected).\",\n  },\n];\n\nconst DESCRIPTOR_BY_KEY: ReadonlyMap<string, NestedSettingDescriptor> = new Map(\n  NESTED_SETTING_DESCRIPTORS.map((descriptor) => [descriptor.key, descriptor]),\n);\n\n/**\n * Map a raw user-supplied key (kebab or snake case, any casing) onto a known\n * nested-leaf descriptor. Returns `undefined` when the key is not a nested\n * leaf (callers can then fall back to the regular ConfigKey path).\n */\nexport function resolveNestedSettingDescriptor(raw: string | undefined): NestedSettingDescriptor | undefined {\n  if (typeof raw !== \"string\") {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase().replaceAll(\"-\", \"_\");\n  if (normalized.length === 0) {\n    return undefined;\n  }\n  return DESCRIPTOR_BY_KEY.get(normalized);\n}\n\n/** Recoverable parsed value with the descriptor it satisfied. */\nexport interface NestedSettingParsedValue {\n  descriptor: NestedSettingDescriptor;\n  value: string | number | boolean;\n}\n\n/** Throwable validation error returned as a structured result. */\nexport interface NestedSettingParseError {\n  message: string;\n}\n\n/**\n * Restricts nested setting parse result values accepted by command, SDK, and storage contracts.\n */\nexport type NestedSettingParseResult =\n  | { ok: true; parsed: NestedSettingParsedValue }\n  | { ok: false; error: NestedSettingParseError };\n\nfunction parseNestedBooleanValue(descriptor: NestedSettingDescriptor, rawValue: string): NestedSettingParseResult {\n  const normalized = rawValue.trim().toLowerCase();\n  if (normalized === \"true\" || normalized === \"1\" || normalized === \"yes\" || normalized === \"on\") {\n    return { ok: true, parsed: { descriptor, value: true } };\n  }\n  if (normalized === \"false\" || normalized === \"0\" || normalized === \"no\" || normalized === \"off\") {\n    return { ok: true, parsed: { descriptor, value: false } };\n  }\n  return {\n    ok: false,\n    error: {\n      message: `Config set ${descriptor.key} requires a boolean value (true|false), got \"${rawValue}\"`,\n    },\n  };\n}\n\nfunction parseNestedStringValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  trimmed: string,\n): NestedSettingParseResult {\n  if (descriptor.non_empty === true && trimmed.length === 0) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a non-empty value` },\n    };\n  }\n  if (descriptor.choices && !descriptor.choices.includes(trimmed)) {\n    return {\n      ok: false,\n      error: {\n        message: `Config set ${descriptor.key} must be one of ${descriptor.choices.join(\"|\")}, got \"${rawValue}\"`,\n      },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value: trimmed } };\n}\n\nfunction parseFiniteNestedNumber(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  trimmed: string,\n): { ok: true; value: number } | { ok: false; error: NestedSettingParseError } {\n  if (trimmed.length === 0) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a non-empty value` },\n    };\n  }\n  const parsed = Number(trimmed);\n  if (!Number.isFinite(parsed)) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a finite number, got \"${rawValue}\"` },\n    };\n  }\n  return { ok: true, value: parsed };\n}\n\nfunction parseNestedIntegerValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  value: number,\n): NestedSettingParseResult {\n  if (!Number.isInteger(value) || value < 0) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a non-negative integer, got \"${rawValue}\"` },\n    };\n  }\n  if (descriptor.min !== undefined && value < descriptor.min) {\n    return {\n      ok: false,\n      error: {\n        message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got \"${rawValue}\" (the runtime silently ignores 0 here and falls back to the default)`,\n      },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value } };\n}\n\nfunction parseNestedRatioValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  value: number,\n): NestedSettingParseResult {\n  if (value < 0 || value > 1) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got \"${rawValue}\"` },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value } };\n}\n\nfunction parseNestedNumberValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  value: number,\n): NestedSettingParseResult {\n  if (descriptor.min !== undefined && value < descriptor.min) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a number >= ${descriptor.min}, got \"${rawValue}\"` },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value } };\n}\n\n/**\n * Validate and coerce a raw string value for a nested-leaf setting. The\n * returned value is the typed leaf that should be written into PmSettings.\n *\n * Empty strings are allowed for \"string\" leaves unless `non_empty` is set.\n */\nexport function parseNestedSettingValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n): NestedSettingParseResult {\n  if (typeof rawValue !== \"string\") {\n    return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };\n  }\n  const trimmed = rawValue.trim();\n  if (descriptor.kind === \"boolean\") {\n    return parseNestedBooleanValue(descriptor, rawValue);\n  }\n  if (descriptor.kind === \"string\") {\n    return parseNestedStringValue(descriptor, rawValue, trimmed);\n  }\n\n  // Number(\"\") === 0, which would silently accept empty / whitespace-only input\n  // as a valid zero. Reject explicitly so misconfigurations don't slip through.\n  const parsed = parseFiniteNestedNumber(descriptor, rawValue, trimmed);\n  if (!parsed.ok) {\n    return { ok: false, error: parsed.error };\n  }\n  if (descriptor.kind === \"integer\") {\n    return parseNestedIntegerValue(descriptor, rawValue, parsed.value);\n  }\n  if (descriptor.kind === \"ratio\") {\n    return parseNestedRatioValue(descriptor, rawValue, parsed.value);\n  }\n  // kind === \"number\" — negatives are allowed; only apply an explicit `min`.\n  return parseNestedNumberValue(descriptor, rawValue, parsed.value);\n}\n\n/** Walk a dotted path on an arbitrary record (best-effort, returns null on miss). */\nexport function readNestedSettingValue(\n  settings: unknown,\n  descriptor: NestedSettingDescriptor,\n): string | number | boolean | null {\n  const segments = descriptor.path.split(\".\");\n  let cursor: unknown = settings;\n  for (const segment of segments) {\n    if (typeof cursor !== \"object\" || cursor === null) {\n      return null;\n    }\n    cursor = (cursor as Record<string, unknown>)[segment];\n  }\n  if (typeof cursor === \"string\" || typeof cursor === \"number\" || typeof cursor === \"boolean\") {\n    return cursor;\n  }\n  return null;\n}\n\n/**\n * Set a leaf value on a settings object by walking the descriptor's dotted\n * path. Missing intermediate objects are created. Returns `true` when the\n * value actually changed.\n */\nexport function writeNestedSettingValue(\n  settings: Record<string, unknown>,\n  descriptor: NestedSettingDescriptor,\n  value: string | number | boolean,\n): boolean {\n  const segments = descriptor.path.split(\".\");\n  let cursor: Record<string, unknown> = settings;\n  for (let index = 0; index < segments.length - 1; index += 1) {\n    const segment = segments[index];\n    const existing = cursor[segment];\n    if (typeof existing !== \"object\" || existing === null || Array.isArray(existing)) {\n      const next: Record<string, unknown> = {};\n      cursor[segment] = next;\n      cursor = next;\n    } else {\n      cursor = existing as Record<string, unknown>;\n    }\n  }\n  const leafKey = segments[segments.length - 1];\n  const previous = cursor[leafKey];\n  if (previous === value) {\n    return false;\n  }\n  cursor[leafKey] = value;\n  return true;\n}\n"],
+  "mappings": ";;;;;;;;AAyDO,IAAM,6BAAiE;EAC5E;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS,CAAC,cAAc,uBAAuB,eAAe;IAC9D,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,WAAW;IACX,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;;;;EAKX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,WAAW;IACX,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,WAAW;IACX,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS,CAAC,QAAQ,MAAM;IACxB,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS,CAAC,SAAS,QAAQ,QAAQ;IACnC,SAAS;;;;;EAKX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,SAAS;;EAEX;IACE,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS,CAAC,eAAe,MAAM;IAC/B,SAAS;;;AAIb,IAAM,oBAAkE,IAAI,IAC1E,2BAA2B,IAAI,CAAC,eAAe,CAAC,WAAW,KAAK,UAAU,CAAC,CAAC;AAQxE,SAAU,+BAA+B,KAAuB;AACpE,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;EACT;AACA,QAAM,aAAa,IAAI,KAAI,EAAG,YAAW,EAAG,WAAW,KAAK,GAAG;AAC/D,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;EACT;AACA,SAAO,kBAAkB,IAAI,UAAU;AACzC;AAoBA,SAAS,wBAAwB,YAAqC,UAAgB;AACpF,QAAM,aAAa,SAAS,KAAI,EAAG,YAAW;AAC9C,MAAI,eAAe,UAAU,eAAe,OAAO,eAAe,SAAS,eAAe,MAAM;AAC9F,WAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,KAAI,EAAE;EACxD;AACA,MAAI,eAAe,WAAW,eAAe,OAAO,eAAe,QAAQ,eAAe,OAAO;AAC/F,WAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,MAAK,EAAE;EACzD;AACA,SAAO;IACL,IAAI;IACJ,OAAO;MACL,SAAS,cAAc,WAAW,GAAG,gDAAgD,QAAQ;;;AAGnG;AAEA,SAAS,uBACP,YACA,UACA,SAAe;AAEf,MAAI,WAAW,cAAc,QAAQ,QAAQ,WAAW,GAAG;AACzD,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,8BAA6B;;EAE/E;AACA,MAAI,WAAW,WAAW,CAAC,WAAW,QAAQ,SAAS,OAAO,GAAG;AAC/D,WAAO;MACL,IAAI;MACJ,OAAO;QACL,SAAS,cAAc,WAAW,GAAG,mBAAmB,WAAW,QAAQ,KAAK,GAAG,CAAC,UAAU,QAAQ;;;EAG5G;AACA,SAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,OAAO,QAAO,EAAE;AAC3D;AAEA,SAAS,wBACP,YACA,UACA,SAAe;AAEf,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,8BAA6B;;EAE/E;AACA,QAAM,SAAS,OAAO,OAAO;AAC7B,MAAI,CAAC,OAAO,SAAS,MAAM,GAAG;AAC5B,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,mCAAmC,QAAQ,IAAG;;EAEhG;AACA,SAAO,EAAE,IAAI,MAAM,OAAO,OAAM;AAClC;AAEA,SAAS,wBACP,YACA,UACA,OAAa;AAEb,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AACzC,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,0CAA0C,QAAQ,IAAG;;EAEvG;AACA,MAAI,WAAW,QAAQ,UAAa,QAAQ,WAAW,KAAK;AAC1D,WAAO;MACL,IAAI;MACJ,OAAO;QACL,SAAS,cAAc,WAAW,GAAG,2BAA2B,WAAW,GAAG,UAAU,QAAQ;;;EAGtG;AACA,SAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,MAAK,EAAE;AAClD;AAEA,SAAS,sBACP,YACA,UACA,OAAa;AAEb,MAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,sCAAsC,QAAQ,IAAG;;EAEnG;AACA,SAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,MAAK,EAAE;AAClD;AAEA,SAAS,uBACP,YACA,UACA,OAAa;AAEb,MAAI,WAAW,QAAQ,UAAa,QAAQ,WAAW,KAAK;AAC1D,WAAO;MACL,IAAI;MACJ,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,yBAAyB,WAAW,GAAG,UAAU,QAAQ,IAAG;;EAE9G;AACA,SAAO,EAAE,IAAI,MAAM,QAAQ,EAAE,YAAY,MAAK,EAAE;AAClD;AAQM,SAAU,wBACd,YACA,UAAgB;AAEhB,MAAI,OAAO,aAAa,UAAU;AAChC,WAAO,EAAE,IAAI,OAAO,OAAO,EAAE,SAAS,cAAc,WAAW,GAAG,2BAA0B,EAAE;EAChG;AACA,QAAM,UAAU,SAAS,KAAI;AAC7B,MAAI,WAAW,SAAS,WAAW;AACjC,WAAO,wBAAwB,YAAY,QAAQ;EACrD;AACA,MAAI,WAAW,SAAS,UAAU;AAChC,WAAO,uBAAuB,YAAY,UAAU,OAAO;EAC7D;AAIA,QAAM,SAAS,wBAAwB,YAAY,UAAU,OAAO;AACpE,MAAI,CAAC,OAAO,IAAI;AACd,WAAO,EAAE,IAAI,OAAO,OAAO,OAAO,MAAK;EACzC;AACA,MAAI,WAAW,SAAS,WAAW;AACjC,WAAO,wBAAwB,YAAY,UAAU,OAAO,KAAK;EACnE;AACA,MAAI,WAAW,SAAS,SAAS;AAC/B,WAAO,sBAAsB,YAAY,UAAU,OAAO,KAAK;EACjE;AAEA,SAAO,uBAAuB,YAAY,UAAU,OAAO,KAAK;AAClE;AAGM,SAAU,uBACd,UACA,YAAmC;AAEnC,QAAM,WAAW,WAAW,KAAK,MAAM,GAAG;AAC1C,MAAI,SAAkB;AACtB,aAAW,WAAW,UAAU;AAC9B,QAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,aAAO;IACT;AACA,aAAU,OAAmC,OAAO;EACtD;AACA,MAAI,OAAO,WAAW,YAAY,OAAO,WAAW,YAAY,OAAO,WAAW,WAAW;AAC3F,WAAO;EACT;AACA,SAAO;AACT;AAOM,SAAU,wBACd,UACA,YACA,OAAgC;AAEhC,QAAM,WAAW,WAAW,KAAK,MAAM,GAAG;AAC1C,MAAI,SAAkC;AACtC,WAAS,QAAQ,GAAG,QAAQ,SAAS,SAAS,GAAG,SAAS,GAAG;AAC3D,UAAM,UAAU,SAAS,KAAK;AAC9B,UAAM,WAAW,OAAO,OAAO;AAC/B,QAAI,OAAO,aAAa,YAAY,aAAa,QAAQ,MAAM,QAAQ,QAAQ,GAAG;AAChF,YAAM,OAAgC,CAAA;AACtC,aAAO,OAAO,IAAI;AAClB,eAAS;IACX,OAAO;AACL,eAAS;IACX;EACF;AACA,QAAM,UAAU,SAAS,SAAS,SAAS,CAAC;AAC5C,QAAM,WAAW,OAAO,OAAO;AAC/B,MAAI,aAAa,OAAO;AACtB,WAAO;EACT;AACA,SAAO,OAAO,IAAI;AAClB,SAAO;AACT;",
   "names": []
 }

package/dist/cli-bundle/chunks/{chunk-OTUHB4HS.js → chunk-BE2SR6QL.js}

@@ -1,15 +1,15 @@
 
-!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]="7919579f-9834-5809-8c55-f7618807569e")}catch(e){}}();
+!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]="c47d06d6-06dd-59ff-bc33-96613e4fdde4")}catch(e){}}();
 import {
   verifyHistoryChain
-} from "./chunk-SLMUGTK3.js";
+} from "./chunk-7CLLC75T.js";
 import {
   hashDocument
-} from "./chunk-JSU5P7VS.js";
+} from "./chunk-4WB6S4YX.js";
 import {
   getHistoryPath,
   writeFileAtomic
-} from "./chunk-7R4QEMZZ.js";
+} from "./chunk-L4SLHV6G.js";
 
 // dist/core/history/drift-scan.js
 import fs from "fs/promises";
@@ -71,11 +71,64 @@ async function verifyHistoryStream(historyPath) {
     contentHash
   };
 }
+function cacheMetadataMatches(cached, stat) {
+  return cached !== void 0 && cached.mtime_ms === stat.mtimeMs && cached.ctime_ms === stat.ctimeMs && cached.size === stat.size;
+}
+async function loadFreshStreamVerification(itemId, historyPath, accumulator) {
+  try {
+    const loaded = await verifyHistoryStream(historyPath);
+    if (!loaded) {
+      accumulator.missingStreams.push(itemId);
+      return null;
+    }
+    return loaded;
+  } catch {
+    accumulator.unreadableStreams.push(itemId);
+    return null;
+  }
+}
+async function resolveStreamVerification(params) {
+  const cachedContentHash = typeof params.cached?.content_hash === "string" && params.cached.content_hash.length > 0 ? params.cached.content_hash : void 0;
+  const canUseCache = cacheMetadataMatches(params.cached, params.stat) && cachedContentHash !== void 0 && params.cached !== void 0;
+  if (!canUseCache || !params.cached) {
+    return {
+      verification: await loadFreshStreamVerification(params.itemId, params.historyPath, params.accumulator),
+      cacheDirty: true
+    };
+  }
+  let currentContentHash;
+  if (params.verifyCacheHitByContent) {
+    try {
+      currentContentHash = await readHistoryContentHash(params.historyPath);
+    } catch {
+      params.accumulator.unreadableStreams.push(params.itemId);
+      return { verification: null, cacheDirty: false };
+    }
+  } else {
+    currentContentHash = cachedContentHash;
+  }
+  if (!params.verifyCacheHitByContent || currentContentHash === cachedContentHash) {
+    return {
+      verification: {
+        latestAfterHash: params.cached.latest_after_hash,
+        chainOk: params.cached.chain_ok,
+        contentHash: currentContentHash
+      },
+      cacheDirty: false
+    };
+  }
+  return {
+    verification: await loadFreshStreamVerification(params.itemId, params.historyPath, params.accumulator),
+    cacheDirty: true
+  };
+}
 async function scanHistoryDrift(pmRoot, items, options = {}) {
-  const missingStreams = [];
-  const unreadableStreams = [];
-  const hashMismatches = [];
-  const chainMismatches = [];
+  const accumulator = {
+    missingStreams: [],
+    unreadableStreams: [],
+    hashMismatches: [],
+    chainMismatches: []
+  };
   const cache = await loadDriftCache(pmRoot);
   const previousEntries = cache?.entries ?? {};
   const nextEntries = {};
@@ -88,88 +141,43 @@ async function scanHistoryDrift(pmRoot, items, options = {}) {
       stat = await fs.stat(historyPath);
     } catch (error) {
       if (isErrno(error, "ENOENT")) {
-        missingStreams.push(item.id);
+        accumulator.missingStreams.push(item.id);
       } else {
-        unreadableStreams.push(item.id);
+        accumulator.unreadableStreams.push(item.id);
       }
       continue;
     }
-    const loadStreamVerification = async () => {
-      try {
-        return await verifyHistoryStream(historyPath);
-      } catch {
-        return "unreadable";
-      }
-    };
-    const loadFreshVerification = async () => {
-      const loaded = await loadStreamVerification();
-      if (loaded === "unreadable") {
-        unreadableStreams.push(item.id);
-        return null;
-      }
-      if (!loaded) {
-        missingStreams.push(item.id);
-        return null;
-      }
-      return loaded;
-    };
     const cached = previousEntries[item.id];
-    let verification;
-    const metadataMatchesCache = cached !== void 0 && cached.mtime_ms === stat.mtimeMs && cached.ctime_ms === stat.ctimeMs && cached.size === stat.size;
-    const cachedContentHash = typeof cached?.content_hash === "string" && cached.content_hash.length > 0 ? cached.content_hash : void 0;
-    const canUseCache = metadataMatchesCache && cachedContentHash !== void 0;
-    if (canUseCache && cached) {
-      let currentContentHash;
-      if (verifyCacheHitByContent) {
-        try {
-          currentContentHash = await readHistoryContentHash(historyPath);
-        } catch {
-          unreadableStreams.push(item.id);
-          continue;
-        }
-      } else {
-        currentContentHash = cachedContentHash;
-      }
-      if (!verifyCacheHitByContent || currentContentHash === cachedContentHash) {
-        verification = {
-          latestAfterHash: cached.latest_after_hash,
-          chainOk: cached.chain_ok,
-          contentHash: currentContentHash
-        };
-      } else {
-        cacheDirty = true;
-        const refreshed = await loadFreshVerification();
-        if (!refreshed) {
-          continue;
-        }
-        verification = refreshed;
-      }
-    } else {
-      cacheDirty = true;
-      const refreshed = await loadFreshVerification();
-      if (!refreshed) {
-        continue;
-      }
-      verification = refreshed;
+    const resolved = await resolveStreamVerification({
+      itemId: item.id,
+      historyPath,
+      stat,
+      cached,
+      verifyCacheHitByContent,
+      accumulator
+    });
+    cacheDirty ||= resolved.cacheDirty;
+    if (!resolved.verification) {
+      continue;
     }
-    if (!verification.chainOk) {
-      chainMismatches.push(item.id);
+    if (!resolved.verification.chainOk) {
+      accumulator.chainMismatches.push(item.id);
     }
     nextEntries[item.id] = {
       mtime_ms: stat.mtimeMs,
       ctime_ms: stat.ctimeMs,
       size: stat.size,
-      content_hash: verification.contentHash,
-      latest_after_hash: verification.latestAfterHash,
-      chain_ok: verification.chainOk
+      content_hash: resolved.verification.contentHash,
+      latest_after_hash: resolved.verification.latestAfterHash,
+      chain_ok: resolved.verification.chainOk
     };
     const { body, ...frontMatter } = item;
     const currentHash = hashDocument({
       metadata: frontMatter,
       body
     });
-    if (currentHash !== verification.latestAfterHash) {
-      hashMismatches.push(item.id);
+    if (currentHash !== resolved.verification.latestAfterHash) {
+      accumulator.hashMismatches.push(item.id);
     }
   }
   if (cacheDirty || Object.keys(previousEntries).length !== Object.keys(nextEntries).length) {
@@ -180,13 +188,20 @@ async function scanHistoryDrift(pmRoot, items, options = {}) {
     } catch {
     }
   }
-  const driftedItems = [.../* @__PURE__ */ new Set([...missingStreams, ...unreadableStreams, ...hashMismatches, ...chainMismatches])].sort((a, b) => a.localeCompare(b));
-  return { missingStreams, unreadableStreams, hashMismatches, chainMismatches, driftedItems };
+  const driftedItems = [
+    .../* @__PURE__ */ new Set([
+      ...accumulator.missingStreams,
+      ...accumulator.unreadableStreams,
+      ...accumulator.hashMismatches,
+      ...accumulator.chainMismatches
+    ])
+  ].sort((a, b) => a.localeCompare(b));
+  return { ...accumulator, driftedItems };
 }
 
 export {
   scanHistoryDrift
 };
-//# sourceMappingURL=chunk-OTUHB4HS.js.map
+//# sourceMappingURL=chunk-BE2SR6QL.js.map
 
-//# debugId=7919579f-9834-5809-8c55-f7618807569e
+//# debugId=c47d06d6-06dd-59ff-bc33-96613e4fdde4