@unbrained/pm-cli 2026.9.7 → 2026.9.9

package/dist/sdk/graph/hierarchy-integrity.js

@@ -1,311 +1,2 @@
-/**
- * @module sdk/graph/hierarchy-integrity
- *
- * Normalizes scalar and dependency-backed hierarchy evidence into one graph,
- * reports structural defects, and rejects mutations that introduce new debt.
- */
-
-!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]="924f7718-0527-5967-8ab0-53e8228bd665")}catch(e){}}();
-import { EXIT_CODE } from "../../core/shared/constants.js";
-import { PmCliError } from "../../core/shared/errors.js";
-import { resolveWorkspaceRelationshipKindRegistry } from "./workspace-relationship-kind-registry.js";
-function normalizeItemId(value) {
-    if (typeof value !== "string")
-        return undefined;
-    const normalized = value.trim().toLowerCase();
-    return normalized.length > 0 ? normalized : undefined;
-}
-function relationIdentity(relation) {
-    return [
-        relation.parent_id,
-        relation.child_id,
-        relation.source,
-        relation.kind,
-        relation.holder_id,
-        relation.target_id ?? "",
-    ].join("\u0000");
-}
-function collectHierarchyFinishOrder(nodeIds, childrenByParent) {
-    const visited = new Set();
-    const finishOrder = [];
-    for (const root of [...nodeIds].sort()) {
-        if (visited.has(root))
-            continue;
-        visited.add(root);
-        const frames = [
-            {
-                nodeId: root,
-                children: [...(childrenByParent.get(root) ?? [])].sort(),
-                nextChild: 0,
-            },
-        ];
-        while (frames.length > 0) {
-            const frame = frames.at(-1);
-            const childId = frame.children[frame.nextChild];
-            if (childId === undefined) {
-                finishOrder.push(frame.nodeId);
-                frames.pop();
-            }
-            else {
-                frame.nextChild += 1;
-                if (!visited.has(childId)) {
-                    visited.add(childId);
-                    frames.push({
-                        nodeId: childId,
-                        children: [...(childrenByParent.get(childId) ?? [])].sort(),
-                        nextChild: 0,
-                    });
-                }
-            }
-        }
-    }
-    return finishOrder;
-}
-function collectCyclicComponents(nodeIds, childrenByParent) {
-    const sortedNodeIds = [...nodeIds].sort();
-    const finishOrder = collectHierarchyFinishOrder(sortedNodeIds, childrenByParent);
-    const visited = new Set();
-    const parentsByChild = reverseHierarchyEdges(sortedNodeIds, childrenByParent);
-    const components = [];
-    for (const root of finishOrder.reverse()) {
-        if (visited.has(root))
-            continue;
-        const component = collectReverseComponent(root, parentsByChild, visited);
-        if (component.length > 1 ||
-            childrenByParent.get(component[0])?.has(component[0]))
-            components.push(component);
-    }
-    return components.sort((left, right) => left.join("\u0000").localeCompare(right.join("\u0000")));
-}
-function reverseHierarchyEdges(nodeIds, childrenByParent) {
-    const parentsByChild = new Map(nodeIds.map((nodeId) => [nodeId, new Set()]));
-    for (const [parentId, childIds] of childrenByParent) {
-        for (const childId of childIds)
-            parentsByChild.get(childId)?.add(parentId);
-    }
-    return parentsByChild;
-}
-function collectReverseComponent(root, parentsByChild, visited) {
-    const component = [];
-    const pending = [root];
-    visited.add(root);
-    while (pending.length > 0) {
-        const nodeId = pending.pop();
-        component.push(nodeId);
-        for (const parentId of [...parentsByChild.get(nodeId)].sort()) {
-            if (visited.has(parentId))
-                continue;
-            visited.add(parentId);
-            pending.push(parentId);
-        }
-    }
-    return component.sort();
-}
-function collectHierarchyItems(items) {
-    const itemById = new Map();
-    for (const item of items) {
-        const itemId = normalizeItemId(item?.id);
-        if (itemId && !itemById.has(itemId))
-            itemById.set(itemId, item);
-    }
-    return itemById;
-}
-function buildScalarHierarchyRelation(holderId, item, itemById) {
-    const parentId = normalizeItemId(item.parent);
-    if (!parentId || !itemById.has(parentId))
-        return undefined;
-    return {
-        parent_id: parentId,
-        child_id: holderId,
-        source: "scalar_parent",
-        kind: "parent",
-        holder_id: holderId,
-        child_cardinality: "one",
-    };
-}
-function buildDependencyHierarchyRelation(holderId, dependency, itemById, registry) {
-    const targetId = normalizeItemId(dependency?.id);
-    const definition = registry.resolve(dependency?.kind);
-    if (!targetId || !itemById.has(targetId) || !definition?.hierarchy)
-        return undefined;
-    const sourceIsParent = definition.hierarchyDirection === "source_parent";
-    return {
-        parent_id: sourceIsParent ? holderId : targetId,
-        child_id: sourceIsParent ? targetId : holderId,
-        source: "dependency",
-        kind: definition.kind,
-        holder_id: holderId,
-        target_id: targetId,
-        child_cardinality: sourceIsParent
-            ? definition.incoming
-            : definition.outgoing,
-    };
-}
-function collectHierarchyRelationsFromItemMap(itemById, registry) {
-    const relationsByIdentity = new Map();
-    for (const [holderId, item] of itemById) {
-        const scalarRelation = buildScalarHierarchyRelation(holderId, item, itemById);
-        if (scalarRelation)
-            relationsByIdentity.set(relationIdentity(scalarRelation), scalarRelation);
-        for (const dependency of item.dependencies ?? []) {
-            const relation = buildDependencyHierarchyRelation(holderId, dependency, itemById, registry);
-            if (!relation)
-                continue;
-            relationsByIdentity.set(relationIdentity(relation), relation);
-        }
-    }
-    return [...relationsByIdentity.values()].sort((left, right) => relationIdentity(left).localeCompare(relationIdentity(right)));
-}
-/** Collect normalized hierarchy evidence without running defect analysis. */
-export function collectHierarchyRelations(items, registry = resolveWorkspaceRelationshipKindRegistry()) {
-    return collectHierarchyRelationsFromItemMap(collectHierarchyItems(items), registry);
-}
-function collectHierarchyCardinalityViolations(relations, parentsByChild, terminalIds) {
-    const oneCardinalityChildren = new Set(relations
-        .filter((relation) => relation.child_cardinality === "one")
-        .map((relation) => relation.child_id));
-    return [...parentsByChild]
-        .filter(([childId, parentIds]) => parentIds.length > 1 && oneCardinalityChildren.has(childId))
-        .map(([childId, parentIds]) => ({
-        child_id: childId,
-        parent_ids: [...parentIds],
-        legacy_terminal: terminalIds.has(childId) &&
-            parentIds.every((id) => terminalIds.has(id)),
-    }))
-        .sort((left, right) => left.child_id.localeCompare(right.child_id));
-}
-function collectHierarchyDivergences(itemById, relations, terminalIds) {
-    const dependencyParentsByChild = new Map();
-    for (const relation of relations) {
-        if (relation.source !== "dependency")
-            continue;
-        const parents = dependencyParentsByChild.get(relation.child_id) ?? new Set();
-        parents.add(relation.parent_id);
-        dependencyParentsByChild.set(relation.child_id, parents);
-    }
-    const divergences = [];
-    for (const [childId, item] of itemById) {
-        const scalarParentId = normalizeItemId(item.parent);
-        if (!scalarParentId || !itemById.has(scalarParentId))
-            continue;
-        const dependencyParentIds = [
-            ...(dependencyParentsByChild.get(childId) ?? []),
-        ]
-            .filter((parentId) => parentId !== scalarParentId)
-            .sort();
-        if (dependencyParentIds.length === 0)
-            continue;
-        divergences.push({
-            child_id: childId,
-            scalar_parent_id: scalarParentId,
-            dependency_parent_ids: dependencyParentIds,
-            legacy_terminal: terminalIds.has(childId) &&
-                terminalIds.has(scalarParentId) &&
-                dependencyParentIds.every((id) => terminalIds.has(id)),
-        });
-    }
-    return divergences.sort((left, right) => left.child_id.localeCompare(right.child_id));
-}
-/**
- * Analyze all runtime-recognized hierarchy spellings as canonical parent-child
- * relations. Unknown, malformed, and dangling rows are ignored here because
- * dedicated graph-integrity checks own those diagnostics.
- */
-export function analyzeHierarchyIntegrity(items, isTerminal = (status) => status === "closed" || status === "canceled", registry = resolveWorkspaceRelationshipKindRegistry()) {
-    const itemById = collectHierarchyItems(items);
-    const relations = collectHierarchyRelationsFromItemMap(itemById, registry);
-    const indexes = indexHierarchyRelations(relations);
-    const terminalIds = new Set([...itemById]
-        .filter(([, item]) => isTerminal(item.status))
-        .map(([id]) => id));
-    const cycles = collectCyclicComponents([...itemById.keys()], new Map([...indexes.children_by_parent].map(([id, childIds]) => [
-        id,
-        new Set(childIds),
-    ]))).map((itemIds) => ({
-        item_ids: itemIds,
-        legacy_terminal: itemIds.every((id) => terminalIds.has(id)),
-    }));
-    return {
-        relations,
-        cycles,
-        cardinality_violations: collectHierarchyCardinalityViolations(relations, indexes.parents_by_child, terminalIds),
-        divergences: collectHierarchyDivergences(itemById, relations, terminalIds),
-    };
-}
-/** Render exact hierarchy evidence without losing its storage orientation. */
-export function formatHierarchyRelation(relation) {
-    if (relation.source === "scalar_parent")
-        return `${relation.parent_id} -> ${relation.child_id} (scalar parent on ${relation.holder_id})`;
-    return `${relation.parent_id} -> ${relation.child_id} (${relation.kind} dependency on ${relation.holder_id})`;
-}
-/** Index normalized hierarchy evidence for list, tree, and rollup consumers. */
-export function indexHierarchyRelations(relations) {
-    const parentSets = new Map();
-    const childSets = new Map();
-    for (const relation of relations) {
-        const parents = parentSets.get(relation.child_id) ?? new Set();
-        parents.add(relation.parent_id);
-        parentSets.set(relation.child_id, parents);
-        const children = childSets.get(relation.parent_id) ?? new Set();
-        children.add(relation.child_id);
-        childSets.set(relation.parent_id, children);
-    }
-    return {
-        parents_by_child: new Map([...parentSets].map(([id, values]) => [id, [...values].sort()])),
-        children_by_parent: new Map([...childSets].map(([id, values]) => [id, [...values].sort()])),
-    };
-}
-/** Return whether every candidate identifier existed in the prior defect. */
-function isIdentifierSubset(candidate, prior) {
-    const priorIds = new Set(prior);
-    return candidate.every((id) => priorIds.has(id));
-}
-/**
- * Reject a mutation only when it introduces a new hierarchy defect involving
- * the changed item. Existing debt remains repairable without a global bypass.
- */
-export function assertHierarchyMutationAllowed(beforeItems, afterItems, changedItemId, isTerminal, registry) {
-    const holderId = normalizeItemId(changedItemId);
-    if (!holderId)
-        return;
-    const before = analyzeHierarchyIntegrity(beforeItems, isTerminal, registry);
-    const after = analyzeHierarchyIntegrity(afterItems, isTerminal, registry);
-    const divergence = after.divergences.find((finding) => !before.divergences.some((prior) => prior.child_id === finding.child_id &&
-        prior.scalar_parent_id === finding.scalar_parent_id &&
-        isIdentifierSubset(finding.dependency_parent_ids, prior.dependency_parent_ids)));
-    if (divergence) {
-        const parentIds = [
-            divergence.scalar_parent_id,
-            ...divergence.dependency_parent_ids,
-        ].sort();
-        throw new PmCliError(`Hierarchy mutation would assign ${divergence.child_id} to multiple parents: ${parentIds.join(", ")}.`, EXIT_CODE.CONFLICT, {
-            code: "hierarchy_parent_divergence_created",
-            source_id: holderId,
-            target_id: divergence.child_id,
-            verification_errors: parentIds,
-        });
-    }
-    const cardinality = after.cardinality_violations.find((finding) => (finding.child_id === holderId ||
-        finding.parent_ids.includes(holderId)) &&
-        !before.cardinality_violations.some((prior) => prior.child_id === finding.child_id &&
-            isIdentifierSubset(finding.parent_ids, prior.parent_ids)));
-    if (cardinality) {
-        throw new PmCliError(`Hierarchy mutation would assign ${cardinality.child_id} to multiple parents: ${cardinality.parent_ids.join(", ")}.`, EXIT_CODE.CONFLICT, {
-            code: "hierarchy_cardinality_created",
-            source_id: holderId,
-            target_id: cardinality.child_id,
-            verification_errors: cardinality.parent_ids,
-        });
-    }
-    const cycle = after.cycles.find((finding) => finding.item_ids.includes(holderId) &&
-        !before.cycles.some((prior) => isIdentifierSubset(finding.item_ids, prior.item_ids)));
-    if (cycle) {
-        throw new PmCliError(`Hierarchy mutation would create a cycle: ${cycle.item_ids.join(" -> ")}.`, EXIT_CODE.CONFLICT, {
-            code: "hierarchy_cycle_created",
-            source_id: holderId,
-            verification_errors: cycle.item_ids,
-        });
-    }
-}
+!(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]="83d1acab-79a1-5e9f-b6a4-97dade07d74a")}catch(e2){}})();import{EXIT_CODE}from"../../core/shared/constants.js";import{PmCliError}from"../../core/shared/errors.js";import{resolveWorkspaceRelationshipKindRegistry}from"./workspace-relationship-kind-registry.js";function normalizeItemId(value){if(typeof value!=="string")return void 0;const normalized=value.trim().toLowerCase();return normalized.length>0?normalized:void 0}function relationIdentity(relation){return[relation.parent_id,relation.child_id,relation.source,relation.kind,relation.holder_id,relation.target_id??""].join("\0")}function collectHierarchyFinishOrder(nodeIds,childrenByParent){const visited=new Set;const finishOrder=[];for(const root of[...nodeIds].sort()){if(visited.has(root))continue;visited.add(root);const frames=[{nodeId:root,children:[...childrenByParent.get(root)??[]].sort(),nextChild:0}];while(frames.length>0){const frame=frames.at(-1);const childId=frame.children[frame.nextChild];if(childId===void 0){finishOrder.push(frame.nodeId);frames.pop()}else{frame.nextChild+=1;if(!visited.has(childId)){visited.add(childId);frames.push({nodeId:childId,children:[...childrenByParent.get(childId)??[]].sort(),nextChild:0})}}}}return finishOrder}function collectCyclicComponents(nodeIds,childrenByParent){const sortedNodeIds=[...nodeIds].sort();const finishOrder=collectHierarchyFinishOrder(sortedNodeIds,childrenByParent);const visited=new Set;const parentsByChild=reverseHierarchyEdges(sortedNodeIds,childrenByParent);const components=[];for(const root of finishOrder.reverse()){if(visited.has(root))continue;const component=collectReverseComponent(root,parentsByChild,visited);if(component.length>1||childrenByParent.get(component[0])?.has(component[0]))components.push(component)}return components.sort((left,right)=>left.join("\0").localeCompare(right.join("\0")))}function reverseHierarchyEdges(nodeIds,childrenByParent){const parentsByChild=new Map(nodeIds.map(nodeId=>[nodeId,new Set]));for(const[parentId,childIds]of childrenByParent){for(const childId of childIds)parentsByChild.get(childId)?.add(parentId)}return parentsByChild}function collectReverseComponent(root,parentsByChild,visited){const component=[];const pending=[root];visited.add(root);while(pending.length>0){const nodeId=pending.pop();component.push(nodeId);for(const parentId of[...parentsByChild.get(nodeId)].sort()){if(visited.has(parentId))continue;visited.add(parentId);pending.push(parentId)}}return component.sort()}function collectHierarchyItems(items){const itemById=new Map;for(const item of items){const itemId=normalizeItemId(item?.id);if(itemId&&!itemById.has(itemId))itemById.set(itemId,item)}return itemById}function buildScalarHierarchyRelation(holderId,item,itemById){const parentId=normalizeItemId(item.parent);if(!parentId||!itemById.has(parentId))return void 0;return{parent_id:parentId,child_id:holderId,source:"scalar_parent",kind:"parent",holder_id:holderId,child_cardinality:"one"}}function buildDependencyHierarchyRelation(holderId,dependency,itemById,registry){const targetId=normalizeItemId(dependency?.id);const definition=registry.resolve(dependency?.kind);if(!targetId||!itemById.has(targetId)||!definition?.hierarchy)return void 0;const sourceIsParent=definition.hierarchyDirection==="source_parent";return{parent_id:sourceIsParent?holderId:targetId,child_id:sourceIsParent?targetId:holderId,source:"dependency",kind:definition.kind,holder_id:holderId,target_id:targetId,child_cardinality:sourceIsParent?definition.incoming:definition.outgoing}}function collectHierarchyRelationsFromItemMap(itemById,registry){const relationsByIdentity=new Map;for(const[holderId,item]of itemById){const scalarRelation=buildScalarHierarchyRelation(holderId,item,itemById);if(scalarRelation)relationsByIdentity.set(relationIdentity(scalarRelation),scalarRelation);for(const dependency of item.dependencies??[]){const relation=buildDependencyHierarchyRelation(holderId,dependency,itemById,registry);if(!relation)continue;relationsByIdentity.set(relationIdentity(relation),relation)}}return[...relationsByIdentity.values()].sort((left,right)=>relationIdentity(left).localeCompare(relationIdentity(right)))}function collectHierarchyRelations(items,registry=resolveWorkspaceRelationshipKindRegistry()){return collectHierarchyRelationsFromItemMap(collectHierarchyItems(items),registry)}function collectHierarchyCardinalityViolations(relations,parentsByChild,terminalIds){const oneCardinalityChildren=new Set(relations.filter(relation=>relation.child_cardinality==="one").map(relation=>relation.child_id));return[...parentsByChild].filter(([childId,parentIds])=>parentIds.length>1&&oneCardinalityChildren.has(childId)).map(([childId,parentIds])=>({child_id:childId,parent_ids:[...parentIds],legacy_terminal:terminalIds.has(childId)&&parentIds.every(id=>terminalIds.has(id))})).sort((left,right)=>left.child_id.localeCompare(right.child_id))}function collectHierarchyDivergences(itemById,relations,terminalIds){const dependencyParentsByChild=new Map;for(const relation of relations){if(relation.source!=="dependency")continue;const parents=dependencyParentsByChild.get(relation.child_id)??new Set;parents.add(relation.parent_id);dependencyParentsByChild.set(relation.child_id,parents)}const divergences=[];for(const[childId,item]of itemById){const scalarParentId=normalizeItemId(item.parent);if(!scalarParentId||!itemById.has(scalarParentId))continue;const dependencyParentIds=[...dependencyParentsByChild.get(childId)??[]].filter(parentId=>parentId!==scalarParentId).sort();if(dependencyParentIds.length===0)continue;divergences.push({child_id:childId,scalar_parent_id:scalarParentId,dependency_parent_ids:dependencyParentIds,legacy_terminal:terminalIds.has(childId)&&terminalIds.has(scalarParentId)&&dependencyParentIds.every(id=>terminalIds.has(id))})}return divergences.sort((left,right)=>left.child_id.localeCompare(right.child_id))}function analyzeHierarchyIntegrity(items,isTerminal=status=>status==="closed"||status==="canceled",registry=resolveWorkspaceRelationshipKindRegistry()){const itemById=collectHierarchyItems(items);const relations=collectHierarchyRelationsFromItemMap(itemById,registry);const indexes=indexHierarchyRelations(relations);const terminalIds=new Set([...itemById].filter(([,item])=>isTerminal(item.status)).map(([id])=>id));const cycles=collectCyclicComponents([...itemById.keys()],new Map([...indexes.children_by_parent].map(([id,childIds])=>[id,new Set(childIds)]))).map(itemIds=>({item_ids:itemIds,legacy_terminal:itemIds.every(id=>terminalIds.has(id))}));return{relations,cycles,cardinality_violations:collectHierarchyCardinalityViolations(relations,indexes.parents_by_child,terminalIds),divergences:collectHierarchyDivergences(itemById,relations,terminalIds)}}function formatHierarchyRelation(relation){if(relation.source==="scalar_parent")return`${relation.parent_id} -> ${relation.child_id} (scalar parent on ${relation.holder_id})`;return`${relation.parent_id} -> ${relation.child_id} (${relation.kind} dependency on ${relation.holder_id})`}function indexHierarchyRelations(relations){const parentSets=new Map;const childSets=new Map;for(const relation of relations){const parents=parentSets.get(relation.child_id)??new Set;parents.add(relation.parent_id);parentSets.set(relation.child_id,parents);const children=childSets.get(relation.parent_id)??new Set;children.add(relation.child_id);childSets.set(relation.parent_id,children)}return{parents_by_child:new Map([...parentSets].map(([id,values])=>[id,[...values].sort()])),children_by_parent:new Map([...childSets].map(([id,values])=>[id,[...values].sort()]))}}function isIdentifierSubset(candidate,prior){const priorIds=new Set(prior);return candidate.every(id=>priorIds.has(id))}function assertHierarchyMutationAllowed(beforeItems,afterItems,changedItemId,isTerminal,registry){const holderId=normalizeItemId(changedItemId);if(!holderId)return;const before=analyzeHierarchyIntegrity(beforeItems,isTerminal,registry);const after=analyzeHierarchyIntegrity(afterItems,isTerminal,registry);const divergence=after.divergences.find(finding=>!before.divergences.some(prior=>prior.child_id===finding.child_id&&prior.scalar_parent_id===finding.scalar_parent_id&&isIdentifierSubset(finding.dependency_parent_ids,prior.dependency_parent_ids)));if(divergence){const parentIds=[divergence.scalar_parent_id,...divergence.dependency_parent_ids].sort();throw new PmCliError(`Hierarchy mutation would assign ${divergence.child_id} to multiple parents: ${parentIds.join(", ")}.`,EXIT_CODE.CONFLICT,{code:"hierarchy_parent_divergence_created",source_id:holderId,target_id:divergence.child_id,verification_errors:parentIds})}const cardinality=after.cardinality_violations.find(finding=>(finding.child_id===holderId||finding.parent_ids.includes(holderId))&&!before.cardinality_violations.some(prior=>prior.child_id===finding.child_id&&isIdentifierSubset(finding.parent_ids,prior.parent_ids)));if(cardinality){throw new PmCliError(`Hierarchy mutation would assign ${cardinality.child_id} to multiple parents: ${cardinality.parent_ids.join(", ")}.`,EXIT_CODE.CONFLICT,{code:"hierarchy_cardinality_created",source_id:holderId,target_id:cardinality.child_id,verification_errors:cardinality.parent_ids})}const cycle=after.cycles.find(finding=>finding.item_ids.includes(holderId)&&!before.cycles.some(prior=>isIdentifierSubset(finding.item_ids,prior.item_ids)));if(cycle){throw new PmCliError(`Hierarchy mutation would create a cycle: ${cycle.item_ids.join(" -> ")}.`,EXIT_CODE.CONFLICT,{code:"hierarchy_cycle_created",source_id:holderId,verification_errors:cycle.item_ids})}}export{analyzeHierarchyIntegrity,assertHierarchyMutationAllowed,collectHierarchyRelations,formatHierarchyRelation,indexHierarchyRelations};
 //# sourceMappingURL=hierarchy-integrity.js.map
-//# debugId=924f7718-0527-5967-8ab0-53e8228bd665

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

@@ -12,12 +12,13 @@ export { computeRelationshipCentrality, findRelationshipCutStructure, type Graph
 export { createRelationshipGraphSnapshot, federateRelationshipGraphSnapshots, loadRelationshipGraphAdapter, MemoryRelationshipGraphAdapter, parseRelationshipGraphSnapshot, RELATIONSHIP_GRAPH_SNAPSHOT_VERSION, syncRelationshipGraphAdapter, type LoadedRelationshipGraphSnapshot, type RelationshipGraphAdapter, type RelationshipGraphAdapterContext, type RelationshipGraphAdapterReplaceContext, type RelationshipGraphAdapterSyncResult, type RelationshipGraphSnapshot, } from "./adapter.js";
 export { assertMemoryRelationshipGraphAdapterConformance, assertRelationshipGraphAdapterConformance, createRelationshipGraphScaleFixture, type RelationshipGraphAdapterConformanceCase, type RelationshipGraphAdapterConformanceReport, type RelationshipGraphScaleFixture, type RelationshipGraphScaleFixtureOptions, type RelationshipGraphScaleTopology, } from "./conformance.js";
 export { analyzeRelationshipSchedule, type GraphScheduleOptions, type RelationshipScheduleAnalysis, type RelationshipScheduleRow, } from "./scheduling.js";
+export { deriveRelationshipDeadlines, type DeadlineScheduleItem, type DeadlineScheduleOptions, type DeadlineScheduleRow, type DeadlineScheduleResidual, type DeadlineOvercommitment, type DeadlineScheduleResult, } from "./deadline-scheduling.js";
 export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectDuplicateDependencyRows, collectMissingDependencyTargetIds, collectOrderingStorageContradictions, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, type DanglingDependencyReference, type DanglingDependencyReferenceSummary, type DependencyReferenceHolder, type DependencyReferenceSource, type DuplicateDependencyRow, type OrderingStorageContradiction, type WorkspaceRelationshipAssembly, type WorkspaceRelationshipItem, type WorkspaceRelationshipNodeDetails, } from "./assembly.js";
-export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, formatOrderingStorageContradiction, type DuplicateRelationshipEdgeGroup, type RelationshipAuditDelta, type RelationshipAuditFinding, type RelationshipAuditFindingCode, type RelationshipAuditOptions, type RelationshipAuditReport, type RelationshipAuditSeverity, type RelationshipAuditSnapshot, type RelationshipCoverageProfile, type RelationshipCoverageTypeProfile, } from "./governance.js";
+export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, formatOrderingStorageContradiction, type DuplicateRelationshipEdgeGroup, type RelationshipAuditDelta, type RelationshipAuditFinding, type RelationshipAuditFindingCode, type RelationshipAuditOptions, type RelationshipAuditReport, type RelationshipAuditSeverity, type RelationshipAuditSnapshot, type RelationshipCoverageProfile, type RelationshipCoverageTypeProfile, type RelationshipPopulationCoverage, type RelationshipLifecycleCoverage, } from "./governance.js";
 export { analyzeHierarchyIntegrity, assertHierarchyMutationAllowed, collectHierarchyRelations, formatHierarchyRelation, indexHierarchyRelations, type HierarchyCardinalityViolation, type HierarchyCycle, type HierarchyIntegrityAnalysis, type HierarchyIntegrityItem, type HierarchyParentDivergence, type HierarchyRelation, type HierarchyRelationIndexes, type HierarchyRelationSource, } from "./hierarchy-integrity.js";
 export { clearDurableGraphCache, durableGraphCachePath, durableGraphCacheStatus, GRAPH_DURABLE_CACHE_MIN_ITEMS, GRAPH_DURABLE_CACHE_VERSION, graphAuditBaselinePath, loadGraphAuditBaseline, openDurableGraphCache, persistDurableGraphResult, saveGraphAuditBaseline, shouldPersistDurableGraphCache, type DurableGraphCacheEnvelope, type DurableGraphCacheStatus, type DurableGraphCacheView, } from "./durable-cache.js";
 export { enumerateRelationshipPaths, hierarchyAncestors, hierarchyDescendants, orderingPredecessors, orderingSuccessors, type GraphPathOptions, type GraphTraversalOptions, type RelationshipPath, } from "./traversal.js";
 export { computeWorkspaceGraphFingerprint, resetWorkspaceGraphCache, workspaceGraphCache, WorkspaceGraphCache, type GraphCacheMetadata, type WorkspaceGraphCacheLookup, } from "./cache.js";
 export { planRelationshipRemediation, type RelationshipRemediationCode, type RelationshipRemediationConfidence, type RelationshipRemediationOperation, type RelationshipRemediationPlan, type RelationshipRemediationPlanOptions, type RelationshipRemediationStep, } from "./remediation.js";
 export { collectNewOrderingCycleWarnings } from "./mutation-advisory.js";
-export { GRAPH_SUBCOMMAND_VALUES, parseGraphSubcommand, runGraph, type GraphAnalyzeResult, type GraphArticulationResult, type GraphAuditResult, type GraphBridgeRow, type GraphCentralityResult, type GraphCentralityRow, type GraphCommandOptions, type GraphCommunitiesResult, type GraphCommunityRow, type GraphDominatorRow, type GraphDominatorsResult, type GraphExecutionSummary, type GraphImpactResult, type GraphImpactRow, type GraphHierarchySummary, type GraphIndexResult, type GraphKnowledgeSummary, type GraphPathRow, type GraphPathsResult, type GraphPlanResult, type GraphQueryCost, type GraphRedundancyResult, type GraphRedundancyRow, type GraphResult, type GraphScheduleRow, type GraphSlackResult, type GraphSubcommand, type GraphTraversalResult, } from "./run.js";
+export { GRAPH_SUBCOMMAND_VALUES, parseGraphSubcommand, runGraph, type GraphAnalyzeResult, type GraphArticulationResult, type GraphAuditResult, type GraphAuditSummaryResult, type GraphBridgeRow, type GraphCentralityResult, type GraphCentralityRow, type GraphCommandOptions, type GraphCommunitiesResult, type GraphCommunityRow, type GraphDominatorRow, type GraphDominatorsResult, type GraphExecutionSummary, type GraphImpactResult, type GraphImpactRow, type GraphHierarchySummary, type GraphIndexResult, type GraphKnowledgeSummary, type GraphPathRow, type GraphPathsResult, type GraphPlanResult, type GraphQueryCost, type GraphRedundancyResult, type GraphRedundancyRow, type GraphResult, type GraphScheduleRow, type GraphSlackResult, type GraphSubcommand, type GraphTraversalResult, } from "./run.js";

package/dist/sdk/graph/index.js

@@ -1,27 +1,2 @@
-/**
- * @module sdk/graph
- *
- * Public workspace graph toolkit: one-pass relationship assembly with
- * missing-reference governance, registry-semantics traversal (hierarchy,
- * execution order, bounded path enumeration), and the policy-aware
- * relationship audit. Everything here layers on the dependency-free kernel in
- * `sdk/relationships` and is safe for CLI, MCP, extension, and non-PM callers.
- */
-
-!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]="20842b89-cef6-542e-b069-76c22b340f1d")}catch(e){}}();
-export { computeRelationshipDominators, detectRelationshipCommunities, findRedundantRelationshipEdges, forEachMatchedRelationshipEdge, } from "./analytics.js";
-export { computeRelationshipCentrality, findRelationshipCutStructure, } from "./centrality.js";
-export { createRelationshipGraphSnapshot, federateRelationshipGraphSnapshots, loadRelationshipGraphAdapter, MemoryRelationshipGraphAdapter, parseRelationshipGraphSnapshot, RELATIONSHIP_GRAPH_SNAPSHOT_VERSION, syncRelationshipGraphAdapter, } from "./adapter.js";
-export { assertMemoryRelationshipGraphAdapterConformance, assertRelationshipGraphAdapterConformance, createRelationshipGraphScaleFixture, } from "./conformance.js";
-export { analyzeRelationshipSchedule, } from "./scheduling.js";
-export { assembleWorkspaceRelationshipGraph, collectDanglingDependencyReferences, collectDuplicateDependencyRows, collectMissingDependencyTargetIds, collectOrderingStorageContradictions, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
-export { auditWorkspaceRelationshipGraph, collectDuplicateRelationshipEdgeGroups, collectOrderingCycles, diffRelationshipAuditSnapshots, formatDuplicateEdgeGroup, formatOrderingStorageContradiction, } from "./governance.js";
-export { analyzeHierarchyIntegrity, assertHierarchyMutationAllowed, collectHierarchyRelations, formatHierarchyRelation, indexHierarchyRelations, } from "./hierarchy-integrity.js";
-export { clearDurableGraphCache, durableGraphCachePath, durableGraphCacheStatus, GRAPH_DURABLE_CACHE_MIN_ITEMS, GRAPH_DURABLE_CACHE_VERSION, graphAuditBaselinePath, loadGraphAuditBaseline, openDurableGraphCache, persistDurableGraphResult, saveGraphAuditBaseline, shouldPersistDurableGraphCache, } from "./durable-cache.js";
-export { enumerateRelationshipPaths, hierarchyAncestors, hierarchyDescendants, orderingPredecessors, orderingSuccessors, } from "./traversal.js";
-export { computeWorkspaceGraphFingerprint, resetWorkspaceGraphCache, workspaceGraphCache, WorkspaceGraphCache, } from "./cache.js";
-export { planRelationshipRemediation, } from "./remediation.js";
-export { collectNewOrderingCycleWarnings } from "./mutation-advisory.js";
-export { GRAPH_SUBCOMMAND_VALUES, parseGraphSubcommand, runGraph, } from "./run.js";
+!(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]="c59413c4-8955-5560-8bc6-f1dc9c8c5042")}catch(e2){}})();import{computeRelationshipDominators,detectRelationshipCommunities,findRedundantRelationshipEdges,forEachMatchedRelationshipEdge}from"./analytics.js";import{computeRelationshipCentrality,findRelationshipCutStructure}from"./centrality.js";import{createRelationshipGraphSnapshot,federateRelationshipGraphSnapshots,loadRelationshipGraphAdapter,MemoryRelationshipGraphAdapter,parseRelationshipGraphSnapshot,RELATIONSHIP_GRAPH_SNAPSHOT_VERSION,syncRelationshipGraphAdapter}from"./adapter.js";import{assertMemoryRelationshipGraphAdapterConformance,assertRelationshipGraphAdapterConformance,createRelationshipGraphScaleFixture}from"./conformance.js";import{analyzeRelationshipSchedule}from"./scheduling.js";import{deriveRelationshipDeadlines}from"./deadline-scheduling.js";import{assembleWorkspaceRelationshipGraph,collectDanglingDependencyReferences,collectDuplicateDependencyRows,collectMissingDependencyTargetIds,collectOrderingStorageContradictions,normalizeDependencyGraphTarget,resolveWorkspaceRelationshipKindRegistry}from"./assembly.js";import{auditWorkspaceRelationshipGraph,collectDuplicateRelationshipEdgeGroups,collectOrderingCycles,diffRelationshipAuditSnapshots,formatDuplicateEdgeGroup,formatOrderingStorageContradiction}from"./governance.js";import{analyzeHierarchyIntegrity,assertHierarchyMutationAllowed,collectHierarchyRelations,formatHierarchyRelation,indexHierarchyRelations}from"./hierarchy-integrity.js";import{clearDurableGraphCache,durableGraphCachePath,durableGraphCacheStatus,GRAPH_DURABLE_CACHE_MIN_ITEMS,GRAPH_DURABLE_CACHE_VERSION,graphAuditBaselinePath,loadGraphAuditBaseline,openDurableGraphCache,persistDurableGraphResult,saveGraphAuditBaseline,shouldPersistDurableGraphCache}from"./durable-cache.js";import{enumerateRelationshipPaths,hierarchyAncestors,hierarchyDescendants,orderingPredecessors,orderingSuccessors}from"./traversal.js";import{computeWorkspaceGraphFingerprint,resetWorkspaceGraphCache,workspaceGraphCache,WorkspaceGraphCache}from"./cache.js";import{planRelationshipRemediation}from"./remediation.js";import{collectNewOrderingCycleWarnings}from"./mutation-advisory.js";import{GRAPH_SUBCOMMAND_VALUES,parseGraphSubcommand,runGraph}from"./run.js";export{GRAPH_DURABLE_CACHE_MIN_ITEMS,GRAPH_DURABLE_CACHE_VERSION,GRAPH_SUBCOMMAND_VALUES,MemoryRelationshipGraphAdapter,RELATIONSHIP_GRAPH_SNAPSHOT_VERSION,WorkspaceGraphCache,analyzeHierarchyIntegrity,analyzeRelationshipSchedule,assembleWorkspaceRelationshipGraph,assertHierarchyMutationAllowed,assertMemoryRelationshipGraphAdapterConformance,assertRelationshipGraphAdapterConformance,auditWorkspaceRelationshipGraph,clearDurableGraphCache,collectDanglingDependencyReferences,collectDuplicateDependencyRows,collectDuplicateRelationshipEdgeGroups,collectHierarchyRelations,collectMissingDependencyTargetIds,collectNewOrderingCycleWarnings,collectOrderingCycles,collectOrderingStorageContradictions,computeRelationshipCentrality,computeRelationshipDominators,computeWorkspaceGraphFingerprint,createRelationshipGraphScaleFixture,createRelationshipGraphSnapshot,deriveRelationshipDeadlines,detectRelationshipCommunities,diffRelationshipAuditSnapshots,durableGraphCachePath,durableGraphCacheStatus,enumerateRelationshipPaths,federateRelationshipGraphSnapshots,findRedundantRelationshipEdges,findRelationshipCutStructure,forEachMatchedRelationshipEdge,formatDuplicateEdgeGroup,formatHierarchyRelation,formatOrderingStorageContradiction,graphAuditBaselinePath,hierarchyAncestors,hierarchyDescendants,indexHierarchyRelations,loadGraphAuditBaseline,loadRelationshipGraphAdapter,normalizeDependencyGraphTarget,openDurableGraphCache,orderingPredecessors,orderingSuccessors,parseGraphSubcommand,parseRelationshipGraphSnapshot,persistDurableGraphResult,planRelationshipRemediation,resetWorkspaceGraphCache,resolveWorkspaceRelationshipKindRegistry,runGraph,saveGraphAuditBaseline,shouldPersistDurableGraphCache,syncRelationshipGraphAdapter,workspaceGraphCache};
 //# sourceMappingURL=index.js.map
-//# debugId=20842b89-cef6-542e-b069-76c22b340f1d

package/dist/sdk/graph/lifecycle-coverage.d.ts

@@ -0,0 +1,32 @@
+/** @module sdk/graph/lifecycle-coverage Recorded-node connectivity censuses across lifecycle and schema-defined statuses. */
+import type { WorkspaceRelationshipAssembly } from "./assembly.js";
+/** Connectivity counts over an explicitly named recorded-node population. */
+export interface RelationshipPopulationCoverage {
+    /** Recorded items in the population, including outcome anchors. */
+    nodes: number;
+    /** Items with no incident relationship. */
+    isolated: number;
+    /** Items with zero or one incident relationship. */
+    degree_leq_one: number;
+    /** Items with at least one incident provenance or verification edge. */
+    semantic_nodes: number;
+    /** Items without incident provenance or verification edges. */
+    without_semantic_edges: number;
+    /** Incident directed-edge degree distribution, keyed by exact degree. */
+    degree_histogram: Record<string, number>;
+}
+/** Named lifecycle slices and raw-status slices share the same counting convention. */
+export interface RelationshipLifecycleCoverage {
+    /** Missing and external placeholders are excluded from every population. */
+    coverage_by_lifecycle: Record<"all" | "active" | "terminal", RelationshipPopulationCoverage>;
+    /** Raw schema statuses are retained, including custom terminal statuses. */
+    coverage_by_status: Record<string, RelationshipPopulationCoverage>;
+}
+/** Count each recorded item once per slice; edge incidence uses the assembled graph's deduplicated directed basis. */
+export declare function profileRelationshipLifecycles(assembly: WorkspaceRelationshipAssembly, isTerminal: (status: string) => boolean, isSemantic: (kind: string) => boolean, signal?: AbortSignal): RelationshipLifecycleCoverage;
+/** Accept legacy absence, but reject partial or malformed new lifecycle census fields. */
+export declare function validLifecycleSnapshot(profile: Record<string, unknown>): boolean;
+/** Compare measured lifecycle censuses; legacy baselines remain explicitly incomparable. */
+export declare function diffLifecycleCoverage(before: Partial<RelationshipLifecycleCoverage>, after: Partial<RelationshipLifecycleCoverage>): Partial<RelationshipLifecycleCoverage> & {
+    lifecycle_comparable: boolean;
+};

package/dist/sdk/graph/lifecycle-coverage.js

@@ -0,0 +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]="2bfc4e78-a376-5099-be50-38e339eac660")}catch(e2){}})();function emptyCoverage(){return{nodes:0,isolated:0,degree_leq_one:0,semantic_nodes:0,without_semantic_edges:0,degree_histogram:{}}}function profileRelationshipLifecycles(assembly,isTerminal,isSemantic,signal){const lifecycle={all:emptyCoverage(),active:emptyCoverage(),terminal:emptyCoverage()};const statuses=new Map;for(const detail of assembly.details){signal?.throwIfAborted();if(assembly.missingIdSet.has(detail.id.toLowerCase())||detail.status==="external")continue;const status=statuses.get(detail.status)??emptyCoverage();statuses.set(detail.status,status);const incident=assembly.graph.incidentEdges(detail.id);const semantic=incident.some(edge=>isSemantic(edge.kind));for(const bucket of[lifecycle.all,lifecycle[isTerminal(detail.status)?"terminal":"active"],status]){bucket.nodes+=1;bucket.isolated+=Number(incident.length===0);if(incident.length<=1)bucket.degree_leq_one+=1;if(semantic)bucket.semantic_nodes+=1;else bucket.without_semantic_edges+=1;const degree=String(incident.length);bucket.degree_histogram[degree]=(bucket.degree_histogram[degree]??0)+1}}return{coverage_by_lifecycle:lifecycle,coverage_by_status:Object.fromEntries([...statuses].sort(([left],[right])=>left.localeCompare(right)))}}function validPopulation(value){if(!isCoverageRecord(value))return false;const row=value;const fields=["nodes","isolated","degree_leq_one","semantic_nodes","without_semantic_edges"];if(!fields.every(field=>Number.isSafeInteger(row[field])&&Number(row[field])>=0))return false;if(!isCoverageRecord(row.degree_histogram))return false;const histogram=Object.entries(row.degree_histogram);return histogram.every(([key,count])=>/^(0|[1-9]\d*)$/.test(key)&&Number.isSafeInteger(count)&&Number(count)>=0)&&histogram.reduce((sum,[,count])=>sum+Number(count),0)===row.nodes&&Number(row.isolated)<=Number(row.degree_leq_one)&&Number(row.degree_leq_one)<=Number(row.nodes)&&Number(row.semantic_nodes)+Number(row.without_semantic_edges)===row.nodes}function isCoverageRecord(value){return typeof value==="object"&&value!==null&&!Array.isArray(value)}function validLifecycleSnapshot(profile){for(const field of["ordering_acyclic","active_ordering_acyclic"]){if(profile[field]!==void 0&&typeof profile[field]!=="boolean")return false}const lifecycle=profile.coverage_by_lifecycle;const statuses=profile.coverage_by_status;if(lifecycle===void 0&&statuses===void 0)return true;if(!isCoverageRecord(lifecycle)||!isCoverageRecord(statuses))return false;return["all","active","terminal"].every(key=>validPopulation(lifecycle[key]))&&Object.values(statuses).every(validPopulation)}function diffPopulations(before,after){return Object.fromEntries([...new Set([...Object.keys(before),...Object.keys(after)])].sort().map(key=>{const left=Object.hasOwn(before,key)?before[key]:emptyCoverage();const right=Object.hasOwn(after,key)?after[key]:emptyCoverage();const histogram=Object.fromEntries([...new Set([...Object.keys(left.degree_histogram),...Object.keys(right.degree_histogram)])].sort().map(degree=>[degree,(right.degree_histogram[degree]??0)-(left.degree_histogram[degree]??0)]));return[key,{nodes:right.nodes-left.nodes,isolated:right.isolated-left.isolated,degree_leq_one:right.degree_leq_one-left.degree_leq_one,semantic_nodes:right.semantic_nodes-left.semantic_nodes,without_semantic_edges:right.without_semantic_edges-left.without_semantic_edges,degree_histogram:histogram}]}))}function diffLifecycleCoverage(before,after){if(!before.coverage_by_lifecycle||!after.coverage_by_lifecycle||!before.coverage_by_status||!after.coverage_by_status)return{lifecycle_comparable:false};return{lifecycle_comparable:true,coverage_by_lifecycle:diffPopulations(before.coverage_by_lifecycle,after.coverage_by_lifecycle),coverage_by_status:diffPopulations(before.coverage_by_status,after.coverage_by_status)}}export{diffLifecycleCoverage,profileRelationshipLifecycles,validLifecycleSnapshot};
+//# sourceMappingURL=lifecycle-coverage.js.map

package/dist/sdk/graph/mutation-advisory.js

@@ -1,177 +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]="94e8b95b-35fa-5fc7-843a-481497e09b54")}catch(e){}}();
-import { collectOrderingStorageContradictions, normalizeDependencyGraphTarget, resolveWorkspaceRelationshipKindRegistry, } from "./assembly.js";
-import { collectOrderingCycles, formatOrderingStorageContradiction, } from "./governance.js";
-function cycleKey(component) {
-    return [...component].sort().join("\u0000");
-}
-/** Append one oriented ordering edge to both adjacency orientations. */
-function addOrderingEdge(digraph, predecessor, successor) {
-    const forward = digraph.successors.get(predecessor);
-    if (forward)
-        forward.push(successor);
-    else
-        digraph.successors.set(predecessor, [successor]);
-    const backward = digraph.predecessors.get(successor);
-    if (backward)
-        backward.push(predecessor);
-    else
-        digraph.predecessors.set(successor, [predecessor]);
-}
-/**
- * Orient one candidate reference into the digraph when its kind is a
- * registry-known order-bearing kind and its target resolves to a real item.
- * Associative kinds, unknown kinds, retired sentinels, and references to
- * absent items are skipped because none of them can create an
- * execution-order cycle — a referenced-but-absent item has no stored
- * out-edges.
- */
-function orientOrderingEdge(digraph, registry, source, target, kind) {
-    const definition = registry.resolve(kind);
-    if (definition?.ordering !== true)
-        return;
-    const normalized = normalizeDependencyGraphTarget(target);
-    const canonicalTarget = normalized === undefined
-        ? undefined
-        : digraph.canonicalIds.get(normalized.toLowerCase());
-    if (canonicalTarget === undefined)
-        return;
-    const sourceFirst = (definition.precedence ?? "source_before_target") ===
-        "source_before_target";
-    addOrderingEdge(digraph, sourceFirst ? source : canonicalTarget, sourceFirst ? canonicalTarget : source);
-}
-/**
- * Build the ordering-only digraph for one item snapshot without assembling a
- * full relationship graph: one linear pass over the legacy scalar blocker and
- * structured dependency rows of every item.
- */
-function buildOrderingDigraph(items, registry) {
-    const digraph = {
-        successors: new Map(),
-        predecessors: new Map(),
-        canonicalIds: new Map(),
-    };
-    const safeItems = items.filter((item) => typeof item?.id === "string" && item.id.trim().length > 0);
-    for (const item of safeItems) {
-        const id = item.id.trim();
-        digraph.canonicalIds.set(id.toLowerCase(), id);
-    }
-    for (const item of safeItems) {
-        const id = item.id.trim();
-        orientOrderingEdge(digraph, registry, id, item.blocked_by, "blocked_by");
-        for (const dependency of item.dependencies ?? []) {
-            if (typeof dependency !== "object" || dependency === null)
-                continue;
-            orientOrderingEdge(digraph, registry, id, dependency.id, typeof dependency.kind === "string" ? dependency.kind : "related");
-        }
-    }
-    for (const adjacency of [digraph.successors, digraph.predecessors])
-        for (const neighbors of adjacency.values())
-            neighbors.sort();
-    return digraph;
-}
-/**
- * Collect the changed item's weakly connected ordering component: every node
- * reachable through ordering edges in either orientation. Cycle enumeration
- * restricted to this member set is exact for cycles containing the changed
- * item, because a strongly connected component is always contained in a
- * weakly connected one.
- */
-function collectWeakComponent(digraph, start) {
-    const members = new Set([start]);
-    const queue = [start];
-    while (queue.length > 0) {
-        const node = queue.pop();
-        for (const adjacency of [digraph.successors, digraph.predecessors]) {
-            for (const neighbor of adjacency.get(node) ?? []) {
-                if (members.has(neighbor))
-                    continue;
-                members.add(neighbor);
-                queue.push(neighbor);
-            }
-        }
-    }
-    return members;
-}
-/** Restrict a successor adjacency to edges whose endpoints are both members. */
-function induceSuccessors(digraph, members) {
-    const induced = new Map();
-    for (const member of members) {
-        const neighbors = (digraph.successors.get(member) ?? []).filter((node) => members.has(node));
-        if (neighbors.length > 0)
-            induced.set(member, neighbors);
-    }
-    return induced;
-}
-/** Enumerate component-scoped ordering cycles around one canonical item id. */
-function collectScopedCycles(items, registry, changedItemId) {
-    const digraph = buildOrderingDigraph(items, registry);
-    const canonical = digraph.canonicalIds.get(changedItemId.trim().toLowerCase());
-    if (canonical === undefined)
-        return { cycles: [], successors: new Map(), canonical: changedItemId };
-    const successors = induceSuccessors(digraph, collectWeakComponent(digraph, canonical));
-    return {
-        cycles: collectOrderingCycles(successors).filter((component) => component.includes(canonical)),
-        successors,
-        canonical,
-    };
-}
-function findCyclePath(adjacency, component, changedItemId) {
-    const members = new Set(component);
-    const start = members.has(changedItemId) ? changedItemId : component[0];
-    if (adjacency.get(start)?.includes(start))
-        return [start, start];
-    for (const first of adjacency.get(start) ?? []) {
-        if (!members.has(first))
-            continue;
-        const path = findPathBackToStart(adjacency, members, start, first);
-        if (path)
-            return path;
-    }
-    return [...component, component[0]];
-}
-function findPathBackToStart(adjacency, members, start, first) {
-    const queue = [[first]];
-    const visited = new Set([start, first]);
-    while (queue.length > 0) {
-        const path = queue.shift();
-        const tail = path.at(-1);
-        for (const next of adjacency.get(tail) ?? []) {
-            if (next === start)
-                return [start, ...path, start];
-            if (!members.has(next) || visited.has(next))
-                continue;
-            visited.add(next);
-            queue.push([...path, next]);
-        }
-    }
-    return undefined;
-}
-/** Return actionable warnings only for ordering cycles created by the later snapshot and containing the changed item. */
-export function collectNewOrderingCycleWarnings(beforeItems, afterItems, changedItemId) {
-    const registry = resolveWorkspaceRelationshipKindRegistry();
-    const before = collectScopedCycles(beforeItems, registry, changedItemId);
-    const after = collectScopedCycles(afterItems, registry, changedItemId);
-    const beforeCycles = new Set(before.cycles.map(cycleKey));
-    const beforeContradictions = new Set(collectOrderingStorageContradictions(beforeItems, undefined, registry).map((row) => `${row.holder_id.toLowerCase()}\u0000${row.target_id.toLowerCase()}\u0000${row.dependency_kind}`));
-    const contradictionWarnings = collectOrderingStorageContradictions(afterItems, undefined, registry)
-        .filter((row) => row.holder_id.toLowerCase() === changedItemId.trim().toLowerCase() &&
-        !beforeContradictions.has(`${row.holder_id.toLowerCase()}\u0000${row.target_id.toLowerCase()}\u0000${row.dependency_kind}`))
-        .map((row) => `ordering_storage_contradiction_created:${formatOrderingStorageContradiction(row)}:remove_contradicting_dependency_row:run_pm_graph_audit`);
-    return [
-        ...contradictionWarnings,
-        ...after.cycles
-            .filter((component) => !beforeCycles.has(cycleKey(component)))
-            .map((component) => `ordering_cycle_created:${findCyclePath(after.successors, component, after.canonical).join(" -> ")}:items_will_not_be_ready:run_pm_graph_audit`),
-    ];
-}
-/** White-box graph-path helpers for exhaustive SDK primitive verification. */
-export const mutationAdvisoryTestOnly = {
-    buildOrderingDigraph,
-    collectWeakComponent,
-    induceSuccessors,
-    findCyclePath,
-    findPathBackToStart,
-};
+!(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]="874a21db-ed3b-5b4f-a913-bf87103172e7")}catch(e2){}})();import{collectOrderingStorageContradictions,normalizeDependencyGraphTarget,resolveWorkspaceRelationshipKindRegistry}from"./assembly.js";import{collectOrderingCycles,formatOrderingStorageContradiction}from"./governance.js";function cycleKey(component){return[...component].sort().join("\0")}function addOrderingEdge(digraph,predecessor,successor){const forward=digraph.successors.get(predecessor);if(forward)forward.push(successor);else digraph.successors.set(predecessor,[successor]);const backward=digraph.predecessors.get(successor);if(backward)backward.push(predecessor);else digraph.predecessors.set(successor,[predecessor])}function orientOrderingEdge(digraph,registry,source,target,kind){const definition=registry.resolve(kind);if(definition?.ordering!==true)return;const normalized=normalizeDependencyGraphTarget(target);const canonicalTarget=normalized===void 0?void 0:digraph.canonicalIds.get(normalized.toLowerCase());if(canonicalTarget===void 0)return;const sourceFirst=(definition.precedence??"source_before_target")==="source_before_target";addOrderingEdge(digraph,sourceFirst?source:canonicalTarget,sourceFirst?canonicalTarget:source)}function buildOrderingDigraph(items,registry){const digraph={successors:new Map,predecessors:new Map,canonicalIds:new Map};const safeItems=items.filter(item=>typeof item?.id==="string"&&item.id.trim().length>0);for(const item of safeItems){const id=item.id.trim();digraph.canonicalIds.set(id.toLowerCase(),id)}for(const item of safeItems){const id=item.id.trim();orientOrderingEdge(digraph,registry,id,item.blocked_by,"blocked_by");for(const dependency of item.dependencies??[]){if(typeof dependency!=="object"||dependency===null)continue;orientOrderingEdge(digraph,registry,id,dependency.id,typeof dependency.kind==="string"?dependency.kind:"related")}}for(const adjacency of[digraph.successors,digraph.predecessors])for(const neighbors of adjacency.values())neighbors.sort();return digraph}function collectWeakComponent(digraph,start){const members=new Set([start]);const queue=[start];while(queue.length>0){const node=queue.pop();for(const adjacency of[digraph.successors,digraph.predecessors]){for(const neighbor of adjacency.get(node)??[]){if(members.has(neighbor))continue;members.add(neighbor);queue.push(neighbor)}}}return members}function induceSuccessors(digraph,members){const induced=new Map;for(const member of members){const neighbors=(digraph.successors.get(member)??[]).filter(node=>members.has(node));if(neighbors.length>0)induced.set(member,neighbors)}return induced}function collectScopedCycles(items,registry,changedItemId){const digraph=buildOrderingDigraph(items,registry);const canonical=digraph.canonicalIds.get(changedItemId.trim().toLowerCase());if(canonical===void 0)return{cycles:[],successors:new Map,canonical:changedItemId};const successors=induceSuccessors(digraph,collectWeakComponent(digraph,canonical));return{cycles:collectOrderingCycles(successors).filter(component=>component.includes(canonical)),successors,canonical}}function findCyclePath(adjacency,component,changedItemId){const members=new Set(component);const start=members.has(changedItemId)?changedItemId:component[0];if(adjacency.get(start)?.includes(start))return[start,start];for(const first of adjacency.get(start)??[]){if(!members.has(first))continue;const path=findPathBackToStart(adjacency,members,start,first);if(path)return path}return[...component,component[0]]}function findPathBackToStart(adjacency,members,start,first){const queue=[[first]];const visited=new Set([start,first]);while(queue.length>0){const path=queue.shift();const tail=path.at(-1);for(const next of adjacency.get(tail)??[]){if(next===start)return[start,...path,start];if(!members.has(next)||visited.has(next))continue;visited.add(next);queue.push([...path,next])}}return void 0}function collectNewOrderingCycleWarnings(beforeItems,afterItems,changedItemId){const registry=resolveWorkspaceRelationshipKindRegistry();const before=collectScopedCycles(beforeItems,registry,changedItemId);const after=collectScopedCycles(afterItems,registry,changedItemId);const beforeCycles=new Set(before.cycles.map(cycleKey));const beforeContradictions=new Set(collectOrderingStorageContradictions(beforeItems,void 0,registry).map(row=>`${row.holder_id.toLowerCase()}\0${row.target_id.toLowerCase()}\0${row.dependency_kind}`));const contradictionWarnings=collectOrderingStorageContradictions(afterItems,void 0,registry).filter(row=>row.holder_id.toLowerCase()===changedItemId.trim().toLowerCase()&&!beforeContradictions.has(`${row.holder_id.toLowerCase()}\0${row.target_id.toLowerCase()}\0${row.dependency_kind}`)).map(row=>`ordering_storage_contradiction_created:${formatOrderingStorageContradiction(row)}:remove_contradicting_dependency_row:run_pm_graph_audit`);return[...contradictionWarnings,...after.cycles.filter(component=>!beforeCycles.has(cycleKey(component))).map(component=>`ordering_cycle_created:${findCyclePath(after.successors,component,after.canonical).join(" -> ")}:items_will_not_be_ready:run_pm_graph_audit`)]}const mutationAdvisoryTestOnly={buildOrderingDigraph,collectWeakComponent,induceSuccessors,findCyclePath,findPathBackToStart};export{collectNewOrderingCycleWarnings,mutationAdvisoryTestOnly};
 //# sourceMappingURL=mutation-advisory.js.map
-//# debugId=94e8b95b-35fa-5fc7-843a-481497e09b54