pulseed 0.6.6 → 0.7.0

package/dist/platform/knowledge/knowledge-graph.d.ts

@@ -1,79 +0,0 @@
-import { type KnowledgeEdge } from "../../base/types/knowledge.js";
-import type { RuntimeControlDbStoreOptions } from "../../runtime/store/control-db/index.js";
-import { KnowledgeGraphNodeSchema, type KnowledgeGraphNode } from "./knowledge-graph-state-store.js";
-export { KnowledgeGraphNodeSchema, type KnowledgeGraphNode };
-export interface KnowledgeGraphOptions extends RuntimeControlDbStoreOptions {
-}
-export interface GraphData {
-    nodes: KnowledgeGraphNode[];
-    edges: KnowledgeEdge[];
-}
-/**
- * KnowledgeGraph stores cross-goal concept relationships as a directed graph.
- * Nodes represent KnowledgeEntry IDs; edges carry typed semantic relations.
- *
- * Persisted as typed control DB rows. Legacy JSON graph files are explicit
- * doctor/repair import inputs, not runtime fallback state.
- */
-export declare class KnowledgeGraph {
-    private nodes;
-    private edges;
-    private readonly stateStore;
-    constructor(legacyGraphFilePath: string, options?: KnowledgeGraphOptions);
-    /**
-     * Factory method: constructs a KnowledgeGraph and loads typed store data.
-     * The path argument is retained for compatibility; normal runtime does not read or write it.
-     */
-    static create(legacyGraphFilePath: string, options?: KnowledgeGraphOptions): Promise<KnowledgeGraph>;
-    static createForControlDb(baseDir: string, options?: KnowledgeGraphOptions): Promise<KnowledgeGraph>;
-    /**
-     * Add a node for a KnowledgeEntry. If a node with the same entry_id already
-     * exists, it is replaced (update semantics).
-     */
-    addNode(entryId: string, goalId: string, tags: string[]): Promise<void>;
-    /**
-     * Remove a node and all edges that reference it.
-     */
-    removeNode(entryId: string): Promise<void>;
-    getNode(entryId: string): KnowledgeGraphNode | undefined;
-    getAllNodes(): KnowledgeGraphNode[];
-    /**
-     * Add an edge. created_at is set automatically to the current timestamp.
-     * Duplicate edges (same from_id, to_id, relation) are replaced.
-     */
-    addEdge(edge: Omit<KnowledgeEdge, "created_at">): Promise<void>;
-    /**
-     * Remove all edges between fromId and toId (regardless of relation type).
-     */
-    removeEdge(fromId: string, toId: string): Promise<void>;
-    getEdgesFrom(entryId: string): KnowledgeEdge[];
-    getEdgesTo(entryId: string): KnowledgeEdge[];
-    getAllEdges(): KnowledgeEdge[];
-    /**
-     * Returns all nodes reachable from entryId via a single outgoing edge,
-     * paired with the connecting edge.
-     */
-    getRelated(entryId: string): {
-        node: KnowledgeGraphNode;
-        edge: KnowledgeEdge;
-    }[];
-    /**
-     * Returns all edges with relation = "contradicts".
-     */
-    getContradictions(): KnowledgeEdge[];
-    /**
-     * Detect all simple cycles in the directed graph.
-     * Returns an array of node-ID arrays, each representing one cycle.
-     * Uses DFS with a recursion stack.
-     */
-    detectCycles(): string[][];
-    get nodeCount(): number;
-    get edgeCount(): number;
-    _load(): Promise<void>;
-    close(): Promise<void>;
-    /**
-     * Remove all nodes and edges and persist the empty state.
-     */
-    clear(): Promise<void>;
-}
-//# sourceMappingURL=knowledge-graph.d.ts.map

package/dist/platform/knowledge/knowledge-graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-graph.d.ts","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-graph.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,aAAa,EAAuB,MAAM,+BAA+B,CAAC;AACxF,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,yCAAyC,CAAC;AAC5F,OAAO,EACL,wBAAwB,EAExB,KAAK,kBAAkB,EACxB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,EAAE,wBAAwB,EAAE,KAAK,kBAAkB,EAAE,CAAC;AAC7D,MAAM,WAAW,qBAAsB,SAAQ,4BAA4B;CAAG;AAC9E,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,kBAAkB,EAAE,CAAC;IAC5B,KAAK,EAAE,aAAa,EAAE,CAAC;CACxB;AAED;;;;;;GAMG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAA8C;IAC3D,OAAO,CAAC,KAAK,CAAuB;IACpC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA2B;gBAE1C,mBAAmB,EAAE,MAAM,EAAE,OAAO,GAAE,qBAA0B;IAK5E;;;OAGG;WACU,MAAM,CACjB,mBAAmB,EAAE,MAAM,EAC3B,OAAO,GAAE,qBAA0B,GAClC,OAAO,CAAC,cAAc,CAAC;WAMb,kBAAkB,CAC7B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,qBAA0B,GAClC,OAAO,CAAC,cAAc,CAAC;IAW1B;;;OAGG;IACG,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAY7E;;OAEG;IACG,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAShD,OAAO,CAAC,OAAO,EAAE,MAAM,GAAG,kBAAkB,GAAG,SAAS;IAIxD,WAAW,IAAI,kBAAkB,EAAE;IAMnC;;;OAGG;IACG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,YAAY,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAkBrE;;OAEG;IACG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAU7D,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa,EAAE;IAI9C,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa,EAAE;IAI5C,WAAW,IAAI,aAAa,EAAE;IAM9B;;;OAGG;IACH,UAAU,CACR,OAAO,EAAE,MAAM,GACd;QAAE,IAAI,EAAE,kBAAkB,CAAC;QAAC,IAAI,EAAE,aAAa,CAAA;KAAE,EAAE;IAYtD;;OAEG;IACH,iBAAiB,IAAI,aAAa,EAAE;IAMpC;;;;OAIG;IACH,YAAY,IAAI,MAAM,EAAE,EAAE;IAuC1B,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,IAAI,SAAS,IAAI,MAAM,CAEtB;IAIK,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAatB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAK7B"}

package/dist/platform/knowledge/knowledge-graph.js

@@ -1,198 +0,0 @@
-import * as path from "node:path";
-import { KnowledgeEdgeSchema } from "../../base/types/knowledge.js";
-import { KnowledgeGraphNodeSchema, KnowledgeGraphStateStore, } from "./knowledge-graph-state-store.js";
-export { KnowledgeGraphNodeSchema };
-/**
- * KnowledgeGraph stores cross-goal concept relationships as a directed graph.
- * Nodes represent KnowledgeEntry IDs; edges carry typed semantic relations.
- *
- * Persisted as typed control DB rows. Legacy JSON graph files are explicit
- * doctor/repair import inputs, not runtime fallback state.
- */
-export class KnowledgeGraph {
-    nodes = new Map();
-    edges = [];
-    stateStore;
-    constructor(legacyGraphFilePath, options = {}) {
-        const baseDir = options.controlBaseDir ?? path.dirname(legacyGraphFilePath);
-        this.stateStore = new KnowledgeGraphStateStore(baseDir, options);
-    }
-    /**
-     * Factory method: constructs a KnowledgeGraph and loads typed store data.
-     * The path argument is retained for compatibility; normal runtime does not read or write it.
-     */
-    static async create(legacyGraphFilePath, options = {}) {
-        const graph = new KnowledgeGraph(legacyGraphFilePath, options);
-        await graph._load();
-        return graph;
-    }
-    static async createForControlDb(baseDir, options = {}) {
-        const graph = new KnowledgeGraph(path.join(baseDir, "control.sqlite"), {
-            ...options,
-            controlBaseDir: options.controlBaseDir ?? baseDir,
-        });
-        await graph._load();
-        return graph;
-    }
-    // ─── Node CRUD ───
-    /**
-     * Add a node for a KnowledgeEntry. If a node with the same entry_id already
-     * exists, it is replaced (update semantics).
-     */
-    async addNode(entryId, goalId, tags) {
-        const node = {
-            entry_id: entryId,
-            goal_id: goalId,
-            tags: [...tags],
-            added_at: new Date().toISOString(),
-        };
-        const parsed = KnowledgeGraphNodeSchema.parse(node);
-        this.nodes.set(entryId, parsed);
-        await this.stateStore.saveNode(parsed);
-    }
-    /**
-     * Remove a node and all edges that reference it.
-     */
-    async removeNode(entryId) {
-        if (!this.nodes.has(entryId))
-            return;
-        this.nodes.delete(entryId);
-        this.edges = this.edges.filter((e) => e.from_id !== entryId && e.to_id !== entryId);
-        await this.stateStore.removeNode(entryId);
-    }
-    getNode(entryId) {
-        return this.nodes.get(entryId);
-    }
-    getAllNodes() {
-        return Array.from(this.nodes.values());
-    }
-    // ─── Edge CRUD ───
-    /**
-     * Add an edge. created_at is set automatically to the current timestamp.
-     * Duplicate edges (same from_id, to_id, relation) are replaced.
-     */
-    async addEdge(edge) {
-        // Remove existing edge with same from/to/relation to avoid duplicates
-        this.edges = this.edges.filter((e) => !(e.from_id === edge.from_id &&
-            e.to_id === edge.to_id &&
-            e.relation === edge.relation));
-        const full = KnowledgeEdgeSchema.parse({
-            ...edge,
-            created_at: new Date().toISOString(),
-        });
-        this.edges.push(full);
-        await this.stateStore.saveEdge(full);
-    }
-    /**
-     * Remove all edges between fromId and toId (regardless of relation type).
-     */
-    async removeEdge(fromId, toId) {
-        const before = this.edges.length;
-        this.edges = this.edges.filter((e) => !(e.from_id === fromId && e.to_id === toId));
-        if (this.edges.length !== before) {
-            await this.stateStore.removeEdgesBetween(fromId, toId);
-        }
-    }
-    getEdgesFrom(entryId) {
-        return this.edges.filter((e) => e.from_id === entryId);
-    }
-    getEdgesTo(entryId) {
-        return this.edges.filter((e) => e.to_id === entryId);
-    }
-    getAllEdges() {
-        return [...this.edges];
-    }
-    // ─── Queries ───
-    /**
-     * Returns all nodes reachable from entryId via a single outgoing edge,
-     * paired with the connecting edge.
-     */
-    getRelated(entryId) {
-        const outgoing = this.getEdgesFrom(entryId);
-        const result = [];
-        for (const edge of outgoing) {
-            const node = this.nodes.get(edge.to_id);
-            if (node) {
-                result.push({ node, edge });
-            }
-        }
-        return result;
-    }
-    /**
-     * Returns all edges with relation = "contradicts".
-     */
-    getContradictions() {
-        return this.edges.filter((e) => e.relation === "contradicts");
-    }
-    // ─── Cycle Detection (DFS) ───
-    /**
-     * Detect all simple cycles in the directed graph.
-     * Returns an array of node-ID arrays, each representing one cycle.
-     * Uses DFS with a recursion stack.
-     */
-    detectCycles() {
-        const visited = new Set();
-        const recStack = new Set();
-        const cycles = [];
-        const path = [];
-        const dfs = (nodeId) => {
-            visited.add(nodeId);
-            recStack.add(nodeId);
-            path.push(nodeId);
-            for (const edge of this.getEdgesFrom(nodeId)) {
-                const neighbor = edge.to_id;
-                if (!visited.has(neighbor)) {
-                    dfs(neighbor);
-                }
-                else if (recStack.has(neighbor)) {
-                    // Found a cycle: extract the cycle portion from path
-                    const cycleStart = path.indexOf(neighbor);
-                    if (cycleStart !== -1) {
-                        cycles.push([...path.slice(cycleStart), neighbor]);
-                    }
-                }
-            }
-            path.pop();
-            recStack.delete(nodeId);
-        };
-        for (const nodeId of this.nodes.keys()) {
-            if (!visited.has(nodeId)) {
-                dfs(nodeId);
-            }
-        }
-        return cycles;
-    }
-    // ─── Stats ───
-    get nodeCount() {
-        return this.nodes.size;
-    }
-    get edgeCount() {
-        return this.edges.length;
-    }
-    // ─── Persistence ───
-    async _load() {
-        this.nodes.clear();
-        this.edges = [];
-        try {
-            for (const node of await this.stateStore.listNodes()) {
-                this.nodes.set(node.entry_id, node);
-            }
-            this.edges = await this.stateStore.listEdges();
-        }
-        catch {
-            // Corrupt typed rows or unavailable store: start with an empty in-memory graph.
-        }
-    }
-    async close() {
-        await this.stateStore.close();
-    }
-    /**
-     * Remove all nodes and edges and persist the empty state.
-     */
-    async clear() {
-        this.nodes.clear();
-        this.edges = [];
-        await this.stateStore.clear();
-    }
-}
-//# sourceMappingURL=knowledge-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-graph.js","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAsB,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AAExF,OAAO,EACL,wBAAwB,EACxB,wBAAwB,GAEzB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,EAAE,wBAAwB,EAA2B,CAAC;AAO7D;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IACjB,KAAK,GAAoC,IAAI,GAAG,EAAE,CAAC;IACnD,KAAK,GAAoB,EAAE,CAAC;IACnB,UAAU,CAA2B;IAEtD,YAAY,mBAA2B,EAAE,UAAiC,EAAE;QAC1E,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,IAAI,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;QAC5E,IAAI,CAAC,UAAU,GAAG,IAAI,wBAAwB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACnE,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAC,MAAM,CACjB,mBAA2B,EAC3B,UAAiC,EAAE;QAEnC,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,mBAAmB,EAAE,OAAO,CAAC,CAAC;QAC/D,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;QACpB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAC7B,OAAe,EACf,UAAiC,EAAE;QAEnC,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,EAAE;YACrE,GAAG,OAAO;YACV,cAAc,EAAE,OAAO,CAAC,cAAc,IAAI,OAAO;SAClD,CAAC,CAAC;QACH,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;QACpB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,oBAAoB;IAEpB;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,OAAe,EAAE,MAAc,EAAE,IAAc;QAC3D,MAAM,IAAI,GAAuB;YAC/B,QAAQ,EAAE,OAAO;YACjB,OAAO,EAAE,MAAM;YACf,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;YACf,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACnC,CAAC;QACF,MAAM,MAAM,GAAG,wBAAwB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAChC,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,OAAe;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO;QACrC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO,CACpD,CAAC;QACF,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,CAAC,OAAe;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAED,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,oBAAoB;IAEpB;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,IAAuC;QACnD,sEAAsE;QACtE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CACC,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO;YAC1B,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK;YACtB,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAC7B,CACJ,CAAC;QACF,MAAM,IAAI,GAAG,mBAAmB,CAAC,KAAK,CAAC;YACrC,GAAG,IAAI;YACP,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,MAAc,EAAE,IAAY;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,CACnD,CAAC;QACF,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YACjC,MAAM,IAAI,CAAC,UAAU,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED,YAAY,CAAC,OAAe;QAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IACzD,CAAC;IAED,UAAU,CAAC,OAAe;QACxB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC;IACvD,CAAC;IAED,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,kBAAkB;IAElB;;;OAGG;IACH,UAAU,CACR,OAAe;QAEf,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAwD,EAAE,CAAC;QACvE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,aAAa,CAAC,CAAC;IAChE,CAAC;IAED,gCAAgC;IAEhC;;;;OAIG;IACH,YAAY;QACV,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,MAAM,GAAG,GAAG,CAAC,MAAc,EAAQ,EAAE;YACnC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAElB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChB,CAAC;qBAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAClC,qDAAqD;oBACrD,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAC1C,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;wBACtB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;oBACrD,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,GAAG,CAAC,MAAM,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,gBAAgB;IAEhB,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,sBAAsB;IAEtB,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC;YACH,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;gBACrD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YACtC,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC;QACjD,CAAC;QAAC,MAAM,CAAC;YACP,gFAAgF;QAClF,CAAC;IACH,CAAC;IAED,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAChC,CAAC;CACF"}

package/dist/platform/knowledge/knowledge-manager-agent-memory.d.ts

@@ -1,103 +0,0 @@
-import type { ILLMClient } from "../../base/llm/llm-client.js";
-import { type MemoryCorrectionEntry, type MemoryCorrectionKind, type MemoryCorrectionTargetRef } from "../corrections/memory-correction-ledger.js";
-import { type MemoryQuarantineState } from "../corrections/memory-quarantine.js";
-import type { MemoryProvenance, MemoryVerificationStatus } from "../corrections/memory-quarantine.js";
-import { type MemoryGovernanceInput, type MemorySensitivity } from "../corrections/memory-governance.js";
-import type { AgentMemoryEntry, AgentMemoryStore, AgentMemoryType } from "./types/agent-memory.js";
-import type { IEmbeddingClient } from "./embedding-client.js";
-export interface AgentMemoryHost {
-    llmClient: ILLMClient;
-    embeddingClient?: IEmbeddingClient;
-    loadAgentMemoryStore(): Promise<AgentMemoryStore>;
-    saveAgentMemoryStore(store: AgentMemoryStore): Promise<void>;
-}
-export declare function saveAgentMemoryEntry(host: AgentMemoryHost, entry: {
-    key: string;
-    value: string;
-    tags?: string[];
-    category?: string;
-    memory_type?: AgentMemoryType;
-    verification_status?: MemoryVerificationStatus;
-    provenance?: MemoryProvenance;
-    governance?: MemoryGovernanceInput;
-}): Promise<AgentMemoryEntry>;
-export declare function recallAgentMemoryEntries(host: AgentMemoryHost, query: string, opts?: {
-    exact?: boolean;
-    category?: string;
-    memory_type?: AgentMemoryType;
-    limit?: number;
-    include_archived?: boolean;
-    semantic?: boolean;
-    consent_scope?: string;
-    max_sensitivity?: MemorySensitivity;
-}): Promise<AgentMemoryEntry[]>;
-export declare function listAgentMemoryEntries(host: AgentMemoryHost, opts?: {
-    category?: string;
-    memory_type?: AgentMemoryType;
-    limit?: number;
-    include_archived?: boolean;
-    consent_scope?: string;
-    max_sensitivity?: MemorySensitivity;
-}): Promise<AgentMemoryEntry[]>;
-export declare function deleteAgentMemoryEntry(host: AgentMemoryHost, key: string): Promise<boolean>;
-export interface AgentMemoryQuarantineInput {
-    targetIds: string[];
-    reason: string;
-    source?: MemoryQuarantineState["source"];
-    confidence: number;
-    inspectionRefs: string[];
-    createdAt?: string;
-}
-export declare function quarantineAgentMemoryEntries(host: AgentMemoryHost, input: AgentMemoryQuarantineInput): Promise<number>;
-export interface AgentMemoryCorrectionInput {
-    targetId: string;
-    correctionKind: Extract<MemoryCorrectionKind, "corrected" | "forgotten" | "retracted">;
-    reason: string;
-    replacementValue?: string;
-    replacementKey?: string;
-    actor?: MemoryCorrectionEntry["actor"];
-    createdAt?: string;
-    provenanceRef?: string;
-}
-export interface AgentMemoryCorrectionResult {
-    correction: MemoryCorrectionEntry;
-    target: AgentMemoryEntry;
-    replacement: AgentMemoryEntry | null;
-}
-export declare function applyAgentMemoryCorrection(host: AgentMemoryHost, input: AgentMemoryCorrectionInput): Promise<AgentMemoryCorrectionResult>;
-export declare function listAgentMemoryCorrectionHistory(host: AgentMemoryHost, target?: MemoryCorrectionTargetRef): Promise<MemoryCorrectionEntry[]>;
-export declare function exportAgentMemoryGovernance(host: AgentMemoryHost, opts?: {
-    consent_scope?: string;
-    include_secret?: boolean;
-}): Promise<Array<{
-    id: string;
-    key: string;
-    summary: string | null;
-    status: AgentMemoryEntry["status"];
-    governance: AgentMemoryEntry["governance"];
-    provenance: AgentMemoryEntry["provenance"] | null;
-}>>;
-export declare function consolidateAgentMemoryEntries(host: AgentMemoryHost, opts: {
-    category?: string;
-    memory_type?: AgentMemoryType;
-    max_entries?: number;
-    llmCall: (prompt: string) => Promise<string>;
-}): Promise<{
-    compiled: AgentMemoryEntry[];
-    archived: number;
-}>;
-export declare function archiveAgentMemoryEntries(host: AgentMemoryHost, ids: string[]): Promise<number>;
-export declare function getAgentMemoryStatsForHost(host: AgentMemoryHost): Promise<{
-    raw: number;
-    compiled: number;
-    archived: number;
-    total: number;
-}>;
-export declare function autoConsolidateAgentMemory(host: AgentMemoryHost, opts?: {
-    rawThreshold?: number;
-}): Promise<{
-    consolidated: boolean;
-    compiled?: number;
-    archived?: number;
-}>;
-//# sourceMappingURL=knowledge-manager-agent-memory.d.ts.map

package/dist/platform/knowledge/knowledge-manager-agent-memory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-manager-agent-memory.d.ts","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager-agent-memory.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAKL,KAAK,qBAAqB,EAE1B,KAAK,oBAAoB,EACzB,KAAK,yBAAyB,EAC/B,MAAM,4CAA4C,CAAC;AACpD,OAAO,EAA+B,KAAK,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAC9G,OAAO,KAAK,EAAE,gBAAgB,EAAE,wBAAwB,EAAE,MAAM,qCAAqC,CAAC;AACtG,OAAO,EAIL,KAAK,qBAAqB,EAC1B,KAAK,iBAAiB,EACvB,MAAM,qCAAqC,CAAC;AAI7C,OAAO,KAAK,EAAE,gBAAgB,EAAqB,gBAAgB,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAEtH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAE9D,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,UAAU,CAAC;IACtB,eAAe,CAAC,EAAE,gBAAgB,CAAC;IACnC,oBAAoB,IAAI,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAClD,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC9D;AAeD,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,eAAe,EACrB,KAAK,EAAE;IACL,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,eAAe,CAAC;IAC9B,mBAAmB,CAAC,EAAE,wBAAwB,CAAC;IAC/C,UAAU,CAAC,EAAE,gBAAgB,CAAC;IAC9B,UAAU,CAAC,EAAE,qBAAqB,CAAC;CACpC,GACA,OAAO,CAAC,gBAAgB,CAAC,CAwC3B;AAED,wBAAsB,wBAAwB,CAC5C,IAAI,EAAE,eAAe,EACrB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE;IACL,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,eAAe,CAAC;IAC9B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,eAAe,CAAC,EAAE,iBAAiB,CAAC;CACrC,GACA,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAmD7B;AAED,wBAAsB,sBAAsB,CAC1C,IAAI,EAAE,eAAe,EACrB,IAAI,CAAC,EAAE;IACL,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,eAAe,CAAC;IAC9B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,eAAe,CAAC,EAAE,iBAAiB,CAAC;CACrC,GACA,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAe7B;AAED,wBAAsB,sBAAsB,CAAC,IAAI,EAAE,eAAe,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAOjG;AAED,MAAM,WAAW,0BAA0B;IACzC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IACzC,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,wBAAsB,4BAA4B,CAChD,IAAI,EAAE,eAAe,EACrB,KAAK,EAAE,0BAA0B,GAChC,OAAO,CAAC,MAAM,CAAC,CA6BjB;AAED,MAAM,WAAW,0BAA0B;IACzC,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,OAAO,CAAC,oBAAoB,EAAE,WAAW,GAAG,WAAW,GAAG,WAAW,CAAC,CAAC;IACvF,MAAM,EAAE,MAAM,CAAC;IACf,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,KAAK,CAAC,EAAE,qBAAqB,CAAC,OAAO,CAAC,CAAC;IACvC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,2BAA2B;IAC1C,UAAU,EAAE,qBAAqB,CAAC;IAClC,MAAM,EAAE,gBAAgB,CAAC;IACzB,WAAW,EAAE,gBAAgB,GAAG,IAAI,CAAC;CACtC;AAoBD,wBAAsB,0BAA0B,CAC9C,IAAI,EAAE,eAAe,EACrB,KAAK,EAAE,0BAA0B,GAChC,OAAO,CAAC,2BAA2B,CAAC,CA0DtC;AAED,wBAAsB,gCAAgC,CACpD,IAAI,EAAE,eAAe,EACrB,MAAM,CAAC,EAAE,yBAAyB,GACjC,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAMlC;AAED,wBAAsB,2BAA2B,CAC/C,IAAI,EAAE,eAAe,EACrB,IAAI,CAAC,EAAE;IACL,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B,GACA,OAAO,CAAC,KAAK,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,MAAM,EAAE,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACnC,UAAU,EAAE,gBAAgB,CAAC,YAAY,CAAC,CAAC;IAC3C,UAAU,EAAE,gBAAgB,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC;CACnD,CAAC,CAAC,CAiBF;AAED,wBAAsB,6BAA6B,CACjD,IAAI,EAAE,eAAe,EACrB,IAAI,EAAE;IACJ,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,eAAe,CAAC;IAC9B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;CAC9C,GACA,OAAO,CAAC;IAAE,QAAQ,EAAE,gBAAgB,EAAE,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,CA+F7D;AAED,wBAAsB,yBAAyB,CAAC,IAAI,EAAE,eAAe,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAkBrG;AAED,wBAAsB,0BAA0B,CAAC,IAAI,EAAE,eAAe,GAAG,OAAO,CAAC;IAC/E,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;CACf,CAAC,CASD;AAED,wBAAsB,0BAA0B,CAC9C,IAAI,EAAE,eAAe,EACrB,IAAI,CAAC,EAAE;IAAE,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAC/B,OAAO,CAAC;IAAE,YAAY,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,CAa1E"}