@unbrained/pm-cli 2026.7.1 → 2026.7.3

package/dist/core/config/nested-settings.js

@@ -27,7 +27,7 @@
  * `pm config list` and in error hints.
  */
 
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="439e5c08-5cff-56f0-a21d-15ffdb7afe94")}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]="b0ddd8ee-f289-5872-bce9-00b573abca7e")}catch(e){}}();
 export const NESTED_SETTING_DESCRIPTORS = [
     {
         key: "search_provider",
@@ -278,51 +278,39 @@ export function resolveNestedSettingDescriptor(raw) {
     }
     return DESCRIPTOR_BY_KEY.get(normalized);
 }
-/**
- * Validate and coerce a raw string value for a nested-leaf setting. The
- * returned value is the typed leaf that should be written into PmSettings.
- *
- * Empty strings are allowed for "string" leaves unless `non_empty` is set.
- */
-export function parseNestedSettingValue(descriptor, rawValue) {
-    if (typeof rawValue !== "string") {
-        return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };
+function parseNestedBooleanValue(descriptor, rawValue) {
+    const normalized = rawValue.trim().toLowerCase();
+    if (normalized === "true" || normalized === "1" || normalized === "yes" || normalized === "on") {
+        return { ok: true, parsed: { descriptor, value: true } };
     }
-    const trimmed = rawValue.trim();
-    if (descriptor.kind === "boolean") {
-        const normalized = trimmed.toLowerCase();
-        if (normalized === "true" || normalized === "1" || normalized === "yes" || normalized === "on") {
-            return { ok: true, parsed: { descriptor, value: true } };
-        }
-        if (normalized === "false" || normalized === "0" || normalized === "no" || normalized === "off") {
-            return { ok: true, parsed: { descriptor, value: false } };
-        }
+    if (normalized === "false" || normalized === "0" || normalized === "no" || normalized === "off") {
+        return { ok: true, parsed: { descriptor, value: false } };
+    }
+    return {
+        ok: false,
+        error: {
+            message: `Config set ${descriptor.key} requires a boolean value (true|false), got "${rawValue}"`,
+        },
+    };
+}
+function parseNestedStringValue(descriptor, rawValue, trimmed) {
+    if (descriptor.non_empty === true && trimmed.length === 0) {
+        return {
+            ok: false,
+            error: { message: `Config set ${descriptor.key} requires a non-empty value` },
+        };
+    }
+    if (descriptor.choices && !descriptor.choices.includes(trimmed)) {
         return {
             ok: false,
             error: {
-                message: `Config set ${descriptor.key} requires a boolean value (true|false), got "${rawValue}"`,
+                message: `Config set ${descriptor.key} must be one of ${descriptor.choices.join("|")}, got "${rawValue}"`,
             },
         };
     }
-    if (descriptor.kind === "string") {
-        if (descriptor.non_empty === true && trimmed.length === 0) {
-            return {
-                ok: false,
-                error: { message: `Config set ${descriptor.key} requires a non-empty value` },
-            };
-        }
-        if (descriptor.choices && !descriptor.choices.includes(trimmed)) {
-            return {
-                ok: false,
-                error: {
-                    message: `Config set ${descriptor.key} must be one of ${descriptor.choices.join("|")}, got "${rawValue}"`,
-                },
-            };
-        }
-        return { ok: true, parsed: { descriptor, value: trimmed } };
-    }
-    // Number("") === 0, which would silently accept empty / whitespace-only input
-    // as a valid zero. Reject explicitly so misconfigurations don't slip through.
+    return { ok: true, parsed: { descriptor, value: trimmed } };
+}
+function parseFiniteNestedNumber(descriptor, rawValue, trimmed) {
     if (trimmed.length === 0) {
         return {
             ok: false,
@@ -336,40 +324,74 @@ export function parseNestedSettingValue(descriptor, rawValue) {
             error: { message: `Config set ${descriptor.key} requires a finite number, got "${rawValue}"` },
         };
     }
-    if (descriptor.kind === "integer") {
-        if (!Number.isInteger(parsed) || parsed < 0) {
-            return {
-                ok: false,
-                error: { message: `Config set ${descriptor.key} requires a non-negative integer, got "${rawValue}"` },
-            };
-        }
-        if (descriptor.min !== undefined && parsed < descriptor.min) {
-            return {
-                ok: false,
-                error: {
-                    message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got "${rawValue}" (the runtime silently ignores 0 here and falls back to the default)`,
-                },
-            };
-        }
-        return { ok: true, parsed: { descriptor, value: parsed } };
+    return { ok: true, value: parsed };
+}
+function parseNestedIntegerValue(descriptor, rawValue, value) {
+    if (!Number.isInteger(value) || value < 0) {
+        return {
+            ok: false,
+            error: { message: `Config set ${descriptor.key} requires a non-negative integer, got "${rawValue}"` },
+        };
     }
-    if (descriptor.kind === "ratio") {
-        if (parsed < 0 || parsed > 1) {
-            return {
-                ok: false,
-                error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got "${rawValue}"` },
-            };
-        }
-        return { ok: true, parsed: { descriptor, value: parsed } };
+    if (descriptor.min !== undefined && value < descriptor.min) {
+        return {
+            ok: false,
+            error: {
+                message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got "${rawValue}" (the runtime silently ignores 0 here and falls back to the default)`,
+            },
+        };
     }
-    // kind === "number" — negatives are allowed; only apply an explicit `min`.
-    if (descriptor.min !== undefined && parsed < descriptor.min) {
+    return { ok: true, parsed: { descriptor, value } };
+}
+function parseNestedRatioValue(descriptor, rawValue, value) {
+    if (value < 0 || value > 1) {
+        return {
+            ok: false,
+            error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got "${rawValue}"` },
+        };
+    }
+    return { ok: true, parsed: { descriptor, value } };
+}
+function parseNestedNumberValue(descriptor, rawValue, value) {
+    if (descriptor.min !== undefined && value < descriptor.min) {
         return {
             ok: false,
             error: { message: `Config set ${descriptor.key} requires a number >= ${descriptor.min}, got "${rawValue}"` },
         };
     }
-    return { ok: true, parsed: { descriptor, value: parsed } };
+    return { ok: true, parsed: { descriptor, value } };
+}
+/**
+ * Validate and coerce a raw string value for a nested-leaf setting. The
+ * returned value is the typed leaf that should be written into PmSettings.
+ *
+ * Empty strings are allowed for "string" leaves unless `non_empty` is set.
+ */
+export function parseNestedSettingValue(descriptor, rawValue) {
+    if (typeof rawValue !== "string") {
+        return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };
+    }
+    const trimmed = rawValue.trim();
+    if (descriptor.kind === "boolean") {
+        return parseNestedBooleanValue(descriptor, rawValue);
+    }
+    if (descriptor.kind === "string") {
+        return parseNestedStringValue(descriptor, rawValue, trimmed);
+    }
+    // Number("") === 0, which would silently accept empty / whitespace-only input
+    // as a valid zero. Reject explicitly so misconfigurations don't slip through.
+    const parsed = parseFiniteNestedNumber(descriptor, rawValue, trimmed);
+    if (!parsed.ok) {
+        return { ok: false, error: parsed.error };
+    }
+    if (descriptor.kind === "integer") {
+        return parseNestedIntegerValue(descriptor, rawValue, parsed.value);
+    }
+    if (descriptor.kind === "ratio") {
+        return parseNestedRatioValue(descriptor, rawValue, parsed.value);
+    }
+    // kind === "number" — negatives are allowed; only apply an explicit `min`.
+    return parseNestedNumberValue(descriptor, rawValue, parsed.value);
 }
 /** Walk a dotted path on an arbitrary record (best-effort, returns null on miss). */
 export function readNestedSettingValue(settings, descriptor) {
@@ -415,4 +437,4 @@ export function writeNestedSettingValue(settings, descriptor, value) {
     return true;
 }
 //# sourceMappingURL=nested-settings.js.map
-//# debugId=439e5c08-5cff-56f0-a21d-15ffdb7afe94
+//# debugId=b0ddd8ee-f289-5872-bce9-00b573abca7e

package/dist/core/config/nested-settings.js.map

@@ -1 +1 @@
-{"version":3,"file":"nested-settings.js","sources":["core/config/nested-settings.ts"],"sourceRoot":"/","sourcesContent":["/**\n * Nested leaf settings exposed via `pm config <scope> set/get <key> <value>`.\n *\n * These are simple string/number leaves of {@link PmSettings} (provider URLs,\n * vector-store adapter, search tuning) that previously required hand-editing\n * `.agents/pm/settings.json`. They live here so the same dotted path is\n * documented in one place and surfaced both to the config dispatcher and to\n * `pm config list` (so `pm config list --json` is discoverable).\n *\n * Shape conventions:\n * - `path` is the dotted JSON path in {@link PmSettings} (e.g. `search.provider`).\n * - `kind` is the value shape: \"string\" | \"boolean\" | \"integer\" | \"number\" | \"ratio\"\n *   - \"ratio\" must be a finite number in [0, 1].\n *   - \"integer\" must be a finite non-negative integer. Set `min: 1` for keys\n *     where the runtime silently falls back when 0 is supplied (e.g. batch\n *     size, timeout, max-results limits).\n *   - \"number\" must be a finite number — negatives ARE allowed (e.g. score\n *     thresholds may legitimately be negative when a provider normalizes\n *     scores into a signed range).\n *\n * Adding a key here makes it acceptable to `pm config <scope> set <key> <value>`\n * with no other code changes — the dispatcher walks the dotted path on the\n * already-validated PmSettings shape.\n */\n\n/** Supported coercion shapes for nested settings exposed through `pm config`. */\nexport type NestedSettingKind = \"string\" | \"boolean\" | \"integer\" | \"number\" | \"ratio\";\n\n/**\n * Documents the nested setting descriptor payload exchanged by command, SDK, and package integrations.\n */\nexport interface NestedSettingDescriptor {\n  /** CLI key (snake_case). Kebab-case form is accepted by normalizing `-` → `_`. */\n  key: string;\n  /** Dotted JSON path in PmSettings. */\n  path: string;\n  /** Value shape. */\n  kind: NestedSettingKind;\n  /** Short human-facing summary for `pm config list`. */\n  summary: string;\n  /** Optional accepted values for string settings. */\n  choices?: readonly string[];\n  /** Require a non-empty trimmed string value for string settings. */\n  non_empty?: boolean;\n  /**\n   * Optional minimum value for `integer` / `number` kinds. When set,\n   * `parseNestedSettingValue` rejects values strictly below `min`. Useful for\n   * settings where 0 would be silently ignored by the runtime (batch sizes,\n   * timeouts, max-results limits).\n   */\n  min?: number;\n}\n\n/**\n * Search/provider/vector-store leaves. Order is the display order in\n * `pm config list` and in error hints.\n */\nexport const NESTED_SETTING_DESCRIPTORS: readonly NestedSettingDescriptor[] = [\n  {\n    key: \"search_provider\",\n    path: \"search.provider\",\n    kind: \"string\",\n    summary: \"Search embedding provider name (e.g. openai, ollama, or an extension provider).\",\n  },\n  {\n    key: \"search_mutation_refresh_policy\",\n    path: \"search.mutation_refresh_policy\",\n    kind: \"string\",\n    choices: [\"cache_only\", \"semantic_configured\", \"semantic_auto\"],\n    summary: \"Mutation-time search refresh policy: cache_only, semantic_configured, or semantic_auto.\",\n  },\n  {\n    key: \"search_query_expansion_enabled\",\n    path: \"search.query_expansion.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable or disable query expansion for semantic/hybrid search.\",\n  },\n  {\n    key: \"search_query_expansion_provider\",\n    path: \"search.query_expansion.provider\",\n    kind: \"string\",\n    summary: \"Query expansion provider name (built-in openai/ollama or extension provider).\",\n  },\n  {\n    key: \"search_rerank_enabled\",\n    path: \"search.rerank.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable or disable post-retrieval reranking for hybrid search.\",\n  },\n  {\n    key: \"search_rerank_model\",\n    path: \"search.rerank.model\",\n    kind: \"string\",\n    summary: \"Rerank model name override used by built-in providers.\",\n  },\n  {\n    key: \"search_rerank_top_k\",\n    path: \"search.rerank.top_k\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Number of top hybrid candidates to rerank when rerank is enabled.\",\n  },\n  {\n    key: \"search_embedding_model\",\n    path: \"search.embedding_model\",\n    kind: \"string\",\n    summary: \"Default embedding model name (overrides provider-specific model when set).\",\n  },\n  {\n    key: \"search_embedding_corpus_max_characters\",\n    path: \"search.embedding_corpus_max_characters\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Maximum semantic corpus characters per item before truncation.\",\n  },\n  {\n    key: \"search_embedding_batch_size\",\n    path: \"search.embedding_batch_size\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Number of items embedded per request batch.\",\n  },\n  {\n    key: \"search_embedding_timeout_ms\",\n    path: \"search.embedding_timeout_ms\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Per-request embedding timeout in milliseconds.\",\n  },\n  {\n    key: \"search_score_threshold\",\n    path: \"search.score_threshold\",\n    kind: \"number\",\n    summary: \"Minimum score for a hit to be returned (0 keeps all matches).\",\n  },\n  {\n    key: \"search_hybrid_semantic_weight\",\n    path: \"search.hybrid_semantic_weight\",\n    kind: \"ratio\",\n    summary: \"Hybrid mode semantic weight in [0, 1] (1-weight goes to keyword).\",\n  },\n  {\n    key: \"search_max_results\",\n    path: \"search.max_results\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Default upper bound on search hits when --limit is not supplied.\",\n  },\n  {\n    key: \"search_bm25_k1\",\n    path: \"search.bm25.k1\",\n    kind: \"number\",\n    min: 0,\n    summary: \"Offline BM25 term-frequency saturation (k1); higher saturates repeated terms slower (default 1.2).\",\n  },\n  {\n    key: \"search_bm25_b\",\n    path: \"search.bm25.b\",\n    kind: \"ratio\",\n    summary: \"Offline BM25 document-length normalization (b) in [0, 1]; 0 disables, 1 fully normalizes (default 0.75).\",\n  },\n  {\n    key: \"openai_base_url\",\n    path: \"providers.openai.base_url\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible API base URL (LM Studio/vLLM also use this).\",\n  },\n  {\n    key: \"openai_api_key\",\n    path: \"providers.openai.api_key\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible API key.\",\n  },\n  {\n    key: \"openai_model\",\n    path: \"providers.openai.model\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible embedding model name.\",\n  },\n  {\n    key: \"ollama_base_url\",\n    path: \"providers.ollama.base_url\",\n    kind: \"string\",\n    summary: \"Ollama API base URL (typically http://localhost:11434).\",\n  },\n  {\n    key: \"ollama_model\",\n    path: \"providers.ollama.model\",\n    kind: \"string\",\n    summary: \"Ollama embedding model name (e.g. nomic-embed-text).\",\n  },\n  {\n    key: \"vector_store_adapter\",\n    path: \"vector_store.adapter\",\n    kind: \"string\",\n    summary: \"Vector store adapter name (lancedb, qdrant, or an extension adapter).\",\n  },\n  {\n    key: \"vector_store_collection_name\",\n    path: \"vector_store.collection_name\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Vector collection/table name shared by Qdrant and LanceDB adapters.\",\n  },\n  {\n    key: \"qdrant_url\",\n    path: \"vector_store.qdrant.url\",\n    kind: \"string\",\n    summary: \"Qdrant HTTP API URL.\",\n  },\n  {\n    key: \"qdrant_api_key\",\n    path: \"vector_store.qdrant.api_key\",\n    kind: \"string\",\n    summary: \"Qdrant API key (empty if running unauthenticated).\",\n  },\n  {\n    key: \"lancedb_path\",\n    path: \"vector_store.lancedb.path\",\n    kind: \"string\",\n    summary: \"LanceDB storage path (relative to pm root or absolute).\",\n  },\n  // General workspace leaves (id/author/output/locks/schema governance). These\n  // are documented user-facing settings in CONFIGURATION.md that previously\n  // required hand-editing settings.json.\n  {\n    key: \"id_prefix\",\n    path: \"id_prefix\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Prefix for generated item IDs (e.g. \\\"pm\\\" produces pm-xxxx).\",\n  },\n  {\n    key: \"author_default\",\n    path: \"author_default\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Default author recorded on mutations when --author is not supplied.\",\n  },\n  {\n    key: \"output_default_format\",\n    path: \"output.default_format\",\n    kind: \"string\",\n    choices: [\"toon\", \"json\"],\n    summary: \"Default output format for commands that support it: toon or json.\",\n  },\n  {\n    key: \"locks_ttl_seconds\",\n    path: \"locks.ttl_seconds\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Claim/lock time-to-live in seconds before a stale lock can be reclaimed.\",\n  },\n  {\n    key: \"checkpoints_retention_days\",\n    path: \"checkpoints.retention_days\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Age in days above which pm gc --scope checkpoints prunes bulk-mutation rollback checkpoints.\",\n  },\n  {\n    key: \"schema_unknown_field_policy\",\n    path: \"schema.unknown_field_policy\",\n    kind: \"string\",\n    choices: [\"allow\", \"warn\", \"reject\"],\n    summary: \"How item I/O handles metadata keys not in the field registry: allow, warn, or reject.\",\n  },\n  // History compaction policy leaves (pm health advisory + pm history-compact\n  // bulk-sweep default threshold). Disabled by default; enabling makes large\n  // streams discoverable without a manual stats pass.\n  {\n    key: \"history_compact_policy_enabled\",\n    path: \"history.compact_policy.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable the history-compaction advisory: pm health warns on over-threshold streams.\",\n  },\n  {\n    key: \"history_compact_policy_max_entries\",\n    path: \"history.compact_policy.max_entries\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Entry count above which a history stream is flagged (and the default pm history-compact --all-over threshold).\",\n  },\n  {\n    key: \"history_compact_policy_trigger\",\n    path: \"history.compact_policy.trigger\",\n    kind: \"string\",\n    choices: [\"health_warn\", \"auto\"],\n    summary: \"History-compaction policy intent: health_warn (advisory only) or auto (scheduled sweeps expected).\",\n  },\n];\n\nconst DESCRIPTOR_BY_KEY: ReadonlyMap<string, NestedSettingDescriptor> = new Map(\n  NESTED_SETTING_DESCRIPTORS.map((descriptor) => [descriptor.key, descriptor]),\n);\n\n/**\n * Map a raw user-supplied key (kebab or snake case, any casing) onto a known\n * nested-leaf descriptor. Returns `undefined` when the key is not a nested\n * leaf (callers can then fall back to the regular ConfigKey path).\n */\nexport function resolveNestedSettingDescriptor(raw: string | undefined): NestedSettingDescriptor | undefined {\n  if (typeof raw !== \"string\") {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase().replaceAll(\"-\", \"_\");\n  if (normalized.length === 0) {\n    return undefined;\n  }\n  return DESCRIPTOR_BY_KEY.get(normalized);\n}\n\n/** Recoverable parsed value with the descriptor it satisfied. */\nexport interface NestedSettingParsedValue {\n  descriptor: NestedSettingDescriptor;\n  value: string | number | boolean;\n}\n\n/** Throwable validation error returned as a structured result. */\nexport interface NestedSettingParseError {\n  message: string;\n}\n\n/**\n * Restricts nested setting parse result values accepted by command, SDK, and storage contracts.\n */\nexport type NestedSettingParseResult =\n  | { ok: true; parsed: NestedSettingParsedValue }\n  | { ok: false; error: NestedSettingParseError };\n\n/**\n * Validate and coerce a raw string value for a nested-leaf setting. The\n * returned value is the typed leaf that should be written into PmSettings.\n *\n * Empty strings are allowed for \"string\" leaves unless `non_empty` is set.\n */\nexport function parseNestedSettingValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n): NestedSettingParseResult {\n  if (typeof rawValue !== \"string\") {\n    return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };\n  }\n  const trimmed = rawValue.trim();\n  if (descriptor.kind === \"boolean\") {\n    const normalized = trimmed.toLowerCase();\n    if (normalized === \"true\" || normalized === \"1\" || normalized === \"yes\" || normalized === \"on\") {\n      return { ok: true, parsed: { descriptor, value: true } };\n    }\n    if (normalized === \"false\" || normalized === \"0\" || normalized === \"no\" || normalized === \"off\") {\n      return { ok: true, parsed: { descriptor, value: false } };\n    }\n    return {\n      ok: false,\n      error: {\n        message: `Config set ${descriptor.key} requires a boolean value (true|false), got \"${rawValue}\"`,\n      },\n    };\n  }\n  if (descriptor.kind === \"string\") {\n    if (descriptor.non_empty === true && trimmed.length === 0) {\n      return {\n        ok: false,\n        error: { message: `Config set ${descriptor.key} requires a non-empty value` },\n      };\n    }\n    if (descriptor.choices && !descriptor.choices.includes(trimmed)) {\n      return {\n        ok: false,\n        error: {\n          message: `Config set ${descriptor.key} must be one of ${descriptor.choices.join(\"|\")}, got \"${rawValue}\"`,\n        },\n      };\n    }\n    return { ok: true, parsed: { descriptor, value: trimmed } };\n  }\n\n  // Number(\"\") === 0, which would silently accept empty / whitespace-only input\n  // as a valid zero. Reject explicitly so misconfigurations don't slip through.\n  if (trimmed.length === 0) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a non-empty value` },\n    };\n  }\n\n  const parsed = Number(trimmed);\n  if (!Number.isFinite(parsed)) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a finite number, got \"${rawValue}\"` },\n    };\n  }\n  if (descriptor.kind === \"integer\") {\n    if (!Number.isInteger(parsed) || parsed < 0) {\n      return {\n        ok: false,\n        error: { message: `Config set ${descriptor.key} requires a non-negative integer, got \"${rawValue}\"` },\n      };\n    }\n    if (descriptor.min !== undefined && parsed < descriptor.min) {\n      return {\n        ok: false,\n        error: {\n          message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got \"${rawValue}\" (the runtime silently ignores 0 here and falls back to the default)`,\n        },\n      };\n    }\n    return { ok: true, parsed: { descriptor, value: parsed } };\n  }\n  if (descriptor.kind === \"ratio\") {\n    if (parsed < 0 || parsed > 1) {\n      return {\n        ok: false,\n        error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got \"${rawValue}\"` },\n      };\n    }\n    return { ok: true, parsed: { descriptor, value: parsed } };\n  }\n  // kind === \"number\" — negatives are allowed; only apply an explicit `min`.\n  if (descriptor.min !== undefined && parsed < descriptor.min) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a number >= ${descriptor.min}, got \"${rawValue}\"` },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value: parsed } };\n}\n\n/** Walk a dotted path on an arbitrary record (best-effort, returns null on miss). */\nexport function readNestedSettingValue(\n  settings: unknown,\n  descriptor: NestedSettingDescriptor,\n): string | number | boolean | null {\n  const segments = descriptor.path.split(\".\");\n  let cursor: unknown = settings;\n  for (const segment of segments) {\n    if (typeof cursor !== \"object\" || cursor === null) {\n      return null;\n    }\n    cursor = (cursor as Record<string, unknown>)[segment];\n  }\n  if (typeof cursor === \"string\" || typeof cursor === \"number\" || typeof cursor === \"boolean\") {\n    return cursor;\n  }\n  return null;\n}\n\n/**\n * Set a leaf value on a settings object by walking the descriptor's dotted\n * path. Missing intermediate objects are created. Returns `true` when the\n * value actually changed.\n */\nexport function writeNestedSettingValue(\n  settings: Record<string, unknown>,\n  descriptor: NestedSettingDescriptor,\n  value: string | number | boolean,\n): boolean {\n  const segments = descriptor.path.split(\".\");\n  let cursor: Record<string, unknown> = settings;\n  for (let index = 0; index < segments.length - 1; index += 1) {\n    const segment = segments[index];\n    const existing = cursor[segment];\n    if (typeof existing !== \"object\" || existing === null || Array.isArray(existing)) {\n      const next: Record<string, unknown> = {};\n      cursor[segment] = next;\n      cursor = next;\n    } else {\n      cursor = existing as Record<string, unknown>;\n    }\n  }\n  const leafKey = segments[segments.length - 1];\n  const previous = cursor[leafKey];\n  if (previous === value) {\n    return false;\n  }\n  cursor[leafKey] = value;\n  return true;\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AA8BH;;;GAGG;;;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAuC;IAC5E;QACE,GAAG,EAAE,iBAAiB;QACtB,IAAI,EAAE,iBAAiB;QACvB,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,iFAAiF;KAC3F;IACD;QACE,GAAG,EAAE,gCAAgC;QACrC,IAAI,EAAE,gCAAgC;QACtC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,YAAY,EAAE,qBAAqB,EAAE,eAAe,CAAC;QAC/D,OAAO,EAAE,yFAAyF;KACnG;IACD;QACE,GAAG,EAAE,gCAAgC;QACrC,IAAI,EAAE,gCAAgC;QACtC,IAAI,EAAE,SAAS;QACf,OAAO,EAAE,+DAA+D;KACzE;IACD;QACE,GAAG,EAAE,iCAAiC;QACtC,IAAI,EAAE,iCAAiC;QACvC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,+EAA+E;KACzF;IACD;QACE,GAAG,EAAE,uBAAuB;QAC5B,IAAI,EAAE,uBAAuB;QAC7B,IAAI,EAAE,SAAS;QACf,OAAO,EAAE,+DAA+D;KACzE;IACD;QACE,GAAG,EAAE,qBAAqB;QAC1B,IAAI,EAAE,qBAAqB;QAC3B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,wDAAwD;KAClE;IACD;QACE,GAAG,EAAE,qBAAqB;QAC1B,IAAI,EAAE,qBAAqB;QAC3B,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,mEAAmE;KAC7E;IACD;QACE,GAAG,EAAE,wBAAwB;QAC7B,IAAI,EAAE,wBAAwB;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,4EAA4E;KACtF;IACD;QACE,GAAG,EAAE,wCAAwC;QAC7C,IAAI,EAAE,wCAAwC;QAC9C,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,gEAAgE;KAC1E;IACD;QACE,GAAG,EAAE,6BAA6B;QAClC,IAAI,EAAE,6BAA6B;QACnC,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,6CAA6C;KACvD;IACD;QACE,GAAG,EAAE,6BAA6B;QAClC,IAAI,EAAE,6BAA6B;QACnC,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,gDAAgD;KAC1D;IACD;QACE,GAAG,EAAE,wBAAwB;QAC7B,IAAI,EAAE,wBAAwB;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,+DAA+D;KACzE;IACD;QACE,GAAG,EAAE,+BAA+B;QACpC,IAAI,EAAE,+BAA+B;QACrC,IAAI,EAAE,OAAO;QACb,OAAO,EAAE,mEAAmE;KAC7E;IACD;QACE,GAAG,EAAE,oBAAoB;QACzB,IAAI,EAAE,oBAAoB;QAC1B,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,kEAAkE;KAC5E;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,IAAI,EAAE,gBAAgB;QACtB,IAAI,EAAE,QAAQ;QACd,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,oGAAoG;KAC9G;IACD;QACE,GAAG,EAAE,eAAe;QACpB,IAAI,EAAE,eAAe;QACrB,IAAI,EAAE,OAAO;QACb,OAAO,EAAE,0GAA0G;KACpH;IACD;QACE,GAAG,EAAE,iBAAiB;QACtB,IAAI,EAAE,2BAA2B;QACjC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,gEAAgE;KAC1E;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,IAAI,EAAE,0BAA0B;QAChC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,4BAA4B;KACtC;IACD;QACE,GAAG,EAAE,cAAc;QACnB,IAAI,EAAE,wBAAwB;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,yCAAyC;KACnD;IACD;QACE,GAAG,EAAE,iBAAiB;QACtB,IAAI,EAAE,2BAA2B;QACjC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,yDAAyD;KACnE;IACD;QACE,GAAG,EAAE,cAAc;QACnB,IAAI,EAAE,wBAAwB;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,sDAAsD;KAChE;IACD;QACE,GAAG,EAAE,sBAAsB;QAC3B,IAAI,EAAE,sBAAsB;QAC5B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,uEAAuE;KACjF;IACD;QACE,GAAG,EAAE,8BAA8B;QACnC,IAAI,EAAE,8BAA8B;QACpC,IAAI,EAAE,QAAQ;QACd,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,qEAAqE;KAC/E;IACD;QACE,GAAG,EAAE,YAAY;QACjB,IAAI,EAAE,yBAAyB;QAC/B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,sBAAsB;KAChC;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,IAAI,EAAE,6BAA6B;QACnC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,oDAAoD;KAC9D;IACD;QACE,GAAG,EAAE,cAAc;QACnB,IAAI,EAAE,2BAA2B;QACjC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,yDAAyD;KACnE;IACD,6EAA6E;IAC7E,0EAA0E;IAC1E,uCAAuC;IACvC;QACE,GAAG,EAAE,WAAW;QAChB,IAAI,EAAE,WAAW;QACjB,IAAI,EAAE,QAAQ;QACd,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,+DAA+D;KACzE;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,IAAI,EAAE,gBAAgB;QACtB,IAAI,EAAE,QAAQ;QACd,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,qEAAqE;KAC/E;IACD;QACE,GAAG,EAAE,uBAAuB;QAC5B,IAAI,EAAE,uBAAuB;QAC7B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;QACzB,OAAO,EAAE,mEAAmE;KAC7E;IACD;QACE,GAAG,EAAE,mBAAmB;QACxB,IAAI,EAAE,mBAAmB;QACzB,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,0EAA0E;KACpF;IACD;QACE,GAAG,EAAE,4BAA4B;QACjC,IAAI,EAAE,4BAA4B;QAClC,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,8FAA8F;KACxG;IACD;QACE,GAAG,EAAE,6BAA6B;QAClC,IAAI,EAAE,6BAA6B;QACnC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC;QACpC,OAAO,EAAE,uFAAuF;KACjG;IACD,4EAA4E;IAC5E,2EAA2E;IAC3E,oDAAoD;IACpD;QACE,GAAG,EAAE,gCAAgC;QACrC,IAAI,EAAE,gCAAgC;QACtC,IAAI,EAAE,SAAS;QACf,OAAO,EAAE,oFAAoF;KAC9F;IACD;QACE,GAAG,EAAE,oCAAoC;QACzC,IAAI,EAAE,oCAAoC;QAC1C,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,gHAAgH;KAC1H;IACD;QACE,GAAG,EAAE,gCAAgC;QACrC,IAAI,EAAE,gCAAgC;QACtC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,aAAa,EAAE,MAAM,CAAC;QAChC,OAAO,EAAE,oGAAoG;KAC9G;CACF,CAAC;AAEF,MAAM,iBAAiB,GAAiD,IAAI,GAAG,CAC7E,0BAA0B,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAC7E,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,8BAA8B,CAAC,GAAuB;IACpE,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACjE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;AAC3C,CAAC;AAoBD;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CACrC,UAAmC,EACnC,QAAgB;IAEhB,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,0BAA0B,EAAE,EAAE,CAAC;IACnG,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;IAChC,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,UAAU,KAAK,MAAM,IAAI,UAAU,KAAK,GAAG,IAAI,UAAU,KAAK,KAAK,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YAC/F,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QAC3D,CAAC;QACD,IAAI,UAAU,KAAK,OAAO,IAAI,UAAU,KAAK,GAAG,IAAI,UAAU,KAAK,IAAI,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;YAChG,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QAC5D,CAAC;QACD,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE;gBACL,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,gDAAgD,QAAQ,GAAG;aACjG;SACF,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACjC,IAAI,UAAU,CAAC,SAAS,KAAK,IAAI,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1D,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,6BAA6B,EAAE;aAC9E,CAAC;QACJ,CAAC;QACD,IAAI,UAAU,CAAC,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAChE,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE;oBACL,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,mBAAmB,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,QAAQ,GAAG;iBAC1G;aACF,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC;IAC9D,CAAC;IAED,8EAA8E;IAC9E,8EAA8E;IAC9E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,6BAA6B,EAAE;SAC9E,CAAC;IACJ,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QAC7B,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,mCAAmC,QAAQ,GAAG,EAAE;SAC/F,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5C,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,0CAA0C,QAAQ,GAAG,EAAE;aACtG,CAAC;QACJ,CAAC;QACD,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC;YAC5D,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE;oBACL,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,2BAA2B,UAAU,CAAC,GAAG,UAAU,QAAQ,uEAAuE;iBACxK;aACF,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;IAC7D,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAChC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,sCAAsC,QAAQ,GAAG,EAAE;aAClG,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;IAC7D,CAAC;IACD,2EAA2E;IAC3E,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC;QAC5D,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,yBAAyB,UAAU,CAAC,GAAG,UAAU,QAAQ,GAAG,EAAE;SAC7G,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;AAC7D,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,sBAAsB,CACpC,QAAiB,EACjB,UAAmC;IAEnC,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,MAAM,GAAY,QAAQ,CAAC;IAC/B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAClD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,GAAI,MAAkC,CAAC,OAAO,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,SAAS,EAAE,CAAC;QAC5F,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACrC,QAAiC,EACjC,UAAmC,EACnC,KAAgC;IAEhC,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,MAAM,GAA4B,QAAQ,CAAC;IAC/C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAC5D,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjF,MAAM,IAAI,GAA4B,EAAE,CAAC;YACzC,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;YACvB,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,QAAmC,CAAC;QAC/C,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IACjC,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;IACxB,OAAO,IAAI,CAAC;AACd,CAAC","debugId":"439e5c08-5cff-56f0-a21d-15ffdb7afe94"}
+{"version":3,"file":"nested-settings.js","sources":["core/config/nested-settings.ts"],"sourceRoot":"/","sourcesContent":["/**\n * Nested leaf settings exposed via `pm config <scope> set/get <key> <value>`.\n *\n * These are simple string/number leaves of {@link PmSettings} (provider URLs,\n * vector-store adapter, search tuning) that previously required hand-editing\n * `.agents/pm/settings.json`. They live here so the same dotted path is\n * documented in one place and surfaced both to the config dispatcher and to\n * `pm config list` (so `pm config list --json` is discoverable).\n *\n * Shape conventions:\n * - `path` is the dotted JSON path in {@link PmSettings} (e.g. `search.provider`).\n * - `kind` is the value shape: \"string\" | \"boolean\" | \"integer\" | \"number\" | \"ratio\"\n *   - \"ratio\" must be a finite number in [0, 1].\n *   - \"integer\" must be a finite non-negative integer. Set `min: 1` for keys\n *     where the runtime silently falls back when 0 is supplied (e.g. batch\n *     size, timeout, max-results limits).\n *   - \"number\" must be a finite number — negatives ARE allowed (e.g. score\n *     thresholds may legitimately be negative when a provider normalizes\n *     scores into a signed range).\n *\n * Adding a key here makes it acceptable to `pm config <scope> set <key> <value>`\n * with no other code changes — the dispatcher walks the dotted path on the\n * already-validated PmSettings shape.\n */\n\n/** Supported coercion shapes for nested settings exposed through `pm config`. */\nexport type NestedSettingKind = \"string\" | \"boolean\" | \"integer\" | \"number\" | \"ratio\";\n\n/**\n * Documents the nested setting descriptor payload exchanged by command, SDK, and package integrations.\n */\nexport interface NestedSettingDescriptor {\n  /** CLI key (snake_case). Kebab-case form is accepted by normalizing `-` → `_`. */\n  key: string;\n  /** Dotted JSON path in PmSettings. */\n  path: string;\n  /** Value shape. */\n  kind: NestedSettingKind;\n  /** Short human-facing summary for `pm config list`. */\n  summary: string;\n  /** Optional accepted values for string settings. */\n  choices?: readonly string[];\n  /** Require a non-empty trimmed string value for string settings. */\n  non_empty?: boolean;\n  /**\n   * Optional minimum value for `integer` / `number` kinds. When set,\n   * `parseNestedSettingValue` rejects values strictly below `min`. Useful for\n   * settings where 0 would be silently ignored by the runtime (batch sizes,\n   * timeouts, max-results limits).\n   */\n  min?: number;\n}\n\n/**\n * Search/provider/vector-store leaves. Order is the display order in\n * `pm config list` and in error hints.\n */\nexport const NESTED_SETTING_DESCRIPTORS: readonly NestedSettingDescriptor[] = [\n  {\n    key: \"search_provider\",\n    path: \"search.provider\",\n    kind: \"string\",\n    summary: \"Search embedding provider name (e.g. openai, ollama, or an extension provider).\",\n  },\n  {\n    key: \"search_mutation_refresh_policy\",\n    path: \"search.mutation_refresh_policy\",\n    kind: \"string\",\n    choices: [\"cache_only\", \"semantic_configured\", \"semantic_auto\"],\n    summary: \"Mutation-time search refresh policy: cache_only, semantic_configured, or semantic_auto.\",\n  },\n  {\n    key: \"search_query_expansion_enabled\",\n    path: \"search.query_expansion.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable or disable query expansion for semantic/hybrid search.\",\n  },\n  {\n    key: \"search_query_expansion_provider\",\n    path: \"search.query_expansion.provider\",\n    kind: \"string\",\n    summary: \"Query expansion provider name (built-in openai/ollama or extension provider).\",\n  },\n  {\n    key: \"search_rerank_enabled\",\n    path: \"search.rerank.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable or disable post-retrieval reranking for hybrid search.\",\n  },\n  {\n    key: \"search_rerank_model\",\n    path: \"search.rerank.model\",\n    kind: \"string\",\n    summary: \"Rerank model name override used by built-in providers.\",\n  },\n  {\n    key: \"search_rerank_top_k\",\n    path: \"search.rerank.top_k\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Number of top hybrid candidates to rerank when rerank is enabled.\",\n  },\n  {\n    key: \"search_embedding_model\",\n    path: \"search.embedding_model\",\n    kind: \"string\",\n    summary: \"Default embedding model name (overrides provider-specific model when set).\",\n  },\n  {\n    key: \"search_embedding_corpus_max_characters\",\n    path: \"search.embedding_corpus_max_characters\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Maximum semantic corpus characters per item before truncation.\",\n  },\n  {\n    key: \"search_embedding_batch_size\",\n    path: \"search.embedding_batch_size\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Number of items embedded per request batch.\",\n  },\n  {\n    key: \"search_embedding_timeout_ms\",\n    path: \"search.embedding_timeout_ms\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Per-request embedding timeout in milliseconds.\",\n  },\n  {\n    key: \"search_score_threshold\",\n    path: \"search.score_threshold\",\n    kind: \"number\",\n    summary: \"Minimum score for a hit to be returned (0 keeps all matches).\",\n  },\n  {\n    key: \"search_hybrid_semantic_weight\",\n    path: \"search.hybrid_semantic_weight\",\n    kind: \"ratio\",\n    summary: \"Hybrid mode semantic weight in [0, 1] (1-weight goes to keyword).\",\n  },\n  {\n    key: \"search_max_results\",\n    path: \"search.max_results\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Default upper bound on search hits when --limit is not supplied.\",\n  },\n  {\n    key: \"search_bm25_k1\",\n    path: \"search.bm25.k1\",\n    kind: \"number\",\n    min: 0,\n    summary: \"Offline BM25 term-frequency saturation (k1); higher saturates repeated terms slower (default 1.2).\",\n  },\n  {\n    key: \"search_bm25_b\",\n    path: \"search.bm25.b\",\n    kind: \"ratio\",\n    summary: \"Offline BM25 document-length normalization (b) in [0, 1]; 0 disables, 1 fully normalizes (default 0.75).\",\n  },\n  {\n    key: \"openai_base_url\",\n    path: \"providers.openai.base_url\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible API base URL (LM Studio/vLLM also use this).\",\n  },\n  {\n    key: \"openai_api_key\",\n    path: \"providers.openai.api_key\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible API key.\",\n  },\n  {\n    key: \"openai_model\",\n    path: \"providers.openai.model\",\n    kind: \"string\",\n    summary: \"OpenAI-compatible embedding model name.\",\n  },\n  {\n    key: \"ollama_base_url\",\n    path: \"providers.ollama.base_url\",\n    kind: \"string\",\n    summary: \"Ollama API base URL (typically http://localhost:11434).\",\n  },\n  {\n    key: \"ollama_model\",\n    path: \"providers.ollama.model\",\n    kind: \"string\",\n    summary: \"Ollama embedding model name (e.g. nomic-embed-text).\",\n  },\n  {\n    key: \"vector_store_adapter\",\n    path: \"vector_store.adapter\",\n    kind: \"string\",\n    summary: \"Vector store adapter name (lancedb, qdrant, or an extension adapter).\",\n  },\n  {\n    key: \"vector_store_collection_name\",\n    path: \"vector_store.collection_name\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Vector collection/table name shared by Qdrant and LanceDB adapters.\",\n  },\n  {\n    key: \"qdrant_url\",\n    path: \"vector_store.qdrant.url\",\n    kind: \"string\",\n    summary: \"Qdrant HTTP API URL.\",\n  },\n  {\n    key: \"qdrant_api_key\",\n    path: \"vector_store.qdrant.api_key\",\n    kind: \"string\",\n    summary: \"Qdrant API key (empty if running unauthenticated).\",\n  },\n  {\n    key: \"lancedb_path\",\n    path: \"vector_store.lancedb.path\",\n    kind: \"string\",\n    summary: \"LanceDB storage path (relative to pm root or absolute).\",\n  },\n  // General workspace leaves (id/author/output/locks/schema governance). These\n  // are documented user-facing settings in CONFIGURATION.md that previously\n  // required hand-editing settings.json.\n  {\n    key: \"id_prefix\",\n    path: \"id_prefix\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Prefix for generated item IDs (e.g. \\\"pm\\\" produces pm-xxxx).\",\n  },\n  {\n    key: \"author_default\",\n    path: \"author_default\",\n    kind: \"string\",\n    non_empty: true,\n    summary: \"Default author recorded on mutations when --author is not supplied.\",\n  },\n  {\n    key: \"output_default_format\",\n    path: \"output.default_format\",\n    kind: \"string\",\n    choices: [\"toon\", \"json\"],\n    summary: \"Default output format for commands that support it: toon or json.\",\n  },\n  {\n    key: \"locks_ttl_seconds\",\n    path: \"locks.ttl_seconds\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Claim/lock time-to-live in seconds before a stale lock can be reclaimed.\",\n  },\n  {\n    key: \"checkpoints_retention_days\",\n    path: \"checkpoints.retention_days\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Age in days above which pm gc --scope checkpoints prunes bulk-mutation rollback checkpoints.\",\n  },\n  {\n    key: \"schema_unknown_field_policy\",\n    path: \"schema.unknown_field_policy\",\n    kind: \"string\",\n    choices: [\"allow\", \"warn\", \"reject\"],\n    summary: \"How item I/O handles metadata keys not in the field registry: allow, warn, or reject.\",\n  },\n  // History compaction policy leaves (pm health advisory + pm history-compact\n  // bulk-sweep default threshold). Disabled by default; enabling makes large\n  // streams discoverable without a manual stats pass.\n  {\n    key: \"history_compact_policy_enabled\",\n    path: \"history.compact_policy.enabled\",\n    kind: \"boolean\",\n    summary: \"Enable the history-compaction advisory: pm health warns on over-threshold streams.\",\n  },\n  {\n    key: \"history_compact_policy_max_entries\",\n    path: \"history.compact_policy.max_entries\",\n    kind: \"integer\",\n    min: 1,\n    summary: \"Entry count above which a history stream is flagged (and the default pm history-compact --all-over threshold).\",\n  },\n  {\n    key: \"history_compact_policy_trigger\",\n    path: \"history.compact_policy.trigger\",\n    kind: \"string\",\n    choices: [\"health_warn\", \"auto\"],\n    summary: \"History-compaction policy intent: health_warn (advisory only) or auto (scheduled sweeps expected).\",\n  },\n];\n\nconst DESCRIPTOR_BY_KEY: ReadonlyMap<string, NestedSettingDescriptor> = new Map(\n  NESTED_SETTING_DESCRIPTORS.map((descriptor) => [descriptor.key, descriptor]),\n);\n\n/**\n * Map a raw user-supplied key (kebab or snake case, any casing) onto a known\n * nested-leaf descriptor. Returns `undefined` when the key is not a nested\n * leaf (callers can then fall back to the regular ConfigKey path).\n */\nexport function resolveNestedSettingDescriptor(raw: string | undefined): NestedSettingDescriptor | undefined {\n  if (typeof raw !== \"string\") {\n    return undefined;\n  }\n  const normalized = raw.trim().toLowerCase().replaceAll(\"-\", \"_\");\n  if (normalized.length === 0) {\n    return undefined;\n  }\n  return DESCRIPTOR_BY_KEY.get(normalized);\n}\n\n/** Recoverable parsed value with the descriptor it satisfied. */\nexport interface NestedSettingParsedValue {\n  descriptor: NestedSettingDescriptor;\n  value: string | number | boolean;\n}\n\n/** Throwable validation error returned as a structured result. */\nexport interface NestedSettingParseError {\n  message: string;\n}\n\n/**\n * Restricts nested setting parse result values accepted by command, SDK, and storage contracts.\n */\nexport type NestedSettingParseResult =\n  | { ok: true; parsed: NestedSettingParsedValue }\n  | { ok: false; error: NestedSettingParseError };\n\nfunction parseNestedBooleanValue(descriptor: NestedSettingDescriptor, rawValue: string): NestedSettingParseResult {\n  const normalized = rawValue.trim().toLowerCase();\n  if (normalized === \"true\" || normalized === \"1\" || normalized === \"yes\" || normalized === \"on\") {\n    return { ok: true, parsed: { descriptor, value: true } };\n  }\n  if (normalized === \"false\" || normalized === \"0\" || normalized === \"no\" || normalized === \"off\") {\n    return { ok: true, parsed: { descriptor, value: false } };\n  }\n  return {\n    ok: false,\n    error: {\n      message: `Config set ${descriptor.key} requires a boolean value (true|false), got \"${rawValue}\"`,\n    },\n  };\n}\n\nfunction parseNestedStringValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  trimmed: string,\n): NestedSettingParseResult {\n  if (descriptor.non_empty === true && trimmed.length === 0) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a non-empty value` },\n    };\n  }\n  if (descriptor.choices && !descriptor.choices.includes(trimmed)) {\n    return {\n      ok: false,\n      error: {\n        message: `Config set ${descriptor.key} must be one of ${descriptor.choices.join(\"|\")}, got \"${rawValue}\"`,\n      },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value: trimmed } };\n}\n\nfunction parseFiniteNestedNumber(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  trimmed: string,\n): { ok: true; value: number } | { ok: false; error: NestedSettingParseError } {\n  if (trimmed.length === 0) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a non-empty value` },\n    };\n  }\n  const parsed = Number(trimmed);\n  if (!Number.isFinite(parsed)) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a finite number, got \"${rawValue}\"` },\n    };\n  }\n  return { ok: true, value: parsed };\n}\n\nfunction parseNestedIntegerValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  value: number,\n): NestedSettingParseResult {\n  if (!Number.isInteger(value) || value < 0) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a non-negative integer, got \"${rawValue}\"` },\n    };\n  }\n  if (descriptor.min !== undefined && value < descriptor.min) {\n    return {\n      ok: false,\n      error: {\n        message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got \"${rawValue}\" (the runtime silently ignores 0 here and falls back to the default)`,\n      },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value } };\n}\n\nfunction parseNestedRatioValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  value: number,\n): NestedSettingParseResult {\n  if (value < 0 || value > 1) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got \"${rawValue}\"` },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value } };\n}\n\nfunction parseNestedNumberValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n  value: number,\n): NestedSettingParseResult {\n  if (descriptor.min !== undefined && value < descriptor.min) {\n    return {\n      ok: false,\n      error: { message: `Config set ${descriptor.key} requires a number >= ${descriptor.min}, got \"${rawValue}\"` },\n    };\n  }\n  return { ok: true, parsed: { descriptor, value } };\n}\n\n/**\n * Validate and coerce a raw string value for a nested-leaf setting. The\n * returned value is the typed leaf that should be written into PmSettings.\n *\n * Empty strings are allowed for \"string\" leaves unless `non_empty` is set.\n */\nexport function parseNestedSettingValue(\n  descriptor: NestedSettingDescriptor,\n  rawValue: string,\n): NestedSettingParseResult {\n  if (typeof rawValue !== \"string\") {\n    return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };\n  }\n  const trimmed = rawValue.trim();\n  if (descriptor.kind === \"boolean\") {\n    return parseNestedBooleanValue(descriptor, rawValue);\n  }\n  if (descriptor.kind === \"string\") {\n    return parseNestedStringValue(descriptor, rawValue, trimmed);\n  }\n\n  // Number(\"\") === 0, which would silently accept empty / whitespace-only input\n  // as a valid zero. Reject explicitly so misconfigurations don't slip through.\n  const parsed = parseFiniteNestedNumber(descriptor, rawValue, trimmed);\n  if (!parsed.ok) {\n    return { ok: false, error: parsed.error };\n  }\n  if (descriptor.kind === \"integer\") {\n    return parseNestedIntegerValue(descriptor, rawValue, parsed.value);\n  }\n  if (descriptor.kind === \"ratio\") {\n    return parseNestedRatioValue(descriptor, rawValue, parsed.value);\n  }\n  // kind === \"number\" — negatives are allowed; only apply an explicit `min`.\n  return parseNestedNumberValue(descriptor, rawValue, parsed.value);\n}\n\n/** Walk a dotted path on an arbitrary record (best-effort, returns null on miss). */\nexport function readNestedSettingValue(\n  settings: unknown,\n  descriptor: NestedSettingDescriptor,\n): string | number | boolean | null {\n  const segments = descriptor.path.split(\".\");\n  let cursor: unknown = settings;\n  for (const segment of segments) {\n    if (typeof cursor !== \"object\" || cursor === null) {\n      return null;\n    }\n    cursor = (cursor as Record<string, unknown>)[segment];\n  }\n  if (typeof cursor === \"string\" || typeof cursor === \"number\" || typeof cursor === \"boolean\") {\n    return cursor;\n  }\n  return null;\n}\n\n/**\n * Set a leaf value on a settings object by walking the descriptor's dotted\n * path. Missing intermediate objects are created. Returns `true` when the\n * value actually changed.\n */\nexport function writeNestedSettingValue(\n  settings: Record<string, unknown>,\n  descriptor: NestedSettingDescriptor,\n  value: string | number | boolean,\n): boolean {\n  const segments = descriptor.path.split(\".\");\n  let cursor: Record<string, unknown> = settings;\n  for (let index = 0; index < segments.length - 1; index += 1) {\n    const segment = segments[index];\n    const existing = cursor[segment];\n    if (typeof existing !== \"object\" || existing === null || Array.isArray(existing)) {\n      const next: Record<string, unknown> = {};\n      cursor[segment] = next;\n      cursor = next;\n    } else {\n      cursor = existing as Record<string, unknown>;\n    }\n  }\n  const leafKey = segments[segments.length - 1];\n  const previous = cursor[leafKey];\n  if (previous === value) {\n    return false;\n  }\n  cursor[leafKey] = value;\n  return true;\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AA8BH;;;GAGG;;;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAuC;IAC5E;QACE,GAAG,EAAE,iBAAiB;QACtB,IAAI,EAAE,iBAAiB;QACvB,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,iFAAiF;KAC3F;IACD;QACE,GAAG,EAAE,gCAAgC;QACrC,IAAI,EAAE,gCAAgC;QACtC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,YAAY,EAAE,qBAAqB,EAAE,eAAe,CAAC;QAC/D,OAAO,EAAE,yFAAyF;KACnG;IACD;QACE,GAAG,EAAE,gCAAgC;QACrC,IAAI,EAAE,gCAAgC;QACtC,IAAI,EAAE,SAAS;QACf,OAAO,EAAE,+DAA+D;KACzE;IACD;QACE,GAAG,EAAE,iCAAiC;QACtC,IAAI,EAAE,iCAAiC;QACvC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,+EAA+E;KACzF;IACD;QACE,GAAG,EAAE,uBAAuB;QAC5B,IAAI,EAAE,uBAAuB;QAC7B,IAAI,EAAE,SAAS;QACf,OAAO,EAAE,+DAA+D;KACzE;IACD;QACE,GAAG,EAAE,qBAAqB;QAC1B,IAAI,EAAE,qBAAqB;QAC3B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,wDAAwD;KAClE;IACD;QACE,GAAG,EAAE,qBAAqB;QAC1B,IAAI,EAAE,qBAAqB;QAC3B,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,mEAAmE;KAC7E;IACD;QACE,GAAG,EAAE,wBAAwB;QAC7B,IAAI,EAAE,wBAAwB;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,4EAA4E;KACtF;IACD;QACE,GAAG,EAAE,wCAAwC;QAC7C,IAAI,EAAE,wCAAwC;QAC9C,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,gEAAgE;KAC1E;IACD;QACE,GAAG,EAAE,6BAA6B;QAClC,IAAI,EAAE,6BAA6B;QACnC,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,6CAA6C;KACvD;IACD;QACE,GAAG,EAAE,6BAA6B;QAClC,IAAI,EAAE,6BAA6B;QACnC,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,gDAAgD;KAC1D;IACD;QACE,GAAG,EAAE,wBAAwB;QAC7B,IAAI,EAAE,wBAAwB;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,+DAA+D;KACzE;IACD;QACE,GAAG,EAAE,+BAA+B;QACpC,IAAI,EAAE,+BAA+B;QACrC,IAAI,EAAE,OAAO;QACb,OAAO,EAAE,mEAAmE;KAC7E;IACD;QACE,GAAG,EAAE,oBAAoB;QACzB,IAAI,EAAE,oBAAoB;QAC1B,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,kEAAkE;KAC5E;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,IAAI,EAAE,gBAAgB;QACtB,IAAI,EAAE,QAAQ;QACd,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,oGAAoG;KAC9G;IACD;QACE,GAAG,EAAE,eAAe;QACpB,IAAI,EAAE,eAAe;QACrB,IAAI,EAAE,OAAO;QACb,OAAO,EAAE,0GAA0G;KACpH;IACD;QACE,GAAG,EAAE,iBAAiB;QACtB,IAAI,EAAE,2BAA2B;QACjC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,gEAAgE;KAC1E;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,IAAI,EAAE,0BAA0B;QAChC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,4BAA4B;KACtC;IACD;QACE,GAAG,EAAE,cAAc;QACnB,IAAI,EAAE,wBAAwB;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,yCAAyC;KACnD;IACD;QACE,GAAG,EAAE,iBAAiB;QACtB,IAAI,EAAE,2BAA2B;QACjC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,yDAAyD;KACnE;IACD;QACE,GAAG,EAAE,cAAc;QACnB,IAAI,EAAE,wBAAwB;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,sDAAsD;KAChE;IACD;QACE,GAAG,EAAE,sBAAsB;QAC3B,IAAI,EAAE,sBAAsB;QAC5B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,uEAAuE;KACjF;IACD;QACE,GAAG,EAAE,8BAA8B;QACnC,IAAI,EAAE,8BAA8B;QACpC,IAAI,EAAE,QAAQ;QACd,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,qEAAqE;KAC/E;IACD;QACE,GAAG,EAAE,YAAY;QACjB,IAAI,EAAE,yBAAyB;QAC/B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,sBAAsB;KAChC;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,IAAI,EAAE,6BAA6B;QACnC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,oDAAoD;KAC9D;IACD;QACE,GAAG,EAAE,cAAc;QACnB,IAAI,EAAE,2BAA2B;QACjC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,yDAAyD;KACnE;IACD,6EAA6E;IAC7E,0EAA0E;IAC1E,uCAAuC;IACvC;QACE,GAAG,EAAE,WAAW;QAChB,IAAI,EAAE,WAAW;QACjB,IAAI,EAAE,QAAQ;QACd,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,+DAA+D;KACzE;IACD;QACE,GAAG,EAAE,gBAAgB;QACrB,IAAI,EAAE,gBAAgB;QACtB,IAAI,EAAE,QAAQ;QACd,SAAS,EAAE,IAAI;QACf,OAAO,EAAE,qEAAqE;KAC/E;IACD;QACE,GAAG,EAAE,uBAAuB;QAC5B,IAAI,EAAE,uBAAuB;QAC7B,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;QACzB,OAAO,EAAE,mEAAmE;KAC7E;IACD;QACE,GAAG,EAAE,mBAAmB;QACxB,IAAI,EAAE,mBAAmB;QACzB,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,0EAA0E;KACpF;IACD;QACE,GAAG,EAAE,4BAA4B;QACjC,IAAI,EAAE,4BAA4B;QAClC,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,8FAA8F;KACxG;IACD;QACE,GAAG,EAAE,6BAA6B;QAClC,IAAI,EAAE,6BAA6B;QACnC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC;QACpC,OAAO,EAAE,uFAAuF;KACjG;IACD,4EAA4E;IAC5E,2EAA2E;IAC3E,oDAAoD;IACpD;QACE,GAAG,EAAE,gCAAgC;QACrC,IAAI,EAAE,gCAAgC;QACtC,IAAI,EAAE,SAAS;QACf,OAAO,EAAE,oFAAoF;KAC9F;IACD;QACE,GAAG,EAAE,oCAAoC;QACzC,IAAI,EAAE,oCAAoC;QAC1C,IAAI,EAAE,SAAS;QACf,GAAG,EAAE,CAAC;QACN,OAAO,EAAE,gHAAgH;KAC1H;IACD;QACE,GAAG,EAAE,gCAAgC;QACrC,IAAI,EAAE,gCAAgC;QACtC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,aAAa,EAAE,MAAM,CAAC;QAChC,OAAO,EAAE,oGAAoG;KAC9G;CACF,CAAC;AAEF,MAAM,iBAAiB,GAAiD,IAAI,GAAG,CAC7E,0BAA0B,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAC7E,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,8BAA8B,CAAC,GAAuB;IACpE,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACjE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;AAC3C,CAAC;AAoBD,SAAS,uBAAuB,CAAC,UAAmC,EAAE,QAAgB;IACpF,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACjD,IAAI,UAAU,KAAK,MAAM,IAAI,UAAU,KAAK,GAAG,IAAI,UAAU,KAAK,KAAK,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QAC/F,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;IAC3D,CAAC;IACD,IAAI,UAAU,KAAK,OAAO,IAAI,UAAU,KAAK,GAAG,IAAI,UAAU,KAAK,IAAI,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;QAChG,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;IAC5D,CAAC;IACD,OAAO;QACL,EAAE,EAAE,KAAK;QACT,KAAK,EAAE;YACL,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,gDAAgD,QAAQ,GAAG;SACjG;KACF,CAAC;AACJ,CAAC;AAED,SAAS,sBAAsB,CAC7B,UAAmC,EACnC,QAAgB,EAChB,OAAe;IAEf,IAAI,UAAU,CAAC,SAAS,KAAK,IAAI,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1D,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,6BAA6B,EAAE;SAC9E,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,CAAC,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAChE,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE;gBACL,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,mBAAmB,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,QAAQ,GAAG;aAC1G;SACF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC;AAC9D,CAAC;AAED,SAAS,uBAAuB,CAC9B,UAAmC,EACnC,QAAgB,EAChB,OAAe;IAEf,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,6BAA6B,EAAE;SAC9E,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QAC7B,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,mCAAmC,QAAQ,GAAG,EAAE;SAC/F,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AACrC,CAAC;AAED,SAAS,uBAAuB,CAC9B,UAAmC,EACnC,QAAgB,EAChB,KAAa;IAEb,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC1C,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,0CAA0C,QAAQ,GAAG,EAAE;SACtG,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC;QAC3D,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE;gBACL,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,2BAA2B,UAAU,CAAC,GAAG,UAAU,QAAQ,uEAAuE;aACxK;SACF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;AACrD,CAAC;AAED,SAAS,qBAAqB,CAC5B,UAAmC,EACnC,QAAgB,EAChB,KAAa;IAEb,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC3B,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,sCAAsC,QAAQ,GAAG,EAAE;SAClG,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;AACrD,CAAC;AAED,SAAS,sBAAsB,CAC7B,UAAmC,EACnC,QAAgB,EAChB,KAAa;IAEb,IAAI,UAAU,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC;QAC3D,OAAO;YACL,EAAE,EAAE,KAAK;YACT,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,yBAAyB,UAAU,CAAC,GAAG,UAAU,QAAQ,GAAG,EAAE;SAC7G,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;AACrD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CACrC,UAAmC,EACnC,QAAgB;IAEhB,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,cAAc,UAAU,CAAC,GAAG,0BAA0B,EAAE,EAAE,CAAC;IACnG,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;IAChC,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAClC,OAAO,uBAAuB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACjC,OAAO,sBAAsB,CAAC,UAAU,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC/D,CAAC;IAED,8EAA8E;IAC9E,8EAA8E;IAC9E,MAAM,MAAM,GAAG,uBAAuB,CAAC,UAAU,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IACtE,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;QACf,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;IAC5C,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAClC,OAAO,uBAAuB,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IACrE,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAChC,OAAO,qBAAqB,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;IACD,2EAA2E;IAC3E,OAAO,sBAAsB,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;AACpE,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,sBAAsB,CACpC,QAAiB,EACjB,UAAmC;IAEnC,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,MAAM,GAAY,QAAQ,CAAC;IAC/B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAClD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,GAAI,MAAkC,CAAC,OAAO,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,SAAS,EAAE,CAAC;QAC5F,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACrC,QAAiC,EACjC,UAAmC,EACnC,KAAgC;IAEhC,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,MAAM,GAA4B,QAAQ,CAAC;IAC/C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAC5D,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjF,MAAM,IAAI,GAA4B,EAAE,CAAC;YACzC,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;YACvB,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,QAAmC,CAAC;QAC/C,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IACjC,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;IACxB,OAAO,IAAI,CAAC;AACd,CAAC","debugId":"b0ddd8ee-f289-5872-bce9-00b573abca7e"}

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"}