@unbrained/pm-cli 2026.9.6 → 2026.9.8

package/dist/sdk/dependencies.js

@@ -1,719 +1,2 @@
-/**
- * @module sdk/dependencies
- *
- * Implements the pm deps command surface and its agent-facing runtime behavior.
- */
-
-!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]="74a825f3-1301-5dc5-a887-c6ff68f6d7ec")}catch(e){}}();
-import { assertInitializedTracker } from "./environment/tracker-preflight.js";
-import { getActiveExtensionRegistrations } from "../core/extensions/index.js";
-import { resolveItemTypeRegistry } from "../core/item/type-registry.js";
-import { isTerminalStatus } from "../core/item/status.js";
-import { resolveRuntimeStatusRegistry } from "../core/schema/runtime-schema.js";
-import { EXIT_CODE } from "../core/shared/constants.js";
-import { PmCliError } from "../core/shared/errors.js";
-import { formatBuiltInOutput } from "../core/output/output.js";
-import { listAllItemMetadataLight, locateItem, readLocatedItem, } from "../core/store/item-store.js";
-import { resolvePmRoot } from "../core/store/paths.js";
-import { readSettings } from "../core/store/settings.js";
-import { estimatePmOutputTokens } from "./cli-contracts/agent-output-contracts.js";
-import { assertProjectionModeChoice, attachOutputOmissionReceipt, } from "./output-projection.js";
-import { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, resolveWorkspaceRelationshipKindRegistry, } from "./graph/assembly.js";
-import { computeWorkspaceGraphFingerprint, workspaceGraphCache, } from "./graph/cache.js";
-import { buildRelationshipContext, } from "./relationship-context.js";
-import { createRelationshipKindRegistry, } from "./relationships.js";
-/** Supported values accepted by the deps format contract. */
-export const DEPS_FORMAT_VALUES = ["tree", "graph", "context"];
-/** Supported values accepted by the deps collapse contract. */
-export const DEPS_COLLAPSE_VALUES = ["none", "repeated"];
-/** Supported values accepted by the deps graph-context direction contract. */
-export const DEPS_DIRECTION_VALUES = ["outgoing", "incoming", "both"];
-const DEFAULT_DEPS_TREE_MAX_DEPTH = 32;
-const DEFAULT_DEPS_TREE_NODE_LIMIT = 200;
-const DEFAULT_DEPS_TREE_EDGE_LIMIT = 400;
-const DEFAULT_DEPS_TREE_TOKEN_BUDGET = 16_000;
-function parseFormat(raw) {
-    const candidate = raw?.trim().toLowerCase() ?? "tree";
-    if (DEPS_FORMAT_VALUES.includes(candidate)) {
-        return candidate;
-    }
-    throw new PmCliError(`Invalid --format value "${raw}". Use "tree", "graph", or "context".`, EXIT_CODE.USAGE);
-}
-/** Parse one positive-integer graph bound, failing fast with the offending flag name. */
-export function parsePositiveInteger(raw, flag) {
-    if (raw === undefined)
-        return undefined;
-    const value = typeof raw === "number" ? raw : Number(raw.trim());
-    if (!Number.isInteger(value) || value < 1)
-        throw new PmCliError(`Invalid --${flag} value "${raw}". Use a positive integer.`, EXIT_CODE.USAGE);
-    return value;
-}
-/** Parse the shared non-negative --max-depth traversal bound. */
-export function parseMaxDepth(raw) {
-    if (raw === undefined) {
-        return undefined;
-    }
-    const normalized = typeof raw === "number" ? raw : Number(raw.trim());
-    if (!Number.isInteger(normalized) || normalized < 0) {
-        throw new PmCliError(`Invalid --max-depth value "${raw}". Use a non-negative integer.`, EXIT_CODE.USAGE);
-    }
-    return normalized;
-}
-function parseCollapse(raw) {
-    const candidate = raw?.trim().toLowerCase() ?? "none";
-    if (DEPS_COLLAPSE_VALUES.includes(candidate)) {
-        return candidate;
-    }
-    throw new PmCliError(`Invalid --collapse value "${raw}". Use "none" or "repeated".`, EXIT_CODE.USAGE);
-}
-/** Parse the shared graph traversal --direction value, defaulting to "both". */
-export function parseDirection(raw) {
-    const candidate = raw?.trim().toLowerCase() ?? "both";
-    if (DEPS_DIRECTION_VALUES.includes(candidate)) {
-        return candidate;
-    }
-    throw new PmCliError(`Invalid --direction value "${raw}". Use "outgoing", "incoming", or "both".`, EXIT_CODE.USAGE);
-}
-/**
- * Normalize repeatable and comma-separated --kind values against one
- * relationship ontology, failing fast on unknown kinds instead of silently
- * matching nothing (the multi-value filter-grammar trap tracked by pm-gknu).
- */
-export function parseKinds(raw, registry = createRelationshipKindRegistry()) {
-    if (raw === undefined)
-        return undefined;
-    const values = (Array.isArray(raw) ? raw : [raw])
-        .flatMap((value) => value.split(","))
-        .map((value) => value.trim())
-        .filter((value) => value.length > 0);
-    if (values.length === 0)
-        return undefined;
-    const kinds = new Set();
-    for (const value of values) {
-        const definition = registry.resolve(value);
-        if (!definition) {
-            const known = registry
-                .list()
-                .map((entry) => entry.kind)
-                .join(", ");
-            throw new PmCliError(`Invalid --kind value "${value}". Registered kinds: ${known}.`, EXIT_CODE.USAGE);
-        }
-        kinds.add(definition.kind);
-    }
-    return [...kinds].sort();
-}
-function normalizeDependencies(dependencies) {
-    if (!dependencies || dependencies.length === 0) {
-        return [];
-    }
-    const sorted = dependencies
-        .map(({ id, kind }) => ({
-        id: id.trim(),
-        kind: kind.trim().toLowerCase(),
-    }))
-        .sort((left, right) => {
-        const byKind = left.kind.localeCompare(right.kind);
-        if (byKind !== 0)
-            return byKind;
-        return left.id.localeCompare(right.id);
-    });
-    const deduped = new Map();
-    for (const dependency of sorted) {
-        const key = `${dependency.kind.toLowerCase()}::${dependency.id.toLowerCase()}`;
-        if (!deduped.has(key)) {
-            deduped.set(key, { id: dependency.id, kind: dependency.kind });
-        }
-    }
-    return [...deduped.values()];
-}
-function toIndexedItem(item) {
-    return {
-        id: item.id,
-        title: item.title,
-        type: item.type,
-        status: item.status,
-        dependencies: normalizeDependencies(item.dependencies),
-    };
-}
-function estimateTreeNodeTokens(node) {
-    return estimatePmOutputTokens(new TextEncoder().encode(JSON.stringify({ ...node, dependencies: undefined })).byteLength);
-}
-function appendTreeDependencies(baseNode, item, index, nextLineage, maxDepth, collapse, expanded, budget, depth) {
-    for (const dependency of item.dependencies) {
-        const edgeTokens = Math.max(1, Math.ceil(JSON.stringify({
-            from: baseNode.id,
-            to: dependency.id,
-            kind: dependency.kind,
-        }).length / 3));
-        if (budget.nodes >= budget.nodeLimit) {
-            baseNode.truncated = true;
-            budget.reasons.add("node_limit");
-            break;
-        }
-        if (budget.edges >= budget.edgeLimit) {
-            baseNode.truncated = true;
-            budget.reasons.add("edge_limit");
-            break;
-        }
-        if (budget.estimatedTokens + edgeTokens >= budget.tokenBudget) {
-            baseNode.truncated = true;
-            budget.reasons.add("token_budget");
-            break;
-        }
-        budget.edges += 1;
-        budget.estimatedTokens += edgeTokens;
-        baseNode.dependencies.push(toTreeNode(dependency.id, index, nextLineage, maxDepth, collapse, expanded, budget, depth + 1, dependency.kind));
-    }
-}
-function shouldStopTreeNodeExpansion(node, item, lookupId, maxDepth, collapse, expanded, budget, depth) {
-    if (budget.estimatedTokens >= budget.tokenBudget &&
-        item?.dependencies.length) {
-        node.truncated = true;
-        budget.reasons.add("token_budget");
-        return true;
-    }
-    if (!item || node.cycle) {
-        return true;
-    }
-    if (maxDepth !== undefined && depth >= maxDepth) {
-        if (item.dependencies.length > 0) {
-            node.truncated = true;
-            budget.reasons.add("max_depth");
-        }
-        return true;
-    }
-    if (collapse === "repeated" && expanded.has(lookupId)) {
-        node.collapsed = true;
-        return true;
-    }
-    return false;
-}
-function toTreeNode(id, index, lineage, maxDepth, collapse, expanded, budget, depth = 0, via) {
-    const lookupId = id.trim().toLowerCase();
-    const item = index.get(lookupId);
-    const baseNode = {
-        id: item?.id ?? id,
-        title: item?.title,
-        type: item?.type,
-        status: item?.status,
-        via,
-        missing: !item,
-        cycle: lineage.has(lookupId),
-        dependencies: [],
-    };
-    budget.nodes += 1;
-    budget.estimatedTokens += estimateTreeNodeTokens(baseNode);
-    if (shouldStopTreeNodeExpansion(baseNode, item, lookupId, maxDepth, collapse, expanded, budget, depth)) {
-        return baseNode;
-    }
-    if (collapse === "repeated") {
-        expanded.add(lookupId);
-    }
-    const nextLineage = new Set(lineage);
-    nextLineage.add(lookupId);
-    appendTreeDependencies(baseNode, item, index, nextLineage, maxDepth, collapse, expanded, budget, depth);
-    return baseNode;
-}
-function mergeGraphNode(existing, candidate) {
-    if (!existing) {
-        return candidate;
-    }
-    /* c8 ignore start -- defensive: mixed missing/non-missing duplicates only occur in malformed synthetic trees. */
-    if (existing.missing && !candidate.missing)
-        return candidate;
-    /* c8 ignore stop */
-    return {
-        ...existing,
-        title: existing.title ?? candidate.title,
-        type: existing.type ?? candidate.type,
-        status: existing.status ?? candidate.status,
-    };
-}
-function toGraph(root) {
-    const nodesById = new Map();
-    const edgesByKey = new Map();
-    const pending = [root];
-    while (pending.length > 0) {
-        const node = pending.pop();
-        nodesById.set(node.id, mergeGraphNode(nodesById.get(node.id), {
-            id: node.id,
-            title: node.title,
-            type: node.type,
-            status: node.status,
-            missing: node.missing,
-        }));
-        for (const child of node.dependencies) {
-            nodesById.set(child.id, mergeGraphNode(nodesById.get(child.id), {
-                id: child.id,
-                title: child.title,
-                type: child.type,
-                status: child.status,
-                missing: child.missing,
-            }));
-            /* c8 ignore start -- legacy malformed dependency payloads may omit kind/via. */
-            const relationKind = child.via ?? "related";
-            const edgeKey = `${node.id}::${child.id}::${relationKind}`;
-            if (!edgesByKey.has(edgeKey)) {
-                edgesByKey.set(edgeKey, {
-                    from: node.id,
-                    to: child.id,
-                    kind: relationKind,
-                });
-            }
-            /* c8 ignore stop */
-            if (!child.cycle) {
-                pending.push(child);
-            }
-        }
-    }
-    const nodes = [...nodesById.values()].sort((left, right) => left.id.localeCompare(right.id));
-    const edges = [...edgesByKey.values()].sort((left, right) => {
-        const byFrom = left.from.localeCompare(right.from);
-        if (byFrom !== 0)
-            return byFrom;
-        const byTo = left.to.localeCompare(right.to);
-        if (byTo !== 0)
-            return byTo;
-        return left.kind.localeCompare(right.kind);
-    });
-    const missingIds = nodes
-        .filter((node) => node.missing)
-        .map((node) => node.id);
-    return {
-        root_id: root.id,
-        nodes,
-        edges,
-        missing_ids: missingIds,
-    };
-}
-/** Count a dependency result without allocating its potentially exponential tree payload. */
-function countDependencyGraph(rootId, index, maxDepth) {
-    const nodeIds = new Set();
-    const edgeKeys = new Set();
-    const missingIds = new Set();
-    const expanded = new Set();
-    const pending = [{ id: rootId, depth: 0 }];
-    let pendingIndex = 0;
-    while (pendingIndex < pending.length) {
-        const current = pending[pendingIndex++];
-        const lookupId = current.id.trim().toLowerCase();
-        nodeIds.add(lookupId);
-        const item = index.get(lookupId);
-        if (!item) {
-            missingIds.add(lookupId);
-            continue;
-        }
-        if (maxDepth !== undefined && current.depth >= maxDepth) {
-            continue;
-        }
-        if (expanded.has(lookupId)) {
-            continue;
-        }
-        expanded.add(lookupId);
-        for (const dependency of item.dependencies) {
-            edgeKeys.add(`${lookupId}::${dependency.id.trim().toLowerCase()}::${dependency.kind}`);
-            pending.push({ id: dependency.id, depth: current.depth + 1 });
-        }
-    }
-    return {
-        node_count: nodeIds.size,
-        edge_count: edgeKeys.size,
-        edge_basis: "deduplicated_directed",
-        missing_count: missingIds.size,
-    };
-}
-/** Parse CLI-compatible deps context options once for packet and closure parity. */
-function parseDepsContextOptions(options, registry = createRelationshipKindRegistry()) {
-    const maxDepth = parseMaxDepth(options.maxDepth);
-    const nodeLimit = parsePositiveInteger(options.nodeLimit, "node-limit");
-    const edgeLimit = parsePositiveInteger(options.edgeLimit, "edge-limit");
-    const tokenBudget = parsePositiveInteger(options.tokenBudget, "token-budget");
-    const kinds = parseKinds(options.kind, registry);
-    return {
-        direction: parseDirection(options.direction),
-        ...(kinds === undefined ? {} : { kinds }),
-        ...(maxDepth === undefined ? {} : { maxDepth }),
-        ...(nodeLimit === undefined ? {} : { nodeLimit }),
-        ...(edgeLimit === undefined ? {} : { edgeLimit }),
-        ...(tokenBudget === undefined ? {} : { tokenBudget }),
-        ...(options.cursor?.trim() ? { cursor: options.cursor.trim() } : {}),
-    };
-}
-/** Build one bounded context packet from an assembled deps relationship graph. */
-function buildContextFromAssembly(assembly, rootId, options, rootEvidence) {
-    return buildRelationshipContext(assembly.graph, rootId, assembly.details.map((detail) => detail.id === rootId && rootEvidence.length > 0
-        ? { ...detail, evidence: rootEvidence }
-        : detail), options);
-}
-/** Build the SDK-backed bounded relationship-context projection for deps. */
-export function buildDepsRelationshipContext(rootId, items, options, rootEvidence = []) {
-    const assembly = assembleWorkspaceRelationshipGraph(items);
-    return buildContextFromAssembly(assembly, rootId, parseDepsContextOptions(options, assembly.graph.registry()), rootEvidence);
-}
-/** Append up to `limit` labeled pointers from one linked collection. */
-function appendEvidencePointers(evidence, label, values, limit) {
-    for (const value of values.slice(0, limit)) {
-        const trimmed = value?.trim();
-        if (trimmed)
-            evidence.push(`${label}:${trimmed}`);
-    }
-}
-/**
- * Load bounded root evidence pointers (linked files, tests, docs, and
- * annotation counts) so the context packet answers "where is the proof"
- * without a follow-up item read.
- */
-async function collectRootEvidence(pmRoot, id, settings, typeToFolder) {
-    const located = await locateItem(pmRoot, id, settings.id_prefix, settings.item_format, typeToFolder);
-    // The caller already resolved the root against the light index, so a miss
-    // can only happen when storage mutates mid-read; degrade to no evidence.
-    /* c8 ignore start -- defensive: unreachable without a concurrent delete between the index scan and this read. */
-    if (!located)
-        return [];
-    /* c8 ignore stop */
-    const { document } = await readLocatedItem(located, {
-        schema: settings.schema,
-    });
-    const metadata = document.metadata;
-    const files = metadata.files ?? [];
-    const tests = metadata.tests ?? [];
-    const docs = metadata.docs ?? [];
-    const counts = [
-        ["files", files.length],
-        ["tests", tests.length],
-        ["docs", docs.length],
-        ["comments", (metadata.comments ?? []).length],
-        ["notes", (metadata.notes ?? []).length],
-        ["learnings", (metadata.learnings ?? []).length],
-    ];
-    if (counts.every(([, count]) => count === 0))
-        return [];
-    const evidence = [
-        `linked:${counts.map(([key, count]) => `${key}=${count}`).join(",")}`,
-    ];
-    appendEvidencePointers(evidence, "file", files.map((file) => file.path), 3);
-    appendEvidencePointers(evidence, "test", tests.map((test) => test.command ?? test.path), 2);
-    appendEvidencePointers(evidence, "doc", docs.map((doc) => doc.path), 2);
-    return evidence;
-}
-function createContextDepsResult(params) {
-    const { canonicalId, context, missingCount, missingReferences, referenceLimit, summaryOnly, } = params;
-    return {
-        id: canonicalId,
-        format: "context",
-        node_count: context.nodes.length + 1,
-        edge_count: context.edges.length,
-        edge_basis: "deduplicated_directed",
-        missing_count: missingCount,
-        missing_scope: "traversal",
-        missing_reference_count: missingReferences.length,
-        ...(summaryOnly
-            ? {}
-            : {
-                missing_references: missingReferences.slice(0, referenceLimit),
-                context,
-            }),
-    };
-}
-function includesContextMissingReference(params) {
-    const { row, missingReachableSet, packetIds, filteredKinds, registry } = params;
-    if (row.no_active_blocker_sentinel ||
-        !missingReachableSet.has(row.target_id.trim().toLowerCase()) ||
-        !packetIds.has(row.holder_id)) {
-        return false;
-    }
-    if (filteredKinds === undefined)
-        return true;
-    const definition = registry.resolve(row.kind);
-    return (definition !== undefined &&
-        (filteredKinds.has(definition.kind) ||
-            (definition.inverse !== undefined &&
-                filteredKinds.has(definition.inverse))));
-}
-/**
- * Settle a token count embedded in the payload whose rendered size it
- * describes. The mapping can only change when the decimal digit width changes,
- * so repeatedly embedding the measured value reaches a stable fixed point.
- */
-function settleRenderedTokenCount(result, outputFormat, assign) {
-    let embeddedTokens;
-    for (;;) {
-        const measuredTokens = estimatePmOutputTokens(new TextEncoder().encode(formatBuiltInOutput(attachOutputOmissionReceipt("deps", result), outputFormat)).byteLength);
-        if (measuredTokens === embeddedTokens)
-            return measuredTokens;
-        assign(measuredTokens);
-        embeddedTokens = measuredTokens;
-    }
-}
-/** Identify the context packer's controlled signal that no smaller packet fits. */
-function isContextBudgetFloorError(error) {
-    return (error instanceof TypeError &&
-        error.message.startsWith("Relationship context tokenBudget cannot fit "));
-}
-/**
- * Build one progressively smaller context packet, returning the last rendered
- * result when the context packer reports that no smaller structural packet fits.
- */
-function buildContextAtRenderedBudget(params) {
-    try {
-        return buildContextFromAssembly(params.assembly, params.canonicalId, {
-            ...params.contextOptions,
-            ...(params.internalTokenBudget === undefined
-                ? {}
-                : { tokenBudget: params.internalTokenBudget }),
-        }, params.rootEvidence);
-    }
-    catch (error) {
-        if (params.smallestResult !== undefined &&
-            isContextBudgetFloorError(error)) {
-            return params.smallestResult;
-        }
-        throw error;
-    }
-}
-function enforceContextRenderedTokenBudget(params) {
-    const { assembly, canonicalId, contextOptions, rootEvidence, summaryOnly, outputFormat, missingCount, missingReferences, } = params;
-    const referenceLimit = contextOptions.edgeLimit ?? 40;
-    let emittedReferenceLimit = referenceLimit;
-    let internalTokenBudget = contextOptions.tokenBudget;
-    let requestedTokenBudget;
-    let smallestResult;
-    for (;;) {
-        const contextOrFloor = buildContextAtRenderedBudget({
-            assembly,
-            canonicalId,
-            contextOptions,
-            internalTokenBudget,
-            rootEvidence,
-            smallestResult,
-        });
-        if ("format" in contextOrFloor)
-            return contextOrFloor;
-        const context = contextOrFloor;
-        requestedTokenBudget ??= context.meta.tokenBudget;
-        internalTokenBudget ??= requestedTokenBudget;
-        const result = createContextDepsResult({
-            canonicalId,
-            context,
-            missingCount,
-            missingReferences,
-            referenceLimit: emittedReferenceLimit,
-            summaryOnly,
-        });
-        smallestResult = result;
-        if (summaryOnly)
-            return result;
-        context.meta.tokenBudget = requestedTokenBudget;
-        context.meta.usedTokens = settleRenderedTokenCount(attachDepsProjection(result, false), outputFormat, (tokens) => {
-            context.meta.usedTokens = tokens;
-        });
-        if (context.meta.usedTokens <= requestedTokenBudget)
-            return result;
-        if (emittedReferenceLimit > 0) {
-            emittedReferenceLimit -= 1;
-            continue;
-        }
-        const currentInternalBudget = internalTokenBudget;
-        const scaledInternalBudget = (currentInternalBudget * requestedTokenBudget) / context.meta.usedTokens;
-        internalTokenBudget = Math.min(currentInternalBudget - 1, Math.max(1, Math.floor(scaledInternalBudget * 0.9)));
-    }
-}
-/** Assemble the context-format deps result with traversal-scoped missing enumeration. */
-function buildContextDepsResult(params) {
-    const { assembly, canonicalId, options, rootEvidence, summaryOnly, outputFormat, } = params;
-    const contextOptions = parseDepsContextOptions(options, assembly.graph.registry());
-    const reachable = assembly.graph.closure(canonicalId, {
-        direction: contextOptions.direction,
-        ...(contextOptions.kinds === undefined
-            ? {}
-            : { kinds: contextOptions.kinds }),
-        maxDepth: contextOptions.maxDepth ?? 3,
-    });
-    const missingReachable = reachable.value.filter((nodeId) => assembly.missingIdSet.has(nodeId.toLowerCase()));
-    const missingReachableSet = new Set(missingReachable.map((nodeId) => nodeId.toLowerCase()));
-    const relationshipRegistry = assembly.graph.registry();
-    const filteredKinds = contextOptions.kinds
-        ? new Set(contextOptions.kinds.map((kind) => relationshipRegistry.require(kind).kind))
-        : undefined;
-    const packetIds = new Set([canonicalId, ...reachable.value]);
-    const missingReferences = [
-        ...assembly.dangling.active,
-        ...assembly.dangling.legacy_terminal,
-    ].filter((row) => includesContextMissingReference({
-        row,
-        missingReachableSet,
-        packetIds,
-        filteredKinds,
-        registry: relationshipRegistry,
-    }));
-    return enforceContextRenderedTokenBudget({
-        assembly,
-        canonicalId,
-        contextOptions,
-        rootEvidence,
-        summaryOnly,
-        outputFormat,
-        missingCount: missingReachable.length,
-        missingReferences,
-    });
-}
-function trimDeepestDependency(tree) {
-    const pending = [tree];
-    let parentToTrim;
-    while (pending.length > 0) {
-        const current = pending.pop();
-        if (current.dependencies.length > 0) {
-            parentToTrim = current;
-            pending.push(...current.dependencies);
-        }
-    }
-    if (!parentToTrim)
-        return false;
-    parentToTrim.dependencies.pop();
-    parentToTrim.truncated = true;
-    return true;
-}
-function buildTreeOrGraphDepsResult(id, format, options, index, maxDepth, collapse, outputFormat) {
-    const effectiveMaxDepth = maxDepth ?? DEFAULT_DEPS_TREE_MAX_DEPTH;
-    const nodeLimit = parsePositiveInteger(options.nodeLimit, "node-limit") ??
-        DEFAULT_DEPS_TREE_NODE_LIMIT;
-    const edgeLimit = parsePositiveInteger(options.edgeLimit, "edge-limit") ??
-        DEFAULT_DEPS_TREE_EDGE_LIMIT;
-    const tokenBudget = parsePositiveInteger(options.tokenBudget, "token-budget") ??
-        DEFAULT_DEPS_TREE_TOKEN_BUDGET;
-    const budget = {
-        nodeLimit,
-        edgeLimit,
-        tokenBudget,
-        nodes: 0,
-        edges: 0,
-        estimatedTokens: 0,
-        reasons: new Set(),
-    };
-    const tree = toTreeNode(id, index, new Set(), effectiveMaxDepth, format === "graph" ? "repeated" : collapse, new Set(), budget);
-    const totals = countDependencyGraph(id, index, undefined);
-    let result;
-    for (;;) {
-        const graph = toGraph(tree);
-        const truncation = budget.reasons.size === 0
-            ? undefined
-            : {
-                reasons: [...budget.reasons].sort(),
-                limits: {
-                    max_depth: effectiveMaxDepth,
-                    node_limit: nodeLimit,
-                    edge_limit: edgeLimit,
-                    token_budget: tokenBudget,
-                },
-                estimated_tokens: 0,
-                total_node_count: totals.node_count,
-                total_edge_count: totals.edge_count,
-                omitted_node_count: Math.max(0, totals.node_count - graph.nodes.length),
-                omitted_edge_count: Math.max(0, totals.edge_count - graph.edges.length),
-            };
-        const baseResult = {
-            id,
-            format,
-            node_count: graph.nodes.length,
-            edge_count: graph.edges.length,
-            edge_basis: "deduplicated_directed",
-            missing_count: graph.missing_ids.length,
-            ...(truncation ? { truncation } : {}),
-        };
-        result =
-            format === "tree" ? { ...baseResult, tree } : { ...baseResult, graph };
-        const settledTokens = result.truncation === undefined
-            ? estimatePmOutputTokens(new TextEncoder().encode(formatBuiltInOutput(attachOutputOmissionReceipt("deps", attachDepsProjection(result, false)), outputFormat)).byteLength)
-            : settleRenderedTokenCount(attachDepsProjection(result, false), outputFormat, (tokens) => {
-                result.truncation.estimated_tokens = tokens;
-            });
-        if (settledTokens <= tokenBudget) {
-            return result;
-        }
-        if (!trimDeepestDependency(tree)) {
-            budget.reasons.add("token_budget");
-            return result;
-        }
-        budget.reasons.add("token_budget");
-    }
-}
-function attachDepsProjection(result, summaryOnly, legacyAliasCounts = {}) {
-    const group = {
-        name: result.format === "tree"
-            ? "dependency_tree"
-            : result.format === "graph"
-                ? "dependency_graph"
-                : "relationship_context",
-        restore_with: "--full",
-    };
-    return {
-        ...result,
-        legacy_alias_counts: legacyAliasCounts,
-        projection: {
-            mode: summaryOnly ? "summary" : "full",
-            declared_field_groups: [group],
-            included_field_groups: summaryOnly ? [] : [group.name],
-        },
-    };
-}
-/** Implements run deps for the public runtime surface of this module. */
-export async function runDeps(id, options, global) {
-    const pmRoot = resolvePmRoot(process.cwd(), global.path);
-    await assertInitializedTracker(pmRoot);
-    const format = parseFormat(options.format);
-    const maxDepth = parseMaxDepth(options.maxDepth);
-    const collapse = parseCollapse(options.collapse);
-    assertProjectionModeChoice(options.summary === true, options.full === true, "--summary");
-    const summaryOnly = options.summary === true;
-    const settings = await readSettings(pmRoot);
-    const typeRegistry = resolveItemTypeRegistry(settings, getActiveExtensionRegistrations());
-    const items = await listAllItemMetadataLight(pmRoot, settings.item_format, typeRegistry.type_to_folder, undefined, settings.schema);
-    const statusRegistry = resolveRuntimeStatusRegistry(settings.schema);
-    const index = new Map(items.map((item) => [item.id.trim().toLowerCase(), toIndexedItem(item)]));
-    const dangling = collectDanglingDependencyReferences(items, (status) => isTerminalStatus(status, statusRegistry));
-    for (const reference of [...dangling.active, ...dangling.legacy_terminal]) {
-        const holder = index.get(reference.holder_id.trim().toLowerCase());
-        const referenceKind = reference.kind.trim().toLowerCase();
-        if (holder &&
-            !holder.dependencies.some((dependency) => dependency.id.trim().toLowerCase() ===
-                reference.target_id.trim().toLowerCase() &&
-                dependency.kind === referenceKind)) {
-            holder.dependencies.push({
-                id: reference.target_id,
-                kind: referenceKind,
-            });
-        }
-    }
-    if (!index.has(id.trim().toLowerCase())) {
-        throw new PmCliError(`Item ${id} not found`, EXIT_CODE.NOT_FOUND);
-    }
-    if (format === "context") {
-        const canonicalId = index.get(id.trim().toLowerCase()).id;
-        const rootEvidence = summaryOnly
-            ? []
-            : await collectRootEvidence(pmRoot, canonicalId, settings, typeRegistry.type_to_folder);
-        const isTerminal = (status) => isTerminalStatus(status, statusRegistry);
-        const relationshipRegistry = resolveWorkspaceRelationshipKindRegistry();
-        // Reuse the fingerprint-keyed shared cache so bounded context packets in
-        // long-lived hosts stop paying full-workspace assembly on every call.
-        const lookup = workspaceGraphCache().lookup(pmRoot, computeWorkspaceGraphFingerprint(items, isTerminal, relationshipRegistry), () => assembleWorkspaceRelationshipGraph(items, isTerminal, relationshipRegistry));
-        return attachDepsProjection(buildContextDepsResult({
-            assembly: lookup.assembly,
-            canonicalId,
-            options,
-            rootEvidence,
-            summaryOnly,
-            outputFormat: global.json === true ? "json" : "toon",
-        }), summaryOnly, lookup.assembly.legacyAliasCounts);
-    }
-    if (summaryOnly) {
-        return attachDepsProjection({
-            id,
-            format,
-            ...countDependencyGraph(id, index, maxDepth),
-        }, true, Object.fromEntries(Object.entries(assembleWorkspaceRelationshipGraph(items, (status) => isTerminalStatus(status, statusRegistry)).legacyAliasCounts)));
-    }
-    return attachDepsProjection(buildTreeOrGraphDepsResult(id, format, options, index, maxDepth, collapse, global.json === true ? "json" : "toon"), false, Object.fromEntries(Object.entries(assembleWorkspaceRelationshipGraph(items, (status) => isTerminalStatus(status, statusRegistry)).legacyAliasCounts)));
-}
+!(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]="2f2a7df8-9c95-5ed1-bd43-33dde57dd7f0")}catch(e2){}})();import{assertInitializedTracker}from"./environment/tracker-preflight.js";import{getActiveExtensionRegistrations}from"../core/extensions/index.js";import{resolveItemTypeRegistry}from"../core/item/type-registry.js";import{isTerminalStatus}from"../core/item/status.js";import{resolveRuntimeStatusRegistry}from"../core/schema/runtime-schema.js";import{EXIT_CODE}from"../core/shared/constants.js";import{PmCliError}from"../core/shared/errors.js";import{formatBuiltInOutput}from"../core/output/output.js";import{listAllItemMetadataLight,locateItem,readLocatedItem}from"../core/store/item-store.js";import{resolvePmRoot}from"../core/store/paths.js";import{readSettings}from"../core/store/settings.js";import{estimatePmOutputTokens}from"./cli-contracts/agent-output-contracts.js";import{assertProjectionModeChoice,attachOutputOmissionReceipt}from"./output-projection.js";import{assembleWorkspaceRelationshipGraph,collectDanglingDependencyReferences,resolveWorkspaceRelationshipKindRegistry}from"./graph/assembly.js";import{computeWorkspaceGraphFingerprint,workspaceGraphCache}from"./graph/cache.js";import{buildRelationshipContext}from"./relationship-context.js";import{createRelationshipKindRegistry}from"./relationships.js";const DEPS_FORMAT_VALUES=["tree","graph","context"];const DEPS_COLLAPSE_VALUES=["none","repeated"];const DEPS_DIRECTION_VALUES=["outgoing","incoming","both"];const DEFAULT_DEPS_TREE_MAX_DEPTH=32;const DEFAULT_DEPS_TREE_NODE_LIMIT=200;const DEFAULT_DEPS_TREE_EDGE_LIMIT=400;const DEFAULT_DEPS_TREE_TOKEN_BUDGET=16e3;function parseFormat(raw){const candidate=raw?.trim().toLowerCase()??"tree";if(DEPS_FORMAT_VALUES.includes(candidate)){return candidate}throw new PmCliError(`Invalid --format value "${raw}". Use "tree", "graph", or "context".`,EXIT_CODE.USAGE)}function parsePositiveInteger(raw,flag){if(raw===void 0)return void 0;const value=typeof raw==="number"?raw:Number(raw.trim());if(!Number.isInteger(value)||value<1)throw new PmCliError(`Invalid --${flag} value "${raw}". Use a positive integer.`,EXIT_CODE.USAGE);return value}function parseMaxDepth(raw){if(raw===void 0){return void 0}const normalized=typeof raw==="number"?raw:Number(raw.trim());if(!Number.isInteger(normalized)||normalized<0){throw new PmCliError(`Invalid --max-depth value "${raw}". Use a non-negative integer.`,EXIT_CODE.USAGE)}return normalized}function parseCollapse(raw){const candidate=raw?.trim().toLowerCase()??"none";if(DEPS_COLLAPSE_VALUES.includes(candidate)){return candidate}throw new PmCliError(`Invalid --collapse value "${raw}". Use "none" or "repeated".`,EXIT_CODE.USAGE)}function parseDirection(raw){const candidate=raw?.trim().toLowerCase()??"both";if(DEPS_DIRECTION_VALUES.includes(candidate)){return candidate}throw new PmCliError(`Invalid --direction value "${raw}". Use "outgoing", "incoming", or "both".`,EXIT_CODE.USAGE)}function parseKinds(raw,registry=createRelationshipKindRegistry()){if(raw===void 0)return void 0;const values=(Array.isArray(raw)?raw:[raw]).flatMap(value=>value.split(",")).map(value=>value.trim()).filter(value=>value.length>0);if(values.length===0)return void 0;const kinds=new Set;for(const value of values){const definition=registry.resolve(value);if(!definition){const known=registry.list().map(entry=>entry.kind).join(", ");throw new PmCliError(`Invalid --kind value "${value}". Registered kinds: ${known}.`,EXIT_CODE.USAGE)}kinds.add(definition.kind)}return[...kinds].sort()}function normalizeDependencies(dependencies){if(!dependencies||dependencies.length===0){return[]}const sorted=dependencies.map(({id,kind})=>({id:id.trim(),kind:kind.trim().toLowerCase()})).sort((left,right)=>{const byKind=left.kind.localeCompare(right.kind);if(byKind!==0)return byKind;return left.id.localeCompare(right.id)});const deduped=new Map;for(const dependency of sorted){const key=`${dependency.kind.toLowerCase()}::${dependency.id.toLowerCase()}`;if(!deduped.has(key)){deduped.set(key,{id:dependency.id,kind:dependency.kind})}}return[...deduped.values()]}function toIndexedItem(item){return{id:item.id,title:item.title,type:item.type,status:item.status,dependencies:normalizeDependencies(item.dependencies)}}function estimateTreeNodeTokens(node){return estimatePmOutputTokens(new TextEncoder().encode(JSON.stringify({...node,dependencies:void 0})).byteLength)}function appendTreeDependencies(baseNode,item,index,nextLineage,maxDepth,collapse,expanded,budget,depth){for(const dependency of item.dependencies){const edgeTokens=Math.max(1,Math.ceil(JSON.stringify({from:baseNode.id,to:dependency.id,kind:dependency.kind}).length/3));if(budget.nodes>=budget.nodeLimit){baseNode.truncated=true;budget.reasons.add("node_limit");break}if(budget.edges>=budget.edgeLimit){baseNode.truncated=true;budget.reasons.add("edge_limit");break}if(budget.estimatedTokens+edgeTokens>=budget.tokenBudget){baseNode.truncated=true;budget.reasons.add("token_budget");break}budget.edges+=1;budget.estimatedTokens+=edgeTokens;baseNode.dependencies.push(toTreeNode(dependency.id,index,nextLineage,maxDepth,collapse,expanded,budget,depth+1,dependency.kind))}}function shouldStopTreeNodeExpansion(node,item,lookupId,maxDepth,collapse,expanded,budget,depth){if(budget.estimatedTokens>=budget.tokenBudget&&item?.dependencies.length){node.truncated=true;budget.reasons.add("token_budget");return true}if(!item||node.cycle){return true}if(maxDepth!==void 0&&depth>=maxDepth){if(item.dependencies.length>0){node.truncated=true;budget.reasons.add("max_depth")}return true}if(collapse==="repeated"&&expanded.has(lookupId)){node.collapsed=true;return true}return false}function toTreeNode(id,index,lineage,maxDepth,collapse,expanded,budget,depth=0,via){const lookupId=id.trim().toLowerCase();const item=index.get(lookupId);const baseNode={id:item?.id??id,title:item?.title,type:item?.type,status:item?.status,via,missing:!item,cycle:lineage.has(lookupId),dependencies:[]};budget.nodes+=1;budget.estimatedTokens+=estimateTreeNodeTokens(baseNode);if(shouldStopTreeNodeExpansion(baseNode,item,lookupId,maxDepth,collapse,expanded,budget,depth)){return baseNode}if(collapse==="repeated"){expanded.add(lookupId)}const nextLineage=new Set(lineage);nextLineage.add(lookupId);appendTreeDependencies(baseNode,item,index,nextLineage,maxDepth,collapse,expanded,budget,depth);return baseNode}function mergeGraphNode(existing,candidate){if(!existing){return candidate}if(existing.missing&&!candidate.missing)return candidate;return{...existing,title:existing.title??candidate.title,type:existing.type??candidate.type,status:existing.status??candidate.status}}function toGraph(root){const nodesById=new Map;const edgesByKey=new Map;const pending=[root];while(pending.length>0){const node=pending.pop();nodesById.set(node.id,mergeGraphNode(nodesById.get(node.id),{id:node.id,title:node.title,type:node.type,status:node.status,missing:node.missing}));for(const child of node.dependencies){nodesById.set(child.id,mergeGraphNode(nodesById.get(child.id),{id:child.id,title:child.title,type:child.type,status:child.status,missing:child.missing}));const relationKind=child.via??"related";const edgeKey=`${node.id}::${child.id}::${relationKind}`;if(!edgesByKey.has(edgeKey)){edgesByKey.set(edgeKey,{from:node.id,to:child.id,kind:relationKind})}if(!child.cycle){pending.push(child)}}}const nodes=[...nodesById.values()].sort((left,right)=>left.id.localeCompare(right.id));const edges=[...edgesByKey.values()].sort((left,right)=>{const byFrom=left.from.localeCompare(right.from);if(byFrom!==0)return byFrom;const byTo=left.to.localeCompare(right.to);if(byTo!==0)return byTo;return left.kind.localeCompare(right.kind)});const missingIds=nodes.filter(node=>node.missing).map(node=>node.id);return{root_id:root.id,nodes,edges,missing_ids:missingIds}}function countDependencyGraph(rootId,index,maxDepth){const nodeIds=new Set;const edgeKeys=new Set;const missingIds=new Set;const expanded=new Set;const pending=[{id:rootId,depth:0}];let pendingIndex=0;while(pendingIndex<pending.length){const current=pending[pendingIndex++];const lookupId=current.id.trim().toLowerCase();nodeIds.add(lookupId);const item=index.get(lookupId);if(!item){missingIds.add(lookupId);continue}if(maxDepth!==void 0&&current.depth>=maxDepth){continue}if(expanded.has(lookupId)){continue}expanded.add(lookupId);for(const dependency of item.dependencies){edgeKeys.add(`${lookupId}::${dependency.id.trim().toLowerCase()}::${dependency.kind}`);pending.push({id:dependency.id,depth:current.depth+1})}}return{node_count:nodeIds.size,edge_count:edgeKeys.size,edge_basis:"deduplicated_directed",missing_count:missingIds.size}}function parseDepsContextOptions(options,registry=createRelationshipKindRegistry()){const maxDepth=parseMaxDepth(options.maxDepth);const nodeLimit=parsePositiveInteger(options.nodeLimit,"node-limit");const edgeLimit=parsePositiveInteger(options.edgeLimit,"edge-limit");const tokenBudget=parsePositiveInteger(options.tokenBudget,"token-budget");const kinds=parseKinds(options.kind,registry);return{direction:parseDirection(options.direction),...kinds===void 0?{}:{kinds},...maxDepth===void 0?{}:{maxDepth},...nodeLimit===void 0?{}:{nodeLimit},...edgeLimit===void 0?{}:{edgeLimit},...tokenBudget===void 0?{}:{tokenBudget},...options.cursor?.trim()?{cursor:options.cursor.trim()}:{}}}function buildContextFromAssembly(assembly,rootId,options,rootEvidence){return buildRelationshipContext(assembly.graph,rootId,assembly.details.map(detail=>detail.id===rootId&&rootEvidence.length>0?{...detail,evidence:rootEvidence}:detail),options)}function buildDepsRelationshipContext(rootId,items,options,rootEvidence=[]){const assembly=assembleWorkspaceRelationshipGraph(items);return buildContextFromAssembly(assembly,rootId,parseDepsContextOptions(options,assembly.graph.registry()),rootEvidence)}function appendEvidencePointers(evidence,label,values,limit){for(const value of values.slice(0,limit)){const trimmed=value?.trim();if(trimmed)evidence.push(`${label}:${trimmed}`)}}async function collectRootEvidence(pmRoot,id,settings,typeToFolder){const located=await locateItem(pmRoot,id,settings.id_prefix,settings.item_format,typeToFolder);if(!located)return[];const{document}=await readLocatedItem(located,{schema:settings.schema});const metadata=document.metadata;const files=metadata.files??[];const tests=metadata.tests??[];const docs=metadata.docs??[];const counts=[["files",files.length],["tests",tests.length],["docs",docs.length],["comments",(metadata.comments??[]).length],["notes",(metadata.notes??[]).length],["learnings",(metadata.learnings??[]).length]];if(counts.every(([,count])=>count===0))return[];const evidence=[`linked:${counts.map(([key,count])=>`${key}=${count}`).join(",")}`];appendEvidencePointers(evidence,"file",files.map(file=>file.path),3);appendEvidencePointers(evidence,"test",tests.map(test=>test.command??test.path),2);appendEvidencePointers(evidence,"doc",docs.map(doc=>doc.path),2);return evidence}function createContextDepsResult(params){const{canonicalId,context,missingCount,missingReferences,referenceLimit,summaryOnly}=params;return{id:canonicalId,format:"context",node_count:context.nodes.length+1,edge_count:context.edges.length,edge_basis:"deduplicated_directed",missing_count:missingCount,missing_scope:"traversal",missing_reference_count:missingReferences.length,...summaryOnly?{}:{missing_references:missingReferences.slice(0,referenceLimit),context}}}function includesContextMissingReference(params){const{row,missingReachableSet,packetIds,filteredKinds,registry}=params;if(row.no_active_blocker_sentinel||!missingReachableSet.has(row.target_id.trim().toLowerCase())||!packetIds.has(row.holder_id)){return false}if(filteredKinds===void 0)return true;const definition=registry.resolve(row.kind);return definition!==void 0&&(filteredKinds.has(definition.kind)||definition.inverse!==void 0&&filteredKinds.has(definition.inverse))}function settleRenderedTokenCount(result,outputFormat,assign){let embeddedTokens;for(;;){const measuredTokens=estimatePmOutputTokens(new TextEncoder().encode(formatBuiltInOutput(attachOutputOmissionReceipt("deps",result),outputFormat)).byteLength);if(measuredTokens===embeddedTokens)return measuredTokens;assign(measuredTokens);embeddedTokens=measuredTokens}}function isContextBudgetFloorError(error){return error instanceof TypeError&&error.message.startsWith("Relationship context tokenBudget cannot fit ")}function buildContextAtRenderedBudget(params){try{return buildContextFromAssembly(params.assembly,params.canonicalId,{...params.contextOptions,...params.internalTokenBudget===void 0?{}:{tokenBudget:params.internalTokenBudget}},params.rootEvidence)}catch(error){if(params.smallestResult!==void 0&&isContextBudgetFloorError(error)){return params.smallestResult}throw error}}function enforceContextRenderedTokenBudget(params){const{assembly,canonicalId,contextOptions,rootEvidence,summaryOnly,outputFormat,missingCount,missingReferences}=params;const referenceLimit=contextOptions.edgeLimit??40;let emittedReferenceLimit=referenceLimit;let internalTokenBudget=contextOptions.tokenBudget;let requestedTokenBudget;let smallestResult;for(;;){const contextOrFloor=buildContextAtRenderedBudget({assembly,canonicalId,contextOptions,internalTokenBudget,rootEvidence,smallestResult});if("format"in contextOrFloor)return contextOrFloor;const context=contextOrFloor;requestedTokenBudget??=context.meta.tokenBudget;internalTokenBudget??=requestedTokenBudget;const result=createContextDepsResult({canonicalId,context,missingCount,missingReferences,referenceLimit:emittedReferenceLimit,summaryOnly});smallestResult=result;if(summaryOnly)return result;context.meta.tokenBudget=requestedTokenBudget;context.meta.usedTokens=settleRenderedTokenCount(attachDepsProjection(result,false),outputFormat,tokens=>{context.meta.usedTokens=tokens});if(context.meta.usedTokens<=requestedTokenBudget)return result;if(emittedReferenceLimit>0){emittedReferenceLimit-=1;continue}const currentInternalBudget=internalTokenBudget;const scaledInternalBudget=currentInternalBudget*requestedTokenBudget/context.meta.usedTokens;internalTokenBudget=Math.min(currentInternalBudget-1,Math.max(1,Math.floor(scaledInternalBudget*.9)))}}function buildContextDepsResult(params){const{assembly,canonicalId,options,rootEvidence,summaryOnly,outputFormat}=params;const contextOptions=parseDepsContextOptions(options,assembly.graph.registry());const reachable=assembly.graph.closure(canonicalId,{direction:contextOptions.direction,...contextOptions.kinds===void 0?{}:{kinds:contextOptions.kinds},maxDepth:contextOptions.maxDepth??3});const missingReachable=reachable.value.filter(nodeId=>assembly.missingIdSet.has(nodeId.toLowerCase()));const missingReachableSet=new Set(missingReachable.map(nodeId=>nodeId.toLowerCase()));const relationshipRegistry=assembly.graph.registry();const filteredKinds=contextOptions.kinds?new Set(contextOptions.kinds.map(kind=>relationshipRegistry.require(kind).kind)):void 0;const packetIds=new Set([canonicalId,...reachable.value]);const missingReferences=[...assembly.dangling.active,...assembly.dangling.legacy_terminal].filter(row=>includesContextMissingReference({row,missingReachableSet,packetIds,filteredKinds,registry:relationshipRegistry}));return enforceContextRenderedTokenBudget({assembly,canonicalId,contextOptions,rootEvidence,summaryOnly,outputFormat,missingCount:missingReachable.length,missingReferences})}function trimDeepestDependency(tree){const pending=[tree];let parentToTrim;while(pending.length>0){const current=pending.pop();if(current.dependencies.length>0){parentToTrim=current;pending.push(...current.dependencies)}}if(!parentToTrim)return false;parentToTrim.dependencies.pop();parentToTrim.truncated=true;return true}function buildTreeOrGraphDepsResult(id,format,options,index,maxDepth,collapse,outputFormat){const effectiveMaxDepth=maxDepth??DEFAULT_DEPS_TREE_MAX_DEPTH;const nodeLimit=parsePositiveInteger(options.nodeLimit,"node-limit")??DEFAULT_DEPS_TREE_NODE_LIMIT;const edgeLimit=parsePositiveInteger(options.edgeLimit,"edge-limit")??DEFAULT_DEPS_TREE_EDGE_LIMIT;const tokenBudget=parsePositiveInteger(options.tokenBudget,"token-budget")??DEFAULT_DEPS_TREE_TOKEN_BUDGET;const budget={nodeLimit,edgeLimit,tokenBudget,nodes:0,edges:0,estimatedTokens:0,reasons:new Set};const tree=toTreeNode(id,index,new Set,effectiveMaxDepth,format==="graph"?"repeated":collapse,new Set,budget);const totals=countDependencyGraph(id,index,void 0);let result;for(;;){const graph=toGraph(tree);const truncation=budget.reasons.size===0?void 0:{reasons:[...budget.reasons].sort(),limits:{max_depth:effectiveMaxDepth,node_limit:nodeLimit,edge_limit:edgeLimit,token_budget:tokenBudget},estimated_tokens:0,total_node_count:totals.node_count,total_edge_count:totals.edge_count,omitted_node_count:Math.max(0,totals.node_count-graph.nodes.length),omitted_edge_count:Math.max(0,totals.edge_count-graph.edges.length)};const baseResult={id,format,node_count:graph.nodes.length,edge_count:graph.edges.length,edge_basis:"deduplicated_directed",missing_count:graph.missing_ids.length,...truncation?{truncation}:{}};result=format==="tree"?{...baseResult,tree}:{...baseResult,graph};const settledTokens=result.truncation===void 0?estimatePmOutputTokens(new TextEncoder().encode(formatBuiltInOutput(attachOutputOmissionReceipt("deps",attachDepsProjection(result,false)),outputFormat)).byteLength):settleRenderedTokenCount(attachDepsProjection(result,false),outputFormat,tokens=>{result.truncation.estimated_tokens=tokens});if(settledTokens<=tokenBudget){return result}if(!trimDeepestDependency(tree)){budget.reasons.add("token_budget");return result}budget.reasons.add("token_budget")}}function attachDepsProjection(result,summaryOnly,legacyAliasCounts={}){const group={name:result.format==="tree"?"dependency_tree":result.format==="graph"?"dependency_graph":"relationship_context",restore_with:"--full"};return{...result,legacy_alias_counts:legacyAliasCounts,projection:{mode:summaryOnly?"summary":"full",declared_field_groups:[group],included_field_groups:summaryOnly?[]:[group.name]}}}async function runDeps(id,options,global2){const pmRoot=resolvePmRoot(process.cwd(),global2.path);await assertInitializedTracker(pmRoot);const format=parseFormat(options.format);const maxDepth=parseMaxDepth(options.maxDepth);const collapse=parseCollapse(options.collapse);assertProjectionModeChoice(options.summary===true,options.full===true,"--summary");const summaryOnly=options.summary===true;const settings=await readSettings(pmRoot);const typeRegistry=resolveItemTypeRegistry(settings,getActiveExtensionRegistrations());const items=await listAllItemMetadataLight(pmRoot,settings.item_format,typeRegistry.type_to_folder,void 0,settings.schema);const statusRegistry=resolveRuntimeStatusRegistry(settings.schema);const index=new Map(items.map(item=>[item.id.trim().toLowerCase(),toIndexedItem(item)]));const dangling=collectDanglingDependencyReferences(items,status=>isTerminalStatus(status,statusRegistry));for(const reference of[...dangling.active,...dangling.legacy_terminal]){const holder=index.get(reference.holder_id.trim().toLowerCase());const referenceKind=reference.kind.trim().toLowerCase();if(holder&&!holder.dependencies.some(dependency=>dependency.id.trim().toLowerCase()===reference.target_id.trim().toLowerCase()&&dependency.kind===referenceKind)){holder.dependencies.push({id:reference.target_id,kind:referenceKind})}}if(!index.has(id.trim().toLowerCase())){throw new PmCliError(`Item ${id} not found`,EXIT_CODE.NOT_FOUND)}if(format==="context"){const canonicalId=index.get(id.trim().toLowerCase()).id;const rootEvidence=summaryOnly?[]:await collectRootEvidence(pmRoot,canonicalId,settings,typeRegistry.type_to_folder);const isTerminal=status=>isTerminalStatus(status,statusRegistry);const relationshipRegistry=resolveWorkspaceRelationshipKindRegistry();const lookup=workspaceGraphCache().lookup(pmRoot,computeWorkspaceGraphFingerprint(items,isTerminal,relationshipRegistry),()=>assembleWorkspaceRelationshipGraph(items,isTerminal,relationshipRegistry));return attachDepsProjection(buildContextDepsResult({assembly:lookup.assembly,canonicalId,options,rootEvidence,summaryOnly,outputFormat:global2.json===true?"json":"toon"}),summaryOnly,lookup.assembly.legacyAliasCounts)}if(summaryOnly){return attachDepsProjection({id,format,...countDependencyGraph(id,index,maxDepth)},true,Object.fromEntries(Object.entries(assembleWorkspaceRelationshipGraph(items,status=>isTerminalStatus(status,statusRegistry)).legacyAliasCounts)))}return attachDepsProjection(buildTreeOrGraphDepsResult(id,format,options,index,maxDepth,collapse,global2.json===true?"json":"toon"),false,Object.fromEntries(Object.entries(assembleWorkspaceRelationshipGraph(items,status=>isTerminalStatus(status,statusRegistry)).legacyAliasCounts)))}export{DEPS_COLLAPSE_VALUES,DEPS_DIRECTION_VALUES,DEPS_FORMAT_VALUES,buildDepsRelationshipContext,parseDirection,parseKinds,parseMaxDepth,parsePositiveInteger,runDeps};
 //# sourceMappingURL=dependencies.js.map
-//# debugId=74a825f3-1301-5dc5-a887-c6ff68f6d7ec