cognitive-core 0.2.4 → 0.3.1

package/dist/experimental/graph-layers/base.js

@@ -0,0 +1,143 @@
+import { inferLayerFromRelation } from '../../types/knowledge.js';
+/**
+ * Base implementation for a graph layer.
+ *
+ * Uses an in-memory adjacency list for O(1) edge lookups.
+ * Subclasses only override the set of valid relation types for their layer.
+ */
+export class BaseGraphLayer {
+    enabled;
+    /** Outgoing edges: nodeId → edges[] */
+    outgoing = new Map();
+    /** Incoming edges: nodeId → edges[] */
+    incoming = new Map();
+    constructor(enabled = true) {
+        this.enabled = enabled;
+    }
+    getEdges(nodeId, direction = 'both') {
+        const result = [];
+        if (direction === 'outgoing' || direction === 'both') {
+            result.push(...(this.outgoing.get(nodeId) ?? []));
+        }
+        if (direction === 'incoming' || direction === 'both') {
+            result.push(...(this.incoming.get(nodeId) ?? []));
+        }
+        return result;
+    }
+    neighbors(nodeId, depth = 1) {
+        const visited = new Set();
+        const queue = [{ id: nodeId, d: 0 }];
+        visited.add(nodeId);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.d >= depth)
+                continue;
+            const edges = this.getEdges(current.id, 'both');
+            for (const edge of edges) {
+                const neighborId = edge.from === current.id ? edge.to : edge.from;
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    queue.push({ id: neighborId, d: current.d + 1 });
+                }
+            }
+        }
+        visited.delete(nodeId);
+        return Array.from(visited);
+    }
+    pathBetween(fromId, toId) {
+        if (fromId === toId)
+            return [fromId];
+        const visited = new Set();
+        const parent = new Map();
+        const queue = [fromId];
+        visited.add(fromId);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            const edges = this.getEdges(current, 'both');
+            for (const edge of edges) {
+                const neighborId = edge.from === current ? edge.to : edge.from;
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    parent.set(neighborId, current);
+                    if (neighborId === toId) {
+                        // Reconstruct path
+                        const path = [toId];
+                        let node = toId;
+                        while (parent.has(node)) {
+                            node = parent.get(node);
+                            path.unshift(node);
+                        }
+                        return path;
+                    }
+                    queue.push(neighborId);
+                }
+            }
+        }
+        return null;
+    }
+    addEdge(edge) {
+        // Add to outgoing
+        if (!this.outgoing.has(edge.from)) {
+            this.outgoing.set(edge.from, []);
+        }
+        this.outgoing.get(edge.from).push(edge);
+        // Add to incoming
+        if (!this.incoming.has(edge.to)) {
+            this.incoming.set(edge.to, []);
+        }
+        this.incoming.get(edge.to).push(edge);
+    }
+    removeEdge(fromId, toId, relation) {
+        const outEdges = this.outgoing.get(fromId);
+        if (outEdges) {
+            const idx = outEdges.findIndex((e) => e.to === toId && e.relation === relation);
+            if (idx !== -1)
+                outEdges.splice(idx, 1);
+        }
+        const inEdges = this.incoming.get(toId);
+        if (inEdges) {
+            const idx = inEdges.findIndex((e) => e.from === fromId && e.relation === relation);
+            if (idx !== -1)
+                inEdges.splice(idx, 1);
+        }
+    }
+    getAllEdges() {
+        const edges = [];
+        for (const edgeList of this.outgoing.values()) {
+            edges.push(...edgeList);
+        }
+        return edges;
+    }
+    edgeCount() {
+        let count = 0;
+        for (const edgeList of this.outgoing.values()) {
+            count += edgeList.length;
+        }
+        return count;
+    }
+    rebuild(notes) {
+        this.clear();
+        for (const note of notes) {
+            for (const link of note.frontmatter.links) {
+                // Determine if this link belongs to this layer
+                const explicitLayer = link.layer;
+                const inferredLayer = inferLayerFromRelation(link.relation);
+                const belongsToLayer = explicitLayer === this.name || (!explicitLayer && inferredLayer === this.name);
+                if (belongsToLayer) {
+                    this.addEdge({
+                        from: note.frontmatter.id,
+                        to: link.target,
+                        relation: link.relation,
+                        weight: 1.0,
+                        created: note.frontmatter.updated,
+                    });
+                }
+            }
+        }
+    }
+    clear() {
+        this.outgoing.clear();
+        this.incoming.clear();
+    }
+}
+//# sourceMappingURL=base.js.map

package/dist/experimental/graph-layers/base.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base.js","sourceRoot":"","sources":["../../../src/experimental/graph-layers/base.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;GAKG;AACH,MAAM,OAAgB,cAAc;IAEzB,OAAO,CAAU;IAE1B,uCAAuC;IAC7B,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IACpD,uCAAuC;IAC7B,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAKpD,YAAY,UAAmB,IAAI;QACjC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,QAAQ,CAAC,MAAc,EAAE,YAA8C,MAAM;QAC3E,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS,CAAC,MAAc,EAAE,QAAgB,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAqC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACvE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK;gBAAE,SAAS;YAEjC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,WAAW,CAAC,MAAc,EAAE,IAAY;QACtC,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAErC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC/D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;oBAEhC,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;wBACxB,mBAAmB;wBACnB,MAAM,IAAI,GAAa,CAAC,IAAI,CAAC,CAAC;wBAC9B,IAAI,IAAI,GAAG,IAAI,CAAC;wBAChB,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;4BACxB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;4BACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;wBACrB,CAAC;wBACD,OAAO,IAAI,CAAC;oBACd,CAAC;oBAED,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,IAAe;QACrB,kBAAkB;QAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEzC,kBAAkB;QAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,UAAU,CAAC,MAAc,EAAE,IAAY,EAAE,QAAgB;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;YAChF,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1C,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;YACnF,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,WAAW;QACT,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS;QACP,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,KAAK,IAAI,QAAQ,CAAC,MAAM,CAAC;QAC3B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,CAAC,KAAsB;QAC5B,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;gBAC1C,+CAA+C;gBAC/C,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC;gBACjC,MAAM,aAAa,GAAG,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5D,MAAM,cAAc,GAClB,aAAa,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,aAAa,IAAI,aAAa,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;gBAEjF,IAAI,cAAc,EAAE,CAAC;oBACnB,IAAI,CAAC,OAAO,CAAC;wBACX,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE;wBACzB,EAAE,EAAE,IAAI,CAAC,MAAM;wBACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;wBACvB,MAAM,EAAE,GAAG;wBACX,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO;qBAClC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;CACF"}

package/dist/experimental/graph-layers/causal.d.ts

@@ -0,0 +1,14 @@
+import type { LinkRelation } from '../../types/knowledge.js';
+import { BaseGraphLayer } from './base.js';
+/**
+ * Causal graph layer — captures cause-effect chains between facts.
+ *
+ * Relations: caused-by, led-to, broke, enabled, prevented
+ *
+ * Disabled by default.
+ */
+export declare class CausalGraphLayer extends BaseGraphLayer {
+    readonly name: "causal";
+    protected readonly validRelations: readonly LinkRelation[];
+}
+//# sourceMappingURL=causal.d.ts.map

package/dist/experimental/graph-layers/causal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"causal.d.ts","sourceRoot":"","sources":["../../../src/experimental/graph-layers/causal.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAE7D,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3C;;;;;;GAMG;AACH,qBAAa,gBAAiB,SAAQ,cAAc;IAClD,QAAQ,CAAC,IAAI,EAAG,QAAQ,CAAU;IAClC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,SAAS,YAAY,EAAE,CAAoB;CAC/E"}

package/dist/experimental/graph-layers/causal.js

@@ -0,0 +1,14 @@
+import { CAUSAL_RELATIONS } from '../knowledge-graph-types.js';
+import { BaseGraphLayer } from './base.js';
+/**
+ * Causal graph layer — captures cause-effect chains between facts.
+ *
+ * Relations: caused-by, led-to, broke, enabled, prevented
+ *
+ * Disabled by default.
+ */
+export class CausalGraphLayer extends BaseGraphLayer {
+    name = 'causal';
+    validRelations = CAUSAL_RELATIONS;
+}
+//# sourceMappingURL=causal.js.map

package/dist/experimental/graph-layers/causal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"causal.js","sourceRoot":"","sources":["../../../src/experimental/graph-layers/causal.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3C;;;;;;GAMG;AACH,MAAM,OAAO,gBAAiB,SAAQ,cAAc;IACzC,IAAI,GAAG,QAAiB,CAAC;IACf,cAAc,GAA4B,gBAAgB,CAAC;CAC/E"}

package/dist/experimental/graph-layers/entity.d.ts

@@ -0,0 +1,14 @@
+import type { LinkRelation } from '../../types/knowledge.js';
+import { BaseGraphLayer } from './base.js';
+/**
+ * Entity graph layer — captures relationships between tools/libs/components.
+ *
+ * Relations: uses, part-of, interacts-with, contradicts, created-by
+ *
+ * Disabled by default.
+ */
+export declare class EntityGraphLayer extends BaseGraphLayer {
+    readonly name: "entity";
+    protected readonly validRelations: readonly LinkRelation[];
+}
+//# sourceMappingURL=entity.d.ts.map

package/dist/experimental/graph-layers/entity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity.d.ts","sourceRoot":"","sources":["../../../src/experimental/graph-layers/entity.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAE7D,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3C;;;;;;GAMG;AACH,qBAAa,gBAAiB,SAAQ,cAAc;IAClD,QAAQ,CAAC,IAAI,EAAG,QAAQ,CAAU;IAClC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,SAAS,YAAY,EAAE,CAAoB;CAC/E"}

package/dist/experimental/graph-layers/entity.js

@@ -0,0 +1,14 @@
+import { ENTITY_RELATIONS } from '../knowledge-graph-types.js';
+import { BaseGraphLayer } from './base.js';
+/**
+ * Entity graph layer — captures relationships between tools/libs/components.
+ *
+ * Relations: uses, part-of, interacts-with, contradicts, created-by
+ *
+ * Disabled by default.
+ */
+export class EntityGraphLayer extends BaseGraphLayer {
+    name = 'entity';
+    validRelations = ENTITY_RELATIONS;
+}
+//# sourceMappingURL=entity.js.map

package/dist/experimental/graph-layers/entity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity.js","sourceRoot":"","sources":["../../../src/experimental/graph-layers/entity.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3C;;;;;;GAMG;AACH,MAAM,OAAO,gBAAiB,SAAQ,cAAc;IACzC,IAAI,GAAG,QAAiB,CAAC;IACf,cAAc,GAA4B,gBAAgB,CAAC;CAC/E"}

package/dist/experimental/graph-layers/index.d.ts

@@ -0,0 +1,6 @@
+export { BaseGraphLayer } from './base.js';
+export { SemanticGraphLayer } from './semantic.js';
+export { TemporalGraphLayer } from './temporal.js';
+export { CausalGraphLayer } from './causal.js';
+export { EntityGraphLayer } from './entity.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/experimental/graph-layers/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/experimental/graph-layers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC"}

package/dist/experimental/graph-layers/index.js

@@ -0,0 +1,6 @@
+export { BaseGraphLayer } from './base.js';
+export { SemanticGraphLayer } from './semantic.js';
+export { TemporalGraphLayer } from './temporal.js';
+export { CausalGraphLayer } from './causal.js';
+export { EntityGraphLayer } from './entity.js';
+//# sourceMappingURL=index.js.map

package/dist/experimental/graph-layers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/experimental/graph-layers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC"}

package/dist/experimental/graph-layers/semantic.d.ts

@@ -0,0 +1,14 @@
+import type { LinkRelation } from '../../types/knowledge.js';
+import { BaseGraphLayer } from './base.js';
+/**
+ * Semantic graph layer — captures conceptual relationships.
+ *
+ * Relations: related-to, depends-on, specializes, generalizes, supports
+ *
+ * Always enabled by default.
+ */
+export declare class SemanticGraphLayer extends BaseGraphLayer {
+    readonly name: "semantic";
+    protected readonly validRelations: readonly LinkRelation[];
+}
+//# sourceMappingURL=semantic.d.ts.map

package/dist/experimental/graph-layers/semantic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic.d.ts","sourceRoot":"","sources":["../../../src/experimental/graph-layers/semantic.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAE7D,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3C;;;;;;GAMG;AACH,qBAAa,kBAAmB,SAAQ,cAAc;IACpD,QAAQ,CAAC,IAAI,EAAG,UAAU,CAAU;IACpC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,SAAS,YAAY,EAAE,CAAsB;CACjF"}

package/dist/experimental/graph-layers/semantic.js

@@ -0,0 +1,14 @@
+import { SEMANTIC_RELATIONS } from '../knowledge-graph-types.js';
+import { BaseGraphLayer } from './base.js';
+/**
+ * Semantic graph layer — captures conceptual relationships.
+ *
+ * Relations: related-to, depends-on, specializes, generalizes, supports
+ *
+ * Always enabled by default.
+ */
+export class SemanticGraphLayer extends BaseGraphLayer {
+    name = 'semantic';
+    validRelations = SEMANTIC_RELATIONS;
+}
+//# sourceMappingURL=semantic.js.map

package/dist/experimental/graph-layers/semantic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic.js","sourceRoot":"","sources":["../../../src/experimental/graph-layers/semantic.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3C;;;;;;GAMG;AACH,MAAM,OAAO,kBAAmB,SAAQ,cAAc;IAC3C,IAAI,GAAG,UAAmB,CAAC;IACjB,cAAc,GAA4B,kBAAkB,CAAC;CACjF"}

package/dist/experimental/graph-layers/temporal.d.ts

@@ -0,0 +1,14 @@
+import type { LinkRelation } from '../../types/knowledge.js';
+import { BaseGraphLayer } from './base.js';
+/**
+ * Temporal graph layer — captures when knowledge was learned and how it evolved.
+ *
+ * Relations: observed-before, observed-after, co-occurred, supersedes
+ *
+ * Disabled by default.
+ */
+export declare class TemporalGraphLayer extends BaseGraphLayer {
+    readonly name: "temporal";
+    protected readonly validRelations: readonly LinkRelation[];
+}
+//# sourceMappingURL=temporal.d.ts.map

package/dist/experimental/graph-layers/temporal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal.d.ts","sourceRoot":"","sources":["../../../src/experimental/graph-layers/temporal.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAE7D,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3C;;;;;;GAMG;AACH,qBAAa,kBAAmB,SAAQ,cAAc;IACpD,QAAQ,CAAC,IAAI,EAAG,UAAU,CAAU;IACpC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,SAAS,YAAY,EAAE,CAAsB;CACjF"}

package/dist/experimental/graph-layers/temporal.js

@@ -0,0 +1,14 @@
+import { TEMPORAL_RELATIONS } from '../knowledge-graph-types.js';
+import { BaseGraphLayer } from './base.js';
+/**
+ * Temporal graph layer — captures when knowledge was learned and how it evolved.
+ *
+ * Relations: observed-before, observed-after, co-occurred, supersedes
+ *
+ * Disabled by default.
+ */
+export class TemporalGraphLayer extends BaseGraphLayer {
+    name = 'temporal';
+    validRelations = TEMPORAL_RELATIONS;
+}
+//# sourceMappingURL=temporal.js.map

package/dist/experimental/graph-layers/temporal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal.js","sourceRoot":"","sources":["../../../src/experimental/graph-layers/temporal.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3C;;;;;;GAMG;AACH,MAAM,OAAO,kBAAmB,SAAQ,cAAc;IAC3C,IAAI,GAAG,UAAmB,CAAC;IACjB,cAAc,GAA4B,kBAAkB,CAAC;CACjF"}

package/dist/experimental/healing-orchestrator.d.ts

@@ -0,0 +1,182 @@
+/**
+ * HealingOrchestrator — Plug-in anomaly detection and repair pattern.
+ *
+ * Inspired by ruvector's HealingOrchestrator (ruvector-dag/healing/orchestrator.rs).
+ * Runs registered anomaly detectors and repair strategies in each maintenance
+ * cycle. Detectors and strategies are push-registered via add methods.
+ *
+ * The orchestrator itself has no internal timer — `runCycle()` is called
+ * explicitly by the MaintenanceScheduler or manually by the caller.
+ */
+/**
+ * Health context provided to detectors and repair strategies.
+ */
+export interface HealthContext {
+    /** Total trajectories processed since last cycle */
+    trajectoriesProcessed: number;
+    /** Current experience count */
+    experienceCount: number;
+    /** Current playbook count */
+    playbookCount: number;
+    /** Recent success rate (0.0–1.0) */
+    recentSuccessRate: number;
+    /** Batches since last maintenance */
+    batchesSinceLastMaintenance: number;
+    /** Custom metrics from subsystems */
+    metrics: Record<string, number>;
+}
+/**
+ * An anomaly detected by a detector.
+ */
+export interface Anomaly {
+    /** Unique type identifier (e.g., 'playbook-drift', 'memory-bloat') */
+    type: string;
+    /** Severity: higher = more urgent */
+    severity: 'low' | 'medium' | 'high';
+    /** Human-readable description */
+    description: string;
+    /** Detector that found this anomaly */
+    detectorName: string;
+    /** Arbitrary data for repair strategies to use */
+    data?: Record<string, unknown>;
+}
+/**
+ * Result of a repair attempt.
+ */
+export interface RepairResult {
+    /** Whether the repair was successful */
+    success: boolean;
+    /** What the repair strategy did */
+    action: string;
+    /** Repair strategy name */
+    strategyName: string;
+    /** Duration in ms */
+    durationMs: number;
+}
+/**
+ * Result of a full healing cycle.
+ */
+export interface HealingCycleResult {
+    /** Anomalies detected in this cycle */
+    anomaliesDetected: Anomaly[];
+    /** Repair attempts and their results */
+    repairs: RepairResult[];
+    /** Total duration of the cycle in ms */
+    durationMs: number;
+    /** Timestamp */
+    timestamp: Date;
+}
+/**
+ * Interface for anomaly detectors.
+ * Implement this to create custom health checks.
+ */
+export interface AnomalyDetector {
+    /** Unique name for this detector */
+    readonly name: string;
+    /** Run detection and return any anomalies found */
+    detect(context: HealthContext): Promise<Anomaly[]>;
+}
+/**
+ * Interface for repair strategies.
+ * Implement this to create custom repair actions.
+ */
+export interface RepairStrategy {
+    /** Unique name for this strategy */
+    readonly name: string;
+    /** Check if this strategy can handle a given anomaly type */
+    canRepair(anomaly: Anomaly): boolean;
+    /** Attempt to repair the anomaly */
+    repair(anomaly: Anomaly, context: HealthContext): Promise<RepairResult>;
+}
+/**
+ * HealingOrchestrator — coordinates anomaly detection and repair.
+ */
+export declare class HealingOrchestrator {
+    private detectors;
+    private strategies;
+    private cycleHistory;
+    private maxHistorySize;
+    constructor(options?: {
+        maxHistorySize?: number;
+    });
+    /**
+     * Register an anomaly detector.
+     */
+    addDetector(detector: AnomalyDetector): void;
+    /**
+     * Unregister an anomaly detector by name.
+     */
+    removeDetector(name: string): void;
+    /**
+     * Register a repair strategy.
+     */
+    addRepairStrategy(strategy: RepairStrategy): void;
+    /**
+     * Unregister a repair strategy by name.
+     */
+    removeRepairStrategy(name: string): void;
+    /**
+     * Run a healing cycle.
+     *
+     * 1. Runs all registered detectors to find anomalies
+     * 2. For each anomaly, finds the first matching repair strategy
+     * 3. Executes the repair
+     */
+    runCycle(context: HealthContext): Promise<HealingCycleResult>;
+    /**
+     * Get cycle history for diagnostics.
+     */
+    getCycleHistory(): readonly HealingCycleResult[];
+    /**
+     * Get registered detectors.
+     */
+    getDetectors(): readonly AnomalyDetector[];
+    /**
+     * Get registered repair strategies.
+     */
+    getRepairStrategies(): readonly RepairStrategy[];
+}
+/**
+ * Create a HealingOrchestrator.
+ */
+export declare function createHealingOrchestrator(options?: {
+    maxHistorySize?: number;
+}): HealingOrchestrator;
+/**
+ * Detects when playbook success rates are consistently low,
+ * suggesting playbook drift.
+ */
+export declare class PlaybookDriftDetector implements AnomalyDetector {
+    readonly name = "playbook-drift";
+    private threshold;
+    constructor(threshold?: number);
+    detect(context: HealthContext): Promise<Anomaly[]>;
+}
+/**
+ * Detects when the experience store is growing beyond capacity,
+ * suggesting aggressive pruning is needed.
+ */
+export declare class MemoryBloatDetector implements AnomalyDetector {
+    readonly name = "memory-bloat";
+    private maxExperiences;
+    private warningRatio;
+    constructor(maxExperiences?: number, warningRatio?: number);
+    detect(context: HealthContext): Promise<Anomaly[]>;
+}
+/**
+ * Detects when a custom metric exceeds a Z-score threshold,
+ * inspired by ruvector's Z-score-based outlier detection.
+ */
+export declare class MetricDriftDetector implements AnomalyDetector {
+    readonly name: string;
+    private metricKey;
+    private history;
+    private windowSize;
+    private zThreshold;
+    constructor(metricKey: string, options?: {
+        windowSize?: number;
+        zThreshold?: number;
+    });
+    detect(context: HealthContext): Promise<Anomaly[]>;
+}
+//# sourceMappingURL=healing-orchestrator.d.ts.map

package/dist/experimental/healing-orchestrator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"healing-orchestrator.d.ts","sourceRoot":"","sources":["../../src/experimental/healing-orchestrator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,oDAAoD;IACpD,qBAAqB,EAAE,MAAM,CAAC;IAC9B,+BAA+B;IAC/B,eAAe,EAAE,MAAM,CAAC;IACxB,6BAA6B;IAC7B,aAAa,EAAE,MAAM,CAAC;IACtB,oCAAoC;IACpC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,qCAAqC;IACrC,2BAA2B,EAAE,MAAM,CAAC;IACpC,qCAAqC;IACrC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjC;AAED;;GAEG;AACH,MAAM,WAAW,OAAO;IACtB,sEAAsE;IACtE,IAAI,EAAE,MAAM,CAAC;IACb,qCAAqC;IACrC,QAAQ,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IACpC,iCAAiC;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,uCAAuC;IACvC,YAAY,EAAE,MAAM,CAAC;IACrB,kDAAkD;IAClD,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,wCAAwC;IACxC,OAAO,EAAE,OAAO,CAAC;IACjB,mCAAmC;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,2BAA2B;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,qBAAqB;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,uCAAuC;IACvC,iBAAiB,EAAE,OAAO,EAAE,CAAC;IAC7B,wCAAwC;IACxC,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,wCAAwC;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,gBAAgB;IAChB,SAAS,EAAE,IAAI,CAAC;CACjB;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B,oCAAoC;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;CACpD;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B,oCAAoC;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,6DAA6D;IAC7D,SAAS,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC;IACrC,oCAAoC;IACpC,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;CACzE;AAED;;GAEG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,SAAS,CAAyB;IAC1C,OAAO,CAAC,UAAU,CAAwB;IAC1C,OAAO,CAAC,YAAY,CAA4B;IAChD,OAAO,CAAC,cAAc,CAAS;gBAEnB,OAAO,CAAC,EAAE;QAAE,cAAc,CAAC,EAAE,MAAM,CAAA;KAAE;IAIjD;;OAEG;IACH,WAAW,CAAC,QAAQ,EAAE,eAAe,GAAG,IAAI;IAM5C;;OAEG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAIlC;;OAEG;IACH,iBAAiB,CAAC,QAAQ,EAAE,cAAc,GAAG,IAAI;IAKjD;;OAEG;IACH,oBAAoB,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAIxC;;;;;;OAMG;IACG,QAAQ,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAkEnE;;OAEG;IACH,eAAe,IAAI,SAAS,kBAAkB,EAAE;IAIhD;;OAEG;IACH,YAAY,IAAI,SAAS,eAAe,EAAE;IAI1C;;OAEG;IACH,mBAAmB,IAAI,SAAS,cAAc,EAAE;CAGjD;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,CAAC,EAAE;IAClD,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB,GAAG,mBAAmB,CAEtB;AAMD;;;GAGG;AACH,qBAAa,qBAAsB,YAAW,eAAe;IAC3D,QAAQ,CAAC,IAAI,oBAAoB;IACjC,OAAO,CAAC,SAAS,CAAS;gBAEd,SAAS,SAAM;IAIrB,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;CAsBzD;AAED;;;GAGG;AACH,qBAAa,mBAAoB,YAAW,eAAe;IACzD,QAAQ,CAAC,IAAI,kBAAkB;IAC/B,OAAO,CAAC,cAAc,CAAS;IAC/B,OAAO,CAAC,YAAY,CAAS;gBAEjB,cAAc,SAAO,EAAE,YAAY,SAAM;IAK/C,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;CAuBzD;AAED;;;GAGG;AACH,qBAAa,mBAAoB,YAAW,eAAe;IACzD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,UAAU,CAAS;gBAEf,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE;IAO/E,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;CAiCzD"}