@transitrix/diagrams 1.4.0 → 1.6.0

package/src/capability-map/dsm-layout.ts

@@ -0,0 +1,142 @@
+import type { CapabilityMap, LayoutOptions, CapabilityMapLayout, LaidOutNode, LaidOutEdge } from './dsm-schema.js';
+import { getLevel, getParentAddress } from './address.js';
+
+const DEFAULT_NODE_WIDTH = 250;
+const DEFAULT_NODE_HEIGHT = 64;
+const DEFAULT_RANK_SEP = 80;
+const DEFAULT_NODE_SEP = 24;
+/** Width of the virtual organisation-root node — narrower than a capability
+ *  card since it carries only a label, no maturity dot or address. */
+const ROOT_WIDTH = 200;
+
+/**
+ * Lays out a capability map's on-diagram (non-backlog) capabilities, plus a
+ * virtual organisation-root node one column to the left of the L1s (§6.1).
+ * Backlog filtering is a Layer B / component concern (same split as the
+ * goals module) — this function lays out whatever `capabilities` it's given,
+ * using their address to derive parent/child structure.
+ */
+export function layoutCapabilityMap(map: CapabilityMap, options: LayoutOptions = {}): CapabilityMapLayout {
+  const {
+    nodeWidth = DEFAULT_NODE_WIDTH,
+    nodeHeight = DEFAULT_NODE_HEIGHT,
+    rankSep = DEFAULT_RANK_SEP,
+    nodeSep = DEFAULT_NODE_SEP,
+    hideCollapsed = [],
+    // organisationLabel isn't stored on LaidOutNode (its `data` is a
+    // Capability | null, with no label slot for the virtual root) — the
+    // component reads `layoutOptions.organisationLabel ?? map.organisation`
+    // directly when it renders the root card.
+  } = options;
+
+  const hiddenSet = new Set(hideCollapsed);
+  const onDiagram = map.capabilities.filter((c) => !c.backlog);
+  const byId = new Map(onDiagram.map((c) => [c.id, c]));
+  const addressToId = new Map(onDiagram.map((c) => [c.address, c.id]));
+
+  const children = new Map<number, number[]>();
+  const l1Ids: number[] = [];
+  for (const c of onDiagram) {
+    const level = getLevel(c.address);
+    if (level === 'backlog') continue;
+    if (level === 1) {
+      l1Ids.push(c.id);
+      continue;
+    }
+    const parentAddress = getParentAddress(c.address);
+    const parentId = parentAddress ? addressToId.get(parentAddress) : undefined;
+    if (parentId === undefined) {
+      // MISSING_PARENT_BY_ADDRESS is a warning, not an error — render it
+      // hanging directly off the root rather than dropping it silently.
+      l1Ids.push(c.id);
+      continue;
+    }
+    if (!children.has(parentId)) children.set(parentId, []);
+    children.get(parentId)!.push(c.id);
+  }
+
+  const byAddress = (a: number, b: number): number =>
+    byId.get(a)!.address.localeCompare(byId.get(b)!.address, undefined, { numeric: true });
+  l1Ids.sort(byAddress);
+  for (const kids of children.values()) kids.sort(byAddress);
+
+  const hiddenSubtrees = new Set<number>();
+  function markHidden(id: number): void {
+    for (const child of children.get(id) ?? []) {
+      hiddenSubtrees.add(child);
+      markHidden(child);
+    }
+  }
+  for (const id of hiddenSet) markHidden(id);
+
+  const nodes: LaidOutNode[] = [];
+  const edges: LaidOutEdge[] = [];
+  const columnNextY = new Map<number, number>();
+  const getNextY = (col: number): number => columnNextY.get(col) ?? 0;
+  const advanceY = (col: number, delta: number): void => { columnNextY.set(col, (columnNextY.get(col) ?? 0) + delta); };
+
+  function placeSubtree(id: number, col: number): { top: number; bottom: number } {
+    const cap = byId.get(id)!;
+    const allChildIds = children.get(id) ?? [];
+    const childIds = allChildIds.filter((c) => !hiddenSubtrees.has(c));
+    const hasHiddenChildren = childIds.length < allChildIds.length;
+
+    if (childIds.length === 0) {
+      const y = getNextY(col);
+      advanceY(col, nodeHeight + nodeSep);
+      nodes.push({ id, x: col * (nodeWidth + rankSep), y, width: nodeWidth, height: nodeHeight, data: cap, hasHiddenChildren });
+      return { top: y, bottom: y + nodeHeight };
+    }
+
+    const spans = childIds.map((cid) => placeSubtree(cid, col + 1));
+    const spanTop = Math.min(...spans.map((s) => s.top));
+    const spanBottom = Math.max(...spans.map((s) => s.bottom));
+    const parentY = spanTop + (spanBottom - spanTop) / 2 - nodeHeight / 2;
+    const curColY = getNextY(col);
+    const finalY = Math.max(parentY, curColY);
+    advanceY(col, finalY - curColY + nodeHeight + nodeSep);
+
+    nodes.push({ id, x: col * (nodeWidth + rankSep), y: finalY, width: nodeWidth, height: nodeHeight, data: cap, hasHiddenChildren });
+    for (const cid of childIds) edges.push({ source: id, target: cid });
+    return { top: Math.min(finalY, spanTop), bottom: Math.max(finalY + nodeHeight, spanBottom) };
+  }
+
+  for (const id of l1Ids) {
+    if (hiddenSubtrees.has(id)) continue;
+    placeSubtree(id, 1);
+    for (const [col, y] of columnNextY) columnNextY.set(col, y + nodeSep);
+  }
+
+  if (nodes.length === 0) {
+    const rootNode: LaidOutNode = { id: 0, x: 0, y: 0, width: ROOT_WIDTH, height: nodeHeight, data: null, hasHiddenChildren: false };
+    return { rootNode, nodes: [], edges: [], bounds: { x: 0, y: 0, width: ROOT_WIDTH, height: nodeHeight } };
+  }
+
+  const minX = Math.min(...nodes.map((n) => n.x));
+  const minY = Math.min(...nodes.map((n) => n.y));
+  const maxX = Math.max(...nodes.map((n) => n.x + n.width));
+  const maxY = Math.max(...nodes.map((n) => n.y + n.height));
+
+  const l1IdSet = new Set(l1Ids);
+  const l1Nodes = nodes.filter((n) => l1IdSet.has(n.id));
+  const rootTop = Math.min(...l1Nodes.map((n) => n.y));
+  const rootBottom = Math.max(...l1Nodes.map((n) => n.y + n.height));
+  const rootY = rootTop + (rootBottom - rootTop) / 2 - nodeHeight / 2;
+  const rootNode: LaidOutNode = { id: 0, x: 0, y: rootY, width: ROOT_WIDTH, height: nodeHeight, data: null, hasHiddenChildren: false };
+
+  const rootEdges: LaidOutEdge[] = l1Ids
+    .filter((id) => !hiddenSubtrees.has(id))
+    .map((id) => ({ source: 'root' as const, target: id }));
+
+  return {
+    rootNode,
+    nodes,
+    edges: [...rootEdges, ...edges],
+    bounds: {
+      x: Math.min(0, minX),
+      y: Math.min(rootY, minY),
+      width: Math.max(maxX, ROOT_WIDTH) - Math.min(0, minX),
+      height: Math.max(rootY + nodeHeight, maxY) - Math.min(rootY, minY),
+    },
+  };
+}

package/src/capability-map/dsm-mutations.ts

@@ -0,0 +1,208 @@
+import type { Capability, CapabilityMap, MutationResult, ValidationError } from './dsm-schema.js';
+import { parseAddress, getLevel, getParentAddress, getFirstFreeAddress, isAddressTaken } from './address.js';
+
+function cloneMap(map: CapabilityMap): CapabilityMap {
+  return {
+    organisation: map.organisation,
+    set_id: map.set_id,
+    capabilities: map.capabilities.map((c) => ({
+      ...c,
+      maturity: c.maturity ? c.maturity.map((m) => ({ ...m })) : undefined,
+    })),
+  };
+}
+
+function nextId(map: CapabilityMap): number {
+  return Math.max(0, ...map.capabilities.map((c) => c.id)) + 1;
+}
+
+function refusalError(message: string): MutationResult<CapabilityMap> {
+  const err: ValidationError = { code: 'MUTATION_REFUSED', message };
+  return { ok: false, error: err };
+}
+
+/** True when `addr` sits anywhere under `ancestorAddr` in the address hierarchy. */
+function isDescendantAddress(addr: string, ancestorAddr: string): boolean {
+  const [ax, ay, az] = parseAddress(addr);
+  const [px, py, pz] = parseAddress(ancestorAddr);
+  if (px !== ax) return false;
+  if (py === 0) return ay !== 0 || az !== 0; // ancestor is L1 — any L2/L3 under the same X
+  if (pz === 0) return ay === py && az !== 0; // ancestor is L2 — only L3s under the same X.Y
+  return false; // ancestor is L3 — no descendants possible (max depth)
+}
+
+/** First unused top-level (L1) address — the "parent" for a promote-to-L1 reparent. */
+function firstFreeL1(capabilities: Capability[]): string {
+  for (let x = 1; x < 1000; x++) {
+    const candidate = `${x}.0.0`;
+    if (!isAddressTaken(candidate, capabilities)) return candidate;
+  }
+  throw new Error('firstFreeL1: no free top-level address (searched 1..999)');
+}
+
+/**
+ * Move `sourceId` under `targetId` (or under the virtual root when
+ * `targetId` is 0 — the sentinel matching the goals module's `parent_id: 0`
+ * convention, since the root isn't itself a Capability with an id).
+ *
+ * Recomputes addresses for the whole moved branch (§5.1). The depth check is
+ * expressed once, generically, as "every descendant's new level must stay in
+ * 1..3" — this covers both directions the spec discusses explicitly (L2→L1
+ * promotion, where descendants move one level shallower) and the symmetric,
+ * unspecified case (L1→L2 demotion, where descendants move one level
+ * deeper) without needing separate per-direction rules: an L1 with L3
+ * grandchildren refuses demotion to L2 because that would need a 4th level,
+ * caught by the same check.
+ */
+export function reparent(map: CapabilityMap, sourceId: number, targetId: number): MutationResult<CapabilityMap> {
+  const clone = cloneMap(map);
+  const source = clone.capabilities.find((c) => c.id === sourceId);
+  if (!source || source.backlog) return refusalError(`Capability ${sourceId} not found (use restoreFromBacklog for backlog items)`);
+  if (sourceId === targetId) return refusalError('Cannot reparent to self');
+
+  const target = targetId === 0 ? null : clone.capabilities.find((c) => c.id === targetId);
+  if (targetId !== 0 && (!target || target.backlog)) return refusalError(`Target capability ${targetId} not found`);
+
+  if (target && isDescendantAddress(target.address, source.address)) {
+    return refusalError('Cannot reparent: target is a descendant of the source (would create a cycle)');
+  }
+
+  const sourceLevel = getLevel(source.address);
+  if (sourceLevel === 'backlog') return refusalError(`Capability ${sourceId} has no on-diagram address`);
+  const targetLevel = target ? getLevel(target.address) : 0;
+  const newLevel = (typeof targetLevel === 'number' ? targetLevel : 0) + 1;
+  if (newLevel > 3) return refusalError('Reparent would exceed max depth (L3)');
+
+  const levelDelta = newLevel - sourceLevel;
+  const originalSourceAddress = source.address;
+
+  // Snapshot descendants + their original address/level BEFORE anything is
+  // reassigned — both for the depth check and to resolve old-parent links
+  // while walking the branch top-down below.
+  const descendants = clone.capabilities
+    .filter((c) => !c.backlog && c.id !== sourceId && isDescendantAddress(c.address, originalSourceAddress))
+    .map((c) => ({ cap: c, originalAddress: c.address, originalLevel: getLevel(c.address) as 1 | 2 | 3 }));
+
+  for (const d of descendants) {
+    const newDescLevel = d.originalLevel + levelDelta;
+    if (newDescLevel > 3 || newDescLevel < 1) {
+      return refusalError(`Reparent would push descendant ${d.cap.id} to level ${newDescLevel}, outside 1..3`);
+    }
+  }
+
+  const oldAddressToId = new Map<string, number>(clone.capabilities.filter((c) => !c.backlog).map((c) => [c.address, c.id]));
+  const newAddressById = new Map<number, string>();
+
+  source.address = target ? getFirstFreeAddress(target.address, clone.capabilities) : firstFreeL1(clone.capabilities);
+  newAddressById.set(sourceId, source.address);
+
+  // Shallowest-first so each descendant's old parent has already been
+  // re-addressed (or is the source itself) by the time we reach it.
+  descendants.sort((a, b) => a.originalLevel - b.originalLevel);
+  for (const d of descendants) {
+    const oldParentAddress = getParentAddress(d.originalAddress);
+    const oldParentId = oldParentAddress ? oldAddressToId.get(oldParentAddress) : undefined;
+    const newParentAddress = oldParentId != null ? newAddressById.get(oldParentId) : undefined;
+    if (!newParentAddress) {
+      return refusalError(`Reparent could not resolve the new parent address for descendant ${d.cap.id}`);
+    }
+    const newAddress = getFirstFreeAddress(newParentAddress, clone.capabilities);
+    d.cap.address = newAddress;
+    newAddressById.set(d.cap.id, newAddress);
+  }
+
+  return { ok: true, result: clone };
+}
+
+export function addChild(map: CapabilityMap, parentId: number, newCap: Omit<Capability, 'id' | 'address'>): MutationResult<CapabilityMap> {
+  const clone = cloneMap(map);
+  const parent = parentId === 0 ? null : clone.capabilities.find((c) => c.id === parentId);
+  if (parentId !== 0 && (!parent || parent.backlog)) return refusalError(`Parent capability ${parentId} not found`);
+
+  const parentLevel = parent ? getLevel(parent.address) : 0;
+  const newLevel = (typeof parentLevel === 'number' ? parentLevel : 0) + 1;
+  if (newLevel > 3) return refusalError('New child would exceed max depth (L3)');
+
+  const address = parent ? getFirstFreeAddress(parent.address, clone.capabilities) : firstFreeL1(clone.capabilities);
+  const id = nextId(clone);
+  clone.capabilities.push({ ...newCap, id, address, backlog: false });
+  return { ok: true, result: clone };
+}
+
+export function deleteWithDescendants(map: CapabilityMap, id: number): MutationResult<CapabilityMap> {
+  const clone = cloneMap(map);
+  const target = clone.capabilities.find((c) => c.id === id);
+  if (!target) return refusalError(`Capability ${id} not found`);
+
+  const toDelete = new Set<number>([id]);
+  if (!target.backlog) {
+    for (const c of clone.capabilities) {
+      if (!c.backlog && isDescendantAddress(c.address, target.address)) toDelete.add(c.id);
+    }
+  }
+  clone.capabilities = clone.capabilities.filter((c) => !toDelete.has(c.id));
+  return { ok: true, result: clone };
+}
+
+/** Moves a whole branch to the backlog. Descendants move with it (a
+ *  backlogged capability's on-diagram children would otherwise dangle). */
+export function moveBranchToBacklog(map: CapabilityMap, id: number): MutationResult<CapabilityMap> {
+  const clone = cloneMap(map);
+  const target = clone.capabilities.find((c) => c.id === id);
+  if (!target) return refusalError(`Capability ${id} not found`);
+  if (target.backlog) return refusalError(`Capability ${id} is already in the backlog`);
+
+  const branch = [target, ...clone.capabilities.filter((c) => !c.backlog && isDescendantAddress(c.address, target.address))];
+  for (const c of branch) {
+    c.backlog = true;
+    c.address = '0.0.0';
+  }
+  return { ok: true, result: clone };
+}
+
+export function restoreFromBacklog(map: CapabilityMap, id: number, parentId: number): MutationResult<CapabilityMap> {
+  const clone = cloneMap(map);
+  const target = clone.capabilities.find((c) => c.id === id);
+  if (!target || !target.backlog) return refusalError(`Capability ${id} is not in the backlog`);
+
+  const parent = parentId === 0 ? null : clone.capabilities.find((c) => c.id === parentId);
+  if (parentId !== 0 && (!parent || parent.backlog)) return refusalError(`Parent capability ${parentId} not found`);
+  const parentLevel = parent ? getLevel(parent.address) : 0;
+  const newLevel = (typeof parentLevel === 'number' ? parentLevel : 0) + 1;
+  if (newLevel > 3) return refusalError('Restore would exceed max depth (L3)');
+
+  target.address = parent ? getFirstFreeAddress(parent.address, clone.capabilities) : firstFreeL1(clone.capabilities);
+  target.backlog = false;
+  return { ok: true, result: clone };
+}
+
+/**
+ * Repairs addresses that don't resolve to an existing parent (MISSING_PARENT_BY_ADDRESS):
+ * reassigns each such capability to the first free slot under its would-be
+ * parent's level, or moves it to the backlog when no such parent exists at all.
+ */
+export function normaliseAddresses(map: CapabilityMap): CapabilityMap {
+  const clone = cloneMap(map);
+  const addressToId = new Map<string, number>(clone.capabilities.filter((c) => !c.backlog).map((c) => [c.address, c.id]));
+
+  // Re-derive level-by-level (L1 first) so an L1 fixed up in this pass can
+  // already serve as a valid parent for an L2 processed right after it.
+  const byLevel = clone.capabilities
+    .filter((c) => !c.backlog)
+    .map((c) => ({ cap: c, level: getLevel(c.address) }))
+    .filter((e): e is { cap: Capability; level: 1 | 2 | 3 } => typeof e.level === 'number')
+    .sort((a, b) => a.level - b.level);
+
+  for (const { cap, level } of byLevel) {
+    if (level === 1) continue; // L1 has no parent to validate against
+    const parentAddress = getParentAddress(cap.address);
+    if (parentAddress && addressToId.has(parentAddress)) continue; // already fine
+
+    // No resolvable parent: reassign to the backlog rather than guessing one.
+    addressToId.delete(cap.address);
+    cap.backlog = true;
+    cap.address = '0.0.0';
+  }
+
+  return clone;
+}

package/src/capability-map/dsm-schema.ts

@@ -0,0 +1,80 @@
+/**
+ * Types for the DSM-migration capability map (docs/extraction/capability-map.md).
+ *
+ * Distinct from `./types.ts` (`CapabilityNode`/`CapabilityMapFile`), which is
+ * Transitrix's own native `*.capability-map.transitrix.yaml` notation — a
+ * nested-children tree, statically rendered to SVG. This module is a
+ * separate, flat, address-triple data model matching DSM's internal
+ * capability editor, for the interactive `CapabilityMapView` component. The
+ * two coexist in this folder by design (see the address-helper/component
+ * deliverables in the extraction spec); only the validator function name
+ * collided, so it's `validateCapabilityMapData` here, not
+ * `validateCapabilityMap` (already taken by `./validate.ts`).
+ */
+
+export interface MaturitySnapshot {
+  date: string;
+  level: number;
+}
+
+export interface Capability {
+  id: number;
+  name: string;
+  /** 'X.Y.Z' triple. X=0 or backlog=true means "not on the diagram". */
+  address: string;
+  backlog?: boolean;
+  description?: string;
+  maturity?: MaturitySnapshot[];
+}
+
+export interface CapabilityMap {
+  organisation: string;
+  set_id: string;
+  capabilities: Capability[];
+}
+
+export type {
+  ValidationError,
+  ValidationWarning,
+  ValidationResult,
+} from '../validation-types.js';
+
+import type { ValidationError } from '../validation-types.js';
+
+export interface MutationResult<T> {
+  ok: boolean;
+  result?: T;
+  error?: ValidationError;
+}
+
+export interface LayoutOptions {
+  rankdir?: 'LR' | 'TB';
+  nodeWidth?: number;
+  nodeHeight?: number;
+  rankSep?: number;
+  nodeSep?: number;
+  hideCollapsed?: number[];
+  organisationLabel?: string;
+}
+
+export interface LaidOutNode {
+  id: number;
+  x: number;
+  y: number;
+  width: number;
+  height: number;
+  data: Capability | null;
+  hasHiddenChildren: boolean;
+}
+
+export interface LaidOutEdge {
+  source: number | 'root';
+  target: number;
+}
+
+export interface CapabilityMapLayout {
+  rootNode: LaidOutNode;
+  nodes: LaidOutNode[];
+  edges: LaidOutEdge[];
+  bounds: { x: number; y: number; width: number; height: number };
+}

package/src/capability-map/dsm-theme.ts

@@ -0,0 +1,53 @@
+/** Theme tokens for CapabilityMapView — same host-agnostic-prop pattern as
+ *  the goals module's ThemeTokens (see ../goals/theme.ts). */
+export interface ThemeTokens {
+  cardFill?: string;
+  cardBorderColor?: string;
+  cardBorderWidth?: number;
+  cardTextColor?: string;
+  cardMetaColor?: string;
+  edgeColor?: string;
+  edgeWidth?: number;
+  dropTargetBorderColor?: string;
+  rootFill?: string;
+  rootTextColor?: string;
+}
+
+/** Default 1..5 maturity-dot colour scale — overridable via the
+ *  `maturityColours` prop (spec §6.2), which is separate from ThemeTokens
+ *  since it's keyed by maturity level, not a fixed named token. */
+export const DEFAULT_MATURITY_COLOURS: Record<number, string> = {
+  1: '#ef4444',
+  2: '#f97316',
+  3: '#eab308',
+  4: '#84cc16',
+  5: '#22c55e',
+};
+
+export const DEFAULT_THEME: Required<ThemeTokens> = {
+  cardFill: '#eff6ff',
+  cardBorderColor: '#94a3b8',
+  cardBorderWidth: 1,
+  cardTextColor: '#0f172a',
+  cardMetaColor: '#64748b',
+  edgeColor: '#94a3b8',
+  edgeWidth: 1.5,
+  dropTargetBorderColor: '#2563eb',
+  rootFill: '#e2e8f0',
+  rootTextColor: '#0f172a',
+};
+
+export function resolveTheme(theme?: ThemeTokens): Required<ThemeTokens> {
+  return {
+    cardFill: theme?.cardFill ?? DEFAULT_THEME.cardFill,
+    cardBorderColor: theme?.cardBorderColor ?? DEFAULT_THEME.cardBorderColor,
+    cardBorderWidth: theme?.cardBorderWidth ?? DEFAULT_THEME.cardBorderWidth,
+    cardTextColor: theme?.cardTextColor ?? DEFAULT_THEME.cardTextColor,
+    cardMetaColor: theme?.cardMetaColor ?? DEFAULT_THEME.cardMetaColor,
+    edgeColor: theme?.edgeColor ?? DEFAULT_THEME.edgeColor,
+    edgeWidth: theme?.edgeWidth ?? DEFAULT_THEME.edgeWidth,
+    dropTargetBorderColor: theme?.dropTargetBorderColor ?? DEFAULT_THEME.dropTargetBorderColor,
+    rootFill: theme?.rootFill ?? DEFAULT_THEME.rootFill,
+    rootTextColor: theme?.rootTextColor ?? DEFAULT_THEME.rootTextColor,
+  };
+}

package/src/capability-map/dsm-validate.ts

@@ -0,0 +1,103 @@
+import type { CapabilityMap, ValidationResult, ValidationError, ValidationWarning } from './dsm-schema.js';
+
+/** Parses an address string loosely enough to tell "wrong shape"
+ *  (INVALID_ADDRESS_FORMAT) apart from "right shape, too many levels"
+ *  (MAX_DEPTH_EXCEEDED, e.g. '1.2.3.4') — a strict 3-segment regex would
+ *  reject both identically and lose that distinction. */
+function parseLoose(address: string): { triple: [number, number, number] } | { tooDeep: true } | null {
+  const parts = address.trim().split('.');
+  if (parts.length < 3 || !parts.every((p) => /^\d+$/.test(p))) return null;
+  if (parts.length > 3) return { tooDeep: true };
+  return { triple: [Number(parts[0]), Number(parts[1]), Number(parts[2])] };
+}
+
+export function validateCapabilityMapData(input: unknown): ValidationResult {
+  const errors: ValidationError[] = [];
+  const warnings: ValidationWarning[] = [];
+
+  if (!input || typeof input !== 'object') {
+    return { valid: false, errors: [{ code: 'SCHEMA_INVALID', message: 'Input must be an object' }], warnings: [] };
+  }
+
+  const raw = input as Record<string, unknown>;
+  if (!Array.isArray(raw.capabilities)) {
+    errors.push({ code: 'SCHEMA_INVALID', message: 'capabilities must be an array', path: 'capabilities' });
+    return { valid: false, errors, warnings };
+  }
+
+  const map = raw as unknown as CapabilityMap;
+  const idSet = new Set<number>();
+  const addressToId = new Map<string, number>();
+  const onDiagram = new Map<number, [number, number, number]>();
+
+  for (let i = 0; i < map.capabilities.length; i++) {
+    const c = map.capabilities[i] as unknown;
+    const path = `capabilities[${i}]`;
+
+    if (!c || typeof c !== 'object') {
+      errors.push({ code: 'SCHEMA_INVALID', message: 'capability entry must be an object', path });
+      continue;
+    }
+    const cap = c as { id?: unknown; name?: unknown; address?: unknown; backlog?: unknown; maturity?: unknown };
+
+    if (typeof cap.id !== 'number') {
+      errors.push({ code: 'SCHEMA_INVALID', message: 'capability id must be a number', path });
+      continue;
+    }
+    if (idSet.has(cap.id)) {
+      errors.push({ code: 'DUPLICATE_ID', message: `Duplicate capability id: ${cap.id}`, path });
+    } else {
+      idSet.add(cap.id);
+    }
+
+    if (!cap.name || typeof cap.name !== 'string' || cap.name.trim() === '') {
+      errors.push({ code: 'EMPTY_NAME', message: `Capability ${cap.id} has empty name`, path });
+    }
+
+    if (typeof cap.address !== 'string') {
+      errors.push({ code: 'INVALID_ADDRESS_FORMAT', message: `Capability ${cap.id} address must be a string`, path });
+      continue;
+    }
+    const parsed = parseLoose(cap.address);
+    if (parsed === null) {
+      errors.push({ code: 'INVALID_ADDRESS_FORMAT', message: `Capability ${cap.id} address "${cap.address}" is not in 'X.Y.Z' form`, path });
+      continue;
+    }
+    if ('tooDeep' in parsed) {
+      errors.push({ code: 'MAX_DEPTH_EXCEEDED', message: `Capability ${cap.id} address "${cap.address}" has more than 3 levels`, path });
+      continue;
+    }
+    const triple = parsed.triple;
+    const isBacklog = cap.backlog === true || triple[0] === 0;
+
+    if (!isBacklog) {
+      if (addressToId.has(cap.address)) {
+        errors.push({ code: 'DUPLICATE_ADDRESS', message: `Duplicate address "${cap.address}" (capability ${cap.id})`, path });
+      } else {
+        addressToId.set(cap.address, cap.id);
+      }
+      onDiagram.set(cap.id, triple);
+    }
+
+    if (Array.isArray(cap.maturity)) {
+      for (const snap of cap.maturity as unknown[]) {
+        const level = (snap as { level?: unknown } | null)?.level;
+        if (typeof level === 'number' && (level < 1 || level > 5)) {
+          warnings.push({ code: 'INVALID_MATURITY_LEVEL', message: `Capability ${cap.id} has maturity level ${level} outside 1..5`, path });
+        }
+      }
+    }
+  }
+
+  if (errors.length > 0) return { valid: false, errors, warnings };
+
+  for (const [id, [x, y, z]] of onDiagram) {
+    if (z !== 0 && !addressToId.has(`${x}.${y}.0`)) {
+      warnings.push({ code: 'MISSING_PARENT_BY_ADDRESS', message: `Capability ${id} (${x}.${y}.${z}) has no L2 parent at ${x}.${y}.0` });
+    } else if (y !== 0 && z === 0 && !addressToId.has(`${x}.0.0`)) {
+      warnings.push({ code: 'MISSING_PARENT_BY_ADDRESS', message: `Capability ${id} (${x}.${y}.0) has no L1 parent at ${x}.0.0` });
+    }
+  }
+
+  return { valid: errors.length === 0, errors, warnings };
+}

package/src/capability-map/index.ts

@@ -17,3 +17,38 @@ export { layoutCapabilityTree, TREE_NODE_WIDTH, TREE_NODE_HEIGHT, TREE_RANK_SEP,
 
 export type { RenderCapabilityTreeOptions } from './render-capability-tree.js';
 export { renderCapabilityTreeSvg } from './render-capability-tree.js';
+
+// ── DSM-migration capability map (docs/extraction/capability-map.md) ───────
+// A separate, flat, address-triple data model from CapabilityNode above —
+// see dsm-schema.ts for why the two coexist in this folder. Named
+// `validateCapabilityMapData` rather than `validateCapabilityMap` because
+// that name is already taken by the native-notation validator on line 8.
+
+export type {
+  Capability,
+  CapabilityMap,
+  MaturitySnapshot,
+  MutationResult,
+  LayoutOptions,
+  LaidOutNode,
+  LaidOutEdge,
+  CapabilityMapLayout,
+} from './dsm-schema.js';
+
+export {
+  parseAddress,
+  formatAddress,
+  getLevel,
+  getParentAddress,
+  getFirstFreeAddress,
+  isAddressTaken,
+} from './address.js';
+
+export { validateCapabilityMapData } from './dsm-validate.js';
+export { layoutCapabilityMap } from './dsm-layout.js';
+export { reparent, addChild, deleteWithDescendants, moveBranchToBacklog, restoreFromBacklog, normaliseAddresses } from './dsm-mutations.js';
+
+export { CapabilityMapView } from './CapabilityMapView.js';
+export type { CapabilityMapViewProps, CapabilityMapChange } from './CapabilityMapView.js';
+export type { ThemeTokens } from './dsm-theme.js';
+export { DEFAULT_MATURITY_COLOURS } from './dsm-theme.js';