@unbrained/pm-cli 2026.7.14 → 2026.7.15

package/dist/sdk/profile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"profile.js","sources":["sdk/profile.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/profile\n *\n * Implements the `pm profile` command surface: listing the built-in project\n * archetypes, showing a profile's full composition, and applying a profile to an\n * initialized tracker. Apply stages item types, custom statuses, custom fields,\n * per-type workflows, config knobs, and create templates idempotently, and\n * surfaces advisory package recommendations. The pure diff lives in\n * {@link module:core/profile/profile-plan}; this module is the I/O orchestration\n * and human formatting around it.\n */\nimport path from \"node:path\";\nimport {\n  pathExists,\n  readFileIfExists,\n  writeFileAtomic,\n} from \"../core/fs/fs-utils.js\";\nimport { acquireLock } from \"../core/lock/lock.js\";\nimport { EXIT_CODE } from \"../core/shared/constants.js\";\nimport { PmCliError } from \"../core/shared/errors.js\";\nimport { resolveAuthor } from \"../core/shared/author.js\";\nimport { nowIso } from \"../core/shared/time.js\";\nimport type { GlobalOptions } from \"../core/shared/command-types.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../core/store/paths.js\";\nimport {\n  readSettings,\n  resolveGovernanceKnobs,\n  writeSettings,\n} from \"../core/store/settings.js\";\nimport {\n  DEFAULT_RUNTIME_SCHEMA_FILE_PATHS,\n  filePathForSchemaSection,\n  normalizeRuntimeSchemaSettings,\n} from \"../core/schema/runtime-schema.js\";\nimport {\n  normalizeAddTypeInput,\n  serializeItemTypesFile,\n} from \"../core/schema/item-types-file.js\";\nimport { serializeStatusDefsFile } from \"../core/schema/status-defs-file.js\";\nimport { serializeFieldsFile } from \"../core/schema/fields-file.js\";\nimport {\n  resolveNestedSettingDescriptor,\n  writeNestedSettingValue,\n} from \"../core/config/nested-settings.js\";\nimport {\n  getActiveExtensionRegistrations,\n  runActiveOnWriteHooks,\n} from \"../core/extensions/index.js\";\nimport {\n  resolveProfileCatalog,\n  resolveProfileEntry,\n  type ExtensionProfileContribution,\n  type ProfileSourceKind,\n  type ProfileTemplateOptions,\n  type ProjectProfileDefinition,\n  type ResolveProfileEntryResult,\n} from \"../core/profile/profile-presets.js\";\nimport {\n  describeProfileComposition,\n  describeProjectProfile,\n  type ProjectProfileComposition,\n} from \"../core/profile/profile-describe.js\";\nimport {\n  lintProjectProfile,\n  type ProjectProfileLintFinding,\n} from \"../core/profile/profile-lint.js\";\nimport {\n  planProfileApplication,\n  type ProfileApplicationPlan,\n  type ProfileChangeStatus,\n  type ProfileCurrentState,\n} from \"../core/profile/profile-plan.js\";\nimport { ensureTypeFolderScaffold } from \"./schema.js\";\nimport { runTemplatesSave } from \"./templates.js\";\n\n/** Ordered `pm profile` subcommands. */\nexport const PROFILE_SUBCOMMANDS = [\"list\", \"show\", \"apply\", \"lint\"] as const;\n/** Restricts profile subcommand values accepted by command, SDK, and storage contracts. */\nexport type ProfileSubcommand = (typeof PROFILE_SUBCOMMANDS)[number];\n\nconst PROFILE_TYPES_LOCK_ID = \"schema-types\";\nconst PROFILE_STATUSES_LOCK_ID = \"schema-statuses\";\nconst PROFILE_FIELDS_LOCK_ID = \"schema-fields\";\n\n/**\n * Per-dimension counts summarizing how much a profile stages. Aliases the shared\n * {@link ProjectProfileComposition} so the CLI result shape and the core describe\n * primitive never drift.\n */\nexport type ProfileComposition = ProjectProfileComposition;\n\n/** A single profile entry in the `pm profile list` payload. */\nexport interface ProfileListEntry {\n  /** Profile name. */\n  name: string;\n  /** Display title. */\n  title: string;\n  /** One-line archetype summary. */\n  summary: string;\n  /** Whether the profile is core-baked or contributed by an active extension. */\n  source: ProfileSourceKind;\n  /** Owning package/extension name for an extension profile; omitted for builtins. */\n  package?: string;\n  /** Per-dimension counts. */\n  composition: ProfileComposition;\n}\n\n/** Result of `pm profile list`. */\nexport interface ProfileListResult {\n  /** Discriminant for the profile result union. */\n  action: \"list\";\n  /** Built-in profiles in canonical order followed by active extension profiles. */\n  profiles: ProfileListEntry[];\n  /** Non-fatal merge warnings (built-in shadowing attempts, duplicate names). */\n  warnings: string[];\n  /** ISO timestamp the result was produced. */\n  generated_at: string;\n}\n\n/** Result of `pm profile show <name>`. */\nexport interface ProfileShowResult {\n  /** Discriminant for the profile result union. */\n  action: \"show\";\n  /** Profile name. */\n  name: string;\n  /** Display title. */\n  title: string;\n  /** One-line archetype summary. */\n  summary: string;\n  /** Whether the profile is core-baked or contributed by an active extension. */\n  source: ProfileSourceKind;\n  /** Owning package/extension name for an extension profile; omitted for builtins. */\n  package?: string;\n  /** Per-dimension counts. */\n  composition: ProfileComposition;\n  /** Item type names the profile registers. */\n  types: string[];\n  /** Custom status ids. */\n  statuses: string[];\n  /** Custom field keys. */\n  fields: string[];\n  /** Item types governed by a staged workflow. */\n  workflows: string[];\n  /** Config knobs as `key=value` pairs. */\n  config: string[];\n  /** Template names the profile stages. */\n  templates: string[];\n  /** Recommended package specs with rationale. */\n  packages: Array<{ spec: string; reason: string }>;\n  /** Non-fatal merge warnings (built-in shadowing attempts, duplicate names). */\n  warnings: string[];\n  /** ISO timestamp the result was produced. */\n  generated_at: string;\n}\n\n/** Per-dimension change summary in an apply result. */\nexport interface ProfileApplyDimension {\n  /** Entry keys that were newly created. */\n  added: string[];\n  /** Entry keys whose stored value was overwritten. */\n  updated: string[];\n  /** Entry keys already current (no write). */\n  unchanged: string[];\n}\n\n/** Result of `pm profile apply <name>`. */\nexport interface ProfileApplyResult {\n  /** Discriminant for the profile result union. */\n  action: \"apply\";\n  /** Applied profile name. */\n  name: string;\n  /** Display title. */\n  title: string;\n  /** True when changes were persisted; false for `--dry-run` or a no-op. */\n  applied: boolean;\n  /** True when `--dry-run` previewed without writing. */\n  dry_run: boolean;\n  /** True when at least one dimension stages an add/update. */\n  changed: boolean;\n  /** Item-type change summary. */\n  types: ProfileApplyDimension;\n  /** Status change summary. */\n  statuses: ProfileApplyDimension;\n  /** Field change summary. */\n  fields: ProfileApplyDimension;\n  /** Workflow change summary. */\n  workflows: ProfileApplyDimension;\n  /** Config-knob change summary. */\n  config: ProfileApplyDimension;\n  /** Template change summary. */\n  templates: ProfileApplyDimension;\n  /** Advisory package recommendations with install status. */\n  packages: Array<{\n    spec: string;\n    reason: string;\n    status: \"installed\" | \"recommended\";\n  }>;\n  /** Deduped on-write hook + advisory warnings. */\n  warnings: string[];\n  /** ISO timestamp the result was produced. */\n  generated_at: string;\n}\n\n/** Result of `pm profile lint [name]`. */\nexport interface ProfileLintResult {\n  /** Discriminant for the profile result union. */\n  action: \"lint\";\n  /** Linted profile name. */\n  name: string;\n  /** Display title. */\n  title: string;\n  /** Whether the profile is core-baked or contributed by an active extension. */\n  source: ProfileSourceKind;\n  /** Owning package/extension name for an extension profile; omitted for builtins. */\n  package?: string;\n  /** True when the profile produced no error-severity findings. */\n  ok: boolean;\n  /** Count of error-severity findings. */\n  error_count: number;\n  /** Count of warning-severity findings. */\n  warning_count: number;\n  /** Every graded consistency finding in dimension order. */\n  findings: ProjectProfileLintFinding[];\n  /** Non-fatal catalog merge warnings (built-in shadowing attempts, duplicate names). */\n  warnings: string[];\n  /** ISO timestamp the result was produced. */\n  generated_at: string;\n}\n\n/** Discriminated union of every `pm profile` result shape. */\nexport type ProfileResult =\n  | ProfileListResult\n  | ProfileShowResult\n  | ProfileApplyResult\n  | ProfileLintResult;\n\n/* c8 ignore start -- profile command I/O orchestration and formatting is covered by profile integration workflows; the idempotent diff is unit-tested in core/profile/profile-plan. */\n\n/** Collects the profiles contributed by active extensions, mapping the live registration registry onto the resolver's contribution shape. Returns an empty list when extensions are disabled or none registered a profile. */\nfunction collectExtensionProfileContributions(): ExtensionProfileContribution[] {\n  const registrations = getActiveExtensionRegistrations();\n  if (registrations === null) {\n    return [];\n  }\n  return registrations.profiles.map((entry) => ({\n    name: entry.name,\n    profile: entry.profile,\n  }));\n}\n\n/** Lists every available profile — the built-in archetypes followed by profiles contributed by active extensions — with per-dimension composition counts and the source each came from. Surfaces any non-fatal merge collisions as warnings. */\nexport function runProfileList(): ProfileListResult {\n  const { profiles, warnings } = resolveProfileCatalog(\n    collectExtensionProfileContributions(),\n  );\n  return {\n    action: \"list\",\n    profiles: profiles.map((resolved) => ({\n      name: resolved.definition.name,\n      title: resolved.definition.title,\n      summary: resolved.definition.summary,\n      source: resolved.source,\n      ...(resolved.package !== undefined ? { package: resolved.package } : {}),\n      composition: describeProfileComposition(resolved.definition),\n    })),\n    warnings,\n    generated_at: nowIso(),\n  };\n}\n\n/** Shows the full composition of a single profile, resolved across built-in and extension-contributed archetypes. Throws a USAGE error for a missing or unknown profile name. */\nexport function runProfileShow(name: string | undefined): ProfileShowResult {\n  let entry: ResolveProfileEntryResult;\n  try {\n    entry = resolveProfileEntry(name, collectExtensionProfileContributions());\n  } catch (error) {\n    throw new PmCliError(\n      error instanceof Error ? error.message : String(error),\n      EXIT_CODE.USAGE,\n    );\n  }\n  const { resolved } = entry;\n  return {\n    action: \"show\",\n    ...describeProjectProfile(resolved.definition),\n    source: resolved.source,\n    ...(resolved.package !== undefined ? { package: resolved.package } : {}),\n    warnings: entry.warnings,\n    generated_at: nowIso(),\n  };\n}\n\n/** Lints a single profile, resolved across built-in and extension-contributed archetypes, returning every graded consistency finding plus any catalog merge warnings. Throws a USAGE error for a missing or unknown profile name. This is the read-only author-time validation surface; it never writes to the tracker. */\nexport function runProfileLint(name: string | undefined): ProfileLintResult {\n  let entry: ResolveProfileEntryResult;\n  try {\n    entry = resolveProfileEntry(name, collectExtensionProfileContributions());\n  } catch (error) {\n    throw new PmCliError(\n      error instanceof Error ? error.message : String(error),\n      EXIT_CODE.USAGE,\n    );\n  }\n  const { resolved } = entry;\n  const report = lintProjectProfile(resolved.definition);\n  return {\n    action: \"lint\",\n    name: resolved.definition.name,\n    title: resolved.definition.title,\n    source: resolved.source,\n    ...(resolved.package !== undefined ? { package: resolved.package } : {}),\n    ok: report.ok,\n    error_count: report.errorCount,\n    warning_count: report.warningCount,\n    findings: report.findings,\n    warnings: entry.warnings,\n    generated_at: nowIso(),\n  };\n}\n\n/** Options accepted by {@link runProfileApply}. */\nexport interface ProfileApplyCommandOptions {\n  /** Preview the diff without writing any files. */\n  dryRun?: boolean;\n  /** Mutation author override. */\n  author?: string;\n  /** Force ownership/lock override. */\n  force?: boolean;\n}\n\nfunction templateFilePath(pmRoot: string, name: string): string {\n  return path.join(pmRoot, \"templates\", `${name}.json`);\n}\n\nasync function readStoredTemplateOptions(\n  pmRoot: string,\n  name: string,\n): Promise<ProfileTemplateOptions | undefined> {\n  const raw = await readFileIfExists(templateFilePath(pmRoot, name));\n  if (raw === null) {\n    return undefined;\n  }\n  try {\n    const parsed = JSON.parse(raw) as unknown;\n    if (\n      parsed !== null &&\n      typeof parsed === \"object\" &&\n      !Array.isArray(parsed)\n    ) {\n      const options = (parsed as { options?: unknown }).options;\n      if (\n        options !== null &&\n        typeof options === \"object\" &&\n        !Array.isArray(options)\n      ) {\n        return options as ProfileTemplateOptions;\n      }\n    }\n  } catch {\n    // A malformed template file is treated as absent so apply re-stages it.\n  }\n  return undefined;\n}\n\nasync function loadProfileCurrentState(\n  pmRoot: string,\n  schema: ReturnType<typeof normalizeRuntimeSchemaSettings>,\n  settings: Awaited<ReturnType<typeof readSettings>>,\n  profile: ProjectProfileDefinition,\n): Promise<ProfileCurrentState> {\n  const templates = new Map<string, ProfileTemplateOptions>();\n  for (const template of profile.templates) {\n    const stored = await readStoredTemplateOptions(pmRoot, template.name);\n    if (stored !== undefined) {\n      templates.set(template.name, stored);\n    }\n  }\n  return {\n    typesRaw: await readFileIfExists(\n      filePathForSchemaSection(\n        pmRoot,\n        schema.files.types,\n        DEFAULT_RUNTIME_SCHEMA_FILE_PATHS.types,\n      ),\n    ),\n    statusesRaw: await readFileIfExists(\n      filePathForSchemaSection(\n        pmRoot,\n        schema.files.statuses,\n        DEFAULT_RUNTIME_SCHEMA_FILE_PATHS.statuses,\n      ),\n    ),\n    fieldsRaw: await readFileIfExists(\n      filePathForSchemaSection(\n        pmRoot,\n        schema.files.fields,\n        DEFAULT_RUNTIME_SCHEMA_FILE_PATHS.fields,\n      ),\n    ),\n    workflows: settings.schema.type_workflows ?? [],\n    settings,\n    templates,\n    // Package recommendations are advisory: apply never installs and never\n    // inspects install state, so every recommendation surfaces as \"recommended\".\n    // The planner still supports an install-state set for SDK consumers that want\n    // richer reporting.\n    installedPackages: new Set<string>(),\n  };\n}\n\nfunction dimensionFrom(\n  changes: ReadonlyArray<{ key: string; status: ProfileChangeStatus }>,\n): ProfileApplyDimension {\n  const added: string[] = [];\n  const updated: string[] = [];\n  const unchanged: string[] = [];\n  for (const change of changes) {\n    (change.status === \"add\"\n      ? added\n      : change.status === \"update\"\n        ? updated\n        : unchanged\n    ).push(change.key);\n  }\n  return { added, updated, unchanged };\n}\n\nfunction buildApplyResult(\n  profile: ProjectProfileDefinition,\n  plan: ProfileApplicationPlan,\n  applied: boolean,\n  dryRun: boolean,\n  warnings: string[],\n): ProfileApplyResult {\n  return {\n    action: \"apply\",\n    name: profile.name,\n    title: profile.title,\n    applied,\n    dry_run: dryRun,\n    changed: plan.changed,\n    types: dimensionFrom(plan.types.changes),\n    statuses: dimensionFrom(plan.statuses.changes),\n    fields: dimensionFrom(plan.fields.changes),\n    workflows: dimensionFrom(\n      plan.workflows.changes.map((change) => ({\n        key: change.type,\n        status: change.status,\n      })),\n    ),\n    config: dimensionFrom(plan.config.changes),\n    templates: dimensionFrom(\n      plan.templates.changes.map((change) => ({\n        key: change.name,\n        status: change.status,\n      })),\n    ),\n    packages: plan.packages,\n    warnings: [...new Set(warnings)].sort((left, right) =>\n      left.localeCompare(right),\n    ),\n    generated_at: nowIso(),\n  };\n}\n\nasync function assertProfileTrackerInitialized(pmRoot: string): Promise<void> {\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}\n\nfunction resolveProfileForCommand(name: string | undefined): {\n  profile: ProjectProfileDefinition;\n  warnings: string[];\n} {\n  try {\n    const entry = resolveProfileEntry(\n      name,\n      collectExtensionProfileContributions(),\n    );\n    return {\n      profile: entry.resolved.definition,\n      warnings: entry.warnings,\n    };\n  } catch (error) {\n    throw new PmCliError(\n      error instanceof Error ? error.message : String(error),\n      EXIT_CODE.USAGE,\n    );\n  }\n}\n\n/** Applies a profile to the initialized tracker, or previews the idempotent diff when `dryRun` is set. Schema files are written under their respective locks; config and workflows are persisted to settings; templates are staged via the shared template writer. Re-applying an already-applied profile performs zero writes. Throws a USAGE error for an unknown profile or an invalid config knob, and a NOT_FOUND error when the tracker is not initialized. */\nexport async function runProfileApply(\n  name: string | undefined,\n  options: ProfileApplyCommandOptions,\n  global: GlobalOptions,\n): Promise<ProfileApplyResult> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  await assertProfileTrackerInitialized(pmRoot);\n\n  // Catalog-level merge warnings (e.g. an extension profile shadowed by a\n  // built-in) seed the result so `apply` surfaces them the same way `list`\n  // does, rather than silently swallowing them.\n  const resolvedProfile = resolveProfileForCommand(name);\n  const profile = resolvedProfile.profile;\n  const mergeWarnings = resolvedProfile.warnings;\n\n  const dryRun = options.dryRun === true;\n  const settings = await readSettings(pmRoot);\n  const schema = normalizeRuntimeSchemaSettings(settings.schema);\n\n  if (dryRun) {\n    const state = await loadProfileCurrentState(\n      pmRoot,\n      schema,\n      settings,\n      profile,\n    );\n    const plan = planProfile(profile, state);\n    return buildApplyResult(profile, plan, false, true, [...mergeWarnings]);\n  }\n\n  const author = resolveAuthor(options.author, settings.author_default);\n  const governance = resolveGovernanceKnobs(settings);\n  const force = Boolean(options.force);\n  const warnings: string[] = [...mergeWarnings];\n\n  // Acquire all three schema locks inside the try so a later acquisition that\n  // throws (held/stale lock without --force) still releases the earlier ones in\n  // finally rather than stranding them until TTL expiry.\n  const releasers: Array<() => Promise<void>> = [];\n  const acquire = async (lockId: string): Promise<void> => {\n    releasers.push(\n      await acquireLock(\n        pmRoot,\n        lockId,\n        settings.locks.ttl_seconds,\n        author,\n        force,\n        governance.force_required_for_stale_lock,\n        settings.locks.wait_ms,\n      ),\n    );\n  };\n  let plan: ProfileApplicationPlan;\n  try {\n    await acquire(PROFILE_TYPES_LOCK_ID);\n    await acquire(PROFILE_STATUSES_LOCK_ID);\n    await acquire(PROFILE_FIELDS_LOCK_ID);\n    const state = await loadProfileCurrentState(\n      pmRoot,\n      schema,\n      settings,\n      profile,\n    );\n    plan = planProfile(profile, state);\n\n    if (plan.types.changed) {\n      const typesPath = filePathForSchemaSection(\n        pmRoot,\n        schema.files.types,\n        DEFAULT_RUNTIME_SCHEMA_FILE_PATHS.types,\n      );\n      await writeFileAtomic(typesPath, serializeItemTypesFile(plan.types.file));\n      const stagedNames = new Set(\n        profile.types.map((type) => normalizeAddTypeInput(type).name),\n      );\n      const stagedDefinitions = plan.types.file.definitions.filter(\n        (definition) => stagedNames.has(definition.name),\n      );\n      await ensureTypeFolderScaffold(\n        pmRoot,\n        stagedDefinitions,\n        warnings,\n        \"profile:apply-type-folder\",\n      );\n      warnings.push(\n        ...(await runActiveOnWriteHooks({\n          path: typesPath,\n          scope: \"project\",\n          op: \"profile:apply-types\",\n        })),\n      );\n    }\n    if (plan.statuses.changed) {\n      const statusesPath = filePathForSchemaSection(\n        pmRoot,\n        schema.files.statuses,\n        DEFAULT_RUNTIME_SCHEMA_FILE_PATHS.statuses,\n      );\n      await writeFileAtomic(\n        statusesPath,\n        serializeStatusDefsFile(plan.statuses.file),\n      );\n      warnings.push(\n        ...(await runActiveOnWriteHooks({\n          path: statusesPath,\n          scope: \"project\",\n          op: \"profile:apply-statuses\",\n        })),\n      );\n    }\n    if (plan.fields.changed) {\n      const fieldsPath = filePathForSchemaSection(\n        pmRoot,\n        schema.files.fields,\n        DEFAULT_RUNTIME_SCHEMA_FILE_PATHS.fields,\n      );\n      await writeFileAtomic(fieldsPath, serializeFieldsFile(plan.fields.file));\n      warnings.push(\n        ...(await runActiveOnWriteHooks({\n          path: fieldsPath,\n          scope: \"project\",\n          op: \"profile:apply-fields\",\n        })),\n      );\n    }\n    if (plan.config.changed || plan.workflows.changed) {\n      for (const change of plan.config.changes) {\n        if (change.status === \"unchanged\") {\n          continue;\n        }\n        const descriptor = resolveNestedSettingDescriptor(change.key);\n        if (descriptor !== undefined) {\n          writeNestedSettingValue(\n            settings as unknown as Record<string, unknown>,\n            descriptor,\n            change.value,\n          );\n        }\n      }\n      settings.schema.type_workflows = plan.workflows.result;\n      await writeSettings(pmRoot, settings, \"profile:apply-config\");\n    }\n    for (const change of plan.templates.changes) {\n      if (change.status === \"unchanged\") {\n        continue;\n      }\n      await runTemplatesSave(change.name, { ...change.options }, global);\n    }\n  } finally {\n    // Release in reverse acquisition order; only locks actually acquired are\n    // present. Each release is best-effort so one rejecting release never strands\n    // the remaining locks (a failed release falls back to TTL expiry).\n    for (const release of releasers.reverse()) {\n      try {\n        await release();\n      } catch {\n        // Ignore: a failed lock release is non-fatal and self-heals at TTL.\n      }\n    }\n  }\n\n  return buildApplyResult(profile, plan, plan.changed, false, warnings);\n}\n\n// planProfileApplication can throw a plain Error for an invalid config knob; map\n// it to a USAGE exit code consistently across the dry-run and apply paths.\nfunction planProfile(\n  profile: ProjectProfileDefinition,\n  state: ProfileCurrentState,\n): ProfileApplicationPlan {\n  try {\n    return planProfileApplication(profile, state);\n  } catch (error) {\n    throw new PmCliError(\n      error instanceof Error ? error.message : String(error),\n      EXIT_CODE.USAGE,\n    );\n  }\n}\n\nfunction formatDimensionLine(\n  label: string,\n  dimension: ProfileApplyDimension,\n): string | undefined {\n  const segments: string[] = [];\n  if (dimension.added.length > 0) {\n    segments.push(`+${dimension.added.join(\", \")}`);\n  }\n  if (dimension.updated.length > 0) {\n    segments.push(`~${dimension.updated.join(\", \")}`);\n  }\n  if (segments.length === 0) {\n    return undefined;\n  }\n  return `  ${label}: ${segments.join(\"  \")}`;\n}\n\n/** Renders the `pm profile list` result as human-readable text. */\nexport function formatProfileListHuman(result: ProfileListResult): string {\n  const lines = [\"Project profiles:\"];\n  for (const profile of result.profiles) {\n    const origin =\n      profile.source === \"extension\"\n        ? ` [${profile.package ?? \"extension\"}]`\n        : \"\";\n    lines.push(\n      `  ${profile.name} — ${profile.title}: ${profile.summary}${origin}`,\n    );\n  }\n  for (const warning of result.warnings) {\n    lines.push(`  warning: ${warning}`);\n  }\n  return lines.join(\"\\n\");\n}\n\n/** Renders the `pm profile show` result as human-readable text. */\nexport function formatProfileShowHuman(result: ProfileShowResult): string {\n  const origin =\n    result.source === \"extension\" ? ` [${result.package ?? \"extension\"}]` : \"\";\n  const lines = [\n    `${result.name} — ${result.title}${origin}`,\n    result.summary,\n    \"\",\n  ];\n  lines.push(`types: ${result.types.join(\", \") || \"(none)\"}`);\n  lines.push(`statuses: ${result.statuses.join(\", \") || \"(none)\"}`);\n  lines.push(`fields: ${result.fields.join(\", \") || \"(none)\"}`);\n  lines.push(`workflows: ${result.workflows.join(\", \") || \"(none)\"}`);\n  lines.push(`config: ${result.config.join(\", \") || \"(none)\"}`);\n  lines.push(`templates: ${result.templates.join(\", \") || \"(none)\"}`);\n  lines.push(\n    `packages: ${result.packages.map((pkg) => pkg.spec).join(\", \") || \"(none)\"}`,\n  );\n  for (const warning of result.warnings) {\n    lines.push(`warning: ${warning}`);\n  }\n  return lines.join(\"\\n\");\n}\n\n/** Renders the `pm profile lint` result as human-readable text: a one-line verdict followed by each finding prefixed with its severity, code, and dimension. */\nexport function formatProfileLintHuman(result: ProfileLintResult): string {\n  const origin =\n    result.source === \"extension\" ? ` [${result.package ?? \"extension\"}]` : \"\";\n  // Catalog merge warnings are rendered below alongside lint-finding warnings, so\n  // fold them into the headline count to avoid an \"ok (0 warnings)\" verdict that\n  // is immediately followed by `warning:` lines.\n  const totalWarningCount = result.warning_count + result.warnings.length;\n  const verdict = result.ok\n    ? `Profile ${result.name}${origin}: ok (${totalWarningCount} warning${totalWarningCount === 1 ? \"\" : \"s\"})`\n    : `Profile ${result.name}${origin}: ${result.error_count} error${result.error_count === 1 ? \"\" : \"s\"}, ${totalWarningCount} warning${totalWarningCount === 1 ? \"\" : \"s\"}`;\n  const lines = [verdict];\n  for (const finding of result.findings) {\n    const target = finding.target !== undefined ? ` (${finding.target})` : \"\";\n    lines.push(\n      `  ${finding.severity} [${finding.code}] ${finding.dimension}${target}: ${finding.message}`,\n    );\n  }\n  for (const warning of result.warnings) {\n    lines.push(`  warning: ${warning}`);\n  }\n  return lines.join(\"\\n\");\n}\n\n/** Renders the `pm profile apply` result as human-readable text, including the staged diff and any package recommendations. */\nexport function formatProfileApplyHuman(result: ProfileApplyResult): string {\n  const mode = result.dry_run\n    ? \"dry-run\"\n    : result.applied\n      ? \"applied\"\n      : \"no changes\";\n  const lines = [`Profile ${result.name} (${mode})`];\n  if (!result.changed) {\n    lines.push(\"  already up to date\");\n  } else {\n    for (const [label, dimension] of [\n      [\"types\", result.types],\n      [\"statuses\", result.statuses],\n      [\"fields\", result.fields],\n      [\"workflows\", result.workflows],\n      [\"config\", result.config],\n      [\"templates\", result.templates],\n    ] as const) {\n      const line = formatDimensionLine(label, dimension);\n      if (line !== undefined) {\n        lines.push(line);\n      }\n    }\n  }\n  const recommended = result.packages.filter(\n    (pkg) => pkg.status === \"recommended\",\n  );\n  if (recommended.length > 0) {\n    lines.push(\n      `  recommended packages: ${recommended.map((pkg) => pkg.spec).join(\", \")}`,\n    );\n  }\n  for (const warning of result.warnings) {\n    lines.push(`  warning: ${warning}`);\n  }\n  return lines.join(\"\\n\");\n}\n\n/* c8 ignore stop */\n"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;;;AACH,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EACL,UAAU,EACV,gBAAgB,EAChB,eAAe,GAChB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,OAAO,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAEhD,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACxE,OAAO,EACL,YAAY,EACZ,sBAAsB,EACtB,aAAa,GACd,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,iCAAiC,EACjC,wBAAwB,EACxB,8BAA8B,GAC/B,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EACL,qBAAqB,EACrB,sBAAsB,GACvB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAE,uBAAuB,EAAE,MAAM,oCAAoC,CAAC;AAC7E,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EACL,8BAA8B,EAC9B,uBAAuB,GACxB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EACL,+BAA+B,EAC/B,qBAAqB,GACtB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EACL,qBAAqB,EACrB,mBAAmB,GAMpB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EACL,0BAA0B,EAC1B,sBAAsB,GAEvB,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EACL,kBAAkB,GAEnB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EACL,sBAAsB,GAIvB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAElD,wCAAwC;AACxC,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAU,CAAC;AAI9E,MAAM,qBAAqB,GAAG,cAAc,CAAC;AAC7C,MAAM,wBAAwB,GAAG,iBAAiB,CAAC;AACnD,MAAM,sBAAsB,GAAG,eAAe,CAAC;AA0J/C,uLAAuL;AAEvL,8NAA8N;AAC9N,SAAS,oCAAoC;IAC3C,MAAM,aAAa,GAAG,+BAA+B,EAAE,CAAC;IACxD,IAAI,aAAa,KAAK,IAAI,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC5C,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,OAAO,EAAE,KAAK,CAAC,OAAO;KACvB,CAAC,CAAC,CAAC;AACN,CAAC;AAED,gPAAgP;AAChP,MAAM,UAAU,cAAc;IAC5B,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,qBAAqB,CAClD,oCAAoC,EAAE,CACvC,CAAC;IACF,OAAO;QACL,MAAM,EAAE,MAAM;QACd,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YACpC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,IAAI;YAC9B,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,KAAK;YAChC,OAAO,EAAE,QAAQ,CAAC,UAAU,CAAC,OAAO;YACpC,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,GAAG,CAAC,QAAQ,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxE,WAAW,EAAE,0BAA0B,CAAC,QAAQ,CAAC,UAAU,CAAC;SAC7D,CAAC,CAAC;QACH,QAAQ;QACR,YAAY,EAAE,MAAM,EAAE;KACvB,CAAC;AACJ,CAAC;AAED,iLAAiL;AACjL,MAAM,UAAU,cAAc,CAAC,IAAwB;IACrD,IAAI,KAAgC,CAAC;IACrC,IAAI,CAAC;QACH,KAAK,GAAG,mBAAmB,CAAC,IAAI,EAAE,oCAAoC,EAAE,CAAC,CAAC;IAC5E,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,UAAU,CAClB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EACtD,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC3B,OAAO;QACL,MAAM,EAAE,MAAM;QACd,GAAG,sBAAsB,CAAC,QAAQ,CAAC,UAAU,CAAC;QAC9C,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,GAAG,CAAC,QAAQ,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxE,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,YAAY,EAAE,MAAM,EAAE;KACvB,CAAC;AACJ,CAAC;AAED,2TAA2T;AAC3T,MAAM,UAAU,cAAc,CAAC,IAAwB;IACrD,IAAI,KAAgC,CAAC;IACrC,IAAI,CAAC;QACH,KAAK,GAAG,mBAAmB,CAAC,IAAI,EAAE,oCAAoC,EAAE,CAAC,CAAC;IAC5E,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,UAAU,CAClB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EACtD,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC3B,MAAM,MAAM,GAAG,kBAAkB,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IACvD,OAAO;QACL,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,IAAI;QAC9B,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,KAAK;QAChC,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,GAAG,CAAC,QAAQ,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxE,EAAE,EAAE,MAAM,CAAC,EAAE;QACb,WAAW,EAAE,MAAM,CAAC,UAAU;QAC9B,aAAa,EAAE,MAAM,CAAC,YAAY;QAClC,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,YAAY,EAAE,MAAM,EAAE;KACvB,CAAC;AACJ,CAAC;AAYD,SAAS,gBAAgB,CAAC,MAAc,EAAE,IAAY;IACpD,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,IAAI,OAAO,CAAC,CAAC;AACxD,CAAC;AAED,KAAK,UAAU,yBAAyB,CACtC,MAAc,EACd,IAAY;IAEZ,MAAM,GAAG,GAAG,MAAM,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;IACnE,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QACjB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAY,CAAC;QAC1C,IACE,MAAM,KAAK,IAAI;YACf,OAAO,MAAM,KAAK,QAAQ;YAC1B,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EACtB,CAAC;YACD,MAAM,OAAO,GAAI,MAAgC,CAAC,OAAO,CAAC;YAC1D,IACE,OAAO,KAAK,IAAI;gBAChB,OAAO,OAAO,KAAK,QAAQ;gBAC3B,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EACvB,CAAC;gBACD,OAAO,OAAiC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,wEAAwE;IAC1E,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,KAAK,UAAU,uBAAuB,CACpC,MAAc,EACd,MAAyD,EACzD,QAAkD,EAClD,OAAiC;IAEjC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;IAC5D,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,MAAM,yBAAyB,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO;QACL,QAAQ,EAAE,MAAM,gBAAgB,CAC9B,wBAAwB,CACtB,MAAM,EACN,MAAM,CAAC,KAAK,CAAC,KAAK,EAClB,iCAAiC,CAAC,KAAK,CACxC,CACF;QACD,WAAW,EAAE,MAAM,gBAAgB,CACjC,wBAAwB,CACtB,MAAM,EACN,MAAM,CAAC,KAAK,CAAC,QAAQ,EACrB,iCAAiC,CAAC,QAAQ,CAC3C,CACF;QACD,SAAS,EAAE,MAAM,gBAAgB,CAC/B,wBAAwB,CACtB,MAAM,EACN,MAAM,CAAC,KAAK,CAAC,MAAM,EACnB,iCAAiC,CAAC,MAAM,CACzC,CACF;QACD,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,cAAc,IAAI,EAAE;QAC/C,QAAQ;QACR,SAAS;QACT,uEAAuE;QACvE,6EAA6E;QAC7E,8EAA8E;QAC9E,oBAAoB;QACpB,iBAAiB,EAAE,IAAI,GAAG,EAAU;KACrC,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CACpB,OAAoE;IAEpE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,CAAC,MAAM,CAAC,MAAM,KAAK,KAAK;YACtB,CAAC,CAAC,KAAK;YACP,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,QAAQ;gBAC1B,CAAC,CAAC,OAAO;gBACT,CAAC,CAAC,SAAS,CACd,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AACvC,CAAC;AAED,SAAS,gBAAgB,CACvB,OAAiC,EACjC,IAA4B,EAC5B,OAAgB,EAChB,MAAe,EACf,QAAkB;IAElB,OAAO;QACL,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,OAAO,CAAC,IAAI;QAClB,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,OAAO;QACP,OAAO,EAAE,MAAM;QACf,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;QACxC,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;QAC9C,MAAM,EAAE,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;QAC1C,SAAS,EAAE,aAAa,CACtB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACtC,GAAG,EAAE,MAAM,CAAC,IAAI;YAChB,MAAM,EAAE,MAAM,CAAC,MAAM;SACtB,CAAC,CAAC,CACJ;QACD,MAAM,EAAE,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;QAC1C,SAAS,EAAE,aAAa,CACtB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACtC,GAAG,EAAE,MAAM,CAAC,IAAI;YAChB,MAAM,EAAE,MAAM,CAAC,MAAM;SACtB,CAAC,CAAC,CACJ;QACD,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACpD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAC1B;QACD,YAAY,EAAE,MAAM,EAAE;KACvB,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,+BAA+B,CAAC,MAAc;IAC3D,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;AACH,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAwB;IAIxD,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,mBAAmB,CAC/B,IAAI,EACJ,oCAAoC,EAAE,CACvC,CAAC;QACF,OAAO;YACL,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,UAAU;YAClC,QAAQ,EAAE,KAAK,CAAC,QAAQ;SACzB,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,UAAU,CAClB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EACtD,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;AACH,CAAC;AAED,qcAAqc;AACrc,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,IAAwB,EACxB,OAAmC,EACnC,MAAqB;IAErB,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACzD,MAAM,+BAA+B,CAAC,MAAM,CAAC,CAAC;IAE9C,wEAAwE;IACxE,yEAAyE;IACzE,8CAA8C;IAC9C,MAAM,eAAe,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;IACvD,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC;IACxC,MAAM,aAAa,GAAG,eAAe,CAAC,QAAQ,CAAC;IAE/C,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC;IACvC,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,8BAA8B,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAE/D,IAAI,MAAM,EAAE,CAAC;QACX,MAAM,KAAK,GAAG,MAAM,uBAAuB,CACzC,MAAM,EACN,MAAM,EACN,QAAQ,EACR,OAAO,CACR,CAAC;QACF,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACzC,OAAO,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,cAAc,CAAC,CAAC;IACtE,MAAM,UAAU,GAAG,sBAAsB,CAAC,QAAQ,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAa,CAAC,GAAG,aAAa,CAAC,CAAC;IAE9C,4EAA4E;IAC5E,8EAA8E;IAC9E,uDAAuD;IACvD,MAAM,SAAS,GAA+B,EAAE,CAAC;IACjD,MAAM,OAAO,GAAG,KAAK,EAAE,MAAc,EAAiB,EAAE;QACtD,SAAS,CAAC,IAAI,CACZ,MAAM,WAAW,CACf,MAAM,EACN,MAAM,EACN,QAAQ,CAAC,KAAK,CAAC,WAAW,EAC1B,MAAM,EACN,KAAK,EACL,UAAU,CAAC,6BAA6B,EACxC,QAAQ,CAAC,KAAK,CAAC,OAAO,CACvB,CACF,CAAC;IACJ,CAAC,CAAC;IACF,IAAI,IAA4B,CAAC;IACjC,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,qBAAqB,CAAC,CAAC;QACrC,MAAM,OAAO,CAAC,wBAAwB,CAAC,CAAC;QACxC,MAAM,OAAO,CAAC,sBAAsB,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,MAAM,uBAAuB,CACzC,MAAM,EACN,MAAM,EACN,QAAQ,EACR,OAAO,CACR,CAAC;QACF,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEnC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,wBAAwB,CACxC,MAAM,EACN,MAAM,CAAC,KAAK,CAAC,KAAK,EAClB,iCAAiC,CAAC,KAAK,CACxC,CAAC;YACF,MAAM,eAAe,CAAC,SAAS,EAAE,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1E,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAC9D,CAAC;YACF,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAC1D,CAAC,UAAU,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CACjD,CAAC;YACF,MAAM,wBAAwB,CAC5B,MAAM,EACN,iBAAiB,EACjB,QAAQ,EACR,2BAA2B,CAC5B,CAAC;YACF,QAAQ,CAAC,IAAI,CACX,GAAG,CAAC,MAAM,qBAAqB,CAAC;gBAC9B,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,SAAS;gBAChB,EAAE,EAAE,qBAAqB;aAC1B,CAAC,CAAC,CACJ,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;YAC1B,MAAM,YAAY,GAAG,wBAAwB,CAC3C,MAAM,EACN,MAAM,CAAC,KAAK,CAAC,QAAQ,EACrB,iCAAiC,CAAC,QAAQ,CAC3C,CAAC;YACF,MAAM,eAAe,CACnB,YAAY,EACZ,uBAAuB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAC5C,CAAC;YACF,QAAQ,CAAC,IAAI,CACX,GAAG,CAAC,MAAM,qBAAqB,CAAC;gBAC9B,IAAI,EAAE,YAAY;gBAClB,KAAK,EAAE,SAAS;gBAChB,EAAE,EAAE,wBAAwB;aAC7B,CAAC,CAAC,CACJ,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACxB,MAAM,UAAU,GAAG,wBAAwB,CACzC,MAAM,EACN,MAAM,CAAC,KAAK,CAAC,MAAM,EACnB,iCAAiC,CAAC,MAAM,CACzC,CAAC;YACF,MAAM,eAAe,CAAC,UAAU,EAAE,mBAAmB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACzE,QAAQ,CAAC,IAAI,CACX,GAAG,CAAC,MAAM,qBAAqB,CAAC;gBAC9B,IAAI,EAAE,UAAU;gBAChB,KAAK,EAAE,SAAS;gBAChB,EAAE,EAAE,sBAAsB;aAC3B,CAAC,CAAC,CACJ,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YAClD,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACzC,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBAClC,SAAS;gBACX,CAAC;gBACD,MAAM,UAAU,GAAG,8BAA8B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAC9D,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;oBAC7B,uBAAuB,CACrB,QAA8C,EAC9C,UAAU,EACV,MAAM,CAAC,KAAK,CACb,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,MAAM,CAAC,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;YACvD,MAAM,aAAa,CAAC,MAAM,EAAE,QAAQ,EAAE,sBAAsB,CAAC,CAAC;QAChE,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YAC5C,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBAClC,SAAS;YACX,CAAC;YACD,MAAM,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,MAAM,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;YAAS,CAAC;QACT,yEAAyE;QACzE,8EAA8E;QAC9E,mEAAmE;QACnE,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC;gBACH,MAAM,OAAO,EAAE,CAAC;YAClB,CAAC;YAAC,MAAM,CAAC;gBACP,oEAAoE;YACtE,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;AACxE,CAAC;AAED,iFAAiF;AACjF,2EAA2E;AAC3E,SAAS,WAAW,CAClB,OAAiC,EACjC,KAA0B;IAE1B,IAAI,CAAC;QACH,OAAO,sBAAsB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,UAAU,CAClB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EACtD,SAAS,CAAC,KAAK,CAChB,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,KAAa,EACb,SAAgC;IAEhC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,QAAQ,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClD,CAAC;IACD,IAAI,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACjC,QAAQ,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAC9C,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,sBAAsB,CAAC,MAAyB;IAC9D,MAAM,KAAK,GAAG,CAAC,mBAAmB,CAAC,CAAC;IACpC,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,MAAM,MAAM,GACV,OAAO,CAAC,MAAM,KAAK,WAAW;YAC5B,CAAC,CAAC,KAAK,OAAO,CAAC,OAAO,IAAI,WAAW,GAAG;YACxC,CAAC,CAAC,EAAE,CAAC;QACT,KAAK,CAAC,IAAI,CACR,KAAK,OAAO,CAAC,IAAI,MAAM,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,OAAO,GAAG,MAAM,EAAE,CACpE,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,cAAc,OAAO,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,sBAAsB,CAAC,MAAyB;IAC9D,MAAM,MAAM,GACV,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,OAAO,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7E,MAAM,KAAK,GAAG;QACZ,GAAG,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC,KAAK,GAAG,MAAM,EAAE;QAC3C,MAAM,CAAC,OAAO;QACd,EAAE;KACH,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,UAAU,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;IAC5D,KAAK,CAAC,IAAI,CAAC,aAAa,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;IAClE,KAAK,CAAC,IAAI,CAAC,WAAW,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;IAC9D,KAAK,CAAC,IAAI,CAAC,cAAc,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;IACpE,KAAK,CAAC,IAAI,CAAC,WAAW,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;IAC9D,KAAK,CAAC,IAAI,CAAC,cAAc,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;IACpE,KAAK,CAAC,IAAI,CACR,aAAa,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,CAC7E,CAAC;IACF,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,YAAY,OAAO,EAAE,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,gKAAgK;AAChK,MAAM,UAAU,sBAAsB,CAAC,MAAyB;IAC9D,MAAM,MAAM,GACV,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,OAAO,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7E,gFAAgF;IAChF,+EAA+E;IAC/E,+CAA+C;IAC/C,MAAM,iBAAiB,GAAG,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;IACxE,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE;QACvB,CAAC,CAAC,WAAW,MAAM,CAAC,IAAI,GAAG,MAAM,SAAS,iBAAiB,WAAW,iBAAiB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG;QAC3G,CAAC,CAAC,WAAW,MAAM,CAAC,IAAI,GAAG,MAAM,KAAK,MAAM,CAAC,WAAW,SAAS,MAAM,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,iBAAiB,WAAW,iBAAiB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IAC5K,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;IACxB,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,KAAK,CAAC,IAAI,CACR,KAAK,OAAO,CAAC,QAAQ,KAAK,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,SAAS,GAAG,MAAM,KAAK,OAAO,CAAC,OAAO,EAAE,CAC5F,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,cAAc,OAAO,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,+HAA+H;AAC/H,MAAM,UAAU,uBAAuB,CAAC,MAA0B;IAChE,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO;QACzB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,MAAM,CAAC,OAAO;YACd,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,YAAY,CAAC;IACnB,MAAM,KAAK,GAAG,CAAC,WAAW,MAAM,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC;IACnD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IACrC,CAAC;SAAM,CAAC;QACN,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI;YAC/B,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC;YACvB,CAAC,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC;YAC7B,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC;YACzB,CAAC,WAAW,EAAE,MAAM,CAAC,SAAS,CAAC;YAC/B,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC;YACzB,CAAC,WAAW,EAAE,MAAM,CAAC,SAAS,CAAC;SACvB,EAAE,CAAC;YACX,MAAM,IAAI,GAAG,mBAAmB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CACxC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,KAAK,aAAa,CACtC,CAAC;IACF,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CACR,2BAA2B,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC3E,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,cAAc,OAAO,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,oBAAoB","debugId":"5ec91a0b-d2fa-5ce8-af93-ce6e6db6c12b"}

package/dist/sdk/relationship-analytics.d.ts

@@ -0,0 +1,108 @@
+/**
+ * @module sdk/relationship-analytics
+ *
+ * Provides exact, deterministic graph analytics with explicit semantics and
+ * provenance suitable for planning, impact analysis, and context selection.
+ */
+import type { RelationshipSnapshot } from "./relationship-history.js";
+import { RelationshipGraph, RelationshipKindRegistry, type RelationshipEdge, type RelationshipQueryOptions } from "./relationships.js";
+/** Exact execution-graph analysis over registered ordering kinds. */
+export interface RelationshipExecutionAnalysis {
+    /** Whether the result is exact rather than sampled or approximate. */
+    exact: true;
+    /** Whether the order-bearing graph is acyclic. */
+    acyclic: boolean;
+    /** Deterministic topological order for acyclic nodes. */
+    order: string[];
+    /** Parallelizable topological layers. */
+    layers: string[][];
+    /** Nodes with no prerequisites. */
+    frontier: string[];
+    /** Longest prerequisite distance for each acyclic node. */
+    depth: Record<string, number>;
+    /** Longest deterministic execution path. */
+    criticalPath: string[];
+    /** Edge count of the critical path. */
+    criticalPathLength: number;
+    /** Strongly connected order-bearing components that represent cycles. */
+    cycles: string[][];
+    /** Semantic provenance for the analysis. */
+    provenance: {
+        algorithm: "kahn-longest-path";
+        edgeFamily: "ordering";
+    };
+}
+/** One affected node with its exact shortest explanation path. */
+export interface RelationshipImpactRow {
+    /** Affected node identifier. */
+    id: string;
+    /** Shortest relationship distance from the root. */
+    distance: number;
+    /** Exact path explaining why the node is affected. */
+    path: string[];
+}
+/** Bounded reverse- or forward-impact result. */
+export interface RelationshipImpactAnalysis {
+    /** Impact origin. */
+    root: string;
+    /** Deterministic affected-node rows. */
+    affected: RelationshipImpactRow[];
+    /** Returned rows are exact even when the bounded result is incomplete. */
+    exact: true;
+    /** Whether configured traversal bounds omitted reachable work. */
+    truncated: boolean;
+    /** Query work retained for performance and explainability. */
+    cost: {
+        visitedNodes: number;
+        inspectedEdges: number;
+    };
+}
+/** Exact structural summary of the complete graph snapshot. */
+export interface RelationshipKnowledgeAnalysis {
+    /** Weakly connected components, largest then lexicographic. */
+    components: string[][];
+    /** Strongly connected components over directed stored edges. */
+    stronglyConnected: string[][];
+    /** Nodes with no relationship edges. */
+    orphans: string[];
+    /** Maximum-degree nodes and their unique-neighbor degree. */
+    hubs: {
+        id: string;
+        degree: number;
+    }[];
+    /** Whether the result is exact. */
+    exact: true;
+    /** Semantic provenance for the analysis. */
+    provenance: {
+        algorithm: "component-degree";
+        edgeFamily: "all";
+    };
+}
+/** Edge-level delta between two immutable snapshots. */
+export interface RelationshipSnapshotComparison {
+    /** Earlier snapshot version. */
+    fromVersion: number;
+    /** Later snapshot version. */
+    toVersion: number;
+    /** Edges introduced in the later snapshot. */
+    added: RelationshipEdge[];
+    /** Edges absent from the later snapshot. */
+    removed: RelationshipEdge[];
+    /** Number of byte-equivalent edges retained. */
+    unchangedCount: number;
+    /** Whether the comparison is exact. */
+    exact: true;
+}
+/** Registry override for custom domain semantics. */
+export interface RelationshipAnalyticsOptions {
+    /** Registry used to interpret ordering direction and custom kinds. */
+    registry?: RelationshipKindRegistry;
+}
+/** Analyze registered order-bearing relationships without treating associative cycles as blockers. */
+export declare function analyzeRelationshipExecution(graph: RelationshipGraph, options?: RelationshipAnalyticsOptions): RelationshipExecutionAnalysis;
+/** Compute bounded impact rows and exact shortest explanation paths. */
+export declare function analyzeGraphImpact(graph: RelationshipGraph, root: string, options?: RelationshipQueryOptions): RelationshipImpactAnalysis;
+/** Analyze weak/strong components, isolates, and exact unique-neighbor hubs. */
+export declare function analyzeKnowledgeGraph(graph: RelationshipGraph): RelationshipKnowledgeAnalysis;
+/** Compare two immutable relationship snapshots by full normalized edge value. */
+export declare function compareRelationshipSnapshots(before: RelationshipSnapshot, after: RelationshipSnapshot): RelationshipSnapshotComparison;

package/dist/sdk/relationship-analytics.js

@@ -0,0 +1,292 @@
+
+!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]="0a54b889-6d5c-565c-85ff-47e5cce68a32")}catch(e){}}();
+import { createRelationshipKindRegistry, } from "./relationships.js";
+function appendNeighbor(adjacency, source, target) {
+    adjacency.get(source).add(target);
+}
+function createAdjacency(nodes) {
+    return new Map(nodes.map((node) => [node, new Set()]));
+}
+function sortComponents(components) {
+    for (const component of components)
+        component.sort();
+    return components.sort((left, right) => right.length - left.length || left[0].localeCompare(right[0]));
+}
+function stableJsonValue(value) {
+    if (Array.isArray(value))
+        return value.map((entry) => stableJsonValue(entry));
+    if (value === null || typeof value !== "object")
+        return value;
+    const toJSON = value.toJSON;
+    if (typeof toJSON === "function")
+        return stableJsonValue(toJSON.call(value));
+    return Object.fromEntries(Object.entries(value)
+        .sort(([left], [right]) => left.localeCompare(right))
+        .map(([key, entry]) => [key, stableJsonValue(entry)]));
+}
+function relationshipEdgeKey(edge) {
+    return JSON.stringify(stableJsonValue(edge));
+}
+function appendFinishingOrder(start, adjacency, visited, order) {
+    const stack = [{ id: start, expanded: false }];
+    while (stack.length > 0) {
+        const current = stack.pop();
+        if (current.expanded) {
+            order.push(current.id);
+            continue;
+        }
+        if (visited.has(current.id))
+            continue;
+        visited.add(current.id);
+        stack.push({ id: current.id, expanded: true });
+        const neighbors = [...adjacency.get(current.id)].sort().reverse();
+        for (const neighbor of neighbors)
+            if (!visited.has(neighbor))
+                stack.push({ id: neighbor, expanded: false });
+    }
+}
+function computeFinishingOrder(nodes, adjacency) {
+    const visited = new Set();
+    const order = [];
+    for (const start of nodes)
+        if (!visited.has(start))
+            appendFinishingOrder(start, adjacency, visited, order);
+    return order;
+}
+function collectReverseComponents(order, reverse) {
+    const visited = new Set();
+    const components = [];
+    for (const start of [...order].reverse()) {
+        if (visited.has(start))
+            continue;
+        const component = [];
+        const stack = [start];
+        visited.add(start);
+        while (stack.length > 0) {
+            const current = stack.pop();
+            component.push(current);
+            for (const neighbor of reverse.get(current)) {
+                if (visited.has(neighbor))
+                    continue;
+                visited.add(neighbor);
+                stack.push(neighbor);
+            }
+        }
+        components.push(component);
+    }
+    return sortComponents(components);
+}
+function stronglyConnectedComponents(nodes, adjacency) {
+    const reverse = createAdjacency(nodes);
+    for (const [source, targets] of adjacency)
+        for (const target of targets)
+            appendNeighbor(reverse, target, source);
+    return collectReverseComponents(computeFinishingOrder(nodes, adjacency), reverse);
+}
+function buildExecutionAdjacency(graph, registry) {
+    const adjacency = createAdjacency(graph.nodes());
+    for (const edge of graph.edges()) {
+        const definition = registry.require(edge.kind);
+        if (!definition.ordering)
+            continue;
+        // Legacy and JSON-parsed definitions may predate explicit precedence.
+        const sourceFirst = (definition.precedence ?? "source_before_target") ===
+            "source_before_target";
+        appendNeighbor(adjacency, sourceFirst ? edge.source : edge.target, sourceFirst ? edge.target : edge.source);
+    }
+    return adjacency;
+}
+function topologicalLayers(nodes, adjacency) {
+    const indegree = new Map(nodes.map((node) => [node, 0]));
+    for (const targets of adjacency.values())
+        for (const target of targets)
+            indegree.set(target, indegree.get(target) + 1);
+    let frontier = nodes.filter((node) => indegree.get(node) === 0).sort();
+    const layers = [];
+    while (frontier.length > 0) {
+        layers.push(frontier);
+        const next = [];
+        for (const source of frontier) {
+            for (const target of adjacency.get(source)) {
+                const remaining = indegree.get(target) - 1;
+                indegree.set(target, remaining);
+                if (remaining === 0)
+                    next.push(target);
+            }
+        }
+        frontier = next.sort();
+    }
+    return layers;
+}
+function longestPath(order, adjacency) {
+    const depth = new Map(order.map((node) => [node, 0]));
+    const parent = new Map();
+    for (const source of order) {
+        for (const target of adjacency.get(source)) {
+            if (!depth.has(target))
+                continue;
+            const candidate = depth.get(source) + 1;
+            const currentParent = parent.get(target);
+            if (candidate > depth.get(target) ||
+                (candidate === depth.get(target) &&
+                    (currentParent === undefined ||
+                        source.localeCompare(currentParent) < 0))) {
+                depth.set(target, candidate);
+                parent.set(target, source);
+            }
+        }
+    }
+    const end = [...order].sort((left, right) => depth.get(right) - depth.get(left) || left.localeCompare(right))[0];
+    const path = end === undefined ? [] : [end];
+    while (path[0] !== undefined && parent.has(path[0]))
+        path.unshift(parent.get(path[0]));
+    return { depth: Object.fromEntries(depth), path };
+}
+function reconstructImpactPath(root, target, parents) {
+    const path = [target];
+    let cursor = target;
+    while (cursor !== root) {
+        cursor = parents.get(cursor);
+        path.push(cursor);
+    }
+    return path.reverse();
+}
+/** Analyze registered order-bearing relationships without treating associative cycles as blockers. */
+export function analyzeRelationshipExecution(graph, options = {}) {
+    const registry = options.registry ?? createRelationshipKindRegistry();
+    const nodes = [...graph.nodes()];
+    const adjacency = buildExecutionAdjacency(graph, registry);
+    const layers = topologicalLayers(nodes, adjacency);
+    const order = layers.flat();
+    const acyclic = order.length === nodes.length;
+    const cycles = acyclic
+        ? []
+        : stronglyConnectedComponents(nodes, adjacency).filter((component) => component.length > 1 ||
+            adjacency.get(component[0]).has(component[0]));
+    const longest = longestPath(order, adjacency);
+    return {
+        exact: true,
+        acyclic,
+        order,
+        layers,
+        frontier: layers[0] ?? [],
+        depth: longest.depth,
+        criticalPath: longest.path,
+        criticalPathLength: Math.max(0, longest.path.length - 1),
+        cycles,
+        provenance: { algorithm: "kahn-longest-path", edgeFamily: "ordering" },
+    };
+}
+/** Compute bounded impact rows and exact shortest explanation paths. */
+export function analyzeGraphImpact(graph, root, options = {}) {
+    const direction = options.direction ?? "outgoing";
+    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
+    const limit = options.limit ?? Number.POSITIVE_INFINITY;
+    const queue = [{ id: root, depth: 0 }];
+    const seen = new Set([root]);
+    const parents = new Map();
+    const affected = [];
+    let visitedNodes = 0;
+    let inspectedEdges = 0;
+    let truncated = false;
+    traversal: for (let index = 0; index < queue.length; index += 1) {
+        options.signal?.throwIfAborted();
+        const current = queue[index];
+        visitedNodes += 1;
+        const adjacent = graph.adjacency(current.id, {
+            direction,
+            kinds: options.kinds,
+            signal: options.signal,
+        });
+        inspectedEdges += adjacent.meta.inspectedEdges;
+        if (current.depth >= maxDepth) {
+            if (adjacent.value.some((id) => !seen.has(id)))
+                truncated = true;
+            continue;
+        }
+        for (const id of adjacent.value) {
+            if (seen.has(id))
+                continue;
+            if (affected.length >= limit) {
+                truncated = true;
+                break traversal;
+            }
+            seen.add(id);
+            parents.set(id, current.id);
+            const depth = current.depth + 1;
+            affected.push({
+                id,
+                distance: depth,
+                path: reconstructImpactPath(root, id, parents),
+            });
+            queue.push({ id, depth });
+        }
+    }
+    return {
+        root,
+        affected,
+        exact: true,
+        truncated,
+        cost: { visitedNodes, inspectedEdges },
+    };
+}
+/** Analyze weak/strong components, isolates, and exact unique-neighbor hubs. */
+export function analyzeKnowledgeGraph(graph) {
+    const nodes = [...graph.nodes()];
+    const weak = createAdjacency(nodes);
+    const directed = createAdjacency(nodes);
+    for (const edge of graph.edges()) {
+        appendNeighbor(weak, edge.source, edge.target);
+        appendNeighbor(weak, edge.target, edge.source);
+        appendNeighbor(directed, edge.source, edge.target);
+    }
+    const components = [];
+    const visited = new Set();
+    for (const start of nodes) {
+        if (visited.has(start))
+            continue;
+        const component = [];
+        const stack = [start];
+        visited.add(start);
+        while (stack.length > 0) {
+            const current = stack.pop();
+            component.push(current);
+            for (const neighbor of weak.get(current)) {
+                if (visited.has(neighbor))
+                    continue;
+                visited.add(neighbor);
+                stack.push(neighbor);
+            }
+        }
+        components.push(component);
+    }
+    const degrees = nodes.map((id) => ({ id, degree: weak.get(id).size }));
+    const maximum = Math.max(0, ...degrees.map(({ degree }) => degree));
+    return {
+        components: sortComponents(components),
+        stronglyConnected: stronglyConnectedComponents(nodes, directed),
+        orphans: degrees.filter(({ degree }) => degree === 0).map(({ id }) => id),
+        hubs: degrees.filter(({ degree }) => degree > 0 && degree === maximum),
+        exact: true,
+        provenance: { algorithm: "component-degree", edgeFamily: "all" },
+    };
+}
+/** Compare two immutable relationship snapshots by full normalized edge value. */
+export function compareRelationshipSnapshots(before, after) {
+    const earlier = new Map(before.edges.map((edge) => [relationshipEdgeKey(edge), edge]));
+    const later = new Map(after.edges.map((edge) => [relationshipEdgeKey(edge), edge]));
+    return {
+        fromVersion: before.version,
+        toVersion: after.version,
+        added: [...later]
+            .filter(([key]) => !earlier.has(key))
+            .map(([, edge]) => edge),
+        removed: [...earlier]
+            .filter(([key]) => !later.has(key))
+            .map(([, edge]) => edge),
+        unchangedCount: [...earlier.keys()].filter((key) => later.has(key)).length,
+        exact: true,
+    };
+}
+//# sourceMappingURL=relationship-analytics.js.map
+//# debugId=0a54b889-6d5c-565c-85ff-47e5cce68a32

package/dist/sdk/relationship-analytics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationship-analytics.js","sources":["sdk/relationship-analytics.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/relationship-analytics\n *\n * Provides exact, deterministic graph analytics with explicit semantics and\n * provenance suitable for planning, impact analysis, and context selection.\n */\nimport type { RelationshipSnapshot } from \"./relationship-history.js\";\nimport {\n  RelationshipGraph,\n  RelationshipKindRegistry,\n  createRelationshipKindRegistry,\n  type RelationshipEdge,\n  type RelationshipQueryOptions,\n} from \"./relationships.js\";\n\n/** Exact execution-graph analysis over registered ordering kinds. */\nexport interface RelationshipExecutionAnalysis {\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  /** Deterministic topological order for acyclic nodes. */\n  order: string[];\n  /** Parallelizable topological layers. */\n  layers: string[][];\n  /** Nodes with no prerequisites. */\n  frontier: string[];\n  /** Longest prerequisite distance for each acyclic node. */\n  depth: Record<string, number>;\n  /** Longest deterministic execution path. */\n  criticalPath: string[];\n  /** Edge count of the critical path. */\n  criticalPathLength: number;\n  /** Strongly connected order-bearing components that represent cycles. */\n  cycles: string[][];\n  /** Semantic provenance for the analysis. */\n  provenance: { algorithm: \"kahn-longest-path\"; edgeFamily: \"ordering\" };\n}\n\n/** One affected node with its exact shortest explanation path. */\nexport interface RelationshipImpactRow {\n  /** Affected node identifier. */\n  id: string;\n  /** Shortest relationship distance from the root. */\n  distance: number;\n  /** Exact path explaining why the node is affected. */\n  path: string[];\n}\n\n/** Bounded reverse- or forward-impact result. */\nexport interface RelationshipImpactAnalysis {\n  /** Impact origin. */\n  root: string;\n  /** Deterministic affected-node rows. */\n  affected: RelationshipImpactRow[];\n  /** Returned rows are exact even when the bounded result is incomplete. */\n  exact: true;\n  /** Whether configured traversal bounds omitted reachable work. */\n  truncated: boolean;\n  /** Query work retained for performance and explainability. */\n  cost: { visitedNodes: number; inspectedEdges: number };\n}\n\n/** Exact structural summary of the complete graph snapshot. */\nexport interface RelationshipKnowledgeAnalysis {\n  /** Weakly connected components, largest then lexicographic. */\n  components: string[][];\n  /** Strongly connected components over directed stored edges. */\n  stronglyConnected: string[][];\n  /** Nodes with no relationship edges. */\n  orphans: string[];\n  /** Maximum-degree nodes and their unique-neighbor degree. */\n  hubs: { id: string; degree: number }[];\n  /** Whether the result is exact. */\n  exact: true;\n  /** Semantic provenance for the analysis. */\n  provenance: { algorithm: \"component-degree\"; edgeFamily: \"all\" };\n}\n\n/** Edge-level delta between two immutable snapshots. */\nexport interface RelationshipSnapshotComparison {\n  /** Earlier snapshot version. */\n  fromVersion: number;\n  /** Later snapshot version. */\n  toVersion: number;\n  /** Edges introduced in the later snapshot. */\n  added: RelationshipEdge[];\n  /** Edges absent from the later snapshot. */\n  removed: RelationshipEdge[];\n  /** Number of byte-equivalent edges retained. */\n  unchangedCount: number;\n  /** Whether the comparison is exact. */\n  exact: true;\n}\n\n/** Registry override for custom domain semantics. */\nexport interface RelationshipAnalyticsOptions {\n  /** Registry used to interpret ordering direction and custom kinds. */\n  registry?: RelationshipKindRegistry;\n}\n\nfunction appendNeighbor(\n  adjacency: Map<string, Set<string>>,\n  source: string,\n  target: string,\n): void {\n  adjacency.get(source)!.add(target);\n}\n\nfunction createAdjacency(nodes: readonly string[]): Map<string, Set<string>> {\n  return new Map(nodes.map((node) => [node, new Set<string>()]));\n}\n\nfunction sortComponents(components: string[][]): string[][] {\n  for (const component of components) component.sort();\n  return components.sort(\n    (left, right) =>\n      right.length - left.length || left[0]!.localeCompare(right[0]!),\n  );\n}\n\nfunction stableJsonValue(value: unknown): unknown {\n  if (Array.isArray(value)) return value.map((entry) => stableJsonValue(entry));\n  if (value === null || typeof value !== \"object\") return value;\n  const toJSON = (value as { toJSON?: (this: object) => unknown }).toJSON;\n  if (typeof toJSON === \"function\") return stableJsonValue(toJSON.call(value));\n  return Object.fromEntries(\n    Object.entries(value)\n      .sort(([left], [right]) => left.localeCompare(right))\n      .map(([key, entry]) => [key, stableJsonValue(entry)]),\n  );\n}\n\nfunction relationshipEdgeKey(edge: RelationshipEdge): string {\n  return JSON.stringify(stableJsonValue(edge));\n}\n\nfunction appendFinishingOrder(\n  start: string,\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n  visited: Set<string>,\n  order: string[],\n): void {\n  const stack = [{ id: start, expanded: false }];\n  while (stack.length > 0) {\n    const current = stack.pop()!;\n    if (current.expanded) {\n      order.push(current.id);\n      continue;\n    }\n    if (visited.has(current.id)) continue;\n    visited.add(current.id);\n    stack.push({ id: current.id, expanded: true });\n    const neighbors = [...adjacency.get(current.id)!].sort().reverse();\n    for (const neighbor of neighbors)\n      if (!visited.has(neighbor)) stack.push({ id: neighbor, expanded: false });\n  }\n}\n\nfunction computeFinishingOrder(\n  nodes: readonly string[],\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n): string[] {\n  const visited = new Set<string>();\n  const order: string[] = [];\n  for (const start of nodes)\n    if (!visited.has(start))\n      appendFinishingOrder(start, adjacency, visited, order);\n  return order;\n}\n\nfunction collectReverseComponents(\n  order: readonly string[],\n  reverse: ReadonlyMap<string, ReadonlySet<string>>,\n): string[][] {\n  const visited = new Set<string>();\n  const components: string[][] = [];\n  for (const start of [...order].reverse()) {\n    if (visited.has(start)) continue;\n    const component: string[] = [];\n    const stack = [start];\n    visited.add(start);\n    while (stack.length > 0) {\n      const current = stack.pop()!;\n      component.push(current);\n      for (const neighbor of reverse.get(current)!) {\n        if (visited.has(neighbor)) continue;\n        visited.add(neighbor);\n        stack.push(neighbor);\n      }\n    }\n    components.push(component);\n  }\n  return sortComponents(components);\n}\n\nfunction stronglyConnectedComponents(\n  nodes: readonly string[],\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n): string[][] {\n  const reverse = createAdjacency(nodes);\n  for (const [source, targets] of adjacency)\n    for (const target of targets) appendNeighbor(reverse, target, source);\n  return collectReverseComponents(\n    computeFinishingOrder(nodes, adjacency),\n    reverse,\n  );\n}\n\nfunction buildExecutionAdjacency(\n  graph: RelationshipGraph,\n  registry: RelationshipKindRegistry,\n): Map<string, Set<string>> {\n  const adjacency = createAdjacency(graph.nodes());\n  for (const edge of graph.edges()) {\n    const definition = registry.require(edge.kind);\n    if (!definition.ordering) continue;\n    // Legacy and JSON-parsed definitions may predate explicit precedence.\n    const sourceFirst =\n      (definition.precedence ?? \"source_before_target\") ===\n      \"source_before_target\";\n    appendNeighbor(\n      adjacency,\n      sourceFirst ? edge.source : edge.target,\n      sourceFirst ? edge.target : edge.source,\n    );\n  }\n  return adjacency;\n}\n\nfunction topologicalLayers(\n  nodes: readonly string[],\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n): string[][] {\n  const indegree = new Map(nodes.map((node) => [node, 0]));\n  for (const targets of adjacency.values())\n    for (const target of targets)\n      indegree.set(target, indegree.get(target)! + 1);\n  let frontier = nodes.filter((node) => indegree.get(node) === 0).sort();\n  const layers: string[][] = [];\n  while (frontier.length > 0) {\n    layers.push(frontier);\n    const next: string[] = [];\n    for (const source of frontier) {\n      for (const target of adjacency.get(source)!) {\n        const remaining = indegree.get(target)! - 1;\n        indegree.set(target, remaining);\n        if (remaining === 0) next.push(target);\n      }\n    }\n    frontier = next.sort();\n  }\n  return layers;\n}\n\nfunction longestPath(\n  order: readonly string[],\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>,\n): { depth: Record<string, number>; path: string[] } {\n  const depth = new Map(order.map((node) => [node, 0]));\n  const parent = new Map<string, string>();\n  for (const source of order) {\n    for (const target of adjacency.get(source)!) {\n      if (!depth.has(target)) continue;\n      const candidate = depth.get(source)! + 1;\n      const currentParent = parent.get(target);\n      if (\n        candidate > depth.get(target)! ||\n        (candidate === depth.get(target)! &&\n          (currentParent === undefined ||\n            source.localeCompare(currentParent) < 0))\n      ) {\n        depth.set(target, candidate);\n        parent.set(target, source);\n      }\n    }\n  }\n  const end = [...order].sort(\n    (left, right) =>\n      depth.get(right)! - depth.get(left)! || left.localeCompare(right),\n  )[0];\n  const path = end === undefined ? [] : [end];\n  while (path[0] !== undefined && parent.has(path[0]!))\n    path.unshift(parent.get(path[0]!)!);\n  return { depth: Object.fromEntries(depth), path };\n}\n\nfunction reconstructImpactPath(\n  root: string,\n  target: string,\n  parents: ReadonlyMap<string, string>,\n): string[] {\n  const path = [target];\n  let cursor = target;\n  while (cursor !== root) {\n    cursor = parents.get(cursor)!;\n    path.push(cursor);\n  }\n  return path.reverse();\n}\n\n/** Analyze registered order-bearing relationships without treating associative cycles as blockers. */\nexport function analyzeRelationshipExecution(\n  graph: RelationshipGraph,\n  options: RelationshipAnalyticsOptions = {},\n): RelationshipExecutionAnalysis {\n  const registry = options.registry ?? createRelationshipKindRegistry();\n  const nodes = [...graph.nodes()];\n  const adjacency = buildExecutionAdjacency(graph, registry);\n  const layers = topologicalLayers(nodes, adjacency);\n  const order = layers.flat();\n  const acyclic = order.length === nodes.length;\n  const cycles = acyclic\n    ? []\n    : stronglyConnectedComponents(nodes, adjacency).filter(\n        (component) =>\n          component.length > 1 ||\n          adjacency.get(component[0]!)!.has(component[0]!),\n      );\n  const longest = longestPath(order, adjacency);\n  return {\n    exact: true,\n    acyclic,\n    order,\n    layers,\n    frontier: layers[0] ?? [],\n    depth: longest.depth,\n    criticalPath: longest.path,\n    criticalPathLength: Math.max(0, longest.path.length - 1),\n    cycles,\n    provenance: { algorithm: \"kahn-longest-path\", edgeFamily: \"ordering\" },\n  };\n}\n\n/** Compute bounded impact rows and exact shortest explanation paths. */\nexport function analyzeGraphImpact(\n  graph: RelationshipGraph,\n  root: string,\n  options: RelationshipQueryOptions = {},\n): RelationshipImpactAnalysis {\n  const direction = options.direction ?? \"outgoing\";\n  const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;\n  const limit = options.limit ?? Number.POSITIVE_INFINITY;\n  const queue = [{ id: root, depth: 0 }];\n  const seen = new Set([root]);\n  const parents = new Map<string, string>();\n  const affected: RelationshipImpactRow[] = [];\n  let visitedNodes = 0;\n  let inspectedEdges = 0;\n  let truncated = false;\n  traversal: for (let index = 0; index < queue.length; index += 1) {\n    options.signal?.throwIfAborted();\n    const current = queue[index]!;\n    visitedNodes += 1;\n    const adjacent = graph.adjacency(current.id, {\n      direction,\n      kinds: options.kinds,\n      signal: options.signal,\n    });\n    inspectedEdges += adjacent.meta.inspectedEdges;\n    if (current.depth >= maxDepth) {\n      if (adjacent.value.some((id) => !seen.has(id))) truncated = true;\n      continue;\n    }\n    for (const id of adjacent.value) {\n      if (seen.has(id)) continue;\n      if (affected.length >= limit) {\n        truncated = true;\n        break traversal;\n      }\n      seen.add(id);\n      parents.set(id, current.id);\n      const depth = current.depth + 1;\n      affected.push({\n        id,\n        distance: depth,\n        path: reconstructImpactPath(root, id, parents),\n      });\n      queue.push({ id, depth });\n    }\n  }\n  return {\n    root,\n    affected,\n    exact: true,\n    truncated,\n    cost: { visitedNodes, inspectedEdges },\n  };\n}\n\n/** Analyze weak/strong components, isolates, and exact unique-neighbor hubs. */\nexport function analyzeKnowledgeGraph(\n  graph: RelationshipGraph,\n): RelationshipKnowledgeAnalysis {\n  const nodes = [...graph.nodes()];\n  const weak = createAdjacency(nodes);\n  const directed = createAdjacency(nodes);\n  for (const edge of graph.edges()) {\n    appendNeighbor(weak, edge.source, edge.target);\n    appendNeighbor(weak, edge.target, edge.source);\n    appendNeighbor(directed, edge.source, edge.target);\n  }\n  const components: string[][] = [];\n  const visited = new Set<string>();\n  for (const start of nodes) {\n    if (visited.has(start)) continue;\n    const component: string[] = [];\n    const stack = [start];\n    visited.add(start);\n    while (stack.length > 0) {\n      const current = stack.pop()!;\n      component.push(current);\n      for (const neighbor of weak.get(current)!) {\n        if (visited.has(neighbor)) continue;\n        visited.add(neighbor);\n        stack.push(neighbor);\n      }\n    }\n    components.push(component);\n  }\n  const degrees = nodes.map((id) => ({ id, degree: weak.get(id)!.size }));\n  const maximum = Math.max(0, ...degrees.map(({ degree }) => degree));\n  return {\n    components: sortComponents(components),\n    stronglyConnected: stronglyConnectedComponents(nodes, directed),\n    orphans: degrees.filter(({ degree }) => degree === 0).map(({ id }) => id),\n    hubs: degrees.filter(({ degree }) => degree > 0 && degree === maximum),\n    exact: true,\n    provenance: { algorithm: \"component-degree\", edgeFamily: \"all\" },\n  };\n}\n\n/** Compare two immutable relationship snapshots by full normalized edge value. */\nexport function compareRelationshipSnapshots(\n  before: RelationshipSnapshot,\n  after: RelationshipSnapshot,\n): RelationshipSnapshotComparison {\n  const earlier = new Map(\n    before.edges.map((edge) => [relationshipEdgeKey(edge), edge]),\n  );\n  const later = new Map(\n    after.edges.map((edge) => [relationshipEdgeKey(edge), edge]),\n  );\n  return {\n    fromVersion: before.version,\n    toVersion: after.version,\n    added: [...later]\n      .filter(([key]) => !earlier.has(key))\n      .map(([, edge]) => edge),\n    removed: [...earlier]\n      .filter(([key]) => !later.has(key))\n      .map(([, edge]) => edge),\n    unchangedCount: [...earlier.keys()].filter((key) => later.has(key)).length,\n    exact: true,\n  };\n}\n"],"names":[],"mappings":";;AAOA,OAAO,EAGL,8BAA8B,GAG/B,MAAM,oBAAoB,CAAC;AAwF5B,SAAS,cAAc,CACrB,SAAmC,EACnC,MAAc,EACd,MAAc;IAEd,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,eAAe,CAAC,KAAwB;IAC/C,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,cAAc,CAAC,UAAsB;IAC5C,KAAK,MAAM,SAAS,IAAI,UAAU;QAAE,SAAS,CAAC,IAAI,EAAE,CAAC;IACrD,OAAO,UAAU,CAAC,IAAI,CACpB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAClE,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9E,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,MAAM,GAAI,KAAgD,CAAC,MAAM,CAAC;IACxE,IAAI,OAAO,MAAM,KAAK,UAAU;QAAE,OAAO,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7E,OAAO,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;SAClB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SACpD,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CACxD,CAAC;AACJ,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAsB;IACjD,OAAO,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,oBAAoB,CAC3B,KAAa,EACb,SAAmD,EACnD,OAAoB,EACpB,KAAe;IAEf,MAAM,KAAK,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC7B,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAAE,SAAS;QACtC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAE,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;QACnE,KAAK,MAAM,QAAQ,IAAI,SAAS;YAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9E,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC5B,KAAwB,EACxB,SAAmD;IAEnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,KAAK,IAAI,KAAK;QACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YACrB,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IAC3D,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,wBAAwB,CAC/B,KAAwB,EACxB,OAAiD;IAEjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QACjC,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC7B,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAE,EAAE,CAAC;gBAC7C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBACpC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,cAAc,CAAC,UAAU,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,2BAA2B,CAClC,KAAwB,EACxB,SAAmD;IAEnD,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACvC,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,SAAS;QACvC,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACxE,OAAO,wBAAwB,CAC7B,qBAAqB,CAAC,KAAK,EAAE,SAAS,CAAC,EACvC,OAAO,CACR,CAAC;AACJ,CAAC;AAED,SAAS,uBAAuB,CAC9B,KAAwB,EACxB,QAAkC;IAElC,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IACjD,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,sEAAsE;QACtE,MAAM,WAAW,GACf,CAAC,UAAU,CAAC,UAAU,IAAI,sBAAsB,CAAC;YACjD,sBAAsB,CAAC;QACzB,cAAc,CACZ,SAAS,EACT,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EACvC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CACxC,CAAC;IACJ,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAwB,EACxB,SAAmD;IAEnD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,MAAM,EAAE;QACtC,KAAK,MAAM,MAAM,IAAI,OAAO;YAC1B,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,GAAG,CAAC,CAAC,CAAC;IACpD,IAAI,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACvE,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtB,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;gBAC5C,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,GAAG,CAAC,CAAC;gBAC5C,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAChC,IAAI,SAAS,KAAK,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IACzB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,WAAW,CAClB,KAAwB,EACxB,SAAmD;IAEnD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YACjC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,GAAG,CAAC,CAAC;YACzC,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACzC,IACE,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE;gBAC9B,CAAC,SAAS,KAAK,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE;oBAC/B,CAAC,aAAa,KAAK,SAAS;wBAC1B,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAC7C,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAC7B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CACzB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,KAAK,CAAC,GAAG,CAAC,KAAK,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CACpE,CAAC,CAAC,CAAC,CAAC;IACL,MAAM,IAAI,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5C,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;QAClD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,CAAE,CAAC,CAAC;IACtC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,qBAAqB,CAC5B,IAAY,EACZ,MAAc,EACd,OAAoC;IAEpC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB,IAAI,MAAM,GAAG,MAAM,CAAC;IACpB,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;QACvB,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;AACxB,CAAC;AAED,sGAAsG;AACtG,MAAM,UAAU,4BAA4B,CAC1C,KAAwB,EACxB,UAAwC,EAAE;IAE1C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,8BAA8B,EAAE,CAAC;IACtE,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IACjC,MAAM,SAAS,GAAG,uBAAuB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;IAC9C,MAAM,MAAM,GAAG,OAAO;QACpB,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,2BAA2B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,MAAM,CAClD,CAAC,SAAS,EAAE,EAAE,CACZ,SAAS,CAAC,MAAM,GAAG,CAAC;YACpB,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,CAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,CACnD,CAAC;IACN,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC9C,OAAO;QACL,KAAK,EAAE,IAAI;QACX,OAAO;QACP,KAAK;QACL,MAAM;QACN,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE;QACzB,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,YAAY,EAAE,OAAO,CAAC,IAAI;QAC1B,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACxD,MAAM;QACN,UAAU,EAAE,EAAE,SAAS,EAAE,mBAAmB,EAAE,UAAU,EAAE,UAAU,EAAE;KACvE,CAAC;AACJ,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,kBAAkB,CAChC,KAAwB,EACxB,IAAY,EACZ,UAAoC,EAAE;IAEtC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,UAAU,CAAC;IAClD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC9D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,iBAAiB,CAAC;IACxD,MAAM,KAAK,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,QAAQ,GAA4B,EAAE,CAAC;IAC7C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,SAAS,EAAE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAChE,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;QAC9B,YAAY,IAAI,CAAC,CAAC;QAClB,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE;YAC3C,SAAS;YACT,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,CAAC,CAAC;QACH,cAAc,IAAI,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC;QAC/C,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAAE,SAAS,GAAG,IAAI,CAAC;YACjE,SAAS;QACX,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC3B,IAAI,QAAQ,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;gBAC7B,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM,SAAS,CAAC;YAClB,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACb,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;YAChC,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE;gBACF,QAAQ,EAAE,KAAK;gBACf,IAAI,EAAE,qBAAqB,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,CAAC;aAC/C,CAAC,CAAC;YACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,OAAO;QACL,IAAI;QACJ,QAAQ;QACR,KAAK,EAAE,IAAI;QACX,SAAS;QACT,IAAI,EAAE,EAAE,YAAY,EAAE,cAAc,EAAE;KACvC,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,qBAAqB,CACnC,KAAwB;IAExB,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,cAAc,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC;IACD,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QACjC,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC7B,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAE,EAAE,CAAC;gBAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBACpC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;IACD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACpE,OAAO;QACL,UAAU,EAAE,cAAc,CAAC,UAAU,CAAC;QACtC,iBAAiB,EAAE,2BAA2B,CAAC,KAAK,EAAE,QAAQ,CAAC;QAC/D,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACzE,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,KAAK,OAAO,CAAC;QACtE,KAAK,EAAE,IAAI;QACX,UAAU,EAAE,EAAE,SAAS,EAAE,kBAAkB,EAAE,UAAU,EAAE,KAAK,EAAE;KACjE,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,4BAA4B,CAC1C,MAA4B,EAC5B,KAA2B;IAE3B,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAC9D,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAC7D,CAAC;IACF,OAAO;QACL,WAAW,EAAE,MAAM,CAAC,OAAO;QAC3B,SAAS,EAAE,KAAK,CAAC,OAAO;QACxB,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC;aACd,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aACpC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC;QAC1B,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;aAClB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aAClC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC;QAC1B,cAAc,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM;QAC1E,KAAK,EAAE,IAAI;KACZ,CAAC;AACJ,CAAC","debugId":"0a54b889-6d5c-565c-85ff-47e5cce68a32"}

package/dist/sdk/relationship-context.d.ts

@@ -0,0 +1,67 @@
+import { RelationshipGraph, RelationshipKindRegistry, type RelationshipEdge, type RelationshipTraversalDirection } from "./relationships.js";
+/** Caller-owned compact node details joined into graph context. */
+export interface RelationshipContextNodeDetails {
+    /** Stable graph node identifier. */
+    id: string;
+    /** Optional display title. */
+    title?: string;
+    /** Optional lifecycle status. */
+    status?: string;
+    /** Optional evidence pointers such as files, tests, or history ids. */
+    evidence?: readonly string[];
+}
+/** One selected graph-context node with explainable inclusion. */
+export interface RelationshipContextNode extends RelationshipContextNodeDetails {
+    /** Shortest bounded distance from the root. */
+    distance: number;
+    /** Concise deterministic reasons the node was selected. */
+    reasons: string[];
+}
+/** Controls for bounded graph-context assembly. */
+export interface RelationshipContextOptions {
+    /** Traversal direction relative to each visited node. */
+    direction?: RelationshipTraversalDirection;
+    /** Optional registered kind filter. */
+    kinds?: readonly string[];
+    /** Maximum traversal depth. */
+    maxDepth?: number;
+    /** Maximum nodes returned in this page. */
+    nodeLimit?: number;
+    /** Maximum edges returned in this page. */
+    edgeLimit?: number;
+    /** Maximum estimated output tokens charged to rows and edges. */
+    tokenBudget?: number;
+    /** Opaque continuation from an equivalent query. */
+    cursor?: string;
+    /** Registry used to explain custom relationship semantics. */
+    registry?: RelationshipKindRegistry;
+    /** Abort signal checked during traversal. */
+    signal?: AbortSignal;
+}
+/** Explainable graph context packet. */
+export interface RelationshipContextResult {
+    /** Root node details. */
+    root: RelationshipContextNodeDetails;
+    /** Bounded related-node page. */
+    nodes: RelationshipContextNode[];
+    /** Bounded edges whose endpoints are present in the packet. */
+    edges: RelationshipEdge[];
+    /** Root evidence pointers promoted for immediate consumption. */
+    evidence: string[];
+    /** Completeness, continuation, and cost envelope. */
+    meta: {
+        exact: true;
+        truncated: boolean;
+        nodeLimit: number;
+        edgeLimit: number;
+        tokenBudget: number;
+        usedTokens: number;
+        visitedNodes: number;
+        inspectedEdges: number;
+        omittedNodes: number;
+        omittedEdges: number;
+        nextCursor?: string;
+    };
+}
+/** Build one deterministic bounded graph-context packet with continuation. */
+export declare function buildRelationshipContext(graph: RelationshipGraph, rootId: string, details: readonly RelationshipContextNodeDetails[], options?: RelationshipContextOptions): RelationshipContextResult;