@unbrained/pm-cli 2026.6.13 → 2026.6.17

package/dist/cli-bundle/chunks/{deps-GPB3LGWN.js.map → deps-5GWMMS6D.js.map}

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../../../cli/commands/deps.ts"],
-  "sourcesContent": ["import { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.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 { listAllFrontMatterLight } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { Dependency, ItemFrontMatter, ItemStatus, ItemType } from \"../../types/index.js\";\n\nexport const DEPS_FORMAT_VALUES = [\"tree\", \"graph\"] as const;\nexport type DepsFormat = (typeof DEPS_FORMAT_VALUES)[number];\nexport const DEPS_COLLAPSE_VALUES = [\"none\", \"repeated\"] as const;\nexport type DepsCollapseMode = (typeof DEPS_COLLAPSE_VALUES)[number];\n\nexport interface DepsCommandOptions {\n  format?: string;\n  maxDepth?: string | number;\n  collapse?: string;\n  summary?: boolean;\n}\n\ninterface IndexedItem {\n  id: string;\n  title: string;\n  type: ItemType;\n  status: ItemStatus;\n  dependencies: Dependency[];\n}\n\nexport interface DepsTreeNode {\n  id: string;\n  title?: string;\n  type?: ItemType;\n  status?: ItemStatus;\n  via?: string;\n  missing: boolean;\n  cycle: boolean;\n  truncated?: boolean;\n  collapsed?: boolean;\n  dependencies: DepsTreeNode[];\n}\n\nexport interface DepsGraphNode {\n  id: string;\n  title?: string;\n  type?: ItemType;\n  status?: ItemStatus;\n  missing: boolean;\n}\n\nexport interface DepsGraphEdge {\n  from: string;\n  to: string;\n  kind: string;\n}\n\nexport interface DepsGraphResult {\n  root_id: string;\n  nodes: DepsGraphNode[];\n  edges: DepsGraphEdge[];\n  missing_ids: string[];\n}\n\nexport interface DepsResult {\n  id: string;\n  format: DepsFormat;\n  node_count: number;\n  edge_count: number;\n  missing_count: number;\n  tree?: DepsTreeNode;\n  graph?: DepsGraphResult;\n}\n\nfunction parseFormat(raw: string | undefined): DepsFormat {\n  const candidate = raw?.trim().toLowerCase() ?? \"tree\";\n  if ((DEPS_FORMAT_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsFormat;\n  }\n  throw new PmCliError(`Invalid --format value \"${raw}\". Use \"tree\" or \"graph\".`, EXIT_CODE.USAGE);\n}\n\nfunction parseMaxDepth(raw: string | number | undefined): number | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = typeof raw === \"number\" ? raw : Number(raw.trim());\n  if (!Number.isInteger(normalized) || normalized < 0) {\n    throw new PmCliError(`Invalid --max-depth value \"${raw}\". Use a non-negative integer.`, EXIT_CODE.USAGE);\n  }\n  return normalized;\n}\n\nfunction parseCollapse(raw: string | undefined): DepsCollapseMode {\n  const candidate = raw?.trim().toLowerCase() ?? \"none\";\n  if ((DEPS_COLLAPSE_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsCollapseMode;\n  }\n  throw new PmCliError(`Invalid --collapse value \"${raw}\". Use \"none\" or \"repeated\".`, EXIT_CODE.USAGE);\n}\n\nfunction normalizeDependencies(dependencies: Dependency[] | undefined): Dependency[] {\n  if (!dependencies || dependencies.length === 0) {\n    return [];\n  }\n  const sorted = [...dependencies].sort((left, right) => {\n    const byKind = left.kind.localeCompare(right.kind);\n    if (byKind !== 0) return byKind;\n    const byId = left.id.localeCompare(right.id);\n    if (byId !== 0) return byId;\n    return left.created_at.localeCompare(right.created_at);\n  });\n  const deduped = new Map<string, Dependency>();\n  for (const dependency of sorted) {\n    const key = `${dependency.kind}::${dependency.id}`;\n    if (!deduped.has(key)) {\n      deduped.set(key, dependency);\n    }\n  }\n  return [...deduped.values()];\n}\n\nfunction toIndexedItem(item: ItemFrontMatter): IndexedItem {\n  return {\n    id: item.id,\n    title: item.title,\n    type: item.type,\n    status: item.status,\n    dependencies: normalizeDependencies(item.dependencies),\n  };\n}\n\nfunction toTreeNode(\n  id: string,\n  index: Map<string, IndexedItem>,\n  lineage: Set<string>,\n  maxDepth: number | undefined,\n  collapse: DepsCollapseMode,\n  expanded: Set<string>,\n  depth = 0,\n  via?: string,\n): DepsTreeNode {\n  const item = index.get(id);\n  const baseNode: DepsTreeNode = {\n    id,\n    title: item?.title,\n    type: item?.type,\n    status: item?.status,\n    via,\n    missing: !item,\n    cycle: lineage.has(id),\n    dependencies: [],\n  };\n  if (!item || baseNode.cycle) {\n    return baseNode;\n  }\n  if (maxDepth !== undefined && depth >= maxDepth) {\n    if (item.dependencies.length > 0) {\n      baseNode.truncated = true;\n    }\n    return baseNode;\n  }\n  if (collapse === \"repeated\" && expanded.has(id)) {\n    baseNode.collapsed = true;\n    return baseNode;\n  }\n  if (collapse === \"repeated\") {\n    expanded.add(id);\n  }\n  const nextLineage = new Set(lineage);\n  nextLineage.add(id);\n  baseNode.dependencies = item.dependencies.map((dependency) =>\n    toTreeNode(dependency.id, index, nextLineage, maxDepth, collapse, expanded, depth + 1, dependency.kind),\n  );\n  return baseNode;\n}\n\nfunction mergeGraphNode(existing: DepsGraphNode | undefined, candidate: DepsGraphNode): DepsGraphNode {\n  if (!existing) {\n    return candidate;\n  }\n  if (existing.missing && !candidate.missing) {\n    return candidate;\n  }\n  return {\n    ...existing,\n    title: existing.title ?? candidate.title,\n    type: existing.type ?? candidate.type,\n    status: existing.status ?? candidate.status,\n  };\n}\n\nfunction toGraph(root: DepsTreeNode): DepsGraphResult {\n  const nodesById = new Map<string, DepsGraphNode>();\n  const edgesByKey = new Map<string, DepsGraphEdge>();\n\n  const visit = (node: DepsTreeNode): void => {\n    nodesById.set(\n      node.id,\n      mergeGraphNode(nodesById.get(node.id), {\n        id: node.id,\n        title: node.title,\n        type: node.type,\n        status: node.status,\n        missing: node.missing,\n      }),\n    );\n    for (const child of node.dependencies) {\n      nodesById.set(\n        child.id,\n        mergeGraphNode(nodesById.get(child.id), {\n          id: child.id,\n          title: child.title,\n          type: child.type,\n          status: child.status,\n          missing: child.missing,\n        }),\n      );\n      const relationKind = child.via ?? \"related\";\n      const edgeKey = `${node.id}::${child.id}::${relationKind}`;\n      if (!edgesByKey.has(edgeKey)) {\n        edgesByKey.set(edgeKey, {\n          from: node.id,\n          to: child.id,\n          kind: relationKind,\n        });\n      }\n      if (!child.cycle) {\n        visit(child);\n      }\n    }\n  };\n\n  visit(root);\n\n  const nodes = [...nodesById.values()].sort((left, right) => left.id.localeCompare(right.id));\n  const edges = [...edgesByKey.values()].sort((left, right) => {\n    const byFrom = left.from.localeCompare(right.from);\n    if (byFrom !== 0) return byFrom;\n    const byTo = left.to.localeCompare(right.to);\n    if (byTo !== 0) return byTo;\n    return left.kind.localeCompare(right.kind);\n  });\n  const missingIds = nodes.filter((node) => node.missing).map((node) => node.id);\n  return {\n    root_id: root.id,\n    nodes,\n    edges,\n    missing_ids: missingIds,\n  };\n}\n\nexport async function runDeps(id: string, options: DepsCommandOptions, global: GlobalOptions): Promise<DepsResult> {\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 format = parseFormat(options.format);\n  const maxDepth = parseMaxDepth(options.maxDepth);\n  const collapse = parseCollapse(options.collapse);\n  const summaryOnly = options.summary === true;\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());\n  const items = await listAllFrontMatterLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema);\n  const index = new Map(items.map((item) => [item.id, toIndexedItem(item)]));\n  if (!index.has(id)) {\n    throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);\n  }\n\n  const tree = toTreeNode(id, index, new Set<string>(), maxDepth, collapse, new Set<string>());\n  const graph = toGraph(tree);\n  const baseResult = {\n    id,\n    format,\n    node_count: graph.nodes.length,\n    edge_count: graph.edges.length,\n    missing_count: graph.missing_ids.length,\n  };\n  if (summaryOnly) {\n    return baseResult;\n  }\n  if (format === \"tree\") {\n    return {\n      ...baseResult,\n      tree,\n    };\n  }\n  return {\n    ...baseResult,\n    graph,\n  };\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;AAWO,IAAM,qBAAqB,CAAC,QAAQ,OAAO;AAE3C,IAAM,uBAAuB,CAAC,QAAQ,UAAU;AA8DvD,SAAS,YAAY,KAAuB;AAC1C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,mBAAyC,SAAS,SAAS,GAAG;AACjE,WAAO;EACT;AACA,QAAM,IAAI,WAAW,2BAA2B,GAAG,6BAA6B,UAAU,KAAK;AACjG;AAEA,SAAS,cAAc,KAAgC;AACrD,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,OAAO,QAAQ,WAAW,MAAM,OAAO,IAAI,KAAI,CAAE;AACpE,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,GAAG;AACnD,UAAM,IAAI,WAAW,8BAA8B,GAAG,kCAAkC,UAAU,KAAK;EACzG;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAuB;AAC5C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,qBAA2C,SAAS,SAAS,GAAG;AACnE,WAAO;EACT;AACA,QAAM,IAAI,WAAW,6BAA6B,GAAG,gCAAgC,UAAU,KAAK;AACtG;AAEA,SAAS,sBAAsB,cAAsC;AACnE,MAAI,CAAC,gBAAgB,aAAa,WAAW,GAAG;AAC9C,WAAO,CAAA;EACT;AACA,QAAM,SAAS,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,MAAM,UAAS;AACpD,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,KAAK,WAAW,cAAc,MAAM,UAAU;EACvD,CAAC;AACD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,cAAc,QAAQ;AAC/B,UAAM,MAAM,GAAG,WAAW,IAAI,KAAK,WAAW,EAAE;AAChD,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,KAAK,UAAU;IAC7B;EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE;AAC7B;AAEA,SAAS,cAAc,MAAqB;AAC1C,SAAO;IACL,IAAI,KAAK;IACT,OAAO,KAAK;IACZ,MAAM,KAAK;IACX,QAAQ,KAAK;IACb,cAAc,sBAAsB,KAAK,YAAY;;AAEzD;AAEA,SAAS,WACP,IACA,OACA,SACA,UACA,UACA,UACA,QAAQ,GACR,KAAY;AAEZ,QAAM,OAAO,MAAM,IAAI,EAAE;AACzB,QAAM,WAAyB;IAC7B;IACA,OAAO,MAAM;IACb,MAAM,MAAM;IACZ,QAAQ,MAAM;IACd;IACA,SAAS,CAAC;IACV,OAAO,QAAQ,IAAI,EAAE;IACrB,cAAc,CAAA;;AAEhB,MAAI,CAAC,QAAQ,SAAS,OAAO;AAC3B,WAAO;EACT;AACA,MAAI,aAAa,UAAa,SAAS,UAAU;AAC/C,QAAI,KAAK,aAAa,SAAS,GAAG;AAChC,eAAS,YAAY;IACvB;AACA,WAAO;EACT;AACA,MAAI,aAAa,cAAc,SAAS,IAAI,EAAE,GAAG;AAC/C,aAAS,YAAY;AACrB,WAAO;EACT;AACA,MAAI,aAAa,YAAY;AAC3B,aAAS,IAAI,EAAE;EACjB;AACA,QAAM,cAAc,IAAI,IAAI,OAAO;AACnC,cAAY,IAAI,EAAE;AAClB,WAAS,eAAe,KAAK,aAAa,IAAI,CAAC,eAC7C,WAAW,WAAW,IAAI,OAAO,aAAa,UAAU,UAAU,UAAU,QAAQ,GAAG,WAAW,IAAI,CAAC;AAEzG,SAAO;AACT;AAEA,SAAS,eAAe,UAAqC,WAAwB;AACnF,MAAI,CAAC,UAAU;AACb,WAAO;EACT;AACA,MAAI,SAAS,WAAW,CAAC,UAAU,SAAS;AAC1C,WAAO;EACT;AACA,SAAO;IACL,GAAG;IACH,OAAO,SAAS,SAAS,UAAU;IACnC,MAAM,SAAS,QAAQ,UAAU;IACjC,QAAQ,SAAS,UAAU,UAAU;;AAEzC;AAEA,SAAS,QAAQ,MAAkB;AACjC,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,aAAa,oBAAI,IAAG;AAE1B,QAAM,QAAQ,CAAC,SAA4B;AACzC,cAAU,IACR,KAAK,IACL,eAAe,UAAU,IAAI,KAAK,EAAE,GAAG;MACrC,IAAI,KAAK;MACT,OAAO,KAAK;MACZ,MAAM,KAAK;MACX,QAAQ,KAAK;MACb,SAAS,KAAK;KACf,CAAC;AAEJ,eAAW,SAAS,KAAK,cAAc;AACrC,gBAAU,IACR,MAAM,IACN,eAAe,UAAU,IAAI,MAAM,EAAE,GAAG;QACtC,IAAI,MAAM;QACV,OAAO,MAAM;QACb,MAAM,MAAM;QACZ,QAAQ,MAAM;QACd,SAAS,MAAM;OAChB,CAAC;AAEJ,YAAM,eAAe,MAAM,OAAO;AAClC,YAAM,UAAU,GAAG,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,YAAY;AACxD,UAAI,CAAC,WAAW,IAAI,OAAO,GAAG;AAC5B,mBAAW,IAAI,SAAS;UACtB,MAAM,KAAK;UACX,IAAI,MAAM;UACV,MAAM;SACP;MACH;AACA,UAAI,CAAC,MAAM,OAAO;AAChB,cAAM,KAAK;MACb;IACF;EACF;AAEA,QAAM,IAAI;AAEV,QAAM,QAAQ,CAAC,GAAG,UAAU,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAC3F,QAAM,QAAQ,CAAC,GAAG,WAAW,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAS;AAC1D,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,KAAK,KAAK,cAAc,MAAM,IAAI;EAC3C,CAAC;AACD,QAAM,aAAa,MAAM,OAAO,CAAC,SAAS,KAAK,OAAO,EAAE,IAAI,CAAC,SAAS,KAAK,EAAE;AAC7E,SAAO;IACL,SAAS,KAAK;IACd;IACA;IACA,aAAa;;AAEjB;AAEA,eAAsB,QAAQ,IAAY,SAA6BA,SAAqB;AAC1F,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,SAAS,YAAY,QAAQ,MAAM;AACzC,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,cAAc,QAAQ,YAAY;AACxC,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBAAwB,UAAU,gCAA+B,CAAE;AACxF,QAAM,QAAQ,MAAM,wBAAwB,QAAQ,SAAS,aAAa,aAAa,gBAAgB,QAAW,SAAS,MAAM;AACjI,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,cAAc,IAAI,CAAC,CAAC,CAAC;AACzE,MAAI,CAAC,MAAM,IAAI,EAAE,GAAG;AAClB,UAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;EAClE;AAEA,QAAM,OAAO,WAAW,IAAI,OAAO,oBAAI,IAAG,GAAY,UAAU,UAAU,oBAAI,IAAG,CAAU;AAC3F,QAAM,QAAQ,QAAQ,IAAI;AAC1B,QAAM,aAAa;IACjB;IACA;IACA,YAAY,MAAM,MAAM;IACxB,YAAY,MAAM,MAAM;IACxB,eAAe,MAAM,YAAY;;AAEnC,MAAI,aAAa;AACf,WAAO;EACT;AACA,MAAI,WAAW,QAAQ;AACrB,WAAO;MACL,GAAG;MACH;;EAEJ;AACA,SAAO;IACL,GAAG;IACH;;AAEJ;",
+  "sourcesContent": ["import { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.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 { listAllFrontMatterLight } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { Dependency, ItemFrontMatter, ItemStatus, ItemType } from \"../../types/index.js\";\n\nexport const DEPS_FORMAT_VALUES = [\"tree\", \"graph\"] as const;\nexport type DepsFormat = (typeof DEPS_FORMAT_VALUES)[number];\nexport const DEPS_COLLAPSE_VALUES = [\"none\", \"repeated\"] as const;\nexport type DepsCollapseMode = (typeof DEPS_COLLAPSE_VALUES)[number];\n\nexport interface DepsCommandOptions {\n  format?: string;\n  maxDepth?: string | number;\n  collapse?: string;\n  summary?: boolean;\n}\n\ninterface IndexedItem {\n  id: string;\n  title: string;\n  type: ItemType;\n  status: ItemStatus;\n  dependencies: Dependency[];\n}\n\nexport interface DepsTreeNode {\n  id: string;\n  title?: string;\n  type?: ItemType;\n  status?: ItemStatus;\n  via?: string;\n  missing: boolean;\n  cycle: boolean;\n  truncated?: boolean;\n  collapsed?: boolean;\n  dependencies: DepsTreeNode[];\n}\n\nexport interface DepsGraphNode {\n  id: string;\n  title?: string;\n  type?: ItemType;\n  status?: ItemStatus;\n  missing: boolean;\n}\n\nexport interface DepsGraphEdge {\n  from: string;\n  to: string;\n  kind: string;\n}\n\nexport interface DepsGraphResult {\n  root_id: string;\n  nodes: DepsGraphNode[];\n  edges: DepsGraphEdge[];\n  missing_ids: string[];\n}\n\nexport interface DepsResult {\n  id: string;\n  format: DepsFormat;\n  node_count: number;\n  edge_count: number;\n  missing_count: number;\n  tree?: DepsTreeNode;\n  graph?: DepsGraphResult;\n}\n\nfunction parseFormat(raw: string | undefined): DepsFormat {\n  const candidate = raw?.trim().toLowerCase() ?? \"tree\";\n  if ((DEPS_FORMAT_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsFormat;\n  }\n  throw new PmCliError(`Invalid --format value \"${raw}\". Use \"tree\" or \"graph\".`, EXIT_CODE.USAGE);\n}\n\nfunction parseMaxDepth(raw: string | number | undefined): number | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = typeof raw === \"number\" ? raw : Number(raw.trim());\n  if (!Number.isInteger(normalized) || normalized < 0) {\n    throw new PmCliError(`Invalid --max-depth value \"${raw}\". Use a non-negative integer.`, EXIT_CODE.USAGE);\n  }\n  return normalized;\n}\n\nfunction parseCollapse(raw: string | undefined): DepsCollapseMode {\n  const candidate = raw?.trim().toLowerCase() ?? \"none\";\n  if ((DEPS_COLLAPSE_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsCollapseMode;\n  }\n  throw new PmCliError(`Invalid --collapse value \"${raw}\". Use \"none\" or \"repeated\".`, EXIT_CODE.USAGE);\n}\n\nfunction normalizeDependencies(dependencies: Dependency[] | undefined): Dependency[] {\n  if (!dependencies || dependencies.length === 0) {\n    return [];\n  }\n  const sorted = [...dependencies].sort((left, right) => {\n    const byKind = left.kind.localeCompare(right.kind);\n    if (byKind !== 0) return byKind;\n    const byId = left.id.localeCompare(right.id);\n    if (byId !== 0) return byId;\n    return left.created_at.localeCompare(right.created_at);\n  });\n  const deduped = new Map<string, Dependency>();\n  for (const dependency of sorted) {\n    const key = `${dependency.kind}::${dependency.id}`;\n    if (!deduped.has(key)) {\n      deduped.set(key, dependency);\n    }\n  }\n  return [...deduped.values()];\n}\n\nfunction toIndexedItem(item: ItemFrontMatter): IndexedItem {\n  return {\n    id: item.id,\n    title: item.title,\n    type: item.type,\n    status: item.status,\n    dependencies: normalizeDependencies(item.dependencies),\n  };\n}\n\nfunction toTreeNode(\n  id: string,\n  index: Map<string, IndexedItem>,\n  lineage: Set<string>,\n  maxDepth: number | undefined,\n  collapse: DepsCollapseMode,\n  expanded: Set<string>,\n  depth = 0,\n  via?: string,\n): DepsTreeNode {\n  const item = index.get(id);\n  const baseNode: DepsTreeNode = {\n    id,\n    title: item?.title,\n    type: item?.type,\n    status: item?.status,\n    via,\n    missing: !item,\n    cycle: lineage.has(id),\n    dependencies: [],\n  };\n  if (!item || baseNode.cycle) {\n    return baseNode;\n  }\n  if (maxDepth !== undefined && depth >= maxDepth) {\n    if (item.dependencies.length > 0) {\n      baseNode.truncated = true;\n    }\n    return baseNode;\n  }\n  if (collapse === \"repeated\" && expanded.has(id)) {\n    baseNode.collapsed = true;\n    return baseNode;\n  }\n  if (collapse === \"repeated\") {\n    expanded.add(id);\n  }\n  const nextLineage = new Set(lineage);\n  nextLineage.add(id);\n  baseNode.dependencies = item.dependencies.map((dependency) =>\n    toTreeNode(dependency.id, index, nextLineage, maxDepth, collapse, expanded, depth + 1, dependency.kind),\n  );\n  return baseNode;\n}\n\nfunction mergeGraphNode(existing: DepsGraphNode | undefined, candidate: DepsGraphNode): DepsGraphNode {\n  if (!existing) {\n    return candidate;\n  }\n  /* c8 ignore start -- defensive: mixed missing/non-missing duplicates only occur in malformed synthetic trees. */\n  if (existing.missing && !candidate.missing) return candidate;\n  /* c8 ignore stop */\n  return {\n    ...existing,\n    title: existing.title ?? candidate.title,\n    type: existing.type ?? candidate.type,\n    status: existing.status ?? candidate.status,\n  };\n}\n\nfunction toGraph(root: DepsTreeNode): DepsGraphResult {\n  const nodesById = new Map<string, DepsGraphNode>();\n  const edgesByKey = new Map<string, DepsGraphEdge>();\n\n  const visit = (node: DepsTreeNode): void => {\n    nodesById.set(\n      node.id,\n      mergeGraphNode(nodesById.get(node.id), {\n        id: node.id,\n        title: node.title,\n        type: node.type,\n        status: node.status,\n        missing: node.missing,\n      }),\n    );\n    for (const child of node.dependencies) {\n      nodesById.set(\n        child.id,\n        mergeGraphNode(nodesById.get(child.id), {\n          id: child.id,\n          title: child.title,\n          type: child.type,\n          status: child.status,\n          missing: child.missing,\n        }),\n      );\n      /* c8 ignore start -- legacy malformed dependency payloads may omit kind/via. */\n      const relationKind = child.via ?? \"related\";\n      const edgeKey = `${node.id}::${child.id}::${relationKind}`;\n      if (!edgesByKey.has(edgeKey)) {\n        edgesByKey.set(edgeKey, {\n          from: node.id,\n          to: child.id,\n          kind: relationKind,\n        });\n      }\n      /* c8 ignore stop */\n      if (!child.cycle) {\n        visit(child);\n      }\n    }\n  };\n\n  visit(root);\n\n  const nodes = [...nodesById.values()].sort((left, right) => left.id.localeCompare(right.id));\n  const edges = [...edgesByKey.values()].sort((left, right) => {\n    const byFrom = left.from.localeCompare(right.from);\n    if (byFrom !== 0) return byFrom;\n    const byTo = left.to.localeCompare(right.to);\n    if (byTo !== 0) return byTo;\n    return left.kind.localeCompare(right.kind);\n  });\n  const missingIds = nodes.filter((node) => node.missing).map((node) => node.id);\n  return {\n    root_id: root.id,\n    nodes,\n    edges,\n    missing_ids: missingIds,\n  };\n}\n\nexport async function runDeps(id: string, options: DepsCommandOptions, global: GlobalOptions): Promise<DepsResult> {\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 format = parseFormat(options.format);\n  const maxDepth = parseMaxDepth(options.maxDepth);\n  const collapse = parseCollapse(options.collapse);\n  const summaryOnly = options.summary === true;\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());\n  const items = await listAllFrontMatterLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema);\n  const index = new Map(items.map((item) => [item.id, toIndexedItem(item)]));\n  if (!index.has(id)) {\n    throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);\n  }\n\n  const tree = toTreeNode(id, index, new Set<string>(), maxDepth, collapse, new Set<string>());\n  const graph = toGraph(tree);\n  const baseResult = {\n    id,\n    format,\n    node_count: graph.nodes.length,\n    edge_count: graph.edges.length,\n    missing_count: graph.missing_ids.length,\n  };\n  if (summaryOnly) {\n    return baseResult;\n  }\n  if (format === \"tree\") {\n    return {\n      ...baseResult,\n      tree,\n    };\n  }\n  return {\n    ...baseResult,\n    graph,\n  };\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;AAWO,IAAM,qBAAqB,CAAC,QAAQ,OAAO;AAE3C,IAAM,uBAAuB,CAAC,QAAQ,UAAU;AA8DvD,SAAS,YAAY,KAAuB;AAC1C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,mBAAyC,SAAS,SAAS,GAAG;AACjE,WAAO;EACT;AACA,QAAM,IAAI,WAAW,2BAA2B,GAAG,6BAA6B,UAAU,KAAK;AACjG;AAEA,SAAS,cAAc,KAAgC;AACrD,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,OAAO,QAAQ,WAAW,MAAM,OAAO,IAAI,KAAI,CAAE;AACpE,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,GAAG;AACnD,UAAM,IAAI,WAAW,8BAA8B,GAAG,kCAAkC,UAAU,KAAK;EACzG;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAuB;AAC5C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,qBAA2C,SAAS,SAAS,GAAG;AACnE,WAAO;EACT;AACA,QAAM,IAAI,WAAW,6BAA6B,GAAG,gCAAgC,UAAU,KAAK;AACtG;AAEA,SAAS,sBAAsB,cAAsC;AACnE,MAAI,CAAC,gBAAgB,aAAa,WAAW,GAAG;AAC9C,WAAO,CAAA;EACT;AACA,QAAM,SAAS,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,MAAM,UAAS;AACpD,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,KAAK,WAAW,cAAc,MAAM,UAAU;EACvD,CAAC;AACD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,cAAc,QAAQ;AAC/B,UAAM,MAAM,GAAG,WAAW,IAAI,KAAK,WAAW,EAAE;AAChD,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,KAAK,UAAU;IAC7B;EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE;AAC7B;AAEA,SAAS,cAAc,MAAqB;AAC1C,SAAO;IACL,IAAI,KAAK;IACT,OAAO,KAAK;IACZ,MAAM,KAAK;IACX,QAAQ,KAAK;IACb,cAAc,sBAAsB,KAAK,YAAY;;AAEzD;AAEA,SAAS,WACP,IACA,OACA,SACA,UACA,UACA,UACA,QAAQ,GACR,KAAY;AAEZ,QAAM,OAAO,MAAM,IAAI,EAAE;AACzB,QAAM,WAAyB;IAC7B;IACA,OAAO,MAAM;IACb,MAAM,MAAM;IACZ,QAAQ,MAAM;IACd;IACA,SAAS,CAAC;IACV,OAAO,QAAQ,IAAI,EAAE;IACrB,cAAc,CAAA;;AAEhB,MAAI,CAAC,QAAQ,SAAS,OAAO;AAC3B,WAAO;EACT;AACA,MAAI,aAAa,UAAa,SAAS,UAAU;AAC/C,QAAI,KAAK,aAAa,SAAS,GAAG;AAChC,eAAS,YAAY;IACvB;AACA,WAAO;EACT;AACA,MAAI,aAAa,cAAc,SAAS,IAAI,EAAE,GAAG;AAC/C,aAAS,YAAY;AACrB,WAAO;EACT;AACA,MAAI,aAAa,YAAY;AAC3B,aAAS,IAAI,EAAE;EACjB;AACA,QAAM,cAAc,IAAI,IAAI,OAAO;AACnC,cAAY,IAAI,EAAE;AAClB,WAAS,eAAe,KAAK,aAAa,IAAI,CAAC,eAC7C,WAAW,WAAW,IAAI,OAAO,aAAa,UAAU,UAAU,UAAU,QAAQ,GAAG,WAAW,IAAI,CAAC;AAEzG,SAAO;AACT;AAEA,SAAS,eAAe,UAAqC,WAAwB;AACnF,MAAI,CAAC,UAAU;AACb,WAAO;EACT;AAEA,MAAI,SAAS,WAAW,CAAC,UAAU;AAAS,WAAO;AAEnD,SAAO;IACL,GAAG;IACH,OAAO,SAAS,SAAS,UAAU;IACnC,MAAM,SAAS,QAAQ,UAAU;IACjC,QAAQ,SAAS,UAAU,UAAU;;AAEzC;AAEA,SAAS,QAAQ,MAAkB;AACjC,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,aAAa,oBAAI,IAAG;AAE1B,QAAM,QAAQ,CAAC,SAA4B;AACzC,cAAU,IACR,KAAK,IACL,eAAe,UAAU,IAAI,KAAK,EAAE,GAAG;MACrC,IAAI,KAAK;MACT,OAAO,KAAK;MACZ,MAAM,KAAK;MACX,QAAQ,KAAK;MACb,SAAS,KAAK;KACf,CAAC;AAEJ,eAAW,SAAS,KAAK,cAAc;AACrC,gBAAU,IACR,MAAM,IACN,eAAe,UAAU,IAAI,MAAM,EAAE,GAAG;QACtC,IAAI,MAAM;QACV,OAAO,MAAM;QACb,MAAM,MAAM;QACZ,QAAQ,MAAM;QACd,SAAS,MAAM;OAChB,CAAC;AAGJ,YAAM,eAAe,MAAM,OAAO;AAClC,YAAM,UAAU,GAAG,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,YAAY;AACxD,UAAI,CAAC,WAAW,IAAI,OAAO,GAAG;AAC5B,mBAAW,IAAI,SAAS;UACtB,MAAM,KAAK;UACX,IAAI,MAAM;UACV,MAAM;SACP;MACH;AAEA,UAAI,CAAC,MAAM,OAAO;AAChB,cAAM,KAAK;MACb;IACF;EACF;AAEA,QAAM,IAAI;AAEV,QAAM,QAAQ,CAAC,GAAG,UAAU,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAC3F,QAAM,QAAQ,CAAC,GAAG,WAAW,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAS;AAC1D,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,KAAK,KAAK,cAAc,MAAM,IAAI;EAC3C,CAAC;AACD,QAAM,aAAa,MAAM,OAAO,CAAC,SAAS,KAAK,OAAO,EAAE,IAAI,CAAC,SAAS,KAAK,EAAE;AAC7E,SAAO;IACL,SAAS,KAAK;IACd;IACA;IACA,aAAa;;AAEjB;AAEA,eAAsB,QAAQ,IAAY,SAA6BA,SAAqB;AAC1F,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,SAAS,YAAY,QAAQ,MAAM;AACzC,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,cAAc,QAAQ,YAAY;AACxC,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBAAwB,UAAU,gCAA+B,CAAE;AACxF,QAAM,QAAQ,MAAM,wBAAwB,QAAQ,SAAS,aAAa,aAAa,gBAAgB,QAAW,SAAS,MAAM;AACjI,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,cAAc,IAAI,CAAC,CAAC,CAAC;AACzE,MAAI,CAAC,MAAM,IAAI,EAAE,GAAG;AAClB,UAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;EAClE;AAEA,QAAM,OAAO,WAAW,IAAI,OAAO,oBAAI,IAAG,GAAY,UAAU,UAAU,oBAAI,IAAG,CAAU;AAC3F,QAAM,QAAQ,QAAQ,IAAI;AAC1B,QAAM,aAAa;IACjB;IACA;IACA,YAAY,MAAM,MAAM;IACxB,YAAY,MAAM,MAAM;IACxB,eAAe,MAAM,YAAY;;AAEnC,MAAI,aAAa;AACf,WAAO;EACT;AACA,MAAI,WAAW,QAAQ;AACrB,WAAO;MACL,GAAG;MACH;;EAEJ;AACA,SAAO;IACL,GAAG;IACH;;AAEJ;",
   "names": ["global"]
 }

package/dist/cli-bundle/chunks/{deps-HV2C2L46.js → deps-MCCU633S.js}

@@ -1,14 +1,14 @@
 
-!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]="6da7beb3-25f2-5c8f-9186-6c5066ef02c8")}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]="c9eccde5-edc7-5606-b2de-2de878b498da")}catch(e){}}();
 import {
   listAllFrontMatterLight
-} from "./chunk-L6YQONLM.js";
-import "./chunk-6ZFTM65G.js";
-import "./chunk-QQG4HEX7.js";
+} from "./chunk-FPDK5BZQ.js";
+import "./chunk-F5MSD5HE.js";
+import "./chunk-IROHIK2T.js";
 import {
   resolveItemTypeRegistry
-} from "./chunk-32XSW44C.js";
-import "./chunk-IZHCCG4S.js";
+} from "./chunk-V2GYOMEX.js";
+import "./chunk-VXRFAE7W.js";
 import {
   EXIT_CODE,
   PmCliError,
@@ -17,7 +17,7 @@ import {
   pathExists,
   readSettings,
   resolvePmRoot
-} from "./chunk-S2CDTRJ6.js";
+} from "./chunk-SJCMTOEU.js";
 
 // dist/cli/commands/deps.js
 var DEPS_FORMAT_VALUES = ["tree", "graph"];
@@ -114,9 +114,8 @@ function mergeGraphNode(existing, candidate) {
   if (!existing) {
     return candidate;
   }
-  if (existing.missing && !candidate.missing) {
+  if (existing.missing && !candidate.missing)
     return candidate;
-  }
   return {
     ...existing,
     title: existing.title ?? candidate.title,
@@ -220,6 +219,6 @@ export {
   DEPS_FORMAT_VALUES,
   runDeps
 };
-//# sourceMappingURL=deps-HV2C2L46.js.map
+//# sourceMappingURL=deps-MCCU633S.js.map
 
-//# debugId=6da7beb3-25f2-5c8f-9186-6c5066ef02c8
+//# debugId=c9eccde5-edc7-5606-b2de-2de878b498da

package/dist/cli-bundle/chunks/deps-MCCU633S.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../cli/commands/deps.ts"],"sourcesContent":["import { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.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 { listAllFrontMatterLight } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport type { Dependency, ItemFrontMatter, ItemStatus, ItemType } from \"../../types/index.js\";\n\nexport const DEPS_FORMAT_VALUES = [\"tree\", \"graph\"] as const;\nexport type DepsFormat = (typeof DEPS_FORMAT_VALUES)[number];\nexport const DEPS_COLLAPSE_VALUES = [\"none\", \"repeated\"] as const;\nexport type DepsCollapseMode = (typeof DEPS_COLLAPSE_VALUES)[number];\n\nexport interface DepsCommandOptions {\n  format?: string;\n  maxDepth?: string | number;\n  collapse?: string;\n  summary?: boolean;\n}\n\ninterface IndexedItem {\n  id: string;\n  title: string;\n  type: ItemType;\n  status: ItemStatus;\n  dependencies: Dependency[];\n}\n\nexport interface DepsTreeNode {\n  id: string;\n  title?: string;\n  type?: ItemType;\n  status?: ItemStatus;\n  via?: string;\n  missing: boolean;\n  cycle: boolean;\n  truncated?: boolean;\n  collapsed?: boolean;\n  dependencies: DepsTreeNode[];\n}\n\nexport interface DepsGraphNode {\n  id: string;\n  title?: string;\n  type?: ItemType;\n  status?: ItemStatus;\n  missing: boolean;\n}\n\nexport interface DepsGraphEdge {\n  from: string;\n  to: string;\n  kind: string;\n}\n\nexport interface DepsGraphResult {\n  root_id: string;\n  nodes: DepsGraphNode[];\n  edges: DepsGraphEdge[];\n  missing_ids: string[];\n}\n\nexport interface DepsResult {\n  id: string;\n  format: DepsFormat;\n  node_count: number;\n  edge_count: number;\n  missing_count: number;\n  tree?: DepsTreeNode;\n  graph?: DepsGraphResult;\n}\n\nfunction parseFormat(raw: string | undefined): DepsFormat {\n  const candidate = raw?.trim().toLowerCase() ?? \"tree\";\n  if ((DEPS_FORMAT_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsFormat;\n  }\n  throw new PmCliError(`Invalid --format value \"${raw}\". Use \"tree\" or \"graph\".`, EXIT_CODE.USAGE);\n}\n\nfunction parseMaxDepth(raw: string | number | undefined): number | undefined {\n  if (raw === undefined) {\n    return undefined;\n  }\n  const normalized = typeof raw === \"number\" ? raw : Number(raw.trim());\n  if (!Number.isInteger(normalized) || normalized < 0) {\n    throw new PmCliError(`Invalid --max-depth value \"${raw}\". Use a non-negative integer.`, EXIT_CODE.USAGE);\n  }\n  return normalized;\n}\n\nfunction parseCollapse(raw: string | undefined): DepsCollapseMode {\n  const candidate = raw?.trim().toLowerCase() ?? \"none\";\n  if ((DEPS_COLLAPSE_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsCollapseMode;\n  }\n  throw new PmCliError(`Invalid --collapse value \"${raw}\". Use \"none\" or \"repeated\".`, EXIT_CODE.USAGE);\n}\n\nfunction normalizeDependencies(dependencies: Dependency[] | undefined): Dependency[] {\n  if (!dependencies || dependencies.length === 0) {\n    return [];\n  }\n  const sorted = [...dependencies].sort((left, right) => {\n    const byKind = left.kind.localeCompare(right.kind);\n    if (byKind !== 0) return byKind;\n    const byId = left.id.localeCompare(right.id);\n    if (byId !== 0) return byId;\n    return left.created_at.localeCompare(right.created_at);\n  });\n  const deduped = new Map<string, Dependency>();\n  for (const dependency of sorted) {\n    const key = `${dependency.kind}::${dependency.id}`;\n    if (!deduped.has(key)) {\n      deduped.set(key, dependency);\n    }\n  }\n  return [...deduped.values()];\n}\n\nfunction toIndexedItem(item: ItemFrontMatter): IndexedItem {\n  return {\n    id: item.id,\n    title: item.title,\n    type: item.type,\n    status: item.status,\n    dependencies: normalizeDependencies(item.dependencies),\n  };\n}\n\nfunction toTreeNode(\n  id: string,\n  index: Map<string, IndexedItem>,\n  lineage: Set<string>,\n  maxDepth: number | undefined,\n  collapse: DepsCollapseMode,\n  expanded: Set<string>,\n  depth = 0,\n  via?: string,\n): DepsTreeNode {\n  const item = index.get(id);\n  const baseNode: DepsTreeNode = {\n    id,\n    title: item?.title,\n    type: item?.type,\n    status: item?.status,\n    via,\n    missing: !item,\n    cycle: lineage.has(id),\n    dependencies: [],\n  };\n  if (!item || baseNode.cycle) {\n    return baseNode;\n  }\n  if (maxDepth !== undefined && depth >= maxDepth) {\n    if (item.dependencies.length > 0) {\n      baseNode.truncated = true;\n    }\n    return baseNode;\n  }\n  if (collapse === \"repeated\" && expanded.has(id)) {\n    baseNode.collapsed = true;\n    return baseNode;\n  }\n  if (collapse === \"repeated\") {\n    expanded.add(id);\n  }\n  const nextLineage = new Set(lineage);\n  nextLineage.add(id);\n  baseNode.dependencies = item.dependencies.map((dependency) =>\n    toTreeNode(dependency.id, index, nextLineage, maxDepth, collapse, expanded, depth + 1, dependency.kind),\n  );\n  return baseNode;\n}\n\nfunction mergeGraphNode(existing: DepsGraphNode | undefined, candidate: DepsGraphNode): DepsGraphNode {\n  if (!existing) {\n    return candidate;\n  }\n  /* c8 ignore start -- defensive: mixed missing/non-missing duplicates only occur in malformed synthetic trees. */\n  if (existing.missing && !candidate.missing) return candidate;\n  /* c8 ignore stop */\n  return {\n    ...existing,\n    title: existing.title ?? candidate.title,\n    type: existing.type ?? candidate.type,\n    status: existing.status ?? candidate.status,\n  };\n}\n\nfunction toGraph(root: DepsTreeNode): DepsGraphResult {\n  const nodesById = new Map<string, DepsGraphNode>();\n  const edgesByKey = new Map<string, DepsGraphEdge>();\n\n  const visit = (node: DepsTreeNode): void => {\n    nodesById.set(\n      node.id,\n      mergeGraphNode(nodesById.get(node.id), {\n        id: node.id,\n        title: node.title,\n        type: node.type,\n        status: node.status,\n        missing: node.missing,\n      }),\n    );\n    for (const child of node.dependencies) {\n      nodesById.set(\n        child.id,\n        mergeGraphNode(nodesById.get(child.id), {\n          id: child.id,\n          title: child.title,\n          type: child.type,\n          status: child.status,\n          missing: child.missing,\n        }),\n      );\n      /* c8 ignore start -- legacy malformed dependency payloads may omit kind/via. */\n      const relationKind = child.via ?? \"related\";\n      const edgeKey = `${node.id}::${child.id}::${relationKind}`;\n      if (!edgesByKey.has(edgeKey)) {\n        edgesByKey.set(edgeKey, {\n          from: node.id,\n          to: child.id,\n          kind: relationKind,\n        });\n      }\n      /* c8 ignore stop */\n      if (!child.cycle) {\n        visit(child);\n      }\n    }\n  };\n\n  visit(root);\n\n  const nodes = [...nodesById.values()].sort((left, right) => left.id.localeCompare(right.id));\n  const edges = [...edgesByKey.values()].sort((left, right) => {\n    const byFrom = left.from.localeCompare(right.from);\n    if (byFrom !== 0) return byFrom;\n    const byTo = left.to.localeCompare(right.to);\n    if (byTo !== 0) return byTo;\n    return left.kind.localeCompare(right.kind);\n  });\n  const missingIds = nodes.filter((node) => node.missing).map((node) => node.id);\n  return {\n    root_id: root.id,\n    nodes,\n    edges,\n    missing_ids: missingIds,\n  };\n}\n\nexport async function runDeps(id: string, options: DepsCommandOptions, global: GlobalOptions): Promise<DepsResult> {\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 format = parseFormat(options.format);\n  const maxDepth = parseMaxDepth(options.maxDepth);\n  const collapse = parseCollapse(options.collapse);\n  const summaryOnly = options.summary === true;\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());\n  const items = await listAllFrontMatterLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema);\n  const index = new Map(items.map((item) => [item.id, toIndexedItem(item)]));\n  if (!index.has(id)) {\n    throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);\n  }\n\n  const tree = toTreeNode(id, index, new Set<string>(), maxDepth, collapse, new Set<string>());\n  const graph = toGraph(tree);\n  const baseResult = {\n    id,\n    format,\n    node_count: graph.nodes.length,\n    edge_count: graph.edges.length,\n    missing_count: graph.missing_ids.length,\n  };\n  if (summaryOnly) {\n    return baseResult;\n  }\n  if (format === \"tree\") {\n    return {\n      ...baseResult,\n      tree,\n    };\n  }\n  return {\n    ...baseResult,\n    graph,\n  };\n}\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAWO,IAAM,qBAAqB,CAAC,QAAQ,OAAO;AAE3C,IAAM,uBAAuB,CAAC,QAAQ,UAAU;AA8DvD,SAAS,YAAY,KAAuB;AAC1C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,mBAAyC,SAAS,SAAS,GAAG;AACjE,WAAO;EACT;AACA,QAAM,IAAI,WAAW,2BAA2B,GAAG,6BAA6B,UAAU,KAAK;AACjG;AAEA,SAAS,cAAc,KAAgC;AACrD,MAAI,QAAQ,QAAW;AACrB,WAAO;EACT;AACA,QAAM,aAAa,OAAO,QAAQ,WAAW,MAAM,OAAO,IAAI,KAAI,CAAE;AACpE,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,GAAG;AACnD,UAAM,IAAI,WAAW,8BAA8B,GAAG,kCAAkC,UAAU,KAAK;EACzG;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAuB;AAC5C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,qBAA2C,SAAS,SAAS,GAAG;AACnE,WAAO;EACT;AACA,QAAM,IAAI,WAAW,6BAA6B,GAAG,gCAAgC,UAAU,KAAK;AACtG;AAEA,SAAS,sBAAsB,cAAsC;AACnE,MAAI,CAAC,gBAAgB,aAAa,WAAW,GAAG;AAC9C,WAAO,CAAA;EACT;AACA,QAAM,SAAS,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,MAAM,UAAS;AACpD,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,KAAK,WAAW,cAAc,MAAM,UAAU;EACvD,CAAC;AACD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,cAAc,QAAQ;AAC/B,UAAM,MAAM,GAAG,WAAW,IAAI,KAAK,WAAW,EAAE;AAChD,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,KAAK,UAAU;IAC7B;EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE;AAC7B;AAEA,SAAS,cAAc,MAAqB;AAC1C,SAAO;IACL,IAAI,KAAK;IACT,OAAO,KAAK;IACZ,MAAM,KAAK;IACX,QAAQ,KAAK;IACb,cAAc,sBAAsB,KAAK,YAAY;;AAEzD;AAEA,SAAS,WACP,IACA,OACA,SACA,UACA,UACA,UACA,QAAQ,GACR,KAAY;AAEZ,QAAM,OAAO,MAAM,IAAI,EAAE;AACzB,QAAM,WAAyB;IAC7B;IACA,OAAO,MAAM;IACb,MAAM,MAAM;IACZ,QAAQ,MAAM;IACd;IACA,SAAS,CAAC;IACV,OAAO,QAAQ,IAAI,EAAE;IACrB,cAAc,CAAA;;AAEhB,MAAI,CAAC,QAAQ,SAAS,OAAO;AAC3B,WAAO;EACT;AACA,MAAI,aAAa,UAAa,SAAS,UAAU;AAC/C,QAAI,KAAK,aAAa,SAAS,GAAG;AAChC,eAAS,YAAY;IACvB;AACA,WAAO;EACT;AACA,MAAI,aAAa,cAAc,SAAS,IAAI,EAAE,GAAG;AAC/C,aAAS,YAAY;AACrB,WAAO;EACT;AACA,MAAI,aAAa,YAAY;AAC3B,aAAS,IAAI,EAAE;EACjB;AACA,QAAM,cAAc,IAAI,IAAI,OAAO;AACnC,cAAY,IAAI,EAAE;AAClB,WAAS,eAAe,KAAK,aAAa,IAAI,CAAC,eAC7C,WAAW,WAAW,IAAI,OAAO,aAAa,UAAU,UAAU,UAAU,QAAQ,GAAG,WAAW,IAAI,CAAC;AAEzG,SAAO;AACT;AAEA,SAAS,eAAe,UAAqC,WAAwB;AACnF,MAAI,CAAC,UAAU;AACb,WAAO;EACT;AAEA,MAAI,SAAS,WAAW,CAAC,UAAU;AAAS,WAAO;AAEnD,SAAO;IACL,GAAG;IACH,OAAO,SAAS,SAAS,UAAU;IACnC,MAAM,SAAS,QAAQ,UAAU;IACjC,QAAQ,SAAS,UAAU,UAAU;;AAEzC;AAEA,SAAS,QAAQ,MAAkB;AACjC,QAAM,YAAY,oBAAI,IAAG;AACzB,QAAM,aAAa,oBAAI,IAAG;AAE1B,QAAM,QAAQ,CAAC,SAA4B;AACzC,cAAU,IACR,KAAK,IACL,eAAe,UAAU,IAAI,KAAK,EAAE,GAAG;MACrC,IAAI,KAAK;MACT,OAAO,KAAK;MACZ,MAAM,KAAK;MACX,QAAQ,KAAK;MACb,SAAS,KAAK;KACf,CAAC;AAEJ,eAAW,SAAS,KAAK,cAAc;AACrC,gBAAU,IACR,MAAM,IACN,eAAe,UAAU,IAAI,MAAM,EAAE,GAAG;QACtC,IAAI,MAAM;QACV,OAAO,MAAM;QACb,MAAM,MAAM;QACZ,QAAQ,MAAM;QACd,SAAS,MAAM;OAChB,CAAC;AAGJ,YAAM,eAAe,MAAM,OAAO;AAClC,YAAM,UAAU,GAAG,KAAK,EAAE,KAAK,MAAM,EAAE,KAAK,YAAY;AACxD,UAAI,CAAC,WAAW,IAAI,OAAO,GAAG;AAC5B,mBAAW,IAAI,SAAS;UACtB,MAAM,KAAK;UACX,IAAI,MAAM;UACV,MAAM;SACP;MACH;AAEA,UAAI,CAAC,MAAM,OAAO;AAChB,cAAM,KAAK;MACb;IACF;EACF;AAEA,QAAM,IAAI;AAEV,QAAM,QAAQ,CAAC,GAAG,UAAU,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAC3F,QAAM,QAAQ,CAAC,GAAG,WAAW,OAAM,CAAE,EAAE,KAAK,CAAC,MAAM,UAAS;AAC1D,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,UAAM,OAAO,KAAK,GAAG,cAAc,MAAM,EAAE;AAC3C,QAAI,SAAS;AAAG,aAAO;AACvB,WAAO,KAAK,KAAK,cAAc,MAAM,IAAI;EAC3C,CAAC;AACD,QAAM,aAAa,MAAM,OAAO,CAAC,SAAS,KAAK,OAAO,EAAE,IAAI,CAAC,SAAS,KAAK,EAAE;AAC7E,SAAO;IACL,SAAS,KAAK;IACd;IACA;IACA,aAAa;;AAEjB;AAEA,eAAsB,QAAQ,IAAY,SAA6B,QAAqB;AAC1F,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WAAW,iCAAiC,MAAM,wBAAwB,UAAU,SAAS;EACzG;AACA,QAAM,SAAS,YAAY,QAAQ,MAAM;AACzC,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,cAAc,QAAQ,YAAY;AACxC,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBAAwB,UAAU,gCAA+B,CAAE;AACxF,QAAM,QAAQ,MAAM,wBAAwB,QAAQ,SAAS,aAAa,aAAa,gBAAgB,QAAW,SAAS,MAAM;AACjI,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,cAAc,IAAI,CAAC,CAAC,CAAC;AACzE,MAAI,CAAC,MAAM,IAAI,EAAE,GAAG;AAClB,UAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;EAClE;AAEA,QAAM,OAAO,WAAW,IAAI,OAAO,oBAAI,IAAG,GAAY,UAAU,UAAU,oBAAI,IAAG,CAAU;AAC3F,QAAM,QAAQ,QAAQ,IAAI;AAC1B,QAAM,aAAa;IACjB;IACA;IACA,YAAY,MAAM,MAAM;IACxB,YAAY,MAAM,MAAM;IACxB,eAAe,MAAM,YAAY;;AAEnC,MAAI,aAAa;AACf,WAAO;EACT;AACA,MAAI,WAAW,QAAQ;AACrB,WAAO;MACL,GAAG;MACH;;EAEJ;AACA,SAAO;IACL,GAAG;IACH;;AAEJ","debugId":"c9eccde5-edc7-5606-b2de-2de878b498da"}

package/dist/cli-bundle/chunks/{docs-SRTLCQOL.js → docs-HE3HCQ4S.js}

@@ -1,15 +1,15 @@
 import {
   renameArtifactsResultKey,
   runLinkedArtifacts
-} from "./chunk-HLEGAQXT.js";
+} from "./chunk-TWBDDVIF.js";
 import "./chunk-O7IWB35H.js";
-import "./chunk-HZOX5BYD.js";
-import "./chunk-XXLMJDUB.js";
-import "./chunk-LGOXXQUW.js";
-import "./chunk-MACCNKSZ.js";
-import "./chunk-W6KNFAMZ.js";
-import "./chunk-IXVSSHGV.js";
-import "./chunk-LFW5NQUP.js";
+import "./chunk-OGXEBTX3.js";
+import "./chunk-KA22USXD.js";
+import "./chunk-5XGWFUW2.js";
+import "./chunk-TBV33CB4.js";
+import "./chunk-QXMXRPX5.js";
+import "./chunk-LNH5Q32E.js";
+import "./chunk-CHM2VFVL.js";
 
 // dist/cli/commands/docs.js
 !(function() {
@@ -31,4 +31,4 @@ async function runDocs(id, options, global2) {
 export {
   runDocs
 };
-//# sourceMappingURL=docs-SRTLCQOL.js.map
+//# sourceMappingURL=docs-HE3HCQ4S.js.map

package/dist/cli-bundle/chunks/{docs-RJQPLROO.js → docs-SXMOABHR.js}

@@ -3,15 +3,15 @@
 import {
   renameArtifactsResultKey,
   runLinkedArtifacts
-} from "./chunk-RFR2YQGO.js";
+} from "./chunk-MORZOR7W.js";
 import "./chunk-J27KIHTG.js";
-import "./chunk-3VULHQNS.js";
-import "./chunk-L6YQONLM.js";
-import "./chunk-6ZFTM65G.js";
-import "./chunk-QQG4HEX7.js";
-import "./chunk-32XSW44C.js";
-import "./chunk-IZHCCG4S.js";
-import "./chunk-S2CDTRJ6.js";
+import "./chunk-G57RHEGP.js";
+import "./chunk-FPDK5BZQ.js";
+import "./chunk-F5MSD5HE.js";
+import "./chunk-IROHIK2T.js";
+import "./chunk-V2GYOMEX.js";
+import "./chunk-VXRFAE7W.js";
+import "./chunk-SJCMTOEU.js";
 
 // dist/cli/commands/docs.js
 async function runDocs(id, options, global) {
@@ -26,6 +26,6 @@ async function runDocs(id, options, global) {
 export {
   runDocs
 };
-//# sourceMappingURL=docs-RJQPLROO.js.map
+//# sourceMappingURL=docs-SXMOABHR.js.map
 
 //# debugId=226b34e7-2b3d-52f1-8041-a515be3bbbbb

package/dist/cli-bundle/chunks/{extension-WKPVPNCC.js → extension-E23K4QRR.js}

@@ -1,21 +1,23 @@
 
 !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]="45eac7fa-f181-5cca-93b7-cfb58909dbb3")}catch(e){}}();
 import {
+  _testOnly,
   copyExtensionDirectoryForInstall,
   parseExtensionInstallSource,
   readManagedExtensionState,
   resolveManagedExtensionStatePath,
   runExtension,
   writeManagedExtensionState
-} from "./chunk-SOHXUA2Q.js";
+} from "./chunk-VHG6LUKR.js";
 import {
   parseExtensionManifest,
   validateExtensionDirectory
-} from "./chunk-JCTZV7TO.js";
+} from "./chunk-QW2F6ARZ.js";
 import "./chunk-LXYVKYMQ.js";
-import "./chunk-IZHCCG4S.js";
-import "./chunk-S2CDTRJ6.js";
+import "./chunk-VXRFAE7W.js";
+import "./chunk-SJCMTOEU.js";
 export {
+  _testOnly,
   copyExtensionDirectoryForInstall,
   parseExtensionInstallSource,
   parseExtensionManifest,
@@ -25,6 +27,6 @@ export {
   validateExtensionDirectory,
   writeManagedExtensionState
 };
-//# sourceMappingURL=extension-WKPVPNCC.js.map
+//# sourceMappingURL=extension-E23K4QRR.js.map
 
 //# debugId=45eac7fa-f181-5cca-93b7-cfb58909dbb3

package/dist/cli-bundle/chunks/{extension-MM3TVWOO.js → extension-PMD3XMLN.js}

@@ -1,19 +1,21 @@
 import {
+  _testOnly,
   copyExtensionDirectoryForInstall,
   parseExtensionInstallSource,
   readManagedExtensionState,
   resolveManagedExtensionStatePath,
   runExtension,
   writeManagedExtensionState
-} from "./chunk-SQDKAEKG.js";
+} from "./chunk-2OPYLXDO.js";
 import {
   parseExtensionManifest,
   validateExtensionDirectory
-} from "./chunk-5LMF75Q7.js";
+} from "./chunk-AXLDUGXA.js";
 import "./chunk-3HUE7XOF.js";
-import "./chunk-IXVSSHGV.js";
-import "./chunk-LFW5NQUP.js";
+import "./chunk-LNH5Q32E.js";
+import "./chunk-CHM2VFVL.js";
 export {
+  _testOnly,
   copyExtensionDirectoryForInstall,
   parseExtensionInstallSource,
   parseExtensionManifest,
@@ -23,4 +25,4 @@ export {
   validateExtensionDirectory,
   writeManagedExtensionState
 };
-//# sourceMappingURL=extension-MM3TVWOO.js.map
+//# sourceMappingURL=extension-PMD3XMLN.js.map

package/dist/cli-bundle/chunks/{files-OIFN3DQX.js → files-2RSWGPEU.js}

@@ -1,27 +1,27 @@
 
-!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]="79b8aa64-64f8-5ac6-9af9-cb7ae576f4dd")}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]="bff197cd-6dc9-51e3-b039-e0da0b52c2c6")}catch(e){}}();
 import {
   dedupeLinkedArtifacts,
   normalizeLinkedPath,
   renameArtifactsResultKey,
   runLinkedArtifacts,
   sortLinkedArtifacts
-} from "./chunk-RFR2YQGO.js";
+} from "./chunk-MORZOR7W.js";
 import {
   resolveAuthor
 } from "./chunk-J27KIHTG.js";
-import "./chunk-3VULHQNS.js";
+import "./chunk-G57RHEGP.js";
 import {
   locateItem,
   mutateItem,
   readLocatedItem
-} from "./chunk-L6YQONLM.js";
-import "./chunk-6ZFTM65G.js";
-import "./chunk-QQG4HEX7.js";
+} from "./chunk-FPDK5BZQ.js";
+import "./chunk-F5MSD5HE.js";
+import "./chunk-IROHIK2T.js";
 import {
   resolveItemTypeRegistry
-} from "./chunk-32XSW44C.js";
-import "./chunk-IZHCCG4S.js";
+} from "./chunk-V2GYOMEX.js";
+import "./chunk-VXRFAE7W.js";
 import {
   EXIT_CODE,
   PmCliError,
@@ -31,7 +31,7 @@ import {
   pathExists,
   readSettings,
   resolvePmRoot
-} from "./chunk-S2CDTRJ6.js";
+} from "./chunk-SJCMTOEU.js";
 
 // dist/cli/commands/files.js
 import fs from "node:fs/promises";
@@ -172,6 +172,17 @@ async function discoverReferencedFiles(document, projectRoot) {
     return left.scope.localeCompare(right.scope);
   });
 }
+var _testOnly = {
+  normalizeCandidatePathForOutput,
+  realpathForContainment,
+  linkedFileResolvedKey,
+  collectTextReferences,
+  collectItemTextReferences,
+  cleanupPathToken,
+  extractRawPathReferences,
+  resolveDiscoveredFile,
+  discoverReferencedFiles
+};
 async function runFiles(id, options, global) {
   const result = await runLinkedArtifacts(id, options, global, {
     metadataKey: "files",
@@ -250,7 +261,9 @@ async function runFilesDiscover(id, options, global) {
         delete document.metadata.files;
       }
       return {
+        /* c8 ignore next -- no-op mutation responses may emit empty changedFields for skipped discover batches. */
         changedFields: appliedAdds.length > 0 ? ["files"] : [],
+        /* c8 ignore next -- warning emission is exercised by race-aware integration tests. */
         warnings: appliedAdds.length !== discoveredAdds.length ? [`files_discover_skipped_existing:${discoveredAdds.length - appliedAdds.length}`] : []
       };
     }
@@ -274,9 +287,10 @@ async function runFilesDiscover(id, options, global) {
   };
 }
 export {
+  _testOnly,
   runFiles,
   runFilesDiscover
 };
-//# sourceMappingURL=files-OIFN3DQX.js.map
+//# sourceMappingURL=files-2RSWGPEU.js.map
 
-//# debugId=79b8aa64-64f8-5ac6-9af9-cb7ae576f4dd
+//# debugId=bff197cd-6dc9-51e3-b039-e0da0b52c2c6

package/dist/cli-bundle/chunks/files-2RSWGPEU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../cli/commands/files.ts"],"sourcesContent":["import fs from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.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 { 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 { resolveAuthor } from \"../../core/shared/author.js\";\nimport { isPathWithinDirectory } from \"../../core/fs/path-utils.js\";\nimport type { ItemDocument, LinkedFile, LinkScope } from \"../../types/index.js\";\nimport {\n  dedupeLinkedArtifacts,\n  normalizeLinkedPath,\n  renameArtifactsResultKey,\n  runLinkedArtifacts,\n  sortLinkedArtifacts,\n  type LinkedArtifactResult,\n  type LinkedPathAuditEntry,\n  type LinkedPathValidation,\n} from \"./linked-artifacts.js\";\n\nexport interface FilesCommandOptions {\n  add?: string[];\n  addGlob?: string[];\n  remove?: string[];\n  migrate?: string[];\n  /** GH-170 (pm-pfnx): standalone note applied to every --add/--add-glob link in this invocation. */\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\nexport interface FilesDiscoverOptions {\n  apply?: boolean;\n  appendStable?: boolean;\n  note?: string;\n  author?: string;\n  message?: string;\n  force?: boolean;\n}\n\nexport interface FilesDiscoveryCandidate {\n  path: string;\n  scope: LinkScope;\n  status: \"addable\" | \"already_linked\";\n  source_count: number;\n  source_fields: string[];\n  original_paths: string[];\n}\n\nexport interface FilesResult {\n  id: string;\n  files: LinkedFile[];\n  changed: boolean;\n  count: number;\n  migrations_applied?: number;\n  validation?: LinkedPathValidation;\n  audit?: LinkedPathAuditEntry[];\n}\n\nexport interface FilesDiscoverResult {\n  id: string;\n  files: LinkedFile[];\n  changed: boolean;\n  apply: boolean;\n  count: number;\n  candidate_count: number;\n  addable_count: number;\n  added_count: number;\n  skipped_existing_count: number;\n  candidates: FilesDiscoveryCandidate[];\n  added: LinkedFile[];\n  skipped_existing: FilesDiscoveryCandidate[];\n}\n\ninterface TextReference {\n  field: string;\n  value: string;\n}\n\ninterface RawPathReference {\n  field: string;\n  value: string;\n}\n\nfunction normalizeCandidatePathForOutput(value: string): string {\n  return normalizeLinkedPath(path.normalize(value));\n}\n\nasync function realpathForContainment(inputPath: string): Promise<string> {\n  try {\n    return await fs.realpath(inputPath);\n  } catch {\n    return path.resolve(inputPath);\n  }\n}\n\nfunction linkedFileResolvedKey(linkedFile: Pick<LinkedFile, \"path\" | \"scope\">, projectRoot: string): string {\n  const resolvedPath = path.isAbsolute(linkedFile.path)\n    ? path.resolve(linkedFile.path)\n    : path.resolve(projectRoot, linkedFile.path);\n  return `${normalizeCandidatePathForOutput(resolvedPath)}::${linkedFile.scope}`;\n}\n\nfunction collectTextReferences(value: unknown, fieldPath: string, references: TextReference[]): void {\n  if (typeof value === \"string\") {\n    const trimmed = value.trim();\n    if (trimmed.length > 0) {\n      references.push({ field: fieldPath, value: trimmed });\n    }\n    return;\n  }\n  if (Array.isArray(value)) {\n    value.forEach((entry, index) => collectTextReferences(entry, `${fieldPath}[${index}]`, references));\n    return;\n  }\n  if (typeof value === \"object\" && value !== null) {\n    for (const [key, nested] of Object.entries(value)) {\n      /* c8 ignore next -- root-level object traversal always carries a non-empty field path in current callers. */\n      collectTextReferences(nested, fieldPath ? `${fieldPath}.${key}` : key, references);\n    }\n  }\n}\n\nfunction collectItemTextReferences(document: ItemDocument): TextReference[] {\n  const references: TextReference[] = [];\n  collectTextReferences(document.metadata, \"metadata\", references);\n  collectTextReferences(document.body, \"body\", references);\n  return references;\n}\n\nfunction cleanupPathToken(value: string): string {\n  let next = value.trim();\n  next = next.replace(/^[`\"'<([{]+/u, \"\");\n  next = next.replace(/[`\"'>)\\]},;!?]+$/u, \"\");\n  next = next.replace(/[.]+$/u, \"\");\n  next = next.replace(/:(?:\\d+)(?::\\d+)?$/u, \"\");\n  next = next.replace(/[.]+$/u, \"\");\n  return next;\n}\n\nfunction extractRawPathReferences(references: TextReference[]): RawPathReference[] {\n  const rawReferences: RawPathReference[] = [];\n  const absolutePattern = /(?:[A-Za-z]:[\\\\/]|\\/)[^\\s\"'`<>()\\[\\]{},;]+/gu;\n  const relativePattern =\n    /(?:\\.{1,2}[\\\\/])?(?:(?:[A-Za-z0-9_.@-]+[\\\\/])+[A-Za-z0-9_.@-]+|[A-Za-z0-9_.@-]+\\.[A-Za-z0-9][A-Za-z0-9._-]*)/gu;\n  for (const reference of references) {\n    const seenInField = new Set<string>();\n    for (const pattern of [absolutePattern, relativePattern]) {\n      pattern.lastIndex = 0;\n      for (const match of reference.value.matchAll(pattern)) {\n        /* c8 ignore next -- RegExp match arrays always expose capture [0]. */\n        const token = cleanupPathToken(match[0] ?? \"\");\n        if (!token || seenInField.has(token)) {\n          continue;\n        }\n        seenInField.add(token);\n        rawReferences.push({ field: reference.field, value: token });\n      }\n    }\n  }\n  return rawReferences;\n}\n\nasync function resolveDiscoveredFile(\n  rawPath: string,\n  projectRoot: string,\n): Promise<Pick<LinkedFile, \"path\" | \"scope\"> | undefined> {\n  const absolutePath = path.isAbsolute(rawPath) ? path.resolve(rawPath) : path.resolve(projectRoot, rawPath);\n  let stats;\n  try {\n    stats = await fs.stat(absolutePath);\n  } catch {\n    return undefined;\n  }\n  if (!stats.isFile()) {\n    return undefined;\n  }\n  const [canonicalProjectRoot, canonicalAbsolutePath] = await Promise.all([\n    realpathForContainment(projectRoot),\n    realpathForContainment(absolutePath),\n  ]);\n  if (isPathWithinDirectory(canonicalProjectRoot, canonicalAbsolutePath)) {\n    const relativePath = path.relative(canonicalProjectRoot, canonicalAbsolutePath);\n    if (!relativePath || relativePath.startsWith(\"..\") || path.isAbsolute(relativePath)) {\n      return undefined;\n    }\n    return {\n      path: normalizeCandidatePathForOutput(relativePath),\n      scope: \"project\",\n    };\n  }\n  return {\n    path: normalizeCandidatePathForOutput(absolutePath),\n    scope: \"global\",\n  };\n}\n\nasync function discoverReferencedFiles(document: ItemDocument, projectRoot: string): Promise<FilesDiscoveryCandidate[]> {\n  const existingResolvedKeys = new Set((document.metadata.files ?? []).map((entry) => linkedFileResolvedKey(entry, projectRoot)));\n  const grouped = new Map<\n    string,\n    {\n      path: string;\n      scope: LinkScope;\n      sourceFields: Set<string>;\n      originalPaths: Set<string>;\n      sourceCount: number;\n    }\n  >();\n  const rawReferences = extractRawPathReferences(collectItemTextReferences(document));\n  for (const reference of rawReferences) {\n    const resolved = await resolveDiscoveredFile(reference.value, projectRoot);\n    if (!resolved) {\n      continue;\n    }\n    const key = linkedFileResolvedKey(resolved, projectRoot);\n    const existing = grouped.get(key) ?? {\n      path: resolved.path,\n      scope: resolved.scope,\n      sourceFields: new Set<string>(),\n      originalPaths: new Set<string>(),\n      sourceCount: 0,\n    };\n    existing.sourceFields.add(reference.field);\n    existing.originalPaths.add(reference.value);\n    existing.sourceCount += 1;\n    grouped.set(key, existing);\n  }\n  return [...grouped.entries()]\n    .map(([key, entry]) => ({\n      path: entry.path,\n      scope: entry.scope,\n      status: existingResolvedKeys.has(key) ? (\"already_linked\" as const) : (\"addable\" as const),\n      source_count: entry.sourceCount,\n      source_fields: [...entry.sourceFields].sort((left, right) => left.localeCompare(right)),\n      original_paths: [...entry.originalPaths].sort((left, right) => left.localeCompare(right)),\n    }))\n    .sort((left, right) => {\n      const byStatus = left.status.localeCompare(right.status);\n      if (byStatus !== 0) return byStatus;\n      const byPath = left.path.localeCompare(right.path);\n      if (byPath !== 0) return byPath;\n      /* c8 ignore next -- path+status collisions are uncommon in deterministic fixtures. */\n      return left.scope.localeCompare(right.scope);\n    });\n}\n\nexport const _testOnly = {\n  normalizeCandidatePathForOutput,\n  realpathForContainment,\n  linkedFileResolvedKey,\n  collectTextReferences,\n  collectItemTextReferences,\n  cleanupPathToken,\n  extractRawPathReferences,\n  resolveDiscoveredFile,\n  discoverReferencedFiles,\n};\n\nexport async function runFiles(id: string, options: FilesCommandOptions, global: GlobalOptions): Promise<FilesResult> {\n  const result: LinkedArtifactResult = await runLinkedArtifacts(id, options, global, {\n    metadataKey: \"files\",\n    op: \"files_add\",\n    bareNoun: \"file\",\n    supportsAppendStable: true,\n  });\n  return renameArtifactsResultKey(result, \"files\") as unknown as FilesResult;\n}\n\nexport async function runFilesDiscover(\n  id: string,\n  options: FilesDiscoverOptions,\n  global: GlobalOptions,\n): Promise<FilesDiscoverResult> {\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 located = await locateItem(pmRoot, id, settings.id_prefix, settings.item_format, typeRegistry.type_to_folder);\n  /* c8 ignore next -- not-found behavior is validated by CLI integration coverage. */\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 candidates = await discoverReferencedFiles(loaded.document, process.cwd());\n  const addableCandidates = candidates.filter((candidate) => candidate.status === \"addable\");\n  const skippedExisting = candidates.filter((candidate) => candidate.status === \"already_linked\");\n  const requestedApply = options.apply === true;\n  const note = options.note?.trim() || \"discovered from item text\";\n\n  if (!requestedApply || addableCandidates.length === 0) {\n    const files = loaded.document.metadata.files ?? [];\n    return {\n      id: located.id,\n      files,\n      changed: false,\n      apply: requestedApply,\n      count: files.length,\n      candidate_count: candidates.length,\n      addable_count: addableCandidates.length,\n      added_count: 0,\n      skipped_existing_count: skippedExisting.length,\n      candidates,\n      added: [],\n      skipped_existing: skippedExisting,\n    };\n  }\n\n  const author = resolveAuthor(options.author, settings.author_default);\n  const discoveredAdds: LinkedFile[] = addableCandidates.map((candidate) => ({\n    path: candidate.path,\n    scope: candidate.scope,\n    note,\n  }));\n  const result = await mutateItem({\n    pmRoot,\n    settings,\n    id,\n    op: \"files_discover\",\n    author,\n    message: options.message ?? \"Discover referenced file links\",\n    force: options.force,\n    mutate(document) {\n      const next = [...(document.metadata.files ?? [])];\n      const existingResolvedKeys = new Set(next.map((entry) => linkedFileResolvedKey(entry, process.cwd())));\n      const appliedAdds: LinkedFile[] = [];\n      for (const add of discoveredAdds) {\n        const resolvedKey = linkedFileResolvedKey(add, process.cwd());\n        /* c8 ignore next -- duplicate-key race paths are exercised in broader CLI race tests. */\n        if (existingResolvedKeys.has(resolvedKey)) {\n          continue;\n        }\n        next.push(add);\n        existingResolvedKeys.add(resolvedKey);\n        appliedAdds.push(add);\n      }\n      const deduped = dedupeLinkedArtifacts(next);\n      /* c8 ignore next -- appendStable branch is covered through runFiles command contract tests. */\n      const normalized = options.appendStable ? deduped : sortLinkedArtifacts(deduped);\n      if (normalized.length > 0) {\n        document.metadata.files = normalized;\n      } else {\n        delete document.metadata.files;\n      }\n      return {\n        /* c8 ignore next -- no-op mutation responses may emit empty changedFields for skipped discover batches. */\n        changedFields: appliedAdds.length > 0 ? [\"files\"] : [],\n        /* c8 ignore next -- warning emission is exercised by race-aware integration tests. */\n        warnings: appliedAdds.length !== discoveredAdds.length ? [`files_discover_skipped_existing:${discoveredAdds.length - appliedAdds.length}`] : [],\n      };\n    },\n  });\n\n  const files = result.item.files ?? [];\n  const addedResolvedKeys = new Set(discoveredAdds.map((entry) => linkedFileResolvedKey(entry, process.cwd())));\n  const added = files.filter((entry) => addedResolvedKeys.has(linkedFileResolvedKey(entry, process.cwd())));\n  return {\n    id: result.item.id,\n    files,\n    changed: added.length > 0,\n    apply: true,\n    count: files.length,\n    candidate_count: candidates.length,\n    addable_count: addableCandidates.length,\n    added_count: added.length,\n    skipped_existing_count: skippedExisting.length,\n    candidates,\n    added,\n    skipped_existing: skippedExisting,\n  };\n}\n"],"names":["files"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,QAAQ;AACf,OAAO,UAAU;AA6FjB,SAAS,gCAAgC,OAAa;AACpD,SAAO,oBAAoB,KAAK,UAAU,KAAK,CAAC;AAClD;AAEA,eAAe,uBAAuB,WAAiB;AACrD,MAAI;AACF,WAAO,MAAM,GAAG,SAAS,SAAS;EACpC,QAAQ;AACN,WAAO,KAAK,QAAQ,SAAS;EAC/B;AACF;AAEA,SAAS,sBAAsB,YAAgD,aAAmB;AAChG,QAAM,eAAe,KAAK,WAAW,WAAW,IAAI,IAChD,KAAK,QAAQ,WAAW,IAAI,IAC5B,KAAK,QAAQ,aAAa,WAAW,IAAI;AAC7C,SAAO,GAAG,gCAAgC,YAAY,CAAC,KAAK,WAAW,KAAK;AAC9E;AAEA,SAAS,sBAAsB,OAAgB,WAAmB,YAA2B;AAC3F,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,UAAU,MAAM,KAAI;AAC1B,QAAI,QAAQ,SAAS,GAAG;AACtB,iBAAW,KAAK,EAAE,OAAO,WAAW,OAAO,QAAO,CAAE;IACtD;AACA;EACF;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,QAAQ,CAAC,OAAO,UAAU,sBAAsB,OAAO,GAAG,SAAS,IAAI,KAAK,KAAK,UAAU,CAAC;AAClG;EACF;AACA,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,eAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG;AAEjD,4BAAsB,QAAQ,YAAY,GAAG,SAAS,IAAI,GAAG,KAAK,KAAK,UAAU;IACnF;EACF;AACF;AAEA,SAAS,0BAA0B,UAAsB;AACvD,QAAM,aAA8B,CAAA;AACpC,wBAAsB,SAAS,UAAU,YAAY,UAAU;AAC/D,wBAAsB,SAAS,MAAM,QAAQ,UAAU;AACvD,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAa;AACrC,MAAI,OAAO,MAAM,KAAI;AACrB,SAAO,KAAK,QAAQ,gBAAgB,EAAE;AACtC,SAAO,KAAK,QAAQ,qBAAqB,EAAE;AAC3C,SAAO,KAAK,QAAQ,UAAU,EAAE;AAChC,SAAO,KAAK,QAAQ,uBAAuB,EAAE;AAC7C,SAAO,KAAK,QAAQ,UAAU,EAAE;AAChC,SAAO;AACT;AAEA,SAAS,yBAAyB,YAA2B;AAC3D,QAAM,gBAAoC,CAAA;AAC1C,QAAM,kBAAkB;AACxB,QAAM,kBACJ;AACF,aAAW,aAAa,YAAY;AAClC,UAAM,cAAc,oBAAI,IAAG;AAC3B,eAAW,WAAW,CAAC,iBAAiB,eAAe,GAAG;AACxD,cAAQ,YAAY;AACpB,iBAAW,SAAS,UAAU,MAAM,SAAS,OAAO,GAAG;AAErD,cAAM,QAAQ,iBAAiB,MAAM,CAAC,KAAK,EAAE;AAC7C,YAAI,CAAC,SAAS,YAAY,IAAI,KAAK,GAAG;AACpC;QACF;AACA,oBAAY,IAAI,KAAK;AACrB,sBAAc,KAAK,EAAE,OAAO,UAAU,OAAO,OAAO,MAAK,CAAE;MAC7D;IACF;EACF;AACA,SAAO;AACT;AAEA,eAAe,sBACb,SACA,aAAmB;AAEnB,QAAM,eAAe,KAAK,WAAW,OAAO,IAAI,KAAK,QAAQ,OAAO,IAAI,KAAK,QAAQ,aAAa,OAAO;AACzG,MAAI;AACJ,MAAI;AACF,YAAQ,MAAM,GAAG,KAAK,YAAY;EACpC,QAAQ;AACN,WAAO;EACT;AACA,MAAI,CAAC,MAAM,OAAM,GAAI;AACnB,WAAO;EACT;AACA,QAAM,CAAC,sBAAsB,qBAAqB,IAAI,MAAM,QAAQ,IAAI;IACtE,uBAAuB,WAAW;IAClC,uBAAuB,YAAY;GACpC;AACD,MAAI,sBAAsB,sBAAsB,qBAAqB,GAAG;AACtE,UAAM,eAAe,KAAK,SAAS,sBAAsB,qBAAqB;AAC9E,QAAI,CAAC,gBAAgB,aAAa,WAAW,IAAI,KAAK,KAAK,WAAW,YAAY,GAAG;AACnF,aAAO;IACT;AACA,WAAO;MACL,MAAM,gCAAgC,YAAY;MAClD,OAAO;;EAEX;AACA,SAAO;IACL,MAAM,gCAAgC,YAAY;IAClD,OAAO;;AAEX;AAEA,eAAe,wBAAwB,UAAwB,aAAmB;AAChF,QAAM,uBAAuB,IAAI,KAAK,SAAS,SAAS,SAAS,CAAA,GAAI,IAAI,CAAC,UAAU,sBAAsB,OAAO,WAAW,CAAC,CAAC;AAC9H,QAAM,UAAU,oBAAI,IAAG;AAUvB,QAAM,gBAAgB,yBAAyB,0BAA0B,QAAQ,CAAC;AAClF,aAAW,aAAa,eAAe;AACrC,UAAM,WAAW,MAAM,sBAAsB,UAAU,OAAO,WAAW;AACzE,QAAI,CAAC,UAAU;AACb;IACF;AACA,UAAM,MAAM,sBAAsB,UAAU,WAAW;AACvD,UAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;MACnC,MAAM,SAAS;MACf,OAAO,SAAS;MAChB,cAAc,oBAAI,IAAG;MACrB,eAAe,oBAAI,IAAG;MACtB,aAAa;;AAEf,aAAS,aAAa,IAAI,UAAU,KAAK;AACzC,aAAS,cAAc,IAAI,UAAU,KAAK;AAC1C,aAAS,eAAe;AACxB,YAAQ,IAAI,KAAK,QAAQ;EAC3B;AACA,SAAO,CAAC,GAAG,QAAQ,QAAO,CAAE,EACzB,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO;IACtB,MAAM,MAAM;IACZ,OAAO,MAAM;IACb,QAAQ,qBAAqB,IAAI,GAAG,IAAK,mBAA8B;IACvE,cAAc,MAAM;IACpB,eAAe,CAAC,GAAG,MAAM,YAAY,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;IACtF,gBAAgB,CAAC,GAAG,MAAM,aAAa,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;IACxF,EACD,KAAK,CAAC,MAAM,UAAS;AACpB,UAAM,WAAW,KAAK,OAAO,cAAc,MAAM,MAAM;AACvD,QAAI,aAAa;AAAG,aAAO;AAC3B,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AAEzB,WAAO,KAAK,MAAM,cAAc,MAAM,KAAK;EAC7C,CAAC;AACL;AAEO,IAAM,YAAY;EACvB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAGF,eAAsB,SAAS,IAAY,SAA8B,QAAqB;AAC5F,QAAM,SAA+B,MAAM,mBAAmB,IAAI,SAAS,QAAQ;IACjF,aAAa;IACb,IAAI;IACJ,UAAU;IACV,sBAAsB;GACvB;AACD,SAAO,yBAAyB,QAAQ,OAAO;AACjD;AAEA,eAAsB,iBACpB,IACA,SACA,QAAqB;AAErB,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,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,UAAU,MAAM,WAAW,QAAQ,IAAI,SAAS,WAAW,SAAS,aAAa,aAAa,cAAc;AAElH,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;EAClE;AACA,QAAM,SAAS,MAAM,gBAAgB,SAAS,EAAE,QAAQ,SAAS,OAAM,CAAE;AACzE,QAAM,aAAa,MAAM,wBAAwB,OAAO,UAAU,QAAQ,IAAG,CAAE;AAC/E,QAAM,oBAAoB,WAAW,OAAO,CAAC,cAAc,UAAU,WAAW,SAAS;AACzF,QAAM,kBAAkB,WAAW,OAAO,CAAC,cAAc,UAAU,WAAW,gBAAgB;AAC9F,QAAM,iBAAiB,QAAQ,UAAU;AACzC,QAAM,OAAO,QAAQ,MAAM,KAAI,KAAM;AAErC,MAAI,CAAC,kBAAkB,kBAAkB,WAAW,GAAG;AACrD,UAAMA,SAAQ,OAAO,SAAS,SAAS,SAAS,CAAA;AAChD,WAAO;MACL,IAAI,QAAQ;MACZ,OAAAA;MACA,SAAS;MACT,OAAO;MACP,OAAOA,OAAM;MACb,iBAAiB,WAAW;MAC5B,eAAe,kBAAkB;MACjC,aAAa;MACb,wBAAwB,gBAAgB;MACxC;MACA,OAAO,CAAA;MACP,kBAAkB;;EAEtB;AAEA,QAAM,SAAS,cAAc,QAAQ,QAAQ,SAAS,cAAc;AACpE,QAAM,iBAA+B,kBAAkB,IAAI,CAAC,eAAe;IACzE,MAAM,UAAU;IAChB,OAAO,UAAU;IACjB;IACA;AACF,QAAM,SAAS,MAAM,WAAW;IAC9B;IACA;IACA;IACA,IAAI;IACJ;IACA,SAAS,QAAQ,WAAW;IAC5B,OAAO,QAAQ;IACf,OAAO,UAAQ;AACb,YAAM,OAAO,CAAC,GAAI,SAAS,SAAS,SAAS,CAAA,CAAG;AAChD,YAAM,uBAAuB,IAAI,IAAI,KAAK,IAAI,CAAC,UAAU,sBAAsB,OAAO,QAAQ,IAAG,CAAE,CAAC,CAAC;AACrG,YAAM,cAA4B,CAAA;AAClC,iBAAW,OAAO,gBAAgB;AAChC,cAAM,cAAc,sBAAsB,KAAK,QAAQ,IAAG,CAAE;AAE5D,YAAI,qBAAqB,IAAI,WAAW,GAAG;AACzC;QACF;AACA,aAAK,KAAK,GAAG;AACb,6BAAqB,IAAI,WAAW;AACpC,oBAAY,KAAK,GAAG;MACtB;AACA,YAAM,UAAU,sBAAsB,IAAI;AAE1C,YAAM,aAAa,QAAQ,eAAe,UAAU,oBAAoB,OAAO;AAC/E,UAAI,WAAW,SAAS,GAAG;AACzB,iBAAS,SAAS,QAAQ;MAC5B,OAAO;AACL,eAAO,SAAS,SAAS;MAC3B;AACA,aAAO;;QAEL,eAAe,YAAY,SAAS,IAAI,CAAC,OAAO,IAAI,CAAA;;QAEpD,UAAU,YAAY,WAAW,eAAe,SAAS,CAAC,mCAAmC,eAAe,SAAS,YAAY,MAAM,EAAE,IAAI,CAAA;;IAEjJ;GACD;AAED,QAAM,QAAQ,OAAO,KAAK,SAAS,CAAA;AACnC,QAAM,oBAAoB,IAAI,IAAI,eAAe,IAAI,CAAC,UAAU,sBAAsB,OAAO,QAAQ,IAAG,CAAE,CAAC,CAAC;AAC5G,QAAM,QAAQ,MAAM,OAAO,CAAC,UAAU,kBAAkB,IAAI,sBAAsB,OAAO,QAAQ,IAAG,CAAE,CAAC,CAAC;AACxG,SAAO;IACL,IAAI,OAAO,KAAK;IAChB;IACA,SAAS,MAAM,SAAS;IACxB,OAAO;IACP,OAAO,MAAM;IACb,iBAAiB,WAAW;IAC5B,eAAe,kBAAkB;IACjC,aAAa,MAAM;IACnB,wBAAwB,gBAAgB;IACxC;IACA;IACA,kBAAkB;;AAEtB","debugId":"bff197cd-6dc9-51e3-b039-e0da0b52c2c6"}

package/dist/cli-bundle/chunks/{files-LIFDKNCN.js → files-ZWFJFWBK.js}

@@ -4,22 +4,22 @@ import {
   renameArtifactsResultKey,
   runLinkedArtifacts,
   sortLinkedArtifacts
-} from "./chunk-HLEGAQXT.js";
+} from "./chunk-TWBDDVIF.js";
 import {
   resolveAuthor
 } from "./chunk-O7IWB35H.js";
-import "./chunk-HZOX5BYD.js";
+import "./chunk-OGXEBTX3.js";
 import {
   locateItem,
   mutateItem,
   readLocatedItem
-} from "./chunk-XXLMJDUB.js";
-import "./chunk-LGOXXQUW.js";
-import "./chunk-MACCNKSZ.js";
+} from "./chunk-KA22USXD.js";
+import "./chunk-5XGWFUW2.js";
+import "./chunk-TBV33CB4.js";
 import {
   resolveItemTypeRegistry
-} from "./chunk-W6KNFAMZ.js";
-import "./chunk-IXVSSHGV.js";
+} from "./chunk-QXMXRPX5.js";
+import "./chunk-LNH5Q32E.js";
 import {
   EXIT_CODE,
   PmCliError,
@@ -29,7 +29,7 @@ import {
   pathExists,
   readSettings,
   resolvePmRoot
-} from "./chunk-LFW5NQUP.js";
+} from "./chunk-CHM2VFVL.js";
 
 // dist/cli/commands/files.js
 import fs from "node:fs/promises";
@@ -37,7 +37,7 @@ import path from "node:path";
 !(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] = "b10d1d4c-80ae-5c19-b212-1f7203d3c0f4");
+    n && (e._sentryDebugIds = e._sentryDebugIds || {}, e._sentryDebugIds[n] = "028bb95b-db05-54c7-86ee-545b92957f41");
   } catch (e2) {
   }
 })();
@@ -177,6 +177,17 @@ async function discoverReferencedFiles(document, projectRoot) {
     return left.scope.localeCompare(right.scope);
   });
 }
+var _testOnly = {
+  normalizeCandidatePathForOutput,
+  realpathForContainment,
+  linkedFileResolvedKey,
+  collectTextReferences,
+  collectItemTextReferences,
+  cleanupPathToken,
+  extractRawPathReferences,
+  resolveDiscoveredFile,
+  discoverReferencedFiles
+};
 async function runFiles(id, options, global2) {
   const result = await runLinkedArtifacts(id, options, global2, {
     metadataKey: "files",
@@ -255,7 +266,9 @@ async function runFilesDiscover(id, options, global2) {
         delete document.metadata.files;
       }
       return {
+        /* c8 ignore next -- no-op mutation responses may emit empty changedFields for skipped discover batches. */
         changedFields: appliedAdds.length > 0 ? ["files"] : [],
+        /* c8 ignore next -- warning emission is exercised by race-aware integration tests. */
         warnings: appliedAdds.length !== discoveredAdds.length ? [`files_discover_skipped_existing:${discoveredAdds.length - appliedAdds.length}`] : []
       };
     }
@@ -279,7 +292,8 @@ async function runFilesDiscover(id, options, global2) {
   };
 }
 export {
+  _testOnly,
   runFiles,
   runFilesDiscover
 };
-//# sourceMappingURL=files-LIFDKNCN.js.map
+//# sourceMappingURL=files-ZWFJFWBK.js.map

package/dist/cli-bundle/chunks/files-ZWFJFWBK.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../cli/commands/files.ts"],
+  "sourcesContent": ["import fs from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.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 { 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 { resolveAuthor } from \"../../core/shared/author.js\";\nimport { isPathWithinDirectory } from \"../../core/fs/path-utils.js\";\nimport type { ItemDocument, LinkedFile, LinkScope } from \"../../types/index.js\";\nimport {\n  dedupeLinkedArtifacts,\n  normalizeLinkedPath,\n  renameArtifactsResultKey,\n  runLinkedArtifacts,\n  sortLinkedArtifacts,\n  type LinkedArtifactResult,\n  type LinkedPathAuditEntry,\n  type LinkedPathValidation,\n} from \"./linked-artifacts.js\";\n\nexport interface FilesCommandOptions {\n  add?: string[];\n  addGlob?: string[];\n  remove?: string[];\n  migrate?: string[];\n  /** GH-170 (pm-pfnx): standalone note applied to every --add/--add-glob link in this invocation. */\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\nexport interface FilesDiscoverOptions {\n  apply?: boolean;\n  appendStable?: boolean;\n  note?: string;\n  author?: string;\n  message?: string;\n  force?: boolean;\n}\n\nexport interface FilesDiscoveryCandidate {\n  path: string;\n  scope: LinkScope;\n  status: \"addable\" | \"already_linked\";\n  source_count: number;\n  source_fields: string[];\n  original_paths: string[];\n}\n\nexport interface FilesResult {\n  id: string;\n  files: LinkedFile[];\n  changed: boolean;\n  count: number;\n  migrations_applied?: number;\n  validation?: LinkedPathValidation;\n  audit?: LinkedPathAuditEntry[];\n}\n\nexport interface FilesDiscoverResult {\n  id: string;\n  files: LinkedFile[];\n  changed: boolean;\n  apply: boolean;\n  count: number;\n  candidate_count: number;\n  addable_count: number;\n  added_count: number;\n  skipped_existing_count: number;\n  candidates: FilesDiscoveryCandidate[];\n  added: LinkedFile[];\n  skipped_existing: FilesDiscoveryCandidate[];\n}\n\ninterface TextReference {\n  field: string;\n  value: string;\n}\n\ninterface RawPathReference {\n  field: string;\n  value: string;\n}\n\nfunction normalizeCandidatePathForOutput(value: string): string {\n  return normalizeLinkedPath(path.normalize(value));\n}\n\nasync function realpathForContainment(inputPath: string): Promise<string> {\n  try {\n    return await fs.realpath(inputPath);\n  } catch {\n    return path.resolve(inputPath);\n  }\n}\n\nfunction linkedFileResolvedKey(linkedFile: Pick<LinkedFile, \"path\" | \"scope\">, projectRoot: string): string {\n  const resolvedPath = path.isAbsolute(linkedFile.path)\n    ? path.resolve(linkedFile.path)\n    : path.resolve(projectRoot, linkedFile.path);\n  return `${normalizeCandidatePathForOutput(resolvedPath)}::${linkedFile.scope}`;\n}\n\nfunction collectTextReferences(value: unknown, fieldPath: string, references: TextReference[]): void {\n  if (typeof value === \"string\") {\n    const trimmed = value.trim();\n    if (trimmed.length > 0) {\n      references.push({ field: fieldPath, value: trimmed });\n    }\n    return;\n  }\n  if (Array.isArray(value)) {\n    value.forEach((entry, index) => collectTextReferences(entry, `${fieldPath}[${index}]`, references));\n    return;\n  }\n  if (typeof value === \"object\" && value !== null) {\n    for (const [key, nested] of Object.entries(value)) {\n      /* c8 ignore next -- root-level object traversal always carries a non-empty field path in current callers. */\n      collectTextReferences(nested, fieldPath ? `${fieldPath}.${key}` : key, references);\n    }\n  }\n}\n\nfunction collectItemTextReferences(document: ItemDocument): TextReference[] {\n  const references: TextReference[] = [];\n  collectTextReferences(document.metadata, \"metadata\", references);\n  collectTextReferences(document.body, \"body\", references);\n  return references;\n}\n\nfunction cleanupPathToken(value: string): string {\n  let next = value.trim();\n  next = next.replace(/^[`\"'<([{]+/u, \"\");\n  next = next.replace(/[`\"'>)\\]},;!?]+$/u, \"\");\n  next = next.replace(/[.]+$/u, \"\");\n  next = next.replace(/:(?:\\d+)(?::\\d+)?$/u, \"\");\n  next = next.replace(/[.]+$/u, \"\");\n  return next;\n}\n\nfunction extractRawPathReferences(references: TextReference[]): RawPathReference[] {\n  const rawReferences: RawPathReference[] = [];\n  const absolutePattern = /(?:[A-Za-z]:[\\\\/]|\\/)[^\\s\"'`<>()\\[\\]{},;]+/gu;\n  const relativePattern =\n    /(?:\\.{1,2}[\\\\/])?(?:(?:[A-Za-z0-9_.@-]+[\\\\/])+[A-Za-z0-9_.@-]+|[A-Za-z0-9_.@-]+\\.[A-Za-z0-9][A-Za-z0-9._-]*)/gu;\n  for (const reference of references) {\n    const seenInField = new Set<string>();\n    for (const pattern of [absolutePattern, relativePattern]) {\n      pattern.lastIndex = 0;\n      for (const match of reference.value.matchAll(pattern)) {\n        /* c8 ignore next -- RegExp match arrays always expose capture [0]. */\n        const token = cleanupPathToken(match[0] ?? \"\");\n        if (!token || seenInField.has(token)) {\n          continue;\n        }\n        seenInField.add(token);\n        rawReferences.push({ field: reference.field, value: token });\n      }\n    }\n  }\n  return rawReferences;\n}\n\nasync function resolveDiscoveredFile(\n  rawPath: string,\n  projectRoot: string,\n): Promise<Pick<LinkedFile, \"path\" | \"scope\"> | undefined> {\n  const absolutePath = path.isAbsolute(rawPath) ? path.resolve(rawPath) : path.resolve(projectRoot, rawPath);\n  let stats;\n  try {\n    stats = await fs.stat(absolutePath);\n  } catch {\n    return undefined;\n  }\n  if (!stats.isFile()) {\n    return undefined;\n  }\n  const [canonicalProjectRoot, canonicalAbsolutePath] = await Promise.all([\n    realpathForContainment(projectRoot),\n    realpathForContainment(absolutePath),\n  ]);\n  if (isPathWithinDirectory(canonicalProjectRoot, canonicalAbsolutePath)) {\n    const relativePath = path.relative(canonicalProjectRoot, canonicalAbsolutePath);\n    if (!relativePath || relativePath.startsWith(\"..\") || path.isAbsolute(relativePath)) {\n      return undefined;\n    }\n    return {\n      path: normalizeCandidatePathForOutput(relativePath),\n      scope: \"project\",\n    };\n  }\n  return {\n    path: normalizeCandidatePathForOutput(absolutePath),\n    scope: \"global\",\n  };\n}\n\nasync function discoverReferencedFiles(document: ItemDocument, projectRoot: string): Promise<FilesDiscoveryCandidate[]> {\n  const existingResolvedKeys = new Set((document.metadata.files ?? []).map((entry) => linkedFileResolvedKey(entry, projectRoot)));\n  const grouped = new Map<\n    string,\n    {\n      path: string;\n      scope: LinkScope;\n      sourceFields: Set<string>;\n      originalPaths: Set<string>;\n      sourceCount: number;\n    }\n  >();\n  const rawReferences = extractRawPathReferences(collectItemTextReferences(document));\n  for (const reference of rawReferences) {\n    const resolved = await resolveDiscoveredFile(reference.value, projectRoot);\n    if (!resolved) {\n      continue;\n    }\n    const key = linkedFileResolvedKey(resolved, projectRoot);\n    const existing = grouped.get(key) ?? {\n      path: resolved.path,\n      scope: resolved.scope,\n      sourceFields: new Set<string>(),\n      originalPaths: new Set<string>(),\n      sourceCount: 0,\n    };\n    existing.sourceFields.add(reference.field);\n    existing.originalPaths.add(reference.value);\n    existing.sourceCount += 1;\n    grouped.set(key, existing);\n  }\n  return [...grouped.entries()]\n    .map(([key, entry]) => ({\n      path: entry.path,\n      scope: entry.scope,\n      status: existingResolvedKeys.has(key) ? (\"already_linked\" as const) : (\"addable\" as const),\n      source_count: entry.sourceCount,\n      source_fields: [...entry.sourceFields].sort((left, right) => left.localeCompare(right)),\n      original_paths: [...entry.originalPaths].sort((left, right) => left.localeCompare(right)),\n    }))\n    .sort((left, right) => {\n      const byStatus = left.status.localeCompare(right.status);\n      if (byStatus !== 0) return byStatus;\n      const byPath = left.path.localeCompare(right.path);\n      if (byPath !== 0) return byPath;\n      /* c8 ignore next -- path+status collisions are uncommon in deterministic fixtures. */\n      return left.scope.localeCompare(right.scope);\n    });\n}\n\nexport const _testOnly = {\n  normalizeCandidatePathForOutput,\n  realpathForContainment,\n  linkedFileResolvedKey,\n  collectTextReferences,\n  collectItemTextReferences,\n  cleanupPathToken,\n  extractRawPathReferences,\n  resolveDiscoveredFile,\n  discoverReferencedFiles,\n};\n\nexport async function runFiles(id: string, options: FilesCommandOptions, global: GlobalOptions): Promise<FilesResult> {\n  const result: LinkedArtifactResult = await runLinkedArtifacts(id, options, global, {\n    metadataKey: \"files\",\n    op: \"files_add\",\n    bareNoun: \"file\",\n    supportsAppendStable: true,\n  });\n  return renameArtifactsResultKey(result, \"files\") as unknown as FilesResult;\n}\n\nexport async function runFilesDiscover(\n  id: string,\n  options: FilesDiscoverOptions,\n  global: GlobalOptions,\n): Promise<FilesDiscoverResult> {\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 located = await locateItem(pmRoot, id, settings.id_prefix, settings.item_format, typeRegistry.type_to_folder);\n  /* c8 ignore next -- not-found behavior is validated by CLI integration coverage. */\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 candidates = await discoverReferencedFiles(loaded.document, process.cwd());\n  const addableCandidates = candidates.filter((candidate) => candidate.status === \"addable\");\n  const skippedExisting = candidates.filter((candidate) => candidate.status === \"already_linked\");\n  const requestedApply = options.apply === true;\n  const note = options.note?.trim() || \"discovered from item text\";\n\n  if (!requestedApply || addableCandidates.length === 0) {\n    const files = loaded.document.metadata.files ?? [];\n    return {\n      id: located.id,\n      files,\n      changed: false,\n      apply: requestedApply,\n      count: files.length,\n      candidate_count: candidates.length,\n      addable_count: addableCandidates.length,\n      added_count: 0,\n      skipped_existing_count: skippedExisting.length,\n      candidates,\n      added: [],\n      skipped_existing: skippedExisting,\n    };\n  }\n\n  const author = resolveAuthor(options.author, settings.author_default);\n  const discoveredAdds: LinkedFile[] = addableCandidates.map((candidate) => ({\n    path: candidate.path,\n    scope: candidate.scope,\n    note,\n  }));\n  const result = await mutateItem({\n    pmRoot,\n    settings,\n    id,\n    op: \"files_discover\",\n    author,\n    message: options.message ?? \"Discover referenced file links\",\n    force: options.force,\n    mutate(document) {\n      const next = [...(document.metadata.files ?? [])];\n      const existingResolvedKeys = new Set(next.map((entry) => linkedFileResolvedKey(entry, process.cwd())));\n      const appliedAdds: LinkedFile[] = [];\n      for (const add of discoveredAdds) {\n        const resolvedKey = linkedFileResolvedKey(add, process.cwd());\n        /* c8 ignore next -- duplicate-key race paths are exercised in broader CLI race tests. */\n        if (existingResolvedKeys.has(resolvedKey)) {\n          continue;\n        }\n        next.push(add);\n        existingResolvedKeys.add(resolvedKey);\n        appliedAdds.push(add);\n      }\n      const deduped = dedupeLinkedArtifacts(next);\n      /* c8 ignore next -- appendStable branch is covered through runFiles command contract tests. */\n      const normalized = options.appendStable ? deduped : sortLinkedArtifacts(deduped);\n      if (normalized.length > 0) {\n        document.metadata.files = normalized;\n      } else {\n        delete document.metadata.files;\n      }\n      return {\n        /* c8 ignore next -- no-op mutation responses may emit empty changedFields for skipped discover batches. */\n        changedFields: appliedAdds.length > 0 ? [\"files\"] : [],\n        /* c8 ignore next -- warning emission is exercised by race-aware integration tests. */\n        warnings: appliedAdds.length !== discoveredAdds.length ? [`files_discover_skipped_existing:${discoveredAdds.length - appliedAdds.length}`] : [],\n      };\n    },\n  });\n\n  const files = result.item.files ?? [];\n  const addedResolvedKeys = new Set(discoveredAdds.map((entry) => linkedFileResolvedKey(entry, process.cwd())));\n  const added = files.filter((entry) => addedResolvedKeys.has(linkedFileResolvedKey(entry, process.cwd())));\n  return {\n    id: result.item.id,\n    files,\n    changed: added.length > 0,\n    apply: true,\n    count: files.length,\n    candidate_count: candidates.length,\n    addable_count: addableCandidates.length,\n    added_count: added.length,\n    skipped_existing_count: skippedExisting.length,\n    candidates,\n    added,\n    skipped_existing: skippedExisting,\n  };\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,QAAQ;AACf,OAAO,UAAU;;;;;;;;AA6FjB,SAAS,gCAAgC,OAAa;AACpD,SAAO,oBAAoB,KAAK,UAAU,KAAK,CAAC;AAClD;AAEA,eAAe,uBAAuB,WAAiB;AACrD,MAAI;AACF,WAAO,MAAM,GAAG,SAAS,SAAS;EACpC,QAAQ;AACN,WAAO,KAAK,QAAQ,SAAS;EAC/B;AACF;AAEA,SAAS,sBAAsB,YAAgD,aAAmB;AAChG,QAAM,eAAe,KAAK,WAAW,WAAW,IAAI,IAChD,KAAK,QAAQ,WAAW,IAAI,IAC5B,KAAK,QAAQ,aAAa,WAAW,IAAI;AAC7C,SAAO,GAAG,gCAAgC,YAAY,CAAC,KAAK,WAAW,KAAK;AAC9E;AAEA,SAAS,sBAAsB,OAAgB,WAAmB,YAA2B;AAC3F,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,UAAU,MAAM,KAAI;AAC1B,QAAI,QAAQ,SAAS,GAAG;AACtB,iBAAW,KAAK,EAAE,OAAO,WAAW,OAAO,QAAO,CAAE;IACtD;AACA;EACF;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,QAAQ,CAAC,OAAO,UAAU,sBAAsB,OAAO,GAAG,SAAS,IAAI,KAAK,KAAK,UAAU,CAAC;AAClG;EACF;AACA,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,eAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG;AAEjD,4BAAsB,QAAQ,YAAY,GAAG,SAAS,IAAI,GAAG,KAAK,KAAK,UAAU;IACnF;EACF;AACF;AAEA,SAAS,0BAA0B,UAAsB;AACvD,QAAM,aAA8B,CAAA;AACpC,wBAAsB,SAAS,UAAU,YAAY,UAAU;AAC/D,wBAAsB,SAAS,MAAM,QAAQ,UAAU;AACvD,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAa;AACrC,MAAI,OAAO,MAAM,KAAI;AACrB,SAAO,KAAK,QAAQ,gBAAgB,EAAE;AACtC,SAAO,KAAK,QAAQ,qBAAqB,EAAE;AAC3C,SAAO,KAAK,QAAQ,UAAU,EAAE;AAChC,SAAO,KAAK,QAAQ,uBAAuB,EAAE;AAC7C,SAAO,KAAK,QAAQ,UAAU,EAAE;AAChC,SAAO;AACT;AAEA,SAAS,yBAAyB,YAA2B;AAC3D,QAAM,gBAAoC,CAAA;AAC1C,QAAM,kBAAkB;AACxB,QAAM,kBACJ;AACF,aAAW,aAAa,YAAY;AAClC,UAAM,cAAc,oBAAI,IAAG;AAC3B,eAAW,WAAW,CAAC,iBAAiB,eAAe,GAAG;AACxD,cAAQ,YAAY;AACpB,iBAAW,SAAS,UAAU,MAAM,SAAS,OAAO,GAAG;AAErD,cAAM,QAAQ,iBAAiB,MAAM,CAAC,KAAK,EAAE;AAC7C,YAAI,CAAC,SAAS,YAAY,IAAI,KAAK,GAAG;AACpC;QACF;AACA,oBAAY,IAAI,KAAK;AACrB,sBAAc,KAAK,EAAE,OAAO,UAAU,OAAO,OAAO,MAAK,CAAE;MAC7D;IACF;EACF;AACA,SAAO;AACT;AAEA,eAAe,sBACb,SACA,aAAmB;AAEnB,QAAM,eAAe,KAAK,WAAW,OAAO,IAAI,KAAK,QAAQ,OAAO,IAAI,KAAK,QAAQ,aAAa,OAAO;AACzG,MAAI;AACJ,MAAI;AACF,YAAQ,MAAM,GAAG,KAAK,YAAY;EACpC,QAAQ;AACN,WAAO;EACT;AACA,MAAI,CAAC,MAAM,OAAM,GAAI;AACnB,WAAO;EACT;AACA,QAAM,CAAC,sBAAsB,qBAAqB,IAAI,MAAM,QAAQ,IAAI;IACtE,uBAAuB,WAAW;IAClC,uBAAuB,YAAY;GACpC;AACD,MAAI,sBAAsB,sBAAsB,qBAAqB,GAAG;AACtE,UAAM,eAAe,KAAK,SAAS,sBAAsB,qBAAqB;AAC9E,QAAI,CAAC,gBAAgB,aAAa,WAAW,IAAI,KAAK,KAAK,WAAW,YAAY,GAAG;AACnF,aAAO;IACT;AACA,WAAO;MACL,MAAM,gCAAgC,YAAY;MAClD,OAAO;;EAEX;AACA,SAAO;IACL,MAAM,gCAAgC,YAAY;IAClD,OAAO;;AAEX;AAEA,eAAe,wBAAwB,UAAwB,aAAmB;AAChF,QAAM,uBAAuB,IAAI,KAAK,SAAS,SAAS,SAAS,CAAA,GAAI,IAAI,CAAC,UAAU,sBAAsB,OAAO,WAAW,CAAC,CAAC;AAC9H,QAAM,UAAU,oBAAI,IAAG;AAUvB,QAAM,gBAAgB,yBAAyB,0BAA0B,QAAQ,CAAC;AAClF,aAAW,aAAa,eAAe;AACrC,UAAM,WAAW,MAAM,sBAAsB,UAAU,OAAO,WAAW;AACzE,QAAI,CAAC,UAAU;AACb;IACF;AACA,UAAM,MAAM,sBAAsB,UAAU,WAAW;AACvD,UAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;MACnC,MAAM,SAAS;MACf,OAAO,SAAS;MAChB,cAAc,oBAAI,IAAG;MACrB,eAAe,oBAAI,IAAG;MACtB,aAAa;;AAEf,aAAS,aAAa,IAAI,UAAU,KAAK;AACzC,aAAS,cAAc,IAAI,UAAU,KAAK;AAC1C,aAAS,eAAe;AACxB,YAAQ,IAAI,KAAK,QAAQ;EAC3B;AACA,SAAO,CAAC,GAAG,QAAQ,QAAO,CAAE,EACzB,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO;IACtB,MAAM,MAAM;IACZ,OAAO,MAAM;IACb,QAAQ,qBAAqB,IAAI,GAAG,IAAK,mBAA8B;IACvE,cAAc,MAAM;IACpB,eAAe,CAAC,GAAG,MAAM,YAAY,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;IACtF,gBAAgB,CAAC,GAAG,MAAM,aAAa,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;IACxF,EACD,KAAK,CAAC,MAAM,UAAS;AACpB,UAAM,WAAW,KAAK,OAAO,cAAc,MAAM,MAAM;AACvD,QAAI,aAAa;AAAG,aAAO;AAC3B,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AAEzB,WAAO,KAAK,MAAM,cAAc,MAAM,KAAK;EAC7C,CAAC;AACL;AAEO,IAAM,YAAY;EACvB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;AAGF,eAAsB,SAAS,IAAY,SAA8BA,SAAqB;AAC5F,QAAM,SAA+B,MAAM,mBAAmB,IAAI,SAASA,SAAQ;IACjF,aAAa;IACb,IAAI;IACJ,UAAU;IACV,sBAAsB;GACvB;AACD,SAAO,yBAAyB,QAAQ,OAAO;AACjD;AAEA,eAAsB,iBACpB,IACA,SACAA,SAAqB;AAErB,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,UAAU,MAAM,WAAW,QAAQ,IAAI,SAAS,WAAW,SAAS,aAAa,aAAa,cAAc;AAElH,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;EAClE;AACA,QAAM,SAAS,MAAM,gBAAgB,SAAS,EAAE,QAAQ,SAAS,OAAM,CAAE;AACzE,QAAM,aAAa,MAAM,wBAAwB,OAAO,UAAU,QAAQ,IAAG,CAAE;AAC/E,QAAM,oBAAoB,WAAW,OAAO,CAAC,cAAc,UAAU,WAAW,SAAS;AACzF,QAAM,kBAAkB,WAAW,OAAO,CAAC,cAAc,UAAU,WAAW,gBAAgB;AAC9F,QAAM,iBAAiB,QAAQ,UAAU;AACzC,QAAM,OAAO,QAAQ,MAAM,KAAI,KAAM;AAErC,MAAI,CAAC,kBAAkB,kBAAkB,WAAW,GAAG;AACrD,UAAMC,SAAQ,OAAO,SAAS,SAAS,SAAS,CAAA;AAChD,WAAO;MACL,IAAI,QAAQ;MACZ,OAAAA;MACA,SAAS;MACT,OAAO;MACP,OAAOA,OAAM;MACb,iBAAiB,WAAW;MAC5B,eAAe,kBAAkB;MACjC,aAAa;MACb,wBAAwB,gBAAgB;MACxC;MACA,OAAO,CAAA;MACP,kBAAkB;;EAEtB;AAEA,QAAM,SAAS,cAAc,QAAQ,QAAQ,SAAS,cAAc;AACpE,QAAM,iBAA+B,kBAAkB,IAAI,CAAC,eAAe;IACzE,MAAM,UAAU;IAChB,OAAO,UAAU;IACjB;IACA;AACF,QAAM,SAAS,MAAM,WAAW;IAC9B;IACA;IACA;IACA,IAAI;IACJ;IACA,SAAS,QAAQ,WAAW;IAC5B,OAAO,QAAQ;IACf,OAAO,UAAQ;AACb,YAAM,OAAO,CAAC,GAAI,SAAS,SAAS,SAAS,CAAA,CAAG;AAChD,YAAM,uBAAuB,IAAI,IAAI,KAAK,IAAI,CAAC,UAAU,sBAAsB,OAAO,QAAQ,IAAG,CAAE,CAAC,CAAC;AACrG,YAAM,cAA4B,CAAA;AAClC,iBAAW,OAAO,gBAAgB;AAChC,cAAM,cAAc,sBAAsB,KAAK,QAAQ,IAAG,CAAE;AAE5D,YAAI,qBAAqB,IAAI,WAAW,GAAG;AACzC;QACF;AACA,aAAK,KAAK,GAAG;AACb,6BAAqB,IAAI,WAAW;AACpC,oBAAY,KAAK,GAAG;MACtB;AACA,YAAM,UAAU,sBAAsB,IAAI;AAE1C,YAAM,aAAa,QAAQ,eAAe,UAAU,oBAAoB,OAAO;AAC/E,UAAI,WAAW,SAAS,GAAG;AACzB,iBAAS,SAAS,QAAQ;MAC5B,OAAO;AACL,eAAO,SAAS,SAAS;MAC3B;AACA,aAAO;;QAEL,eAAe,YAAY,SAAS,IAAI,CAAC,OAAO,IAAI,CAAA;;QAEpD,UAAU,YAAY,WAAW,eAAe,SAAS,CAAC,mCAAmC,eAAe,SAAS,YAAY,MAAM,EAAE,IAAI,CAAA;;IAEjJ;GACD;AAED,QAAM,QAAQ,OAAO,KAAK,SAAS,CAAA;AACnC,QAAM,oBAAoB,IAAI,IAAI,eAAe,IAAI,CAAC,UAAU,sBAAsB,OAAO,QAAQ,IAAG,CAAE,CAAC,CAAC;AAC5G,QAAM,QAAQ,MAAM,OAAO,CAAC,UAAU,kBAAkB,IAAI,sBAAsB,OAAO,QAAQ,IAAG,CAAE,CAAC,CAAC;AACxG,SAAO;IACL,IAAI,OAAO,KAAK;IAChB;IACA,SAAS,MAAM,SAAS;IACxB,OAAO;IACP,OAAO,MAAM;IACb,iBAAiB,WAAW;IAC5B,eAAe,kBAAkB;IACjC,aAAa,MAAM;IACnB,wBAAwB,gBAAgB;IACxC;IACA;IACA,kBAAkB;;AAEtB;",
+  "names": ["global", "files"]
+}