@unbrained/pm-cli 2026.7.17 → 2026.7.18

package/dist/cli-bundle/chunks/chunk-3QDR6ZLU.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../../../sdk/graph/cache.ts", "../../../../../../../../sdk/relationship-context.ts", "../../../../../../../../sdk/dependencies.ts"],
+  "sourcesContent": ["/**\n * @module sdk/graph/cache\n *\n * Incremental workspace graph cache: fingerprint-keyed reuse of the assembled\n * relationship graph plus memoized analytics results, so long-lived processes\n * (the MCP server, SDK consumers, packages) stop paying the full-workspace\n * assembly and analysis cost on every bounded query. The fingerprint is a\n * deterministic digest of every relationship-relevant item field — id, title,\n * lifecycle status and its terminal classification, hierarchy parent, legacy\n * blocker, and structured dependency edges — so any mutation that could change\n * the graph or its projections invalidates the entry, while unrelated payload\n * churn (bodies, comments) does not enter the digest at all. Every lookup\n * reports hit/miss observability so envelopes can explain their freshness.\n */\nimport { createHash } from \"node:crypto\";\nimport type { Dependency, ItemStatus } from \"../../types/index.js\";\nimport type {\n  WorkspaceRelationshipAssembly,\n  WorkspaceRelationshipItem,\n} from \"./assembly.js\";\n\n/** Default memoized query results retained per workspace entry. */\nconst DEFAULT_MAX_RESULTS_PER_WORKSPACE = 64;\n/** Default workspace entries retained by one cache instance. */\nconst DEFAULT_MAX_WORKSPACES = 8;\n\n/** Cache observability attached to graph result envelopes. */\nexport interface GraphCacheMetadata {\n  /** Truncated workspace graph fingerprint identifying the snapshot answered from. */\n  fingerprint: string;\n  /** Whether the workspace assembly was reused from cache. */\n  assembly: \"hit\" | \"miss\";\n  /** Whether the full query result was reused from cache. */\n  result: \"hit\" | \"miss\";\n}\n\n/** Digest one item's relationship-relevant fields into a deterministic line. */\nfunction fingerprintLine(\n  item: WorkspaceRelationshipItem,\n  isTerminal: (status: ItemStatus) => boolean,\n): string {\n  const dependencies = (item.dependencies ?? [])\n    .map((rawDependency) => {\n      // Public SDK callers may supply legacy or JSON-decoded payloads; mirror\n      // assembly's defensive normalization so the digest tracks what assembly\n      // would actually index.\n      if (typeof rawDependency !== \"object\" || rawDependency === null)\n        return \"\";\n      const dependency = rawDependency as Partial<Dependency>;\n      return `${typeof dependency.kind === \"string\" ? dependency.kind : \"related\"}:${\n        typeof dependency.id === \"string\" ? dependency.id : \"\"\n      }`;\n    })\n    .sort()\n    .join(\",\");\n  return [\n    item.id,\n    item.title,\n    item.status,\n    isTerminal(item.status) ? \"1\" : \"0\",\n    item.parent ?? \"\",\n    item.blocked_by ?? \"\",\n    dependencies,\n  ].join(\"\\u0000\");\n}\n\n/**\n * Compute the deterministic workspace graph fingerprint for one item snapshot.\n * Items are digested in sorted order so storage enumeration order never\n * changes the fingerprint, and the terminal classification of each status is\n * folded in so schema changes to lifecycle semantics invalidate cached\n * assemblies even when raw statuses are unchanged.\n */\nexport function computeWorkspaceGraphFingerprint(\n  items: readonly WorkspaceRelationshipItem[],\n  isTerminal: (status: ItemStatus) => boolean = (status) =>\n    status === \"closed\" || status === \"canceled\",\n): string {\n  const lines = items\n    .filter((item) => typeof item?.id === \"string\" && item.id.trim().length > 0)\n    .map((item) => fingerprintLine(item, isTerminal))\n    .sort();\n  // Separate fields and records with control characters no stored field can\n  // contain unescaped, so adjacent free-text fields can never collide.\n  return createHash(\"sha256\").update(lines.join(\"\\u0001\")).digest(\"hex\");\n}\n\n/** One cached workspace snapshot: its assembly plus memoized query results. */\ninterface WorkspaceGraphCacheEntry {\n  /** Fingerprint of the item snapshot this entry answers for. */\n  fingerprint: string;\n  /** Assembled relationship graph reused across queries. */\n  assembly: WorkspaceRelationshipAssembly;\n  /** Bounded insertion-ordered memo of deterministic query results. */\n  results: Map<string, unknown>;\n}\n\n/** One resolved cache lookup bound to a workspace snapshot. */\nexport interface WorkspaceGraphCacheLookup {\n  /** The (possibly reused) workspace assembly. */\n  assembly: WorkspaceRelationshipAssembly;\n  /** Whether the assembly came from cache instead of being rebuilt. */\n  assemblyReused: boolean;\n  /** Full fingerprint of the snapshot this lookup is bound to. */\n  fingerprint: string;\n  /**\n   * Memoize one deterministic query result under this snapshot. On a miss the\n   * freshly computed value is returned as-is while an independent clone is\n   * stored, so mutating a miss result never corrupts the cache; every hit\n   * returns a fresh clone of the stored entry. Callers must not rely on the\n   * miss and hit paths returning the same object identity.\n   */\n  memoize<T>(queryKey: string, compute: () => T): { value: T; reused: boolean };\n}\n\n/** Validate one optional positive-integer cache bound, applying its default. */\nfunction requirePositiveCacheBound(\n  name: string,\n  value: number | undefined,\n  fallback: number,\n): number {\n  const bound = value ?? fallback;\n  if (!Number.isInteger(bound) || bound < 1)\n    throw new TypeError(`Invalid ${name} bound: ${String(value)}`);\n  return bound;\n}\n\n/**\n * Fingerprint-keyed cache of workspace relationship assemblies and memoized\n * deterministic query results. One entry is retained per workspace key; a\n * changed fingerprint atomically replaces the entry and drops its memoized\n * results. Memoized values are structured-cloned on store and on read so\n * neither the producer nor any consumer can mutate cached state.\n */\nexport class WorkspaceGraphCache {\n  readonly #entries = new Map<string, WorkspaceGraphCacheEntry>();\n  readonly #maxResultsPerWorkspace: number;\n  readonly #maxWorkspaces: number;\n\n  /** Create a cache, optionally bounding workspaces and memoized results. */\n  public constructor(\n    options: { maxResultsPerWorkspace?: number; maxWorkspaces?: number } = {},\n  ) {\n    this.#maxResultsPerWorkspace = requirePositiveCacheBound(\n      \"maxResultsPerWorkspace\",\n      options.maxResultsPerWorkspace,\n      DEFAULT_MAX_RESULTS_PER_WORKSPACE,\n    );\n    this.#maxWorkspaces = requirePositiveCacheBound(\n      \"maxWorkspaces\",\n      options.maxWorkspaces,\n      DEFAULT_MAX_WORKSPACES,\n    );\n  }\n\n  /**\n   * Resolve the cached assembly for one workspace key and fingerprint,\n   * building and storing it on miss. The returned lookup exposes snapshot-\n   * scoped memoization for query results derived from the same assembly.\n   */\n  public lookup(\n    key: string,\n    fingerprint: string,\n    build: () => WorkspaceRelationshipAssembly,\n  ): WorkspaceGraphCacheLookup {\n    let entry = this.#entries.get(key);\n    let assemblyReused = true;\n    if (entry === undefined || entry.fingerprint !== fingerprint) {\n      entry = { fingerprint, assembly: build(), results: new Map() };\n      assemblyReused = false;\n      if (\n        !this.#entries.has(key) &&\n        this.#entries.size >= this.#maxWorkspaces\n      ) {\n        // Evict the least recently used workspace; every lookup refreshes\n        // recency below, so insertion order tracks use order.\n        this.#entries.delete(this.#entries.keys().next().value!);\n      }\n    }\n    // Delete-and-reinsert keeps Map insertion order equal to recency order,\n    // making workspace eviction genuinely least-recently-used.\n    this.#entries.delete(key);\n    this.#entries.set(key, entry);\n    const resolved = entry;\n    const maxResults = this.#maxResultsPerWorkspace;\n    return {\n      assembly: resolved.assembly,\n      assemblyReused,\n      fingerprint,\n      memoize<T>(\n        queryKey: string,\n        compute: () => T,\n      ): { value: T; reused: boolean } {\n        const cached = resolved.results.get(queryKey);\n        if (cached !== undefined || resolved.results.has(queryKey)) {\n          // Refresh recency so eviction below is least-recently-used rather\n          // than first-inserted.\n          resolved.results.delete(queryKey);\n          resolved.results.set(queryKey, cached);\n          return { value: structuredClone(cached) as T, reused: true };\n        }\n        const value = compute();\n        if (resolved.results.size >= maxResults) {\n          // Evict the oldest memoized result; Map preserves insertion order.\n          resolved.results.delete(resolved.results.keys().next().value!);\n        }\n        resolved.results.set(queryKey, structuredClone(value));\n        return { value, reused: false };\n      },\n    };\n  }\n\n  /** Drop every cached workspace entry and memoized result. */\n  public clear(): void {\n    this.#entries.clear();\n  }\n}\n\n/** Process-wide shared cache used by the CLI/MCP graph and deps adapters. */\nconst sharedCache = new WorkspaceGraphCache();\n\n/** Return the process-wide shared workspace graph cache. */\nexport function workspaceGraphCache(): WorkspaceGraphCache {\n  return sharedCache;\n}\n\n/** Reset the process-wide shared workspace graph cache (tests and long-lived hosts). */\nexport function resetWorkspaceGraphCache(): void {\n  sharedCache.clear();\n}\n", "/**\n * @module sdk/relationship-context\n *\n * Assembles one explainable, cursorable, token-bounded relationship context\n * packet for agents, custom tools, and presentation-layer adapters.\n */\nimport {\n  createQueryFingerprint,\n  encodeQueryCursor,\n  resolveQueryCursorStart,\n} from \"./pagination.js\";\nimport {\n  RelationshipGraph,\n  RelationshipKindRegistry,\n  createRelationshipKindRegistry,\n  type RelationshipEdge,\n  type RelationshipTraversalDirection,\n} from \"./relationships.js\";\n\n/** Semantic family explaining why a node or edge participates in graph context. */\nexport type RelationshipContextRole =\n  | \"prerequisite\"\n  | \"dependent\"\n  | \"ancestor\"\n  | \"descendant\"\n  | \"provenance\"\n  | \"related\";\n\n/**\n * Completeness marker for one graph-context packet.\n *\n * The exact in-memory kernel only produces \"complete\" and \"truncated\" today;\n * the remaining values are reserved so index-backed, sampled, or policy-redacted\n * providers can report their result quality through the same contract.\n */\nexport type RelationshipContextCompleteness =\n  | \"complete\"\n  | \"truncated\"\n  | \"sampled\"\n  | \"approximate\"\n  | \"stale_index\"\n  | \"redacted\";\n\n/** Caller-owned compact node details joined into graph context. */\nexport interface RelationshipContextNodeDetails {\n  /** Stable graph node identifier. */\n  id: string;\n  /** Optional display title. */\n  title?: string;\n  /** Optional lifecycle status. */\n  status?: string;\n  /** Optional evidence pointers such as files, tests, or history ids. */\n  evidence?: readonly string[];\n}\n\n/** One selected graph-context node with explainable inclusion. */\nexport interface RelationshipContextNode extends RelationshipContextNodeDetails {\n  /** Shortest bounded distance from the root. */\n  distance: number;\n  /** Semantic family of this node relative to its discovery counterpart. */\n  role: RelationshipContextRole;\n  /** Node through which bounded traversal first discovered this node. */\n  via: string;\n  /** Concise deterministic reasons the node was selected. */\n  reasons: string[];\n}\n\n/** Counts-first packet overview served before any row payload. */\nexport interface RelationshipContextSummary {\n  /** Root node identifier. */\n  rootId: string;\n  /** Root lifecycle status when the caller supplied node details. */\n  rootStatus?: string;\n  /** Root-incident edge counts per semantic family under the active filters. */\n  directEdges: Record<RelationshipContextRole, number>;\n  /** Total root-incident edges under the active filters. */\n  directTotal: number;\n  /** Nodes discovered by the bounded traversal, excluding the root. */\n  discoveredNodes: number;\n  /** Nodes returned in this page. */\n  returnedNodes: number;\n  /** Edges returned in this page. */\n  returnedEdges: number;\n  /** Discovered nodes omitted by pagination, node, or token bounds. */\n  omittedNodes: number;\n  /** Qualifying edges omitted by edge or token bounds. */\n  omittedEdges: number;\n  /** Root evidence pointers promoted into the packet. */\n  evidenceCount: number;\n  /** Whether a continuation cursor is available. */\n  hasMore: boolean;\n}\n\n/** Controls for bounded graph-context assembly. */\nexport interface RelationshipContextOptions {\n  /** Traversal direction relative to each visited node. */\n  direction?: RelationshipTraversalDirection;\n  /** Optional registered kind filter. */\n  kinds?: readonly string[];\n  /** Maximum traversal depth. */\n  maxDepth?: number;\n  /** Maximum nodes returned in this page. */\n  nodeLimit?: number;\n  /** Maximum edges returned in this page. */\n  edgeLimit?: number;\n  /** Maximum estimated output tokens charged to rows and edges. */\n  tokenBudget?: number;\n  /** Opaque continuation from an equivalent query. */\n  cursor?: string;\n  /** Registry used to explain custom relationship semantics. */\n  registry?: RelationshipKindRegistry;\n  /** Abort signal checked during traversal. */\n  signal?: AbortSignal;\n}\n\n/** Explainable graph context packet. */\nexport interface RelationshipContextResult {\n  /** Root node details. */\n  root: RelationshipContextNodeDetails;\n  /** Counts-first overview of the packet. */\n  summary: RelationshipContextSummary;\n  /** Bounded related-node page. */\n  nodes: RelationshipContextNode[];\n  /** Bounded edges whose endpoints are present in the packet. */\n  edges: RelationshipEdge[];\n  /** Root evidence pointers promoted for immediate consumption. */\n  evidence: string[];\n  /** Completeness, continuation, and cost envelope. */\n  meta: {\n    exact: true;\n    truncated: boolean;\n    completeness: RelationshipContextCompleteness;\n    nodeLimit: number;\n    edgeLimit: number;\n    tokenBudget: number;\n    usedTokens: number;\n    visitedNodes: number;\n    inspectedEdges: number;\n    omittedNodes: number;\n    omittedEdges: number;\n    nextCursor?: string;\n  };\n}\n\ninterface DiscoveredNode {\n  id: string;\n  distance: number;\n  via: string;\n  role: RelationshipContextRole;\n}\n\n/** Deterministic priority used when one node matches several semantic families. */\nconst RELATIONSHIP_CONTEXT_ROLE_PRIORITY: readonly RelationshipContextRole[] = [\n  \"prerequisite\",\n  \"dependent\",\n  \"ancestor\",\n  \"descendant\",\n  \"provenance\",\n  \"related\",\n];\n\nconst tokenEncoder = new TextEncoder();\n\nfunction positiveInteger(\n  value: number | undefined,\n  fallback: number,\n  field: string,\n): number {\n  const resolved = value ?? fallback;\n  if (!Number.isInteger(resolved) || resolved < 1)\n    throw new TypeError(`Relationship context ${field} must be positive`);\n  return resolved;\n}\n\nfunction estimateTokens(value: unknown): number {\n  return Math.max(\n    1,\n    Math.ceil(tokenEncoder.encode(JSON.stringify(value)).byteLength / 4),\n  );\n}\n\nfunction explainDirectEdge(\n  edge: RelationshipEdge,\n  node: string,\n  registry: RelationshipKindRegistry,\n): RelationshipContextRole {\n  const definition = registry.resolve(edge.kind);\n  if (definition?.ordering) {\n    // Legacy and JSON-parsed definitions may predate explicit precedence.\n    const sourceFirst =\n      (definition.precedence ?? \"source_before_target\") ===\n      \"source_before_target\";\n    const before = sourceFirst ? edge.source : edge.target;\n    return node === before ? \"prerequisite\" : \"dependent\";\n  }\n  if (definition?.hierarchy) {\n    // Legacy and JSON-parsed definitions may predate explicit hierarchy direction.\n    const sourceIsParent =\n      (definition.hierarchyDirection ?? \"source_parent\") === \"source_parent\";\n    const parent = sourceIsParent ? edge.source : edge.target;\n    return node === parent ? \"ancestor\" : \"descendant\";\n  }\n  if (edge.kind === \"discovered_from\" || edge.kind === \"incident_from\")\n    return \"provenance\";\n  return \"related\";\n}\n\nfunction directReasons(\n  rootEdges: readonly RelationshipEdge[],\n  root: string,\n  node: string,\n  registry: RelationshipKindRegistry,\n): RelationshipContextRole[] {\n  const reasons = rootEdges\n    .filter(\n      (edge) =>\n        (edge.source === root && edge.target === node) ||\n        (edge.target === root && edge.source === node),\n    )\n    .map((edge) => explainDirectEdge(edge, node, registry));\n  return [...new Set(reasons)].sort();\n}\n\n/** Pick the deterministic primary family when a node matches several. */\nfunction primaryRole(\n  roles: readonly RelationshipContextRole[],\n): RelationshipContextRole {\n  // Callers only pass non-empty classification sets drawn from the fixed\n  // family list, so a priority match always exists.\n  return RELATIONSHIP_CONTEXT_ROLE_PRIORITY.find((role) =>\n    roles.includes(role),\n  )!;\n}\n\nfunction discoverNodes(\n  graph: RelationshipGraph,\n  root: string,\n  registry: RelationshipKindRegistry,\n  options: RelationshipContextOptions,\n): {\n  rows: DiscoveredNode[];\n  visitedNodes: number;\n  inspectedEdges: number;\n  depthTruncated: boolean;\n} {\n  const direction = options.direction ?? \"both\";\n  const maxDepth = options.maxDepth ?? 3;\n  if (!Number.isInteger(maxDepth) || maxDepth < 0)\n    throw new TypeError(\"Relationship context maxDepth must be non-negative\");\n  const seen = new Set([root]);\n  const queue: { id: string; distance: number }[] = [\n    { id: root, distance: 0 },\n  ];\n  const rows: DiscoveredNode[] = [];\n  let inspectedEdges = 0;\n  let depthTruncated = false;\n  for (let index = 0; index < queue.length; index += 1) {\n    options.signal?.throwIfAborted();\n    const current = queue[index]!;\n    if (current.distance >= maxDepth && depthTruncated) continue;\n    const adjacent = graph.neighborEdges(current.id, {\n      direction,\n      kinds: options.kinds,\n      signal: options.signal,\n    });\n    inspectedEdges += adjacent.meta.inspectedEdges;\n    if (current.distance >= maxDepth) {\n      if (adjacent.value.some((row) => !seen.has(row.id))) depthTruncated = true;\n      continue;\n    }\n    for (const { id, edge } of adjacent.value) {\n      if (seen.has(id)) continue;\n      seen.add(id);\n      const row = {\n        id,\n        distance: current.distance + 1,\n        via: current.id,\n        role: explainDirectEdge(edge, id, registry),\n      };\n      rows.push(row);\n      queue.push(row);\n    }\n  }\n  rows.sort(\n    (left, right) =>\n      left.distance - right.distance || left.id.localeCompare(right.id),\n  );\n  return {\n    rows,\n    visitedNodes: queue.length,\n    inspectedEdges,\n    depthTruncated,\n  };\n}\n\n/** Count root-incident edges per semantic family under the active filters. */\nfunction summarizeDirectEdges(\n  graph: RelationshipGraph,\n  root: string,\n  registry: RelationshipKindRegistry,\n  options: RelationshipContextOptions,\n): {\n  directEdges: Record<RelationshipContextRole, number>;\n  directTotal: number;\n  rootEdges: RelationshipEdge[];\n} {\n  const directEdges: Record<RelationshipContextRole, number> = {\n    prerequisite: 0,\n    dependent: 0,\n    ancestor: 0,\n    descendant: 0,\n    provenance: 0,\n    related: 0,\n  };\n  const rows = graph.neighborEdges(root, {\n    direction: options.direction ?? \"both\",\n    kinds: options.kinds,\n    signal: options.signal,\n  }).value;\n  for (const { id, edge } of rows)\n    directEdges[explainDirectEdge(edge, id, registry)] += 1;\n  return {\n    directEdges,\n    directTotal: rows.length,\n    rootEdges: rows.map(({ edge }) => edge),\n  };\n}\n\nfunction selectContextNodes(params: {\n  candidates: readonly DiscoveredNode[];\n  details: ReadonlyMap<string, RelationshipContextNodeDetails>;\n  rootEdges: readonly RelationshipEdge[];\n  rootId: string;\n  registry: RelationshipKindRegistry;\n  nodeLimit: number;\n  tokenBudget: number;\n  initialTokens: number;\n}): { nodes: RelationshipContextNode[]; usedTokens: number } {\n  const nodes: RelationshipContextNode[] = [];\n  let usedTokens = params.initialTokens;\n  for (const candidate of params.candidates) {\n    if (nodes.length >= params.nodeLimit) break;\n    const direct =\n      candidate.distance === 1\n        ? directReasons(\n            params.rootEdges,\n            params.rootId,\n            candidate.id,\n            params.registry,\n          )\n        : [];\n    const node: RelationshipContextNode = {\n      ...(params.details.get(candidate.id) ?? { id: candidate.id }),\n      distance: candidate.distance,\n      role: direct.length > 0 ? primaryRole(direct) : candidate.role,\n      via: candidate.via,\n      reasons:\n        direct.length > 0\n          ? direct\n          : [\n              `${candidate.role} via ${candidate.via} (depth ${candidate.distance})`,\n            ],\n    };\n    const cost = estimateTokens(node);\n    if (usedTokens + cost > params.tokenBudget) break;\n    nodes.push(node);\n    usedTokens += cost;\n  }\n  if (params.candidates.length > 0 && nodes.length === 0)\n    throw new TypeError(\"Relationship context tokenBudget cannot fit one node\");\n  return { nodes, usedTokens };\n}\n\nfunction selectContextEdges(params: {\n  graph: RelationshipGraph;\n  included: ReadonlySet<string>;\n  options: RelationshipContextOptions;\n  registry: RelationshipKindRegistry;\n  edgeLimit: number;\n  tokenBudget: number;\n  initialTokens: number;\n}): {\n  edges: RelationshipEdge[];\n  usedTokens: number;\n  candidateCount: number;\n} {\n  const kinds = params.options.kinds\n    ? new Set(\n        params.options.kinds.map((kind) => params.registry.require(kind).kind),\n      )\n    : undefined;\n  const candidates = params.graph\n    .edges()\n    .filter(\n      (edge) => {\n        if (\n          !params.included.has(edge.source) ||\n          !params.included.has(edge.target)\n        )\n          return false;\n        if (kinds === undefined || kinds.has(edge.kind)) return true;\n        const inverse = params.registry.resolve(edge.kind)?.inverse;\n        return inverse !== undefined && kinds.has(inverse);\n      },\n    );\n  const edges: RelationshipEdge[] = [];\n  let usedTokens = params.initialTokens;\n  for (const edge of candidates) {\n    if (edges.length >= params.edgeLimit) break;\n    const cost = estimateTokens(edge);\n    if (usedTokens + cost > params.tokenBudget) break;\n    edges.push(edge);\n    usedTokens += cost;\n  }\n  return { edges, usedTokens, candidateCount: candidates.length };\n}\n\n/** Build one deterministic bounded graph-context packet with continuation. */\nexport function buildRelationshipContext(\n  graph: RelationshipGraph,\n  rootId: string,\n  details: readonly RelationshipContextNodeDetails[],\n  options: RelationshipContextOptions = {},\n): RelationshipContextResult {\n  if (!graph.nodes().includes(rootId))\n    throw new TypeError(`Relationship node not found: ${rootId}`);\n  const nodeLimit = positiveInteger(options.nodeLimit, 20, \"nodeLimit\");\n  const edgeLimit = positiveInteger(options.edgeLimit, 40, \"edgeLimit\");\n  const tokenBudget = positiveInteger(options.tokenBudget, 1200, \"tokenBudget\");\n  const registry = options.registry ?? createRelationshipKindRegistry();\n  const byId = new Map(details.map((detail) => [detail.id, detail]));\n  const rootDetails: RelationshipContextNodeDetails = byId.get(rootId) ?? {\n    id: rootId,\n  };\n  const { evidence: rootEvidence = [], ...root } = rootDetails;\n  const evidence = [...rootEvidence];\n  const discovery = discoverNodes(graph, rootId, registry, options);\n  const { rootEdges, ...directSummary } = summarizeDirectEdges(\n    graph,\n    rootId,\n    registry,\n    options,\n  );\n  const fingerprint = createQueryFingerprint(\"relationship-context\", {\n    rootId,\n    direction: options.direction ?? \"both\",\n    kinds: [...(options.kinds ?? [])].sort(),\n    maxDepth: options.maxDepth ?? 3,\n  });\n  const pageStart = resolveQueryCursorStart(\n    discovery.rows,\n    options.cursor,\n    fingerprint,\n    ({ id }) => id,\n  );\n  const candidates = discovery.rows.slice(pageStart);\n  const initialTokens = estimateTokens(root) + estimateTokens(evidence);\n  if (initialTokens > tokenBudget)\n    throw new TypeError(\n      \"Relationship context tokenBudget cannot fit root and evidence\",\n    );\n  const nodeSelection = selectContextNodes({\n    candidates,\n    details: byId,\n    rootEdges,\n    rootId,\n    registry,\n    nodeLimit,\n    tokenBudget,\n    initialTokens,\n  });\n  const { nodes } = nodeSelection;\n\n  const included = new Set([rootId, ...nodes.map(({ id }) => id)]);\n  const edgeSelection = selectContextEdges({\n    graph,\n    included,\n    options,\n    registry,\n    edgeLimit,\n    tokenBudget,\n    initialTokens: nodeSelection.usedTokens,\n  });\n  const { edges, usedTokens } = edgeSelection;\n\n  const consumed = pageStart + nodes.length;\n  const hasMoreNodes = consumed < discovery.rows.length;\n  const lastNode = nodes.at(-1);\n  const omittedEdges = edgeSelection.candidateCount - edges.length;\n  const truncated =\n    discovery.depthTruncated || hasMoreNodes || omittedEdges > 0;\n  const summary: RelationshipContextSummary = {\n    rootId,\n    ...(root.status === undefined ? {} : { rootStatus: root.status }),\n    ...directSummary,\n    discoveredNodes: discovery.rows.length,\n    returnedNodes: nodes.length,\n    returnedEdges: edges.length,\n    omittedNodes: discovery.rows.length - consumed,\n    omittedEdges,\n    evidenceCount: evidence.length,\n    hasMore: hasMoreNodes,\n  };\n  return {\n    root,\n    summary,\n    nodes,\n    edges,\n    evidence,\n    meta: {\n      exact: true,\n      truncated,\n      completeness: truncated ? \"truncated\" : \"complete\",\n      nodeLimit,\n      edgeLimit,\n      tokenBudget,\n      usedTokens,\n      visitedNodes: discovery.visitedNodes,\n      inspectedEdges: discovery.inspectedEdges,\n      omittedNodes: discovery.rows.length - consumed,\n      omittedEdges,\n      ...(hasMoreNodes && lastNode\n        ? {\n            nextCursor: encodeQueryCursor(\n              fingerprint,\n              lastNode.id,\n              consumed - 1,\n            ),\n          }\n        : {}),\n    },\n  };\n}\n", "/**\n * @module sdk/dependencies\n *\n * Implements the pm deps command surface and its agent-facing runtime behavior.\n */\nimport { getActiveExtensionRegistrations } from \"../core/extensions/index.js\";\nimport { pathExists } from \"../core/fs/fs-utils.js\";\nimport { resolveItemTypeRegistry } from \"../core/item/type-registry.js\";\nimport { isTerminalStatus } from \"../core/item/status.js\";\nimport { resolveRuntimeStatusRegistry } from \"../core/schema/runtime-schema.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 {\n  listAllItemMetadataLight,\n  locateItem,\n  readLocatedItem,\n} from \"../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../core/store/paths.js\";\nimport { readSettings } from \"../core/store/settings.js\";\nimport type {\n  Dependency,\n  ItemMetadata,\n  ItemStatus,\n  ItemType,\n} from \"../types/index.js\";\nimport {\n  assembleWorkspaceRelationshipGraph,\n  collectDanglingDependencyReferences,\n  type DanglingDependencyReference,\n  type WorkspaceRelationshipAssembly,\n} from \"./graph/assembly.js\";\nimport {\n  computeWorkspaceGraphFingerprint,\n  workspaceGraphCache,\n} from \"./graph/cache.js\";\nimport {\n  buildRelationshipContext,\n  type RelationshipContextOptions,\n  type RelationshipContextResult,\n} from \"./relationship-context.js\";\nimport { createRelationshipKindRegistry } from \"./relationships.js\";\n\n/** Supported values accepted by the deps format contract. */\nexport const DEPS_FORMAT_VALUES = [\"tree\", \"graph\", \"context\"] as const;\n/** Restricts deps format values accepted by command, SDK, and storage contracts. */\nexport type DepsFormat = (typeof DEPS_FORMAT_VALUES)[number];\n/** Supported values accepted by the deps collapse contract. */\nexport const DEPS_COLLAPSE_VALUES = [\"none\", \"repeated\"] as const;\n/** Restricts deps collapse mode values accepted by command, SDK, and storage contracts. */\nexport type DepsCollapseMode = (typeof DEPS_COLLAPSE_VALUES)[number];\n/** Supported values accepted by the deps graph-context direction contract. */\nexport const DEPS_DIRECTION_VALUES = [\"outgoing\", \"incoming\", \"both\"] as const;\n/** Restricts deps traversal-direction values accepted by command, SDK, and storage contracts. */\nexport type DepsDirection = (typeof DEPS_DIRECTION_VALUES)[number];\n\n/** Documents the deps command options payload exchanged by command, SDK, and package integrations. */\nexport interface DepsCommandOptions {\n  /** Value that configures or reports format for this contract. */\n  format?: string;\n  /** Value that configures or reports max depth for this contract. */\n  maxDepth?: string | number;\n  /** Value that configures or reports collapse for this contract. */\n  collapse?: string;\n  /** Value that configures or reports summary for this contract. */\n  summary?: boolean;\n  /** Maximum graph-context nodes returned. */\n  nodeLimit?: string | number;\n  /** Maximum graph-context edges and enumerated missing-reference rows returned. */\n  edgeLimit?: string | number;\n  /** Maximum estimated graph-context output tokens. */\n  tokenBudget?: string | number;\n  /** Opaque continuation cursor for graph-context output. */\n  cursor?: string;\n  /** Graph-context traversal direction relative to each visited node. */\n  direction?: string;\n  /** Registered relationship kinds narrowing graph-context traversal. */\n  kind?: string | string[];\n}\n\ninterface IndexedItem {\n  id: string;\n  title: string;\n  type: ItemType;\n  status: ItemStatus;\n  dependencies: IndexedDependency[];\n}\n\ninterface IndexedDependency {\n  id: string;\n  kind: string;\n}\n\n/** Documents the deps tree node payload exchanged by command, SDK, and package integrations. */\nexport interface DepsTreeNode {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports title for this contract. */\n  title?: string;\n  /** Schema type that determines the shape and validation rules for this value. */\n  type?: ItemType;\n  /** Lifecycle state reported for status. */\n  status?: ItemStatus;\n  /** Value that configures or reports via for this contract. */\n  via?: string;\n  /** Value that configures or reports missing for this contract. */\n  missing: boolean;\n  /** Value that configures or reports cycle for this contract. */\n  cycle: boolean;\n  /** Value that configures or reports truncated for this contract. */\n  truncated?: boolean;\n  /** Value that configures or reports collapsed for this contract. */\n  collapsed?: boolean;\n  /** Value that configures or reports dependencies for this contract. */\n  dependencies: DepsTreeNode[];\n}\n\n/** Documents the deps graph node payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphNode {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports title for this contract. */\n  title?: string;\n  /** Schema type that determines the shape and validation rules for this value. */\n  type?: ItemType;\n  /** Lifecycle state reported for status. */\n  status?: ItemStatus;\n  /** Value that configures or reports missing for this contract. */\n  missing: boolean;\n}\n\n/** Documents the deps graph edge payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphEdge {\n  /** Value that configures or reports from for this contract. */\n  from: string;\n  /** Value that configures or reports to for this contract. */\n  to: string;\n  /** Value that configures or reports kind for this contract. */\n  kind: string;\n}\n\n/** Documents the deps graph result payload exchanged by command, SDK, and package integrations. */\nexport interface DepsGraphResult {\n  /** Value that configures or reports root id for this contract. */\n  root_id: string;\n  /** Value that configures or reports nodes for this contract. */\n  nodes: DepsGraphNode[];\n  /** Value that configures or reports edges for this contract. */\n  edges: DepsGraphEdge[];\n  /** Value that configures or reports missing ids for this contract. */\n  missing_ids: string[];\n}\n\n/** Documents the deps result payload exchanged by command, SDK, and package integrations. */\nexport interface DepsResult {\n  /** Stable identifier used to reference this record across commands and storage. */\n  id: string;\n  /** Value that configures or reports format for this contract. */\n  format: DepsFormat;\n  /** Number of node entries represented by this result. */\n  node_count: number;\n  /** Number of edge entries represented by this result. */\n  edge_count: number;\n  /**\n   * Number of missing entries represented by this result.\n   *\n   * Tree and graph formats count missing nodes encountered while walking\n   * dependency edges; context format counts missing nodes reachable within the\n   * same bounded traversal (direction, kinds, and depth) that produced the\n   * packet, independent of node or token pagination, so the two formats agree\n   * for equal traversal parameters over the dependency edge family.\n   */\n  missing_count: number;\n  /** Traversal scope documenting the missing_count semantics for context format. */\n  missing_scope?: \"traversal\";\n  /** Total dangling references declared into the traversed missing nodes. */\n  missing_reference_count?: number;\n  /** Bounded enumeration of dangling references, capped by the context edge limit. */\n  missing_references?: DanglingDependencyReference[];\n  /** Value that configures or reports tree for this contract. */\n  tree?: DepsTreeNode;\n  /** Value that configures or reports graph for this contract. */\n  graph?: DepsGraphResult;\n  /** Explainable bounded graph-context projection. */\n  context?: RelationshipContextResult;\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(\n    `Invalid --format value \"${raw}\". Use \"tree\", \"graph\", or \"context\".`,\n    EXIT_CODE.USAGE,\n  );\n}\n\n/** Parse one positive-integer graph bound, failing fast with the offending flag name. */\nexport function parsePositiveInteger(raw: string | number | undefined, flag: string): number | undefined {\n  if (raw === undefined) return undefined;\n  const value = typeof raw === \"number\" ? raw : Number(raw.trim());\n  if (!Number.isInteger(value) || value < 1)\n    throw new PmCliError(`Invalid --${flag} value \"${raw}\". Use a positive integer.`, EXIT_CODE.USAGE);\n  return value;\n}\n\n/** Parse the shared non-negative --max-depth traversal bound. */\nexport function 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(\n      `Invalid --max-depth value \"${raw}\". Use a non-negative integer.`,\n      EXIT_CODE.USAGE,\n    );\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(\n    `Invalid --collapse value \"${raw}\". Use \"none\" or \"repeated\".`,\n    EXIT_CODE.USAGE,\n  );\n}\n\n/** Parse the shared graph traversal --direction value, defaulting to \"both\". */\nexport function parseDirection(raw: string | undefined): DepsDirection {\n  const candidate = raw?.trim().toLowerCase() ?? \"both\";\n  if ((DEPS_DIRECTION_VALUES as readonly string[]).includes(candidate)) {\n    return candidate as DepsDirection;\n  }\n  throw new PmCliError(\n    `Invalid --direction value \"${raw}\". Use \"outgoing\", \"incoming\", or \"both\".`,\n    EXIT_CODE.USAGE,\n  );\n}\n\n/**\n * Normalize repeatable and comma-separated --kind values against the built-in\n * relationship ontology, failing fast on unknown kinds instead of silently\n * matching nothing (the multi-value filter-grammar trap tracked by pm-gknu).\n */\nexport function parseKinds(raw: string | string[] | undefined): string[] | undefined {\n  if (raw === undefined) return undefined;\n  const registry = createRelationshipKindRegistry();\n  const values = (Array.isArray(raw) ? raw : [raw])\n    .flatMap((value) => value.split(\",\"))\n    .map((value) => value.trim())\n    .filter((value) => value.length > 0);\n  if (values.length === 0) return undefined;\n  const kinds = new Set<string>();\n  for (const value of values) {\n    const definition = registry.resolve(value);\n    if (!definition) {\n      const known = registry\n        .list()\n        .map((entry) => entry.kind)\n        .join(\", \");\n      throw new PmCliError(\n        `Invalid --kind value \"${value}\". Registered kinds: ${known}.`,\n        EXIT_CODE.USAGE,\n      );\n    }\n    kinds.add(definition.kind);\n  }\n  return [...kinds].sort();\n}\n\nfunction normalizeDependencies(\n  dependencies: Dependency[] | undefined,\n): IndexedDependency[] {\n  if (!dependencies || dependencies.length === 0) {\n    return [];\n  }\n  const sorted = dependencies.map(({ id, kind }) => ({\n    id: id.trim(),\n    kind: kind.trim().toLowerCase(),\n  })).sort((left, right) => {\n    const byKind = left.kind.localeCompare(right.kind);\n    if (byKind !== 0) return byKind;\n    return left.id.localeCompare(right.id);\n  });\n  const deduped = new Map<string, IndexedDependency>();\n  for (const dependency of sorted) {\n    const key = `${dependency.kind.toLowerCase()}::${dependency.id.toLowerCase()}`;\n    if (!deduped.has(key)) {\n      deduped.set(key, { id: dependency.id, kind: dependency.kind });\n    }\n  }\n  return [...deduped.values()];\n}\n\nfunction toIndexedItem(item: ItemMetadata): 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 lookupId = id.trim().toLowerCase();\n  const item = index.get(lookupId);\n  const baseNode: DepsTreeNode = {\n    id: item?.id ?? id,\n    title: item?.title,\n    type: item?.type,\n    status: item?.status,\n    via,\n    missing: !item,\n    cycle: lineage.has(lookupId),\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(lookupId)) {\n    baseNode.collapsed = true;\n    return baseNode;\n  }\n  if (collapse === \"repeated\") {\n    expanded.add(lookupId);\n  }\n  const nextLineage = new Set(lineage);\n  nextLineage.add(lookupId);\n  baseNode.dependencies = item.dependencies.map((dependency) =>\n    toTreeNode(\n      dependency.id,\n      index,\n      nextLineage,\n      maxDepth,\n      collapse,\n      expanded,\n      depth + 1,\n      dependency.kind,\n    ),\n  );\n  return baseNode;\n}\n\nfunction mergeGraphNode(\n  existing: DepsGraphNode | undefined,\n  candidate: DepsGraphNode,\n): 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) =>\n    left.id.localeCompare(right.id),\n  );\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\n    .filter((node) => node.missing)\n    .map((node) => node.id);\n  return {\n    root_id: root.id,\n    nodes,\n    edges,\n    missing_ids: missingIds,\n  };\n}\n\n/** Count a dependency result without allocating its potentially exponential tree payload. */\nfunction countDependencyGraph(\n  rootId: string,\n  index: Map<string, IndexedItem>,\n  maxDepth: number | undefined,\n): Pick<DepsResult, \"node_count\" | \"edge_count\" | \"missing_count\"> {\n  const nodeIds = new Set<string>();\n  const edgeKeys = new Set<string>();\n  const missingIds = new Set<string>();\n  const expanded = new Set<string>();\n  const pending = [{ id: rootId, depth: 0 }];\n  let pendingIndex = 0;\n  while (pendingIndex < pending.length) {\n    const current = pending[pendingIndex++]!;\n    const lookupId = current.id.trim().toLowerCase();\n    nodeIds.add(lookupId);\n    const item = index.get(lookupId);\n    if (!item) {\n      missingIds.add(lookupId);\n      continue;\n    }\n    if (maxDepth !== undefined && current.depth >= maxDepth) {\n      continue;\n    }\n    if (expanded.has(lookupId)) {\n      continue;\n    }\n    expanded.add(lookupId);\n    for (const dependency of item.dependencies) {\n      edgeKeys.add(\n        `${lookupId}::${dependency.id.trim().toLowerCase()}::${dependency.kind}`,\n      );\n      pending.push({ id: dependency.id, depth: current.depth + 1 });\n    }\n  }\n  return {\n    node_count: nodeIds.size,\n    edge_count: edgeKeys.size,\n    missing_count: missingIds.size,\n  };\n}\n\n/** Options subset consumed by the deps graph-context projection. */\ntype DepsContextOptions = Pick<\n  DepsCommandOptions,\n  | \"maxDepth\"\n  | \"nodeLimit\"\n  | \"edgeLimit\"\n  | \"tokenBudget\"\n  | \"cursor\"\n  | \"direction\"\n  | \"kind\"\n>;\n\n/** Parse CLI-compatible deps context options once for packet and closure parity. */\nfunction parseDepsContextOptions(\n  options: DepsContextOptions,\n): RelationshipContextOptions {\n  const maxDepth = parseMaxDepth(options.maxDepth);\n  const nodeLimit = parsePositiveInteger(options.nodeLimit, \"node-limit\");\n  const edgeLimit = parsePositiveInteger(options.edgeLimit, \"edge-limit\");\n  const tokenBudget = parsePositiveInteger(options.tokenBudget, \"token-budget\");\n  const kinds = parseKinds(options.kind);\n  return {\n    direction: parseDirection(options.direction),\n    ...(kinds === undefined ? {} : { kinds }),\n    ...(maxDepth === undefined ? {} : { maxDepth }),\n    ...(nodeLimit === undefined ? {} : { nodeLimit }),\n    ...(edgeLimit === undefined ? {} : { edgeLimit }),\n    ...(tokenBudget === undefined ? {} : { tokenBudget }),\n    ...(options.cursor?.trim() ? { cursor: options.cursor.trim() } : {}),\n  };\n}\n\n/** Build one bounded context packet from an assembled deps relationship graph. */\nfunction buildContextFromAssembly(\n  assembly: WorkspaceRelationshipAssembly,\n  rootId: string,\n  options: RelationshipContextOptions,\n  rootEvidence: readonly string[],\n): RelationshipContextResult {\n  return buildRelationshipContext(\n    assembly.graph,\n    rootId,\n    assembly.details.map((detail) =>\n      detail.id === rootId && rootEvidence.length > 0\n        ? { ...detail, evidence: rootEvidence }\n        : detail,\n    ),\n    options,\n  );\n}\n\n/** Build the SDK-backed bounded relationship-context projection for deps. */\nexport function buildDepsRelationshipContext(\n  rootId: string,\n  items: readonly ItemMetadata[],\n  options: DepsContextOptions,\n  rootEvidence: readonly string[] = [],\n): RelationshipContextResult {\n  return buildContextFromAssembly(\n    assembleWorkspaceRelationshipGraph(items),\n    rootId,\n    parseDepsContextOptions(options),\n    rootEvidence,\n  );\n}\n\n/** Append up to `limit` labeled pointers from one linked collection. */\nfunction appendEvidencePointers(\n  evidence: string[],\n  label: string,\n  values: readonly (string | undefined)[],\n  limit: number,\n): void {\n  for (const value of values.slice(0, limit)) {\n    const trimmed = value?.trim();\n    if (trimmed) evidence.push(`${label}:${trimmed}`);\n  }\n}\n\n/**\n * Load bounded root evidence pointers (linked files, tests, docs, and\n * annotation counts) so the context packet answers \"where is the proof\"\n * without a follow-up item read.\n */\nasync function collectRootEvidence(\n  pmRoot: string,\n  id: string,\n  settings: Awaited<ReturnType<typeof readSettings>>,\n  typeToFolder: Record<string, string>,\n): Promise<string[]> {\n  const located = await locateItem(\n    pmRoot,\n    id,\n    settings.id_prefix,\n    settings.item_format,\n    typeToFolder,\n  );\n  // The caller already resolved the root against the light index, so a miss\n  // can only happen when storage mutates mid-read; degrade to no evidence.\n  /* c8 ignore start -- defensive: unreachable without a concurrent delete between the index scan and this read. */\n  if (!located) return [];\n  /* c8 ignore stop */\n  const { document } = await readLocatedItem(located, {\n    schema: settings.schema,\n  });\n  const metadata = document.metadata;\n  const files = metadata.files ?? [];\n  const tests = metadata.tests ?? [];\n  const docs = metadata.docs ?? [];\n  const counts = [\n    [\"files\", files.length],\n    [\"tests\", tests.length],\n    [\"docs\", docs.length],\n    [\"comments\", (metadata.comments ?? []).length],\n    [\"notes\", (metadata.notes ?? []).length],\n    [\"learnings\", (metadata.learnings ?? []).length],\n  ] as const;\n  if (counts.every(([, count]) => count === 0)) return [];\n  const evidence = [\n    `linked:${counts.map(([key, count]) => `${key}=${count}`).join(\",\")}`,\n  ];\n  appendEvidencePointers(evidence, \"file\", files.map((file) => file.path), 3);\n  appendEvidencePointers(\n    evidence,\n    \"test\",\n    tests.map((test) => test.command ?? test.path),\n    2,\n  );\n  appendEvidencePointers(evidence, \"doc\", docs.map((doc) => doc.path), 2);\n  return evidence;\n}\n\n/** Assemble the context-format deps result with traversal-scoped missing enumeration. */\nfunction buildContextDepsResult(params: {\n  assembly: WorkspaceRelationshipAssembly;\n  canonicalId: string;\n  options: DepsCommandOptions;\n  rootEvidence: readonly string[];\n  summaryOnly: boolean;\n}): DepsResult {\n  const { assembly, canonicalId, options, rootEvidence, summaryOnly } = params;\n  const contextOptions = parseDepsContextOptions(options);\n  const context = buildContextFromAssembly(\n    assembly,\n    canonicalId,\n    contextOptions,\n    rootEvidence,\n  );\n  const reachable = assembly.graph.closure(canonicalId, {\n    direction: contextOptions.direction,\n    ...(contextOptions.kinds === undefined\n      ? {}\n      : { kinds: contextOptions.kinds }),\n    maxDepth: contextOptions.maxDepth ?? 3,\n  });\n  const missingReachable = reachable.value.filter((nodeId) =>\n    assembly.missingIdSet.has(nodeId.toLowerCase()),\n  );\n  const missingReachableSet = new Set(\n    missingReachable.map((nodeId) => nodeId.toLowerCase()),\n  );\n  const relationshipRegistry = createRelationshipKindRegistry();\n  const filteredKinds = contextOptions.kinds\n    ? new Set(\n        contextOptions.kinds.map(\n          (kind) => relationshipRegistry.require(kind).kind,\n        ),\n      )\n    : undefined;\n  const packetIds = new Set([canonicalId, ...reachable.value]);\n  const missingReferences = [\n    ...assembly.dangling.active,\n    ...assembly.dangling.legacy_terminal,\n  ].filter((row) => {\n    if (\n      row.no_active_blocker_sentinel ||\n      !missingReachableSet.has(row.target_id.trim().toLowerCase()) ||\n      !packetIds.has(row.holder_id)\n    )\n      return false;\n    if (filteredKinds === undefined) return true;\n    const definition = relationshipRegistry.resolve(row.kind);\n    return (\n      definition !== undefined &&\n      (filteredKinds.has(definition.kind) ||\n        (definition.inverse !== undefined &&\n          filteredKinds.has(definition.inverse)))\n    );\n  });\n  const referenceLimit = contextOptions.edgeLimit ?? 40;\n  return {\n    id: canonicalId,\n    format: \"context\",\n    node_count: context.nodes.length + 1,\n    edge_count: context.edges.length,\n    missing_count: missingReachable.length,\n    missing_scope: \"traversal\",\n    missing_reference_count: missingReferences.length,\n    ...(summaryOnly\n      ? {}\n      : {\n          missing_references: missingReferences.slice(0, referenceLimit),\n          context,\n        }),\n  };\n}\n\n/** Implements run deps for the public runtime surface of this module. */\nexport async function runDeps(\n  id: string,\n  options: DepsCommandOptions,\n  global: GlobalOptions,\n): Promise<DepsResult> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    throw new PmCliError(\n      `Tracker is not initialized at ${pmRoot}. Run pm init first.`,\n      EXIT_CODE.NOT_FOUND,\n    );\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(\n    settings,\n    getActiveExtensionRegistrations(),\n  );\n  const items = await listAllItemMetadataLight(\n    pmRoot,\n    settings.item_format,\n    typeRegistry.type_to_folder,\n    undefined,\n    settings.schema,\n  );\n  const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);\n  const index = new Map(\n    items.map((item) => [item.id.trim().toLowerCase(), toIndexedItem(item)]),\n  );\n  const dangling = collectDanglingDependencyReferences(\n    items,\n    (status) => isTerminalStatus(status, statusRegistry),\n  );\n  for (const reference of [...dangling.active, ...dangling.legacy_terminal]) {\n    const holder = index.get(reference.holder_id.trim().toLowerCase());\n    const referenceKind = reference.kind.trim().toLowerCase();\n    if (\n      holder &&\n      !holder.dependencies.some(\n        (dependency) =>\n          dependency.id.trim().toLowerCase() === reference.target_id.trim().toLowerCase() &&\n          dependency.kind === referenceKind,\n      )\n    ) {\n      holder.dependencies.push({ id: reference.target_id, kind: referenceKind });\n    }\n  }\n  if (!index.has(id.trim().toLowerCase())) {\n    throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);\n  }\n\n  if (format === \"context\") {\n    const canonicalId = index.get(id.trim().toLowerCase())!.id;\n    const rootEvidence = summaryOnly\n      ? []\n      : await collectRootEvidence(\n          pmRoot,\n          canonicalId,\n          settings,\n          typeRegistry.type_to_folder,\n        );\n    const isTerminal = (status: ItemStatus): boolean =>\n      isTerminalStatus(status, statusRegistry);\n    // Reuse the fingerprint-keyed shared cache so bounded context packets in\n    // long-lived hosts stop paying full-workspace assembly on every call.\n    const lookup = workspaceGraphCache().lookup(\n      pmRoot,\n      computeWorkspaceGraphFingerprint(items, isTerminal),\n      () => assembleWorkspaceRelationshipGraph(items, isTerminal),\n    );\n    return buildContextDepsResult({\n      assembly: lookup.assembly,\n      canonicalId,\n      options,\n      rootEvidence,\n      summaryOnly,\n    });\n  }\n\n  if (summaryOnly) {\n    return {\n      id,\n      format,\n      ...countDependencyGraph(id, index, maxDepth),\n    };\n  }\n\n  const tree = toTreeNode(\n    id,\n    index,\n    new Set<string>(),\n    maxDepth,\n    collapse,\n    new Set<string>(),\n  );\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 (format === \"tree\") {\n    return {\n      ...baseResult,\n      tree,\n    };\n  }\n  return {\n    ...baseResult,\n    graph,\n  };\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAcA,SAAS,kBAAkB;;;;;;;;AAQ3B,IAAM,oCAAoC;AAE1C,IAAM,yBAAyB;AAa/B,SAAS,gBACP,MACA,YAA2C;AAE3C,QAAM,gBAAgB,KAAK,gBAAgB,CAAA,GACxC,IAAI,CAAC,kBAAiB;AAIrB,QAAI,OAAO,kBAAkB,YAAY,kBAAkB;AACzD,aAAO;AACT,UAAM,aAAa;AACnB,WAAO,GAAG,OAAO,WAAW,SAAS,WAAW,WAAW,OAAO,SAAS,IACzE,OAAO,WAAW,OAAO,WAAW,WAAW,KAAK,EACtD;EACF,CAAC,EACA,KAAI,EACJ,KAAK,GAAG;AACX,SAAO;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,WAAW,KAAK,MAAM,IAAI,MAAM;IAChC,KAAK,UAAU;IACf,KAAK,cAAc;IACnB;IACA,KAAK,IAAQ;AACjB;AASM,SAAU,iCACd,OACA,aAA8C,CAAC,WAC7C,WAAW,YAAY,WAAW,YAAU;AAE9C,QAAM,QAAQ,MACX,OAAO,CAAC,SAAS,OAAO,MAAM,OAAO,YAAY,KAAK,GAAG,KAAI,EAAG,SAAS,CAAC,EAC1E,IAAI,CAAC,SAAS,gBAAgB,MAAM,UAAU,CAAC,EAC/C,KAAI;AAGP,SAAO,WAAW,QAAQ,EAAE,OAAO,MAAM,KAAK,GAAQ,CAAC,EAAE,OAAO,KAAK;AACvE;AA+BA,SAAS,0BACP,MACA,OACA,UAAgB;AAEhB,QAAM,QAAQ,SAAS;AACvB,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ;AACtC,UAAM,IAAI,UAAU,WAAW,IAAI,WAAW,OAAO,KAAK,CAAC,EAAE;AAC/D,SAAO;AACT;AASM,IAAO,sBAAP,MAA0B;EACrB,WAAW,oBAAI,IAAG;EAClB;EACA;;EAGT,YACE,UAAuE,CAAA,GAAE;AAEzE,SAAK,0BAA0B,0BAC7B,0BACA,QAAQ,wBACR,iCAAiC;AAEnC,SAAK,iBAAiB,0BACpB,iBACA,QAAQ,eACR,sBAAsB;EAE1B;;;;;;EAOO,OACL,KACA,aACA,OAA0C;AAE1C,QAAI,QAAQ,KAAK,SAAS,IAAI,GAAG;AACjC,QAAI,iBAAiB;AACrB,QAAI,UAAU,UAAa,MAAM,gBAAgB,aAAa;AAC5D,cAAQ,EAAE,aAAa,UAAU,MAAK,GAAI,SAAS,oBAAI,IAAG,EAAE;AAC5D,uBAAiB;AACjB,UACE,CAAC,KAAK,SAAS,IAAI,GAAG,KACtB,KAAK,SAAS,QAAQ,KAAK,gBAC3B;AAGA,aAAK,SAAS,OAAO,KAAK,SAAS,KAAI,EAAG,KAAI,EAAG,KAAM;MACzD;IACF;AAGA,SAAK,SAAS,OAAO,GAAG;AACxB,SAAK,SAAS,IAAI,KAAK,KAAK;AAC5B,UAAM,WAAW;AACjB,UAAM,aAAa,KAAK;AACxB,WAAO;MACL,UAAU,SAAS;MACnB;MACA;MACA,QACE,UACA,SAAgB;AAEhB,cAAM,SAAS,SAAS,QAAQ,IAAI,QAAQ;AAC5C,YAAI,WAAW,UAAa,SAAS,QAAQ,IAAI,QAAQ,GAAG;AAG1D,mBAAS,QAAQ,OAAO,QAAQ;AAChC,mBAAS,QAAQ,IAAI,UAAU,MAAM;AACrC,iBAAO,EAAE,OAAO,gBAAgB,MAAM,GAAQ,QAAQ,KAAI;QAC5D;AACA,cAAM,QAAQ,QAAO;AACrB,YAAI,SAAS,QAAQ,QAAQ,YAAY;AAEvC,mBAAS,QAAQ,OAAO,SAAS,QAAQ,KAAI,EAAG,KAAI,EAAG,KAAM;QAC/D;AACA,iBAAS,QAAQ,IAAI,UAAU,gBAAgB,KAAK,CAAC;AACrD,eAAO,EAAE,OAAO,QAAQ,MAAK;MAC/B;;EAEJ;;EAGO,QAAK;AACV,SAAK,SAAS,MAAK;EACrB;;AAIF,IAAM,cAAc,IAAI,oBAAmB;AAGrC,SAAU,sBAAmB;AACjC,SAAO;AACT;AAGM,SAAU,2BAAwB;AACtC,cAAY,MAAK;AACnB;;;;;;;;;;AC7EA,IAAM,qCAAyE;EAC7E;EACA;EACA;EACA;EACA;EACA;;AAGF,IAAM,eAAe,IAAI,YAAW;AAEpC,SAAS,gBACP,OACA,UACA,OAAa;AAEb,QAAM,WAAW,SAAS;AAC1B,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW;AAC5C,UAAM,IAAI,UAAU,wBAAwB,KAAK,mBAAmB;AACtE,SAAO;AACT;AAEA,SAAS,eAAe,OAAc;AACpC,SAAO,KAAK,IACV,GACA,KAAK,KAAK,aAAa,OAAO,KAAK,UAAU,KAAK,CAAC,EAAE,aAAa,CAAC,CAAC;AAExE;AAEA,SAAS,kBACP,MACA,MACA,UAAkC;AAElC,QAAM,aAAa,SAAS,QAAQ,KAAK,IAAI;AAC7C,MAAI,YAAY,UAAU;AAExB,UAAM,eACH,WAAW,cAAc,4BAC1B;AACF,UAAM,SAAS,cAAc,KAAK,SAAS,KAAK;AAChD,WAAO,SAAS,SAAS,iBAAiB;EAC5C;AACA,MAAI,YAAY,WAAW;AAEzB,UAAM,kBACH,WAAW,sBAAsB,qBAAqB;AACzD,UAAM,SAAS,iBAAiB,KAAK,SAAS,KAAK;AACnD,WAAO,SAAS,SAAS,aAAa;EACxC;AACA,MAAI,KAAK,SAAS,qBAAqB,KAAK,SAAS;AACnD,WAAO;AACT,SAAO;AACT;AAEA,SAAS,cACP,WACA,MACA,MACA,UAAkC;AAElC,QAAM,UAAU,UACb,OACC,CAAC,SACE,KAAK,WAAW,QAAQ,KAAK,WAAW,QACxC,KAAK,WAAW,QAAQ,KAAK,WAAW,IAAK,EAEjD,IAAI,CAAC,SAAS,kBAAkB,MAAM,MAAM,QAAQ,CAAC;AACxD,SAAO,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC,EAAE,KAAI;AACnC;AAGA,SAAS,YACP,OAAyC;AAIzC,SAAO,mCAAmC,KAAK,CAAC,SAC9C,MAAM,SAAS,IAAI,CAAC;AAExB;AAEA,SAAS,cACP,OACA,MACA,UACA,SAAmC;AAOnC,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,WAAW,QAAQ,YAAY;AACrC,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW;AAC5C,UAAM,IAAI,UAAU,oDAAoD;AAC1E,QAAM,OAAO,oBAAI,IAAI,CAAC,IAAI,CAAC;AAC3B,QAAM,QAA4C;IAChD,EAAE,IAAI,MAAM,UAAU,EAAC;;AAEzB,QAAM,OAAyB,CAAA;AAC/B,MAAI,iBAAiB;AACrB,MAAI,iBAAiB;AACrB,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,YAAQ,QAAQ,eAAc;AAC9B,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,QAAQ,YAAY,YAAY;AAAgB;AACpD,UAAM,WAAW,MAAM,cAAc,QAAQ,IAAI;MAC/C;MACA,OAAO,QAAQ;MACf,QAAQ,QAAQ;KACjB;AACD,sBAAkB,SAAS,KAAK;AAChC,QAAI,QAAQ,YAAY,UAAU;AAChC,UAAI,SAAS,MAAM,KAAK,CAAC,QAAQ,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC;AAAG,yBAAiB;AACtE;IACF;AACA,eAAW,EAAE,IAAI,KAAI,KAAM,SAAS,OAAO;AACzC,UAAI,KAAK,IAAI,EAAE;AAAG;AAClB,WAAK,IAAI,EAAE;AACX,YAAM,MAAM;QACV;QACA,UAAU,QAAQ,WAAW;QAC7B,KAAK,QAAQ;QACb,MAAM,kBAAkB,MAAM,IAAI,QAAQ;;AAE5C,WAAK,KAAK,GAAG;AACb,YAAM,KAAK,GAAG;IAChB;EACF;AACA,OAAK,KACH,CAAC,MAAM,UACL,KAAK,WAAW,MAAM,YAAY,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAErE,SAAO;IACL;IACA,cAAc,MAAM;IACpB;IACA;;AAEJ;AAGA,SAAS,qBACP,OACA,MACA,UACA,SAAmC;AAMnC,QAAM,cAAuD;IAC3D,cAAc;IACd,WAAW;IACX,UAAU;IACV,YAAY;IACZ,YAAY;IACZ,SAAS;;AAEX,QAAM,OAAO,MAAM,cAAc,MAAM;IACrC,WAAW,QAAQ,aAAa;IAChC,OAAO,QAAQ;IACf,QAAQ,QAAQ;GACjB,EAAE;AACH,aAAW,EAAE,IAAI,KAAI,KAAM;AACzB,gBAAY,kBAAkB,MAAM,IAAI,QAAQ,CAAC,KAAK;AACxD,SAAO;IACL;IACA,aAAa,KAAK;IAClB,WAAW,KAAK,IAAI,CAAC,EAAE,KAAI,MAAO,IAAI;;AAE1C;AAEA,SAAS,mBAAmB,QAS3B;AACC,QAAM,QAAmC,CAAA;AACzC,MAAI,aAAa,OAAO;AACxB,aAAW,aAAa,OAAO,YAAY;AACzC,QAAI,MAAM,UAAU,OAAO;AAAW;AACtC,UAAM,SACJ,UAAU,aAAa,IACnB,cACE,OAAO,WACP,OAAO,QACP,UAAU,IACV,OAAO,QAAQ,IAEjB,CAAA;AACN,UAAM,OAAgC;MACpC,GAAI,OAAO,QAAQ,IAAI,UAAU,EAAE,KAAK,EAAE,IAAI,UAAU,GAAE;MAC1D,UAAU,UAAU;MACpB,MAAM,OAAO,SAAS,IAAI,YAAY,MAAM,IAAI,UAAU;MAC1D,KAAK,UAAU;MACf,SACE,OAAO,SAAS,IACZ,SACA;QACE,GAAG,UAAU,IAAI,QAAQ,UAAU,GAAG,WAAW,UAAU,QAAQ;;;AAG7E,UAAM,OAAO,eAAe,IAAI;AAChC,QAAI,aAAa,OAAO,OAAO;AAAa;AAC5C,UAAM,KAAK,IAAI;AACf,kBAAc;EAChB;AACA,MAAI,OAAO,WAAW,SAAS,KAAK,MAAM,WAAW;AACnD,UAAM,IAAI,UAAU,sDAAsD;AAC5E,SAAO,EAAE,OAAO,WAAU;AAC5B;AAEA,SAAS,mBAAmB,QAQ3B;AAKC,QAAM,QAAQ,OAAO,QAAQ,QACzB,IAAI,IACF,OAAO,QAAQ,MAAM,IAAI,CAAC,SAAS,OAAO,SAAS,QAAQ,IAAI,EAAE,IAAI,CAAC,IAExE;AACJ,QAAM,aAAa,OAAO,MACvB,MAAK,EACL,OACC,CAAC,SAAQ;AACP,QACE,CAAC,OAAO,SAAS,IAAI,KAAK,MAAM,KAChC,CAAC,OAAO,SAAS,IAAI,KAAK,MAAM;AAEhC,aAAO;AACT,QAAI,UAAU,UAAa,MAAM,IAAI,KAAK,IAAI;AAAG,aAAO;AACxD,UAAM,UAAU,OAAO,SAAS,QAAQ,KAAK,IAAI,GAAG;AACpD,WAAO,YAAY,UAAa,MAAM,IAAI,OAAO;EACnD,CAAC;AAEL,QAAM,QAA4B,CAAA;AAClC,MAAI,aAAa,OAAO;AACxB,aAAW,QAAQ,YAAY;AAC7B,QAAI,MAAM,UAAU,OAAO;AAAW;AACtC,UAAM,OAAO,eAAe,IAAI;AAChC,QAAI,aAAa,OAAO,OAAO;AAAa;AAC5C,UAAM,KAAK,IAAI;AACf,kBAAc;EAChB;AACA,SAAO,EAAE,OAAO,YAAY,gBAAgB,WAAW,OAAM;AAC/D;AAGM,SAAU,yBACd,OACA,QACA,SACA,UAAsC,CAAA,GAAE;AAExC,MAAI,CAAC,MAAM,MAAK,EAAG,SAAS,MAAM;AAChC,UAAM,IAAI,UAAU,gCAAgC,MAAM,EAAE;AAC9D,QAAM,YAAY,gBAAgB,QAAQ,WAAW,IAAI,WAAW;AACpE,QAAM,YAAY,gBAAgB,QAAQ,WAAW,IAAI,WAAW;AACpE,QAAM,cAAc,gBAAgB,QAAQ,aAAa,MAAM,aAAa;AAC5E,QAAM,WAAW,QAAQ,YAAY,+BAA8B;AACnE,QAAM,OAAO,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC;AACjE,QAAM,cAA8C,KAAK,IAAI,MAAM,KAAK;IACtE,IAAI;;AAEN,QAAM,EAAE,UAAU,eAAe,CAAA,GAAI,GAAG,KAAI,IAAK;AACjD,QAAM,WAAW,CAAC,GAAG,YAAY;AACjC,QAAM,YAAY,cAAc,OAAO,QAAQ,UAAU,OAAO;AAChE,QAAM,EAAE,WAAW,GAAG,cAAa,IAAK,qBACtC,OACA,QACA,UACA,OAAO;AAET,QAAM,cAAc,uBAAuB,wBAAwB;IACjE;IACA,WAAW,QAAQ,aAAa;IAChC,OAAO,CAAC,GAAI,QAAQ,SAAS,CAAA,CAAG,EAAE,KAAI;IACtC,UAAU,QAAQ,YAAY;GAC/B;AACD,QAAM,YAAY,wBAChB,UAAU,MACV,QAAQ,QACR,aACA,CAAC,EAAE,GAAE,MAAO,EAAE;AAEhB,QAAM,aAAa,UAAU,KAAK,MAAM,SAAS;AACjD,QAAM,gBAAgB,eAAe,IAAI,IAAI,eAAe,QAAQ;AACpE,MAAI,gBAAgB;AAClB,UAAM,IAAI,UACR,+DAA+D;AAEnE,QAAM,gBAAgB,mBAAmB;IACvC;IACA,SAAS;IACT;IACA;IACA;IACA;IACA;IACA;GACD;AACD,QAAM,EAAE,MAAK,IAAK;AAElB,QAAM,WAAW,oBAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,IAAI,CAAC,EAAE,GAAE,MAAO,EAAE,CAAC,CAAC;AAC/D,QAAM,gBAAgB,mBAAmB;IACvC;IACA;IACA;IACA;IACA;IACA;IACA,eAAe,cAAc;GAC9B;AACD,QAAM,EAAE,OAAO,WAAU,IAAK;AAE9B,QAAM,WAAW,YAAY,MAAM;AACnC,QAAM,eAAe,WAAW,UAAU,KAAK;AAC/C,QAAM,WAAW,MAAM,GAAG,EAAE;AAC5B,QAAM,eAAe,cAAc,iBAAiB,MAAM;AAC1D,QAAM,YACJ,UAAU,kBAAkB,gBAAgB,eAAe;AAC7D,QAAM,UAAsC;IAC1C;IACA,GAAI,KAAK,WAAW,SAAY,CAAA,IAAK,EAAE,YAAY,KAAK,OAAM;IAC9D,GAAG;IACH,iBAAiB,UAAU,KAAK;IAChC,eAAe,MAAM;IACrB,eAAe,MAAM;IACrB,cAAc,UAAU,KAAK,SAAS;IACtC;IACA,eAAe,SAAS;IACxB,SAAS;;AAEX,SAAO;IACL;IACA;IACA;IACA;IACA;IACA,MAAM;MACJ,OAAO;MACP;MACA,cAAc,YAAY,cAAc;MACxC;MACA;MACA;MACA;MACA,cAAc,UAAU;MACxB,gBAAgB,UAAU;MAC1B,cAAc,UAAU,KAAK,SAAS;MACtC;MACA,GAAI,gBAAgB,WAChB;QACE,YAAY,kBACV,aACA,SAAS,IACT,WAAW,CAAC;UAGhB,CAAA;;;AAGV;;;;;;;;;;ACxeO,IAAM,qBAAqB,CAAC,QAAQ,SAAS,SAAS;AAItD,IAAM,uBAAuB,CAAC,QAAQ,UAAU;AAIhD,IAAM,wBAAwB,CAAC,YAAY,YAAY,MAAM;AAuIpE,SAAS,YAAY,KAAuB;AAC1C,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,mBAAyC,SAAS,SAAS,GAAG;AACjE,WAAO;EACT;AACA,QAAM,IAAI,WACR,2BAA2B,GAAG,yCAC9B,UAAU,KAAK;AAEnB;AAGM,SAAU,qBAAqB,KAAkC,MAAY;AACjF,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,QAAQ,OAAO,QAAQ,WAAW,MAAM,OAAO,IAAI,KAAI,CAAE;AAC/D,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ;AACtC,UAAM,IAAI,WAAW,aAAa,IAAI,WAAW,GAAG,8BAA8B,UAAU,KAAK;AACnG,SAAO;AACT;AAGM,SAAU,cAAc,KAAgC;AAC5D,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,WACR,8BAA8B,GAAG,kCACjC,UAAU,KAAK;EAEnB;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,WACR,6BAA6B,GAAG,gCAChC,UAAU,KAAK;AAEnB;AAGM,SAAU,eAAe,KAAuB;AACpD,QAAM,YAAY,KAAK,KAAI,EAAG,YAAW,KAAM;AAC/C,MAAK,sBAA4C,SAAS,SAAS,GAAG;AACpE,WAAO;EACT;AACA,QAAM,IAAI,WACR,8BAA8B,GAAG,6CACjC,UAAU,KAAK;AAEnB;AAOM,SAAU,WAAW,KAAkC;AAC3D,MAAI,QAAQ;AAAW,WAAO;AAC9B,QAAM,WAAW,+BAA8B;AAC/C,QAAM,UAAU,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,GAAG,GAC5C,QAAQ,CAAC,UAAU,MAAM,MAAM,GAAG,CAAC,EACnC,IAAI,CAAC,UAAU,MAAM,KAAI,CAAE,EAC3B,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AACrC,MAAI,OAAO,WAAW;AAAG,WAAO;AAChC,QAAM,QAAQ,oBAAI,IAAG;AACrB,aAAW,SAAS,QAAQ;AAC1B,UAAM,aAAa,SAAS,QAAQ,KAAK;AACzC,QAAI,CAAC,YAAY;AACf,YAAM,QAAQ,SACX,KAAI,EACJ,IAAI,CAAC,UAAU,MAAM,IAAI,EACzB,KAAK,IAAI;AACZ,YAAM,IAAI,WACR,yBAAyB,KAAK,wBAAwB,KAAK,KAC3D,UAAU,KAAK;IAEnB;AACA,UAAM,IAAI,WAAW,IAAI;EAC3B;AACA,SAAO,CAAC,GAAG,KAAK,EAAE,KAAI;AACxB;AAEA,SAAS,sBACP,cAAsC;AAEtC,MAAI,CAAC,gBAAgB,aAAa,WAAW,GAAG;AAC9C,WAAO,CAAA;EACT;AACA,QAAM,SAAS,aAAa,IAAI,CAAC,EAAE,IAAI,KAAI,OAAQ;IACjD,IAAI,GAAG,KAAI;IACX,MAAM,KAAK,KAAI,EAAG,YAAW;IAC7B,EAAE,KAAK,CAAC,MAAM,UAAS;AACvB,UAAM,SAAS,KAAK,KAAK,cAAc,MAAM,IAAI;AACjD,QAAI,WAAW;AAAG,aAAO;AACzB,WAAO,KAAK,GAAG,cAAc,MAAM,EAAE;EACvC,CAAC;AACD,QAAM,UAAU,oBAAI,IAAG;AACvB,aAAW,cAAc,QAAQ;AAC/B,UAAM,MAAM,GAAG,WAAW,KAAK,YAAW,CAAE,KAAK,WAAW,GAAG,YAAW,CAAE;AAC5E,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,cAAQ,IAAI,KAAK,EAAE,IAAI,WAAW,IAAI,MAAM,WAAW,KAAI,CAAE;IAC/D;EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAM,CAAE;AAC7B;AAEA,SAAS,cAAc,MAAkB;AACvC,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,WAAW,GAAG,KAAI,EAAG,YAAW;AACtC,QAAM,OAAO,MAAM,IAAI,QAAQ;AAC/B,QAAM,WAAyB;IAC7B,IAAI,MAAM,MAAM;IAChB,OAAO,MAAM;IACb,MAAM,MAAM;IACZ,QAAQ,MAAM;IACd;IACA,SAAS,CAAC;IACV,OAAO,QAAQ,IAAI,QAAQ;IAC3B,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,QAAQ,GAAG;AACrD,aAAS,YAAY;AACrB,WAAO;EACT;AACA,MAAI,aAAa,YAAY;AAC3B,aAAS,IAAI,QAAQ;EACvB;AACA,QAAM,cAAc,IAAI,IAAI,OAAO;AACnC,cAAY,IAAI,QAAQ;AACxB,WAAS,eAAe,KAAK,aAAa,IAAI,CAAC,eAC7C,WACE,WAAW,IACX,OACA,aACA,UACA,UACA,UACA,QAAQ,GACR,WAAW,IAAI,CAChB;AAEH,SAAO;AACT;AAEA,SAAS,eACP,UACA,WAAwB;AAExB,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,UAChD,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AAEjC,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,MAChB,OAAO,CAAC,SAAS,KAAK,OAAO,EAC7B,IAAI,CAAC,SAAS,KAAK,EAAE;AACxB,SAAO;IACL,SAAS,KAAK;IACd;IACA;IACA,aAAa;;AAEjB;AAGA,SAAS,qBACP,QACA,OACA,UAA4B;AAE5B,QAAM,UAAU,oBAAI,IAAG;AACvB,QAAM,WAAW,oBAAI,IAAG;AACxB,QAAM,aAAa,oBAAI,IAAG;AAC1B,QAAM,WAAW,oBAAI,IAAG;AACxB,QAAM,UAAU,CAAC,EAAE,IAAI,QAAQ,OAAO,EAAC,CAAE;AACzC,MAAI,eAAe;AACnB,SAAO,eAAe,QAAQ,QAAQ;AACpC,UAAM,UAAU,QAAQ,cAAc;AACtC,UAAM,WAAW,QAAQ,GAAG,KAAI,EAAG,YAAW;AAC9C,YAAQ,IAAI,QAAQ;AACpB,UAAM,OAAO,MAAM,IAAI,QAAQ;AAC/B,QAAI,CAAC,MAAM;AACT,iBAAW,IAAI,QAAQ;AACvB;IACF;AACA,QAAI,aAAa,UAAa,QAAQ,SAAS,UAAU;AACvD;IACF;AACA,QAAI,SAAS,IAAI,QAAQ,GAAG;AAC1B;IACF;AACA,aAAS,IAAI,QAAQ;AACrB,eAAW,cAAc,KAAK,cAAc;AAC1C,eAAS,IACP,GAAG,QAAQ,KAAK,WAAW,GAAG,KAAI,EAAG,YAAW,CAAE,KAAK,WAAW,IAAI,EAAE;AAE1E,cAAQ,KAAK,EAAE,IAAI,WAAW,IAAI,OAAO,QAAQ,QAAQ,EAAC,CAAE;IAC9D;EACF;AACA,SAAO;IACL,YAAY,QAAQ;IACpB,YAAY,SAAS;IACrB,eAAe,WAAW;;AAE9B;AAeA,SAAS,wBACP,SAA2B;AAE3B,QAAM,WAAW,cAAc,QAAQ,QAAQ;AAC/C,QAAM,YAAY,qBAAqB,QAAQ,WAAW,YAAY;AACtE,QAAM,YAAY,qBAAqB,QAAQ,WAAW,YAAY;AACtE,QAAM,cAAc,qBAAqB,QAAQ,aAAa,cAAc;AAC5E,QAAM,QAAQ,WAAW,QAAQ,IAAI;AACrC,SAAO;IACL,WAAW,eAAe,QAAQ,SAAS;IAC3C,GAAI,UAAU,SAAY,CAAA,IAAK,EAAE,MAAK;IACtC,GAAI,aAAa,SAAY,CAAA,IAAK,EAAE,SAAQ;IAC5C,GAAI,cAAc,SAAY,CAAA,IAAK,EAAE,UAAS;IAC9C,GAAI,cAAc,SAAY,CAAA,IAAK,EAAE,UAAS;IAC9C,GAAI,gBAAgB,SAAY,CAAA,IAAK,EAAE,YAAW;IAClD,GAAI,QAAQ,QAAQ,KAAI,IAAK,EAAE,QAAQ,QAAQ,OAAO,KAAI,EAAE,IAAK,CAAA;;AAErE;AAGA,SAAS,yBACP,UACA,QACA,SACA,cAA+B;AAE/B,SAAO,yBACL,SAAS,OACT,QACA,SAAS,QAAQ,IAAI,CAAC,WACpB,OAAO,OAAO,UAAU,aAAa,SAAS,IAC1C,EAAE,GAAG,QAAQ,UAAU,aAAY,IACnC,MAAM,GAEZ,OAAO;AAEX;AAGM,SAAU,6BACd,QACA,OACA,SACA,eAAkC,CAAA,GAAE;AAEpC,SAAO,yBACL,mCAAmC,KAAK,GACxC,QACA,wBAAwB,OAAO,GAC/B,YAAY;AAEhB;AAGA,SAAS,uBACP,UACA,OACA,QACA,OAAa;AAEb,aAAW,SAAS,OAAO,MAAM,GAAG,KAAK,GAAG;AAC1C,UAAM,UAAU,OAAO,KAAI;AAC3B,QAAI;AAAS,eAAS,KAAK,GAAG,KAAK,IAAI,OAAO,EAAE;EAClD;AACF;AAOA,eAAe,oBACb,QACA,IACA,UACA,cAAoC;AAEpC,QAAM,UAAU,MAAM,WACpB,QACA,IACA,SAAS,WACT,SAAS,aACT,YAAY;AAKd,MAAI,CAAC;AAAS,WAAO,CAAA;AAErB,QAAM,EAAE,SAAQ,IAAK,MAAM,gBAAgB,SAAS;IAClD,QAAQ,SAAS;GAClB;AACD,QAAM,WAAW,SAAS;AAC1B,QAAM,QAAQ,SAAS,SAAS,CAAA;AAChC,QAAM,QAAQ,SAAS,SAAS,CAAA;AAChC,QAAM,OAAO,SAAS,QAAQ,CAAA;AAC9B,QAAM,SAAS;IACb,CAAC,SAAS,MAAM,MAAM;IACtB,CAAC,SAAS,MAAM,MAAM;IACtB,CAAC,QAAQ,KAAK,MAAM;IACpB,CAAC,aAAa,SAAS,YAAY,CAAA,GAAI,MAAM;IAC7C,CAAC,UAAU,SAAS,SAAS,CAAA,GAAI,MAAM;IACvC,CAAC,cAAc,SAAS,aAAa,CAAA,GAAI,MAAM;;AAEjD,MAAI,OAAO,MAAM,CAAC,CAAC,EAAE,KAAK,MAAM,UAAU,CAAC;AAAG,WAAO,CAAA;AACrD,QAAM,WAAW;IACf,UAAU,OAAO,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG,IAAI,KAAK,EAAE,EAAE,KAAK,GAAG,CAAC;;AAErE,yBAAuB,UAAU,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,IAAI,GAAG,CAAC;AAC1E,yBACE,UACA,QACA,MAAM,IAAI,CAAC,SAAS,KAAK,WAAW,KAAK,IAAI,GAC7C,CAAC;AAEH,yBAAuB,UAAU,OAAO,KAAK,IAAI,CAAC,QAAQ,IAAI,IAAI,GAAG,CAAC;AACtE,SAAO;AACT;AAGA,SAAS,uBAAuB,QAM/B;AACC,QAAM,EAAE,UAAU,aAAa,SAAS,cAAc,YAAW,IAAK;AACtE,QAAM,iBAAiB,wBAAwB,OAAO;AACtD,QAAM,UAAU,yBACd,UACA,aACA,gBACA,YAAY;AAEd,QAAM,YAAY,SAAS,MAAM,QAAQ,aAAa;IACpD,WAAW,eAAe;IAC1B,GAAI,eAAe,UAAU,SACzB,CAAA,IACA,EAAE,OAAO,eAAe,MAAK;IACjC,UAAU,eAAe,YAAY;GACtC;AACD,QAAM,mBAAmB,UAAU,MAAM,OAAO,CAAC,WAC/C,SAAS,aAAa,IAAI,OAAO,YAAW,CAAE,CAAC;AAEjD,QAAM,sBAAsB,IAAI,IAC9B,iBAAiB,IAAI,CAAC,WAAW,OAAO,YAAW,CAAE,CAAC;AAExD,QAAM,uBAAuB,+BAA8B;AAC3D,QAAM,gBAAgB,eAAe,QACjC,IAAI,IACF,eAAe,MAAM,IACnB,CAAC,SAAS,qBAAqB,QAAQ,IAAI,EAAE,IAAI,CAClD,IAEH;AACJ,QAAM,YAAY,oBAAI,IAAI,CAAC,aAAa,GAAG,UAAU,KAAK,CAAC;AAC3D,QAAM,oBAAoB;IACxB,GAAG,SAAS,SAAS;IACrB,GAAG,SAAS,SAAS;IACrB,OAAO,CAAC,QAAO;AACf,QACE,IAAI,8BACJ,CAAC,oBAAoB,IAAI,IAAI,UAAU,KAAI,EAAG,YAAW,CAAE,KAC3D,CAAC,UAAU,IAAI,IAAI,SAAS;AAE5B,aAAO;AACT,QAAI,kBAAkB;AAAW,aAAO;AACxC,UAAM,aAAa,qBAAqB,QAAQ,IAAI,IAAI;AACxD,WACE,eAAe,WACd,cAAc,IAAI,WAAW,IAAI,KAC/B,WAAW,YAAY,UACtB,cAAc,IAAI,WAAW,OAAO;EAE5C,CAAC;AACD,QAAM,iBAAiB,eAAe,aAAa;AACnD,SAAO;IACL,IAAI;IACJ,QAAQ;IACR,YAAY,QAAQ,MAAM,SAAS;IACnC,YAAY,QAAQ,MAAM;IAC1B,eAAe,iBAAiB;IAChC,eAAe;IACf,yBAAyB,kBAAkB;IAC3C,GAAI,cACA,CAAA,IACA;MACE,oBAAoB,kBAAkB,MAAM,GAAG,cAAc;MAC7D;;;AAGV;AAGA,eAAsB,QACpB,IACA,SACAA,SAAqB;AAErB,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAIA,QAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WACR,iCAAiC,MAAM,wBACvC,UAAU,SAAS;EAEvB;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,wBACnB,UACA,gCAA+B,CAAE;AAEnC,QAAM,QAAQ,MAAM,yBAClB,QACA,SAAS,aACT,aAAa,gBACb,QACA,SAAS,MAAM;AAEjB,QAAM,iBAAiB,6BAA6B,SAAS,MAAM;AACnE,QAAM,QAAQ,IAAI,IAChB,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,KAAI,EAAG,YAAW,GAAI,cAAc,IAAI,CAAC,CAAC,CAAC;AAE1E,QAAM,WAAW,oCACf,OACA,CAAC,WAAW,iBAAiB,QAAQ,cAAc,CAAC;AAEtD,aAAW,aAAa,CAAC,GAAG,SAAS,QAAQ,GAAG,SAAS,eAAe,GAAG;AACzE,UAAM,SAAS,MAAM,IAAI,UAAU,UAAU,KAAI,EAAG,YAAW,CAAE;AACjE,UAAM,gBAAgB,UAAU,KAAK,KAAI,EAAG,YAAW;AACvD,QACE,UACA,CAAC,OAAO,aAAa,KACnB,CAAC,eACC,WAAW,GAAG,KAAI,EAAG,YAAW,MAAO,UAAU,UAAU,KAAI,EAAG,YAAW,KAC7E,WAAW,SAAS,aAAa,GAErC;AACA,aAAO,aAAa,KAAK,EAAE,IAAI,UAAU,WAAW,MAAM,cAAa,CAAE;IAC3E;EACF;AACA,MAAI,CAAC,MAAM,IAAI,GAAG,KAAI,EAAG,YAAW,CAAE,GAAG;AACvC,UAAM,IAAI,WAAW,QAAQ,EAAE,cAAc,UAAU,SAAS;EAClE;AAEA,MAAI,WAAW,WAAW;AACxB,UAAM,cAAc,MAAM,IAAI,GAAG,KAAI,EAAG,YAAW,CAAE,EAAG;AACxD,UAAM,eAAe,cACjB,CAAA,IACA,MAAM,oBACJ,QACA,aACA,UACA,aAAa,cAAc;AAEjC,UAAM,aAAa,CAAC,WAClB,iBAAiB,QAAQ,cAAc;AAGzC,UAAM,SAAS,oBAAmB,EAAG,OACnC,QACA,iCAAiC,OAAO,UAAU,GAClD,MAAM,mCAAmC,OAAO,UAAU,CAAC;AAE7D,WAAO,uBAAuB;MAC5B,UAAU,OAAO;MACjB;MACA;MACA;MACA;KACD;EACH;AAEA,MAAI,aAAa;AACf,WAAO;MACL;MACA;MACA,GAAG,qBAAqB,IAAI,OAAO,QAAQ;;EAE/C;AAEA,QAAM,OAAO,WACX,IACA,OACA,oBAAI,IAAG,GACP,UACA,UACA,oBAAI,IAAG,CAAU;AAEnB,QAAM,QAAQ,QAAQ,IAAI;AAC1B,QAAM,aAAa;IACjB;IACA;IACA,YAAY,MAAM,MAAM;IACxB,YAAY,MAAM,MAAM;IACxB,eAAe,MAAM,YAAY;;AAEnC,MAAI,WAAW,QAAQ;AACrB,WAAO;MACL,GAAG;MACH;;EAEJ;AACA,SAAO;IACL,GAAG;IACH;;AAEJ;",
+  "names": ["global"]
+}

package/dist/cli-bundle/chunks/{chunk-QNUAZYGW.js → chunk-43UMFKCK.js}

@@ -11,13 +11,13 @@ import {
 } from "./chunk-7H5NNCJ5.js";
 import {
   runUpdate
-} from "./chunk-FZGM3PNA.js";
+} from "./chunk-YIIIAKCE.js";
 import {
   hasListFilters
 } from "./chunk-N7V7TI6J.js";
 import {
   runList
-} from "./chunk-SIJV365F.js";
+} from "./chunk-NCVT6XEL.js";
 import {
   resolveAuthor
 } from "./chunk-CUFW7ITY.js";
@@ -729,6 +729,6 @@ export {
   runUpdateMany,
   _testOnlyUpdateManyCommand
 };
-//# sourceMappingURL=chunk-QNUAZYGW.js.map
+//# sourceMappingURL=chunk-43UMFKCK.js.map
 
 //# debugId=b46baeb8-2946-5715-b76b-7a7082b871d3

package/dist/cli-bundle/chunks/{chunk-HF63SBLC.js → chunk-6VHUGVNP.js}

@@ -1,12 +1,8 @@
 
-!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]="afd69b46-3b50-57d8-b120-4dcf45f8ff19")}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]="85084307-fe97-5ecd-bfa8-3c803663a33c")}catch(e){}}();
 import {
   runDocs
 } from "./chunk-X2MGQMZO.js";
-import {
-  collectDanglingDependencyReferences,
-  createRelationshipKindRegistry
-} from "./chunk-YQCWK2MB.js";
 import {
   scanHistoryDrift
 } from "./chunk-NVZ6NVHJ.js";
@@ -18,7 +14,7 @@ import {
 } from "./chunk-H5IOT54C.js";
 import {
   runUpdate
-} from "./chunk-FZGM3PNA.js";
+} from "./chunk-YIIIAKCE.js";
 import {
   wrapOwnershipConflict
 } from "./chunk-ILVOOAT4.js";
@@ -34,14 +30,18 @@ import {
   collectUnknownCapabilityGuidance,
   readManagedExtensionState,
   runInit
-} from "./chunk-KOEZCHRF.js";
+} from "./chunk-QRZNCRNA.js";
 import {
   collectStaleVectorizationIds,
   runNext
-} from "./chunk-SPFZV2GR.js";
+} from "./chunk-XPUTSGJU.js";
+import {
+  collectDanglingDependencyReferences,
+  createRelationshipKindRegistry
+} from "./chunk-L5BTTDU5.js";
 import {
   computeContentFieldUtilization
-} from "./chunk-SIJV365F.js";
+} from "./chunk-NCVT6XEL.js";
 import {
   computeMetadataCoverage,
   groupItemsByDimension,
@@ -62,7 +62,7 @@ import {
   resolveProviderConfigSource,
   resolveSettingsWithSemanticRuntimeDefaults,
   resolveVectorStores
-} from "./chunk-AFSV5HBB.js";
+} from "./chunk-E4FXM2XB.js";
 import {
   ACTIVITY_COMMANDER_STRING_OPTION_CONTRACTS,
   ACTIVITY_FLAG_CONTRACTS,
@@ -106,6 +106,8 @@ import {
   GC_FLAG_CONTRACTS,
   GET_FLAG_CONTRACTS,
   GLOBAL_FLAG_CONTRACTS,
+  GRAPH_FLAG_CONTRACTS,
+  GRAPH_SUBCOMMAND_VALUES,
   GUIDE_FLAG_CONTRACTS,
   HEALTH_FLAG_CONTRACTS,
   HISTORY_COMPACT_FLAG_CONTRACTS,
@@ -152,7 +154,7 @@ import {
   UPGRADE_FLAG_CONTRACTS,
   VALIDATE_FLAG_CONTRACTS,
   compactFlagAliasContracts
-} from "./chunk-NCAFUBJX.js";
+} from "./chunk-7UCY6DR5.js";
 import {
   LINKED_TEST_PM_CONTEXT_MODE_VALUES,
   LINKED_TEST_PROTECTED_ENV_KEYS,
@@ -721,11 +723,24 @@ var TOOLS = [
   },
   {
     name: "pm_deps",
-    description: "Read dependency trees/graphs or one bounded explainable relationship context packet. Use options.format=context with depth, node, edge, token, and cursor bounds.",
+    description: "Read dependency trees/graphs or one bounded explainable relationship context packet. Use options.format=context with direction, kind, depth, node, edge, token, and cursor bounds; context returns a counts-first summary, per-node roles/reasons, root evidence pointers, and enumerated missing references.",
     inputSchema: objectSchema({ id: idSchema, options: { type: "object" } }, [
       "id"
     ])
   },
+  {
+    name: "pm_graph",
+    description: "Run bounded workspace relationship-graph queries: ancestors/descendants (hierarchy), predecessors/successors (ordering), paths, impact (blast radius), analyze (execution + knowledge analytics), audit (governance findings), communities (label-propagation clusters), redundancy (transitively implied edges), dominators (structural bottlenecks), and plan (dry-run remediation proposals derived from the audit). Traversals, paths, impact, and dominators require id; paths also requires target. Options support kind, maxDepth, limit, after, direction, maxPaths, sample, exemptIsolate, and counts-first summary.",
+    inputSchema: objectSchema({
+      subcommand: {
+        type: "string",
+        enum: [...GRAPH_SUBCOMMAND_VALUES]
+      },
+      id: idSchema,
+      target: idSchema,
+      options: { type: "object" }
+    }, ["subcommand"])
+  },
   {
     name: "pm_test",
     description: "List, add, remove, or run linked tests for a pm item.",
@@ -1057,6 +1072,7 @@ var COMMAND_INTENTS = /* @__PURE__ */ new Map([
   ["focus", "Manage focus."],
   ["gc", "Clean caches."],
   ["get", "Read item."],
+  ["graph", "Query graph."],
   ["guide", "Show user guides."],
   ["health", "Check health."],
   ["help", "Show help."],
@@ -1125,6 +1141,7 @@ var CORE_COMMAND_FLAG_CONTRACT_ENTRIES = [
   ["next", NEXT_FLAG_CONTRACTS],
   ["aggregate", AGGREGATE_FLAG_CONTRACTS],
   ["deps", DEPS_FLAG_CONTRACTS],
+  ["graph", GRAPH_FLAG_CONTRACTS],
   ["guide", GUIDE_FLAG_CONTRACTS],
   ["reindex", REINDEX_FLAG_CONTRACTS],
   ["history", HISTORY_FLAG_CONTRACTS],
@@ -5810,7 +5827,9 @@ var PM_ITEM_REFERENCE_FLAGS_WITH_VALUE = {
     "--node-limit",
     "--edge-limit",
     "--token-budget",
-    "--cursor"
+    "--cursor",
+    "--direction",
+    "--kind"
   ]),
   test: /* @__PURE__ */ new Set([
     "--add",
@@ -5871,7 +5890,11 @@ function extractPmInvocationArgsFromSegment(segment) {
   return invocation && (isPmExecutableToken(invocation.command) || isPmCliPackageToken(invocation.command)) ? invocation.args : null;
 }
 var extractReferencedPmItemIdsFromCommand = (command, idPrefix = "pm") => {
-  const normalizedPrefix = idPrefix.trim().toLowerCase().replace(/-+$/, "");
+  const lowered = idPrefix.trim().toLowerCase();
+  let prefixEnd = lowered.length;
+  while (prefixEnd > 0 && lowered[prefixEnd - 1] === "-")
+    prefixEnd -= 1;
+  const normalizedPrefix = lowered.slice(0, prefixEnd);
   if (normalizedPrefix.length === 0)
     return [];
   const normalizedCommand = command.trim().replaceAll("\\", "/").replaceAll('"', "").replaceAll("'", "").replaceAll(/\s+/g, " ").toLowerCase();
@@ -11412,6 +11435,6 @@ export {
   runValidate,
   runValidate2
 };
-//# sourceMappingURL=chunk-HF63SBLC.js.map
+//# sourceMappingURL=chunk-6VHUGVNP.js.map
 
-//# debugId=afd69b46-3b50-57d8-b120-4dcf45f8ff19
+//# debugId=85084307-fe97-5ecd-bfa8-3c803663a33c