@unbrained/pm-cli 2026.6.24 → 2026.7.1

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../cli/commands/linked-artifacts.ts"],
+  "sourcesContent": ["/**\n * @module cli/commands/linked-artifacts\n *\n * Implements the pm linked artifacts command surface and its agent-facing runtime behavior.\n */\nimport fs from \"node:fs/promises\";\nimport path from \"node:path\";\nimport fg from \"fast-glob\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport {\n  assertNoUnknownCsvKeys,\n  createStdinTokenResolver,\n  looksLikeGenericKeyValueEntry,\n  parseCsvKv,\n} from \"../../core/item/parse.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { isRemoteLinkedArtifactReference } from \"../../core/validate/linked-artifact-reference.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { splitCommaList } from \"../../core/shared/split-comma-list.js\";\nimport { listAllFrontMatter, locateItem, mutateItem, readLocatedItem } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport { SCOPE_VALUES } from \"../../types/index.js\";\nimport { resolveAuthor } from \"../../core/shared/author.js\";\nimport type { LinkScope } from \"../../types/index.js\";\n\n/**\n * Restricts linked artifact values accepted by command, SDK, and storage contracts.\n */\nexport type LinkedArtifact = {\n  path: string;\n  scope: LinkScope;\n  note?: string;\n};\n\n/** Allowed CSV/markdown keys for each structured linked-artifact option (GH-258). */\nexport const LINKED_ARTIFACT_ADD_KEYS = [\"path\", \"scope\", \"note\"] as const;\nexport const LINKED_ARTIFACT_ADD_GLOB_KEYS = [\"pattern\", \"glob\", \"path\", \"scope\", \"note\"] as const;\nexport const LINKED_ARTIFACT_REMOVE_KEYS = [\"path\"] as const;\nexport const LINKED_ARTIFACT_MIGRATE_KEYS = [\"from\", \"to\"] as const;\n/**\n * Keys that are valid on --add but meaningless on --remove (GH-277). Rejected\n * with audit-trail guidance (--message) rather than the generic unknown-key\n * error so agents are not left believing a removal note was recorded.\n */\nconst LINKED_ARTIFACT_REMOVE_UNSUPPORTED_KEYS: ReadonlySet<string> = new Set([\"note\", \"scope\"]);\n\n/**\n * Documents the linked artifact command options payload exchanged by command, SDK, and package integrations.\n */\nexport interface LinkedArtifactCommandOptions {\n  add?: string[];\n  addGlob?: string[];\n  remove?: string[];\n  migrate?: string[];\n  /**\n   * GH-170 (pm-pfnx): standalone note applied to every link added by --add /\n   * --add-glob in the same invocation. A per-entry embedded note (the\n   * `path=...,note=...` pair syntax) takes precedence over this flag.\n   * Requires at least one --add/--add-glob; rejected otherwise.\n   */\n  note?: string;\n  list?: boolean;\n  appendStable?: boolean;\n  validatePaths?: boolean;\n  audit?: boolean;\n  author?: string;\n  message?: string;\n  force?: boolean;\n}\n\n/**\n * Documents the path migration payload exchanged by command, SDK, and package integrations.\n */\nexport interface PathMigration {\n  from: string;\n  to: string;\n}\n\n/**\n * Documents the add glob entry payload exchanged by command, SDK, and package integrations.\n */\nexport interface AddGlobEntry {\n  pattern: string;\n  scope: LinkScope;\n  note?: string;\n}\n\n/**\n * Documents the linked path validation payload exchanged by command, SDK, and package integrations.\n */\nexport interface LinkedPathValidation {\n  checked: number;\n  existing_files: string[];\n  missing_paths: string[];\n  non_file_paths: string[];\n  /**\n   * Remote references (https:// URLs and other `scheme://` paths) recorded as\n   * links — most often a PR/issue/design-doc URL added via `pm docs --add`.\n   * These are not local files, so they bypass the existence probe and are\n   * reported here rather than counted as missing.\n   */\n  remote_references: string[];\n}\n\n/**\n * Documents the linked path audit entry payload exchanged by command, SDK, and package integrations.\n */\nexport interface LinkedPathAuditEntry {\n  path: string;\n  linked_by_count: number;\n  linked_item_ids: string[];\n}\n\n/**\n * Documents the linked artifact result payload exchanged by command, SDK, and package integrations.\n */\nexport interface LinkedArtifactResult {\n  id: string;\n  changed: boolean;\n  count: number;\n  migrations_applied?: number;\n  validation?: LinkedPathValidation;\n  audit?: LinkedPathAuditEntry[];\n  artifacts: LinkedArtifact[];\n}\n\n/**\n * Configuration that adapts the shared linked-artifact command core to a\n * specific resource kind (files or docs) while preserving every behavioral\n * detail of the original twin implementations.\n */\nexport interface LinkedArtifactKindConfig {\n  /** Metadata key under which the artifacts are stored (e.g. \"files\" | \"docs\"). */\n  metadataKey: \"files\" | \"docs\";\n  /** Mutation op recorded in history (e.g. \"files_add\" | \"docs_add\"). */\n  op: \"files_add\" | \"docs_add\";\n  /** Noun used in the \"bare <noun> path\" --add usage error (e.g. \"file\" | \"doc\"). */\n  bareNoun: \"file\" | \"doc\";\n  /**\n   * Whether this kind honors the append-stable option. files supports it;\n   * docs always sorts and must never expose append-stable behavior.\n   */\n  supportsAppendStable: boolean;\n}\n\n/**\n * Implements ensure scope for the public runtime surface of this module.\n */\nexport function ensureScope(raw: string | undefined): LinkScope {\n  const value = (raw ?? \"project\") as LinkScope;\n  if (!SCOPE_VALUES.includes(value)) {\n    throw new PmCliError(\n      `Invalid scope \"${raw}\". Valid scopes: ${SCOPE_VALUES.join(\", \")} (default: project).`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  return value;\n}\n\n/**\n * Implements looks like structured path entry for the public runtime surface of this module.\n */\nexport function looksLikeStructuredPathEntry(raw: string): boolean {\n  if (raw.startsWith(\"```\") || raw.includes(\"\\n\")) {\n    return true;\n  }\n  if (/^(?:[-*+]\\s+)?(?:path|scope|note)\\s*[:=]/i.test(raw)) {\n    return true;\n  }\n  // A first-key typo (e.g. `lable=main,path=…`) must still be parsed so the\n  // unknown key is rejected rather than swallowed as a bare path (GH-258).\n  return looksLikeGenericKeyValueEntry(raw);\n}\n\nfunction expandBareCommaSeparatedAddEntries(raw: string[]): string[] {\n  return raw.flatMap((entry) => {\n    const trimmed = entry.trim();\n    if (trimmed.length === 0 || looksLikeStructuredPathEntry(trimmed) || !trimmed.includes(\",\")) {\n      return [entry];\n    }\n    return splitCommaList(trimmed);\n  });\n}\n\n/**\n * Implements parse add entries for the public runtime surface of this module.\n */\nexport function parseAddEntries(raw: string[] | undefined, bareNoun: \"file\" | \"doc\"): LinkedArtifact[] {\n  if (!raw) return [];\n  return expandBareCommaSeparatedAddEntries(raw).map((entry) => {\n    const trimmed = entry.trim();\n    const kv = looksLikeStructuredPathEntry(trimmed) ? parseCsvKv(entry, \"--add\") : { path: trimmed };\n    assertNoUnknownCsvKeys(kv, \"--add\", LINKED_ARTIFACT_ADD_KEYS);\n    if (!kv.path) {\n      throw new PmCliError(`--add requires path=<value> or a bare ${bareNoun} path`, EXIT_CODE.USAGE);\n    }\n    return {\n      path: kv.path,\n      scope: ensureScope(kv.scope),\n      note: kv.note?.trim() || undefined,\n    };\n  });\n}\n\n/**\n * Implements parse add glob entries for the public runtime surface of this module.\n */\nexport function parseAddGlobEntries(raw: string[] | undefined): AddGlobEntry[] {\n  if (!raw) return [];\n  return raw.map((entry) => {\n    const trimmed = entry.trim();\n    if (!trimmed) {\n      throw new PmCliError(\"--add-glob requires a glob pattern value\", EXIT_CODE.USAGE);\n    }\n    if (trimmed.includes(\"=\") || /^(?:[-*+]\\s+)?(?:pattern|glob|path)\\s*[:=]/i.test(trimmed) || trimmed.startsWith(\"```\")) {\n      const kv = parseCsvKv(trimmed, \"--add-glob\");\n      assertNoUnknownCsvKeys(kv, \"--add-glob\", LINKED_ARTIFACT_ADD_GLOB_KEYS);\n      const pattern = kv.pattern?.trim() || kv.glob?.trim() || kv.path?.trim();\n      if (!pattern) {\n        throw new PmCliError(\"--add-glob key/value form requires pattern=<glob>\", EXIT_CODE.USAGE);\n      }\n      return {\n        pattern,\n        scope: ensureScope(kv.scope),\n        note: kv.note?.trim() || undefined,\n      };\n    }\n    return {\n      pattern: trimmed,\n      scope: \"project\",\n    };\n  });\n}\n\n/**\n * Implements parse remove entries for the public runtime surface of this module.\n */\nexport function parseRemoveEntries(raw: string[] | undefined): string[] {\n  if (!raw) return [];\n  return raw.map((entry) => {\n    const trimmed = entry.trim();\n    if (!trimmed) {\n      throw new PmCliError(\"--remove requires a path value\", EXIT_CODE.USAGE);\n    }\n    if (trimmed.includes(\"=\") || /^(?:[-*+]\\s+)?path\\s*[:=]/i.test(trimmed) || trimmed.startsWith(\"```\")) {\n      const kv = parseCsvKv(trimmed, \"--remove\");\n      // GH-277: --remove identifies an existing link by path only; it does not\n      // attach per-link metadata. Reject the --add-only keys with guidance toward\n      // the audit-trail path (--message) rather than the generic \"unrecognized\n      // key\" error, which left agents believing they had recorded a removal note.\n      const unsupportedRemoveKeys = Object.keys(kv).filter((key) =>\n        LINKED_ARTIFACT_REMOVE_UNSUPPORTED_KEYS.has(key.toLowerCase()),\n      );\n      if (unsupportedRemoveKeys.length > 0) {\n        throw new PmCliError(\n          `--remove identifies a linked artifact by path only and does not accept ${unsupportedRemoveKeys\n            .map((key) => `\"${key}\"`)\n            .join(\", \")}. Pass just the path (path=<value>, path:<value>, or a bare path); record removal context with --message \"<why removed>\".`,\n          EXIT_CODE.USAGE,\n        );\n      }\n      assertNoUnknownCsvKeys(kv, \"--remove\", LINKED_ARTIFACT_REMOVE_KEYS);\n      if (!kv.path) {\n        throw new PmCliError(\"--remove key/value form requires path=<value>\", EXIT_CODE.USAGE);\n      }\n      return kv.path;\n    }\n    return trimmed;\n  });\n}\n\n/**\n * Implements parse migrate entries for the public runtime surface of this module.\n */\nexport function parseMigrateEntries(raw: string[] | undefined): PathMigration[] {\n  if (!raw) return [];\n  return raw.map((entry) => {\n    const kv = parseCsvKv(entry, \"--migrate\");\n    assertNoUnknownCsvKeys(kv, \"--migrate\", LINKED_ARTIFACT_MIGRATE_KEYS);\n    const from = kv.from?.trim();\n    const to = kv.to?.trim();\n    if (!from || !to) {\n      throw new PmCliError(\"--migrate requires from=<value> and to=<value>\", EXIT_CODE.USAGE);\n    }\n    return { from, to };\n  });\n}\n\n/**\n * Implements apply path migrations for the public runtime surface of this module.\n */\nexport function applyPathMigrations(artifactPath: string, migrations: PathMigration[]): string {\n  let next = artifactPath;\n  for (const migration of migrations) {\n    if (next.startsWith(migration.from)) {\n      next = `${migration.to}${next.slice(migration.from.length)}`;\n    }\n  }\n  return next;\n}\n\n/**\n * Implements normalize linked path for the public runtime surface of this module.\n */\nexport function normalizeLinkedPath(value: string): string {\n  return value.split(path.sep).join(\"/\");\n}\n\n/**\n * Implements expand add glob entries for the public runtime surface of this module.\n */\nexport async function expandAddGlobEntries(entries: AddGlobEntry[]): Promise<LinkedArtifact[]> {\n  const expanded: LinkedArtifact[] = [];\n  for (const entry of entries) {\n    const absolutePattern = path.isAbsolute(entry.pattern);\n    const matches = await fg(entry.pattern, {\n      cwd: process.cwd(),\n      absolute: absolutePattern,\n      onlyFiles: true,\n      dot: true,\n      unique: true,\n      followSymbolicLinks: true,\n    });\n    const sortedMatches = [...new Set(matches.map((match) => normalizeLinkedPath(path.normalize(match))))].sort((left, right) =>\n      left.localeCompare(right),\n    );\n    for (const matchedPath of sortedMatches) {\n      expanded.push({\n        path: matchedPath,\n        scope: entry.scope,\n        note: entry.note,\n      });\n    }\n  }\n  return expanded;\n}\n\n/**\n * GH-170 (pm-pfnx): apply a standalone --note to the links added in this\n * invocation. Semantics (documented on pm-pfnx): the note is attached to EVERY\n * entry added via --add/--add-glob so a single flag annotates the whole batch\n * predictably; a per-entry embedded `note=` wins over the standalone flag; and\n * --note without any --add/--add-glob flag is a usage error because there is\n * nothing to annotate (it never retro-edits existing links). `hasAddFlags`\n * reflects flag presence, not match count, so a glob that legitimately matches\n * zero files is not an error.\n */\nexport function applyStandaloneNote(\n  adds: LinkedArtifact[],\n  note: string | undefined,\n  hasAddFlags: boolean,\n): LinkedArtifact[] {\n  if (note === undefined) {\n    return adds;\n  }\n  if (!hasAddFlags) {\n    throw new PmCliError(\n      \"--note requires --add or --add-glob in the same invocation (the note annotates the links being added)\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  const trimmed = note.trim();\n  if (trimmed.length === 0) {\n    return adds;\n  }\n  return adds.map((entry) => (entry.note === undefined ? { ...entry, note: trimmed } : entry));\n}\n\n/**\n * Implements artifact key for the public runtime surface of this module.\n */\nexport function artifactKey(value: Pick<LinkedArtifact, \"path\" | \"scope\">): string {\n  return `${value.path}::${value.scope}`;\n}\n\n/**\n * Implements sort linked artifacts for the public runtime surface of this module.\n */\nexport function sortLinkedArtifacts(artifacts: LinkedArtifact[]): LinkedArtifact[] {\n  return [...artifacts].sort((left, right) => {\n    const byPath = left.path.localeCompare(right.path);\n    if (byPath !== 0) return byPath;\n    return left.scope.localeCompare(right.scope);\n  });\n}\n\n/**\n * Implements dedupe linked artifacts for the public runtime surface of this module.\n */\nexport function dedupeLinkedArtifacts(artifacts: LinkedArtifact[]): LinkedArtifact[] {\n  return [...new Map(artifacts.map((entry) => [artifactKey(entry), entry])).values()].map((entry) => ({\n    ...entry,\n    note: entry.note?.trim() || undefined,\n  }));\n}\n\n/**\n * Implements validate linked paths for the public runtime surface of this module.\n */\nexport async function validateLinkedPaths(paths: string[]): Promise<LinkedPathValidation> {\n  const uniquePaths = [...new Set(paths)].sort((left, right) => left.localeCompare(right));\n  const existingFiles: string[] = [];\n  const missingPaths: string[] = [];\n  const nonFilePaths: string[] = [];\n  const remoteReferences: string[] = [];\n  for (const relativePath of uniquePaths) {\n    // Remote references (https:// PR/issue/design-doc URLs) are not local\n    // files; report them separately (trimmed, to match buildFilesCheck's\n    // output shape) instead of probing a meaningless path.\n    if (isRemoteLinkedArtifactReference(relativePath)) {\n      remoteReferences.push(relativePath.trim());\n      continue;\n    }\n    const resolvedPath = path.isAbsolute(relativePath) ? relativePath : path.resolve(process.cwd(), relativePath);\n    try {\n      const stats = await fs.stat(resolvedPath);\n      if (stats.isFile()) {\n        existingFiles.push(relativePath);\n      } else {\n        nonFilePaths.push(relativePath);\n      }\n    } catch (error: unknown) {\n      if (typeof error === \"object\" && error !== null && \"code\" in error && (error as { code?: string }).code === \"ENOENT\") {\n        missingPaths.push(relativePath);\n        continue;\n      }\n      nonFilePaths.push(relativePath);\n    }\n  }\n  return {\n    checked: uniquePaths.length,\n    existing_files: existingFiles,\n    missing_paths: missingPaths,\n    non_file_paths: nonFilePaths,\n    remote_references: remoteReferences,\n  };\n}\n\n/**\n * Implements build linked path audit for the public runtime surface of this module.\n */\nexport function buildLinkedPathAudit(\n  paths: string[],\n  allItems: Array<{ id: string; artifacts?: LinkedArtifact[] }>,\n): LinkedPathAuditEntry[] {\n  const index = new Map<string, Set<string>>();\n  for (const item of allItems) {\n    for (const linkedArtifact of item.artifacts ?? []) {\n      const seen = index.get(linkedArtifact.path) ?? new Set<string>();\n      seen.add(item.id);\n      index.set(linkedArtifact.path, seen);\n    }\n  }\n  return [...new Set(paths)]\n    .sort((left, right) => left.localeCompare(right))\n    .map((linkedPath) => {\n      const linkedIds = [...(index.get(linkedPath) ?? new Set<string>())].sort((left, right) => left.localeCompare(right));\n      return {\n        path: linkedPath,\n        linked_by_count: linkedIds.length,\n        linked_item_ids: linkedIds,\n      };\n    });\n}\n\n/**\n * Shared linked-artifact list/mutate command core used by runFiles and runDocs.\n * The kind config selects metadata key, op, bare-path noun, and whether\n * append-stable ordering is honored, preserving each twin's exact semantics.\n */\nexport async function runLinkedArtifacts(\n  id: string,\n  options: LinkedArtifactCommandOptions,\n  global: GlobalOptions,\n  config: LinkedArtifactKindConfig,\n): Promise<LinkedArtifactResult> {\n  const { metadataKey } = config;\n  const stdinResolver = createStdinTokenResolver();\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    throw new PmCliError(`Tracker is not initialized at ${pmRoot}. Run pm init first.`, EXIT_CODE.NOT_FOUND);\n  }\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());\n  const resolvedAdds = await stdinResolver.resolveList(options.add, \"--add\");\n  const resolvedAddGlobs = await stdinResolver.resolveList(options.addGlob, \"--add-glob\");\n  const resolvedRemoves = await stdinResolver.resolveList(options.remove, \"--remove\");\n  const resolvedMigrations = await stdinResolver.resolveList(options.migrate, \"--migrate\");\n  const parsedAdds = parseAddEntries(resolvedAdds, config.bareNoun);\n  const addGlobs = parseAddGlobEntries(resolvedAddGlobs);\n  const expandedGlobAdds = await expandAddGlobEntries(addGlobs);\n  const adds = applyStandaloneNote(\n    [...parsedAdds, ...expandedGlobAdds],\n    options.note,\n    parsedAdds.length > 0 || addGlobs.length > 0,\n  );\n  const removes = parseRemoveEntries(resolvedRemoves);\n  const migrations = parseMigrateEntries(resolvedMigrations);\n  const shouldMutate = adds.length > 0 || removes.length > 0 || migrations.length > 0;\n\n  const collectAuditItems = async (): Promise<Array<{ id: string; artifacts?: LinkedArtifact[] }>> =>\n    (await listAllFrontMatter(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema)).map((entry) => ({\n      id: entry.id,\n      artifacts: (entry as Record<string, unknown>)[metadataKey] as LinkedArtifact[] | undefined,\n    }));\n\n  if (!shouldMutate) {\n    const located = await locateItem(pmRoot, id, settings.id_prefix, settings.item_format, typeRegistry.type_to_folder);\n    if (!located) {\n      throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);\n    }\n    const loaded = await readLocatedItem(located, { schema: settings.schema });\n    const artifacts = ((loaded.document.metadata as Record<string, unknown>)[metadataKey] as LinkedArtifact[] | undefined) ?? [];\n    return {\n      id: located.id,\n      artifacts,\n      changed: false,\n      count: artifacts.length,\n      validation: options.validatePaths ? await validateLinkedPaths(artifacts.map((entry) => entry.path)) : undefined,\n      audit: options.audit ? buildLinkedPathAudit(artifacts.map((entry) => entry.path), await collectAuditItems()) : undefined,\n    };\n  }\n\n  const author = resolveAuthor(options.author, settings.author_default);\n  const result = await mutateItem({\n    pmRoot,\n    settings,\n    id,\n    op: config.op,\n    author,\n    message: options.message,\n    force: options.force,\n    mutate(document) {\n      const metadata = document.metadata as Record<string, unknown>;\n      const next = [...((metadata[metadataKey] as LinkedArtifact[] | undefined) ?? [])];\n      let migrationCount = 0;\n      if (migrations.length > 0) {\n        for (let index = 0; index < next.length; index += 1) {\n          const migratedPath = applyPathMigrations(next[index].path, migrations);\n          if (migratedPath !== next[index].path) {\n            next[index] = { ...next[index], path: migratedPath };\n            migrationCount += 1;\n          }\n        }\n      }\n      const migratedAdds = adds.map((entry) => {\n        const migratedPath = applyPathMigrations(entry.path, migrations);\n        if (migratedPath !== entry.path) {\n          migrationCount += 1;\n        }\n        return {\n          ...entry,\n          path: migratedPath,\n        };\n      });\n      const migratedRemoves = removes.map((entry) => applyPathMigrations(entry, migrations));\n      for (const add of migratedAdds) {\n        const exists = next.some((entry) => entry.path === add.path && entry.scope === add.scope);\n        if (!exists) {\n          next.push(add);\n        }\n      }\n      if (migratedRemoves.length > 0) {\n        for (let i = next.length - 1; i >= 0; i -= 1) {\n          if (migratedRemoves.includes(next[i].path)) {\n            next.splice(i, 1);\n          }\n        }\n      }\n      const deduped = dedupeLinkedArtifacts(next);\n      const normalized = config.supportsAppendStable && options.appendStable ? deduped : sortLinkedArtifacts(deduped);\n      if (normalized.length > 0) {\n        metadata[metadataKey] = normalized;\n      } else {\n        delete metadata[metadataKey];\n      }\n      return { changedFields: [metadataKey], warnings: migrationCount > 0 ? [`path_migrations_applied:${migrationCount}`] : [] };\n    },\n  });\n\n  const artifacts = ((result.item as Record<string, unknown>)[metadataKey] as LinkedArtifact[] | undefined) ?? [];\n  const migrationWarning = result.warnings.find((warning) => warning.startsWith(\"path_migrations_applied:\"));\n  const migrationCount = migrationWarning ? Number(migrationWarning.slice(\"path_migrations_applied:\".length)) : 0;\n  const allItems = options.audit ? await collectAuditItems() : [];\n  return {\n    id: result.item.id,\n    artifacts,\n    changed: true,\n    count: artifacts.length,\n    migrations_applied: migrationCount > 0 ? migrationCount : undefined,\n    validation: options.validatePaths ? await validateLinkedPaths(artifacts.map((entry) => entry.path)) : undefined,\n    audit: options.audit ? buildLinkedPathAudit(artifacts.map((entry) => entry.path), allItems) : undefined,\n  };\n}\n\n/**\n * Re-key the generic `artifacts` field to the resource-specific name (files/docs)\n * while preserving the original key order and presence so kind-specific result\n * shapes (and their deterministic JSON key ordering) stay byte-identical.\n */\nexport function renameArtifactsResultKey(result: LinkedArtifactResult, key: \"files\" | \"docs\"): Record<string, unknown> {\n  const out: Record<string, unknown> = {};\n  for (const [field, value] of Object.entries(result)) {\n    out[field === \"artifacts\" ? key : field] = value;\n  }\n  return out;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAKA,OAAO,QAAQ;AACf,OAAO,UAAU;AACjB,OAAO,QAAQ;;;;;;;;AAgCR,IAAM,2BAA2B,CAAC,QAAQ,SAAS,MAAM;AACzD,IAAM,gCAAgC,CAAC,WAAW,QAAQ,QAAQ,SAAS,MAAM;AACjF,IAAM,8BAA8B,CAAC,MAAM;AAC3C,IAAM,+BAA+B,CAAC,QAAQ,IAAI;AAMzD,IAAM,0CAA+D,oBAAI,IAAI,CAAC,QAAQ,OAAO,CAAC;AAwGxF,SAAU,YAAY,KAAuB;AACjD,QAAM,QAAS,OAAO;AACtB,MAAI,CAAC,aAAa,SAAS,KAAK,GAAG;AACjC,UAAM,IAAI,WACR,kBAAkB,GAAG,oBAAoB,aAAa,KAAK,IAAI,CAAC,wBAChE,UAAU,KAAK;EAEnB;AACA,SAAO;AACT;AAKM,SAAU,6BAA6B,KAAW;AACtD,MAAI,IAAI,WAAW,KAAK,KAAK,IAAI,SAAS,IAAI,GAAG;AAC/C,WAAO;EACT;AACA,MAAI,4CAA4C,KAAK,GAAG,GAAG;AACzD,WAAO;EACT;AAGA,SAAO,8BAA8B,GAAG;AAC1C;AAEA,SAAS,mCAAmC,KAAa;AACvD,SAAO,IAAI,QAAQ,CAAC,UAAS;AAC3B,UAAM,UAAU,MAAM,KAAI;AAC1B,QAAI,QAAQ,WAAW,KAAK,6BAA6B,OAAO,KAAK,CAAC,QAAQ,SAAS,GAAG,GAAG;AAC3F,aAAO,CAAC,KAAK;IACf;AACA,WAAO,eAAe,OAAO;EAC/B,CAAC;AACH;AAKM,SAAU,gBAAgB,KAA2B,UAAwB;AACjF,MAAI,CAAC;AAAK,WAAO,CAAA;AACjB,SAAO,mCAAmC,GAAG,EAAE,IAAI,CAAC,UAAS;AAC3D,UAAM,UAAU,MAAM,KAAI;AAC1B,UAAM,KAAK,6BAA6B,OAAO,IAAI,WAAW,OAAO,OAAO,IAAI,EAAE,MAAM,QAAO;AAC/F,2BAAuB,IAAI,SAAS,wBAAwB;AAC5D,QAAI,CAAC,GAAG,MAAM;AACZ,YAAM,IAAI,WAAW,yCAAyC,QAAQ,SAAS,UAAU,KAAK;IAChG;AACA,WAAO;MACL,MAAM,GAAG;MACT,OAAO,YAAY,GAAG,KAAK;MAC3B,MAAM,GAAG,MAAM,KAAI,KAAM;;EAE7B,CAAC;AACH;AAKM,SAAU,oBAAoB,KAAyB;AAC3D,MAAI,CAAC;AAAK,WAAO,CAAA;AACjB,SAAO,IAAI,IAAI,CAAC,UAAS;AACvB,UAAM,UAAU,MAAM,KAAI;AAC1B,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,WAAW,4CAA4C,UAAU,KAAK;IAClF;AACA,QAAI,QAAQ,SAAS,GAAG,KAAK,8CAA8C,KAAK,OAAO,KAAK,QAAQ,WAAW,KAAK,GAAG;AACrH,YAAM,KAAK,WAAW,SAAS,YAAY;AAC3C,6BAAuB,IAAI,cAAc,6BAA6B;AACtE,YAAM,UAAU,GAAG,SAAS,KAAI,KAAM,GAAG,MAAM,KAAI,KAAM,GAAG,MAAM,KAAI;AACtE,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,WAAW,qDAAqD,UAAU,KAAK;MAC3F;AACA,aAAO;QACL;QACA,OAAO,YAAY,GAAG,KAAK;QAC3B,MAAM,GAAG,MAAM,KAAI,KAAM;;IAE7B;AACA,WAAO;MACL,SAAS;MACT,OAAO;;EAEX,CAAC;AACH;AAKM,SAAU,mBAAmB,KAAyB;AAC1D,MAAI,CAAC;AAAK,WAAO,CAAA;AACjB,SAAO,IAAI,IAAI,CAAC,UAAS;AACvB,UAAM,UAAU,MAAM,KAAI;AAC1B,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,WAAW,kCAAkC,UAAU,KAAK;IACxE;AACA,QAAI,QAAQ,SAAS,GAAG,KAAK,6BAA6B,KAAK,OAAO,KAAK,QAAQ,WAAW,KAAK,GAAG;AACpG,YAAM,KAAK,WAAW,SAAS,UAAU;AAKzC,YAAM,wBAAwB,OAAO,KAAK,EAAE,EAAE,OAAO,CAAC,QACpD,wCAAwC,IAAI,IAAI,YAAW,CAAE,CAAC;AAEhE,UAAI,sBAAsB,SAAS,GAAG;AACpC,cAAM,IAAI,WACR,0EAA0E,sBACvE,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG,EACvB,KAAK,IAAI,CAAC,6HACb,UAAU,KAAK;MAEnB;AACA,6BAAuB,IAAI,YAAY,2BAA2B;AAClE,UAAI,CAAC,GAAG,MAAM;AACZ,cAAM,IAAI,WAAW,iDAAiD,UAAU,KAAK;MACvF;AACA,aAAO,GAAG;IACZ;AACA,WAAO;EACT,CAAC;AACH;AAKM,SAAU,oBAAoB,KAAyB;AAC3D,MAAI,CAAC;AAAK,WAAO,CAAA;AACjB,SAAO,IAAI,IAAI,CAAC,UAAS;AACvB,UAAM,KAAK,WAAW,OAAO,WAAW;AACxC,2BAAuB,IAAI,aAAa,4BAA4B;AACpE,UAAM,OAAO,GAAG,MAAM,KAAI;AAC1B,UAAM,KAAK,GAAG,IAAI,KAAI;AACtB,QAAI,CAAC,QAAQ,CAAC,IAAI;AAChB,YAAM,IAAI,WAAW,kDAAkD,UAAU,KAAK;IACxF;AACA,WAAO,EAAE,MAAM,GAAE;EACnB,CAAC;AACH;AAKM,SAAU,oBAAoB,cAAsB,YAA2B;AACnF,MAAI,OAAO;AACX,aAAW,aAAa,YAAY;AAClC,QAAI,KAAK,WAAW,UAAU,IAAI,GAAG;AACnC,aAAO,GAAG,UAAU,EAAE,GAAG,KAAK,MAAM,UAAU,KAAK,MAAM,CAAC;IAC5D;EACF;AACA,SAAO;AACT;AAKM,SAAU,oBAAoB,OAAa;AAC/C,SAAO,MAAM,MAAM,KAAK,GAAG,EAAE,KAAK,GAAG;AACvC;AAKA,eAAsB,qBAAqB,SAAuB;AAChE,QAAM,WAA6B,CAAA;AACnC,aAAW,SAAS,SAAS;AAC3B,UAAM,kBAAkB,KAAK,WAAW,MAAM,OAAO;AACrD,UAAM,UAAU,MAAM,GAAG,MAAM,SAAS;MACtC,KAAK,QAAQ,IAAG;MAChB,UAAU;MACV,WAAW;MACX,KAAK;MACL,QAAQ;MACR,qBAAqB;KACtB;AACD,UAAM,gBAAgB,CAAC,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC,UAAU,oBAAoB,KAAK,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,UACjH,KAAK,cAAc,KAAK,CAAC;AAE3B,eAAW,eAAe,eAAe;AACvC,eAAS,KAAK;QACZ,MAAM;QACN,OAAO,MAAM;QACb,MAAM,MAAM;OACb;IACH;EACF;AACA,SAAO;AACT;AAYM,SAAU,oBACd,MACA,MACA,aAAoB;AAEpB,MAAI,SAAS,QAAW;AACtB,WAAO;EACT;AACA,MAAI,CAAC,aAAa;AAChB,UAAM,IAAI,WACR,yGACA,UAAU,KAAK;EAEnB;AACA,QAAM,UAAU,KAAK,KAAI;AACzB,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;EACT;AACA,SAAO,KAAK,IAAI,CAAC,UAAW,MAAM,SAAS,SAAY,EAAE,GAAG,OAAO,MAAM,QAAO,IAAK,KAAM;AAC7F;AAKM,SAAU,YAAY,OAA6C;AACvE,SAAO,GAAG,MAAM,IAAI,KAAK,MAAM,KAAK;AACtC;AAKM,SAAU,oBAAoB,WAA2B;AAC7D,SAAO,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,MAAM,UAAS;AACzC,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,WAAO,KAAK,MAAM,cAAc,MAAM,KAAK;EAC7C,CAAC;AACH;AAKM,SAAU,sBAAsB,WAA2B;AAC/D,SAAO,CAAC,GAAG,IAAI,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC,YAAY,KAAK,GAAG,KAAK,CAAC,CAAC,EAAE,OAAM,CAAE,EAAE,IAAI,CAAC,WAAW;IAClG,GAAG;IACH,MAAM,MAAM,MAAM,KAAI,KAAM;IAC5B;AACJ;AAKA,eAAsB,oBAAoB,OAAe;AACvD,QAAM,cAAc,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACvF,QAAM,gBAA0B,CAAA;AAChC,QAAM,eAAyB,CAAA;AAC/B,QAAM,eAAyB,CAAA;AAC/B,QAAM,mBAA6B,CAAA;AACnC,aAAW,gBAAgB,aAAa;AAItC,QAAI,gCAAgC,YAAY,GAAG;AACjD,uBAAiB,KAAK,aAAa,KAAI,CAAE;AACzC;IACF;AACA,UAAM,eAAe,KAAK,WAAW,YAAY,IAAI,eAAe,KAAK,QAAQ,QAAQ,IAAG,GAAI,YAAY;AAC5G,QAAI;AACF,YAAM,QAAQ,MAAM,GAAG,KAAK,YAAY;AACxC,UAAI,MAAM,OAAM,GAAI;AAClB,sBAAc,KAAK,YAAY;MACjC,OAAO;AACL,qBAAa,KAAK,YAAY;MAChC;IACF,SAAS,OAAgB;AACvB,UAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,SAAU,MAA4B,SAAS,UAAU;AACpH,qBAAa,KAAK,YAAY;AAC9B;MACF;AACA,mBAAa,KAAK,YAAY;IAChC;EACF;AACA,SAAO;IACL,SAAS,YAAY;IACrB,gBAAgB;IAChB,eAAe;IACf,gBAAgB;IAChB,mBAAmB;;AAEvB;AAKM,SAAU,qBACd,OACA,UAA6D;AAE7D,QAAM,QAAQ,oBAAI,IAAG;AACrB,aAAW,QAAQ,UAAU;AAC3B,eAAW,kBAAkB,KAAK,aAAa,CAAA,GAAI;AACjD,YAAM,OAAO,MAAM,IAAI,eAAe,IAAI,KAAK,oBAAI,IAAG;AACtD,WAAK,IAAI,KAAK,EAAE;AAChB,YAAM,IAAI,eAAe,MAAM,IAAI;IACrC;EACF;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,EACtB,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC,EAC/C,IAAI,CAAC,eAAc;AAClB,UAAM,YAAY,CAAC,GAAI,MAAM,IAAI,UAAU,KAAK,oBAAI,IAAG,CAAW,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACnH,WAAO;MACL,MAAM;MACN,iBAAiB,UAAU;MAC3B,iBAAiB;;EAErB,CAAC;AACL;AAOA,eAAsB,mBACpB,IACA,SACAA,SACA,QAAgC;AAEhC,QAAM,EAAE,YAAW,IAAK;AACxB,QAAM,gBAAgB,yBAAwB;AAC9C,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAIA,QAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WAAW,iCAAiC,MAAM,wBAAwB,UAAU,SAAS;EACzG;AACA,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBAAwB,UAAU,gCAA+B,CAAE;AACxF,QAAM,eAAe,MAAM,cAAc,YAAY,QAAQ,KAAK,OAAO;AACzE,QAAM,mBAAmB,MAAM,cAAc,YAAY,QAAQ,SAAS,YAAY;AACtF,QAAM,kBAAkB,MAAM,cAAc,YAAY,QAAQ,QAAQ,UAAU;AAClF,QAAM,qBAAqB,MAAM,cAAc,YAAY,QAAQ,SAAS,WAAW;AACvF,QAAM,aAAa,gBAAgB,cAAc,OAAO,QAAQ;AAChE,QAAM,WAAW,oBAAoB,gBAAgB;AACrD,QAAM,mBAAmB,MAAM,qBAAqB,QAAQ;AAC5D,QAAM,OAAO,oBACX,CAAC,GAAG,YAAY,GAAG,gBAAgB,GACnC,QAAQ,MACR,WAAW,SAAS,KAAK,SAAS,SAAS,CAAC;AAE9C,QAAM,UAAU,mBAAmB,eAAe;AAClD,QAAM,aAAa,oBAAoB,kBAAkB;AACzD,QAAM,eAAe,KAAK,SAAS,KAAK,QAAQ,SAAS,KAAK,WAAW,SAAS;AAElF,QAAM,oBAAoB,aACvB,MAAM,mBAAmB,QAAQ,SAAS,aAAa,aAAa,gBAAgB,QAAW,SAAS,MAAM,GAAG,IAAI,CAAC,WAAW;IAChI,IAAI,MAAM;IACV,WAAY,MAAkC,WAAW;IACzD;AAEJ,MAAI,CAAC,cAAc;AACjB,UAAM,UAAU,MAAM,WAAW,QAAQ,IAAI,SAAS,WAAW,SAAS,aAAa,aAAa,cAAc;AAClH,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;IAClE;AACA,UAAM,SAAS,MAAM,gBAAgB,SAAS,EAAE,QAAQ,SAAS,OAAM,CAAE;AACzE,UAAMC,aAAc,OAAO,SAAS,SAAqC,WAAW,KAAsC,CAAA;AAC1H,WAAO;MACL,IAAI,QAAQ;MACZ,WAAAA;MACA,SAAS;MACT,OAAOA,WAAU;MACjB,YAAY,QAAQ,gBAAgB,MAAM,oBAAoBA,WAAU,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,IAAI;MACtG,OAAO,QAAQ,QAAQ,qBAAqBA,WAAU,IAAI,CAAC,UAAU,MAAM,IAAI,GAAG,MAAM,kBAAiB,CAAE,IAAI;;EAEnH;AAEA,QAAM,SAAS,cAAc,QAAQ,QAAQ,SAAS,cAAc;AACpE,QAAM,SAAS,MAAM,WAAW;IAC9B;IACA;IACA;IACA,IAAI,OAAO;IACX;IACA,SAAS,QAAQ;IACjB,OAAO,QAAQ;IACf,OAAO,UAAQ;AACb,YAAM,WAAW,SAAS;AAC1B,YAAM,OAAO,CAAC,GAAK,SAAS,WAAW,KAAsC,CAAA,CAAG;AAChF,UAAIC,kBAAiB;AACrB,UAAI,WAAW,SAAS,GAAG;AACzB,iBAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS,GAAG;AACnD,gBAAM,eAAe,oBAAoB,KAAK,KAAK,EAAE,MAAM,UAAU;AACrE,cAAI,iBAAiB,KAAK,KAAK,EAAE,MAAM;AACrC,iBAAK,KAAK,IAAI,EAAE,GAAG,KAAK,KAAK,GAAG,MAAM,aAAY;AAClD,YAAAA,mBAAkB;UACpB;QACF;MACF;AACA,YAAM,eAAe,KAAK,IAAI,CAAC,UAAS;AACtC,cAAM,eAAe,oBAAoB,MAAM,MAAM,UAAU;AAC/D,YAAI,iBAAiB,MAAM,MAAM;AAC/B,UAAAA,mBAAkB;QACpB;AACA,eAAO;UACL,GAAG;UACH,MAAM;;MAEV,CAAC;AACD,YAAM,kBAAkB,QAAQ,IAAI,CAAC,UAAU,oBAAoB,OAAO,UAAU,CAAC;AACrF,iBAAW,OAAO,cAAc;AAC9B,cAAM,SAAS,KAAK,KAAK,CAAC,UAAU,MAAM,SAAS,IAAI,QAAQ,MAAM,UAAU,IAAI,KAAK;AACxF,YAAI,CAAC,QAAQ;AACX,eAAK,KAAK,GAAG;QACf;MACF;AACA,UAAI,gBAAgB,SAAS,GAAG;AAC9B,iBAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAC5C,cAAI,gBAAgB,SAAS,KAAK,CAAC,EAAE,IAAI,GAAG;AAC1C,iBAAK,OAAO,GAAG,CAAC;UAClB;QACF;MACF;AACA,YAAM,UAAU,sBAAsB,IAAI;AAC1C,YAAM,aAAa,OAAO,wBAAwB,QAAQ,eAAe,UAAU,oBAAoB,OAAO;AAC9G,UAAI,WAAW,SAAS,GAAG;AACzB,iBAAS,WAAW,IAAI;MAC1B,OAAO;AACL,eAAO,SAAS,WAAW;MAC7B;AACA,aAAO,EAAE,eAAe,CAAC,WAAW,GAAG,UAAUA,kBAAiB,IAAI,CAAC,2BAA2BA,eAAc,EAAE,IAAI,CAAA,EAAE;IAC1H;GACD;AAED,QAAM,YAAc,OAAO,KAAiC,WAAW,KAAsC,CAAA;AAC7G,QAAM,mBAAmB,OAAO,SAAS,KAAK,CAAC,YAAY,QAAQ,WAAW,0BAA0B,CAAC;AACzG,QAAM,iBAAiB,mBAAmB,OAAO,iBAAiB,MAAM,2BAA2B,MAAM,CAAC,IAAI;AAC9G,QAAM,WAAW,QAAQ,QAAQ,MAAM,kBAAiB,IAAK,CAAA;AAC7D,SAAO;IACL,IAAI,OAAO,KAAK;IAChB;IACA,SAAS;IACT,OAAO,UAAU;IACjB,oBAAoB,iBAAiB,IAAI,iBAAiB;IAC1D,YAAY,QAAQ,gBAAgB,MAAM,oBAAoB,UAAU,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,IAAI;IACtG,OAAO,QAAQ,QAAQ,qBAAqB,UAAU,IAAI,CAAC,UAAU,MAAM,IAAI,GAAG,QAAQ,IAAI;;AAElG;AAOM,SAAU,yBAAyB,QAA8B,KAAqB;AAC1F,QAAM,MAA+B,CAAA;AACrC,aAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACnD,QAAI,UAAU,cAAc,MAAM,KAAK,IAAI;EAC7C;AACA,SAAO;AACT;",
+  "names": ["global", "artifacts", "migrationCount"]
+}

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

@@ -0,0 +1,84 @@
+// dist/cli/commands/list-filter-shared.js
+
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="a8f1a4bb-c8c4-5776-a249-4b345e09d5e4")}catch(e){}}();
+var LIST_VALUE_FILTER_KEYS = [
+  "status",
+  "type",
+  "tag",
+  "priority",
+  "deadlineBefore",
+  "deadlineAfter",
+  "updatedAfter",
+  "updatedBefore",
+  "createdAfter",
+  "createdBefore",
+  "ids",
+  "assignee",
+  "assigneeFilter",
+  "parent",
+  "sprint",
+  "release"
+];
+var LIST_BOOLEAN_FILTER_KEYS = [
+  "filterAcMissing",
+  "filterEstimatesMissing",
+  "filterResolutionMissing",
+  "filterMetadataMissing",
+  "filterReviewerMissing",
+  "filterRiskMissing",
+  "filterConfidenceMissing",
+  "filterSprintMissing",
+  "filterReleaseMissing",
+  "hasNotes",
+  "hasLearnings",
+  "hasFiles",
+  "hasDocs",
+  "hasTests",
+  "hasComments",
+  "hasDeps",
+  "hasBody",
+  "hasLinkedCommand",
+  "noNotes",
+  "noLearnings",
+  "noFiles",
+  "noDocs",
+  "noTests",
+  "noComments",
+  "noDeps",
+  "emptyBody",
+  "noLinkedCommand"
+];
+function isActiveListFilterValue(value) {
+  return value != null && (typeof value !== "string" || value.split(",").some((entry) => entry.trim().length > 0));
+}
+function hasListFilters(list, status, options = {}) {
+  const includePagination = options.includePagination !== false;
+  const valueCandidates = [
+    status,
+    ...LIST_VALUE_FILTER_KEYS.map((key) => list?.[key]),
+    ...includePagination ? [list?.limit, list?.offset] : []
+  ];
+  return valueCandidates.some(isActiveListFilterValue) || LIST_BOOLEAN_FILTER_KEYS.some((key) => list?.[key] === true);
+}
+function buildListQueryFilters(filters) {
+  return {
+    type: filters.type,
+    tag: filters.tag,
+    priority: filters.priority,
+    deadlineBefore: filters.deadlineBefore,
+    deadlineAfter: filters.deadlineAfter,
+    assignee: filters.assignee,
+    assigneeFilter: filters.assigneeFilter,
+    parent: filters.parent,
+    sprint: filters.sprint,
+    release: filters.release
+  };
+}
+
+export {
+  hasListFilters,
+  buildListQueryFilters
+};
+//# sourceMappingURL=chunk-VY3VQ22F.js.map
+
+//# debugId=a8f1a4bb-c8c4-5776-a249-4b345e09d5e4

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../cli/commands/list-filter-shared.ts"],"sourcesContent":["/**\n * @module cli/commands/list-filter-shared\n *\n * Implements the pm list filter shared command surface and its agent-facing runtime behavior.\n */\nimport type { ListOptions } from \"./list.js\";\n\ninterface HasListFilterOptions {\n  includePagination?: boolean;\n}\n\nconst LIST_VALUE_FILTER_KEYS = [\n  \"status\",\n  \"type\",\n  \"tag\",\n  \"priority\",\n  \"deadlineBefore\",\n  \"deadlineAfter\",\n  \"updatedAfter\",\n  \"updatedBefore\",\n  \"createdAfter\",\n  \"createdBefore\",\n  \"ids\",\n  \"assignee\",\n  \"assigneeFilter\",\n  \"parent\",\n  \"sprint\",\n  \"release\",\n] as const satisfies readonly (keyof ListOptions)[];\n\nconst LIST_BOOLEAN_FILTER_KEYS = [\n  \"filterAcMissing\",\n  \"filterEstimatesMissing\",\n  \"filterResolutionMissing\",\n  \"filterMetadataMissing\",\n  \"filterReviewerMissing\",\n  \"filterRiskMissing\",\n  \"filterConfidenceMissing\",\n  \"filterSprintMissing\",\n  \"filterReleaseMissing\",\n  \"hasNotes\",\n  \"hasLearnings\",\n  \"hasFiles\",\n  \"hasDocs\",\n  \"hasTests\",\n  \"hasComments\",\n  \"hasDeps\",\n  \"hasBody\",\n  \"hasLinkedCommand\",\n  \"noNotes\",\n  \"noLearnings\",\n  \"noFiles\",\n  \"noDocs\",\n  \"noTests\",\n  \"noComments\",\n  \"noDeps\",\n  \"emptyBody\",\n  \"noLinkedCommand\",\n] as const satisfies readonly (keyof ListOptions)[];\n\nfunction isActiveListFilterValue(value: unknown): boolean {\n  return value != null && (typeof value !== \"string\" || value.split(\",\").some((entry) => entry.trim().length > 0));\n}\n\n/**\n * Implements check whether list filters for the public runtime surface of this module.\n */\nexport function hasListFilters(\n  list: ListOptions | undefined,\n  status: string | undefined,\n  options: HasListFilterOptions = {},\n): boolean {\n  const includePagination = options.includePagination !== false;\n  const valueCandidates = [\n    status,\n    ...LIST_VALUE_FILTER_KEYS.map((key) => list?.[key]),\n    ...(includePagination ? [list?.limit, list?.offset] : []),\n  ];\n  return (\n    valueCandidates.some(isActiveListFilterValue) || LIST_BOOLEAN_FILTER_KEYS.some((key) => list?.[key] === true)\n  );\n}\n\n/**\n * Restricts list query filters values accepted by command, SDK, and storage contracts.\n */\nexport type ListQueryFilters = Pick<\n  ListOptions,\n  | \"type\"\n  | \"tag\"\n  | \"priority\"\n  | \"deadlineBefore\"\n  | \"deadlineAfter\"\n  | \"assignee\"\n  | \"assigneeFilter\"\n  | \"parent\"\n  | \"sprint\"\n  | \"release\"\n>;\n\n/**\n * Implements build list query filters for the public runtime surface of this module.\n */\nexport function buildListQueryFilters(filters: ListQueryFilters): ListOptions {\n  return {\n    type: filters.type,\n    tag: filters.tag,\n    priority: filters.priority,\n    deadlineBefore: filters.deadlineBefore,\n    deadlineAfter: filters.deadlineAfter,\n    assignee: filters.assignee,\n    assigneeFilter: filters.assigneeFilter,\n    parent: filters.parent,\n    sprint: filters.sprint,\n    release: filters.release,\n  };\n}\n"],"names":[],"mappings":";;;AAWA,IAAM,yBAAyB;EAC7B;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAGF,IAAM,2BAA2B;EAC/B;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAGF,SAAS,wBAAwB,OAAc;AAC7C,SAAO,SAAS,SAAS,OAAO,UAAU,YAAY,MAAM,MAAM,GAAG,EAAE,KAAK,CAAC,UAAU,MAAM,KAAI,EAAG,SAAS,CAAC;AAChH;AAKM,SAAU,eACd,MACA,QACA,UAAgC,CAAA,GAAE;AAElC,QAAM,oBAAoB,QAAQ,sBAAsB;AACxD,QAAM,kBAAkB;IACtB;IACA,GAAG,uBAAuB,IAAI,CAAC,QAAQ,OAAO,GAAG,CAAC;IAClD,GAAI,oBAAoB,CAAC,MAAM,OAAO,MAAM,MAAM,IAAI,CAAA;;AAExD,SACE,gBAAgB,KAAK,uBAAuB,KAAK,yBAAyB,KAAK,CAAC,QAAQ,OAAO,GAAG,MAAM,IAAI;AAEhH;AAsBM,SAAU,sBAAsB,SAAyB;AAC7D,SAAO;IACL,MAAM,QAAQ;IACd,KAAK,QAAQ;IACb,UAAU,QAAQ;IAClB,gBAAgB,QAAQ;IACxB,eAAe,QAAQ;IACvB,UAAU,QAAQ;IAClB,gBAAgB,QAAQ;IACxB,QAAQ,QAAQ;IAChB,QAAQ,QAAQ;IAChB,SAAS,QAAQ;;AAErB","debugId":"a8f1a4bb-c8c4-5776-a249-4b345e09d5e4"}

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

@@ -0,0 +1,382 @@
+// dist/core/config/nested-settings.js
+!(function() {
+  try {
+    var e = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof globalThis ? globalThis : "undefined" != typeof self ? self : {}, n = new e.Error().stack;
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "439e5c08-5cff-56f0-a21d-15ffdb7afe94");
+  } catch (e2) {
+  }
+})();
+var NESTED_SETTING_DESCRIPTORS = [
+  {
+    key: "search_provider",
+    path: "search.provider",
+    kind: "string",
+    summary: "Search embedding provider name (e.g. openai, ollama, or an extension provider)."
+  },
+  {
+    key: "search_mutation_refresh_policy",
+    path: "search.mutation_refresh_policy",
+    kind: "string",
+    choices: ["cache_only", "semantic_configured", "semantic_auto"],
+    summary: "Mutation-time search refresh policy: cache_only, semantic_configured, or semantic_auto."
+  },
+  {
+    key: "search_query_expansion_enabled",
+    path: "search.query_expansion.enabled",
+    kind: "boolean",
+    summary: "Enable or disable query expansion for semantic/hybrid search."
+  },
+  {
+    key: "search_query_expansion_provider",
+    path: "search.query_expansion.provider",
+    kind: "string",
+    summary: "Query expansion provider name (built-in openai/ollama or extension provider)."
+  },
+  {
+    key: "search_rerank_enabled",
+    path: "search.rerank.enabled",
+    kind: "boolean",
+    summary: "Enable or disable post-retrieval reranking for hybrid search."
+  },
+  {
+    key: "search_rerank_model",
+    path: "search.rerank.model",
+    kind: "string",
+    summary: "Rerank model name override used by built-in providers."
+  },
+  {
+    key: "search_rerank_top_k",
+    path: "search.rerank.top_k",
+    kind: "integer",
+    min: 1,
+    summary: "Number of top hybrid candidates to rerank when rerank is enabled."
+  },
+  {
+    key: "search_embedding_model",
+    path: "search.embedding_model",
+    kind: "string",
+    summary: "Default embedding model name (overrides provider-specific model when set)."
+  },
+  {
+    key: "search_embedding_corpus_max_characters",
+    path: "search.embedding_corpus_max_characters",
+    kind: "integer",
+    min: 1,
+    summary: "Maximum semantic corpus characters per item before truncation."
+  },
+  {
+    key: "search_embedding_batch_size",
+    path: "search.embedding_batch_size",
+    kind: "integer",
+    min: 1,
+    summary: "Number of items embedded per request batch."
+  },
+  {
+    key: "search_embedding_timeout_ms",
+    path: "search.embedding_timeout_ms",
+    kind: "integer",
+    min: 1,
+    summary: "Per-request embedding timeout in milliseconds."
+  },
+  {
+    key: "search_score_threshold",
+    path: "search.score_threshold",
+    kind: "number",
+    summary: "Minimum score for a hit to be returned (0 keeps all matches)."
+  },
+  {
+    key: "search_hybrid_semantic_weight",
+    path: "search.hybrid_semantic_weight",
+    kind: "ratio",
+    summary: "Hybrid mode semantic weight in [0, 1] (1-weight goes to keyword)."
+  },
+  {
+    key: "search_max_results",
+    path: "search.max_results",
+    kind: "integer",
+    min: 1,
+    summary: "Default upper bound on search hits when --limit is not supplied."
+  },
+  {
+    key: "search_bm25_k1",
+    path: "search.bm25.k1",
+    kind: "number",
+    min: 0,
+    summary: "Offline BM25 term-frequency saturation (k1); higher saturates repeated terms slower (default 1.2)."
+  },
+  {
+    key: "search_bm25_b",
+    path: "search.bm25.b",
+    kind: "ratio",
+    summary: "Offline BM25 document-length normalization (b) in [0, 1]; 0 disables, 1 fully normalizes (default 0.75)."
+  },
+  {
+    key: "openai_base_url",
+    path: "providers.openai.base_url",
+    kind: "string",
+    summary: "OpenAI-compatible API base URL (LM Studio/vLLM also use this)."
+  },
+  {
+    key: "openai_api_key",
+    path: "providers.openai.api_key",
+    kind: "string",
+    summary: "OpenAI-compatible API key."
+  },
+  {
+    key: "openai_model",
+    path: "providers.openai.model",
+    kind: "string",
+    summary: "OpenAI-compatible embedding model name."
+  },
+  {
+    key: "ollama_base_url",
+    path: "providers.ollama.base_url",
+    kind: "string",
+    summary: "Ollama API base URL (typically http://localhost:11434)."
+  },
+  {
+    key: "ollama_model",
+    path: "providers.ollama.model",
+    kind: "string",
+    summary: "Ollama embedding model name (e.g. nomic-embed-text)."
+  },
+  {
+    key: "vector_store_adapter",
+    path: "vector_store.adapter",
+    kind: "string",
+    summary: "Vector store adapter name (lancedb, qdrant, or an extension adapter)."
+  },
+  {
+    key: "vector_store_collection_name",
+    path: "vector_store.collection_name",
+    kind: "string",
+    non_empty: true,
+    summary: "Vector collection/table name shared by Qdrant and LanceDB adapters."
+  },
+  {
+    key: "qdrant_url",
+    path: "vector_store.qdrant.url",
+    kind: "string",
+    summary: "Qdrant HTTP API URL."
+  },
+  {
+    key: "qdrant_api_key",
+    path: "vector_store.qdrant.api_key",
+    kind: "string",
+    summary: "Qdrant API key (empty if running unauthenticated)."
+  },
+  {
+    key: "lancedb_path",
+    path: "vector_store.lancedb.path",
+    kind: "string",
+    summary: "LanceDB storage path (relative to pm root or absolute)."
+  },
+  // General workspace leaves (id/author/output/locks/schema governance). These
+  // are documented user-facing settings in CONFIGURATION.md that previously
+  // required hand-editing settings.json.
+  {
+    key: "id_prefix",
+    path: "id_prefix",
+    kind: "string",
+    non_empty: true,
+    summary: 'Prefix for generated item IDs (e.g. "pm" produces pm-xxxx).'
+  },
+  {
+    key: "author_default",
+    path: "author_default",
+    kind: "string",
+    non_empty: true,
+    summary: "Default author recorded on mutations when --author is not supplied."
+  },
+  {
+    key: "output_default_format",
+    path: "output.default_format",
+    kind: "string",
+    choices: ["toon", "json"],
+    summary: "Default output format for commands that support it: toon or json."
+  },
+  {
+    key: "locks_ttl_seconds",
+    path: "locks.ttl_seconds",
+    kind: "integer",
+    min: 1,
+    summary: "Claim/lock time-to-live in seconds before a stale lock can be reclaimed."
+  },
+  {
+    key: "checkpoints_retention_days",
+    path: "checkpoints.retention_days",
+    kind: "integer",
+    min: 1,
+    summary: "Age in days above which pm gc --scope checkpoints prunes bulk-mutation rollback checkpoints."
+  },
+  {
+    key: "schema_unknown_field_policy",
+    path: "schema.unknown_field_policy",
+    kind: "string",
+    choices: ["allow", "warn", "reject"],
+    summary: "How item I/O handles metadata keys not in the field registry: allow, warn, or reject."
+  },
+  // History compaction policy leaves (pm health advisory + pm history-compact
+  // bulk-sweep default threshold). Disabled by default; enabling makes large
+  // streams discoverable without a manual stats pass.
+  {
+    key: "history_compact_policy_enabled",
+    path: "history.compact_policy.enabled",
+    kind: "boolean",
+    summary: "Enable the history-compaction advisory: pm health warns on over-threshold streams."
+  },
+  {
+    key: "history_compact_policy_max_entries",
+    path: "history.compact_policy.max_entries",
+    kind: "integer",
+    min: 1,
+    summary: "Entry count above which a history stream is flagged (and the default pm history-compact --all-over threshold)."
+  },
+  {
+    key: "history_compact_policy_trigger",
+    path: "history.compact_policy.trigger",
+    kind: "string",
+    choices: ["health_warn", "auto"],
+    summary: "History-compaction policy intent: health_warn (advisory only) or auto (scheduled sweeps expected)."
+  }
+];
+var DESCRIPTOR_BY_KEY = new Map(NESTED_SETTING_DESCRIPTORS.map((descriptor) => [descriptor.key, descriptor]));
+function resolveNestedSettingDescriptor(raw) {
+  if (typeof raw !== "string") {
+    return void 0;
+  }
+  const normalized = raw.trim().toLowerCase().replaceAll("-", "_");
+  if (normalized.length === 0) {
+    return void 0;
+  }
+  return DESCRIPTOR_BY_KEY.get(normalized);
+}
+function parseNestedSettingValue(descriptor, rawValue) {
+  if (typeof rawValue !== "string") {
+    return { ok: false, error: { message: `Config set ${descriptor.key} requires a string value` } };
+  }
+  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 } };
+    }
+    return {
+      ok: false,
+      error: {
+        message: `Config set ${descriptor.key} requires a boolean value (true|false), 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 } };
+  }
+  if (trimmed.length === 0) {
+    return {
+      ok: false,
+      error: { message: `Config set ${descriptor.key} requires a non-empty value` }
+    };
+  }
+  const parsed = Number(trimmed);
+  if (!Number.isFinite(parsed)) {
+    return {
+      ok: false,
+      error: { message: `Config set ${descriptor.key} requires a finite number, got "${rawValue}"` }
+    };
+  }
+  if (descriptor.kind === "integer") {
+    if (!Number.isInteger(parsed) || parsed < 0) {
+      return {
+        ok: false,
+        error: { message: `Config set ${descriptor.key} requires a non-negative integer, got "${rawValue}"` }
+      };
+    }
+    if (descriptor.min !== void 0 && parsed < descriptor.min) {
+      return {
+        ok: false,
+        error: {
+          message: `Config set ${descriptor.key} requires an integer >= ${descriptor.min}, got "${rawValue}" (the runtime silently ignores 0 here and falls back to the default)`
+        }
+      };
+    }
+    return { ok: true, parsed: { descriptor, value: parsed } };
+  }
+  if (descriptor.kind === "ratio") {
+    if (parsed < 0 || parsed > 1) {
+      return {
+        ok: false,
+        error: { message: `Config set ${descriptor.key} requires a number in [0, 1], got "${rawValue}"` }
+      };
+    }
+    return { ok: true, parsed: { descriptor, value: parsed } };
+  }
+  if (descriptor.min !== void 0 && parsed < 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 } };
+}
+function readNestedSettingValue(settings, descriptor) {
+  const segments = descriptor.path.split(".");
+  let cursor = settings;
+  for (const segment of segments) {
+    if (typeof cursor !== "object" || cursor === null) {
+      return null;
+    }
+    cursor = cursor[segment];
+  }
+  if (typeof cursor === "string" || typeof cursor === "number" || typeof cursor === "boolean") {
+    return cursor;
+  }
+  return null;
+}
+function writeNestedSettingValue(settings, descriptor, value) {
+  const segments = descriptor.path.split(".");
+  let cursor = settings;
+  for (let index = 0; index < segments.length - 1; index += 1) {
+    const segment = segments[index];
+    const existing = cursor[segment];
+    if (typeof existing !== "object" || existing === null || Array.isArray(existing)) {
+      const next = {};
+      cursor[segment] = next;
+      cursor = next;
+    } else {
+      cursor = existing;
+    }
+  }
+  const leafKey = segments[segments.length - 1];
+  const previous = cursor[leafKey];
+  if (previous === value) {
+    return false;
+  }
+  cursor[leafKey] = value;
+  return true;
+}
+
+export {
+  NESTED_SETTING_DESCRIPTORS,
+  resolveNestedSettingDescriptor,
+  parseNestedSettingValue,
+  readNestedSettingValue,
+  writeNestedSettingValue
+};
+//# sourceMappingURL=chunk-VZDBVEZR.js.map

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

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