@unbrained/pm-cli 2026.7.20 → 2026.7.21

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

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../../../../../sdk/workspace.ts","../../../../../../../../sdk/merge/install.ts"],"sourcesContent":["/**\n * @module sdk/workspace\n *\n * Maintains repository-scaffold contracts shared by the public SDK and CLI.\n */\nimport { readFile, writeFile } from \"node:fs/promises\";\nimport path from \"node:path\";\n\n/** Opening marker for the init-owned ignore block. */\nexport const PM_GITIGNORE_START = \"# pm-cli:runtime-cache:start\";\n/** Closing marker for the init-owned ignore block. */\nexport const PM_GITIGNORE_END = \"# pm-cli:runtime-cache:end\";\n\n/** Default workspace-relative tracker root used when no custom root is resolved. */\nexport const PM_GITIGNORE_DEFAULT_TRACKER_ROOT = \".agents/pm\";\n\n/**\n * Tracker-relative directories that hold per-clone runtime state (caches,\n * search indexes, locks, crash-recovery receipts). They must never be\n * committed: they churn on every command and conflict on every concurrent\n * branch merge. `transactions/` (SDK workspace-transaction journals) and\n * `checkpoints/` (bulk-mutation rollback receipts) are per-branch recovery\n * state with their own GC (`pm gc --scope transactions|checkpoints`), so\n * keeping them untracked is the recorded merge-safety disposition.\n */\nexport const PM_GITIGNORE_RUNTIME_DIRECTORIES = [\n  \"runtime/\",\n  \"search/\",\n  \"locks/\",\n  \"transactions/\",\n  \"checkpoints/\",\n] as const;\n\n/** Result of reconciling the init-owned repository ignore block. */\nexport interface EnsurePmGitignoreResult {\n  /** Absolute path to the reconciled file. */\n  path: string;\n  /** Whether the file content changed. */\n  changed: boolean;\n}\n\nfunction normalizeTrackerRelativeRoot(trackerRelativeRoot: string): string {\n  return trackerRelativeRoot\n    .replaceAll(\"\\\\\", \"/\")\n    .replace(/^\\.\\/+/, \"\")\n    .replace(/\\/+$/, \"\");\n}\n\n/** Return whether a relative path escapes its owning root, without rejecting valid names such as `..pm`. */\nexport function isPathOutsideRoot(relativePath: string): boolean {\n  const normalized = relativePath.replaceAll(\"\\\\\", \"/\");\n  return (\n    path.isAbsolute(relativePath) ||\n    normalized === \"..\" ||\n    normalized.startsWith(\"../\")\n  );\n}\n\n/** Return the canonical pm ignore block rendered for the given workspace-relative tracker root (defaults to `.agents/pm`), primarily for documentation and tests. */\nexport function getPmGitignoreBlock(\n  trackerRelativeRoot: string = PM_GITIGNORE_DEFAULT_TRACKER_ROOT,\n): string {\n  const root = normalizeTrackerRelativeRoot(trackerRelativeRoot);\n  return [\n    PM_GITIGNORE_START,\n    ...PM_GITIGNORE_RUNTIME_DIRECTORIES.map(\n      (directory) => `${root}/${directory}`,\n    ),\n    PM_GITIGNORE_END,\n  ].join(\"\\n\");\n}\n\n/**\n * Idempotently create or replace the fenced pm cache block in a workspace\n * `.gitignore`. When `pmRoot` is provided the ignored runtime directories are\n * rendered under the resolved workspace-relative tracker root, so custom-root\n * workspaces (`--pm-path`/`PM_PATH`) stop committing runtime caches (GH-598).\n * A tracker root outside the workspace needs no ignore rules here, so the\n * file is left untouched.\n */\nexport async function ensurePmGitignore(\n  workspaceRoot: string,\n  options: {\n    /** Absolute tracker root; rendered relative to the workspace root. */\n    pmRoot?: string;\n  } = {},\n): Promise<EnsurePmGitignoreResult> {\n  const gitignorePath = path.join(workspaceRoot, \".gitignore\");\n  let trackerRelativeRoot = PM_GITIGNORE_DEFAULT_TRACKER_ROOT;\n  if (options.pmRoot !== undefined) {\n    const relative = normalizeTrackerRelativeRoot(\n      path.relative(path.resolve(workspaceRoot), path.resolve(options.pmRoot)),\n    );\n    if (isPathOutsideRoot(relative)) {\n      return { path: gitignorePath, changed: false };\n    }\n    if (relative.length > 0) {\n      trackerRelativeRoot = relative;\n    }\n  }\n  let current = \"\";\n  try {\n    current = await readFile(gitignorePath, \"utf8\");\n  } catch (error: unknown) {\n    if (\n      !(error instanceof Error && \"code\" in error && error.code === \"ENOENT\")\n    ) {\n      throw error;\n    }\n  }\n  const start = current.indexOf(PM_GITIGNORE_START);\n  const end = current.indexOf(PM_GITIGNORE_END);\n  const withoutManagedBlock =\n    start >= 0 && end >= start\n      ? `${current.slice(0, start)}${current.slice(end + PM_GITIGNORE_END.length)}`\n      : current;\n  const prefix = withoutManagedBlock.trimEnd();\n  const next = `${prefix.length > 0 ? `${prefix}\\n\\n` : \"\"}${getPmGitignoreBlock(trackerRelativeRoot)}\\n`;\n  if (next === current) {\n    return { path: gitignorePath, changed: false };\n  }\n  await writeFile(gitignorePath, next, \"utf8\");\n  return { path: gitignorePath, changed: true };\n}\n","/**\n * @module sdk/merge/install\n *\n * Installs the tracker's git merge configuration into a repository: a fenced\n * `.gitattributes` block mapping every mergeable tracker artifact class to a\n * pm merge driver, plus the local `git config` driver definitions that make\n * those attributes effective. Idempotent and re-runnable; schema type\n * mutations refresh the fenced block automatically once it is installed.\n */\nimport { readFile, writeFile } from \"node:fs/promises\";\nimport { execFile } from \"node:child_process\";\nimport path from \"node:path\";\nimport { promisify } from \"node:util\";\nimport { getActiveExtensionRegistrations } from \"../../core/extensions/index.js\";\nimport { pathExists } from \"../../core/fs/fs-utils.js\";\nimport { resolveItemTypeRegistry } from \"../../core/item/type-registry.js\";\nimport { acquireLock } from \"../../core/lock/lock.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport type { GlobalOptions } from \"../../core/shared/command-types.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { nowIso } from \"../../core/shared/time.js\";\nimport { getSettingsPath, resolvePmRoot } from \"../../core/store/paths.js\";\nimport {\n  readSettings,\n  resolveGovernanceKnobs,\n} from \"../../core/store/settings.js\";\nimport { isPathOutsideRoot } from \"../workspace.js\";\n\nconst execFileAsync = promisify(execFile);\n\n/** Opening marker for the pm-owned merge-driver `.gitattributes` block. */\nexport const PM_GITATTRIBUTES_START = \"# pm-cli:merge-drivers:start\";\n/** Closing marker for the pm-owned merge-driver `.gitattributes` block. */\nexport const PM_GITATTRIBUTES_END = \"# pm-cli:merge-drivers:end\";\n\nconst MERGE_FENCE_LOCK_ID = \"merge-fence\";\n\nconst MERGE_DRIVER_DEFINITIONS = [\n  {\n    key: \"pm-item-toon\",\n    name: \"pm field-aware TOON item document merge\",\n    artifact: \"item\",\n    itemPath: \"item.toon\",\n  },\n  {\n    key: \"pm-item-markdown\",\n    name: \"pm field-aware JSON-markdown item document merge\",\n    artifact: \"item\",\n    itemPath: \"item.md\",\n  },\n  {\n    key: \"pm-history\",\n    name: \"pm append-only history stream merge\",\n    artifact: \"history\",\n    itemPath: undefined,\n  },\n  {\n    key: \"pm-relationship\",\n    name: \"pm append-only relationship event store merge\",\n    artifact: \"relationship\",\n    itemPath: undefined,\n  },\n  {\n    key: \"pm-json\",\n    name: \"pm key-level JSON config merge\",\n    artifact: \"json\",\n    itemPath: undefined,\n  },\n] as const;\n\n/** Documents the merge install options payload exchanged by command, SDK, and package integrations. */\nexport interface MergeInstallOptions {\n  /** Preview the `.gitattributes` and `git config` changes without writing anything. */\n  dryRun?: boolean;\n}\n\n/** Documents the merge install result payload exchanged by command, SDK, and package integrations. */\nexport interface MergeInstallResult {\n  /** Whether the installation completed (or, for dry runs, would complete) without errors. */\n  ok: boolean;\n  /** Whether this run was a preview only. */\n  dry_run: boolean;\n  /** Repository root the merge configuration was installed into. */\n  workspace_root: string;\n  /** `.gitattributes` reconciliation outcome. */\n  gitattributes: {\n    path: string;\n    changed: boolean;\n    patterns: string[];\n  };\n  /** Local `git config` merge-driver definitions applied (or previewed). */\n  git_config: Array<{ key: string; value: string }>;\n  /** Guidance for completing the multi-branch workflow setup. */\n  guidance: string[];\n  /** ISO 8601 timestamp recording when generated occurred. */\n  generated_at: string;\n}\n\nasync function resolveGitWorkspaceRoot(cwd: string): Promise<string> {\n  try {\n    const { stdout } = await execFileAsync(\n      \"git\",\n      [\"rev-parse\", \"--show-toplevel\"],\n      { cwd, encoding: \"utf8\", windowsHide: true, timeout: 10_000 },\n    );\n    return stdout.trim();\n  } catch {\n    throw new PmCliError(\n      \"pm merge install requires a git repository (merge drivers are git configuration).\",\n      EXIT_CODE.USAGE,\n    );\n  }\n}\n\nfunction toPosixRelative(fromPath: string, toPath: string): string {\n  return path.relative(fromPath, toPath).replaceAll(\"\\\\\", \"/\");\n}\n\n/** Encode one Git attributes pattern with C-style quoting so whitespace, backslashes, and quotation marks remain part of the repository path instead of being parsed as attribute separators. */\nfunction quoteGitAttributePattern(value: string): string {\n  return `\"${value.replaceAll(\"\\\\\", \"\\\\\\\\\").replaceAll('\"', '\\\\\"')}\"`;\n}\n\n/**\n * Build the complete fenced `.gitattributes` pattern list for a tracker rooted\n * at `trackerRelativeRoot` (git-root-relative POSIX path, empty when the\n * tracker root IS the git root). This is the single coverage contract shared\n * by `pm merge install` (which writes the fence) and the validate\n * merge-fence-drift detection (which compares the committed fence against the\n * active schema's type folders), so schema-added custom types can never\n * silently diverge from the installed fence without a warning.\n */\nexport function buildMergeAttributePatterns(\n  trackerRelativeRoot: string,\n  typeFolders: string[],\n): string[] {\n  const prefix =\n    trackerRelativeRoot.length > 0 ? `${trackerRelativeRoot}/` : \"\";\n  const patterns: string[] = [];\n  for (const folder of typeFolders) {\n    patterns.push(\n      `${quoteGitAttributePattern(`${prefix}${folder}/*.toon`)} merge=pm-item-toon`,\n    );\n    patterns.push(\n      `${quoteGitAttributePattern(`${prefix}${folder}/*.md`)} merge=pm-item-markdown`,\n    );\n  }\n  // RelationshipEventStore deliberately accepts a caller-chosen relativePath\n  // anywhere below the tracker root. Cover all tracker JSONL first, then let\n  // the more-specific history rule below override it. This keeps custom event\n  // stores protected without guessing package-owned paths.\n  patterns.push(\n    `${quoteGitAttributePattern(`${prefix}**/*.jsonl`)} merge=pm-relationship`,\n  );\n  patterns.push(\n    `${quoteGitAttributePattern(`${prefix}history/*.jsonl`)} merge=pm-history`,\n  );\n  patterns.push(\n    `${quoteGitAttributePattern(`${prefix}settings.json`)} merge=pm-json`,\n  );\n  patterns.push(\n    `${quoteGitAttributePattern(`${prefix}schema/*.json`)} merge=pm-json`,\n  );\n  return patterns;\n}\n\nasync function reconcileGitattributesBlock(\n  workspaceRoot: string,\n  patterns: string[],\n  dryRun: boolean,\n): Promise<{ path: string; changed: boolean }> {\n  const gitattributesPath = path.join(workspaceRoot, \".gitattributes\");\n  let current = \"\";\n  try {\n    current = await readFile(gitattributesPath, \"utf8\");\n  } catch (error: unknown) {\n    if (\n      !(error instanceof Error && \"code\" in error && error.code === \"ENOENT\")\n    ) {\n      throw error;\n    }\n  }\n  const block = [\n    PM_GITATTRIBUTES_START,\n    ...patterns,\n    PM_GITATTRIBUTES_END,\n  ].join(\"\\n\");\n  const start = current.indexOf(PM_GITATTRIBUTES_START);\n  const end = current.indexOf(PM_GITATTRIBUTES_END);\n  const withoutManagedBlock =\n    start >= 0 && end > start\n      ? `${current.slice(0, start)}${current.slice(end + PM_GITATTRIBUTES_END.length)}`\n      : current\n          .replace(PM_GITATTRIBUTES_START, \"\")\n          .replace(PM_GITATTRIBUTES_END, \"\");\n  const prefix = withoutManagedBlock.trimEnd();\n  const next = `${prefix.length > 0 ? `${prefix}\\n\\n` : \"\"}${block}\\n`;\n  if (next === current) {\n    return { path: gitattributesPath, changed: false };\n  }\n  if (!dryRun) {\n    await writeFile(gitattributesPath, next, \"utf8\");\n  }\n  return { path: gitattributesPath, changed: true };\n}\n\n/** Result of comparing the committed merge-fence block against the coverage the active schema requires. */\nexport interface MergeFenceAuditResult {\n  /** Audit outcome: no fence installed (nothing to audit), fence matches, or fence drifted from the active schema/type folders. */\n  status: \"not_installed\" | \"ok\" | \"drift\";\n  /** `.gitattributes` file containing the fence, when one was found. */\n  path?: string;\n  /** Expected attribute lines absent from the committed fence (for example a schema-added type folder). */\n  missing_patterns: string[];\n  /** Committed fence lines no longer produced by the coverage contract (for example a removed type folder). */\n  stale_patterns: string[];\n}\n\n/**\n * Audit the committed `.gitattributes` merge fence against the coverage the\n * active schema requires, without touching git configuration. The fence file\n * is discovered by walking up from the tracker root (bounded), so the audit\n * stays filesystem-only and safe to run inside `pm validate`. A `drift`\n * result means items of some type folder (or a tracker JSONL store) would\n * merge under git's default text driver despite the fence being installed.\n */\nexport async function auditMergeAttributeFence(\n  pmRoot: string,\n  typeFolders: string[],\n): Promise<MergeFenceAuditResult> {\n  const resolvedRoot = path.resolve(pmRoot);\n  let fenceDirectory: string | null = null;\n  let fenceContent = \"\";\n  let directory = resolvedRoot;\n  for (let depth = 0; depth < 8; depth += 1) {\n    const candidate = path.join(directory, \".gitattributes\");\n    try {\n      const raw = await readFile(candidate, \"utf8\");\n      if (raw.includes(PM_GITATTRIBUTES_START)) {\n        fenceDirectory = directory;\n        fenceContent = raw;\n        break;\n      }\n    } catch {\n      // No .gitattributes at this level; keep walking up.\n    }\n    const parent = path.dirname(directory);\n    if (parent === directory) {\n      break;\n    }\n    directory = parent;\n  }\n  if (fenceDirectory === null) {\n    return { status: \"not_installed\", missing_patterns: [], stale_patterns: [] };\n  }\n  const fencePath = path.join(fenceDirectory, \".gitattributes\");\n  const start = fenceContent.indexOf(PM_GITATTRIBUTES_START);\n  const end = fenceContent.indexOf(PM_GITATTRIBUTES_END);\n  const committed =\n    end > start\n      ? fenceContent\n          .slice(start + PM_GITATTRIBUTES_START.length, end)\n          .split(\"\\n\")\n          .map((line) => line.trim())\n          .filter((line) => line.length > 0)\n      : [];\n  const expected = buildMergeAttributePatterns(\n    toPosixRelative(fenceDirectory, resolvedRoot),\n    typeFolders,\n  );\n  const committedSet = new Set(committed);\n  const expectedSet = new Set(expected);\n  const missing = expected.filter((line) => !committedSet.has(line));\n  const stale = committed.filter((line) => !expectedSet.has(line));\n  return {\n    status: missing.length > 0 || stale.length > 0 ? \"drift\" : \"ok\",\n    path: fencePath,\n    missing_patterns: missing,\n    stale_patterns: stale,\n  };\n}\n\n/** Outcome of an automatic merge-fence refresh attempted after a schema type mutation. */\nexport interface MergeFenceRefreshOutcome {\n  /** What happened: the fence was rewritten, already matched, was never installed (actionable hint), or there is no git repository to configure. */\n  status: \"refreshed\" | \"unchanged\" | \"not_installed\" | \"no_git\";\n  /** `.gitattributes` path examined, when a git repository was found. */\n  path?: string;\n}\n\n/**\n * Refresh the fenced `.gitattributes` merge-driver block after a schema type\n * mutation, but only when `pm merge install` already ran (the fence markers\n * are present). Without this, custom item types registered after install\n * would write items into folders with no merge attribute — silently\n * reintroducing the whole-file conflict class for exactly those items. Repos\n * that never installed the fence get a `not_installed` outcome so callers can\n * surface an actionable hint instead of mutating git configuration nobody\n * asked for.\n */\nexport async function refreshMergeAttributeFenceIfInstalled(\n  pmRoot: string,\n): Promise<MergeFenceRefreshOutcome> {\n  let workspaceRoot: string;\n  try {\n    workspaceRoot = await resolveGitWorkspaceRoot(path.resolve(pmRoot));\n  } catch {\n    return { status: \"no_git\" };\n  }\n  const trackerRelativeRoot = toPosixRelative(\n    workspaceRoot,\n    path.resolve(pmRoot),\n  );\n  const lockSettings = await readSettings(pmRoot);\n  const owner = (process.env.PM_AUTHOR ?? lockSettings.author_default).trim();\n  const releaseLock = await acquireLock(\n    pmRoot,\n    MERGE_FENCE_LOCK_ID,\n    lockSettings.locks.ttl_seconds,\n    owner.length > 0 ? owner : \"unknown\",\n    false,\n    resolveGovernanceKnobs(lockSettings).force_required_for_stale_lock,\n    lockSettings.locks.wait_ms,\n  );\n  try {\n    const gitattributesPath = path.join(workspaceRoot, \".gitattributes\");\n    let current: string;\n    try {\n      current = await readFile(gitattributesPath, \"utf8\");\n    } catch (error: unknown) {\n      if (\n        error instanceof Error &&\n        \"code\" in error &&\n        error.code === \"ENOENT\"\n      ) {\n        return { status: \"not_installed\", path: gitattributesPath };\n      }\n      throw error;\n    }\n    if (!current.includes(PM_GITATTRIBUTES_START)) {\n      return { status: \"not_installed\", path: gitattributesPath };\n    }\n    // Re-read after acquiring the dedicated fence lock so every concurrent\n    // refresher computes from the latest committed type registry.\n    const settings = await readSettings(pmRoot);\n    const typeRegistry = resolveItemTypeRegistry(\n      settings,\n      getActiveExtensionRegistrations(),\n    );\n    const typeFolders = [\n      ...new Set(Object.values(typeRegistry.type_to_folder)),\n    ].sort((left, right) => left.localeCompare(right));\n    const outcome = await reconcileGitattributesBlock(\n      workspaceRoot,\n      buildMergeAttributePatterns(trackerRelativeRoot, typeFolders),\n      false,\n    );\n    return {\n      status: outcome.changed ? \"refreshed\" : \"unchanged\",\n      path: outcome.path,\n    };\n  } finally {\n    await releaseLock();\n  }\n}\n\n/**\n * Install (or preview) the repository merge configuration for tracker data:\n * writes the fenced merge-driver block into `.gitattributes` (committed and\n * shared with every branch) and defines the `merge.pm-*.driver` entries in the\n * repository-local git config (per-clone, so every collaborator runs this once\n * per checkout). Requires an initialized tracker and a git repository.\n */\nexport async function runMergeInstall(\n  options: MergeInstallOptions,\n  global: GlobalOptions,\n): Promise<MergeInstallResult> {\n  const pmRoot = resolvePmRoot(process.cwd(), global.path);\n  if (!(await pathExists(getSettingsPath(pmRoot)))) {\n    throw new PmCliError(\n      `Tracker is not initialized at ${pmRoot}. Run pm init first.`,\n      EXIT_CODE.NOT_FOUND,\n    );\n  }\n  const dryRun = options.dryRun === true;\n  const workspaceRoot = await resolveGitWorkspaceRoot(process.cwd());\n  const trackerRelativeRoot = toPosixRelative(\n    workspaceRoot,\n    path.resolve(pmRoot),\n  );\n  if (isPathOutsideRoot(trackerRelativeRoot)) {\n    throw new PmCliError(\n      `Tracker root ${pmRoot} is outside the git repository ${workspaceRoot}; there is nothing to configure for this repository.`,\n      EXIT_CODE.USAGE,\n    );\n  }\n\n  const settings = await readSettings(pmRoot);\n  const typeRegistry = resolveItemTypeRegistry(\n    settings,\n    getActiveExtensionRegistrations(),\n  );\n  const typeFolders = [\n    ...new Set(Object.values(typeRegistry.type_to_folder)),\n  ].sort((left, right) => left.localeCompare(right));\n  const patterns = buildMergeAttributePatterns(\n    trackerRelativeRoot,\n    typeFolders,\n  );\n  const gitattributes = await reconcileGitattributesBlock(\n    workspaceRoot,\n    patterns,\n    dryRun,\n  );\n\n  const gitConfigEntries: Array<{ key: string; value: string }> = [];\n  for (const definition of MERGE_DRIVER_DEFINITIONS) {\n    gitConfigEntries.push({\n      key: `merge.${definition.key}.name`,\n      value: definition.name,\n    });\n    gitConfigEntries.push({\n      key: `merge.${definition.key}.driver`,\n      value: `pm merge driver ${definition.artifact} \"%O\" \"%A\" \"%B\"${definition.itemPath === undefined ? \"\" : ` --item-path ${definition.itemPath}`}`,\n    });\n  }\n  if (!dryRun) {\n    for (const entry of gitConfigEntries) {\n      await execFileAsync(\"git\", [\"config\", entry.key, entry.value], {\n        cwd: workspaceRoot,\n        encoding: \"utf8\",\n        windowsHide: true,\n        timeout: 10_000,\n      });\n    }\n  }\n\n  return {\n    ok: true,\n    dry_run: dryRun,\n    workspace_root: workspaceRoot,\n    gitattributes: {\n      path: gitattributes.path,\n      changed: gitattributes.changed,\n      patterns,\n    },\n    git_config: gitConfigEntries,\n    guidance: [\n      \"Commit .gitattributes so every branch and collaborator shares the merge mapping.\",\n      'git config is per-clone: each collaborator (and each fresh worktree/clone) runs \"pm merge install\" once.',\n      'After merging branches, run \"pm validate\" and, if history drift is reported, \"pm history-repair --all\" to reconcile item state with merged history.',\n      \"Custom item types registered later refresh this fence automatically (pm schema add-type/remove-type); rerun pm merge install only after out-of-band type-folder edits.\",\n    ],\n    generated_at: nowIso(),\n  };\n}\n"],"names":["readFile","writeFile","path","path","readFile","writeFile"],"mappings":";;;;;;;;;;;;;;;;;;;AAKA,SAAS,UAAU,iBAAiB;AACpC,OAAO,UAAU;AAGV,IAAM,qBAAqB;AAE3B,IAAM,mBAAmB;AAGzB,IAAM,oCAAoC;AAW1C,IAAM,mCAAmC;EAC9C;EACA;EACA;EACA;EACA;;AAWF,SAAS,6BAA6B,qBAA2B;AAC/D,SAAO,oBACJ,WAAW,MAAM,GAAG,EACpB,QAAQ,UAAU,EAAE,EACpB,QAAQ,QAAQ,EAAE;AACvB;AAGM,SAAU,kBAAkB,cAAoB;AACpD,QAAM,aAAa,aAAa,WAAW,MAAM,GAAG;AACpD,SACE,KAAK,WAAW,YAAY,KAC5B,eAAe,QACf,WAAW,WAAW,KAAK;AAE/B;AAGM,SAAU,oBACd,sBAA8B,mCAAiC;AAE/D,QAAM,OAAO,6BAA6B,mBAAmB;AAC7D,SAAO;IACL;IACA,GAAG,iCAAiC,IAClC,CAAC,cAAc,GAAG,IAAI,IAAI,SAAS,EAAE;IAEvC;IACA,KAAK,IAAI;AACb;AAUA,eAAsB,kBACpB,eACA,UAGI,CAAA,GAAE;AAEN,QAAM,gBAAgB,KAAK,KAAK,eAAe,YAAY;AAC3D,MAAI,sBAAsB;AAC1B,MAAI,QAAQ,WAAW,QAAW;AAChC,UAAM,WAAW,6BACf,KAAK,SAAS,KAAK,QAAQ,aAAa,GAAG,KAAK,QAAQ,QAAQ,MAAM,CAAC,CAAC;AAE1E,QAAI,kBAAkB,QAAQ,GAAG;AAC/B,aAAO,EAAE,MAAM,eAAe,SAAS,MAAK;IAC9C;AACA,QAAI,SAAS,SAAS,GAAG;AACvB,4BAAsB;IACxB;EACF;AACA,MAAI,UAAU;AACd,MAAI;AACF,cAAU,MAAM,SAAS,eAAe,MAAM;EAChD,SAAS,OAAgB;AACvB,QACE,EAAE,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS,WAC9D;AACA,YAAM;IACR;EACF;AACA,QAAM,QAAQ,QAAQ,QAAQ,kBAAkB;AAChD,QAAM,MAAM,QAAQ,QAAQ,gBAAgB;AAC5C,QAAM,sBACJ,SAAS,KAAK,OAAO,QACjB,GAAG,QAAQ,MAAM,GAAG,KAAK,CAAC,GAAG,QAAQ,MAAM,MAAM,iBAAiB,MAAM,CAAC,KACzE;AACN,QAAM,SAAS,oBAAoB,QAAO;AAC1C,QAAM,OAAO,GAAG,OAAO,SAAS,IAAI,GAAG,MAAM;;IAAS,EAAE,GAAG,oBAAoB,mBAAmB,CAAC;;AACnG,MAAI,SAAS,SAAS;AACpB,WAAO,EAAE,MAAM,eAAe,SAAS,MAAK;EAC9C;AACA,QAAM,UAAU,eAAe,MAAM,MAAM;AAC3C,SAAO,EAAE,MAAM,eAAe,SAAS,KAAI;AAC7C;;;AClHA,SAAS,YAAAA,WAAU,aAAAC,kBAAiB;AACpC,SAAS,gBAAgB;AACzB,OAAOC,WAAU;AACjB,SAAS,iBAAiB;AAgB1B,IAAM,gBAAgB,UAAU,QAAQ;AAGjC,IAAM,yBAAyB;AAE/B,IAAM,uBAAuB;AAEpC,IAAM,sBAAsB;AAE5B,IAAM,2BAA2B;EAC/B;IACE,KAAK;IACL,MAAM;IACN,UAAU;IACV,UAAU;;EAEZ;IACE,KAAK;IACL,MAAM;IACN,UAAU;IACV,UAAU;;EAEZ;IACE,KAAK;IACL,MAAM;IACN,UAAU;IACV,UAAU;;EAEZ;IACE,KAAK;IACL,MAAM;IACN,UAAU;IACV,UAAU;;EAEZ;IACE,KAAK;IACL,MAAM;IACN,UAAU;IACV,UAAU;;;AAgCd,eAAe,wBAAwB,KAAW;AAChD,MAAI;AACF,UAAM,EAAE,OAAM,IAAK,MAAM,cACvB,OACA,CAAC,aAAa,iBAAiB,GAC/B,EAAE,KAAK,UAAU,QAAQ,aAAa,MAAM,SAAS,IAAM,CAAE;AAE/D,WAAO,OAAO,KAAI;EACpB,QAAQ;AACN,UAAM,IAAI,WACR,qFACA,UAAU,KAAK;EAEnB;AACF;AAEA,SAAS,gBAAgB,UAAkB,QAAc;AACvD,SAAOC,MAAK,SAAS,UAAU,MAAM,EAAE,WAAW,MAAM,GAAG;AAC7D;AAGA,SAAS,yBAAyB,OAAa;AAC7C,SAAO,IAAI,MAAM,WAAW,MAAM,MAAM,EAAE,WAAW,KAAK,KAAK,CAAC;AAClE;AAWM,SAAU,4BACd,qBACA,aAAqB;AAErB,QAAM,SACJ,oBAAoB,SAAS,IAAI,GAAG,mBAAmB,MAAM;AAC/D,QAAM,WAAqB,CAAA;AAC3B,aAAW,UAAU,aAAa;AAChC,aAAS,KACP,GAAG,yBAAyB,GAAG,MAAM,GAAG,MAAM,SAAS,CAAC,qBAAqB;AAE/E,aAAS,KACP,GAAG,yBAAyB,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,yBAAyB;EAEnF;AAKA,WAAS,KACP,GAAG,yBAAyB,GAAG,MAAM,YAAY,CAAC,wBAAwB;AAE5E,WAAS,KACP,GAAG,yBAAyB,GAAG,MAAM,iBAAiB,CAAC,mBAAmB;AAE5E,WAAS,KACP,GAAG,yBAAyB,GAAG,MAAM,eAAe,CAAC,gBAAgB;AAEvE,WAAS,KACP,GAAG,yBAAyB,GAAG,MAAM,eAAe,CAAC,gBAAgB;AAEvE,SAAO;AACT;AAEA,eAAe,4BACb,eACA,UACA,QAAe;AAEf,QAAM,oBAAoBA,MAAK,KAAK,eAAe,gBAAgB;AACnE,MAAI,UAAU;AACd,MAAI;AACF,cAAU,MAAMC,UAAS,mBAAmB,MAAM;EACpD,SAAS,OAAgB;AACvB,QACE,EAAE,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS,WAC9D;AACA,YAAM;IACR;EACF;AACA,QAAM,QAAQ;IACZ;IACA,GAAG;IACH;IACA,KAAK,IAAI;AACX,QAAM,QAAQ,QAAQ,QAAQ,sBAAsB;AACpD,QAAM,MAAM,QAAQ,QAAQ,oBAAoB;AAChD,QAAM,sBACJ,SAAS,KAAK,MAAM,QAChB,GAAG,QAAQ,MAAM,GAAG,KAAK,CAAC,GAAG,QAAQ,MAAM,MAAM,qBAAqB,MAAM,CAAC,KAC7E,QACG,QAAQ,wBAAwB,EAAE,EAClC,QAAQ,sBAAsB,EAAE;AACzC,QAAM,SAAS,oBAAoB,QAAO;AAC1C,QAAM,OAAO,GAAG,OAAO,SAAS,IAAI,GAAG,MAAM;;IAAS,EAAE,GAAG,KAAK;;AAChE,MAAI,SAAS,SAAS;AACpB,WAAO,EAAE,MAAM,mBAAmB,SAAS,MAAK;EAClD;AACA,MAAI,CAAC,QAAQ;AACX,UAAMC,WAAU,mBAAmB,MAAM,MAAM;EACjD;AACA,SAAO,EAAE,MAAM,mBAAmB,SAAS,KAAI;AACjD;AAsBA,eAAsB,yBACpB,QACA,aAAqB;AAErB,QAAM,eAAeF,MAAK,QAAQ,MAAM;AACxC,MAAI,iBAAgC;AACpC,MAAI,eAAe;AACnB,MAAI,YAAY;AAChB,WAAS,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG;AACzC,UAAM,YAAYA,MAAK,KAAK,WAAW,gBAAgB;AACvD,QAAI;AACF,YAAM,MAAM,MAAMC,UAAS,WAAW,MAAM;AAC5C,UAAI,IAAI,SAAS,sBAAsB,GAAG;AACxC,yBAAiB;AACjB,uBAAe;AACf;MACF;IACF,QAAQ;IAER;AACA,UAAM,SAASD,MAAK,QAAQ,SAAS;AACrC,QAAI,WAAW,WAAW;AACxB;IACF;AACA,gBAAY;EACd;AACA,MAAI,mBAAmB,MAAM;AAC3B,WAAO,EAAE,QAAQ,iBAAiB,kBAAkB,CAAA,GAAI,gBAAgB,CAAA,EAAE;EAC5E;AACA,QAAM,YAAYA,MAAK,KAAK,gBAAgB,gBAAgB;AAC5D,QAAM,QAAQ,aAAa,QAAQ,sBAAsB;AACzD,QAAM,MAAM,aAAa,QAAQ,oBAAoB;AACrD,QAAM,YACJ,MAAM,QACF,aACG,MAAM,QAAQ,uBAAuB,QAAQ,GAAG,EAChD,MAAM,IAAI,EACV,IAAI,CAAC,SAAS,KAAK,KAAI,CAAE,EACzB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,IACnC,CAAA;AACN,QAAM,WAAW,4BACf,gBAAgB,gBAAgB,YAAY,GAC5C,WAAW;AAEb,QAAM,eAAe,IAAI,IAAI,SAAS;AACtC,QAAM,cAAc,IAAI,IAAI,QAAQ;AACpC,QAAM,UAAU,SAAS,OAAO,CAAC,SAAS,CAAC,aAAa,IAAI,IAAI,CAAC;AACjE,QAAM,QAAQ,UAAU,OAAO,CAAC,SAAS,CAAC,YAAY,IAAI,IAAI,CAAC;AAC/D,SAAO;IACL,QAAQ,QAAQ,SAAS,KAAK,MAAM,SAAS,IAAI,UAAU;IAC3D,MAAM;IACN,kBAAkB;IAClB,gBAAgB;;AAEpB;AAoBA,eAAsB,sCACpB,QAAc;AAEd,MAAI;AACJ,MAAI;AACF,oBAAgB,MAAM,wBAAwBA,MAAK,QAAQ,MAAM,CAAC;EACpE,QAAQ;AACN,WAAO,EAAE,QAAQ,SAAQ;EAC3B;AACA,QAAM,sBAAsB,gBAC1B,eACAA,MAAK,QAAQ,MAAM,CAAC;AAEtB,QAAM,eAAe,MAAM,aAAa,MAAM;AAC9C,QAAM,SAAS,QAAQ,IAAI,aAAa,aAAa,gBAAgB,KAAI;AACzE,QAAM,cAAc,MAAM,YACxB,QACA,qBACA,aAAa,MAAM,aACnB,MAAM,SAAS,IAAI,QAAQ,WAC3B,OACA,uBAAuB,YAAY,EAAE,+BACrC,aAAa,MAAM,OAAO;AAE5B,MAAI;AACF,UAAM,oBAAoBA,MAAK,KAAK,eAAe,gBAAgB;AACnE,QAAI;AACJ,QAAI;AACF,gBAAU,MAAMC,UAAS,mBAAmB,MAAM;IACpD,SAAS,OAAgB;AACvB,UACE,iBAAiB,SACjB,UAAU,SACV,MAAM,SAAS,UACf;AACA,eAAO,EAAE,QAAQ,iBAAiB,MAAM,kBAAiB;MAC3D;AACA,YAAM;IACR;AACA,QAAI,CAAC,QAAQ,SAAS,sBAAsB,GAAG;AAC7C,aAAO,EAAE,QAAQ,iBAAiB,MAAM,kBAAiB;IAC3D;AAGA,UAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,UAAM,eAAe,wBACnB,UACA,gCAA+B,CAAE;AAEnC,UAAM,cAAc;MAClB,GAAG,IAAI,IAAI,OAAO,OAAO,aAAa,cAAc,CAAC;MACrD,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjD,UAAM,UAAU,MAAM,4BACpB,eACA,4BAA4B,qBAAqB,WAAW,GAC5D,KAAK;AAEP,WAAO;MACL,QAAQ,QAAQ,UAAU,cAAc;MACxC,MAAM,QAAQ;;EAElB;AACE,UAAM,YAAW;EACnB;AACF;AASA,eAAsB,gBACpB,SACA,QAAqB;AAErB,QAAM,SAAS,cAAc,QAAQ,IAAG,GAAI,OAAO,IAAI;AACvD,MAAI,CAAE,MAAM,WAAW,gBAAgB,MAAM,CAAC,GAAI;AAChD,UAAM,IAAI,WACR,iCAAiC,MAAM,wBACvC,UAAU,SAAS;EAEvB;AACA,QAAM,SAAS,QAAQ,WAAW;AAClC,QAAM,gBAAgB,MAAM,wBAAwB,QAAQ,IAAG,CAAE;AACjE,QAAM,sBAAsB,gBAC1B,eACAD,MAAK,QAAQ,MAAM,CAAC;AAEtB,MAAI,kBAAkB,mBAAmB,GAAG;AAC1C,UAAM,IAAI,WACR,gBAAgB,MAAM,kCAAkC,aAAa,wDACrE,UAAU,KAAK;EAEnB;AAEA,QAAM,WAAW,MAAM,aAAa,MAAM;AAC1C,QAAM,eAAe,wBACnB,UACA,gCAA+B,CAAE;AAEnC,QAAM,cAAc;IAClB,GAAG,IAAI,IAAI,OAAO,OAAO,aAAa,cAAc,CAAC;IACrD,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjD,QAAM,WAAW,4BACf,qBACA,WAAW;AAEb,QAAM,gBAAgB,MAAM,4BAC1B,eACA,UACA,MAAM;AAGR,QAAM,mBAA0D,CAAA;AAChE,aAAW,cAAc,0BAA0B;AACjD,qBAAiB,KAAK;MACpB,KAAK,SAAS,WAAW,GAAG;MAC5B,OAAO,WAAW;KACnB;AACD,qBAAiB,KAAK;MACpB,KAAK,SAAS,WAAW,GAAG;MAC5B,OAAO,mBAAmB,WAAW,QAAQ,kBAAkB,WAAW,aAAa,SAAY,KAAK,gBAAgB,WAAW,QAAQ,EAAE;KAC9I;EACH;AACA,MAAI,CAAC,QAAQ;AACX,eAAW,SAAS,kBAAkB;AACpC,YAAM,cAAc,OAAO,CAAC,UAAU,MAAM,KAAK,MAAM,KAAK,GAAG;QAC7D,KAAK;QACL,UAAU;QACV,aAAa;QACb,SAAS;OACV;IACH;EACF;AAEA,SAAO;IACL,IAAI;IACJ,SAAS;IACT,gBAAgB;IAChB,eAAe;MACb,MAAM,cAAc;MACpB,SAAS,cAAc;MACvB;;IAEF,YAAY;IACZ,UAAU;MACR;MACA;MACA;MACA;;IAEF,cAAc,OAAM;;AAExB","debugId":"85f534fd-62b4-5641-8729-6dcd58b50e94"}

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

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

package/dist/cli-bundle/chunks/chunk-E6LEMURX.js

@@ -1,249 +0,0 @@
-import {
-  canonicalDocument,
-  hashDocument,
-  orderObject,
-  sha256Hex,
-  stableStringify,
-  toItemRecord
-} from "./chunk-IY6VZ3IW.js";
-import {
-  ITEM_METADATA_KEY_ORDER
-} from "./chunk-7AVEY74G.js";
-
-// dist/core/history/replay.js
-import jsonPatch from "fast-json-patch";
-!(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] = "870cc300-69e5-5207-a84a-9dc346628044");
-  } catch (e2) {
-  }
-})();
-var EMPTY_REPLAY_DOCUMENT = {
-  metadata: {},
-  body: ""
-};
-function cloneEmptyReplayDocument() {
-  return structuredClone(EMPTY_REPLAY_DOCUMENT);
-}
-function replayHash(document) {
-  try {
-    return hashDocument(replayToItemDocument(document));
-  } catch {
-    return sha256Hex(stableStringify({
-      replay_fallback: true,
-      metadata: document.metadata,
-      body: document.body
-    }));
-  }
-}
-function replayToItemDocument(document) {
-  return {
-    metadata: document.metadata,
-    body: document.body
-  };
-}
-function replayToCanonicalItemDocument(document, options = {}) {
-  return canonicalDocument(replayToItemDocument(document), options);
-}
-function toReplayDocument(document) {
-  if (!document.metadata || Object.keys(document.metadata).length === 0) {
-    return {
-      metadata: {},
-      body: document.body ?? ""
-    };
-  }
-  const canonical = canonicalDocument(document);
-  return {
-    metadata: orderObject(toItemRecord(canonical.metadata), ITEM_METADATA_KEY_ORDER),
-    body: canonical.body
-  };
-}
-function normalizeReplayPatchPath(path) {
-  if (path === "/front_matter") {
-    return "/metadata";
-  }
-  if (path.startsWith("/front_matter/")) {
-    return `/metadata/${path.slice("/front_matter/".length)}`;
-  }
-  return path;
-}
-function isHistoryPatchOp(value) {
-  return typeof value === "object" && value !== null && typeof value.op === "string" && typeof value.path === "string";
-}
-function normalizeReplayPatchOps(patch) {
-  if (!Array.isArray(patch)) {
-    return [];
-  }
-  return patch.filter(isHistoryPatchOp).map((operation) => ({
-    ...operation,
-    path: normalizeReplayPatchPath(operation.path),
-    from: typeof operation.from === "string" ? normalizeReplayPatchPath(operation.from) : void 0
-  }));
-}
-function isReplayDocumentShape(value) {
-  return typeof value === "object" && value !== null && "metadata" in value && "body" in value && typeof value.body === "string" && typeof value.metadata === "object" && value.metadata !== null;
-}
-function tryApplyReplayPatch(current, patch) {
-  try {
-    const normalizedPatch = normalizeReplayPatchOps(patch);
-    const applied = jsonPatch.applyPatch(structuredClone(current), normalizedPatch, true, false).newDocument;
-    if (!isReplayDocumentShape(applied)) {
-      return {
-        ok: false,
-        error: new Error("history_replay_invalid_document_shape")
-      };
-    }
-    return {
-      ok: true,
-      document: { metadata: applied.metadata, body: applied.body }
-    };
-  } catch (error) {
-    return { ok: false, error };
-  }
-}
-function verifyHistoryChain(entries) {
-  let replay = cloneEmptyReplayDocument();
-  for (let index = 0; index < entries.length; index += 1) {
-    const entry = entries[index];
-    if (replayHash(replay) !== entry.before_hash) {
-      return {
-        ok: false,
-        errors: [`verify_failed:before_hash_mismatch:entry_${index + 1}`]
-      };
-    }
-    const applied = tryApplyReplayPatch(replay, entry.patch);
-    if (!applied.ok) {
-      return {
-        ok: false,
-        errors: [`verify_failed:patch_apply_failed:entry_${index + 1}`]
-      };
-    }
-    replay = applied.document;
-    if (replayHash(replay) !== entry.after_hash) {
-      return {
-        ok: false,
-        errors: [`verify_failed:after_hash_mismatch:entry_${index + 1}`]
-      };
-    }
-  }
-  return { ok: true, errors: [] };
-}
-function tryApplySingleOp(document, op) {
-  try {
-    const applied = jsonPatch.applyPatch(structuredClone(document), [op], true, false).newDocument;
-    return { ok: true, document: applied };
-  } catch {
-    return { ok: false };
-  }
-}
-function lenientApplyReplayPatch(current, patch) {
-  let working = structuredClone(current);
-  let convertedReplaceToAdd = 0;
-  let skippedOps = 0;
-  for (const op of normalizeReplayPatchOps(patch)) {
-    const direct = tryApplySingleOp(working, op);
-    if (direct.ok) {
-      working = direct.document;
-      continue;
-    }
-    if (op.op === "replace") {
-      const asAdd = tryApplySingleOp(working, { ...op, op: "add" });
-      if (asAdd.ok) {
-        working = asAdd.document;
-        convertedReplaceToAdd += 1;
-        continue;
-      }
-    }
-    skippedOps += 1;
-  }
-  const candidate = working;
-  const document = {
-    metadata: typeof candidate.metadata === "object" && candidate.metadata !== null ? candidate.metadata : {},
-    body: typeof candidate.body === "string" ? candidate.body : current.body
-  };
-  return { document, convertedReplaceToAdd, skippedOps };
-}
-function reanchorHistoryEntries(entries) {
-  let replay = cloneEmptyReplayDocument();
-  const rewritten = [];
-  const details = [];
-  let entriesRehashed = 0;
-  let entriesPatchRepaired = 0;
-  let convertedReplaceToAdd = 0;
-  let skippedOps = 0;
-  for (let index = 0; index < entries.length; index += 1) {
-    const entry = entries[index];
-    const beforeHash = replayHash(replay);
-    const strict = tryApplyReplayPatch(replay, entry.patch);
-    let next;
-    let outPatch;
-    let patchRepaired = false;
-    let entryConverted = 0;
-    let entrySkipped = 0;
-    if (strict.ok) {
-      next = strict.document;
-      outPatch = entry.patch;
-    } else {
-      const lenient = lenientApplyReplayPatch(replay, entry.patch);
-      next = lenient.document;
-      outPatch = jsonPatch.compare(replay, next);
-      patchRepaired = true;
-      entryConverted = lenient.convertedReplaceToAdd;
-      entrySkipped = lenient.skippedOps;
-      convertedReplaceToAdd += entryConverted;
-      skippedOps += entrySkipped;
-      entriesPatchRepaired += 1;
-    }
-    const afterHash = replayHash(next);
-    const rehashed = beforeHash !== entry.before_hash || afterHash !== entry.after_hash;
-    if (rehashed) {
-      entriesRehashed += 1;
-    }
-    rewritten.push({
-      ...entry,
-      patch: outPatch,
-      before_hash: beforeHash,
-      after_hash: afterHash
-    });
-    details.push({
-      index: index + 1,
-      rehashed,
-      patch_repaired: patchRepaired,
-      converted_replace_to_add: entryConverted,
-      skipped_ops: entrySkipped
-    });
-    replay = next;
-  }
-  return {
-    entries: rewritten,
-    finalDocument: replay,
-    entriesRehashed,
-    entriesPatchRepaired,
-    convertedReplaceToAdd,
-    skippedOps,
-    details
-  };
-}
-function historyEntriesToRaw(entries) {
-  if (entries.length === 0) {
-    return "";
-  }
-  return `${entries.map((entry) => JSON.stringify(entry)).join("\n")}
-`;
-}
-
-export {
-  EMPTY_REPLAY_DOCUMENT,
-  cloneEmptyReplayDocument,
-  replayHash,
-  replayToItemDocument,
-  replayToCanonicalItemDocument,
-  toReplayDocument,
-  normalizeReplayPatchOps,
-  tryApplyReplayPatch,
-  verifyHistoryChain,
-  reanchorHistoryEntries,
-  historyEntriesToRaw
-};
-//# sourceMappingURL=chunk-E6LEMURX.js.map

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

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../../../../../core/history/replay.ts"],
-  "sourcesContent": ["/**\n * @module core/history/replay\n *\n * Implements append-only history and replay behavior for Replay.\n */\nimport jsonPatch from \"fast-json-patch\";\nimport { ITEM_METADATA_KEY_ORDER } from \"../shared/constants.js\";\nimport { canonicalDocument } from \"../item/item-format.js\";\nimport { toItemRecord } from \"../item/item-record.js\";\nimport {\n  orderObject,\n  sha256Hex,\n  stableStringify,\n} from \"../shared/serialization.js\";\nimport { hashDocument } from \"./history.js\";\nimport type {\n  HistoryEntry,\n  HistoryPatchOp,\n  ItemDocument,\n  ItemMetadata,\n} from \"../../types/index.js\";\n\n/**\n * Shared history replay/patch mechanics single-sourced for the history, restore,\n * history-redact, and history-repair commands plus the health/validate drift checks.\n *\n * Each command keeps its own thin error-formatting wrapper so the exact CLI error\n * contracts (restore's rich patch-failure context, redact's op tag, history's\n * generic message) are preserved; only the underlying replay/patch logic is shared.\n */\n\nexport interface ReplayDocument {\n  /** Value that configures or reports metadata for this contract. */\n  metadata: Record<string, unknown>;\n  /** Value that configures or reports body for this contract. */\n  body: string;\n}\n\n/** Public contract for empty replay document, shared by SDK and presentation-layer consumers. */\nexport const EMPTY_REPLAY_DOCUMENT: ReplayDocument = {\n  metadata: {},\n  body: \"\",\n};\n\n/** Implements clone empty replay document for the public runtime surface of this module. */\nexport function cloneEmptyReplayDocument(): ReplayDocument {\n  return structuredClone(EMPTY_REPLAY_DOCUMENT);\n}\n\n/** Implements replay hash for the public runtime surface of this module. */\nexport function replayHash(document: ReplayDocument): string {\n  try {\n    return hashDocument(replayToItemDocument(document));\n  } catch {\n    // Legacy/malformed replay states (for example a stream whose first entry never\n    // established a full `create` document, so the canonicalizer cannot normalize it)\n    // cannot be canonically hashed. Fall back to a deterministic structural hash so\n    // re-anchor and verification stay internally consistent for these streams. Fully\n    // formed documents always take the canonical path above, so valid streams are\n    // unaffected.\n    return sha256Hex(\n      stableStringify({\n        replay_fallback: true,\n        metadata: document.metadata,\n        body: document.body,\n      }),\n    );\n  }\n}\n\n/** Implements replay to item document for the public runtime surface of this module. */\nexport function replayToItemDocument(document: ReplayDocument): ItemDocument {\n  return {\n    metadata: document.metadata as ItemMetadata,\n    body: document.body,\n  };\n}\n\n/** Converts a materialized replay document into a canonical item document. Use this when callers have already rejected the empty/deleted replay state and need restored metadata validated through the normal item-metadata rules. */\nexport function replayToCanonicalItemDocument(\n  document: ReplayDocument,\n  options: Parameters<typeof canonicalDocument>[1] = {},\n): ItemDocument {\n  return canonicalDocument(replayToItemDocument(document), options);\n}\n\n/** Canonicalize an item document into the ordered replay form used when comparing a replayed chain against the on-disk item (restore + history-repair reconciliation). */\nexport function toReplayDocument(document: ItemDocument): ReplayDocument {\n  if (!document.metadata || Object.keys(document.metadata).length === 0) {\n    return {\n      metadata: {},\n      body: document.body ?? \"\",\n    };\n  }\n  const canonical = canonicalDocument(document);\n  return {\n    metadata: orderObject(\n      toItemRecord(canonical.metadata),\n      ITEM_METADATA_KEY_ORDER,\n    ),\n    body: canonical.body,\n  };\n}\n\n/** Implements normalize replay patch path for the public runtime surface of this module. */\nexport function normalizeReplayPatchPath(path: string): string {\n  if (path === \"/front_matter\") {\n    return \"/metadata\";\n  }\n  if (path.startsWith(\"/front_matter/\")) {\n    return `/metadata/${path.slice(\"/front_matter/\".length)}`;\n  }\n  return path;\n}\n\nfunction isHistoryPatchOp(value: unknown): value is HistoryPatchOp {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    typeof (value as { op?: unknown }).op === \"string\" &&\n    typeof (value as { path?: unknown }).path === \"string\"\n  );\n}\n\n/** Implements normalize replay patch ops for the public runtime surface of this module. */\nexport function normalizeReplayPatchOps(\n  patch: HistoryPatchOp[] | unknown,\n): HistoryPatchOp[] {\n  if (!Array.isArray(patch)) {\n    return [];\n  }\n  return patch.filter(isHistoryPatchOp).map((operation) => ({\n    ...operation,\n    path: normalizeReplayPatchPath(operation.path),\n    from:\n      typeof operation.from === \"string\"\n        ? normalizeReplayPatchPath(operation.from)\n        : undefined,\n  }));\n}\n\nfunction isReplayDocumentShape(\n  value: unknown,\n): value is { metadata: Record<string, unknown>; body: string } {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    \"metadata\" in value &&\n    \"body\" in value &&\n    typeof (value as { body: unknown }).body === \"string\" &&\n    typeof (value as { metadata: unknown }).metadata === \"object\" &&\n    (value as { metadata: unknown }).metadata !== null\n  );\n}\n\n/** Restricts replay apply result values accepted by command, SDK, and storage contracts. */\nexport type ReplayApplyResult =\n  | { ok: true; document: ReplayDocument }\n  | { ok: false; error: unknown };\n\n/** Strictly apply a history patch (front_matter->metadata normalized) to a replay document. Returns a result envelope rather than throwing so each caller can format its own error contract. */\nexport function tryApplyReplayPatch(\n  current: ReplayDocument,\n  patch: HistoryPatchOp[],\n): ReplayApplyResult {\n  try {\n    const normalizedPatch = normalizeReplayPatchOps(patch);\n    const applied = jsonPatch.applyPatch(\n      structuredClone(current),\n      normalizedPatch as jsonPatch.Operation[],\n      true,\n      false,\n    ).newDocument as unknown;\n    if (!isReplayDocumentShape(applied)) {\n      return {\n        ok: false,\n        error: new Error(\"history_replay_invalid_document_shape\"),\n      };\n    }\n    return {\n      ok: true,\n      document: { metadata: applied.metadata, body: applied.body },\n    };\n  } catch (error) {\n    return { ok: false, error };\n  }\n}\n\n/** Deterministically verify a history chain: each entry's before_hash must equal the prior replayed after_hash, the patch must strictly apply, and the recorded after_hash must equal the replayed result. */\nexport function verifyHistoryChain(entries: HistoryEntry[]): {\n  ok: boolean;\n  errors: string[];\n} {\n  let replay = cloneEmptyReplayDocument();\n  for (let index = 0; index < entries.length; index += 1) {\n    const entry = entries[index];\n    if (replayHash(replay) !== entry.before_hash) {\n      return {\n        ok: false,\n        errors: [`verify_failed:before_hash_mismatch:entry_${index + 1}`],\n      };\n    }\n    const applied = tryApplyReplayPatch(replay, entry.patch);\n    if (!applied.ok) {\n      return {\n        ok: false,\n        errors: [`verify_failed:patch_apply_failed:entry_${index + 1}`],\n      };\n    }\n    replay = applied.document;\n    if (replayHash(replay) !== entry.after_hash) {\n      return {\n        ok: false,\n        errors: [`verify_failed:after_hash_mismatch:entry_${index + 1}`],\n      };\n    }\n  }\n  return { ok: true, errors: [] };\n}\n\n/** Documents the lenient apply result payload exchanged by command, SDK, and package integrations. */\nexport interface LenientApplyResult {\n  /** Value that configures or reports document for this contract. */\n  document: ReplayDocument;\n  /** Value that configures or reports converted replace to add for this contract. */\n  convertedReplaceToAdd: number;\n  /** Value that configures or reports skipped ops for this contract. */\n  skippedOps: number;\n}\n\nfunction tryApplySingleOp(\n  document: unknown,\n  op: HistoryPatchOp,\n): { ok: true; document: unknown } | { ok: false } {\n  try {\n    const applied = jsonPatch.applyPatch(\n      structuredClone(document),\n      [op as jsonPatch.Operation],\n      true,\n      false,\n    ).newDocument as unknown;\n    return { ok: true, document: applied };\n  } catch {\n    return { ok: false };\n  }\n}\n\n/** Apply a legacy patch op-by-op, recovering from drift that strict replay rejects: a `replace` whose path no longer exists is retried as `add`, and any op that still cannot apply against the current replay state is skipped. The resulting document is what the repaired entry's recomputed patch should target. */\nexport function lenientApplyReplayPatch(\n  current: ReplayDocument,\n  patch: HistoryPatchOp[],\n): LenientApplyResult {\n  let working: unknown = structuredClone(current);\n  let convertedReplaceToAdd = 0;\n  let skippedOps = 0;\n\n  for (const op of normalizeReplayPatchOps(patch)) {\n    const direct = tryApplySingleOp(working, op);\n    if (direct.ok) {\n      working = direct.document;\n      continue;\n    }\n    if (op.op === \"replace\") {\n      const asAdd = tryApplySingleOp(working, { ...op, op: \"add\" });\n      if (asAdd.ok) {\n        working = asAdd.document;\n        convertedReplaceToAdd += 1;\n        continue;\n      }\n    }\n    skippedOps += 1;\n  }\n\n  const candidate = working as { metadata?: unknown; body?: unknown };\n  const document: ReplayDocument = {\n    metadata:\n      typeof candidate.metadata === \"object\" && candidate.metadata !== null\n        ? (candidate.metadata as Record<string, unknown>)\n        : {},\n    body: typeof candidate.body === \"string\" ? candidate.body : current.body,\n  };\n  return { document, convertedReplaceToAdd, skippedOps };\n}\n\n/** Documents the reanchor entry detail payload exchanged by command, SDK, and package integrations. */\nexport interface ReanchorEntryDetail {\n  /** Value that configures or reports index for this contract. */\n  index: number;\n  /** Value that configures or reports rehashed for this contract. */\n  rehashed: boolean;\n  /** Value that configures or reports patch repaired for this contract. */\n  patch_repaired: boolean;\n  /** Value that configures or reports converted replace to add for this contract. */\n  converted_replace_to_add: number;\n  /** Value that configures or reports skipped ops for this contract. */\n  skipped_ops: number;\n}\n\n/** Documents the reanchor result payload exchanged by command, SDK, and package integrations. */\nexport interface ReanchorResult {\n  /** Value that configures or reports entries for this contract. */\n  entries: HistoryEntry[];\n  /** Value that configures or reports final document for this contract. */\n  finalDocument: ReplayDocument;\n  /** Value that configures or reports entries rehashed for this contract. */\n  entriesRehashed: number;\n  /** Value that configures or reports entries patch repaired for this contract. */\n  entriesPatchRepaired: number;\n  /** Value that configures or reports converted replace to add for this contract. */\n  convertedReplaceToAdd: number;\n  /** Value that configures or reports skipped ops for this contract. */\n  skippedOps: number;\n  /** Value that configures or reports details for this contract. */\n  details: ReanchorEntryDetail[];\n}\n\n/** Re-anchor a drifted history chain: replay every entry from empty, recompute the before/after hashes, and only rewrite a patch when the original op set no longer strictly applies (legacy drift). Clean entries keep their patch verbatim so the on-disk diff stays minimal. The returned chain verifies via verifyHistoryChain. */\nexport function reanchorHistoryEntries(\n  entries: HistoryEntry[],\n): ReanchorResult {\n  let replay = cloneEmptyReplayDocument();\n  const rewritten: HistoryEntry[] = [];\n  const details: ReanchorEntryDetail[] = [];\n  let entriesRehashed = 0;\n  let entriesPatchRepaired = 0;\n  let convertedReplaceToAdd = 0;\n  let skippedOps = 0;\n\n  for (let index = 0; index < entries.length; index += 1) {\n    const entry = entries[index];\n    const beforeHash = replayHash(replay);\n    const strict = tryApplyReplayPatch(replay, entry.patch);\n\n    let next: ReplayDocument;\n    let outPatch: HistoryPatchOp[];\n    let patchRepaired = false;\n    let entryConverted = 0;\n    let entrySkipped = 0;\n\n    if (strict.ok) {\n      next = strict.document;\n      outPatch = entry.patch;\n    } else {\n      const lenient = lenientApplyReplayPatch(replay, entry.patch);\n      next = lenient.document;\n      outPatch = jsonPatch.compare(replay, next) as HistoryPatchOp[];\n      patchRepaired = true;\n      entryConverted = lenient.convertedReplaceToAdd;\n      entrySkipped = lenient.skippedOps;\n      convertedReplaceToAdd += entryConverted;\n      skippedOps += entrySkipped;\n      entriesPatchRepaired += 1;\n    }\n\n    const afterHash = replayHash(next);\n    const rehashed =\n      beforeHash !== entry.before_hash || afterHash !== entry.after_hash;\n    if (rehashed) {\n      entriesRehashed += 1;\n    }\n\n    rewritten.push({\n      ...entry,\n      patch: outPatch,\n      before_hash: beforeHash,\n      after_hash: afterHash,\n    });\n    details.push({\n      index: index + 1,\n      rehashed,\n      patch_repaired: patchRepaired,\n      converted_replace_to_add: entryConverted,\n      skipped_ops: entrySkipped,\n    });\n    replay = next;\n  }\n\n  return {\n    entries: rewritten,\n    finalDocument: replay,\n    entriesRehashed,\n    entriesPatchRepaired,\n    convertedReplaceToAdd,\n    skippedOps,\n    details,\n  };\n}\n\n/** Implements history entries to raw for the public runtime surface of this module. */\nexport function historyEntriesToRaw(entries: HistoryEntry[]): string {\n  if (entries.length === 0) {\n    return \"\";\n  }\n  return `${entries.map((entry) => JSON.stringify(entry)).join(\"\\n\")}\\n`;\n}\n"],
-  "mappings": ";;;;;;;;;;;;;AAKA,OAAO,eAAe;;;;;;;;AAkCf,IAAM,wBAAwC;EACnD,UAAU,CAAA;EACV,MAAM;;AAIF,SAAU,2BAAwB;AACtC,SAAO,gBAAgB,qBAAqB;AAC9C;AAGM,SAAU,WAAW,UAAwB;AACjD,MAAI;AACF,WAAO,aAAa,qBAAqB,QAAQ,CAAC;EACpD,QAAQ;AAON,WAAO,UACL,gBAAgB;MACd,iBAAiB;MACjB,UAAU,SAAS;MACnB,MAAM,SAAS;KAChB,CAAC;EAEN;AACF;AAGM,SAAU,qBAAqB,UAAwB;AAC3D,SAAO;IACL,UAAU,SAAS;IACnB,MAAM,SAAS;;AAEnB;AAGM,SAAU,8BACd,UACA,UAAmD,CAAA,GAAE;AAErD,SAAO,kBAAkB,qBAAqB,QAAQ,GAAG,OAAO;AAClE;AAGM,SAAU,iBAAiB,UAAsB;AACrD,MAAI,CAAC,SAAS,YAAY,OAAO,KAAK,SAAS,QAAQ,EAAE,WAAW,GAAG;AACrE,WAAO;MACL,UAAU,CAAA;MACV,MAAM,SAAS,QAAQ;;EAE3B;AACA,QAAM,YAAY,kBAAkB,QAAQ;AAC5C,SAAO;IACL,UAAU,YACR,aAAa,UAAU,QAAQ,GAC/B,uBAAuB;IAEzB,MAAM,UAAU;;AAEpB;AAGM,SAAU,yBAAyB,MAAY;AACnD,MAAI,SAAS,iBAAiB;AAC5B,WAAO;EACT;AACA,MAAI,KAAK,WAAW,gBAAgB,GAAG;AACrC,WAAO,aAAa,KAAK,MAAM,iBAAiB,MAAM,CAAC;EACzD;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAAc;AACtC,SACE,OAAO,UAAU,YACjB,UAAU,QACV,OAAQ,MAA2B,OAAO,YAC1C,OAAQ,MAA6B,SAAS;AAElD;AAGM,SAAU,wBACd,OAAiC;AAEjC,MAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,WAAO,CAAA;EACT;AACA,SAAO,MAAM,OAAO,gBAAgB,EAAE,IAAI,CAAC,eAAe;IACxD,GAAG;IACH,MAAM,yBAAyB,UAAU,IAAI;IAC7C,MACE,OAAO,UAAU,SAAS,WACtB,yBAAyB,UAAU,IAAI,IACvC;IACN;AACJ;AAEA,SAAS,sBACP,OAAc;AAEd,SACE,OAAO,UAAU,YACjB,UAAU,QACV,cAAc,SACd,UAAU,SACV,OAAQ,MAA4B,SAAS,YAC7C,OAAQ,MAAgC,aAAa,YACpD,MAAgC,aAAa;AAElD;AAQM,SAAU,oBACd,SACA,OAAuB;AAEvB,MAAI;AACF,UAAM,kBAAkB,wBAAwB,KAAK;AACrD,UAAM,UAAU,UAAU,WACxB,gBAAgB,OAAO,GACvB,iBACA,MACA,KAAK,EACL;AACF,QAAI,CAAC,sBAAsB,OAAO,GAAG;AACnC,aAAO;QACL,IAAI;QACJ,OAAO,IAAI,MAAM,uCAAuC;;IAE5D;AACA,WAAO;MACL,IAAI;MACJ,UAAU,EAAE,UAAU,QAAQ,UAAU,MAAM,QAAQ,KAAI;;EAE9D,SAAS,OAAO;AACd,WAAO,EAAE,IAAI,OAAO,MAAK;EAC3B;AACF;AAGM,SAAU,mBAAmB,SAAuB;AAIxD,MAAI,SAAS,yBAAwB;AACrC,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,UAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAI,WAAW,MAAM,MAAM,MAAM,aAAa;AAC5C,aAAO;QACL,IAAI;QACJ,QAAQ,CAAC,4CAA4C,QAAQ,CAAC,EAAE;;IAEpE;AACA,UAAM,UAAU,oBAAoB,QAAQ,MAAM,KAAK;AACvD,QAAI,CAAC,QAAQ,IAAI;AACf,aAAO;QACL,IAAI;QACJ,QAAQ,CAAC,0CAA0C,QAAQ,CAAC,EAAE;;IAElE;AACA,aAAS,QAAQ;AACjB,QAAI,WAAW,MAAM,MAAM,MAAM,YAAY;AAC3C,aAAO;QACL,IAAI;QACJ,QAAQ,CAAC,2CAA2C,QAAQ,CAAC,EAAE;;IAEnE;EACF;AACA,SAAO,EAAE,IAAI,MAAM,QAAQ,CAAA,EAAE;AAC/B;AAYA,SAAS,iBACP,UACA,IAAkB;AAElB,MAAI;AACF,UAAM,UAAU,UAAU,WACxB,gBAAgB,QAAQ,GACxB,CAAC,EAAyB,GAC1B,MACA,KAAK,EACL;AACF,WAAO,EAAE,IAAI,MAAM,UAAU,QAAO;EACtC,QAAQ;AACN,WAAO,EAAE,IAAI,MAAK;EACpB;AACF;AAGM,SAAU,wBACd,SACA,OAAuB;AAEvB,MAAI,UAAmB,gBAAgB,OAAO;AAC9C,MAAI,wBAAwB;AAC5B,MAAI,aAAa;AAEjB,aAAW,MAAM,wBAAwB,KAAK,GAAG;AAC/C,UAAM,SAAS,iBAAiB,SAAS,EAAE;AAC3C,QAAI,OAAO,IAAI;AACb,gBAAU,OAAO;AACjB;IACF;AACA,QAAI,GAAG,OAAO,WAAW;AACvB,YAAM,QAAQ,iBAAiB,SAAS,EAAE,GAAG,IAAI,IAAI,MAAK,CAAE;AAC5D,UAAI,MAAM,IAAI;AACZ,kBAAU,MAAM;AAChB,iCAAyB;AACzB;MACF;IACF;AACA,kBAAc;EAChB;AAEA,QAAM,YAAY;AAClB,QAAM,WAA2B;IAC/B,UACE,OAAO,UAAU,aAAa,YAAY,UAAU,aAAa,OAC5D,UAAU,WACX,CAAA;IACN,MAAM,OAAO,UAAU,SAAS,WAAW,UAAU,OAAO,QAAQ;;AAEtE,SAAO,EAAE,UAAU,uBAAuB,WAAU;AACtD;AAmCM,SAAU,uBACd,SAAuB;AAEvB,MAAI,SAAS,yBAAwB;AACrC,QAAM,YAA4B,CAAA;AAClC,QAAM,UAAiC,CAAA;AACvC,MAAI,kBAAkB;AACtB,MAAI,uBAAuB;AAC3B,MAAI,wBAAwB;AAC5B,MAAI,aAAa;AAEjB,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,UAAM,QAAQ,QAAQ,KAAK;AAC3B,UAAM,aAAa,WAAW,MAAM;AACpC,UAAM,SAAS,oBAAoB,QAAQ,MAAM,KAAK;AAEtD,QAAI;AACJ,QAAI;AACJ,QAAI,gBAAgB;AACpB,QAAI,iBAAiB;AACrB,QAAI,eAAe;AAEnB,QAAI,OAAO,IAAI;AACb,aAAO,OAAO;AACd,iBAAW,MAAM;IACnB,OAAO;AACL,YAAM,UAAU,wBAAwB,QAAQ,MAAM,KAAK;AAC3D,aAAO,QAAQ;AACf,iBAAW,UAAU,QAAQ,QAAQ,IAAI;AACzC,sBAAgB;AAChB,uBAAiB,QAAQ;AACzB,qBAAe,QAAQ;AACvB,+BAAyB;AACzB,oBAAc;AACd,8BAAwB;IAC1B;AAEA,UAAM,YAAY,WAAW,IAAI;AACjC,UAAM,WACJ,eAAe,MAAM,eAAe,cAAc,MAAM;AAC1D,QAAI,UAAU;AACZ,yBAAmB;IACrB;AAEA,cAAU,KAAK;MACb,GAAG;MACH,OAAO;MACP,aAAa;MACb,YAAY;KACb;AACD,YAAQ,KAAK;MACX,OAAO,QAAQ;MACf;MACA,gBAAgB;MAChB,0BAA0B;MAC1B,aAAa;KACd;AACD,aAAS;EACX;AAEA,SAAO;IACL,SAAS;IACT,eAAe;IACf;IACA;IACA;IACA;IACA;;AAEJ;AAGM,SAAU,oBAAoB,SAAuB;AACzD,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;EACT;AACA,SAAO,GAAG,QAAQ,IAAI,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC;;AACpE;",
-  "names": []
-}