@unbrained/pm-cli 2026.7.20 → 2026.7.21

package/dist/cli-bundle/chunks/chunk-F2LBF7XJ.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 { stableStringify } from \"../../core/shared/serialization.js\";\nimport type { Dependency, ItemStatus } from \"../../types/index.js\";\nimport {\n  createRelationshipKindRegistry,\n  type RelationshipKindRegistry,\n} from \"../relationships.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  /** Durable cross-process index disposition: answered from it, missed it, or persistence disabled for this workspace. Absent on surfaces that never consult the durable index. */\n  durable?: \"hit\" | \"miss\" | \"off\";\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    // Per-type coverage profiles make the item type a projection input, so a\n    // retype must invalidate cached assemblies and memoized audit results.\n    typeof item.type === \"string\" ? item.type.trim() : \"\",\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  registry: RelationshipKindRegistry = createRelationshipKindRegistry(),\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  const relationshipSemantics = registry\n    .list()\n    .map((definition) => stableStringify(definition))\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\")\n    .update(lines.join(\"\\u0001\"))\n    .update(\"\\u0002\")\n    .update(relationshipSemantics.join(\"\\u0001\"))\n    .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  resolveWorkspaceRelationshipKindRegistry,\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 {\n  createRelationshipKindRegistry,\n  type RelationshipKindRegistry,\n} 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 one\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(\n  raw: string | string[] | undefined,\n  registry: RelationshipKindRegistry = createRelationshipKindRegistry(),\n): string[] | undefined {\n  if (raw === undefined) return undefined;\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  registry: RelationshipKindRegistry = createRelationshipKindRegistry(),\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, registry);\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  const assembly = assembleWorkspaceRelationshipGraph(items);\n  return buildContextFromAssembly(\n    assembly,\n    rootId,\n    parseDepsContextOptions(options, assembly.graph.registry()),\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(\n    options,\n    assembly.graph.registry(),\n  );\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 = assembly.graph.registry();\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    const relationshipRegistry = resolveWorkspaceRelationshipKindRegistry();\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, relationshipRegistry),\n      () =>\n        assembleWorkspaceRelationshipGraph(\n          items,\n          isTerminal,\n          relationshipRegistry,\n        ),\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;;;;;;;;AAa3B,IAAM,oCAAoC;AAE1C,IAAM,yBAAyB;AAe/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;;;IAGhC,OAAO,KAAK,SAAS,WAAW,KAAK,KAAK,KAAI,IAAK;IACnD,KAAK,UAAU;IACf,KAAK,cAAc;IACnB;IACA,KAAK,IAAQ;AACjB;AASM,SAAU,iCACd,OACA,aAA8C,CAAC,WAC7C,WAAW,YAAY,WAAW,YACpC,WAAqC,+BAA8B,GAAE;AAErE,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;AACP,QAAM,wBAAwB,SAC3B,KAAI,EACJ,IAAI,CAAC,eAAe,gBAAgB,UAAU,CAAC,EAC/C,KAAI;AAGP,SAAO,WAAW,QAAQ,EACvB,OAAO,MAAM,KAAK,GAAQ,CAAC,EAC3B,OAAO,GAAQ,EACf,OAAO,sBAAsB,KAAK,GAAQ,CAAC,EAC3C,OAAO,KAAK;AACjB;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;;;;;;;;;;AChGA,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;;;;;;;;;;ACpeO,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,WACd,KACA,WAAqC,+BAA8B,GAAE;AAErE,MAAI,QAAQ;AAAW,WAAO;AAC9B,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,SACA,WAAqC,+BAA8B,GAAE;AAErE,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,MAAM,QAAQ;AAC/C,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,QAAM,WAAW,mCAAmC,KAAK;AACzD,SAAO,yBACL,UACA,QACA,wBAAwB,SAAS,SAAS,MAAM,SAAQ,CAAE,GAC1D,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,wBACrB,SACA,SAAS,MAAM,SAAQ,CAAE;AAE3B,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,SAAS,MAAM,SAAQ;AACpD,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;AACzC,UAAM,uBAAuB,yCAAwC;AAGrE,UAAM,SAAS,oBAAmB,EAAG,OACnC,QACA,iCAAiC,OAAO,YAAY,oBAAoB,GACxE,MACE,mCACE,OACA,YACA,oBAAoB,CACrB;AAEL,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-6XMUURSS.js → chunk-FJIFFBJX.js}

@@ -1,18 +1,54 @@
 
-!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]="420c0ea0-d7a8-520d-aa8e-aa08edbdcca6")}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]="39413a08-0b6f-5fb4-8e45-d039b2979e25")}catch(e){}}();
 import {
   EXECUTABLE_COMMAND_ALIASES,
   resolveSubcommandFlagContractsForCommand
-} from "./chunk-UZDQXNUB.js";
+} from "./chunk-FSE2IKJQ.js";
 import {
   writeStdout
-} from "./chunk-LPEYZRUR.js";
+} from "./chunk-VJQG4BIM.js";
 import {
   EXIT_CODE,
   PmCliError,
   levenshteinDistanceWithinLimit
 } from "./chunk-HYW67VJ5.js";
 
+// dist/sdk/error-runtime.js
+function describeUnknownError(error) {
+  if (error instanceof PmCliError) {
+    return error.message;
+  }
+  if (error instanceof Error) {
+    return error.message;
+  }
+  return "Unknown failure";
+}
+function readThrownExitCode(error) {
+  if (typeof error !== "object" || error === null || !("exitCode" in error)) {
+    return void 0;
+  }
+  const exitCode = error.exitCode;
+  return typeof exitCode === "number" && Number.isFinite(exitCode) ? exitCode : void 0;
+}
+function normalizeThrownExitCode(exitCode) {
+  const normalized = Math.trunc(exitCode);
+  return normalized > EXIT_CODE.SUCCESS ? normalized : EXIT_CODE.GENERIC_FAILURE;
+}
+function isCommanderError(error) {
+  return typeof error === "object" && error !== null && "code" in error && typeof error.code === "string" && error.code.startsWith("commander.");
+}
+function wrapThrownErrorForSentry(error, message) {
+  if (error instanceof Error) {
+    return error;
+  }
+  const wrapped = new Error(message);
+  const exitCode = readThrownExitCode(error);
+  if (exitCode !== void 0) {
+    wrapped.exitCode = normalizeThrownExitCode(exitCode);
+  }
+  return wrapped;
+}
+
 // dist/sdk/cli-bootstrap.js
 var GLOBAL_VALUE_CONSUMING_FLAGS = /* @__PURE__ */ new Set([
   "--pm-path",
@@ -57,13 +93,17 @@ function parseBootstrapPathToken(token, next) {
     preferred: inlinePrefix === "--pm-path="
   };
 }
+var BOOTSTRAP_BOOLEAN_FLAGS = /* @__PURE__ */ new Set([
+  "--no-extensions",
+  "--no-pager",
+  "--json",
+  "--quiet",
+  "--lean"
+]);
 function parseBootstrapGlobalOptions(argv) {
   let legacyPathValue;
   let pmPathValue;
-  let noExtensions = false;
-  let noPager = false;
-  let json = false;
-  let quiet = false;
+  const booleanFlags = /* @__PURE__ */ new Set();
   let author;
   let index = 0;
   while (index < argv.length) {
@@ -71,23 +111,8 @@ function parseBootstrapGlobalOptions(argv) {
     if (token === "--") {
       break;
     }
-    if (token === "--no-extensions") {
-      noExtensions = true;
-      index += 1;
-      continue;
-    }
-    if (token === "--no-pager") {
-      noPager = true;
-      index += 1;
-      continue;
-    }
-    if (token === "--json") {
-      json = true;
-      index += 1;
-      continue;
-    }
-    if (token === "--quiet") {
-      quiet = true;
+    if (BOOTSTRAP_BOOLEAN_FLAGS.has(token)) {
+      booleanFlags.add(token);
       index += 1;
       continue;
     }
@@ -122,10 +147,11 @@ function parseBootstrapGlobalOptions(argv) {
   }
   return {
     path: pmPathValue ?? legacyPathValue,
-    noExtensions,
-    noPager,
-    json,
-    quiet,
+    noExtensions: booleanFlags.has("--no-extensions"),
+    noPager: booleanFlags.has("--no-pager"),
+    json: booleanFlags.has("--json"),
+    quiet: booleanFlags.has("--quiet"),
+    lean: booleanFlags.has("--lean"),
     ...author === "" ? { authorMissingValue: true } : author !== void 0 ? { author } : {}
   };
 }
@@ -137,7 +163,7 @@ function stripGlobalBootstrapTokens(argv) {
     if (token === "--") {
       break;
     }
-    if (token === "--json" || token === "--quiet" || token === "--no-extensions" || token === "--no-pager" || token === "--profile" || token === "--id-only" || token === "--explain") {
+    if (token === "--json" || token === "--quiet" || token === "--lean" || token === "--no-extensions" || token === "--no-pager" || token === "--profile" || token === "--id-only" || token === "--full-changed-fields" || token === "--explain") {
       index += 1;
       continue;
     }
@@ -208,7 +234,7 @@ function findCommandTokenIndex(argv) {
       index += 1;
       continue;
     }
-    if (isInlineGlobalValueToken(token) || token === "--json" || token === "--quiet" || token === "--no-extensions" || token === "--no-pager" || token === "--profile" || token === "--id-only" || token === "--explain") {
+    if (isInlineGlobalValueToken(token) || token === "--json" || token === "--quiet" || token === "--lean" || token === "--no-extensions" || token === "--no-pager" || token === "--profile" || token === "--id-only" || token === "--explain") {
       continue;
     }
     if (token.startsWith("-")) {
@@ -811,10 +837,15 @@ function createPmCliProgram(version) {
     },
     writeErr: () => {
     }
-  }).option("--json", "Output JSON instead of TOON").option("--quiet", "Suppress stdout output").option("--no-changed-fields", "Omit the changed_fields array from mutation output (keeps changed_field_count)").option("--id-only", "Print only id and status for single-item mutation output").option("--pm-path <dir>", "Explicit tracker storage path for this command (preferred over --path)").option("--path <dir>", "Backward-compatible alias for --pm-path; this is the tracker storage path, not a workspace cwd").option("--no-extensions", "Disable extension loading").option("--no-pager", "Disable pager integration for help and long output").option("--explain", "Render extended rationale and examples in help output").option("--profile", "Print deterministic timing diagnostics").option("--author <id>", "Override mutation author for this invocation").exitOverride();
+  }).option("--json", "Output JSON instead of TOON").option("--lean", "Omit null and empty containers from JSON output").option("--quiet", "Suppress stdout output").option("--no-changed-fields", "Omit the changed_fields array from mutation output (keeps changed_field_count)").option("--full-changed-fields", "Restore the legacy full mutation envelope and changed_fields array").option("--id-only", "Print only id and status for single-item mutation output").option("--pm-path <dir>", "Explicit tracker storage path for this command (preferred over --path)").option("--path <dir>", "Backward-compatible alias for --pm-path; this is the tracker storage path, not a workspace cwd").option("--no-extensions", "Disable extension loading").option("--no-pager", "Disable pager integration for help and long output").option("--explain", "Render extended rationale and examples in help output").option("--profile", "Print deterministic timing diagnostics").option("--author <id>", "Override mutation author for this invocation").exitOverride();
 }
 
 export {
+  describeUnknownError,
+  readThrownExitCode,
+  normalizeThrownExitCode,
+  isCommanderError,
+  wrapThrownErrorForSentry,
   parseBootstrapGlobalOptions,
   stripGlobalBootstrapTokens,
   parseBootstrapHelpRequest,
@@ -829,6 +860,6 @@ export {
   applyInvocationAuthorOverride,
   createPmCliProgram
 };
-//# sourceMappingURL=chunk-6XMUURSS.js.map
+//# sourceMappingURL=chunk-FJIFFBJX.js.map
 
-//# debugId=420c0ea0-d7a8-520d-aa8e-aa08edbdcca6
+//# debugId=39413a08-0b6f-5fb4-8e45-d039b2979e25

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../sdk/error-runtime.ts","../../../../../../../../sdk/cli-bootstrap.ts","../../../../../../../../sdk/invocation-author.ts","../../../../../../../../sdk/cli-program.ts"],"sourcesContent":["/**\n * @module sdk/error-runtime\n *\n * Provides presentation-independent normalization for values thrown through CLI and SDK runtimes.\n */\nimport { EXIT_CODE } from \"../core/shared/constants.js\";\nimport { PmCliError } from \"../core/shared/errors.js\";\n\n/** Returns a stable message for errors and unknown thrown values. */\nexport function describeUnknownError(error: unknown): string {\n  if (error instanceof PmCliError) {\n    return error.message;\n  }\n  if (error instanceof Error) {\n    return error.message;\n  }\n  return \"Unknown failure\";\n}\n\n/** Reads a finite numeric exit code from an arbitrary thrown value. */\nexport function readThrownExitCode(error: unknown): number | undefined {\n  if (typeof error !== \"object\" || error === null || !(\"exitCode\" in error)) {\n    return undefined;\n  }\n  const exitCode = (error as { exitCode?: unknown }).exitCode;\n  return typeof exitCode === \"number\" && Number.isFinite(exitCode)\n    ? exitCode\n    : undefined;\n}\n\n/** Normalizes thrown exit codes to a positive integer failure status. */\nexport function normalizeThrownExitCode(exitCode: number): number {\n  const normalized = Math.trunc(exitCode);\n  return normalized > EXIT_CODE.SUCCESS\n    ? normalized\n    : EXIT_CODE.GENERIC_FAILURE;\n}\n\n/** Identifies errors emitted by Commander without importing its private classes. */\nexport function isCommanderError(error: unknown): boolean {\n  return (\n    typeof error === \"object\" &&\n    error !== null &&\n    \"code\" in error &&\n    typeof (error as { code?: unknown }).code === \"string\" &&\n    (error as { code: string }).code.startsWith(\"commander.\")\n  );\n}\n\n/** Converts non-Error thrown values into errors suitable for Sentry capture. */\nexport function wrapThrownErrorForSentry(\n  error: unknown,\n  message: string,\n): Error {\n  if (error instanceof Error) {\n    return error;\n  }\n  const wrapped = new Error(message) as Error & { exitCode?: number };\n  const exitCode = readThrownExitCode(error);\n  /* c8 ignore next */\n  if (exitCode !== undefined) {\n    wrapped.exitCode = normalizeThrownExitCode(exitCode);\n  }\n  return wrapped;\n}\n","/**\n * @module sdk/cli-bootstrap\n *\n * Provides public bootstrap argument normalization for embedded CLI hosts.\n */\nimport {\n  EXECUTABLE_COMMAND_ALIASES,\n  resolveSubcommandFlagContractsForCommand,\n  type CliFlagContract,\n} from \"./cli-contracts.js\";\nexport { EXECUTABLE_COMMAND_ALIASES };\nimport { levenshteinDistanceWithinLimit } from \"../core/shared/levenshtein.js\";\n\nconst GLOBAL_VALUE_CONSUMING_FLAGS = new Set<string>([\n  \"--pm-path\",\n  \"--path\",\n  \"--author\",\n]);\n\n/** Whether a global value-consuming flag uses its inline `--flag=value` form. */\nconst isInlineGlobalValueToken = (token: string): boolean => {\n  const equalsIndex = token.indexOf(\"=\");\n  return (\n    equalsIndex > 0 &&\n    GLOBAL_VALUE_CONSUMING_FLAGS.has(token.slice(0, equalsIndex))\n  );\n};\n\n/** Whether optional bootstrap author syntax consumes the following token. */\nconst consumesBootstrapAuthorValue = (next: string | undefined): boolean => {\n  return typeof next === \"string\" && !next.startsWith(\"-\");\n};\n\nfunction parseBootstrapPathToken(\n  token: string,\n  next: string | undefined,\n): { consumed: number; pathValue?: string; preferred: boolean } | null {\n  if (token === \"--path\" || token === \"--pm-path\") {\n    if (typeof next === \"string\" && next.length > 0) {\n      return {\n        consumed: 2,\n        pathValue: next,\n        preferred: token === \"--pm-path\",\n      };\n    }\n    return {\n      consumed: 1,\n      preferred: token === \"--pm-path\",\n    };\n  }\n\n  const inlinePrefix = token.startsWith(\"--path=\")\n    ? \"--path=\"\n    : token.startsWith(\"--pm-path=\")\n      ? \"--pm-path=\"\n      : undefined;\n  if (!inlinePrefix) {\n    return null;\n  }\n\n  const value = token.slice(inlinePrefix.length);\n  if (value.length > 0) {\n    return {\n      consumed: 1,\n      pathValue: value,\n      preferred: inlinePrefix === \"--pm-path=\",\n    };\n  }\n  return {\n    consumed: 1,\n    preferred: inlinePrefix === \"--pm-path=\",\n  };\n}\n\n/** Documents the bootstrap global options payload exchanged by command, SDK, and package integrations. */\nexport interface BootstrapGlobalOptions {\n  /** Filesystem path used for path resolution. */\n  path?: string;\n  /** Value that configures or reports no extensions for this contract. */\n  noExtensions: boolean;\n  /** Value that configures or reports no pager for this contract. */\n  noPager: boolean;\n  /** Value that configures or reports json for this contract. */\n  json: boolean;\n  /** Value that configures or reports quiet for this contract. */\n  quiet: boolean;\n  /** Whether compact JSON projection is requested. */\n  lean: boolean;\n  /** Invocation-wide mutation author override. */\n  author?: string;\n  /** Whether `--author` was present without its required value. */\n  authorMissingValue?: true;\n}\n\nconst BOOTSTRAP_BOOLEAN_FLAGS = new Set([\n  \"--no-extensions\",\n  \"--no-pager\",\n  \"--json\",\n  \"--quiet\",\n  \"--lean\",\n]);\n\n/** Implements parse bootstrap global options for the public runtime surface of this module. */\nexport function parseBootstrapGlobalOptions(\n  argv: string[],\n): BootstrapGlobalOptions {\n  let legacyPathValue: string | undefined;\n  let pmPathValue: string | undefined;\n  const booleanFlags = new Set<string>();\n  let author: string | undefined;\n  let index = 0;\n  while (index < argv.length) {\n    const token = argv[index];\n    if (token === \"--\") {\n      break;\n    }\n    if (BOOTSTRAP_BOOLEAN_FLAGS.has(token)) {\n      booleanFlags.add(token);\n      index += 1;\n      continue;\n    }\n    const parsedPath = parseBootstrapPathToken(token, argv[index + 1]);\n    if (parsedPath) {\n      if (parsedPath.pathValue !== undefined) {\n        if (parsedPath.preferred) {\n          pmPathValue = parsedPath.pathValue;\n        } else {\n          legacyPathValue = parsedPath.pathValue;\n        }\n      }\n      index += parsedPath.consumed;\n      continue;\n    }\n    if (token === \"--author\") {\n      if (consumesBootstrapAuthorValue(argv[index + 1])) {\n        author = argv[index + 1];\n        index += 2;\n      } else {\n        author = \"\";\n        index += 1;\n      }\n      continue;\n    }\n    if (token.startsWith(\"--author=\")) {\n      author = token.slice(\"--author=\".length);\n      index += 1;\n      continue;\n    }\n    index += 1;\n  }\n  return {\n    path: pmPathValue ?? legacyPathValue,\n    noExtensions: booleanFlags.has(\"--no-extensions\"),\n    noPager: booleanFlags.has(\"--no-pager\"),\n    json: booleanFlags.has(\"--json\"),\n    quiet: booleanFlags.has(\"--quiet\"),\n    lean: booleanFlags.has(\"--lean\"),\n    ...(author === \"\"\n      ? { authorMissingValue: true }\n      : author !== undefined\n        ? { author }\n        : {}),\n  };\n}\n\n/** Implements strip global bootstrap tokens for the public runtime surface of this module. */\nexport function stripGlobalBootstrapTokens(argv: string[]): string[] {\n  const remaining: string[] = [];\n  let index = 0;\n  while (index < argv.length) {\n    const token = argv[index];\n    if (token === \"--\") {\n      break;\n    }\n    if (\n      token === \"--json\" ||\n      token === \"--quiet\" ||\n      token === \"--lean\" ||\n      token === \"--no-extensions\" ||\n      token === \"--no-pager\" ||\n      token === \"--profile\" ||\n      token === \"--id-only\" ||\n      token === \"--full-changed-fields\" ||\n      token === \"--explain\"\n    ) {\n      index += 1;\n      continue;\n    }\n    if (token === \"--author\") {\n      index += consumesBootstrapAuthorValue(argv[index + 1]) ? 2 : 1;\n      continue;\n    }\n    if (GLOBAL_VALUE_CONSUMING_FLAGS.has(token)) {\n      index += 2;\n      continue;\n    }\n    if (isInlineGlobalValueToken(token)) {\n      index += 1;\n      continue;\n    }\n    remaining.push(token);\n    index += 1;\n  }\n  return remaining;\n}\n\n/** Documents the bootstrap help request payload exchanged by command, SDK, and package integrations. */\nexport interface BootstrapHelpRequest {\n  /** Value that configures or reports requested for this contract. */\n  requested: boolean;\n  /** Value that configures or reports command path tokens for this contract. */\n  commandPathTokens: string[];\n}\n\n/** Implements parse bootstrap help request for the public runtime surface of this module. */\nexport function parseBootstrapHelpRequest(\n  argv: string[],\n): BootstrapHelpRequest {\n  const stripped = stripGlobalBootstrapTokens(argv);\n  const first = stripped[0]?.trim().toLowerCase();\n  if (first === \"help\") {\n    const commandPathTokens: string[] = [];\n    for (let index = 1; index < stripped.length; index += 1) {\n      const token = stripped[index];\n      if (token.startsWith(\"-\")) {\n        break;\n      }\n      commandPathTokens.push(token.trim().toLowerCase());\n    }\n    return {\n      requested: true,\n      commandPathTokens,\n    };\n  }\n\n  const helpFlagIndex = stripped.findIndex(\n    (token) => token === \"--help\" || token === \"-h\",\n  );\n  if (helpFlagIndex < 0) {\n    return {\n      requested: false,\n      commandPathTokens: [],\n    };\n  }\n\n  const commandPathTokens: string[] = [];\n  for (const token of stripped) {\n    if (token.startsWith(\"-\")) {\n      break;\n    }\n    commandPathTokens.push(token.trim().toLowerCase());\n  }\n  return {\n    requested: true,\n    commandPathTokens,\n  };\n}\n\n/**\n * Index of the command token in argv — the first non-flag token, skipping the\n * value-consuming/global bootstrap flags. Returns undefined when there is none\n * (bare invocation, only global flags, or a leading `--`). Single source of truth\n * for command-position scanning shared by {@link parseBootstrapCommandName} and the\n * command-alias rewrite so their precedence rules can never drift apart.\n */\nfunction findCommandTokenIndex(argv: string[]): number | undefined {\n  for (let index = 0; index < argv.length; index += 1) {\n    const token = argv[index];\n    if (token === \"--\") {\n      return undefined;\n    }\n    if (token === \"--author\") {\n      index += consumesBootstrapAuthorValue(argv[index + 1]) ? 1 : 0;\n      continue;\n    }\n    if (GLOBAL_VALUE_CONSUMING_FLAGS.has(token)) {\n      index += 1;\n      continue;\n    }\n    if (\n      isInlineGlobalValueToken(token) ||\n      token === \"--json\" ||\n      token === \"--quiet\" ||\n      token === \"--lean\" ||\n      token === \"--no-extensions\" ||\n      token === \"--no-pager\" ||\n      token === \"--profile\" ||\n      token === \"--id-only\" ||\n      token === \"--explain\"\n    ) {\n      continue;\n    }\n    if (token.startsWith(\"-\")) {\n      continue;\n    }\n    return index;\n  }\n  return undefined;\n}\n\n/** Implements parse bootstrap command name for the public runtime surface of this module. */\nexport function parseBootstrapCommandName(argv: string[]): string | undefined {\n  const index = findCommandTokenIndex(argv);\n  return index === undefined ? undefined : argv[index].trim().toLowerCase();\n}\n\nfunction shouldDisablePagerForInvocation(\n  argv: string[],\n  bootstrapGlobal: BootstrapGlobalOptions,\n): boolean {\n  if (bootstrapGlobal.noPager) {\n    return true;\n  }\n  if (process.stdout.isTTY === true) {\n    return false;\n  }\n  const helpRequest = parseBootstrapHelpRequest(argv);\n  return helpRequest.requested;\n}\n\n/** Implements apply bootstrap pager policy for the public runtime surface of this module. */\nexport function applyBootstrapPagerPolicy(argv: string[]): () => void {\n  const pagerEnvironmentKeys = [\n    \"PAGER\",\n    \"MANPAGER\",\n    \"GIT_PAGER\",\n    \"LESS\",\n  ] as const;\n  const previousValues = pagerEnvironmentKeys.map((key) => process.env[key]);\n  const restore = (): void => {\n    for (const [index, key] of pagerEnvironmentKeys.entries()) {\n      const value = previousValues[index];\n      if (value === undefined) {\n        delete process.env[key];\n      } else {\n        process.env[key] = value;\n      }\n    }\n  };\n  const bootstrapGlobal = parseBootstrapGlobalOptions(argv);\n  if (!shouldDisablePagerForInvocation(argv, bootstrapGlobal)) {\n    return restore;\n  }\n  process.env.PAGER = \"cat\";\n  process.env.MANPAGER = \"cat\";\n  process.env.GIT_PAGER = \"cat\";\n  if (\n    typeof process.env.LESS !== \"string\" ||\n    process.env.LESS.trim().length === 0\n  ) {\n    process.env.LESS = \"FRX\";\n  }\n  return restore;\n}\n\ntype ExtensionSubcommandAction =\n  | \"init\"\n  | \"install\"\n  | \"uninstall\"\n  | \"explore\"\n  | \"manage\"\n  | \"doctor\"\n  | \"adopt\"\n  | \"adopt-all\"\n  | \"activate\"\n  | \"deactivate\";\n\nconst EXTENSION_ACTION_SYNTAX_TOKENS = new Set<ExtensionSubcommandAction>([\n  \"install\",\n  \"uninstall\",\n  \"explore\",\n  \"manage\",\n  \"doctor\",\n  \"adopt\",\n  \"adopt-all\",\n  \"activate\",\n  \"deactivate\",\n]);\n\n/** Implements normalize legacy extension action syntax for the public runtime surface of this module. */\nexport function normalizeLegacyExtensionActionSyntax(argv: string[]): string[] {\n  const extensionIndex = findCommandTokenIndex(argv);\n  if (extensionIndex === undefined || argv[extensionIndex] !== \"extension\") {\n    return [...argv];\n  }\n  const actionToken = argv[extensionIndex + 1];\n  if (!actionToken || actionToken.startsWith(\"-\")) {\n    return [...argv];\n  }\n  if (\n    !EXTENSION_ACTION_SYNTAX_TOKENS.has(\n      actionToken as ExtensionSubcommandAction,\n    )\n  ) {\n    return [...argv];\n  }\n  if (argv.includes(\"--help\") || argv.includes(\"-h\")) {\n    return [...argv];\n  }\n  const forcedActionFlag = `--${actionToken}`;\n  if (argv.includes(forcedActionFlag)) {\n    return [...argv];\n  }\n  return [\n    ...argv.slice(0, extensionIndex + 1),\n    forcedActionFlag,\n    ...argv.slice(extensionIndex + 2),\n  ];\n}\n\ntype BootstrapNormalizationReason =\n  | \"legacy_extension_action\"\n  | \"command_alias\"\n  | \"flag_alias\"\n  | \"flag_typo\"\n  | \"bare_key_value\"\n  | \"list_merge\";\ntype BootstrapNormalizationConfidence = \"high\" | \"medium\";\n\n/** Executable command aliases: a leading command token here is rewritten to its canonical command BEFORE commander parses, so the alias actually runs instead of merely being suggested. These are the highest-frequency aliases real agents type (telemetry: `pm show <id>` alone is the single most common unknown-command) and each target takes the same positional/flags as the alias (with `--comment`/ `--note`/`--learning` flag-aliased to `--add` on the target command). Keeping this in one place means the alias is consistent across registration, commander dispatch, telemetry, and error handling — all of which read the normalized argv. */\n/**\n * Rewrite a leading command-alias token (e.g. `show` -> `get`) in place. Only the\n * command position is considered — the same token appearing later as an argument\n * (`pm get show`) is left untouched — and only when it is not preceded by `--` or a\n * value-consuming global flag, mirroring {@link parseBootstrapCommandName}.\n */\nfunction rewriteCommandAlias(\n  argv: string[],\n  trace: BootstrapNormalizationEvent[],\n): string[] {\n  const index = findCommandTokenIndex(argv);\n  if (index === undefined) {\n    return argv;\n  }\n  const token = argv[index];\n  const canonical = EXECUTABLE_COMMAND_ALIASES[token.trim().toLowerCase()];\n  if (!canonical) {\n    return argv;\n  }\n  const rewritten = [...argv];\n  rewritten[index] = canonical;\n  trace.push({\n    from: token,\n    to: [canonical],\n    reason: \"command_alias\",\n    confidence: \"high\",\n  });\n  return rewritten;\n}\n\n/** Documents the bootstrap normalization event payload exchanged by command, SDK, and package integrations. */\nexport interface BootstrapNormalizationEvent {\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 reason for this contract. */\n  reason: BootstrapNormalizationReason;\n  /** Value that configures or reports confidence for this contract. */\n  confidence: BootstrapNormalizationConfidence;\n}\n\n/** Documents the bootstrap invocation normalization result payload exchanged by command, SDK, and package integrations. */\nexport interface BootstrapInvocationNormalizationResult {\n  /** Value that configures or reports argv for this contract. */\n  argv: string[];\n  /** Value that configures or reports command name for this contract. */\n  commandName: string | undefined;\n  /** Value that configures or reports trace for this contract. */\n  trace: BootstrapNormalizationEvent[];\n}\n\ninterface FlagLookup {\n  canonicalByNormalized: Map<string, string | null>;\n  canonicalByCompact: Map<string, string | null>;\n  canonicalComparables: Array<{ canonicalFlag: string; comparable: string }>;\n  listCanonicalFlags: Set<string>;\n}\n\nfunction normalizeFlagKeyToken(raw: string): string {\n  const withoutPrefix = raw.replace(/^--?/, \"\");\n  return withoutPrefix\n    .replace(/_/g, \"-\")\n    .replace(/([a-z0-9])([A-Z])/g, \"$1-$2\")\n    .toLowerCase();\n}\n\nfunction toComparableFlagKey(raw: string): string {\n  return normalizeFlagKeyToken(raw).replace(/-/g, \"\");\n}\n\nfunction markUnambiguousFlag(\n  map: Map<string, string | null>,\n  key: string,\n  canonicalFlag: string,\n): void {\n  const existing = map.get(key);\n  if (existing === undefined) {\n    map.set(key, canonicalFlag);\n    return;\n  }\n  if (existing !== canonicalFlag) {\n    map.set(key, null);\n  }\n}\n\nfunction collectLongFlagCandidates(contract: CliFlagContract): string[] {\n  const candidates: string[] = [];\n  const pushLongFlag = (value: string | undefined): void => {\n    if (typeof value !== \"string\") {\n      return;\n    }\n    if (!value.startsWith(\"--\")) {\n      return;\n    }\n    candidates.push(value);\n  };\n  pushLongFlag(contract.flag);\n  for (const alias of contract.aliases ?? []) {\n    pushLongFlag(alias);\n  }\n  return candidates;\n}\n\nfunction buildFlagLookup(\n  commandName: string | undefined,\n  contractsOverride?: CliFlagContract[],\n): FlagLookup {\n  const contracts =\n    contractsOverride ?? resolveSubcommandFlagContractsForCommand(commandName);\n  const canonicalByNormalized = new Map<string, string | null>();\n  const canonicalByCompact = new Map<string, string | null>();\n  const canonicalComparablesMap = new Map<string, string>();\n  const listCanonicalFlags = new Set<string>();\n  for (const contract of contracts) {\n    const longCandidates = collectLongFlagCandidates(contract);\n    if (longCandidates.length === 0) {\n      continue;\n    }\n    const canonicalFlag = `--${normalizeFlagKeyToken(longCandidates[0])}`;\n    for (const candidate of longCandidates) {\n      markUnambiguousFlag(\n        canonicalByNormalized,\n        normalizeFlagKeyToken(candidate),\n        canonicalFlag,\n      );\n      markUnambiguousFlag(\n        canonicalByCompact,\n        toComparableFlagKey(candidate),\n        canonicalFlag,\n      );\n    }\n    const comparable = toComparableFlagKey(canonicalFlag);\n    if (!canonicalComparablesMap.has(canonicalFlag)) {\n      canonicalComparablesMap.set(canonicalFlag, comparable);\n    }\n    if (contract.list === true) {\n      listCanonicalFlags.add(canonicalFlag);\n    }\n  }\n  return {\n    canonicalByNormalized,\n    canonicalByCompact,\n    canonicalComparables: [...canonicalComparablesMap.entries()].map(\n      ([canonicalFlag, comparable]) => ({\n        canonicalFlag,\n        comparable,\n      }),\n    ),\n    listCanonicalFlags,\n  };\n}\n\nfunction resolveCanonicalFlag(\n  rawKey: string,\n  lookup: FlagLookup,\n): {\n  flag: string;\n  reason: \"flag_alias\" | \"flag_typo\";\n  confidence: BootstrapNormalizationConfidence;\n} | null {\n  const normalizedKey = normalizeFlagKeyToken(rawKey);\n  const direct = lookup.canonicalByNormalized.get(normalizedKey);\n  if (typeof direct === \"string\") {\n    return {\n      flag: direct,\n      reason: \"flag_alias\",\n      confidence: \"high\",\n    };\n  }\n  const comparableKey = normalizedKey.replace(/-/g, \"\");\n  const compactMatch = lookup.canonicalByCompact.get(comparableKey);\n  if (typeof compactMatch === \"string\") {\n    return {\n      flag: compactMatch,\n      reason: \"flag_alias\",\n      confidence: \"high\",\n    };\n  }\n  const maxDistance = comparableKey.length >= 8 ? 2 : 1;\n  let bestDistance = Number.POSITIVE_INFINITY;\n  let bestFlag: string | undefined;\n  let tied = false;\n  for (const candidate of lookup.canonicalComparables) {\n    const distance = levenshteinDistanceWithinLimit(\n      comparableKey,\n      candidate.comparable,\n      maxDistance,\n    );\n    if (distance === null) {\n      continue;\n    }\n    if (distance < bestDistance) {\n      bestDistance = distance;\n      bestFlag = candidate.canonicalFlag;\n      tied = false;\n      continue;\n    }\n    if (distance === bestDistance && bestFlag !== candidate.canonicalFlag) {\n      tied = true;\n    }\n  }\n  if (\n    !bestFlag ||\n    tied ||\n    !Number.isFinite(bestDistance) ||\n    bestDistance <= 0\n  ) {\n    return null;\n  }\n  return {\n    flag: bestFlag,\n    reason: \"flag_typo\",\n    confidence: bestDistance >= 2 ? \"medium\" : \"high\",\n  };\n}\n\n/** Implements list alias plural keys for the public runtime surface of this module. */\nexport function listAliasPluralKeys(normalizedKey: string): string[] {\n  const candidates = [`${normalizedKey}s`];\n  if (normalizedKey.endsWith(\"y\") && normalizedKey.length > 1) {\n    candidates.push(`${normalizedKey.slice(0, -1)}ies`);\n  }\n  return candidates;\n}\n\nfunction parseBareKeyValueToken(\n  token: string,\n  preserve = false,\n): { key: string; value: string } | null {\n  if (preserve || token.includes(\"://\")) {\n    return null;\n  }\n  const match = token.match(/^([A-Za-z][A-Za-z0-9_-]{1,63})([:=])(.*)$/);\n  if (!match) {\n    return null;\n  }\n  const key = match[1];\n  const value = match[3];\n  if (value.length === 0) {\n    return null;\n  }\n  return {\n    key,\n    value,\n  };\n}\n\nfunction normalizeLongOptionToken(\n  token: string,\n  lookup: FlagLookup,\n  preserve = false,\n): { tokens: string[]; event?: BootstrapNormalizationEvent } {\n  if (preserve || !token.startsWith(\"--\")) {\n    return { tokens: [token] };\n  }\n  const equalsIndex = token.indexOf(\"=\");\n  const key = equalsIndex >= 0 ? token.slice(0, equalsIndex) : token;\n  const inlineValue =\n    equalsIndex >= 0 ? token.slice(equalsIndex + 1) : undefined;\n  const resolution = resolveCanonicalFlag(key, lookup);\n  if (!resolution) {\n    return { tokens: [token] };\n  }\n  const normalizedToken =\n    inlineValue === undefined\n      ? resolution.flag\n      : `${resolution.flag}=${inlineValue}`;\n  if (normalizedToken === token) {\n    return { tokens: [token] };\n  }\n  return {\n    tokens: [normalizedToken],\n    event: {\n      from: token,\n      to: [normalizedToken],\n      reason: resolution.reason,\n      confidence: resolution.confidence,\n    },\n  };\n}\n\n/** Locate global path-value tokens that normalization must preserve literally. */\nfunction collectBootstrapPathValueIndices(argv: string[]): Set<number> {\n  const indices = new Set<number>();\n  let expectsValue = false;\n  for (let index = 0; index < argv.length; index += 1) {\n    if (expectsValue) {\n      indices.add(index);\n      expectsValue = false;\n      continue;\n    }\n    const token = argv[index];\n    expectsValue = token === \"--path\" || token === \"--pm-path\";\n  }\n  return indices;\n}\n\n// Global option flags whose value may legitimately begin with \"--\" (commander\n// accepts such values). Their value token must not be reinterpreted as a list\n// flag during coalescing. `--pm-path <dir>` and its legacy `--path <dir>`\n// alias are the documented cases; other globals\n// (--json/--quiet/--no-extensions/--no-pager/--profile) are boolean.\nfunction splitCanonicalListToken(\n  token: string,\n): { flag: string; inlineValue?: string } | null {\n  if (!token.startsWith(\"--\")) {\n    return null;\n  }\n  const equalsIndex = token.indexOf(\"=\");\n  if (equalsIndex < 0) {\n    return { flag: token };\n  }\n  return {\n    flag: token.slice(0, equalsIndex),\n    inlineValue: token.slice(equalsIndex + 1),\n  };\n}\n\ninterface ListFlagSlot {\n  outputIndex: number;\n  originalTokens: string[];\n  values: string[];\n  occurrences: number;\n}\n\ninterface ListFlagOccurrence {\n  originalTokens: string[];\n  value: string | undefined;\n  consumed: number;\n}\n\ninterface ValuedListFlagOccurrence {\n  originalTokens: string[];\n  value: string;\n}\n\nfunction copyValueConsumingFlag(\n  argv: string[],\n  index: number,\n  result: (string | null)[],\n): number {\n  result.push(argv[index]);\n  const next = argv[index + 1];\n  if (typeof next === \"string\" && next !== \"--\") {\n    result.push(next);\n    return index + 2;\n  }\n  return index + 1;\n}\n\nfunction readListFlagOccurrence(\n  argv: string[],\n  index: number,\n  parsed: { flag: string; inlineValue?: string },\n  multiValueListFlags: Set<string>,\n): ListFlagOccurrence {\n  if (parsed.inlineValue !== undefined) {\n    return {\n      originalTokens: [argv[index]],\n      value: parsed.inlineValue,\n      consumed: 1,\n    };\n  }\n\n  const values: string[] = [];\n  let valueIndex = index + 1;\n  while (\n    valueIndex < argv.length &&\n    argv[valueIndex] !== \"--\" &&\n    !argv[valueIndex].startsWith(\"-\") &&\n    (values.length === 0 || multiValueListFlags.has(parsed.flag))\n  ) {\n    values.push(argv[valueIndex]);\n    valueIndex += 1;\n  }\n\n  const consumed = values.length === 0 ? 1 : 1 + values.length;\n  return {\n    originalTokens: argv.slice(index, index + consumed),\n    value: values.length === 0 ? undefined : values.join(\",\"),\n    consumed,\n  };\n}\n\nfunction recordListFlagOccurrence(\n  slots: Map<string, ListFlagSlot>,\n  result: (string | null)[],\n  flag: string,\n  occurrence: ValuedListFlagOccurrence,\n): void {\n  const existing = slots.get(flag);\n  if (existing) {\n    existing.values.push(occurrence.value);\n    existing.occurrences += 1;\n    return;\n  }\n\n  slots.set(flag, {\n    outputIndex: result.length,\n    originalTokens: occurrence.originalTokens,\n    values: [occurrence.value],\n    occurrences: 1,\n  });\n  // Reserve the anchor position; finalized after the walk so we know the full\n  // merged value or can restore the original token form for single uses.\n  result.push(null);\n}\n\nfunction buildListFlagCoalescingSplices(\n  slots: Map<string, ListFlagSlot>,\n  multiValueListFlags: Set<string>,\n): {\n  events: BootstrapNormalizationEvent[];\n  splices: Array<{ outputIndex: number; tokens: string[] }>;\n} {\n  const events: BootstrapNormalizationEvent[] = [];\n  const splices: Array<{ outputIndex: number; tokens: string[] }> = [];\n  for (const [flag, slot] of slots) {\n    const shouldMerge =\n      slot.occurrences >= 2 ||\n      (multiValueListFlags.has(flag) && slot.originalTokens.length > 2);\n    if (!shouldMerge) {\n      splices.push({\n        outputIndex: slot.outputIndex,\n        tokens: slot.originalTokens,\n      });\n      continue;\n    }\n    const mergedToken = `${flag}=${slot.values.join(\",\")}`;\n    splices.push({ outputIndex: slot.outputIndex, tokens: [mergedToken] });\n    events.push({\n      from: `${flag} (x${slot.occurrences})`,\n      to: [mergedToken],\n      reason: \"list_merge\",\n      confidence: \"high\",\n    });\n  }\n  return { events, splices };\n}\n\nfunction applyListFlagSplices(\n  result: (string | null)[],\n  splices: Array<{ outputIndex: number; tokens: string[] }>,\n): void {\n  splices.sort((a, b) => b.outputIndex - a.outputIndex);\n  for (const splice of splices) {\n    result.splice(splice.outputIndex, 1, ...splice.tokens);\n  }\n}\n\n/**\n * Coalesce repeated occurrences of comma-separated list flags into a single\n * `--flag=v1,v2,v3` token anchored at the FIRST occurrence. Without this,\n * Commander treats these flags as scalars and silently keeps only the last\n * value (data loss). Both `--flag value` and `--flag=value` forms are merged;\n * a value-less occurrence is preserved untouched, and a `--` terminator stops\n * coalescing (remainder is passed through verbatim).\n *\n * `valueConsumingFlags` lists option flags (e.g. global `--pm-path`) whose value\n * may itself begin with `--`. Their value token is emitted verbatim so a\n * list-flag-looking value (`--path --tags`) is never reinterpreted as a flag\n * nor allowed to swallow the following command/positional token.\n */\nexport function coalesceRepeatedListFlags(\n  argv: string[],\n  listFlags: Set<string>,\n  valueConsumingFlags: Set<string> = new Set(),\n  multiValueListFlags: Set<string> = new Set(),\n): { argv: string[]; events: BootstrapNormalizationEvent[] } {\n  if (listFlags.size === 0) {\n    return { argv: [...argv], events: [] };\n  }\n\n  const result: (string | null)[] = [];\n  const slots = new Map<string, ListFlagSlot>();\n  let index = 0;\n  while (index < argv.length) {\n    const token = argv[index];\n    if (token === \"--\") {\n      result.push(...argv.slice(index));\n      break;\n    }\n    // A value-consuming option in space form owns the next token as its value,\n    // even when that value begins with \"--\". Emit both verbatim so the value is\n    // never misread as a list-flag occurrence.\n    if (valueConsumingFlags.has(token)) {\n      index = copyValueConsumingFlag(argv, index, result);\n      continue;\n    }\n    const parsed = splitCanonicalListToken(token);\n    if (!parsed || !listFlags.has(parsed.flag)) {\n      result.push(token);\n      index += 1;\n      continue;\n    }\n\n    const occurrence = readListFlagOccurrence(\n      argv,\n      index,\n      parsed,\n      multiValueListFlags,\n    );\n    if (occurrence.value === undefined) {\n      // Value-less occurrence: leave untouched, do not coalesce.\n      result.push(token);\n      index += occurrence.consumed;\n      continue;\n    }\n\n    recordListFlagOccurrence(slots, result, parsed.flag, {\n      originalTokens: occurrence.originalTokens,\n      value: occurrence.value,\n    });\n    index += occurrence.consumed;\n  }\n\n  // Apply anchor splices from the end so earlier indices stay valid when a\n  // single-occurrence anchor expands back into two tokens.\n  const { events, splices } = buildListFlagCoalescingSplices(\n    slots,\n    multiValueListFlags,\n  );\n  applyListFlagSplices(result, splices);\n\n  return { argv: result as string[], events };\n}\n\n/** Linked-test entry keys accepted in the two-token form `pm test <id> --add command \"npm test -- parser\"` (GH-191). Only entry-identity keys are merged: `command`/`cmd` name the shell command and `path` names the test file, so a single key=value entry is meaningful for them. Other structured keys (scope, env_set, assertions, ...) cannot form a valid standalone entry and are left for the normal parser to reject. `--remove` matches existing entries by `command=`/`path=` only, so `cmd` is excluded there. Key names mirror STRUCTURED_LINKED_TEST_KEYS in src/cli/commands/linked-test-entry.ts. */\nconst LINKED_TEST_TWO_TOKEN_KEYS_BY_FLAG: ReadonlyMap<\n  string,\n  ReadonlySet<string>\n> = new Map([\n  [\"--add\", new Set([\"command\", \"cmd\", \"path\"])],\n  [\"--remove\", new Set([\"command\", \"path\"])],\n]);\n\n/** Sandbox-safe linked-test commands legitimately start with env assignments (`PM_PATH=... PM_GLOBAL_PATH=... vitest run -- parser`), which look like bare key=value settings tokens. When the two preceding tokens are a linked-test flag plus a bare two-token key (`--add command <value>`), the value must be left intact for mergeLinkedTestTwoTokenEntries instead of being rewritten into a canonical flag (e.g. PM_PATH= -> --pm-path), which would silently corrupt the command into `--add command --pm-path ...`. */\nfunction isLinkedTestTwoTokenValuePosition(\n  commandName: string | undefined,\n  emittedTokens: readonly string[],\n): boolean {\n  if (commandName !== \"test\" || emittedTokens.length < 2) {\n    return false;\n  }\n  const key = emittedTokens[emittedTokens.length - 1];\n  const flag = emittedTokens[emittedTokens.length - 2];\n  const keys = LINKED_TEST_TWO_TOKEN_KEYS_BY_FLAG.get(flag);\n  return keys !== undefined && keys.has(key);\n}\n\nfunction shouldPreserveBareKeyValueToken(\n  commandName: string | undefined,\n  emittedTokens: readonly string[],\n): boolean {\n  return (\n    commandName === \"search\" ||\n    isLinkedTestTwoTokenValuePosition(commandName, emittedTokens)\n  );\n}\n\n/** Accept the two-token linked-test form `pm test <id> --add command \"npm test -- parser\"` by merging the bare key token and its single quoted value into the documented `--add command=...` shape. Without this merge Commander binds the bare key as the option value and treats the quoted command as an excess positional, failing with \"too many arguments\" (GH-191). The merge only fires when EXACTLY ONE non-flag token follows the bare key, i.e. the value was quoted into one shell token — an unquoted multi-token value stays ambiguous (it may swallow the item id), still fails fast, and is routed to targeted quoting guidance by the commander error classifier instead. */\nexport function mergeLinkedTestTwoTokenEntries(\n  argv: string[],\n  commandName: string | undefined,\n  trace: BootstrapNormalizationEvent[],\n): string[] {\n  if (commandName !== \"test\") {\n    return argv;\n  }\n  const result: string[] = [];\n  let index = 0;\n  while (index < argv.length) {\n    const token = argv[index];\n    if (token === \"--\") {\n      result.push(...argv.slice(index));\n      return result;\n    }\n    const keys = LINKED_TEST_TWO_TOKEN_KEYS_BY_FLAG.get(token);\n    const key = keys ? argv[index + 1] : undefined;\n    if (!keys || typeof key !== \"string\" || !keys.has(key)) {\n      result.push(token);\n      index += 1;\n      continue;\n    }\n    let runEnd = index + 2;\n    while (runEnd < argv.length && !argv[runEnd].startsWith(\"-\")) {\n      runEnd += 1;\n    }\n    if (runEnd - (index + 2) !== 1) {\n      result.push(token);\n      index += 1;\n      continue;\n    }\n    const value = argv[index + 2];\n    const mergedValue = `${key}=${value}`;\n    result.push(token, mergedValue);\n    trace.push({\n      from: `${token} ${key} ${value}`,\n      to: [token, mergedValue],\n      reason: \"bare_key_value\",\n      confidence: \"high\",\n    });\n    index += 3;\n  }\n  return result;\n}\n\n/** Implements normalize bootstrap invocation for the public runtime surface of this module. */\nexport function normalizeBootstrapInvocation(\n  argv: string[],\n): BootstrapInvocationNormalizationResult {\n  const trace: BootstrapNormalizationEvent[] = [];\n  const legacyNormalized = normalizeLegacyExtensionActionSyntax(argv);\n  if (\n    legacyNormalized.length !== argv.length ||\n    legacyNormalized.some((token, index) => token !== argv[index])\n  ) {\n    trace.push({\n      from: argv.join(\" \"),\n      to: [...legacyNormalized],\n      reason: \"legacy_extension_action\",\n      confidence: \"high\",\n    });\n  }\n  const aliasNormalized = rewriteCommandAlias(legacyNormalized, trace);\n  const commandName = parseBootstrapCommandName(aliasNormalized);\n  const commandPathName = parseBootstrapCommandPathName(aliasNormalized);\n  const lookup = buildFlagLookup(commandPathName ?? commandName);\n  const normalizedArgv: string[] = [];\n  const pathValueIndices = collectBootstrapPathValueIndices(aliasNormalized);\n  for (let index = 0; index < aliasNormalized.length; index += 1) {\n    const token = aliasNormalized[index];\n    if (token === \"--\") {\n      normalizedArgv.push(...aliasNormalized.slice(index));\n      break;\n    }\n    const preserveCurrentToken = pathValueIndices.has(index);\n    const previous = normalizedArgv[normalizedArgv.length - 1];\n    if (token.startsWith(\"--\")) {\n      const normalizedToken = normalizeLongOptionToken(\n        token,\n        lookup,\n        preserveCurrentToken,\n      );\n      normalizedArgv.push(...normalizedToken.tokens);\n      if (normalizedToken.event) {\n        trace.push(normalizedToken.event);\n      }\n      continue;\n    }\n    const bareKeyValue = parseBareKeyValueToken(token, preserveCurrentToken);\n    if (\n      bareKeyValue &&\n      !(typeof previous === \"string\" && previous.startsWith(\"-\")) &&\n      !shouldPreserveBareKeyValueToken(commandName, normalizedArgv)\n    ) {\n      const resolution = resolveCanonicalFlag(bareKeyValue.key, lookup);\n      if (resolution) {\n        const replacement = [resolution.flag, bareKeyValue.value];\n        normalizedArgv.push(...replacement);\n        trace.push({\n          from: token,\n          to: replacement,\n          reason: \"bare_key_value\",\n          confidence: resolution.confidence,\n        });\n        continue;\n      }\n    }\n    normalizedArgv.push(token);\n  }\n  const linkedTestNormalized = mergeLinkedTestTwoTokenEntries(\n    normalizedArgv,\n    commandName,\n    trace,\n  );\n  const coalesced = coalesceRepeatedListFlags(\n    linkedTestNormalized,\n    lookup.listCanonicalFlags,\n    GLOBAL_VALUE_CONSUMING_FLAGS,\n    commandName === \"create\" ? new Set([\"--tags\"]) : new Set(),\n  );\n  for (const event of coalesced.events) {\n    trace.push(event);\n  }\n  return {\n    argv: coalesced.argv,\n    commandName,\n    trace,\n  };\n}\n\nfunction parseBootstrapCommandPathName(argv: string[]): string | undefined {\n  const stripped = stripGlobalBootstrapTokens(argv);\n  const first = stripped[0]?.trim().toLowerCase();\n  const second = stripped[1]?.trim().toLowerCase();\n  if (\n    (first === \"extension\" || first === \"package\" || first === \"packages\") &&\n    typeof second === \"string\" &&\n    second.length > 0 &&\n    !second.startsWith(\"-\")\n  ) {\n    return `${first} ${second}`;\n  }\n  return first;\n}\n\n/** Implements parse bootstrap type value for the public runtime surface of this module. */\nexport function parseBootstrapTypeValue(argv: string[]): string | undefined {\n  for (let index = 0; index < argv.length; index += 1) {\n    const token = argv[index];\n    if (token === \"--\") {\n      break;\n    }\n    if (token === \"--type\") {\n      const candidate = argv[index + 1];\n      if (typeof candidate === \"string\" && candidate.trim().length > 0) {\n        return candidate.trim();\n      }\n      continue;\n    }\n    if (token.startsWith(\"--type=\")) {\n      const candidate = token.slice(\"--type=\".length).trim();\n      if (candidate.length > 0) {\n        return candidate;\n      }\n    }\n  }\n  return undefined;\n}\n\n/** Public contract for test only, shared by SDK and presentation-layer consumers. */\nexport const _testOnly = {\n  buildFlagLookup,\n  collectBootstrapPathValueIndices,\n  collectLongFlagCandidates,\n  markUnambiguousFlag,\n  normalizeLongOptionToken,\n  resolveCanonicalFlag,\n};\n","/**\n * @module sdk/invocation-author\n *\n * Safely scopes invocation-wide mutation authors for one-shot and embedded CLI hosts.\n */\nimport { EXIT_CODE } from \"../core/shared/constants.js\";\nimport { PmCliError } from \"../core/shared/errors.js\";\n\n/** Apply an optional author override and return an idempotent environment restorer. */\nexport function applyInvocationAuthorOverride(\n  author: string | undefined,\n): () => void {\n  if (author === undefined) {\n    return () => {};\n  }\n  const normalizedAuthor = author.trim();\n  if (normalizedAuthor.length === 0) {\n    throw new PmCliError(\n      \"--author requires a non-empty value.\",\n      EXIT_CODE.USAGE,\n      {\n        code: \"missing_required_argument\",\n        nextSteps: [\"Pass an explicit author identifier with --author <id>.\"],\n      },\n    );\n  }\n  const previousAuthor = process.env.PM_AUTHOR;\n  process.env.PM_AUTHOR = normalizedAuthor;\n  let restored = false;\n  return () => {\n    if (restored) {\n      return;\n    }\n    restored = true;\n    if (previousAuthor === undefined) {\n      delete process.env.PM_AUTHOR;\n    } else {\n      process.env.PM_AUTHOR = previousAuthor;\n    }\n  };\n}\n","/**\n * @module sdk/cli-program\n *\n * Builds the reusable Commander root that embeds pm's universal global contracts.\n */\nimport { Command } from \"commander\";\nimport { writeStdout } from \"../core/output/output.js\";\n\n/** Create a fresh pm root program suitable for one-shot CLI or embedded hosts. */\nexport function createPmCliProgram(version: string): Command {\n  return new Command()\n    .name(\"pm\")\n    .description(\n      \"Universal, flexible, extensible, agent-optimized project management CLI for any project or programming language.\",\n    )\n    .version(version)\n    .showHelpAfterError(false)\n    .allowExcessArguments(false)\n    .allowUnknownOption(false)\n    .configureOutput({\n      writeOut: (value) => {\n        writeStdout(value);\n      },\n      writeErr: () => {},\n    })\n    .option(\"--json\", \"Output JSON instead of TOON\")\n    .option(\"--lean\", \"Omit null and empty containers from JSON output\")\n    .option(\"--quiet\", \"Suppress stdout output\")\n    .option(\n      \"--no-changed-fields\",\n      \"Omit the changed_fields array from mutation output (keeps changed_field_count)\",\n    )\n    .option(\n      \"--full-changed-fields\",\n      \"Restore the legacy full mutation envelope and changed_fields array\",\n    )\n    .option(\n      \"--id-only\",\n      \"Print only id and status for single-item mutation output\",\n    )\n    .option(\n      \"--pm-path <dir>\",\n      \"Explicit tracker storage path for this command (preferred over --path)\",\n    )\n    .option(\n      \"--path <dir>\",\n      \"Backward-compatible alias for --pm-path; this is the tracker storage path, not a workspace cwd\",\n    )\n    .option(\"--no-extensions\", \"Disable extension loading\")\n    .option(\"--no-pager\", \"Disable pager integration for help and long output\")\n    .option(\n      \"--explain\",\n      \"Render extended rationale and examples in help output\",\n    )\n    .option(\"--profile\", \"Print deterministic timing diagnostics\")\n    .option(\"--author <id>\", \"Override mutation author for this invocation\")\n    .exitOverride();\n}\n"],"names":["commandPathTokens"],"mappings":";;;;;;;;;;;;;;;;AASM,SAAU,qBAAqB,OAAc;AACjD,MAAI,iBAAiB,YAAY;AAC/B,WAAO,MAAM;EACf;AACA,MAAI,iBAAiB,OAAO;AAC1B,WAAO,MAAM;EACf;AACA,SAAO;AACT;AAGM,SAAU,mBAAmB,OAAc;AAC/C,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,EAAE,cAAc,QAAQ;AACzE,WAAO;EACT;AACA,QAAM,WAAY,MAAiC;AACnD,SAAO,OAAO,aAAa,YAAY,OAAO,SAAS,QAAQ,IAC3D,WACA;AACN;AAGM,SAAU,wBAAwB,UAAgB;AACtD,QAAM,aAAa,KAAK,MAAM,QAAQ;AACtC,SAAO,aAAa,UAAU,UAC1B,aACA,UAAU;AAChB;AAGM,SAAU,iBAAiB,OAAc;AAC7C,SACE,OAAO,UAAU,YACjB,UAAU,QACV,UAAU,SACV,OAAQ,MAA6B,SAAS,YAC7C,MAA2B,KAAK,WAAW,YAAY;AAE5D;AAGM,SAAU,yBACd,OACA,SAAe;AAEf,MAAI,iBAAiB,OAAO;AAC1B,WAAO;EACT;AACA,QAAM,UAAU,IAAI,MAAM,OAAO;AACjC,QAAM,WAAW,mBAAmB,KAAK;AAEzC,MAAI,aAAa,QAAW;AAC1B,YAAQ,WAAW,wBAAwB,QAAQ;EACrD;AACA,SAAO;AACT;;;ACnDA,IAAM,+BAA+B,oBAAI,IAAY;EACnD;EACA;EACA;CACD;AAGD,IAAM,2BAA2B,CAAC,UAA0B;AAC1D,QAAM,cAAc,MAAM,QAAQ,GAAG;AACrC,SACE,cAAc,KACd,6BAA6B,IAAI,MAAM,MAAM,GAAG,WAAW,CAAC;AAEhE;AAGA,IAAM,+BAA+B,CAAC,SAAqC;AACzE,SAAO,OAAO,SAAS,YAAY,CAAC,KAAK,WAAW,GAAG;AACzD;AAEA,SAAS,wBACP,OACA,MAAwB;AAExB,MAAI,UAAU,YAAY,UAAU,aAAa;AAC/C,QAAI,OAAO,SAAS,YAAY,KAAK,SAAS,GAAG;AAC/C,aAAO;QACL,UAAU;QACV,WAAW;QACX,WAAW,UAAU;;IAEzB;AACA,WAAO;MACL,UAAU;MACV,WAAW,UAAU;;EAEzB;AAEA,QAAM,eAAe,MAAM,WAAW,SAAS,IAC3C,YACA,MAAM,WAAW,YAAY,IAC3B,eACA;AACN,MAAI,CAAC,cAAc;AACjB,WAAO;EACT;AAEA,QAAM,QAAQ,MAAM,MAAM,aAAa,MAAM;AAC7C,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO;MACL,UAAU;MACV,WAAW;MACX,WAAW,iBAAiB;;EAEhC;AACA,SAAO;IACL,UAAU;IACV,WAAW,iBAAiB;;AAEhC;AAsBA,IAAM,0BAA0B,oBAAI,IAAI;EACtC;EACA;EACA;EACA;EACA;CACD;AAGK,SAAU,4BACd,MAAc;AAEd,MAAI;AACJ,MAAI;AACJ,QAAM,eAAe,oBAAI,IAAG;AAC5B,MAAI;AACJ,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,QAAQ;AAC1B,UAAM,QAAQ,KAAK,KAAK;AACxB,QAAI,UAAU,MAAM;AAClB;IACF;AACA,QAAI,wBAAwB,IAAI,KAAK,GAAG;AACtC,mBAAa,IAAI,KAAK;AACtB,eAAS;AACT;IACF;AACA,UAAM,aAAa,wBAAwB,OAAO,KAAK,QAAQ,CAAC,CAAC;AACjE,QAAI,YAAY;AACd,UAAI,WAAW,cAAc,QAAW;AACtC,YAAI,WAAW,WAAW;AACxB,wBAAc,WAAW;QAC3B,OAAO;AACL,4BAAkB,WAAW;QAC/B;MACF;AACA,eAAS,WAAW;AACpB;IACF;AACA,QAAI,UAAU,YAAY;AACxB,UAAI,6BAA6B,KAAK,QAAQ,CAAC,CAAC,GAAG;AACjD,iBAAS,KAAK,QAAQ,CAAC;AACvB,iBAAS;MACX,OAAO;AACL,iBAAS;AACT,iBAAS;MACX;AACA;IACF;AACA,QAAI,MAAM,WAAW,WAAW,GAAG;AACjC,eAAS,MAAM,MAAM,YAAY,MAAM;AACvC,eAAS;AACT;IACF;AACA,aAAS;EACX;AACA,SAAO;IACL,MAAM,eAAe;IACrB,cAAc,aAAa,IAAI,iBAAiB;IAChD,SAAS,aAAa,IAAI,YAAY;IACtC,MAAM,aAAa,IAAI,QAAQ;IAC/B,OAAO,aAAa,IAAI,SAAS;IACjC,MAAM,aAAa,IAAI,QAAQ;IAC/B,GAAI,WAAW,KACX,EAAE,oBAAoB,KAAI,IAC1B,WAAW,SACT,EAAE,OAAM,IACR,CAAA;;AAEV;AAGM,SAAU,2BAA2B,MAAc;AACvD,QAAM,YAAsB,CAAA;AAC5B,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,QAAQ;AAC1B,UAAM,QAAQ,KAAK,KAAK;AACxB,QAAI,UAAU,MAAM;AAClB;IACF;AACA,QACE,UAAU,YACV,UAAU,aACV,UAAU,YACV,UAAU,qBACV,UAAU,gBACV,UAAU,eACV,UAAU,eACV,UAAU,2BACV,UAAU,aACV;AACA,eAAS;AACT;IACF;AACA,QAAI,UAAU,YAAY;AACxB,eAAS,6BAA6B,KAAK,QAAQ,CAAC,CAAC,IAAI,IAAI;AAC7D;IACF;AACA,QAAI,6BAA6B,IAAI,KAAK,GAAG;AAC3C,eAAS;AACT;IACF;AACA,QAAI,yBAAyB,KAAK,GAAG;AACnC,eAAS;AACT;IACF;AACA,cAAU,KAAK,KAAK;AACpB,aAAS;EACX;AACA,SAAO;AACT;AAWM,SAAU,0BACd,MAAc;AAEd,QAAM,WAAW,2BAA2B,IAAI;AAChD,QAAM,QAAQ,SAAS,CAAC,GAAG,KAAI,EAAG,YAAW;AAC7C,MAAI,UAAU,QAAQ;AACpB,UAAMA,qBAA8B,CAAA;AACpC,aAAS,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GAAG;AACvD,YAAM,QAAQ,SAAS,KAAK;AAC5B,UAAI,MAAM,WAAW,GAAG,GAAG;AACzB;MACF;AACA,MAAAA,mBAAkB,KAAK,MAAM,KAAI,EAAG,YAAW,CAAE;IACnD;AACA,WAAO;MACL,WAAW;MACX,mBAAAA;;EAEJ;AAEA,QAAM,gBAAgB,SAAS,UAC7B,CAAC,UAAU,UAAU,YAAY,UAAU,IAAI;AAEjD,MAAI,gBAAgB,GAAG;AACrB,WAAO;MACL,WAAW;MACX,mBAAmB,CAAA;;EAEvB;AAEA,QAAM,oBAA8B,CAAA;AACpC,aAAW,SAAS,UAAU;AAC5B,QAAI,MAAM,WAAW,GAAG,GAAG;AACzB;IACF;AACA,sBAAkB,KAAK,MAAM,KAAI,EAAG,YAAW,CAAE;EACnD;AACA,SAAO;IACL,WAAW;IACX;;AAEJ;AASA,SAAS,sBAAsB,MAAc;AAC3C,WAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS,GAAG;AACnD,UAAM,QAAQ,KAAK,KAAK;AACxB,QAAI,UAAU,MAAM;AAClB,aAAO;IACT;AACA,QAAI,UAAU,YAAY;AACxB,eAAS,6BAA6B,KAAK,QAAQ,CAAC,CAAC,IAAI,IAAI;AAC7D;IACF;AACA,QAAI,6BAA6B,IAAI,KAAK,GAAG;AAC3C,eAAS;AACT;IACF;AACA,QACE,yBAAyB,KAAK,KAC9B,UAAU,YACV,UAAU,aACV,UAAU,YACV,UAAU,qBACV,UAAU,gBACV,UAAU,eACV,UAAU,eACV,UAAU,aACV;AACA;IACF;AACA,QAAI,MAAM,WAAW,GAAG,GAAG;AACzB;IACF;AACA,WAAO;EACT;AACA,SAAO;AACT;AAGM,SAAU,0BAA0B,MAAc;AACtD,QAAM,QAAQ,sBAAsB,IAAI;AACxC,SAAO,UAAU,SAAY,SAAY,KAAK,KAAK,EAAE,KAAI,EAAG,YAAW;AACzE;AAEA,SAAS,gCACP,MACA,iBAAuC;AAEvC,MAAI,gBAAgB,SAAS;AAC3B,WAAO;EACT;AACA,MAAI,QAAQ,OAAO,UAAU,MAAM;AACjC,WAAO;EACT;AACA,QAAM,cAAc,0BAA0B,IAAI;AAClD,SAAO,YAAY;AACrB;AAGM,SAAU,0BAA0B,MAAc;AACtD,QAAM,uBAAuB;IAC3B;IACA;IACA;IACA;;AAEF,QAAM,iBAAiB,qBAAqB,IAAI,CAAC,QAAQ,QAAQ,IAAI,GAAG,CAAC;AACzE,QAAM,UAAU,MAAW;AACzB,eAAW,CAAC,OAAO,GAAG,KAAK,qBAAqB,QAAO,GAAI;AACzD,YAAM,QAAQ,eAAe,KAAK;AAClC,UAAI,UAAU,QAAW;AACvB,eAAO,QAAQ,IAAI,GAAG;MACxB,OAAO;AACL,gBAAQ,IAAI,GAAG,IAAI;MACrB;IACF;EACF;AACA,QAAM,kBAAkB,4BAA4B,IAAI;AACxD,MAAI,CAAC,gCAAgC,MAAM,eAAe,GAAG;AAC3D,WAAO;EACT;AACA,UAAQ,IAAI,QAAQ;AACpB,UAAQ,IAAI,WAAW;AACvB,UAAQ,IAAI,YAAY;AACxB,MACE,OAAO,QAAQ,IAAI,SAAS,YAC5B,QAAQ,IAAI,KAAK,KAAI,EAAG,WAAW,GACnC;AACA,YAAQ,IAAI,OAAO;EACrB;AACA,SAAO;AACT;AAcA,IAAM,iCAAiC,oBAAI,IAA+B;EACxE;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD;AAGK,SAAU,qCAAqC,MAAc;AACjE,QAAM,iBAAiB,sBAAsB,IAAI;AACjD,MAAI,mBAAmB,UAAa,KAAK,cAAc,MAAM,aAAa;AACxE,WAAO,CAAC,GAAG,IAAI;EACjB;AACA,QAAM,cAAc,KAAK,iBAAiB,CAAC;AAC3C,MAAI,CAAC,eAAe,YAAY,WAAW,GAAG,GAAG;AAC/C,WAAO,CAAC,GAAG,IAAI;EACjB;AACA,MACE,CAAC,+BAA+B,IAC9B,WAAwC,GAE1C;AACA,WAAO,CAAC,GAAG,IAAI;EACjB;AACA,MAAI,KAAK,SAAS,QAAQ,KAAK,KAAK,SAAS,IAAI,GAAG;AAClD,WAAO,CAAC,GAAG,IAAI;EACjB;AACA,QAAM,mBAAmB,KAAK,WAAW;AACzC,MAAI,KAAK,SAAS,gBAAgB,GAAG;AACnC,WAAO,CAAC,GAAG,IAAI;EACjB;AACA,SAAO;IACL,GAAG,KAAK,MAAM,GAAG,iBAAiB,CAAC;IACnC;IACA,GAAG,KAAK,MAAM,iBAAiB,CAAC;;AAEpC;AAkBA,SAAS,oBACP,MACA,OAAoC;AAEpC,QAAM,QAAQ,sBAAsB,IAAI;AACxC,MAAI,UAAU,QAAW;AACvB,WAAO;EACT;AACA,QAAM,QAAQ,KAAK,KAAK;AACxB,QAAM,YAAY,2BAA2B,MAAM,KAAI,EAAG,YAAW,CAAE;AACvE,MAAI,CAAC,WAAW;AACd,WAAO;EACT;AACA,QAAM,YAAY,CAAC,GAAG,IAAI;AAC1B,YAAU,KAAK,IAAI;AACnB,QAAM,KAAK;IACT,MAAM;IACN,IAAI,CAAC,SAAS;IACd,QAAQ;IACR,YAAY;GACb;AACD,SAAO;AACT;AA+BA,SAAS,sBAAsB,KAAW;AACxC,QAAM,gBAAgB,IAAI,QAAQ,QAAQ,EAAE;AAC5C,SAAO,cACJ,QAAQ,MAAM,GAAG,EACjB,QAAQ,sBAAsB,OAAO,EACrC,YAAW;AAChB;AAEA,SAAS,oBAAoB,KAAW;AACtC,SAAO,sBAAsB,GAAG,EAAE,QAAQ,MAAM,EAAE;AACpD;AAEA,SAAS,oBACP,KACA,KACA,eAAqB;AAErB,QAAM,WAAW,IAAI,IAAI,GAAG;AAC5B,MAAI,aAAa,QAAW;AAC1B,QAAI,IAAI,KAAK,aAAa;AAC1B;EACF;AACA,MAAI,aAAa,eAAe;AAC9B,QAAI,IAAI,KAAK,IAAI;EACnB;AACF;AAEA,SAAS,0BAA0B,UAAyB;AAC1D,QAAM,aAAuB,CAAA;AAC7B,QAAM,eAAe,CAAC,UAAmC;AACvD,QAAI,OAAO,UAAU,UAAU;AAC7B;IACF;AACA,QAAI,CAAC,MAAM,WAAW,IAAI,GAAG;AAC3B;IACF;AACA,eAAW,KAAK,KAAK;EACvB;AACA,eAAa,SAAS,IAAI;AAC1B,aAAW,SAAS,SAAS,WAAW,CAAA,GAAI;AAC1C,iBAAa,KAAK;EACpB;AACA,SAAO;AACT;AAEA,SAAS,gBACP,aACA,mBAAqC;AAErC,QAAM,YACJ,qBAAqB,yCAAyC,WAAW;AAC3E,QAAM,wBAAwB,oBAAI,IAAG;AACrC,QAAM,qBAAqB,oBAAI,IAAG;AAClC,QAAM,0BAA0B,oBAAI,IAAG;AACvC,QAAM,qBAAqB,oBAAI,IAAG;AAClC,aAAW,YAAY,WAAW;AAChC,UAAM,iBAAiB,0BAA0B,QAAQ;AACzD,QAAI,eAAe,WAAW,GAAG;AAC/B;IACF;AACA,UAAM,gBAAgB,KAAK,sBAAsB,eAAe,CAAC,CAAC,CAAC;AACnE,eAAW,aAAa,gBAAgB;AACtC,0BACE,uBACA,sBAAsB,SAAS,GAC/B,aAAa;AAEf,0BACE,oBACA,oBAAoB,SAAS,GAC7B,aAAa;IAEjB;AACA,UAAM,aAAa,oBAAoB,aAAa;AACpD,QAAI,CAAC,wBAAwB,IAAI,aAAa,GAAG;AAC/C,8BAAwB,IAAI,eAAe,UAAU;IACvD;AACA,QAAI,SAAS,SAAS,MAAM;AAC1B,yBAAmB,IAAI,aAAa;IACtC;EACF;AACA,SAAO;IACL;IACA;IACA,sBAAsB,CAAC,GAAG,wBAAwB,QAAO,CAAE,EAAE,IAC3D,CAAC,CAAC,eAAe,UAAU,OAAO;MAChC;MACA;MACA;IAEJ;;AAEJ;AAEA,SAAS,qBACP,QACA,QAAkB;AAMlB,QAAM,gBAAgB,sBAAsB,MAAM;AAClD,QAAM,SAAS,OAAO,sBAAsB,IAAI,aAAa;AAC7D,MAAI,OAAO,WAAW,UAAU;AAC9B,WAAO;MACL,MAAM;MACN,QAAQ;MACR,YAAY;;EAEhB;AACA,QAAM,gBAAgB,cAAc,QAAQ,MAAM,EAAE;AACpD,QAAM,eAAe,OAAO,mBAAmB,IAAI,aAAa;AAChE,MAAI,OAAO,iBAAiB,UAAU;AACpC,WAAO;MACL,MAAM;MACN,QAAQ;MACR,YAAY;;EAEhB;AACA,QAAM,cAAc,cAAc,UAAU,IAAI,IAAI;AACpD,MAAI,eAAe,OAAO;AAC1B,MAAI;AACJ,MAAI,OAAO;AACX,aAAW,aAAa,OAAO,sBAAsB;AACnD,UAAM,WAAW,+BACf,eACA,UAAU,YACV,WAAW;AAEb,QAAI,aAAa,MAAM;AACrB;IACF;AACA,QAAI,WAAW,cAAc;AAC3B,qBAAe;AACf,iBAAW,UAAU;AACrB,aAAO;AACP;IACF;AACA,QAAI,aAAa,gBAAgB,aAAa,UAAU,eAAe;AACrE,aAAO;IACT;EACF;AACA,MACE,CAAC,YACD,QACA,CAAC,OAAO,SAAS,YAAY,KAC7B,gBAAgB,GAChB;AACA,WAAO;EACT;AACA,SAAO;IACL,MAAM;IACN,QAAQ;IACR,YAAY,gBAAgB,IAAI,WAAW;;AAE/C;AAGM,SAAU,oBAAoB,eAAqB;AACvD,QAAM,aAAa,CAAC,GAAG,aAAa,GAAG;AACvC,MAAI,cAAc,SAAS,GAAG,KAAK,cAAc,SAAS,GAAG;AAC3D,eAAW,KAAK,GAAG,cAAc,MAAM,GAAG,EAAE,CAAC,KAAK;EACpD;AACA,SAAO;AACT;AAEA,SAAS,uBACP,OACA,WAAW,OAAK;AAEhB,MAAI,YAAY,MAAM,SAAS,KAAK,GAAG;AACrC,WAAO;EACT;AACA,QAAM,QAAQ,MAAM,MAAM,2CAA2C;AACrE,MAAI,CAAC,OAAO;AACV,WAAO;EACT;AACA,QAAM,MAAM,MAAM,CAAC;AACnB,QAAM,QAAQ,MAAM,CAAC;AACrB,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO;EACT;AACA,SAAO;IACL;IACA;;AAEJ;AAEA,SAAS,yBACP,OACA,QACA,WAAW,OAAK;AAEhB,MAAI,YAAY,CAAC,MAAM,WAAW,IAAI,GAAG;AACvC,WAAO,EAAE,QAAQ,CAAC,KAAK,EAAC;EAC1B;AACA,QAAM,cAAc,MAAM,QAAQ,GAAG;AACrC,QAAM,MAAM,eAAe,IAAI,MAAM,MAAM,GAAG,WAAW,IAAI;AAC7D,QAAM,cACJ,eAAe,IAAI,MAAM,MAAM,cAAc,CAAC,IAAI;AACpD,QAAM,aAAa,qBAAqB,KAAK,MAAM;AACnD,MAAI,CAAC,YAAY;AACf,WAAO,EAAE,QAAQ,CAAC,KAAK,EAAC;EAC1B;AACA,QAAM,kBACJ,gBAAgB,SACZ,WAAW,OACX,GAAG,WAAW,IAAI,IAAI,WAAW;AACvC,MAAI,oBAAoB,OAAO;AAC7B,WAAO,EAAE,QAAQ,CAAC,KAAK,EAAC;EAC1B;AACA,SAAO;IACL,QAAQ,CAAC,eAAe;IACxB,OAAO;MACL,MAAM;MACN,IAAI,CAAC,eAAe;MACpB,QAAQ,WAAW;MACnB,YAAY,WAAW;;;AAG7B;AAGA,SAAS,iCAAiC,MAAc;AACtD,QAAM,UAAU,oBAAI,IAAG;AACvB,MAAI,eAAe;AACnB,WAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS,GAAG;AACnD,QAAI,cAAc;AAChB,cAAQ,IAAI,KAAK;AACjB,qBAAe;AACf;IACF;AACA,UAAM,QAAQ,KAAK,KAAK;AACxB,mBAAe,UAAU,YAAY,UAAU;EACjD;AACA,SAAO;AACT;AAOA,SAAS,wBACP,OAAa;AAEb,MAAI,CAAC,MAAM,WAAW,IAAI,GAAG;AAC3B,WAAO;EACT;AACA,QAAM,cAAc,MAAM,QAAQ,GAAG;AACrC,MAAI,cAAc,GAAG;AACnB,WAAO,EAAE,MAAM,MAAK;EACtB;AACA,SAAO;IACL,MAAM,MAAM,MAAM,GAAG,WAAW;IAChC,aAAa,MAAM,MAAM,cAAc,CAAC;;AAE5C;AAoBA,SAAS,uBACP,MACA,OACA,QAAyB;AAEzB,SAAO,KAAK,KAAK,KAAK,CAAC;AACvB,QAAM,OAAO,KAAK,QAAQ,CAAC;AAC3B,MAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC7C,WAAO,KAAK,IAAI;AAChB,WAAO,QAAQ;EACjB;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,uBACP,MACA,OACA,QACA,qBAAgC;AAEhC,MAAI,OAAO,gBAAgB,QAAW;AACpC,WAAO;MACL,gBAAgB,CAAC,KAAK,KAAK,CAAC;MAC5B,OAAO,OAAO;MACd,UAAU;;EAEd;AAEA,QAAM,SAAmB,CAAA;AACzB,MAAI,aAAa,QAAQ;AACzB,SACE,aAAa,KAAK,UAClB,KAAK,UAAU,MAAM,QACrB,CAAC,KAAK,UAAU,EAAE,WAAW,GAAG,MAC/B,OAAO,WAAW,KAAK,oBAAoB,IAAI,OAAO,IAAI,IAC3D;AACA,WAAO,KAAK,KAAK,UAAU,CAAC;AAC5B,kBAAc;EAChB;AAEA,QAAM,WAAW,OAAO,WAAW,IAAI,IAAI,IAAI,OAAO;AACtD,SAAO;IACL,gBAAgB,KAAK,MAAM,OAAO,QAAQ,QAAQ;IAClD,OAAO,OAAO,WAAW,IAAI,SAAY,OAAO,KAAK,GAAG;IACxD;;AAEJ;AAEA,SAAS,yBACP,OACA,QACA,MACA,YAAoC;AAEpC,QAAM,WAAW,MAAM,IAAI,IAAI;AAC/B,MAAI,UAAU;AACZ,aAAS,OAAO,KAAK,WAAW,KAAK;AACrC,aAAS,eAAe;AACxB;EACF;AAEA,QAAM,IAAI,MAAM;IACd,aAAa,OAAO;IACpB,gBAAgB,WAAW;IAC3B,QAAQ,CAAC,WAAW,KAAK;IACzB,aAAa;GACd;AAGD,SAAO,KAAK,IAAI;AAClB;AAEA,SAAS,+BACP,OACA,qBAAgC;AAKhC,QAAM,SAAwC,CAAA;AAC9C,QAAM,UAA4D,CAAA;AAClE,aAAW,CAAC,MAAM,IAAI,KAAK,OAAO;AAChC,UAAM,cACJ,KAAK,eAAe,KACnB,oBAAoB,IAAI,IAAI,KAAK,KAAK,eAAe,SAAS;AACjE,QAAI,CAAC,aAAa;AAChB,cAAQ,KAAK;QACX,aAAa,KAAK;QAClB,QAAQ,KAAK;OACd;AACD;IACF;AACA,UAAM,cAAc,GAAG,IAAI,IAAI,KAAK,OAAO,KAAK,GAAG,CAAC;AACpD,YAAQ,KAAK,EAAE,aAAa,KAAK,aAAa,QAAQ,CAAC,WAAW,EAAC,CAAE;AACrE,WAAO,KAAK;MACV,MAAM,GAAG,IAAI,MAAM,KAAK,WAAW;MACnC,IAAI,CAAC,WAAW;MAChB,QAAQ;MACR,YAAY;KACb;EACH;AACA,SAAO,EAAE,QAAQ,QAAO;AAC1B;AAEA,SAAS,qBACP,QACA,SAAyD;AAEzD,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;AACpD,aAAW,UAAU,SAAS;AAC5B,WAAO,OAAO,OAAO,aAAa,GAAG,GAAG,OAAO,MAAM;EACvD;AACF;AAeM,SAAU,0BACd,MACA,WACA,sBAAmC,oBAAI,IAAG,GAC1C,sBAAmC,oBAAI,IAAG,GAAE;AAE5C,MAAI,UAAU,SAAS,GAAG;AACxB,WAAO,EAAE,MAAM,CAAC,GAAG,IAAI,GAAG,QAAQ,CAAA,EAAE;EACtC;AAEA,QAAM,SAA4B,CAAA;AAClC,QAAM,QAAQ,oBAAI,IAAG;AACrB,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,QAAQ;AAC1B,UAAM,QAAQ,KAAK,KAAK;AACxB,QAAI,UAAU,MAAM;AAClB,aAAO,KAAK,GAAG,KAAK,MAAM,KAAK,CAAC;AAChC;IACF;AAIA,QAAI,oBAAoB,IAAI,KAAK,GAAG;AAClC,cAAQ,uBAAuB,MAAM,OAAO,MAAM;AAClD;IACF;AACA,UAAM,SAAS,wBAAwB,KAAK;AAC5C,QAAI,CAAC,UAAU,CAAC,UAAU,IAAI,OAAO,IAAI,GAAG;AAC1C,aAAO,KAAK,KAAK;AACjB,eAAS;AACT;IACF;AAEA,UAAM,aAAa,uBACjB,MACA,OACA,QACA,mBAAmB;AAErB,QAAI,WAAW,UAAU,QAAW;AAElC,aAAO,KAAK,KAAK;AACjB,eAAS,WAAW;AACpB;IACF;AAEA,6BAAyB,OAAO,QAAQ,OAAO,MAAM;MACnD,gBAAgB,WAAW;MAC3B,OAAO,WAAW;KACnB;AACD,aAAS,WAAW;EACtB;AAIA,QAAM,EAAE,QAAQ,QAAO,IAAK,+BAC1B,OACA,mBAAmB;AAErB,uBAAqB,QAAQ,OAAO;AAEpC,SAAO,EAAE,MAAM,QAAoB,OAAM;AAC3C;AAGA,IAAM,qCAGF,oBAAI,IAAI;EACV,CAAC,SAAS,oBAAI,IAAI,CAAC,WAAW,OAAO,MAAM,CAAC,CAAC;EAC7C,CAAC,YAAY,oBAAI,IAAI,CAAC,WAAW,MAAM,CAAC,CAAC;CAC1C;AAGD,SAAS,kCACP,aACA,eAAgC;AAEhC,MAAI,gBAAgB,UAAU,cAAc,SAAS,GAAG;AACtD,WAAO;EACT;AACA,QAAM,MAAM,cAAc,cAAc,SAAS,CAAC;AAClD,QAAM,OAAO,cAAc,cAAc,SAAS,CAAC;AACnD,QAAM,OAAO,mCAAmC,IAAI,IAAI;AACxD,SAAO,SAAS,UAAa,KAAK,IAAI,GAAG;AAC3C;AAEA,SAAS,gCACP,aACA,eAAgC;AAEhC,SACE,gBAAgB,YAChB,kCAAkC,aAAa,aAAa;AAEhE;AAGM,SAAU,+BACd,MACA,aACA,OAAoC;AAEpC,MAAI,gBAAgB,QAAQ;AAC1B,WAAO;EACT;AACA,QAAM,SAAmB,CAAA;AACzB,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,QAAQ;AAC1B,UAAM,QAAQ,KAAK,KAAK;AACxB,QAAI,UAAU,MAAM;AAClB,aAAO,KAAK,GAAG,KAAK,MAAM,KAAK,CAAC;AAChC,aAAO;IACT;AACA,UAAM,OAAO,mCAAmC,IAAI,KAAK;AACzD,UAAM,MAAM,OAAO,KAAK,QAAQ,CAAC,IAAI;AACrC,QAAI,CAAC,QAAQ,OAAO,QAAQ,YAAY,CAAC,KAAK,IAAI,GAAG,GAAG;AACtD,aAAO,KAAK,KAAK;AACjB,eAAS;AACT;IACF;AACA,QAAI,SAAS,QAAQ;AACrB,WAAO,SAAS,KAAK,UAAU,CAAC,KAAK,MAAM,EAAE,WAAW,GAAG,GAAG;AAC5D,gBAAU;IACZ;AACA,QAAI,UAAU,QAAQ,OAAO,GAAG;AAC9B,aAAO,KAAK,KAAK;AACjB,eAAS;AACT;IACF;AACA,UAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,UAAM,cAAc,GAAG,GAAG,IAAI,KAAK;AACnC,WAAO,KAAK,OAAO,WAAW;AAC9B,UAAM,KAAK;MACT,MAAM,GAAG,KAAK,IAAI,GAAG,IAAI,KAAK;MAC9B,IAAI,CAAC,OAAO,WAAW;MACvB,QAAQ;MACR,YAAY;KACb;AACD,aAAS;EACX;AACA,SAAO;AACT;AAGM,SAAU,6BACd,MAAc;AAEd,QAAM,QAAuC,CAAA;AAC7C,QAAM,mBAAmB,qCAAqC,IAAI;AAClE,MACE,iBAAiB,WAAW,KAAK,UACjC,iBAAiB,KAAK,CAAC,OAAO,UAAU,UAAU,KAAK,KAAK,CAAC,GAC7D;AACA,UAAM,KAAK;MACT,MAAM,KAAK,KAAK,GAAG;MACnB,IAAI,CAAC,GAAG,gBAAgB;MACxB,QAAQ;MACR,YAAY;KACb;EACH;AACA,QAAM,kBAAkB,oBAAoB,kBAAkB,KAAK;AACnE,QAAM,cAAc,0BAA0B,eAAe;AAC7D,QAAM,kBAAkB,8BAA8B,eAAe;AACrE,QAAM,SAAS,gBAAgB,mBAAmB,WAAW;AAC7D,QAAM,iBAA2B,CAAA;AACjC,QAAM,mBAAmB,iCAAiC,eAAe;AACzE,WAAS,QAAQ,GAAG,QAAQ,gBAAgB,QAAQ,SAAS,GAAG;AAC9D,UAAM,QAAQ,gBAAgB,KAAK;AACnC,QAAI,UAAU,MAAM;AAClB,qBAAe,KAAK,GAAG,gBAAgB,MAAM,KAAK,CAAC;AACnD;IACF;AACA,UAAM,uBAAuB,iBAAiB,IAAI,KAAK;AACvD,UAAM,WAAW,eAAe,eAAe,SAAS,CAAC;AACzD,QAAI,MAAM,WAAW,IAAI,GAAG;AAC1B,YAAM,kBAAkB,yBACtB,OACA,QACA,oBAAoB;AAEtB,qBAAe,KAAK,GAAG,gBAAgB,MAAM;AAC7C,UAAI,gBAAgB,OAAO;AACzB,cAAM,KAAK,gBAAgB,KAAK;MAClC;AACA;IACF;AACA,UAAM,eAAe,uBAAuB,OAAO,oBAAoB;AACvE,QACE,gBACA,EAAE,OAAO,aAAa,YAAY,SAAS,WAAW,GAAG,MACzD,CAAC,gCAAgC,aAAa,cAAc,GAC5D;AACA,YAAM,aAAa,qBAAqB,aAAa,KAAK,MAAM;AAChE,UAAI,YAAY;AACd,cAAM,cAAc,CAAC,WAAW,MAAM,aAAa,KAAK;AACxD,uBAAe,KAAK,GAAG,WAAW;AAClC,cAAM,KAAK;UACT,MAAM;UACN,IAAI;UACJ,QAAQ;UACR,YAAY,WAAW;SACxB;AACD;MACF;IACF;AACA,mBAAe,KAAK,KAAK;EAC3B;AACA,QAAM,uBAAuB,+BAC3B,gBACA,aACA,KAAK;AAEP,QAAM,YAAY,0BAChB,sBACA,OAAO,oBACP,8BACA,gBAAgB,WAAW,oBAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,oBAAI,IAAG,CAAE;AAE5D,aAAW,SAAS,UAAU,QAAQ;AACpC,UAAM,KAAK,KAAK;EAClB;AACA,SAAO;IACL,MAAM,UAAU;IAChB;IACA;;AAEJ;AAEA,SAAS,8BAA8B,MAAc;AACnD,QAAM,WAAW,2BAA2B,IAAI;AAChD,QAAM,QAAQ,SAAS,CAAC,GAAG,KAAI,EAAG,YAAW;AAC7C,QAAM,SAAS,SAAS,CAAC,GAAG,KAAI,EAAG,YAAW;AAC9C,OACG,UAAU,eAAe,UAAU,aAAa,UAAU,eAC3D,OAAO,WAAW,YAClB,OAAO,SAAS,KAChB,CAAC,OAAO,WAAW,GAAG,GACtB;AACA,WAAO,GAAG,KAAK,IAAI,MAAM;EAC3B;AACA,SAAO;AACT;AAGM,SAAU,wBAAwB,MAAc;AACpD,WAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS,GAAG;AACnD,UAAM,QAAQ,KAAK,KAAK;AACxB,QAAI,UAAU,MAAM;AAClB;IACF;AACA,QAAI,UAAU,UAAU;AACtB,YAAM,YAAY,KAAK,QAAQ,CAAC;AAChC,UAAI,OAAO,cAAc,YAAY,UAAU,KAAI,EAAG,SAAS,GAAG;AAChE,eAAO,UAAU,KAAI;MACvB;AACA;IACF;AACA,QAAI,MAAM,WAAW,SAAS,GAAG;AAC/B,YAAM,YAAY,MAAM,MAAM,UAAU,MAAM,EAAE,KAAI;AACpD,UAAI,UAAU,SAAS,GAAG;AACxB,eAAO;MACT;IACF;EACF;AACA,SAAO;AACT;;;ACrnCM,SAAU,8BACd,QAA0B;AAE1B,MAAI,WAAW,QAAW;AACxB,WAAO,MAAK;IAAE;EAChB;AACA,QAAM,mBAAmB,OAAO,KAAI;AACpC,MAAI,iBAAiB,WAAW,GAAG;AACjC,UAAM,IAAI,WACR,wCACA,UAAU,OACV;MACE,MAAM;MACN,WAAW,CAAC,wDAAwD;KACrE;EAEL;AACA,QAAM,iBAAiB,QAAQ,IAAI;AACnC,UAAQ,IAAI,YAAY;AACxB,MAAI,WAAW;AACf,SAAO,MAAK;AACV,QAAI,UAAU;AACZ;IACF;AACA,eAAW;AACX,QAAI,mBAAmB,QAAW;AAChC,aAAO,QAAQ,IAAI;IACrB,OAAO;AACL,cAAQ,IAAI,YAAY;IAC1B;EACF;AACF;;;ACnCA,SAAS,eAAe;AAIlB,SAAU,mBAAmB,SAAe;AAChD,SAAO,IAAI,QAAO,EACf,KAAK,IAAI,EACT,YACC,kHAAkH,EAEnH,QAAQ,OAAO,EACf,mBAAmB,KAAK,EACxB,qBAAqB,KAAK,EAC1B,mBAAmB,KAAK,EACxB,gBAAgB;IACf,UAAU,CAAC,UAAS;AAClB,kBAAY,KAAK;IACnB;IACA,UAAU,MAAK;IAAE;GAClB,EACA,OAAO,UAAU,6BAA6B,EAC9C,OAAO,UAAU,iDAAiD,EAClE,OAAO,WAAW,wBAAwB,EAC1C,OACC,uBACA,gFAAgF,EAEjF,OACC,yBACA,oEAAoE,EAErE,OACC,aACA,0DAA0D,EAE3D,OACC,mBACA,wEAAwE,EAEzE,OACC,gBACA,gGAAgG,EAEjG,OAAO,mBAAmB,2BAA2B,EACrD,OAAO,cAAc,oDAAoD,EACzE,OACC,aACA,uDAAuD,EAExD,OAAO,aAAa,wCAAwC,EAC5D,OAAO,iBAAiB,8CAA8C,EACtE,aAAY;AACjB","debugId":"39413a08-0b6f-5fb4-8e45-d039b2979e25"}

package/dist/cli-bundle/chunks/{chunk-E7ICD63T.js → chunk-FO6OSVEN.js}

@@ -1,13 +1,11 @@
 import {
   EXECUTABLE_COMMAND_ALIASES,
   PM_CORE_COMMAND_NAMES
-} from "./chunk-HEWM6CEN.js";
+} from "./chunk-P7MTHPJQ.js";
 import {
+  ensurePmGitignore,
   ensureTypeFolderScaffold
-} from "./chunk-3AO5VSDR.js";
-import {
-  ensurePmGitignore
-} from "./chunk-R5U2VZ3K.js";
+} from "./chunk-7RW4JCU2.js";
 import {
   splitCommaList
 } from "./chunk-D6HZN36B.js";
@@ -7539,4 +7537,4 @@ export {
   _testOnly2,
   runInit
 };
-//# sourceMappingURL=chunk-E7ICD63T.js.map
+//# sourceMappingURL=chunk-FO6OSVEN.js.map