@unbrained/pm-cli 2026.6.30 → 2026.7.2

package/dist/core/governance/metadata-coverage.js

@@ -13,7 +13,7 @@
  * pure logic here stays trivially testable with a fake classifier.
  */
 
-!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]="dc9b8793-1f34-54b7-a0fc-073e48f11646")}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]="f14cd0bc-bf31-5676-8e21-345fb9ecdd0d")}catch(e){}}();
 import { toNonEmptyStringOrUndefined } from "../shared/primitives.js";
 /** Stable rendering order for lifecycle buckets. */
 export const LIFECYCLE_BUCKET_ORDER = [
@@ -125,6 +125,22 @@ export function hasMissingMetadataFilter(filters) {
         filters.releaseMissing ||
         filters.metadataMissing);
 }
+function itemMatchesSpecificMetadataFilters(item, filters, classifier) {
+    const checks = [
+        [filters.acMissing, isAcMissing(item)],
+        [filters.estimatesMissing, isEstimateMissing(item)],
+        [filters.resolutionMissing, isResolutionMissing(item, classifier)],
+        [filters.reviewerMissing, isReviewerMissing(item)],
+        [filters.riskMissing, isRiskMissing(item)],
+        [filters.confidenceMissing, isConfidenceMissing(item)],
+        [filters.sprintMissing, isSprintMissing(item)],
+        [filters.releaseMissing, isReleaseMissing(item)],
+    ];
+    return checks.every(([requested, matched]) => requested !== true || matched);
+}
+function itemMatchesCoreMetadataMissingUnion(item, classifier) {
+    return isAcMissing(item) || isEstimateMissing(item) || isResolutionMissing(item, classifier);
+}
 /**
  * Does a single item satisfy the requested missing-metadata filters?
  *
@@ -140,36 +156,12 @@ export function itemMatchesMissingMetadata(item, filters, classifier) {
     if (!hasMissingMetadataFilter(filters)) {
         return true;
     }
-    if (filters.acMissing && !isAcMissing(item)) {
-        return false;
-    }
-    if (filters.estimatesMissing && !isEstimateMissing(item)) {
-        return false;
-    }
-    if (filters.resolutionMissing && !isResolutionMissing(item, classifier)) {
-        return false;
-    }
-    if (filters.reviewerMissing && !isReviewerMissing(item)) {
+    if (!itemMatchesSpecificMetadataFilters(item, filters, classifier)) {
         return false;
     }
-    if (filters.riskMissing && !isRiskMissing(item)) {
+    if (filters.metadataMissing && !itemMatchesCoreMetadataMissingUnion(item, classifier)) {
         return false;
     }
-    if (filters.confidenceMissing && !isConfidenceMissing(item)) {
-        return false;
-    }
-    if (filters.sprintMissing && !isSprintMissing(item)) {
-        return false;
-    }
-    if (filters.releaseMissing && !isReleaseMissing(item)) {
-        return false;
-    }
-    if (filters.metadataMissing) {
-        const anyMissing = isAcMissing(item) || isEstimateMissing(item) || isResolutionMissing(item, classifier);
-        if (!anyMissing) {
-            return false;
-        }
-    }
     return true;
 }
 /** Filter a list of items by the requested missing-metadata predicates. */
@@ -359,4 +351,4 @@ export function computeLifecycleDistribution(items, classifier) {
     return buckets;
 }
 //# sourceMappingURL=metadata-coverage.js.map
-//# debugId=dc9b8793-1f34-54b7-a0fc-073e48f11646
+//# debugId=f14cd0bc-bf31-5676-8e21-345fb9ecdd0d

package/dist/core/governance/metadata-coverage.js.map

@@ -1 +1 @@
-{"version":3,"file":"metadata-coverage.js","sources":["core/governance/metadata-coverage.ts"],"sourceRoot":"/","sourcesContent":["/**\n * Metadata governance & coverage observability primitives.\n *\n * One dependency-light module that powers the whole metadata-governance\n * surface: missing-field selection (pm list / pm update-many), coverage\n * percentages (pm stats --metadata-coverage / pm validate), and grouped\n * lifecycle breakdowns (pm stats --by-assignee/--by-tag/--by-priority,\n * pm aggregate explicit labels).\n *\n * The module is pure: it performs no IO and imports no heavy runtime\n * dependencies. Lifecycle semantics are injected via a {@link LifecycleClassifier}\n * so callers map their runtime status registry to lifecycle buckets while the\n * pure logic here stays trivially testable with a fake classifier.\n */\n\nimport { toNonEmptyStringOrUndefined } from \"../shared/primitives.js\";\n\n/** Minimal structural shape this module needs from an item's front matter. */\nexport interface CoverageItem {\n  type: string;\n  status: string;\n  assignee?: string;\n  tags?: string[];\n  parent?: string;\n  priority?: number;\n  acceptance_criteria?: string;\n  estimated_minutes?: number;\n  resolution?: string;\n  reviewer?: string;\n  risk?: string;\n  /** Confidence is a string-like enum or a numeric score depending on workspace. */\n  confidence?: string | number;\n  sprint?: string;\n  release?: string;\n  [key: string]: unknown;\n}\n\n/** Lifecycle buckets used by grouped breakdowns and distributions. */\nexport type LifecycleBucket =\n  | \"open\"\n  | \"in_progress\"\n  | \"blocked\"\n  | \"draft\"\n  | \"closed\"\n  | \"canceled\"\n  | \"other\";\n\n/** Stable rendering order for lifecycle buckets. */\nexport const LIFECYCLE_BUCKET_ORDER: readonly LifecycleBucket[] = [\n  \"open\",\n  \"in_progress\",\n  \"blocked\",\n  \"draft\",\n  \"closed\",\n  \"canceled\",\n  \"other\",\n] as const;\n\n/**\n * Classifies a raw status string into a lifecycle bucket and reports whether a\n * status is terminal (closed/canceled). Callers build this from their resolved\n * runtime status registry via {@link lifecycleClassifierFromStatusRegistry}.\n */\nexport interface LifecycleClassifier {\n  classify(status: string): LifecycleBucket;\n  isTerminal(status: string): boolean;\n}\n\n/** The subset of a resolved runtime status registry this module consumes. */\nexport interface StatusRegistryLike {\n  alias_to_id: Map<string, string>;\n  terminal_statuses: Set<string>;\n  terminal_canceled_statuses: Set<string>;\n  blocked_statuses: Set<string>;\n  draft_statuses: Set<string>;\n  active_statuses: Set<string>;\n  open_status: string;\n}\n\nfunction normalizeStatus(status: string, registry: StatusRegistryLike): string {\n  const trimmed = status.trim().toLowerCase();\n  return registry.alias_to_id.get(trimmed) ?? trimmed;\n}\n\n/**\n * Adapt a resolved runtime status registry into a {@link LifecycleClassifier}.\n *\n * Precedence is deliberate and disjoint: canceled → closed → blocked → draft →\n * open → in_progress (active but not the default open status) → other.\n */\nexport function lifecycleClassifierFromStatusRegistry(registry: StatusRegistryLike): LifecycleClassifier {\n  return {\n    isTerminal(status: string): boolean {\n      return registry.terminal_statuses.has(normalizeStatus(status, registry));\n    },\n    classify(status: string): LifecycleBucket {\n      const id = normalizeStatus(status, registry);\n      if (registry.terminal_canceled_statuses.has(id)) {\n        return \"canceled\";\n      }\n      if (registry.terminal_statuses.has(id)) {\n        return \"closed\";\n      }\n      if (registry.blocked_statuses.has(id)) {\n        return \"blocked\";\n      }\n      if (registry.draft_statuses.has(id)) {\n        return \"draft\";\n      }\n      if (id === registry.open_status) {\n        return \"open\";\n      }\n      if (registry.active_statuses.has(id)) {\n        return \"in_progress\";\n      }\n      return \"other\";\n    },\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Missing-metadata predicates\n// ---------------------------------------------------------------------------\n\n/** True when an item has no non-empty acceptance_criteria. */\nexport function isAcMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.acceptance_criteria) === undefined;\n}\n\n/** True when an item has no finite estimated_minutes. */\nexport function isEstimateMissing(item: CoverageItem): boolean {\n  return !Number.isFinite(item.estimated_minutes);\n}\n\n/**\n * True when a terminal (closed/canceled) item has no non-empty resolution.\n * Resolution is only expected on terminal items, so open items are never\n * considered \"resolution-missing\".\n */\nexport function isResolutionMissing(item: CoverageItem, classifier: LifecycleClassifier): boolean {\n  if (!classifier.isTerminal(item.status)) {\n    return false;\n  }\n  return toNonEmptyStringOrUndefined(item.resolution) === undefined;\n}\n\n/** True when an item has no non-empty reviewer. */\nexport function isReviewerMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.reviewer) === undefined;\n}\n\n/** True when an item has no non-empty risk level. */\nexport function isRiskMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.risk) === undefined;\n}\n\n/**\n * True when an item has no confidence value. Confidence is a string-like enum\n * or a numeric score depending on workspace, so a finite number counts as\n * present and only blank/absent values are treated as missing.\n */\nexport function isConfidenceMissing(item: CoverageItem): boolean {\n  if (typeof item.confidence === \"number\") {\n    return !Number.isFinite(item.confidence);\n  }\n  return toNonEmptyStringOrUndefined(item.confidence) === undefined;\n}\n\n/** True when an item has no non-empty sprint. */\nexport function isSprintMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.sprint) === undefined;\n}\n\n/** True when an item has no non-empty release. */\nexport function isReleaseMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.release) === undefined;\n}\n\n/** Selection flags for {@link filterMissingMetadata}. */\nexport interface MissingMetadataFilters {\n  acMissing?: boolean;\n  estimatesMissing?: boolean;\n  resolutionMissing?: boolean;\n  reviewerMissing?: boolean;\n  riskMissing?: boolean;\n  confidenceMissing?: boolean;\n  sprintMissing?: boolean;\n  releaseMissing?: boolean;\n  /** Match items missing ANY of the tracked metadata fields (union). */\n  metadataMissing?: boolean;\n}\n\n/** True when any missing-metadata filter is requested. */\nexport function hasMissingMetadataFilter(filters: MissingMetadataFilters): boolean {\n  return Boolean(\n    filters.acMissing ||\n      filters.estimatesMissing ||\n      filters.resolutionMissing ||\n      filters.reviewerMissing ||\n      filters.riskMissing ||\n      filters.confidenceMissing ||\n      filters.sprintMissing ||\n      filters.releaseMissing ||\n      filters.metadataMissing,\n  );\n}\n\n/**\n * Does a single item satisfy the requested missing-metadata filters?\n *\n * Specific flags (acMissing/estimatesMissing/resolutionMissing plus the\n * governance flags reviewerMissing/riskMissing/confidenceMissing/sprintMissing/\n * releaseMissing) are ANDed together so callers can narrow precisely.\n * `metadataMissing` is ORed in as a union shortcut for \"missing any of the\n * core tracked fields\" (acceptance_criteria/estimated_minutes/resolution); it\n * deliberately excludes the governance fields so the long-standing flag keeps\n * its original meaning. When no filter is requested the item passes.\n */\nexport function itemMatchesMissingMetadata(\n  item: CoverageItem,\n  filters: MissingMetadataFilters,\n  classifier: LifecycleClassifier,\n): boolean {\n  if (!hasMissingMetadataFilter(filters)) {\n    return true;\n  }\n  if (filters.acMissing && !isAcMissing(item)) {\n    return false;\n  }\n  if (filters.estimatesMissing && !isEstimateMissing(item)) {\n    return false;\n  }\n  if (filters.resolutionMissing && !isResolutionMissing(item, classifier)) {\n    return false;\n  }\n  if (filters.reviewerMissing && !isReviewerMissing(item)) {\n    return false;\n  }\n  if (filters.riskMissing && !isRiskMissing(item)) {\n    return false;\n  }\n  if (filters.confidenceMissing && !isConfidenceMissing(item)) {\n    return false;\n  }\n  if (filters.sprintMissing && !isSprintMissing(item)) {\n    return false;\n  }\n  if (filters.releaseMissing && !isReleaseMissing(item)) {\n    return false;\n  }\n  if (filters.metadataMissing) {\n    const anyMissing =\n      isAcMissing(item) || isEstimateMissing(item) || isResolutionMissing(item, classifier);\n    if (!anyMissing) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/** Filter a list of items by the requested missing-metadata predicates. */\nexport function filterMissingMetadata<T extends CoverageItem>(\n  items: readonly T[],\n  filters: MissingMetadataFilters,\n  classifier: LifecycleClassifier,\n): T[] {\n  if (!hasMissingMetadataFilter(filters)) {\n    return [...items];\n  }\n  return items.filter((item) => itemMatchesMissingMetadata(item, filters, classifier));\n}\n\n// ---------------------------------------------------------------------------\n// Metadata coverage percentages\n// ---------------------------------------------------------------------------\n\n/** Coverage-tracked metadata fields. */\nexport type CoverageField =\n  | \"acceptance_criteria\"\n  | \"estimated_minutes\"\n  | \"resolution\"\n  | \"tags\"\n  | \"parent\";\n\n/** Stable ordering of coverage fields for rendering. */\nexport const COVERAGE_FIELD_ORDER: readonly CoverageField[] = [\n  \"acceptance_criteria\",\n  \"estimated_minutes\",\n  \"resolution\",\n  \"tags\",\n  \"parent\",\n] as const;\n\n/** Coverage of a single field: present vs applicable, with a rounded percent. */\nexport interface FieldCoverage {\n  present: number;\n  /** Items for which the field is expected (all items, except resolution = terminal only). */\n  applicable: number;\n  /** present/applicable * 100, rounded to one decimal; 100 when applicable is 0. */\n  percent: number;\n}\n\n/**\n * Documents the metadata coverage report payload exchanged by command, SDK, and package integrations.\n */\nexport interface MetadataCoverageReport {\n  overall: Record<CoverageField, FieldCoverage>;\n  by_type: Record<string, Record<CoverageField, FieldCoverage>>;\n}\n\nfunction isFieldPresent(item: CoverageItem, field: CoverageField): boolean {\n  switch (field) {\n    case \"acceptance_criteria\":\n      return !isAcMissing(item);\n    case \"estimated_minutes\":\n      return !isEstimateMissing(item);\n    case \"resolution\":\n      return toNonEmptyStringOrUndefined(item.resolution) !== undefined;\n    case \"tags\":\n      return Array.isArray(item.tags) && item.tags.length > 0;\n    default:\n      return toNonEmptyStringOrUndefined(item.parent) !== undefined;\n  }\n}\n\n/** Whether a field applies to a given item (resolution only applies to terminal items). */\nfunction isFieldApplicable(item: CoverageItem, field: CoverageField, classifier: LifecycleClassifier): boolean {\n  if (field === \"resolution\") {\n    return classifier.isTerminal(item.status);\n  }\n  return true;\n}\n\nfunction roundPercent(present: number, applicable: number): number {\n  if (applicable === 0) {\n    return 100;\n  }\n  return Math.round((present / applicable) * 1000) / 10;\n}\n\nfunction emptyFieldCoverage(): Record<CoverageField, FieldCoverage> {\n  const record = {} as Record<CoverageField, FieldCoverage>;\n  for (const field of COVERAGE_FIELD_ORDER) {\n    record[field] = { present: 0, applicable: 0, percent: 100 };\n  }\n  return record;\n}\n\nfunction accumulateCoverage(\n  target: Record<CoverageField, FieldCoverage>,\n  item: CoverageItem,\n  classifier: LifecycleClassifier,\n): void {\n  for (const field of COVERAGE_FIELD_ORDER) {\n    if (!isFieldApplicable(item, field, classifier)) {\n      continue;\n    }\n    const entry = target[field];\n    entry.applicable += 1;\n    if (isFieldPresent(item, field)) {\n      entry.present += 1;\n    }\n  }\n}\n\nfunction finalizePercentages(record: Record<CoverageField, FieldCoverage>): void {\n  for (const field of COVERAGE_FIELD_ORDER) {\n    const entry = record[field];\n    entry.percent = roundPercent(entry.present, entry.applicable);\n  }\n}\n\n/**\n * Compute metadata coverage overall and per item type. For each tracked field\n * we report present/applicable counts and a rounded percentage. Resolution is\n * scoped to terminal items (its only applicable population).\n */\nexport function computeMetadataCoverage(\n  items: readonly CoverageItem[],\n  classifier: LifecycleClassifier,\n): MetadataCoverageReport {\n  const overall = emptyFieldCoverage();\n  const byType: Record<string, Record<CoverageField, FieldCoverage>> = {};\n  for (const item of items) {\n    accumulateCoverage(overall, item, classifier);\n    const typeRecord = byType[item.type] ?? (byType[item.type] = emptyFieldCoverage());\n    accumulateCoverage(typeRecord, item, classifier);\n  }\n  finalizePercentages(overall);\n  for (const typeRecord of Object.values(byType)) {\n    finalizePercentages(typeRecord);\n  }\n  return { overall, by_type: byType };\n}\n\n// ---------------------------------------------------------------------------\n// Grouped lifecycle breakdowns\n// ---------------------------------------------------------------------------\n\n/** Dimensions a breakdown can group by. */\nexport type GroupDimension = \"assignee\" | \"priority\" | \"tag\" | \"parent\" | \"type\" | \"status\";\n\n/** Explicit labels for empty/blank group keys, by dimension. */\nconst EMPTY_GROUP_LABELS: Record<GroupDimension, string> = {\n  assignee: \"(unassigned)\",\n  priority: \"(no priority)\",\n  tag: \"(untagged)\",\n  parent: \"(unparented)\",\n  type: \"(untyped)\",\n  status: \"(no status)\",\n};\n\n/** Explicit label for an empty/blank group value for a given dimension. */\nexport function emptyGroupLabel(dimension: GroupDimension): string {\n  return EMPTY_GROUP_LABELS[dimension];\n}\n\n/**\n * Documents the group row payload exchanged by command, SDK, and package integrations.\n */\nexport interface GroupRow {\n  /** Display label; explicit \"(unassigned)\"-style label for blank keys. */\n  label: string;\n  /** Stable structured key (null for the empty/blank group). */\n  key: string | null;\n  buckets: Record<LifecycleBucket, number>;\n  total: number;\n}\n\n/**\n * Documents the grouped breakdown payload exchanged by command, SDK, and package integrations.\n */\nexport interface GroupedBreakdown {\n  dimension: GroupDimension;\n  rows: GroupRow[];\n  /** Distinct items observed (an item can contribute to multiple tag rows). */\n  total_items: number;\n}\n\n/**\n * Documents the group options payload exchanged by command, SDK, and package integrations.\n */\nexport interface GroupOptions {\n  /** For dimension=\"tag\": only consider tags starting with this prefix. */\n  tagPrefix?: string;\n}\n\nfunction emptyBuckets(): Record<LifecycleBucket, number> {\n  return {\n    open: 0,\n    in_progress: 0,\n    blocked: 0,\n    draft: 0,\n    closed: 0,\n    canceled: 0,\n    other: 0,\n  };\n}\n\n/**\n * Resolve the group keys an item belongs to for a dimension. Most dimensions\n * yield exactly one key (possibly null for blank); tag yields one key per\n * matching tag (or [null] when none match), so an item can span multiple rows.\n */\nfunction groupKeysForItem(item: CoverageItem, dimension: GroupDimension, options: GroupOptions): (string | null)[] {\n  switch (dimension) {\n    case \"assignee\":\n      return [toNonEmptyStringOrUndefined(item.assignee) ?? null];\n    case \"parent\":\n      return [toNonEmptyStringOrUndefined(item.parent) ?? null];\n    case \"type\":\n      return [toNonEmptyStringOrUndefined(item.type) ?? null];\n    case \"status\":\n      return [toNonEmptyStringOrUndefined(item.status) ?? null];\n    case \"priority\":\n      return [typeof item.priority === \"number\" ? `P${item.priority}` : null];\n    default: {\n      const prefix = options.tagPrefix?.trim();\n      const tags = Array.isArray(item.tags) ? item.tags : [];\n      const matching = tags.filter(\n        (tag) => typeof tag === \"string\" && tag.length > 0 && (!prefix || tag.startsWith(prefix)),\n      );\n      return matching.length > 0 ? matching : [null];\n    }\n  }\n}\n\n/**\n * Group items by a dimension into lifecycle-bucketed rows. Blank keys render\n * with an explicit \"(unassigned)\"-style label. Rows are sorted by total\n * descending, then label ascending, with the empty group sorted last on ties.\n */\nexport function groupItemsByDimension(\n  items: readonly CoverageItem[],\n  dimension: GroupDimension,\n  classifier: LifecycleClassifier,\n  options: GroupOptions = {},\n): GroupedBreakdown {\n  const rows = new Map<string, GroupRow>();\n  let totalItems = 0;\n  for (const item of items) {\n    totalItems += 1;\n    const bucket = classifier.classify(item.status);\n    for (const key of groupKeysForItem(item, dimension, options)) {\n      const mapKey = key ?? \"\u0000empty\";\n      let row = rows.get(mapKey);\n      if (!row) {\n        row = {\n          label: key ?? emptyGroupLabel(dimension),\n          key,\n          buckets: emptyBuckets(),\n          total: 0,\n        };\n        rows.set(mapKey, row);\n      }\n      row.buckets[bucket] += 1;\n      row.total += 1;\n    }\n  }\n  const sorted = [...rows.values()].sort((left, right) => {\n    if (right.total !== left.total) {\n      return right.total - left.total;\n    }\n    // All blank-key items collapse into a single row per dimension, so at most\n    // one row has key === null; it sorts last on ties.\n    if (left.key === null) {\n      return 1;\n    }\n    if (right.key === null) {\n      return -1;\n    }\n    return left.label.localeCompare(right.label);\n  });\n  return { dimension, rows: sorted, total_items: totalItems };\n}\n\n/** Lifecycle-bucket distribution across all items (for stats lifecycle section). */\nexport function computeLifecycleDistribution(\n  items: readonly CoverageItem[],\n  classifier: LifecycleClassifier,\n): Record<LifecycleBucket, number> {\n  const buckets = emptyBuckets();\n  for (const item of items) {\n    buckets[classifier.classify(item.status)] += 1;\n  }\n  return buckets;\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;;;AAEH,OAAO,EAAE,2BAA2B,EAAE,MAAM,yBAAyB,CAAC;AAgCtE,oDAAoD;AACpD,MAAM,CAAC,MAAM,sBAAsB,GAA+B;IAChE,MAAM;IACN,aAAa;IACb,SAAS;IACT,OAAO;IACP,QAAQ;IACR,UAAU;IACV,OAAO;CACC,CAAC;AAuBX,SAAS,eAAe,CAAC,MAAc,EAAE,QAA4B;IACnE,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC5C,OAAO,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC;AACtD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qCAAqC,CAAC,QAA4B;IAChF,OAAO;QACL,UAAU,CAAC,MAAc;YACvB,OAAO,QAAQ,CAAC,iBAAiB,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC3E,CAAC;QACD,QAAQ,CAAC,MAAc;YACrB,MAAM,EAAE,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC7C,IAAI,QAAQ,CAAC,0BAA0B,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChD,OAAO,UAAU,CAAC;YACpB,CAAC;YACD,IAAI,QAAQ,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvC,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI,QAAQ,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtC,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,IAAI,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,OAAO,OAAO,CAAC;YACjB,CAAC;YACD,IAAI,EAAE,KAAK,QAAQ,CAAC,WAAW,EAAE,CAAC;gBAChC,OAAO,MAAM,CAAC;YAChB,CAAC;YACD,IAAI,QAAQ,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACrC,OAAO,aAAa,CAAC;YACvB,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;KACF,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,8BAA8B;AAC9B,8EAA8E;AAE9E,8DAA8D;AAC9D,MAAM,UAAU,WAAW,CAAC,IAAkB;IAC5C,OAAO,2BAA2B,CAAC,IAAI,CAAC,mBAAmB,CAAC,KAAK,SAAS,CAAC;AAC7E,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,iBAAiB,CAAC,IAAkB;IAClD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;AAClD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAkB,EAAE,UAA+B;IACrF,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC;AACpE,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,iBAAiB,CAAC,IAAkB;IAClD,OAAO,2BAA2B,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,SAAS,CAAC;AAClE,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,aAAa,CAAC,IAAkB;IAC9C,OAAO,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC;AAC9D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAkB;IACpD,IAAI,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;QACxC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC;AACpE,CAAC;AAED,iDAAiD;AACjD,MAAM,UAAU,eAAe,CAAC,IAAkB;IAChD,OAAO,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;AAChE,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,gBAAgB,CAAC,IAAkB;IACjD,OAAO,2BAA2B,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;AACjE,CAAC;AAgBD,0DAA0D;AAC1D,MAAM,UAAU,wBAAwB,CAAC,OAA+B;IACtE,OAAO,OAAO,CACZ,OAAO,CAAC,SAAS;QACf,OAAO,CAAC,gBAAgB;QACxB,OAAO,CAAC,iBAAiB;QACzB,OAAO,CAAC,eAAe;QACvB,OAAO,CAAC,WAAW;QACnB,OAAO,CAAC,iBAAiB;QACzB,OAAO,CAAC,aAAa;QACrB,OAAO,CAAC,cAAc;QACtB,OAAO,CAAC,eAAe,CAC1B,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,0BAA0B,CACxC,IAAkB,EAClB,OAA+B,EAC/B,UAA+B;IAE/B,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,OAAO,CAAC,SAAS,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,gBAAgB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,iBAAiB,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;QACxE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,eAAe,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;QACxD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,WAAW,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,iBAAiB,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5D,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,aAAa,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;QACpD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,cAAc,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;QACtD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;QAC5B,MAAM,UAAU,GACd,WAAW,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACxF,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,qBAAqB,CACnC,KAAmB,EACnB,OAA+B,EAC/B,UAA+B;IAE/B,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,0BAA0B,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;AACvF,CAAC;AAcD,wDAAwD;AACxD,MAAM,CAAC,MAAM,oBAAoB,GAA6B;IAC5D,qBAAqB;IACrB,mBAAmB;IACnB,YAAY;IACZ,MAAM;IACN,QAAQ;CACA,CAAC;AAmBX,SAAS,cAAc,CAAC,IAAkB,EAAE,KAAoB;IAC9D,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,qBAAqB;YACxB,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC5B,KAAK,mBAAmB;YACtB,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAClC,KAAK,YAAY;YACf,OAAO,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC;QACpE,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1D;YACE,OAAO,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;IAClE,CAAC;AACH,CAAC;AAED,2FAA2F;AAC3F,SAAS,iBAAiB,CAAC,IAAkB,EAAE,KAAoB,EAAE,UAA+B;IAClG,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;QAC3B,OAAO,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,OAAe,EAAE,UAAkB;IACvD,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;AACxD,CAAC;AAED,SAAS,kBAAkB;IACzB,MAAM,MAAM,GAAG,EAA0C,CAAC;IAC1D,KAAK,MAAM,KAAK,IAAI,oBAAoB,EAAE,CAAC;QACzC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;IAC9D,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CACzB,MAA4C,EAC5C,IAAkB,EAClB,UAA+B;IAE/B,KAAK,MAAM,KAAK,IAAI,oBAAoB,EAAE,CAAC;QACzC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;YAChD,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;QACtB,IAAI,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAAC,MAA4C;IACvE,KAAK,MAAM,KAAK,IAAI,oBAAoB,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,KAAK,CAAC,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAChE,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAA8B,EAC9B,UAA+B;IAE/B,MAAM,OAAO,GAAG,kBAAkB,EAAE,CAAC;IACrC,MAAM,MAAM,GAAyD,EAAE,CAAC;IACxE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,kBAAkB,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,kBAAkB,EAAE,CAAC,CAAC;QACnF,kBAAkB,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IACnD,CAAC;IACD,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC7B,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QAC/C,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AACtC,CAAC;AASD,gEAAgE;AAChE,MAAM,kBAAkB,GAAmC;IACzD,QAAQ,EAAE,cAAc;IACxB,QAAQ,EAAE,eAAe;IACzB,GAAG,EAAE,YAAY;IACjB,MAAM,EAAE,cAAc;IACtB,IAAI,EAAE,WAAW;IACjB,MAAM,EAAE,aAAa;CACtB,CAAC;AAEF,2EAA2E;AAC3E,MAAM,UAAU,eAAe,CAAC,SAAyB;IACvD,OAAO,kBAAkB,CAAC,SAAS,CAAC,CAAC;AACvC,CAAC;AAgCD,SAAS,YAAY;IACnB,OAAO;QACL,IAAI,EAAE,CAAC;QACP,WAAW,EAAE,CAAC;QACd,OAAO,EAAE,CAAC;QACV,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;QACT,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,CAAC;KACT,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAkB,EAAE,SAAyB,EAAE,OAAqB;IAC5F,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,UAAU;YACb,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;QAC9D,KAAK,QAAQ;YACX,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;QAC5D,KAAK,MAAM;YACT,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;QAC1D,KAAK,QAAQ;YACX,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;QAC5D,KAAK,UAAU;YACb,OAAO,CAAC,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1E,OAAO,CAAC,CAAC,CAAC;YACR,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAC1B,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAC1F,CAAC;YACF,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAA8B,EAC9B,SAAyB,EACzB,UAA+B,EAC/B,UAAwB,EAAE;IAE1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,IAAI,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChD,KAAK,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,GAAG,IAAI,QAAQ,CAAC;YAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,GAAG,GAAG;oBACJ,KAAK,EAAE,GAAG,IAAI,eAAe,CAAC,SAAS,CAAC;oBACxC,GAAG;oBACH,OAAO,EAAE,YAAY,EAAE;oBACvB,KAAK,EAAE,CAAC;iBACT,CAAC;gBACF,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACxB,CAAC;YACD,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACzB,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QACrD,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,OAAO,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAClC,CAAC;QACD,2EAA2E;QAC3E,mDAAmD;QACnD,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,IAAI,KAAK,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC;AAC9D,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,4BAA4B,CAC1C,KAA8B,EAC9B,UAA+B;IAE/B,MAAM,OAAO,GAAG,YAAY,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC","debugId":"dc9b8793-1f34-54b7-a0fc-073e48f11646"}
+{"version":3,"file":"metadata-coverage.js","sources":["core/governance/metadata-coverage.ts"],"sourceRoot":"/","sourcesContent":["/**\n * Metadata governance & coverage observability primitives.\n *\n * One dependency-light module that powers the whole metadata-governance\n * surface: missing-field selection (pm list / pm update-many), coverage\n * percentages (pm stats --metadata-coverage / pm validate), and grouped\n * lifecycle breakdowns (pm stats --by-assignee/--by-tag/--by-priority,\n * pm aggregate explicit labels).\n *\n * The module is pure: it performs no IO and imports no heavy runtime\n * dependencies. Lifecycle semantics are injected via a {@link LifecycleClassifier}\n * so callers map their runtime status registry to lifecycle buckets while the\n * pure logic here stays trivially testable with a fake classifier.\n */\n\nimport { toNonEmptyStringOrUndefined } from \"../shared/primitives.js\";\n\n/** Minimal structural shape this module needs from an item's front matter. */\nexport interface CoverageItem {\n  type: string;\n  status: string;\n  assignee?: string;\n  tags?: string[];\n  parent?: string;\n  priority?: number;\n  acceptance_criteria?: string;\n  estimated_minutes?: number;\n  resolution?: string;\n  reviewer?: string;\n  risk?: string;\n  /** Confidence is a string-like enum or a numeric score depending on workspace. */\n  confidence?: string | number;\n  sprint?: string;\n  release?: string;\n  [key: string]: unknown;\n}\n\n/** Lifecycle buckets used by grouped breakdowns and distributions. */\nexport type LifecycleBucket =\n  | \"open\"\n  | \"in_progress\"\n  | \"blocked\"\n  | \"draft\"\n  | \"closed\"\n  | \"canceled\"\n  | \"other\";\n\n/** Stable rendering order for lifecycle buckets. */\nexport const LIFECYCLE_BUCKET_ORDER: readonly LifecycleBucket[] = [\n  \"open\",\n  \"in_progress\",\n  \"blocked\",\n  \"draft\",\n  \"closed\",\n  \"canceled\",\n  \"other\",\n] as const;\n\n/**\n * Classifies a raw status string into a lifecycle bucket and reports whether a\n * status is terminal (closed/canceled). Callers build this from their resolved\n * runtime status registry via {@link lifecycleClassifierFromStatusRegistry}.\n */\nexport interface LifecycleClassifier {\n  classify(status: string): LifecycleBucket;\n  isTerminal(status: string): boolean;\n}\n\n/** The subset of a resolved runtime status registry this module consumes. */\nexport interface StatusRegistryLike {\n  alias_to_id: Map<string, string>;\n  terminal_statuses: Set<string>;\n  terminal_canceled_statuses: Set<string>;\n  blocked_statuses: Set<string>;\n  draft_statuses: Set<string>;\n  active_statuses: Set<string>;\n  open_status: string;\n}\n\nfunction normalizeStatus(status: string, registry: StatusRegistryLike): string {\n  const trimmed = status.trim().toLowerCase();\n  return registry.alias_to_id.get(trimmed) ?? trimmed;\n}\n\n/**\n * Adapt a resolved runtime status registry into a {@link LifecycleClassifier}.\n *\n * Precedence is deliberate and disjoint: canceled → closed → blocked → draft →\n * open → in_progress (active but not the default open status) → other.\n */\nexport function lifecycleClassifierFromStatusRegistry(registry: StatusRegistryLike): LifecycleClassifier {\n  return {\n    isTerminal(status: string): boolean {\n      return registry.terminal_statuses.has(normalizeStatus(status, registry));\n    },\n    classify(status: string): LifecycleBucket {\n      const id = normalizeStatus(status, registry);\n      if (registry.terminal_canceled_statuses.has(id)) {\n        return \"canceled\";\n      }\n      if (registry.terminal_statuses.has(id)) {\n        return \"closed\";\n      }\n      if (registry.blocked_statuses.has(id)) {\n        return \"blocked\";\n      }\n      if (registry.draft_statuses.has(id)) {\n        return \"draft\";\n      }\n      if (id === registry.open_status) {\n        return \"open\";\n      }\n      if (registry.active_statuses.has(id)) {\n        return \"in_progress\";\n      }\n      return \"other\";\n    },\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Missing-metadata predicates\n// ---------------------------------------------------------------------------\n\n/** True when an item has no non-empty acceptance_criteria. */\nexport function isAcMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.acceptance_criteria) === undefined;\n}\n\n/** True when an item has no finite estimated_minutes. */\nexport function isEstimateMissing(item: CoverageItem): boolean {\n  return !Number.isFinite(item.estimated_minutes);\n}\n\n/**\n * True when a terminal (closed/canceled) item has no non-empty resolution.\n * Resolution is only expected on terminal items, so open items are never\n * considered \"resolution-missing\".\n */\nexport function isResolutionMissing(item: CoverageItem, classifier: LifecycleClassifier): boolean {\n  if (!classifier.isTerminal(item.status)) {\n    return false;\n  }\n  return toNonEmptyStringOrUndefined(item.resolution) === undefined;\n}\n\n/** True when an item has no non-empty reviewer. */\nexport function isReviewerMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.reviewer) === undefined;\n}\n\n/** True when an item has no non-empty risk level. */\nexport function isRiskMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.risk) === undefined;\n}\n\n/**\n * True when an item has no confidence value. Confidence is a string-like enum\n * or a numeric score depending on workspace, so a finite number counts as\n * present and only blank/absent values are treated as missing.\n */\nexport function isConfidenceMissing(item: CoverageItem): boolean {\n  if (typeof item.confidence === \"number\") {\n    return !Number.isFinite(item.confidence);\n  }\n  return toNonEmptyStringOrUndefined(item.confidence) === undefined;\n}\n\n/** True when an item has no non-empty sprint. */\nexport function isSprintMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.sprint) === undefined;\n}\n\n/** True when an item has no non-empty release. */\nexport function isReleaseMissing(item: CoverageItem): boolean {\n  return toNonEmptyStringOrUndefined(item.release) === undefined;\n}\n\n/** Selection flags for {@link filterMissingMetadata}. */\nexport interface MissingMetadataFilters {\n  acMissing?: boolean;\n  estimatesMissing?: boolean;\n  resolutionMissing?: boolean;\n  reviewerMissing?: boolean;\n  riskMissing?: boolean;\n  confidenceMissing?: boolean;\n  sprintMissing?: boolean;\n  releaseMissing?: boolean;\n  /** Match items missing ANY of the tracked metadata fields (union). */\n  metadataMissing?: boolean;\n}\n\n/** True when any missing-metadata filter is requested. */\nexport function hasMissingMetadataFilter(filters: MissingMetadataFilters): boolean {\n  return Boolean(\n    filters.acMissing ||\n      filters.estimatesMissing ||\n      filters.resolutionMissing ||\n      filters.reviewerMissing ||\n      filters.riskMissing ||\n      filters.confidenceMissing ||\n      filters.sprintMissing ||\n      filters.releaseMissing ||\n      filters.metadataMissing,\n  );\n}\n\nfunction itemMatchesSpecificMetadataFilters(\n  item: CoverageItem,\n  filters: MissingMetadataFilters,\n  classifier: LifecycleClassifier,\n): boolean {\n  const checks: Array<[boolean | undefined, boolean]> = [\n    [filters.acMissing, isAcMissing(item)],\n    [filters.estimatesMissing, isEstimateMissing(item)],\n    [filters.resolutionMissing, isResolutionMissing(item, classifier)],\n    [filters.reviewerMissing, isReviewerMissing(item)],\n    [filters.riskMissing, isRiskMissing(item)],\n    [filters.confidenceMissing, isConfidenceMissing(item)],\n    [filters.sprintMissing, isSprintMissing(item)],\n    [filters.releaseMissing, isReleaseMissing(item)],\n  ];\n  return checks.every(([requested, matched]) => requested !== true || matched);\n}\n\nfunction itemMatchesCoreMetadataMissingUnion(item: CoverageItem, classifier: LifecycleClassifier): boolean {\n  return isAcMissing(item) || isEstimateMissing(item) || isResolutionMissing(item, classifier);\n}\n\n/**\n * Does a single item satisfy the requested missing-metadata filters?\n *\n * Specific flags (acMissing/estimatesMissing/resolutionMissing plus the\n * governance flags reviewerMissing/riskMissing/confidenceMissing/sprintMissing/\n * releaseMissing) are ANDed together so callers can narrow precisely.\n * `metadataMissing` is ORed in as a union shortcut for \"missing any of the\n * core tracked fields\" (acceptance_criteria/estimated_minutes/resolution); it\n * deliberately excludes the governance fields so the long-standing flag keeps\n * its original meaning. When no filter is requested the item passes.\n */\nexport function itemMatchesMissingMetadata(\n  item: CoverageItem,\n  filters: MissingMetadataFilters,\n  classifier: LifecycleClassifier,\n): boolean {\n  if (!hasMissingMetadataFilter(filters)) {\n    return true;\n  }\n  if (!itemMatchesSpecificMetadataFilters(item, filters, classifier)) {\n    return false;\n  }\n  if (filters.metadataMissing && !itemMatchesCoreMetadataMissingUnion(item, classifier)) {\n    return false;\n  }\n  return true;\n}\n\n/** Filter a list of items by the requested missing-metadata predicates. */\nexport function filterMissingMetadata<T extends CoverageItem>(\n  items: readonly T[],\n  filters: MissingMetadataFilters,\n  classifier: LifecycleClassifier,\n): T[] {\n  if (!hasMissingMetadataFilter(filters)) {\n    return [...items];\n  }\n  return items.filter((item) => itemMatchesMissingMetadata(item, filters, classifier));\n}\n\n// ---------------------------------------------------------------------------\n// Metadata coverage percentages\n// ---------------------------------------------------------------------------\n\n/** Coverage-tracked metadata fields. */\nexport type CoverageField =\n  | \"acceptance_criteria\"\n  | \"estimated_minutes\"\n  | \"resolution\"\n  | \"tags\"\n  | \"parent\";\n\n/** Stable ordering of coverage fields for rendering. */\nexport const COVERAGE_FIELD_ORDER: readonly CoverageField[] = [\n  \"acceptance_criteria\",\n  \"estimated_minutes\",\n  \"resolution\",\n  \"tags\",\n  \"parent\",\n] as const;\n\n/** Coverage of a single field: present vs applicable, with a rounded percent. */\nexport interface FieldCoverage {\n  present: number;\n  /** Items for which the field is expected (all items, except resolution = terminal only). */\n  applicable: number;\n  /** present/applicable * 100, rounded to one decimal; 100 when applicable is 0. */\n  percent: number;\n}\n\n/**\n * Documents the metadata coverage report payload exchanged by command, SDK, and package integrations.\n */\nexport interface MetadataCoverageReport {\n  overall: Record<CoverageField, FieldCoverage>;\n  by_type: Record<string, Record<CoverageField, FieldCoverage>>;\n}\n\nfunction isFieldPresent(item: CoverageItem, field: CoverageField): boolean {\n  switch (field) {\n    case \"acceptance_criteria\":\n      return !isAcMissing(item);\n    case \"estimated_minutes\":\n      return !isEstimateMissing(item);\n    case \"resolution\":\n      return toNonEmptyStringOrUndefined(item.resolution) !== undefined;\n    case \"tags\":\n      return Array.isArray(item.tags) && item.tags.length > 0;\n    default:\n      return toNonEmptyStringOrUndefined(item.parent) !== undefined;\n  }\n}\n\n/** Whether a field applies to a given item (resolution only applies to terminal items). */\nfunction isFieldApplicable(item: CoverageItem, field: CoverageField, classifier: LifecycleClassifier): boolean {\n  if (field === \"resolution\") {\n    return classifier.isTerminal(item.status);\n  }\n  return true;\n}\n\nfunction roundPercent(present: number, applicable: number): number {\n  if (applicable === 0) {\n    return 100;\n  }\n  return Math.round((present / applicable) * 1000) / 10;\n}\n\nfunction emptyFieldCoverage(): Record<CoverageField, FieldCoverage> {\n  const record = {} as Record<CoverageField, FieldCoverage>;\n  for (const field of COVERAGE_FIELD_ORDER) {\n    record[field] = { present: 0, applicable: 0, percent: 100 };\n  }\n  return record;\n}\n\nfunction accumulateCoverage(\n  target: Record<CoverageField, FieldCoverage>,\n  item: CoverageItem,\n  classifier: LifecycleClassifier,\n): void {\n  for (const field of COVERAGE_FIELD_ORDER) {\n    if (!isFieldApplicable(item, field, classifier)) {\n      continue;\n    }\n    const entry = target[field];\n    entry.applicable += 1;\n    if (isFieldPresent(item, field)) {\n      entry.present += 1;\n    }\n  }\n}\n\nfunction finalizePercentages(record: Record<CoverageField, FieldCoverage>): void {\n  for (const field of COVERAGE_FIELD_ORDER) {\n    const entry = record[field];\n    entry.percent = roundPercent(entry.present, entry.applicable);\n  }\n}\n\n/**\n * Compute metadata coverage overall and per item type. For each tracked field\n * we report present/applicable counts and a rounded percentage. Resolution is\n * scoped to terminal items (its only applicable population).\n */\nexport function computeMetadataCoverage(\n  items: readonly CoverageItem[],\n  classifier: LifecycleClassifier,\n): MetadataCoverageReport {\n  const overall = emptyFieldCoverage();\n  const byType: Record<string, Record<CoverageField, FieldCoverage>> = {};\n  for (const item of items) {\n    accumulateCoverage(overall, item, classifier);\n    const typeRecord = byType[item.type] ?? (byType[item.type] = emptyFieldCoverage());\n    accumulateCoverage(typeRecord, item, classifier);\n  }\n  finalizePercentages(overall);\n  for (const typeRecord of Object.values(byType)) {\n    finalizePercentages(typeRecord);\n  }\n  return { overall, by_type: byType };\n}\n\n// ---------------------------------------------------------------------------\n// Grouped lifecycle breakdowns\n// ---------------------------------------------------------------------------\n\n/** Dimensions a breakdown can group by. */\nexport type GroupDimension = \"assignee\" | \"priority\" | \"tag\" | \"parent\" | \"type\" | \"status\";\n\n/** Explicit labels for empty/blank group keys, by dimension. */\nconst EMPTY_GROUP_LABELS: Record<GroupDimension, string> = {\n  assignee: \"(unassigned)\",\n  priority: \"(no priority)\",\n  tag: \"(untagged)\",\n  parent: \"(unparented)\",\n  type: \"(untyped)\",\n  status: \"(no status)\",\n};\n\n/** Explicit label for an empty/blank group value for a given dimension. */\nexport function emptyGroupLabel(dimension: GroupDimension): string {\n  return EMPTY_GROUP_LABELS[dimension];\n}\n\n/**\n * Documents the group row payload exchanged by command, SDK, and package integrations.\n */\nexport interface GroupRow {\n  /** Display label; explicit \"(unassigned)\"-style label for blank keys. */\n  label: string;\n  /** Stable structured key (null for the empty/blank group). */\n  key: string | null;\n  buckets: Record<LifecycleBucket, number>;\n  total: number;\n}\n\n/**\n * Documents the grouped breakdown payload exchanged by command, SDK, and package integrations.\n */\nexport interface GroupedBreakdown {\n  dimension: GroupDimension;\n  rows: GroupRow[];\n  /** Distinct items observed (an item can contribute to multiple tag rows). */\n  total_items: number;\n}\n\n/**\n * Documents the group options payload exchanged by command, SDK, and package integrations.\n */\nexport interface GroupOptions {\n  /** For dimension=\"tag\": only consider tags starting with this prefix. */\n  tagPrefix?: string;\n}\n\nfunction emptyBuckets(): Record<LifecycleBucket, number> {\n  return {\n    open: 0,\n    in_progress: 0,\n    blocked: 0,\n    draft: 0,\n    closed: 0,\n    canceled: 0,\n    other: 0,\n  };\n}\n\n/**\n * Resolve the group keys an item belongs to for a dimension. Most dimensions\n * yield exactly one key (possibly null for blank); tag yields one key per\n * matching tag (or [null] when none match), so an item can span multiple rows.\n */\nfunction groupKeysForItem(item: CoverageItem, dimension: GroupDimension, options: GroupOptions): (string | null)[] {\n  switch (dimension) {\n    case \"assignee\":\n      return [toNonEmptyStringOrUndefined(item.assignee) ?? null];\n    case \"parent\":\n      return [toNonEmptyStringOrUndefined(item.parent) ?? null];\n    case \"type\":\n      return [toNonEmptyStringOrUndefined(item.type) ?? null];\n    case \"status\":\n      return [toNonEmptyStringOrUndefined(item.status) ?? null];\n    case \"priority\":\n      return [typeof item.priority === \"number\" ? `P${item.priority}` : null];\n    default: {\n      const prefix = options.tagPrefix?.trim();\n      const tags = Array.isArray(item.tags) ? item.tags : [];\n      const matching = tags.filter(\n        (tag) => typeof tag === \"string\" && tag.length > 0 && (!prefix || tag.startsWith(prefix)),\n      );\n      return matching.length > 0 ? matching : [null];\n    }\n  }\n}\n\n/**\n * Group items by a dimension into lifecycle-bucketed rows. Blank keys render\n * with an explicit \"(unassigned)\"-style label. Rows are sorted by total\n * descending, then label ascending, with the empty group sorted last on ties.\n */\nexport function groupItemsByDimension(\n  items: readonly CoverageItem[],\n  dimension: GroupDimension,\n  classifier: LifecycleClassifier,\n  options: GroupOptions = {},\n): GroupedBreakdown {\n  const rows = new Map<string, GroupRow>();\n  let totalItems = 0;\n  for (const item of items) {\n    totalItems += 1;\n    const bucket = classifier.classify(item.status);\n    for (const key of groupKeysForItem(item, dimension, options)) {\n      const mapKey = key ?? \"\u0000empty\";\n      let row = rows.get(mapKey);\n      if (!row) {\n        row = {\n          label: key ?? emptyGroupLabel(dimension),\n          key,\n          buckets: emptyBuckets(),\n          total: 0,\n        };\n        rows.set(mapKey, row);\n      }\n      row.buckets[bucket] += 1;\n      row.total += 1;\n    }\n  }\n  const sorted = [...rows.values()].sort((left, right) => {\n    if (right.total !== left.total) {\n      return right.total - left.total;\n    }\n    // All blank-key items collapse into a single row per dimension, so at most\n    // one row has key === null; it sorts last on ties.\n    if (left.key === null) {\n      return 1;\n    }\n    if (right.key === null) {\n      return -1;\n    }\n    return left.label.localeCompare(right.label);\n  });\n  return { dimension, rows: sorted, total_items: totalItems };\n}\n\n/** Lifecycle-bucket distribution across all items (for stats lifecycle section). */\nexport function computeLifecycleDistribution(\n  items: readonly CoverageItem[],\n  classifier: LifecycleClassifier,\n): Record<LifecycleBucket, number> {\n  const buckets = emptyBuckets();\n  for (const item of items) {\n    buckets[classifier.classify(item.status)] += 1;\n  }\n  return buckets;\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;;;AAEH,OAAO,EAAE,2BAA2B,EAAE,MAAM,yBAAyB,CAAC;AAgCtE,oDAAoD;AACpD,MAAM,CAAC,MAAM,sBAAsB,GAA+B;IAChE,MAAM;IACN,aAAa;IACb,SAAS;IACT,OAAO;IACP,QAAQ;IACR,UAAU;IACV,OAAO;CACC,CAAC;AAuBX,SAAS,eAAe,CAAC,MAAc,EAAE,QAA4B;IACnE,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC5C,OAAO,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC;AACtD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qCAAqC,CAAC,QAA4B;IAChF,OAAO;QACL,UAAU,CAAC,MAAc;YACvB,OAAO,QAAQ,CAAC,iBAAiB,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC3E,CAAC;QACD,QAAQ,CAAC,MAAc;YACrB,MAAM,EAAE,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC7C,IAAI,QAAQ,CAAC,0BAA0B,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChD,OAAO,UAAU,CAAC;YACpB,CAAC;YACD,IAAI,QAAQ,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvC,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI,QAAQ,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtC,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,IAAI,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,OAAO,OAAO,CAAC;YACjB,CAAC;YACD,IAAI,EAAE,KAAK,QAAQ,CAAC,WAAW,EAAE,CAAC;gBAChC,OAAO,MAAM,CAAC;YAChB,CAAC;YACD,IAAI,QAAQ,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACrC,OAAO,aAAa,CAAC;YACvB,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;KACF,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,8BAA8B;AAC9B,8EAA8E;AAE9E,8DAA8D;AAC9D,MAAM,UAAU,WAAW,CAAC,IAAkB;IAC5C,OAAO,2BAA2B,CAAC,IAAI,CAAC,mBAAmB,CAAC,KAAK,SAAS,CAAC;AAC7E,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,iBAAiB,CAAC,IAAkB;IAClD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;AAClD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAkB,EAAE,UAA+B;IACrF,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC;AACpE,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,iBAAiB,CAAC,IAAkB;IAClD,OAAO,2BAA2B,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,SAAS,CAAC;AAClE,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,aAAa,CAAC,IAAkB;IAC9C,OAAO,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC;AAC9D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAkB;IACpD,IAAI,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;QACxC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC;AACpE,CAAC;AAED,iDAAiD;AACjD,MAAM,UAAU,eAAe,CAAC,IAAkB;IAChD,OAAO,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;AAChE,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,gBAAgB,CAAC,IAAkB;IACjD,OAAO,2BAA2B,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;AACjE,CAAC;AAgBD,0DAA0D;AAC1D,MAAM,UAAU,wBAAwB,CAAC,OAA+B;IACtE,OAAO,OAAO,CACZ,OAAO,CAAC,SAAS;QACf,OAAO,CAAC,gBAAgB;QACxB,OAAO,CAAC,iBAAiB;QACzB,OAAO,CAAC,eAAe;QACvB,OAAO,CAAC,WAAW;QACnB,OAAO,CAAC,iBAAiB;QACzB,OAAO,CAAC,aAAa;QACrB,OAAO,CAAC,cAAc;QACtB,OAAO,CAAC,eAAe,CAC1B,CAAC;AACJ,CAAC;AAED,SAAS,kCAAkC,CACzC,IAAkB,EAClB,OAA+B,EAC/B,UAA+B;IAE/B,MAAM,MAAM,GAA0C;QACpD,CAAC,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC;QACtC,CAAC,OAAO,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC,OAAO,CAAC,iBAAiB,EAAE,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAClE,CAAC,OAAO,CAAC,eAAe,EAAE,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC,OAAO,CAAC,WAAW,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,OAAO,CAAC,iBAAiB,EAAE,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACtD,CAAC,OAAO,CAAC,aAAa,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC,OAAO,CAAC,cAAc,EAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC;KACjD,CAAC;IACF,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,SAAS,KAAK,IAAI,IAAI,OAAO,CAAC,CAAC;AAC/E,CAAC;AAED,SAAS,mCAAmC,CAAC,IAAkB,EAAE,UAA+B;IAC9F,OAAO,WAAW,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;AAC/F,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,0BAA0B,CACxC,IAAkB,EAClB,OAA+B,EAC/B,UAA+B;IAE/B,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,kCAAkC,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,CAAC;QACnE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,OAAO,CAAC,eAAe,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;QACtF,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,qBAAqB,CACnC,KAAmB,EACnB,OAA+B,EAC/B,UAA+B;IAE/B,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,0BAA0B,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;AACvF,CAAC;AAcD,wDAAwD;AACxD,MAAM,CAAC,MAAM,oBAAoB,GAA6B;IAC5D,qBAAqB;IACrB,mBAAmB;IACnB,YAAY;IACZ,MAAM;IACN,QAAQ;CACA,CAAC;AAmBX,SAAS,cAAc,CAAC,IAAkB,EAAE,KAAoB;IAC9D,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,qBAAqB;YACxB,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC5B,KAAK,mBAAmB;YACtB,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAClC,KAAK,YAAY;YACf,OAAO,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC;QACpE,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1D;YACE,OAAO,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;IAClE,CAAC;AACH,CAAC;AAED,2FAA2F;AAC3F,SAAS,iBAAiB,CAAC,IAAkB,EAAE,KAAoB,EAAE,UAA+B;IAClG,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;QAC3B,OAAO,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,OAAe,EAAE,UAAkB;IACvD,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;AACxD,CAAC;AAED,SAAS,kBAAkB;IACzB,MAAM,MAAM,GAAG,EAA0C,CAAC;IAC1D,KAAK,MAAM,KAAK,IAAI,oBAAoB,EAAE,CAAC;QACzC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;IAC9D,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CACzB,MAA4C,EAC5C,IAAkB,EAClB,UAA+B;IAE/B,KAAK,MAAM,KAAK,IAAI,oBAAoB,EAAE,CAAC;QACzC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;YAChD,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;QACtB,IAAI,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAAC,MAA4C;IACvE,KAAK,MAAM,KAAK,IAAI,oBAAoB,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,KAAK,CAAC,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAChE,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAA8B,EAC9B,UAA+B;IAE/B,MAAM,OAAO,GAAG,kBAAkB,EAAE,CAAC;IACrC,MAAM,MAAM,GAAyD,EAAE,CAAC;IACxE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,kBAAkB,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,kBAAkB,EAAE,CAAC,CAAC;QACnF,kBAAkB,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IACnD,CAAC;IACD,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC7B,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QAC/C,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AACtC,CAAC;AASD,gEAAgE;AAChE,MAAM,kBAAkB,GAAmC;IACzD,QAAQ,EAAE,cAAc;IACxB,QAAQ,EAAE,eAAe;IACzB,GAAG,EAAE,YAAY;IACjB,MAAM,EAAE,cAAc;IACtB,IAAI,EAAE,WAAW;IACjB,MAAM,EAAE,aAAa;CACtB,CAAC;AAEF,2EAA2E;AAC3E,MAAM,UAAU,eAAe,CAAC,SAAyB;IACvD,OAAO,kBAAkB,CAAC,SAAS,CAAC,CAAC;AACvC,CAAC;AAgCD,SAAS,YAAY;IACnB,OAAO;QACL,IAAI,EAAE,CAAC;QACP,WAAW,EAAE,CAAC;QACd,OAAO,EAAE,CAAC;QACV,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;QACT,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,CAAC;KACT,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAkB,EAAE,SAAyB,EAAE,OAAqB;IAC5F,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,UAAU;YACb,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;QAC9D,KAAK,QAAQ;YACX,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;QAC5D,KAAK,MAAM;YACT,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;QAC1D,KAAK,QAAQ;YACX,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;QAC5D,KAAK,UAAU;YACb,OAAO,CAAC,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1E,OAAO,CAAC,CAAC,CAAC;YACR,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAC1B,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAC1F,CAAC;YACF,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAA8B,EAC9B,SAAyB,EACzB,UAA+B,EAC/B,UAAwB,EAAE;IAE1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,IAAI,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChD,KAAK,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,GAAG,IAAI,QAAQ,CAAC;YAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,GAAG,GAAG;oBACJ,KAAK,EAAE,GAAG,IAAI,eAAe,CAAC,SAAS,CAAC;oBACxC,GAAG;oBACH,OAAO,EAAE,YAAY,EAAE;oBACvB,KAAK,EAAE,CAAC;iBACT,CAAC;gBACF,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACxB,CAAC;YACD,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACzB,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QACrD,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,OAAO,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAClC,CAAC;QACD,2EAA2E;QAC3E,mDAAmD;QACnD,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,IAAI,KAAK,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC;AAC9D,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,4BAA4B,CAC1C,KAA8B,EAC9B,UAA+B;IAE/B,MAAM,OAAO,GAAG,YAAY,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC","debugId":"f14cd0bc-bf31-5676-8e21-345fb9ecdd0d"}

package/dist/core/history/drift-scan.js

@@ -4,7 +4,7 @@
  * Implements append-only history and replay behavior for Drift Scan.
  */
 
-!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]="a928aad0-855f-5c7f-aa00-77d698ddca80")}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]="91c6995a-7219-5402-b2d4-e50227bf0149")}catch(e){}}();
 import fs from "fs/promises";
 import { createHash } from "node:crypto";
 import path from "node:path";
@@ -75,6 +75,62 @@ async function verifyHistoryStream(historyPath) {
         contentHash,
     };
 }
+function cacheMetadataMatches(cached, stat) {
+    return cached !== undefined && 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
+        : undefined;
+    const canUseCache = cacheMetadataMatches(params.cached, params.stat) && cachedContentHash !== undefined && params.cached !== undefined;
+    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,
+    };
+}
 /**
  * Scan every item's history stream for drift (missing/unreadable streams, broken
  * hash chains, and item/history hash mismatches).
@@ -86,10 +142,12 @@ async function verifyHistoryStream(historyPath) {
  * trusting the stat tuple and skip rereading unchanged streams.
  */
 export 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 = {};
@@ -105,97 +163,44 @@ export async function scanHistoryDrift(pmRoot, items, options = {}) {
         }
         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 !== undefined &&
-            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 : undefined;
-        const canUseCache = metadataMatchesCache && cachedContentHash !== undefined;
-        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) {
@@ -208,8 +213,15 @@ export async function scanHistoryDrift(pmRoot, items, options = {}) {
             // Best-effort cache write: a failed persist must never fail a health scan.
         }
     }
-    const driftedItems = [...new Set([...missingStreams, ...unreadableStreams, ...hashMismatches, ...chainMismatches])].sort((a, b) => a.localeCompare(b));
-    return { missingStreams, unreadableStreams, hashMismatches, chainMismatches, driftedItems };
+    const driftedItems = [
+        ...new Set([
+            ...accumulator.missingStreams,
+            ...accumulator.unreadableStreams,
+            ...accumulator.hashMismatches,
+            ...accumulator.chainMismatches,
+        ]),
+    ].sort((a, b) => a.localeCompare(b));
+    return { ...accumulator, driftedItems };
 }
 //# sourceMappingURL=drift-scan.js.map
-//# debugId=a928aad0-855f-5c7f-aa00-77d698ddca80
+//# debugId=91c6995a-7219-5402-b2d4-e50227bf0149

package/dist/core/history/drift-scan.js.map

@@ -1 +1 @@
-{"version":3,"file":"drift-scan.js","sources":["core/history/drift-scan.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module core/history/drift-scan\n *\n * Implements append-only history and replay behavior for Drift Scan.\n */\nimport fs from \"fs/promises\";\nimport { createHash } from \"node:crypto\";\nimport path from \"node:path\";\nimport { getHistoryPath } from \"../store/paths.js\";\nimport { writeFileAtomic } from \"../fs/fs-utils.js\";\nimport { hashDocument } from \"./history.js\";\nimport { verifyHistoryChain } from \"./replay.js\";\nimport type { HistoryEntry, ItemMetadata } from \"../../types/index.js\";\n\n/**\n * Documents the drift scan result payload exchanged by command, SDK, and package integrations.\n */\nexport interface DriftScanResult {\n  missingStreams: string[];\n  unreadableStreams: string[];\n  hashMismatches: string[];\n  chainMismatches: string[];\n  driftedItems: string[];\n}\n\nconst DRIFT_CACHE_VERSION = 3;\nconst DRIFT_CACHE_FILENAME = \"history-drift-cache.json\";\n\n/**\n * Controls how cached history stream verification is trusted when the file stat\n * tuple still matches a previous scan.\n */\nexport type DriftCacheHitVerification = \"content_hash\" | \"metadata\";\n\n/**\n * Documents the history drift scan options shared by health, validate, and\n * repair callers.\n */\nexport interface DriftScanOptions {\n  cacheHitVerification?: DriftCacheHitVerification;\n}\n\ninterface DriftCacheEntry {\n  mtime_ms: number;\n  ctime_ms: number;\n  size: number;\n  content_hash: string;\n  latest_after_hash: string;\n  chain_ok: boolean;\n}\n\ninterface DriftCacheEnvelope {\n  version: number;\n  entries: Record<string, DriftCacheEntry>;\n}\n\nfunction getDriftCachePath(pmRoot: string): string {\n  return path.join(pmRoot, \"runtime\", DRIFT_CACHE_FILENAME);\n}\n\nasync function loadDriftCache(pmRoot: string): Promise<DriftCacheEnvelope | null> {\n  try {\n    const raw = await fs.readFile(getDriftCachePath(pmRoot), \"utf8\");\n    const parsed = JSON.parse(raw) as DriftCacheEnvelope;\n    if (parsed.version !== DRIFT_CACHE_VERSION || typeof parsed.entries !== \"object\" || parsed.entries === null) {\n      return null;\n    }\n    return parsed;\n  } catch {\n    return null;\n  }\n}\n\nfunction isErrno(error: unknown, code: string): boolean {\n  return typeof error === \"object\" && error !== null && \"code\" in error && (error as { code?: string }).code === code;\n}\n\ninterface StreamVerification {\n  latestAfterHash: string;\n  chainOk: boolean;\n  contentHash: string;\n}\n\nfunction hashContent(raw: string): string {\n  return createHash(\"sha256\").update(raw).digest(\"hex\");\n}\n\nasync function readHistoryContentHash(historyPath: string): Promise<string> {\n  const raw = await fs.readFile(historyPath, \"utf8\");\n  return hashContent(raw);\n}\n\n/**\n * Read and fully verify one history stream's hash chain. Returns null for an\n * empty/missing stream (caller records it as a missing stream).\n */\nasync function verifyHistoryStream(historyPath: string): Promise<StreamVerification | null> {\n  const raw = await fs.readFile(historyPath, \"utf8\");\n  const contentHash = hashContent(raw);\n  if (raw.trim().length === 0) {\n    return null;\n  }\n  const entries: HistoryEntry[] = [];\n  let latestAfterHash: string | null = null;\n  for (const line of raw.split(/\\r?\\n/)) {\n    const trimmed = line.trim();\n    if (trimmed.length === 0) {\n      continue;\n    }\n    const parsed = JSON.parse(trimmed) as HistoryEntry;\n    if (typeof parsed.after_hash !== \"string\" || parsed.after_hash.trim().length === 0) {\n      throw new Error(\"missing after_hash\");\n    }\n    entries.push(parsed);\n    latestAfterHash = parsed.after_hash;\n  }\n  /* c8 ignore start -- defensive guard for future history schema changes. */\n  if (!latestAfterHash) {\n    return null;\n  }\n  /* c8 ignore stop */\n  return {\n    latestAfterHash,\n    chainOk: verifyHistoryChain(entries).ok,\n    contentHash,\n  };\n}\n\n/**\n * Scan every item's history stream for drift (missing/unreadable streams, broken\n * hash chains, and item/history hash mismatches).\n *\n * Full chain re-verification of a large history tree is the dominant cost of\n * `pm health`. We cache the per-stream verification keyed by the history file's\n * mtime/ctime/size plus content hash. Strict callers keep recomputing the\n * content hash on metadata hits; latency-sensitive health checks can opt into\n * trusting the stat tuple and skip rereading unchanged streams.\n */\nexport async function scanHistoryDrift(\n  pmRoot: string,\n  items: Array<ItemMetadata & { body: string }>,\n  options: DriftScanOptions = {},\n): Promise<DriftScanResult> {\n  const missingStreams: string[] = [];\n  const unreadableStreams: string[] = [];\n  const hashMismatches: string[] = [];\n  const chainMismatches: string[] = [];\n\n  const cache = await loadDriftCache(pmRoot);\n  const previousEntries: Record<string, DriftCacheEntry> = cache?.entries ?? {};\n  const nextEntries: Record<string, DriftCacheEntry> = {};\n  let cacheDirty = false;\n  // Metadata mode does not open a stat-matched stream, so unreadable-after-stat\n  // failures are intentionally deferred to strict validate/history-repair scans.\n  const verifyCacheHitByContent = options.cacheHitVerification !== \"metadata\";\n\n  for (const item of items) {\n    const historyPath = getHistoryPath(pmRoot, item.id);\n\n    let stat: Awaited<ReturnType<typeof fs.stat>>;\n    try {\n      stat = await fs.stat(historyPath);\n    } catch (error: unknown) {\n      if (isErrno(error, \"ENOENT\")) {\n        missingStreams.push(item.id);\n      } else {\n        unreadableStreams.push(item.id);\n      }\n      continue;\n    }\n\n    const loadStreamVerification = async (): Promise<StreamVerification | null | \"unreadable\"> => {\n      try {\n        return await verifyHistoryStream(historyPath);\n      } catch {\n        return \"unreadable\";\n      }\n    };\n\n    const loadFreshVerification = async (): Promise<StreamVerification | null> => {\n      const loaded = await loadStreamVerification();\n      if (loaded === \"unreadable\") {\n        unreadableStreams.push(item.id);\n        return null;\n      }\n      if (!loaded) {\n        missingStreams.push(item.id);\n        return null;\n      }\n      return loaded;\n    };\n\n    const cached = previousEntries[item.id];\n    let verification: StreamVerification;\n    const metadataMatchesCache =\n      cached !== undefined &&\n      cached.mtime_ms === stat.mtimeMs &&\n      cached.ctime_ms === stat.ctimeMs &&\n      cached.size === stat.size;\n    const cachedContentHash =\n      typeof cached?.content_hash === \"string\" && cached.content_hash.length > 0 ? cached.content_hash : undefined;\n    const canUseCache = metadataMatchesCache && cachedContentHash !== undefined;\n    if (canUseCache && cached) {\n      let currentContentHash: string;\n      if (verifyCacheHitByContent) {\n        try {\n          currentContentHash = await readHistoryContentHash(historyPath);\n        } catch {\n          unreadableStreams.push(item.id);\n          continue;\n        }\n      } else {\n        currentContentHash = cachedContentHash;\n      }\n      if (!verifyCacheHitByContent || currentContentHash === cachedContentHash) {\n        verification = {\n          latestAfterHash: cached.latest_after_hash,\n          chainOk: cached.chain_ok,\n          contentHash: currentContentHash,\n        };\n      } else {\n        cacheDirty = true;\n        const refreshed = await loadFreshVerification();\n        if (!refreshed) {\n          continue;\n        }\n        verification = refreshed;\n      }\n    } else {\n      cacheDirty = true;\n      const refreshed = await loadFreshVerification();\n      if (!refreshed) {\n        continue;\n      }\n      verification = refreshed;\n    }\n\n    if (!verification.chainOk) {\n      chainMismatches.push(item.id);\n    }\n    nextEntries[item.id] = {\n      mtime_ms: stat.mtimeMs,\n      ctime_ms: stat.ctimeMs,\n      size: stat.size,\n      content_hash: verification.contentHash,\n      latest_after_hash: verification.latestAfterHash,\n      chain_ok: verification.chainOk,\n    };\n\n    const { body, ...frontMatter } = item;\n    const currentHash = hashDocument({\n      metadata: frontMatter as ItemMetadata,\n      body,\n    });\n    if (currentHash !== verification.latestAfterHash) {\n      hashMismatches.push(item.id);\n    }\n  }\n\n  if (cacheDirty || Object.keys(previousEntries).length !== Object.keys(nextEntries).length) {\n    const cachePath = getDriftCachePath(pmRoot);\n    try {\n      await fs.mkdir(path.dirname(cachePath), { recursive: true });\n      await writeFileAtomic(cachePath, JSON.stringify({ version: DRIFT_CACHE_VERSION, entries: nextEntries }));\n    } catch {\n      // Best-effort cache write: a failed persist must never fail a health scan.\n    }\n  }\n\n  const driftedItems = [...new Set([...missingStreams, ...unreadableStreams, ...hashMismatches, ...chainMismatches])].sort((a, b) =>\n    a.localeCompare(b),\n  );\n  return { missingStreams, unreadableStreams, hashMismatches, chainMismatches, driftedItems };\n}\n"],"names":[],"mappings":"AAAA;;;;GAIG;;;AACH,OAAO,EAAE,MAAM,aAAa,CAAC;AAC7B,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAcjD,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,oBAAoB,GAAG,0BAA0B,CAAC;AA8BxD,SAAS,iBAAiB,CAAC,MAAc;IACvC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;AAC5D,CAAC;AAED,KAAK,UAAU,cAAc,CAAC,MAAc;IAC1C,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAuB,CAAC;QACrD,IAAI,MAAM,CAAC,OAAO,KAAK,mBAAmB,IAAI,OAAO,MAAM,CAAC,OAAO,KAAK,QAAQ,IAAI,MAAM,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YAC5G,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,KAAc,EAAE,IAAY;IAC3C,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK,IAAK,KAA2B,CAAC,IAAI,KAAK,IAAI,CAAC;AACtH,CAAC;AAQD,SAAS,WAAW,CAAC,GAAW;IAC9B,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAED,KAAK,UAAU,sBAAsB,CAAC,WAAmB;IACvD,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACnD,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,mBAAmB,CAAC,WAAmB;IACpD,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACnD,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,IAAI,eAAe,GAAkB,IAAI,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAiB,CAAC;QACnD,IAAI,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnF,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;IACtC,CAAC;IACD,2EAA2E;IAC3E,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,oBAAoB;IACpB,OAAO;QACL,eAAe;QACf,OAAO,EAAE,kBAAkB,CAAC,OAAO,CAAC,CAAC,EAAE;QACvC,WAAW;KACZ,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,MAAc,EACd,KAA6C,EAC7C,UAA4B,EAAE;IAE9B,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,iBAAiB,GAAa,EAAE,CAAC;IACvC,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,eAAe,GAAa,EAAE,CAAC;IAErC,MAAM,KAAK,GAAG,MAAM,cAAc,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,eAAe,GAAoC,KAAK,EAAE,OAAO,IAAI,EAAE,CAAC;IAC9E,MAAM,WAAW,GAAoC,EAAE,CAAC;IACxD,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,8EAA8E;IAC9E,+EAA+E;IAC/E,MAAM,uBAAuB,GAAG,OAAO,CAAC,oBAAoB,KAAK,UAAU,CAAC;IAE5E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAEpD,IAAI,IAAyC,CAAC;QAC9C,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpC,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACxB,IAAI,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC7B,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,SAAS;QACX,CAAC;QAED,MAAM,sBAAsB,GAAG,KAAK,IAAuD,EAAE;YAC3F,IAAI,CAAC;gBACH,OAAO,MAAM,mBAAmB,CAAC,WAAW,CAAC,CAAC;YAChD,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,YAAY,CAAC;YACtB,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,qBAAqB,GAAG,KAAK,IAAwC,EAAE;YAC3E,MAAM,MAAM,GAAG,MAAM,sBAAsB,EAAE,CAAC;YAC9C,IAAI,MAAM,KAAK,YAAY,EAAE,CAAC;gBAC5B,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7B,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,YAAgC,CAAC;QACrC,MAAM,oBAAoB,GACxB,MAAM,KAAK,SAAS;YACpB,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,OAAO;YAChC,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,OAAO;YAChC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;QAC5B,MAAM,iBAAiB,GACrB,OAAO,MAAM,EAAE,YAAY,KAAK,QAAQ,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;QAC/G,MAAM,WAAW,GAAG,oBAAoB,IAAI,iBAAiB,KAAK,SAAS,CAAC;QAC5E,IAAI,WAAW,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,kBAA0B,CAAC;YAC/B,IAAI,uBAAuB,EAAE,CAAC;gBAC5B,IAAI,CAAC;oBACH,kBAAkB,GAAG,MAAM,sBAAsB,CAAC,WAAW,CAAC,CAAC;gBACjE,CAAC;gBAAC,MAAM,CAAC;oBACP,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAChC,SAAS;gBACX,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,kBAAkB,GAAG,iBAAiB,CAAC;YACzC,CAAC;YACD,IAAI,CAAC,uBAAuB,IAAI,kBAAkB,KAAK,iBAAiB,EAAE,CAAC;gBACzE,YAAY,GAAG;oBACb,eAAe,EAAE,MAAM,CAAC,iBAAiB;oBACzC,OAAO,EAAE,MAAM,CAAC,QAAQ;oBACxB,WAAW,EAAE,kBAAkB;iBAChC,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,UAAU,GAAG,IAAI,CAAC;gBAClB,MAAM,SAAS,GAAG,MAAM,qBAAqB,EAAE,CAAC;gBAChD,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS;gBACX,CAAC;gBACD,YAAY,GAAG,SAAS,CAAC;YAC3B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM,SAAS,GAAG,MAAM,qBAAqB,EAAE,CAAC;YAChD,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,SAAS;YACX,CAAC;YACD,YAAY,GAAG,SAAS,CAAC;QAC3B,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;YAC1B,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG;YACrB,QAAQ,EAAE,IAAI,CAAC,OAAO;YACtB,QAAQ,EAAE,IAAI,CAAC,OAAO;YACtB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,YAAY,EAAE,YAAY,CAAC,WAAW;YACtC,iBAAiB,EAAE,YAAY,CAAC,eAAe;YAC/C,QAAQ,EAAE,YAAY,CAAC,OAAO;SAC/B,CAAC;QAEF,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,EAAE,GAAG,IAAI,CAAC;QACtC,MAAM,WAAW,GAAG,YAAY,CAAC;YAC/B,QAAQ,EAAE,WAA2B;YACrC,IAAI;SACL,CAAC,CAAC;QACH,IAAI,WAAW,KAAK,YAAY,CAAC,eAAe,EAAE,CAAC;YACjD,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,IAAI,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1F,MAAM,SAAS,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC;YACH,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC7D,MAAM,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,mBAAmB,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;QAC3G,CAAC;QAAC,MAAM,CAAC;YACP,2EAA2E;QAC7E,CAAC;IACH,CAAC;IAED,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,cAAc,EAAE,GAAG,iBAAiB,EAAE,GAAG,cAAc,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAChI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CACnB,CAAC;IACF,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,cAAc,EAAE,eAAe,EAAE,YAAY,EAAE,CAAC;AAC9F,CAAC","debugId":"a928aad0-855f-5c7f-aa00-77d698ddca80"}
+{"version":3,"file":"drift-scan.js","sources":["core/history/drift-scan.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module core/history/drift-scan\n *\n * Implements append-only history and replay behavior for Drift Scan.\n */\nimport fs from \"fs/promises\";\nimport { createHash } from \"node:crypto\";\nimport path from \"node:path\";\nimport { getHistoryPath } from \"../store/paths.js\";\nimport { writeFileAtomic } from \"../fs/fs-utils.js\";\nimport { hashDocument } from \"./history.js\";\nimport { verifyHistoryChain } from \"./replay.js\";\nimport type { HistoryEntry, ItemMetadata } from \"../../types/index.js\";\n\n/**\n * Documents the drift scan result payload exchanged by command, SDK, and package integrations.\n */\nexport interface DriftScanResult {\n  missingStreams: string[];\n  unreadableStreams: string[];\n  hashMismatches: string[];\n  chainMismatches: string[];\n  driftedItems: string[];\n}\n\nconst DRIFT_CACHE_VERSION = 3;\nconst DRIFT_CACHE_FILENAME = \"history-drift-cache.json\";\n\n/**\n * Controls how cached history stream verification is trusted when the file stat\n * tuple still matches a previous scan.\n */\nexport type DriftCacheHitVerification = \"content_hash\" | \"metadata\";\n\n/**\n * Documents the history drift scan options shared by health, validate, and\n * repair callers.\n */\nexport interface DriftScanOptions {\n  cacheHitVerification?: DriftCacheHitVerification;\n}\n\ninterface DriftCacheEntry {\n  mtime_ms: number;\n  ctime_ms: number;\n  size: number;\n  content_hash: string;\n  latest_after_hash: string;\n  chain_ok: boolean;\n}\n\ninterface DriftCacheEnvelope {\n  version: number;\n  entries: Record<string, DriftCacheEntry>;\n}\n\nfunction getDriftCachePath(pmRoot: string): string {\n  return path.join(pmRoot, \"runtime\", DRIFT_CACHE_FILENAME);\n}\n\nasync function loadDriftCache(pmRoot: string): Promise<DriftCacheEnvelope | null> {\n  try {\n    const raw = await fs.readFile(getDriftCachePath(pmRoot), \"utf8\");\n    const parsed = JSON.parse(raw) as DriftCacheEnvelope;\n    if (parsed.version !== DRIFT_CACHE_VERSION || typeof parsed.entries !== \"object\" || parsed.entries === null) {\n      return null;\n    }\n    return parsed;\n  } catch {\n    return null;\n  }\n}\n\nfunction isErrno(error: unknown, code: string): boolean {\n  return typeof error === \"object\" && error !== null && \"code\" in error && (error as { code?: string }).code === code;\n}\n\ninterface StreamVerification {\n  latestAfterHash: string;\n  chainOk: boolean;\n  contentHash: string;\n}\n\ninterface DriftScanAccumulator {\n  missingStreams: string[];\n  unreadableStreams: string[];\n  hashMismatches: string[];\n  chainMismatches: string[];\n}\n\nfunction hashContent(raw: string): string {\n  return createHash(\"sha256\").update(raw).digest(\"hex\");\n}\n\nasync function readHistoryContentHash(historyPath: string): Promise<string> {\n  const raw = await fs.readFile(historyPath, \"utf8\");\n  return hashContent(raw);\n}\n\n/**\n * Read and fully verify one history stream's hash chain. Returns null for an\n * empty/missing stream (caller records it as a missing stream).\n */\nasync function verifyHistoryStream(historyPath: string): Promise<StreamVerification | null> {\n  const raw = await fs.readFile(historyPath, \"utf8\");\n  const contentHash = hashContent(raw);\n  if (raw.trim().length === 0) {\n    return null;\n  }\n  const entries: HistoryEntry[] = [];\n  let latestAfterHash: string | null = null;\n  for (const line of raw.split(/\\r?\\n/)) {\n    const trimmed = line.trim();\n    if (trimmed.length === 0) {\n      continue;\n    }\n    const parsed = JSON.parse(trimmed) as HistoryEntry;\n    if (typeof parsed.after_hash !== \"string\" || parsed.after_hash.trim().length === 0) {\n      throw new Error(\"missing after_hash\");\n    }\n    entries.push(parsed);\n    latestAfterHash = parsed.after_hash;\n  }\n  /* c8 ignore start -- defensive guard for future history schema changes. */\n  if (!latestAfterHash) {\n    return null;\n  }\n  /* c8 ignore stop */\n  return {\n    latestAfterHash,\n    chainOk: verifyHistoryChain(entries).ok,\n    contentHash,\n  };\n}\n\nfunction cacheMetadataMatches(cached: DriftCacheEntry | undefined, stat: Awaited<ReturnType<typeof fs.stat>>): boolean {\n  return cached !== undefined && cached.mtime_ms === stat.mtimeMs && cached.ctime_ms === stat.ctimeMs && cached.size === stat.size;\n}\n\nasync function loadFreshStreamVerification(\n  itemId: string,\n  historyPath: string,\n  accumulator: DriftScanAccumulator,\n): Promise<StreamVerification | null> {\n  try {\n    const loaded = await verifyHistoryStream(historyPath);\n    if (!loaded) {\n      accumulator.missingStreams.push(itemId);\n      return null;\n    }\n    return loaded;\n  } catch {\n    accumulator.unreadableStreams.push(itemId);\n    return null;\n  }\n}\n\nasync function resolveStreamVerification(params: {\n  itemId: string;\n  historyPath: string;\n  stat: Awaited<ReturnType<typeof fs.stat>>;\n  cached: DriftCacheEntry | undefined;\n  verifyCacheHitByContent: boolean;\n  accumulator: DriftScanAccumulator;\n}): Promise<{ verification: StreamVerification | null; cacheDirty: boolean }> {\n  const cachedContentHash =\n    typeof params.cached?.content_hash === \"string\" && params.cached.content_hash.length > 0\n      ? params.cached.content_hash\n      : undefined;\n  const canUseCache = cacheMetadataMatches(params.cached, params.stat) && cachedContentHash !== undefined && params.cached !== undefined;\n  if (!canUseCache || !params.cached) {\n    return {\n      verification: await loadFreshStreamVerification(params.itemId, params.historyPath, params.accumulator),\n      cacheDirty: true,\n    };\n  }\n  let currentContentHash: string;\n  if (params.verifyCacheHitByContent) {\n    try {\n      currentContentHash = await readHistoryContentHash(params.historyPath);\n    } catch {\n      params.accumulator.unreadableStreams.push(params.itemId);\n      return { verification: null, cacheDirty: false };\n    }\n  } else {\n    currentContentHash = cachedContentHash;\n  }\n  if (!params.verifyCacheHitByContent || currentContentHash === cachedContentHash) {\n    return {\n      verification: {\n        latestAfterHash: params.cached.latest_after_hash,\n        chainOk: params.cached.chain_ok,\n        contentHash: currentContentHash,\n      },\n      cacheDirty: false,\n    };\n  }\n  return {\n    verification: await loadFreshStreamVerification(params.itemId, params.historyPath, params.accumulator),\n    cacheDirty: true,\n  };\n}\n\n/**\n * Scan every item's history stream for drift (missing/unreadable streams, broken\n * hash chains, and item/history hash mismatches).\n *\n * Full chain re-verification of a large history tree is the dominant cost of\n * `pm health`. We cache the per-stream verification keyed by the history file's\n * mtime/ctime/size plus content hash. Strict callers keep recomputing the\n * content hash on metadata hits; latency-sensitive health checks can opt into\n * trusting the stat tuple and skip rereading unchanged streams.\n */\nexport async function scanHistoryDrift(\n  pmRoot: string,\n  items: Array<ItemMetadata & { body: string }>,\n  options: DriftScanOptions = {},\n): Promise<DriftScanResult> {\n  const accumulator: DriftScanAccumulator = {\n    missingStreams: [],\n    unreadableStreams: [],\n    hashMismatches: [],\n    chainMismatches: [],\n  };\n\n  const cache = await loadDriftCache(pmRoot);\n  const previousEntries: Record<string, DriftCacheEntry> = cache?.entries ?? {};\n  const nextEntries: Record<string, DriftCacheEntry> = {};\n  let cacheDirty = false;\n  // Metadata mode does not open a stat-matched stream, so unreadable-after-stat\n  // failures are intentionally deferred to strict validate/history-repair scans.\n  const verifyCacheHitByContent = options.cacheHitVerification !== \"metadata\";\n\n  for (const item of items) {\n    const historyPath = getHistoryPath(pmRoot, item.id);\n\n    let stat: Awaited<ReturnType<typeof fs.stat>>;\n    try {\n      stat = await fs.stat(historyPath);\n    } catch (error: unknown) {\n      if (isErrno(error, \"ENOENT\")) {\n        accumulator.missingStreams.push(item.id);\n      } else {\n        accumulator.unreadableStreams.push(item.id);\n      }\n      continue;\n    }\n\n    const cached = previousEntries[item.id];\n    const resolved = await resolveStreamVerification({\n      itemId: item.id,\n      historyPath,\n      stat,\n      cached,\n      verifyCacheHitByContent,\n      accumulator,\n    });\n    cacheDirty ||= resolved.cacheDirty;\n    if (!resolved.verification) {\n      continue;\n    }\n\n    if (!resolved.verification.chainOk) {\n      accumulator.chainMismatches.push(item.id);\n    }\n    nextEntries[item.id] = {\n      mtime_ms: stat.mtimeMs,\n      ctime_ms: stat.ctimeMs,\n      size: stat.size,\n      content_hash: resolved.verification.contentHash,\n      latest_after_hash: resolved.verification.latestAfterHash,\n      chain_ok: resolved.verification.chainOk,\n    };\n\n    const { body, ...frontMatter } = item;\n    const currentHash = hashDocument({\n      metadata: frontMatter as ItemMetadata,\n      body,\n    });\n    if (currentHash !== resolved.verification.latestAfterHash) {\n      accumulator.hashMismatches.push(item.id);\n    }\n  }\n\n  if (cacheDirty || Object.keys(previousEntries).length !== Object.keys(nextEntries).length) {\n    const cachePath = getDriftCachePath(pmRoot);\n    try {\n      await fs.mkdir(path.dirname(cachePath), { recursive: true });\n      await writeFileAtomic(cachePath, JSON.stringify({ version: DRIFT_CACHE_VERSION, entries: nextEntries }));\n    } catch {\n      // Best-effort cache write: a failed persist must never fail a health scan.\n    }\n  }\n\n  const driftedItems = [\n    ...new Set([\n      ...accumulator.missingStreams,\n      ...accumulator.unreadableStreams,\n      ...accumulator.hashMismatches,\n      ...accumulator.chainMismatches,\n    ]),\n  ].sort((a, b) => a.localeCompare(b));\n  return { ...accumulator, driftedItems };\n}\n"],"names":[],"mappings":"AAAA;;;;GAIG;;;AACH,OAAO,EAAE,MAAM,aAAa,CAAC;AAC7B,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAcjD,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,oBAAoB,GAAG,0BAA0B,CAAC;AA8BxD,SAAS,iBAAiB,CAAC,MAAc;IACvC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;AAC5D,CAAC;AAED,KAAK,UAAU,cAAc,CAAC,MAAc;IAC1C,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAuB,CAAC;QACrD,IAAI,MAAM,CAAC,OAAO,KAAK,mBAAmB,IAAI,OAAO,MAAM,CAAC,OAAO,KAAK,QAAQ,IAAI,MAAM,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YAC5G,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,KAAc,EAAE,IAAY;IAC3C,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK,IAAK,KAA2B,CAAC,IAAI,KAAK,IAAI,CAAC;AACtH,CAAC;AAeD,SAAS,WAAW,CAAC,GAAW;IAC9B,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC;AAED,KAAK,UAAU,sBAAsB,CAAC,WAAmB;IACvD,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACnD,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,mBAAmB,CAAC,WAAmB;IACpD,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACnD,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,IAAI,eAAe,GAAkB,IAAI,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAiB,CAAC;QACnD,IAAI,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnF,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;IACtC,CAAC;IACD,2EAA2E;IAC3E,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,oBAAoB;IACpB,OAAO;QACL,eAAe;QACf,OAAO,EAAE,kBAAkB,CAAC,OAAO,CAAC,CAAC,EAAE;QACvC,WAAW;KACZ,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAAC,MAAmC,EAAE,IAAyC;IAC1G,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;AACnI,CAAC;AAED,KAAK,UAAU,2BAA2B,CACxC,MAAc,EACd,WAAmB,EACnB,WAAiC;IAEjC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,mBAAmB,CAAC,WAAW,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,MAAM,CAAC;QACP,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,KAAK,UAAU,yBAAyB,CAAC,MAOxC;IACC,MAAM,iBAAiB,GACrB,OAAO,MAAM,CAAC,MAAM,EAAE,YAAY,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;QACtF,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY;QAC5B,CAAC,CAAC,SAAS,CAAC;IAChB,MAAM,WAAW,GAAG,oBAAoB,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,iBAAiB,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC;IACvI,IAAI,CAAC,WAAW,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QACnC,OAAO;YACL,YAAY,EAAE,MAAM,2BAA2B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC;YACtG,UAAU,EAAE,IAAI;SACjB,CAAC;IACJ,CAAC;IACD,IAAI,kBAA0B,CAAC;IAC/B,IAAI,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,IAAI,CAAC;YACH,kBAAkB,GAAG,MAAM,sBAAsB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACxE,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,CAAC,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACzD,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;QACnD,CAAC;IACH,CAAC;SAAM,CAAC;QACN,kBAAkB,GAAG,iBAAiB,CAAC;IACzC,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,uBAAuB,IAAI,kBAAkB,KAAK,iBAAiB,EAAE,CAAC;QAChF,OAAO;YACL,YAAY,EAAE;gBACZ,eAAe,EAAE,MAAM,CAAC,MAAM,CAAC,iBAAiB;gBAChD,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ;gBAC/B,WAAW,EAAE,kBAAkB;aAChC;YACD,UAAU,EAAE,KAAK;SAClB,CAAC;IACJ,CAAC;IACD,OAAO;QACL,YAAY,EAAE,MAAM,2BAA2B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC;QACtG,UAAU,EAAE,IAAI;KACjB,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,MAAc,EACd,KAA6C,EAC7C,UAA4B,EAAE;IAE9B,MAAM,WAAW,GAAyB;QACxC,cAAc,EAAE,EAAE;QAClB,iBAAiB,EAAE,EAAE;QACrB,cAAc,EAAE,EAAE;QAClB,eAAe,EAAE,EAAE;KACpB,CAAC;IAEF,MAAM,KAAK,GAAG,MAAM,cAAc,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,eAAe,GAAoC,KAAK,EAAE,OAAO,IAAI,EAAE,CAAC;IAC9E,MAAM,WAAW,GAAoC,EAAE,CAAC;IACxD,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,8EAA8E;IAC9E,+EAA+E;IAC/E,MAAM,uBAAuB,GAAG,OAAO,CAAC,oBAAoB,KAAK,UAAU,CAAC;IAE5E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAEpD,IAAI,IAAyC,CAAC;QAC9C,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpC,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACxB,IAAI,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC7B,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9C,CAAC;YACD,SAAS;QACX,CAAC;QAED,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,MAAM,yBAAyB,CAAC;YAC/C,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,WAAW;YACX,IAAI;YACJ,MAAM;YACN,uBAAuB;YACvB,WAAW;SACZ,CAAC,CAAC;QACH,UAAU,KAAK,QAAQ,CAAC,UAAU,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC3B,SAAS;QACX,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;YACnC,WAAW,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG;YACrB,QAAQ,EAAE,IAAI,CAAC,OAAO;YACtB,QAAQ,EAAE,IAAI,CAAC,OAAO;YACtB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,YAAY,EAAE,QAAQ,CAAC,YAAY,CAAC,WAAW;YAC/C,iBAAiB,EAAE,QAAQ,CAAC,YAAY,CAAC,eAAe;YACxD,QAAQ,EAAE,QAAQ,CAAC,YAAY,CAAC,OAAO;SACxC,CAAC;QAEF,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,EAAE,GAAG,IAAI,CAAC;QACtC,MAAM,WAAW,GAAG,YAAY,CAAC;YAC/B,QAAQ,EAAE,WAA2B;YACrC,IAAI;SACL,CAAC,CAAC;QACH,IAAI,WAAW,KAAK,QAAQ,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;YAC1D,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,IAAI,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1F,MAAM,SAAS,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC;YACH,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC7D,MAAM,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,mBAAmB,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;QAC3G,CAAC;QAAC,MAAM,CAAC;YACP,2EAA2E;QAC7E,CAAC;IACH,CAAC;IAED,MAAM,YAAY,GAAG;QACnB,GAAG,IAAI,GAAG,CAAC;YACT,GAAG,WAAW,CAAC,cAAc;YAC7B,GAAG,WAAW,CAAC,iBAAiB;YAChC,GAAG,WAAW,CAAC,cAAc;YAC7B,GAAG,WAAW,CAAC,eAAe;SAC/B,CAAC;KACH,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,EAAE,GAAG,WAAW,EAAE,YAAY,EAAE,CAAC;AAC1C,CAAC","debugId":"91c6995a-7219-5402-b2d4-e50227bf0149"}