@unbrained/pm-cli 2026.10.13 → 2026.10.15

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

@@ -11,58 +11,58 @@
  * (parallel edges and self-loops collapsed) so a pair connected by any kind
  * counts once.
  */
-import { RelationshipGraph, type RelationshipQueryResult } from "../relationships.js";
+import { RelationshipGraph,type RelationshipQueryResult } from "../relationships.js";
 /** One node ranked by structural centrality with directed fan-in/fan-out. */
 export interface RelationshipCentralityRow {
 /** Node id. */
-id: string;
+id:string;
 /** Undirected unique-neighbor degree over selected kinds. */
-degree: number;
+degree:number;
 /** Distinct ordering predecessors that gate this node (dependency fan-in). */
-inDegree: number;
+inDegree:number;
 /** Distinct ordering successors this node gates (dependency fan-out). */
-outDegree: number;
+outDegree:number;
 /** Shortest-path betweenness centrality, rounded to six decimals. */
-betweenness: number;
+betweenness:number;
 /** Wasserman–Faust closeness centrality, rounded to six decimals. */
-closeness: number;
+closeness:number;
 }
 /** Bounded centrality-analysis controls. */
 export interface GraphCentralityOptions {
 /** Registered relationship kinds whose edges define adjacency. */
-kinds?: readonly string[];
+kinds?:readonly string[];
 /** Abort signal checked once per source sweep. */
-signal?: AbortSignal;
+signal?:AbortSignal;
 }
 /** Deterministic centrality ranking over the undirected knowledge graph. */
 export interface RelationshipCentralityAnalysis {
 /** Total indexed graph nodes. */
-nodeCount: number;
+nodeCount:number;
 /** Simple undirected edge count over selected kinds. */
-edgeCount: number;
+edgeCount:number;
 /** Node rows ranked by betweenness, then degree, then id. */
-rows: RelationshipCentralityRow[];
+rows:RelationshipCentralityRow[];
 }
 /** One undirected bridge edge whose removal disconnects its endpoints. */
 export interface RelationshipBridge {
 /** Lexicographically smaller endpoint. */
-source: string;
+source:string;
 /** Lexicographically larger endpoint. */
-target: string;
+target:string;
 }
 /** Bounded cut-structure controls. */
 export interface GraphCutStructureOptions {
 /** Registered relationship kinds whose edges define adjacency. */
-kinds?: readonly string[];
+kinds?:readonly string[];
 /** Abort signal checked once per depth-first step. */
-signal?: AbortSignal;
+signal?:AbortSignal;
 }
 /** Articulation points and bridges of the undirected knowledge graph. */
 export interface RelationshipCutStructure {
 /** Sorted articulation-point ids — nodes whose removal adds components. */
-articulationPoints: string[];
+articulationPoints:string[];
 /** Bridge edges sorted by source then target. */
-bridges: RelationshipBridge[];
+bridges:RelationshipBridge[];
 }
 /**
  * Compute exact shortest-path betweenness (Brandes), Wasserman–Faust closeness,
@@ -71,7 +71,7 @@ bridges: RelationshipBridge[];
  * degree, then id. The result is exact on the bounded workspace; callers bound
  * the returned rows for token-aware projection.
  */
-export declare function computeRelationshipCentrality(graph: RelationshipGraph, options?: GraphCentralityOptions): RelationshipQueryResult<RelationshipCentralityAnalysis>;
+export declare function computeRelationshipCentrality(graph:RelationshipGraph,options?:GraphCentralityOptions):RelationshipQueryResult<RelationshipCentralityAnalysis>;
 /**
  * Find articulation points and bridges of the undirected knowledge graph with
  * an iterative Tarjan low-link search over the simple adjacency. An articulation
@@ -79,4 +79,4 @@ export declare function computeRelationshipCentrality(graph: RelationshipGraph,
  * is an edge whose removal does the same — both are single points of failure in
  * the relationship graph. Results are deterministic and exact.
  */
-export declare function findRelationshipCutStructure(graph: RelationshipGraph, options?: GraphCutStructureOptions): RelationshipQueryResult<RelationshipCutStructure>;
+export declare function findRelationshipCutStructure(graph:RelationshipGraph,options?:GraphCutStructureOptions):RelationshipQueryResult<RelationshipCutStructure>;

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

@@ -12,55 +12,55 @@ export type RelationshipGraphScaleTopology = "chain" | "star" | "disconnected";
 /** Controls for a lazy deterministic graph scale fixture. */
 export interface RelationshipGraphScaleFixtureOptions {
 /** Number of nodes yielded by the fixture. */
-nodeCount: number;
+nodeCount:number;
 /** Shape of generated edges. */
-topology?: RelationshipGraphScaleTopology;
+topology?:RelationshipGraphScaleTopology;
 /** Registered relationship kind used by generated edges. */
-kind?: string;
+kind?:string;
 /** Emit one edge per stride; large values model sparse million-node graphs. */
-edgeStride?: number;
+edgeStride?:number;
 /** Stable node-id prefix. */
-idPrefix?: string;
+idPrefix?:string;
 }
 /** Reusable lazy node/edge fixture plus exact cardinalities. */
 export interface RelationshipGraphScaleFixture {
 /** Exact node count. */
-node_count: number;
+node_count:number;
 /** Exact generated edge count. */
-edge_count: number;
+edge_count:number;
 /** Counting convention used by edge_count. */
-edge_basis: "fixture_generated";
+edge_basis:"fixture_generated";
 /** Reiterable lazy node identifiers. */
-nodes: Iterable<string>;
+nodes:Iterable<string>;
 /** Reiterable lazy relationship edges. */
-edges: Iterable<RelationshipEdge>;
+edges:Iterable<RelationshipEdge>;
 }
 /** Create a lazy deterministic scale fixture without touching tracker storage. */
-export declare function createRelationshipGraphScaleFixture(options: RelationshipGraphScaleFixtureOptions): RelationshipGraphScaleFixture;
+export declare function createRelationshipGraphScaleFixture(options:RelationshipGraphScaleFixtureOptions):RelationshipGraphScaleFixture;
 /** One named conformance assertion completed against an adapter. */
 export interface RelationshipGraphAdapterConformanceCase {
 /** Stable assertion identifier. */
-name: string;
+name:string;
 /** Successful case status. */
-passed: true;
+passed:true;
 }
 /** Compact successful adapter-conformance report. */
 export interface RelationshipGraphAdapterConformanceReport {
 /** Adapter identifier. */
-adapter: string;
+adapter:string;
 /** Isolated workspace key exercised by the run. */
-workspace: string;
+workspace:string;
 /** Completed semantic assertions. */
-cases: readonly RelationshipGraphAdapterConformanceCase[];
+cases:readonly RelationshipGraphAdapterConformanceCase[];
 /** Whether optional clear semantics were tested. */
-clear_supported: boolean;
+clear_supported:boolean;
 }
 /**
  * Exercise empty reads, atomic replacement, isolated reads, idempotent sync,
  * compare-and-swap conflicts, replacement visibility, and optional clearing.
  */
-export declare function assertRelationshipGraphAdapterConformance(adapter: RelationshipGraphAdapter, options?: {
-workspace?: string;
-}): Promise<RelationshipGraphAdapterConformanceReport>;
+export declare function assertRelationshipGraphAdapterConformance(adapter:RelationshipGraphAdapter,options?:{
+workspace?:string;
+}):Promise<RelationshipGraphAdapterConformanceReport>;
 /** Run the public conformance contract against the built-in reference adapter. */
-export declare function assertMemoryRelationshipGraphAdapterConformance(workspace?: string): Promise<RelationshipGraphAdapterConformanceReport>;
+export declare function assertMemoryRelationshipGraphAdapterConformance(workspace?:string):Promise<RelationshipGraphAdapterConformanceReport>;

package/dist/sdk/graph/deadline-scheduling.d.ts

@@ -8,78 +8,78 @@ import type { RelationshipGraph } from "../relationships.js";
 /** Recorded inputs; absent estimates never imply zero duration. */
 export interface DeadlineScheduleItem {
 /** Canonical graph identifier. */
-id: string;
+id:string;
 /** Recorded elapsed-minute duration. */
-estimated_minutes?: number;
+estimated_minutes?:number;
 /** Authored ISO deadline interpreted as a finish constraint. */
-deadline?: string;
+deadline?:string;
 }
 /** Deterministic analysis controls and hard work/output bounds. */
 export interface DeadlineScheduleOptions {
 /** Explicit clock instant; defaults to the invocation time. */
-now?: string;
+now?:string;
 /** Input nodes plus edges plus items ceiling; also caps total retained path identifiers. */
-maxWork?: number;
+maxWork?:number;
 /** Maximum rows, residual samples, findings, and identifiers per finding path. */
-limit?: number;
+limit?:number;
 /** Cooperative cancellation checked during graph passes. */
-signal?: AbortSignal;
+signal?:AbortSignal;
 }
 /** One derived finish constraint and its estimated temporal slack. */
 export interface DeadlineScheduleRow {
 /** Constrained item identifier. */
-id: string;
+id:string;
 /** Controlling authored deadline's item identifier. */
-deadline_id: string;
+deadline_id:string;
 /** Derived latest start; never written to the authored item. */
-latest_start: string;
+latest_start:string;
 /** Latest start minus earliest possible start, or null for unknown prerequisites. */
-slack_minutes: number | null;
+slack_minutes:number | null;
 }
 /** Explicit evidence that this item's schedule could not be established. */
 export interface DeadlineScheduleResidual {
 /** Unscheduled or incompletely scheduled item. */
-id: string;
+id:string;
 /** Why no feasibility assertion is possible. */
-reason: "unknown_estimate" | "unknown_predecessor_estimate" | "cycle_or_gated_by_cycle" | "invalid_deadline" | "date_range_exceeded";
+reason:"unknown_estimate" | "unknown_predecessor_estimate" | "cycle_or_gated_by_cycle" | "invalid_deadline" | "date_range_exceeded";
 }
 /** One authored deadline that cannot accommodate its longest prerequisite chain. */
 export interface DeadlineOvercommitment {
 /** Item carrying the authored deadline. */
-deadline_id: string;
+deadline_id:string;
 /** Authored finish constraint. */
-deadline: string;
+deadline:string;
 /** Positive duration by which earliest finish exceeds the deadline. */
-shortfall_minutes: number;
+shortfall_minutes:number;
 /** Bounded suffix of the controlling prerequisite chain, in execution order. */
-path: string[];
+path:string[];
 /** Whether the chain exceeds the path output bound. */
-path_truncated: boolean;
+path_truncated:boolean;
 }
 /** Bounded derived schedule, with completeness separate from output truncation. */
 export interface DeadlineScheduleResult {
 /** Reproducible clock used for earliest starts. */
-as_of: string;
+as_of:string;
 /** Explicit provenance distinguishing computed constraints from authored dates. */
-basis: "derived_elapsed_minutes";
+basis:"derived_elapsed_minutes";
 /** Whether all inputs could be scheduled within the work bound. */
-complete: boolean;
+complete:boolean;
 /** Whether output collections omit computed entries. */
-truncated: boolean;
+truncated:boolean;
 /** True when the work bound prevented the graph pass. */
-work_limit_exceeded: boolean;
+work_limit_exceeded:boolean;
 /** Number of derived rows before output bounding. */
-scheduled_count: number;
+scheduled_count:number;
 /** Number of explicit residuals before output bounding. */
-residual_count: number;
+residual_count:number;
 /** Number of infeasible authored deadlines before output bounding. */
-overcommitted_count: number;
+overcommitted_count:number;
 /** Derived latest starts in graph identifier order. */
-rows: DeadlineScheduleRow[];
+rows:DeadlineScheduleRow[];
 /** Bounded incomplete-input and cycle samples. */
-residuals: DeadlineScheduleResidual[];
+residuals:DeadlineScheduleResidual[];
 /** Bounded deadline shortfall evidence. */
-overcommitted: DeadlineOvercommitment[];
+overcommitted:DeadlineOvercommitment[];
 }
 /**
  * Derive estimated latest starts and deadline shortfalls without mutating inputs.
@@ -87,4 +87,4 @@ overcommitted: DeadlineOvercommitment[];
  * invalidate earliest finish; unknown successors cannot transfer dated bounds.
  * Date-only ISO values denote UTC midnight, consistently with Date.parse.
  */
-export declare function deriveRelationshipDeadlines(graph: RelationshipGraph, items: readonly DeadlineScheduleItem[], options?: DeadlineScheduleOptions): DeadlineScheduleResult;
+export declare function deriveRelationshipDeadlines(graph:RelationshipGraph,items:readonly DeadlineScheduleItem[],options?:DeadlineScheduleOptions):DeadlineScheduleResult;

package/dist/sdk/graph/durable-cache.d.ts

@@ -6,66 +6,66 @@ export declare const GRAPH_DURABLE_CACHE_MIN_ITEMS = 500;
 /** Persisted durable graph cache envelope keyed by one workspace fingerprint. */
 export interface DurableGraphCacheEnvelope {
 /** Envelope format version guarding decode compatibility. */
-version: number;
+version:number;
 /** Full workspace graph fingerprint every entry answers for. */
-fingerprint: string;
+fingerprint:string;
 /** ISO timestamp of the last persisted write. */
-saved_at: string;
+saved_at:string;
 /** Deterministic query results keyed by their canonical query key. */
-results: Record<string, unknown>;
+results:Record<string,unknown>;
 }
 /** Compact durable index status projection for observability surfaces. */
 export interface DurableGraphCacheStatus {
 /** Whether an envelope file exists on disk. */
-exists: boolean;
+exists:boolean;
 /** Whether the stored fingerprint matches the current workspace snapshot. */
-fresh: boolean;
+fresh:boolean;
 /** Stored entry count, 0 when absent. */
-entry_count: number;
+entry_count:number;
 /** Truncated stored fingerprint, absent when no envelope exists. */
-fingerprint?: string;
+fingerprint?:string;
 /** ISO timestamp of the last persisted write, absent when no envelope exists. */
-saved_at?: string;
+saved_at?:string;
 /** Envelope file size in bytes, absent when no envelope exists. */
-bytes?: number;
+bytes?:number;
 }
 /** Resolve the durable graph cache file path for one workspace root. */
-export declare function durableGraphCachePath(pmRoot: string): string;
+export declare function durableGraphCachePath(pmRoot:string):string;
 /** Resolve the persisted audit census baseline path for one workspace root. */
-export declare function graphAuditBaselinePath(pmRoot: string): string;
+export declare function graphAuditBaselinePath(pmRoot:string):string;
 /** One opened durable index view bound to the current workspace fingerprint. */
 export interface DurableGraphCacheView {
 /** Whether any envelope file exists on disk, fresh or not. */
-exists: boolean;
+exists:boolean;
 /** Whether the stored envelope answers for the current fingerprint. */
-fresh: boolean;
+fresh:boolean;
 /** Fingerprint-fresh persisted query results; empty when absent or stale. */
-results: Record<string, unknown>;
+results:Record<string,unknown>;
 }
 /**
  * Open the persisted envelope against the current workspace fingerprint. A
  * missing, corrupt, version-drifted, or fingerprint-mismatched envelope reads
  * as empty so stale entries can never answer for a mutated workspace.
  */
-export declare function openDurableGraphCache(pmRoot: string, fingerprint: string): Promise<DurableGraphCacheView>;
+export declare function openDurableGraphCache(pmRoot:string,fingerprint:string):Promise<DurableGraphCacheView>;
 /**
  * Persist one query result into the durable envelope, replacing any envelope
  * recorded for a different fingerprint and trimming the oldest entries beyond
  * the retention bound. A cross-process lock protects the read-merge-write, and
  * the final write is atomic, so concurrent queries retain each other's entries.
  */
-export declare function persistDurableGraphResult(pmRoot: string, fingerprint: string, view: DurableGraphCacheView, queryKey: string, result: unknown): Promise<void>;
+export declare function persistDurableGraphResult(pmRoot:string,fingerprint:string,view:DurableGraphCacheView,queryKey:string,result:unknown):Promise<void>;
 /** Delete the persisted durable graph cache envelope when present. */
-export declare function clearDurableGraphCache(pmRoot: string): Promise<void>;
+export declare function clearDurableGraphCache(pmRoot:string):Promise<void>;
 /** Report the durable index status against the current workspace fingerprint. */
-export declare function durableGraphCacheStatus(pmRoot: string, fingerprint: string): Promise<DurableGraphCacheStatus>;
+export declare function durableGraphCacheStatus(pmRoot:string,fingerprint:string):Promise<DurableGraphCacheStatus>;
 /**
  * Decide whether implicit persistence applies to this invocation. Small
  * workspaces skip the index unless an envelope already exists — the explicit
  * `pm graph index --rebuild` opt-in creates it and thereby enables writes.
  */
-export declare function shouldPersistDurableGraphCache(itemCount: number, envelopeExists: boolean): boolean;
+export declare function shouldPersistDurableGraphCache(itemCount:number,envelopeExists:boolean):boolean;
 /** Load the persisted audit census baseline when present and decodable. */
-export declare function loadGraphAuditBaseline(pmRoot: string): Promise<RelationshipAuditSnapshot | undefined>;
+export declare function loadGraphAuditBaseline(pmRoot:string):Promise<RelationshipAuditSnapshot | undefined>;
 /** Atomically persist one audit census snapshot as the comparison baseline. */
-export declare function saveGraphAuditBaseline(pmRoot: string, snapshot: RelationshipAuditSnapshot): Promise<void>;
+export declare function saveGraphAuditBaseline(pmRoot:string,snapshot:RelationshipAuditSnapshot):Promise<void>;

package/dist/sdk/graph/governance-contracts.d.ts

@@ -7,6 +7,6 @@
  * drifting when a finding family is added.
  */
 /** Stable machine-readable relationship audit finding families. */
-export declare const RELATIONSHIP_AUDIT_FINDING_CODES: readonly ["missing_reference_active", "missing_reference_terminal", "legacy_no_blocker_sentinel", "ordering_cycle", "legacy_ordering_cycle", "ordering_storage_contradiction", "legacy_ordering_storage_contradiction", "hierarchy_cycle", "legacy_hierarchy_cycle", "hierarchy_cardinality_violation", "legacy_hierarchy_cardinality_violation", "hierarchy_direction_violation", "legacy_hierarchy_direction_violation", "duplicate_edge", "legacy_duplicate_edge", "duplicate_dependency_row", "legacy_duplicate_dependency_row", "stale_lifecycle_block", "isolated_active_node", "sparse_active_node"];
+export declare const RELATIONSHIP_AUDIT_FINDING_CODES:readonly ["missing_reference_active","missing_reference_terminal","legacy_no_blocker_sentinel","ordering_cycle","legacy_ordering_cycle","ordering_storage_contradiction","legacy_ordering_storage_contradiction","hierarchy_cycle","legacy_hierarchy_cycle","hierarchy_cardinality_violation","legacy_hierarchy_cardinality_violation","hierarchy_direction_violation","legacy_hierarchy_direction_violation","duplicate_edge","legacy_duplicate_edge","duplicate_dependency_row","legacy_duplicate_dependency_row","stale_lifecycle_block","isolated_active_node","sparse_active_node"];
 /** Machine-readable identifier for one relationship audit finding family. */
 export type RelationshipAuditFindingCode = (typeof RELATIONSHIP_AUDIT_FINDING_CODES)[number];