cognitive-core 0.1.0 → 0.1.2

package/dist/memory/knowledge-graph.js

@@ -0,0 +1,273 @@
+import { readFile, writeFile, mkdir } from 'node:fs/promises';
+import { join } from 'node:path';
+import { DEFAULT_GRAPH_CONFIG } from '../types/knowledge-graph.js';
+import { SemanticGraphLayer, TemporalGraphLayer, CausalGraphLayer, EntityGraphLayer, } from './graph-layers/index.js';
+/**
+ * KnowledgeGraphManager
+ *
+ * Manages a multi-layer graph overlay over the knowledge note filesystem.
+ * All layers share the same node set. Each layer maintains its own edges.
+ * The graph is a derived index — it can be rebuilt from frontmatter.
+ */
+export class KnowledgeGraphManager {
+    nodes = new Map();
+    layers = new Map();
+    config;
+    constructor(config) {
+        this.config = { ...DEFAULT_GRAPH_CONFIG, ...config };
+        this.initLayers();
+    }
+    initLayers() {
+        const enabled = new Set(this.config.enabledLayers);
+        this.layers.set('semantic', new SemanticGraphLayer(enabled.has('semantic')));
+        this.layers.set('temporal', new TemporalGraphLayer(enabled.has('temporal')));
+        this.layers.set('causal', new CausalGraphLayer(enabled.has('causal')));
+        this.layers.set('entity', new EntityGraphLayer(enabled.has('entity')));
+    }
+    // === Layer Access ===
+    getLayer(name) {
+        const layer = this.layers.get(name);
+        if (!layer || !layer.enabled)
+            return null;
+        return layer;
+    }
+    // === Node Management ===
+    addNode(node) {
+        this.nodes.set(node.id, node);
+    }
+    removeNode(nodeId) {
+        this.nodes.delete(nodeId);
+        // Remove edges from all layers
+        for (const layer of this.layers.values()) {
+            const edges = layer.getEdges(nodeId, 'both');
+            for (const edge of edges) {
+                layer.removeEdge(edge.from, edge.to, edge.relation);
+            }
+        }
+    }
+    getNode(nodeId) {
+        return this.nodes.get(nodeId);
+    }
+    getAllNodes() {
+        return Array.from(this.nodes.values());
+    }
+    // === Cross-Layer Queries ===
+    neighbors(nodeId, options) {
+        const depth = options?.depth ?? 1;
+        const minWeight = options?.minWeight ?? 0;
+        const targetLayers = options?.layers ?? this.config.enabledLayers;
+        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;
+            for (const layerName of targetLayers) {
+                const layer = this.layers.get(layerName);
+                if (!layer || !layer.enabled)
+                    continue;
+                const edges = layer.getEdges(current.id, 'both');
+                for (const edge of edges) {
+                    if (edge.weight < minWeight)
+                        continue;
+                    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);
+        // Resolve node IDs to GraphNode objects
+        const result = [];
+        for (const id of visited) {
+            const node = this.nodes.get(id);
+            if (node)
+                result.push(node);
+        }
+        return result;
+    }
+    pathBetween(fromId, toId, options) {
+        if (fromId === toId) {
+            const node = this.nodes.get(fromId);
+            if (!node)
+                return null;
+            return [];
+        }
+        const targetLayers = options?.layers ?? this.config.enabledLayers;
+        const visited = new Set();
+        const parent = new Map();
+        const queue = [fromId];
+        visited.add(fromId);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            for (const layerName of targetLayers) {
+                const layer = this.layers.get(layerName);
+                if (!layer || !layer.enabled)
+                    continue;
+                const edges = layer.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, {
+                            from: current,
+                            edge,
+                            layer: layerName,
+                        });
+                        if (neighborId === toId) {
+                            // Reconstruct path
+                            const path = [];
+                            let node = toId;
+                            while (parent.has(node)) {
+                                const p = parent.get(node);
+                                const graphNode = this.nodes.get(node);
+                                if (graphNode) {
+                                    path.unshift({
+                                        node: graphNode,
+                                        edge: p.edge,
+                                        layer: p.layer,
+                                    });
+                                }
+                                node = p.from;
+                            }
+                            return path;
+                        }
+                        queue.push(neighborId);
+                    }
+                }
+            }
+        }
+        return null;
+    }
+    filterNodes(filter) {
+        const results = [];
+        for (const node of this.nodes.values()) {
+            if (filter.type && node.type !== filter.type)
+                continue;
+            if (filter.minConfidence !== undefined &&
+                node.confidence < filter.minConfidence)
+                continue;
+            if (filter.domains &&
+                !filter.domains.some((d) => node.domains.includes(d)))
+                continue;
+            if (filter.entities &&
+                !filter.entities.some((e) => node.entities.includes(e)))
+                continue;
+            if (filter.tags && !filter.tags.some((t) => node.tags.includes(t)))
+                continue;
+            results.push(node);
+        }
+        return results;
+    }
+    crossSystemLinks(nodeId) {
+        const result = [];
+        for (const layer of this.layers.values()) {
+            if (!layer.enabled)
+                continue;
+            const edges = layer.getEdges(nodeId, 'both');
+            for (const edge of edges) {
+                if (edge.crossSystem)
+                    result.push(edge);
+            }
+        }
+        return result;
+    }
+    // === Rebuild ===
+    rebuildAll(notes) {
+        // Rebuild node registry
+        this.nodes.clear();
+        for (const note of notes) {
+            this.addNode(this.noteToGraphNode(note));
+        }
+        // Rebuild each enabled layer
+        for (const layer of this.layers.values()) {
+            if (layer.enabled) {
+                layer.rebuild(notes);
+            }
+        }
+    }
+    noteToGraphNode(note) {
+        return {
+            id: note.frontmatter.id,
+            file: note.filePath,
+            type: note.frontmatter.type,
+            domains: note.frontmatter.domain,
+            entities: note.frontmatter.entities,
+            tags: note.frontmatter.tags,
+            confidence: note.frontmatter.confidence,
+            updated: note.frontmatter.updated,
+        };
+    }
+    // === Persistence ===
+    async loadFromDisk(dir) {
+        try {
+            // Load nodes
+            const nodesPath = join(dir, 'nodes.json');
+            const nodesData = await readFile(nodesPath, 'utf-8');
+            const nodesObj = JSON.parse(nodesData);
+            this.nodes.clear();
+            for (const [id, node] of Object.entries(nodesObj)) {
+                this.nodes.set(id, node);
+            }
+            // Load each enabled layer
+            const layersDir = join(dir, 'layers');
+            for (const [name, layer] of this.layers.entries()) {
+                if (!layer.enabled)
+                    continue;
+                try {
+                    const layerPath = join(layersDir, `${name}.json`);
+                    const layerData = await readFile(layerPath, 'utf-8');
+                    const edges = JSON.parse(layerData);
+                    layer.clear();
+                    for (const edge of edges) {
+                        layer.addEdge(edge);
+                    }
+                }
+                catch {
+                    // Layer file doesn't exist yet — that's fine
+                }
+            }
+        }
+        catch {
+            // No graph data on disk yet — start fresh
+        }
+    }
+    async saveToDisk(dir) {
+        await mkdir(dir, { recursive: true });
+        const layersDir = join(dir, 'layers');
+        await mkdir(layersDir, { recursive: true });
+        // Save nodes
+        const nodesObj = {};
+        for (const [id, node] of this.nodes.entries()) {
+            nodesObj[id] = node;
+        }
+        await writeFile(join(dir, 'nodes.json'), JSON.stringify(nodesObj, null, 2));
+        // Save each enabled layer
+        for (const [name, layer] of this.layers.entries()) {
+            if (!layer.enabled)
+                continue;
+            const edges = layer.getAllEdges();
+            await writeFile(join(layersDir, `${name}.json`), JSON.stringify(edges, null, 2));
+        }
+    }
+    // === Stats ===
+    getStats() {
+        const edgeCountByLayer = {};
+        const enabledLayers = [];
+        for (const [name, layer] of this.layers.entries()) {
+            if (layer.enabled) {
+                enabledLayers.push(name);
+                edgeCountByLayer[name] = layer.edgeCount();
+            }
+        }
+        return {
+            nodeCount: this.nodes.size,
+            edgeCountByLayer,
+            enabledLayers,
+        };
+    }
+}
+//# sourceMappingURL=knowledge-graph.js.map

package/dist/memory/knowledge-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.js","sourceRoot":"","sources":["../../src/memory/knowledge-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAUjC,OAAO,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AAEnE,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,yBAAyB,CAAC;AAEjC;;;;;;GAMG;AACH,MAAM,OAAO,qBAAqB;IACxB,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IACrC,MAAM,GAAG,IAAI,GAAG,EAAwC,CAAC;IACzD,MAAM,CAAc;IAE5B,YAAY,MAA6B;QACvC,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,oBAAoB,EAAE,GAAG,MAAM,EAAE,CAAC;QACrD,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAEO,UAAU;QAChB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAEnD,IAAI,CAAC,MAAM,CAAC,GAAG,CACb,UAAU,EACV,IAAI,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAChD,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,GAAG,CACb,UAAU,EACV,IAAI,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAChD,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,gBAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,gBAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,uBAAuB;IAEvB,QAAQ,CAAC,IAAoB;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0BAA0B;IAE1B,OAAO,CAAC,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,UAAU,CAAC,MAAc;QACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,+BAA+B;QAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,8BAA8B;IAE9B,SAAS,CAAC,MAAc,EAAE,OAAyB;QACjD,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC;QAClC,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,CAAC,CAAC;QAC1C,MAAM,YAAY,GAAG,OAAO,EAAE,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAElE,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,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACzC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO;oBAAE,SAAS;gBAEvC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;gBACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,IAAI,CAAC,MAAM,GAAG,SAAS;wBAAE,SAAS;oBAEtC,MAAM,UAAU,GACd,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;oBACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;wBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAEvB,wCAAwC;QACxC,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,WAAW,CACT,MAAc,EACd,IAAY,EACZ,OAAuC;QAMvC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,YAAY,GAAG,OAAO,EAAE,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAElE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAGnB,CAAC;QACJ,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;YAE/B,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACzC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO;oBAAE,SAAS;gBAEvC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,UAAU,GACd,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;oBAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;wBACxB,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE;4BACrB,IAAI,EAAE,OAAO;4BACb,IAAI;4BACJ,KAAK,EAAE,SAAS;yBACjB,CAAC,CAAC;wBAEH,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;4BACxB,mBAAmB;4BACnB,MAAM,IAAI,GAIL,EAAE,CAAC;4BACR,IAAI,IAAI,GAAG,IAAI,CAAC;4BAChB,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gCACxB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;gCAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gCACvC,IAAI,SAAS,EAAE,CAAC;oCACd,IAAI,CAAC,OAAO,CAAC;wCACX,IAAI,EAAE,SAAS;wCACf,IAAI,EAAE,CAAC,CAAC,IAAI;wCACZ,KAAK,EAAE,CAAC,CAAC,KAAK;qCACf,CAAC,CAAC;gCACL,CAAC;gCACD,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;4BAChB,CAAC;4BACD,OAAO,IAAI,CAAC;wBACd,CAAC;wBAED,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,WAAW,CAAC,MAAuB;QACjC,MAAM,OAAO,GAAgB,EAAE,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;gBAAE,SAAS;YACvD,IACE,MAAM,CAAC,aAAa,KAAK,SAAS;gBAClC,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,aAAa;gBAEtC,SAAS;YACX,IACE,MAAM,CAAC,OAAO;gBACd,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAErD,SAAS;YACX,IACE,MAAM,CAAC,QAAQ;gBACf,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAEvD,SAAS;YACX,IAAI,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAChE,SAAS;YACX,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,gBAAgB,CAAC,MAAc;QAC7B,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,OAAO;gBAAE,SAAS;YAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,WAAW;oBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kBAAkB;IAElB,UAAU,CAAC,KAAsB;QAC/B,wBAAwB;QACxB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,IAAmB;QACzC,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE;YACvB,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI;YAC3B,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM;YAChC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,QAAQ;YACnC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI;YAC3B,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,UAAU;YACvC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO;SAClC,CAAC;IACJ,CAAC;IAED,sBAAsB;IAEtB,KAAK,CAAC,YAAY,CAAC,GAAW;QAC5B,IAAI,CAAC;YACH,aAAa;YACb,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;YAC1C,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAA8B,CAAC;YACpE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;YAED,0BAA0B;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACtC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,OAAO;oBAAE,SAAS;gBAE7B,IAAI,CAAC;oBACH,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,OAAO,CAAC,CAAC;oBAClD,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;oBACrD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAgB,CAAC;oBACnD,KAAK,CAAC,KAAK,EAAE,CAAC;oBACd,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;wBACzB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACtB,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,6CAA6C;gBAC/C,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0CAA0C;QAC5C,CAAC;IACH,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,GAAW;QAC1B,MAAM,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtC,MAAM,KAAK,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE5C,aAAa;QACb,MAAM,QAAQ,GAA8B,EAAE,CAAC;QAC/C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9C,QAAQ,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACtB,CAAC;QACD,MAAM,SAAS,CACb,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,EACvB,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAClC,CAAC;QAEF,0BAA0B;QAC1B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,KAAK,CAAC,OAAO;gBAAE,SAAS;YAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,MAAM,SAAS,CACb,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,OAAO,CAAC,EAC/B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAC/B,CAAC;QACJ,CAAC;IACH,CAAC;IAED,gBAAgB;IAEhB,QAAQ;QAKN,MAAM,gBAAgB,GAA2B,EAAE,CAAC;QACpD,MAAM,aAAa,GAAa,EAAE,CAAC;QAEnC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,gBAAgB,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC1B,gBAAgB;YAChB,aAAa;SACd,CAAC;IACJ,CAAC;CACF"}

package/dist/memory/search-provider.d.ts

@@ -0,0 +1,31 @@
+import type { KnowledgeNote } from '../types/knowledge.js';
+/**
+ * Result from a SearchProvider — maps a note ID to a relevance score.
+ */
+export interface SearchProviderResult {
+    noteId: string;
+    score: number;
+}
+/**
+ * Strategy interface for searching knowledge notes.
+ *
+ * Implementations receive pre-filtered candidate notes and return
+ * scored results. This allows swapping between text-based similarity
+ * (default) and external search backends (e.g., minimem).
+ */
+export interface SearchProvider {
+    /** Human-readable name for diagnostics / logging. */
+    readonly name: string;
+    /**
+     * Search pre-filtered candidates and return scored results.
+     *
+     * @param query      - The search query string.
+     * @param candidates - Pre-filtered KnowledgeNote array (already domain/stale-filtered).
+     * @param options    - Additional options like maxResults.
+     * @returns Scored results sorted by descending score.
+     */
+    search(query: string, candidates: KnowledgeNote[], options?: {
+        maxResults?: number;
+    }): SearchProviderResult[] | Promise<SearchProviderResult[]>;
+}
+//# sourceMappingURL=search-provider.d.ts.map

package/dist/memory/search-provider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-provider.d.ts","sourceRoot":"","sources":["../../src/memory/search-provider.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B,qDAAqD;IACrD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;;;;;;OAOG;IACH,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,aAAa,EAAE,EAC3B,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GAChC,oBAAoB,EAAE,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC;CAC7D"}

package/dist/memory/search-provider.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=search-provider.js.map

package/dist/memory/search-provider.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-provider.js","sourceRoot":"","sources":["../../src/memory/search-provider.ts"],"names":[],"mappings":""}

package/dist/memory/search-providers/index.d.ts

@@ -0,0 +1,3 @@
+export { TextSimilaritySearchProvider } from './text-similarity.js';
+export { MinimemSearchProvider, type MinimemSearchClient } from './minimem.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/memory/search-providers/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/memory/search-providers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,4BAA4B,EAAE,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,qBAAqB,EAAE,KAAK,mBAAmB,EAAE,MAAM,cAAc,CAAC"}

package/dist/memory/search-providers/index.js

@@ -0,0 +1,3 @@
+export { TextSimilaritySearchProvider } from './text-similarity.js';
+export { MinimemSearchProvider } from './minimem.js';
+//# sourceMappingURL=index.js.map

package/dist/memory/search-providers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/memory/search-providers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,4BAA4B,EAAE,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,qBAAqB,EAA4B,MAAM,cAAc,CAAC"}

package/dist/memory/search-providers/minimem.d.ts

@@ -0,0 +1,43 @@
+import type { KnowledgeNote } from '../../types/knowledge.js';
+import type { SearchProvider, SearchProviderResult } from '../search-provider.js';
+/**
+ * Subset of the minimem search API that MinimemSearchProvider depends on.
+ * Structurally compatible with the Minimem class from the minimem package.
+ *
+ * Kept as a narrow interface (rather than importing Minimem directly) so
+ * tests can inject a lightweight mock without instantiating a full Minimem.
+ */
+export interface MinimemSearchClient {
+    search(query: string, options?: {
+        maxResults?: number;
+        minScore?: number;
+    }): Promise<Array<{
+        path: string;
+        startLine: number;
+        endLine: number;
+        score: number;
+        snippet: string;
+    }>>;
+}
+/**
+ * Search provider that delegates to a minimem instance.
+ *
+ * Maps minimem search results (which return file paths) back to
+ * KnowledgeNote IDs by matching against the candidate set.
+ *
+ * Falls back to returning an empty array on any error so that
+ * the KnowledgeBank can gracefully degrade.
+ */
+export declare class MinimemSearchProvider implements SearchProvider {
+    private readonly client;
+    readonly name = "minimem";
+    constructor(client: MinimemSearchClient);
+    /**
+     * Async search via minimem client.
+     * Maps minimem results back to note IDs from the candidate set.
+     */
+    search(query: string, candidates: KnowledgeNote[], options?: {
+        maxResults?: number;
+    }): Promise<SearchProviderResult[]>;
+}
+//# sourceMappingURL=minimem.d.ts.map

package/dist/memory/search-providers/minimem.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimem.d.ts","sourceRoot":"","sources":["../../../src/memory/search-providers/minimem.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAElF;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IAClC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAClF,KAAK,CAAC;QACJ,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC,CACH,CAAC;CACH;AAED;;;;;;;;GAQG;AACH,qBAAa,qBAAsB,YAAW,cAAc;IAG9C,OAAO,CAAC,QAAQ,CAAC,MAAM;IAFnC,QAAQ,CAAC,IAAI,aAAa;gBAEG,MAAM,EAAE,mBAAmB;IAExD;;;OAGG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,aAAa,EAAE,EAC3B,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GAChC,OAAO,CAAC,oBAAoB,EAAE,CAAC;CAuCnC"}

package/dist/memory/search-providers/minimem.js

@@ -0,0 +1,56 @@
+/**
+ * Search provider that delegates to a minimem instance.
+ *
+ * Maps minimem search results (which return file paths) back to
+ * KnowledgeNote IDs by matching against the candidate set.
+ *
+ * Falls back to returning an empty array on any error so that
+ * the KnowledgeBank can gracefully degrade.
+ */
+export class MinimemSearchProvider {
+    client;
+    name = 'minimem';
+    constructor(client) {
+        this.client = client;
+    }
+    /**
+     * Async search via minimem client.
+     * Maps minimem results back to note IDs from the candidate set.
+     */
+    async search(query, candidates, options) {
+        try {
+            const maxResults = options?.maxResults ?? 10;
+            const minimemResults = await this.client.search(query, { maxResults });
+            // Build a lookup: normalize paths to match against candidate filePaths
+            const noteByPath = new Map();
+            for (const note of candidates) {
+                // Match on the full filePath or just the filename
+                noteByPath.set(note.filePath, note);
+                const filename = note.filePath.split('/').pop();
+                if (filename) {
+                    noteByPath.set(filename, note);
+                }
+            }
+            const results = [];
+            for (const mr of minimemResults) {
+                // Try matching by full path, then by filename portion
+                const pathParts = mr.path.split('/');
+                const filename = pathParts.pop();
+                const note = noteByPath.get(mr.path) ||
+                    (filename ? noteByPath.get(filename) : undefined);
+                if (note) {
+                    results.push({
+                        noteId: note.frontmatter.id,
+                        score: mr.score,
+                    });
+                }
+            }
+            return results;
+        }
+        catch {
+            // Gracefully degrade: return empty on any error
+            return [];
+        }
+    }
+}
+//# sourceMappingURL=minimem.js.map

package/dist/memory/search-providers/minimem.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimem.js","sourceRoot":"","sources":["../../../src/memory/search-providers/minimem.ts"],"names":[],"mappings":"AAsBA;;;;;;;;GAQG;AACH,MAAM,OAAO,qBAAqB;IAGH;IAFpB,IAAI,GAAG,SAAS,CAAC;IAE1B,YAA6B,MAA2B;QAA3B,WAAM,GAAN,MAAM,CAAqB;IAAG,CAAC;IAE5D;;;OAGG;IACH,KAAK,CAAC,MAAM,CACV,KAAa,EACb,UAA2B,EAC3B,OAAiC;QAEjC,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,EAAE,CAAC;YAC7C,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;YAEvE,uEAAuE;YACvE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;YACpD,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,kDAAkD;gBAClD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;gBAChD,IAAI,QAAQ,EAAE,CAAC;oBACb,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,MAAM,OAAO,GAA2B,EAAE,CAAC;YAC3C,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;gBAChC,sDAAsD;gBACtD,MAAM,SAAS,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACrC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBACjC,MAAM,IAAI,GACR,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;oBACvB,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAEpD,IAAI,IAAI,EAAE,CAAC;oBACT,OAAO,CAAC,IAAI,CAAC;wBACX,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE;wBAC3B,KAAK,EAAE,EAAE,CAAC,KAAK;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,OAAO,OAAO,CAAC;QACjB,CAAC;QAAC,MAAM,CAAC;YACP,gDAAgD;YAChD,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;CACF"}

package/dist/memory/search-providers/text-similarity.d.ts

@@ -0,0 +1,15 @@
+import type { KnowledgeNote } from '../../types/knowledge.js';
+import type { SearchProvider, SearchProviderResult } from '../search-provider.js';
+/**
+ * Default search provider using Jaccard + n-gram text similarity.
+ *
+ * This is the original search logic extracted from KnowledgeBank.search().
+ * Scores each candidate note against the query using `findTopK()`.
+ */
+export declare class TextSimilaritySearchProvider implements SearchProvider {
+    readonly name = "text-similarity";
+    search(query: string, candidates: KnowledgeNote[], options?: {
+        maxResults?: number;
+    }): SearchProviderResult[];
+}
+//# sourceMappingURL=text-similarity.d.ts.map

package/dist/memory/search-providers/text-similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-similarity.d.ts","sourceRoot":"","sources":["../../../src/memory/search-providers/text-similarity.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAGlF;;;;;GAKG;AACH,qBAAa,4BAA6B,YAAW,cAAc;IACjE,QAAQ,CAAC,IAAI,qBAAqB;IAElC,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,aAAa,EAAE,EAC3B,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GAChC,oBAAoB,EAAE;CAiB1B"}

package/dist/memory/search-providers/text-similarity.js

@@ -0,0 +1,21 @@
+import { findTopK } from '../../utils/similarity.js';
+/**
+ * Default search provider using Jaccard + n-gram text similarity.
+ *
+ * This is the original search logic extracted from KnowledgeBank.search().
+ * Scores each candidate note against the query using `findTopK()`.
+ */
+export class TextSimilaritySearchProvider {
+    name = 'text-similarity';
+    search(query, candidates, options) {
+        const maxResults = options?.maxResults ?? 10;
+        const results = findTopK(query, candidates, (note) => `${note.frontmatter.id} ${note.body}`, maxResults);
+        return results
+            .filter((r) => r.score > 0)
+            .map((r) => ({
+            noteId: r.item.frontmatter.id,
+            score: r.score,
+        }));
+    }
+}
+//# sourceMappingURL=text-similarity.js.map

package/dist/memory/search-providers/text-similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-similarity.js","sourceRoot":"","sources":["../../../src/memory/search-providers/text-similarity.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAErD;;;;;GAKG;AACH,MAAM,OAAO,4BAA4B;IAC9B,IAAI,GAAG,iBAAiB,CAAC;IAElC,MAAM,CACJ,KAAa,EACb,UAA2B,EAC3B,OAAiC;QAEjC,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,EAAE,CAAC;QAE7C,MAAM,OAAO,GAAG,QAAQ,CACtB,KAAK,EACL,UAAU,EACV,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,EAC/C,UAAU,CACX,CAAC;QAEF,OAAO,OAAO;aACX,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;aAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE;YAC7B,KAAK,EAAE,CAAC,CAAC,KAAK;SACf,CAAC,CAAC,CAAC;IACR,CAAC;CACF"}

package/dist/memory/skill-exporter.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Skill Exporter - Compile playbooks into the Open Agent Skills format
+ *
+ * Playbooks are the source of truth (rich, evolving, learned from experience).
+ * SKILL.md files are the compiled distribution artifact — portable across 25+
+ * agent platforms (Claude Code, Codex CLI, GitHub Copilot, Cursor, etc.).
+ *
+ * The export preserves playbook-specific knowledge (anti-patterns, refinements,
+ * verification) in the Markdown body, while mapping core fields to the standard
+ * YAML frontmatter schema.
+ */
+import type { Playbook } from '../types/index.js';
+import type { PlaybookLibrary } from './playbook.js';
+/**
+ * Options for filtering which playbooks to export
+ */
+export interface SkillExportFilter {
+    /** Minimum confidence to include (default: 0.5) */
+    minConfidence?: number;
+    /** Only include playbooks with at least this many total uses */
+    minUses?: number;
+    /** Only include playbooks from these domains */
+    domains?: string[];
+    /** Only include playbooks with these origins */
+    origins?: Array<'extracted' | 'curated' | 'imported' | 'manual'>;
+}
+/**
+ * Options for how the SKILL.md is generated
+ */
+export interface SkillExportOptions {
+    /** Include evolution stats (confidence, success rate) in metadata */
+    includeStats?: boolean;
+    /** Include refinements section in the body */
+    includeRefinements?: boolean;
+    /** Include anti-patterns as a "When NOT to use" section */
+    includeAntiPatterns?: boolean;
+    /** Include verification section */
+    includeVerification?: boolean;
+    /** Custom metadata fields to add to frontmatter */
+    extraMetadata?: Record<string, string>;
+}
+/**
+ * Result of an export operation
+ */
+export interface SkillExportResult {
+    exported: number;
+    skipped: number;
+    errors: Array<{
+        playbook: string;
+        error: string;
+    }>;
+    skills: ExportedSkill[];
+}
+/**
+ * A single exported skill (before writing to disk)
+ */
+export interface ExportedSkill {
+    name: string;
+    dirName: string;
+    content: string;
+    sourcePlaybookId: string;
+}
+/**
+ * Compile a single playbook into SKILL.md content
+ */
+export declare function compilePlaybookToSkill(playbook: Playbook, options?: SkillExportOptions): string;
+/**
+ * Export playbooks from a library to a directory of SKILL.md files
+ */
+export declare function exportPlaybooksAsSkills(library: PlaybookLibrary, outputDir: string, filter?: SkillExportFilter, options?: SkillExportOptions): Promise<SkillExportResult>;
+/**
+ * Export a single playbook to a SKILL.md file
+ */
+export declare function exportPlaybookAsSkill(playbook: Playbook, outputDir: string, options?: SkillExportOptions): Promise<ExportedSkill>;
+//# sourceMappingURL=skill-exporter.d.ts.map

package/dist/memory/skill-exporter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"skill-exporter.d.ts","sourceRoot":"","sources":["../../src/memory/skill-exporter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAElD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAErD;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,mDAAmD;IACnD,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,gEAAgE;IAChE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,gDAAgD;IAChD,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,gDAAgD;IAChD,OAAO,CAAC,EAAE,KAAK,CAAC,WAAW,GAAG,SAAS,GAAG,UAAU,GAAG,QAAQ,CAAC,CAAC;CAClE;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,qEAAqE;IACrE,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,8CAA8C;IAC9C,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,2DAA2D;IAC3D,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,mCAAmC;IACnC,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,mDAAmD;IACnD,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACxC;AAUD;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACnD,MAAM,EAAE,aAAa,EAAE,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,QAAQ,EAClB,OAAO,CAAC,EAAE,kBAAkB,GAC3B,MAAM,CAkJR;AAuBD;;GAEG;AACH,wBAAsB,uBAAuB,CAC3C,OAAO,EAAE,eAAe,EACxB,SAAS,EAAE,MAAM,EACjB,MAAM,CAAC,EAAE,iBAAiB,EAC1B,OAAO,CAAC,EAAE,kBAAkB,GAC3B,OAAO,CAAC,iBAAiB,CAAC,CAsE5B;AAED;;GAEG;AACH,wBAAsB,qBAAqB,CACzC,QAAQ,EAAE,QAAQ,EAClB,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE,kBAAkB,GAC3B,OAAO,CAAC,aAAa,CAAC,CAiBxB"}