@unbrained/pm-cli 2026.9.7 → 2026.9.9

package/dist/sdk/graph/assembly.js

@@ -1,378 +1,2 @@
-
-!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]="e04a91fa-4625-50fd-9bfd-c712126baf0d")}catch(e){}}();
-import { RelationshipGraph, } from "../relationships.js";
-import { isExternalDependencyReference, isExternalDependencySourceKind, } from "../dependency-provenance.js";
-import { analyzeHierarchyIntegrity, } from "./hierarchy-integrity.js";
-import { resolveWorkspaceRelationshipKindRegistry } from "./workspace-relationship-kind-registry.js";
-export { resolveWorkspaceRelationshipKindRegistry } from "./workspace-relationship-kind-registry.js";
-/** Normalize a decoded reference target and reject empty legacy placeholders. */
-function normalizeDependencyReferenceTarget(target) {
-    if (typeof target !== "string")
-        return undefined;
-    const normalized = target.trim();
-    if (!normalized ||
-        ["none", "null", "n/a", "na"].includes(normalized.toLowerCase()))
-        return undefined;
-    return normalized;
-}
-/** Normalize a graph target while removing the historical no-blocker marker. */
-export function normalizeDependencyGraphTarget(target) {
-    const normalized = normalizeDependencyReferenceTarget(target);
-    return normalized?.toLowerCase() === "no-active-blocker"
-        ? undefined
-        : normalized;
-}
-/** Return whether edge provenance assigns a normalized target to the external graph namespace. */
-function isExternalGraphReference(target, sourceKind, externalAllowed = true) {
-    const normalized = normalizeDependencyReferenceTarget(target);
-    return (externalAllowed &&
-        (isExternalDependencySourceKind(sourceKind) ||
-            (normalized !== undefined && isExternalDependencyReference(normalized))));
-}
-/** Build a namespace-aware reference identity: local ids are case-folded while external locators retain case. */
-function dependencyReferenceIdentityKey(target, sourceKind) {
-    return isExternalGraphReference(target, sourceKind)
-        ? `external\u0000${target}`
-        : `local\u0000${target.toLowerCase()}`;
-}
-/** Resolve one normalized edge target through the namespace selected by its provenance. */
-function resolveGraphReferenceTarget(target, sourceKind, canonicalIds, externalGraphIds) {
-    return isExternalGraphReference(target, sourceKind)
-        ? externalGraphIds.get(target)
-        : canonicalIds.get(target.toLowerCase());
-}
-/** Compare text case-insensitively with an exact-spelling deterministic tie-breaker. */
-function compareCaseFoldedText(left, right) {
-    const normalizedLeft = left.toLowerCase();
-    const normalizedRight = right.toLowerCase();
-    if (normalizedLeft !== normalizedRight)
-        return normalizedLeft < normalizedRight ? -1 : 1;
-    if (left !== right)
-        return left < right ? -1 : 1;
-    return 0;
-}
-/** Count one holder's dependency rows by their case-insensitive kind-plus-target identity. */
-function countDependencyRowIdentities(item) {
-    const occurrences = new Map();
-    for (const dependency of item.dependencies ?? []) {
-        if (typeof dependency !== "object" || dependency === null)
-            continue;
-        const legacyDependency = dependency;
-        const target = normalizeDependencyReferenceTarget(legacyDependency.id);
-        if (!target)
-            continue;
-        const kind = typeof legacyDependency.kind === "string"
-            ? legacyDependency.kind
-            : "related";
-        const key = `${kind}\u0000${dependencyReferenceIdentityKey(target, legacyDependency.source_kind)}`;
-        const existing = occurrences.get(key);
-        if (existing)
-            existing.count += 1;
-        else
-            occurrences.set(key, { target_id: target, kind, count: 1 });
-    }
-    return occurrences;
-}
-/**
- * Collect raw stored dependency rows whose exact identity — holder, kind, and
- * case-insensitive target — appears more than once on one item. Graph
- * construction deduplicates these by edge identity, so the assembled graph and
- * every projection built on it cannot see them; this pre-assembly scan is the
- * only surface that reports the storage-layer defect.
- */
-export function collectDuplicateDependencyRows(items, isTerminal = (status) => status === "closed" || status === "canceled") {
-    const rows = [];
-    for (const item of items) {
-        if (typeof item?.id !== "string" || item.id.trim().length === 0)
-            continue;
-        for (const entry of countDependencyRowIdentities(item).values()) {
-            if (entry.count < 2)
-                continue;
-            rows.push({
-                holder_id: item.id.trim(),
-                target_id: entry.target_id,
-                kind: entry.kind,
-                occurrences: entry.count,
-                holder_status: item.status,
-                legacy_terminal: isTerminal(item.status),
-            });
-        }
-    }
-    return rows.sort((left, right) => {
-        const holderCompare = compareCaseFoldedText(left.holder_id, right.holder_id);
-        if (holderCompare !== 0)
-            return holderCompare;
-        const targetCompare = compareCaseFoldedText(left.target_id, right.target_id);
-        if (targetCompare !== 0)
-            return targetCompare;
-        return compareCaseFoldedText(left.kind, right.kind);
-    });
-}
-/** Decode one dependency row only when it contradicts the holder's scalar blocker. */
-function decodeOrderingStorageContradiction(item, blocker, dependency, isTerminal, registry) {
-    if (typeof dependency !== "object" || dependency === null)
-        return undefined;
-    const target = normalizeDependencyReferenceTarget(dependency.id);
-    if (!target ||
-        dependencyReferenceIdentityKey(target, dependency.source_kind) !==
-            dependencyReferenceIdentityKey(blocker))
-        return undefined;
-    const definition = registry.resolve(typeof dependency.kind === "string" ? dependency.kind : "related");
-    if (definition?.ordering !== true ||
-        (definition.precedence ?? "source_before_target") !== "source_before_target")
-        return undefined;
-    return {
-        holder_id: item.id.trim(),
-        target_id: target,
-        dependency_kind: definition.kind,
-        holder_status: item.status,
-        legacy_terminal: isTerminal(item.status),
-    };
-}
-/**
- * Collect storage rows where `blocked_by: target` places the target before the
- * holder while a same-target structured ordering dependency places the holder
- * before the target. The contradictory rows form an artificial two-node cycle
- * after graph assembly, so this pre-assembly evidence identifies the exact row
- * to remove instead of reporting only strongly connected component members.
- */
-export function collectOrderingStorageContradictions(items, isTerminal = (status) => status === "closed" || status === "canceled", registry = resolveWorkspaceRelationshipKindRegistry()) {
-    const contradictions = new Map();
-    for (const item of items) {
-        if (typeof item?.id !== "string" || item.id.trim().length === 0)
-            continue;
-        const blocker = normalizeDependencyReferenceTarget(item.blocked_by);
-        if (!blocker)
-            continue;
-        for (const dependency of item.dependencies ?? []) {
-            const row = decodeOrderingStorageContradiction(item, blocker, dependency, isTerminal, registry);
-            if (!row)
-                continue;
-            contradictions.set(`${row.holder_id.toLowerCase()}\u0000${row.target_id.toLowerCase()}\u0000${row.dependency_kind}`, row);
-        }
-    }
-    return [...contradictions.values()].sort((left, right) => {
-        const holderCompare = compareCaseFoldedText(left.holder_id, right.holder_id);
-        if (holderCompare !== 0)
-            return holderCompare;
-        const targetCompare = compareCaseFoldedText(left.target_id, right.target_id);
-        if (targetCompare !== 0)
-            return targetCompare;
-        return compareCaseFoldedText(left.dependency_kind, right.dependency_kind);
-    });
-}
-/**
- * Classify missing hierarchy and dependency targets without mutating their holders.
- *
- * Consumers provide the workspace's terminal-status predicate so custom lifecycle
- * schemas receive the same active-versus-historical behavior as the built-in
- * closed/canceled statuses.
- */
-export function collectDanglingDependencyReferences(items, isTerminal = (status) => status === "closed" || status === "canceled") {
-    const safeItems = items.filter((item) => typeof item?.id === "string" && item.id.trim().length > 0);
-    const knownIds = new Set(safeItems.map((item) => item.id.trim().toLowerCase()));
-    const rows = new Map();
-    const addReference = (item, target, kind, source, externalAllowed) => {
-        const normalized = normalizeDependencyReferenceTarget(target);
-        if (!normalized ||
-            knownIds.has(normalized.toLowerCase()) ||
-            isExternalGraphReference(normalized, undefined, externalAllowed)) {
-            return;
-        }
-        const row = {
-            holder_id: item.id.trim(),
-            target_id: normalized,
-            kind,
-            source,
-            holder_status: item.status,
-            legacy_terminal: isTerminal(item.status),
-            no_active_blocker_sentinel: normalized.toLowerCase() === "no-active-blocker",
-        };
-        rows.set(`${row.holder_id}::${row.target_id}::${row.kind}::${row.source}`, row);
-    };
-    for (const item of safeItems) {
-        addReference(item, item.parent, "parent", "parent", false);
-        addReference(item, item.blocked_by, "blocked_by", "blocked_by", true);
-        for (const dependency of item.dependencies ?? []) {
-            // Public SDK callers may supply legacy or JSON-decoded payloads that do
-            // not yet satisfy the current structured dependency contract.
-            if (typeof dependency !== "object" || dependency === null) {
-                continue;
-            }
-            const legacyDependency = dependency;
-            if (isExternalDependencySourceKind(legacyDependency.source_kind)) {
-                continue;
-            }
-            addReference(item, legacyDependency.id, typeof legacyDependency.kind === "string"
-                ? legacyDependency.kind
-                : "related", "dependency", true);
-        }
-    }
-    const sorted = [...rows.values()].sort((left, right) => left.holder_id.localeCompare(right.holder_id) ||
-        left.target_id.localeCompare(right.target_id) ||
-        left.kind.localeCompare(right.kind) ||
-        left.source.localeCompare(right.source));
-    const legacyTerminal = sorted.filter((row) => row.legacy_terminal);
-    return {
-        active: sorted.filter((row) => !row.legacy_terminal),
-        legacy_terminal: legacyTerminal,
-        no_active_blocker_sentinels: sorted.filter((row) => row.no_active_blocker_sentinel),
-    };
-}
-/** Return unique real missing targets while excluding the legacy no-blocker sentinel. */
-export function collectMissingDependencyTargetIds(dangling) {
-    const targets = new Map();
-    for (const reference of [...dangling.active, ...dangling.legacy_terminal]) {
-        if (reference.no_active_blocker_sentinel)
-            continue;
-        const target = reference.target_id.trim();
-        const key = target.toLowerCase();
-        if (!targets.has(key))
-            targets.set(key, target);
-    }
-    return [...targets.values()].sort((left, right) => left.localeCompare(right));
-}
-/** Return unique explicitly external dependency targets in deterministic order. */
-export function collectExternalDependencyTargetIds(items) {
-    const targets = new Map();
-    for (const item of items) {
-        const scalarBlocker = normalizeDependencyGraphTarget(item.blocked_by);
-        if (scalarBlocker &&
-            isExternalGraphReference(scalarBlocker) &&
-            !targets.has(scalarBlocker)) {
-            targets.set(scalarBlocker, scalarBlocker);
-        }
-        for (const dependency of item.dependencies ?? []) {
-            if (typeof dependency !== "object" ||
-                dependency === null ||
-                !isExternalGraphReference(dependency.id, dependency.source_kind)) {
-                continue;
-            }
-            const id = normalizeDependencyGraphTarget(dependency.id);
-            if (id && !targets.has(id)) {
-                targets.set(id, id);
-            }
-        }
-    }
-    return [...targets.values()].sort((left, right) => left.localeCompare(right));
-}
-const hierarchyIntegrityByAssembly = new WeakMap();
-/** Read the hierarchy analysis paired with an assembly created by this module. */
-export function getWorkspaceHierarchyIntegrity(assembly) {
-    return (assembly.hierarchyIntegrity ?? hierarchyIntegrityByAssembly.get(assembly));
-}
-/** Count raw dependency rows that use a registered compatibility alias instead of its canonical kind. */
-export function collectLegacyDependencyAliasCounts(items, registry = resolveWorkspaceRelationshipKindRegistry()) {
-    const counts = {};
-    for (const item of items) {
-        for (const dependency of item.dependencies ?? []) {
-            if (typeof dependency !== "object" || dependency === null)
-                continue;
-            const rawKind = dependency.kind;
-            if (typeof rawKind !== "string")
-                continue;
-            const normalized = rawKind.trim().toLowerCase().replaceAll("-", "_");
-            const definition = registry.resolve(rawKind);
-            if (definition && normalized !== definition.kind) {
-                counts[normalized] = (counts[normalized] ?? 0) + 1;
-            }
-        }
-    }
-    return Object.fromEntries(Object.entries(counts).sort(([left], [right]) => left.localeCompare(right)));
-}
-/**
- * Build the shared workspace relationship graph including missing placeholder
- * nodes. One assembly serves every bounded query in an invocation — dependency
- * trees, context packets, impact analysis, path enumeration, and governance
- * audits — so the full-workspace normalization cost is paid once instead of
- * once per query surface.
- */
-export function assembleWorkspaceRelationshipGraph(items, isTerminal, registry) {
-    const relationshipRegistry = registry ?? resolveWorkspaceRelationshipKindRegistry();
-    const safeItems = items.filter((item) => typeof item?.id === "string" && item.id.trim().length > 0);
-    const canonicalIds = new Map(safeItems.map((item) => [item.id.trim().toLowerCase(), item.id.trim()]));
-    const dangling = collectDanglingDependencyReferences(safeItems, isTerminal);
-    const missingIds = collectMissingDependencyTargetIds(dangling);
-    for (const id of missingIds)
-        canonicalIds.set(id.toLowerCase(), id);
-    const externalIds = collectExternalDependencyTargetIds(safeItems);
-    const usedGraphIds = new Set(canonicalIds.keys());
-    const externalGraphIds = new Map();
-    for (const id of externalIds) {
-        let graphId = id;
-        while (usedGraphIds.has(graphId.toLowerCase())) {
-            graphId = `external:${graphId}`;
-        }
-        externalGraphIds.set(id, graphId);
-        usedGraphIds.add(graphId.toLowerCase());
-    }
-    const graphItems = safeItems.map((item) => {
-        const parent = normalizeDependencyGraphTarget(item.parent);
-        const blocker = normalizeDependencyGraphTarget(item.blocked_by);
-        const dependencies = (item.dependencies ?? []).flatMap((rawDependency) => {
-            if (typeof rawDependency !== "object" || rawDependency === null)
-                return [];
-            const dependency = rawDependency;
-            const target = normalizeDependencyGraphTarget(dependency.id);
-            if (!target)
-                return [];
-            const targetId = resolveGraphReferenceTarget(target, dependency.source_kind, canonicalIds, externalGraphIds);
-            return [
-                {
-                    id: targetId,
-                    kind: typeof dependency.kind === "string" ? dependency.kind : "related",
-                },
-            ];
-        });
-        return {
-            id: item.id.trim(),
-            ...(parent ? { parent: canonicalIds.get(parent.toLowerCase()) } : {}),
-            ...(blocker
-                ? {
-                    blocked_by: resolveGraphReferenceTarget(blocker, undefined, canonicalIds, externalGraphIds),
-                }
-                : {}),
-            dependencies,
-        };
-    });
-    const hierarchyIntegrity = analyzeHierarchyIntegrity(safeItems, isTerminal, relationshipRegistry);
-    const assembly = {
-        graph: RelationshipGraph.fromItems([
-            ...graphItems,
-            ...missingIds.map((id) => ({ id })),
-            ...externalIds.map((id) => ({
-                id: externalGraphIds.get(id),
-            })),
-        ], relationshipRegistry),
-        details: [
-            ...safeItems.map((item) => ({
-                id: item.id.trim(),
-                title: item.title,
-                status: item.status,
-                ...(typeof item.type === "string" && item.type.trim().length > 0
-                    ? { type: item.type.trim() }
-                    : {}),
-            })),
-            ...missingIds.map((id) => ({
-                id,
-                title: `[missing] ${id}`,
-                status: "missing",
-            })),
-            ...externalIds.map((id) => ({
-                id: externalGraphIds.get(id),
-                title: `[external] ${id}`,
-                status: "external",
-            })),
-        ],
-        missingIdSet: new Set(missingIds.map((id) => id.toLowerCase())),
-        dangling,
-        duplicateRows: collectDuplicateDependencyRows(safeItems, isTerminal),
-        orderingContradictions: collectOrderingStorageContradictions(safeItems, isTerminal, relationshipRegistry),
-        legacyAliasCounts: collectLegacyDependencyAliasCounts(safeItems, relationshipRegistry),
-        hierarchyIntegrity,
-    };
-    hierarchyIntegrityByAssembly.set(assembly, hierarchyIntegrity);
-    return assembly;
-}
+!(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]="06ecc7a4-c593-5d99-89f5-714a4590d0a5")}catch(e2){}})();import{RelationshipGraph}from"../relationships.js";import{isExternalDependencyReference,isExternalDependencySourceKind}from"../dependency-provenance.js";import{analyzeHierarchyIntegrity}from"./hierarchy-integrity.js";import{resolveWorkspaceRelationshipKindRegistry}from"./workspace-relationship-kind-registry.js";import{resolveWorkspaceRelationshipKindRegistry as resolveWorkspaceRelationshipKindRegistry2}from"./workspace-relationship-kind-registry.js";function normalizeDependencyReferenceTarget(target){if(typeof target!=="string")return void 0;const normalized=target.trim();if(!normalized||["none","null","n/a","na"].includes(normalized.toLowerCase()))return void 0;return normalized}function normalizeDependencyGraphTarget(target){const normalized=normalizeDependencyReferenceTarget(target);return normalized?.toLowerCase()==="no-active-blocker"?void 0:normalized}function isExternalGraphReference(target,sourceKind,externalAllowed=true){const normalized=normalizeDependencyReferenceTarget(target);return externalAllowed&&(isExternalDependencySourceKind(sourceKind)||normalized!==void 0&&isExternalDependencyReference(normalized))}function dependencyReferenceIdentityKey(target,sourceKind){return isExternalGraphReference(target,sourceKind)?`external\0${target}`:`local\0${target.toLowerCase()}`}function resolveGraphReferenceTarget(target,sourceKind,canonicalIds,externalGraphIds){return isExternalGraphReference(target,sourceKind)?externalGraphIds.get(target):canonicalIds.get(target.toLowerCase())}function compareCaseFoldedText(left,right){const normalizedLeft=left.toLowerCase();const normalizedRight=right.toLowerCase();if(normalizedLeft!==normalizedRight)return normalizedLeft<normalizedRight?-1:1;if(left!==right)return left<right?-1:1;return 0}function countDependencyRowIdentities(item){const occurrences=new Map;for(const dependency of item.dependencies??[]){if(typeof dependency!=="object"||dependency===null)continue;const legacyDependency=dependency;const target=normalizeDependencyReferenceTarget(legacyDependency.id);if(!target)continue;const kind=typeof legacyDependency.kind==="string"?legacyDependency.kind:"related";const key=`${kind}\0${dependencyReferenceIdentityKey(target,legacyDependency.source_kind)}`;const existing=occurrences.get(key);if(existing)existing.count+=1;else occurrences.set(key,{target_id:target,kind,count:1})}return occurrences}function collectDuplicateDependencyRows(items,isTerminal=status=>status==="closed"||status==="canceled"){const rows=[];for(const item of items){if(typeof item?.id!=="string"||item.id.trim().length===0)continue;for(const entry of countDependencyRowIdentities(item).values()){if(entry.count<2)continue;rows.push({holder_id:item.id.trim(),target_id:entry.target_id,kind:entry.kind,occurrences:entry.count,holder_status:item.status,legacy_terminal:isTerminal(item.status)})}}return rows.sort((left,right)=>{const holderCompare=compareCaseFoldedText(left.holder_id,right.holder_id);if(holderCompare!==0)return holderCompare;const targetCompare=compareCaseFoldedText(left.target_id,right.target_id);if(targetCompare!==0)return targetCompare;return compareCaseFoldedText(left.kind,right.kind)})}function decodeOrderingStorageContradiction(item,blocker,dependency,isTerminal,registry){if(typeof dependency!=="object"||dependency===null)return void 0;const target=normalizeDependencyReferenceTarget(dependency.id);if(!target||dependencyReferenceIdentityKey(target,dependency.source_kind)!==dependencyReferenceIdentityKey(blocker))return void 0;const definition=registry.resolve(typeof dependency.kind==="string"?dependency.kind:"related");if(definition?.ordering!==true||(definition.precedence??"source_before_target")!=="source_before_target")return void 0;return{holder_id:item.id.trim(),target_id:target,dependency_kind:definition.kind,holder_status:item.status,legacy_terminal:isTerminal(item.status)}}function collectOrderingStorageContradictions(items,isTerminal=status=>status==="closed"||status==="canceled",registry=resolveWorkspaceRelationshipKindRegistry()){const contradictions=new Map;for(const item of items){if(typeof item?.id!=="string"||item.id.trim().length===0)continue;const blocker=normalizeDependencyReferenceTarget(item.blocked_by);if(!blocker)continue;for(const dependency of item.dependencies??[]){const row=decodeOrderingStorageContradiction(item,blocker,dependency,isTerminal,registry);if(!row)continue;contradictions.set(`${row.holder_id.toLowerCase()}\0${row.target_id.toLowerCase()}\0${row.dependency_kind}`,row)}}return[...contradictions.values()].sort((left,right)=>{const holderCompare=compareCaseFoldedText(left.holder_id,right.holder_id);if(holderCompare!==0)return holderCompare;const targetCompare=compareCaseFoldedText(left.target_id,right.target_id);if(targetCompare!==0)return targetCompare;return compareCaseFoldedText(left.dependency_kind,right.dependency_kind)})}function collectDanglingDependencyReferences(items,isTerminal=status=>status==="closed"||status==="canceled"){const safeItems=items.filter(item=>typeof item?.id==="string"&&item.id.trim().length>0);const knownIds=new Set(safeItems.map(item=>item.id.trim().toLowerCase()));const rows=new Map;const addReference=(item,target,kind,source,externalAllowed)=>{const normalized=normalizeDependencyReferenceTarget(target);if(!normalized||knownIds.has(normalized.toLowerCase())||isExternalGraphReference(normalized,void 0,externalAllowed)){return}const row={holder_id:item.id.trim(),target_id:normalized,kind,source,holder_status:item.status,legacy_terminal:isTerminal(item.status),no_active_blocker_sentinel:normalized.toLowerCase()==="no-active-blocker"};rows.set(`${row.holder_id}::${row.target_id}::${row.kind}::${row.source}`,row)};for(const item of safeItems){addReference(item,item.parent,"parent","parent",false);addReference(item,item.blocked_by,"blocked_by","blocked_by",true);for(const dependency of item.dependencies??[]){if(typeof dependency!=="object"||dependency===null){continue}const legacyDependency=dependency;if(isExternalDependencySourceKind(legacyDependency.source_kind)){continue}addReference(item,legacyDependency.id,typeof legacyDependency.kind==="string"?legacyDependency.kind:"related","dependency",true)}}const sorted=[...rows.values()].sort((left,right)=>left.holder_id.localeCompare(right.holder_id)||left.target_id.localeCompare(right.target_id)||left.kind.localeCompare(right.kind)||left.source.localeCompare(right.source));const legacyTerminal=sorted.filter(row=>row.legacy_terminal);return{active:sorted.filter(row=>!row.legacy_terminal),legacy_terminal:legacyTerminal,no_active_blocker_sentinels:sorted.filter(row=>row.no_active_blocker_sentinel)}}function collectMissingDependencyTargetIds(dangling){const targets=new Map;for(const reference of[...dangling.active,...dangling.legacy_terminal]){if(reference.no_active_blocker_sentinel)continue;const target=reference.target_id.trim();const key=target.toLowerCase();if(!targets.has(key))targets.set(key,target)}return[...targets.values()].sort((left,right)=>left.localeCompare(right))}function collectExternalDependencyTargetIds(items){const targets=new Map;for(const item of items){const scalarBlocker=normalizeDependencyGraphTarget(item.blocked_by);if(scalarBlocker&&isExternalGraphReference(scalarBlocker)&&!targets.has(scalarBlocker)){targets.set(scalarBlocker,scalarBlocker)}for(const dependency of item.dependencies??[]){if(typeof dependency!=="object"||dependency===null||!isExternalGraphReference(dependency.id,dependency.source_kind)){continue}const id=normalizeDependencyGraphTarget(dependency.id);if(id&&!targets.has(id)){targets.set(id,id)}}}return[...targets.values()].sort((left,right)=>left.localeCompare(right))}const hierarchyIntegrityByAssembly=new WeakMap;function getWorkspaceHierarchyIntegrity(assembly){return assembly.hierarchyIntegrity??hierarchyIntegrityByAssembly.get(assembly)}function collectLegacyDependencyAliasCounts(items,registry=resolveWorkspaceRelationshipKindRegistry()){const counts={};for(const item of items){for(const dependency of item.dependencies??[]){if(typeof dependency!=="object"||dependency===null)continue;const rawKind=dependency.kind;if(typeof rawKind!=="string")continue;const normalized=rawKind.trim().toLowerCase().replaceAll("-","_");const definition=registry.resolve(rawKind);if(definition&&normalized!==definition.kind){counts[normalized]=(counts[normalized]??0)+1}}}return Object.fromEntries(Object.entries(counts).sort(([left],[right])=>left.localeCompare(right)))}function assembleWorkspaceRelationshipGraph(items,isTerminal,registry){const relationshipRegistry=registry??resolveWorkspaceRelationshipKindRegistry();const safeItems=items.filter(item=>typeof item?.id==="string"&&item.id.trim().length>0);const canonicalIds=new Map(safeItems.map(item=>[item.id.trim().toLowerCase(),item.id.trim()]));const dangling=collectDanglingDependencyReferences(safeItems,isTerminal);const missingIds=collectMissingDependencyTargetIds(dangling);for(const id of missingIds)canonicalIds.set(id.toLowerCase(),id);const externalIds=collectExternalDependencyTargetIds(safeItems);const usedGraphIds=new Set(canonicalIds.keys());const externalGraphIds=new Map;for(const id of externalIds){let graphId=id;while(usedGraphIds.has(graphId.toLowerCase())){graphId=`external:${graphId}`}externalGraphIds.set(id,graphId);usedGraphIds.add(graphId.toLowerCase())}const graphItems=safeItems.map(item=>{const parent=normalizeDependencyGraphTarget(item.parent);const blocker=normalizeDependencyGraphTarget(item.blocked_by);const dependencies=(item.dependencies??[]).flatMap(rawDependency=>{if(typeof rawDependency!=="object"||rawDependency===null)return[];const dependency=rawDependency;const target=normalizeDependencyGraphTarget(dependency.id);if(!target)return[];const targetId=resolveGraphReferenceTarget(target,dependency.source_kind,canonicalIds,externalGraphIds);return[{id:targetId,kind:typeof dependency.kind==="string"?dependency.kind:"related"}]});return{id:item.id.trim(),...parent?{parent:canonicalIds.get(parent.toLowerCase())}:{},...blocker?{blocked_by:resolveGraphReferenceTarget(blocker,void 0,canonicalIds,externalGraphIds)}:{},dependencies}});const hierarchyIntegrity=analyzeHierarchyIntegrity(safeItems,isTerminal,relationshipRegistry);const assembly={graph:RelationshipGraph.fromItems([...graphItems,...missingIds.map(id=>({id})),...externalIds.map(id=>({id:externalGraphIds.get(id)}))],relationshipRegistry),details:[...safeItems.map(item=>({id:item.id.trim(),title:item.title,status:item.status,...typeof item.type==="string"&&item.type.trim().length>0?{type:item.type.trim()}:{}})),...missingIds.map(id=>({id,title:`[missing] ${id}`,status:"missing"})),...externalIds.map(id=>({id:externalGraphIds.get(id),title:`[external] ${id}`,status:"external"}))],missingIdSet:new Set(missingIds.map(id=>id.toLowerCase())),dangling,duplicateRows:collectDuplicateDependencyRows(safeItems,isTerminal),orderingContradictions:collectOrderingStorageContradictions(safeItems,isTerminal,relationshipRegistry),legacyAliasCounts:collectLegacyDependencyAliasCounts(safeItems,relationshipRegistry),hierarchyIntegrity};hierarchyIntegrityByAssembly.set(assembly,hierarchyIntegrity);return assembly}export{assembleWorkspaceRelationshipGraph,collectDanglingDependencyReferences,collectDuplicateDependencyRows,collectExternalDependencyTargetIds,collectLegacyDependencyAliasCounts,collectMissingDependencyTargetIds,collectOrderingStorageContradictions,getWorkspaceHierarchyIntegrity,normalizeDependencyGraphTarget,resolveWorkspaceRelationshipKindRegistry2 as resolveWorkspaceRelationshipKindRegistry};
 //# sourceMappingURL=assembly.js.map
-//# debugId=e04a91fa-4625-50fd-9bfd-c712126baf0d

package/dist/sdk/graph/cache.js

@@ -1,161 +1,2 @@
-/**
- * @module sdk/graph/cache
- *
- * Incremental workspace graph cache: fingerprint-keyed reuse of the assembled
- * relationship graph plus memoized analytics results, so long-lived processes
- * (the MCP server, SDK consumers, packages) stop paying the full-workspace
- * assembly and analysis cost on every bounded query. The fingerprint is a
- * deterministic digest of every relationship-relevant item field — id, title,
- * lifecycle status and its terminal classification, hierarchy parent, legacy
- * blocker, and structured dependency edges — so any mutation that could change
- * the graph or its projections invalidates the entry, while unrelated payload
- * churn (bodies, comments) does not enter the digest at all. Every lookup
- * reports hit/miss observability so envelopes can explain their freshness.
- */
-
-!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]="dea35fb9-9f9f-56ce-afc0-f4dc993012c3")}catch(e){}}();
-import { createHash } from "node:crypto";
-import { stableStringify } from "../../core/shared/serialization.js";
-import { createRelationshipKindRegistry, } from "../relationships.js";
-/** Default memoized query results retained per workspace entry. */
-const DEFAULT_MAX_RESULTS_PER_WORKSPACE = 64;
-/** Default workspace entries retained by one cache instance. */
-const DEFAULT_MAX_WORKSPACES = 8;
-/** Digest one item's relationship-relevant fields into a deterministic line. */
-function fingerprintLine(item, isTerminal) {
-    const dependencies = (item.dependencies ?? [])
-        .map((rawDependency) => {
-        // Public SDK callers may supply legacy or JSON-decoded payloads; mirror
-        // assembly's defensive normalization so the digest tracks what assembly
-        // would actually index.
-        if (typeof rawDependency !== "object" || rawDependency === null)
-            return "";
-        const dependency = rawDependency;
-        return `${typeof dependency.kind === "string" ? dependency.kind : "related"}:${typeof dependency.id === "string" ? dependency.id : ""}`;
-    })
-        .sort()
-        .join(",");
-    return [
-        item.id,
-        item.title,
-        item.status,
-        isTerminal(item.status) ? "1" : "0",
-        // Per-type coverage profiles make the item type a projection input, so a
-        // retype must invalidate cached assemblies and memoized audit results.
-        typeof item.type === "string" ? item.type.trim() : "",
-        item.parent ?? "",
-        item.blocked_by ?? "",
-        dependencies,
-    ].join("\u0000");
-}
-/**
- * Compute the deterministic workspace graph fingerprint for one item snapshot.
- * Items are digested in sorted order so storage enumeration order never
- * changes the fingerprint, and the terminal classification of each status is
- * folded in so schema changes to lifecycle semantics invalidate cached
- * assemblies even when raw statuses are unchanged.
- */
-export function computeWorkspaceGraphFingerprint(items, isTerminal = (status) => status === "closed" || status === "canceled", registry = createRelationshipKindRegistry()) {
-    const lines = items
-        .filter((item) => typeof item?.id === "string" && item.id.trim().length > 0)
-        .map((item) => fingerprintLine(item, isTerminal))
-        .sort();
-    const relationshipSemantics = registry
-        .list()
-        .map((definition) => stableStringify(definition))
-        .sort();
-    // Separate fields and records with control characters no stored field can
-    // contain unescaped, so adjacent free-text fields can never collide.
-    return createHash("sha256")
-        .update(lines.join("\u0001"))
-        .update("\u0002")
-        .update(relationshipSemantics.join("\u0001"))
-        .digest("hex");
-}
-/** Validate one optional positive-integer cache bound, applying its default. */
-function requirePositiveCacheBound(name, value, fallback) {
-    const bound = value ?? fallback;
-    if (!Number.isInteger(bound) || bound < 1)
-        throw new TypeError(`Invalid ${name} bound: ${String(value)}`);
-    return bound;
-}
-/**
- * Fingerprint-keyed cache of workspace relationship assemblies and memoized
- * deterministic query results. One entry is retained per workspace key; a
- * changed fingerprint atomically replaces the entry and drops its memoized
- * results. Memoized values are structured-cloned on store and on read so
- * neither the producer nor any consumer can mutate cached state.
- */
-export class WorkspaceGraphCache {
-    #entries = new Map();
-    #maxResultsPerWorkspace;
-    #maxWorkspaces;
-    /** Create a cache, optionally bounding workspaces and memoized results. */
-    constructor(options = {}) {
-        this.#maxResultsPerWorkspace = requirePositiveCacheBound("maxResultsPerWorkspace", options.maxResultsPerWorkspace, DEFAULT_MAX_RESULTS_PER_WORKSPACE);
-        this.#maxWorkspaces = requirePositiveCacheBound("maxWorkspaces", options.maxWorkspaces, DEFAULT_MAX_WORKSPACES);
-    }
-    /**
-     * Resolve the cached assembly for one workspace key and fingerprint,
-     * building and storing it on miss. The returned lookup exposes snapshot-
-     * scoped memoization for query results derived from the same assembly.
-     */
-    lookup(key, fingerprint, build) {
-        let entry = this.#entries.get(key);
-        let assemblyReused = true;
-        if (entry === undefined || entry.fingerprint !== fingerprint) {
-            entry = { fingerprint, assembly: build(), results: new Map() };
-            assemblyReused = false;
-            if (!this.#entries.has(key) &&
-                this.#entries.size >= this.#maxWorkspaces) {
-                // Evict the least recently used workspace; every lookup refreshes
-                // recency below, so insertion order tracks use order.
-                this.#entries.delete(this.#entries.keys().next().value);
-            }
-        }
-        // Delete-and-reinsert keeps Map insertion order equal to recency order,
-        // making workspace eviction genuinely least-recently-used.
-        this.#entries.delete(key);
-        this.#entries.set(key, entry);
-        const resolved = entry;
-        const maxResults = this.#maxResultsPerWorkspace;
-        return {
-            assembly: resolved.assembly,
-            assemblyReused,
-            fingerprint,
-            memoize(queryKey, compute) {
-                const cached = resolved.results.get(queryKey);
-                if (cached !== undefined || resolved.results.has(queryKey)) {
-                    // Refresh recency so eviction below is least-recently-used rather
-                    // than first-inserted.
-                    resolved.results.delete(queryKey);
-                    resolved.results.set(queryKey, cached);
-                    return { value: structuredClone(cached), reused: true };
-                }
-                const value = compute();
-                if (resolved.results.size >= maxResults) {
-                    // Evict the oldest memoized result; Map preserves insertion order.
-                    resolved.results.delete(resolved.results.keys().next().value);
-                }
-                resolved.results.set(queryKey, structuredClone(value));
-                return { value, reused: false };
-            },
-        };
-    }
-    /** Drop every cached workspace entry and memoized result. */
-    clear() {
-        this.#entries.clear();
-    }
-}
-/** Process-wide shared cache used by the CLI/MCP graph and deps adapters. */
-const sharedCache = new WorkspaceGraphCache();
-/** Return the process-wide shared workspace graph cache. */
-export function workspaceGraphCache() {
-    return sharedCache;
-}
-/** Reset the process-wide shared workspace graph cache (tests and long-lived hosts). */
-export function resetWorkspaceGraphCache() {
-    sharedCache.clear();
-}
+!(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]="10f534cf-ee82-54a2-9807-390eca5fb0b8")}catch(e2){}})();import{createHash}from"node:crypto";import{stableStringify}from"../../core/shared/serialization.js";import{createRelationshipKindRegistry}from"../relationships.js";const DEFAULT_MAX_RESULTS_PER_WORKSPACE=64;const DEFAULT_MAX_WORKSPACES=8;function fingerprintLine(item,isTerminal){const dependencies=(item.dependencies??[]).map(rawDependency=>{if(typeof rawDependency!=="object"||rawDependency===null)return"";const dependency=rawDependency;return`${typeof dependency.kind==="string"?dependency.kind:"related"}:${typeof dependency.id==="string"?dependency.id:""}`}).sort().join(",");return[item.id,item.title,item.status,isTerminal(item.status)?"1":"0",typeof item.type==="string"?item.type.trim():"",item.parent??"",item.blocked_by??"",dependencies].join("\0")}function computeWorkspaceGraphFingerprint(items,isTerminal=status=>status==="closed"||status==="canceled",registry=createRelationshipKindRegistry()){const lines=items.filter(item=>typeof item?.id==="string"&&item.id.trim().length>0).map(item=>fingerprintLine(item,isTerminal)).sort();const relationshipSemantics=registry.list().map(definition=>stableStringify(definition)).sort();return createHash("sha256").update(lines.join("
")).update("").update(relationshipSemantics.join("
")).digest("hex")}function requirePositiveCacheBound(name,value,fallback){const bound=value??fallback;if(!Number.isInteger(bound)||bound<1)throw new TypeError(`Invalid ${name} bound: ${String(value)}`);return bound}class WorkspaceGraphCache{#entries=new Map;#maxResultsPerWorkspace;#maxWorkspaces;constructor(options={}){this.#maxResultsPerWorkspace=requirePositiveCacheBound("maxResultsPerWorkspace",options.maxResultsPerWorkspace,DEFAULT_MAX_RESULTS_PER_WORKSPACE);this.#maxWorkspaces=requirePositiveCacheBound("maxWorkspaces",options.maxWorkspaces,DEFAULT_MAX_WORKSPACES)}lookup(key,fingerprint,build){let entry=this.#entries.get(key);let assemblyReused=true;if(entry===void 0||entry.fingerprint!==fingerprint){entry={fingerprint,assembly:build(),results:new Map};assemblyReused=false;if(!this.#entries.has(key)&&this.#entries.size>=this.#maxWorkspaces){this.#entries.delete(this.#entries.keys().next().value)}}this.#entries.delete(key);this.#entries.set(key,entry);const resolved=entry;const maxResults=this.#maxResultsPerWorkspace;return{assembly:resolved.assembly,assemblyReused,fingerprint,memoize(queryKey,compute){const cached=resolved.results.get(queryKey);if(cached!==void 0||resolved.results.has(queryKey)){resolved.results.delete(queryKey);resolved.results.set(queryKey,cached);return{value:structuredClone(cached),reused:true}}const value=compute();if(resolved.results.size>=maxResults){resolved.results.delete(resolved.results.keys().next().value)}resolved.results.set(queryKey,structuredClone(value));return{value,reused:false}}}}clear(){this.#entries.clear()}}const sharedCache=new WorkspaceGraphCache;function workspaceGraphCache(){return sharedCache}function resetWorkspaceGraphCache(){sharedCache.clear()}export{WorkspaceGraphCache,computeWorkspaceGraphFingerprint,resetWorkspaceGraphCache,workspaceGraphCache};
 //# sourceMappingURL=cache.js.map
-//# debugId=dea35fb9-9f9f-56ce-afc0-f4dc993012c3