@unbrained/pm-cli 2026.10.11 → 2026.10.13

package/dist/sdk/governance/workspace-position.d.ts

@@ -4,54 +4,54 @@ import { type MergeDriverConfigurationAuditResult, type MergeFenceAuditResult }
 export type WorkspacePositionState = "ready" | "merge_evidence_invalid" | "history_evidence_invalid" | "merge_reconciliation_required" | "history_repair_required" | "merge_fence_unprepared";
 /** One deterministic recovery action selected from aggregate workspace evidence. */
 export interface WorkspacePositionNextAction {
-    /** Executable pm command, or null when the workspace is ready. */
-    command: string | null;
-    /** Stable reason code explaining why this action takes precedence. */
-    reason: WorkspacePositionState;
+/** Executable pm command, or null when the workspace is ready. */
+command: string | null;
+/** Stable reason code explaining why this action takes precedence. */
+reason: WorkspacePositionState;
 }
 /** Bounded SDK result shared by CLI, MCP, and package consumers. */
 export interface WorkspacePositionResult {
-    /** Whether all readiness evidence is clean. */
-    ok: boolean;
-    /** Highest-priority workspace readiness classification. */
-    state: WorkspacePositionState;
-    /** Committed merge-fence and clone-local driver evidence. */
-    merge_fence: {
-        committed: MergeFenceAuditResult;
-        clone_local_drivers: MergeDriverConfigurationAuditResult | null;
-    };
-    /** Bounded pending receipt evidence without private merge values. */
-    merge_receipts: {
-        pending_decision_count: number;
-        pending_item_ids: string[];
-        pending_item_ids_truncated: boolean;
-        lossless_count: number;
-        invalid_evidence_count: number;
-    };
-    /** Bounded append-only history drift evidence. */
-    history_drift: {
-        /** Whether the required history-drift evidence has its expected shape. */
-        evidence_valid: boolean;
-        drifted_item_count: number;
-        drifted_item_ids: string[];
-        drifted_item_ids_truncated: boolean;
-        counts: Record<string, unknown>;
-    };
-    /** One deterministic next action, avoiding multi-command guesswork. */
-    next_action: WorkspacePositionNextAction;
-    /** Non-fatal read warnings retained from the authoritative item scan. */
-    warnings: string[];
-    /** ISO timestamp for this aggregate read. */
-    generated_at: string;
+/** Whether all readiness evidence is clean. */
+ok: boolean;
+/** Highest-priority workspace readiness classification. */
+state: WorkspacePositionState;
+/** Committed merge-fence and clone-local driver evidence. */
+merge_fence: {
+committed: MergeFenceAuditResult;
+clone_local_drivers: MergeDriverConfigurationAuditResult | null;
+};
+/** Bounded pending receipt evidence without private merge values. */
+merge_receipts: {
+pending_decision_count: number;
+pending_item_ids: string[];
+pending_item_ids_truncated: boolean;
+lossless_count: number;
+invalid_evidence_count: number;
+};
+/** Bounded append-only history drift evidence. */
+history_drift: {
+/** Whether the required history-drift evidence has its expected shape. */
+evidence_valid: boolean;
+drifted_item_count: number;
+drifted_item_ids: string[];
+drifted_item_ids_truncated: boolean;
+counts: Record<string, unknown>;
+};
+/** One deterministic next action, avoiding multi-command guesswork. */
+next_action: WorkspacePositionNextAction;
+/** Non-fatal read warnings retained from the authoritative item scan. */
+warnings: string[];
+/** ISO timestamp for this aggregate read. */
+generated_at: string;
 }
 declare function selectWorkspacePositionState(params: {
-    invalidEvidenceCount: number;
-    pendingDecisionCount: number;
-    losslessCount: number;
-    historyEvidenceValid: boolean;
-    driftedItemCount: number;
-    fence: MergeFenceAuditResult;
-    drivers: MergeDriverConfigurationAuditResult | null;
+invalidEvidenceCount: number;
+pendingDecisionCount: number;
+losslessCount: number;
+historyEvidenceValid: boolean;
+driftedItemCount: number;
+fence: MergeFenceAuditResult;
+drivers: MergeDriverConfigurationAuditResult | null;
 }): WorkspacePositionState;
 declare function commandForWorkspacePositionState(state: WorkspacePositionState, pmRoot: string, platform?: NodeJS.Platform): string | null;
 /** Normalize defensive history-check evidence into the bounded position shape. */
@@ -62,8 +62,8 @@ export declare function readWorkspacePosition(global: GlobalOptions): Promise<Wo
 export declare function formatWorkspacePositionHuman(result: WorkspacePositionResult): string;
 /** Public contract for focused unit verification. */
 export declare const _testOnlyWorkspacePosition: {
-    commandForWorkspacePositionState: typeof commandForWorkspacePositionState;
-    normalizeWorkspaceHistoryDrift: typeof normalizeWorkspaceHistoryDrift;
-    selectWorkspacePositionState: typeof selectWorkspacePositionState;
+commandForWorkspacePositionState: typeof commandForWorkspacePositionState;
+normalizeWorkspaceHistoryDrift: typeof normalizeWorkspaceHistoryDrift;
+selectWorkspacePositionState: typeof selectWorkspacePositionState;
 };
 export {};

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

@@ -3,75 +3,75 @@ import { RelationshipGraph, RelationshipKindRegistry, type RelationshipEdge, typ
 export declare const RELATIONSHIP_GRAPH_SNAPSHOT_VERSION = 1;
 /** Immutable, content-addressed graph state exchanged with an adapter. */
 export interface RelationshipGraphSnapshot {
-    /** Snapshot format version. */
-    version: number;
-    /** SHA-256 digest of nodes, edges, and relationship semantics. */
-    fingerprint: string;
-    /** ISO timestamp describing when this portable projection was created. */
-    created_at: string;
-    /** Deterministically ordered node identifiers. */
-    nodes: readonly string[];
-    /** Deterministically ordered normalized relationship edges. */
-    edges: readonly RelationshipEdge[];
-    /** Complete relationship ontology required to interpret the edges. */
-    kinds: readonly RelationshipKindDefinition[];
+/** Snapshot format version. */
+version: number;
+/** SHA-256 digest of nodes, edges, and relationship semantics. */
+fingerprint: string;
+/** ISO timestamp describing when this portable projection was created. */
+created_at: string;
+/** Deterministically ordered node identifiers. */
+nodes: readonly string[];
+/** Deterministically ordered normalized relationship edges. */
+edges: readonly RelationshipEdge[];
+/** Complete relationship ontology required to interpret the edges. */
+kinds: readonly RelationshipKindDefinition[];
 }
 /** Common adapter operation context. */
 export interface RelationshipGraphAdapterContext {
-    /** Adapter-owned workspace key; it need not be a filesystem path. */
-    workspace: string;
-    /** Cooperative cancellation signal. */
-    signal?: AbortSignal;
+/** Adapter-owned workspace key; it need not be a filesystem path. */
+workspace: string;
+/** Cooperative cancellation signal. */
+signal?: AbortSignal;
 }
 /** Compare-and-swap replacement context for one complete snapshot. */
 export interface RelationshipGraphAdapterReplaceContext extends RelationshipGraphAdapterContext {
-    /** Validated snapshot that becomes the complete visible graph state. */
-    snapshot: RelationshipGraphSnapshot;
-    /** Expected prior fingerprint; null requires an empty workspace. */
-    expected_fingerprint?: string | null;
+/** Validated snapshot that becomes the complete visible graph state. */
+snapshot: RelationshipGraphSnapshot;
+/** Expected prior fingerprint; null requires an empty workspace. */
+expected_fingerprint?: string | null;
 }
 /** Storage-neutral graph snapshot adapter implemented by SDK packages. */
 export interface RelationshipGraphAdapter {
-    /** Stable adapter identifier used in diagnostics. */
-    readonly name: string;
-    /** Read the current portable snapshot, or null when absent. */
-    read(context: RelationshipGraphAdapterContext): Promise<unknown | null>;
-    /** Atomically replace the complete snapshot with optional CAS protection. */
-    replace(context: RelationshipGraphAdapterReplaceContext): Promise<void>;
-    /** Optionally clear a workspace with the same CAS semantics. */
-    clear?(context: RelationshipGraphAdapterContext & {
-        expected_fingerprint?: string | null;
-    }): Promise<void>;
+/** Stable adapter identifier used in diagnostics. */
+readonly name: string;
+/** Read the current portable snapshot, or null when absent. */
+read(context: RelationshipGraphAdapterContext): Promise<unknown | null>;
+/** Atomically replace the complete snapshot with optional CAS protection. */
+replace(context: RelationshipGraphAdapterReplaceContext): Promise<void>;
+/** Optionally clear a workspace with the same CAS semantics. */
+clear?(context: RelationshipGraphAdapterContext & {
+expected_fingerprint?: string | null;
+}): Promise<void>;
 }
 /** Validated snapshot paired with executable registry and graph views. */
 export interface LoadedRelationshipGraphSnapshot {
-    /** Portable immutable snapshot. */
-    snapshot: RelationshipGraphSnapshot;
-    /** Registry reconstructed from the snapshot ontology. */
-    registry: RelationshipKindRegistry;
-    /** Executable graph reconstructed through the public kernel. */
-    graph: RelationshipGraph;
+/** Portable immutable snapshot. */
+snapshot: RelationshipGraphSnapshot;
+/** Registry reconstructed from the snapshot ontology. */
+registry: RelationshipKindRegistry;
+/** Executable graph reconstructed through the public kernel. */
+graph: RelationshipGraph;
 }
 /** Result of synchronizing one snapshot into an adapter. */
 export interface RelationshipGraphAdapterSyncResult {
-    /** Adapter identifier. */
-    adapter: string;
-    /** Adapter-owned workspace key. */
-    workspace: string;
-    /** Whether a write was required. */
-    disposition: "current" | "written";
-    /** New canonical snapshot fingerprint. */
-    fingerprint: string;
-    /** Prior fingerprint when a snapshot existed. */
-    previous_fingerprint?: string;
-    /** Portable node count. */
-    node_count: number;
-    /** Portable edge count. */
-    edge_count: number;
+/** Adapter identifier. */
+adapter: string;
+/** Adapter-owned workspace key. */
+workspace: string;
+/** Whether a write was required. */
+disposition: "current" | "written";
+/** New canonical snapshot fingerprint. */
+fingerprint: string;
+/** Prior fingerprint when a snapshot existed. */
+previous_fingerprint?: string;
+/** Portable node count. */
+node_count: number;
+/** Portable edge count. */
+edge_count: number;
 }
 /** Build an immutable portable snapshot from a validated graph and registry. */
 export declare function createRelationshipGraphSnapshot(graph: RelationshipGraph, registry: RelationshipKindRegistry, options?: {
-    createdAt?: string;
+createdAt?: string;
 }): RelationshipGraphSnapshot;
 /** Decode and fully validate a portable graph snapshot. */
 export declare function parseRelationshipGraphSnapshot(value: unknown): LoadedRelationshipGraphSnapshot;
@@ -82,25 +82,25 @@ export declare function loadRelationshipGraphAdapter(adapter: RelationshipGraphA
  * verify the adapter's visible read after replacement.
  */
 export declare function syncRelationshipGraphAdapter(adapter: RelationshipGraphAdapter, context: RelationshipGraphAdapterContext & {
-    snapshot: RelationshipGraphSnapshot;
+snapshot: RelationshipGraphSnapshot;
 }): Promise<RelationshipGraphAdapterSyncResult>;
 /** Merge portable snapshots while rejecting semantic kind collisions. */
 export declare function federateRelationshipGraphSnapshots(values: readonly unknown[], options?: {
-    createdAt?: string;
+createdAt?: string;
 }): RelationshipGraphSnapshot;
 /** In-memory reference adapter with atomic CAS behavior for tests and packages. */
 export declare class MemoryRelationshipGraphAdapter implements RelationshipGraphAdapter {
-    #private;
-    /** Stable adapter identifier used in diagnostics and conformance reports. */
-    readonly name: string;
-    /** Create a reference adapter with a stable diagnostic name. */
-    constructor(name?: string);
-    /** Read an isolated clone of the current workspace snapshot. */
-    read(context: RelationshipGraphAdapterContext): Promise<RelationshipGraphSnapshot | null>;
-    /** Atomically replace one workspace after enforcing its expected fingerprint. */
-    replace(context: RelationshipGraphAdapterReplaceContext): Promise<void>;
-    /** Clear one workspace after enforcing its expected fingerprint. */
-    clear(context: RelationshipGraphAdapterContext & {
-        expected_fingerprint?: string | null;
-    }): Promise<void>;
+#private;
+/** Stable adapter identifier used in diagnostics and conformance reports. */
+readonly name: string;
+/** Create a reference adapter with a stable diagnostic name. */
+constructor(name?: string);
+/** Read an isolated clone of the current workspace snapshot. */
+read(context: RelationshipGraphAdapterContext): Promise<RelationshipGraphSnapshot | null>;
+/** Atomically replace one workspace after enforcing its expected fingerprint. */
+replace(context: RelationshipGraphAdapterReplaceContext): Promise<void>;
+/** Clear one workspace after enforcing its expected fingerprint. */
+clear(context: RelationshipGraphAdapterContext & {
+expected_fingerprint?: string | null;
+}): Promise<void>;
 }

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

@@ -12,79 +12,79 @@
 import { RelationshipGraph, type RelationshipEdge, type RelationshipKindDefinition, type RelationshipQueryResult, type RelationshipTraversalDirection } from "../relationships.js";
 /** One detected relationship community. */
 export interface RelationshipCommunity {
-    /** Lexicographically smallest member id, naming the community. */
-    representative: string;
-    /** Total member count. */
-    size: number;
-    /** Sorted member node ids. */
-    members: string[];
+/** Lexicographically smallest member id, naming the community. */
+representative: string;
+/** Total member count. */
+size: number;
+/** Sorted member node ids. */
+members: string[];
 }
 /** Bounded community-detection controls. */
 export interface GraphCommunityOptions {
-    /** Registered relationship kinds whose edges define adjacency. */
-    kinds?: readonly string[];
-    /** Maximum label-propagation sweeps before reporting non-convergence; defaults to 16. */
-    maxIterations?: number;
-    /** Minimum member count for a reported community; defaults to 2. */
-    minSize?: number;
-    /** Abort signal checked once per sweep. */
-    signal?: AbortSignal;
+/** Registered relationship kinds whose edges define adjacency. */
+kinds?: readonly string[];
+/** Maximum label-propagation sweeps before reporting non-convergence; defaults to 16. */
+maxIterations?: number;
+/** Minimum member count for a reported community; defaults to 2. */
+minSize?: number;
+/** Abort signal checked once per sweep. */
+signal?: AbortSignal;
 }
 /** Deterministic label-propagation community analysis. */
 export interface RelationshipCommunityAnalysis {
-    /** Detected communities, largest first and by representative within equal size. */
-    communities: RelationshipCommunity[];
-    /** Label-propagation sweeps executed. */
-    iterations: number;
-    /** Whether labels stabilized before the iteration bound stopped the sweep. */
-    converged: boolean;
+/** Detected communities, largest first and by representative within equal size. */
+communities: RelationshipCommunity[];
+/** Label-propagation sweeps executed. */
+iterations: number;
+/** Whether labels stabilized before the iteration bound stopped the sweep. */
+converged: boolean;
 }
 /** One stored edge implied by a longer same-family witness path. */
 export interface RedundantRelationshipEdge {
-    /** The stored redundant edge in its original spelling. */
-    edge: RelationshipEdge;
-    /** Semantic-orientation witness node path proving the implication, endpoints inclusive. */
-    witness: string[];
+/** The stored redundant edge in its original spelling. */
+edge: RelationshipEdge;
+/** Semantic-orientation witness node path proving the implication, endpoints inclusive. */
+witness: string[];
 }
 /** Bounded redundancy-scan controls. */
 export interface GraphRedundancyOptions {
-    /** Directed ordering or hierarchy kinds to scan; defaults to every eligible registered kind. */
-    kinds?: readonly string[];
-    /** Maximum witness-path depth searched per edge; defaults to 8. */
-    maxDepth?: number;
-    /** Maximum reported redundant edges. */
-    limit?: number;
-    /** Abort signal checked once per scanned edge. */
-    signal?: AbortSignal;
+/** Directed ordering or hierarchy kinds to scan; defaults to every eligible registered kind. */
+kinds?: readonly string[];
+/** Maximum witness-path depth searched per edge; defaults to 8. */
+maxDepth?: number;
+/** Maximum reported redundant edges. */
+limit?: number;
+/** Abort signal checked once per scanned edge. */
+signal?: AbortSignal;
 }
 /** One reachable node with its immediate dominator and gating weight. */
 export interface RelationshipDominatorRow {
-    /** Reachable node id. */
-    id: string;
-    /** Immediate dominator appearing on every root-to-node path. */
-    idom: string;
-    /** Nodes strictly dominated by this node — its dominator-subtree size minus itself. */
-    dominatedCount: number;
+/** Reachable node id. */
+id: string;
+/** Immediate dominator appearing on every root-to-node path. */
+idom: string;
+/** Nodes strictly dominated by this node — its dominator-subtree size minus itself. */
+dominatedCount: number;
 }
 /** Bounded dominator-analysis controls. */
 export interface GraphDominatorOptions {
-    /** Registered relationship kinds whose edges define reachability. */
-    kinds?: readonly string[];
-    /** Traversal direction relative to each visited node; defaults to "outgoing". */
-    direction?: RelationshipTraversalDirection;
-    /** Maximum reachability depth from the root as a non-negative integer. */
-    maxDepth?: number;
-    /** Abort signal checked once per processed node. */
-    signal?: AbortSignal;
+/** Registered relationship kinds whose edges define reachability. */
+kinds?: readonly string[];
+/** Traversal direction relative to each visited node; defaults to "outgoing". */
+direction?: RelationshipTraversalDirection;
+/** Maximum reachability depth from the root as a non-negative integer. */
+maxDepth?: number;
+/** Abort signal checked once per processed node. */
+signal?: AbortSignal;
 }
 /** Dominator-tree analysis of one node's reachable subgraph. */
 export interface RelationshipDominatorAnalysis {
-    /** Analyzed root id. */
-    root: string;
-    /** Reachable node count including the root. */
-    reachableCount: number;
-    /** Non-root reachable rows sorted by gating weight, then id. */
-    rows: RelationshipDominatorRow[];
+/** Analyzed root id. */
+root: string;
+/** Reachable node count including the root. */
+reachableCount: number;
+/** Non-root reachable rows sorted by gating weight, then id. */
+rows: RelationshipDominatorRow[];
 }
 /**
  * Invoke `visit` once per canonical-kind-matched edge, skipping self-loops.
@@ -110,8 +110,8 @@ export declare function isTransitiveKind(definition: RelationshipKindDefinition)
 export declare function transitiveFamilyKey(definition: RelationshipKindDefinition): string;
 /** Orient one transitive edge into its semantic forward direction. */
 export declare function orientTransitiveEdge(edge: RelationshipEdge, definition: RelationshipKindDefinition): {
-    from: string;
-    to: string;
+from: string;
+to: string;
 };
 /**
  * Find stored edges implied by a longer path of the same semantic family —

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

@@ -15,44 +15,44 @@ import { type HierarchyIntegrityAnalysis } from "./hierarchy-integrity.js";
 export { resolveWorkspaceRelationshipKindRegistry } from "./workspace-relationship-kind-registry.js";
 /** Minimal item shape inspected by dependency-reference governance. */
 export interface DependencyReferenceHolder {
-    /** Stable item identifier. */
-    id: string;
-    /** Lifecycle status used to separate actionable work from historical debt. */
-    status: ItemStatus;
-    /** Optional hierarchy parent reference. */
-    parent?: string;
-    /** Optional legacy scalar blocker reference. */
-    blocked_by?: string;
-    /** Structured dependency edges. */
-    dependencies?: Dependency[];
+/** Stable item identifier. */
+id: string;
+/** Lifecycle status used to separate actionable work from historical debt. */
+status: ItemStatus;
+/** Optional hierarchy parent reference. */
+parent?: string;
+/** Optional legacy scalar blocker reference. */
+blocked_by?: string;
+/** Structured dependency edges. */
+dependencies?: Dependency[];
 }
 /** Storage surface that contributed a normalized dependency reference. */
 export type DependencyReferenceSource = "parent" | "blocked_by" | "dependency";
 /** One normalized dependency reference whose target is absent from the tracker. */
 export interface DanglingDependencyReference {
-    /** Item that owns the reference. */
-    holder_id: string;
-    /** Missing referenced item id or legacy sentinel. */
-    target_id: string;
-    /** Relationship field or dependency kind. */
-    kind: string;
-    /** Storage surface that owns the reference and determines its remediation. */
-    source: DependencyReferenceSource;
-    /** Current lifecycle status of the holder. */
-    holder_status: ItemStatus;
-    /** Whether the holder is terminal and therefore historical, non-actionable debt. */
-    legacy_terminal: boolean;
-    /** Whether the target is the pre-structured-dependency `no-active-blocker` sentinel. */
-    no_active_blocker_sentinel: boolean;
+/** Item that owns the reference. */
+holder_id: string;
+/** Missing referenced item id or legacy sentinel. */
+target_id: string;
+/** Relationship field or dependency kind. */
+kind: string;
+/** Storage surface that owns the reference and determines its remediation. */
+source: DependencyReferenceSource;
+/** Current lifecycle status of the holder. */
+holder_status: ItemStatus;
+/** Whether the holder is terminal and therefore historical, non-actionable debt. */
+legacy_terminal: boolean;
+/** Whether the target is the pre-structured-dependency `no-active-blocker` sentinel. */
+no_active_blocker_sentinel: boolean;
 }
 /** Actionable and historical partitions returned by dependency-reference governance. */
 export interface DanglingDependencyReferenceSummary {
-    /** Missing references held by active items; these may affect scheduling and should gate validation. */
-    active: DanglingDependencyReference[];
-    /** Missing references held only by terminal items; retained as informational history debt. */
-    legacy_terminal: DanglingDependencyReference[];
-    /** Legacy sentinel rows across active and terminal holders, called out separately from typo-like ids. */
-    no_active_blocker_sentinels: DanglingDependencyReference[];
+/** Missing references held by active items; these may affect scheduling and should gate validation. */
+active: DanglingDependencyReference[];
+/** Missing references held only by terminal items; retained as informational history debt. */
+legacy_terminal: DanglingDependencyReference[];
+/** Legacy sentinel rows across active and terminal holders, called out separately from typo-like ids. */
+no_active_blocker_sentinels: DanglingDependencyReference[];
 }
 /** Normalize a graph target while removing the historical no-blocker marker. */
 export declare function normalizeDependencyGraphTarget(target: unknown): string | undefined;
@@ -65,31 +65,31 @@ export declare function normalizeDependencyGraphTarget(target: unknown): string
  */
 /** One raw stored dependency row duplicated verbatim on a single holder. */
 export interface DuplicateDependencyRow {
-    /** Item that stores the duplicated row. */
-    holder_id: string;
-    /** Referenced target id in its first stored spelling. */
-    target_id: string;
-    /** Stored relationship kind shared by every duplicate occurrence. */
-    kind: string;
-    /** Total stored occurrences of the identical row (always >= 2). */
-    occurrences: number;
-    /** Current lifecycle status of the holder. */
-    holder_status: ItemStatus;
-    /** Whether the holder is terminal and the duplication is historical debt. */
-    legacy_terminal: boolean;
+/** Item that stores the duplicated row. */
+holder_id: string;
+/** Referenced target id in its first stored spelling. */
+target_id: string;
+/** Stored relationship kind shared by every duplicate occurrence. */
+kind: string;
+/** Total stored occurrences of the identical row (always >= 2). */
+occurrences: number;
+/** Current lifecycle status of the holder. */
+holder_status: ItemStatus;
+/** Whether the holder is terminal and the duplication is historical debt. */
+legacy_terminal: boolean;
 }
 /** One holder whose scalar blocker and structured ordering row assert opposite precedence. */
 export interface OrderingStorageContradiction {
-    /** Item storing both contradictory representations. */
-    holder_id: string;
-    /** Target named by both the scalar blocker and structured dependency row. */
-    target_id: string;
-    /** Structured ordering kind that places the holder before the target. */
-    dependency_kind: string;
-    /** Current lifecycle status of the holder. */
-    holder_status: ItemStatus;
-    /** Whether the holder is terminal and the contradiction is historical debt. */
-    legacy_terminal: boolean;
+/** Item storing both contradictory representations. */
+holder_id: string;
+/** Target named by both the scalar blocker and structured dependency row. */
+target_id: string;
+/** Structured ordering kind that places the holder before the target. */
+dependency_kind: string;
+/** Current lifecycle status of the holder. */
+holder_status: ItemStatus;
+/** Whether the holder is terminal and the contradiction is historical debt. */
+legacy_terminal: boolean;
 }
 /**
  * Collect raw stored dependency rows whose exact identity — holder, kind, and
@@ -121,40 +121,40 @@ export declare function collectMissingDependencyTargetIds(dangling: DanglingDepe
 export declare function collectExternalDependencyTargetIds(items: readonly DependencyReferenceHolder[]): string[];
 /** Item shape accepted by workspace relationship-graph assembly. */
 export interface WorkspaceRelationshipItem extends DependencyReferenceHolder {
-    /** Human-readable title projected into per-node details. */
-    title: string;
-    /** Optional item type powering per-type coverage profiles and policies. */
-    type?: string;
+/** Human-readable title projected into per-node details. */
+title: string;
+/** Optional item type powering per-type coverage profiles and policies. */
+type?: string;
 }
 /** Compact node projection paired with the assembled graph. */
 export interface WorkspaceRelationshipNodeDetails {
-    /** Stable node identifier. */
-    id: string;
-    /** Human-readable node title, or a `[missing]` marker for absent endpoints. */
-    title: string;
-    /** Lifecycle status, or the `missing` marker status for absent endpoints. */
-    status: string;
-    /** Item type when the source item declared one; absent on missing placeholders. */
-    type?: string;
+/** Stable node identifier. */
+id: string;
+/** Human-readable node title, or a `[missing]` marker for absent endpoints. */
+title: string;
+/** Lifecycle status, or the `missing` marker status for absent endpoints. */
+status: string;
+/** Item type when the source item declared one; absent on missing placeholders. */
+type?: string;
 }
 /** Assembled workspace relationship graph with governance side-products. */
 export interface WorkspaceRelationshipAssembly {
-    /** Deterministic relationship graph including missing placeholder nodes. */
-    graph: RelationshipGraph;
-    /** Per-node compact details covering real and missing nodes. */
-    details: WorkspaceRelationshipNodeDetails[];
-    /** Lowercased identifiers of materialized missing endpoints. */
-    missingIdSet: Set<string>;
-    /** Dangling-reference classification computed during assembly. */
-    dangling: DanglingDependencyReferenceSummary;
-    /** Raw same-identity duplicated dependency rows found before graph dedup. */
-    duplicateRows: DuplicateDependencyRow[];
-    /** Scalar-versus-structured ordering contradictions found before graph normalization. */
-    orderingContradictions?: OrderingStorageContradiction[];
-    /** Raw legacy alias rows grouped by accepted spelling before graph canonicalization. */
-    legacyAliasCounts: Record<string, number>;
-    /** Shared hierarchy analysis retained across ordinary object spread copies. */
-    hierarchyIntegrity?: HierarchyIntegrityAnalysis;
+/** Deterministic relationship graph including missing placeholder nodes. */
+graph: RelationshipGraph;
+/** Per-node compact details covering real and missing nodes. */
+details: WorkspaceRelationshipNodeDetails[];
+/** Lowercased identifiers of materialized missing endpoints. */
+missingIdSet: Set<string>;
+/** Dangling-reference classification computed during assembly. */
+dangling: DanglingDependencyReferenceSummary;
+/** Raw same-identity duplicated dependency rows found before graph dedup. */
+duplicateRows: DuplicateDependencyRow[];
+/** Scalar-versus-structured ordering contradictions found before graph normalization. */
+orderingContradictions?: OrderingStorageContradiction[];
+/** Raw legacy alias rows grouped by accepted spelling before graph canonicalization. */
+legacyAliasCounts: Record<string, number>;
+/** Shared hierarchy analysis retained across ordinary object spread copies. */
+hierarchyIntegrity?: HierarchyIntegrityAnalysis;
 }
 /** Read the hierarchy analysis paired with an assembly created by this module. */
 export declare function getWorkspaceHierarchyIntegrity(assembly: WorkspaceRelationshipAssembly): HierarchyIntegrityAnalysis | undefined;