@memoarchitect/tools 0.4.4

package/packages/tools/lib/analysis/dsm.js

@@ -0,0 +1,172 @@
+// ─── Design Structure Matrix (DSM) Analysis ────────────────────────────────
+//
+// Builds an N×N dependency matrix from relationships between elements.
+// Supports filtering by element kinds and relationship types.
+// Includes partitioning/clustering to suggest architectural groupings.
+// ─────────────────────────────────────────────────────────────────────────────
+const DEFAULT_KINDS = ['Function', 'Function', 'ActionDefinition', 'ActionUsage'];
+const DEFAULT_REL_TYPES = ['flow', 'decomposedBy', 'composedOf', 'allocateTo', 'succession'];
+/**
+ * Compute a Design Structure Matrix from model elements and relationships.
+ */
+export function computeDSM(model, options) {
+    const kinds = new Set(options?.kinds ?? DEFAULT_KINDS);
+    const relTypes = new Set(options?.relationshipTypes ?? DEFAULT_REL_TYPES);
+    const shouldCluster = options?.cluster ?? true;
+    // 1. Collect eligible elements
+    const eligibleElements = [];
+    for (const el of Object.values(model.elements)) {
+        if (kinds.has(el.kind)) {
+            eligibleElements.push(el);
+        }
+    }
+    // Sort by kind then name for stable ordering
+    eligibleElements.sort((a, b) => {
+        const kindCmp = a.kind.localeCompare(b.kind);
+        return kindCmp !== 0 ? kindCmp : a.name.localeCompare(b.name);
+    });
+    const elementIds = eligibleElements.map(e => e.id);
+    const idToIdx = new Map();
+    for (let i = 0; i < elementIds.length; i++) {
+        idToIdx.set(elementIds[i], i);
+    }
+    const n = elementIds.length;
+    // 2. Build elements metadata
+    const elements = {};
+    for (const el of eligibleElements) {
+        elements[el.id] = {
+            name: el.name,
+            kind: el.kind,
+            layer: el.layer,
+            allocatedTo: el.allocatedTo,
+        };
+    }
+    // 3. Build the matrix
+    const matrix = Array.from({ length: n }, () => Array.from({ length: n }, () => null));
+    let totalDependencies = 0;
+    for (const rel of model.relationships) {
+        if (!relTypes.has(rel.type))
+            continue;
+        const srcIdx = idToIdx.get(rel.sourceId);
+        const tgtIdx = idToIdx.get(rel.targetId);
+        if (srcIdx === undefined || tgtIdx === undefined)
+            continue;
+        if (srcIdx === tgtIdx)
+            continue; // skip self-loops
+        let cell = matrix[srcIdx][tgtIdx];
+        if (!cell) {
+            cell = { count: 0, types: [], flowItems: [] };
+            matrix[srcIdx][tgtIdx] = cell;
+        }
+        cell.count++;
+        if (!cell.types.includes(rel.type)) {
+            cell.types.push(rel.type);
+        }
+        if (rel.flowItem && !cell.flowItems.includes(rel.flowItem)) {
+            cell.flowItems.push(rel.flowItem);
+        }
+        totalDependencies++;
+    }
+    // 4. Clustering (simple adjacency-based connected components)
+    const clusters = shouldCluster
+        ? clusterDSM(elementIds, matrix)
+        : new Map();
+    return { elementIds, elements, matrix, clusters, totalDependencies };
+}
+/**
+ * Simple clustering: group elements that are connected (directly or transitively).
+ * Uses union-find for connected component detection.
+ */
+function clusterDSM(elementIds, matrix) {
+    const n = elementIds.length;
+    const parent = Array.from({ length: n }, (_, i) => i);
+    const rank = new Array(n).fill(0);
+    function find(x) {
+        if (parent[x] !== x)
+            parent[x] = find(parent[x]);
+        return parent[x];
+    }
+    function union(a, b) {
+        const ra = find(a);
+        const rb = find(b);
+        if (ra === rb)
+            return;
+        if (rank[ra] < rank[rb]) {
+            parent[ra] = rb;
+        }
+        else if (rank[ra] > rank[rb]) {
+            parent[rb] = ra;
+        }
+        else {
+            parent[rb] = ra;
+            rank[ra]++;
+        }
+    }
+    // Union elements that have any dependency (either direction)
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < n; j++) {
+            if (i !== j && (matrix[i][j] || matrix[j][i])) {
+                union(i, j);
+            }
+        }
+    }
+    // Collect clusters
+    const clusterMap = new Map();
+    for (let i = 0; i < n; i++) {
+        const root = find(i);
+        if (!clusterMap.has(root))
+            clusterMap.set(root, []);
+        clusterMap.get(root).push(elementIds[i]);
+    }
+    // Re-key clusters with sequential IDs
+    const result = new Map();
+    let clusterId = 0;
+    for (const members of clusterMap.values()) {
+        result.set(clusterId++, members);
+    }
+    return result;
+}
+/**
+ * Reorder DSM elements to minimize off-diagonal dependencies (band optimization).
+ * Groups clustered elements together and returns the reordered result.
+ */
+export function reorderDSM(dsm) {
+    // Build ordered list: cluster members together
+    const ordered = [];
+    const placed = new Set();
+    // Place clustered elements in order
+    for (const [, members] of dsm.clusters) {
+        for (const id of members) {
+            if (!placed.has(id)) {
+                ordered.push(id);
+                placed.add(id);
+            }
+        }
+    }
+    // Place any remaining (shouldn't happen, but safety)
+    for (const id of dsm.elementIds) {
+        if (!placed.has(id)) {
+            ordered.push(id);
+        }
+    }
+    // Rebuild matrix with new ordering
+    const n = ordered.length;
+    const oldIdx = new Map();
+    for (let i = 0; i < dsm.elementIds.length; i++) {
+        oldIdx.set(dsm.elementIds[i], i);
+    }
+    const matrix = Array.from({ length: n }, () => Array.from({ length: n }, () => null));
+    for (let newRow = 0; newRow < n; newRow++) {
+        for (let newCol = 0; newCol < n; newCol++) {
+            const oldRow = oldIdx.get(ordered[newRow]);
+            const oldCol = oldIdx.get(ordered[newCol]);
+            matrix[newRow][newCol] = dsm.matrix[oldRow][oldCol];
+        }
+    }
+    return {
+        ...dsm,
+        elementIds: ordered,
+        matrix,
+    };
+}
+//# sourceMappingURL=dsm.js.map

package/packages/tools/lib/analysis/dsm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dsm.js","sourceRoot":"","sources":["../../src/analysis/dsm.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,EAAE;AACF,uEAAuE;AACvE,8DAA8D;AAC9D,uEAAuE;AACvE,gFAAgF;AAsChF,MAAM,aAAa,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,kBAAkB,EAAE,aAAa,CAAC,CAAC;AAClF,MAAM,iBAAiB,GAAG,CAAC,MAAM,EAAE,cAAc,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;AAE7F;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,KAAmB,EAAE,OAAoB;IAChE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,aAAa,CAAC,CAAC;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,iBAAiB,IAAI,iBAAiB,CAAC,CAAC;IAC1E,MAAM,aAAa,GAAG,OAAO,EAAE,OAAO,IAAI,IAAI,CAAC;IAE/C,+BAA+B;IAC/B,MAAM,gBAAgB,GAAkB,EAAE,CAAC;IAC3C,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC7C,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,6CAA6C;IAC7C,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;IAE5B,6BAA6B;IAC7B,MAAM,QAAQ,GAA0B,EAAE,CAAC;IAC3C,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAChC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG;YACd,IAAI,EAAE,EAAE,CAAC,IAAI;YACb,IAAI,EAAE,EAAE,CAAC,IAAI;YACb,KAAK,EAAE,EAAE,CAAC,KAAK;YACf,WAAW,EAAE,EAAE,CAAC,WAAW;SAC9B,CAAC;IACN,CAAC;IAED,sBAAsB;IACtB,MAAM,MAAM,GAAyB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAChE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CACxC,CAAC;IAEF,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAEtC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QAC3D,IAAI,MAAM,KAAK,MAAM;YAAE,SAAS,CAAC,kBAAkB;QAEnD,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;QAClC,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,GAAG,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;QACD,iBAAiB,EAAE,CAAC;IACxB,CAAC;IAED,8DAA8D;IAC9D,MAAM,QAAQ,GAAG,aAAa;QAC1B,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,MAAM,CAAC;QAChC,CAAC,CAAC,IAAI,GAAG,EAAoB,CAAC;IAElC,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;AACzE,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CACf,UAAoB,EACpB,MAA4B;IAE5B,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;IAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAElC,SAAS,IAAI,CAAC,CAAS;QACnB,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO;QACtB,IAAI,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QAAC,CAAC;aACxC,IAAI,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QAAC,CAAC;aAC7C,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QAAC,CAAC;IACzC,CAAC;IAED,6DAA6D;IAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChB,CAAC;QACL,CAAC;IACL,CAAC;IAED,mBAAmB;IACnB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACpD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,sCAAsC;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,OAAO,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAc;IACrC,+CAA+C;IAC/C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IAEjC,oCAAoC;IACpC,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACL,CAAC;IACL,CAAC;IAED,qDAAqD;IACrD,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;IACL,CAAC;IAED,mCAAmC;IACnC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,MAAM,GAAyB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAChE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CACxC,CAAC;IAEF,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;QACxC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAE,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;QACxD,CAAC;IACL,CAAC;IAED,OAAO;QACH,GAAG,GAAG;QACN,UAAU,EAAE,OAAO;QACnB,MAAM;KACT,CAAC;AACN,CAAC"}

package/packages/tools/lib/analysis/impact.d.ts

@@ -0,0 +1,35 @@
+import type { MemoModelDTO } from '../model/semantic.js';
+export interface ImpactNode {
+    elementId: string;
+    name: string;
+    kind: string;
+    layer: string;
+    depth: number;
+    /** Relationship type that connects this node to its parent in the traversal */
+    viaRelType: string;
+    /** Direction of the relationship from the parent's perspective */
+    direction: 'downstream' | 'upstream';
+}
+export interface ImpactEdge {
+    fromId: string;
+    toId: string;
+    relType: string;
+    relId: string;
+}
+export interface ImpactResult {
+    rootId: string;
+    rootName: string;
+    rootKind: string;
+    nodes: ImpactNode[];
+    edges: ImpactEdge[];
+}
+export type ImpactDirection = 'downstream' | 'upstream' | 'both';
+/**
+ * Compute impact analysis via BFS from a root element.
+ *
+ * - `downstream`: follows outgoing relationships (what does this element affect?)
+ * - `upstream`: follows incoming relationships (what depends on this element?)
+ * - `both`: follows both directions
+ */
+export declare function computeImpact(model: MemoModelDTO, elementId: string, direction?: ImpactDirection, maxDepth?: number): ImpactResult;
+//# sourceMappingURL=impact.d.ts.map

package/packages/tools/lib/analysis/impact.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"impact.d.ts","sourceRoot":"","sources":["../../src/analysis/impact.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,YAAY,EAAoB,MAAM,sBAAsB,CAAC;AAE3E,MAAM,WAAW,UAAU;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,+EAA+E;IAC/E,UAAU,EAAE,MAAM,CAAC;IACnB,kEAAkE;IAClE,SAAS,EAAE,YAAY,GAAG,UAAU,CAAC;CACxC;AAED,MAAM,WAAW,UAAU;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,YAAY;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,KAAK,EAAE,UAAU,EAAE,CAAC;CACvB;AAED,MAAM,MAAM,eAAe,GAAG,YAAY,GAAG,UAAU,GAAG,MAAM,CAAC;AAEjE;;;;;;GAMG;AACH,wBAAgB,aAAa,CACzB,KAAK,EAAE,YAAY,EACnB,SAAS,EAAE,MAAM,EACjB,SAAS,GAAE,eAAwB,EACnC,QAAQ,GAAE,MAAW,GACtB,YAAY,CA4Fd"}

package/packages/tools/lib/analysis/impact.js

@@ -0,0 +1,97 @@
+// ─── Impact Analysis ────────────────────────────────────────────────────────
+//
+// BFS traversal from a root element through relationship graph.
+// Supports downstream (follow outgoing), upstream (follow incoming), or both.
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Compute impact analysis via BFS from a root element.
+ *
+ * - `downstream`: follows outgoing relationships (what does this element affect?)
+ * - `upstream`: follows incoming relationships (what depends on this element?)
+ * - `both`: follows both directions
+ */
+export function computeImpact(model, elementId, direction = 'both', maxDepth = 10) {
+    const root = model.elements[elementId];
+    if (!root) {
+        return { rootId: elementId, rootName: '(unknown)', rootKind: '', nodes: [], edges: [] };
+    }
+    // Build adjacency indexes from relationships
+    const outgoing = new Map();
+    const incoming = new Map();
+    for (const rel of model.relationships) {
+        if (!outgoing.has(rel.sourceId))
+            outgoing.set(rel.sourceId, []);
+        outgoing.get(rel.sourceId).push(rel);
+        if (!incoming.has(rel.targetId))
+            incoming.set(rel.targetId, []);
+        incoming.get(rel.targetId).push(rel);
+    }
+    const visited = new Set();
+    visited.add(elementId);
+    const nodes = [];
+    const edges = [];
+    // BFS queue: [elementId, depth]
+    const queue = [[elementId, 0]];
+    while (queue.length > 0) {
+        const [currentId, depth] = queue.shift();
+        if (depth >= maxDepth)
+            continue;
+        const nextDepth = depth + 1;
+        // Downstream: follow outgoing relationships
+        if (direction === 'downstream' || direction === 'both') {
+            for (const rel of outgoing.get(currentId) || []) {
+                const targetId = rel.targetId;
+                edges.push({ fromId: currentId, toId: targetId, relType: rel.type, relId: rel.id });
+                if (!visited.has(targetId)) {
+                    visited.add(targetId);
+                    const target = model.elements[targetId];
+                    if (target) {
+                        nodes.push({
+                            elementId: targetId,
+                            name: target.name,
+                            kind: target.kind,
+                            layer: target.layer,
+                            depth: nextDepth,
+                            viaRelType: rel.type,
+                            direction: 'downstream',
+                        });
+                        queue.push([targetId, nextDepth]);
+                    }
+                }
+            }
+        }
+        // Upstream: follow incoming relationships
+        if (direction === 'upstream' || direction === 'both') {
+            for (const rel of incoming.get(currentId) || []) {
+                const sourceId = rel.sourceId;
+                edges.push({ fromId: sourceId, toId: currentId, relType: rel.type, relId: rel.id });
+                if (!visited.has(sourceId)) {
+                    visited.add(sourceId);
+                    const source = model.elements[sourceId];
+                    if (source) {
+                        nodes.push({
+                            elementId: sourceId,
+                            name: source.name,
+                            kind: source.kind,
+                            layer: source.layer,
+                            depth: nextDepth,
+                            viaRelType: rel.type,
+                            direction: 'upstream',
+                        });
+                        queue.push([sourceId, nextDepth]);
+                    }
+                }
+            }
+        }
+    }
+    // Sort by depth, then name
+    nodes.sort((a, b) => a.depth - b.depth || a.name.localeCompare(b.name));
+    return {
+        rootId: elementId,
+        rootName: root.name,
+        rootKind: root.kind,
+        nodes,
+        edges,
+    };
+}
+//# sourceMappingURL=impact.js.map

package/packages/tools/lib/analysis/impact.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"impact.js","sourceRoot":"","sources":["../../src/analysis/impact.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAC/E,EAAE;AACF,gEAAgE;AAChE,8EAA8E;AAC9E,gFAAgF;AAiChF;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CACzB,KAAmB,EACnB,SAAiB,EACjB,YAA6B,MAAM,EACnC,WAAmB,EAAE;IAErB,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACvC,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAC5F,CAAC;IAED,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAC;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAC;IACvD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAChE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAChE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAEvB,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAiB,EAAE,CAAC;IAE/B,gCAAgC;IAChC,MAAM,KAAK,GAAuB,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;IAEnD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1C,IAAI,KAAK,IAAI,QAAQ;YAAE,SAAS;QAEhC,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC;QAE5B,4CAA4C;QAC5C,IAAI,SAAS,KAAK,YAAY,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC9C,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;gBAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;gBAEpF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;oBACxC,IAAI,MAAM,EAAE,CAAC;wBACT,KAAK,CAAC,IAAI,CAAC;4BACP,SAAS,EAAE,QAAQ;4BACnB,IAAI,EAAE,MAAM,CAAC,IAAI;4BACjB,IAAI,EAAE,MAAM,CAAC,IAAI;4BACjB,KAAK,EAAE,MAAM,CAAC,KAAK;4BACnB,KAAK,EAAE,SAAS;4BAChB,UAAU,EAAE,GAAG,CAAC,IAAI;4BACpB,SAAS,EAAE,YAAY;yBAC1B,CAAC,CAAC;wBACH,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;oBACtC,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,0CAA0C;QAC1C,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACnD,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC9C,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;gBAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;gBAEpF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;oBACxC,IAAI,MAAM,EAAE,CAAC;wBACT,KAAK,CAAC,IAAI,CAAC;4BACP,SAAS,EAAE,QAAQ;4BACnB,IAAI,EAAE,MAAM,CAAC,IAAI;4BACjB,IAAI,EAAE,MAAM,CAAC,IAAI;4BACjB,KAAK,EAAE,MAAM,CAAC,KAAK;4BACnB,KAAK,EAAE,SAAS;4BAChB,UAAU,EAAE,GAAG,CAAC,IAAI;4BACpB,SAAS,EAAE,UAAU;yBACxB,CAAC,CAAC;wBACH,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;oBACtC,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,2BAA2B;IAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAExE,OAAO;QACH,MAAM,EAAE,SAAS;QACjB,QAAQ,EAAE,IAAI,CAAC,IAAI;QACnB,QAAQ,EAAE,IAAI,CAAC,IAAI;QACnB,KAAK;QACL,KAAK;KACR,CAAC;AACN,CAAC"}

package/packages/tools/lib/bin/memo.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=memo.d.ts.map

package/packages/tools/lib/bin/memo.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memo.d.ts","sourceRoot":"","sources":["../../src/bin/memo.ts"],"names":[],"mappings":""}