@unbrained/pm-cli 2026.7.20 → 2026.7.21

package/dist/sdk/graph/run.js.map

@@ -1 +1 @@
-{"version":3,"file":"run.js","sources":["sdk/graph/run.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/run\n *\n * Workspace-facing `pm graph` runner: one thin orchestrator that loads the\n * tracker once, resolves the fingerprint-keyed workspace assembly through the\n * shared graph cache, and dispatches bounded traversal, path, impact,\n * analytics, governance-audit, and remediation-planning queries through the\n * public graph toolkit. Every projection is counts-first, deterministic, and\n * carries explicit cost, truncation, and cache metadata so agents can budget\n * follow-up reads without re-scanning the workspace; identical repeated\n * queries in long-lived hosts are answered from the memoized snapshot.\n */\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { isTerminalStatus } from \"../../core/item/status.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { resolveRuntimeStatusRegistry } from \"../../core/schema/runtime-schema.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { listAllItemMetadataLight } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport {\n  parseDirection,\n  parseKinds,\n  parseMaxDepth,\n  parsePositiveInteger,\n} from \"../dependencies.js\";\nimport {\n  analyzeGraphImpact,\n  analyzeKnowledgeGraph,\n  analyzeRelationshipExecution,\n} from \"../relationship-analytics.js\";\nimport type { RelationshipQueryMeta } from \"../relationships.js\";\nimport {\n  computeRelationshipDominators,\n  detectRelationshipCommunities,\n  findRedundantRelationshipEdges,\n} from \"./analytics.js\";\nimport {\n  assembleWorkspaceRelationshipGraph,\n  type WorkspaceRelationshipAssembly,\n} from \"./assembly.js\";\nimport {\n  computeWorkspaceGraphFingerprint,\n  workspaceGraphCache,\n  type GraphCacheMetadata,\n} from \"./cache.js\";\nimport {\n  auditWorkspaceRelationshipGraph,\n  type RelationshipAuditReport,\n} from \"./governance.js\";\nimport {\n  planRelationshipRemediation,\n  type RelationshipRemediationStep,\n} from \"./remediation.js\";\nimport {\n  enumerateRelationshipPaths,\n  hierarchyAncestors,\n  hierarchyDescendants,\n  orderingPredecessors,\n  orderingSuccessors,\n} from \"./traversal.js\";\n\nimport {\n  GRAPH_SUBCOMMAND_VALUES,\n  type GraphSubcommand,\n} from \"../cli-contracts/enum-contracts.js\";\n\nexport { GRAPH_SUBCOMMAND_VALUES, type GraphSubcommand };\n\n/** Graph subcommands that require a root item id. */\nconst ROOTED_SUBCOMMANDS = new Set<GraphSubcommand>([\n  \"ancestors\",\n  \"descendants\",\n  \"predecessors\",\n  \"successors\",\n  \"paths\",\n  \"impact\",\n  \"dominators\",\n]);\n\n/** Default bounded sample rows returned by analyze/audit projections. */\nconst DEFAULT_SAMPLE_LIMIT = 10;\n\n/** Documents the graph command options payload exchanged by command, SDK, and package integrations. */\nexport interface GraphCommandOptions {\n  /** Restricts traversal to registered relationship kinds (repeatable or comma-separated). */\n  kind?: string | string[];\n  /** Maximum traversal depth as a non-negative integer. */\n  maxDepth?: string | number;\n  /** Maximum returned rows per bounded collection. */\n  limit?: string | number;\n  /** Resume a traversal after this previously returned node id. */\n  after?: string;\n  /** Edge orientation for paths and impact queries (outgoing, incoming, or both). */\n  direction?: string;\n  /** Maximum enumerated paths for the paths subcommand. */\n  maxPaths?: string | number;\n  /** Maximum evidence sample entries per audit finding. */\n  sample?: string | number;\n  /** Item ids treated as explicitly valid isolates by the audit. */\n  exemptIsolate?: string | string[];\n  /** Return counts-first envelopes without row collections. */\n  summary?: boolean;\n}\n\n/** Cost metadata attached to every graph query projection. */\nexport interface GraphQueryCost {\n  /** Nodes expanded while answering the query. */\n  visited_nodes: number;\n  /** Edges inspected while answering the query. */\n  inspected_edges: number;\n}\n\n/** Result envelope for the transitive traversal subcommands. */\nexport interface GraphTraversalResult {\n  /** Executed graph subcommand. */\n  subcommand: \"ancestors\" | \"descendants\" | \"predecessors\" | \"successors\";\n  /** Canonical root item id. */\n  root: string;\n  /** Total emitted node ids before summary suppression. */\n  count: number;\n  /** Whether configured bounds omitted reachable work. */\n  truncated: boolean;\n  /** Cursor resuming emission after the last returned node. */\n  next_cursor?: string;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Emitted node ids in deterministic breadth-first order; absent with summary. */\n  ids?: string[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One enumerated path projected with relationship kinds instead of raw edges. */\nexport interface GraphPathRow {\n  /** Ordered node ids from source to target inclusive. */\n  nodes: string[];\n  /** Relationship kind of each traversed edge, in path order. */\n  kinds: string[];\n  /** Number of edges in the path. */\n  length: number;\n}\n\n/** Result envelope for the paths subcommand. */\nexport interface GraphPathsResult {\n  /** Executed graph subcommand. */\n  subcommand: \"paths\";\n  /** Canonical source item id. */\n  root: string;\n  /** Canonical target item id. */\n  target: string;\n  /** Traversal orientation used for the enumeration. */\n  direction: string;\n  /** Total enumerated paths before summary suppression. */\n  count: number;\n  /** Whether depth, path-count, or safety bounds stopped the search early. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Enumerated paths, shortest first; absent with summary. */\n  paths?: GraphPathRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One affected item row in an impact projection. */\nexport interface GraphImpactRow {\n  /** Affected item id. */\n  id: string;\n  /** Shortest relationship distance from the root. */\n  distance: number;\n  /** Exact node path explaining why the item is affected. */\n  path: string[];\n}\n\n/** Result envelope for the impact subcommand. */\nexport interface GraphImpactResult {\n  /** Executed graph subcommand. */\n  subcommand: \"impact\";\n  /** Canonical impact-origin item id. */\n  root: string;\n  /** Traversal orientation used for the blast-radius walk. */\n  direction: string;\n  /** Total affected items before summary suppression. */\n  count: number;\n  /** Whether configured bounds omitted reachable work. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Affected item rows ordered by discovery; absent with summary. */\n  affected?: GraphImpactRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Bounded execution-graph projection inside an analyze result. */\nexport interface GraphExecutionSummary {\n  /** Whether the order-bearing graph is acyclic. */\n  acyclic: boolean;\n  /** Nodes participating in the topological order. */\n  ordered_node_count: number;\n  /** Number of parallelizable topological layers. */\n  layer_count: number;\n  /** Total items with no open prerequisites. */\n  frontier_count: number;\n  /** Bounded prerequisite-free sample; absent with summary. */\n  frontier?: string[];\n  /** Edge count of the longest execution path. */\n  critical_path_length: number;\n  /** Longest deterministic execution path; absent with summary. */\n  critical_path?: string[];\n  /** Total genuine ordering cycles. */\n  cycle_count: number;\n  /** Bounded ordering-cycle sample; absent with summary. */\n  cycles?: string[][];\n}\n\n/** Bounded knowledge-graph projection inside an analyze result. */\nexport interface GraphKnowledgeSummary {\n  /** Total weakly connected components. */\n  component_count: number;\n  /** Node count of the largest component. */\n  largest_component_size: number;\n  /** Total nodes without any relationship edges. */\n  orphan_count: number;\n  /** Bounded orphan sample; absent with summary. */\n  orphans?: string[];\n  /** Bounded maximum-degree hubs; absent with summary. */\n  hubs?: { id: string; degree: number }[];\n}\n\n/** Result envelope for the analyze subcommand. */\nexport interface GraphAnalyzeResult {\n  /** Executed graph subcommand. */\n  subcommand: \"analyze\";\n  /** Total indexed graph nodes. */\n  node_count: number;\n  /** Total deduplicated graph edges. */\n  edge_count: number;\n  /** Bound applied to every sample collection. */\n  sample_limit: number;\n  /** Execution-order analytics over registered ordering kinds. */\n  execution: GraphExecutionSummary;\n  /** Structural analytics over every stored edge. */\n  knowledge: GraphKnowledgeSummary;\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Result envelope for the audit subcommand. */\nexport interface GraphAuditResult {\n  /** Executed graph subcommand. */\n  subcommand: \"audit\";\n  /** Total audit findings. */\n  finding_count: number;\n  /** Finding counts keyed by severity. */\n  findings_by_severity: Record<string, number>;\n  /** Finding-row counts keyed by finding code. Before 2026.7.19 this field incorrectly accumulated affected subjects; consumers of that unit must migrate to affected_subjects_by_code. */\n  findings_by_code: Record<string, number>;\n  /** Affected-subject counts keyed by severity. */\n  affected_subjects_by_severity: Record<string, number>;\n  /** Affected-subject counts keyed by finding code. */\n  affected_subjects_by_code: Record<string, number>;\n  /** Structural coverage metrics computed during the audit. */\n  profile: RelationshipAuditReport[\"profile\"];\n  /** Ordered findings with bounded evidence samples; absent with summary. */\n  findings?: RelationshipAuditReport[\"findings\"];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One bounded community row projected by the communities subcommand. */\nexport interface GraphCommunityRow {\n  /** Lexicographically smallest member id, naming the community. */\n  representative: string;\n  /** Total member count before sampling. */\n  size: number;\n  /** Bounded sorted member sample. */\n  members: string[];\n}\n\n/** Result envelope for the communities subcommand. */\nexport interface GraphCommunitiesResult {\n  /** Executed graph subcommand. */\n  subcommand: \"communities\";\n  /** Total detected communities meeting the size floor. */\n  community_count: number;\n  /** Member count of the largest community. */\n  largest_community_size: number;\n  /** Label-propagation sweeps executed. */\n  iterations: number;\n  /** Whether labels stabilized before the iteration bound. */\n  converged: boolean;\n  /** Whether the iteration bound stopped propagation early or the sample bound omitted rows. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Bounded community rows, largest first; absent with summary. */\n  communities?: GraphCommunityRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One redundant stored edge projected with its witness path. */\nexport interface GraphRedundancyRow {\n  /** Stored edge source id. */\n  source: string;\n  /** Stored edge target id. */\n  target: string;\n  /** Stored relationship kind. */\n  kind: string;\n  /** Semantic-orientation node path proving the edge is implied. */\n  witness: string[];\n}\n\n/** Result envelope for the redundancy subcommand. */\nexport interface GraphRedundancyResult {\n  /** Executed graph subcommand. */\n  subcommand: \"redundancy\";\n  /** Total redundant edges found within configured bounds. */\n  redundant_count: number;\n  /** Whether the row limit omitted further redundant edges. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Redundant edge rows in deterministic scan order; absent with summary. */\n  redundant?: GraphRedundancyRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One structural bottleneck row projected by the dominators subcommand. */\nexport interface GraphDominatorRow {\n  /** Bottleneck node id. */\n  id: string;\n  /** Immediate dominator appearing on every root-to-node path. */\n  idom: string;\n  /** Reachable nodes strictly gated by this node. */\n  dominated_count: number;\n}\n\n/** Result envelope for the dominators subcommand. */\nexport interface GraphDominatorsResult {\n  /** Executed graph subcommand. */\n  subcommand: \"dominators\";\n  /** Canonical analyzed root id. */\n  root: string;\n  /** Traversal orientation used for reachability. */\n  direction: string;\n  /** Reachable node count including the root. */\n  reachable_count: number;\n  /** Total nodes gating at least one other reachable node. */\n  bottleneck_count: number;\n  /** Whether the depth bound cut reachability or the row limit omitted bottleneck rows. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Bounded bottleneck rows, most-gating first; absent with summary. */\n  bottlenecks?: GraphDominatorRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Result envelope for the dry-run remediation planning subcommand. */\nexport interface GraphPlanResult {\n  /** Executed graph subcommand. */\n  subcommand: \"plan\";\n  /** Total derived remediation proposals before row bounding. */\n  step_count: number;\n  /** Proposal counts keyed by operation family. */\n  steps_by_op: Record<string, number>;\n  /** Proposal counts keyed by policy code. */\n  steps_by_code: Record<string, number>;\n  /** Total governance-audit findings the plan was derived from. */\n  finding_count: number;\n  /** Whether sample, scan, or row bounds omitted derivable proposals. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Bounded proposal rows in audit severity order; absent with summary. */\n  steps?: RelationshipRemediationStep[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Union of every graph subcommand result envelope. */\nexport type GraphResult =\n  | GraphTraversalResult\n  | GraphPathsResult\n  | GraphImpactResult\n  | GraphAnalyzeResult\n  | GraphAuditResult\n  | GraphCommunitiesResult\n  | GraphRedundancyResult\n  | GraphDominatorsResult\n  | GraphPlanResult;\n\n/** Fully parsed graph invocation shared by the subcommand executors. */\ninterface GraphInvocation {\n  /** Assembled workspace relationship graph and node details. */\n  assembly: WorkspaceRelationshipAssembly;\n  /** Canonical registered kind filters, when provided. */\n  kinds?: string[];\n  /** Parsed non-negative depth bound. */\n  maxDepth?: number;\n  /** Parsed positive row bound. */\n  limit?: number;\n  /** Traversal resume cursor. */\n  after?: string;\n  /** Validated traversal orientation. */\n  direction: \"outgoing\" | \"incoming\" | \"both\";\n  /** Parsed positive path-count bound. */\n  maxPaths?: number;\n  /** Parsed positive audit sample bound. */\n  sample?: number;\n  /** Normalized audit isolate exemptions. */\n  exemptIsolates: string[];\n  /** Whether row collections are suppressed. */\n  summary: boolean;\n}\n\n/** Normalize repeatable or comma-separated id options into a flat list. */\nfunction normalizeIdList(raw: string | string[] | undefined): string[] {\n  if (raw === undefined) return [];\n  return (Array.isArray(raw) ? raw : [raw])\n    .flatMap((value) => value.split(\",\"))\n    .map((value) => value.trim())\n    .filter((value) => value.length > 0);\n}\n\n/** Validate the graph subcommand and its positional-id requirements. */\nexport function parseGraphSubcommand(\n  raw: string,\n  id: string | undefined,\n  target: string | undefined,\n): GraphSubcommand {\n  const candidate = raw.trim().toLowerCase();\n  if (!(GRAPH_SUBCOMMAND_VALUES as readonly string[]).includes(candidate)) {\n    throw new PmCliError(\n      `Invalid graph subcommand \"${raw}\". Use one of: ${GRAPH_SUBCOMMAND_VALUES.join(\", \")}.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  const subcommand = candidate as GraphSubcommand;\n  if (ROOTED_SUBCOMMANDS.has(subcommand) && !id?.trim()) {\n    throw new PmCliError(\n      `graph ${subcommand} requires an item id.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (subcommand === \"paths\" && !target?.trim()) {\n    throw new PmCliError(\n      \"graph paths requires a source and a target item id.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  return subcommand;\n}\n\n/**\n * Re-throw graph-kernel semantic option misuse (non-family kind, unknown\n * cursor, non-transitive redundancy kind) as a usage error carrying the\n * original explanation instead of an opaque crash.\n */\nfunction rethrowGraphUsage(error: unknown): never {\n  if (error instanceof TypeError)\n    throw new PmCliError(error.message, EXIT_CODE.USAGE);\n  throw error;\n}\n\n/** Convert traversal metadata into the shared cost/truncation projection. */\nfunction projectQueryMeta(meta: RelationshipQueryMeta): {\n  truncated: boolean;\n  cost: GraphQueryCost;\n} {\n  return {\n    truncated: meta.truncated,\n    cost: {\n      visited_nodes: meta.visitedNodes,\n      inspected_edges: meta.inspectedEdges,\n    },\n  };\n}\n\n/** Resolve one item id case-insensitively against the assembled graph. */\nfunction canonicalizeGraphId(\n  assembly: WorkspaceRelationshipAssembly,\n  raw: string,\n): string {\n  const wanted = raw.trim().toLowerCase();\n  for (const detail of assembly.details) {\n    if (\n      detail.id.trim().toLowerCase() === wanted &&\n      !assembly.missingIdSet.has(detail.id.toLowerCase())\n    ) {\n      return detail.id;\n    }\n  }\n  throw new PmCliError(`Item ${raw} not found`, EXIT_CODE.NOT_FOUND);\n}\n\n/** Execute one transitive traversal subcommand over the assembled graph. */\nfunction runGraphTraversal(\n  subcommand: \"ancestors\" | \"descendants\" | \"predecessors\" | \"successors\",\n  root: string,\n  invocation: GraphInvocation,\n): GraphTraversalResult {\n  const walk = {\n    ancestors: hierarchyAncestors,\n    descendants: hierarchyDescendants,\n    predecessors: orderingPredecessors,\n    successors: orderingSuccessors,\n  }[subcommand];\n  let result;\n  try {\n    result = walk(invocation.assembly.graph, root, {\n      ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n      ...(invocation.maxDepth === undefined\n        ? {}\n        : { maxDepth: invocation.maxDepth }),\n      ...(invocation.limit === undefined ? {} : { limit: invocation.limit }),\n      ...(invocation.after === undefined ? {} : { after: invocation.after }),\n    });\n  } catch (error) {\n    rethrowGraphUsage(error);\n  }\n  const meta = projectQueryMeta(result.meta);\n  return {\n    subcommand,\n    root,\n    count: result.value.length,\n    ...meta,\n    ...(result.meta.nextCursor === undefined\n      ? {}\n      : { next_cursor: result.meta.nextCursor }),\n    ...(invocation.summary ? {} : { ids: result.value }),\n  };\n}\n\n/** Execute the bounded simple-path enumeration subcommand. */\nfunction runGraphPaths(\n  root: string,\n  target: string,\n  invocation: GraphInvocation,\n): GraphPathsResult {\n  const result = enumerateRelationshipPaths(\n    invocation.assembly.graph,\n    root,\n    target,\n    {\n      direction: invocation.direction,\n      ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n      ...(invocation.maxDepth === undefined\n        ? {}\n        : { maxDepth: invocation.maxDepth }),\n      ...(invocation.maxPaths === undefined\n        ? {}\n        : { maxPaths: invocation.maxPaths }),\n    },\n  );\n  return {\n    subcommand: \"paths\",\n    root,\n    target,\n    direction: invocation.direction,\n    count: result.value.length,\n    ...projectQueryMeta(result.meta),\n    ...(invocation.summary\n      ? {}\n      : {\n          paths: result.value.map((path) => ({\n            nodes: path.nodes,\n            kinds: path.edges.map((edge) => edge.kind),\n            length: path.length,\n          })),\n        }),\n  };\n}\n\n/** Execute the bounded blast-radius impact subcommand. */\nfunction runGraphImpact(\n  root: string,\n  invocation: GraphInvocation,\n): GraphImpactResult {\n  const analysis = analyzeGraphImpact(invocation.assembly.graph, root, {\n    direction: invocation.direction,\n    ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n    ...(invocation.maxDepth === undefined\n      ? {}\n      : { maxDepth: invocation.maxDepth }),\n    ...(invocation.limit === undefined ? {} : { limit: invocation.limit }),\n  });\n  return {\n    subcommand: \"impact\",\n    root,\n    direction: invocation.direction,\n    count: analysis.affected.length,\n    truncated: analysis.truncated,\n    cost: {\n      visited_nodes: analysis.cost.visitedNodes,\n      inspected_edges: analysis.cost.inspectedEdges,\n    },\n    ...(invocation.summary ? {} : { affected: analysis.affected }),\n  };\n}\n\n/** Execute the workspace-wide execution and knowledge analytics subcommand. */\nfunction runGraphAnalyze(invocation: GraphInvocation): GraphAnalyzeResult {\n  const graph = invocation.assembly.graph;\n  const sampleLimit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const execution = analyzeRelationshipExecution(graph, {\n    registry: graph.registry(),\n  });\n  const knowledge = analyzeKnowledgeGraph(graph);\n  return {\n    subcommand: \"analyze\",\n    node_count: graph.nodes().length,\n    edge_count: graph.edges().length,\n    sample_limit: sampleLimit,\n    execution: {\n      acyclic: execution.acyclic,\n      ordered_node_count: execution.order.length,\n      layer_count: execution.layers.length,\n      frontier_count: execution.frontier.length,\n      critical_path_length: execution.criticalPathLength,\n      cycle_count: execution.cycles.length,\n      ...(invocation.summary\n        ? {}\n        : {\n            frontier: execution.frontier.slice(0, sampleLimit),\n            critical_path: execution.criticalPath.slice(0, sampleLimit),\n            cycles: execution.cycles.slice(0, sampleLimit),\n          }),\n    },\n    knowledge: {\n      component_count: knowledge.components.length,\n      largest_component_size: knowledge.components[0]?.length ?? 0,\n      orphan_count: knowledge.orphans.length,\n      ...(invocation.summary\n        ? {}\n        : {\n            orphans: knowledge.orphans.slice(0, sampleLimit),\n            hubs: knowledge.hubs.slice(0, sampleLimit),\n          }),\n    },\n  };\n}\n\n/** Execute the governance-audit subcommand over the assembled graph. */\nfunction runGraphAudit(\n  invocation: GraphInvocation,\n  isTerminal: (status: string) => boolean,\n): GraphAuditResult {\n  const report = auditWorkspaceRelationshipGraph(invocation.assembly, {\n    isTerminal,\n    ...(invocation.sample === undefined\n      ? {}\n      : { maxSampleSize: invocation.sample }),\n    ...(invocation.exemptIsolates.length === 0\n      ? {}\n      : { exemptIsolates: invocation.exemptIsolates }),\n  });\n  const bySeverity: Record<string, number> = {};\n  const byCode: Record<string, number> = {};\n  const affectedBySeverity: Record<string, number> = {};\n  const affectedByCode: Record<string, number> = {};\n  for (const finding of report.findings) {\n    bySeverity[finding.severity] = (bySeverity[finding.severity] ?? 0) + 1;\n    byCode[finding.code] = (byCode[finding.code] ?? 0) + 1;\n    affectedBySeverity[finding.severity] =\n      (affectedBySeverity[finding.severity] ?? 0) + finding.count;\n    affectedByCode[finding.code] =\n      (affectedByCode[finding.code] ?? 0) + finding.count;\n  }\n  return {\n    subcommand: \"audit\",\n    finding_count: report.findings.length,\n    findings_by_severity: bySeverity,\n    findings_by_code: byCode,\n    affected_subjects_by_severity: affectedBySeverity,\n    affected_subjects_by_code: affectedByCode,\n    profile: report.profile,\n    ...(invocation.summary ? {} : { findings: report.findings }),\n  };\n}\n\n/** Execute the deterministic community-detection subcommand. */\nfunction runGraphCommunities(\n  invocation: GraphInvocation,\n): GraphCommunitiesResult {\n  const sampleLimit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const result = detectRelationshipCommunities(invocation.assembly.graph, {\n    ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n  });\n  const analysis = result.value;\n  return {\n    subcommand: \"communities\",\n    community_count: analysis.communities.length,\n    largest_community_size: analysis.communities[0]?.size ?? 0,\n    iterations: analysis.iterations,\n    converged: analysis.converged,\n    truncated: !analysis.converged || analysis.communities.length > sampleLimit,\n    cost: {\n      visited_nodes: result.meta.visitedNodes,\n      inspected_edges: result.meta.inspectedEdges,\n    },\n    ...(invocation.summary\n      ? {}\n      : {\n          communities: analysis.communities\n            .slice(0, sampleLimit)\n            .map((community) => ({\n              representative: community.representative,\n              size: community.size,\n              members: community.members.slice(0, sampleLimit),\n            })),\n        }),\n  };\n}\n\n/** Execute the transitive-redundancy scan subcommand. */\nfunction runGraphRedundancy(\n  invocation: GraphInvocation,\n): GraphRedundancyResult {\n  let result;\n  try {\n    result = findRedundantRelationshipEdges(invocation.assembly.graph, {\n      ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n      ...(invocation.maxDepth === undefined\n        ? {}\n        : { maxDepth: invocation.maxDepth }),\n      ...(invocation.limit === undefined ? {} : { limit: invocation.limit }),\n    });\n  } catch (error) {\n    rethrowGraphUsage(error);\n  }\n  return {\n    subcommand: \"redundancy\",\n    redundant_count: result.value.length,\n    ...projectQueryMeta(result.meta),\n    ...(invocation.summary\n      ? {}\n      : {\n          redundant: result.value.map((row) => ({\n            source: row.edge.source,\n            target: row.edge.target,\n            kind: row.edge.kind,\n            witness: row.witness,\n          })),\n        }),\n  };\n}\n\n/** Execute the dominator/bottleneck analysis subcommand. */\nfunction runGraphDominators(\n  root: string,\n  invocation: GraphInvocation,\n): GraphDominatorsResult {\n  const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const result = computeRelationshipDominators(\n    invocation.assembly.graph,\n    root,\n    {\n      direction: invocation.direction,\n      ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n      ...(invocation.maxDepth === undefined\n        ? {}\n        : { maxDepth: invocation.maxDepth }),\n    },\n  );\n  const bottlenecks = result.value.rows.filter((row) => row.dominatedCount > 0);\n  return {\n    subcommand: \"dominators\",\n    root,\n    direction: invocation.direction,\n    reachable_count: result.value.reachableCount,\n    bottleneck_count: bottlenecks.length,\n    truncated: result.meta.truncated || bottlenecks.length > limit,\n    cost: {\n      visited_nodes: result.meta.visitedNodes,\n      inspected_edges: result.meta.inspectedEdges,\n    },\n    ...(invocation.summary\n      ? {}\n      : {\n          bottlenecks: bottlenecks.slice(0, limit).map((row) => ({\n            id: row.id,\n            idom: row.idom,\n            dominated_count: row.dominatedCount,\n          })),\n        }),\n  };\n}\n\n/** Execute the dry-run remediation planning subcommand. */\nfunction runGraphPlan(\n  invocation: GraphInvocation,\n  isTerminal: (status: string) => boolean,\n): GraphPlanResult {\n  const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const plan = planRelationshipRemediation(invocation.assembly, {\n    isTerminal,\n    redundancyLimit: limit,\n    ...(invocation.sample === undefined\n      ? {}\n      : { maxSampleSize: invocation.sample }),\n    ...(invocation.exemptIsolates.length === 0\n      ? {}\n      : { exemptIsolates: invocation.exemptIsolates }),\n  });\n  const byOp: Record<string, number> = {};\n  const byCode: Record<string, number> = {};\n  for (const step of plan.steps) {\n    byOp[step.op] = (byOp[step.op] ?? 0) + 1;\n    byCode[step.code] = (byCode[step.code] ?? 0) + 1;\n  }\n  return {\n    subcommand: \"plan\",\n    step_count: plan.steps.length,\n    steps_by_op: byOp,\n    steps_by_code: byCode,\n    finding_count: plan.report.findings.length,\n    truncated: plan.truncated || plan.steps.length > limit,\n    cost: {\n      visited_nodes: plan.cost.visitedNodes,\n      inspected_edges: plan.cost.inspectedEdges,\n    },\n    ...(invocation.summary ? {} : { steps: plan.steps.slice(0, limit) }),\n  };\n}\n\n/** Build the deterministic memoization key covering every query-shaping input. */\nfunction buildGraphQueryKey(\n  subcommand: GraphSubcommand,\n  root: string | undefined,\n  pathsTarget: string | undefined,\n  invocation: GraphInvocation,\n): string {\n  return JSON.stringify({\n    subcommand,\n    root: root ?? null,\n    target: pathsTarget ?? null,\n    kinds: invocation.kinds ?? null,\n    maxDepth: invocation.maxDepth ?? null,\n    limit: invocation.limit ?? null,\n    after: invocation.after ?? null,\n    direction: invocation.direction,\n    maxPaths: invocation.maxPaths ?? null,\n    sample: invocation.sample ?? null,\n    // The audit consumes exemptions as a case-insensitive set, so the key\n    // must not distinguish logically identical spellings or orderings.\n    exemptIsolates: [\n      ...new Set(invocation.exemptIsolates.map((id) => id.toLowerCase())),\n    ].sort(),\n    summary: invocation.summary,\n  });\n}\n\n/** Dispatch one parsed graph subcommand to its executor. */\nfunction executeGraphSubcommand(\n  subcommand: GraphSubcommand,\n  root: string | undefined,\n  pathsTarget: string | undefined,\n  invocation: GraphInvocation,\n  isTerminal: (status: string) => boolean,\n): GraphResult {\n  if (subcommand === \"analyze\") return runGraphAnalyze(invocation);\n  if (subcommand === \"audit\") return runGraphAudit(invocation, isTerminal);\n  if (subcommand === \"plan\") return runGraphPlan(invocation, isTerminal);\n  if (subcommand === \"communities\") return runGraphCommunities(invocation);\n  if (subcommand === \"redundancy\") return runGraphRedundancy(invocation);\n  if (subcommand === \"dominators\") return runGraphDominators(root!, invocation);\n  if (subcommand === \"paths\")\n    return runGraphPaths(root!, pathsTarget!, invocation);\n  if (subcommand === \"impact\") return runGraphImpact(root!, invocation);\n  return runGraphTraversal(subcommand, root!, invocation);\n}\n\n/** Implements run graph for the public runtime surface of this module. */\nexport async function runGraph(\n  subcommandRaw: string,\n  id: string | undefined,\n  target: string | undefined,\n  options: GraphCommandOptions,\n  global: GlobalOptions,\n): Promise<GraphResult> {\n  const subcommand = parseGraphSubcommand(subcommandRaw, id, target);\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 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 isTerminal = (status: string): boolean =>\n    isTerminalStatus(status, statusRegistry);\n  const kinds = parseKinds(options.kind);\n  const lookup = workspaceGraphCache().lookup(\n    pmRoot,\n    computeWorkspaceGraphFingerprint(items, isTerminal),\n    () => assembleWorkspaceRelationshipGraph(items, isTerminal),\n  );\n  const invocation: GraphInvocation = {\n    assembly: lookup.assembly,\n    ...(kinds === undefined ? {} : { kinds }),\n    maxDepth: parseMaxDepth(options.maxDepth),\n    limit: parsePositiveInteger(options.limit, \"limit\"),\n    after: options.after?.trim() || undefined,\n    direction: parseDirection(options.direction),\n    maxPaths: parsePositiveInteger(options.maxPaths, \"max-paths\"),\n    sample: parsePositiveInteger(options.sample, \"sample\"),\n    exemptIsolates: normalizeIdList(options.exemptIsolate),\n    summary: options.summary === true,\n  };\n  const root = ROOTED_SUBCOMMANDS.has(subcommand)\n    ? canonicalizeGraphId(invocation.assembly, id!)\n    : undefined;\n  const pathsTarget =\n    subcommand === \"paths\"\n      ? canonicalizeGraphId(invocation.assembly, target!)\n      : undefined;\n  const memo = lookup.memoize(\n    buildGraphQueryKey(subcommand, root, pathsTarget, invocation),\n    () =>\n      executeGraphSubcommand(\n        subcommand,\n        root,\n        pathsTarget,\n        invocation,\n        isTerminal,\n      ),\n  );\n  return {\n    ...memo.value,\n    cache: {\n      fingerprint: lookup.fingerprint.slice(0, 12),\n      assembly: lookup.assemblyReused ? \"hit\" : \"miss\",\n      result: memo.reused ? \"hit\" : \"miss\",\n    },\n  };\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;;;AACH,OAAO,EAAE,+BAA+B,EAAE,MAAM,gCAAgC,CAAC;AACjF,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,kCAAkC,CAAC;AAC3E,OAAO,EAAE,4BAA4B,EAAE,MAAM,qCAAqC,CAAC;AAEnF,OAAO,EAAE,SAAS,EAAE,MAAM,gCAAgC,CAAC;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAC;AAC1E,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC3E,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EACL,cAAc,EACd,UAAU,EACV,aAAa,EACb,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,kBAAkB,EAClB,qBAAqB,EACrB,4BAA4B,GAC7B,MAAM,8BAA8B,CAAC;AAEtC,OAAO,EACL,6BAA6B,EAC7B,6BAA6B,EAC7B,8BAA8B,GAC/B,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,kCAAkC,GAEnC,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,gCAAgC,EAChC,mBAAmB,GAEpB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,+BAA+B,GAEhC,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,2BAA2B,GAE5B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,0BAA0B,EAC1B,kBAAkB,EAClB,oBAAoB,EACpB,oBAAoB,EACpB,kBAAkB,GACnB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACL,uBAAuB,GAExB,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,uBAAuB,EAAwB,CAAC;AAEzD,qDAAqD;AACrD,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAkB;IAClD,WAAW;IACX,aAAa;IACb,cAAc;IACd,YAAY;IACZ,OAAO;IACP,QAAQ;IACR,YAAY;CACb,CAAC,CAAC;AAEH,yEAAyE;AACzE,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAoVhC,2EAA2E;AAC3E,SAAS,eAAe,CAAC,GAAkC;IACzD,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACjC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACtC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SACpC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;SAC5B,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,oBAAoB,CAClC,GAAW,EACX,EAAsB,EACtB,MAA0B;IAE1B,MAAM,SAAS,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC3C,IAAI,CAAE,uBAA6C,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QACxE,MAAM,IAAI,UAAU,CAClB,6BAA6B,GAAG,kBAAkB,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EACvF,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,MAAM,UAAU,GAAG,SAA4B,CAAC;IAChD,IAAI,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;QACtD,MAAM,IAAI,UAAU,CAClB,SAAS,UAAU,uBAAuB,EAC1C,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,KAAK,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,UAAU,CAClB,qDAAqD,EACrD,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,KAAc;IACvC,IAAI,KAAK,YAAY,SAAS;QAC5B,MAAM,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;IACvD,MAAM,KAAK,CAAC;AACd,CAAC;AAED,6EAA6E;AAC7E,SAAS,gBAAgB,CAAC,IAA2B;IAInD,OAAO;QACL,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,IAAI,EAAE;YACJ,aAAa,EAAE,IAAI,CAAC,YAAY;YAChC,eAAe,EAAE,IAAI,CAAC,cAAc;SACrC;KACF,CAAC;AACJ,CAAC;AAED,0EAA0E;AAC1E,SAAS,mBAAmB,CAC1B,QAAuC,EACvC,GAAW;IAEX,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACtC,IACE,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,KAAK,MAAM;YACzC,CAAC,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,EACnD,CAAC;YACD,OAAO,MAAM,CAAC,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IACD,MAAM,IAAI,UAAU,CAAC,QAAQ,GAAG,YAAY,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;AACrE,CAAC;AAED,4EAA4E;AAC5E,SAAS,iBAAiB,CACxB,UAAuE,EACvE,IAAY,EACZ,UAA2B;IAE3B,MAAM,IAAI,GAAG;QACX,SAAS,EAAE,kBAAkB;QAC7B,WAAW,EAAE,oBAAoB;QACjC,YAAY,EAAE,oBAAoB;QAClC,UAAU,EAAE,kBAAkB;KAC/B,CAAC,UAAU,CAAC,CAAC;IACd,IAAI,MAAM,CAAC;IACX,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE;YAC7C,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;YACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;gBACnC,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;YACtC,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;YACtE,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;SACvE,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3C,OAAO;QACL,UAAU;QACV,IAAI;QACJ,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QAC1B,GAAG,IAAI;QACP,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,KAAK,SAAS;YACtC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;QAC5C,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;KACrD,CAAC;AACJ,CAAC;AAED,8DAA8D;AAC9D,SAAS,aAAa,CACpB,IAAY,EACZ,MAAc,EACd,UAA2B;IAE3B,MAAM,MAAM,GAAG,0BAA0B,CACvC,UAAU,CAAC,QAAQ,CAAC,KAAK,EACzB,IAAI,EACJ,MAAM,EACN;QACE,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;QACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;QACtC,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;KACvC,CACF,CAAC;IACF,OAAO;QACL,UAAU,EAAE,OAAO;QACnB,IAAI;QACJ,MAAM;QACN,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QAC1B,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC;QAChC,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBACjC,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;oBAC1C,MAAM,EAAE,IAAI,CAAC,MAAM;iBACpB,CAAC,CAAC;aACJ,CAAC;KACP,CAAC;AACJ,CAAC;AAED,0DAA0D;AAC1D,SAAS,cAAc,CACrB,IAAY,EACZ,UAA2B;IAE3B,MAAM,QAAQ,GAAG,kBAAkB,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE;QACnE,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;QACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;QACtC,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;KACvE,CAAC,CAAC;IACH,OAAO;QACL,UAAU,EAAE,QAAQ;QACpB,IAAI;QACJ,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM;QAC/B,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,IAAI,EAAE;YACJ,aAAa,EAAE,QAAQ,CAAC,IAAI,CAAC,YAAY;YACzC,eAAe,EAAE,QAAQ,CAAC,IAAI,CAAC,cAAc;SAC9C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,CAAC;KAC/D,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,SAAS,eAAe,CAAC,UAA2B;IAClD,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC;IACxC,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IAC7D,MAAM,SAAS,GAAG,4BAA4B,CAAC,KAAK,EAAE;QACpD,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE;KAC3B,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAC/C,OAAO;QACL,UAAU,EAAE,SAAS;QACrB,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM;QAChC,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM;QAChC,YAAY,EAAE,WAAW;QACzB,SAAS,EAAE;YACT,OAAO,EAAE,SAAS,CAAC,OAAO;YAC1B,kBAAkB,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM;YAC1C,WAAW,EAAE,SAAS,CAAC,MAAM,CAAC,MAAM;YACpC,cAAc,EAAE,SAAS,CAAC,QAAQ,CAAC,MAAM;YACzC,oBAAoB,EAAE,SAAS,CAAC,kBAAkB;YAClD,WAAW,EAAE,SAAS,CAAC,MAAM,CAAC,MAAM;YACpC,GAAG,CAAC,UAAU,CAAC,OAAO;gBACpB,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC;oBACE,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;oBAClD,aAAa,EAAE,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;oBAC3D,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;iBAC/C,CAAC;SACP;QACD,SAAS,EAAE;YACT,eAAe,EAAE,SAAS,CAAC,UAAU,CAAC,MAAM;YAC5C,sBAAsB,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC;YAC5D,YAAY,EAAE,SAAS,CAAC,OAAO,CAAC,MAAM;YACtC,GAAG,CAAC,UAAU,CAAC,OAAO;gBACpB,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC;oBACE,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;oBAChD,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;iBAC3C,CAAC;SACP;KACF,CAAC;AACJ,CAAC;AAED,wEAAwE;AACxE,SAAS,aAAa,CACpB,UAA2B,EAC3B,UAAuC;IAEvC,MAAM,MAAM,GAAG,+BAA+B,CAAC,UAAU,CAAC,QAAQ,EAAE;QAClE,UAAU;QACV,GAAG,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS;YACjC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,aAAa,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC;QACzC,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;YACxC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,CAAC,cAAc,EAAE,CAAC;KACnD,CAAC,CAAC;IACH,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,kBAAkB,GAA2B,EAAE,CAAC;IACtD,MAAM,cAAc,GAA2B,EAAE,CAAC;IAClD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACvE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACvD,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC;YAClC,CAAC,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC9D,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC;YAC1B,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;IACxD,CAAC;IACD,OAAO;QACL,UAAU,EAAE,OAAO;QACnB,aAAa,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;QACrC,oBAAoB,EAAE,UAAU;QAChC,gBAAgB,EAAE,MAAM;QACxB,6BAA6B,EAAE,kBAAkB;QACjD,yBAAyB,EAAE,cAAc;QACzC,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC;KAC7D,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAS,mBAAmB,CAC1B,UAA2B;IAE3B,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IAC7D,MAAM,MAAM,GAAG,6BAA6B,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE;QACtE,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;KACvE,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC;IAC9B,OAAO;QACL,UAAU,EAAE,aAAa;QACzB,eAAe,EAAE,QAAQ,CAAC,WAAW,CAAC,MAAM;QAC5C,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC;QAC1D,UAAU,EAAE,QAAQ,CAAC,UAAU;QAC/B,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,SAAS,EAAE,CAAC,QAAQ,CAAC,SAAS,IAAI,QAAQ,CAAC,WAAW,CAAC,MAAM,GAAG,WAAW;QAC3E,IAAI,EAAE;YACJ,aAAa,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY;YACvC,eAAe,EAAE,MAAM,CAAC,IAAI,CAAC,cAAc;SAC5C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,WAAW,EAAE,QAAQ,CAAC,WAAW;qBAC9B,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;qBACrB,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;oBACnB,cAAc,EAAE,SAAS,CAAC,cAAc;oBACxC,IAAI,EAAE,SAAS,CAAC,IAAI;oBACpB,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;iBACjD,CAAC,CAAC;aACN,CAAC;KACP,CAAC;AACJ,CAAC;AAED,yDAAyD;AACzD,SAAS,kBAAkB,CACzB,UAA2B;IAE3B,IAAI,MAAM,CAAC;IACX,IAAI,CAAC;QACH,MAAM,GAAG,8BAA8B,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE;YACjE,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;YACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;gBACnC,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;YACtC,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;SACvE,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO;QACL,UAAU,EAAE,YAAY;QACxB,eAAe,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QACpC,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC;QAChC,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBACpC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM;oBACvB,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM;oBACvB,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI;oBACnB,OAAO,EAAE,GAAG,CAAC,OAAO;iBACrB,CAAC,CAAC;aACJ,CAAC;KACP,CAAC;AACJ,CAAC;AAED,4DAA4D;AAC5D,SAAS,kBAAkB,CACzB,IAAY,EACZ,UAA2B;IAE3B,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IACvD,MAAM,MAAM,GAAG,6BAA6B,CAC1C,UAAU,CAAC,QAAQ,CAAC,KAAK,EACzB,IAAI,EACJ;QACE,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;QACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;KACvC,CACF,CAAC;IACF,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;IAC9E,OAAO;QACL,UAAU,EAAE,YAAY;QACxB,IAAI;QACJ,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,eAAe,EAAE,MAAM,CAAC,KAAK,CAAC,cAAc;QAC5C,gBAAgB,EAAE,WAAW,CAAC,MAAM;QACpC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,WAAW,CAAC,MAAM,GAAG,KAAK;QAC9D,IAAI,EAAE;YACJ,aAAa,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY;YACvC,eAAe,EAAE,MAAM,CAAC,IAAI,CAAC,cAAc;SAC5C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBACrD,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,eAAe,EAAE,GAAG,CAAC,cAAc;iBACpC,CAAC,CAAC;aACJ,CAAC;KACP,CAAC;AACJ,CAAC;AAED,2DAA2D;AAC3D,SAAS,YAAY,CACnB,UAA2B,EAC3B,UAAuC;IAEvC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IACvD,MAAM,IAAI,GAAG,2BAA2B,CAAC,UAAU,CAAC,QAAQ,EAAE;QAC5D,UAAU;QACV,eAAe,EAAE,KAAK;QACtB,GAAG,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS;YACjC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,aAAa,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC;QACzC,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;YACxC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,CAAC,cAAc,EAAE,CAAC;KACnD,CAAC,CAAC;IACH,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IACD,OAAO;QACL,UAAU,EAAE,MAAM;QAClB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;QAC7B,WAAW,EAAE,IAAI;QACjB,aAAa,EAAE,MAAM;QACrB,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM;QAC1C,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK;QACtD,IAAI,EAAE;YACJ,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,YAAY;YACrC,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc;SAC1C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;KACrE,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,SAAS,kBAAkB,CACzB,UAA2B,EAC3B,IAAwB,EACxB,WAA+B,EAC/B,UAA2B;IAE3B,OAAO,IAAI,CAAC,SAAS,CAAC;QACpB,UAAU;QACV,IAAI,EAAE,IAAI,IAAI,IAAI;QAClB,MAAM,EAAE,WAAW,IAAI,IAAI;QAC3B,KAAK,EAAE,UAAU,CAAC,KAAK,IAAI,IAAI;QAC/B,QAAQ,EAAE,UAAU,CAAC,QAAQ,IAAI,IAAI;QACrC,KAAK,EAAE,UAAU,CAAC,KAAK,IAAI,IAAI;QAC/B,KAAK,EAAE,UAAU,CAAC,KAAK,IAAI,IAAI;QAC/B,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,QAAQ,EAAE,UAAU,CAAC,QAAQ,IAAI,IAAI;QACrC,MAAM,EAAE,UAAU,CAAC,MAAM,IAAI,IAAI;QACjC,sEAAsE;QACtE,mEAAmE;QACnE,cAAc,EAAE;YACd,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;SACpE,CAAC,IAAI,EAAE;QACR,OAAO,EAAE,UAAU,CAAC,OAAO;KAC5B,CAAC,CAAC;AACL,CAAC;AAED,4DAA4D;AAC5D,SAAS,sBAAsB,CAC7B,UAA2B,EAC3B,IAAwB,EACxB,WAA+B,EAC/B,UAA2B,EAC3B,UAAuC;IAEvC,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC,UAAU,CAAC,CAAC;IACjE,IAAI,UAAU,KAAK,OAAO;QAAE,OAAO,aAAa,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACzE,IAAI,UAAU,KAAK,MAAM;QAAE,OAAO,YAAY,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACvE,IAAI,UAAU,KAAK,aAAa;QAAE,OAAO,mBAAmB,CAAC,UAAU,CAAC,CAAC;IACzE,IAAI,UAAU,KAAK,YAAY;QAAE,OAAO,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACvE,IAAI,UAAU,KAAK,YAAY;QAAE,OAAO,kBAAkB,CAAC,IAAK,EAAE,UAAU,CAAC,CAAC;IAC9E,IAAI,UAAU,KAAK,OAAO;QACxB,OAAO,aAAa,CAAC,IAAK,EAAE,WAAY,EAAE,UAAU,CAAC,CAAC;IACxD,IAAI,UAAU,KAAK,QAAQ;QAAE,OAAO,cAAc,CAAC,IAAK,EAAE,UAAU,CAAC,CAAC;IACtE,OAAO,iBAAiB,CAAC,UAAU,EAAE,IAAK,EAAE,UAAU,CAAC,CAAC;AAC1D,CAAC;AAED,0EAA0E;AAC1E,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,aAAqB,EACrB,EAAsB,EACtB,MAA0B,EAC1B,OAA4B,EAC5B,MAAqB;IAErB,MAAM,UAAU,GAAG,oBAAoB,CAAC,aAAa,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IACnE,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACzD,IAAI,CAAC,CAAC,MAAM,UAAU,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,UAAU,CAClB,iCAAiC,MAAM,sBAAsB,EAC7D,SAAS,CAAC,SAAS,CACpB,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,uBAAuB,CAC1C,QAAQ,EACR,+BAA+B,EAAE,CAClC,CAAC;IACF,MAAM,KAAK,GAAG,MAAM,wBAAwB,CAC1C,MAAM,EACN,QAAQ,CAAC,WAAW,EACpB,YAAY,CAAC,cAAc,EAC3B,SAAS,EACT,QAAQ,CAAC,MAAM,CAChB,CAAC;IACF,MAAM,cAAc,GAAG,4BAA4B,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG,CAAC,MAAc,EAAW,EAAE,CAC7C,gBAAgB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,mBAAmB,EAAE,CAAC,MAAM,CACzC,MAAM,EACN,gCAAgC,CAAC,KAAK,EAAE,UAAU,CAAC,EACnD,GAAG,EAAE,CAAC,kCAAkC,CAAC,KAAK,EAAE,UAAU,CAAC,CAC5D,CAAC;IACF,MAAM,UAAU,GAAoB;QAClC,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;QACzC,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC;QACzC,KAAK,EAAE,oBAAoB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC;QACnD,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,SAAS;QACzC,SAAS,EAAE,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC;QAC5C,QAAQ,EAAE,oBAAoB,CAAC,OAAO,CAAC,QAAQ,EAAE,WAAW,CAAC;QAC7D,MAAM,EAAE,oBAAoB,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;QACtD,cAAc,EAAE,eAAe,CAAC,OAAO,CAAC,aAAa,CAAC;QACtD,OAAO,EAAE,OAAO,CAAC,OAAO,KAAK,IAAI;KAClC,CAAC;IACF,MAAM,IAAI,GAAG,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC;QAC7C,CAAC,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAG,CAAC;QAC/C,CAAC,CAAC,SAAS,CAAC;IACd,MAAM,WAAW,GACf,UAAU,KAAK,OAAO;QACpB,CAAC,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAO,CAAC;QACnD,CAAC,CAAC,SAAS,CAAC;IAChB,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CACzB,kBAAkB,CAAC,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,CAAC,EAC7D,GAAG,EAAE,CACH,sBAAsB,CACpB,UAAU,EACV,IAAI,EACJ,WAAW,EACX,UAAU,EACV,UAAU,CACX,CACJ,CAAC;IACF,OAAO;QACL,GAAG,IAAI,CAAC,KAAK;QACb,KAAK,EAAE;YACL,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAC5C,QAAQ,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM;YAChD,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM;SACrC;KACF,CAAC;AACJ,CAAC","debugId":"f43d15d0-c4a0-533a-b125-4333554e4ea0"}
+{"version":3,"file":"run.js","sources":["sdk/graph/run.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/run\n *\n * Workspace-facing `pm graph` runner: one thin orchestrator that loads the\n * tracker once, resolves the fingerprint-keyed workspace assembly through the\n * shared graph cache, and dispatches bounded traversal, path, impact,\n * analytics, governance-audit, and remediation-planning queries through the\n * public graph toolkit. Every projection is counts-first, deterministic, and\n * carries explicit cost, truncation, and cache metadata so agents can budget\n * follow-up reads without re-scanning the workspace; identical repeated\n * queries in long-lived hosts are answered from the memoized snapshot.\n */\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { isTerminalStatus } from \"../../core/item/status.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { resolveRuntimeStatusRegistry } from \"../../core/schema/runtime-schema.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { listAllItemMetadataLight } from \"../../core/store/item-store.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport { readSettings } from \"../../core/store/settings.js\";\nimport {\n  parseDirection,\n  parseKinds,\n  parseMaxDepth,\n  parsePositiveInteger,\n} from \"../dependencies.js\";\nimport {\n  analyzeGraphImpact,\n  analyzeKnowledgeGraph,\n  analyzeRelationshipExecution,\n} from \"../relationship-analytics.js\";\nimport type { RelationshipQueryMeta } from \"../relationships.js\";\nimport {\n  computeRelationshipDominators,\n  detectRelationshipCommunities,\n  findRedundantRelationshipEdges,\n} from \"./analytics.js\";\nimport {\n  computeRelationshipCentrality,\n  findRelationshipCutStructure,\n} from \"./centrality.js\";\nimport { analyzeRelationshipSchedule } from \"./scheduling.js\";\nimport {\n  assembleWorkspaceRelationshipGraph,\n  resolveWorkspaceRelationshipKindRegistry,\n  type WorkspaceRelationshipAssembly,\n} from \"./assembly.js\";\nimport {\n  computeWorkspaceGraphFingerprint,\n  workspaceGraphCache,\n  type GraphCacheMetadata,\n} from \"./cache.js\";\nimport {\n  clearDurableGraphCache,\n  durableGraphCacheStatus,\n  loadGraphAuditBaseline,\n  openDurableGraphCache,\n  persistDurableGraphResult,\n  saveGraphAuditBaseline,\n  shouldPersistDurableGraphCache,\n  GRAPH_DURABLE_CACHE_MIN_ITEMS,\n  type DurableGraphCacheView,\n} from \"./durable-cache.js\";\nimport {\n  auditWorkspaceRelationshipGraph,\n  diffRelationshipAuditSnapshots,\n  type RelationshipAuditDelta,\n  type RelationshipAuditReport,\n  type RelationshipAuditSnapshot,\n} from \"./governance.js\";\nimport {\n  planRelationshipRemediation,\n  type RelationshipRemediationStep,\n} from \"./remediation.js\";\nimport {\n  enumerateRelationshipPaths,\n  hierarchyAncestors,\n  hierarchyDescendants,\n  orderingPredecessors,\n  orderingSuccessors,\n} from \"./traversal.js\";\n\nimport {\n  GRAPH_SUBCOMMAND_VALUES,\n  type GraphSubcommand,\n} from \"../cli-contracts/enum-contracts.js\";\n\nexport { GRAPH_SUBCOMMAND_VALUES, type GraphSubcommand };\n\n/** Graph subcommands that require a root item id. */\nconst ROOTED_SUBCOMMANDS = new Set<GraphSubcommand>([\n  \"ancestors\",\n  \"descendants\",\n  \"predecessors\",\n  \"successors\",\n  \"paths\",\n  \"impact\",\n  \"dominators\",\n]);\n\n/** Default bounded sample rows returned by analyze/audit projections. */\nconst DEFAULT_SAMPLE_LIMIT = 10;\n\n/** Documents the graph command options payload exchanged by command, SDK, and package integrations. */\nexport interface GraphCommandOptions {\n  /** Restricts traversal to registered relationship kinds (repeatable or comma-separated). */\n  kind?: string | string[];\n  /** Maximum traversal depth as a non-negative integer. */\n  maxDepth?: string | number;\n  /** Maximum returned rows per bounded collection. */\n  limit?: string | number;\n  /** Resume a traversal after this previously returned node id. */\n  after?: string;\n  /** Edge orientation for paths and impact queries (outgoing, incoming, or both). */\n  direction?: string;\n  /** Maximum enumerated paths for the paths subcommand. */\n  maxPaths?: string | number;\n  /** Maximum evidence sample entries per audit finding. */\n  sample?: string | number;\n  /** Item ids treated as explicitly valid isolates by the audit. */\n  exemptIsolate?: string | string[];\n  /** Item types whose active nodes are policy-valid isolates for the audit (repeatable or comma-separated). */\n  exemptIsolateType?: string | string[];\n  /** Persist the audit census as the change-since-baseline comparison point (audit only). */\n  saveBaseline?: boolean;\n  /** Rebuild and warm the durable graph index (index only). */\n  rebuild?: boolean;\n  /** Delete the durable graph index (index only). */\n  clear?: boolean;\n  /** Return counts-first envelopes without row collections. */\n  summary?: boolean;\n}\n\n/** Cost metadata attached to every graph query projection. */\nexport interface GraphQueryCost {\n  /** Nodes expanded while answering the query. */\n  visited_nodes: number;\n  /** Edges inspected while answering the query. */\n  inspected_edges: number;\n}\n\n/** Result envelope for the transitive traversal subcommands. */\nexport interface GraphTraversalResult {\n  /** Executed graph subcommand. */\n  subcommand: \"ancestors\" | \"descendants\" | \"predecessors\" | \"successors\";\n  /** Canonical root item id. */\n  root: string;\n  /** Total emitted node ids before summary suppression. */\n  count: number;\n  /** Whether configured bounds omitted reachable work. */\n  truncated: boolean;\n  /** Cursor resuming emission after the last returned node. */\n  next_cursor?: string;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Emitted node ids in deterministic breadth-first order; absent with summary. */\n  ids?: string[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One enumerated path projected with relationship kinds instead of raw edges. */\nexport interface GraphPathRow {\n  /** Ordered node ids from source to target inclusive. */\n  nodes: string[];\n  /** Relationship kind of each traversed edge, in path order. */\n  kinds: string[];\n  /** Number of edges in the path. */\n  length: number;\n}\n\n/** Result envelope for the paths subcommand. */\nexport interface GraphPathsResult {\n  /** Executed graph subcommand. */\n  subcommand: \"paths\";\n  /** Canonical source item id. */\n  root: string;\n  /** Canonical target item id. */\n  target: string;\n  /** Traversal orientation used for the enumeration. */\n  direction: string;\n  /** Total enumerated paths before summary suppression. */\n  count: number;\n  /** Whether depth, path-count, or safety bounds stopped the search early. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Enumerated paths, shortest first; absent with summary. */\n  paths?: GraphPathRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One affected item row in an impact projection. */\nexport interface GraphImpactRow {\n  /** Affected item id. */\n  id: string;\n  /** Shortest relationship distance from the root. */\n  distance: number;\n  /** Exact node path explaining why the item is affected. */\n  path: string[];\n}\n\n/** Result envelope for the impact subcommand. */\nexport interface GraphImpactResult {\n  /** Executed graph subcommand. */\n  subcommand: \"impact\";\n  /** Canonical impact-origin item id. */\n  root: string;\n  /** Traversal orientation used for the blast-radius walk. */\n  direction: string;\n  /** Total affected items before summary suppression. */\n  count: number;\n  /** Whether configured bounds omitted reachable work. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Affected item rows ordered by discovery; absent with summary. */\n  affected?: GraphImpactRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Bounded execution-graph projection inside an analyze result. */\nexport interface GraphExecutionSummary {\n  /** Whether the order-bearing graph is acyclic. */\n  acyclic: boolean;\n  /** Nodes participating in the topological order. */\n  ordered_node_count: number;\n  /** Number of parallelizable topological layers. */\n  layer_count: number;\n  /** Total items with no open prerequisites. */\n  frontier_count: number;\n  /** Bounded prerequisite-free sample; absent with summary. */\n  frontier?: string[];\n  /** Edge count of the longest execution path. */\n  critical_path_length: number;\n  /** Longest deterministic execution path; absent with summary. */\n  critical_path?: string[];\n  /** Total genuine ordering cycles. */\n  cycle_count: number;\n  /** Bounded ordering-cycle sample; absent with summary. */\n  cycles?: string[][];\n}\n\n/** Bounded knowledge-graph projection inside an analyze result. */\nexport interface GraphKnowledgeSummary {\n  /** Total weakly connected components. */\n  component_count: number;\n  /** Node count of the largest component. */\n  largest_component_size: number;\n  /** Total nodes without any relationship edges. */\n  orphan_count: number;\n  /** Bounded orphan sample; absent with summary. */\n  orphans?: string[];\n  /** Bounded maximum-degree hubs; absent with summary. */\n  hubs?: { id: string; degree: number }[];\n}\n\n/** Result envelope for the analyze subcommand. */\nexport interface GraphAnalyzeResult {\n  /** Executed graph subcommand. */\n  subcommand: \"analyze\";\n  /** Total indexed graph nodes. */\n  node_count: number;\n  /** Total deduplicated graph edges. */\n  edge_count: number;\n  /** Bound applied to every sample collection. */\n  sample_limit: number;\n  /** Execution-order analytics over registered ordering kinds. */\n  execution: GraphExecutionSummary;\n  /** Structural analytics over every stored edge. */\n  knowledge: GraphKnowledgeSummary;\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Result envelope for the audit subcommand. */\nexport interface GraphAuditResult {\n  /** Executed graph subcommand. */\n  subcommand: \"audit\";\n  /** Total audit findings. */\n  finding_count: number;\n  /** Finding counts keyed by severity. */\n  findings_by_severity: Record<string, number>;\n  /** Finding-row counts keyed by finding code. Before 2026.7.19 this field incorrectly accumulated affected subjects; consumers of that unit must migrate to affected_subjects_by_code. */\n  findings_by_code: Record<string, number>;\n  /** Affected-subject counts keyed by severity. */\n  affected_subjects_by_severity: Record<string, number>;\n  /** Affected-subject counts keyed by finding code. */\n  affected_subjects_by_code: Record<string, number>;\n  /** Structural coverage metrics computed during the audit. */\n  profile: RelationshipAuditReport[\"profile\"];\n  /** Ordered findings with bounded evidence samples; absent with summary. */\n  findings?: RelationshipAuditReport[\"findings\"];\n  /** Signed change since the persisted census baseline; absent when no baseline exists. */\n  baseline?: RelationshipAuditDelta;\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Result envelope for the durable-index maintenance subcommand. */\nexport interface GraphIndexResult {\n  /** Executed graph subcommand. */\n  subcommand: \"index\";\n  /** Maintenance action performed by this invocation. */\n  action: \"status\" | \"rebuilt\" | \"cleared\";\n  /** Durable index disposition against the current workspace snapshot. */\n  state: \"fresh\" | \"stale\" | \"absent\";\n  /** Persisted deterministic query results in the envelope. */\n  entry_count: number;\n  /** Items in the current workspace snapshot. */\n  item_count: number;\n  /** Item threshold above which implicit persistence activates. */\n  min_items_threshold: number;\n  /** Whether queries on this workspace will persist results right now. */\n  persist_enabled: boolean;\n  /** Truncated fingerprint of the current workspace snapshot. */\n  current_fingerprint: string;\n  /** ISO timestamp of the last persisted write, absent without an envelope. */\n  saved_at?: string;\n  /** Envelope size in bytes, absent without an envelope. */\n  bytes?: number;\n  /** Cache observability; maintenance invocations never populate it. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One bounded community row projected by the communities subcommand. */\nexport interface GraphCommunityRow {\n  /** Lexicographically smallest member id, naming the community. */\n  representative: string;\n  /** Total member count before sampling. */\n  size: number;\n  /** Bounded sorted member sample. */\n  members: string[];\n}\n\n/** Result envelope for the communities subcommand. */\nexport interface GraphCommunitiesResult {\n  /** Executed graph subcommand. */\n  subcommand: \"communities\";\n  /** Total detected communities meeting the size floor. */\n  community_count: number;\n  /** Member count of the largest community. */\n  largest_community_size: number;\n  /** Label-propagation sweeps executed. */\n  iterations: number;\n  /** Whether labels stabilized before the iteration bound. */\n  converged: boolean;\n  /** Whether the iteration bound stopped propagation early or the sample bound omitted rows. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Bounded community rows, largest first; absent with summary. */\n  communities?: GraphCommunityRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One redundant stored edge projected with its witness path. */\nexport interface GraphRedundancyRow {\n  /** Stored edge source id. */\n  source: string;\n  /** Stored edge target id. */\n  target: string;\n  /** Stored relationship kind. */\n  kind: string;\n  /** Semantic-orientation node path proving the edge is implied. */\n  witness: string[];\n}\n\n/** Result envelope for the redundancy subcommand. */\nexport interface GraphRedundancyResult {\n  /** Executed graph subcommand. */\n  subcommand: \"redundancy\";\n  /** Total redundant edges found within configured bounds. */\n  redundant_count: number;\n  /** Whether the row limit omitted further redundant edges. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Redundant edge rows in deterministic scan order; absent with summary. */\n  redundant?: GraphRedundancyRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One structural bottleneck row projected by the dominators subcommand. */\nexport interface GraphDominatorRow {\n  /** Bottleneck node id. */\n  id: string;\n  /** Immediate dominator appearing on every root-to-node path. */\n  idom: string;\n  /** Reachable nodes strictly gated by this node. */\n  dominated_count: number;\n}\n\n/** Result envelope for the dominators subcommand. */\nexport interface GraphDominatorsResult {\n  /** Executed graph subcommand. */\n  subcommand: \"dominators\";\n  /** Canonical analyzed root id. */\n  root: string;\n  /** Traversal orientation used for reachability. */\n  direction: string;\n  /** Reachable node count including the root. */\n  reachable_count: number;\n  /** Total nodes gating at least one other reachable node. */\n  bottleneck_count: number;\n  /** Whether the depth bound cut reachability or the row limit omitted bottleneck rows. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Bounded bottleneck rows, most-gating first; absent with summary. */\n  bottlenecks?: GraphDominatorRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One scheduled task row projected by the slack subcommand. */\nexport interface GraphScheduleRow {\n  /** Scheduled task id. */\n  id: string;\n  /** Earliest start (longest prerequisite distance). */\n  earliest_start: number;\n  /** Latest start preserving the makespan. */\n  latest_start: number;\n  /** Total float: latest start minus earliest start. */\n  slack: number;\n  /** Whether the task lies on a critical path. */\n  critical: boolean;\n}\n\n/** Result envelope for the critical-path slack subcommand. */\nexport interface GraphSlackResult {\n  /** Executed graph subcommand. */\n  subcommand: \"slack\";\n  /** Whether the order-bearing graph is acyclic. */\n  acyclic: boolean;\n  /** Total makespan in unit task durations. */\n  makespan: number;\n  /** Tasks participating in the order-bearing DAG. */\n  scheduled_count: number;\n  /** Tasks with zero slack. */\n  critical_count: number;\n  /** Edge count of the longest execution path. */\n  critical_path_length: number;\n  /** Genuine ordering cycles excluded from scheduling. */\n  cycle_count: number;\n  /** Whether the row limit omitted scheduled tasks. */\n  truncated: boolean;\n  /** Longest deterministic execution path; absent with summary. */\n  critical_path?: string[];\n  /** Bounded scheduled rows, lowest slack first; absent with summary. */\n  rows?: GraphScheduleRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One node ranked by structural centrality with directed fan-in/fan-out. */\nexport interface GraphCentralityRow {\n  /** Node id. */\n  id: string;\n  /** Undirected unique-neighbor degree. */\n  degree: number;\n  /** Distinct ordering predecessors that gate this node (dependency fan-in). */\n  in_degree: number;\n  /** Distinct ordering successors this node gates (dependency fan-out). */\n  out_degree: number;\n  /** Shortest-path betweenness centrality. */\n  betweenness: number;\n  /** Wasserman–Faust closeness centrality. */\n  closeness: number;\n}\n\n/** Result envelope for the centrality subcommand. */\nexport interface GraphCentralityResult {\n  /** Executed graph subcommand. */\n  subcommand: \"centrality\";\n  /** Total indexed graph nodes. */\n  node_count: number;\n  /** Simple undirected edge count over selected kinds. */\n  edge_count: number;\n  /** Whether the row limit omitted ranked nodes. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Bounded ranked node rows, highest betweenness first; absent with summary. */\n  rows?: GraphCentralityRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** One bridge edge projected by the articulation subcommand. */\nexport interface GraphBridgeRow {\n  /** Lexicographically smaller endpoint. */\n  source: string;\n  /** Lexicographically larger endpoint. */\n  target: string;\n}\n\n/** Result envelope for the articulation subcommand. */\nexport interface GraphArticulationResult {\n  /** Executed graph subcommand. */\n  subcommand: \"articulation\";\n  /** Total articulation points (cut vertices). */\n  articulation_count: number;\n  /** Total bridge edges (cut edges). */\n  bridge_count: number;\n  /** Whether the row limit omitted articulation points or bridges. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Bounded sorted articulation-point ids; absent with summary. */\n  articulation_points?: string[];\n  /** Bounded sorted bridge edges; absent with summary. */\n  bridges?: GraphBridgeRow[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Result envelope for the dry-run remediation planning subcommand. */\nexport interface GraphPlanResult {\n  /** Executed graph subcommand. */\n  subcommand: \"plan\";\n  /** Total derived remediation proposals before row bounding. */\n  step_count: number;\n  /** Proposal counts keyed by operation family. */\n  steps_by_op: Record<string, number>;\n  /** Proposal counts keyed by policy code. */\n  steps_by_code: Record<string, number>;\n  /** Total governance-audit findings the plan was derived from. */\n  finding_count: number;\n  /** Whether sample, scan, or row bounds omitted derivable proposals. */\n  truncated: boolean;\n  /** Query cost metadata. */\n  cost: GraphQueryCost;\n  /** Bounded proposal rows in audit severity order; absent with summary. */\n  steps?: RelationshipRemediationStep[];\n  /** Cache observability for this invocation. */\n  cache?: GraphCacheMetadata;\n}\n\n/** Union of every graph subcommand result envelope. */\nexport type GraphResult =\n  | GraphTraversalResult\n  | GraphPathsResult\n  | GraphImpactResult\n  | GraphAnalyzeResult\n  | GraphAuditResult\n  | GraphCommunitiesResult\n  | GraphRedundancyResult\n  | GraphDominatorsResult\n  | GraphSlackResult\n  | GraphCentralityResult\n  | GraphArticulationResult\n  | GraphPlanResult\n  | GraphIndexResult;\n\n/** Fully parsed graph invocation shared by the subcommand executors. */\ninterface GraphInvocation {\n  /** Assembled workspace relationship graph and node details. */\n  assembly: WorkspaceRelationshipAssembly;\n  /** Canonical registered kind filters, when provided. */\n  kinds?: string[];\n  /** Parsed non-negative depth bound. */\n  maxDepth?: number;\n  /** Parsed positive row bound. */\n  limit?: number;\n  /** Traversal resume cursor. */\n  after?: string;\n  /** Validated traversal orientation. */\n  direction: \"outgoing\" | \"incoming\" | \"both\";\n  /** Parsed positive path-count bound. */\n  maxPaths?: number;\n  /** Parsed positive audit sample bound. */\n  sample?: number;\n  /** Normalized audit isolate exemptions. */\n  exemptIsolates: string[];\n  /** Normalized audit isolate-exempt item types. */\n  exemptIsolateTypes: string[];\n  /** Whether the audit census is persisted as the comparison baseline. */\n  saveBaseline: boolean;\n  /** Whether row collections are suppressed. */\n  summary: boolean;\n}\n\n/** Normalize repeatable or comma-separated id options into a flat list. */\nfunction normalizeIdList(raw: string | string[] | undefined): string[] {\n  if (raw === undefined) return [];\n  return (Array.isArray(raw) ? raw : [raw])\n    .flatMap((value) => value.split(\",\"))\n    .map((value) => value.trim())\n    .filter((value) => value.length > 0);\n}\n\n/** Validate the graph subcommand and its positional-id requirements. */\nexport function parseGraphSubcommand(\n  raw: string,\n  id: string | undefined,\n  target: string | undefined,\n): GraphSubcommand {\n  const candidate = raw.trim().toLowerCase();\n  if (!(GRAPH_SUBCOMMAND_VALUES as readonly string[]).includes(candidate)) {\n    throw new PmCliError(\n      `Invalid graph subcommand \"${raw}\". Use one of: ${GRAPH_SUBCOMMAND_VALUES.join(\", \")}.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  const subcommand = candidate as GraphSubcommand;\n  if (ROOTED_SUBCOMMANDS.has(subcommand) && !id?.trim()) {\n    throw new PmCliError(\n      `graph ${subcommand} requires an item id.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n  if (subcommand === \"paths\" && !target?.trim()) {\n    throw new PmCliError(\n      \"graph paths requires a source and a target item id.\",\n      EXIT_CODE.USAGE,\n    );\n  }\n  return subcommand;\n}\n\n/**\n * Re-throw graph-kernel semantic option misuse (non-family kind, unknown\n * cursor, non-transitive redundancy kind) as a usage error carrying the\n * original explanation instead of an opaque crash.\n */\nfunction rethrowGraphUsage(error: unknown): never {\n  if (error instanceof TypeError)\n    throw new PmCliError(error.message, EXIT_CODE.USAGE);\n  throw error;\n}\n\n/** Convert traversal metadata into the shared cost/truncation projection. */\nfunction projectQueryMeta(meta: RelationshipQueryMeta): {\n  truncated: boolean;\n  cost: GraphQueryCost;\n} {\n  return {\n    truncated: meta.truncated,\n    cost: {\n      visited_nodes: meta.visitedNodes,\n      inspected_edges: meta.inspectedEdges,\n    },\n  };\n}\n\n/** Resolve one item id case-insensitively against the assembled graph. */\nfunction canonicalizeGraphId(\n  assembly: WorkspaceRelationshipAssembly,\n  raw: string,\n): string {\n  const wanted = raw.trim().toLowerCase();\n  for (const detail of assembly.details) {\n    if (\n      detail.id.trim().toLowerCase() === wanted &&\n      !assembly.missingIdSet.has(detail.id.toLowerCase())\n    ) {\n      return detail.id;\n    }\n  }\n  throw new PmCliError(`Item ${raw} not found`, EXIT_CODE.NOT_FOUND);\n}\n\n/** Execute one transitive traversal subcommand over the assembled graph. */\nfunction runGraphTraversal(\n  subcommand: \"ancestors\" | \"descendants\" | \"predecessors\" | \"successors\",\n  root: string,\n  invocation: GraphInvocation,\n): GraphTraversalResult {\n  const walk = {\n    ancestors: hierarchyAncestors,\n    descendants: hierarchyDescendants,\n    predecessors: orderingPredecessors,\n    successors: orderingSuccessors,\n  }[subcommand];\n  let result;\n  try {\n    result = walk(invocation.assembly.graph, root, {\n      ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n      ...(invocation.maxDepth === undefined\n        ? {}\n        : { maxDepth: invocation.maxDepth }),\n      ...(invocation.limit === undefined ? {} : { limit: invocation.limit }),\n      ...(invocation.after === undefined ? {} : { after: invocation.after }),\n    });\n  } catch (error) {\n    rethrowGraphUsage(error);\n  }\n  const meta = projectQueryMeta(result.meta);\n  return {\n    subcommand,\n    root,\n    count: result.value.length,\n    ...meta,\n    ...(result.meta.nextCursor === undefined\n      ? {}\n      : { next_cursor: result.meta.nextCursor }),\n    ...(invocation.summary ? {} : { ids: result.value }),\n  };\n}\n\n/** Execute the bounded simple-path enumeration subcommand. */\nfunction runGraphPaths(\n  root: string,\n  target: string,\n  invocation: GraphInvocation,\n): GraphPathsResult {\n  const result = enumerateRelationshipPaths(\n    invocation.assembly.graph,\n    root,\n    target,\n    {\n      direction: invocation.direction,\n      ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n      ...(invocation.maxDepth === undefined\n        ? {}\n        : { maxDepth: invocation.maxDepth }),\n      ...(invocation.maxPaths === undefined\n        ? {}\n        : { maxPaths: invocation.maxPaths }),\n    },\n  );\n  return {\n    subcommand: \"paths\",\n    root,\n    target,\n    direction: invocation.direction,\n    count: result.value.length,\n    ...projectQueryMeta(result.meta),\n    ...(invocation.summary\n      ? {}\n      : {\n          paths: result.value.map((path) => ({\n            nodes: path.nodes,\n            kinds: path.edges.map((edge) => edge.kind),\n            length: path.length,\n          })),\n        }),\n  };\n}\n\n/** Execute the bounded blast-radius impact subcommand. */\nfunction runGraphImpact(\n  root: string,\n  invocation: GraphInvocation,\n): GraphImpactResult {\n  const analysis = analyzeGraphImpact(invocation.assembly.graph, root, {\n    direction: invocation.direction,\n    ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n    ...(invocation.maxDepth === undefined\n      ? {}\n      : { maxDepth: invocation.maxDepth }),\n    ...(invocation.limit === undefined ? {} : { limit: invocation.limit }),\n  });\n  return {\n    subcommand: \"impact\",\n    root,\n    direction: invocation.direction,\n    count: analysis.affected.length,\n    truncated: analysis.truncated,\n    cost: {\n      visited_nodes: analysis.cost.visitedNodes,\n      inspected_edges: analysis.cost.inspectedEdges,\n    },\n    ...(invocation.summary ? {} : { affected: analysis.affected }),\n  };\n}\n\n/** Execute the workspace-wide execution and knowledge analytics subcommand. */\nfunction runGraphAnalyze(invocation: GraphInvocation): GraphAnalyzeResult {\n  const graph = invocation.assembly.graph;\n  const sampleLimit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const execution = analyzeRelationshipExecution(graph, {\n    registry: graph.registry(),\n  });\n  const knowledge = analyzeKnowledgeGraph(graph);\n  return {\n    subcommand: \"analyze\",\n    node_count: graph.nodes().length,\n    edge_count: graph.edges().length,\n    sample_limit: sampleLimit,\n    execution: {\n      acyclic: execution.acyclic,\n      ordered_node_count: execution.order.length,\n      layer_count: execution.layers.length,\n      frontier_count: execution.frontier.length,\n      critical_path_length: execution.criticalPathLength,\n      cycle_count: execution.cycles.length,\n      ...(invocation.summary\n        ? {}\n        : {\n            frontier: execution.frontier.slice(0, sampleLimit),\n            critical_path: execution.criticalPath.slice(0, sampleLimit),\n            cycles: execution.cycles.slice(0, sampleLimit),\n          }),\n    },\n    knowledge: {\n      component_count: knowledge.components.length,\n      largest_component_size: knowledge.components[0]?.length ?? 0,\n      orphan_count: knowledge.orphans.length,\n      ...(invocation.summary\n        ? {}\n        : {\n            orphans: knowledge.orphans.slice(0, sampleLimit),\n            hubs: knowledge.hubs.slice(0, sampleLimit),\n          }),\n    },\n  };\n}\n\n/** Execute the governance-audit subcommand over the assembled graph. */\nfunction runGraphAudit(\n  invocation: GraphInvocation,\n  isTerminal: (status: string) => boolean,\n): GraphAuditResult {\n  const report = auditWorkspaceRelationshipGraph(invocation.assembly, {\n    isTerminal,\n    ...(invocation.sample === undefined\n      ? {}\n      : { maxSampleSize: invocation.sample }),\n    ...(invocation.exemptIsolates.length === 0\n      ? {}\n      : { exemptIsolates: invocation.exemptIsolates }),\n    ...(invocation.exemptIsolateTypes.length === 0\n      ? {}\n      : { isolateExemptTypes: invocation.exemptIsolateTypes }),\n  });\n  const bySeverity: Record<string, number> = {};\n  const byCode: Record<string, number> = {};\n  const affectedBySeverity: Record<string, number> = {};\n  const affectedByCode: Record<string, number> = {};\n  for (const finding of report.findings) {\n    bySeverity[finding.severity] = (bySeverity[finding.severity] ?? 0) + 1;\n    byCode[finding.code] = (byCode[finding.code] ?? 0) + 1;\n    affectedBySeverity[finding.severity] =\n      (affectedBySeverity[finding.severity] ?? 0) + finding.count;\n    affectedByCode[finding.code] =\n      (affectedByCode[finding.code] ?? 0) + finding.count;\n  }\n  return {\n    subcommand: \"audit\",\n    finding_count: report.findings.length,\n    findings_by_severity: bySeverity,\n    findings_by_code: byCode,\n    affected_subjects_by_severity: affectedBySeverity,\n    affected_subjects_by_code: affectedByCode,\n    profile: report.profile,\n    ...(invocation.summary ? {} : { findings: report.findings }),\n  };\n}\n\n/** Execute the deterministic community-detection subcommand. */\nfunction runGraphCommunities(\n  invocation: GraphInvocation,\n): GraphCommunitiesResult {\n  const sampleLimit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const result = detectRelationshipCommunities(invocation.assembly.graph, {\n    ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n  });\n  const analysis = result.value;\n  return {\n    subcommand: \"communities\",\n    community_count: analysis.communities.length,\n    largest_community_size: analysis.communities[0]?.size ?? 0,\n    iterations: analysis.iterations,\n    converged: analysis.converged,\n    truncated: !analysis.converged || analysis.communities.length > sampleLimit,\n    cost: {\n      visited_nodes: result.meta.visitedNodes,\n      inspected_edges: result.meta.inspectedEdges,\n    },\n    ...(invocation.summary\n      ? {}\n      : {\n          communities: analysis.communities\n            .slice(0, sampleLimit)\n            .map((community) => ({\n              representative: community.representative,\n              size: community.size,\n              members: community.members.slice(0, sampleLimit),\n            })),\n        }),\n  };\n}\n\n/** Execute the transitive-redundancy scan subcommand. */\nfunction runGraphRedundancy(\n  invocation: GraphInvocation,\n): GraphRedundancyResult {\n  let result;\n  try {\n    result = findRedundantRelationshipEdges(invocation.assembly.graph, {\n      ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n      ...(invocation.maxDepth === undefined\n        ? {}\n        : { maxDepth: invocation.maxDepth }),\n      ...(invocation.limit === undefined ? {} : { limit: invocation.limit }),\n    });\n  } catch (error) {\n    rethrowGraphUsage(error);\n  }\n  return {\n    subcommand: \"redundancy\",\n    redundant_count: result.value.length,\n    ...projectQueryMeta(result.meta),\n    ...(invocation.summary\n      ? {}\n      : {\n          redundant: result.value.map((row) => ({\n            source: row.edge.source,\n            target: row.edge.target,\n            kind: row.edge.kind,\n            witness: row.witness,\n          })),\n        }),\n  };\n}\n\n/** Execute the dominator/bottleneck analysis subcommand. */\nfunction runGraphDominators(\n  root: string,\n  invocation: GraphInvocation,\n): GraphDominatorsResult {\n  const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const result = computeRelationshipDominators(\n    invocation.assembly.graph,\n    root,\n    {\n      direction: invocation.direction,\n      ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n      ...(invocation.maxDepth === undefined\n        ? {}\n        : { maxDepth: invocation.maxDepth }),\n    },\n  );\n  const bottlenecks = result.value.rows.filter((row) => row.dominatedCount > 0);\n  return {\n    subcommand: \"dominators\",\n    root,\n    direction: invocation.direction,\n    reachable_count: result.value.reachableCount,\n    bottleneck_count: bottlenecks.length,\n    truncated: result.meta.truncated || bottlenecks.length > limit,\n    cost: {\n      visited_nodes: result.meta.visitedNodes,\n      inspected_edges: result.meta.inspectedEdges,\n    },\n    ...(invocation.summary\n      ? {}\n      : {\n          bottlenecks: bottlenecks.slice(0, limit).map((row) => ({\n            id: row.id,\n            idom: row.idom,\n            dominated_count: row.dominatedCount,\n          })),\n        }),\n  };\n}\n\n/** Execute the critical-path slack (float) analysis subcommand. */\nfunction runGraphSlack(invocation: GraphInvocation): GraphSlackResult {\n  const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  // Scheduling spans every ordering kind; --kind is rejected upstream by\n  // assertGraphFlagScope, so no kind filter reaches the analysis here.\n  const analysis = analyzeRelationshipSchedule(invocation.assembly.graph);\n  const criticalCount = analysis.rows.filter((row) => row.critical).length;\n  return {\n    subcommand: \"slack\",\n    acyclic: analysis.acyclic,\n    makespan: analysis.makespan,\n    scheduled_count: analysis.scheduledCount,\n    critical_count: criticalCount,\n    critical_path_length: analysis.criticalPathLength,\n    cycle_count: analysis.cycles.length,\n    truncated: analysis.rows.length > limit,\n    ...(invocation.summary\n      ? {}\n      : {\n          critical_path: analysis.criticalPath,\n          rows: analysis.rows.slice(0, limit).map((row) => ({\n            id: row.id,\n            earliest_start: row.earliestStart,\n            latest_start: row.latestStart,\n            slack: row.slack,\n            critical: row.critical,\n          })),\n        }),\n  };\n}\n\n/** Execute the structural-centrality ranking subcommand. */\nfunction runGraphCentrality(\n  invocation: GraphInvocation,\n): GraphCentralityResult {\n  const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const result = computeRelationshipCentrality(invocation.assembly.graph, {\n    ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n  });\n  const analysis = result.value;\n  return {\n    subcommand: \"centrality\",\n    node_count: analysis.nodeCount,\n    edge_count: analysis.edgeCount,\n    truncated: analysis.rows.length > limit,\n    cost: {\n      visited_nodes: result.meta.visitedNodes,\n      inspected_edges: result.meta.inspectedEdges,\n    },\n    ...(invocation.summary\n      ? {}\n      : {\n          rows: analysis.rows.slice(0, limit).map((row) => ({\n            id: row.id,\n            degree: row.degree,\n            in_degree: row.inDegree,\n            out_degree: row.outDegree,\n            betweenness: row.betweenness,\n            closeness: row.closeness,\n          })),\n        }),\n  };\n}\n\n/** Execute the articulation-point and bridge (cut-structure) subcommand. */\nfunction runGraphArticulation(\n  invocation: GraphInvocation,\n): GraphArticulationResult {\n  const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const result = findRelationshipCutStructure(invocation.assembly.graph, {\n    ...(invocation.kinds === undefined ? {} : { kinds: invocation.kinds }),\n  });\n  const { articulationPoints, bridges } = result.value;\n  return {\n    subcommand: \"articulation\",\n    articulation_count: articulationPoints.length,\n    bridge_count: bridges.length,\n    truncated: articulationPoints.length > limit || bridges.length > limit,\n    cost: {\n      visited_nodes: result.meta.visitedNodes,\n      inspected_edges: result.meta.inspectedEdges,\n    },\n    ...(invocation.summary\n      ? {}\n      : {\n          articulation_points: articulationPoints.slice(0, limit),\n          bridges: bridges.slice(0, limit),\n        }),\n  };\n}\n\n/** Execute the dry-run remediation planning subcommand. */\nfunction runGraphPlan(\n  invocation: GraphInvocation,\n  isTerminal: (status: string) => boolean,\n): GraphPlanResult {\n  const limit = invocation.limit ?? DEFAULT_SAMPLE_LIMIT;\n  const plan = planRelationshipRemediation(invocation.assembly, {\n    isTerminal,\n    redundancyLimit: limit,\n    ...(invocation.sample === undefined\n      ? {}\n      : { maxSampleSize: invocation.sample }),\n    ...(invocation.exemptIsolates.length === 0\n      ? {}\n      : { exemptIsolates: invocation.exemptIsolates }),\n    ...(invocation.exemptIsolateTypes.length === 0\n      ? {}\n      : { isolateExemptTypes: invocation.exemptIsolateTypes }),\n  });\n  const byOp: Record<string, number> = {};\n  const byCode: Record<string, number> = {};\n  for (const step of plan.steps) {\n    byOp[step.op] = (byOp[step.op] ?? 0) + 1;\n    byCode[step.code] = (byCode[step.code] ?? 0) + 1;\n  }\n  return {\n    subcommand: \"plan\",\n    step_count: plan.steps.length,\n    steps_by_op: byOp,\n    steps_by_code: byCode,\n    finding_count: plan.report.findings.length,\n    truncated: plan.truncated || plan.steps.length > limit,\n    cost: {\n      visited_nodes: plan.cost.visitedNodes,\n      inspected_edges: plan.cost.inspectedEdges,\n    },\n    ...(invocation.summary ? {} : { steps: plan.steps.slice(0, limit) }),\n  };\n}\n\n/** Build the deterministic memoization key covering every query-shaping input. */\nfunction buildGraphQueryKey(\n  subcommand: GraphSubcommand,\n  root: string | undefined,\n  pathsTarget: string | undefined,\n  invocation: GraphInvocation,\n): string {\n  return JSON.stringify({\n    subcommand,\n    root: root ?? null,\n    target: pathsTarget ?? null,\n    kinds: invocation.kinds ?? null,\n    maxDepth: invocation.maxDepth ?? null,\n    limit: invocation.limit ?? null,\n    after: invocation.after ?? null,\n    direction: invocation.direction,\n    maxPaths: invocation.maxPaths ?? null,\n    sample: invocation.sample ?? null,\n    // The audit consumes exemptions as a case-insensitive set, so the key\n    // must not distinguish logically identical spellings or orderings.\n    exemptIsolates: [\n      ...new Set(invocation.exemptIsolates.map((id) => id.toLowerCase())),\n    ].sort(),\n    exemptIsolateTypes: [\n      ...new Set(\n        invocation.exemptIsolateTypes.map((type) => type.toLowerCase()),\n      ),\n    ].sort(),\n    summary: invocation.summary,\n  });\n}\n\n/** Dispatch one parsed graph subcommand to its executor. */\nfunction executeGraphSubcommand(\n  subcommand: Exclude<GraphSubcommand, \"index\">,\n  root: string | undefined,\n  pathsTarget: string | undefined,\n  invocation: GraphInvocation,\n  isTerminal: (status: string) => boolean,\n): GraphResult {\n  if (subcommand === \"analyze\") return runGraphAnalyze(invocation);\n  if (subcommand === \"audit\") return runGraphAudit(invocation, isTerminal);\n  if (subcommand === \"plan\") return runGraphPlan(invocation, isTerminal);\n  if (subcommand === \"communities\") return runGraphCommunities(invocation);\n  if (subcommand === \"redundancy\") return runGraphRedundancy(invocation);\n  if (subcommand === \"dominators\") return runGraphDominators(root!, invocation);\n  if (subcommand === \"slack\") return runGraphSlack(invocation);\n  if (subcommand === \"centrality\") return runGraphCentrality(invocation);\n  if (subcommand === \"articulation\") return runGraphArticulation(invocation);\n  if (subcommand === \"paths\")\n    return runGraphPaths(root!, pathsTarget!, invocation);\n  if (subcommand === \"impact\") return runGraphImpact(root!, invocation);\n  return runGraphTraversal(subcommand, root!, invocation);\n}\n\n/** Reject maintenance or baseline flags outside their owning subcommand. */\nfunction assertGraphFlagScope(\n  subcommand: GraphSubcommand,\n  options: GraphCommandOptions,\n): void {\n  if (\n    subcommand !== \"index\" &&\n    (options.rebuild === true || options.clear === true)\n  )\n    throw new PmCliError(\n      \"--rebuild and --clear apply only to graph index.\",\n      EXIT_CODE.USAGE,\n    );\n  if (subcommand !== \"audit\" && options.saveBaseline === true)\n    throw new PmCliError(\n      \"--save-baseline applies only to graph audit.\",\n      EXIT_CODE.USAGE,\n    );\n  // Slack schedules the whole ordering DAG (reusing the exact execution\n  // analysis, which has no kind filter), so reject --kind instead of silently\n  // ignoring it and letting the cache key diverge on an inert option.\n  if (subcommand === \"slack\" && options.kind !== undefined)\n    throw new PmCliError(\n      \"graph slack analyzes every ordering kind; --kind is not supported.\",\n      EXIT_CODE.USAGE,\n    );\n  if (options.rebuild === true && options.clear === true)\n    throw new PmCliError(\n      \"graph index accepts either --rebuild or --clear, not both.\",\n      EXIT_CODE.USAGE,\n    );\n}\n\n/**\n * Execute the durable-index maintenance subcommand: report status, delete the\n * envelope, or rebuild it and warm the counts-first analyze and audit census\n * queries so follow-up summary invocations answer from the persisted index.\n * A rebuild is also the explicit opt-in that enables persistence on\n * workspaces below the implicit item threshold.\n */\nasync function runGraphIndex(\n  pmRoot: string,\n  fingerprint: string,\n  invocation: GraphInvocation,\n  itemCount: number,\n  isTerminal: (status: string) => boolean,\n  options: GraphCommandOptions,\n): Promise<GraphIndexResult> {\n  let action: GraphIndexResult[\"action\"] = \"status\";\n  if (options.clear === true) {\n    await clearDurableGraphCache(pmRoot);\n    action = \"cleared\";\n  }\n  if (options.rebuild === true) {\n    await clearDurableGraphCache(pmRoot);\n    const view = await openDurableGraphCache(pmRoot, fingerprint);\n    const warmInvocation: GraphInvocation = {\n      assembly: invocation.assembly,\n      direction: \"both\",\n      exemptIsolates: [],\n      exemptIsolateTypes: [],\n      saveBaseline: false,\n      summary: true,\n    };\n    for (const warm of [\"analyze\", \"audit\"] as const) {\n      await persistDurableGraphResult(\n        pmRoot,\n        fingerprint,\n        view,\n        buildGraphQueryKey(warm, undefined, undefined, warmInvocation),\n        executeGraphSubcommand(\n          warm,\n          undefined,\n          undefined,\n          warmInvocation,\n          isTerminal,\n        ),\n      );\n    }\n    action = \"rebuilt\";\n  }\n  const status = await durableGraphCacheStatus(pmRoot, fingerprint);\n  return {\n    subcommand: \"index\",\n    action,\n    state: status.exists ? (status.fresh ? \"fresh\" : \"stale\") : \"absent\",\n    entry_count: status.entry_count,\n    item_count: itemCount,\n    min_items_threshold: GRAPH_DURABLE_CACHE_MIN_ITEMS,\n    persist_enabled: shouldPersistDurableGraphCache(itemCount, status.exists),\n    current_fingerprint: fingerprint.slice(0, 12),\n    ...(status.saved_at === undefined ? {} : { saved_at: status.saved_at }),\n    ...(status.bytes === undefined ? {} : { bytes: status.bytes }),\n  };\n}\n\n/**\n * Attach the change-since-baseline census delta to one audit envelope and\n * persist the current census when the caller requested a new baseline. The\n * delta always compares against the baseline as it existed before this\n * invocation, so `--save-baseline` reports drift once and then resets it.\n */\nasync function applyAuditBaseline(\n  pmRoot: string,\n  fingerprint: string,\n  audit: GraphAuditResult,\n  saveBaseline: boolean,\n): Promise<GraphAuditResult> {\n  const current: RelationshipAuditSnapshot = {\n    saved_at: new Date().toISOString(),\n    fingerprint,\n    affected_subjects_by_code: audit.affected_subjects_by_code,\n    profile: audit.profile,\n  };\n  const stored = await loadGraphAuditBaseline(pmRoot);\n  if (saveBaseline) await saveGraphAuditBaseline(pmRoot, current);\n  return stored === undefined\n    ? audit\n    : { ...audit, baseline: diffRelationshipAuditSnapshots(stored, current) };\n}\n\n/** Persist a rebuildable query result without allowing storage failure to reject the query. */\nasync function persistDurableGraphResultBestEffort(\n  pmRoot: string,\n  fingerprint: string,\n  view: DurableGraphCacheView,\n  queryKey: string,\n  result: GraphResult,\n): Promise<void> {\n  try {\n    await persistDurableGraphResult(\n      pmRoot,\n      fingerprint,\n      view,\n      queryKey,\n      result,\n    );\n  } catch {\n    // The in-memory result remains authoritative; the next invocation can rebuild the cache.\n  }\n}\n\n/** Implements run graph for the public runtime surface of this module. */\nexport async function runGraph(\n  subcommandRaw: string,\n  id: string | undefined,\n  target: string | undefined,\n  options: GraphCommandOptions,\n  global: GlobalOptions,\n): Promise<GraphResult> {\n  const subcommand = parseGraphSubcommand(subcommandRaw, id, target);\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 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 isTerminal = (status: string): boolean =>\n    isTerminalStatus(status, statusRegistry);\n  assertGraphFlagScope(subcommand, options);\n  const relationshipRegistry = resolveWorkspaceRelationshipKindRegistry();\n  const kinds = parseKinds(options.kind, relationshipRegistry);\n  const lookup = workspaceGraphCache().lookup(\n    pmRoot,\n    computeWorkspaceGraphFingerprint(items, isTerminal, relationshipRegistry),\n    () =>\n      assembleWorkspaceRelationshipGraph(\n        items,\n        isTerminal,\n        relationshipRegistry,\n      ),\n  );\n  const invocation: GraphInvocation = {\n    assembly: lookup.assembly,\n    ...(kinds === undefined ? {} : { kinds }),\n    maxDepth: parseMaxDepth(options.maxDepth),\n    limit: parsePositiveInteger(options.limit, \"limit\"),\n    after: options.after?.trim() || undefined,\n    direction: parseDirection(options.direction),\n    maxPaths: parsePositiveInteger(options.maxPaths, \"max-paths\"),\n    sample: parsePositiveInteger(options.sample, \"sample\"),\n    exemptIsolates: normalizeIdList(options.exemptIsolate),\n    exemptIsolateTypes: normalizeIdList(options.exemptIsolateType),\n    saveBaseline: options.saveBaseline === true,\n    summary: options.summary === true,\n  };\n  if (subcommand === \"index\") {\n    return runGraphIndex(\n      pmRoot,\n      lookup.fingerprint,\n      invocation,\n      items.length,\n      isTerminal,\n      options,\n    );\n  }\n  const root = ROOTED_SUBCOMMANDS.has(subcommand)\n    ? canonicalizeGraphId(invocation.assembly, id!)\n    : undefined;\n  const pathsTarget =\n    subcommand === \"paths\"\n      ? canonicalizeGraphId(invocation.assembly, target!)\n      : undefined;\n  const queryKey = buildGraphQueryKey(\n    subcommand,\n    root,\n    pathsTarget,\n    invocation,\n  );\n  const durableView = await openDurableGraphCache(pmRoot, lookup.fingerprint);\n  const durableValue = durableView.results[queryKey];\n  const memo = lookup.memoize(queryKey, () =>\n    durableValue !== undefined\n      ? (structuredClone(durableValue) as GraphResult)\n      : executeGraphSubcommand(\n          subcommand,\n          root,\n          pathsTarget,\n          invocation,\n          isTerminal,\n        ),\n  );\n  const persistEnabled = shouldPersistDurableGraphCache(\n    items.length,\n    durableView.exists,\n  );\n  if (!memo.reused && durableValue === undefined && persistEnabled) {\n    await persistDurableGraphResultBestEffort(\n      pmRoot,\n      lookup.fingerprint,\n      durableView,\n      queryKey,\n      memo.value,\n    );\n  }\n  const value =\n    memo.value.subcommand === \"audit\"\n      ? await applyAuditBaseline(\n          pmRoot,\n          lookup.fingerprint,\n          memo.value,\n          invocation.saveBaseline,\n        )\n      : memo.value;\n  return {\n    ...value,\n    cache: {\n      fingerprint: lookup.fingerprint.slice(0, 12),\n      assembly: lookup.assemblyReused ? \"hit\" : \"miss\",\n      result: memo.reused ? \"hit\" : \"miss\",\n      durable:\n        durableValue !== undefined ? \"hit\" : persistEnabled ? \"miss\" : \"off\",\n    },\n  };\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;;;AACH,OAAO,EAAE,+BAA+B,EAAE,MAAM,gCAAgC,CAAC;AACjF,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,kCAAkC,CAAC;AAC3E,OAAO,EAAE,4BAA4B,EAAE,MAAM,qCAAqC,CAAC;AAEnF,OAAO,EAAE,SAAS,EAAE,MAAM,gCAAgC,CAAC;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,wBAAwB,EAAE,MAAM,gCAAgC,CAAC;AAC1E,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC3E,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EACL,cAAc,EACd,UAAU,EACV,aAAa,EACb,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,kBAAkB,EAClB,qBAAqB,EACrB,4BAA4B,GAC7B,MAAM,8BAA8B,CAAC;AAEtC,OAAO,EACL,6BAA6B,EAC7B,6BAA6B,EAC7B,8BAA8B,GAC/B,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,6BAA6B,EAC7B,4BAA4B,GAC7B,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,2BAA2B,EAAE,MAAM,iBAAiB,CAAC;AAC9D,OAAO,EACL,kCAAkC,EAClC,wCAAwC,GAEzC,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,gCAAgC,EAChC,mBAAmB,GAEpB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,sBAAsB,EACtB,uBAAuB,EACvB,sBAAsB,EACtB,qBAAqB,EACrB,yBAAyB,EACzB,sBAAsB,EACtB,8BAA8B,EAC9B,6BAA6B,GAE9B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,+BAA+B,EAC/B,8BAA8B,GAI/B,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,2BAA2B,GAE5B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,0BAA0B,EAC1B,kBAAkB,EAClB,oBAAoB,EACpB,oBAAoB,EACpB,kBAAkB,GACnB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACL,uBAAuB,GAExB,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,uBAAuB,EAAwB,CAAC;AAEzD,qDAAqD;AACrD,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAkB;IAClD,WAAW;IACX,aAAa;IACb,cAAc;IACd,YAAY;IACZ,OAAO;IACP,QAAQ;IACR,YAAY;CACb,CAAC,CAAC;AAEH,yEAAyE;AACzE,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAsehC,2EAA2E;AAC3E,SAAS,eAAe,CAAC,GAAkC;IACzD,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACjC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACtC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SACpC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;SAC5B,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,oBAAoB,CAClC,GAAW,EACX,EAAsB,EACtB,MAA0B;IAE1B,MAAM,SAAS,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC3C,IAAI,CAAE,uBAA6C,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QACxE,MAAM,IAAI,UAAU,CAClB,6BAA6B,GAAG,kBAAkB,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EACvF,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,MAAM,UAAU,GAAG,SAA4B,CAAC;IAChD,IAAI,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;QACtD,MAAM,IAAI,UAAU,CAClB,SAAS,UAAU,uBAAuB,EAC1C,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,IAAI,UAAU,KAAK,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,UAAU,CAClB,qDAAqD,EACrD,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,KAAc;IACvC,IAAI,KAAK,YAAY,SAAS;QAC5B,MAAM,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;IACvD,MAAM,KAAK,CAAC;AACd,CAAC;AAED,6EAA6E;AAC7E,SAAS,gBAAgB,CAAC,IAA2B;IAInD,OAAO;QACL,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,IAAI,EAAE;YACJ,aAAa,EAAE,IAAI,CAAC,YAAY;YAChC,eAAe,EAAE,IAAI,CAAC,cAAc;SACrC;KACF,CAAC;AACJ,CAAC;AAED,0EAA0E;AAC1E,SAAS,mBAAmB,CAC1B,QAAuC,EACvC,GAAW;IAEX,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACtC,IACE,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,KAAK,MAAM;YACzC,CAAC,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,EACnD,CAAC;YACD,OAAO,MAAM,CAAC,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IACD,MAAM,IAAI,UAAU,CAAC,QAAQ,GAAG,YAAY,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;AACrE,CAAC;AAED,4EAA4E;AAC5E,SAAS,iBAAiB,CACxB,UAAuE,EACvE,IAAY,EACZ,UAA2B;IAE3B,MAAM,IAAI,GAAG;QACX,SAAS,EAAE,kBAAkB;QAC7B,WAAW,EAAE,oBAAoB;QACjC,YAAY,EAAE,oBAAoB;QAClC,UAAU,EAAE,kBAAkB;KAC/B,CAAC,UAAU,CAAC,CAAC;IACd,IAAI,MAAM,CAAC;IACX,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE;YAC7C,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;YACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;gBACnC,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;YACtC,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;YACtE,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;SACvE,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3C,OAAO;QACL,UAAU;QACV,IAAI;QACJ,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QAC1B,GAAG,IAAI;QACP,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,KAAK,SAAS;YACtC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;QAC5C,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;KACrD,CAAC;AACJ,CAAC;AAED,8DAA8D;AAC9D,SAAS,aAAa,CACpB,IAAY,EACZ,MAAc,EACd,UAA2B;IAE3B,MAAM,MAAM,GAAG,0BAA0B,CACvC,UAAU,CAAC,QAAQ,CAAC,KAAK,EACzB,IAAI,EACJ,MAAM,EACN;QACE,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;QACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;QACtC,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;KACvC,CACF,CAAC;IACF,OAAO;QACL,UAAU,EAAE,OAAO;QACnB,IAAI;QACJ,MAAM;QACN,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QAC1B,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC;QAChC,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBACjC,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;oBAC1C,MAAM,EAAE,IAAI,CAAC,MAAM;iBACpB,CAAC,CAAC;aACJ,CAAC;KACP,CAAC;AACJ,CAAC;AAED,0DAA0D;AAC1D,SAAS,cAAc,CACrB,IAAY,EACZ,UAA2B;IAE3B,MAAM,QAAQ,GAAG,kBAAkB,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE;QACnE,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;QACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;QACtC,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;KACvE,CAAC,CAAC;IACH,OAAO;QACL,UAAU,EAAE,QAAQ;QACpB,IAAI;QACJ,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM;QAC/B,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,IAAI,EAAE;YACJ,aAAa,EAAE,QAAQ,CAAC,IAAI,CAAC,YAAY;YACzC,eAAe,EAAE,QAAQ,CAAC,IAAI,CAAC,cAAc;SAC9C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,CAAC;KAC/D,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,SAAS,eAAe,CAAC,UAA2B;IAClD,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC;IACxC,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IAC7D,MAAM,SAAS,GAAG,4BAA4B,CAAC,KAAK,EAAE;QACpD,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE;KAC3B,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAC/C,OAAO;QACL,UAAU,EAAE,SAAS;QACrB,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM;QAChC,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM;QAChC,YAAY,EAAE,WAAW;QACzB,SAAS,EAAE;YACT,OAAO,EAAE,SAAS,CAAC,OAAO;YAC1B,kBAAkB,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM;YAC1C,WAAW,EAAE,SAAS,CAAC,MAAM,CAAC,MAAM;YACpC,cAAc,EAAE,SAAS,CAAC,QAAQ,CAAC,MAAM;YACzC,oBAAoB,EAAE,SAAS,CAAC,kBAAkB;YAClD,WAAW,EAAE,SAAS,CAAC,MAAM,CAAC,MAAM;YACpC,GAAG,CAAC,UAAU,CAAC,OAAO;gBACpB,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC;oBACE,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;oBAClD,aAAa,EAAE,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;oBAC3D,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;iBAC/C,CAAC;SACP;QACD,SAAS,EAAE;YACT,eAAe,EAAE,SAAS,CAAC,UAAU,CAAC,MAAM;YAC5C,sBAAsB,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC;YAC5D,YAAY,EAAE,SAAS,CAAC,OAAO,CAAC,MAAM;YACtC,GAAG,CAAC,UAAU,CAAC,OAAO;gBACpB,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC;oBACE,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;oBAChD,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;iBAC3C,CAAC;SACP;KACF,CAAC;AACJ,CAAC;AAED,wEAAwE;AACxE,SAAS,aAAa,CACpB,UAA2B,EAC3B,UAAuC;IAEvC,MAAM,MAAM,GAAG,+BAA+B,CAAC,UAAU,CAAC,QAAQ,EAAE;QAClE,UAAU;QACV,GAAG,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS;YACjC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,aAAa,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC;QACzC,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;YACxC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,CAAC,cAAc,EAAE,CAAC;QAClD,GAAG,CAAC,UAAU,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC;YAC5C,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,kBAAkB,EAAE,UAAU,CAAC,kBAAkB,EAAE,CAAC;KAC3D,CAAC,CAAC;IACH,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,kBAAkB,GAA2B,EAAE,CAAC;IACtD,MAAM,cAAc,GAA2B,EAAE,CAAC;IAClD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACvE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACvD,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC;YAClC,CAAC,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC9D,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC;YAC1B,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;IACxD,CAAC;IACD,OAAO;QACL,UAAU,EAAE,OAAO;QACnB,aAAa,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;QACrC,oBAAoB,EAAE,UAAU;QAChC,gBAAgB,EAAE,MAAM;QACxB,6BAA6B,EAAE,kBAAkB;QACjD,yBAAyB,EAAE,cAAc;QACzC,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC;KAC7D,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAS,mBAAmB,CAC1B,UAA2B;IAE3B,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IAC7D,MAAM,MAAM,GAAG,6BAA6B,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE;QACtE,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;KACvE,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC;IAC9B,OAAO;QACL,UAAU,EAAE,aAAa;QACzB,eAAe,EAAE,QAAQ,CAAC,WAAW,CAAC,MAAM;QAC5C,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC;QAC1D,UAAU,EAAE,QAAQ,CAAC,UAAU;QAC/B,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,SAAS,EAAE,CAAC,QAAQ,CAAC,SAAS,IAAI,QAAQ,CAAC,WAAW,CAAC,MAAM,GAAG,WAAW;QAC3E,IAAI,EAAE;YACJ,aAAa,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY;YACvC,eAAe,EAAE,MAAM,CAAC,IAAI,CAAC,cAAc;SAC5C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,WAAW,EAAE,QAAQ,CAAC,WAAW;qBAC9B,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;qBACrB,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;oBACnB,cAAc,EAAE,SAAS,CAAC,cAAc;oBACxC,IAAI,EAAE,SAAS,CAAC,IAAI;oBACpB,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC;iBACjD,CAAC,CAAC;aACN,CAAC;KACP,CAAC;AACJ,CAAC;AAED,yDAAyD;AACzD,SAAS,kBAAkB,CACzB,UAA2B;IAE3B,IAAI,MAAM,CAAC;IACX,IAAI,CAAC;QACH,MAAM,GAAG,8BAA8B,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE;YACjE,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;YACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;gBACnC,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;YACtC,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;SACvE,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO;QACL,UAAU,EAAE,YAAY;QACxB,eAAe,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QACpC,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC;QAChC,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBACpC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM;oBACvB,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM;oBACvB,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI;oBACnB,OAAO,EAAE,GAAG,CAAC,OAAO;iBACrB,CAAC,CAAC;aACJ,CAAC;KACP,CAAC;AACJ,CAAC;AAED,4DAA4D;AAC5D,SAAS,kBAAkB,CACzB,IAAY,EACZ,UAA2B;IAE3B,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IACvD,MAAM,MAAM,GAAG,6BAA6B,CAC1C,UAAU,CAAC,QAAQ,CAAC,KAAK,EACzB,IAAI,EACJ;QACE,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;QACtE,GAAG,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC;KACvC,CACF,CAAC;IACF,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;IAC9E,OAAO;QACL,UAAU,EAAE,YAAY;QACxB,IAAI;QACJ,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,eAAe,EAAE,MAAM,CAAC,KAAK,CAAC,cAAc;QAC5C,gBAAgB,EAAE,WAAW,CAAC,MAAM;QACpC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,WAAW,CAAC,MAAM,GAAG,KAAK;QAC9D,IAAI,EAAE;YACJ,aAAa,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY;YACvC,eAAe,EAAE,MAAM,CAAC,IAAI,CAAC,cAAc;SAC5C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBACrD,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,eAAe,EAAE,GAAG,CAAC,cAAc;iBACpC,CAAC,CAAC;aACJ,CAAC;KACP,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,SAAS,aAAa,CAAC,UAA2B;IAChD,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IACvD,uEAAuE;IACvE,qEAAqE;IACrE,MAAM,QAAQ,GAAG,2BAA2B,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;IACzE,OAAO;QACL,UAAU,EAAE,OAAO;QACnB,OAAO,EAAE,QAAQ,CAAC,OAAO;QACzB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,eAAe,EAAE,QAAQ,CAAC,cAAc;QACxC,cAAc,EAAE,aAAa;QAC7B,oBAAoB,EAAE,QAAQ,CAAC,kBAAkB;QACjD,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM;QACnC,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK;QACvC,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,aAAa,EAAE,QAAQ,CAAC,YAAY;gBACpC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBAChD,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,cAAc,EAAE,GAAG,CAAC,aAAa;oBACjC,YAAY,EAAE,GAAG,CAAC,WAAW;oBAC7B,KAAK,EAAE,GAAG,CAAC,KAAK;oBAChB,QAAQ,EAAE,GAAG,CAAC,QAAQ;iBACvB,CAAC,CAAC;aACJ,CAAC;KACP,CAAC;AACJ,CAAC;AAED,4DAA4D;AAC5D,SAAS,kBAAkB,CACzB,UAA2B;IAE3B,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IACvD,MAAM,MAAM,GAAG,6BAA6B,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE;QACtE,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;KACvE,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC;IAC9B,OAAO;QACL,UAAU,EAAE,YAAY;QACxB,UAAU,EAAE,QAAQ,CAAC,SAAS;QAC9B,UAAU,EAAE,QAAQ,CAAC,SAAS;QAC9B,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK;QACvC,IAAI,EAAE;YACJ,aAAa,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY;YACvC,eAAe,EAAE,MAAM,CAAC,IAAI,CAAC,cAAc;SAC5C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBAChD,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,GAAG,CAAC,MAAM;oBAClB,SAAS,EAAE,GAAG,CAAC,QAAQ;oBACvB,UAAU,EAAE,GAAG,CAAC,SAAS;oBACzB,WAAW,EAAE,GAAG,CAAC,WAAW;oBAC5B,SAAS,EAAE,GAAG,CAAC,SAAS;iBACzB,CAAC,CAAC;aACJ,CAAC;KACP,CAAC;AACJ,CAAC;AAED,4EAA4E;AAC5E,SAAS,oBAAoB,CAC3B,UAA2B;IAE3B,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IACvD,MAAM,MAAM,GAAG,4BAA4B,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,EAAE;QACrE,GAAG,CAAC,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;KACvE,CAAC,CAAC;IACH,MAAM,EAAE,kBAAkB,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC;IACrD,OAAO;QACL,UAAU,EAAE,cAAc;QAC1B,kBAAkB,EAAE,kBAAkB,CAAC,MAAM;QAC7C,YAAY,EAAE,OAAO,CAAC,MAAM;QAC5B,SAAS,EAAE,kBAAkB,CAAC,MAAM,GAAG,KAAK,IAAI,OAAO,CAAC,MAAM,GAAG,KAAK;QACtE,IAAI,EAAE;YACJ,aAAa,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY;YACvC,eAAe,EAAE,MAAM,CAAC,IAAI,CAAC,cAAc;SAC5C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO;YACpB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,mBAAmB,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;gBACvD,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACjC,CAAC;KACP,CAAC;AACJ,CAAC;AAED,2DAA2D;AAC3D,SAAS,YAAY,CACnB,UAA2B,EAC3B,UAAuC;IAEvC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,IAAI,oBAAoB,CAAC;IACvD,MAAM,IAAI,GAAG,2BAA2B,CAAC,UAAU,CAAC,QAAQ,EAAE;QAC5D,UAAU;QACV,eAAe,EAAE,KAAK;QACtB,GAAG,CAAC,UAAU,CAAC,MAAM,KAAK,SAAS;YACjC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,aAAa,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC;QACzC,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;YACxC,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,CAAC,cAAc,EAAE,CAAC;QAClD,GAAG,CAAC,UAAU,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC;YAC5C,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,kBAAkB,EAAE,UAAU,CAAC,kBAAkB,EAAE,CAAC;KAC3D,CAAC,CAAC;IACH,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IACD,OAAO;QACL,UAAU,EAAE,MAAM;QAClB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;QAC7B,WAAW,EAAE,IAAI;QACjB,aAAa,EAAE,MAAM;QACrB,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM;QAC1C,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK;QACtD,IAAI,EAAE;YACJ,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,YAAY;YACrC,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc;SAC1C;QACD,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;KACrE,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,SAAS,kBAAkB,CACzB,UAA2B,EAC3B,IAAwB,EACxB,WAA+B,EAC/B,UAA2B;IAE3B,OAAO,IAAI,CAAC,SAAS,CAAC;QACpB,UAAU;QACV,IAAI,EAAE,IAAI,IAAI,IAAI;QAClB,MAAM,EAAE,WAAW,IAAI,IAAI;QAC3B,KAAK,EAAE,UAAU,CAAC,KAAK,IAAI,IAAI;QAC/B,QAAQ,EAAE,UAAU,CAAC,QAAQ,IAAI,IAAI;QACrC,KAAK,EAAE,UAAU,CAAC,KAAK,IAAI,IAAI;QAC/B,KAAK,EAAE,UAAU,CAAC,KAAK,IAAI,IAAI;QAC/B,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,QAAQ,EAAE,UAAU,CAAC,QAAQ,IAAI,IAAI;QACrC,MAAM,EAAE,UAAU,CAAC,MAAM,IAAI,IAAI;QACjC,sEAAsE;QACtE,mEAAmE;QACnE,cAAc,EAAE;YACd,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;SACpE,CAAC,IAAI,EAAE;QACR,kBAAkB,EAAE;YAClB,GAAG,IAAI,GAAG,CACR,UAAU,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAChE;SACF,CAAC,IAAI,EAAE;QACR,OAAO,EAAE,UAAU,CAAC,OAAO;KAC5B,CAAC,CAAC;AACL,CAAC;AAED,4DAA4D;AAC5D,SAAS,sBAAsB,CAC7B,UAA6C,EAC7C,IAAwB,EACxB,WAA+B,EAC/B,UAA2B,EAC3B,UAAuC;IAEvC,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC,UAAU,CAAC,CAAC;IACjE,IAAI,UAAU,KAAK,OAAO;QAAE,OAAO,aAAa,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACzE,IAAI,UAAU,KAAK,MAAM;QAAE,OAAO,YAAY,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACvE,IAAI,UAAU,KAAK,aAAa;QAAE,OAAO,mBAAmB,CAAC,UAAU,CAAC,CAAC;IACzE,IAAI,UAAU,KAAK,YAAY;QAAE,OAAO,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACvE,IAAI,UAAU,KAAK,YAAY;QAAE,OAAO,kBAAkB,CAAC,IAAK,EAAE,UAAU,CAAC,CAAC;IAC9E,IAAI,UAAU,KAAK,OAAO;QAAE,OAAO,aAAa,CAAC,UAAU,CAAC,CAAC;IAC7D,IAAI,UAAU,KAAK,YAAY;QAAE,OAAO,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACvE,IAAI,UAAU,KAAK,cAAc;QAAE,OAAO,oBAAoB,CAAC,UAAU,CAAC,CAAC;IAC3E,IAAI,UAAU,KAAK,OAAO;QACxB,OAAO,aAAa,CAAC,IAAK,EAAE,WAAY,EAAE,UAAU,CAAC,CAAC;IACxD,IAAI,UAAU,KAAK,QAAQ;QAAE,OAAO,cAAc,CAAC,IAAK,EAAE,UAAU,CAAC,CAAC;IACtE,OAAO,iBAAiB,CAAC,UAAU,EAAE,IAAK,EAAE,UAAU,CAAC,CAAC;AAC1D,CAAC;AAED,4EAA4E;AAC5E,SAAS,oBAAoB,CAC3B,UAA2B,EAC3B,OAA4B;IAE5B,IACE,UAAU,KAAK,OAAO;QACtB,CAAC,OAAO,CAAC,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC;QAEpD,MAAM,IAAI,UAAU,CAClB,kDAAkD,EAClD,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,IAAI,UAAU,KAAK,OAAO,IAAI,OAAO,CAAC,YAAY,KAAK,IAAI;QACzD,MAAM,IAAI,UAAU,CAClB,8CAA8C,EAC9C,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,sEAAsE;IACtE,4EAA4E;IAC5E,oEAAoE;IACpE,IAAI,UAAU,KAAK,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QACtD,MAAM,IAAI,UAAU,CAClB,oEAAoE,EACpE,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,IAAI,OAAO,CAAC,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI;QACpD,MAAM,IAAI,UAAU,CAClB,4DAA4D,EAC5D,SAAS,CAAC,KAAK,CAChB,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,aAAa,CAC1B,MAAc,EACd,WAAmB,EACnB,UAA2B,EAC3B,SAAiB,EACjB,UAAuC,EACvC,OAA4B;IAE5B,IAAI,MAAM,GAA+B,QAAQ,CAAC;IAClD,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QAC3B,MAAM,sBAAsB,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,GAAG,SAAS,CAAC;IACrB,CAAC;IACD,IAAI,OAAO,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QAC7B,MAAM,sBAAsB,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,MAAM,qBAAqB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9D,MAAM,cAAc,GAAoB;YACtC,QAAQ,EAAE,UAAU,CAAC,QAAQ;YAC7B,SAAS,EAAE,MAAM;YACjB,cAAc,EAAE,EAAE;YAClB,kBAAkB,EAAE,EAAE;YACtB,YAAY,EAAE,KAAK;YACnB,OAAO,EAAE,IAAI;SACd,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE,OAAO,CAAU,EAAE,CAAC;YACjD,MAAM,yBAAyB,CAC7B,MAAM,EACN,WAAW,EACX,IAAI,EACJ,kBAAkB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,EAC9D,sBAAsB,CACpB,IAAI,EACJ,SAAS,EACT,SAAS,EACT,cAAc,EACd,UAAU,CACX,CACF,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,SAAS,CAAC;IACrB,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,uBAAuB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAClE,OAAO;QACL,UAAU,EAAE,OAAO;QACnB,MAAM;QACN,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ;QACpE,WAAW,EAAE,MAAM,CAAC,WAAW;QAC/B,UAAU,EAAE,SAAS;QACrB,mBAAmB,EAAE,6BAA6B;QAClD,eAAe,EAAE,8BAA8B,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC;QACzE,mBAAmB,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;QAC7C,GAAG,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC;QACvE,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;KAC/D,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,kBAAkB,CAC/B,MAAc,EACd,WAAmB,EACnB,KAAuB,EACvB,YAAqB;IAErB,MAAM,OAAO,GAA8B;QACzC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QAClC,WAAW;QACX,yBAAyB,EAAE,KAAK,CAAC,yBAAyB;QAC1D,OAAO,EAAE,KAAK,CAAC,OAAO;KACvB,CAAC;IACF,MAAM,MAAM,GAAG,MAAM,sBAAsB,CAAC,MAAM,CAAC,CAAC;IACpD,IAAI,YAAY;QAAE,MAAM,sBAAsB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChE,OAAO,MAAM,KAAK,SAAS;QACzB,CAAC,CAAC,KAAK;QACP,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,8BAA8B,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;AAC9E,CAAC;AAED,+FAA+F;AAC/F,KAAK,UAAU,mCAAmC,CAChD,MAAc,EACd,WAAmB,EACnB,IAA2B,EAC3B,QAAgB,EAChB,MAAmB;IAEnB,IAAI,CAAC;QACH,MAAM,yBAAyB,CAC7B,MAAM,EACN,WAAW,EACX,IAAI,EACJ,QAAQ,EACR,MAAM,CACP,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,yFAAyF;IAC3F,CAAC;AACH,CAAC;AAED,0EAA0E;AAC1E,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,aAAqB,EACrB,EAAsB,EACtB,MAA0B,EAC1B,OAA4B,EAC5B,MAAqB;IAErB,MAAM,UAAU,GAAG,oBAAoB,CAAC,aAAa,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IACnE,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACzD,IAAI,CAAC,CAAC,MAAM,UAAU,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,UAAU,CAClB,iCAAiC,MAAM,sBAAsB,EAC7D,SAAS,CAAC,SAAS,CACpB,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,uBAAuB,CAC1C,QAAQ,EACR,+BAA+B,EAAE,CAClC,CAAC;IACF,MAAM,KAAK,GAAG,MAAM,wBAAwB,CAC1C,MAAM,EACN,QAAQ,CAAC,WAAW,EACpB,YAAY,CAAC,cAAc,EAC3B,SAAS,EACT,QAAQ,CAAC,MAAM,CAChB,CAAC;IACF,MAAM,cAAc,GAAG,4BAA4B,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG,CAAC,MAAc,EAAW,EAAE,CAC7C,gBAAgB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC3C,oBAAoB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,oBAAoB,GAAG,wCAAwC,EAAE,CAAC;IACxE,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,mBAAmB,EAAE,CAAC,MAAM,CACzC,MAAM,EACN,gCAAgC,CAAC,KAAK,EAAE,UAAU,EAAE,oBAAoB,CAAC,EACzE,GAAG,EAAE,CACH,kCAAkC,CAChC,KAAK,EACL,UAAU,EACV,oBAAoB,CACrB,CACJ,CAAC;IACF,MAAM,UAAU,GAAoB;QAClC,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;QACzC,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC;QACzC,KAAK,EAAE,oBAAoB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC;QACnD,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,SAAS;QACzC,SAAS,EAAE,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC;QAC5C,QAAQ,EAAE,oBAAoB,CAAC,OAAO,CAAC,QAAQ,EAAE,WAAW,CAAC;QAC7D,MAAM,EAAE,oBAAoB,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC;QACtD,cAAc,EAAE,eAAe,CAAC,OAAO,CAAC,aAAa,CAAC;QACtD,kBAAkB,EAAE,eAAe,CAAC,OAAO,CAAC,iBAAiB,CAAC;QAC9D,YAAY,EAAE,OAAO,CAAC,YAAY,KAAK,IAAI;QAC3C,OAAO,EAAE,OAAO,CAAC,OAAO,KAAK,IAAI;KAClC,CAAC;IACF,IAAI,UAAU,KAAK,OAAO,EAAE,CAAC;QAC3B,OAAO,aAAa,CAClB,MAAM,EACN,MAAM,CAAC,WAAW,EAClB,UAAU,EACV,KAAK,CAAC,MAAM,EACZ,UAAU,EACV,OAAO,CACR,CAAC;IACJ,CAAC;IACD,MAAM,IAAI,GAAG,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC;QAC7C,CAAC,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAG,CAAC;QAC/C,CAAC,CAAC,SAAS,CAAC;IACd,MAAM,WAAW,GACf,UAAU,KAAK,OAAO;QACpB,CAAC,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAO,CAAC;QACnD,CAAC,CAAC,SAAS,CAAC;IAChB,MAAM,QAAQ,GAAG,kBAAkB,CACjC,UAAU,EACV,IAAI,EACJ,WAAW,EACX,UAAU,CACX,CAAC;IACF,MAAM,WAAW,GAAG,MAAM,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;IAC5E,MAAM,YAAY,GAAG,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACnD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,EAAE,CACzC,YAAY,KAAK,SAAS;QACxB,CAAC,CAAE,eAAe,CAAC,YAAY,CAAiB;QAChD,CAAC,CAAC,sBAAsB,CACpB,UAAU,EACV,IAAI,EACJ,WAAW,EACX,UAAU,EACV,UAAU,CACX,CACN,CAAC;IACF,MAAM,cAAc,GAAG,8BAA8B,CACnD,KAAK,CAAC,MAAM,EACZ,WAAW,CAAC,MAAM,CACnB,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,YAAY,KAAK,SAAS,IAAI,cAAc,EAAE,CAAC;QACjE,MAAM,mCAAmC,CACvC,MAAM,EACN,MAAM,CAAC,WAAW,EAClB,WAAW,EACX,QAAQ,EACR,IAAI,CAAC,KAAK,CACX,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GACT,IAAI,CAAC,KAAK,CAAC,UAAU,KAAK,OAAO;QAC/B,CAAC,CAAC,MAAM,kBAAkB,CACtB,MAAM,EACN,MAAM,CAAC,WAAW,EAClB,IAAI,CAAC,KAAK,EACV,UAAU,CAAC,YAAY,CACxB;QACH,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACjB,OAAO;QACL,GAAG,KAAK;QACR,KAAK,EAAE;YACL,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAC5C,QAAQ,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM;YAChD,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM;YACpC,OAAO,EACL,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK;SACvE;KACF,CAAC;AACJ,CAAC","debugId":"7f767038-30c6-555b-b9ac-adaf98b154e2"}

package/dist/sdk/graph/scheduling.d.ts

@@ -0,0 +1,59 @@
+import { RelationshipGraph } from "../relationships.js";
+/** One scheduled task row with its earliest/latest window and total float. */
+export interface RelationshipScheduleRow {
+    /** Scheduled task id. */
+    id: string;
+    /** Longest prerequisite distance from any source (earliest start). */
+    earliestStart: number;
+    /** Earliest start plus the unit task duration. */
+    earliestFinish: number;
+    /** Latest start that still preserves the makespan. */
+    latestStart: number;
+    /** Latest finish that still preserves the makespan. */
+    latestFinish: number;
+    /** Total float: latest start minus earliest start. */
+    slack: number;
+    /** Whether the task has zero slack and lies on a critical path. */
+    critical: boolean;
+}
+/** Bounded schedule-analysis controls. */
+export interface GraphScheduleOptions {
+    /** Abort signal checked once at entry, before the forward pass. */
+    signal?: AbortSignal;
+}
+/** Deterministic critical-path schedule of the order-bearing subgraph. */
+export interface RelationshipScheduleAnalysis {
+    /** Whether the result is exact rather than sampled or approximate. */
+    exact: true;
+    /** Whether the order-bearing graph is acyclic. */
+    acyclic: boolean;
+    /** Total makespan in unit task durations; zero when nothing is scheduled. */
+    makespan: number;
+    /** Number of tasks participating in the order-bearing DAG. */
+    scheduledCount: number;
+    /** Longest deterministic execution path — a canonical zero-slack chain. */
+    criticalPath: string[];
+    /** Edge count of the critical path. */
+    criticalPathLength: number;
+    /** Genuine ordering cycles, excluded from scheduling. */
+    cycles: string[][];
+    /** Scheduled rows sorted by ascending slack, then earliest start, then id. */
+    rows: RelationshipScheduleRow[];
+    /** Semantic provenance for the analysis. */
+    provenance: {
+        algorithm: "critical-path-method";
+        edgeFamily: "ordering";
+        weighting: "unit";
+    };
+}
+/**
+ * Compute the deterministic critical-path schedule of the order-bearing
+ * subgraph. Earliest-start distances and the critical path come from the exact
+ * execution analysis; the backward pass then assigns each task the latest start
+ * that preserves the makespan and reports total float as `slack`. Zero-slack
+ * tasks are `critical`. Only tasks with a well-defined earliest start are
+ * scheduled: tasks with no order-bearing edge, tasks on a genuine ordering
+ * cycle, and tasks transitively gated by a cycle (excluded from Kahn's partial
+ * order) are all omitted from `rows`; genuine cycles are reported in `cycles`.
+ */
+export declare function analyzeRelationshipSchedule(graph: RelationshipGraph, options?: GraphScheduleOptions): RelationshipScheduleAnalysis;

package/dist/sdk/graph/scheduling.js

@@ -0,0 +1,125 @@
+/**
+ * @module sdk/graph/scheduling
+ *
+ * Critical Path Method (CPM) scheduling over the order-bearing relationship
+ * DAG. The forward pass — topological order, earliest-start distances, the
+ * longest deterministic path, and genuine-cycle isolation — is reused from the
+ * exact execution analysis; this module adds the backward pass that derives
+ * each task's latest start, latest finish, and total float (slack), then
+ * classifies zero-slack tasks as critical. Durations are unit-weighted so the
+ * schedule is deterministic and metadata-independent: slack counts how many
+ * whole prerequisite hops a task can drift without extending the makespan.
+ * Only tasks with a well-defined earliest start are scheduled: nodes with no
+ * order-bearing edge, genuine ordering cycles, and any task transitively gated
+ * by a cycle (whose earliest start is undefined) are all omitted from `rows`.
+ * Genuine ordering cycles are additionally reported in `cycles`.
+ */
+
+!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]="b92fecb2-bbc5-5837-906c-bf5d32b2a4d6")}catch(e){}}();
+import { analyzeRelationshipExecution, } from "../relationship-analytics.js";
+import { orientOrderingEdge } from "./traversal.js";
+/**
+ * Collect the execution-oriented forward adjacency and the set of tasks that
+ * carry any order-bearing edge. Each ordering edge is oriented through the
+ * registry's declared precedence so inverse spellings agree, and self-loops
+ * (which the execution cycle analysis reports) never enter the adjacency.
+ */
+function collectOrderingParticipation(graph) {
+    const registry = graph.registry();
+    const forward = new Map();
+    const participants = new Set();
+    for (const edge of graph.edges()) {
+        const definition = registry.require(edge.kind);
+        if (!definition.ordering)
+            continue;
+        const { predecessor, successor } = orientOrderingEdge(edge, definition);
+        participants.add(predecessor);
+        participants.add(successor);
+        if (predecessor === successor)
+            continue;
+        const targets = forward.get(predecessor);
+        if (targets === undefined)
+            forward.set(predecessor, new Set([successor]));
+        else
+            targets.add(successor);
+    }
+    return { forward, participants };
+}
+/** Resolve a task's latest finish from its acyclic successors, or the makespan when it has none. */
+function latestFinishFor(successors, acyclic, latestStart, makespan) {
+    if (successors === undefined)
+        return makespan;
+    let bound = makespan;
+    for (const successor of successors) {
+        if (!acyclic.has(successor))
+            continue;
+        bound = Math.min(bound, latestStart.get(successor));
+    }
+    return bound;
+}
+/** Build one scheduled row from the forward earliest-start depth and backward latest-start. */
+function scheduleRow(id, earliestStart, latestStart) {
+    const slack = latestStart - earliestStart;
+    return {
+        id,
+        earliestStart,
+        earliestFinish: earliestStart + 1,
+        latestStart,
+        latestFinish: latestStart + 1,
+        slack,
+        critical: slack === 0,
+    };
+}
+/** Run the backward CPM pass over the acyclic participants in reverse topological order. */
+function computeScheduleRows(topoParticipants, participation, depth, acyclic, makespan) {
+    const latestStart = new Map();
+    for (let index = topoParticipants.length - 1; index >= 0; index -= 1) {
+        const id = topoParticipants[index];
+        const finish = latestFinishFor(participation.forward.get(id), acyclic, latestStart, makespan);
+        latestStart.set(id, finish - 1);
+    }
+    return topoParticipants
+        .map((id) => scheduleRow(id, depth[id], latestStart.get(id)))
+        .sort((left, right) => left.slack - right.slack ||
+        left.earliestStart - right.earliestStart ||
+        left.id.localeCompare(right.id));
+}
+/**
+ * Compute the deterministic critical-path schedule of the order-bearing
+ * subgraph. Earliest-start distances and the critical path come from the exact
+ * execution analysis; the backward pass then assigns each task the latest start
+ * that preserves the makespan and reports total float as `slack`. Zero-slack
+ * tasks are `critical`. Only tasks with a well-defined earliest start are
+ * scheduled: tasks with no order-bearing edge, tasks on a genuine ordering
+ * cycle, and tasks transitively gated by a cycle (excluded from Kahn's partial
+ * order) are all omitted from `rows`; genuine cycles are reported in `cycles`.
+ */
+export function analyzeRelationshipSchedule(graph, options = {}) {
+    options.signal?.throwIfAborted();
+    const execution = analyzeRelationshipExecution(graph, { registry: graph.registry() });
+    const participation = collectOrderingParticipation(graph);
+    const acyclic = new Set(execution.order);
+    const topoParticipants = execution.order.filter((id) => participation.participants.has(id));
+    const makespan = topoParticipants.reduce((peak, id) => Math.max(peak, execution.depth[id] + 1), 0);
+    const rows = computeScheduleRows(topoParticipants, participation, execution.depth, acyclic, makespan);
+    const scheduled = rows.length > 0;
+    return {
+        exact: true,
+        acyclic: execution.acyclic,
+        makespan,
+        scheduledCount: rows.length,
+        // A single-node execution "path" over a workspace with no order-bearing
+        // edge is not a real critical path, so report it only when work is scheduled.
+        criticalPath: scheduled ? execution.criticalPath : [],
+        criticalPathLength: scheduled ? execution.criticalPathLength : 0,
+        cycles: execution.cycles,
+        rows,
+        provenance: {
+            algorithm: "critical-path-method",
+            edgeFamily: "ordering",
+            weighting: "unit",
+        },
+    };
+}
+//# sourceMappingURL=scheduling.js.map
+//# debugId=b92fecb2-bbc5-5837-906c-bf5d32b2a4d6

package/dist/sdk/graph/scheduling.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduling.js","sources":["sdk/graph/scheduling.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/graph/scheduling\n *\n * Critical Path Method (CPM) scheduling over the order-bearing relationship\n * DAG. The forward pass — topological order, earliest-start distances, the\n * longest deterministic path, and genuine-cycle isolation — is reused from the\n * exact execution analysis; this module adds the backward pass that derives\n * each task's latest start, latest finish, and total float (slack), then\n * classifies zero-slack tasks as critical. Durations are unit-weighted so the\n * schedule is deterministic and metadata-independent: slack counts how many\n * whole prerequisite hops a task can drift without extending the makespan.\n * Only tasks with a well-defined earliest start are scheduled: nodes with no\n * order-bearing edge, genuine ordering cycles, and any task transitively gated\n * by a cycle (whose earliest start is undefined) are all omitted from `rows`.\n * Genuine ordering cycles are additionally reported in `cycles`.\n */\nimport {\n  analyzeRelationshipExecution,\n  type RelationshipExecutionAnalysis,\n} from \"../relationship-analytics.js\";\nimport { RelationshipGraph } from \"../relationships.js\";\nimport { orientOrderingEdge } from \"./traversal.js\";\n\n/** One scheduled task row with its earliest/latest window and total float. */\nexport interface RelationshipScheduleRow {\n  /** Scheduled task id. */\n  id: string;\n  /** Longest prerequisite distance from any source (earliest start). */\n  earliestStart: number;\n  /** Earliest start plus the unit task duration. */\n  earliestFinish: number;\n  /** Latest start that still preserves the makespan. */\n  latestStart: number;\n  /** Latest finish that still preserves the makespan. */\n  latestFinish: number;\n  /** Total float: latest start minus earliest start. */\n  slack: number;\n  /** Whether the task has zero slack and lies on a critical path. */\n  critical: boolean;\n}\n\n/** Bounded schedule-analysis controls. */\nexport interface GraphScheduleOptions {\n  /** Abort signal checked once at entry, before the forward pass. */\n  signal?: AbortSignal;\n}\n\n/** Deterministic critical-path schedule of the order-bearing subgraph. */\nexport interface RelationshipScheduleAnalysis {\n  /** Whether the result is exact rather than sampled or approximate. */\n  exact: true;\n  /** Whether the order-bearing graph is acyclic. */\n  acyclic: boolean;\n  /** Total makespan in unit task durations; zero when nothing is scheduled. */\n  makespan: number;\n  /** Number of tasks participating in the order-bearing DAG. */\n  scheduledCount: number;\n  /** Longest deterministic execution path — a canonical zero-slack chain. */\n  criticalPath: string[];\n  /** Edge count of the critical path. */\n  criticalPathLength: number;\n  /** Genuine ordering cycles, excluded from scheduling. */\n  cycles: string[][];\n  /** Scheduled rows sorted by ascending slack, then earliest start, then id. */\n  rows: RelationshipScheduleRow[];\n  /** Semantic provenance for the analysis. */\n  provenance: {\n    algorithm: \"critical-path-method\";\n    edgeFamily: \"ordering\";\n    weighting: \"unit\";\n  };\n}\n\n/** Forward order-bearing adjacency restricted to tasks that carry an ordering edge. */\ninterface OrderingParticipation {\n  /** Predecessor-to-successor adjacency in execution orientation. */\n  forward: Map<string, Set<string>>;\n  /** Ids that appear as an endpoint of at least one ordering edge. */\n  participants: Set<string>;\n}\n\n/**\n * Collect the execution-oriented forward adjacency and the set of tasks that\n * carry any order-bearing edge. Each ordering edge is oriented through the\n * registry's declared precedence so inverse spellings agree, and self-loops\n * (which the execution cycle analysis reports) never enter the adjacency.\n */\nfunction collectOrderingParticipation(\n  graph: RelationshipGraph,\n): OrderingParticipation {\n  const registry = graph.registry();\n  const forward = new Map<string, Set<string>>();\n  const participants = new Set<string>();\n  for (const edge of graph.edges()) {\n    const definition = registry.require(edge.kind);\n    if (!definition.ordering) continue;\n    const { predecessor, successor } = orientOrderingEdge(edge, definition);\n    participants.add(predecessor);\n    participants.add(successor);\n    if (predecessor === successor) continue;\n    const targets = forward.get(predecessor);\n    if (targets === undefined) forward.set(predecessor, new Set([successor]));\n    else targets.add(successor);\n  }\n  return { forward, participants };\n}\n\n/** Resolve a task's latest finish from its acyclic successors, or the makespan when it has none. */\nfunction latestFinishFor(\n  successors: Set<string> | undefined,\n  acyclic: Set<string>,\n  latestStart: Map<string, number>,\n  makespan: number,\n): number {\n  if (successors === undefined) return makespan;\n  let bound = makespan;\n  for (const successor of successors) {\n    if (!acyclic.has(successor)) continue;\n    bound = Math.min(bound, latestStart.get(successor)!);\n  }\n  return bound;\n}\n\n/** Build one scheduled row from the forward earliest-start depth and backward latest-start. */\nfunction scheduleRow(\n  id: string,\n  earliestStart: number,\n  latestStart: number,\n): RelationshipScheduleRow {\n  const slack = latestStart - earliestStart;\n  return {\n    id,\n    earliestStart,\n    earliestFinish: earliestStart + 1,\n    latestStart,\n    latestFinish: latestStart + 1,\n    slack,\n    critical: slack === 0,\n  };\n}\n\n/** Run the backward CPM pass over the acyclic participants in reverse topological order. */\nfunction computeScheduleRows(\n  topoParticipants: readonly string[],\n  participation: OrderingParticipation,\n  depth: Record<string, number>,\n  acyclic: Set<string>,\n  makespan: number,\n): RelationshipScheduleRow[] {\n  const latestStart = new Map<string, number>();\n  for (let index = topoParticipants.length - 1; index >= 0; index -= 1) {\n    const id = topoParticipants[index]!;\n    const finish = latestFinishFor(\n      participation.forward.get(id),\n      acyclic,\n      latestStart,\n      makespan,\n    );\n    latestStart.set(id, finish - 1);\n  }\n  return topoParticipants\n    .map((id) => scheduleRow(id, depth[id]!, latestStart.get(id)!))\n    .sort(\n      (left, right) =>\n        left.slack - right.slack ||\n        left.earliestStart - right.earliestStart ||\n        left.id.localeCompare(right.id),\n    );\n}\n\n/**\n * Compute the deterministic critical-path schedule of the order-bearing\n * subgraph. Earliest-start distances and the critical path come from the exact\n * execution analysis; the backward pass then assigns each task the latest start\n * that preserves the makespan and reports total float as `slack`. Zero-slack\n * tasks are `critical`. Only tasks with a well-defined earliest start are\n * scheduled: tasks with no order-bearing edge, tasks on a genuine ordering\n * cycle, and tasks transitively gated by a cycle (excluded from Kahn's partial\n * order) are all omitted from `rows`; genuine cycles are reported in `cycles`.\n */\nexport function analyzeRelationshipSchedule(\n  graph: RelationshipGraph,\n  options: GraphScheduleOptions = {},\n): RelationshipScheduleAnalysis {\n  options.signal?.throwIfAborted();\n  const execution: RelationshipExecutionAnalysis = analyzeRelationshipExecution(\n    graph,\n    { registry: graph.registry() },\n  );\n  const participation = collectOrderingParticipation(graph);\n  const acyclic = new Set(execution.order);\n  const topoParticipants = execution.order.filter((id) =>\n    participation.participants.has(id),\n  );\n  const makespan = topoParticipants.reduce(\n    (peak, id) => Math.max(peak, execution.depth[id]! + 1),\n    0,\n  );\n  const rows = computeScheduleRows(\n    topoParticipants,\n    participation,\n    execution.depth,\n    acyclic,\n    makespan,\n  );\n  const scheduled = rows.length > 0;\n  return {\n    exact: true,\n    acyclic: execution.acyclic,\n    makespan,\n    scheduledCount: rows.length,\n    // A single-node execution \"path\" over a workspace with no order-bearing\n    // edge is not a real critical path, so report it only when work is scheduled.\n    criticalPath: scheduled ? execution.criticalPath : [],\n    criticalPathLength: scheduled ? execution.criticalPathLength : 0,\n    cycles: execution.cycles,\n    rows,\n    provenance: {\n      algorithm: \"critical-path-method\",\n      edgeFamily: \"ordering\",\n      weighting: \"unit\",\n    },\n  };\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;;;AACH,OAAO,EACL,4BAA4B,GAE7B,MAAM,8BAA8B,CAAC;AAEtC,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AA4DpD;;;;;GAKG;AACH,SAAS,4BAA4B,CACnC,KAAwB;IAExB,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,UAAU,CAAC,QAAQ;YAAE,SAAS;QACnC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACxE,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC9B,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5B,IAAI,WAAW,KAAK,SAAS;YAAE,SAAS;QACxC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;;YACrE,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;AACnC,CAAC;AAED,oGAAoG;AACpG,SAAS,eAAe,CACtB,UAAmC,EACnC,OAAoB,EACpB,WAAgC,EAChC,QAAgB;IAEhB,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC;IAC9C,IAAI,KAAK,GAAG,QAAQ,CAAC;IACrB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,SAAS;QACtC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+FAA+F;AAC/F,SAAS,WAAW,CAClB,EAAU,EACV,aAAqB,EACrB,WAAmB;IAEnB,MAAM,KAAK,GAAG,WAAW,GAAG,aAAa,CAAC;IAC1C,OAAO;QACL,EAAE;QACF,aAAa;QACb,cAAc,EAAE,aAAa,GAAG,CAAC;QACjC,WAAW;QACX,YAAY,EAAE,WAAW,GAAG,CAAC;QAC7B,KAAK;QACL,QAAQ,EAAE,KAAK,KAAK,CAAC;KACtB,CAAC;AACJ,CAAC;AAED,4FAA4F;AAC5F,SAAS,mBAAmB,CAC1B,gBAAmC,EACnC,aAAoC,EACpC,KAA6B,EAC7B,OAAoB,EACpB,QAAgB;IAEhB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,IAAI,KAAK,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACrE,MAAM,EAAE,GAAG,gBAAgB,CAAC,KAAK,CAAE,CAAC;QACpC,MAAM,MAAM,GAAG,eAAe,CAC5B,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAC7B,OAAO,EACP,WAAW,EACX,QAAQ,CACT,CAAC;QACF,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,gBAAgB;SACpB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAE,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;SAC9D,IAAI,CACH,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK;QACxB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa;QACxC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,CAClC,CAAC;AACN,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAwB,EACxB,UAAgC,EAAE;IAElC,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;IACjC,MAAM,SAAS,GAAkC,4BAA4B,CAC3E,KAAK,EACL,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,EAAE,CAC/B,CAAC;IACF,MAAM,aAAa,GAAG,4BAA4B,CAAC,KAAK,CAAC,CAAC;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,gBAAgB,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CACrD,aAAa,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CACnC,CAAC;IACF,MAAM,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CACtC,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAE,GAAG,CAAC,CAAC,EACtD,CAAC,CACF,CAAC;IACF,MAAM,IAAI,GAAG,mBAAmB,CAC9B,gBAAgB,EAChB,aAAa,EACb,SAAS,CAAC,KAAK,EACf,OAAO,EACP,QAAQ,CACT,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClC,OAAO;QACL,KAAK,EAAE,IAAI;QACX,OAAO,EAAE,SAAS,CAAC,OAAO;QAC1B,QAAQ;QACR,cAAc,EAAE,IAAI,CAAC,MAAM;QAC3B,wEAAwE;QACxE,8EAA8E;QAC9E,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;QACrD,kBAAkB,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,IAAI;QACJ,UAAU,EAAE;YACV,SAAS,EAAE,sBAAsB;YACjC,UAAU,EAAE,UAAU;YACtB,SAAS,EAAE,MAAM;SAClB;KACF,CAAC;AACJ,CAAC","debugId":"b92fecb2-bbc5-5837-906c-bf5d32b2a4d6"}

package/dist/sdk/graph/traversal.d.ts

@@ -43,6 +43,17 @@ export interface GraphPathOptions extends RelationshipQueryOptions {
 export declare function hierarchyParentEndpoint(edge: RelationshipEdge, definition: RelationshipKindDefinition): string;
 /** Endpoint of an ordering edge that must finish first. */
 export declare function orderingPredecessorEndpoint(edge: RelationshipEdge, definition: RelationshipKindDefinition): string;
+/**
+ * Orient one ordering edge into its execution direction — the predecessor that
+ * must finish first and the successor it gates — honoring the kind's declared
+ * precedence so inverse spellings (`blocked_by`/`blocks`) agree. This is the
+ * single ordering-orientation primitive shared by scheduling and degree
+ * analytics.
+ */
+export declare function orientOrderingEdge(edge: RelationshipEdge, definition: RelationshipKindDefinition): {
+    predecessor: string;
+    successor: string;
+};
 /**
  * Return the bounded transitive hierarchy ancestors of one node in
  * breadth-first discovery order, honoring each hierarchy kind's declared

package/dist/sdk/graph/traversal.js

@@ -1,6 +1,6 @@
 /** Default number of paths returned by bounded path enumeration. */
 
-!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]="ed9f0831-6011-5ee2-abd6-72375eac0a3a")}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]="8b7a0e24-8ead-5b79-a83b-6d2bb32f807f")}catch(e){}}();
 const DEFAULT_MAX_PATHS = 5;
 /** Default expansion-safety bound for bounded path enumeration. */
 const DEFAULT_MAX_VISITED_PATHS = 10_000;
@@ -28,6 +28,20 @@ export function orderingPredecessorEndpoint(edge, definition) {
         ? edge.target
         : edge.source;
 }
+/**
+ * Orient one ordering edge into its execution direction — the predecessor that
+ * must finish first and the successor it gates — honoring the kind's declared
+ * precedence so inverse spellings (`blocked_by`/`blocks`) agree. This is the
+ * single ordering-orientation primitive shared by scheduling and degree
+ * analytics.
+ */
+export function orientOrderingEdge(edge, definition) {
+    const predecessor = orderingPredecessorEndpoint(edge, definition);
+    return {
+        predecessor,
+        successor: predecessor === edge.source ? edge.target : edge.source,
+    };
+}
 /** Validate optional kind filters against one semantic edge family. */
 function resolveFamilyKinds(graph, kinds, family) {
     if (kinds === undefined)
@@ -259,4 +273,4 @@ export function enumerateRelationshipPaths(graph, source, target, options = {})
     return enumerateNonZeroRelationshipPaths(graph, source, target, options, maxPaths, maxVisitedPaths, maxDepth, direction);
 }
 //# sourceMappingURL=traversal.js.map
-//# debugId=ed9f0831-6011-5ee2-abd6-72375eac0a3a
+//# debugId=8b7a0e24-8ead-5b79-a83b-6d2bb32f807f